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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8466719e61be47cc21a89f20f2d2a2582be9c44a | 1c227f8f40f5e9d994f6df4a12a39d28d3fe1461 | /projects/GameEngine/SkyBox/src/SkyBox.cpp | ce9109c5b809a72f84c72b96749fd3a30747727b | [] | no_license | MiguelGoncalves98/Graphics-Engine | a7f40dde82eed0b33c661402f145a38e30b6b27d | 569cc26eceea6efb25649b5f493de77391f56329 | refs/heads/master | 2020-09-10T15:18:50.326052 | 2019-04-12T12:23:03 | 2019-04-12T12:23:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 609 | cpp | SkyBox.cpp | #include "SkyBox\include\SkyBox.h"
SkyBox::SkyBox(std::vector<std::string> faces)
{
this->skybox = new CubeMap(faces);
Mesh* cube = MeshManager::getInstance()->get("skyboxcube");
if (cube == nullptr) {
this->cube = MeshManager::getInstance()->create("Assets/Models/cubemap_cube.obj", "skyboxcube");
}
else {
th... |
5cc557f3e0009913042e4f3a148aceac5aa7261e | acbc627adcb21812c5037a397ff63bd248c0922f | /CppGL/include/Model.hpp | 2084fceffbf291f5cad2cdea76162c68a014972d | [] | no_license | aktowns/CppGL | 7a8693aba2fb7f7b9aca3c6770c94e3d9b3df6e6 | e8a9e83b30bb5a532d2da697998685fa472d5ab5 | refs/heads/master | 2022-05-05T13:06:03.470347 | 2019-01-19T08:30:54 | 2019-01-19T08:30:54 | 164,308,617 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 992 | hpp | Model.hpp | #pragma once
#include <vector>
#include <assimp/Importer.hpp>
#include <assimp/scene.h>
#include <assimp/postprocess.h>
#include <spdlog/spdlog.h>
#include "Mesh.hpp"
#include "Shader.hpp"
#include "Logger.hpp"
#include "Model.hpp"
class Model final : public Logger {
const std::filesystem::path _path;
bool ... |
794392d8b6ee144b4c62e2d395e437fb4820e092 | 462b27319884063c8bf33d65681486d50a44dbc2 | /card/src/std.cpp | a972534ba25aacd117ea7a5d67ed7beafb2426b7 | [
"MIT"
] | permissive | nju-icpc/NJUPC16 | 144f6c941ae093816f47b57b2b41b998b7c4d701 | 871ba8cd1bc1df241f2ad7bd569068d0bf07ae9d | refs/heads/master | 2022-01-13T10:12:57.403086 | 2019-05-10T14:33:12 | 2019-05-10T14:33:12 | 181,927,081 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 924 | cpp | std.cpp | #include<bits/stdc++.h>
using namespace std;
typedef double db;
int d[105],n,a,b;
db f[105],nf[105],dp[105][105][105];
db C(int x,int y){
return f[x]*nf[y]*nf[x-y];
}
int main(){
scanf("%d%d%d",&n,&a,&b);
for (int i=1;i<=n;i++) scanf("%d",&d[i]);
f[0]=nf[0]=1;
for (int i=1;i<=n;i++) f[i]... |
a3bef3ad988c845b6f3d1632cfe7fc30487d4cba | 8c1ec1903c45c78147ed5046c1410bec7a56c964 | /learngl/src/MeshModel/Model.cpp | 811dbf6a917aa90983c275daafe768b4ae755206 | [
"Apache-2.0"
] | permissive | SRIHARSHA018/Opengl | e66505f7edf6f8ac7027683dd807b436cbffd141 | f66bb9ac09b02cb26b3a96d087e0728376190b41 | refs/heads/master | 2023-05-19T00:58:21.698071 | 2021-06-06T07:28:38 | 2021-06-06T07:28:38 | 287,280,198 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,206 | cpp | Model.cpp | #include "Model.h"
Model::Model(const std::string& path)
:x_path(path)
{
x_LoadModel();
}
void Model::x_LoadModel()
{
Assimp::Importer import;
const aiScene* scene = import.ReadFile(x_path, aiProcess_Triangulate | aiProcess_FlipUVs |aiProcess_JoinIdenticalVertices);
if (!scene || scene->mFlags == AI_SCENE_FLAGS_... |
1aab94f26ce04aff520ee5dc32c56582d0a7e905 | 735c92f5033129035a8df57dfe04f9e9bd7040ec | /XMLRead-Writer/setNameParamXMLReader.h | 53c4346821d6893f7bffe97cfc58be58d80a029b | [
"MIT"
] | permissive | SethSnow/InterestingCodesForMeSets | d6a3cc303df38e4b5d3f19c392620736974f5901 | 3a19ac12964a6550a668e726fe8e766f77b79601 | refs/heads/master | 2021-03-04T23:44:45.637860 | 2020-03-09T15:57:14 | 2020-03-09T15:57:14 | 246,076,802 | 0 | 0 | MIT | 2020-03-09T15:47:03 | 2020-03-09T15:47:02 | null | GB18030 | C++ | false | false | 454 | h | setNameParamXMLReader.h | /**
* 读取命名设置的xml文件
*/
#ifndef SET_NAME_PARAM_XML_READER_H_
#define SET_NAME_PARAM_XML_READER_H_
/**
* 读取xml配置文件
*/
class SetNameParamXMLReader
{
public:
SetNameParamXMLReader();
/**
* 读取xml文件中的配置信息
* \param filePath 文件路径
* \return bool 如果读取成功返回true， 否则返回false
*/
bool readConfigFile(const char *file... |
c06edbf358b4bb9653336844786cc5e0a786bb33 | cd96760180f65a17f428cc478b0cc774bcbef5e2 | /Usaco/milk3.cpp | 8ee5ec527d66518fdb39e2ea5434061d0ae8290c | [] | no_license | ngrj93/Competitive-Programming | 1cecc5cfec39472100fdb392f341f6190cca9b0e | 477b03d388262460443a22d62ab115f1966a4191 | refs/heads/master | 2021-01-17T21:11:28.850021 | 2017-03-07T07:50:44 | 2017-03-07T07:50:44 | 84,165,218 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,431 | cpp | milk3.cpp | /*
ID: ngrj931
PROB: milk3
LANG: C++11
*/
#include<fstream>
#include<iostream>
using namespace std;
ofstream fout("milk3.out");
int max_capacity[3];
int bucket[3],total;
bool state[21][21][21];
bool ans[21];
void recurse_solve(int a,int b,int c){
state[a][b][c]=true;
if(a==0)
ans[c]=true;
... |
05197297e8da269affea67f1c5bc042b9d44d87c | 687b8cdc4a3dfdbd941489d010a918145030a3cc | /gastpc/evtrec/Units.h | 80856fdb6bf5d900f48a36ff54d65fd67658614b | [
"BSD-3-Clause"
] | permissive | DUNE/wp1-neardetector | d103b623b6459c6b2a3d4e66bb585ff56ed45c46 | 729c30532670679b7c87131ec70b4141d04a3ede | refs/heads/master | 2021-04-19T01:22:24.246465 | 2017-03-01T18:11:05 | 2017-03-01T18:11:05 | 30,244,428 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,718 | h | Units.h | // ----------------------------------------------------------------------
// HEP coherent system of Units
//
// This file has been provided to CLHEP by Geant4 (simulation toolkit for HEP).
//
// The basic units are :
// millimeter (millimeter)
// nanosecond (nanosecond)
// Mega electron Volt ... |
9b32f81ddc7f49031a71faf6a94caa9cac5946f7 | 32a19d4c98655ff010dc54b14ebe35ca8fc6d3e8 | /headers/server.hpp | 66801d567d24e09ed7f7f885305732866f562fa1 | [
"MIT"
] | permissive | DynasticSponge/frederick2 | 977ab70d45d6f5afa692fabe8fc9da07b93f16cc | 410ad4a3ca43547d645248e13d27497e6c5b5f26 | refs/heads/master | 2022-04-27T20:19:11.497924 | 2020-05-04T18:25:55 | 2020-05-04T18:25:55 | 256,024,966 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,593 | hpp | server.hpp | //
// server.hpp
// ~~~~~~~~~~
//
// Author: Joseph Adomatis
// Copyright (c) 2020 Joseph R Adomatis (joseph dot adomatis at gmail dot com)
//
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#ifndef SERVER_HPP
#define SERVER_HPP
#include <future>... |
ff1fc24bbe46314be637c74ef9b6f5bf62d86080 | 0891020434f76cae9874afe98e671460a04bda4c | /Machine.cpp | 0bf98122de4e8ebd3ff191eac348d3258c83eae1 | [] | no_license | andrewSC/TuringSimulator | 1a6620a887e7fc3bc659de6714ebe093638700aa | f24bd9bbe8b2c0fc22c60d44262fd84d90f03be8 | refs/heads/master | 2016-09-10T00:42:41.629576 | 2012-08-11T08:27:31 | 2012-08-11T08:27:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,813 | cpp | Machine.cpp | #include <stdio.h>
#include <wchar.h>
#include <locale.h>
#include "Machine.h"
#include "ExampleConfig.h"
Machine::Machine(){}
void Machine::processTape(vector<char> tape) {//magic happens here
int currentStateIndex = 0; //we start on one so we don't fail hella fast sitting on a blank character
string curren... |
ccf4ecd2940d67cb531833d2d9bafcb439d10696 | 9af573d8ba51961af8a58ca8bdbaecdedb104f9e | /InterviewSmallProbs/pointers1.cpp | ae09abf579fc26e16c1d85987537679d1d341edc | [] | no_license | ec-enggshivam/CPPWork | 70d32d0e66fb0a871d8fb385ed798cd7642662c3 | d0516a6fd8b3f52b086909e8f6b0c7da8a1e4e7f | refs/heads/master | 2022-06-01T09:52:46.395541 | 2022-05-16T15:19:54 | 2022-05-16T15:19:54 | 211,589,692 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 324 | cpp | pointers1.cpp | #include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int x = 20, *y, *z;
// Assume address of x is 500 and
// integer is 4 byte size
y = &x;
z = y;
printf("y= %d\nz= %d\n", y,z);
*y++;
*z++;
x++;
printf("x = %d, y = %d, z = %d \n", x, y, z);
return 0... |
9ab2a3ee82e0eba7492357fc7657b245a5902804 | 0e303aeb2cb77033270d23962ad13cb7ea1c7253 | /Test.cpp | 4fd136f6f128ff570c55326ae62aa0e6f5af3f42 | [] | no_license | zhra2zaid/Phonetic-search-B | 22eb8593476d426f5322900eabbf697af3548e2d | 2570cca4a14c96c1aee80d86963a472201d09345 | refs/heads/master | 2021-05-18T18:26:11.815008 | 2020-03-30T16:09:11 | 2020-03-30T16:09:11 | 251,358,803 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,704 | cpp | Test.cpp | #include "doctest.h"
#include "PhoneticFinder.hpp"
using namespace phonetic;
#include <string>
using namespace std;
TEST_CASE("Test replacement of p and b and f,also lower-case and upper-case") {
string text = "xxx happy yyy";
CHECK(find(text, "hafpy") == string("happy"));
CHECK(find(text, "hapfy")... |
99ca249b03149acd59823eaa6b21143a24536ed8 | 062f9aab20421f4b0ad21daaaf653e753fe4643e | /src/Command/src/Document/Items/ConstDocumentItem/ConstDocumentItem.hpp | ca0625b184c7c236977bcabf2741a37db62f0354 | [] | no_license | UsingCoding/ood | 5b12be32af55f3b58c8ed0b02b3914db9d7cf6ef | c1703bf7e97f82413975a9ae5ea36ed17e272a89 | refs/heads/master | 2023-02-19T12:40:28.171444 | 2021-01-20T08:17:22 | 2021-01-20T08:17:22 | 293,778,942 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 577 | hpp | ConstDocumentItem.hpp | #pragma once
#include <memory>
#include "../../Elements/Image/IImage.hpp"
#include "../../Elements/Paragraph/IParagraph.hpp"
class ConstDocumentItem
{
public:
ConstDocumentItem(
std::shared_ptr<IImage> image,
std::shared_ptr<IParagraph> paragraph
)
: m_image(image), m_paragraph(paragraph) ... |
b47726e8deba8978d16ebd18ff74222d69d098f0 | 5e13159827f6ddd0a3b642481a63228d480e4b1e | /chap03/exercises/ex_3.25.cpp | a3bd6543be7dbb9277bab04ad1898027ad9af225 | [] | no_license | jxzhsiwuxie/cppPrimer | d3bf9c2e4faa7d83a8634ceb5d239e745aaba288 | 99105606ff826f29d58961ab4b921da3f3311bd3 | refs/heads/master | 2022-04-26T18:17:50.858241 | 2022-03-13T06:39:25 | 2022-03-13T06:39:25 | 233,590,715 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 977 | cpp | ex_3.25.cpp | //练习3.25：3.3.3 节划分分数段的程序是使用下标运算符实现的，请利用迭代器改写程序并实现完全相同的功能。
#include <iostream>
#include <vector>
#include <string>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
vector<unsigned> scores(11, 0);
vector<string> grades{"0~9分", "10~19分", "20~29分", "30~39分", "4... |
b4e3fff185f4e00d8a3ae194d0e1d71eccfd0f04 | 776f5892f1395bb8d30731a60466e4c756a44c8c | /contests/acl1/acl1_a/main.cc | 8329ae44c668d034ddf20bbc3cb00ffc0d423ab9 | [] | 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 | 483 | cc | main.cc | #include <bits/stdc++.h>
#include "atcoder.h"
#include "disjoint_set.h"
void Main() {
ints(n);
V<pair<int, int>> xy(n);
rep(i, n) {
ints(x, y);
xy[x - 1] = {y, i};
}
DisjointSet ds(n);
stack<pair<int, int>> s;
for (auto [y, i] : xy) {
int miny = y;
while (!s.empty()) {
auto [ty, t... |
18316cf3384b75bfcb06b8555e3daed8b903bd9d | 003fb5094021351eb82c49c8eadbb6dd5b139004 | /005_KOITP/DAY07/004_CONVEXHULL.cpp | 6416be43a1ad722aeed3c64bad8c61dcb35c8b9a | [] | no_license | woongbinni/algorithm | ebdb700195ccc158f7be1ebf7af06e9913d4e8fd | a1d5c0bc8b727d4feea670ea35218e701e0ffdb4 | refs/heads/master | 2022-11-16T23:40:44.628307 | 2022-11-11T15:21:26 | 2022-11-11T15:21:26 | 32,263,313 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,581 | cpp | 004_CONVEXHULL.cpp | /********************************************************************************
## 문제
2차원 평면에 N개의 점이 주어졌을 때, 이들 중 몇 개의 점을 골라 볼록 다각형을 만드는데, 나머지 모든 점을 내부에 포함하도록 할 수 있다. 이를 볼록 껍질 (Convex Hull) 이라 한다.
N개의 점이 주어질 때 볼록껍질을 이루는 점의 개수를 구하여라. 만약 볼록껍질을 이루는 한 선분에 3개 이상의 점이 포함된 경우, 양 끝점만을 센다.
## 입력
첫 번째 줄에 점의 개수 N이 주어진다. (3 ≤ N ... |
e1a5a316faefa117300164a48a927974a9c1e00f | 28943136c1404c79260eb0b2694546885c65d5b9 | /src/Subsystems/LiftGrabber_Config.h | 9f4251ae7c9ba8e9b4f05c537388e0f83dc7341d | [] | no_license | 4329/Worlds2015-CPP | e0d26332266685e82778b775bc1bd0e1d84af195 | cf8616e9886c904c4e677242ced5eba19728c0d5 | refs/heads/master | 2021-03-12T22:15:48.615467 | 2015-04-19T05:25:06 | 2015-04-19T05:25:06 | 34,194,619 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 188 | h | LiftGrabber_Config.h | #ifndef LIFTGRABBERCONFIG_H
#define LIFTGRABBERCONFIG_H
class LiftGrabber_Config
{
public:
int LiftGrabber_PCMID;
int LiftGrabber_Solenoid;
bool LiftGrabber_ActiveIsClosed;
};
#endif
|
6acc302dfeb34cb44b2c48a39c9495b68445c27f | 8952710ed714f672413418d35f35dad5ce9c404e | /prslc/Parser.cpp | 776202b7c25d295b9165353ed72c7a98ecd1837a | [
"BSD-2-Clause"
] | permissive | fromasmtodisasm/parasol | c61f6bbfcd6416dc6a912ff7a2fa13bb780934d9 | b48ad12aa98f9e7dc35b6ee4b339420ed2010ede | refs/heads/master | 2023-04-03T12:44:18.554170 | 2021-04-15T00:18:51 | 2021-04-15T00:18:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,237 | cpp | Parser.cpp | //
// Created by ARJ on 9/5/15.
//
#include "Parser.h"
// these are all defined in prsl_grammar.c, as part of the lemon output.
void* PRSLParseAlloc(void *(*mallocProc)(size_t));
void PRSLParseFree(void *p, void (*freeProc)(void*));
void PRSLParse(void *yyp, int yymajor, PRSLToken yyminor, prsl::Parser *);
namespac... |
9e2d7bb112ccf0fc18efc0e0b5bb073d46d7eded | 642c41d3d64a5cd01c48b85f8ce9cd3fd541a6d5 | /icpc_7425.cpp | 69572da33b853b1697a318c759a8251fd472e91a | [] | no_license | YuvalFreund/CompetionalPrograming | abf1a78dfeb6f0d5ca381bc03b47b897ef193f73 | aacc2095816b5df316dc0d4c6e4c4fe74e9e58d7 | refs/heads/master | 2020-07-01T06:54:30.446637 | 2019-08-07T17:34:49 | 2019-08-07T17:34:49 | 201,081,579 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,868 | cpp | icpc_7425.cpp | #include <algorithm>
#include <string>
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
typedef vector<vector<int>> vvi;
struct Point
{
int x;
int y;
Point(int x,int y):x(x),y(y){}
};
// Given three colinear points p, q, r, the function checks if
// point q lies ... |
139be60204009d93283945a0b9d7bfc7fb3ff918 | 8480785bf7c04987e0f97928abfe965455cc49d2 | /searching_geometry.cpp | c47372a74e44add3f9c7df8d70e794efd749d1c2 | [
"MIT"
] | permissive | yaolq/kernelsim | a4b89d98604516436a6247212cb9fdbbf340bf6c | 1e450a6e9cbec4639a6fe5163179d46db80777a7 | refs/heads/master | 2022-12-11T04:20:10.844496 | 2020-08-20T13:41:21 | 2020-08-20T13:41:21 | 285,964,786 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 5,631 | cpp | searching_geometry.cpp | #include "searching_geometry.h"
#include <iomanip>
std::ostream& operator<< (std::ostream &out, const octant_2D_table &tbl)
{
int dim = (int)(tbl.radius_ / tbl.cell_size_ + 0.5);
int i = 0;
int j = 0;
for (int y = dim; y >= -dim; --y) {
j = y + dim;
for (int x = -dim; x <= dim; ++x)
{
i = x ... |
68e6b9a9f4cbdfefe53498051e03b8d74615a39f | d287ed8bdb566b25b5e5fed9d635cb68a3687a88 | /rmf_traffic_ros2/src/rmf_traffic_ros2/schedule/YamlLogger.cpp | 623e8e6e092d54a593622af1f2db98babbc6b23b | [
"Apache-2.0"
] | permissive | jian-dong/rmf_ros2 | 3ebff8e2ff9e059b56baa59e21da4bbd1e596bfd | 87ce942d534b24da202c77efea5daf0fce47fe25 | refs/heads/main | 2023-07-20T07:28:20.357865 | 2021-09-02T06:34:01 | 2021-09-02T06:34:01 | 404,021,430 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,854 | cpp | YamlLogger.cpp | /*
* Copyright (C) 2020 Open Source Robotics Foundation
*
* 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 appl... |
d895eb2d354e83e3a222eec3c1a0cc76f46c4938 | 8137a9d5cd89c18a3bc05736518bbb7202e75511 | /good/17_tools_for_larger_programs/c++_primer_4_17/c++_primer_4_17/main.cpp | 34faedb855080a714796b548dbcc952af105ba62 | [] | no_license | sunyongjie1984/cpp4 | 31db02f49ac26c3c6085c90d6d07e19ef43aa1cc | 8a1c8b881d4f0c0cc80e1fa6e322405a0e839f5e | refs/heads/master | 2021-06-15T03:16:51.554341 | 2021-02-07T08:21:19 | 2021-02-07T08:21:19 | 84,137,640 | 0 | 1 | null | null | null | null | GB18030 | C++ | false | false | 947 | cpp | main.cpp | #include <iostream> // standard library
#include "bookexcept.h" // user difine header
#include "Sales_item.h"
using std::cin;
using std::cout;
using std::cerr;
using std::endl;
void process(double) { } // 这个函数是干什么的？
int main()
{
// use hypothetical bookstore exceptions
Sales_item item1;
... |
ec8cf47fb1d2d79dc3f96d467abe0a8ec6861744 | d51e6bdbcf75a9b7f8195b79a4bfe20feeb845c0 | /Skin.h | caccc67a919d2418357bde13b3d08844368b41f5 | [] | no_license | anthonytchen/LC_DPK | 8a60ef23f5978ff67374d3331e1d2ceee7c0f8aa | d0db31b703157084d7b87a0715509c041b49a34a | refs/heads/master | 2020-04-12T15:27:44.908445 | 2017-01-24T15:52:29 | 2017-01-24T15:52:29 | 32,207,143 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 5,089 | h | Skin.h | #ifndef _H_SKIN_
#define _H_SKIN_
#include "Chemical.h"
#include "Config.h"
#include "Vehicle.h"
#include "SurSebum.h"
//#include "Sebum.h"
#include "StraCorn.h"
#include "ViaEpd.h"
#include "Dermis.h"
#include "Blood.h"
struct Reaction
{
int idx_substrate, idx_product; // the index pointing to the o... |
eb9fb5d6d4b5b39dfd58478ded10dc23c8ab88ef | 59c8dfedd4811ab321cf55609c35f4385bebe85a | /SCL20110318/SCL20110318/1930.cpp | 0033f40d23bda4ef9d003dcfda17474df755c97a | [] | no_license | codemonkeyhe/code | b09ad675e8c1c144342701ce3cf2844efefd769f | 2a5b84edac46daf40b6fc89e78ae8cfadfad3678 | refs/heads/master | 2020-04-02T18:05:59.956758 | 2019-07-11T11:41:00 | 2019-07-11T11:41:00 | 154,686,677 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 471 | cpp | 1930.cpp | #include<iostream>
using namespace std;
int main(void)
{
int t;
int n;
int num[100];
int min=0;
int minI=0;
int count=0;
cin>>t;
while(t>0)
{
--t;
cin>>n;
for(int i=0;i<n;i++)
cin>>num[i];
count=0;
for(int i=0;i<n-1;i++)
{
min=num[i];
minI=i;
for(int j=i+1;j<n;j+... |
c52bca133b39c325169a72ae32238d16892058f3 | ea1b3cfc133e38922e585be750590553d0324e22 | /inc/processv1csvmsgimpl.h | ae2d5123d9e0b76e32b956913c972bd5d8574085 | [
"MIT"
] | permissive | leroythelegend/rough_idea_project_cars_cpp | 9739c20194bfe271c4f301b70a4dcf596ad372a8 | 6c303d5fffdc0477f2a74e57aa9e556c1e0784f0 | refs/heads/master | 2021-10-09T03:38:39.274883 | 2021-10-05T10:18:41 | 2021-10-05T10:18:41 | 174,885,936 | 1 | 0 | MIT | 2021-10-05T10:14:52 | 2019-03-10T21:56:03 | C++ | UTF-8 | C++ | false | false | 574 | h | processv1csvmsgimpl.h | #pragma once
#include "processv1csvimpl.h"
namespace pcars
{
class ProcessV1CSVMSGImpl : public ProcessV1CSVImpl
{
public:
ProcessV1CSVMSGImpl();
~ProcessV1CSVMSGImpl() override = default;
void updateTelemetry(Packet::Ptr &) override;
void writeCapturedTelemetryToCSV() ov... |
ffe5b96de50b4355c75d50ed239ec4698899aa41 | 1cb36c33cfb87a902ab486e13402cf72185490db | /network/main.cpp | 9d3e3856e3b9a4c01ee1de26fb66c163f415c6c6 | [] | no_license | touchvision/leetcode | e6f5938b85108e6c5b9de54a1153e7ae8e0685d1 | 0b76324ff8b93563479f2583a9615c74d2aaf3b3 | refs/heads/master | 2020-05-21T18:17:49.491796 | 2020-05-16T10:25:47 | 2020-05-16T10:25:47 | 186,130,735 | 0 | 0 | null | 2019-05-11T13:07:52 | 2019-05-11T12:33:17 | null | UTF-8 | C++ | false | false | 94 | cpp | main.cpp | #include "inode.h"
int main()
{
Inode *tmp = new Inode;
delete tmp;
return 0;
}
|
d864238bcf591d375ee95e0dd0d5a3018c4be6f2 | 0c9ec2beacfdce8779b417e2cc87f41f0b8a2fd2 | /A1139 First Contact(30).cpp | a8871ca653ca12024723d4907f201d96b3d841eb | [
"MIT"
] | permissive | Bourbon-Whiskey/PAT-A | 9ad15d1a796d7e38b4c888015627ca66283cc6b8 | 40915d7c36077ad8fa4cbfdfe06f6cb50f152813 | refs/heads/master | 2020-04-20T11:20:07.935886 | 2019-02-13T00:49:10 | 2019-02-13T00:49:10 | 168,813,298 | 8 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,744 | cpp | A1139 First Contact(30).cpp | #include<cstdio>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define maxn 10010
char g[maxn];//male-1;female-0;
set<int> st;
int N,M,K;
vector<int> Friend[maxn];//friend with same gender
struct Pair{
int n1,n2;
};
vector<Pair> Pa;
bool cmp(Pair a,Pair b){
if(a.n1!=b.n1){
... |
99006b0e7ddb2bce342e86124ffa08cdf0f50e2f | 046b01be8f29a186d7385ae3d7488d1c7727057f | /PnDC/main.cpp | b24fb4cd0cbe521627c0f598ded181f5b347755b | [] | no_license | Mortano/PnDC | cfab45912a948645b9cc2d486e105ac074dc09fe | c78738bf326aaf0d03605f29b55a9db7ab41e088 | refs/heads/master | 2021-01-11T04:10:01.521203 | 2016-10-20T12:23:29 | 2016-10-20T12:23:29 | 71,239,339 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,715 | cpp | main.cpp |
#include "Sorting.h"
#include "ParallelUtil.h"
#include <vector>
#include <random>
#include <numeric>
#include <iostream>
#include <numeric>
#include <chrono>
#include "RuntimeMeasurement.h"
auto RandomNumbers(size_t count)
{
static std::random_device s_rnd;
static std::uniform_int_distribution<size_t> s_distr... |
813326623e9f3fa0d50f0d48dc478765f36cb3f7 | cbf2b79ba74c6d284b3433f6754d6f5d65873cc5 | /algorithms/bow/lib/bowCV.cpp | d354f3a48599ba7709c5c9483bb384c925ee1754 | [
"LicenseRef-scancode-public-domain"
] | permissive | permikomnaskaltara/CVAC | d6f579bd682cf0f84cedec356bd588dd5342db8b | 068c69aec3351130d689d4f966d0715ab1f76958 | refs/heads/master | 2020-03-30T03:04:45.065266 | 2015-02-04T17:47:02 | 2015-02-04T17:47:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 33,202 | cpp | bowCV.cpp | /******************************************************************************
* CVAC Software Disclaimer
*
* This software was developed at the Naval Postgraduate School, Monterey, CA,
* by employees of the Federal Government in the course of their official duties.
* Pursuant to title 17 Section 105 of the Unit... |
8d5371d2cbb4826299abb9a04d7ed271d8e4afa1 | 28c2ef5ac0a4106f7ba7ffac80d06a315d24f7ef | /sony_remote/sony_remote.ino | dee729b00170c4f57c928ebb2b0c7607a7fa293b | [] | no_license | fabie37/Sony_RM-S325 | ee723546698dc3d3468072e0d1e85302f69163fa | 50fc34856d9b924d3b3262acffb4a0d2a0e17c2a | refs/heads/master | 2023-02-26T21:30:38.658650 | 2021-02-03T18:11:25 | 2021-02-03T18:11:25 | 335,707,968 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,471 | ino | sony_remote.ino |
// Can find this in Github: https://github.com/rocketscream/Low-Power
// If you need a reference for IR Codes: http://lirc.sourceforge.net/remotes/sony/RM-S325
#include "LowPower.h"
#include <IRremote.h>
#define VOL_UP 1153
#define VOL_DOWN 3201
#define TAPE1 3137
#define TAPE2 577
#define AUX 2945
#define CD 2625
#d... |
54fcce36bb36d0ecaa2e1b99be75fa4329a52660 | 51be8db88a49f7bebeefddf431faff6048ac4f37 | /xpcc/src/xpcc/container/linked_list_iterator_impl.hpp | d4557530414001ae27bd0b5e4b3fd829e144a51d | [
"MIT"
] | permissive | jrahlf/3D-Non-Contact-Laser-Profilometer | 0a2cee1089efdcba780f7b8d79ba41196aa22291 | 912eb8890442f897c951594c79a8a594096bc119 | refs/heads/master | 2016-08-04T23:07:48.199953 | 2014-07-13T07:09:31 | 2014-07-13T07:09:31 | 17,915,736 | 6 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 5,877 | hpp | linked_list_iterator_impl.hpp | // coding: utf-8
// ----------------------------------------------------------------------------
/* Copyright (c) 2009, Roboterclub Aachen e.V.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:... |
cc6495e3b16e3a978cc2d2e3afcbdad9a35e41a6 | 5228dfaf4321d1cb27fdb971fd2dcf6db06ec9fc | /hgeSDI/hgeSDI/LineCommand.cpp | e54fd9c09c5ef3c15485137a444cba60d3595210 | [] | no_license | CBE7F1F65/b63ea6f6f9110311ba98a677c0e70afd | 991d4b7563e8a5ddcda4d9caf8121e0ae4302550 | f65c8d6d2935946c36cb55493f7e279583eca415 | refs/heads/master | 2021-01-20T10:49:49.464167 | 2013-06-03T02:25:36 | 2013-06-03T02:25:36 | 32,192,729 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,446 | cpp | LineCommand.cpp | #include "stdafx.h"
#include "Command.h"
#include "LineCommand.h"
#include "Main.h"
#include "GUICursor.h"
#include "GUICoordinate.h"
#include "RenderHelper.h"
#include "RenderTargetManager.h"
#include "ColorManager.h"
#include "GLine.h"
#include "GObjectManager.h"
LineCommand::LineCommand()
{
}
Lin... |
c70a65dc0bbe2fc186e7961005f8ed5f87bea8c5 | 82d0b25efbcdffad42f69aa3f24df4151c1be0c2 | /ebb_chp06/GPIO_my/GPIO_my.cpp | 6cd34c8798387b10933c89e46b1661755284da28 | [] | no_license | aplapada/BeagleBoneBlack | 546b7c64b250e7f211cf83e3b0721bc838d6c6df | ddecdd2fad7268aa49bce5ab06037e6b2e0ccddb | refs/heads/master | 2020-06-09T18:14:37.756716 | 2019-06-24T16:49:24 | 2019-06-24T16:49:24 | 193,482,838 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,708 | cpp | GPIO_my.cpp | #include "GPIO_my.h"
#include<iostream>
#include<fstream>
#include<string>
#include<sstream>
#include<cstdlib>
#include<cstdio>
#include<fcntl.h>
#include<unistd.h>
#include<sys/epoll.h>
#include<pthread.h>
using namespace std;
namespace eeroSpace {
GPIO::GPIO(int num){
this->num = num;
//this->
this->callbackFunc... |
1211921ff00c6be94a247f86918fba2ce24a36f2 | 5999c7e4067467265f0742a3d26777003f07cf23 | /src/quiz2.cpp | 8ac8b669f0fb272a898e06501d08437d9c8fb829 | [] | no_license | kminoda/adversarial_attack | 4d8c277a37d948c2f870f17118273b00ee23dec5 | 44eb5afa941597571f6cdefc67125b40e642c0be | refs/heads/master | 2020-04-07T04:42:01.091350 | 2019-06-01T10:57:11 | 2019-06-01T10:57:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,665 | cpp | quiz2.cpp | // https://teratail.com/questions/141589
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <fstream> // ifstream
#include <sstream> // stringstream
#include <string>
using namespace std;
#define MAP_HEIGHT 32
#define MAP_WIDTH 32
#include "util.cpp"
int main(){
cout << "==================start==... |
7cd63756ee9418bff5f9583a573317faa86aedfa | abebe7c2bc651e45de70e7570ae87045608599db | /runtime/jit/jit.cc | 6496afd7012f64333351869a5ea52e50f7fb3007 | [
"Apache-2.0",
"NCSA"
] | permissive | Lingcc/AndroidArt | d5bd973905f206e803f4a2dc3ba67a6c9fec4997 | e28ad4b91591c226ed404a2b01104bb99bfeb28f | refs/heads/master | 2021-01-10T16:57:29.594703 | 2016-03-26T00:44:53 | 2016-03-26T00:44:53 | 36,331,295 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,028 | cc | jit.cc | /*
* Copyright 2014 The Android Open Source Project
*
* 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 applica... |
84921e0239fbfb2e45ba748453f278b87bc9a3e9 | 9b963f56e0964a88f2a45b6fe9aa371e1c1c704e | /Dynamic_Programming/2688-줄어들지않아(DP).cpp | e270cf66a428290dd86b4b5bc3ccc2fedc3e1d71 | [] | no_license | kewook55/PS-BOJ | 0d1880ac849dca3cad516204796d07d15836073a | aced5d3e2b073d4a3ef92607c159efe9936ff940 | refs/heads/master | 2022-12-15T10:59:41.845978 | 2020-09-12T05:09:45 | 2020-09-12T05:09:45 | 267,512,154 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 732 | cpp | 2688-줄어들지않아(DP).cpp | /*
cache[i][j] : i자리의 숫자에서 맨앞자리가 j일때의 줄어들지않는 수의 개수
cache[i][j] += cache[i-1][k] (j <= k) : 맨앞자리가 j라면 한자리가 적을때 j보다 큰 앞자리의 총합
*/
#include<iostream>
using namespace std;
long long cache[65][10];
int main(void) {
ios::sync_with_stdio(NULL);
cin.tie(NULL); cout.tie(NULL);
int T, N;
for (int i = 0; i <= 9; i++)ca... |
cfe24f8af39fa15c0394c474f92055e90a7faba2 | 226aad88fdca9ae825cf150802ca8d080acd11d4 | /Documents/Competitive/Self/Stack/Stacks.cpp | 700e23e7246ff5cabee86ee4ed6176e89af6621e | [] | no_license | SohamHarnale/Competitive-Coding | 23a2ce68fe186ed81bc59e7ddd57bfdf4da61282 | 4b71b4daac118e3dc70084137b844155bdd6983b | refs/heads/master | 2021-01-11T22:46:12.920672 | 2017-03-01T05:43:31 | 2017-03-01T05:43:31 | 79,031,063 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,015 | cpp | Stacks.cpp | /*
* Name: Soham Harnale
* Roll No: SE202061
*/
#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
const int iSize=10;
class cStack1
{
int iTop;
char cArr[iSize];
public:
cStack1()
{
iTop=-1;
}
int isempty()
{
if(iTop==-1)
return 1;
else
return 0;
}
int isfull()
... |
fba989d9df0245755e935cdadd2833e2441b6d8c | 6c0632bdc1486f4819be4a7700b0f1a3ef546e4e | /vol101/u10105/u10105.h | 081d64faad57b7f694415a898247233bdb1296c8 | [] | no_license | azakrytnoi/uva | f0f5cb51be5b92f4db5c3135309ec27c4074fd55 | 1578529a14d565acf4f59eec86c33d4ba218beb0 | refs/heads/develop | 2022-02-28T06:55:01.144635 | 2022-02-09T14:46:54 | 2022-02-09T14:46:54 | 51,453,156 | 4 | 0 | null | 2019-09-17T12:06:21 | 2016-02-10T16:17:56 | C++ | UTF-8 | C++ | false | false | 217 | h | u10105.h | #pragma once
class U10105 {
public:
static const char* libname()
{
return "u10105";
}
U10105() {}
void operator()() const;
};
#ifdef POPULATE_CACHE
populate <U10105> pu10105;
#endif
|
8e90f877c7263def6ed31dd7f761a46015cecea2 | 59bdc4eb691bff762187f05001c304a967066b95 | /tests/boundingboxtest.cpp | 95b2a73d920b143281562c174838dd01350237da | [] | no_license | David-Hickey/cpp-lib | 1d6c1880708e43a4949d97af14ebf9ca5d6d66cb | 8869fbe67cd2e6191dc37d48136610f7fd28f5fa | refs/heads/master | 2020-11-25T09:20:35.806636 | 2020-11-19T12:16:10 | 2020-11-19T12:16:10 | 228,592,871 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,605 | cpp | boundingboxtest.cpp | #include "boundingbox.hpp"
#include "arrayutils.hpp"
#include "testutils.hpp"
#include <random>
using namespace dav;
const BoundingBox bb(96, 100, 98);
const MathArray<int, 3> inside{1, 1, 1};
const MathArray<int, 3> outside_x_greater{53, 0, 0};
const MathArray<int, 3> outside_x_lesser{-57, 0, 0};
const MathArray<in... |
f1fc668a1a9b24248815e8b04b9ca8b0a0fecbd8 | 4220eeefda7b2abbd9d6c4a1e4c867eaa1c28d09 | /include/RaZ/Physics/RigidBody.hpp | 9d96016d32cc155a8c9ba1b735a64af9fbba2a36 | [
"MIT"
] | permissive | alski2020/RaZ | 1072f08ba1765afb6a456a2c69fc9bcb79c3a741 | 522c33f5566e737df51a820352a91c99a5450603 | refs/heads/master | 2023-08-10T17:53:10.991644 | 2021-09-27T19:18:48 | 2021-09-27T19:18:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,884 | hpp | RigidBody.hpp | #pragma once
#ifndef RAZ_RIGIDBODY_HPP
#define RAZ_RIGIDBODY_HPP
#include "RaZ/Component.hpp"
#include "RaZ/Math/Vector.hpp"
namespace Raz {
class RigidBody final : public Component {
friend class PhysicsSystem;
public:
/// Creates a rigid body with given mass & bounciness.
/// \param mass Mass of the rigid ... |
a1f2cafa1b403631d9d8190b924040e15e748435 | c9f2ca0490cb6fa3eb2ce0e5f1e5a15870eea2f5 | /Common/MFC/BaseDlg.cpp | 5dbdb19243439713980c9605577901da1a81fcc8 | [] | no_license | afrozm/projects | 936dbf1e99e27a8ba5399ad5d6c66f450dd032c7 | 82ba1194d6db3a7662956987586375ec657a3a59 | refs/heads/master | 2021-04-18T20:12:45.481202 | 2021-01-06T09:58:23 | 2021-01-06T09:58:23 | 39,421,550 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,102 | cpp | BaseDlg.cpp | // ImageDlg.cpp : implementation file
//
#include "stdafx.h"
#include "BaseDlg.h"
// CBaseDlg dialog
IMPLEMENT_DYNAMIC(CBaseDlg, CMFCBaseDlg)
CBaseDlg::CBaseDlg(UINT nIDTemplate, CWnd* pParent /*=NULL*/)
: CMFCBaseDlg(nIDTemplate, pParent), mControlResizer(this)
{
}
CBaseDlg::~CBaseDlg()
{
}
BOOL CBaseDlg::Crea... |
f0abf281305918dfdc7ab7574adba13492ce3310 | 1c0e31287ed0c72223f4c4b7d55e4f871f563646 | /common/log/include/vxlLog.h | 09f2335cd02e5f7bd7d05c73cf9ba593835ed67e | [] | no_license | viccwq/cmake_module | 4a2b3411009223f3bebb435e2a0c22ad6e43e6e4 | d13c4e6faba0e975c6ceb8ec135b3847ba446162 | refs/heads/master | 2020-03-29T13:28:59.086375 | 2019-05-23T03:24:35 | 2019-05-23T03:24:35 | 149,963,872 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,086 | h | vxlLog.h | #ifndef __VXLLOG_H__
#define __VXLLOG_H__
#include <string>
#include <mutex>
#include "vxlLogAux.h"
#include "vxlMacros.h"
#ifdef _WIN32
#ifdef LOG_EXPORTS
#define INTERFACE_DLL __declspec(dllexport)
#else
#define INTERFACE_DLL __declspec(dllimport)
#endif
#elif defined __linux__
#define INTERFACE_CLASS __attribute_... |
b2026c67c65b1d34abd74cb39306091d9e0a6ee5 | 9de6630020336a8c333a507747b9669532457eef | /src/core/code.re | f9f2c9f1679c1011e003e0ae423ea765af0fb7c8 | [
"MIT"
] | permissive | beni55/reia | 4363d234317434b371a02a9814f6117d7de711e3 | 576cbcbf5808bf26861103831b2c64ece46a44d8 | refs/heads/master | 2017-04-30T13:43:10.001579 | 2015-09-21T11:03:28 | 2015-09-21T11:03:28 | 42,861,008 | 0 | 0 | null | 2015-09-21T11:03:28 | 2015-09-21T11:01:19 | Erlang | UTF-8 | C++ | false | false | 677 | re | code.re | #
# code.re: Interface to the Reia code server
# Copyright (C)2010 Tony Arcieri
#
# Redistribution is permitted under the MIT license. See LICENSE for details.
#
module Code
def paths
[path.to_string() for path in CodeServer.call(:paths)]
end
def unshift_path(path)
res = CodeServer.call(:unshift_pat... |
15d63cc1ed390fbc746ed4e305e7f2c631e407bd | 911f133ff3fbfde58ee6b8d57ea8e5393f971234 | /Ch3/Exercise 3.16.cpp | 09e1f63958fb014f99fbaae624e16c8f5bf80831 | [] | no_license | xche03/CPP-Primer-5th | 5e2ba71791a405390505264778784813c2776232 | 887c236c01891bda726ef3a23ec375b53885022d | refs/heads/master | 2021-01-09T21:52:04.924093 | 2016-02-29T15:28:32 | 2016-02-29T15:28:32 | 44,064,362 | 2 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 1,444 | cpp | Exercise 3.16.cpp | /*Exercise 3.16: Write a program to print the size and contents of the
vectors from exercise 3.13. Check whether your answers to that exercise
were correct. If not, restudy ¡ì 3.3.1 (p. 97) until you understand why you
were wrong.*/
/*Exercise 3.13: How many elements are there in each of the following
vectors ? What ar... |
bdca2bc34dce027c5614b23910bc6b01342fbe6b | 153e38d81e9c63c311b0e97961632cbb64ff9807 | /Other/Code/DesignPattern/DesignPattern/Flyweight.h | afbf99b3124947467b3e036678a2fcee31fc4855 | [] | no_license | 0000duck/MyStudy | 0d8b02f2ad8afda6dcfc79928ddb6f6e8b41238d | d01c803177104bc5b0375309b140a3b009b7b0cb | refs/heads/master | 2023-02-25T23:28:53.360198 | 2021-02-05T08:31:31 | 2021-02-05T08:31:31 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,240 | h | Flyweight.h | #ifndef __Flyweight_H__
#define __Flyweight_H__
#include<iostream>
#include <string>
#include <vector>
using namespace std;
class Flyweight
{
public:
virtual void Operation(const string& extrinsicState){}
string GetIntrinsicState()
{
return this->_intrinsicState;
}
protected:
Flyweight(string intrinsicState)... |
217db1c1ce3247f37fcfac178c52b26b17c40909 | e6cd51943f682a006da8b1245e6585e453334687 | /Classes/Native/AssemblyU2DCSharp_ShowSelected503920856.h | fb64e7839b6dbf2e016f2284a523b1bf59058315 | [] | no_license | JasonRy/Seer_0.9.1 | a7495d385a6c5bcec6040ce061410d9eea4d09eb | f727a9442015b2dc03fc19d2fa68dc88ca8bfac0 | refs/heads/master | 2021-07-23T06:23:40.432032 | 2017-11-03T07:57:23 | 2017-11-03T08:53:35 | 109,366,091 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,062 | h | AssemblyU2DCSharp_ShowSelected503920856.h | #pragma once
#include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
// UnityEngine.Shader
struct Shader_t3191267369;
#include "UnityEngine_UnityEngine_MonoBehaviour667441552.h"
#include "UnityEngine_UnityEngine_Color4194546905.h"
#ifdef __clang__
#p... |
6da582f388b50ac9db721abbbe86b9968cb08c65 | 0d4e28f7e9d961e45d32a4735ad7c1f76bbda34a | /ocs2_mpc/src/MPC_MRT_Interface.cpp | 0ef6d7fced6ed0017fa64328a66b5f5cede78528 | [
"BSD-3-Clause"
] | permissive | RoboMark9/ocs2 | a4fc0c215ccb3a86afeffe93b6a67fb0d9dd9450 | b037d819c9a02a674de9badb628b32646ce11d6a | refs/heads/main | 2023-08-29T15:20:07.117885 | 2021-10-20T13:09:37 | 2021-10-20T13:09:37 | 453,286,119 | 1 | 0 | BSD-3-Clause | 2022-01-29T03:30:28 | 2022-01-29T03:30:27 | null | UTF-8 | C++ | false | false | 8,880 | cpp | MPC_MRT_Interface.cpp | /******************************************************************************
Copyright (c) 2020, Farbod Farshidian. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code mu... |
270fb6e55f8fb4d6b76eeea84f1c83e80cb6dea2 | 535749b1e06a99b634aa16b523379b38120b9af3 | /Control/Control_2.cpp | 4a458254d7c0e72f8e4daced0c119a40120c02b4 | [] | no_license | Carapulcra/CARLOS_CASTRO | 126d299f741b584f9c4a808a4e5a0e479e3af75b | a63283bf1babf6343308a4928eb769b07e7eb601 | refs/heads/main | 2023-04-15T00:42:20.343942 | 2021-04-30T08:39:36 | 2021-04-30T08:39:36 | 352,256,659 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 233 | cpp | Control_2.cpp | #include <iostream>
#include <string>
#include <sstream>
using namespace std;
int main() {
//Convierte de string a int
string cadena;
getline(cin, cadena);
istringstream salida(cadena);
int num;
salida >> num;
cout << num;
} |
b59007fe281b8e884551b3abded171fe779b28bc | 86e3af0b793570ed9ed85ca336e0f817975d731e | /KEMField/Source/BoundaryIntegrals/Electrostatic/Reference/src/KElectrostaticBiQuadratureRectangleIntegrator.cc | c587b36efafd85a74d02b47303dedae6a215280e | [] | no_license | accb529/Kassiopeia | 6103f211ddd246eec22496ce4afd3638f28efd9d | 4065e02e04f627c37ae306e77268edf275c4d7c8 | refs/heads/master | 2022-04-18T01:17:54.334279 | 2020-03-12T14:26:10 | 2020-03-12T14:26:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,064 | cc | KElectrostaticBiQuadratureRectangleIntegrator.cc | #include "KElectrostaticBiQuadratureRectangleIntegrator.hh"
namespace KEMField
{
// global variables
unsigned short gReField;
unsigned int gReIntNodes = 32;
double reAcommon, reBcommon;
KThreeVector reP, reP0, gReN1, gReN2;
double gReX;
double KElectrostaticBiQuadratureRectangleIntegrator::rectF1( double x )
{
... |
19c8374fb115e4a84ec248bcd977cd312ae5a202 | 8af26702121275433a72a5d02f1c67ffdcd8901a | /structs.cpp | b69dee1981cf47f5d0892d4c18c2f91cec661197 | [] | no_license | ali-musa/rpc | 1da4a4bf7b54a3e7c37af9abe927e76f74e6acc4 | 35f2103bf0a051827f83a14c1d2df33ac3e96e88 | refs/heads/master | 2021-05-06T06:48:23.298168 | 2017-12-11T18:37:10 | 2017-12-11T18:37:10 | 113,894,191 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 161 | cpp | structs.cpp | #include <string>
using namespace std;
#include "structs.idl"
int area(rectangle r) {
return r.x*r.y;
}
Person findPerson(ThreePeople tp)
{
return tp.p2;
} |
da423f18272991abd8d229f6d47f7d0e886d81c2 | 6b4e2a7f51647524db22208eb98e925d1537fb6b | /String/1278. Palindrome Partitioning III.cpp | 4eed75e6b2edf4ae3625d1f182ef583ba57d0fe5 | [] | no_license | denis-gubar/Leetcode | a099e0fd07600ae63456059753332f90ddd96542 | ad54bee10fdf59644cc762218277a2f9de9b3509 | refs/heads/master | 2023-07-21T04:25:57.949932 | 2023-07-09T12:46:24 | 2023-07-09T12:46:24 | 218,048,440 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 999 | cpp | 1278. Palindrome Partitioning III.cpp | class Solution {
public:
int calc(string const& s, int start, int end)
{
if (start >= end) return F[start][end] = 0;
int result = F[start][end];
if (result < 0)
{
if (s[start] == s[end])
result = calc(s, start + 1, end - 1);
else
result = 1 + calc(s, start + 1, end - 1);
}
return F[start][en... |
4ec315e188e28d6252acb718b71c8d09f4e270b9 | 27404e193f4fff8a538819611ab00402387fca74 | /chapter10/bankaccount.cpp | 7675ec54105aebcd0e20701d0b64bb400393543f | [] | no_license | shiyanlou/CPP-PrimerPlus | 4bde40abb4025aa59a2dee50aff3296d6651da9b | bf4de816e612fcfa6942f47460498f0c78a5eceb | refs/heads/master | 2020-08-30T18:22:06.743868 | 2019-12-30T05:57:23 | 2019-12-30T05:57:23 | 218,456,223 | 12 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 747 | cpp | bankaccount.cpp | // filename bankaccount.cpp
#include<iostream>
#include"bankaccount.h"
BankAccount::BankAccount(const std::string&client,
const std::string&num,double bal)
{
name=client;
acctnum=num;
balance=bal;
}
void BankAccount::show()const
{
using std::cout;
using std::endl;
cout<<"Client: "<<name<<endl;
cou... |
6f4a02c3ac377b44b19c888d2cf9dbc6f9f25691 | 09ecec5da451481281cd79f781656bb0dc624190 | /06 – Casts/00 – Scalar conversion/Scalar.cpp | 4fb5dab3bf5ed92e41b47e3c158e31073d9fd65d | [] | no_license | levensta/CPP-study | c5a441c14f53f5d6ee9a7083248826a6b5d26593 | a0bf2a6abc1626f9d4b77eff7bcc04bbedfa1498 | refs/heads/master | 2023-07-25T07:49:01.317675 | 2021-09-08T17:49:15 | 2021-09-08T17:49:15 | 392,414,875 | 0 | 1 | null | 2021-08-19T16:33:36 | 2021-08-03T18:22:24 | C++ | UTF-8 | C++ | false | false | 3,524 | cpp | Scalar.cpp | //
// Created by Lorent Evenstar on 8/27/21.
//
#include "Scalar.hpp"
Scalar::Scalar(std::string str) : _str(str), _sign(1), _isPoint(false) {}
Scalar::~Scalar() {}
Scalar::Scalar(const Scalar ©) {
*this = copy;
}
Scalar &Scalar::operator=(const Scalar ©) {
if (this != ©) {
this->_str = copy._str;
... |
d61aa20bbd950fadae1e239a3d7a91d9a53aae74 | 5d497cfdf324af46c6450de4b80ddf696200dc9f | /src/main.cpp | f4599f0b3c9aff44a5f1f1a4c1bc16ec1c65fa9b | [] | no_license | Fakor/competing_salesmen | 0c372a8e3216a9c5a058805bc38692c25a551365 | e15d4cb4572799647d2d751f0ffc6606e229638d | refs/heads/master | 2020-03-22T10:14:02.640974 | 2018-07-14T20:37:56 | 2018-07-14T20:37:56 | 139,889,845 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 737 | cpp | main.cpp | #include <iostream>
#include <cstdlib>
#include <random>
#include "map.h"
#include "random_generator.h"
#include "log_tools.h"
#include "engine.h"
#include "basic_selectors.h"
int main(int argc, char **argv){
int seed;
if(argc==2){
seed=atoi(argv[1]);
}
else{
std::random_device rd;
seed=rd();
}
... |
596c5b0fb9bccabd90a736395a6fa4d36ac4bcc5 | caf47e5b0907cf7e43a7b71354f834caafd86ba7 | /Competitive-Programming/Codechef/LTIME36/ASTRING.cpp | 428b39d2222e972d0b05824adc597460b9e02491 | [] | no_license | RudraNilBasu/C-CPP-Codes | f16b2ac72a0605eac6ffb65c20180baa7193b45f | 9412123da4ded00fac9b5c7ab14eae3f9727dace | refs/heads/master | 2021-03-13T01:53:05.550539 | 2018-03-31T17:54:38 | 2018-03-31T17:54:38 | 37,644,826 | 1 | 2 | null | 2019-08-26T21:00:29 | 2015-06-18T07:34:54 | C++ | UTF-8 | C++ | false | false | 707 | cpp | ASTRING.cpp | #include<stdio.h>
#include<string.h>
using namespace std;
int pos;
int n; // length of string
char search(char s[], int start,int end)
{
// returns the smallest string startng from
// index 'start' upto index 'length-end'
// store the pos of the smallest element in pos
int i;
char least='z'+1;
for(i=start;i<=(en... |
334f3db4754f9b43c5622f3cba40ee293155d6db | eb11c12d2f8ebe45b9af2b0fb5793c2c3d0b29db | /EventDispatcher.cpp | a83c6e6e00cea385c7b55d43fd822a8caa8ffca9 | [] | no_license | reduguardianu/Badass-Heroes | fda9e6fd78f1d362567e6879345c8fdfe3bd55cc | fe0a1db8f16091d7966199fa6c04e2b6cbb71903 | refs/heads/master | 2021-01-10T19:14:23.563319 | 2012-05-30T23:00:41 | 2012-05-30T23:00:41 | 3,673,588 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,126 | cpp | EventDispatcher.cpp | #include "EventDispatcher.h"
#include <iostream>
#define CALL_MEMBER_FN(object, ptrToMember) ((object)->*(ptrToMember))
void EventDispatcher::dispatchEvent(GameEventPointer event, EventDispatcher* dispatcher) {
ObserversMap::iterator it = m_observers.find(event->name());
if (it != m_observers.end()) {
Observe... |
1e6a3b18f55fe57b91d4cc5df8c32099ab6c5ef5 | 0435915721a0b68591a5ddac4b409d78ba190977 | /SmartPointer/include/StrBlob.h | d2041c0782ee21831a7599f494b3409dd35e5215 | [] | no_license | PugnaHAN/C-Primer | 7e381b36c046fc1d178d28633b1cc19df68c06d8 | 39058fa5b01b6808e60c2a648ed7ff00b2f3a94f | refs/heads/master | 2021-06-11T00:58:41.233001 | 2016-12-14T01:56:31 | 2016-12-14T01:56:31 | 72,555,451 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,102 | h | StrBlob.h | #ifndef __STRBLOB_H__
#define __STRBLOB_H__
#include "common.h"
class StrBlobPtr;
class StrBlob
{
public:
friend class StrBlobPtr;
typedef std::vector<std::string>::size_type size_type;
StrBlob();
StrBlob(std::initializer_list<std::string> il);
size_type size() const {return data->size();}
bool empty() const... |
697158796b9c8b5e8ddd15cb05e9e73853c402db | 5cd30c7bc36af0d37e4c4c0ecd6bf3d84d1e710a | /src/PhysicsPlaneComponent.cpp | e02955c6ae3115adbb02c90e9dc1cdd36ee53c87 | [] | no_license | Dwergi/prototype-engine | 89cb8a4c90344ab046d176beff7b19468abd6d4e | 0d792ded0141b2a913200f6f1c27084d65f42627 | refs/heads/master | 2023-04-27T21:08:31.482645 | 2023-04-21T09:17:36 | 2023-04-21T09:17:36 | 31,064,734 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 195 | cpp | PhysicsPlaneComponent.cpp | //
// PhysicsPlaneComponent.cpp
// Copyright (C) Sebastian Nordgren
// September 19th 2018
//
#include "PCH.h"
#include "PhysicsPlaneComponent.h"
DD_COMPONENT_CPP( dd::PhysicsPlaneComponent ); |
95cd6db8e87e13188800d390268eefadb6e9b484 | 5521fd35f0d58715db9046ca74a3e27ceb540755 | /ad_system/serverWork.hpp | 999a2294383f55f490c832816e5684119fd215d6 | [] | no_license | qiuye2015/learning_cpp | 947b0128b5347ecf0f568f2a13085da44fcddb8e | c592684707f9e12d7a62221378e46d87d61ecfb6 | refs/heads/master | 2021-09-27T19:38:57.345313 | 2021-09-14T03:38:18 | 2021-09-14T03:38:18 | 184,173,149 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 416 | hpp | serverWork.hpp | #pragma once
#include "common/globalHelper.hpp"
#include "globalConfig.hpp"
using std::string;
namespace server {
class CServerWork: public http::CoreWorkInterface
{
public:
CServerWork(globalConfig &config);
~CServerWork();
/* http_server的回调函数 */
virtual bool Work(const string& in, string& out) ov... |
e6b8b37c1fd787f8b97534c3a11da07c1b067f56 | ae97bf946b1e5dd05be721a810fff7a8906c2742 | /test/string_view_stream_test.cpp | 23953f568c73d10a759f1d4a113e80e19f453a64 | [
"BSL-1.0"
] | permissive | tcbrindle/modern-io | 45963d801f668c1306ee6727e9772c8f1149bfc2 | 425037a0211460a5888c22125e5f839f240f3ba4 | refs/heads/master | 2020-05-22T06:52:11.527247 | 2017-06-12T23:03:34 | 2017-06-12T23:03:34 | 60,670,838 | 5 | 0 | null | 2016-07-05T13:24:22 | 2016-06-08T05:27:39 | C++ | UTF-8 | C++ | false | false | 6,282 | cpp | string_view_stream_test.cpp |
// Copyright (c) 2016 Tristan Brindle (tcbrindle at gmail dot com)
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include "catch.hpp"
#include <io/string_view_stream.hpp>
#include <io/byte_reader.hpp>
#include... |
8e15a13dcad0fcee35d70888c54c49488e3c3491 | f6c069d7684fba8f591e6669815c23fbd4b2509c | /week3/nx305_hw3_q4/nx305_hw3_q4/nx305_hw3_q4.cpp | cd3e990dfbed97d5f7d2c2c68d4b2c65335291fc | [] | no_license | amu983/NYU-Bridge-to-Computer-Science | c7e108252954c22415bcefea44f0edf19e9f8dbb | c30dde58566be3dbcf8fc525667c0d39fec0f76e | refs/heads/master | 2023-03-16T14:05:51.003098 | 2019-06-26T02:39:21 | 2019-06-26T02:39:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 788 | cpp | nx305_hw3_q4.cpp | #include <iostream>
#include <string>
using namespace std;
int main() {
float input;
int method;
const int FLOOR_ROUND = 1;
const int CEILING_ROUND = 2;
const int ROUND = 3;
cout<<"Please enter a Real number: \n";
cin>>input;
cout<<"Choose your rounding method: \n1.Floor roun... |
090fa6980ab4d8d570a02a6cc79f3b1c23b1a024 | 1c9d3f941f3b2d2a43395765c463cea469137517 | /Verify/LC_range_kth_smallest-2.test.cpp | f3514fb1b5a5dd691cc53764fbb83d15adfba9d4 | [] | no_license | tko919/library | ab97cb246d3c65ed441097a1691fd39e9ca2afa1 | fd31658c12fd547301992a1bbdacc6818dc8d45f | refs/heads/main | 2023-06-21T22:24:50.462875 | 2023-06-14T06:19:08 | 2023-06-14T06:19:08 | 442,397,837 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,022 | cpp | LC_range_kth_smallest-2.test.cpp | #define PROBLEM "https://judge.yosupo.jp/problem/range_kth_smallest"
#include "Template/template.hpp"
#include "Utility/fastio.hpp"
#include "DataStructure/persistentrbstset.hpp"
const int LIM=201010*20*5;
using np=PRBSTset<int,LIM>::np;
FastIO io;
int main(){
int n,q;
io.read(n,q);
vector<i... |
2a318b3a125e167480bdc519db79a55f97c87633 | 864b632662c893bca3a31f9507f1cc0f36065b7b | /parse.cpp | 7647d99cb5c528c96b0e38f5ac2f9405a8e049b4 | [] | no_license | ChufanSuki/syscc | f29d948ebc9368e13cbd77dd770f93ccc28fc74a | 1f8a7893b298b5432d479bcb5e62144165a2f727 | refs/heads/master | 2023-05-12T19:11:14.436145 | 2021-06-01T06:44:06 | 2021-06-01T06:44:06 | 370,313,413 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,201 | cpp | parse.cpp | // This file contains a recursive descent parser for C.
//
// Most functions in this file are named after the symbols they are
// supposed to read from an input token list. For example, stmt() is
// responsible for reading a statement from a token list. The function
// then construct an AST node representing a statemen... |
53746fb24ce973bd3765e1d96850ba09d0808885 | cb3c83ad5c85ed82caefc1f4c6224bbf7a04424b | /djtana_data/jetsyst/jetsyst.h | fb48564210af9a0d787aec05c05ad0a9ce871537 | [] | no_license | boundino/Djetanalysis | efd7ecc25d6197986beceec541624028b6f9e4da | 3e713045f8718198713e5d177ab090f5ada07b0d | refs/heads/master | 2021-01-18T23:16:19.261958 | 2019-10-30T03:43:09 | 2019-10-30T03:43:09 | 87,100,861 | 0 | 0 | null | 2017-04-03T17:21:12 | 2017-04-03T17:21:11 | null | UTF-8 | C++ | false | false | 3,303 | h | jetsyst.h | #ifndef _DJTANA_H_
#define _DJTANA_H_
#include "prefilters.h"
#include "../includes/xjjcuti.h"
#include "../includes/xjjrootuti.h"
#include <iostream>
#include <iomanip>
#include <TMath.h>
#include <TH1F.h>
#include <TH2F.h>
#include <TLegend.h>
#include <TCanvas.h>
#include <TFile.h>
//
const int nRefBins = 2;
TStri... |
2266632d6eca591c0f5395fdb42d09494ee908a6 | 0379dd91363f38d8637ff242c1ce5d3595c9b549 | /windows_10_shared_source_kit/windows_10_shared_source_kit/10_1_14354_1000/Source/network/wlan/sys/wdi/driver/NetworkHistory.cpp | c840da0cd987be6ae95ed13001bebd9a2f2567cc | [] | no_license | zhanglGitHub/windows_10_shared_source_kit | 14f25e6fff898733892d0b5cc23b2b88b04458d9 | 6784379b0023185027894efe6b97afee24ca77e0 | refs/heads/master | 2023-03-21T05:04:08.653859 | 2020-09-28T16:44:54 | 2020-09-28T16:44:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,116 | cpp | NetworkHistory.cpp | /*++
Copyright (c) Microsoft Corporation. All rights reserved.
Module Name:
NetworkHistory.cpp
Abstract:
Implementation for maintaining history of networks on a port
Environment:
Kernel mode
Revision History:
--*/
#include "precomp.hpp"
#include "NetworkHistory.tmh"
//... |
9efc698d6ca8829f1d0b06869b47a42517fa0be0 | 5177b68f4bed92af4a47e08ad115699647e1bd8a | /June2019/0926FlipString.cpp | af396b0b3fde73e8b1a1915cf71bce4cb2dfacab | [] | no_license | wenxinmmb/LeetcodeEveryday | a5ea3b8239b78e96defc39998beabd4c69236664 | 33129ee7098e514fcd4c9b15000d1f7cb2ec23e0 | refs/heads/master | 2021-07-07T01:13:18.248874 | 2020-09-27T02:22:21 | 2020-09-27T02:22:21 | 190,129,079 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 597 | cpp | 0926FlipString.cpp | // https://leetcode.com/problems/flip-string-to-monotone-increasing/
// TODO: can work on improving memory usage
class Solution {
public:
int minFlipsMonoIncr(string S) {
vector<int> pos; int count = 0; int length = S.size();
for(int i = 0 ; i < length; i++){
if(S[i] == '1')
... |
85a136f39ec6f8146fd6fe07ae7a96837c1e9bc6 | d761e11c779aea4677ecf8b7cbf28e0a401f6525 | /vn/arl/src/shared/HBFQueryProcessorConfiguration.h | 1eb69a7ee3a2572bc2dfa33d9cfcdb410412c493 | [] | no_license | derrick0714/infer | e5d717a878ff51fef6c9b55c444c2448d85f5477 | 7fabf5bfc34302eab2a6d2867cb4c22a6401ca73 | refs/heads/master | 2016-09-06T10:37:16.794445 | 2014-02-12T00:09:34 | 2014-02-12T00:09:34 | 7,787,601 | 5 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 665 | h | HBFQueryProcessorConfiguration.h | #ifndef HBFQUERYPROCESSORCONFIGURATION_H
#define HBFQUERYPROCESSORCONFIGURATION_H
#include <boost/filesystem.hpp>
#include "SynappConfiguration.h"
namespace vn {
namespace arl {
namespace shared {
namespace fs = boost::filesystem;
class HBFQueryProcessorConfiguration : public SynappConfiguration {
public:
expli... |
f4e03c24ba8b2006741e4e3327c514488bbbfc81 | 204e76bdd58337565ed10414768fb012524a6691 | /Project Shadow/Project Shadow/Engine/ModuleCinematics.cpp | 2b18cf896fb9ac1dfa41dfabddf10911cdad9583 | [
"MIT"
] | permissive | NOREADMEStudios/ProjectII | 8fda8acaee6a7bc9c6beb35f93c423f6efe2da4d | f57477090629f031f8e6735b797a29cefa164368 | refs/heads/develop2 | 2018-09-17T14:03:31.562953 | 2018-06-05T20:48:15 | 2018-06-05T20:48:15 | 120,901,510 | 2 | 0 | MIT | 2018-06-05T20:48:16 | 2018-02-09T12:12:02 | C | UTF-8 | C++ | false | false | 4,003 | cpp | ModuleCinematics.cpp | #include "ModuleCinematics.h"
#include "Cinematic.h"
#include "ModuleInput.h"
#include <sstream>
#include "ModuleRender.h"
#include "ModuleAudio.h"
#include "ModuleTextures.h"
ModuleCinematics::ModuleCinematics()
{
name = "cinematics";
}
ModuleCinematics::~ModuleCinematics()
{
}
bool ModuleCinematics::Awake(pugi::... |
65ba7df1425aade5d116360461ac295be248c5af | db44e833ea7cc30cbfa0dfd260787781e830a944 | /code/main.cpp | d88a9062766afafa6330677ff48b7716301b8dce | [] | no_license | leo304git/2020ICCAD-Routing-with-Cell-Movement | 786fd4fb9ac54e0788c0b5cc1b49226916196249 | d8866f849646def3d0766b74a7d95240ca16b8da | refs/heads/main | 2023-03-25T17:28:05.054887 | 2021-03-13T08:31:34 | 2021-03-13T08:31:34 | 347,315,144 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 436 | cpp | main.cpp | #include <iostream>
#include <fstream>
#include <string>
#include "parser.h"
using namespace std;
GgridMgr* ggridParser=new GgridMgr();
int main(int argc,char **argv)
{
if(!ggridParser->readFile(argv[1])){cerr<<"error reading file?"<<endl; return 0;}
ggridParser->placement(ggridParser->getCellInsts());
... |
e9ccdaff488f4c166a3bed9ed9e0d8868b01f0bd | 62edb10d67374cba59db11bf9164e53275e39196 | /SpartanEditor/GameApp.cpp | 805bedb975c7125ad6cc51794ec81193fcedf55e | [] | no_license | TheMadDodger/Spartan-Engine | fc4594c3b52855281fa199f62b4b3127538b5d3b | f71d02f726f92f565a46561bb663d2fe9feede11 | refs/heads/master | 2022-08-04T11:53:14.334216 | 2022-08-01T18:45:48 | 2022-08-01T18:45:48 | 129,151,641 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,831 | cpp | GameApp.cpp | #include "stdafx.h"
#include "GameApp.h"
#include <ContentManager.h>
#include <SceneManager.h>
#include "LevelEditor.h"
#include <ApplicationStructs.h>
#include <InputManager.h>
#include <SoundManager.h>
#include <Framework.h>
#include "ComponentParameters.h"
#include "EditorWindow.h"
#include "BehaviorTreeEditor.h"
#... |
00335efb1c3295b592dfe09c6857336028b4a1e4 | 4d4f6f89166e544ca9fc25b2a6d271528866d412 | /Temperaturregler/SD.ino | 4238d94e3fe61236b26c99e02a7d2c78d1252448 | [] | no_license | GruberMartin/Temperaturregler | 765fec7fa65b32d49d97517a6263e4e3e16b004d | 716b192b526d0c59457ef084ed3305e9c5ad1571 | refs/heads/master | 2020-03-10T05:56:02.125108 | 2018-06-11T07:04:11 | 2018-06-11T07:04:11 | 129,228,135 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,560 | ino | SD.ino | #include "Dynamic_Parameter_determination.h"
#include <Arduino.h>
#include "Temperature.h"
#include "PI.h"
#include <SPI.h>
#include <SD.h>
#include "Display.h"
File myFile;
String filename;
boolean writingPiParamSuccessfully = false;
boolean readingPiParamSuccessfully = false;
boolean writingSeqParamSuccessfully = f... |
49a3b36f31d3793baa24f64e56f26716fb54b1c9 | e769bb7386f31ee347accee1ccbb421dfd9c42d1 | /Logistics/ContainerState.cpp | ece01d163ad5b286a9db29a5b0f23428ba234852 | [] | no_license | neytjieb1/Software-Modelling | 5cf0bbdf5411b7b6006aa02113ee493fe077f65f | 907fc4dc2f1fac9b6b0ce62e840b17a7b6604a72 | refs/heads/master | 2023-02-07T18:53:14.187438 | 2020-10-23T04:30:22 | 2020-10-23T04:30:22 | 287,204,960 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 120 | cpp | ContainerState.cpp | //
// Created by jo-anne on 2020/10/22.
//
#include "ContainerState.h"
ContainerState::~ContainerState() = default;
|
52075f030c4f1515c09920b16b8dd972cce3b794 | 23e99fbd8a3b7fefa0aca71351fa19919b604045 | /src/tempfile.hpp | f62c742d8ec19f8c05b3e50164b35728114942ca | [
"MIT"
] | permissive | ekg/seqwish | 4f5869b4fb4ca6e6f98554e5f60aa12bbe5bad3b | f44b402f0c2e02988d431d9b2e5eba9727cf93a9 | refs/heads/master | 2023-06-25T12:55:08.782413 | 2023-06-13T12:57:17 | 2023-06-13T12:57:17 | 136,945,907 | 132 | 19 | MIT | 2023-06-13T12:37:03 | 2018-06-11T15:31:26 | C++ | UTF-8 | C++ | false | false | 939 | hpp | tempfile.hpp | #pragma once
#include <string>
#include <mutex>
#include <cstdio>
#include <dirent.h>
#include <cstring>
/**
* Temporary files. Create with create() and remove with remove(). All
* temporary files will be deleted when the program exits normally or with
* std::exit(). The files will be created in a directory deter... |
efc3355eb35fbf0f57f73ba1d3669cda57dd134e | 18d5b78a8a019322f01116a2b9a21b702d4c1608 | /spline_interpolation/main.cpp | c6ccb9de63aa7b7cd7e15a14cdff39a764618053 | [] | no_license | SanyaKor/Numerical_methods | d1bebfb65125859259120fa7bf662dac6da67f11 | cdcbb6a005f281313da037f566f111494df512ab | refs/heads/master | 2022-12-21T14:07:06.709845 | 2020-09-25T13:03:21 | 2020-09-25T13:03:21 | 297,024,177 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 194 | cpp | main.cpp |
#include "spline.h"
#include "plotter.h"
int main() {
spline s(4);
s.func_x(1.5);
plotter p(1000,500,100,10);
p.n_mnogochlen(s.y,s.b,s.c,s.d,s.x);
p.init();
return 0;
}
|
be3e6d523a718188f7e2431dd8cd96251c104835 | 177cc0eefc1f07173b22c31c3be44621022c7001 | /canscope/device/usb_port_device_delegate.h | e7da070d8c16e4dd2f006c3a41e237dd71f67389 | [] | no_license | lianliuwei/device_operate | 7cfbfe1572eaa37bc89cd9e23391b65a7c9e93a6 | 8c9d40f809917e35bc7fb05c54919ba5ad59880d | refs/heads/master | 2021-01-01T15:23:24.684622 | 2013-09-30T09:56:17 | 2013-09-30T09:56:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 591 | h | usb_port_device_delegate.h | #pragma once
#include "canscope/device/device_delegate.h"
#include "canscope/device/usb/usb_port.h"
namespace canscope {
class UsbPortDeviceDelegate : public DeviceDelegate {
public:
UsbPortDeviceDelegate();
virtual ~UsbPortDeviceDelegate();
// implement DeviceDelegate
virtual bool WriteDevice(... |
0507b810fd0e29a16f3b7bbd1dbfd122101d2e20 | cdddb70908194ce21d16052b336ebaf5e203b5ab | /atlas_io/src/atlas_io/detail/RecordInfo.h | 3d29e3abf9c9e118ea115c02bb4258d9570833e4 | [
"Apache-2.0"
] | permissive | ecmwf/atlas | 4e32fe8c5b70995b5b4df96b13a2741d093c40db | aaf527db8a18fafd4f61e93169676c6834821692 | refs/heads/develop | 2023-08-31T13:25:36.339542 | 2023-08-25T10:03:21 | 2023-08-25T10:03:21 | 122,975,745 | 94 | 39 | Apache-2.0 | 2023-08-30T15:35:53 | 2018-02-26T13:44:07 | C++ | UTF-8 | C++ | false | false | 728 | h | RecordInfo.h | /*
* (C) Copyright 2020 ECMWF.
*
* This software is licensed under the terms of the Apache Licence Version 2.0
* which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
* In applying this licence, ECMWF does not waive the privileges and immunities
* granted to it by virtue of its status as an intergo... |
3752ba55a2212181f7693a356ffa553424599cb6 | 9f520bcbde8a70e14d5870fd9a88c0989a8fcd61 | /pitzDaily/139/p | 1b6935dbf7d2f32a1091285f43fd7d04b28c4847 | [] | no_license | asAmrita/adjoinShapOptimization | 6d47c89fb14d090941da706bd7c39004f515cfea | 079cbec87529be37f81cca3ea8b28c50b9ceb8c5 | refs/heads/master | 2020-08-06T21:32:45.429939 | 2019-10-06T09:58:20 | 2019-10-06T09:58:20 | 213,144,901 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 98,189 | p | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v1806 |
... | |
8d3001b0ce627a970955c790b4f7fda311d12670 | 768316ed72470715e641fda62a9166b610b27350 | /03-CodeChef-Medium/983--Mixtures.cpp | 609dd1058522024cbddd036a754c1c3f25e78145 | [] | no_license | dhnesh12/codechef-solutions | 41113bb5922156888d9e57fdc35df89246e194f7 | 55bc7a69f76306bc0c3694180195c149cf951fb6 | refs/heads/master | 2023-03-31T15:42:04.649785 | 2021-04-06T05:38:38 | 2021-04-06T05:38:38 | 355,063,355 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 619 | cpp | 983--Mixtures.cpp | #include<bits/stdc++.h>
using namespace std;
int arr[1000];
int dp[1001][1001];
int s(int a,int b)
{
int sum=0;
for(int i=a;i<=b;i++)
{
sum=(sum+arr[i])%100;;
}
return sum%100;
}
int solve(int i,int j)
{
if(i==j)
{
dp[i][j]=0;
return 0;
}
if(dp[i][j]!=-1)
return dp[i][j];
int a... |
37938bf822e03c9a3de1e1f7cd85f47a05cd0c06 | 945df24a29a2e2be59252c1c90cd5f6c171ca463 | /初级算法/帕斯卡三角形.cpp | a20b1f6239156657a6744195fbcf73fef05b3de5 | [] | no_license | Ye1in/LeetCode | f1e9afe55bedfc709b583329b9e4d195cb095668 | 4d76367cafb1760e0b0a6613c3901d00db2f6055 | refs/heads/master | 2020-03-23T09:05:04.247174 | 2018-07-30T07:43:55 | 2018-07-30T07:43:55 | 141,366,275 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 960 | cpp | 帕斯卡三角形.cpp | #include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <set>
#include <assert.h>
#include <queue>
#include <math.h>
using namespace std;
// 给定一个非负整数 numRows，生成杨辉三角的前 numRows 行。
// 在杨辉三角中，每个数是它左上方和右上方的数的和。
// 示例:
// ... |
ba2c162c2b053d7eb4241c1103a1e5d45d2b5ded | c466c3d68e8330ce0c1527739c3919b55099da9f | /include/sets.h | 5f098e27341142ecb917e0e56d071d8ccc7c9dab | [] | no_license | pingyuan162/AMG_Methods | ef314f044593697dd30eb0598a9dd69d0825b6f1 | ec40fbb0b73dd26c0fad31b34cde9df07c87fb8c | refs/heads/master | 2021-05-25T12:58:15.088861 | 2017-06-20T14:10:29 | 2017-06-20T14:10:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,916 | h | sets.h | /**
* @file sets.h
* @author Laura Melas <laura.melas@mail.polimi.it>
* @date 2017
*
* This file is part of project "AMG Methods".
*
* @brief AMG methods for conforming and discontinuous Galerkin finite element discretizations of the Poisson problem.
*
*/
#ifndef SETS_INCLUDED
#define SETS_INCLUDED
#include "comm... |
9596549c87af40cce96d77440ed286a2a6bc885a | b306f8a994ef88dc53b696ed6236759d750af051 | /Bison x86 Assembler Source/main.cpp | 2399cc17eebbe15e5ae279a5d1f195aee135b6be | [
"MIT"
] | permissive | kpatel122/Bison-x86-Assembler | b1a17e85a2852d7b03d4e72e28cfc3f3ebd35497 | 34d997306a5bf483ee3633126565017d1e2a5f92 | refs/heads/master | 2020-03-26T23:46:50.170294 | 2018-08-21T13:20:27 | 2018-08-21T13:20:27 | 145,566,662 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 19,328 | cpp | main.cpp | #include <iostream.h>
#include <stdlib.h>
#include <stdio.h>
#include <malloc.h>
#include <string.h>
#include "token.h"
#include "instructions.h"
#include "file.h"
#include "log.h"
#include "String.h"
#include "lexer.h"
#include "functions.h"
#include "symbol.h"
#include "strings.h"
#include "label.h"
#inclu... |
7784006568100a22967fa8d7c3047a5c5b3b7df4 | 1187b42bd08c1be389272dce452406e57ed78f64 | /sapfor/experts/Sapfor_2017/_src/DynamicAnalysis/createParallelRegions.h | 6b6f864e58166909631da3ec09dd8ee640aa7ad7 | [] | no_license | koldeen/Sapfor2 | 2b784a12400bdeb919a6e7a6c3df54ec94d7f86b | 6ab55f3ed3ef4d741dc3fa291aaf4fb15111df7d | refs/heads/master | 2023-05-28T06:26:54.435944 | 2021-03-18T07:19:45 | 2021-03-18T07:19:45 | 371,909,819 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 816 | h | createParallelRegions.h | #pragma once
#include "../Utils/utils.h"
#include "./gcov_info.h"
#include "../CreateInterTree/CreateInterTree.h"
#include "../GraphCall/graph_calls.h"
#include <map>
#include <vector>
struct SpfRegion
{
int id;
double time;
SgStatement *start;
SgStatement *end;
SpfRegion(int id_, int time_, ... |
4c623ebae639a39b9c1568e412726162fed1e4ed | 4833b1a4333c4063ee24d6f01047dc831488b4ef | /DirectXNet/pch.h | 8922c1112b6713e3086c681f61b663ccf3571071 | [] | no_license | SansyHuman/DirectXNet | 96278a2c5ad827368b1e4fdf9d4b29ab4ed63504 | d30b550a5d06e3d9de0a76aa865b145827240d06 | refs/heads/master | 2023-08-18T14:58:19.120992 | 2021-10-15T02:31:40 | 2021-10-15T02:31:40 | 403,059,162 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,196 | h | pch.h | // pch.h: 미리 컴파일된 헤더 파일입니다.
// 아래 나열된 파일은 한 번만 컴파일되었으며, 향후 빌드에 대한 빌드 성능을 향상합니다.
// 코드 컴파일 및 여러 코드 검색 기능을 포함하여 IntelliSense 성능에도 영향을 미칩니다.
// 그러나 여기에 나열된 파일은 빌드 간 업데이트되는 경우 모두 다시 컴파일됩니다.
// 여기에 자주 업데이트할 파일을 추가하지 마세요. 그러면 성능이 저하됩니다.
#ifndef PCH_H
#define PCH_H
// 여기에 미리 컴파일하려는 헤더 추가
#include <Windows.h>
#include <msc... |
3df439c96ac3fd6c540fed7742f47c8e654f659b | 59c21d66282df06f3cd28c14cbd962bb894911ad | /10370.cpp | d61d1a16a75e97792eaeab30aec65749d209acf9 | [] | no_license | sha443/UVa | c9fabca12d0f31dcd5753f6add5028cb41e94ff8 | 45c20c8fb809c13b72706d20b9fc7795de57926e | refs/heads/master | 2021-09-24T09:44:28.724123 | 2018-07-14T14:10:33 | 2018-07-14T14:10:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 518 | cpp | 10370.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n;
cin>>t;
for(int i=1;i<=t;i++)
{
int S[1001];
double sum = 0,avg;
cin>>n;
for(int j=0;j<n;j++)
{
cin>>S[j];
sum+=S[j];
}
avg = sum/n;
int above =0;
... |
33f33060814647396cc06eb3e92fb1715237aade | 5a245a7fd8205a7937b8d4d318a74c19c676a7d1 | /transaction.cpp | addf7b7d1529256274c6a85f3adff351ea616d3c | [] | no_license | marekprog/personal_budget | 9a655a7a15c5410461de52abc8f741d2fe843b0a | e941fc33f022cabc9bf9740574a3bb6a88699699 | refs/heads/master | 2020-05-21T06:09:36.085933 | 2019-05-23T15:16:44 | 2019-05-23T15:16:44 | 185,938,104 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 264 | cpp | transaction.cpp | #include "transaction.h"
Transaction::Transaction()
{
}
void Transaction::printMap()
{
cout<<endl;
for (auto const& x : itemList)
{
cout << x.first // string (key)
<< ". "
<< x.second // string's value
<< endl ;
}
}
|
2759d96472ad1c5428c6975591cfe8e54b5d80e9 | e542522d4bcddbe88a66879a7183a73c1bbdbb17 | /Codeforces/Rounds/Div3/702/G/solve.cpp | 7e6b3c646388880c11426020c54281bd742c453a | [] | no_license | ishank-katiyar/Competitive-programming | 1103792f0196284cf24ef3f24bd243d18536f2f6 | 5240227828d5e94e2587d5d2fd69fa242d9d44ef | refs/heads/master | 2023-06-21T17:30:48.855410 | 2021-08-13T14:51:53 | 2021-08-13T14:51:53 | 367,391,580 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,633 | cpp | solve.cpp | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* ch) {
return to_string((string)ch);
}
string to_string(char ch) {
return (string)"'" + ch + (string)"'";
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template<class ... |
faf3edd7632e6bab258ed54c7a33fafaf10a2006 | 594ecd45a7f7696d89facb84e2ad3d5d5460be11 | /AStarWithJps.cpp | 1a09e1ce5160c7802e64a55843ab23e3c73f563f | [] | no_license | Angel69Devil/AStarWithJps | 1824d2ca12dc5eb0ec1a481c85f495ae29cb1df0 | 4904b0002e99eb9925a1b1db9154abb14294e3f1 | refs/heads/master | 2020-06-22T03:10:29.035946 | 2014-04-03T03:10:34 | 2014-04-03T03:41:56 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,664 | cpp | AStarWithJps.cpp | #include "AStarWithJps.h"
#include <cmath>
#include <algorithm>
#include <cassert>
//jps算法，主要减少了A*的open表的长度。参见：
//http://users.cecs.anu.edu.au/~dharabor/data/papers/harabor-grastien-aaai11.pdf
//原作者官网：http://harablog.wordpress.com/2011/09/07/jump-point-search/
//中文版解释：http://plusplus7.com/lemonbag/jpsstudy
//英文版解释，推荐：h... |
2a11f31fcf2381bba78ca6a0574493d7033fb933 | 4d8f7b7fe6e4b8f8bc772339bd187960d3e01e2b | /tutorials/week08/starter/unit_testing/ex02/mock/rangermocklaser.h | 0ed84594a6171506d2c89e10b73463b402522f3c | [] | no_license | ajalsingh/PFMS-A2020 | 1dd2c18691ac48867d07d062114b49b029c7004b | e52a5e1677b6d0c5b309dbeec8e125c0ac19d857 | refs/heads/master | 2023-05-29T04:08:48.327745 | 2021-06-08T08:04:16 | 2021-06-08T08:04:16 | 275,065,349 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 808 | h | rangermocklaser.h | #ifndef RANGERMOCKLASER_H
#define RANGERMOCKLASER_H
#include "../../rangerinterface.h"
#include "../../laser.h"
#include <vector>
class RangerMockLaser: public Laser
{
public:
RangerMockLaser();
//First three are for ares, offset, fov - last is for mock data
RangerMockLaser(unsigned int fov, unsigned int ares, ... |
cbb37830890c629d7091c16898e4e720f0820179 | 2cd26645822de84bfd5dfcfbc19f8cca4e25f2b5 | /Projects/ColonyAI/src/water.cpp | cdc00e467cd57c93f0d1cad43fd6c3dfde6d92cf | [] | no_license | P14141609/FYP_ColonyAI | dfc15737b30b90066caaeadde2babee4bef1f454 | dfd65ffcf1615b28b06b7e1dff02d6bc8012f9cb | refs/heads/master | 2021-03-22T00:33:48.411761 | 2017-04-02T15:00:37 | 2017-04-02T15:00:37 | 72,354,078 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 922 | cpp | water.cpp | /**
@file water.cpp
*/
// Imports
#include "water.h"
// Constructor
Water::Water(std::shared_ptr<Environment> pEnv, const sf::Vector2f kPosition, const float kfRadius)
{
// Defines the ObjectType
m_type = WATER;
// Sets member values to corresponding input
m_pEnvironment = pEnv;
m_position = kPosition;
m_fRadi... |
b3a9030873fcbee957a49addd279cdc8cba18791 | f5dddb977c183033d4b846a923bd065c59cb8a4a | /trifal/trifal/main.cpp | c7a114ede2f5eb275554a7884d4e4b2698bf5e7a | [] | no_license | Luffky/clrs | da54871efc048f60e7867c41604adf33a01d0621 | da2158cd703a59d8cb55f148326fae0f3aad871e | refs/heads/master | 2021-08-11T19:14:31.212857 | 2017-11-14T03:09:08 | 2017-11-14T03:09:08 | 110,629,889 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 880 | cpp | main.cpp | //
// main.cpp
// trifal
//
// Created by 伏开宇 on 2017/4/7.
// Copyright © 2017年 伏开宇. All rights reserved.
//
#include <iostream>
#include <math.h>
using namespace std;
#define N 6;
#define M 3;
int total = 0;
bool isprime(int a)
{
for(int i=2;i<=sqrt(a);i++)
if(a%i==0) return false;
return true;
}
... |
8464d3aa83e9987c1417a5e3dbbfe3f42ccef31b | 2e4fa9d9071171d740a2c50a14cf41244ab31f12 | /solutions/0009. Palindrome Number.cpp | 30d2875c3b78c083e4b7d284441f3072a89f19cf | [] | no_license | SakibulMowla/leetcode-solutions | d846046af8d520a62cf8e67726df3ff8e0ea9c8f | afc39f5bc04d8436a2c6d4d8dde22802989660d2 | refs/heads/master | 2023-06-09T01:33:49.422869 | 2023-05-25T18:03:06 | 2023-05-25T18:03:06 | 168,779,500 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 380 | cpp | 0009. Palindrome Number.cpp | class Solution {
public:
bool isPalindrome(int x) {
if (x < 0 || (x % 10 == 0 && x != 0)) {
return false;
}
int revertedHalf = 0;
while (x > revertedHalf) {
revertedHalf = revertedHalf * 10 + (x % 10);
x /= 10;
}
r... |
eb14d6b301e7d232863c63d1380b9ced3e2fd3d5 | c71b6f51eb3ce04d37f414e49c8a59b32d58e3b9 | /kick_19_C1YP.cpp | 3703528bfce00521a1326bed956f3949bee24643 | [] | no_license | yashica-patodia/Google-Kickstart | b1c18dd8315c6ff6ed68f35f5c9d8f8c3096b1f5 | 3afee8316ae809a29d5ce127061df7e814e69257 | refs/heads/master | 2022-07-19T12:47:49.939785 | 2020-05-23T04:54:30 | 2020-05-23T04:54:30 | 255,468,325 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 705 | cpp | kick_19_C1YP.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
int temp=t;
int n,r,c,sr,sc;
while(t--)
{
cin>>n>>r>>c>>sr>>sc;
string s;
cin>>s;
sr=sr-1;
sc=sc-1;
bool vis[r+1][c+1];
memset(vis,0,sizeof(vis));
vis[sr][sc]=1;
int i;
for(i=0;i<s.length();i++)
{
if(s[i]=='N')
{
while(vis[... |
fef214932fd5d3def659291ee9e6828e68e811d1 | ff3e7df8793966b070419c80131040196c8abe1c | /AI Protoss/ExampleAIModule/Assimilator.cpp | fb5bcd7301c87d59eaf95acd77434f8597f78fb9 | [] | no_license | antoineDelmotte/sc-bw_stmn-ai | 6e87e22840fbb48e0b9516ed121760f093aeab2b | 6a3cc7f179a24a9e6a78858f78ac9fcce8277af4 | refs/heads/master | 2020-06-23T07:11:23.174269 | 2017-05-15T16:04:41 | 2017-05-15T16:04:41 | 74,662,591 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 443 | cpp | Assimilator.cpp | #include "Assimilator.h"
#include <BWAPI.h>
#include "Master.h"
std::vector<Assimilator*> Assimilator::Assimilators;
Assimilator::Assimilator(BWAPI::Unit u) : StarcraftUnit(u)
{
}
Assimilator::~Assimilator()
{
}
void Assimilator::Update()
{
if (m_unit->isBeingConstructed())
return;
if (!m_unit->exists())
{
... |
95dfe8ae7407d9a43786d622a1df6d0e50a789a4 | a8f2b90b92ec5c38b0607a2b7e8e96eb86800be1 | /include/pyfbsdk/pyfbfilereference.h | 2fbb4a4e512074b7c01827b2bdc549d87019c096 | [] | no_license | VRTRIX/VRTRIXGlove_MotionBuilder_Plugin | 27703a15bd68460095034c7b50d6078c8dad2ad8 | 8acee1c8d6786e9d580f55d8e2e2d41283274257 | refs/heads/master | 2023-05-01T03:00:17.419854 | 2021-11-25T08:05:13 | 2021-11-25T08:05:13 | 204,840,760 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,203 | h | pyfbfilereference.h | #ifndef pyfbfilereference_h__
#define pyfbfilereference_h__
/**************************************************************************
Copyright 2010 Autodesk, Inc.
All rights reserved.
Use of this software is subject to the terms of the Autodesk license agreement
provided at the time of installation or download... |
c0673c6abff2a289e50a2466ed1aa13423750a6b | a3d6556180e74af7b555f8d47d3fea55b94bcbda | /services/service_manager/tests/shutdown/shutdown_unittest.cc | 205efe339a1a9432336418564c6e460f053b27c2 | [
"BSD-3-Clause"
] | permissive | chromium/chromium | aaa9eda10115b50b0616d2f1aed5ef35d1d779d6 | a401d6cf4f7bf0e2d2e964c512ebb923c3d8832c | refs/heads/main | 2023-08-24T00:35:12.585945 | 2023-08-23T22:01:11 | 2023-08-23T22:01:11 | 120,360,765 | 17,408 | 7,102 | BSD-3-Clause | 2023-09-10T23:44:27 | 2018-02-05T20:55:32 | null | UTF-8 | C++ | false | false | 4,762 | cc | shutdown_unittest.cc | // Copyright 2016 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <vector>
#include "base/no_destructor.h"
#include "base/run_loop.h"
#include "base/test/task_environment.h"
#include "mojo/public/cpp/bindings/remote.h"
#include "ser... |
731e3f18c317e658c23d3db6fd522ebaaab767ad | 6d1fd68e4554fb8bc17533aa70e1bcb624a81c3d | /src/blackfox/modules/physics/components/BFRigidBodyComponent.h | e32733fdbd7b39dd36d55dadba3fc643722a2d7a | [
"MIT"
] | permissive | RLefrancoise/BlackFox | c3a303c734ae804baeeaa70d2c791bb442e5bba6 | 7814c58dca5c11cb9a80f42d4ed5f43ea7745875 | refs/heads/master | 2021-07-06T18:31:04.224033 | 2020-12-02T00:06:31 | 2020-12-02T00:06:31 | 220,683,087 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,596 | h | BFRigidBodyComponent.h | #pragma once
#include "BFComponent.h"
#include "BFDegree.h"
#include "BFVector2.h"
#include "Box2D/Dynamics/b2Body.h"
#include "Box2D/Dynamics/b2Fixture.h"
namespace BlackFox::Systems
{
class BFPhysicsSystem;
}
namespace BlackFox::Components
{
struct BLACKFOX_EXPORT BFRigidBodyComponent final: IBFComponent
{
fr... |
b5cde931c88af3a17ef02fd50c479d330cf5bf7b | 1d04e4012e26da7ccfe822aef5bc9c3676ddf2d7 | /SFML_Test/MainMenu.h | dff4e6c087c154339f3ec098b0fc97a15777433c | [] | no_license | GmBeHappy/First-Mission-in-new-home | 7f7cdf06136ceac38bd695e59e1fe354db97a7b5 | 550b475e3a2600d3b8e1e5baca52189a4879b74a | refs/heads/master | 2023-01-30T10:12:00.072238 | 2020-12-16T02:14:44 | 2020-12-16T02:14:44 | 309,473,440 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 995 | h | MainMenu.h | #pragma once
#include <SFML\Graphics.hpp>
#include<SFML/System.hpp>
#include "Background.h"
//#include "Plane.h"
#include <fstream>
#include <iostream>
class MainMenu
{
private:
//Plane* leaderboard;
sf::Texture* menuBackgroung;
sf::Font* font;
sf::Text* playBtn;
sf::Text* scoreBtn;
sf::Text* exitBtn;
sf::Text*... |
40905e93b17d6143a5db192c208d62aba582eb4e | 6d088ec295b33db11e378212d42d40d5a190c54c | /contrib/oxl/mvl/Homg.h | 901346490faa3599977d535d71df1e569636a674 | [] | no_license | vxl/vxl | 29dffd5011f21a67e14c1bcbd5388fdbbc101b29 | 594ebed3d5fb6d0930d5758630113e044fee00bc | refs/heads/master | 2023-08-31T03:56:24.286486 | 2023-08-29T17:53:12 | 2023-08-29T17:53:12 | 9,819,799 | 224 | 126 | null | 2023-09-14T15:52:32 | 2013-05-02T18:32:27 | C++ | UTF-8 | C++ | false | false | 1,011 | h | Homg.h | // This is oxl/mvl/Homg.h
#ifndef Homg_h_
#define Homg_h_
//:
// \file
// \brief Private base class for homogeneous vectors
//
// This is the private base class for homogeneous vectors. It provides the
// get/set interface, and also a static variable Homg::infinity which is used
// throughout when returning infinite n... |
cf0222fa997f75767ec12d0b257d282aa0c16807 | c54cf70b840410501ff5cafdf2a57e49f67e0e47 | /BasicXMLGUI/ArgStringList.h | 7b17abb38e0e6ec57e6c9adeeee056fe0b86aed1 | [] | no_license | BlazesRus/NodeTreeGUI | 51728596f3ff97f5b933c8d284d0d987a65afb9a | 0e0a4b45c6e5c6ac715ea99c8c88288e49b80dff | refs/heads/master | 2021-08-28T12:47:36.061063 | 2021-08-16T21:45:36 | 2021-08-16T21:45:36 | 240,399,412 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,861 | h | ArgStringList.h | // ***********************************************************************
// Code Created by James Michael Armstrong (https://github.com/BlazesRus)
// ***********************************************************************
#pragma once
#ifndef ArgStringList_IncludeGuard
#define ArgStringList_IncludeGuard
#incl... |
9bc4ef947026d5b3a7fa9d91a3371cb6feb18bb8 | 24b48bbf173884f943cdbba78d2f544ae69bb89a | /src/pathplanner/genericsamplers.cpp | 2c19a347e21b34234dc8855394df23f2548e90e5 | [] | no_license | drodri/MRCore | 854a869595fa685c09cfe3be7f1ace290ce3b739 | 91710f2ba6a9967e4c637f566fdca38f28374220 | refs/heads/master | 2016-08-05T10:20:27.820811 | 2013-07-22T15:13:41 | 2013-07-24T10:18:43 | 3,554,360 | 5 | 4 | null | 2013-07-23T10:19:00 | 2012-02-26T19:56:52 | C++ | UTF-8 | C++ | false | false | 6,207 | cpp | genericsamplers.cpp | /**********************************************************************
*
* This code is part of the MRcore project
* Author: Miguel Hernando Gutierrez
*
*
*************************************************************************/
#include "genericsamplers.h"
Sampler::Sampler(Vector2D minim, Vector2D range){
... |
b79afa838d3e3398049621c2a0baeea8b58fc121 | 3249744f6a1da68f7028571a8e7c960891606f4f | /JustCompiler/JustCompiler.Tests/FirstAndFollowTest.cpp | cf0898e280360913b357a93da00a591baf52304e | [] | no_license | maxtyutmanov/sstu-labs | 69d03989beb27efc81275a8a1184fd0665d3b4b7 | 393868c891f4476895d11dcb5b99e8dc44488196 | refs/heads/master | 2016-08-09T20:22:49.080564 | 2012-04-20T07:39:07 | 2012-04-20T07:39:07 | 48,426,643 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,681 | cpp | FirstAndFollowTest.cpp | #include <boost/test/auto_unit_test.hpp>
#include <FirstFunction.h>
#include <FollowFunction.h>
#include <Terminal.h>
#include <NonTerminal.h>
#include <FirstNFollowFactory.h>
#include <TokenTag.h>
#include <ParserTable.h>
#include <NonTerminalTag.h>
#include "TestGrammarFactory.h"
using namespace JustCompi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.