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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a8b2cb08a6b076353025e5a7cfb6d354710e96a5 | 3657bb42387d76fd041d37bf2d69bad7f916f16a | /Boost/Boost/dataStructures/any.cpp | 1426af6540f89e59cbde11ae095164beba15ff3e | [
"MIT"
] | permissive | goodspeed24e/Programming | 61d8652482b3246f1c65f2051f812b2c6d2d40ce | ae73fad022396ea03105aad83293facaeea561ae | refs/heads/master | 2016-08-04T02:58:01.477832 | 2015-03-16T15:12:27 | 2015-03-16T15:13:33 | 32,333,164 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,124 | cpp | any.cpp | /*
Strongly typed languages such as C++ require that each variable has a
specific data type determining the nature of information it can store. To
store arbitrary information in a variable, a language such as JavaScript
can be used which allows storing a character string, a number and a boolean
value using the same ... |
7726a7cfa66587d0a7e34752e323c095cb49b7b8 | c5b5805ed4dd2bf46fd31826670017abec8e872e | /Arrays/moveZeroes.cpp | eb2a78de236552fd492456220cbec3ba7501e7f5 | [] | no_license | maverick439/DataStructures | 3079224f0dcdf1a779e870209e6425fb11661da7 | bf5d632d8558ff4f051c4ac7939028774b39af56 | refs/heads/master | 2022-07-23T16:03:15.218699 | 2022-07-09T03:41:19 | 2022-07-09T03:41:19 | 131,743,165 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 567 | cpp | moveZeroes.cpp | /**
* Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
* Note that you must do this in-place without making a copy of the array.
*
* Input: nums = [0,1,0,3,12]
* Output: [1,3,12,0,0]
* */
class Solution {
public:
void moveZeroes(vector... |
e4936063affd9cbe017bb7127c87405447ec5222 | feaffd12105b46d72460ee2e528ed62c4e944035 | /src/_Shared/SensorConfig.cpp | b96e7a20be2e14986b6c935a3df2bf779aabeff5 | [] | no_license | Taz7842K/7842K_COMPETITION_CODE | 4f34ee80280ee50148605c6e20d11b2f0e856b06 | fe5a8cac9255fba1fc6e5e71a4d6ad97b5d8949a | refs/heads/master | 2020-04-21T06:29:45.750201 | 2019-03-30T08:45:27 | 2019-03-30T08:45:27 | 169,366,875 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 284 | cpp | SensorConfig.cpp | #include "main.h"
#include "_Shared/SensorConfig.h"
okapi::Potentiometer pot_catapult('C');
okapi::ADIEncoder enc_catapult('G','H');
pros::ADIAnalogIn light_catapult('E');
pros::ADIDigitalIn sw_catapult('A');
pros::Controller HIDMain(CONTROLLER_MASTER);
double initPotCatapult;
|
8457786091669b92a9ce3738bbc26b0408c35de3 | f5b936c57a82a479983a2adc71c2abe7d6b3ec9b | /Codeforces/round391/b.cpp | 70668d72ea5f4240b54ba2b3eb90168a824374ea | [] | no_license | FranciscoThiesen/OldProblems | 002e2099fcb7f0c874f3d8927a60d1644521bbdf | 809747fceb5a75127aae832697d6f91b63d234f5 | refs/heads/master | 2021-08-31T16:20:28.969377 | 2017-12-22T02:07:05 | 2017-12-22T02:07:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 905 | cpp | b.cpp | /*input
3
15 30 45
*/
#include <bits/stdc++.h>
#include <cstring>
using namespace std;
#define gcd __gcd
#define ll long long
#define pb push_back
#define fi first
#define se second
#define mp make_pair
set<int> factor(int x)
{
set<int> fac;
if(x != 1)
fac.insert(x);
for(int i = 2; i <= ceil(sqrt(x)); ++i)
{
... |
2c992df4e52ab85101a2bcc283c9792414bb0f8c | 387549ab27d89668e656771a19c09637612d57ed | /DRGLib UE project/Source/FSD/Public/PostDataModel.h | 2a23f96c77f1eb0dab20b35ad0791d8089a97269 | [
"MIT"
] | permissive | SamsDRGMods/DRGLib | 3b7285488ef98b7b22ab4e00fec64a4c3fb6a30a | 76f17bc76dd376f0d0aa09400ac8cb4daad34ade | refs/heads/main | 2023-07-03T10:37:47.196444 | 2023-04-07T23:18:54 | 2023-04-07T23:18:54 | 383,509,787 | 16 | 5 | MIT | 2023-04-07T23:18:55 | 2021-07-06T15:08:14 | C++ | UTF-8 | C++ | false | false | 186 | h | PostDataModel.h | #pragma once
#include "CoreMinimal.h"
#include "PostDataModel.generated.h"
USTRUCT(BlueprintType)
struct FPostDataModel {
GENERATED_BODY()
public:
FSD_API FPostDataModel();
};
|
d10627da55a856ea899f8050704d6e0a4888a6dc | 01c453f302f304d986c8e9049ba781b93fe412e2 | /utils.cpp | 928b67670f1dbee9035a2487ee947d54b4f6a874 | [] | no_license | mrwhyzzz/TcpCmdTransfer | d7ccfd8fb4555c8d3889bea6d4a87d4256e4a92d | 8d6103bdbb6595cb211f622f5fb86bef2a1e36c1 | refs/heads/master | 2020-06-04T04:00:04.492996 | 2017-05-22T02:40:24 | 2017-05-22T02:40:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,960 | cpp | utils.cpp | #include "utils.h"
#include "platformtranslator.h"
#include <QtCore>
#include <QtNetwork>
#include <log4cplus/logger.h>
#include <log4cplus/configurator.h>
#include <log4cplus/helpers/loglog.h>
#include <log4cplus/helpers/stringhelper.h>
#include <log4cplus/helpers/sleep.h>
#include <log4cplus/loggingmacros.h>
#include... |
08881ec2ee99fb159a1bc4d0b6166a0dc2a2aac3 | ed486dd66a663249f2ec6e61faa2c2a8f30e35a1 | /maximum_depth_of_tree.cpp | ef574925343f41d0fe3dafccd062c2c366e80f5e | [] | no_license | CollComm/prep | b49034579de21c510213b385edbdda6679c929c7 | e0cb9edf2da9804c1f5a6d908def64258912cd51 | refs/heads/master | 2016-09-09T19:20:37.374226 | 2014-04-01T02:41:18 | 2014-04-01T02:41:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,315 | cpp | maximum_depth_of_tree.cpp | /**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
struct StateNode {
TreeNode treeNode;
int height;
public:
StateNode():height(0), treeNode(0) {}
};
#include<stack>
class Solution... |
ec14ddca8a30b4c0ae176b861ceec49f32d83e27 | 17d63dc497e6f1b2a366bf1751cb8ef5bee067ae | /src/config_client/xconfig_and_register.cpp | e7ace03044ed87f1ba736db5c653a3d6803d1d64 | [] | no_license | hanxinle/xms | cdfccc4543d258bb5c9dc0b32101322bff262afd | 3b3c482300b245caaf32cedab36dd23ec63e99f4 | refs/heads/master | 2022-08-29T15:35:18.941631 | 2020-05-28T11:59:33 | 2020-05-28T11:59:33 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,599 | cpp | xconfig_and_register.cpp | #include "xconfig_and_register.h"
#include "xregister_client.h"
#include "xconfig_client.h"
#include <string>
using namespace std;
using namespace xmsg;
#define REG XRegisterClient::Get()
#define CONF XConfigClient::Get()
static void ConfTimer()
{
static string conf_ip = "";
static int conf_port = 0;
/////... |
6c06e9a1276c90b2c1faa627fbd31a9200bc2235 | 3722a067c0477ba213d3ead7c6e75e4c90eab510 | /src/ultrasonic.h | d6f4ce23d5eee66abd495d5caebbb693e2656f9c | [] | no_license | shuliga/poweroid-sdk-1.0 | 76a53e88c7224e1ff9b1bbd9eae16cf365957a2b | 15cd91756a2236f557e587a789f48a880c99a5a0 | refs/heads/master | 2023-01-21T10:36:34.446616 | 2023-01-08T22:51:01 | 2023-01-08T22:51:01 | 229,571,460 | 1 | 0 | null | 2023-01-08T22:51:02 | 2019-12-22T13:24:29 | C | UTF-8 | C++ | false | false | 320 | h | ultrasonic.h | //
// Created by SHL on 15.02.2019.
//
#ifndef ULTRASONIC_H
#define ULTRASONIC_H
#include "commons.h"
#include "sensors.h"
class Ultrasonic{
public:
void begin(uint8_t n);
uint16_t getDistance();
private:
uint8_t trigger_pin;
uint8_t echo_pin;
};
extern Ultrasonic ULTRASONIC;
#endif //ULTRASONIC_H
|
12f3c120a1d5186166b35c8c98234f6aa9ae26d4 | 4f072b0732be98385ab2dd8a4c4bba395fc5ab27 | /include/simex/sasm/PreprocessorLexer.h | 24743c07b0293b06bc2d5d3600b181e6a0da95f2 | [
"MIT"
] | permissive | nanolith/SIMEX | 847db15f42c9958e4b3b641bda6dacec24cabe66 | f67a3498303db5eed45472d63b623d438a7b1cb1 | refs/heads/master | 2021-01-13T13:11:58.777004 | 2020-12-03T03:39:44 | 2020-12-03T03:39:44 | 72,690,099 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,674 | h | PreprocessorLexer.h | /**
* \file PreprocessorLexer.h
*
* Lexer for the Preprocessor.
*
* Copyright (C) 2016 Justin Handville - All Rights Reserved.
*
* This file is part of the SIMEX Virtual Machine which is released under the
* MIT License. See LICENSE.txt in the root of this distribution for further
* information.
*/
#ifndef ... |
ca89d81bb17a664b7bf0437d1bef24bd02fd2390 | 864dc68b63491e6286b43ad7e9ef6c615cb6d672 | /350-str C++/350-str C++/Source1.cpp | 3652ecbcb85b11dfb3c9a784c9f0686cb5386c4d | [] | no_license | HristoHristov95/C-- | 849b65859b17f81f5f7c19218c38474b44ba7616 | a3cb964cf931f3b2c11eb2ed0fe8841fd0d0c5ac | refs/heads/master | 2021-01-01T03:51:38.704768 | 2016-04-15T18:03:18 | 2016-04-15T18:03:18 | 56,339,634 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 511 | cpp | Source1.cpp | #include<iostream>
using namespace std;
class base{
public:
virtual void func()
{
cout << "Using base version of func()\n";
}
};
class derived1 :public base{
public:
/*void func()
{
cout << "Using derived1's version of func()\n";
}*/
};
class derived2 :public derived1{
public:
void func()
{
cout << "Using... |
46c0b0ae066def5df943ec074830a406c482cacb | 08a25eadde07c7489136c61f80bf326651c293f6 | /ros_ws/src/crazyswarm/src/crazyswarm_server.cpp | 6172ec58c6ba661a380f4c5fed7b5ed6f477a713 | [
"MIT"
] | permissive | USC-ACTLab/crazyswarm | 36c03d308882518d998c4ab6b26e7e8f5c05745f | beb05492eaf226462631545bf5972199099267c2 | refs/heads/master | 2023-06-03T04:31:43.944450 | 2022-12-17T19:15:17 | 2022-12-17T19:15:17 | 68,335,694 | 296 | 296 | MIT | 2023-05-12T18:08:28 | 2016-09-15T22:18:11 | Python | UTF-8 | C++ | false | false | 64,140 | cpp | crazyswarm_server.cpp | #include "ros/ros.h"
#include <tf/transform_broadcaster.h>
#include <tf_conversions/tf_eigen.h>
#include <ros/callback_queue.h>
#include "crazyswarm/LogBlock.h"
#include "crazyswarm/GenericLogData.h"
#include "crazyswarm/UpdateParams.h"
#include "crazyswarm/UploadTrajectory.h"
#include "crazyswarm/NotifySetpointsStop.... |
bb8938847932527e1704952d6237dcf10c8503ba | f205fba722320ab8eb334c758fef5008ba92c4c9 | /LCD_display/LCD_display.ino | 6a89da2637c3413054dbacbdac75f3f34a575ac7 | [] | no_license | rumanmunir/Smart-Home-Safety-and-Security-Coding | 5854f5b4ba703085e83f89825affa8dea5482cdf | cde90875aa330d2daecf5e46d47ecb2cddc7a8f1 | refs/heads/master | 2021-01-05T20:14:18.704840 | 2020-04-28T05:11:34 | 2020-04-28T05:11:34 | 241,125,954 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,263 | ino | LCD_display.ino | #include <Wire.h>
#include <LiquidCrystal_I2C.h>
LiquidCrystal_I2C lcd(0x27,20,4); // set the LCD address to 0x27 for a 16 chars and 2 line display
void setup()
{
lcd.init(); // initialize the lcd
lcd.init();
// Print a message to the LCD.
lcd.backlight();
lcd.setCursor(0,0);
lcd.p... |
b76f70bc0b14a76fbc0b86d82ec1196e320ba0ee | 3b2211fd79750064689fe09413cbe28be8d7adcd | /src/hybrid.cpp | 22ccae18509a2bf82d7bb54b3235b87d49b46ec3 | [] | no_license | star2sea/hybrid-python-c | a5320c7c25033601dfe6d0607a3778d32c30c7ed | 8b4eb50af6eeb63dbb30d85e4feb773f3e192508 | refs/heads/master | 2020-07-01T11:47:42.864137 | 2019-08-14T01:47:44 | 2019-08-14T01:47:44 | 201,166,112 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,018 | cpp | hybrid.cpp | #include "boost/python.hpp"
#include <string>
#include <set>
extern void init_utils();
#define BOOST_PYTHON_STATIC_LIB
using namespace std;
set<string> key_names = { "key_a", "key_b", "key_c" };
namespace bp = boost::python;
/////////////////////////// boost python /////////////////////////////////
void say_hell... |
94c94c1cb29614dd3c631f187d3c27770eff0e48 | 59f1be4e21a738a2f83a3231c0772718250cd22b | /GraphicEngine/Game.h | 703ad1ce375bb06eb2932819c3c702ba7356aa74 | [] | no_license | Sharundaar/OpenGLSDL | c65407e6ad1c42dd28e0583ea53e2d18f2069b20 | 45b3de9788f348d012911bc16eeba3e443ed04c9 | refs/heads/master | 2016-09-06T21:53:15.737279 | 2015-05-22T09:28:52 | 2015-05-22T09:28:52 | 32,596,262 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,379 | h | Game.h | #pragma once
#include "GameEngine.h"
#include "Scene.h"
#include "Shader.h"
#include "InputManager.h"
#include "GraphicEngine.h"
#include "Camera.h"
#include "Cube.h"
#include "Plane.h"
#include "ParticleSystem.h"
#include "AtmosphericParticleSystem.h"
#include "FireParticle.h"
#include "SDLEventManager.h"
#include "... |
150dbf21c086f3adbe46befd6e8e284c78b81c7f | f0eeb6724147908e6903a07cd524472938d5cdba | /Baekjoon/1013_Contact.cpp | d6d7ebd64412549e31523ad9965ffe1fe5eacfe5 | [] | no_license | paperfrog1228/Algorithm | bb338e51169d2b9257116f8e9c23afc147e65e27 | 14b0da325f317d36537a1254bc178bed32337829 | refs/heads/master | 2022-09-22T23:58:28.824408 | 2022-09-09T07:01:41 | 2022-09-09T07:01:41 | 152,889,184 | 3 | 0 | null | 2019-03-24T14:49:13 | 2018-10-13T16:04:45 | C++ | UTF-8 | C++ | false | false | 289 | cpp | 1013_Contact.cpp | #include<iostream>
#include<string>
#include<regex>
using namespace std;
int n;
string s;
int main() {
cin>>n;
regex r("(100+1+|01)+");
while(n--){
cin>>s;
if(regex_match(s,r))
cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
} |
2395f8b78c25eb72a84250c3f13b8761782c2601 | dae3ee55252774b75041d841f962bbad5595253b | /code/core/src/parser2/detail/parser.cpp | c9fac349999f47fc2620bf941c3469edfff04841 | [] | no_license | alcides/insieme | a6268728f896d5433b0e9420d8f621fcf227b276 | 500d58a0ba9649da18ad0e4b36b6e94b7e98d9ae | refs/heads/master | 2021-01-17T08:37:16.117572 | 2014-09-06T11:30:30 | 2014-09-06T11:30:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 39,268 | cpp | parser.cpp | /**
* Copyright (c) 2002-2013 Distributed and Parallel Systems Group,
* Institute of Computer Science,
* University of Innsbruck, Austria
*
* This file is part of the INSIEME Compiler and Runtime System.
*
* We provide the software of this file (below described as "INSIEME")
* under... |
562a9f1ea717e4e5cfb1ceeba6d04dd57a0d9477 | 30bdd8ab897e056f0fb2f9937dcf2f608c1fd06a | /Graphs/2472.cpp | 1d9c198297d2ca596baafc2d452f88da8cb7f444 | [] | no_license | thegamer1907/Code_Analysis | 0a2bb97a9fb5faf01d983c223d9715eb419b7519 | 48079e399321b585efc8a2c6a84c25e2e7a22a61 | refs/heads/master | 2020-05-27T01:20:55.921937 | 2019-11-20T11:15:11 | 2019-11-20T11:15:11 | 188,403,594 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,418 | cpp | 2472.cpp | #include<bits/stdc++.h>
using namespace std;
#define boost() ios_base::sync_with_stdio(false),cin.tie(0)
#define all(c) c.begin(),c.end()
#define rep(i,c,n) for(i=c;i<n;i++)
#define dw(t) while (t--)
#define PB push_back
#define MP make_pair
#define F first
#define S second
typedef pair<int,int> pii;
typedef pair<long,... |
2276a6d0ad4896b3c3ca0f766a1435c01afd701c | 00061a574c9f76c248c7b71cc3e4e1042a11f17d | /ImageBase.hpp | b069e5eba93354fefa96f15c49130d1f0fa6f31a | [] | no_license | ThenTech/ImageEncoder | fb5548bc7a7d3045f63edc0845bfc33ebb7e5c48 | e321177d73707cda5a65a1b42805e700679d377f | refs/heads/master | 2022-01-11T15:46:30.844535 | 2019-05-06T07:54:33 | 2019-05-06T07:54:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,245 | hpp | ImageBase.hpp | #ifndef IMAGEBASE_HPP
#define IMAGEBASE_HPP
#include <string>
#include <vector>
#include "BitStream.hpp"
#include "Block.hpp"
#include "MatrixReader.hpp"
namespace dc {
/**
* @brief The ImageBase class
* Provides a base with the image dimensions and the raw byte buffer
* read i... |
edcde0297a92397e12cbe4e1b8434d35d5508dbe | 58de89555c46b1a6ac3c0528cc1e546ee8cfb273 | /Sample/TDXLin/Code/MyLib/File/File.cpp | 4b9c14af89b9b0c22d7a83caca28796288b29b7b | [] | no_license | syaraKamura/SmpleProject | 8cbd62e2a7d39765c9adc55512d36739af690016 | 9d36bf562b8209d62988c811f85f2a47f1cb0af2 | refs/heads/master | 2021-01-16T17:58:00.569626 | 2017-10-10T20:13:55 | 2017-10-10T20:13:55 | 100,028,049 | 0 | 0 | null | 2017-10-08T02:01:02 | 2017-08-11T12:13:15 | C++ | SHIFT_JIS | C++ | false | false | 2,997 | cpp | File.cpp | /*!/////////////////////////////////////////////////////////////////////////////////////////
☆メモ
ファイルシステムについて
ファイルの読み込み
Hedder FILE:ファイルの種類 バージョン1.0
TBLリスト
LabelName:
LabelName:
データ1
LabelName1:
データ2
LabelName2:
データサイズで記述
拡張子はmy... |
103a282247727a73861c4817a96f4f5cabef1092 | 736df3ae125da593ab85e80201338da9e06a04be | /UVA10420.cpp | 625965035ce40eb6b4932c5e95afe29ff864739c | [] | no_license | leoloveacm/Week-02-Coding-Training | c7420f4858e49e1b10191073ff81ca7bac889e66 | 9f5b5709964ec9b54a21947022a1dbf87a857aff | refs/heads/master | 2021-01-17T20:41:55.657204 | 2016-04-28T08:10:53 | 2016-04-28T08:10:53 | 56,969,799 | 0 | 0 | null | 2016-04-24T12:15:32 | 2016-04-24T12:15:32 | null | UTF-8 | C++ | false | false | 520 | cpp | UVA10420.cpp | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
using namespace std;
map<string,int>mp;
int main(){
int T;
string str;
scanf("%d",&T);
getchar();
while(T--){
cin>>str;
//cout<<str<<endl;
... |
aa1cd445d6525b3f9fbf62c14c7bec82a172cd86 | 6d9c67637ffc0876311953250e2de397beaddccf | /Licence_agreement/I_accept/PCModel1350/PCModel/3.00/Models/PCDitch/2.13.16/cpp/pl6131600ss.cpp | 07b1197414174d04f4e9f2881fafc3a453ab89c1 | [] | no_license | RedTent/PCModel | 7ed7aa95503bdd2b531929d05c44ec082d8b2562 | f98f62e15f1975f80c835fb616b36223b33c5d00 | refs/heads/master | 2023-04-18T10:14:26.302989 | 2020-08-28T09:52:50 | 2021-05-06T08:20:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,240 | cpp | pl6131600ss.cpp | _sDepthW_=_sDepthW0_;
_sNH4W_=_sNH4W0_;
_sNO3W_=_sNO3W0_;
_sPO4W_=_sPO4W0_;
_sPAIMW_=_sPAIMW0_;
_sSiO2W_=_sSiO2W0_;
_sO2W_=_sO2W0_;
_sDDetW_=_sDDetW0_;
_sNDetW_=_sNDetW0_;
_sPDetW_=_sPDetW0_;
_sSiDetW_=_sSiDetW0_;
_sDIMW_=_sDIMW0_;
_sDDiatW_=_sDDiatW0_;
_sNDiatW_=_sNDiatW0_;
_sPDiatW_=_sPDiatW0_;
_sDGrenW_=_sDGrenW0_;
... |
6f1416938c4bf511c62a8986f9129cea62f1aed2 | 5424018aa2443f3ad7688fb27afc67ffb6172f81 | /wajima/pss/src/pss/std/Logger.hpp | 7f9674843aafd17614842d7566c838b555c7b48c | [] | no_license | Amakata/wajima | f9ed0b980df70ca9738bac6d381948e0fa2b318f | 6c58b04efa0c45eb0a2f21d67b79d5058c13f586 | refs/heads/master | 2021-01-17T06:24:37.237575 | 2005-01-09T08:24:04 | 2005-01-09T08:24:04 | null | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 1,792 | hpp | Logger.hpp | #pragma once
// デバッグビルド用
// デバッグビルドで外部で配布されるプログラムはlog4cxxを使うことで、Apacheへの謝辞を記述する必要がある。
#ifdef _DEBUG
#include <log4cxx/logger.h>
#include <log4cxx/basicconfigurator.h>
#include <log4cxx/propertyconfigurator.h>
#include <log4cxx/helpers/exception.h>
#define LOG4CXX_CONFIGUER(propertyFileName) ::log4cxx::Pr... |
d29604e9fc07a08427ed2894b2e1a40b8d0e60a7 | 5a97be73f3c6e2987480194a791675259f8d7edf | /BZOJ/4423/code.cpp | f3988c90aaf840a4e69c5b0cef63135f013b7038 | [
"MIT"
] | permissive | sjj118/OI-Code | 1d33d2a7a6eeba2ed16692d663e1b81cdc1341fd | 964ea6e799d14010f305c7e4aee269d860a781f7 | refs/heads/master | 2022-02-21T17:54:14.764880 | 2019-09-05T07:16:27 | 2019-09-05T07:16:27 | 65,370,460 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 927 | cpp | code.cpp | #include<iostream>
#include<cstdio>
#define rep(i,x,y) for(register int i=(x);i<=(y);++i)
const int maxn=1550;
using namespace std;
int n,k,ans;
inline int sqr(int x){return x*x;}
inline int get(int x,int y){if(x==0||y==0||x==n||y==n)return 0;return (x-1)*(n-1)+y;}
struct UFS{
int pa[maxn*maxn],rank[maxn*maxn];
void ... |
670ad4d7ed9054e95c41a68fe9360386f48a913f | ef2a7453ca56a420c2da788cace7037192024eba | /DirectX/Component/Engine/Text/TextFloat.cpp | 7f3c6ef1742e3fe7c3b5792aa09cd6e75353eff3 | [] | no_license | 5433D-R32433/FbxSelfParser | 7055fd9303647cd6e8a445959b1b70e54a0821f0 | 6b6d21670ddaf1c57011164014a6645e4a614a22 | refs/heads/master | 2023-08-06T18:36:02.870479 | 2021-09-18T10:14:57 | 2021-09-18T10:14:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,249 | cpp | TextFloat.cpp | #include "TextFloat.h"
#include "../../../Device/DrawString.h"
#include "../../../Engine/DebugManager/Inspector/ImGuiWrapper.h"
#include "../../../Utility/JsonHelper.h"
TextFloat::TextFloat()
: TextBase()
, mNumber(0.f)
, mDecimalDigits(1)
{
}
TextFloat::~TextFloat() = default;
void TextFloat::lateUpdat... |
8715ce0a28b7ce94d67d1f32a91ee88da78c2b12 | fd6ba461ff7746a5d152576930add08ebfcbb975 | /tests/CompositeRigidBodyTests.cc | 2bd5505d1bbcbdc79ac042837981a27116254cf9 | [
"Zlib"
] | permissive | rbdl/rbdl | 658d3b07e420642dd9c9b1106daff24fd43e526f | cbd9371ce822eeea1f0a880d57f71a4c60bc9b8a | refs/heads/master | 2023-07-06T02:54:35.529726 | 2023-06-25T11:11:42 | 2023-06-25T11:11:42 | 208,891,294 | 449 | 141 | NOASSERTION | 2023-09-13T16:09:26 | 2019-09-16T20:24:46 | C++ | UTF-8 | C++ | false | false | 7,715 | cc | CompositeRigidBodyTests.cc | #include <iostream>
#include "rbdl/Logging.h"
#include "rbdl/Model.h"
#include "rbdl/Dynamics.h"
#include "rbdl_tests.h"
#include "Fixtures.h"
using namespace std;
using namespace RigidBodyDynamics;
using namespace RigidBodyDynamics::Math;
const double TEST_PREC = 1.0e-12;
struct CompositeRigidBodyFixture {
Com... |
c0a56c0dc08ec96798517d0396346684bffc4f05 | b527dac4a33ef63662a86837e6deb60fd6f820c8 | /Robot.hpp | 784d4729343b73797cb22dfc5ae20afc97ec80ff | [] | no_license | jgillespie7/robot-dynamics | 8bb55e1c00c21813d625ccbd860f6dc2a8a8c329 | 84b3061e8bb4dc1ab060908fd0acb936198bce89 | refs/heads/master | 2016-09-06T13:05:38.362566 | 2015-02-01T04:44:42 | 2015-02-01T04:44:42 | 30,125,019 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 349 | hpp | Robot.hpp | #ifndef ROBOT_HPP_INCLUDED
#define ROBOT_HPP_INCLUDED
#include <vector>
#include "Motor.hpp"
class Robot{
public:
Robot(double);
void addMotor(Motor);
void acceleration(double, double, double, double, double, double, double&, double&, double&);
private:
double mass;
std::vector<Motor> motors;
};
... |
bc0b59cf51081a2dd5506e43c1a02a42fe0dfa20 | c03ab9cee4862e304a0f0cf3d0285e41ee66cc59 | /problem1.cpp | 92797a91754440abc355b752c5c0ba69c36b76ce | [] | no_license | TashaSekularac/CodeU | 2b57d332af17e099fea7ead4989f881731047944 | a069d71750700c984495eb3e4e30dfc3cb7d235c | refs/heads/master | 2021-01-21T15:13:23.043343 | 2017-05-19T18:15:25 | 2017-05-19T18:15:25 | 91,833,213 | 0 | 0 | null | 2017-05-28T16:08:09 | 2017-05-19T18:12:51 | C++ | UTF-8 | C++ | false | false | 1,093 | cpp | problem1.cpp | #include <stdio.h>
#include <string>
#include <iostream>
using namespace std;
bool permutation ( string a, string b)
{
if(a.length()!=b.length())
return false;
int number[26];
for(int i=0; i<26; i++)
number[i]=0;
for(int i=0; i<a.length(); i++)
if(a[i]<='Z' && a[i]>='A')
... |
8f46beb82dd9593cd30a2e5036f9d194ac2033e2 | 5ae1c58c00542138200dd4b26b42af076ad0321e | /17. Robot Bounded In Circle.cpp | 3dba04446a59180f4dd69d7ae2a720e5fb6452dd | [] | no_license | psoni207/September-LeetCoding-Challenge | 18e49583af86ab0c145accbda488799d858e7f33 | b8648ccc2d241756f973c642dfd3bbf25fe6ac69 | refs/heads/master | 2022-12-25T19:29:56.174348 | 2020-10-02T17:29:15 | 2020-10-02T17:29:15 | 300,682,948 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 680 | cpp | 17. Robot Bounded In Circle.cpp | class Solution {
public:
bool isRobotBounded(string instructions) {
int pos[2] = {0, 0};
int dir[2] = {0, 1};
for(char inst: instructions){
if(inst == 'G'){
pos[0] += dir[0];
pos[1] += dir[1];
}else if(inst == 'L'){
... |
1940d60c39de9d87926fc21d82545229bcb83815 | 6d0626153ea3c0b75b0b1d314d4f69d8e77917b2 | /boj_lec/sw_basic/part4_graph_bfs/1261.cpp | bfc9da361a97c78e386ce2310792e1b5c764617f | [] | no_license | JeongP/algorithm | 020c53be5a0401ce9c8270963474cea9f7b91e1c | 18fdaeb8cda6739f6f0b285107d3433418a61fb4 | refs/heads/master | 2021-07-14T08:35:54.158475 | 2020-09-02T16:59:10 | 2020-09-02T16:59:10 | 201,872,150 | 0 | 0 | null | 2019-08-12T06:57:44 | 2019-08-12T06:37:32 | null | UTF-8 | C++ | false | false | 1,075 | cpp | 1261.cpp | #include <iostream>
#include <vector>
using namespace std;
#define MAX 100
#define INF 987654321
int n,m;
int map[MAX][MAX];
int map_crush_cnt[MAX][MAX];
int isVisited[MAX][MAX] = {0,};
int side[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};
void dfs(int depth, int row, int col, int crashed_num) {
if(map_crush_cnt[row]... |
35b60abe645cd98ea33b412bd2dcffb52ba98721 | 37d2d7feb7d6fe592450dd5e36326e1ac397ef19 | /_MODEL_FOLDERS_/jetPack/jetPackBindings/jetPackBindings_NORM.cpp | f1c53597b323e343ee69b4d3ca3cc1c183498912 | [] | no_license | marcclintdion/a7_MARC_ANIMATION_B | 51424721f07059ee02f63bba1542e4069af5cd41 | 22eff173fea023439cb0644be2b1d25fc38c2f5b | refs/heads/master | 2021-01-10T07:11:59.521520 | 2015-09-26T12:42:49 | 2015-09-26T12:42:49 | 43,204,989 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,204 | cpp | jetPackBindings_NORM.cpp | GLfloat jetPackBindings_NORM[] =
{
//number of vertices = 384
-0.126327, -1.82145e-009, -0.983778,
0.084218, 0, -0.989186,
-0.126327, -9.10725e-010, -0.983778,
-0.126327, -9.10725e-010, -0.983778,
0.084218, 0, -0.989186,
0.168436, 1.17251e-008, -0.978371,
0.126327, -8.79379e-009, 0.983778,
-0.168436... |
8e89e8453228922659d11f54b8dc27134aed1ff7 | 63c7c7e07cf23aa82b6a61a516174da63504f095 | /西北大学新生寒假训练（1）/test.cpp | 974183d6e93aa15ad9da0ad339eed5c19c178c7b | [] | no_license | Linfanty/Code-in-Freshman | 3b174b6fab510dc1aa214d760f050ca1618afc8d | b60b99f520c4740c6b8306880680a610f054f403 | refs/heads/master | 2021-01-24T12:37:29.255747 | 2018-02-27T15:10:29 | 2018-02-27T15:10:29 | 123,144,148 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 74 | cpp | test.cpp | #include<stdio.h>
int main()
{
for(int i=0;i<5;++i)
printf("%d",i);
}
|
7d8d12c6952d60c804b2f3c7a16fa4496a03ac27 | 3e70f9a3fc23925e4db47f0d2627c6d2e7b26bfa | /ch15_Object-Oriented_Programming/exercise_15_03.cc | 96012e450981fe90733ebc951026e098981721f7 | [] | no_license | PYChih/CppPrimer | 77e7445ae75026c624a6469674b62043eb54db74 | 3aa479b993970883252cacddc9d65a274aee1992 | refs/heads/main | 2023-03-04T03:44:42.817956 | 2021-02-18T02:23:39 | 2021-02-18T02:23:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 442 | cc | exercise_15_03.cc | // Exercise 15_03
// Define your own versions of the Quote class
// and the print_total function.
// Quote_15_03.cc Quote_15_03.h
// g++ -c exercise_15_03.cc Quote_15_03.cc
// g++ exercise_15_03.o Quote_15_03.cc && ./a.out
#include "Quote_15_03.h"
using std::cout;
using std::endl;
int main() {
Quote base("999-999",... |
55496c558af614cca5a18b8bceaec5d63513f146 | 9bfe274dbdf7283328baf524682746fb2ef3a57c | /srcs/GlfwWindow.hpp | bc4d3f3c2225c60029d96da681583992a21bf96d | [] | no_license | Chr0nos/opencl | 4fce189c1646c95a788949c70dd73c7d46f50164 | 365b94c0a39d06732390e6f2412353b10a620df8 | refs/heads/master | 2020-03-14T03:34:14.164740 | 2018-05-22T21:59:34 | 2018-05-22T21:59:34 | 131,422,908 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,519 | hpp | GlfwWindow.hpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* GlfwWindow.hpp :+: :+: :+: ... |
41a697674048a181487986d74197d10b177f9126 | f8c2108705d77ca24213d73240f64fe93564c111 | /util/QXmlRpcServer.cpp | 0e48eb25400bd7a19bdbc497f22cc55c2664529e | [] | no_license | MikePanMP/QDMVC | 23e2adfeacf6657c44776dc210b150136387f3a2 | 960a61f91489e7b102dfb2db8b08b556c258d7ea | refs/heads/master | 2020-06-04T21:43:54.809223 | 2014-04-29T19:00:13 | 2014-04-29T19:00:13 | 19,265,541 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,662 | cpp | QXmlRpcServer.cpp | #include "QXmlRpcServer.h"
#include "QXmlRpcServerConnection.h"
void QXmlRpcServer::addMethod(QString method,
QObject* responseObject, const char* responseSlot) {
objectMap[method] = responseObject;
slotMap[method] = responseSlot;
}
void QXmlRpcServer::removeMethod(QString method) {
objectMap.remove(method);
sl... |
f1d7fa7157a8eae4cd0a007de34286d0a74ab259 | 39b003b15d9cdf42483f43ee59293a935cd26ef1 | /F238_PlatFormSignedNew/F238_PlatFormSigned/multicommu/scpiport_internet.h | 9260f167014df97c097adc47a48ca25b6f003d2c | [] | no_license | hanqianjin/kang | f16fb3835ecd850a3a86bb93f0679c878c82acab | cc40e6be18287a7a3269e50371f2850cd03bfb5d | refs/heads/master | 2021-06-25T23:47:54.108574 | 2020-11-20T02:46:25 | 2020-11-20T02:46:25 | 142,751,390 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,056 | h | scpiport_internet.h | #ifndef SCPIPORT_INTERNET_H
#define SCPIPORT_INTERNET_H
#include "scpiport.h"
#include <QTcpServer>
#include <QTcpSocket>
#include <QSettings>
#include <QByteArray>
#include <QDateTime>
#ifdef Q_OS_LINUX
#include <netinet/tcp.h>
#endif
#define SETTING_TCPSERVER_PORT "SYS/NETWORK/TCPSERVERPORT"
class ScpiPort_inter... |
354b74244955b9bed46cfd6b97c97f5f76e9a15e | d26a306d0dc07a6a239e0f1e87e83e8d96712681 | /CANDY_12345/main.cpp | 63c8210d9195b25d1716cf5fb81cc5a3c51ec268 | [] | no_license | umar-07/Competitive-Programming-questions-with-solutions | e08f8dbbebed7ab48c658c3f0ead19baf966f140 | 39353b923638dff2021923a8ea2f426cd94d2204 | refs/heads/main | 2023-05-19T03:05:48.669470 | 2021-06-16T18:36:22 | 2021-06-16T18:36:22 | 377,588,251 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 612 | cpp | main.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int f=0;
while(n--)
{
string s;
cin >> s;
int l = s.size();
for(int i=0; i<l-1; i++)
{
if((s[i]=='c')&&(s[i+1]=='h'))
{
f++;
b... |
7fe7567fc401854055cd2743cda5fe1fc56436b8 | 150bb3e9b3f35639322e303f22a9771947169504 | /LEETCODE/EASY/DYNAMIC_PROGRAMMING/best_time_to_buy_and_sell_stock.cpp | c614fbf20a5413e6dc0b68b72c4c4ff6645514f5 | [] | no_license | aman212yadav/COMPETETIVE_PROGRAMMING | d3bb29933e506f42cdd499884c7f3be774aeaefa | f17119090705774069a3a9d2ae20d86d14b970e6 | refs/heads/master | 2020-11-27T21:33:32.194204 | 2020-02-06T15:38:14 | 2020-02-06T15:38:14 | 229,609,056 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 466 | cpp | best_time_to_buy_and_sell_stock.cpp | // problem link - https://leetcode.com/problems/best-time-to-buy-and-sell-stock
// time complexity - O(N)
// space complexity - O(1)
class Solution {
public:
int maxProfit(vector<int>& prices) {
int n=prices.size();
if(!n)
return 0;
int mi=INT_MAX,max_profit=0;
for(int i=0... |
fc03ca726d9fd0abd9227eaf93f6f3a0ec8afb2d | 93deffee902a42052d9f5fb01e516becafe45b34 | /spoj/classical/ADASEQEN.cpp | ea7456756887af7e95d825e3e0e7cb1b41fc498c | [] | no_license | kobortor/Competitive-Programming | 1aca670bc37ea6254eeabbe33e1ee016174551cc | 69197e664a71a492cb5b0311a9f7b00cf0b1ccba | refs/heads/master | 2023-06-25T05:04:42.492243 | 2023-06-16T18:28:42 | 2023-06-16T18:28:42 | 95,998,328 | 10 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 696 | cpp | ADASEQEN.cpp | #include<bits/stdc++.h>
using namespace std;
#define allof(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2005;
int N, M;
int val[26];
int dp[MAXN][MAXN];
int main(){
cin.tie(0);
cin.sync_with_stdio(0);
cin >> N >> M;
for(in... |
3beb8b500708d8b3b27690d3c33a2c2b43fdeb91 | fc4eeda20f26ae4112bfd12f6837fdb7339be183 | /os/windows/XConManager/InputDialog.h | 5e8b22cd81eca0646927182faee8b3c2a63cc198 | [] | no_license | swhors/simpson_sip_library | 8b7a64220a46e10059b020ba5c51f54208d9659e | 87d69dc0cdea49e6662e2c768697a6f58bc80f57 | refs/heads/main | 2023-03-14T00:05:12.604722 | 2021-03-01T07:47:17 | 2021-03-01T07:47:17 | 343,330,488 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 635 | h | InputDialog.h | #pragma once
#include "afxwin.h"
// CInputDialog 대화 상자입니다.
class CInputDialog : public CDialog
{
DECLARE_DYNAMIC(CInputDialog)
public:
CInputDialog(CWnd* pParent = NULL); // 표준 생성자입니다.
virtual ~CInputDialog();
// 대화 상자 데이터입니다.
enum { IDD = IDD_DLG_INPUT };
protected:
virtual void DoDataExchange(CDataExchan... |
f2590a7b18f0b13db89f6f993212fc2eff7f264d | d974dfccd9b408b4263252ff4fc066668c7b9721 | /ViscoelasticFluid/moc/moc_MainWindow.cpp | 2c7d00bf0413b45fe355501bc59d7c16048acb88 | [] | no_license | Han-S-Dance/ase-2019-20-Han-S-Dance | b895ea28072535aeb7023f4e215a9a475350f803 | 805b0b35bff9457e00a35b78821c4c0575f76644 | refs/heads/master | 2022-03-31T13:42:12.989687 | 2020-01-31T04:41:52 | 2020-01-31T04:41:52 | 218,768,787 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,146 | cpp | moc_MainWindow.cpp | /****************************************************************************
** Meta object code from reading C++ file 'MainWindow.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.12.3)
**
** WARNING! All changes made in this file will be lost!
*********************************************************... |
d09952346aef3cc564d4e83c1615b7fda0e910bc | 8841125320ae48c3ca992eda300c77bedfd33ffb | /leetcode/025. Reverse Nodes In K Group.cpp | ff0e61179a8cf907a52d979a998aedb4614a290e | [] | no_license | zjkang/algorithm | ed75e46c6cf97afb0603219be8408d31f7e87feb | c913af73144907cc272ced5dd90aedbfc96d3cd0 | refs/heads/master | 2021-01-18T23:08:46.194755 | 2017-09-12T01:13:49 | 2017-09-12T01:13:49 | 35,187,672 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,668 | cpp | 025. Reverse Nodes In K Group.cpp | /*
Author: Zhengjian Kang
Email: zhengjian.kang@nyu.edu
Problem: Reverse Nodes in K-Group
Source: https://leetcode.com/problems/reverse-nodes-in-k-group/
Tags: {Linked List}
Company: Microsoft, Facebook
Notes:
Given a linked list, reverse the nodes of a linked list k at a time and ret... |
c93bb82b097eb6f80b9394e854bee907a9ae6b87 | 8e426af05c7402cb474acbec9785e4604cbf8bd6 | /SDL2_GAME/src/TextureManager.h | 2c601f3dc02521e43957815cdcb774d19ae1578c | [] | no_license | WinRobotics/udacity-CppND-Capstone-BrickBreaker | d1c2a1806b5d3a3a924561185836db1d51e5a710 | ccabbc6377b72e7ca0caabb3b053dd31c8d5aed9 | refs/heads/main | 2023-08-04T14:22:07.443045 | 2021-09-11T14:46:04 | 2021-09-11T14:46:04 | 404,017,951 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 375 | h | TextureManager.h | #ifndef TextureManager_H
#define TextureManager_H
#include "SDL.h"
#include "SDL_image.h"
#include "game.h"
#include <iostream>
#include <unistd.h>
class TextureManager
{
private:
public:
static SDL_Texture* LoadTexture(std::string fileName);
static void Draw(SDL_Texture* Tex,SDL_Rect Src,SDL_Rect Dest);
... |
37260c3602f5ace22d9fcf9c5d740f19831fc861 | cdd55f2ef133bf0519988d325255af61672bb008 | /Board.hpp | 9460961c0db506378568741e22fdf3d21709e19d | [
"MIT"
] | permissive | atharjamel/massage-board | e7ba7f9bb17c02f0a782154a0c7da41a239de1ff | fa8a3fefe8599ee678c072f8978cb503efb40ace | refs/heads/main | 2023-05-29T16:12:39.787659 | 2021-06-16T00:30:06 | 2021-06-16T00:30:06 | 377,326,574 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 694 | hpp | Board.hpp | #include <string>
#include "Direction.hpp"
#include <map>
#include <iostream>
#include <climits>
using namespace std;
namespace ariel
{
class Board
{
private:
map<unsigned int, map<unsigned int, char>> board;
unsigned int Max_Row,Min_Row,Max_Column,Min_Column;
public:
... |
6a5177348e27f530d470c6b78796b038af282a10 | 865ca7b071c88c41a9c8fe2cccf286fd7540f959 | /cpp/PermMissingElem1.cpp | cfea675b32c027d644421e5ee6cbc5fd6cfe3f34 | [] | no_license | beetai/codility | d760a4515522a9db242f383dd5b66b515fd7053d | 68afec9d1e551d31ae84f14fc32f1bdb0b22f6db | refs/heads/master | 2020-09-03T10:02:01.036756 | 2019-11-06T05:14:34 | 2019-11-06T05:14:34 | 219,441,111 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,372 | cpp | PermMissingElem1.cpp | /* FIRST DRAFT FOR SOLUTION TO PermMissingElem: DOES NOT WORK */
#include <iostream>
#include <algorithm>
#include <vector>
int findMissingNum(std::vector<int> &A) {
if (A) {
return 0;
}
int halfInd = A.size() / 2;
std::vector<int> split_lo(A.begin(), A.begin() + halfInd);
std::vector<int> ... |
bb010f847ee26248403e96bb557210cb65d99eef | 388f9257dbac02262585dab814d4369e5ca30b29 | /include/notifier_pool.h | 7354572ffdcfb1439e752d27725e63ee0c740aea | [
"MIT"
] | permissive | Phantomape/paxos | 5356c6316f81db63f82b2d0d3f1fc08177ea2e14 | d88ab88fa5b6c7d74b508580729c4dea4de6f180 | refs/heads/master | 2020-03-12T03:43:21.281708 | 2018-07-13T23:40:47 | 2018-07-13T23:40:47 | 130,429,909 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 472 | h | notifier_pool.h | #pragma once
#include <map>
#include <mutex>
namespace paxos {
class Notifier {
public:
Notifier();
~Notifier();
int Init();
void SendNotify(const int ret);
void WaitNotify(int & ret);
private:
int m_iPipeFD[2];
};
class NotifierPool
{
public:
NotifierPool();
~NotifierPool();
... |
86f978fc2c6ae29edf0ffa32bdf0e4e510c30815 | e6a054dd17ea83265b678711b50ecb7083501e8d | /Project-CardMatch/Challenger.h | e0a41925ef7531c5a7a7f5e134e80c5ae5e9b602 | [] | no_license | DoryeongPark/cpp_tutorials | 69258f544b6d2377c5856d22e2856048907229e3 | 7a22c24069b5a0afd7870dec1b0fde6d1d1ec28f | refs/heads/master | 2021-01-22T18:24:13.297868 | 2016-09-22T11:34:42 | 2016-09-22T11:34:42 | 68,352,390 | 1 | 0 | null | null | null | null | UHC | C++ | false | false | 1,288 | h | Challenger.h | #ifndef Challenger_H
#define Challenger_H
#include "Common.h"
#include "Player.h"
#include "Game.h"
/*노드*/
typedef struct tagNode Node;
typedef struct tagNode {
int value;
int x, y;//좌표
Node* next;
}Node;
typedef Node* Np;
/*해시테이블*/
typedef struct HashTable {
Np* table;
int tableSize;
}HashTable;
class Challenge... |
b874ac3fc3bba2783c94ef54f1f238b861f78674 | d1f8551b344cb9cacb0af765dea52a51872741f6 | /src/euclideanMst/memoGfk/wspdFilter.h | 9166a7bd500c6da917cbf9a6a721199bb87f4502 | [
"MIT"
] | permissive | Oliver-desu/pargeo | f5988b679d52078edb45679dba938ab49261840d | 166f3c4766968ddbebc0f8d90e2c780ed96f0e89 | refs/heads/main | 2023-07-23T13:30:38.345645 | 2021-09-04T15:46:09 | 2021-09-04T15:46:09 | 403,062,667 | 0 | 0 | MIT | 2021-09-04T13:24:57 | 2021-09-04T13:24:56 | null | UTF-8 | C++ | false | false | 8,071 | h | wspdFilter.h | // This code is part of the project "Fast Parallel Algorithms for Euclidean
// Minimum Spanning Tree and Hierarchical Spatial Clustering"
// Copyright (c) 2021 Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associate... |
e95bf675c1f74130828e51561c949d98f6a27542 | d59e36022692822e5bef9f28d5322a32976bbbd3 | /RPG-控制台版/EnemyMgr.cpp | 6e2f1f3d723cfcd775b60b0c9a9a2f0e5d89ced4 | [] | no_license | TingXuanR/RPG-Game-In-Cmd | e4781dfb6ec8bbc60b642d07b97ada714e7bdf18 | b6a4e7491d8790b022fd4e36073a474b846f0706 | refs/heads/main | 2023-03-20T10:18:07.125358 | 2021-03-14T15:23:12 | 2021-03-14T15:23:12 | 347,670,442 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,861 | cpp | EnemyMgr.cpp | #include "stdafx.h"
#include "EnemyMgr.h"
#include "ConfigMgr.h"
#include "GameMgr.h"
CEnemyMgr::CEnemyMgr() :m_nTimer(0)
{
}
CEnemyMgr::~CEnemyMgr()
{
SAFE_DEL_VEC(m_pVecData);
}
void CEnemyMgr::createEnemies(int mapId)
{
vector<SEnemyDt*> pData = CConfigMgr::getInstance()->getEnemyDtMgr()->getAllData();
int* Bi... |
d306285b00abb6c2e72059efee88a659c2c24562 | 8cd51b4885680c073566f16236cd68d3f4296399 | /src/controls/QskComboBoxSkinlet.h | a2579e4bdb17e493b514731b50bc14d04fd53d54 | [
"BSD-3-Clause"
] | permissive | uwerat/qskinny | 0e0c6552afa020382bfa08453a5636b19ae8ff49 | bf2c2b981e3a6ea1187826645da4fab75723222c | refs/heads/master | 2023-08-21T16:27:56.371179 | 2023-08-10T17:54:06 | 2023-08-10T17:54:06 | 97,966,439 | 1,074 | 226 | BSD-3-Clause | 2023-08-10T17:12:01 | 2017-07-21T16:16:18 | C++ | UTF-8 | C++ | false | false | 1,127 | h | QskComboBoxSkinlet.h | /******************************************************************************
* QSkinny - Copyright (C) 2016 Uwe Rathmann
* SPDX-License-Identifier: BSD-3-Clause
*****************************************************************************/
#ifndef QSK_COMBO_BOX_SKINLET_H
#define QSK_COMBO_BOX_SKINLET_H... |
74811f82de35895020a2d419b4c46b9ee27c2bf0 | ea02017f2a5bd6ac68791993083b249da60b2602 | /src/LevelModel.cpp | 1d187268b388640eecbf972ff004b39d3c3ab662 | [] | no_license | aarribas/WizardsAndOrcs | fc7fbdb888f17f1f677ea0ddbd650eeff9ba0aff | c8e7e1c9ae0f6f1f852ac5f7f80fe8ccc902fdba | refs/heads/master | 2020-05-19T07:38:34.978921 | 2013-09-20T18:41:33 | 2013-09-20T18:41:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,215 | cpp | LevelModel.cpp | #include "LevelModel.h"
#include <iostream>
LevelModel::LevelModel()
{
}
LevelModel::~LevelModel()
{
//clean up of static objects
std::map<int, StaticObjectModel* >::iterator staticObjectModelIt = m_staticObjectModels.begin();
while(staticObjectModelIt != m_staticObjectModels.end())
{
delete staticObjectModel... |
bf88c586e334d200fab9a8c1fc6d282ac5aa6f07 | db1375699e6d41928bcd08191932cc7a4495ab15 | /SP1Framework/Mobs.cpp | ec15f633d39f32c9ee0a18d97b72a5b59abeed90 | [] | no_license | HideinCoffee/Studio-Project-1-Team-17 | c18a8a2a2070650f712e453057c41c368f712ee4 | 0604ca8fac5f72b8138b31386648a1c17f5e8470 | refs/heads/master | 2022-12-15T23:11:11.245723 | 2020-08-30T18:30:45 | 2020-08-30T18:30:45 | 285,766,976 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,721 | cpp | Mobs.cpp | #include "mobs.h"
Mobs::Mobs(int xpos,int ypos,int index,int damage,int health,bool canshoot, bool trackplayermode,MOVEMENTDIRECTION &mobdirection):Entity(health, true, 0, 0)
{
COORD mob;
mob.X = xpos;
mob.Y = ypos;
setpos(mob);
this->trackplayermode = trackplayermode;
this->mobdirection = mobdirection;
this->c... |
ea6dcc581c98faaa5d95c266f0b6c20522088fc6 | 598516678259b783f73f4a0b76b9b716ae178d28 | /stringCal.h | 88c1c12d5cd3c15a82197761e3ab26f67afbefaa | [] | no_license | jmherning/stringCalculatorKata | c5770c737b2f2bfd4dbf22f1fc2e351b401390cb | 7466ef7c026173df36dab13f1a2cca1e26bbf5de | refs/heads/master | 2020-04-25T07:09:23.516214 | 2019-02-26T00:03:08 | 2019-02-26T00:03:08 | 172,605,029 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 196 | h | stringCal.h | //
// Created by Jason on 2/15/2019.
//
#ifndef KATASTRINGCAL_STRINGCAL_H
#define KATASTRINGCAL_STRINGCAL_H
#include "string"
int stringCal(std::string s);
#endif //KATASTRINGCAL_STRINGCAL_H
|
ee4888cd16c0089aad934da597314d17772ee620 | f8df8a579540d618fb4706ece46ea5d89cbd573f | /BullCowGame/main.cpp | 9d3d17e9af3d92c404333084b3128d7887518d26 | [] | no_license | Trimble-Brandon/BullCowGame | e0bb37c7205318c5f646321da23622b2f4e083a6 | 098c421e732fdcbdc1aed1084ea51914e2a83117 | refs/heads/master | 2021-01-20T04:51:02.425349 | 2017-04-28T21:08:24 | 2017-04-28T21:08:24 | 89,744,813 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,181 | cpp | main.cpp | /**********************************************************
* TITLE: UNREAL/C++ PRACTICE COURSE, BULL COW GAME
* AUTHOR: Brandon Trimble
* SUMMARY: Console executable that makes use of the
* BullCow Class. This acts as the view in a MVC pattern
* and is responsible for all user interaction. For game
* lo... |
68894d9f7e8c187d938a3b80aac290012d5d539b | 6d3f8483039d63c3a0ff24a4dac6397360d3f575 | /Source/WebKit2/UIProcess/API/qt/qdesktopwebview.h | b25ddef4747de5a97d28bd79640f94fa2cfac2ba | [] | no_license | xiaolu31/webkit-node | d45d93643fecad4ff73aec1fea67a60205a84639 | ef3df7a14a1a014e7e7f8f5c7c1f3e048deefd88 | refs/heads/node | 2021-09-29T21:57:22.869737 | 2011-12-12T08:02:27 | 2011-12-12T08:02:27 | 42,396,541 | 1 | 1 | null | 2015-09-13T13:20:36 | 2015-09-13T13:20:36 | null | UTF-8 | C++ | false | false | 3,979 | h | qdesktopwebview.h | /*
* Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any l... |
5f7f67e704a6d2dd614146773d1868920120461c | 045b27be9963ea34d3806b6106d17c5341eb62c0 | /train4_4.cpp | f3cda08eb247757e7c0f44d6f2465c894ed6704b | [] | no_license | miyamur/cpp | 1f316244a88e7a99edf51904c0626b1d9fe73d6d | bbc5f914cfa7b7f4ef5e4139f1f2ad00d47141ca | refs/heads/master | 2020-05-21T05:57:05.883517 | 2019-07-28T15:30:50 | 2019-07-28T15:30:50 | 185,931,212 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,067 | cpp | train4_4.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
vector<string> v1;
string x;
while(1){
cout<<"文字列を入力 :";
getline(cin,x);
if(x==""){
break;
}
v1.push_back(x);
}
vector<string> max;
vector<string> min;
max.push_ba... |
874109a2d6dc04c6d1afc978ecc2a5b38469e2e2 | 4dc0a6936789ce0094e5ed83ddc77f4bcecb5890 | /week 3 - analog in:out/photocell_calibrated/photocell_calibrated.ino | adcd5421e4f377fa365ba89cd96cc517f936a102 | [] | no_license | IDMNYU/Interfaces-and-Net-Devices | 8171379a0146d75aa7f5119e4dc390a06c882901 | 66d51cccb2c9b49c1e87d0de058a62a155f81dad | refs/heads/master | 2020-04-20T06:39:05.617422 | 2019-03-14T10:43:18 | 2019-03-14T10:43:18 | 168,689,938 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,096 | ino | photocell_calibrated.ino | /*
HUZZAH Feather analog Input to serial and analog out with calibration
*/
// These constants won't change. They're used to give names to the pins used:
const int sensorPin = A0; // Analog input pin that the sensor is attached to
const int ledPin = 4; // Analog output pin that the LED is attached to
// variables
... |
bd5dc1f092739381c32b757602cae0b41a69f58f | f4ea512b8a156abfaef83f25e044b94c37b6dedb | /SampleCodes/Blue100/35.cpp | 56fde726f4e5093e0cd691b9f0880743147a3950 | [] | no_license | HubHikari/CompetitiveProgramming | 9d1483e0a964508e84ae233aba9cb4ade7ff88e3 | b7c471a80378183b2ed5fe86fa829ee89d26709f | refs/heads/main | 2023-04-13T07:00:13.812800 | 2021-04-24T13:51:27 | 2021-04-24T13:51:27 | 308,897,533 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,758 | cpp | 35.cpp | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace... |
a5a438a38cd6fbfa09ef7603e41f091660044519 | 5f8b0cb48cb35513c7aaed449056f17cdaa9f720 | /1859. 백만 장자 프로젝트.cpp | 71234af87d80527188f605d2941ac7cd1a668607 | [] | no_license | KeunhyoungLee/swexpert | 65ecdaecb74aa0a8306956bbe99ccc5aeb7de18e | 0a1f4577dee8c6d1f653563b21819cd42e1a5fa2 | refs/heads/master | 2020-04-14T09:02:13.585824 | 2019-03-04T08:37:41 | 2019-03-04T08:37:41 | 163,750,267 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 856 | cpp | 1859. 백만 장자 프로젝트.cpp | #include <iostream>
using namespace std;
int price[1000000] = { 0 };
int N;
int Max_index(int start);
int main()
{
int T;
scanf("%d", &T);
for (int i =1; i <= T; i++){
//int N;
long long sum =0 ;
//unsigned long long sum = 0;
scanf("%d", &N);
for (int j = 0; j < N; j++) {
scanf("%d", &pr... |
655331c160023482b8d8d4326c70b64942ad5b2d | e641bd95bff4a447e25235c265a58df8e7e57c84 | /chrome/browser/chromeos/policy/dlp/data_transfer_dlp_controller.h | 4acd17e787d3eec42294ecdadd67db413961399d | [
"BSD-3-Clause"
] | permissive | zaourzag/chromium | e50cb6553b4f30e42f452e666885d511f53604da | 2370de33e232b282bd45faa084e5a8660cb396ed | refs/heads/master | 2023-01-02T08:48:14.707555 | 2020-11-13T13:47:30 | 2020-11-13T13:47:30 | 312,600,463 | 0 | 0 | BSD-3-Clause | 2022-12-23T17:01:30 | 2020-11-13T14:39:10 | null | UTF-8 | C++ | false | false | 2,029 | h | data_transfer_dlp_controller.h | // Copyright 2020 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CHROME_BROWSER_CHROMEOS_POLICY_DLP_DATA_TRANSFER_DLP_CONTROLLER_H_
#define CHROME_BROWSER_CHROMEOS_POLICY_DLP_DATA_TRANSFER_DLP_CONTROLLER_H_
#in... |
f867cde52c6216e281c376cb5f932a38100dca3d | 62628dc5245c4612d001c7f0e7149e4e9a59429c | /Programas/c/FIBONACI.CPP | 86cce62530629e703cf97465ffa7be5ce8d81319 | [
"CC0-1.0"
] | permissive | felipeescallon/lenguajes_programacion | b3ae3477765b3100b8b454b1868e19f3a0cfc64c | 5b88bf2a95492e799c94e414997365a14db05c05 | refs/heads/main | 2023-07-13T01:37:29.360547 | 2021-08-26T14:42:20 | 2021-08-26T14:42:20 | 386,758,230 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 714 | cpp | FIBONACI.CPP | /*CALCULA EL N-ESIMO TERMINO DE LA SERIE DE FIBONACCI*/
//Serie Fibonacci=1,1,2,3,5,8,13,21,34...
//FORMULA:el termino sgte se calcula a traves de la suma de los dos anteriores
#include<stdio.h>
#include<conio.h>
void main()
{
int n,na=0,naa=0,v=0;
clrscr();
printf("Escriba el termino de la serie de Fib... |
65bfab33c968e73112deecea44231438c1c648f1 | 86fc0b275da698912b00b410b94cc7d30573f48a | /arduino/arduino/src/main.ino | c77bc1b3b8331df180dd767f8f2eac388e70583b | [] | no_license | kuthian/TrustfallDevice | db32801078bdc7b57cb2553cef348c2e859073c8 | ea181ebcd56e8a369f220b1417d5922e5fe88752 | refs/heads/master | 2020-03-28T08:19:19.290566 | 2018-09-08T18:05:44 | 2018-09-08T18:05:44 | 147,957,927 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,539 | ino | main.ino | #include <MPU9250.h>
#include <quaternionFilters.h>
#include "MPU9250.h" // Sparkfun Library
#include <SoftwareSerial.h> // Bluetooth Serial Connection
#include<AltSoftSerial.h>
MPU9250 myIMU; // Define the I2C address for the MPU
float run_vx = 0;
float run_vy = 0;
float run_vz = 0;
f... |
f2572d714c1d4324093e1ebee846a2a508f11772 | c5f67ad3724d62c712d58144b5abea10c06a2314 | /Lab4/test_inclass.in | df644bd6310fe2d5c5a98f892cdd86f2a50a89d6 | [] | no_license | hyc20908/ECE250 | fdd74688998475a292978574836b57488d3514d9 | 8d6d5e91b244eea8c8a684c9d8bb48a6337cbc64 | refs/heads/master | 2021-01-13T12:07:44.763902 | 2018-09-10T15:05:40 | 2018-09-10T15:05:40 | 78,052,948 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 550 | in | test_inclass.in | new: 9
edge_count 0
degree 2 0
degree! -1
degree! 10
insert 0 0 50 0
insert! -1 2 3
insert! 2 -1 4
insert! 2 1 -3
insert! 23 2 4
insert! 2 23 5
erase 2 2 1
erase 2 3 0
erase! -1 2
erase! 2 -1
erase! 0 100
erase! 10 3
insert 4 5 12.3 1
insert 5 4 11 1
erase 5 4 1
erase 4 5 0
insert 0 1 4 1
insert 0 7 8 1
insert 1 2 8 1
... |
c5525ba457b5b6aced0a1487f7b8ebda7916d0c1 | 14d9b87045db993172f693e60cc5eae7efc80643 | /list/linked list/有序表的并归.cpp | 740535c8bfeaf057d1aa32c00d1c3cc75479a0f8 | [] | no_license | zhangkuan-workEveryday/data-structure | ad46e0fe6bafc98c45a998c75f21fd2c87152d17 | 8987385308de829b7649c61cf00799c04237efaa | refs/heads/master | 2022-05-09T01:18:44.646764 | 2019-12-10T14:08:33 | 2019-12-10T14:08:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,865 | cpp | 有序表的并归.cpp | //顺序表的并归
//单链表的并归
//有序表并归的应用
//集合的交、并、差运算
#include <iostream>
#include <stdlib.h>
using namespace std;
//--------------------------------定义顺序、链表节点----------------------------
#define MaxSize 50
typedef int ElemType;
typedef struct SqList {
ElemType data[MaxSize];
int length;
} SqList;
typedef str... |
7e2e0b1b08b85f06e2177d547cf801be5ffba737 | 70aac9459a3d15c7da1db90f69b64b01053b6038 | /src/UI/UIItemWindow.h | 35b30f00f501ddce1dc0a00889815f1f807e96b4 | [] | no_license | kschmidtdev/project404 | 868dbea42d6954988801064d19341091f4907748 | e0fa7ae768de88aa6a956f7731614786b5ae48d8 | refs/heads/master | 2020-04-24T04:31:41.782726 | 2015-03-16T18:29:42 | 2015-03-16T18:29:42 | 32,344,228 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,420 | h | UIItemWindow.h | /**
* A description window for items.
*
* #include "UIItemWindow.h"
*
* A description window for items.
*
* Project 404 2007
*
* Authors:
* Andrew Osborne, March 29 2007, Initial Creation
*/
#ifndef UIItemWindow_h
#define UIItemWindow_h
// SYSTEM INCLUDES
//
// PROJECT INCLUDES
//
#i... |
d934ee3236cff54d0ccd9b6b9675e6db7d6fe92b | 5cb80704598e920de7603211f0190fbb0090e0e2 | /code/librairies/aidevig_WAVrecorder/aidevig_WAVrecorder.cpp | fce5998749c670b6dcd7634e47f5efec04c27261 | [] | no_license | Aidevig/braceletquentin | 4847453fabb64338592067daa43783c62d3e25ef | 1ae5d25e4b0593e43a14f9cd4578df3c6114a511 | refs/heads/master | 2021-01-21T10:19:57.563076 | 2017-11-02T16:33:44 | 2017-11-02T16:33:44 | 101,978,279 | 0 | 2 | null | 2017-10-17T14:31:45 | 2017-08-31T08:30:39 | Arduino | ISO-8859-1 | C++ | false | false | 4,817 | cpp | aidevig_WAVrecorder.cpp | #include <aidevig_WAVrecorder.h>
File toSend;
File rec;
String pref="REC";
String suf=".WAV";
unsigned long fileSize;
unsigned long waveChunk;
unsigned int waveType;
unsigned int numChannels;
unsigned long sampleRate;
unsigned long bytesPerSec;
unsigned int blockAlign;
unsigned int bitsPerSample;
unsigned long dataSiz... |
3c27fb914bf4afb264f0e5fc73bc3240316c9237 | e4d765e5d919c1221888232cf177201ca330df5a | /src/inspector/v8-deep-serializer.cc | 84bd48f8cc268cfc55019a0295305684712ce6b6 | [
"SunPro",
"BSD-3-Clause",
"Apache-2.0"
] | permissive | v8/v8 | 76d02c4a3ed542ab98118ccdc043b1d9bd1dc3f2 | 25933a97b1c4a4beeabc16da9694e66f37522457 | refs/heads/main | 2023-08-18T19:59:36.949512 | 2023-08-17T11:04:21 | 2023-08-18T19:13:45 | 24,420,506 | 23,260 | 4,890 | NOASSERTION | 2023-08-09T21:57:14 | 2014-09-24T15:24:30 | C++ | UTF-8 | C++ | false | false | 14,803 | cc | v8-deep-serializer.cc | // Copyright 2022 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/inspector/v8-deep-serializer.h"
#include <memory>
#include "include/v8-container.h"
#include "include/v8-context.h"
#include "include/v8... |
c65ec8b09f4e8675437260375647bf638131bd20 | 0e111b47e28d580ac83394d829c820f6b4cee037 | /src/architecture/arch/operands.hpp | 63ef28b0d85a4992afeea2d5e7fed843e2b45371 | [
"BSD-3-Clause"
] | permissive | mrexodia/VTIL-Python | a9da9a38bde00b7ed8d71a65140868c61732c8b2 | c847d8d8f5d2b42f6262d69e35d5378ffb202ef6 | refs/heads/master | 2022-11-15T04:40:56.018241 | 2020-07-03T18:18:17 | 2020-07-03T18:18:17 | 277,112,830 | 1 | 0 | BSD-3-Clause | 2020-07-04T13:14:45 | 2020-07-04T13:14:44 | null | UTF-8 | C++ | false | false | 4,841 | hpp | operands.hpp | // BSD 3-Clause License
//
// Copyright (c) 2020, Daniel (@L33T), VTIL Project
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above cop... |
de35e51e7c30068c0df2bacd91834c027a7e88f4 | 275be98dd8acd6d6ec6d7181245fc44705b41ecc | /eikonal/test/linear_test.cpp | ff736785cccf000921e016a621ee7da287f8efe5 | [] | no_license | MiroK/eikonal | 0f360f2a03405e556d9b482a759d40dee017dfa2 | 2b402dc005849ca8d5db4126e05e84fcba30e6e9 | refs/heads/master | 2021-01-10T22:10:18.370354 | 2013-11-10T17:06:35 | 2013-11-10T17:06:35 | 13,095,895 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,953 | cpp | linear_test.cpp | #include "linear_test.h"
#include "Seeder.h"
#include "Problem.h"
#include "GmshMeshGenerator.h"
#include "RectangleMeshGenerator.h"
#include "gs/Solver.h"
#include "gs/LinMinSolver.h"
#include "gs/LinNewtonSolver.h"
#include "gs/FMMSolver.h"
namespace eikonal
{
int all_linear_tests(int solver, std::size_t precision... |
c5f8cc130f8fc5d333ec7910b5e1c1dbc294e7c1 | b54dfbf8573327c34a385fe968853b41d31aeecc | /db_other/AcctUnownerInfoHis.cc | 99214f5ad90e34bbb748689b71bf7790933ede82 | [] | no_license | gaokewoo/boss | feb2b238d071af1a6055435a1626b06764c1f3c4 | 6f376a97e98d765c8e972b65aed765bd4a2f9113 | refs/heads/master | 2020-08-05T02:04:29.437573 | 2014-10-10T14:07:33 | 2014-10-10T14:07:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 788 | cc | AcctUnownerInfoHis.cc | #include "AcctUnownerInfoHis.hh"
string AcctUnownerInfoHis::insSQL="INSERT INTO ACCT_UNOWNER_INFO_HIS(ACC_NBR,ITEM_SOURCE_ID,ACCT_ITEM_TYPE_ID,REGION_CODE,UNOWNER_FEE,INSERT_TIME,STATE,STATE_DATE)VALUES (:ACC_NBR,:ITEM_SOURCE_ID,:ACCT_ITEM_TYPE_ID,:REGION_CODE,:UNOWNER_FEE,SYSDATE,:STATE,SYSDATE)";
void AcctUnownerIn... |
a12a894577673543c8bbc5669458ffb2810bf7d1 | 32b8db47c9335f65aeb39848c928c3b64fc8a52e | /tgame-client-classes-20160829/CfgDescCpp/WeaponBuffCfg.pb.cc | 204e5c248b5886c7b0f41b2989d4964b6ca73ea1 | [] | no_license | mengtest/backup-1 | 763dedbb09d662b0940a2cedffb4b9fd1f7fb35d | d9f34e5bc08fe88485ac82f8e9aa09b994bb0e54 | refs/heads/master | 2020-05-04T14:29:30.181303 | 2016-12-13T02:28:23 | 2016-12-13T02:28:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 14,686 | cc | WeaponBuffCfg.pb.cc | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: WeaponBuffCfg.proto
#define INTERNAL_SUPPRESS_PROTOBUF_FIELD_DEPRECATION
#include "WeaponBuffCfg.pb.h"
#include <algorithm>
#include <google/protobuf/stubs/common.h>
#include <google/protobuf/stubs/once.h>
#include <google/protobuf/io/coded_strea... |
f7d4f5e8bc31d6fc69a27d2e32f1625c7d100624 | f74fd64254c149ae18ab5f471de04173eebc4d7b | /sheet1/decimal_to_binary.cpp | f10a8ac4ac861dbd63587a417f6b22957293af5e | [] | no_license | prithvisbisht/CEC | 05c66dc0d62a2f710a8429ec85cf8d7135312eaa | 27f207571852732263f3975907559282e2df3ae8 | refs/heads/master | 2018-07-23T02:36:58.037678 | 2018-06-02T11:24:08 | 2018-06-02T11:24:08 | 118,794,708 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 537 | cpp | decimal_to_binary.cpp | #include<iostream>
#include<sstream>
using namespace std;
namespace patch
{
template < typename T > std::string to_string( const T& n )
{
std::ostringstream stm ;
stm << n ;
return stm.str() ;
}
}
void tobinary(int num)
{
string s="";
while(num!=0)
{
int rem=num%2;
string t... |
6b08b226417932a3c6289551c46bf1d5c00a16eb | c51b9b0994649487903f43fc095726e4c15d0d9a | /Sources/SBEditor/Vec2.h | a231b114bd570871261c4aba24776733f283653b | [] | no_license | danskcarvalho/ColorNShapes | e2374282b56e81afa5fe809cf27b5700a4b8fe79 | b9e3a9600068a4c805adc975781e7255116699ce | refs/heads/master | 2021-01-10T12:47:50.638990 | 2016-01-03T03:34:50 | 2016-01-03T03:34:50 | 44,114,244 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,116 | h | Vec2.h | /**
Copyright (C) 2014 Danilo Carvalho - All Rights Reserved
You can't use, distribute or modify this code without my permission.
*/
#pragma once
#include "Utils.h"
namespace sb {
enum class RotationDirection {
shortest,
ccw,
cw
};
struct Vec2 {
public:
//Members
float x, y;
//Static Members
static... |
c6f69e08424c7d280fad0e7a86de331fb52f0d7e | fe479340153355e43d3ce3f3c3d058b7764d2a98 | /Projects/Base/Util/Formatter.h | 37b63444d6cb8e419b8f0fa010a024a220709391 | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | LudoSapiens/Dev | 8496490eda1c4ca4288a841c8cbabb8449135125 | 8ad0be9088d2001ecb13a86d4e47e6c8c38f0f2d | refs/heads/master | 2016-09-16T11:11:56.224090 | 2013-04-17T01:55:59 | 2013-04-17T01:55:59 | 9,486,806 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,697 | h | Formatter.h | /*=============================================================================
Copyright (c) 2012, Ludo Sapiens Inc. and contributors.
See accompanying file LICENSE.txt for details.
=============================================================================*/
#ifndef BASE_FORMATTER_H
#define BASE_FORMATTER_H
... |
eaa673195beb79e28ce9620ebe2926696847decd | 4a70a3a8a929b80f6adc093557a5f0daead6d1f9 | /UR5_demo/receiveMessagesUR5.h | bb78e028cc24968dc1909becd3bc4f65b1b6d684 | [
"MIT"
] | permissive | wwkkww1983/UR5_demo | 1af2f27dc91c929b929830099495f1721a6ec754 | 4a09a7fa551d6f3abba07c66e9eda24f10d19505 | refs/heads/master | 2023-06-23T14:25:27.785913 | 2021-07-26T04:01:57 | 2021-07-26T04:01:57 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,351 | h | receiveMessagesUR5.h | #pragma once
#include <WinSock2.h>
#include <sstream>
#include <iostream>
using namespace std;
#define MSGSIZE 1220
#define SAFETY_MODE_UNDEFINED_SAFETY_MODE 11
#define SAFETY_MODE_VALIDATE_JOINT_ID 10
#define SAFETY_MODE_FAULT 9
#define SAFETY_MODE_VIOLATION 8
#define SAFETY_MODE_ROBOT_EMERGENCY_STOP 7
#d... |
d3678cf054076daa888f83f2642c1eb1fe6227a1 | 50be99b8ad59f9c6a158dfe3007c54b8c88ac82a | /SLS_4DOF/BMP.cpp | bbac7e8f3b61b13ec307262081ebc4af2d16f213 | [] | no_license | mikihiroikura/SLS-Simulator | c84b6c3d160836120f8b736c7a1a3bce9963dfe7 | 42f83bacba7056b02697073d1514c12fe7d672a4 | refs/heads/master | 2020-04-01T18:22:04.581967 | 2018-10-17T16:18:20 | 2018-10-17T16:18:20 | 153,487,800 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 2,861 | cpp | BMP.cpp | #include "BMP.h"
/////////////////////////////////////////////////////////////////////////
// BMPヘッダの初期値
/////////////////////////////////////////////////////////////////////////
void initHeaders(BitmapHeaders *file){
file->filetype1 ='B';
file->filetype2 ='M';
file->filesize = 0;
file->reserve1 = 0;
file->re... |
6754e9cec620580c72a22d2a86e5656b6090cfc3 | 3082fc11f32c945e6129b5c4ee54ffbfae97fbca | /JoshLewis_Proj9.cpp | cf83fd8bdee232ffe1216045be3d334fdd147344 | [] | no_license | l3e0wu1f/cpp | a3e046d3bb8dd515601f76b86edeecb972bf5cda | a788d008a75df6c1c7e4e76909f07ca451d6cf06 | refs/heads/main | 2022-04-10T03:15:31.436021 | 2020-03-26T16:20:52 | 2020-03-26T16:20:52 | 250,307,239 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,537 | cpp | JoshLewis_Proj9.cpp | //
// JoshLewisProj9.cpp
//
//
// Created by Josh Lewis on 12/6//17.
//
//
#include <iostream>
using namespace std;
int str_length(char s[], int start);
// Recursive version of strlen.
// It returns the length of the substring from s[start] to
// the char before '\0',
// inclusive. When str_length(s,0) is called,
/... |
ba8f06d49d8856e9713b42a97750845c781f5efb | 8edc9fcde2e6a16a5e268a4c7acfbddf50319775 | /src/aloha_node.cpp | 3c7e4d418269aa787152fa76b6ed8f93de8f33e5 | [
"MIT"
] | permissive | ashariati/pulson_ros | 676a678fa97c766aa65b83406a9679070319f74d | 92ac115e3d8e24dc1cc9a5a0ceec268b61acae0b | refs/heads/master | 2020-12-24T07:53:09.547145 | 2017-08-17T16:35:17 | 2017-08-17T16:35:17 | 59,228,435 | 2 | 6 | MIT | 2019-07-31T23:04:04 | 2016-05-19T17:38:03 | C | UTF-8 | C++ | false | false | 10,733 | cpp | aloha_node.cpp | #include <ros/ros.h>
#include <pulson_ros/P4xx/RangeNet/rcmIf.h>
#include <pulson_ros/P4xx/RangeNet/rcm.h>
#include <pulson_ros/P4xx/RangeNet/ALOHA/rn.h>
#include <pulson_ros/RangeNetNDBEntry.h>
#include <pulson_ros/RangeNetNDB.h>
void init(int node_id,
rcmConfiguration *rcmConfig,
rnConfiguration ... |
acef0d93cdf424c2c57a56eb48119a9660232474 | eb32bca809264605597a1c112ddb8d2dcde5efb7 | /p307.cc | 14db7e45a3386fde92a4bf14bbff0415218e9091 | [] | no_license | superweaver/leetcode | fe423beebafe2b92935ac2376af5cee6da7d55ed | 7e90a53dbbb28511053a34812bd18209d4adfb26 | refs/heads/master | 2023-06-21T20:25:08.284150 | 2023-06-19T17:48:11 | 2023-06-19T17:48:11 | 109,064,436 | 0 | 0 | null | 2020-01-23T05:44:26 | 2017-10-31T23:49:55 | C++ | UTF-8 | C++ | false | false | 2,429 | cc | p307.cc | #include "common.h"
class NumArray_segment {
public:
NumArray_segment(vector<int> &nums) {
// root is in i = 1
// leftchild = 2*i, rightchild = 2*i + 1
d_size = nums.size();
sgtree.assign(2 * d_size, 0);
for (int i = 0; i < d_size; ++i) {
update(i, nums[i]);
... |
db919ba1ecbd9c212fbc716202d8572f26925261 | bcb9344032d941729b49952bbb2e17468002e6cb | /Homework 5/Homework 5/BearHelper.h | 9466e4108504c8e01caf0e5c8197d3e3be5f5d3c | [] | no_license | FalseShepherd/System-Programming | 738a53d2bbf9f02b5e9b5957c62a7e1c7877ed65 | 0d0baf38ffeddc68bf2f478bf3f65eb197393ee3 | refs/heads/master | 2021-01-20T19:14:01.018675 | 2016-06-16T23:30:39 | 2016-06-16T23:30:39 | 61,326,461 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 525 | h | BearHelper.h | #ifndef __FunctionTemplates__bearHelper__
#define __FunctionTemplates__bearHelper__
#include <stdio.h>
class BearHelper
{
public:
BearHelper(const char *);
~BearHelper();
void GetAllWords(const char* required, const char* available);
private:
//A string that will store the entire dictionary
char* the... |
ae72d87959f9af6b4e6faa67c08c5a6554a8435e | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5690574640250880_0/C++/Zwergesel/solution.cpp | 73baf895a6a8bd18f0f5ad0d06b51a4977132a1b | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 2,442 | cpp | solution.cpp | #include <iostream>
#include <cstring>
using namespace std;
char g[50][50];
void printg(int r, int c) {
for (int i=0; i<r; i++) {
for (int j=0; j<c; j++) {
cout << g[i][j];
}
cout << '\n';
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
for (int casenum=1; casenum<=t; ca... |
0a03e2681103a3b4278afbff1bf3bb7137f1ec9c | 975d45994f670a7f284b0dc88d3a0ebe44458a82 | /servidor/WarBugsServer/WarBugsServer/Includes/CBonusSecundario.h | a0a557b4e56a84dc5e95500ef101d475dbbf5663 | [] | no_license | phabh/warbugs | 2b616be17a54fbf46c78b576f17e702f6ddda1e6 | bf1def2f8b7d4267fb7af42df104e9cdbe0378f8 | refs/heads/master | 2020-12-25T08:51:02.308060 | 2010-11-15T00:37:38 | 2010-11-15T00:37:38 | 60,636,297 | 0 | 0 | null | null | null | null | WINDOWS-1250 | C++ | false | false | 542 | h | CBonusSecundario.h | #pragma once
/*
* Classe CBonusPrimario
*
* Autor: Eder Figueiredo
*
* Objetivo: Descrever os bonus primários de um personagem
*
*/
#ifndef _CBONUSSECUNDARIO_H_
#define _CBONUSSECUNDARIO_H_
#include "CHabilidadesSecundarias.h"
#include "CBonus.h"
class CBonusSecundario : public CBonus
{
private:
CH... |
7b864e356074c0ce37e6ecea85fd66a7bdbf524e | 434072465045438a89095e50abfa4b8c10ba5581 | /include/delfem2/mat3.h | 1d33728d2f63c87a7331420e182a9c31bf26e1a3 | [
"MIT"
] | permissive | mmer547/delfem2 | 8dd616e9b9eb90705a7a3fd9f489f6e48cd0de1b | 4f4b28931c96467ac30948e6b3f83150ea530c92 | refs/heads/master | 2022-01-20T09:02:45.532451 | 2022-01-09T02:36:28 | 2022-01-09T02:36:28 | 229,833,058 | 1 | 0 | MIT | 2019-12-23T22:44:02 | 2019-12-23T22:44:01 | null | UTF-8 | C++ | false | false | 12,803 | h | mat3.h | /*
* Copyright (c) 2019 Nobuyuki Umetani
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
/**
* @file 3x3 matrix class (CMat3) and functions
* @detail The order of dependency in delfem2 is "vec2 -> mat2 -> vec3 -> quaternion -> mat3... |
b9276f2fa2840b958e266015c84c6a826aa0c955 | 60ec79331c650219e77085f9324a2529adb8eb0c | /src/AtlantScanner.cpp | f2dd9ecde06714de2b608ebf8f9e6fcaeb9b47ef | [
"BSL-1.0"
] | permissive | jkerkela/atlant-scanner | 425663e1bbd1d3cd7d6d014711deeb24b8482572 | b94788c394499c64bae50b70ceab6b757354b1cc | refs/heads/master | 2023-05-14T16:21:17.128201 | 2021-06-06T13:48:37 | 2021-06-06T13:48:37 | 356,198,057 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,257 | cpp | AtlantScanner.cpp | #include <iostream>
#include <string>
#include <set>
#include <exception>
#include <stdlib.h>
#include "Authenticator.hpp"
#include "ScanMetadata.hpp"
#include "FileScanner.hpp"
#include "ScanPoller.hpp"
#include "ResultPrinter.hpp"
int main(int argc, char* argv[])
{
if (argc != 5) {
std::cerr << "Invalid command ... |
7e5819116fd9b0eb5b637ac690614d33f8c0f3c1 | 9f2b07eb0e9467e17448de413162a14f8207e5d0 | /libsrc/pylith/feassemble/obsolete/GeometryTri2D.cc | 82e733eac98559ec2e236850bf9f0492e02663b2 | [
"MIT"
] | permissive | fjiaqi/pylith | 2aa3f7fdbd18f1205a5023f8c6c4182ff533c195 | 67bfe2e75e0a20bb55c93eb98bef7a9b3694523a | refs/heads/main | 2023-09-04T19:24:51.783273 | 2021-10-19T17:01:41 | 2021-10-19T17:01:41 | 373,739,198 | 0 | 0 | MIT | 2021-06-04T06:12:08 | 2021-06-04T06:12:07 | null | UTF-8 | C++ | false | false | 7,461 | cc | GeometryTri2D.cc | // -*- C++ -*-
//
// ======================================================================
//
// Brad T. Aagaard, U.S. Geological Survey
// Charles A. Williams, GNS Science
// Matthew G. Knepley, University of Chicago
//
// This code was developed as part of the Computational Infrastructure
// for Geodynamics (http://... |
97aa0f8d81c1e56314d3dec9d83c81c8a812716a | c05742304c66fe704ada0b7a3c5a2ddf151c586d | /EasyBMP_1.06/sample/EasyBMPsample.cpp | 2b25ca22f0f888a15826bc1efe5052d27f6a3dd7 | [
"BSD-3-Clause"
] | permissive | badass-techie/Handwritten-Text-Reader | c5052997ac70e1da70a4c160060afaa9a6cc53ae | 45f96c4c9ef751f5dad603ed36e56bda0d6458b0 | refs/heads/master | 2022-04-18T02:56:23.299016 | 2020-04-20T17:42:42 | 2020-04-20T17:42:42 | 257,348,438 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,835 | cpp | EasyBMPsample.cpp | /*************************************************
* *
* EasyBMP Cross-Platform Windows Bitmap Library *
* *
* Author: Paul Macklin *
* email: macklin01@users.sourceforge.net *
* support: ht... |
2bf3fd33459fbb4355e9a5b0ba518041143376f8 | 72b829af6b90821c89fa7078ba0443410051f2a4 | /Algorithms/C++/traverse_array.cpp | 09e7f286b1a29768cf5b5869ca2d6553232655d9 | [] | no_license | reevs2204/HacktoberFest21-1 | bec731ed7454de96e550058a2069d3edff48f1af | ffb4a7fee1fe4ee3ea0d024e2991608f1ccd3729 | refs/heads/main | 2023-09-01T08:39:27.748569 | 2021-10-16T19:14:50 | 2021-10-16T19:14:50 | 417,912,712 | 0 | 0 | null | 2021-10-16T18:23:39 | 2021-10-16T18:23:38 | null | UTF-8 | C++ | false | false | 380 | cpp | traverse_array.cpp | #include<iostream>
using namespace std;
int main()
{
int A[100],K=0,UB;
cout<<"Enter the Array size less than 100:";
cin>>UB; /* To enter the size of Array */
cout<<"Enter the elements in array: \n";
for(K=0;K<UB;K++)
{
cin>>A[K];
/* Entering elments of 1-D Array*/
}
cout<<"The Traverse of array is:\n";
for(K=0;K<UB;... |
758596fbad541d1b8e5c13b75336b74ffd981285 | 3765be4ab5d4d7829a22208118b255e2c5cc8251 | /task 113.cpp | 09215cce7d73c86fa814a9dbabe924c980209271 | [] | no_license | omirzakye/practice-new- | b84449a1020f63d9123d92781c3a6e1039531460 | a40239aca410784e595b5f416a9f952329dc5900 | refs/heads/master | 2020-09-13T02:06:57.501921 | 2019-11-22T07:25:01 | 2019-11-22T07:25:01 | 222,629,232 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 227 | cpp | task 113.cpp | #include<iostream>
using namespace std;
int main()
{
for(int i=0; i<20; i++)
{
if(i%2==0){for(int k=0; k<10; k++){cout<<i;}cout<<endl;}
else{for(int k=0; k<10; k++){cout<<1;}cout<<endl;}
}
}
|
7c6f01fd4c7c00556b004354d8f20e983d4d43c0 | 99443caca00e7da2e8a93143acbc42cc8c453df9 | /Source/OCCore/Task/ITask.h | 1c0e96b01eeed8cfef9a188429276f67803522e1 | [] | no_license | RexOrCine/opencine | 9f26aff5a61973bdfc8e3e1266539e9481a107d1 | c8e279dfe003f147362f8c135b01f90566c30071 | refs/heads/master | 2021-01-01T06:03:22.434701 | 2019-01-06T06:11:34 | 2019-01-06T06:11:34 | 97,345,332 | 0 | 0 | null | 2017-07-15T22:19:56 | 2017-07-15T22:19:56 | null | UTF-8 | C++ | false | false | 795 | h | ITask.h | #ifndef ITASK_H
#define ITASK_H
#include "OCCore_export.h"
#include "ITaskProgress.h"
class OCCORE_EXPORT ITask : public ITaskProgress
{
Q_OBJECT
protected:
unsigned int _id;
public:
ITask()
{
GenerateTaskID();
}
~ITask()
{
}
unsigned int GetID(... |
ec15ae8943d7a6479992ad01c87e8efc4f523727 | cfc0ff7895dcfab02db5bbb4577865838a7fb240 | /experimental/poopi/firmware/arm/ramFile.cpp | 9fef73f6f572ec0381d926a3a43f7980c1c78ca2 | [] | no_license | hamer13/speccy2010 | 8ae66662388a02b467dac7c3371b883b8e126ef4 | b7d9e2673890739bda416a36c5b335fe165496d0 | refs/heads/master | 2020-06-08T11:28:55.134271 | 2015-03-24T23:18:46 | 2015-03-24T23:18:46 | 32,830,036 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,063 | cpp | ramFile.cpp | #include "system.h"
#include "ramFile.h"
#include "types.h"
#include "specShell.h"
#define RF_MAX_SIZE 0x00100000
#define RF_MAX_FILES 8
#define RF_START_ADDRESS 0x00800000
static int bankState[ RF_MAX_FILES ];
int rf_open ( RFIL *rfile, const char *name, byte flags )
{
int bank = 0;
while(... |
2584b7d97641df86b21891cdcc39289d6b72ff0b | 14714e59c0232aec9e9369a769b96003c23d9e01 | /Vehicle.cpp | acadf7bd2da65ce34d3d642c2f591cce4eba9933 | [] | no_license | uddeshkatyayan/Traffic_Simulation | 4fab309cb57c3075afc7536f1d81cb882b9abc82 | c516b9986172a0a43918cc3ae72224fa2eea559d | refs/heads/master | 2021-10-25T04:11:21.230296 | 2019-03-31T14:37:02 | 2019-03-31T14:37:02 | 173,877,293 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,209 | cpp | Vehicle.cpp | #include <iostream>
#include <string>
#include <vector>
#include "Road.h"
#include "Vehicle.h"
#define DEFAULT_VEHICLE_TYPE "Car";
#define DEFAULT_VEHICLE_LENGTH 2;
#define DEFAULT_VEHICLE_WIDTH 2;
#define DEFAULT_VEHICLE_MAXSPEED 1;
#define DEFAULT_VEHICLE_ACCELERATION 1;
#define DEFAULT_VEHICLE_ID 4544;
#define DEFAU... |
ed633462b00a5037116f143d8007a7a4bc47a54d | df9e934f7d19288c50e9553faa6a3200ac9bd8de | /array_manipulation.cpp | dcaf6591858eae8b2323a2cfb971d9378731bb19 | [] | no_license | sixthkrum/2048 | 3df1fffd42c840de8eaeca6e270761149dc08348 | 53ea39b3509f26bbd22d54e327072a9a3e7689ce | refs/heads/master | 2021-02-04T02:25:50.271361 | 2020-03-27T13:40:31 | 2020-03-27T13:40:31 | 243,603,450 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,174 | cpp | array_manipulation.cpp | #include "array_manipulation.h"
int components_move_up(int numarr[4][4])//moves components up until they reach the boundary or they touch another component uppermost components are moved first and empty spaces have zeros in them if two similar components touch then the bottom most one dissapears and the uppermost one ... |
ff2708f0a1a8616dc0393a90075468f4ef9b7366 | 060370ad797c542ea812d61f755370a9d802d49c | /Practica Schaken/Practica Schaken/Bishop.h | 0768e9798a434082efc62eb345469ac3033c9008 | [] | no_license | JamyDev/OO1-SchaakSpel | d5bad88b4073a40e3952427cbd12753dbd573f46 | 0793f146f47dd2959020e9374b0a272d06448c6f | refs/heads/master | 2020-12-03T05:27:04.339105 | 2015-05-07T20:51:49 | 2015-05-07T20:51:49 | 33,771,950 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 209 | h | Bishop.h | #ifndef BISHOP_H
#define BISHOP_H 1
#include "Piece.h"
class Bishop : public Piece
{
public:
bool isValidMove(const Move& move, Game& game);
Bishop();
Bishop(enum Color colornum);
private:
};
#endif |
1e43b11b20e5b740869bd2a74ec926e9385772a6 | bc2308447d3b2f9899073e0372e99180a2211642 | /PuzzleGame/PuzzleGame/Source/BoardHandler.h | 88cdced641d0b9564cdda55053bd4ceabcf0c267 | [] | no_license | iris-rod/PuzzleGame | 1abc7f0c42a1f0b6464a776223b9d274c550e08e | 39e00562f8e40db2c51fdab3df75b261363b2d73 | refs/heads/master | 2023-03-09T08:09:46.691588 | 2021-02-21T22:43:00 | 2021-02-21T22:43:00 | 270,353,788 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 952 | h | BoardHandler.h | #pragma once
#include "Board.h"
using namespace PieceStuff;
class BoardHandler {
public:
BoardHandler();
void Init(shared_ptr<SDLEventHandler>& sdl_handler, shared_ptr<EventListener>& other_handler);
void AddColumn();
void Restart();
void HandleAddedNewColumn(shared_ptr<EventListener>& handler);
const vector<sh... |
39ff99711ca06273fb9c84a02da235ac34d69a25 | 5947865dc56dc2906951f21b780db5dc901848c5 | /GeeksforGeeks/Sum of all substrings of a number.cpp | 9f9512b9ebe219dbf56ffbb3b5f69d7cc96829ce | [] | no_license | nishu112/Geek-Codes | 6d9cad76291d7c56900bd988c0c123db6d900c36 | f7eece428655c1f656e402b321260f234de62153 | refs/heads/master | 2021-10-07T09:31:13.379816 | 2018-12-04T16:36:54 | 2018-12-04T16:36:54 | 121,122,751 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 388 | cpp | Sum of all substrings of a number.cpp | #include<iostream>
#include<string>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string str;
cin>>str;
int l=str.length();
int i=0,num=0;
while(str[i]!='\0')
{
int j=i;
int mynum=0;
while(str[j]!='\0')
{
mynum=mynum*10+(str[j]-48);
num+=mynu... |
1ad72afbac5dd6658bc5b3b41c736106edf091d8 | 4497624912a7af7dbdb800e9c0b152af1cca2655 | /1063A.cpp | c8db3903b835200b79bef008f1807052df65bbca | [] | no_license | singhaditya8499/Codeforces | 0a978ea628660e18188856671e742a4cfec7cb28 | b73e9654b319580648c016659a915174615a6ed5 | refs/heads/master | 2021-05-18T12:22:21.857546 | 2020-04-22T19:14:30 | 2020-04-22T19:14:30 | 251,241,430 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 379 | cpp | 1063A.cpp | //white_whale
#include<bits/stdc++.h>
#include<unordered_map>
#define mod 1000000007
using namespace std;
typedef long long ll;
int find(int x,int father[])
{
if(father[x]==x)
return x;
return father[x]=find(father[x],father);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
str... |
210d3169c7d28a8dadef906e2ba821883b46f80f | 861aca8eeed02b5080eb59b3d5957e633fcb7fa9 | /include/engine/render_system.h | 373a25697c204e382e989317061ccc3de1201265 | [
"MIT"
] | permissive | hxhieu/32blit-hello | 685a428d06b4cd2839b335ac37cf3ede83ba64e6 | a44aa10291b54d9b0211f41e9a314b2f11235ac2 | refs/heads/main | 2023-07-31T15:27:49.158845 | 2021-09-21T12:39:20 | 2021-09-21T12:39:20 | 369,423,467 | 0 | 0 | MIT | 2021-09-21T12:39:21 | 2021-05-21T05:30:07 | C++ | UTF-8 | C++ | false | false | 290 | h | render_system.h | #pragma once
#include "32blit.hpp"
#include "entt.hpp"
#include "components.h"
namespace mitmeo
{
namespace engine
{
class RenderSystem
{
public:
RenderSystem();
void run(entt::registry &world, uint32_t time_ms);
};
}
}
|
efde3b87e5512265b1e7fa26d7ff956c9d8cb8d7 | e926bede54cbddf08870036ae478124e0a6cec77 | /src/tests/unit_tests/matrix_csr_tests.cpp | ea10b02b50110ea04e4da5f5d9e57aaed49e7ff6 | [
"MIT"
] | permissive | doyubkim/fluid-engine-dev | 2d1228c78690191fba8ff2c107af1dd06212ca44 | 94c300ff5ad8a2f588e5e27e8e9746a424b29863 | refs/heads/main | 2023-08-14T08:04:43.513360 | 2022-07-09T06:24:41 | 2022-07-09T06:24:41 | 58,299,041 | 1,725 | 275 | MIT | 2022-07-09T06:24:41 | 2016-05-08T06:05:38 | C++ | UTF-8 | C++ | false | false | 17,788 | cpp | matrix_csr_tests.cpp | // Copyright (c) 2018 Doyub Kim
//
// I am making my contributions/submissions to this project solely in my
// personal capacity and am not conveying any rights to any intellectual
// property of any third parties.
#include <jet/matrix_csr.h>
#include <jet/matrix_mxn.h>
#include <jet/vector_n.h>
#include <gtest/gtest... |
65cca0b8431a54d8ee613ceab79d8c4320a6a4b1 | 776f5892f1395bb8d30731a60466e4c756a44c8c | /contests/abc091/abc091_b/main.cc | 808c8a5de5defaa1396d98c1e90b976f2197efdf | [] | no_license | kkishi/atcoder | fae494af4b47a9f39f05e7536e93d5c4dd21555b | f21d22095699dbf064c0d084a5ce5a09a252dc6b | refs/heads/master | 2023-08-31T18:37:13.293499 | 2023-08-27T21:33:43 | 2023-08-27T21:33:43 | 264,760,383 | 0 | 0 | null | 2023-03-10T05:24:07 | 2020-05-17T21:30:14 | C++ | UTF-8 | C++ | false | false | 239 | cc | main.cc | #include <bits/stdc++.h>
#include "atcoder.h"
void Main() {
ints(n);
V<string> s(n);
cin >> s;
ints(m);
V<string> t(m);
cin >> t;
int ans = 0;
rep(i, n) chmax(ans, count(all(s), s[i]) - count(all(t), s[i]));
wt(ans);
}
|
f4d634c05ed36fd5d7c03857b0eaf887c6e51a7d | 9c88338b13f01933b3185cd4a237708e34a12d9b | /ComputerVision/object_detection_test/object_detection_test/object_detection_test.cpp | 0c98101dd8a646a4eb5068e0f4da366a2789d4bf | [
"MIT"
] | permissive | taoihsu/light-painting | 88d0517bbbd54be734315866916b0449a5c0ef73 | 6cd2447f5e9a61ed8be6889f865bceb604c595f7 | refs/heads/master | 2020-04-02T05:12:56.247347 | 2018-04-02T01:34:15 | 2018-04-02T01:34:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,170 | cpp | object_detection_test.cpp | // object_detection_test.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <stdlib.h>
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <string.h>
#include <time.h>
#include "opencv2/highgui/highgui.hpp"
#include "opencv2/imgproc/imgproc.hpp"
us... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.