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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a8a13288de37de37ec438e49526d374267e72405 | 55fba0de5f269eb0ffbc30764810ea83cf14164c | /iNode.cpp | 33e81fc0e0004f5bea844b69bcbc3f84d72dab78 | [] | no_license | mdonohu6/newCS350FinalProject | 025738a2a5b130fd413ec1cd0553d8bed85aa6b3 | c29ae0c3b75e5b9d1665bc933e9c450a15e579ec | refs/heads/master | 2021-01-20T04:05:01.924051 | 2017-05-08T18:33:18 | 2017-05-08T18:33:18 | 89,637,108 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,058 | cpp | iNode.cpp | //
// iNode.cpp
//
//
// Created by oliver on 4/6/17.
//
//
#include "iNode.hpp"
// default all values
iNode::iNode() {
fSize = -1; //in blocks
for(int i = 0; i < 12; i++) blockAddressTable[i] = -1;
ib.pointer = -1;
doubleIndBlock = -1;
fileName[0] = '~';
fileName[1] = '\0';
}
// best to copy... |
2c3ea0e480d98a119735d46e9971bbc1964e812a | 3864d74bb0b871149cc232db9b8c91775d1b5de5 | /components/Chaze_Flashtraining/ChazeFlashtrainingWrapper.cpp | 9640c9b6e0573db5f10d4473e8876205710c979c | [
"LicenseRef-scancode-public-domain"
] | permissive | jubueche/chaze-esp32 | 55ee9b4c11ffbb3a27310ed8c99cb61488bf3f98 | ffa183a3c4469524ad972b60c0fad326f0a9a8fe | refs/heads/master | 2022-11-12T06:04:04.965845 | 2019-12-19T22:42:34 | 2019-12-19T22:42:34 | 165,647,651 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,322 | cpp | ChazeFlashtrainingWrapper.cpp | // TODO: Remove boiler plate code by creating function. Downside: Have to move declaration inside header.
#include <stdlib.h>
#include <stdint.h>
#include "ChazeFlashtrainingWrapper.h"
#include "ChazeFlashtraining.h"
struct FlashtrainingWrapper
{
void * obj;
};
FlashtrainingWrapper_t * FlashtrainingWrapper_crea... |
57f06ccf2fc92065cf6318d4e404f0f77a59670d | 056d0466af4fcf9a989fb377516353349f5b87e8 | /openvkl/common/Data.h | 2824282cad9c45e08830114bfb1f815b8a22e725 | [
"Apache-2.0"
] | permissive | NicolasHo/openvkl | 5bba934128ea6d6fbcec3fdf3065790a1216576e | d48ee28c3b824c39ab7db3013b05eb25678e719e | refs/heads/master | 2020-12-28T04:24:47.849006 | 2020-02-12T16:48:17 | 2020-02-12T16:48:17 | 238,180,534 | 0 | 0 | Apache-2.0 | 2020-02-04T10:33:34 | 2020-02-04T10:33:33 | null | UTF-8 | C++ | false | false | 2,452 | h | Data.h | // ======================================================================== //
// Copyright 2019 Intel Corporation //
// //
// Licensed under the Apache License, Version 2.0 (the "License"); //
// y... |
d6ab7a48cd997d3976e282068494f733b965017e | 727616fbd7e9d2c6bc603a549054ad642d2fc96d | /examples/Framework.hpp | 1e5308002355338545a502fe7810e556d1f670ec | [
"MIT"
] | permissive | PixelOfDeath/glCompact | 82aca67b261a15ce68225b6573a094fc64f13438 | 68334cc9c3aa20255e8986ad1ee5fa8e23df354d | refs/heads/master | 2021-07-25T18:20:03.832731 | 2021-05-13T08:31:49 | 2021-05-13T08:31:49 | 158,584,923 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 170 | hpp | Framework.hpp | #ifdef FRAMEWORK_GLFW
#include "FrameworkGLFW.hpp"
#elif FRAMEWORK_SDL2
#include "FrameworkSDL2.hpp"
#elif FRAMEWORK_SFML
#include "FrameworkSFML.hpp"
#endif
|
1e1225476816f11ffafda127b2741ff64284773f | 6fc4f5d0edb1aa15229e87baf89a0eacbae0c076 | /InfiniteHappiness.cpp | f2874983900cdba966b1f292e37e30250b78e2b1 | [] | no_license | Crinale/Recursive-Feelgood-Project | 8b4060a1d945defccca9c256ff37c1e1ccb13f53 | 7e18d2e9eaef7dc1770d6e5885b2ca7c65c156db | refs/heads/master | 2020-12-18T13:48:13.710601 | 2016-08-12T22:24:13 | 2016-08-12T22:24:13 | 65,586,948 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 598 | cpp | InfiniteHappiness.cpp | #include <iostream>
#include <string>
using namespace std;
string question;
string answer;
bool quest();
int main(){
if(quest()){
cout << "Done.";
}
}
bool quest(){
cout << "This world has many things happening what do you want done with it? \n";
getline(cin,question);
cout << "Are you su... |
ac5414dccf3fe56793ef275abea770d45b4974ce | 5d83739af703fb400857cecc69aadaf02e07f8d1 | /Archive/72b8c61ddc/main.cpp | ce9ff368186100db02f9bb24690de8e0817bb7d5 | [] | no_license | WhiZTiM/coliru | 3a6c4c0bdac566d1aa1c21818118ba70479b0f40 | 2c72c048846c082f943e6c7f9fa8d94aee76979f | refs/heads/master | 2021-01-01T05:10:33.812560 | 2015-08-24T19:09:22 | 2015-08-24T19:09:22 | 56,789,706 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 169 | cpp | main.cpp | #include <iostream>
class thing {
public:
thing() : min(10E-10) {}
private:
const double min;
};
int main() {
std::cout << "bla" << std::endl;
} |
a408b941d5d76f68e3c522642d27e6e3e7bb6d2e | fa1ceda1968b4b6a638dcf25b59593e9826a4be7 | /src/a_star/include/priorityqueueset.h | dba28ff30898df7635bca57b5b1b29574c6f2bfa | [] | no_license | Not/a_star | 4bd96fed48e5e0e637f3de2171fb966869da3144 | 9856036584d83402a13e120ba7030cc9679c1a8f | refs/heads/master | 2023-01-13T14:35:26.671806 | 2020-11-18T13:24:57 | 2020-11-18T13:24:57 | 312,328,146 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 787 | h | priorityqueueset.h | #ifndef PRIORITYQUEUESET_H
#define PRIORITYQUEUESET_H
#include<set>
#include <iostream>
#include <algorithm>
#include <functional>
template <typename T,typename cmp=std::less<>>
class priorityQueueSet{
public:
std::set<T> elements;
void push(T t){elements.insert(t);}
auto begin(){return eleme... |
216371f5a22c05c0054ffa9babb67ef26543dbb0 | cd8adc658f22b2d23ecb92cd7dea23a7592f3dad | /src/xalanc/XPath/XPathFunctionTable.cpp | 1a14fbe34b33ce1e36e938bcc8b9434ecdc5d16d | [
"Apache-2.0"
] | permissive | apache/xalan-c | 8207ab896f4fc63009b0612d1f2c68cc53494814 | c326619da4813acfc845c2830d904a4860f9afe1 | refs/heads/master | 2023-08-16T05:31:27.349782 | 2021-11-23T19:59:03 | 2021-11-23T19:59:03 | 183,135,979 | 27 | 28 | Apache-2.0 | 2022-11-28T18:01:31 | 2019-04-24T02:57:39 | C++ | UTF-8 | C++ | false | false | 29,017 | cpp | XPathFunctionTable.cpp | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the "License");
* you m... |
177cced44bd92d455458cae258ffb3736744e2c7 | 24df49d2d2c6afe3196d4f2f24736794c67443e6 | /40_combination_sum2.cpp | 75b05477c7ecc2f57a4c893f8a33989b12bbe206 | [] | no_license | manishkhilnani2911/leetcode | 87ba15aeac250a25dd256a36663271a30a2c9229 | 1d8e91af0ddf114aa72da38f933928c9b800a467 | refs/heads/master | 2021-01-20T15:49:26.187533 | 2019-03-25T19:09:58 | 2019-03-25T19:09:58 | 64,050,280 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,712 | cpp | 40_combination_sum2.cpp | /*Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
Each number in candidates may only be used once in the combination.
Note:
All numbers (including target) will be positive integers.
The solution ... |
9b80bc35c13754cf46a371ba803355c94a297d73 | 3b4476d64cfc67ad2672485d0693cf7af7c70557 | /Source/EditView.h | 7e5ea9860d396d8672fbf960e4e379b6344ca846 | [
"LicenseRef-scancode-public-domain"
] | permissive | HaikuArchives/ZooKeeper | cd4adf884842cc1634fda22a18f9447929f5e1de | 2a07893903e427640bf4d964b0596e063c9c8c62 | refs/heads/master | 2020-05-17T06:08:11.682362 | 2018-11-18T04:49:15 | 2018-11-18T04:49:15 | 14,764,216 | 1 | 3 | NOASSERTION | 2018-11-18T04:49:16 | 2013-11-28T01:13:29 | C++ | UTF-8 | C++ | false | false | 806 | h | EditView.h | #ifndef __EDIT_VIEW_H__
#define __EDIT_VIEW_H__
#include <Application.h>
#include <InterfaceKit.h>
#include <Box.h>
#include <MenuField.h>
class EditView : public BBox
{
public:
EditView (entry_ref ref);
~EditView ();
virtual void MessageReceived (BMessage * message);
virtual void AllAttached (void);... |
81ce18a20d54b02028abb64718957e2cc78e9e84 | b8376621d63394958a7e9535fc7741ac8b5c3bdc | /common/Server/GameServer/DualGoServer/DualGoServer/MultiUser.cpp | 35c55d81ba8a217e0e79f687c3f4859562d87f7c | [] | no_license | 15831944/job_mobile | 4f1b9dad21cb7866a35a86d2d86e79b080fb8102 | ebdf33d006025a682e9f2dbb670b23d5e3acb285 | refs/heads/master | 2021-12-02T10:58:20.932641 | 2013-01-09T05:20:33 | 2013-01-09T05:20:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 43,619 | cpp | MultiUser.cpp | //
// MultiUser.cpp
// DualGoServer
//
// Created by jin young park on 11. 11. 23..
// Copyright (c) 2011년 집. All rights reserved.
//
#include "DualGoInclude.h"
//#define DEF_USE_WRITE_QUEUE
#define DEF_USE_WRITE_QUEUE
CMultiUser::CMultiUser(boost::asio::io_service& io_service, CMultiGoMan... |
a3a1fdf5123d56ff5bd1edb2fecdf8d7d72f2c8c | 97ce80e44d5558cad2ca42758e2d6fb1805815ce | /Source/Foundation/bsfCore/RenderAPI/BsRenderTexture.cpp | e71391437e3ba1e624500d604190cd41c894b88b | [
"MIT"
] | permissive | cwmagnus/bsf | ff83ca34e585b32d909b3df196b8cf31ddd625c3 | 36de1caf1f7532d497b040d302823e98e7b966a8 | refs/heads/master | 2020-12-08T00:53:11.021847 | 2020-03-23T22:05:24 | 2020-03-23T22:05:24 | 232,839,774 | 3 | 0 | MIT | 2020-01-09T15:26:22 | 2020-01-09T15:26:21 | null | UTF-8 | C++ | false | false | 11,538 | cpp | BsRenderTexture.cpp | //************************************ bs::framework - Copyright 2018 Marko Pintera **************************************//
//*********** Licensed under the MIT license. See LICENSE.md for full terms. This notice is not to be removed. ***********//
#include "RenderAPI/BsRenderTexture.h"
#include "Error/BsException.h"
... |
aae9665561fa272ba2d3d8cef9fe046e62d7edc9 | b971f7f0d90f8f7ff81a1c17ac63db5ae8dc01be | /Ecom008_Heap/main.cpp | 6405064108cae7f968d41a4eed24d77cd5a61947 | [] | no_license | AndressaM/ecom008_2014_1_03 | 8369163a2ec30f104db962fefd89f34b41db14e7 | b96af4e26aeda0a2d6106986e2fb644a376626de | refs/heads/master | 2020-12-24T13:29:20.496939 | 2014-04-26T02:18:15 | 2014-04-26T02:18:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 105 | cpp | main.cpp | #include <QCoreApplication>
#include <iostream>
#include"heap.h"
using namespace std;
int main()
{
}
|
eaa79153954526a39e15e212fd85ebd883427c12 | 9c1971ad1e4ba01d7177a8e63fbb67203a0a03df | /problems/1010/solution.cpp | 0f0e086865595e05da3d31c75751ba958f012e45 | [] | no_license | virtyaluk/leetcode | cb5a7d0957be353125861b1b9d41606f4729248a | 2a1496e5deaf45b28647e713a82b1f5b456888fa | refs/heads/master | 2023-07-07T16:52:23.152194 | 2023-06-24T00:50:09 | 2023-06-24T00:50:09 | 166,505,868 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 400 | cpp | solution.cpp | class Solution {
public:
int numPairsDivisibleBy60(vector<int>& time) {
int ans = 0;
vector<int> rem(60, 0);
for (int t: time) {
if (t % 60 == 0) {
ans += rem[0];
} else {
ans += rem[60 - t % 60];
}
... |
397dad2c1390f59b712d95006e942b20c2f02a13 | 7ffa9013e21deaa30d44a4d3c397c834900a4c34 | /test/main.cpp | c9588b8b5976c98bcf03b8d4e9276d10abfabc34 | [] | no_license | jasonhaominglo/botrix | 26c66c16fb001f131afa9787c4036786bf941402 | 8add83bf4224ba913f55578df2ec8d0815d5324a | refs/heads/master | 2023-02-27T18:05:34.643191 | 2021-02-09T21:08:41 | 2021-02-09T21:08:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,298 | cpp | main.cpp | #include <stdlib.h>
#include <stdio.h>
#ifdef _WIN32
#include <windows.h>
#else
#include <dlfcn.h>
#endif
#include "server_plugin.h"
int main(int, char **)
{
#ifdef _WIN32
HMODULE handle = LoadLibrary("..\\..\\Release\\botrix.dll");
if ( handle == NULL )
{
fprintf( stderr, "%Error reading ... |
16748e14c5c332595d82c14361da876ebb1d9a3b | 05dd6c56b0c3e36c3230a620ce63b9b62e93ba8e | /Task/06/Homework6-3.cpp | dabf514ebe411c50fd59d9a7579a5990455f71b0 | [] | no_license | jckling/Learn-C | 3b37d819ff9c40c79991a07dfcbe809e380a47c2 | 56d8c8a47ccb371d627cc6ff39ca5fda66496316 | refs/heads/master | 2021-01-01T04:03:50.851823 | 2019-07-07T06:07:05 | 2019-07-07T06:07:05 | 97,115,103 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 609 | cpp | Homework6-3.cpp | #include<stdio.h>
#include<math.h>
int P(int);
int Turn(int);
int main()
{
int count = 0;
int a, b;
for (a = 10; a < 1000; a++)
{
if (P(a))
{
b = Turn(a);
if (b == a)
{
printf("%d ", a);
count++;
}
}
}
printf("\n");
printf("count=%d", count);
return 0;
}
int Turn(int x)
{
int y;
if ... |
5281e28b1bbb9c09c143d4fb65538c5300ef60a0 | dcf04edb5c67acf276e3bdac8c40aa2b9502d993 | /Common.h | 4cd036b07133946f51cdaf77e3f5e16f363906d1 | [] | no_license | boliuyan/stocks | 9bc6e9a862e51bdef816f2a3ff6f5578704813d7 | a4183b0f089538a1cb5fed06aa6f34f7514ab79c | refs/heads/master | 2020-08-03T02:49:59.364813 | 2019-09-29T04:40:55 | 2019-09-29T04:40:55 | 211,602,848 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,120 | h | Common.h | #pragma once
#ifndef __COMMON_H__
#define __COMMON_H__
#include <string>
#include <map>
#include <vector>
#include <list>
#include <windows.h>
#include <fstream>
#include <sstream>
#include <thread>
#include <mutex>
#include <luabind\luabind.hpp>
#include <boost\locale.hpp>
#include <boost/math/constants/... |
8be5c4715fd0c6e4acc86243d7347887f34bfed3 | c7c73566784a7896100e993606e1bd8fdd0ea94e | /pandatool/src/daeegg/pre_fcollada_include.h | 59ad054c2a22fc117362fe67356e3ee2ddd112a3 | [
"BSD-3-Clause",
"BSD-2-Clause"
] | permissive | panda3d/panda3d | c3f94df2206ff7cfe4a3b370777a56fb11a07926 | 160ba090a5e80068f61f34fc3d6f49dbb6ad52c5 | refs/heads/master | 2023-08-21T13:23:16.904756 | 2021-04-11T22:55:33 | 2023-08-06T06:09:32 | 13,212,165 | 4,417 | 1,072 | NOASSERTION | 2023-09-09T19:26:14 | 2013-09-30T10:20:25 | C++ | UTF-8 | C++ | false | false | 971 | h | pre_fcollada_include.h | /**
* PANDA 3D SOFTWARE
* Copyright (c) Carnegie Mellon University. All rights reserved.
*
* All use of this software is subject to the terms of the revised BSD
* license. You should have received a copy of this license along
* with this source code in a file named "LICENSE."
*
* @file pre_fcollada_include.h
... |
1a479b42f01811c0d5e5116ec2b86838958025d5 | 3739b64d28b2b162d9b91fb3bd9a216b726b4389 | /ConT2/B26.cpp | 2dd61aa5bd621c7e9672a0bac75ac3fa3808290f | [] | no_license | pewdspie24/CTDL-GT | 63c10aac5a5941f56fde08c14c0205c9778325b8 | 980fd2a2c876be6a943594f8f901399a99a786ac | refs/heads/master | 2022-12-07T20:11:22.874853 | 2020-08-25T14:53:29 | 2020-08-25T14:53:29 | 290,233,375 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,083 | cpp | B26.cpp | #include <bits/stdc++.h>
#include <string.h>
#include <string>
#define pb push_back
#define FOR(i,n) for(i = 0; i < n; i++)
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef double ld;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> II;
... |
10ec272138820f13e30262c6bc0d65e39322aa20 | 6680f8d317de48876d4176d443bfd580ec7a5aef | /Header/misDelagateLinkToNative.h | e90153bf44160805c03d6dadbff65811f6c3c7fb | [] | no_license | AlirezaMojtabavi/misInteractiveSegmentation | 1b51b0babb0c6f9601330fafc5c15ca560d6af31 | 4630a8c614f6421042636a2adc47ed6b5d960a2b | refs/heads/master | 2020-12-10T11:09:19.345393 | 2020-03-04T11:34:26 | 2020-03-04T11:34:26 | 233,574,482 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 318 | h | misDelagateLinkToNative.h | #pragma once
#include "misEventProxy.h"
using namespace System;
#pragma make_public(misEventProxy)
public ref class misDelagateLinkToNative
{
private:
misEventProxy* m_Proxy;
public:
misDelagateLinkToNative(misEventProxy* proxy);
void CaptureEvent(System::IntPtr event);
void SetProxy(misEventProxy* val);
};
|
bff2beac7609a2ed47f6e863cab2361323f11c89 | 01d41351c1b58e1823d0f5dda243c847616a96ac | /utils/subset_combination.cpp | f1d71716261cd70592903f8e13cb33667cc4919d | [] | no_license | DavidHerel/PAL | 5e75541acf32b019a1aa514a54be83bd977055d9 | 6357a31a452cc115b1df878ba6c1a7b8d66d9669 | refs/heads/main | 2023-05-25T02:28:01.633221 | 2021-01-25T13:08:46 | 2021-01-25T13:08:46 | 303,469,523 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,585 | cpp | subset_combination.cpp | //
// Created by Fuji on 21.01.2021.
//
#include <iostream>
/*
* We have {1,2,4,5}
* and we want to make all possible K subsets
*/
void k_subsets(int *a, int reqLen, int s, int currLen, bool *check, int l)
//print the all possible combination of given array set
{
if (currLen > reqLen)
return;
else i... |
4932b2bdf7f48fc1a7106477d65583da3aec859e | b7f67a86e581b4db713652ee001c04ff6b4e126c | /findWords.cpp | d825725318873cc943340427c8cc00dab867dbf1 | [] | no_license | icesongqiang/Keyboard-Row | 1c4d9ece1fb5f8b895a3dfee073926dea30c4b1c | 1736d6eeb480fe5c93c6e3c941f7a588ea39b867 | refs/heads/master | 2021-01-22T19:15:21.082631 | 2017-03-16T10:51:49 | 2017-03-16T10:51:49 | 85,184,880 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,056 | cpp | findWords.cpp | char** findWords(char** words, int wordsSize, int* returnSize) {
if(wordsSize == 0) return NULL;
int count = 0;
int *num = (int *)malloc(wordsSize * sizeof(int) );
const char *pattern = "(^[qwertyuiop]+$)|(^[asdfghjkl]+$)|(^[zxcvbnm]+$)";
regex_t reg;
int cflags = REG_EXTENDED|REG_ICAS... |
8640683cdd7fc2a4bf8d96690825e2e6e981e1cd | 5cce15340373fe77e0bb5274da6c804bb0da2392 | /hash_example.cpp | 127fbba735df34afe074b8bb38315a6b7a4c7ff6 | [] | no_license | kurenaif/kyopro | c9927fe2d63c66c307fbff60efedc5209f3c8c03 | a47196c2d7d576e11a23764ae92cfafbb024b59c | refs/heads/master | 2020-04-05T00:57:14.224683 | 2018-12-02T11:28:34 | 2018-12-02T11:28:34 | 156,417,347 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 413 | cpp | hash_example.cpp | struct Node {
int company;
int pos;
Node(int company, int pos) :company(company), pos(pos) {}
Node() {}
bool operator == (const Node& rhs) {
return company == rhs.company and pos == rhs.pos;
}
};
namespace std{
template<>
class hash<Node>{
public:
size_t operator () (const Node &n) const {
... |
6722069d588d5e50ea28ac74cbc57028c5012dc6 | 53f58ff431d3de19a891e967f76cf260c3d6cee8 | /GUI/Actor.cpp | 573e9a53822b2bf6b149f814c19f02ec06b04e86 | [] | no_license | zombie-simulation-team/Zombie-Simulation | 2c700f69f9bda97d8fd46cd24780bc717061576b | c7726f80f1e81165ad19f8a2ce2d53b86586683b | refs/heads/develop | 2020-04-28T08:20:09.063547 | 2019-04-27T23:01:20 | 2019-04-27T23:01:20 | 175,122,507 | 2 | 0 | null | 2019-09-26T21:47:06 | 2019-03-12T02:47:39 | C++ | UTF-8 | C++ | false | false | 3,231 | cpp | Actor.cpp | /*
* Actor.cpp
*
* Created on: Mar 29, 2019
* Author: Alex Rivero
*/
#include "Actor.h"
Actor::Actor(
int x,
int y,
CellColor_e color,
int healthValue,
int defenseValue,
I_Random *randomGenerator)
: Cell(x,y,color,true)
{
health = healthValue;
defense = defenseValue;
this->randomGenerator = rand... |
37e20c439137139bd1776d3bd058df46334ef879 | 8b156f329c0717b46428ff97989164fb31ff1673 | /chapter4/subarray/forceMaximumSubarray.cpp | be2553685eb5ca240ecb57b2addc11242682d754 | [] | no_license | a-daydream/Algorithms | 5c6ed75a795544c93c8d0fbe544763d4a5d7b101 | 1a37a37ed5a9dc085b8618203e0822fb1578acef | refs/heads/master | 2022-01-08T22:57:29.165525 | 2019-05-30T08:30:56 | 2019-05-30T08:30:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,201 | cpp | forceMaximumSubarray.cpp | #include<iostream>
#include<cstdlib>
#include<ctime>
struct MaximumSubarray
{
int begin;
int end;
int sum;
};
void generateArray(int a[],int size);
void printArray(int a[],int size);
MaximumSubarray forceMaximumSubarray(int a[],int size);
int main(void)
{
using namespace std;
int array[10];
... |
cb3d4bb43eb2492f22fd087abb179ebdfa2a03a1 | 10bea6de3a5a661c7ef8745fd5993322ced929b1 | /src/graphics/shared_gpu_objects.hpp | edcf5093e587abc20c0defa0b1dd53e239186949 | [] | no_license | javascript3d/csdnblog | 6fb3f389b94ddc4523c606169f024b3899a813e1 | 3c5dd37bfd1850ed9a6738db6a65838e4ea60486 | refs/heads/master | 2021-07-17T12:26:12.598439 | 2017-10-20T14:06:43 | 2017-10-20T14:06:43 | 106,515,460 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,295 | hpp | shared_gpu_objects.hpp | // SuperTuxKart - a fun racing game with go-kart
// Copyright (C) 2014-2015 SuperTuxKart-Team
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 3
// of the License, or (... |
dc5df666c476bcaff3aa91fd22dcd0d3b4df0753 | 0283fa6b8fea10496a501ab602879658fa6192ce | /Lab2/Lab2/lab2.cpp | eb143f06def576342de5054dc500584c52c08a6a | [] | no_license | pengsongyou/Cpp_Experiment | 9da1800ee2cf930aab77cb6d32f4da0bb8adf03d | 93d672fcd6b4e1e9fc5a6712957afdc1e2d6ef98 | refs/heads/master | 2021-01-10T05:28:01.600328 | 2015-12-10T21:15:38 | 2015-12-10T21:15:38 | 45,755,987 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,175 | cpp | lab2.cpp | //
// lab2.cpp
// Lab2
//
// Created by Songyou Peng on 08/11/15.
// Copyright © 2015 Songyou Peng. All rights reserved.
//
#include <iostream>
#include <cmath>
#include "lab2.h"
void swap1(int x, int y)
{
int tmp;
tmp = x;
x = y;
y = tmp;
}
void swap2(int &x, int &y)
{
int tmp;
tmp = x;
... |
f723b0a836d7eae076dfeada3fcfb3ed83d6360b | e41c5bba70d489304cc1bc5fa144c1e427955356 | /Programming Fundamentals/NEW (3).CPP | 21a5704db9a7218b86abb5b360260099be462136 | [] | no_license | DEEZZU/College-Backup | 65ece21001f6978d4c40784bb348a47cdb16d5ed | b7f1525d929e5a342d001abfe107a7d965c90662 | refs/heads/master | 2021-04-29T00:40:48.280889 | 2019-01-17T18:11:13 | 2019-01-17T18:11:13 | 121,835,608 | 0 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 4,696 | cpp | NEW (3).CPP | //MATRIX OPERATIONS
#include<iostream>
using namespace std;
void input(int arr[][5],int r,int c)
{
int i,j;
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
cout<<"\n Enter mat["<<i+1<<"]["<<j+1<<"]=";
cin>>arr[i][j];
}
}
}
void disp(int arr[][5],int r,int c)
{
int i,j;
for(i=0;i<r;i... |
b19a1f7e9f5cb243dc3ac7646a50254fd16c6d47 | 364e5cd1ce6948183e6ebb38bd8f555511b54495 | /DesignPattern/Bridge/BridgeMessage/include/MessageEmail.h | d45615f07ea1d4ca0b8a3f94edc91265bfa2a5eb | [] | no_license | danelumax/CPP_study | c38e37f0d2cebe4adccc65ad1064aa338913f044 | 22124f8d83d59e5b351f16983d638a821197b7ae | refs/heads/master | 2021-01-22T21:41:11.867311 | 2017-03-19T09:01:11 | 2017-03-19T09:01:11 | 85,462,945 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 378 | h | MessageEmail.h | /*
* MessageEmail.h
*
* Created on: Oct 2, 2016
* Author: eliwech
*/
#ifndef MESSAGEEMAIL_H_
#define MESSAGEEMAIL_H_
#include "MessageImplementor.h"
class MessageEmail : public MessageImplementor
{
public:
MessageEmail();
virtual ~MessageEmail();
virtual void send(std::string message, ... |
4a0af6b363c64ce24a433ebe38993800098f2fb0 | bf8cd5a46d0a72d59d72b6e538e52464a290c33f | /log/supportinfoopendialog.h | 82f4e28041847babac76354adb915db19c0073e6 | [] | no_license | bkbme/CALLogViewer | 267f9dc69fd5ec13e2203756a8391bc825190b46 | ef403c8fd9c0696db50c7c28a05d402ea648581c | refs/heads/master | 2016-09-01T22:38:35.690661 | 2014-03-02T18:26:23 | 2014-03-02T18:26:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 879 | h | supportinfoopendialog.h | #ifndef SUPPORTINFOOPENDIALOG_H
#define SUPPORTINFOOPENDIALOG_H
#include <QUrl>
#include <QDialog>
#include <QString>
#include <QStringList>
class SysLogParser;
class QItemSelection;
namespace Ui {
class SupportInfoOpenDialog;
}
class SupportInfoOpenDialog : public QDialog
{
Q_OBJECT
public:
explicit SupportInf... |
9ee1d52fe80e2bcf312d4ff128fa98934bb1a4bc | 5ac4267cf866d897e1e6446ebbc71143b10a77ef | /ExcelAutomationLib/include/ExcelWorkbook.h | 12b086c0442d68a32a05f373212ef6315e04cc34 | [] | no_license | yongce/excel-automation-lib | 404782b867b287477e96a7ef2a391dcb06210164 | c79711a6623aa43e6d64ad9e9de87c3854cbdba5 | refs/heads/master | 2021-01-01T16:35:00.472266 | 2010-10-04T14:09:29 | 2010-10-04T14:09:29 | 32,120,791 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,922 | h | ExcelWorkbook.h | /*!
* @file ExcelWorkbook.h
* @brief Header file for class ExcelWorkbook
* @date 2009-12-01
* @author Tu Yongce <tuyongce@gmail.com>
* @version $Id$
*/
#ifndef EXCELWORKBOOK_H_GUID_FFB67A8F_9104_4F1F_B552_B9EF17C5DD4E
#define EXCELWORKBOOK_H_GUID_FFB67A8F_9104_4F1F_B552_B9EF17C5DD4E
#include ... |
fd4f21631caaa9daeac1c4ff495c280d07c89127 | cb29307c79502a1687ff87aeb40f97a52168fea8 | /src/dolfin_fvm/include/fvm_3d.hh | 6f8d56741d459706fd4fed2d405e3c30ba81c012 | [
"MIT"
] | permissive | cwaluga/conservative_dolfin | dc72574604b5a63cae7543f2b84a07a5a313684f | c3d9324958a400d7bab43f21b9d462ff64d66d19 | refs/heads/master | 2021-01-19T14:12:41.045029 | 2015-06-14T10:56:17 | 2015-06-14T10:56:17 | 27,667,411 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,544 | hh | fvm_3d.hh | #include <boost/shared_ptr.hpp>
#include <dolfin/fem/fem_utils.h>
#include <dolfin/mesh/Vertex.h>
#include <dolfin/fem/GenericDofMap.h>
#include <ufc_geometry.h>
namespace dolfin
{
void advance(GenericVector& s, // new coefficients
GenericVector const& s0, // old coefficients
... |
14523b009f8d2ed8a22007811c79e0ff083b43c6 | 9360b382c8745b1d5f5c768eb8f52fd34fb1b554 | /gltest/gltest/Window/View.cpp | 8bd90ffda53683b7e5a9ae0cd5a9226bf88a8070 | [] | no_license | pchenik/pchenik-physical_simulation | 5346794bc73f29711374b7ec0fffe6516c893c2b | fad7343544c465d05e8ca7fa38cc9c0205734b21 | refs/heads/master | 2023-05-25T20:25:50.169718 | 2021-06-08T18:43:02 | 2021-06-08T18:43:02 | 375,110,629 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,104 | cpp | View.cpp | #include "View.h" // Очередная отработка элементарных графических примитивов
// ©2018-08-22 Иерусалим.
const char
*_Mnt[]= {"январь","февраль","март","апрель","май","июнь","июль","август","сентябрь","октябрь","ноябрь","декабрь"},
*_Day[]= {"понедельник","вторник","среда","че... |
d150748a9a3ba005ccab1085d2419df5c5bc230e | 3ef9dbe0dd6b8161b75950f682ec2fc24f79a90e | /OI2019/NOIP2019/d1t2.cpp | 1e0e893ade0b1484e6a3c1019e36786472b59bc8 | [
"MIT"
] | permissive | JackBai0914/Competitive-Programming-Codebase | abc0cb911e5f6b32d1bd14416f9eb398b7c65bb9 | a1cabf0fa5072b07a7da25d66bf455eb45b0b7e9 | refs/heads/main | 2023-03-29T14:17:36.190798 | 2021-04-14T23:15:12 | 2021-04-14T23:15:12 | 358,065,977 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 16 | cpp | d1t2.cpp |
#add a node:
|
65ed6d8cac2e5c5eb444d1287e65614a61243933 | c6f08f2bb8b812bcb63a6216fbd674e1ebdf00d8 | /ni_header/NiScriptInfoDialogs.h | 9c14848c9c1815731af33785ae06677f758c374b | [] | no_license | yuexiae/ns | b45e2e97524bd3d5d54e8a79e6796475b13bd3f9 | ffeb846c0204981cf9ae8033a83b2aca2f8cc3ac | refs/heads/master | 2021-01-19T19:11:39.353269 | 2016-06-08T05:56:35 | 2016-06-08T05:56:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,705 | h | NiScriptInfoDialogs.h | // NUMERICAL DESIGN LIMITED PROPRIETARY INFORMATION
//
// This software is supplied under the terms of a license agreement or
// nondisclosure agreement with Numerical Design Limited and may not
// be copied or disclosed except in accordance with the terms of that
// agreement.
//
// Copyright (c) 1996-20... |
c520a298cc1a03825f0454d0935dbfe081cfae7b | cd72b19d2030f36f78dab52390d092ed3dc8005f | /apps/src/videostitch-live-gui/src/newinputitemwidget.cpp | 1796876a0ebc1cecca4be3de23c9f3cff2deca72 | [
"MIT",
"DOC"
] | permissive | stitchEm/stitchEm | 08c5a3ef95c16926c944c1835fdd4ab4b6855580 | 4a0e9fc167f10c7dde46394aff302927c15ce6cb | refs/heads/master | 2022-11-27T20:13:45.741733 | 2022-11-22T17:26:07 | 2022-11-22T17:26:07 | 182,059,770 | 250 | 68 | MIT | 2022-11-22T17:26:08 | 2019-04-18T09:36:54 | C++ | UTF-8 | C++ | false | false | 1,924 | cpp | newinputitemwidget.cpp | // Copyright (c) 2012-2017 VideoStitch SAS
// Copyright (c) 2018 stitchEm
#include "newinputitemwidget.hpp"
#include "ui_newinputitemwidget.h"
#include <QMovie>
static const QString LOADING_ICON(":/live/icons/assets/icon/live/loadconnecting.gif");
static const QString OK_ICON(":/live/icons/assets/icon/live/check.png"... |
ad9adb218818f2f170680bc8ef12e06f330f3e6c | 379c8930190f2a5f994a960fe6e67db9579bbc6f | /RZRenderersTest/Main.cpp | 96421ba6d4afe1ef2be59fa81af643c895671c61 | [] | no_license | rezanour/RZRenderers | 8b5adbe8e326be03a0c65c8ab2cc0103fcc94703 | 72ca251ff85524207a7b6b0c66b7d13ed92e087c | refs/heads/master | 2021-01-19T01:16:48.369077 | 2016-08-17T06:40:14 | 2016-08-17T06:40:14 | 65,837,714 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,379 | cpp | Main.cpp | #include "Precomp.h"
static HWND WindowInit(HINSTANCE instance, const wchar_t* class_name, int32_t width, int32_t height);
static LRESULT CALLBACK WindowProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam);
static bool LoadScene(IRZRenderer* renderer);
int WINAPI WinMain(HINSTANCE instance, HINSTANCE, LPSTR, int s... |
6509b533f79638b18083e3cf5986e756fa6b5490 | c46ac3570297f694c8c363167316394e38e41e77 | /cpp-project/directed-graph/topological_sort1.h | 8164823e8b601e3ff2509331968e7f35de0bcdb2 | [] | no_license | luoxuwei/Graph-Algorithms | 3a6486abcda1acf2cafcf6a3219a762236ecb8f5 | d583dbc0497f40354414ca59efde81211602e81c | refs/heads/master | 2021-12-24T00:12:38.744408 | 2021-12-01T07:18:20 | 2021-12-01T07:18:20 | 239,277,284 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 799 | h | topological_sort1.h | //
// Created by 罗旭维 on 2021/11/29.
//
#ifndef CPP_PROJECT_TOPOLOGICAL_SORT1_H
#define CPP_PROJECT_TOPOLOGICAL_SORT1_H
#include "../CGraph.h"
#include "graph_dfs.h"
#include "cycle_detection.h"
#include <vector>
#include <algorithm>
class TopologicalSort1 {
private:
CGraph &G_;
std::vector<int> res;
public:
... |
f4e45071a1f476e8b3217fa3cffaa6ef77975971 | adb93d646fc5c7f57d4f3844a86c681a80316676 | /include/fish_annotator/common/species_controls.h | 812a207a4d185f9a0701d339a76b7d802581b600 | [
"MIT"
] | permissive | ltoscano/FishAnnotator | 0e2aea30c704d7d24300a6b1bf685d354810e1ee | c9f3a2b1127789675b9e0161eb3d8d99f32c9c2a | refs/heads/master | 2021-01-12T01:22:38.518010 | 2016-12-22T03:42:28 | 2016-12-22T03:42:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,471 | h | species_controls.h | /// @file
/// @brief Defines SpeciesControls class.
#ifndef SPECIES_CONTROLS_H
#define SPECIES_CONTROLS_H
#include <memory>
#include <list>
#include <QMenu>
#include "fish_annotator/common/species_widget.h"
#include "../../src/common/ui_species_controls.h"
#ifndef NO_TESTING
class TestImageAnnotator;
#endif
names... |
e6738be475395c3e6df3ae9fa04be58643089954 | 9ac5ba363ad48a9f38da0d15bc45cc398c310389 | /RankingLayer.cpp | 34e8bda519eaeaac2e05a53d02089f1ceec2ab15 | [] | no_license | atom-chen/qiuqiuccc | fddee58a594db2409245f1a9fa655d092b680efb | 4daec0a41ddd51ac5b3f66dfbb7bba5f1c32127f | refs/heads/master | 2020-06-09T01:28:28.196976 | 2017-10-15T16:05:42 | 2017-10-15T16:05:42 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 35,710 | cpp | RankingLayer.cpp | //
// RankingLayer.cpp
// qiuFight
//
// Created by 张跃东 on 16/4/9.
//
//
#include "RankingLayer.h"
#include "MainScene.h"
#include "RichLabel.h"
#define CHILD_OFFSET_X 50
#define CHILD_OFFSET_Y 100
#include "msg_client.pb.h"
#include "struct.pb.h"
#include "ExchangeInfo.h"
#include "msg_error.pb.h"
#in... |
8c1aa98a0329ca1f40e921603b405480ec440681 | 24bac176ec2543a1c2f77ebb11af446d561437e4 | /Exercicio30.cpp | ad1a6b028b879d0283fac83026975d22e7a857ee | [] | no_license | CarlosAbolis/TPA | 11b1eda0f2072ae5195715b54566d8934cd1ef77 | 487c87012edac3b8cd9a950decfb76d7e90d8224 | refs/heads/master | 2020-08-02T23:19:28.951218 | 2019-12-05T23:27:07 | 2019-12-05T23:27:07 | 211,542,050 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 341 | cpp | Exercicio30.cpp | /*
Função: Exibe exclusivamente a tabuada do número 7.
Autor: Carlos Alberto Gonçalves da Silva Neto
Data: 2019/12/01
Data de alteração: 2019/12/01
*/
#include<iostream>
#include<locale.h>
int main(){
int numero = 0;
setlocale(LC_ALL,"");
for(numero = 0;numero <= 10; numero++){
printf("%i x 7 = %i \n", numero, n... |
d3380e165d25a42c365a1bb8417cf431b2c3095a | a2c1593fa7aeb6cd3bc7688229f672b86b3414e8 | /PriorityQueue/PriorityQueueOnHeap/PriorityQ.hpp | cfcc68330dd90150a523cf180709cd1958b24b57 | [] | no_license | Anastasiya999/DataStructures | d686f8e85b45042c8b7d839875096bc51db4e312 | a32236fe94e9aa4b960ef2246bbc70b6b0298a2c | refs/heads/master | 2023-03-17T14:34:15.385537 | 2021-03-09T19:44:47 | 2021-03-09T19:44:47 | 346,122,896 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 254 | hpp | PriorityQ.hpp | #pragma once
#include"Container.h"
using namespace std;
template<typename T,size_t SIZE_OF_QUEUE>
class PriorityQ:public Container<T>{
public:
virtual void Enqueue(T element, int priority)=0;
virtual T DequeueMax()=0;
virtual T FindMax()=0;
}; |
3b301a2aa047abde1f69fcc4e1de9457ba207e08 | 0588e908e8a7a7b87367c036c3df407d88b38700 | /src/zmqserver/zmqinterface.h | 895ec22c46b695e856e2fdd593028778fc6b3733 | [
"MIT"
] | permissive | ShroudProtocol/ShroudX | d4f06ef262b28aeb115f1ebbd9432e1744829ab0 | 369c800cbf4a50f4a7cd01f5c155833f1ade3093 | refs/heads/master | 2023-04-23T05:12:02.347418 | 2021-05-04T20:28:55 | 2021-05-04T20:28:55 | 302,146,008 | 2 | 4 | MIT | 2020-12-07T10:18:21 | 2020-10-07T19:56:30 | C | UTF-8 | C++ | false | false | 1,464 | h | zmqinterface.h | // Copyright (c) 2018 Tadhg Riordan, Zcoin Developer
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef ZCOIN_ZMQ_ZMQNOTIFICATIONINTERFACE_H
#define ZCOIN_ZMQ_ZMQNOTIFICATIONINTERFACE_H
#include "validationinterface.h"
#in... |
315d53f216adeea86ee41b308306499d943a8465 | cb584893ed3bc9a633636ca0e209f0cb37773928 | /alarm_system.ino | 2ba2aacee16a0a56a0fcb225d4909f1f54fcfc19 | [] | no_license | macie-kwambai/alarm-system | 68c127c41376395d9c8227599a8ff80b7db55e8c | a558905c3553f103016f7019473376f8f2b15808 | refs/heads/master | 2020-03-18T14:16:37.962067 | 2018-05-25T10:23:17 | 2018-05-25T10:23:17 | 134,839,634 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 985 | ino | alarm_system.ino | const int out=12;
const int in=13;
const int led=9;
const int buz=10;
void setup() {
// put your setup code here, to run once:
Serial.begin(9600);
pinMode(out,OUTPUT);
pinMode(in,INPUT);
pinMode(led,OUTPUT);
pinMode(buz,OUTPUT);
}
void loop() {
// put your main code here, to run repeatedly:
long dur;... |
5eb977661e59a68dae763f38869d99f3996ad1aa | fe53939fb6f9ce92c7d6dd36e8abe09f9fcd2fcd | /algorithms/multisets.cpp | c74ee128b772db18034c16e95c6ec5ca5679f0ca | [] | no_license | AaronBaldwin/personal | 7721cd4b5f55d0fc627d9560e8603ce7c3a6691f | 83389d8402d4a571a06ac564f9a8bb5c86e4f238 | refs/heads/master | 2021-05-02T09:49:59.332837 | 2019-11-23T09:01:20 | 2019-11-23T09:01:20 | 45,590,082 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 903 | cpp | multisets.cpp | #include <cstdlib>
#include <vector>
#include <iostream>
#include <set>
using namespace std;
int main(int argc, char** argv) {
std::multiset<int> s1;
std::multiset<int, greater<int>> s2; // Sort in descending order
s1.insert(5);
s1.insert(2);
s1.insert(4);
s1.insert(4);
s2.insert(15);
s2.insert(14)... |
ef0772643f28deb179a3f6b5a0cf25311fb111ab | a5bbb807323d3d5b16e734fdd47808e40f3c6995 | /Codeforces/Round 620(Div. 2)/1304E.cpp | 1bcfe62a3d2d02ec4285bf49d73a86241f3acb97 | [] | no_license | gagandeepahuja09/Competitive-Programming-Contests | a7ad0eb7667cd5fbdb84502a7c82ae41c4ae49ea | b080e07281dea54f8fbb7b3097de542cad72d8cb | refs/heads/master | 2021-07-18T16:41:21.409766 | 2020-06-29T12:13:21 | 2020-06-29T12:13:21 | 182,628,398 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,207 | cpp | 1304E.cpp | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vvi vector<vi>
#define read(a) for(int i = 0; i < n; i++) cin >> a[i];
#define print(a) for(int i = 0; i < n; i++) cout << a[i] << " ";
#define pb push_back
#define ins insert
#define pql priority_queue<int>
#defi... |
8560619e133ec2a14b13fc695e2d2d142339e668 | 184b98294943516c8575f123e6aeef348d88050d | /test3/d-parenteses.cpp | 02166515b0f21821e2f4a0c8a057c8dd059e4dc6 | [] | no_license | cicerocipriano/Programming-1 | 98220e7603c1359a1caed8baf3057c09ab5964fb | bb4c6c9ceae1d38e5b539d9ff73724c764e63d4e | refs/heads/main | 2023-03-20T20:34:36.032047 | 2021-03-11T20:30:37 | 2021-03-11T20:30:37 | 342,403,571 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,065 | cpp | d-parenteses.cpp | #include <iostream>
#include <cstring>
using namespace std;
void check_pare (char *a) {
int pos1 = -1, pos2 = -1;
for (int i = 0; a[i] != '\0'; i++) {
if (a[i] == '(') {
pos1 = i;
a[i] = 64;
break;
}
}
for (int i = 0; a[i] != '\0'; i++) {
... |
a19c647dcabc85654df29448a83393f15307f540 | 619054eaea6b93fb3ad354606029363817088285 | /rai/rai_token/crosschain/parsers/base.hpp | a022db3dfcf256a3811ab2fefa96f288cd912a4e | [
"MIT"
] | permissive | raicoincommunity/Raicoin | e3d1047b30cde66706b994a3b31e0b541b07c79f | ebc480caca04caebdedbc3afb4a8a0f60a8c895f | refs/heads/master | 2023-09-03T00:39:00.762688 | 2023-08-29T17:01:09 | 2023-08-29T17:01:09 | 210,498,091 | 99 | 16 | MIT | 2023-08-29T17:01:11 | 2019-09-24T02:52:27 | C++ | UTF-8 | C++ | false | false | 706 | hpp | base.hpp | #pragma once
#include <cstdint>
#include <vector>
#include <functional>
#include <rai/common/util.hpp>
#include <rai/rai_token/crosschain/event.hpp>
namespace rai
{
class BaseParser
{
public:
virtual ~BaseParser() = default;
virtual void Run() = 0;
virtual uint64_t Delay() const = 0;
virtual void Sta... |
7c667d776bdc9b0f357a10f127a402a35f2782b8 | 7bb0491b44ee3c401201e8220c22aee882be3bfb | /src/srp-common.h | 33f01fa94242b45dfb4c32ae1a3dec6405b0077b | [
"BSD-2-Clause"
] | permissive | markyosti/uvpn | 2530351b12628f7242fbb49456237b10dfdee376 | 2a36dd0977707c92376b8bc5ad692aec6d1b564a | refs/heads/master | 2020-04-11T05:56:03.324125 | 2013-02-28T19:35:40 | 2013-02-28T19:35:40 | 7,915,780 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 659 | h | srp-common.h | #ifndef SRP_COMMON_H
# define SRP_COMMON_H
# include "openssl-helpers.h"
class SecurePrimes {
public:
struct Prime {
const char* name;
int generator;
const char* value;
};
SecurePrimes();
~SecurePrimes();
bool ValidIndex(int index) const;
const BigNumber& GetPrime(int index) const;
const ... |
5a405e2c7e530c10336c5de133d516a20a28fb7e | 90b5c555b4e1ba763e405183a6c5defaba1720bc | /Crucible_Game/Map.h | 18429862899d2c9d0913cf10a685229d3885cbac | [] | no_license | AaronCC/The_Crucible | b42abc29619c41f43d5bf4f88209eeeb32bbf077 | 7125c66a46971008647a9c7a3c4c0371d148e8e0 | refs/heads/master | 2021-04-09T14:26:14.717276 | 2018-04-29T22:21:34 | 2018-04-29T22:21:34 | 125,675,243 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,458 | h | Map.h | #ifndef MAP_H
#define MAP_H
#include "Game.h"
#include "Gui.h"
#include "Camera.h"
#include "Helper.h"
#include "Enemy.h"
#include "PathFinder.h"
#include "CaveGen.h"
#include "Loot.h"
#include "Dungeon.h"
#define SHR_SPN_CHANCE 15
class Map
{
public:
std::vector<Enemy*> enemies;
std::vector<Enemy*> aEnemies;
std:... |
516a4e7488d948dcb11a8005e611b527f0c3bfd0 | a586865e3768cd41e84bcae0e73cdabb2a50f592 | /src/gui/HotkeyPickerDrawer.h | b6d9ddbf8aac0c16b85cf5d8cd18bceaafbbbb2f | [
"MIT"
] | permissive | darksworm/hksel | cc0b8f32e717b1c392ea99d254a12cad08df8a3f | eb998343d01cc37a72e9ec9104cc3d0731f764a9 | refs/heads/master | 2020-05-05T10:17:16.965343 | 2019-09-21T13:08:44 | 2019-09-21T13:08:44 | 179,938,320 | 1 | 0 | MIT | 2019-07-01T07:10:24 | 2019-04-07T08:37:37 | C++ | UTF-8 | C++ | false | false | 1,141 | h | HotkeyPickerDrawer.h | #pragma once
#include <X11/Xutil.h>
#include <X11/Xlib.h>
#include <X11/extensions/xf86vmode.h>
#include <functional>
#include <memory>
#include "../hotkey/hotkey.h"
#include "Shape.h"
#include "drawer/ShapeDrawer.h"
#include "WindowManager.h"
#include "drawer/ShapeDrawerFactory.h"
enum class HotkeyPickerMove {
... |
bb576ff1ea2727e926ff385099c46983748e6dcc | 15d1c07c71fe81d132bbd5b81005df6b59a5dc21 | /software/ai/hl/stp/tactic/pass_simple.cpp | 84ef12564555da718b407ef5f6f70bd087ed6e17 | [] | no_license | UBC-Thunderbots/Software-Deprecated | 76d9a429b7fc57e4b676904d8ef36b60461ea476 | 1ad5f5a3fdc2eed79e6a364cac3e51061ba5d2b5 | refs/heads/master | 2020-08-10T06:54:54.925782 | 2019-10-10T21:42:14 | 2019-10-10T21:42:14 | 214,287,740 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,443 | cpp | pass_simple.cpp |
#include "ai/hl/stp/tactic/pass_simple.h"
#include "ai/hl/stp/tactic/util.h"
#include "ai/hl/stp/action/shoot.h"
#include "ai/hl/stp/action/move.h"
#include "ai/hl/stp/evaluation/shoot.h"
#include "ai/hl/stp/evaluation/enemy_risk.h"
#include "ai/hl/stp/evaluation/friendly_capability.h"
#include "ai/hl/stp/predicates.h... |
ceb49d2763dc2a0888e5e55c6f06e5ddd7a390ac | 8923163e2738e98b1a73ebbd20361698f135cee8 | /ISSF/EthernetFrame.h | 376a0ea89756657c494ac3428e7f8c98a1075988 | [] | no_license | dmitsov/PuzzleGame | 5e0dd043163f9e72f92acb713f2efd10bfe2af4d | 3f6a7d9043352aae3a1065cf17a5764519470ced | refs/heads/master | 2016-09-06T03:39:17.364362 | 2014-04-24T07:26:07 | 2014-04-24T07:26:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 649 | h | EthernetFrame.h | #ifndef ETHERNET_FRAME_H
#define ETHERNET_FRAME_H
#include <stdio.h>
#include <features.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include "HeaderTypes.h"
#include "include/LinkLayerData.h"
class EthernetFrame: public LinkLayerData
{
private:
ethernet_info ethernetHeader;
public:
EthernetFrame(const ... |
dbe200aaac65c3a0fc6bcbd65c5cdbb61c87f853 | 172f1d31ab19c411c0228a1f1c2172bd88ffff1f | /examples/1_SimpleGPS/1_SimpleGPS.cpp | f91cfdeef5ae8acde83233aa73e48c7bb0d31833 | [
"MIT"
] | permissive | rickkas7/AssetTrackerRK | a8e03e327e3643a9b2b88786771c63689c39f870 | fbc7f2106ad4e3dbb9182239ea6ea1b4517b6f1b | refs/heads/master | 2023-03-05T17:45:26.061440 | 2021-10-13T13:31:56 | 2021-10-13T13:31:56 | 69,272,320 | 26 | 17 | MIT | 2023-03-02T18:25:37 | 2016-09-26T17:01:02 | C++ | UTF-8 | C++ | false | false | 2,006 | cpp | 1_SimpleGPS.cpp |
#include "Particle.h"
#include "AssetTrackerRK.h" // only used for AssetTracker::antennaExternal
// Port of TinyGPS for the Particle AssetTracker
// https://github.com/mikalhart/TinyGPSPlus
#include "TinyGPS++.h"
SYSTEM_THREAD(ENABLED);
/*
This sample sketch demonstrates the normal use of a TinyGPS++ (TinyGPSPl... |
9128556a1eef0dcdf4042f95bfb65ef1401c4ad5 | 4f4184a72fe3f9ca4ee342b496d22b5486a2f217 | /weak_ai/cpp/train.cpp | e2ae07c227faccb2e1f98e4fadce3815c4e71bcb | [
"MIT"
] | permissive | tonylearn09/hexagonal_gomoku_ai | e5ec897d3cf9934a40ecf166b6ff864c871032b0 | ddb307ee5fac7ec824a7db09d7f7b43a7adb1aa0 | refs/heads/master | 2020-03-13T22:11:22.425570 | 2018-05-03T09:09:39 | 2018-05-03T09:09:39 | 131,311,684 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 194 | cpp | train.cpp | #include "Gomoku.h"
#include "TdLearner.h"
#include <time.h>
int main() {
srand((unsigned)time(NULL));
TdLearner td(0.001, 0.9, "weight.txt");
td.learning(50);
return 0;
}
|
0621792d9129fa8665189e34880eeba38a2f3175 | ffcc850625b8590866a36d0a607e3a73cf37598d | /include/boost/simd/arch/common/scalar/function/divides_s.hpp | 49b3431bb6dd5500f1dc08aae983c1f4980ed3d5 | [
"BSL-1.0"
] | permissive | remymuller/boost.simd | af7e596f17294d35ddcd8f859c4a12cb3276254d | c6614f67be94be2608342bf5d753917b6968e821 | refs/heads/develop | 2021-01-02T09:00:18.137281 | 2017-07-06T14:23:04 | 2017-07-06T14:23:04 | 99,120,027 | 6 | 7 | null | 2017-08-02T13:34:55 | 2017-08-02T13:34:55 | null | UTF-8 | C++ | false | false | 2,813 | hpp | divides_s.hpp | //==================================================================================================
/*!
@file
@copyright 2016 NumScale SAS
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
*/
//===========================... |
dbc5d337a6c579deffa75bac1f410057ba670766 | ad029fa220d98781004c890ff149b258b3f98da0 | /remastered Bahadır Bozdağ/01. Svn/Server/game/src/char_item.cpp | 1de2ef2b9aabaa200511f7aef42acd34aa654475 | [] | no_license | Bahadir016/remastered-offlineshop-system | 5e050d9d87964afa726639dd2f02e687a9b3cdad | 6dc4f58a1b1485f760b0435c7a3ea40087b65c12 | refs/heads/main | 2023-04-01T04:29:57.570455 | 2021-04-02T22:19:35 | 2021-04-02T22:19:35 | null | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 1,483 | cpp | char_item.cpp | //Search:
{
if (iPulse - GetMyShopTime() < PASSES_PER_SEC(g_nPortalLimitTime))
{
ChatPacket(CHAT_TYPE_INFO, LC_TEXT("개인상점 사용후 %d초 이내에는 귀환부,귀환기억부를 사용할 수 없습니다."), g_nPortalLimitTime);
return false;
}
}
//Add below:
#ifdef ENABLE_OFFLINE_SHOP_SYSTEM
if (iPulse - GetMyOfflineShopTime(... |
570c6233c72cf6e07f7f6f6478e6150516b9f7d0 | 0082ee507d8add9f90ca07c580496a505e64ad8f | /car_node.h | 3d5acf1ac5e0afedab6c8fbf634946969562df21 | [] | no_license | FlipperCoin/ds-hw1 | 042ca609057d756fbcffec5ac75b10a4bd0e4d8d | 6ec1ebaec68a22809fc742c96d90c524049d4bf5 | refs/heads/main | 2023-05-02T14:48:11.777689 | 2021-05-24T17:36:43 | 2021-05-24T17:36:43 | 365,477,256 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,335 | h | car_node.h | //
// Created by Itai on 08/05/2021.
//
#ifndef DS_EX1_CARNODE_H
#define DS_EX1_CARNODE_H
#include "vector.h"
#include "shared_pointer.h"
#include "model_data.h"
#include <string>
#include <sstream>
using std::string;
using std::ostringstream;
struct CarNode {
/**
* Type ID of the node
*/
int Typ... |
7e52370fd867136044011b0deb8f814c42100bbb | 058238f45c98e0d4a7ed9883594489780f6ebe7d | /QTProject/3DFeatureExtract/fftw/fn_15.cpp | 3226ad54f1da4267b649710f882c29f113a35afc | [] | no_license | xiangliu/QSceneEdit | 18283970032208ef6c395c200cea3bd56978f982 | f9215782fa7896322556e20b74df1ccbe187f7b2 | refs/heads/master | 2020-05-04T15:32:25.091948 | 2013-06-03T01:53:44 | 2013-06-03T01:53:44 | 7,065,363 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 13,299 | cpp | fn_15.cpp | /*
* Copyright (c) 1997-1999 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later versio... |
e5ed670e61ecbc83aca92f5e9859913124f1572c | f2df0a9ddd76e750891391a265b5047a95b94627 | /src/MainWindow.cpp | 49439b5341eb363acd608ec32c30de260fd9c78c | [
"MIT"
] | permissive | wenjiegit/BullNote | be9c46b3f0a1bdc6c70770cb85a368f1f451bc29 | f24b566ff0be2d412c63753e5c748bdaefe5ae01 | refs/heads/master | 2020-07-30T07:03:16.574288 | 2019-09-22T10:58:54 | 2019-09-22T10:58:54 | 210,127,597 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,723 | cpp | MainWindow.cpp | #include "MainWindow.h"
#include "ui_MainWindow.h"
#include <QWindow>
#include <QJsonArray>
#include <QJsonDocument>
#include <QSystemTrayIcon>
#include <QMenu>
#include <QDebug>
#include "NoteItem.h"
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent)
, ui(new Ui::MainWindow)
{
ui->setupUi(t... |
25df1b7f46a7759494426ffe7860f93fee867cd5 | 25739059dd91cc84a65ae3abb9a7a0213caa8c81 | /sources/funcsim/flags.h | 6548ebdd364b4af5d27e63cdb79d5dae432f82b1 | [
"MIT"
] | permissive | MIPT-ILab/MDSP | 70a669111c6c4518e2500c4d775fe508b2661591 | e1d09a3b979b54c7b49883d48c05650476f366ae | refs/heads/master | 2020-12-26T21:49:38.410540 | 2018-11-01T09:11:30 | 2018-11-01T09:18:23 | 33,407,032 | 2 | 2 | MIT | 2018-11-01T09:11:31 | 2015-04-04T13:53:13 | C++ | UTF-8 | C++ | false | false | 850 | h | flags.h | /**
* flags.h - Header of Flags class which defines
* fields and methods to operate with flag register
* Copyright 2009 MDSP team
*/
#ifndef FLAGS_H
#define FLAGS_H
#include <cassert>
#include "register_file.h"
#define FLAG_N_POSITION 0x80
#define FLAG_Z_POSITION 0x40
#define FLAG_C_POSITION 0x20
#define FLAG_O... |
3ddd0e9076d8649753a1de99326063f2095a6667 | b6bade6e1397fac934f1aed2aff99010e03a3303 | /src/mhash/universal_hash_table.h | 72d08b83e11dc4a5d7a00bfffdfb3e23c5443c6f | [] | no_license | yangzheng2115/hashcomp | 9408f16f18790035c7123b822a36ad44e45b68f8 | 046e33b7c0d71b0392d2eaf92b339caf03c53deb | refs/heads/master | 2020-07-24T21:17:49.896831 | 2019-09-09T16:27:57 | 2019-09-09T16:27:57 | 208,052,178 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,906 | h | universal_hash_table.h | //
// Created by lwh on 19-7-9.
//
#ifndef HASHCOMP_UNIVERSAL_HASH_TABLE_H
#define HASHCOMP_UNIVERSAL_HASH_TABLE_H
#include <cassert>
#include <memory>
#include <cstddef>
#include <array>
#include <stack>
#include <cmath>
#include <limits>
#include <stdexcept>
#include <functional>
#include "util.h"
#include <boost/s... |
e9d75908d9fcbb52431a0b7cb8197f4164c27362 | 33b567f6828bbb06c22a6fdf903448bbe3b78a4f | /opencascade/ShapeConstruct.hxx | d3a51763d938bbbe84ecf1014295c27e04d6e3d2 | [
"Apache-2.0"
] | permissive | CadQuery/OCP | fbee9663df7ae2c948af66a650808079575112b5 | b5cb181491c9900a40de86368006c73f169c0340 | refs/heads/master | 2023-07-10T18:35:44.225848 | 2023-06-12T18:09:07 | 2023-06-12T18:09:07 | 228,692,262 | 64 | 28 | Apache-2.0 | 2023-09-11T12:40:09 | 2019-12-17T20:02:11 | C++ | UTF-8 | C++ | false | false | 4,730 | hxx | ShapeConstruct.hxx | // Created on: 1998-07-14
// Created by: data exchange team
// Copyright (c) 1998-1999 Matra Datavision
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the... |
a240798a106bcbd38e306de65ea623c5186b0794 | 4c00f4df7bc4948654045b36b49e790d2f0317ea | /src/BigPotSubtitle.cpp | dc86b8eaac0e84c937b401b5cc11993683751d93 | [] | no_license | amikey/bigpot | c2da22e18aa87127bf8cd0cf38ae2e6efd23b1dd | 91267c48993d58c5424583bf4b5ba9ef7eaa5104 | refs/heads/master | 2020-06-29T21:49:24.836091 | 2016-08-21T10:09:20 | 2016-08-21T10:09:20 | 67,261,502 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 558 | cpp | BigPotSubtitle.cpp | #include "BigPotSubtitle.h"
#include "BigPotSubtitleAss.h"
#include "BigPotSubtitleSrt.h"
#include "Config.h"
#include "File.h"
BigPotSubtitle::BigPotSubtitle()
{
fontname_ = config_->getString("sub_font");
if (!File::fileExist(fontname_))
{
#ifdef _WIN32
fontname_ = "c:/windows/fonts/msyh.ttc";
#e... |
03c17c2edb6060e22ea274e435295a6212031524 | 28ff4999e339fcf537b997065b31cdc78f56a614 | /components/messages/android/message_utils_bridge.h | 2b7dd1304c3d7f4ccdff59be95352956301976b4 | [
"BSD-3-Clause"
] | permissive | raghavanv97/chromium | f04e91aa24e5437793f342617515a0a95fd81478 | 5a03bdd6e398bfb1d52c241b3b154485f48174a3 | refs/heads/master | 2023-02-05T01:17:51.097632 | 2020-12-15T06:41:11 | 2020-12-15T06:41:11 | 320,831,053 | 0 | 0 | BSD-3-Clause | 2020-12-14T08:37:15 | 2020-12-12T12:56:50 | null | UTF-8 | C++ | false | false | 515 | h | message_utils_bridge.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 COMPONENTS_MESSAGES_ANDROID_MESSAGE_UTILS_BRIDGE_H_
#define COMPONENTS_MESSAGES_ANDROID_MESSAGE_UTILS_BRIDGE_H_
namespace messages {
// C++ coun... |
36af6ffe6bffd3c8b0baa92d11287131beea0c39 | d2483771e04ac89a34dfef4faae65f030ffc0168 | /dh_cryptopp/dh-agree.cpp | 9b6c1bcf9164456dbb08bed68e57d20b966cce43 | [] | no_license | tinyauyu/elec4848 | 0255b9e9f17769cb4b4c0bb2a6f851331aabe2d3 | 94634a57d16f970e01fea8e85e55aedf9ba8c4cb | refs/heads/master | 2021-01-21T13:04:55.715722 | 2016-04-22T05:49:06 | 2016-04-22T05:49:06 | 47,855,688 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,183 | cpp | dh-agree.cpp | // g++ -g3 -ggdb -O0 -I. -I/usr/include/cryptopp dh-agree.cpp -o dh-agree.exe -lcryptopp -lpthread
// g++ -g -O2 -I. -I/usr/include/cryptopp dh-agree.cpp -o dh-agree.exe -lcryptopp -lpthread
#include <iostream>
using std::cout;
using std::cerr;
using std::endl;
#include <string>
using std::string;
#include <stdexcep... |
b418a77bcd186d6f10dd7b37fec9d421dedbc587 | be9ef2030969d6c92c12c4cf4c3a4c3f4d31e99b | /chapter2/stack.cc | 930d4691c589de4567645eb91adeb2dc977f2052 | [] | no_license | YaleCheung/LeeCode | 45a8a77345daa3f212d51ef9f85742e281b0ad32 | d94707fcdc5614f94bdc76a0ed5b59ad5ae1fa2e | refs/heads/master | 2020-12-18T18:19:45.570073 | 2016-12-12T14:34:11 | 2016-12-12T14:34:11 | 28,800,497 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,623 | cc | stack.cc | class Stack {
queue<int> q1; // q1 stores the elements comming later;
queue<int> q2; // q2 stores the elements comming prior
public:
// Push element x onto stack.
// pop all elements from q1 to q2; and add the element to q1;
void push(int x) {
while(! q1.empty()) {
int elem = q1.... |
4d0106a514a4abbe7e96efa59b79b220955b6d4e | 13d750a9867dbd9527fe5e2205199b785ba08935 | /T3/TerminalNode.h | 0af5583c2a4fd5bb79ea87e996abe8ae90043088 | [] | no_license | nikom1912/CC5114 | 0aea4817d818e010d2af356d2f098ce28c401205 | f60ff9ac58e3e258fb35064fea8e23832cfa7d50 | refs/heads/master | 2020-07-09T01:21:28.769782 | 2019-12-15T23:54:53 | 2019-12-15T23:54:53 | 203,834,302 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 655 | h | TerminalNode.h | //
// Created by nikom on 12-12-2019.
//
#ifndef T3_TERMINALNODE_H
#define T3_TERMINALNODE_H
#include "Node.h"
template <typename T>
class TerminalNode: public Node<T> {
private:
T value;
public:
TerminalNode<T>(T value);
T eval();
void print();
};
template<typename T>
Terminal... |
6a502c53b14564dd199031e5244af903273e8d9c | a27d4dd7e8c11d2c55a6e1a7a5b9a05bf93d014f | /1_Dynamic_Programming/num_codes.cpp | abc18f402d5fa82bd0cf2f8339b4165cf20a705a | [] | no_license | amanpratapsingh9/Competitive_Coding_Ninjas | 8c0c311c1eb780398f075a09849949c2a92a7826 | 51bebab0437e57ef897fa9a933fc7b11ce0f3170 | refs/heads/master | 2022-01-08T09:38:21.596283 | 2019-01-25T23:50:11 | 2019-01-25T23:50:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,297 | cpp | num_codes.cpp | #include<bits/stdc++.h>
using namespace std;
int num_codes(int *input, int size)
{
if(size == 1)
return 1;
if(size == 0)
return 1; //empty string
int output = num_codes(input,size-1);
if(input[size-2]*10 + input[size-1] <= 26)
output += num_codes(input,size-2); //this we don't have to do always!
return... |
41542b9c4197868b0d3eff30469cc50310fee03d | 2fc0325a8b7a96048ca322d66ada67878fa0710f | /BST-level order traversal/main.cpp | f9fb33c05beed8da5c369e62b4545f1e11e18a38 | [] | no_license | moodgalal/data-structures-with-c- | 45bb8b7cc9f576bd1ececaf308990d5be74f59c8 | 19c3b713db19480ec8b0f3e8bd4dcd391d97892d | refs/heads/master | 2020-05-17T10:49:42.900008 | 2019-04-26T17:18:18 | 2019-04-26T17:18:18 | 183,667,198 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,601 | cpp | main.cpp | #include <iostream>
#include <queue>
using namespace std;
struct node
{
int data;
node *left;
node *right;
};
node* createNode(int value);
node* insertNode(node* root , int data);
void levelOrderTraversal(node *root);
int main()
{
node *root = NULL;
root = insertNode(root , 5);
root = insertNode(ro... |
4355228180f4b8bd38481e02332f9b3473c71c3f | 32739fe6c633e30600c9e41389d34672b572e679 | /X96935 - Palíndroms amb piles.cc | 5d74f35d249ebda66c492a29b4e4eba84019b49e | [] | no_license | JoanK11/FIB-PRO2-Programacio-II | cda0c24b9ee98aa89887277a1c906eaa0d793afc | 5aff73fc6698ebd3f480c73dea330de0cb3b1484 | refs/heads/main | 2023-06-21T19:13:28.484270 | 2021-06-12T10:56:32 | 2021-06-12T10:56:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 437 | cc | X96935 - Palíndroms amb piles.cc | #include <iostream>
#include <stack>
using namespace std;
bool palindrom(stack<int>& S, int n) {
int x;
if (n%2 != 0) cin >> x;
for (int i = 0; i < n/2; ++i) {
cin >> x;
if (x != S.top()) return false;
S.pop();
}
return S.empty();
}
int main() {
int n;
cin >> n;
stack<int> S;
int x;
for (int i = 0; i... |
e2f5973757e95920b76d7258f307445ecce904e4 | 9adc52bbcb5e94e666717dca705f15c3110818d2 | /PPATH.cpp | 7f66892e79ae140d42d9c1a94e269cf092cc250a | [] | no_license | moulik-roy/SPOJ | 436baddc876631af4a99ea97fad4138f8cac5c7c | bf7f86368f5b684cf54a345fa92464b15138671d | refs/heads/master | 2022-08-20T00:24:35.048290 | 2022-07-27T18:21:05 | 2022-07-27T18:21:05 | 187,269,984 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 992 | cpp | PPATH.cpp | #include <iostream>
#include <cstring>
#include <string>
#include <queue>
using namespace std;
bool isPrime[10000];
void seive(){
int i, j;
memset(isPrime, true, sizeof(isPrime));
isPrime[0]=isPrime[1]=false;
for(i=2; i*i<10000; i++){
if(isPrime[i]==true){
for(j=i*i; j<10000; j+=i)
isPrime... |
6d616aa17e606a8301c2d12ef9af1bb77f80221d | 4ba874cb13ce3fdd843718ab93dab6ced7ee32d4 | /examples/kmeans/kmeans.cpp | 4089647901fbd4790d18611bbe1f5c66c0c3b121 | [] | no_license | Yuzhen11/flexps-paper-version | 1fd1f5378da6aeb7dd1a4426c85a62a784baf843 | 8163fbeff79786c7503f605b5d46ea22f5777d4c | refs/heads/master | 2021-09-12T03:52:12.184259 | 2018-04-14T01:46:28 | 2018-04-14T01:46:28 | 72,823,909 | 6 | 1 | null | 2018-04-14T01:43:46 | 2016-11-04T07:23:11 | C++ | UTF-8 | C++ | false | false | 7,334 | cpp | kmeans.cpp | #include "examples/kmeans/kmeans_helper.hpp"
int main(int argc, char* argv[]) {
bool rt = init_with_args(argc, argv, {"worker_port", "cluster_manager_host", "cluster_manager_port",
"hdfs_namenode", "hdfs_namenode_port", "input", "num_features", "num_iters"});
int num_... |
3caa436224f78e8502700af2fbecb36fd2006164 | 8c1a1a68ebc030c53798252b85263f22cdd00785 | /SpaceStationRescue/Game.cpp | 1518937636f6a0acda60c6b3b405319e7e7704c0 | [] | no_license | MatTheGreat/SpaceStationRescue | 81b55e0f980087c174ca920b0b93d77b7fcfe0d4 | 2d4be172de263db4265c954100e0d427214accf4 | refs/heads/master | 2021-08-24T06:13:15.247937 | 2017-12-08T10:39:24 | 2017-12-08T10:39:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 523 | cpp | Game.cpp | #include "Game.h"
Game::Game()
{
m_window = new sf::RenderWindow(sf::VideoMode{ 1920, 1080, 32 }, "Space Station Rescue 2!!!");
m_exitGame = false;
m_window->setFramerateLimit(60);
}
Game::~Game()
{
}
void Game::run()
{
while (m_window->isOpen())
{
processEvents(); // as many as possible
update();
render... |
281e1033a9f1a96cab4dbdb361ec4f54b4c1501d | 4b205ffc82b967173a4875a7876fcdc94d294c29 | /time/src/time_test.cpp | 5f0b072919348025eddb80cd537090666515427f | [] | no_license | udooer/cpp_work | 4bf6be00704e592191606f32982cbd72e2c96616 | 02f45f92b560be415f9e8989324a176ad07de03f | refs/heads/master | 2023-04-02T06:08:45.065182 | 2021-04-13T12:07:05 | 2021-04-13T12:07:05 | 197,614,957 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 441 | cpp | time_test.cpp | #include<iostream>
#include<string>
#include<sstream>
#include<ctime>
using namespace std;
string getTime(){
time_t now = time(0);
tm *ts = localtime(&now);
stringstream ss;
string date;
ss<<1900+ts->tm_year<<"-"<<1+ts->tm_mon<<\
"-"<<ts->tm_mday<<"_"<<ts->tm_hour<<":"<<\
ts->tm_min<<":"<<ts... |
9cb96e2cb369960b971bb6ed985a02e32aaea163 | c1d34c8db46849966a0b37b18f70c6e6ee91fc26 | /code/AnalysisInterface/Module.cc | 57da055444527b47883b54bd68c5b198cbdf21c6 | [] | no_license | sgnoohc/TrackLooper | a44c1e22d393ef760633b2cd5c30d23389bf85d6 | f3d215051e8291f98aea24e7a554f73a7c356a09 | refs/heads/master | 2021-11-22T07:29:29.638458 | 2021-08-23T05:34:59 | 2021-08-23T05:34:59 | 179,347,611 | 0 | 1 | null | 2020-05-08T21:09:26 | 2019-04-03T18:30:25 | C++ | UTF-8 | C++ | false | false | 9,462 | cc | Module.cc | # include "Module.h"
SDL::Module::Module()
{
}
SDL::Module::Module(unsigned int detId, short layer, short ring, short rod, short module, bool isInverted, bool isLower, short subdet, SDL::ModuleType moduleType, SDL::ModuleLayerType moduleLayerType, short side)
{
detId_ = detId;
layer_ = layer;
module_ = m... |
9a68ee499c0e1f3b577f437ae44b8a3f2e7ec9ee | f1cbd2f44c5b60f04cf15b2d78d6aaa8f2e9f572 | /1996.cpp | 3f304bac13abce6ea2bbed71287ac5f3d6e7b059 | [] | no_license | Reach220/23 | c5812d0db69d2f5e35f9a8d9a22a2abf60a55bf7 | ba4647301fec2cd4c6855c5db2e4fff526c6b354 | refs/heads/master | 2023-02-20T12:43:06.905139 | 2020-12-31T04:34:37 | 2020-12-31T04:34:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,447 | cpp | 1996.cpp | //n个人围成一圈，从第一个人开始报数,数到 mm 的人出列，再由下一个人重新从 11 开始报数，数到 mm 的人再出圈，依次类推，直到所有的人都出圈，请输出依次出圈人的编号。
#include<cstdio>
#include<queue>
#include<iostream>
using namespace std;
int n,m;
int a[105];
int num,cnt=0,rear;//cnt计数器，记录数了几个人（数到m为止） rear计时器，记录到n
int main(){
scanf("%d %d",&n,&m);
int num=n;
/*last=1;
while(num)... |
500d31e2bf8e99a2d18c6b30fd466afd5d61ead1 | d37b49d28edcd2a5ac905cb2cb8a67cf6a015329 | /Lab_1/main.cpp | ab2e64da648245b083aa7e7253d8f011ad27b791 | [] | no_license | Bibletoon/ProgrammingSecondSem | d02d575cb2e741721a1d628e4577aae6e75d5a3c | 98794829d46c2efc0a9cbe1d3804b30ee0152b38 | refs/heads/master | 2023-05-06T15:55:43.937618 | 2021-05-31T21:43:07 | 2021-05-31T21:43:07 | 343,347,681 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,493 | cpp | main.cpp | #include <cassert>
#include <iostream>
#include "Point.h"
#include "PolygonalChain.h"
#include "ClosedPolygonalChain.h"
#include "Polygon.h"
#include "RegularPolygon.h"
#include "Trapezoid.h"
#include "Triangle.h"
const double EPS = 1e-9;
void PointCheck()
{
const Point p1;
assert(p1.GetX() == 0 && p1.GetY() == 0)... |
94e0000b7f60b0ba1ff19f6d42ba90f70437c1ac | 7b417bc4422aadfa00fd5f817ac888c627046924 | /Autonomous Claw.ino | 0d86de61f375fa7652dceea6f88a5063fc502137 | [] | no_license | ShouryaSaklecha/AutonomousClaw | 12c9315f04d0b8d08d2324d6ee654f913d64a171 | 44a4731dc3dc0bbb4a81d70c8e5fa8386c44db5a | refs/heads/main | 2023-05-11T15:40:21.269962 | 2023-05-05T06:33:49 | 2023-05-05T06:33:49 | 345,772,222 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,308 | ino | Autonomous Claw.ino | // --------------------------------------------------------------------------------------
// Code for Autonomous Claw: APSC 101
// Author: Shourya Saklecha
// Sources: Example codes in Arduino IDE; APSC 101
--------------------------------------------------------------------------------------
#include <Servo.h>
#define... |
5d37352561e0454582fa9978f96221a6ab4f72bf | 5942e3e75ef7dc22a67b04fb1f12e14658a2093d | /duchain/helpers.h | a29c402be92f4baddef0a6d3efeb2e94df23b7dc | [] | no_license | the-factory/kdevelop-python | 9e94d2a4d4906a31a4d2a8a08300766e02d41a59 | 1e91f2cb4c94d9455a2ee22fef13df680aeed1ab | refs/heads/master | 2021-01-18T08:57:16.707711 | 2012-04-09T22:37:47 | 2012-04-09T22:37:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,769 | h | helpers.h | /*****************************************************************************
* This file is part of KDevelop *
* Copyright 2011-2012 Sven Brauch <svenbrauch@googlemail.com> *
* *
* P... |
0eb36547636dfaeb1d2851c16852cd5e8c1b0d48 | e7df6d41d7e04dc1c4f4ed169bf530a8a89ff17c | /OpenSim/Examples/Moco/exampleSlidingMass/exampleSlidingMass.cpp | 17eb22f15c39acffbd572f9a3973396dc0dae56c | [
"Apache-2.0"
] | permissive | opensim-org/opensim-core | 2ba11c815df3072166644af2f34770162d8fc467 | aeaaf93b052d598247dd7d7922fdf8f2f2f4c0bb | refs/heads/main | 2023-09-04T05:50:54.783630 | 2023-09-01T22:44:04 | 2023-09-01T22:44:04 | 20,775,600 | 701 | 328 | Apache-2.0 | 2023-09-14T17:45:19 | 2014-06-12T16:57:56 | C++ | UTF-8 | C++ | false | false | 4,509 | cpp | exampleSlidingMass.cpp | /* -------------------------------------------------------------------------- *
* OpenSim Moco: exampleSlidingMass.cpp *
* -------------------------------------------------------------------------- *
* Copyright (c) 2017 Stanford University and the Authors *
... |
d2d6ec61ff2029ad4dccf3af1436c7a4a212a254 | 325483686eb27365fa08e39c543747d659a69099 | /cpp/AddBinary.cpp | 28e81b6e64aded9b492bb745b024308a127ed54e | [
"Apache-2.0"
] | permissive | thinksource/code_interview | 11bff53199cd47e9df3c7bc3034f0670209231d2 | 08be992240508b73894eaf6b8c025168fd19df19 | refs/heads/master | 2020-04-11T02:36:38.858986 | 2016-09-13T22:13:31 | 2016-09-13T22:13:31 | 68,151,728 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 647 | cpp | AddBinary.cpp | class Solution {
public:
string addBinary(string a, string b) {
int lenA = (int)a.length();
int lenB = (int)b.length();
int i = lenA-1;
int j = lenB-1;
int carry = 0;
int sum = 0;
string res = "";
while(j>=0 || i>=0) {
int ai = (i>=0)? (a[i... |
f89a9138741185f09dc903af6f732910908b2a6e | aaebbe73cc851ba9ed8a3493abedb739d122533a | /server/yslib/utility/io_wrap.cpp | 67ed5a97c010955fb2eca7b59321c881c4676591 | [] | no_license | coeux/lingyu-meisha-jp | 7bc1309bf8304a294f9a42d23b985879a28afbc0 | 11972819254b8567cda33d17ffc40b384019a936 | refs/heads/master | 2021-01-21T13:48:12.593930 | 2017-02-14T06:46:02 | 2017-02-14T06:46:02 | 81,812,311 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 477 | cpp | io_wrap.cpp | #include "io_wrap.h"
#include "io_service_pool.h"
#include <stdexcept>
#include <assert.h>
using namespace std;
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/syscall.h>
#define gettid() syscall(SYS_gettid)
#include "log.h"
io_wrap_t::io_wrap_t(const char* name_):m_name(name_),m_io(io_pool.get_io_servic... |
e4d8cb266b746824483607734f02e5613f3b11ff | 792ad26fd812df30bf9a4cc286cca43b87986685 | /虽然是DP渣也不要放弃啊QAQ/POJ 1157 LITTLE SHOP OF FLOWERS.cpp | 02a93a4da4da166fa39cdc72ce88a4d0e16f7656 | [] | no_license | Clqsin45/acmrec | 39fbf6e02bb0c1414c05ad7c79bdfbc95dc26bf6 | 745b341f2e73d6b1dcf305ef466a3ed3df2e65cc | refs/heads/master | 2020-06-18T23:44:21.083754 | 2016-11-28T05:10:44 | 2016-11-28T05:10:44 | 74,934,363 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 869 | cpp | POJ 1157 LITTLE SHOP OF FLOWERS.cpp | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 104
int dp[N][N], f[N][N];
int main(){
int i, j, n, m, ans, k;
while(scanf("%d%d", &n, &m)!= EOF){
for(i = 1; i <= n; i++){
for(j = 1; j <= m; j++){
scanf("%d", &f[i][j])... |
4ec117bfbea4f0fcaed4fac7be93bc1228c5aa6b | 8515be16eb8f94bb27bb3e5e71f40092bdfa2f73 | /src/yntdl/objects/position.cpp | d5b00b582bd241036e40a0da7da563e773fbef66 | [
"MIT"
] | permissive | OpenLabWorld/YNTDL | ea37297b889f505661060024eddca7fdbb377139 | c21687b4ab54d9fbf1f8ac7db512cb36840c7607 | refs/heads/master | 2022-03-22T05:29:58.008213 | 2019-12-14T19:48:54 | 2019-12-14T19:48:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,418 | cpp | position.cpp | #include <cmath>
#include <iostream>
#include <string>
#include <map>
#include "yntdl.h"
#define PI 3.141592653
using namespace yntdl;
std::ostream& std::operator<<(std::ostream &out, const Position &pos){
out << "Time: " + std::to_string(pos.time);
out << " x: " + std::to_string(pos.x);
out << " y: " +... |
a8202b5f99e97841208e9a73d1cd22a79bc5976d | a0021d752f823b066b7ec0c0fd66a3ef26e85a86 | /filetrans_client/BusProcessor.h | 19cf79fb29b7a9de021c223d5ecdfaae841fd1ef | [] | no_license | AlexGobin/filetrans_client | 69085aa12aa4b8feb4f0f48799bde4ef23fd1877 | c2907352e7092f5dfccb5dadbee8f6905b3e8d01 | refs/heads/master | 2020-04-13T15:59:07.198364 | 2019-01-14T14:05:28 | 2019-01-14T14:05:28 | 163,308,773 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 408 | h | BusProcessor.h |
#ifndef FT_BUS_MAIN_H_
#define FT_BUS_MAIN_H_
#include "user_event_handler.h"
class BusinessProcessor
{
public:
BusinessProcessor(std::shared_ptr<DispatchMsgService> dms);
bool init();
virtual ~BusinessProcessor();
private:
std::shared_ptr<DispatchMsgService> dms_;//账户接口分发系统
std... |
cd43d41a8a86b4c671998eead8f3a72d061ef988 | 199db94b48351203af964bada27a40cb72c58e16 | /lang/sq/gen/Bible34.h | a87b58b947ff69ace491782d29dceab0bf510d09 | [] | no_license | mkoldaev/bible50cpp | 04bf114c1444662bb90c7e51bd19b32e260b4763 | 5fb1fb8bd2e2988cf27cfdc4905d2702b7c356c6 | refs/heads/master | 2023-04-05T01:46:32.728257 | 2021-04-01T22:36:06 | 2021-04-01T22:36:06 | 353,830,130 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,258 | h | Bible34.h | #include <map>
#include <string>
class Bible34
{
struct sq1 { int val; const char *msg; };
struct sq2 { int val; const char *msg; };
struct sq3 { int val; const char *msg; };
public:
static void view1() {
struct sq1 poems[] = {
{1, "1 Profecia mbi Niniven. Libri i vegimit të Nahumit nga Elkoshi."},
{2, "2 Zoti ësh... |
315c0eb6fb8cc00c7bf57dc2178b79a3225148c4 | f8c5ff527dfb289f4f9f98b0f48d08a0deb9da84 | /lab1/V1.0/dllist.h | e13cc6d30d169dd700c8a75df631710dd975fa99 | [
"Apache-2.0"
] | permissive | centurion-crawler/os-nachos | 8d8520fae71bcba6df3b77658fbd2c271e279bc0 | f6f07c02c58f52419ed63d0751d686a72ac675c4 | refs/heads/main | 2023-05-07T03:36:22.580272 | 2021-05-13T06:40:49 | 2021-05-13T06:40:49 | 349,126,230 | 0 | 0 | Apache-2.0 | 2021-03-18T15:33:34 | 2021-03-18T15:33:34 | null | UTF-8 | C++ | false | false | 1,277 | h | dllist.h | #ifndef DLLIST_H
#define DLLIST_H
class DLLElement{
public:
DLLElement(void* itemPtr, int sortKey); // initialize a list element
DLLElement *next; // next element on the list, NULL if last
DLLElement *prev; // previous element on the list, NULL if first
int key; // priority, for a s... |
db05958fa855f84d18f93d8d34ad5bc7ec6c11fb | 4dc91b14630d507d32ec75c7c099ba3576b07232 | /CTPPSAnalysisTools/plugins/TestAnalyzer.cc | 452b7862485dfe13a2d87a9abc584fb5ad1d88d2 | [] | no_license | beatrizlopes/TopLJets | 6b62ccfd5249f6d0d06c04a487e638958df229af | 198250ab1eae8a6a11b66dad626a827f46ec0092 | refs/heads/master | 2023-06-21T20:10:46.840262 | 2019-08-01T10:44:01 | 2019-08-01T10:44:01 | 198,248,791 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,337 | cc | TestAnalyzer.cc | // -*- C++ -*-
//
// Package: CTPPSAnalysisTools/Analyzer
// Class: TestAnalyzer
//
/**\class TestAnalyzer TestAnalyzer.cc CTPPSAnalysisTools/Analyzer/plugins/TestAnalyzer.cc
Description: [one line class summary]
Implementation:
[Notes on implementation]
*/
//
// Original Author: Laurent Forthomme
//... |
320bd9ec7d53bc4b55c9a8e12f114f922422bc5a | b4ff3270de066f217681a93f521a2ad68bfef932 | /src/pyhooks.h | 40a064d12829f837a48f3b9b4c1ed5368763d253 | [] | no_license | asmfakhrul/cyclus | 9a988e677fe3a0a438cb55f4bbef330744c23dd3 | aab40e97d779657c50ce927419fde58c7b035b33 | refs/heads/master | 2021-08-28T17:15:12.530953 | 2017-12-12T22:03:47 | 2017-12-12T22:03:47 | 106,435,279 | 0 | 0 | null | 2017-10-10T15:24:30 | 2017-10-10T15:24:29 | null | UTF-8 | C++ | false | false | 1,979 | h | pyhooks.h | #ifndef CYCLUS_SRC_PYHOOKS_H_
#define CYCLUS_SRC_PYHOOKS_H_
#include <string>
namespace cyclus {
class Agent;
/// Because of NumPy #7595, we can only initialize & finalize the Python
/// interpreter once. This variable keeps a count of how many times we have
/// initialized so that we can know when to really stop th... |
6ba22f77583b002bfa83db12e1a4c7cab5dc327e | 40759a3d38a71023670f6510a0b03c1c84c471f7 | /merge.h | 1f7a644159addd997e82910981766f29682879bc | [
"Apache-2.0"
] | permissive | phaistos-networks/Trinity | f78cb880fe6d24dc331659b034f97c4e19be3836 | a745a0c13719ca9d041e1dfcfeb81e6bf85a996f | refs/heads/master | 2021-01-19T04:34:31.721194 | 2019-11-08T18:12:31 | 2019-11-08T18:12:31 | 84,192,219 | 250 | 23 | null | null | null | null | UTF-8 | C++ | false | false | 5,464 | h | merge.h | #pragma once
#include "docidupdates.h"
#include "terms.h"
#include "index_source.h"
namespace Trinity {
struct merge_candidate final {
// generation of the index source
// See IndexSource::gen
uint64_t gen;
// Access to all terms of the index sou... |
d2e375aa65fc690372a92823b50540b88d06b385 | 70fbdb1feb44ca959edfdca3fac550a87c654c94 | /src/activeobject/Activation_Queue.cpp | 88131c2875dfe537f856ff645bcf0d78c1ff86e0 | [] | no_license | 774280605/server | 6f7898bd7090c9ba0256e32e0b131cfea00c5bc9 | 3676f1409c0891495182125c6d63ad67d03afa8b | refs/heads/master | 2020-09-07T13:38:22.088638 | 2019-12-02T14:05:45 | 2019-12-02T14:05:45 | 220,797,881 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 272 | cpp | Activation_Queue.cpp | //
// Created by zxf on 2019/11/24.
//
#include "Activation_Queue.h"
Method_Request* Activation_Queue::remove(Method_Request *methodRequest) {
return queue_.front();
}
void Activation_Queue::insert(Method_Request *methodRequest) {
queue_.push(methodRequest);
}
|
8b0586b9527b118bf903574c6c177e527ae5a62f | a254c8cf26e20bf46be45634a1df2bae55a274e2 | /temp_humi_press_sketch.ino | cb65f54a87e529bfa3639c5e748eba8ab95476ba | [] | no_license | bruderbb/esp8266-BME280 | 9d7a84f743fb6181e9168ab9472c3ec46e5d94e8 | 066bda211c4845caf22f205c59214f95d58c77c4 | refs/heads/master | 2021-01-20T00:15:47.660242 | 2016-04-12T08:09:10 | 2016-04-12T08:09:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,011 | ino | temp_humi_press_sketch.ino | #include <ESP8266WiFi.h>
#include <Adafruit_MQTT.h>
#include <Adafruit_MQTT_Client.h>
#include <Wire.h>
#include <Adafruit_Sensor.h>
#include <Adafruit_BME280.h>
#define SEALEVELPRESSURE_HPA (1013.25)
Adafruit_BME280 bme; // I2C
//Adafruit_BME280 bme(BME_CS); // hardware SPI
//Adafruit_BME280 bme(BME_CS, BME_MOSI, BME... |
55b4ff48b7d276acb0455d61e8a6757852eab0b8 | b1cca159764e0cedd802239af2fc95543c7e761c | /ext/libgecode3/vendor/gecode-3.7.3/test/set.hh | 80709886ba9533915cf310e633c75782876ac5f2 | [
"MIT",
"Apache-2.0"
] | permissive | chef/dep-selector-libgecode | b6b878a1ed4a6c9c6045297e2bfec534cf1a1e8e | 76d7245d981c8742dc539be18ec63ad3e9f4a16a | refs/heads/main | 2023-09-02T19:15:43.797125 | 2021-08-24T17:02:02 | 2021-08-24T17:02:02 | 18,507,156 | 8 | 18 | Apache-2.0 | 2023-08-22T21:15:31 | 2014-04-07T05:23:13 | Ruby | UTF-8 | C++ | false | false | 11,729 | hh | set.hh | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Guido Tack, 2005
* Christian Schulte, 2005
*
* Last modified:
* $Date: 2011-07-12 20:49:06 +1000 (Tue, 12 Jul 201... |
5d8a6f24f22c26a469a00c49051812e146062fd2 | f86a8fc715b8354e50314122a2a1a1b33cf351a1 | /src/Core/ITKCommon/ThreadUtils/the_thread_pool.cxx | 912685834f51341e26ecddd243eb5cd2a42963b8 | [
"MIT"
] | permissive | SCIInstitute/Seg3D | 579e2a61ee8189a8c8f8249e9a680d3231c0ff3a | 84ba5fd7672ca7d08f9f60a95ef4b68f0c81a090 | refs/heads/master | 2023-04-21T05:21:08.795420 | 2023-04-07T17:32:36 | 2023-04-07T17:32:36 | 32,550,368 | 103 | 51 | null | 2023-04-07T17:32:38 | 2015-03-19T22:49:29 | C++ | UTF-8 | C++ | false | false | 18,586 | cxx | the_thread_pool.cxx | /*
For more information, please see: http://software.sci.utah.edu
The MIT License
Copyright (c) 2016 Scientific Computing and Imaging Institute,
University of Utah.
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Softwa... |
7ff3cfb853ca2dacf03e63835079bd6ba5c61153 | 12cd044c57f4fb42362b28820d526e79684365f2 | /gazebo/gui/ModelMaker.hh | e150a35d0b657123bbcc128f4a659ed2c8d11821 | [
"Apache-2.0"
] | permissive | ci-group/gazebo | 29abd12997e7b8ce142c01410bdce4b46b97815f | 1e8bdf272217e74eeb49349da22a38d3275e5d72 | refs/heads/gazebo6-revolve | 2021-07-09T16:05:29.272321 | 2019-11-11T17:56:01 | 2019-11-11T17:56:01 | 82,048,176 | 3 | 2 | NOASSERTION | 2020-05-18T13:49:18 | 2017-02-15T10:22:37 | C++ | UTF-8 | C++ | false | false | 2,292 | hh | ModelMaker.hh | /*
* Copyright (C) 2012-2015 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... |
739be2ef2736a00ab9935f0cc27927b4315da001 | 69c9ed5122cb49532e9e0d59bab78497ce3e4857 | /ArrayStack (For Bloodshed Dev-C++)/main.cpp | e4f9446fd27daaf276df3ae22922104be35adb05 | [] | no_license | galvanitic/ArrayStack | d6a59b12b8fb3ba6cc74f0815480803058e91acd | ffa89e890a41cb7bbc6566f3a97393512a33f0ff | refs/heads/main | 2023-01-24T00:49:02.314387 | 2020-11-25T05:22:03 | 2020-11-25T05:22:03 | 307,849,018 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,444 | cpp | main.cpp | #include <iostream>
#include "Item.h"
#include "Stack.h"
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
void menu();
int main(int argc, char** argv) {
char choice;
cout << ">> Please hold while I create an empty stack..." << endl;
Stack ne... |
4bc7c111283063ea2ca95d43a590bee40c9d6314 | 2d5816c153038f51612e3610e485e4baf3f67cb7 | /Assignments/Assignment 2/Chess/main.cpp | 111008b74ea9c0b9b4ba76032950b481471ab8d6 | [] | no_license | Hammad-Ikhlaq/Artificial-Intelligence | 3519267eabc4aa9c23b4b893e47df7fdd15e56e2 | e43c17427d40c67f756f5bf8336c8a321e4a9fb4 | refs/heads/master | 2020-12-02T12:56:43.545421 | 2019-12-31T02:42:55 | 2019-12-31T02:42:55 | 231,012,961 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 366 | cpp | main.cpp | #include "include\\actionList.h"
#include <iostream>
#include<iomanip>
#include "include\\chess.h"
#include "include\\autoPlayer.h"
#include "include\\humanPlayer.h"
using namespace std;
int main(){
chess Game;
Game.Players[1] = new humanPlayer("Hammad", White);
Game.Players[0] = new autoPlaye... |
31b7ef830f01286408802d36d086792ea0fc4476 | 0131f6d91da5b063b3d79330b014871c128c67ed | /irc/zncmodules/urlbuffer.cpp | ff4523d304da6ee8c8ef06dcb940d3f778aaa597 | [
"Zlib"
] | permissive | moneytech/code-2 | f31602a702cc7e13b24c1ab5817d30d2314dde76 | d970038329f7c4e4f0ee9dcd1b345741dd0fcc51 | refs/heads/master | 2021-10-02T18:24:20.159492 | 2018-11-30T02:14:18 | 2018-11-30T02:14:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,890 | cpp | urlbuffer.cpp | /* Copyright (C) 2011 uberspot
*
* Compiling: znc-buildmod urlbuffer.cpp
* Dependencies: curl, wget, sed and a unix environment.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 3 as published
* by the Free Software Foundation (http... |
00b129f95fd407cc8a9013895bd9effe9c4dc4f9 | 24d8838e94c1c67b5e8386aa52faf012d28e3251 | /hw6/piece.cpp | 43118c6efc539ee2b306dcb1ba8a8cf2e6648577 | [] | no_license | melina-delgado/CS427 | 95bc9e4c402202c958c3f42315029555dc17afda | 1d1cef5214bcb13a3195add4450eb70bbe67dd04 | refs/heads/master | 2022-04-11T19:28:29.924636 | 2020-03-21T01:55:56 | 2020-03-21T01:55:56 | 105,041,487 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 380 | cpp | piece.cpp | #include "piece.h"
namespace cs427_527
{
Piece::Piece() {}
Piece::Piece(int p, int r, int c)
: player(p), row(r), col(c) {}
Piece::~Piece() {}
int Piece::getPlayer() const
{
return player;
}
/*bool Piece::isLegalMove(const Board& board, int toR, int toC) const
{
return false;
}
void ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.