blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 2 247 | content_id stringlengths 40 40 | detected_licenses listlengths 0 57 | license_type stringclasses 2
values | repo_name stringlengths 4 111 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringlengths 4 58 | visit_date timestamp[ns]date 2015-07-25 18:16:41 2023-09-06 10:45:08 | revision_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | committer_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | github_id int64 3.89k 689M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 25
values | gha_event_created_at timestamp[ns]date 2012-06-07 00:51:45 2023-09-14 21:58:52 ⌀ | gha_created_at timestamp[ns]date 2008-03-27 23:40:48 2023-08-24 19:49:39 ⌀ | gha_language stringclasses 159
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 7 10.5M | extension stringclasses 111
values | filename stringlengths 1 195 | text stringlengths 7 10.5M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e554fbe09ba83c914050323574ba2c37d9cc2781 | 4015ee4fb44f0af7d78c37d65d8cd2dbbe384cdb | /sources/Client.cpp | d803bdd3875623bab8e184fa17b44ddbeb0365dd | [
"MIT"
] | permissive | DmitryKersh/3-sem-lab-08-asio-client | b3d1fbd125bdb93763e8496bf05d2bbd95597da2 | 5c149066e808b34fcb613dbbed1b913bbbf4fd72 | refs/heads/master | 2023-02-22T11:25:18.632499 | 2021-01-20T23:08:06 | 2021-01-20T23:08:06 | 328,351,286 | 0 | 0 | MIT | 2021-01-20T23:08:07 | 2021-01-10T09:58:43 | CMake | UTF-8 | C++ | false | false | 1,351 | cpp | Client.cpp | // Copyright 2020 Your Name <your_email>
#include <Client.hpp>
#include <utility>
Client::Client(asio::io_service& service, const tcp::endpoint& endpoint,
std::string username)
: socket_(service), username_(std::move(username)) {
socket_.connect(endpoint);
reset_delay();
}
void Client::login(er... |
58d7d05db8a221d1f4a1cca6edc5ce425a58589a | 52d7e95636747326b01905e2c0a7c719c771cecb | /DynamicProgramming/ugly-numbers.cc | 3f6f8ed4f402c6236451aaa6feea00391d65ef21 | [] | no_license | sdecoder/geeksforgeeks | 855aea5c8fad17e3627d5c7770b421ee913062c6 | 75137c187d09ed17225078d3efc0a775097b8f2c | refs/heads/master | 2021-01-22T14:39:50.490466 | 2016-02-22T12:05:58 | 2016-02-22T12:05:58 | 68,490,550 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,757 | cc | ugly-numbers.cc |
/*
Ugly Numbers
Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, …
shows the first 11 ugly numbers. By convention, 1 is included.
Write a program to find and print the 150’th ugly number.*/
#include <stdio.h>
#include <stdlib.h>
#define bool int... |
c20c5349dee48a1dd77505c0f61116d90a97c81b | 7effc136d8b3fd6abd1c214662199629dc405a5c | /main.cpp | eaa767ec9af3e01db9677716f79253b278f5ebe1 | [] | no_license | Haven-Lau/CS_GO_RadarTrigger_Hack | 3e144b2eafaf43b1f0ad75d3409135f128906833 | 968a80a4b20f5c76266d18f658250f2d38749686 | refs/heads/master | 2020-12-25T14:08:52.200473 | 2015-08-28T00:11:24 | 2015-08-28T00:11:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,641 | cpp | main.cpp | #include <iostream>
#include "Engine.h"
#include "Settings.h"
#include "Radar.h"
#include "Triggerbot.h"
[junk_enable /]
[enc_string_enable /]
int whichKeyIsPressed() {
while (true) {
for (int i = 1; i < 255; i++) {
if (GetAsyncKeyState(i) & 0x8000) {
Sleep(250);
return i;
}
}
Sleep(10);
}
}
i... |
ede458921053953f28ad878d767ec77c720fab21 | ae0693c4915b0f71adeab465d444d6bb6bf5c7ab | /src/enable_variable_ops/ngraph_catalog.cc | ef1801828d397de31c2e41ea164479e5935244ef | [
"Apache-2.0"
] | permissive | kkasravi/ngraph-bridge | 249f7a845ca5e3e187576bb322cd23caab9782c9 | 7dcf752e966a9dfe64561568fbc80d86d80868ec | refs/heads/master | 2020-06-02T13:44:46.688301 | 2019-06-18T06:33:36 | 2019-06-18T06:33:36 | 191,175,201 | 0 | 0 | Apache-2.0 | 2019-06-10T13:39:16 | 2019-06-10T13:39:15 | null | UTF-8 | C++ | false | false | 4,343 | cc | ngraph_catalog.cc | /*******************************************************************************
* Copyright 2019 Intel Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.a... |
5fca41213d1ae69f8ca0fd785127a58431f5f5b7 | 7ec75f987f54d30276b915d9abcaab3b82f7bdb3 | /src/Managers/TextureManager.h | 671d2d2700ec4ca5f1327207c85b33be0e8393db | [] | no_license | RyanSwann1/Snake---Uni-Work | a3f20b33cb435f32590e33234fb8402df7603a90 | a7be655cc8b0339d38ac32566cc9f8a98995669f | refs/heads/master | 2020-03-07T15:44:53.088229 | 2018-04-26T08:56:07 | 2018-04-26T08:56:07 | 127,563,624 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 699 | h | TextureManager.h | #pragma once
#include <Managers\ResourceManager.h>
#include <Locators\TextureManagerLocator.h>
#include <SFML\Graphics.hpp>
class TextureManager : public ResourceManager<sf::Texture>
{
public:
TextureManager()
{
TextureManagerLocator::provide(*this);
}
TextureManager(const TextureManager&) = delete;
TextureMan... |
86cfd69dfb4597e9f86b2c343499734d9447ea5f | dcbe05a9efd9166e65b5b3be4106cb65101e2812 | /Classes/Unit_2.h | 0292af981f17940cfd48fdc4690a9fea433d20b0 | [] | no_license | KwMOA/moa-client | 152e4a93bf7053d3c212e2ebb765693ef396125e | ad61517ce6047c797e9813983dbc99e379c55736 | refs/heads/master | 2021-01-18T17:56:01.689708 | 2016-12-15T18:15:15 | 2016-12-15T18:15:15 | 68,498,524 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 383 | h | Unit_2.h | //
// Unit_2.h
// moaClient
//
// Created by kimyongchan on 2016. 9. 25..
// Copyright © 2016년 kimyongchan. All rights reserved.
//
#ifndef Unit_2_h
#define Unit_2_h
#include <stdio.h>
#include "Unit.h"
class Unit_2 : public Unit {
public:
Unit_2(GamePlayer* _gamePlayer);
~Unit_2() {};
void click();
... |
fcc1f936f512a824024b1d85deb599b0d09c8960 | 495a67c9ef31ba300d25a600994eba3188317a95 | /E 115/HW 2 - Math Calculator/ConsoleApplication1/Source.cpp | 9aae4cc32ae2b34d1e8fc95e72c7e44bb9e86523 | [] | no_license | sbertussi/coding_portfolio | 5bb03e993019c5b1aa9eb8cb66159d3d4fa1763c | bfcb3597d42960154f3c86cb5fa5597eacb9c36a | refs/heads/master | 2021-01-01T04:24:20.026328 | 2017-07-18T18:18:10 | 2017-07-18T18:18:10 | 97,172,066 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,041 | cpp | Source.cpp | //Sarah Bertussi
//LL
#include<iostream>
#include<string>
using namespace std;
int main()
{
float number1;
float number2;
string operation;
float answer;
int hold;
cout << "Welcome to the Amazing Calculator!" << endl;
cout << "I am able to do the four basic functions and positive integer powers... |
241b1b690bd59fba5f54e06039b758f6dc6cf96c | c3147a539c3bad6d24105df990146e9bffcae1a5 | /leetcode/347.top-k-frequent-elements.cpp | 990f12e53cf58758701d8c52c04197fdf812dd56 | [] | no_license | eataix/algorithms | 6158a93d02d53be4940d7d2db09393915081b267 | 6c61a6ae52707ac6f8a01bfc9344ca48be9736f8 | refs/heads/master | 2021-03-22T00:21:23.926258 | 2018-10-20T05:07:55 | 2018-10-20T05:57:53 | 19,340,004 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,187 | cpp | 347.top-k-frequent-elements.cpp | #include <unordered_map>
#include <vector>
using namespace std;
/*
* [347] Top K Frequent Elements
*
* https://leetcode.com/problems/top-k-frequent-elements/description/
*
* algorithms
* Medium (49.65%)
* Total Accepted: 103.6K
* Total Submissions: 208.7K
* Testcase Example: '[1,1,1,2,2,3]\n2'
*
*
* Giv... |
03323dd35c7030ffb58e0e2c6dc1d5a0268301a3 | a800feca39db1fee87e92e73b3174ae7f4f45feb | /Hashmap-and-Heap/keyboard-row.cpp | 6849ce8af9d137549fac6d546db30ae6457abc3b | [] | no_license | manmeet0307/Pepcoding-IP | b0c057af1e36a5259accf53bd630ad9812f7bd81 | 322e761e92818b593d88494a06238f190f871547 | refs/heads/master | 2022-02-18T12:29:33.506662 | 2019-08-11T09:43:55 | 2019-08-11T09:43:55 | 256,763,022 | 1 | 1 | null | 2020-04-18T13:39:57 | 2020-04-18T13:39:57 | null | UTF-8 | C++ | false | false | 1,312 | cpp | keyboard-row.cpp | #include<iostream>
#include<vector>
#include<string>
#include<bits/stdc++.h>
using namespace std;
bool checkrow(string s)
{
unordered_map<char,int> m ;
m['q'] = 1;
m['w'] = 1;
m['e'] = 1;
m['r'] = 1;
m['t'] = 1;
m['y'] = 1;
m['u'] = 1;
m['i'] = 1;
m['o'] = 1;
... |
8f9b4d601d63b7340c012fc631a28193f1e7b341 | 681cb2db6412f8260c65141b66332d4bd00c2dc4 | /02_openmp/13_merge_sort.cpp | 7d053dcfa42185bbeba140f2cbae71393f35dde9 | [] | no_license | amamama/hpc_lecture | 0d8071e1eef215b4be9e1c33537272b709d71273 | 55319d583cf16ca1a65797ce128ac783aa23f0c7 | refs/heads/master | 2023-04-04T10:05:54.284362 | 2021-04-21T16:12:22 | 2021-04-21T16:12:22 | 358,093,328 | 0 | 0 | null | 2021-04-15T01:42:30 | 2021-04-15T01:42:29 | null | UTF-8 | C++ | false | false | 2,091 | cpp | 13_merge_sort.cpp | #include <cstdio>
#include <cstdlib>
#include <vector>
template<class T>
void merge_ser(std::vector<T>& vec, int begin, int mid, int end) {
std::vector<T> tmp(end-begin+1);
int left = begin;
int right = mid+1;
for (int i=0; i<tmp.size(); i++) {
if (left > mid)
tmp[i] = vec[right++];
else if (rig... |
4482ac17eec0853eea65decb1e5efbd40a3089b0 | d195abfd2e3cb3f11d4c1df4fc1676762f904d07 | /moveit_ros/visualization/rviz_plugin_render_tools/src/trajectory_visualization.cpp | 9b9f2deafd9f83cbbe4199603b821b3c066b6838 | [
"BSD-3-Clause"
] | permissive | ros-planning/moveit | 146a5c2648dd27d7bf4fc45ff2ceb90beca14f8a | 1730d7b392a072bafaab37e6e3bb8ed11e58047e | refs/heads/master | 2023-09-04T03:39:21.644592 | 2023-08-06T09:03:04 | 2023-08-06T09:03:04 | 64,340,188 | 1,499 | 1,117 | BSD-3-Clause | 2023-09-09T11:20:46 | 2016-07-27T20:38:09 | C++ | UTF-8 | C++ | false | false | 24,204 | cpp | trajectory_visualization.cpp | /*********************************************************************
* Software License Agreement (BSD License)
*
* Copyright (c) 2008, Willow Garage, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following... |
33d16efac162c5cb42cc8e94e13a277762f714e3 | e254dd9708e52f331404315cfca2ba6a23779f4f | /src/transsearcher.hpp | bbdd3b77ed9d94f8c8ba4159ab73323d9306a8b7 | [] | no_license | rocpengliu/Seq2Fun-1 | 08d0213cd8b6c2ee40384f8965683ce2b3bbdff5 | 2a5e5471086ad2c67d993ceafcd777671cbb5f8c | refs/heads/master | 2023-07-15T20:15:04.352392 | 2021-08-24T02:20:21 | 2021-08-24T02:20:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,799 | hpp | transsearcher.hpp | #ifndef TRANSSEARCHER_HPP
#define TRANSSEARCHER_HPP
#include <stdint.h>
#include <assert.h>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <list>
#include <cmath>
#include <algorithm>
#include <mutex>
#include <iostream>
#include <sstream>
#include <vector>
#include <iterator>
#include <stri... |
2885a1e9b939e77920208f4bb390f5ce1a3981c6 | d6e0dfa56ffc81d8824142fba51da7f3272a6861 | /Dynamic Programming/wineProblemWithDpBottomUp.cpp | 371a4229f8efe078fdb3cfd648264c61b3603b14 | [] | no_license | kanishkgautam98/Competitive-Coding | c79b491530219de6c3ac959deae5db2335540273 | ec42166d132d01e3abd38d20109239799048341d | refs/heads/master | 2023-01-18T17:42:11.251210 | 2020-11-21T16:44:33 | 2020-11-21T16:44:33 | 164,913,015 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,015 | cpp | wineProblemWithDpBottomUp.cpp | #include<bits/stdc++.h>
using namespace std;
//Code may not work
int maxprofit(int *a, int n) {
int **dp = new int *[n];
for (int i = 0; i < n; i++) {
dp[i] = new int[n];
fill(dp[i], dp[i] + n, -1);
}
int year = n;
for (int i = 0; i < n; i++) {
dp[i][i] = n * a[i];
}... |
220656223c4271062386a7a3c9da574967af1c7a | 73266ea6be2de149a4700798b221bd4c79525604 | /ft_containers/demo/map_demo.cpp | 573f7c4874235a91ba8bf89b78664803f9b090cb | [] | no_license | Caceresenzo/42 | de90b0262b573d4056102ad04ed0f6fbef169858 | df1e14c019994202da0abbe221455f1a6ee291e4 | refs/heads/master | 2023-08-15T06:14:08.625075 | 2023-08-13T17:19:00 | 2023-08-13T17:19:00 | 220,007,175 | 92 | 36 | null | null | null | null | UTF-8 | C++ | false | false | 1,683 | cpp | map_demo.cpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* map_demo.cpp :+: :+: :+: ... |
3d4d8af016a503c995ba5f1d223e430d4d2913e5 | e27e425849b34ca7c0ea5aa0449803ffc63fda89 | /HW1/hwCalc.cpp | da42b172c9c7e84b01fae67c802630815eff508a | [] | no_license | BaturinaYl/C-C-Qt-course | d5102405f8373a76517e759488f3890d7bac7d57 | ed0c777e9c6c69f0db51ac1a5a606bf1e743b4d3 | refs/heads/master | 2020-05-16T05:30:09.442194 | 2019-06-21T11:44:17 | 2019-06-21T11:44:17 | 182,816,171 | 0 | 0 | null | 2019-04-22T15:30:58 | 2019-04-22T15:30:57 | null | UTF-8 | C++ | false | false | 758 | cpp | hwCalc.cpp | //Homework #1
//Baturina Yelena
// simple calculater
#include <iostream>
using namespace std;
int main()
{
float a,b,result;
int prizn =1;
char deistv;
do
{
cout<<"\n Введите число А , знак операции, число В:";
cin>>a>>deistv>>b;
} while ((b==0) && ((deistv=='/') || (deistv ==':')));
switch (deistv)
... |
5b7906eb53068d3b91ef11227427d772f6cab2fd | 03e126c39fd41c84deb5336946e9184663ec4b40 | /AlMath/include/Jasper/PhysicsWorld.h | 72e14dc6463c866d29784093e3fa1516c714fc4e | [] | no_license | SoulDoubt/Jasper | 3f0334f449d723e371a40a270f2f24304358c0b8 | 20d7ddc3dc347218fc49c837bfbafdbba3979e3f | refs/heads/master | 2021-01-21T04:40:26.365832 | 2016-06-24T13:38:12 | 2016-06-24T13:38:12 | 53,202,064 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,595 | h | PhysicsWorld.h | #ifndef _JASPER_PHYSICS_WORLD_H_
#define _JASPER_PHYSICS_WORLD_H_
#include "Common.h"
#include <bullet\btBulletDynamicsCommon.h>
#include <Jasper\PhysicsDebugDraw.h>
#include <vector>
namespace Jasper {
class PhysicsCollider;
class PhysicsWorld
{
public:
explicit PhysicsWorld(Scene* scene);
~P... |
acf62ea9f9cfdf781a5206831e8276fc280a5da1 | e86ff8a37b8dc2d1b9052dc57a4d1e723a8b65d9 | /project3/source/huffman_tree.h | baa40001f30a9ac2b2be98336bf7d9d62690f52f | [] | no_license | ajstein51/Data-Structure | 574eafbd3321d800f7cb6e4ad28959eefa019f95 | 5a896a88c5772dbeec68a26341345f64e6e5c0b3 | refs/heads/master | 2020-12-12T15:49:58.790586 | 2020-11-20T02:02:07 | 2020-11-20T02:02:07 | 234,165,319 | 0 | 1 | null | 2020-03-05T14:02:17 | 2020-01-15T20:19:06 | C++ | UTF-8 | C++ | false | false | 900 | h | huffman_tree.h | #ifndef HUFFMAN_TREE_H
#define HUFFMAN_TREE_H
#include <string>
#include <map>
using namespace std;
struct HuffmanNode {
HuffmanNode(char character, int frequency) :
character(character), frequency(frequency),
left(NULL), right(NULL) {}
HuffmanNode(int frequency) :
character('*'), frequency(frequen... |
47e7e624dfa1cdd7f91320e18e54dd59eeb4ec51 | 7ed941870b6f9480ee587a1d8f87be4682c7a30f | /Day37/List_Cycle/code.cpp | 59fd978b3e9f8b1f6f108dcd2742a44e4d9a93ff | [] | no_license | shobhit-saini/IB | e7fb6e93a490fa7053b957fae18c83378afeb57f | 667a0f73c8f3be5702970ad79868cd4bee243eba | refs/heads/master | 2020-09-21T22:55:10.953135 | 2020-08-14T04:52:38 | 2020-08-14T04:52:38 | 224,962,162 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 636 | cpp | code.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
ListNode* Solution::detectCycle(ListNode* A) {
ListNode* ptr = A,*qtr = A;
int flag = 0;
while(ptr!=NULL&& ptr -> next != NULL && qtr->next!=NULL)
... |
fe026e1e0fe42d3a15db7b23762f472280a52040 | f8dfe565666c9b3f8d6389d60406b50f6f0bfabb | /leetcode/jingdong_4_9/problem3.cpp | cdec4c67dc06c403a3a74d8a416f3297ceaddd3c | [] | no_license | fyhtea/Algo | 76b2576e09f52e09dca16ec52c5e5b13306558e9 | 05581441a18713da897d9a2f8e84ebaa21944488 | refs/heads/master | 2021-09-11T15:47:35.914082 | 2018-04-09T14:22:28 | 2018-04-09T14:22:28 | 109,132,839 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,004 | cpp | problem3.cpp | /*************************************************************************
> File Name: problem3.cpp
> Author:
> Mail:
> Created Time: 2018年04月09日 星期一 22时00分17秒
************************************************************************/
#include <bits/stdc++.h>
using namespace std;
long long dp[100005][10][10];
int... |
4c56702f6716ecfe4a9af472b58438c940017c8f | 2f268a283bf3b959d017a7c18e80944ca291a171 | /src/lisp/types/Function.hpp | 229fe7d21a005e19029acac8a68d813d47a2a191 | [] | no_license | kjohns19/lisp | 14629cf549c22b87d81d371368cc377d7c90eec5 | c72264a1a4ddc8dd6df902995c544f2b9d0d9176 | refs/heads/master | 2016-08-04T01:18:32.351760 | 2015-09-05T23:12:38 | 2015-09-05T23:12:38 | 41,979,200 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,413 | hpp | Function.hpp | #ifndef INCLUDED_LISP_FUNCTION_HPP
#define INCLUDED_LISP_FUNCTION_HPP
#include <lisp/types/Object.hpp>
#include <functional>
#include <string>
#include <vector>
namespace lisp
{
class List;
class Environment;
class Function : public Object
{
public:
typedef std::function<
std::shared_ptr<const Obje... |
2bf12c6a26c1f7ee5e40606ceac4779d293132e5 | 0ccc9aaf7208bcee6f4ebbd5612034b21d8eccd2 | /src/scripts.cpp | 567eb75005868d2138b5b63c17db6a4764cc53c0 | [] | no_license | driador/dawnoftime | 51b9f01b6f14075ca16ee192661f59cb46e9731a | dc4b057c118fb30193fb6e7af8f200314fe9da54 | refs/heads/master | 2020-03-15T18:47:21.423767 | 2018-05-05T23:36:59 | 2018-05-05T23:36:59 | 132,292,521 | 10 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 11,253 | cpp | scripts.cpp | /**************************************************************************/
// scripts.cpp - src file for scripting commands written by Celrion
/***************************************************************************
* The Dawn of Time v1.69s.beta6 (c)1997-2010 Kalahn *
* >> A number of peo... |
cace04e0a49043d011de8db70bf2b5e0e7217173 | c95fdb18b861c22b77c67515da7080f705960f57 | /Source/ARPG/Private/Skill/WeaponSkillBase.cpp | 424667e16c08e0e5f5cd1d956350f13a03517d7a | [] | no_license | z604239179/MMOARPG | a4c0878f282e58d6afc92fd84b3a0996ae974dae | 1144f8c2bbed7a5517be9661b461e6346bb78726 | refs/heads/master | 2020-07-02T19:34:41.484469 | 2019-08-10T14:30:28 | 2019-08-10T14:30:28 | 170,653,379 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 763 | cpp | WeaponSkillBase.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "WeaponSkillBase.h"
#include "PWeponSkill.h"
#include "Weapon.h"
void UWeaponSkillBase::InitSkill(AActor* Owner, UPrimarySkill* _Info)
{
Super::InitSkill(Owner, _Info);
SkillOwner = Cast<AWeapon>(Owner);
SkillInfo = Cast<UPWep... |
bf052befb42e902081ff1c1545cc94044114d6a9 | b59efcb83a1fbe4b9f8e56c5ead4eef69f14f209 | /Round 105/A_ABC_String.cpp | bdb5195ef6cd6df2049cd16611af48e2e82dfc27 | [] | no_license | vanshaj2000/Codeforces | 847992d6de86f1f7eb624ea4960b8041c444e887 | 7f2786d5ddda096902ca40c2cc85335d9e31d039 | refs/heads/main | 2023-05-31T01:22:51.602481 | 2021-06-30T21:06:53 | 2021-06-30T21:06:53 | 336,232,348 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,071 | cpp | A_ABC_String.cpp | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll MOD = 1000000007;
double eps = 1e-12;
#define dbg(x) cout<<#x<<" = "<<x<<ln
#... |
540eaa0d7b9beb8408436ccc4c06f1b983314d1a | 484e834ea2716a8a048f94e3f01802153e779682 | /OS/6/petrov/listings/shmem_writer.cpp | b266c7e82ad7dc3322268b1a7256abeaeff43379 | [
"Apache-2.0"
] | permissive | stakenschneider/git.polytest | 4235b861011f45287c42b29d6fe17413b464a036 | 83ddb3709a45da6c4e7720c54be43f6fd11af8eb | refs/heads/master | 2021-01-19T20:12:47.767734 | 2020-04-20T00:29:31 | 2020-04-20T00:29:31 | 24,994,398 | 0 | 0 | null | 2020-04-20T00:25:54 | 2014-10-09T15:03:56 | HTML | UTF-8 | C++ | false | false | 2,397 | cpp | shmem_writer.cpp | #include <windows.h>
#include <stdio.h>
#include <conio.h>
#define BUF_SIZE 256
TCHAR szName[] = TEXT("MyFileMappingObject");
TCHAR szMsg[] = TEXT("Message from first process");
HANDLE WINAPI mutex;
int main()
{
HANDLE hMapFile;
LPCTSTR pBuf;
mutex = CreateMutex(NULL, false, TEXT("SyncMutex"));
// creat... |
300085141e41296f44165a271c29641ed8f93db2 | 2abcedbb4fb152b13685bbb58fb4102fca4bfcbd | /Core/RawPtr.h | 05ada28af97b10034908aeab0520cfa4c2fca01d | [] | no_license | lionkor/dungeon-engine | 42b6c5c9c7ed82b458b2f1bc5a025e823877ac3c | 11385c33052a6a4074169f52935798c4445fe94c | refs/heads/master | 2020-09-15T11:38:12.781993 | 2020-02-20T17:23:12 | 2020-02-20T17:23:12 | 223,433,825 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 832 | h | RawPtr.h | #ifndef RAWPTR_H
#define RAWPTR_H
#include <utility>
template<typename _T>
class RawPtr
{
public:
RawPtr(_T* data) : data(data) {}
RawPtr(const RawPtr& p) : data(p.data) {}
RawPtr(RawPtr&& p) : data(std::move(p.data)) {}
// FIXME: add `as` method
operator _T*() { return data; }
operator cons... |
db573700a49f573a6ea9470569436cd6119526f5 | 0fc12c5339911fb13283f16772798f1311ce17d3 | /projet.cc | 39a9e0839c7fe8062ed897108266052168eabfd9 | [] | no_license | Mehdiber/renduProjet | 0b221a98aa89c013eead3339c5b395a16e47b889 | c7b90bb1d02998aa9ed9e808aabc79fa6de0605d | refs/heads/main | 2023-05-05T01:05:52.065633 | 2021-05-24T19:48:52 | 2021-05-24T19:48:52 | 366,719,316 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 989 | cc | projet.cc |
#include "simulation.h"
#include <iostream>
#include <vector>
#include <string>
#include <fstream>
#include <sstream>
#include <string>
using namespace std;
/*
int main(int argc, char *argv[])
{
vector<string> argList;
for(int i=1;i<argc;i++)
argList.push_back(argv[i]);
if(argList.size()!=1)
{... |
ce4afa6a45435fe6a7ce42305973941ab96d8eb4 | e0b3782827a643c63dd15761b790e7dff8c80890 | /https/www.codechef.com/AUG17/Greedy Candidates.cpp | febf8433ebc04ef793f0775083ed820d4197511f | [] | no_license | raihan02/My-Contest-Link-with-code | c8425361a011b8478dc412f0ecf5aa48fba2040f | 615423ce1085ca5c48395e9ed516914a594a1a24 | refs/heads/master | 2020-04-19T06:13:39.331472 | 2017-09-24T06:26:45 | 2017-09-24T06:26:45 | 66,770,444 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,178 | cpp | Greedy Candidates.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll m, n;
char s[1004][1004];
int tes;
cin >> tes;
while(tes--)
{
cin >> n >> m;
ll nm[10003]= {0};
ll mm[10003]= {0};
ll arr[10003] = {0};
for(ll i = 1; i <= n; i++)
... |
80afa1fc01554de052eee538b0234c191b179bb9 | 6bab8f0c847bb63fb1505756e47a814068689b31 | /Осень/Codeforses 25 октября/A.cpp | 2379be99bb83cd6b0885e08fd6bb81d80c2c5287 | [] | no_license | AlexFirfarov/olympic-programming | 14f21ca1c6d47243b7028029dd0df2f849f021b6 | 209ce18577dd315f52d660ba0bb1fccadf7f53d6 | refs/heads/main | 2023-08-20T22:04:05.296753 | 2021-09-27T16:13:28 | 2021-09-27T16:13:28 | 410,950,484 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 549 | cpp | A.cpp | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
int main() {
int n;
std::cin >> n;
std::vector<std::pair<int, int>> p(n);
for (auto& point: p) {
std::cin >> point.first >> point.second;
}
double s = 0;
for (int i = 0; i < n - 1; ++i) {
... |
fabdbb515c6dbce7efe1b4f0c0770398c7879f3a | 4c48e348db7cb74b2e28d5142a496c556d412f49 | /restaurants.cpp | fc34ef70ced28de62cc843e2604e85a459dcb2a1 | [] | no_license | JanKse/Restaurant-console-app- | b8f6e650870c32247b87a75e912fb1cb761831be | c03d9bb8e7fb58f279dbe340733b82b1ebe8fbb8 | refs/heads/main | 2023-03-14T14:22:50.194924 | 2021-03-08T16:40:41 | 2021-03-08T16:40:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,243 | cpp | restaurants.cpp |
#include "helperFunctions.h"
using namespace std;
int main()
{
reviewList *revs;
loginManager *app;
bool running = true;
int x = 8;
int menuItem = 1;
string choice;
string newInfo;
review *rev;
restaurant *userRestaurant;
reviewList *userRestaurantReviews;
restaurantList ... |
bbef2ba4bf6e587700258d57651c35950d6c7d0c | 1ede4ea00a69c36b3aba1df04fadefa76f41973f | /contracts/visitor/visitorcon.cpp | 02600bc550552aff7bbe1bf6abe0e8f3861d15c7 | [] | no_license | utopialand/Utopia | 92f6c896f23208f6ef80f6bf38ede18e11fe8dc3 | c41d8752fffbab05439957e54bed583c3cee2ad3 | refs/heads/master | 2020-04-03T05:11:28.401105 | 2019-01-14T07:25:04 | 2019-01-14T07:25:04 | 155,037,811 | 5 | 4 | null | 2018-12-05T06:10:50 | 2018-10-28T05:16:05 | HTML | UTF-8 | C++ | false | false | 1,017 | cpp | visitorcon.cpp | #include "visitorcon.hpp"
ACTION visitorcon::apply(name visitor,uint64_t stduration){
require_auth(_self);
visitor_entry ve(_self,_self.value);
ve.emplace(_self,[&] (auto &e){
e.id=ve.available_primary_key();
e.visitor=visitor;
e.duration=now()+(24 * 60 * 60 * stduration);
e.visitorstatus = false;
});
print("don... |
17bea9e4b5598f3a72430bfed6f445e291d02c97 | 83b91876b7668f2ee3899b2b8812dbef70650f3e | /G-COUNTING-SORT.CPP | f95330224bab3440b8a162b2e316f371f07d99a0 | [] | no_license | BSCPE-2C-CPE-121-TERM-2-S-Y-19-20/SORTING-ALGORITHMS | d51fca16fd95ac08a94c8966e99c44bcd75979ba | 323ef973265d3ab67f71a0258a07b15d39a578ff | refs/heads/master | 2020-12-21T12:04:52.150870 | 2020-02-03T01:30:48 | 2020-02-03T01:30:48 | 236,424,811 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 712 | cpp | G-COUNTING-SORT.CPP | #include <iostream>
using namespace std;
void countingSort(int arr[],int n,int RANGE){
int count[RANGE]={0};
int i;
int out[n];
for(i=0;i<n;i++)
++count[arr[i]];
for(i=1;i<RANGE;i++)
count[i]+=count[i-1];
for(i=n-1;i>=0;i--){
out[count[arr[i]]-1]=arr[i];
--count[ar... |
6cddbed5ccafd84a12290fa7e36780b859d2a072 | 91774d68635cee184e327b457d63efc6b0b415b8 | /row change.cpp | 8c1162853122fc16dce164ad5d00c461714c466f | [
"Apache-2.0"
] | permissive | aladageren/c-exercises | fd4bc9c636b873eaf2492d21e23b91c6b266a3e7 | e4da30fabff66b2ee5a36539302532776a68ad5b | refs/heads/master | 2021-01-17T19:19:46.898113 | 2016-06-20T20:13:53 | 2016-06-20T20:13:53 | 59,937,781 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 517 | cpp | row change.cpp | /* Changes the rows, keeping the middle one still */
#include <stdio.h>
int main ()
{
int m,i,j;
int dizi1[9][9];
int dizi2[9][9];
printf("Enter the size of matrix : \n");
scanf("%d",&m);
printf(" Enter a %d x %d matrix \n: ",m,m);
for(i=0;i<m;i++)
for(j=0;j<m;j++)
scanf("%d",&dizi1[i][j]);
for(i=0;i<m;i+... |
44b97b2e81e7719d01146c6ee67536162bb12017 | 2aeea49484cea5c516c2067f59a1348dad4550c0 | /uml_editor/main.cpp | 5b20c6fee6f165bf0ebc72892cd0d921ed10758b | [] | no_license | wingedrobin/SE6029-OOAD-Final-Project | 5097bdaecd60c4432780017050218d26007e7a8d | 4e957b7543458604659e16ec9f770516f8828615 | refs/heads/master | 2021-01-20T12:05:13.603148 | 2015-03-25T09:35:33 | 2015-03-25T09:35:33 | 32,848,860 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 250 | cpp | main.cpp | #include <QApplication>
//自定義標頭檔
#include "UML_Editor.h"
int main( int argc , char* argv[ ] )
{
QApplication app( argc , argv ) ;
UMLEditor umlEditor( 0 , Qt :: Window ) ;
umlEditor.show( ) ;
return app.exec( ) ;
}
|
df8c23f6fcefc6552d85d5724f806ea3e7027732 | 0a569535a12c4c75dc3fa2380aaff8c2c484cf3c | /HandTracker/HandTracker/Tracker/Tracker.cpp | cbb3ae7b0c76d2566b1ca91791577781db327bee | [
"MIT"
] | permissive | AlexKLWS/iOSHandTracker | 8c67f3d06df438a4bb1f1c8cd154a15b1cd829b9 | 6e56635071a0065b264b904521137d2ef59d9abc | refs/heads/master | 2020-04-20T03:56:46.160158 | 2019-03-21T18:46:00 | 2019-03-21T18:46:00 | 168,612,900 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,073 | cpp | Tracker.cpp | #include "Tracker.hpp"
Tracker::Tracker(){}
template <std::size_t sizeA, std::size_t sizeB>
void clearArray(int (&a)[sizeA][sizeB]) {
int* begin = &a[0][0];
std::fill_n(begin, sizeA * sizeB, 0.0);
}
int Tracker::getMedian(vector<int> values) {
int median;
size_t size = values.size();
sort(val... |
f23817f33c9cc4faa72d2cca121096351960df13 | 163c67594e699f4e0625e690fdf59fe117be141c | /witj/cpp/src/CTVecSupply.h | 8d500f301df62e39631a6d6d493e76b2e285d5d5 | [
"Apache-2.0"
] | permissive | jfuku14/CMMPPT | 19e2ed19873cc8e78b277765764ae30f5661db4b | 16dd1b709af992c09a1fda110b0602998f46d0d7 | refs/heads/master | 2021-12-03T08:16:12.442222 | 2021-08-19T02:05:56 | 2021-08-19T02:05:56 | 241,051,080 | 0 | 0 | Apache-2.0 | 2020-02-17T08:02:41 | 2020-02-17T08:02:40 | null | UTF-8 | C++ | false | false | 2,530 | h | CTVecSupply.h | //------------------------------------------------------------------------------
// WIT-J C++ Header File CTVecSupply.h.
//
// Contains the declaration of class CTVecSupply.
//------------------------------------------------------------------------------
#ifndef CTVecSupply_h
#define CTVecSupply_h
#include <Includes.... |
45ac41a57c3c663eb687cc15f7dd3344d59ea86b | 1cb36cf2cb3d07687d1fb462f44de127e54c2721 | /LeetCode/LinkedLists/RemoveLLElements.cpp | 6370f9a979e59f2eb4a5ba9d4b31b5edfdbc8bf9 | [] | no_license | rakeshakkera03/Coding | 8261090f3c50c556adc5347d053f5c73ec54b0c5 | 81d82613e4ce66ad2eddcd2296d1258c6519e65b | refs/heads/master | 2021-01-01T18:55:49.194981 | 2015-10-15T12:07:48 | 2015-10-15T12:07:48 | 37,384,634 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,084 | cpp | RemoveLLElements.cpp | /*
Remove all elements from a linked list of integers that have value val.
Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5
*/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* removeEl... |
9ed6b51dc32a2b9b0eb1e16bfce759d077365547 | efb266771f94aeae71680beb9904db56bd7db413 | /src/caffe/test/test_libdnn_blas.cpp | 05b9733c8080072c2893da972fd04c6668c1454d | [
"LicenseRef-scancode-public-domain",
"BSD-2-Clause",
"LicenseRef-scancode-generic-cla"
] | permissive | naibaf7/caffe | 3080a325f31b180a78a92076e7cd69a3be2285a8 | 29960153c828820b1abb55a5792283742f57caa2 | refs/heads/master | 2020-04-02T03:11:35.578860 | 2018-06-27T14:51:41 | 2018-06-27T14:51:41 | 34,186,808 | 91 | 30 | null | 2018-08-18T09:50:54 | 2015-04-18T23:29:30 | C++ | UTF-8 | C++ | false | false | 11,396 | cpp | test_libdnn_blas.cpp | #ifdef USE_LIBDNN
#include <algorithm>
#include <random>
#include <vector>
#include "gtest/gtest.h"
#include "caffe/blob.hpp"
#include "caffe/common.hpp"
#include "caffe/quantizer.hpp"
#include "caffe/libdnn/libdnn_blas.hpp"
#include "caffe/util/math_functions.hpp"
#include "caffe/test/test_caffe_main.hpp"
// Comp... |
9d210be1559256a700fe9ef44879f392de5efd5d | 66145bfba2900cfed2987eb6d4487472b21feaa2 | /hw7/NewUser.h | 2ac1a148e6d6d2cfed97f16c36b7d5aa44c4d1e9 | [] | no_license | jominican/Netflix | dcb415be844a089d46ca1b0c1fd81862ca0cccd4 | 50c1adad5e91e541166a9ab25de11f5bd2b0ce18 | refs/heads/master | 2021-01-20T12:35:28.965635 | 2015-01-13T19:05:12 | 2015-01-13T19:05:12 | 29,204,791 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,117 | h | NewUser.h | #ifndef NEWUSER_H
#define NEWUSER_H
#include <QWidget>
#include <QMainWindow>
#include <QPushButton>
#include <QMessageBox>
#include <QPlainTextEdit>
#include <QHBoxLayout>
#include <QVBoxLayout>
#include <QLineEdit>
#include <QFormLayout>
#include <QLabel>
#include <QString>
#include <string>
#include <string.h>
#inc... |
4bf0ab13437bb3201bcbee48d3190f7aed0c8ad0 | 39b3568c5fa35c12e7537d0bee3fc10367674f48 | /src/rsa/rsa_jwk.cpp | 5dbfd4e23e0895de09801266c5341dcf7334e2a9 | [
"MIT"
] | permissive | tresorit/node-webcrypto-ossl | e01d909549b96e48f0230a706aad66ea95101cab | 315316b7756edca9df704f43baedd422a73eb7b8 | refs/heads/master | 2021-09-15T05:24:59.066437 | 2018-05-26T19:31:38 | 2018-05-26T19:31:38 | 105,989,977 | 0 | 0 | null | 2017-10-06T09:55:02 | 2017-10-06T09:55:01 | null | UTF-8 | C++ | false | false | 2,238 | cpp | rsa_jwk.cpp | #include "rsa_jwk.h"
Handle<JwkRsa> JwkRsa::From(Handle<ScopedEVP_PKEY> pkey, int &key_type) {
LOG_FUNC();
LOG_INFO("Check key_type");
if (!(key_type == NODESSL_KT_PRIVATE || key_type == NODESSL_KT_PUBLIC)) {
THROW_ERROR("Wrong value of key_type");
}
LOG_INFO("Check pkey");
if (pkey == nullptr) {
... |
04076527bbc36e3dab1aa9b8c3356d0e4456927f | 5d0213b7eba9dfda669a0345e168b49f5d3f1d76 | /JuegosReunidos/src/InterfazGrafOthello.h | ed1bffb0f4a256312fdfb2ea4ce66f8238adaf3a | [] | no_license | plandevida/Practica3-TAIS | be933f9805cd5ecffb4dece5e8e249a3dbcfb7ca | 1b5fa014b7ca17192ae1dda43ff63174a94130c3 | refs/heads/master | 2021-01-25T03:48:36.650854 | 2014-02-05T11:59:01 | 2014-02-05T11:59:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 883 | h | InterfazGrafOthello.h | /*
* InterfazGrafOthello.h
*
* Created on: 26/12/2013
* Author: Daniel Serrano Torres
*/
#ifndef INTERFAZGRAFOTHELLO_H_
#define INTERFAZGRAFOTHELLO_H_
using namespace System::Drawing;
#include <sstream>
#include "InterfazGrafT2.h"
#include "JuegoOthello.h"
#pragma unmanaged
class InterfazGrafOthello : public I... |
eae417b46397a13a9c38f1d3db9b2e4105a10e40 | 60ab5697e56fea689b045b37830471415cedd50b | /crazyflie_gazebo/src/crazyflie_ros/joy_control.cpp | 2254f32b56334069f788d58a2099828485631def | [] | no_license | wuwushrek/sim_cf | d08adfcbaec0c94d52bab9f119b2140f702f0f13 | df68af275c9f753d9bf1b0494a4e513d9f4c9a7c | refs/heads/master | 2021-11-26T14:03:14.841144 | 2021-11-12T14:51:27 | 2021-11-12T14:51:27 | 135,981,793 | 34 | 37 | null | 2021-11-12T14:51:28 | 2018-06-04T06:41:19 | C++ | UTF-8 | C++ | false | false | 20,530 | cpp | joy_control.cpp | #include <ros/ros.h>
#include <Eigen/Dense>
#include <ros/callback_queue.h>
#include <string>
#include <future>
#include <sensor_msgs/Joy.h>
#include <geometry_msgs/Twist.h>
#include <crazyflie_driver/Stop.h>
#include <crazyflie_driver/UpdateParams.h>
#include <crazyflie_driver/Land.h>
#include <crazyflie_driver/Tak... |
e78d757e1c1cd915631b2b6d8f55e2249af3da11 | d0fb46aecc3b69983e7f6244331a81dff42d9595 | /waf-openapi/include/alibabacloud/waf-openapi/Waf_openapiClient.h | f0f9a2d4a24ea5ba2e1b3de41eeb4c39f7fb4f9d | [
"Apache-2.0"
] | permissive | aliyun/aliyun-openapi-cpp-sdk | 3d8d051d44ad00753a429817dd03957614c0c66a | e862bd03c844bcb7ccaa90571bceaa2802c7f135 | refs/heads/master | 2023-08-29T11:54:00.525102 | 2023-08-29T03:32:48 | 2023-08-29T03:32:48 | 115,379,460 | 104 | 82 | NOASSERTION | 2023-09-14T06:13:33 | 2017-12-26T02:53:27 | C++ | UTF-8 | C++ | false | false | 34,225 | h | Waf_openapiClient.h | /*
* Copyright 2009-2017 Alibaba Cloud All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required... |
6d1616a7c664fe93a8a4e01162a8def82e3aa48b | 927c262ca9b723f1dfba0d4c5d7d2e0ffd13fe35 | /include/libp2p/protocol/kademlia/value_store.hpp | 0877c259c3024ccc3735bf80ec38a4996b07dc9b | [
"MIT",
"Apache-2.0"
] | permissive | libp2p/cpp-libp2p | f88acd8e7b49a0949085c78c6b8c2b829a8f8d7d | 6294fd057d5d3d26e0656a24711450f6e880de05 | refs/heads/master | 2023-08-25T07:46:25.154555 | 2023-06-28T08:53:46 | 2023-06-28T08:53:46 | 209,043,384 | 242 | 76 | Apache-2.0 | 2023-09-14T13:02:36 | 2019-09-17T12:07:29 | C++ | UTF-8 | C++ | false | false | 877 | hpp | value_store.hpp | /**
* Copyright Soramitsu Co., Ltd. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#ifndef LIBP2P_PROTOCOL_KADEMLIA_VALUESTORE
#define LIBP2P_PROTOCOL_KADEMLIA_VALUESTORE
#include <libp2p/outcome/outcome.hpp>
#include <libp2p/protocol/kademlia/common.hpp>
namespace libp2p::protocol::kademlia {
/... |
36740a70b201ecd91991a26a4bc221d4da2ccd99 | d7ccf7e70ad18a68b788e9bfe485bfd9c332b1ef | /rel-lib/src/Logger.h | 848f4065d133080d77313b3c8508ee43b75e7df6 | [
"MIT"
] | permissive | lsp-implementaions/rel | d47ae4f618ee730bea659bab0349cef50f04ed6f | d9e6815012334dfc4c99b8020ae42a9ca9860458 | refs/heads/main | 2023-04-03T10:46:15.484422 | 2021-04-16T18:18:57 | 2021-04-16T18:18:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 920 | h | Logger.h | /* SPDX-License-Identifier: MIT */
/* Copyright (c) 2020-present Stefan Schlichthärle */
#ifndef LOGGER_H_
#define LOGGER_H_
#include <fstream>
#include <iostream>
#include <mutex>
#include <string>
#define LOG(level, msg) LogMessage(level, msg, __FILE__, __LINE__)
enum class LogLevel {
ERROR = 1,
WARNING =... |
4db0ffb6af5a20cf325630aa256b52712a0b9c44 | 9818a2e668b1956db461e5669c7a8629342b1a34 | /Word Ladder.cpp | e2b99b940433c316740627b01359ad12ef730aa2 | [] | no_license | jl3937/leetcode | 7723aa47e87b407afef2e28fa5ce5fee7c7283e4 | c0002df94fdc23331b3a500233058f0a24a05a45 | refs/heads/master | 2020-06-26T16:24:45.365888 | 2014-01-20T13:22:11 | 2014-01-20T13:22:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,175 | cpp | Word Ladder.cpp | bool visited[10000];
class Solution {
public:
int ladderLength(string start, string end, unordered_set<string>& dict) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (start == end)
return 1;
int n = dict.size();
int len = (*dict.begin()).size();
queue<... |
389784be595c880233404f52b5cbf9dc2f3b660a | 968652934c0a5f85ece357b0145faf668c9bf98d | /include/json/detail/type.hpp | 11d2e33e52e690a60d57a0fb97112a21776aa4bf | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | Alexhuszagh/json | ef758cda5cc9a593df5d3e94152d254f54d350d5 | ad5de378332e8663294a6291b2f02675f5a78799 | refs/heads/master | 2020-05-27T10:04:59.735502 | 2017-06-23T18:30:24 | 2017-06-23T18:30:24 | 82,541,346 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 5,096 | hpp | type.hpp | // :copyright: (c) 2016-2017 The Regents of the University of California.
// :license: MIT, see LICENSE.md for more details.
/**
* \addtogroup JSON
* \brief Type detection for C++ containers.
*/
#pragma once
#include <array>
#include <deque>
#include <limits>
#include <list>
#include <set>
#include <map>
#incl... |
3dcd76cf6c10dfee0911d69f70ad07286707ae67 | 0d86c594f8fb06a0f62705f5c59ba8973913ff3d | /面试题16.25_LRU缓存/Solution.h | cb563133ed467cd743aacb11404158d70e65830c | [] | no_license | lhlalyl/leetcode | fe87f80dd8ef09e8f3f0a379468f4e2906d35d5e | bb61d06f6185e4c3176f64a6c45e3265237647de | refs/heads/master | 2022-12-25T17:54:53.896728 | 2020-09-29T02:53:21 | 2020-09-29T02:53:21 | 299,479,973 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,125 | h | Solution.h | #pragma once
#include<list>
#include<unordered_map>
using namespace std;
class LRUCache {
private:
int capacity;
list<int> lst;
unordered_map<int, int> mp;
int size;
public:
LRUCache(int capacity) {
this->capacity = capacity;
this->size = 0;
}
int get(int key) {
i... |
34b2ceec10882f93671135b3dc2a4f25fd876d0b | f9b3a4548d7308915b99e57d736909e301ae096f | /PVZ/MyPVZ0/logindialog.h | 8d1211edddc920a3bd31b3213398df9da4dd2249 | [] | no_license | yangyang-01-debug/res | e8b122c3cbc7c10814111e3383ab5a68e69afc45 | 71184a35b64657ace03091557e2cce86d7d463a1 | refs/heads/master | 2023-05-31T00:18:46.674871 | 2021-06-13T12:41:15 | 2021-06-13T12:41:15 | 374,936,772 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,223 | h | logindialog.h | #ifndef LOGINDIALOG_H
#define LOGINDIALOG_H
#include "titlebar.h"
#include "mybtn.h"
#include "messagebox.h"
#include <QEventLoop>
namespace Ui {
class LoginDialog;
}
class LoginDialog : public QDialog
{
Q_OBJECT
public:
explicit LoginDialog(QWidget *parent = nullptr);
~LoginDialog();
private slots:
... |
f7d5400e1d3298d1408efcd0b76993e73d9faf9f | c12865c6e095c43422bd666095bf7f18764c1493 | /threadmethods.h | 77dd78efe202a6776229bd3a392415c083dc846f | [] | no_license | hoholee12/homework | dc42a9a2102e9121f9e938b61bc2d28e6d8a2ee6 | dce47e4e4c2b9ab631b64ae55ca81c1a02a59752 | refs/heads/master | 2022-12-19T05:05:03.316801 | 2020-09-20T14:15:30 | 2020-09-20T14:15:30 | 291,497,261 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 24,603 | h | threadmethods.h | #pragma once
#include"common.h"
#define LOOPVAL 10
namespace simplethreadjoin{
typedef struct{
int result;
} arg_t;
void* child_func(void* arg_tmp){
arg_t* arg = (arg_t*)arg_tmp;
sched_getaffinity(0, 0, NULL);
arg->result = 1;
return NULL;
}
void parent_f... |
f99aec82e2cfdfdc540318f4b4a832a487c6d8ee | b60ca0b7c1fb83074f47e2f1d9017f38b161d7eb | /CreateMat/CreateMat/main.cpp | 39a9eea01878ca5ce6eb92d4e5d77be567582adf | [] | no_license | liangzelang/OpenCV_Basic_Exercise | 37c6bde7b68c3d7e4319bffdbe9e2670e0594769 | 0a194f07f64da28f7c259cefb78f8ce9b704196c | refs/heads/master | 2021-01-17T23:03:31.200826 | 2017-07-28T14:04:21 | 2017-07-28T14:04:21 | 84,211,093 | 4 | 9 | null | null | null | null | GB18030 | C++ | false | false | 1,245 | cpp | main.cpp | #include <opencv2\opencv.hpp>
#include <iostream>
using namespace cv;
using namespace std;
int main()
{
/*方法1：使用Mat（）构造函数*/
Mat M(2, 2, CV_8UC3, Scalar(0,0,255));
cout << "M = " << endl << " " << M << endl;
//way2 没有太懂，由于这是多维的数组，使用cout出错
int sz[3] = {2, 2, 2};
Mat L(3, sz, CV_8UC3, Scalar::all(0));
//way3 为I... |
269d9d4b4371aed653109cb047bd74eddb0f5ae8 | 2458d6d18521117124c1ba39cc8b4b8287d745cf | /cocos2d-x-2.2/samples/Cpp/TestCpp/Classes/BugsTest/Bug-624.h | 1bc25bc533caf020a9698e32c23d7cba654657c1 | [
"MIT"
] | permissive | zhuzhonghua/XUI | a9d9fde0258ddde235fdd2aa52145b97b91e0ffc | 4cfd3e8c4d15f8cba4b918da3719aacdcf6009ce | refs/heads/master | 2020-06-26T09:21:06.810301 | 2014-01-07T03:03:22 | 2014-01-07T03:03:22 | 15,630,631 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 524 | h | Bug-624.h | #ifndef __BUG_624_H__
#define __BUG_624_H__
#include "BugsTest.h"
class Bug624Layer : public BugsTestBaseLayer
{
public:
virtual bool init();
void switchLayer(float dt);
virtual void didAccelerate(CCAcceleration* pAccelerationValue);
CREATE_FUNC(Bug624Layer);
};
class Bug624Layer2 : public BugsTestB... |
33cbc68c044ea0aff90f159d4cb2cef03f25ae4a | 071cc8b5c212fbc7d6c8fc4f7653b7380041da3f | /Sources/Main.cpp | 22ebc0e25144a6380688ed85b406a0fb7f5d1ba8 | [] | no_license | coreyao/DXRenderer | 27dbfe96dbf8dee7c045821b7eed7bc12fa3dd80 | cc76a17a2a76e3fbec15cba890c6aef276a6af87 | refs/heads/master | 2021-01-02T23:10:00.803939 | 2017-08-20T08:36:06 | 2017-08-20T08:36:06 | 99,482,065 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,406 | cpp | Main.cpp | #include <d3d9.h>
#include <d3dx9.h>
#pragma warning( disable : 4996 ) // disable deprecated warning
#include <strsafe.h>
#pragma warning( default : 4996 )
#include "Core/Application.h"
Application app;
LRESULT WINAPI MsgProc(HWND hWnd, UINT msg, WPARAM wParam, LPARAM lParam)
{
switch (msg)
{
case WM_DESTROY:
... |
134525b290a8238b61e26a65745d66b4ef3e0362 | 0419c705b1fb4c6d9df68763419120dd6fb3d299 | /random/1236_castle.cpp | c84182c0fd1af9f961139c2e62a96390bda8399d | [] | no_license | fernok/cpppractice | 381b19dd15fd1a5defb960b0dafbb2529b2026a3 | b95730280b4c13fabb716578c2db510d15b3229b | refs/heads/master | 2023-08-19T13:50:22.253938 | 2021-10-01T14:36:25 | 2021-10-01T14:36:25 | 278,089,539 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 636 | cpp | 1236_castle.cpp | #include <iostream>
#include <vector>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
char input;
int count_row = 0, count_col = 0;
vector<bool> row(n, false), col(m, false);
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
cin >> input;
if(inpu... |
d162edf6accdaec6599c6ff83f7c912e2f9197b5 | 2bdca426e00b7648e1cb76432c7b9548dcfe5095 | /src/marketData/volatility/flatVolatility.cpp | 9a181c92232994d73b9b6302d5306da0d5087d0e | [] | no_license | mbrzecki/julian | b6b0c7c5fdc40f2970ae9cbeed1bd12c020dae6f | 04a38f0a26a23ba8f80c879997216c22dbc81ebb | refs/heads/master | 2020-03-28T02:30:08.777303 | 2019-05-28T18:10:30 | 2019-05-28T18:10:30 | 147,575,336 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,248 | cpp | flatVolatility.cpp | #include <marketData/volatility/flatVolatility.hpp>
#include <utils/formatters.hpp>
#include <string>
#include <iomanip>
#include <cmath>
namespace julian {
/** \brief Returns volatility. The same value is returned regardless of the given arguments
*/
double FlatVolatility::getVolatility(double , Date ) const ... |
51d0533bbe930eaf248f3d1b64c57a477255f455 | fb48f5a86528c9dac12b1e01f0e645f29756111d | /headers/Sprite.h | cde7e9fad406146cb4ef49796906651284146dc0 | [] | no_license | nightfox2890/OpenGL2D | bfb12cab55092d8695eb74d300a5bb39cc6baeee | 66db426d02701328e13b2976a4ce4f187d8ada24 | refs/heads/master | 2016-08-04T20:21:42.961587 | 2012-06-28T15:18:03 | 2012-06-28T15:18:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,601 | h | Sprite.h | /*
* Simple OpenGL 2D Engine - Sprite, methods to draw sprites
* Copyright (C) 2012 Yarrith Devos, Michael Yagudaev (yagudaev.com)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, e... |
0c51491d23a7f8a693d6f8a3a7a54dab45b4fe57 | cc733834bdb5b4d33210c091744100c818beb2cb | /knDds/src/knDds/DdsPushConsumer.cpp | 49d5328405ba48e508b9be8e1f101d11336b09bd | [
"Apache-2.0"
] | permissive | hhutz/soraCore | b7d592424afb2ff111c24f542853a993d99326e3 | 0b140e0bca251498c3b12c102d04bcb68e4c31b1 | refs/heads/master | 2021-06-26T00:37:20.379488 | 2015-12-17T17:18:51 | 2016-02-11T17:29:47 | 21,436,387 | 1 | 5 | null | 2021-06-18T16:59:09 | 2014-07-02T18:50:50 | C++ | UTF-8 | C++ | false | false | 2,571 | cpp | DdsPushConsumer.cpp | /* -*- C++ -*- *****************************************************************
* Copyright (c) 2013 United States Government as represented by the
* Administrator of the National Aeronautics and Space Administration.
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* yo... |
b3d5476dcb78a5e567844ddd07ba420469ccccdd | 4102677669ec2b089345b287f05186ccac604e76 | /sto_quad/main_threads_omp.cpp | cf845963c160c013c03b4b0cf2ea767146fb7f29 | [] | no_license | chem12346789/deom | c68366beaf00a79f6e55956195dc41b8526eb942 | 804f72c41273dffb2f0407585ad392acc8219a55 | refs/heads/main | 2023-07-20T00:05:52.333426 | 2021-08-30T16:38:54 | 2021-08-30T16:38:54 | 361,833,107 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,436 | cpp | main_threads_omp.cpp | // #include "algebra.cpp"
#include "deom.hpp"
#include "mr.cpp"
// #include "pulse.hpp"
#include <gperftools/profiler.h>
#include <stdio.h>
#include <thread> // std::thread
#include <unistd.h>
using namespace std;
using Eigen::Matrix2cd;
using Eigen::MatrixXcd;
using Eigen::VectorXcd;
template <typename T>
int sgn(T v... |
8b00486bb7be24834f8d68c03c835f81dc347fd8 | 293c244b17524210780b4fcb644c03d5cd6f1729 | /src/bugengine/meta/include/builtin-biguintx.script.hh | fa6fd6543207fc700791a872ed837154edbb296f | [
"BSD-3-Clause"
] | permissive | bugengine/BugEngine | 380c0aee8ba48a07e5b820877352f922cbba0a21 | 1b3831d494ee06b0bd74a8227c939dd774b91226 | refs/heads/master | 2021-08-08T00:20:11.200535 | 2021-07-31T13:53:24 | 2021-07-31T13:53:24 | 20,094,089 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,434 | hh | builtin-biguintx.script.hh | /* BugEngine <bugengine.devel@gmail.com>
see LICENSE for detail */
#ifndef BE_META_BUILTIN_BIGUINTX_SCRIPT_HH_
#define BE_META_BUILTIN_BIGUINTX_SCRIPT_HH_
/**************************************************************************************************/
#include <bugengine/meta/stdafx.h>
#include <bugengine/meta/... |
7a01fdefd3d676eda23499f8b732ef1c9aade953 | 7b81ea6906b90afe72b51f29b909511da87a2f29 | /source/MXTopoTools2020/I_OrderImpl.h | 3924789420ee50f6a9db5d065a2c39c7f29bb0e4 | [
"Apache-2.0"
] | permissive | jan-kebernik/3ds-Max-TopoTools-2020 | cf1f47aa37e544a8f34bcefd768b67e3e3605965 | 10a35f834a9b99baedc4757c4d9914330a123b7c | refs/heads/master | 2023-05-02T19:43:00.261045 | 2021-05-13T12:22:55 | 2021-05-13T12:22:55 | 291,316,587 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 89,606 | h | I_OrderImpl.h | #pragma once
#include "Util.h"
#include "Codes.h"
#include "Helpers.h"
#include "Restore.h"
class I_OrderImpl {
public:
static inline i32 blendMirrorPos(
INode* node,
const List<i32>& orderM,
const List<i32>& orderA,
const List<i32>& orderB,
const Bitset& selection,
const i32 axis,
co... |
99d6ca99200b9b475670a8119c5e8599b8b520e5 | 8edf2cc798f0addbbc05ae7d4c2913e836e01f46 | /Practice/frac.cpp | 689bb335edc481ba3b9491ec67cca104d7846a68 | [] | no_license | DigammaX/PAT | 90cf38cdde462cae22190c620b0c510f61e29036 | 0f96184274d2809e91254725f9f8b66f45e39644 | refs/heads/master | 2023-06-27T19:38:49.086978 | 2021-08-01T03:59:42 | 2021-08-01T03:59:42 | 384,316,226 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,541 | cpp | frac.cpp | #include <iostream>
#include <algorithm>
using namespace std;
typedef struct _frac{
long long up,down;
}frac;
long long gcd(long long ,long long );
frac sub(frac,frac);
frac add(frac,frac);
frac mul(frac,frac);
frac div(frac,frac);
frac reduce(frac);
void show(frac);
int main() {
frac f1,f2;
f1.up = 2;
... |
cec3793434807c59717fe33e7ebd1a4cb938532b | 5d37a87eb567b6e8968404812c61ac147511b7e5 | /src/bin/write-transition-labels.cc | a8f2832bb3f956b13382a7c410c20c69ee51b38c | [
"Apache-2.0",
"LicenseRef-scancode-public-domain"
] | permissive | pbrakel/kaldi | bdf138b3e69e660f7f22cb37f424d7619cb44ca4 | c20e6edced3764bfa6ed4e504d7bbd187fbde3a7 | refs/heads/jan | 2021-03-12T22:44:11.183634 | 2014-11-06T21:57:48 | 2014-11-06T21:57:48 | 23,888,539 | 0 | 2 | null | 2014-10-22T17:24:09 | 2014-09-10T19:17:53 | C++ | UTF-8 | C++ | false | false | 3,730 | cc | write-transition-labels.cc | // bin/show-transitions.cc
// Copyright 2009-2011 Microsoft Corporation
// See ../../COPYING for clarification regarding multiple authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
... |
4cb358492bc0e545f0c942d3cf52382fc742b9be | 557e7195aa77a94f04cb7ac52fd3730bd8eef071 | /libjasyncagent/src/NativeCallsInterceptor.h | 54f33c19e96d7893576e62ac64329f487d1e40d2 | [] | no_license | lambdaprime/jasyncagent | 322ec330a35451a47099193aca952e06f8b76471 | d1e4edba1a1abeca0540ad81e94df35fce12e3de | refs/heads/master | 2021-07-06T12:53:30.612516 | 2017-09-30T04:54:15 | 2017-09-30T04:54:15 | 105,342,804 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 388 | h | NativeCallsInterceptor.h | #ifndef NATIVECALLSINTERCEPTOR_H_
#define NATIVECALLSINTERCEPTOR_H_
#include <jvmti.h>
#include <string>
namespace NativeCallsInterceptor
{
using namespace std;
extern bool init(jvmtiEnv*);
extern void add(const string& className, const string& methodName, const string& methodSign,
void* new... |
2559dc9889dae3ae34b0a5a9f36f960aaae1873d | 0a665e7c4440a43543bd94dcaac81ff1b42c5999 | /userInputStringClass/userInputStringClass.cpp | 89fa0ad092b493f571aefdd37a42c3ab8ba171b1 | [] | no_license | TheDataStar/userInputStringClass | 0404d5dc7d75fbc103578c23c25fcfed14ad0c59 | 321a3053c5e094d3d42a4ac00bdc0f9046a95c24 | refs/heads/master | 2022-11-27T12:37:41.532531 | 2020-08-11T09:38:28 | 2020-08-11T09:38:28 | 286,704,499 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,379 | cpp | userInputStringClass.cpp | // FileName: userDefinedString.cpp
// Project: CS288T Unit 2 Submission 2 - Object Oriented Concepts using C++ Cont.
// Author: Adam Greenwood (22579036)
#include <iostream>
#include <string>
using namespace std;
class userString
{
public:
// Data Members (features)
string userInput;
// Member functions
void s... |
ea8998cde7662b4f9cc7a355269695a5fcbeedf2 | 9eed823aaed9990f1ec1714166d8388cc99ba4eb | /calibApp/calibSrc/NDPluginCalib.cpp | 948b71076ec5feec7b5f8a8feed859b158b54855 | [] | no_license | waynelewis/ADPluginCalib | 05138588b23489c823ec54029670a55f05837a61 | 127b987762b1c2f7470aa48c14296a3c3fa4bf2c | refs/heads/master | 2020-03-25T00:33:48.365610 | 2018-12-10T11:21:50 | 2018-12-10T11:21:50 | 143,192,534 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 20,396 | cpp | NDPluginCalib.cpp | /*
* NDPluginCalib.cpp
*
* Image processing plugin
* Author: Tomasz Brys
* email: tomasz.brys@esss.se
* the driver is base od ADPluginEdge and ADPluginConvert
* it includes also procedures found on webpage which a free available
* Created October 10, 2018
*/
#include <stdlib.h>
#include <string.h>
#include ... |
0384fc617de58d246c40f04a794c55790858257b | d89f38086d84808de3a01e5502602dcbfc3254de | /digi/EngineVM/PrintModulePass.h | 03693714817dec71381c8c7e1a4cb6065869d1e6 | [] | no_license | Jochen0x90h/Digi | 1c9250b86d8b3a49724e62c2a624d25e141f5aff | 7cbb876ebaa5ef58417e9c6d99fdd44ebb041ad0 | refs/heads/master | 2021-01-20T08:44:05.229736 | 2017-06-27T21:29:46 | 2017-06-27T21:29:46 | 90,188,188 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 788 | h | PrintModulePass.h | #ifndef digi_EngineVM_PrintModulePass_h
#define digi_EngineVM_PrintModulePass_h
#include <llvm/Module.h>
#include <llvm/Pass.h>
#include <digi/Utility/StringRef.h>
namespace digi {
/// @addtogroup SceneConvert
/// @{
// print a module (see VMCore/PrintModulePass)
class PrintModulePass : public llvm::... |
14be40c1e24487517e7c61c7894c80ccfc28a358 | 84c7e7b93c098e2fa8daf1b66e42ce24b99d768d | /lc1005/源.cpp | e39e9b5dc9f954615f1ae5ad480885088a0fd522 | [] | no_license | AntonYad/Leetcode-or-NK | 588be67d6f934f6772a9d5f4b79cd150be6a951d | 72e1cca87ee07375d525db95401f6a06dd3a38e8 | refs/heads/master | 2023-07-08T19:09:10.932620 | 2021-08-12T00:32:56 | 2021-08-12T00:32:56 | 345,487,104 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 615 | cpp | 源.cpp | class Solution {
public:
static bool cmp(int a, int b)
{
return abs(a) > abs(b);
}
int largestSumAfterKNegations(vector<int>& nums, int k) {
sort(nums.begin(), nums.end(), cmp);
for (int i = 0; i < nums.size(); i++)
{
if (nums[i] < 0 && k>0)
{
... |
f9837b4c5297429a5bf4bcb7af68384e974ec1fe | 07ac9c56312930853eac8803224139ef090a0723 | /faery_wall.hpp | 4c37a2c39920ff9b471c4dfd69249ffb92e21dad | [] | no_license | TanushParkashVerma/Lab9 | 1b4e716b1b44eb390b11e9c014bf7facb9d753c7 | 92741a26f12a6f490cb26bdd7cd98fe3fef77b40 | refs/heads/master | 2022-03-22T03:36:28.688102 | 2019-11-29T11:34:54 | 2019-11-29T11:34:54 | 224,842,135 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 337 | hpp | faery_wall.hpp | //
// Created by tanus on 2019-11-28.
//
#ifndef LAB9_FAERY_WALL_HPP
#define LAB9_FAERY_WALL_HPP
#include "wall.hpp"
/*faery_wall class*/
class faery_wall : public wall {
public:
/*faery_wall destructor*/
~faery_wall() = default;
/*faery_maze print function*/
void print() override;
};
#endif //LAB... |
3537d0c42768dd31093996318724b5c710ac41ac | 32959b4d60a1fa8f9c064537011dd28322b902e7 | /cpp_files/process_manager.cpp | baf1b26598f183be74b5a12d2e812040bf7962be | [] | no_license | jdcia/cpp_terminal | 5108a28ca29fc925660bae2a8c21836197fae506 | d30cb759b1d73998e9a28ab13ae953a6ee5bc215 | refs/heads/master | 2022-08-26T15:24:44.949656 | 2020-05-27T00:03:50 | 2020-05-27T00:03:50 | 263,711,894 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,199 | cpp | process_manager.cpp | #include "../headers/process_manager.h"
//contructor for executing command.
process_manager::process_manager(){
needs_update = false;
//Initialize built in functions into hash map.
built_in["cd"] = &preform_cd;
built_in["pwd"] = &preform_pwd;
built_in["history"] = &print_history;
return;
}
... |
36c8561fc5737eeb5fc1b08dd129e80f84d41374 | 37f5529f9d06940c6193ef9e4b9a03efe5c1a393 | /Compiler/StringExt.h | 2c049a2c871df9be1fdfae317d37d71b95b29901 | [] | no_license | dkodnik/o2c-lev0 | f10acbcc8a072cacdde3a3039aa30e10fe9db74f | 55a9bd7124ebca0166f00131bd68e740e2b8d441 | refs/heads/master | 2021-01-09T05:54:28.827201 | 2010-11-03T21:57:59 | 2010-11-03T21:57:59 | 80,862,237 | 1 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 1,605 | h | StringExt.h | // StringExt.h: interface for the CStringExt class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_STRINGEXT_H__05EC90AD_127B_42A1_9AE4_0CBEE3307689__INCLUDED_)
#define AFX_STRINGEXT_H__05EC90AD_127B_42A1_9AE4_0CBEE3307689__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif ... |
5359efbb6dc8afdc9591af1c3a655d7fc3922185 | d40ab6f9625ab08537a9102482e4529cb8c6088b | /error_handler.hpp | b96b3d4acb9d919d3d64e5bf800c454c4def306c | [] | no_license | jsierant/eve | 7e5ea3e21b3886aaa285743136a9c219995072bf | 68cf48daf09f6f343fbab6910956134a7c2c3743 | refs/heads/master | 2020-03-16T02:28:01.181212 | 2018-05-08T12:46:50 | 2018-05-08T12:46:50 | 132,465,540 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 455 | hpp | error_handler.hpp |
#pragma once
#include "sys.hpp"
#include <stdexcept>
#include <string_view>
namespace eve {
class excetion_error_handler {
public:
void sys_critical(sys::error err, char const * sys_call_name) {
throw std::runtime_error(std::string("System error, call: ")
+ sys_call_name + ", msg: \'" + sys::to_string(e... |
f454262e1f6365154fb5806d057b77838c7a476d | 5bb7cf6f6f38e8a96ef5d522d26cf78c7c097c41 | /src/engine/server/application/CentralServer/src/shared/CharacterCreationTracker.cpp | 9f38aa57ffa034c940fe91295c4f141c4c9535c3 | [] | no_license | hackerlank/SWG_Client_Next_Main | 1c88015af11bd42c662a7d7c4fe0807924f4077a | d737257b8fc28f7ad4d8d02113e7662682187194 | refs/heads/master | 2021-01-12T06:25:56.627527 | 2016-06-01T19:32:59 | 2016-06-01T19:32:59 | 77,359,203 | 6 | 4 | null | 2016-12-26T05:09:07 | 2016-12-26T05:09:06 | null | UTF-8 | C++ | false | false | 16,202 | cpp | CharacterCreationTracker.cpp | // ======================================================================
//
// CharacterCreationTracker.cpp
// copyright (c) 2001 Sony Online Entertainment
//
// ======================================================================
#include "FirstCentralServer.h"
#include "CharacterCreationTracker.h"
#include "Conf... |
770efaa37a5e10ed5e26855886c682b9438db6bb | 6522f3a08e44416ec7e6225fa9f68b374d6362fa | /clientserverpart.h | a411ac5b0903583e174c889b3434b1d7eee21626 | [] | no_license | DimaIgorevich/QChat | 0fc93fc134d03055d9351fe41efd98379fc96843 | e9abbae143a131498a0f9318d27bd9a0f1ba59ea | refs/heads/master | 2021-01-20T15:42:49.374469 | 2016-07-02T23:59:12 | 2016-07-02T23:59:12 | 62,473,713 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 934 | h | clientserverpart.h | #ifndef CLIENTSERVERPART_H
#define CLIENTSERVERPART_H
//main class
#include "qchat.h"
//QtClass
#include <QObject>
//server library
#include <QTcpServer>
#include <QTcpSocket>
#include <QTime>
//media library
#include <QtMultimedia/QSound>
class ClientServerPart : public QObject
{
Q_OBJECT
QChat *ui;
... |
02b84f596222def8f30f2b9d8ebb714f7cc49aa8 | 2ab1149df32e49207c7e3c77417d32224a5beaf4 | /dstr/plugin1/main.cpp | e474b08711e9fdf149665ba3dd6f7b6f3f61724f | [] | no_license | Wooferpenza/Test_DPKW | 19afc0c5226cd8b200989a51f1ba3f612bc767de | de8f1397d85a132faad74dc5746b3c5424318301 | refs/heads/master | 2020-03-17T14:52:00.333532 | 2018-05-22T13:47:46 | 2018-05-22T13:47:46 | 133,688,651 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 822 | cpp | main.cpp | #include "wx/wxprec.h"
#ifdef __BORLANDC__
#pragma hdrstop
#endif
#ifndef WX_PRECOMP
#include "wx/wx.h"
#endif
#include "../include/stubs.h"
//#include "wx/xrc/xmlres.h" // XRC XML resouces
#include "wxfft.h"
#include "osc_dlg.h"
extern int sport;
class MyApp : public wxApp
{... |
f9e45b3338b3a5473c8ce8527f3c80cf4b39017f | bc0266bc6bbff79bf874607aee17aa9fc0bc7738 | /ImuFactor.hpp | 3212136eba5de6f0d33e3f545b7d7ec94345d49f | [] | no_license | leleleoo123/alsm | 88605535ba8d95ad49c783b5e1e795fdb7d1f2b1 | 4cd5216de5afc5e1bdff089c9831564f0d73dd14 | refs/heads/master | 2022-07-27T11:12:20.702912 | 2018-07-21T04:05:48 | 2018-07-21T04:05:48 | 141,776,295 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 594 | hpp | ImuFactor.hpp | //
// ImuFactor.hpp
// ekf_slam
//
// Created by 谭智丹 on 16/10/22.
// Copyright © 2016年 谭智丹. All rights reserved.
//
#ifndef ImuFactor_hpp
#define ImuFactor_hpp
#include <stdio.h>
#include <Eigen/Dense>
class ImuFactor
{
public:
ImuFactor(Eigen::Vector3d& pap, Eigen::Quaterniond& qaq, Eigen::Vector3d& va... |
742500467d1462cd9a28cc801f334bba24fe0407 | 4fc9c3821b32b37c1c802c76b584255ae790a89b | /BOJ/1000/4000s/4299.cpp | 6645d75071cbebcac9064e74174e6e67c9f1866a | [] | no_license | bww9641/Algorithm_Project | abfb4396f11affa4146d904ef7f15baef4c1a4b1 | 114b90b4caac7f802934e22b90afbeacf26c45ae | refs/heads/master | 2022-12-22T15:33:40.607774 | 2020-09-17T01:30:20 | 2020-09-17T01:30:20 | 198,115,175 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 236 | cpp | 4299.cpp | #include<stdio.h>
int main(){
int a,b;
scanf("%d %d",&a,&b);
int c=(a+b)/2;
int d=a-c;
if(c<0 || d<0 || (a+b)%2!=0){
printf("-1");
return 0;
}
if(d>c) printf("%d %d",d,c);
else printf("%d %d",c,d);
return 0;
} |
27800bfa156e869448c08d948de345955459c1f3 | 2344dc04a841fe4d67ca0e9aa99199320283e8b0 | /EchoServer/BaseServer.cpp | 535e84c25968aec534a39777d88808889468d75d | [
"Apache-2.0"
] | permissive | ly-rs90/EchoServer | e68e77479599fef207f158d08a7f4468fa8b5d1a | 1986038230e8637a937566ba28ce81fe4ea65aee | refs/heads/master | 2020-03-28T01:17:18.198388 | 2018-09-05T09:27:16 | 2018-09-06T01:52:14 | 147,493,416 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 3,250 | cpp | BaseServer.cpp | #include "BaseServer.h"
static DWORD WINAPI ThreadProc(LPVOID p)
{
BaseServer *bs = (BaseServer*)p;
while (true) {
if (!bs->m_start) break;
int index = WSAWaitForMultipleEvents(bs->m_total, bs->m_event, FALSE, 1000, FALSE);
if (index == WSA_WAIT_TIMEOUT) continue;
index = index - WSA_WAIT_EVENT_0;
WSANE... |
46be00a4d095dcd684aa3dee93ed3093fb511f53 | bdc27c22522a99b5bff2ec4cfa95fadcba65747d | /testing/adios2/engine/inline/TestInlineWriteRead.cpp | d572574992b20e4995adafcd0e16228cc088ddb1 | [
"Apache-2.0"
] | permissive | ornladios/ADIOS2 | a34e257b28adb26e6563b800502266ebb0c9088c | c8b7b66ed21b03bfb773bd972d5aeaaf10231e67 | refs/heads/master | 2023-08-31T18:11:22.186415 | 2023-08-29T20:45:03 | 2023-08-29T20:45:03 | 75,750,830 | 243 | 140 | Apache-2.0 | 2023-09-14T11:15:00 | 2016-12-06T16:39:55 | C++ | UTF-8 | C++ | false | false | 39,528 | cpp | TestInlineWriteRead.cpp | /*
* Distributed under the OSI-approved Apache License, Version 2.0. See
* accompanying file Copyright.txt for details.
*/
#include <cstdint>
#include <cstring>
#include <iostream>
#include <stdexcept>
#include <adios2.h>
#include <gtest/gtest.h>
#include "../SmallTestData.h"
class InlineWriteRead : public ::t... |
2dc07be5f1a37009f92be1ccf4d443feb8646589 | 83b8a9e0ba13a792f44fca455ba01043b9a81c78 | /201909_Algorithm/201909_Algorithm/BOJ_2573.cpp | 525ccbb0eca61ffaacf8f0363f99329cc6123d0b | [] | no_license | BoGyuPark/VS_BOJ | 0799a0c62fd72a6fc1e6f7e34fc539a742c0782b | 965973600dedbd5f3032c3adb4b117cc43c62a8f | refs/heads/master | 2020-04-14T12:45:53.930735 | 2019-12-04T03:06:44 | 2019-12-04T03:06:44 | 163,849,994 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 2,092 | cpp | BOJ_2573.cpp | /*BOJ 2573 빙산*/
#include<iostream>
#include<queue>
#include<vector>
#include<cstring>
using namespace std;
int n, m, map[301][301], check[301][301], t, iceSize, ans;
int dx[] = { 0,0,-1,1 };
int dy[] = { 1,-1,0,0 };
struct info {
int x, y, Size;
};
vector<info> v;
queue<pair<int, int>> q;
void reduceIce() {
//빙하의 크기를... |
7600bb42e0d5f44dbeeb6703a0f4140a525f08f5 | 1bd9e3cda029e15d43a2e537663495ff27e317e2 | /buoyantPimpleFoam_timevaryingBC/timevaryingCavityFoam/68/nut | baa42cb32a2cfc7450f5944551346134c9ed7661 | [] | no_license | tsam1307/OpenFoam_heatTrf | 810b81164d3b67001bfce5ab9311d9b3d45b5c9d | 799753d24862607a3383aa582a6d9e23840c3b15 | refs/heads/main | 2023-08-10T23:27:40.420639 | 2021-09-18T12:46:01 | 2021-09-18T12:46:01 | 382,377,763 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,052,569 | nut | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v2006 |
... | |
894f12e14abba32bb49593a3bb46c5287aa00bab | b301ab714ad4d4625d4a79005a1bda6456a283ec | /leetcode/165.cpp | 59aa8c26452b50abbf9619ad4f9fe9bf4c71970d | [] | no_license | askeySnip/OJ_records | 220fd83d406709328e8450df0f6da98ae57eb2d9 | 4b77e3bb5cf19b98572fa6583dff390e03ff1a7c | refs/heads/master | 2022-06-26T02:14:34.957580 | 2022-06-11T13:56:33 | 2022-06-11T13:56:33 | 117,955,514 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 835 | cpp | 165.cpp | class Solution {
public:
// string::size_type next1 = 0, next2 = 0;
int get(string& s, string::size_type& next){
if(next == string::npos) return 0;
string::size_type t = s.find('.', next);
int ret = stoi(s.substr(next, t-next));
next = (t == string::npos)? string::npos:t+1;
... |
352b4a5b0447f3d7ddc84cb9f22c627cabba1d4e | deb541defe31d46d588e97050889da36a4b40dc2 | /ALDS/ALDS_1_10_A.cpp | 628f68aa55981c510ee1cc95268e8a3e4e61d5f9 | [] | no_license | kironbot/AOJ | 6af31b47c4c78a1e9ec90850cd1a410ffcebf165 | dadcd054ff426aa76a0784a757f6dd37f302f987 | refs/heads/master | 2020-04-03T00:46:13.729945 | 2017-10-25T13:13:28 | 2017-10-25T13:13:28 | 62,116,618 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 373 | cpp | ALDS_1_10_A.cpp | #include <iostream>
using namespace std;
const int MAX = 44;
int F[MAX];
int fib(int n){
if(n==0 || n==1) return F[n];
if(F[n] != -1) return F[n];
return F[n] = fib(n-1) + fib(n-2);
}
int main() {
ios::sync_with_stdio(false);
F[0] = F[1] = 1;
for(int i=2; i<=MAX; i++) F[i] = -1;
int n;
c... |
7c4f1312585ef7e6b87d21b6d0370df1987e4dfd | b4881b5b71c66b5210bf05cf10bfd1cc1bf2822d | /gps_odometry/src/gps_angle_estimation.cpp | f612b05a52f4ac6ac64610b9e8ca5138779c3dad | [] | no_license | grvcPerception/gps_measurements | 679798f0ef804453061a462dd0542f74235c5dc9 | 2a0ac64e7d11b5109fd8967a6b4f5d83c9607f1a | refs/heads/master | 2021-04-15T18:05:27.122187 | 2018-07-19T09:27:48 | 2018-07-19T09:27:48 | 126,209,958 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,657 | cpp | gps_angle_estimation.cpp | // Jenifer Delgado Rich
// jedelrich@hotmail.com
// Odometria sacada de datos de GPS diferencial (< 2cm de error). El (0,0,0) del eje de referencia es la
// primera posicion que se obtiene del GPS y este eje de referencia esta orientado en Este --> X, Norte --> Y
#include <ros/ros.h>
#include <sensor_msgs/NavSatFix.h>... |
91f158b7680193b2e10cbcc353f04b1812bfcc8d | c55300dde68bcf6e06699e52db6f616ecefa6934 | /Classes/PlayScene/CharacterLayer/Phoenix.h | 23b426859b4c9b72e78062f09daf93d2f2e8432b | [] | no_license | Crasader/CrayRun | 40300b0d763c69bc32b6a05936b1deaa00943f73 | 535fcdd14ad9eddc68017b3bc2978098b330a574 | refs/heads/master | 2020-11-29T04:14:18.838476 | 2017-07-27T05:34:19 | 2017-07-27T05:34:19 | null | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 309 | h | Phoenix.h | /* ---- 多重インクルードの防止 ---------- */
#pragma once
/* ---- インクルード ---------- */
#include "cocos2d.h"
#include "Character.h"
class Phoenix : public Character
{
public:
bool init();
CREATE_FUNC(Phoenix);
void Animation();
private:
const float SCORECORRECTION = 1.5f;
};
|
656ef4674efefaeb7dd760c8912ded67a599aa30 | 58321bfca0f7e034beb59dfd9d788257119d687b | /dialog.h | ea7269549a38532a7c7d5f1a9289a0bc647ba6c2 | [] | no_license | Siumauricio/Zip-Explorer | 88550d428cd7604378e357226b966fb013da3a42 | 3c0fd6a185e30b1287db5e75971759b8b0e4764a | refs/heads/master | 2022-11-30T10:43:54.323372 | 2020-07-25T02:38:17 | 2020-07-25T02:38:17 | 247,225,755 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 397 | h | dialog.h | #ifndef DIALOG_H
#define DIALOG_H
#include <QDialog>
#include <QString>
namespace Ui {
class Dialog;
}
QString getTexto(QString);
class Dialog : public QDialog
{
Q_OBJECT
public:
Ui::Dialog *ui;
Dialog(QWidget *parent,QString&,QString&,QString&);
Dialog(QString&);
~Dialog();
private slots:
... |
bf16611e0488093f107f7d600c8e8cfad2a7e66b | 5480d3bfbe5c2007dfca3fbfe4c19b963cad2cf5 | /Array/MaximumSumSubarray.cpp | 90912f1121d73a49ecf7befe5c05d60850dcb174 | [] | no_license | akey-/codes | 4995c5e0c445ded3ec7154fe751b718333654330 | ba12bba02fbf517eb4ece4259c27fa8212c7bbbd | refs/heads/master | 2021-01-15T22:34:46.709617 | 2013-10-09T12:15:38 | 2013-10-09T12:15:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 732 | cpp | MaximumSumSubarray.cpp | /* Program To find the maximum sum subarray of an array
Algorithm : Kaden's algorithm for finding maximum sum subarray
Written By : Akey
*/
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int a[n];
for(int i=0;i<n;i... |
f6ef78b89dd05a043698d9ee96e559b83588a12b | 31a457260e60e50ddd3bbf3d3d9a7afe1f6594e3 | /Src/GPIOGuard.cpp | 3bf2050149093ed3d4be9a5e6be221121ef8c650 | [] | no_license | yxwsbobo/stm32Test | b02c678afabf41ae20a7afb2c7b25996399b8b7d | 726583fc3a0eda7de9acae7959a7c6358f91d240 | refs/heads/master | 2020-05-20T12:39:51.370659 | 2019-05-21T02:19:41 | 2019-05-21T02:19:41 | 185,578,258 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 267 | cpp | GPIOGuard.cpp | //
// Created by kin on 19-5-7.
//
#include "GPIOGuard.h"
GPIOGuard::GPIOGuard(const GPIOInfo &info) : info(info) {
HAL_GPIO_WritePin(info.Port, info.Pin, GPIO_PIN_RESET);
}
GPIOGuard::~GPIOGuard() {
HAL_GPIO_WritePin(info.Port, info.Pin, GPIO_PIN_SET);
} |
46cf32a20322e47ca657c9238d98577312971775 | b9843c7be60b65f4cd489e4e91efb305bcaef4e8 | /pilha2.cpp | d95f25063ada17f33e667f02ece8c633f4a17757 | [
"MIT"
] | permissive | brunoorlandin/cc4652 | f19c2374b508d5b0fdcca98b643b5d6c961437f6 | 4bd782ff59cf044daf99d5d4d97f28a2961784e1 | refs/heads/main | 2023-06-04T17:10:57.070170 | 2021-06-28T23:04:16 | 2021-06-28T23:04:16 | 381,179,518 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,505 | cpp | pilha2.cpp | /**
* @author : Guilherme Wachs Lopes (gwachs@fei.edu.br)
* @file : Pilha
* @created : quarta mai 05, 2021 19:58:32 -03
*/
#include <iostream>
using namespace std;
//classe pilha estatica
template <typename T> class Pilha {
public:
virtual bool empilha(T valor) = 0;
virtual T desempilha() = 0;
... |
9e78f519931ea9372ffb415ebae93a37e1f002b9 | 8a11dceabdf2286777d30c32a02e8d045feac907 | /Arrays-primary/283-movezeros.cpp | a2555b8554b5c365035635bac7555f06050c8236 | [] | no_license | warmthless/LeetCode | 192cb83dcb33005c0a583ba293efd39684e556fc | 7d3a29162a3bde61f5a20d01ce42c76dbc52c5f7 | refs/heads/master | 2020-03-22T12:53:02.794513 | 2018-07-25T12:35:05 | 2018-07-25T12:35:05 | 140,061,654 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 712 | cpp | 283-movezeros.cpp | //16ms
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int n = nums.size();
if(!n) return;
int i = 0,count=0;
for(int p = 0; p<n; ++p){
if(nums[p]!=0) count++;
}
if(!count) return;
while (i < count){
if(nums[i]==0){
... |
c7c39521c7c5f1cdfa88f1ada8145f0f97310959 | 62d74675721d939baae340864c0e79d3037df189 | /sample program/vector_cpp.cpp | b9ba5189bb304e1499f9a91e69a6d23a2b62b79d | [] | no_license | shubhamkanade/cpp-program | c5fe1c85d2adac7c67ebd934c34e9b69509466d4 | 0cf279bd9cd473541a8a72bfee1f4b948d7fdaba | refs/heads/master | 2021-07-12T08:49:14.479420 | 2021-07-06T03:24:06 | 2021-07-06T03:24:06 | 172,293,386 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 317 | cpp | vector_cpp.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
vector<int> v;
int n = 0;
cin >> n;
for(int i = 0;i < n;i++)
{
int a;
cin >> a;
v.push_back(a);
}
for(int i = 0;i < n;i++)
cout << v[i] << " ";
//v.push_back(10);
//v.push_back(20);
//v.push_back(30);
//for(int i : v)
//cout<<i;
}
|
19e236e4e9d632b8a3c82849a7152af7e653b6fc | 73325ee0dd580465a70a361b895a13e8fa175a3f | /Wondercraft/Wondercraft/TileType.hpp | 819dad4aa69ffb190373f71b53cd5cf565a66310 | [] | no_license | MitchellBlanchard/Wondercraft | 354e3a131b10e10b15ba3a2071e2a76920078775 | 1d2f21a0c0a36080dd2ce3e7c005846e1ebf6b51 | refs/heads/master | 2021-03-24T10:05:06.744916 | 2017-04-03T15:22:35 | 2017-04-03T15:22:35 | 81,681,175 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 81 | hpp | TileType.hpp | #pragma once
namespace TileType {
enum TileType {
NONE,
STONE,
THIN
};
} |
912b2967918ac5e3154a0ab2d557961fc232c72e | 828723f5586b09d8c1fcbe8f1d5e8e1b8ef7d4a8 | /2048_Carlos/board.cpp | 5be7c309f81d27cb31e64e34fc97fd6bf68b4c17 | [] | no_license | Carlos-yyt/2048_simple | dca9f662dec8c2856214b5b5ae3477ec176faeeb | 608264e74e854be98820f6acce241a9ca3f01639 | refs/heads/master | 2020-03-28T17:26:42.086464 | 2018-09-16T01:12:06 | 2018-09-16T01:12:06 | 148,790,721 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,299 | cpp | board.cpp | #include "board.h"
board::board()
{
}
board::~board()
{
}
int board::checkBoard()
{
int maxCell_pur = 0; //当前单个格子最大值
int score_pur = 0; //当前总得分
int BlankCell = 16; //空格子的个数
step++;
//遍历当前棋盘
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 4; j++)
{
if (BOARD[i][j] != 0)
{
score_pur += BOARD... |
b4dc9e9678805a9252dab288c4bb40ebdd9b6f91 | 3818e4ff82a096218578e4e7a60caaaddcd6756d | /Test/Data/taskstatesim.h | 5a56bc959d277d0baa3829463437a357595f354c | [
"MIT"
] | permissive | ccicconetti/serverlessonedge | bb47e1f419457c8a37f0ab8f37b16eda135d362c | f7493651aa2c83eb0735d1b8631096efcad62433 | refs/heads/master | 2023-02-25T13:17:39.384292 | 2022-12-27T11:42:29 | 2022-12-27T11:42:29 | 243,232,342 | 38 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 5,916 | h | taskstatesim.h | // generated with:
//
// mkdir output && ./spar --duration 0.001388888888888889 output
//
// https://github.com/All-less/trace-generator
//
// clang-format off
const std::string theTasks =
"0.5944444444444444,j_1,task_NDg2ODM2NDIyMDczNDQ4NzMzOA==,5729,500.0,1.91,50\n"
"0.5944444444444444,j_1,task_ODI0NzAxNTU2M... |
af0fa9a4cb89296c3e88e5c5564409da48bb3503 | 73e9ad425e832d45b5915d2e5a20f8bec3c6340c | /lib/data/batch_dataset.h | 2a0ebc691e66bfc444a30927f84ac7a9ed086941 | [
"Apache-2.0",
"MIT"
] | permissive | dmellosanjay/runtime | d7efab102eb5df28103f5ededb53b5d8fb40f6f7 | 17fadbfa00cffddd6abb6c558b4ffa2099814de8 | refs/heads/master | 2023-04-07T21:32:33.463175 | 2021-04-06T19:39:46 | 2021-04-06T19:41:41 | 355,342,402 | 0 | 1 | Apache-2.0 | 2021-04-06T22:10:41 | 2021-04-06T22:10:41 | null | UTF-8 | C++ | false | false | 20,141 | h | batch_dataset.h | /*
* Copyright 2020 The TensorFlow Runtime Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicab... |
7ff245199ff33db0709ebb6e3750a2eccbef967c | 50058dde9e89385e183b66080a4fd15c1bb0425a | /q2_tcp_server_client/q2_server.cpp | fdaded513c3feae73d03344904cb141d95f1e03d | [] | no_license | bmsohwinc/cn_assignment | 8be60383427d92c9dc887d658d81b6b06838e9ee | 44a4ac0d07dbe70b2d02582ad53c0419cb1d4eb7 | refs/heads/master | 2022-04-19T20:17:42.564453 | 2020-04-12T05:32:21 | 2020-04-12T05:32:21 | 255,013,777 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,193 | cpp | q2_server.cpp | #include <arpa/inet.h>
#include <bits/stdc++.h>
#include <chrono>
#include <netinet/in.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <unistd.h>
#define BFSZ 1024
#define MX_RQSTS 10
#define PORT 7070
using namespace std;
// simple function to output error messages
void display_error(char *err_msg) {
pe... |
c9509ee11405a7bc051a0f6638779c636412b80f | ebead5e79fce60a3f8d1b4ee700d87a04506b316 | /radio.h | c303628761a9349d071a0886d1bccf60fb69d62c | [] | no_license | charleyhuman/smarthome_gw | 1fe0e1819c833d0c69779f3a54b7ad7323992248 | 797c58c4b2926dc7514ed10def3163e0f9fecdb5 | refs/heads/master | 2016-08-11T17:29:44.612459 | 2016-01-11T05:47:26 | 2016-01-11T05:47:26 | 48,928,595 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 320 | h | radio.h | #ifndef RADIO_H
#define RADIO_H
#include <mutex>
#include <condition_variable>
#include "msg.h"
class radio
{
public:
radio(){}
virtual ~radio(){}
virtual void stop() = 0;
virtual void send(sensor_msg& tx) = 0;
virtual signed char recv(sensor_msg& rx) = 0;
//virtual void send() = 0;
};
#endif
|
5f566bf90dbcbe4ce5ca4e1cf8179eb8cdb27cae | c9b75f1f03df7339c7e350f980b9cddc5b2a3bbf | /main.cpp | e3f7711859c924382cd744c43ac120b2f0549089 | [] | no_license | anxieuse/oop_exercise_06 | 3430716a736353a8e304816c3974b350edb89f7b | 66406e3e149842d6dde8dace07e65e361d98b863 | refs/heads/main | 2023-01-23T14:33:32.855104 | 2020-12-01T21:16:52 | 2020-12-01T21:16:52 | 317,621,799 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,627 | cpp | main.cpp | /*
Короткевич Л. В.
М8О-208Б-19
github.com/anxieuse/oop_exercise_06
Вариант 21:
Фигура: ромб
Контейнер: очередь
Аллокатор: дин. массив
*/
#include <iostream>
#include <utility>
#include "Rhombus.h"
#include <algorithm>
#include "Queue.h"
const int BLOCK_SIZE = 10000;
double sqDist(std::pair<int, int> a,... |
02917029cafa7ba78daffce8162979cdab5eb934 | 202b96b76fc7e3270b7a4eec77d6e1fd7d080b12 | /modules/dom/src/extensions/domextensionurlfilter.cpp | 3842659aa75a2d32284ede7e5b92f8cfefc9f232 | [] | no_license | prestocore/browser | 4a28dc7521137475a1be72a6fbb19bbe15ca9763 | 8c5977d18f4ed8aea10547829127d52bc612a725 | refs/heads/master | 2016-08-09T12:55:21.058966 | 1995-06-22T00:00:00 | 1995-06-22T00:00:00 | 51,481,663 | 98 | 66 | null | null | null | null | UTF-8 | C++ | false | false | 13,807 | cpp | domextensionurlfilter.cpp | /* -*- Mode: c++; tab-width: 4; indent-tabs-mode: t; c-basic-offset: 4 -*-
**
** Copyright (C) 1995-2011 Opera Software ASA. All rights reserved.
**
** This file is part of the Opera web browser. It may not be distributed
** under any circumstances.
*/
#include <core/pch.h>
#ifdef EXTENSION_SUPPORT
#ifdef URL_FILTER... |
44da92228b2e341a7c2d5e699b79ddf39f95be8f | b0e31e3b8dc5815e48f20d0b9495e03408faad1c | /complex.h | d49a13731f3d8149cd10726405d21548cfc3555f | [] | no_license | mclayton7/FourierTransform | 91165c98727b8a2a1a49b931dc1dd224e83b3d57 | 57b6ab31845aa4f7b2c2bfe4753cf300d26edc47 | refs/heads/master | 2021-01-18T17:28:09.013431 | 2016-11-06T16:46:49 | 2016-11-06T16:46:49 | 9,220,647 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,017 | h | complex.h | // Complex Number Class decaration
// Mac Clayton, 2012
#include <iostream>
#include <string>
class Complex {
public:
//Default Constructor
Complex();
//Double Constructor
Complex(const double& r, const double& i);
Complex(const double& r);
//Member functions:
double... |
1b3b05faa62df8361535e1ddf7ac25804a68d974 | ba8871c14b3835835eb43199253f9b25a6cf6019 | /src/cc/CanopyHydrology_decl.hh | b789cec14c7cde17448e711f13b58851fb3ef21a | [
"BSD-3-Clause"
] | permissive | him-28/ELM-Kernels | b855deca3502268c0909e1c40c805ca9ec987af8 | c617c03679b0efce31730fdab8561838cba1a1ab | refs/heads/master | 2023-03-05T17:30:13.646934 | 2019-11-25T15:26:57 | 2019-11-25T15:26:57 | 339,632,483 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,361 | hh | CanopyHydrology_decl.hh | #ifndef ELM_CANOPY_HYDROLOGY_DECL_HH_
#define ELM_CANOPY_HYDROLOGY_DECL_HH_
#ifndef NATURE
#define NATURE
#endif
namespace ELM {
NATURE void CanopyHydrology_Interception(double dtime,
const double& forc_rain,
const double& forc_snow,
const double& irrig_rate,
const int& ltype, const ... |
dc6bc378401aceeaa4267566effd08b6ad4e5cb6 | b9cf8cfb238bdbf2c94a8d8c4a454a88b5da7abf | /include/runtime/metaspace/method.h | 20ba8751c72400bb6c199d62d7a90df89c27da87 | [] | no_license | qaralotte/simple-jvm | cd475226f6bfb7c5e205c24a878178ddd09281ac | 702198a7743a09c934063faff38c035101531a66 | refs/heads/master | 2023-06-25T03:10:52.313184 | 2021-07-23T19:10:52 | 2021-07-23T19:10:52 | 320,275,854 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,444 | h | method.h | #ifndef JVM_RUNTIME_METHOD_H
#define JVM_RUNTIME_METHOD_H
#include <string>
#include <vector>
#include "include/std.h"
#include "include/classfile/method.h"
namespace runtime {
struct MethodDescriptor {
private:
string descriptor;
uint offset;
public:
vector<string> parameter_type... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.