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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b9369292d39ccbc985c069f7c99f2cf7daee68a7 | 08e04af75fa7b12f56a762f30745228f878db806 | /sdf-net/lib/submodules/libigl/python/python_shared.cpp | 955037564fed8de9bdcfc871979d7a1a9c4c263e | [
"MIT",
"GPL-3.0-only",
"MPL-2.0"
] | permissive | hardikk13/nglod | 3d4bd01124cc7a084688ae014b24f4365460160b | 6c6c66ce1b39c5a3515cafc290ec903ae90b506e | refs/heads/main | 2023-05-07T10:48:19.715916 | 2021-05-19T17:31:17 | 2021-05-19T17:31:17 | 367,096,223 | 0 | 0 | MIT | 2021-05-13T15:42:42 | 2021-05-13T15:42:42 | null | UTF-8 | C++ | false | false | 4,862 | cpp | python_shared.cpp | // This file is part of libigl, a simple c++ geometry processing library.
//
// Copyright (C) 2017 Sebastian Koch <s.koch@tu-berlin.de> and Daniele Panozzo <daniele.panozzo@gmail.com>
//
// This Source Code Form is subject to the terms of the Mozilla Public License
// v. 2.0. If a copy of the MPL was not distributed wi... |
9c17007a5a4c15011d5e731645d094e719bb4bdb | ab2fde8c987e4108690b84eb1508fa65ff04aece | /source/lib/PccLibCommon/source/PCCKdTree.cpp | 1b03f0a8c46cfa92c53e6297925fe778d664298f | [
"BSD-3-Clause"
] | permissive | MPEGGroup/mpeg-pcc-tmc2 | a319c14febdd75b1c5137da3777d015cb915b03e | 30ce27aeb9d88d5dd2efedc6d45086396260444d | refs/heads/master | 2023-03-08T14:49:57.434200 | 2022-05-30T12:22:33 | 2022-05-30T12:22:33 | 194,936,485 | 129 | 52 | NOASSERTION | 2023-03-07T21:28:57 | 2019-07-02T21:20:59 | C++ | UTF-8 | C++ | false | false | 3,625 | cpp | PCCKdTree.cpp | /* The copyright in this software is being made available under the BSD
* License, included below. This software may be subject to other third party
* and contributor rights, including patent rights, and no such rights are
* granted under this license.
*
* Copyright (c) 2010-2017, ISO/IEC
* All rights reser... |
5b00465b80ac4e3db719a26d2cf5c8553dfad237 | 0f6765cdbf6b59519a407e071be79f860898640f | /alho/seqdebug.h | c890a05c7599666f289a7f6db751bb7f39bc2049 | [] | no_license | skifcorp/bossn | 0d6ee9d894c823fd9660f9c6d05f1ec6313fccb9 | 09b9d1cd6542fa5af71e8808572552d618160eee | HEAD | 2016-09-06T00:08:25.981114 | 2014-09-19T05:47:11 | 2014-09-19T05:47:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 502 | h | seqdebug.h | #ifndef SEQDEBUG_H
#define SEQDEBUG_H
#include <QDebug>
#include <QString>
class MainSequenceBaseOp;
class SeqDebug : public QDebug
{
public:
SeqDebug(bool use_db, MainSequenceBaseOp& s, int err_code, bool toCons = true) :
QDebug(&buffer), use_database(use_db), seq(s),
error_code(err_code), to_co... |
6f906b7cc907045e629112e15a9e7fd3afaeeea4 | ad57ffe2372cf614796e316b4865ba02a760acab | /tcs/csp_solver_pt_sf_perf_interp.h | 659cf11c0c7ede8e927f0646803b14211cb1fc36 | [
"LGPL-2.0-or-later",
"LGPL-2.1-only",
"BSD-3-Clause"
] | permissive | NREL/ssc | 6208c26a9bbab21d7beca630d61b8640fe073f49 | 38860345e14a14357cf2ad4f1918729a0c7ac0c6 | refs/heads/develop | 2023-08-30T10:09:17.654286 | 2023-08-16T20:27:59 | 2023-08-16T20:27:59 | 94,245,800 | 74 | 84 | BSD-3-Clause | 2023-09-14T20:03:50 | 2017-06-13T18:40:17 | C++ | UTF-8 | C++ | false | false | 4,945 | h | csp_solver_pt_sf_perf_interp.h | /*
BSD 3-Clause License
Copyright (c) Alliance for Sustainable Energy, LLC. See also https://github.com/NREL/ssc/blob/develop/LICENSE
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions ... |
263c5bbb8562fc6433c685a74fdb785812bb9c76 | 7fca4e645f24880ab75f644f03d227aa5688749d | /dataStructure/Classes_cpp/stl/deque/test.cpp | bbb4ce1dc54de3dc4bf9e38704cbb4d6bdad304c | [] | no_license | jcarlosadm/classes | 95e687f8ec6e4c1f405442de86c0dffc588f0f2e | 9658b1b0805647f64d02c4b760d81d26943ec6da | refs/heads/master | 2021-05-15T02:18:30.318844 | 2018-07-24T15:29:20 | 2018-07-24T15:29:20 | 24,521,175 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 465 | cpp | test.cpp | //http://www.cplusplus.com/reference/deque/deque/
#include <iostream>
#include <deque>
using namespace std;
int main()
{
deque<int> mydeque;
mydeque.push_front(20);
mydeque.push_front(50);
mydeque.push_back(66);
mydeque.push_front(212);
mydeque.push_back(31);
mydeque.push_back(88... |
1f82d2b65f554826dbea3a44ee29b3dc0024e56c | 279d3947563bcba72f4effe293a0b0e62dfc1051 | /More_with_servos_tutorial_33.cpp | d20b81f966e05de0914288ec8610666b1dc216de | [] | no_license | SRCinVA/Arduino | ee0ed5470cb556372f8e7ba6afe03a416f9cd894 | ba0650e2edb2133f5457f283ccada3e158fe29b8 | refs/heads/main | 2023-08-20T14:24:31.954548 | 2021-09-27T00:55:54 | 2021-09-27T00:55:54 | 318,236,680 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,138 | cpp | More_with_servos_tutorial_33.cpp | // joysticks are far more precise controls than knobs.
#include <Servo.h> //need to import the library
Servo Xservo;
Servo Yservo;
int Xpin=A0;
int Ypin=A1;
int Spin=2; // it can also operated as an on/off switch.
int XSpin=9;
int YSpin=10;
int buzzPin=7;
int WVx;
int WVy;
int Xval; // to read off of
int Yval; // to r... |
c15edaa247712209259ca2ab4b3c46037e198e5c | b6c516bd9f3768941a657fdeeb0be098e51358d0 | /lab_3_ManipulatingMIDI/cs302-midi.cpp | 990c07ddad262c6e80138ba4170d8c07f6002719 | [] | no_license | bschwarz67/CS-302 | f8156f28c8862490fbdf9909726020519a1f7791 | 625bb07359b60a6f0a8e73030f0b8cd2bcad2bf5 | refs/heads/master | 2023-02-26T20:48:13.883846 | 2021-02-07T19:17:39 | 2021-02-07T19:17:39 | 283,343,764 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,950 | cpp | cs302-midi.cpp | #include <iostream>
#include <map>
#include <vector>
#include <fstream>
#include <list>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include "cs302-midi.h"
using namespace std;
//copy data from the event file data structure(EventList) to the Note file data structure (NDMap)
void CS302_Midi::el_to_nd()
{
ve... |
d82f9df0a85fab54da27da5ccb87c29618c6f042 | afd4616c3adac5d8c6e80f9e9d34bc11dfe48826 | /ConsoleMemory/MemBlock.cpp | d472331517bc450f2d8bae1bc275b83f8e3708ca | [] | no_license | sfinktah/ConsoleMemory | c352109190cd11f3ce5466bbc5b42a9c85253917 | 8357d1326d1df96afc62ebd5a382d10aa1c8d19d | refs/heads/master | 2021-01-13T03:32:29.713772 | 2016-12-28T12:04:11 | 2016-12-28T12:04:11 | 77,529,846 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 695 | cpp | MemBlock.cpp | #include "stdafx.h"
#include "MemBlock.h"
MemBlock::MemBlock(RMem rPtr, uintptr_t remoteAddress, size_t maxSize) : rPtr(rPtr), remoteAddress(remoteAddress), maxSize(maxSize)
{
}
MemBlock::~MemBlock()
{
}
RMem MemBlock::GetRPtr()
{
return rPtr;
}
size_t MemBlock::GetSize()
{
return dumpArray.size();
}
si... |
27d49ce8d73edeab6734caae5aae7d3b710422dd | f87c7fe84bb079238e224bbe359904ba64e4e7b4 | /Dynamic_Programming/max_path_sum.cpp | 2fbfab87668a0185c7a21987b1fd19a99378554f | [] | no_license | Himanish-9502/Competative_Coding | 6e81a3f3c5747e4b28953af0eb3dd0842b6a7b91 | 70ab7a8ca5ee2ee51f31d3e372e832a7c13960a8 | refs/heads/master | 2023-07-15T12:42:53.305450 | 2021-09-02T11:22:24 | 2021-09-02T11:22:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,861 | cpp | max_path_sum.cpp | /*
Maximum path sum in grid
Time-Limit: 1 sec Score: 100
Difficulty :
Memory: 256 MB Accepted Submissions: 100
Relevant For:
Description
Given a grid of size n*m with non-negative integers, you need to find the maximum path sum from (1, 1) to (n, m). You are allowed to move from (x, y) to (x+1, y) and (x, y) to (x,... |
f2d587ab83a87f9ac842849b63b22574ec01626f | 21efe41be7ed2079432f4a7a4bd9d4c60be64604 | /test/libpldmresponder_platform_test.cpp | 5ea71abb78f9f1f08c27192c2ca9d0eb3da171c7 | [
"Apache-2.0"
] | permissive | manikandan-e/pldm | e4c6132e65157f273a75f16a3761f4fb64e86318 | 3bdb3c2acde56079c3f8bfd5c1e7922b20c51414 | refs/heads/master | 2022-07-27T14:25:05.199688 | 2020-05-01T19:55:39 | 2020-05-13T08:28:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,148 | cpp | libpldmresponder_platform_test.cpp | #include "libpldmresponder/pdr.hpp"
#include "libpldmresponder/pdr_utils.hpp"
#include "libpldmresponder/platform.hpp"
#include "libpldmresponder/platform_numeric_effecter.hpp"
#include "libpldmresponder/platform_state_effecter.hpp"
#include "mocked_utils.hpp"
#include "utils.hpp"
#include <iostream>
using namespace ... |
cb44fa3104da3ffbea7ecc62237bcca8c27c5fc8 | 47cec727aa95560ac54184fccab50d1a6c727083 | /ReEngine/src/Runtime/RenderDevice/OpenGL/ThirdPart/OpenGLContext.h | bef9df2c70f2e920770f7dcd3cad6007e130d265 | [] | no_license | kingdomheartstao/Renderer-Learning | 303cd8f054178dfdc629d81f3569c7fcb2b1eb1d | b35f963414a4dabf6d2fd9ab7dee278ecf38284a | refs/heads/master | 2023-07-28T01:07:32.919132 | 2021-09-10T09:24:46 | 2021-09-10T09:24:46 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 156 | h | OpenGLContext.h | #pragma once
#include <string>
#include "Singleton.h"
#include "ReOpenGL_API.h"
class ReOpenGL_API OpenGLContext
{
public:
static const char* Version;
}; |
2f1c7d7fa272afaa6841460a3fd7718a593bc2b2 | 8693fef04e4ac2d9a893110f3c426b5001cc48e5 | /src/campaign/tunnels.cc | f79da81f2841375d39b100ac23784e1fb44cc228 | [] | no_license | quarian/revenge-moon-storm | 9290b22fa92aafdcf76a34d191228f00ed49fa14 | 31a48f0f9fcbd2aa785409285a36b76ee180ca50 | refs/heads/master | 2016-09-06T11:44:17.378229 | 2014-02-27T13:08:29 | 2014-02-27T13:08:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,306 | cc | tunnels.cc | #include "CampaignGame.hh"
#include "CampaignGameWorld.hh"
#include "StoryScreen.hh"
#include "Fixtures.hh"
#include <string>
#include <vector>
void CampaignGame::showStoryTunnels() {
std::vector<std::string> msg = {
"Despair sets in as you descend the mine shaft. Up until now you've been",
"able ... |
ec71c6c9d72bb671d9cdabbf193334c6bb08664e | 0d77bec309e4f36428d573045d4bec9df5b7f092 | /REO-1 Semana/q13.cpp | 1be98636f17b192e903d18329efce68887c3d92b | [] | no_license | JoseVictorAmorim/IAlg2020-1 | 18c3e13e9bbfb8260a354799dc1d7bdc7cea87ef | a7efce1199ae4f1349679cc7904c6d974922406b | refs/heads/main | 2023-03-08T12:31:56.922424 | 2021-02-19T11:33:05 | 2021-02-19T11:33:05 | 315,319,681 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 452 | cpp | q13.cpp | #include <iostream>
using namespace std;
int antecessor(int num1){
num1--;
return num1;
}
int sucessor(int num2){
num2++;
return num2;
}
int soma(int a, int b){
if(a==0)
return b;
else if(b == 0)
return a;
else{
return(soma(antecessor(a), sucessor(b)));
}
}
int main(){
int x, y;
cin >> x >> y;
int m... |
4605d32837f75b5fbf95c674643171999a904727 | 08419b67ac9ff6ba132eb283c19d5f0c8d85a242 | /Shared/AddLocalDataController.cpp | b1c50b1b27158e9900e3e5e723ac9460a6b57327 | [
"Apache-2.0"
] | permissive | Esri/dynamic-situational-awareness-qt | 6bcdcf9a91a64e16d400fe150cbc66ce13cc4d28 | 703511764217a9144fd581326cfad99f8d70d82f | refs/heads/main | 2023-04-30T04:17:13.770667 | 2022-12-19T14:51:00 | 2022-12-19T14:51:00 | 100,742,320 | 46 | 20 | Apache-2.0 | 2022-12-21T22:10:56 | 2017-08-18T19:04:25 | C++ | UTF-8 | C++ | false | false | 31,689 | cpp | AddLocalDataController.cpp |
/*******************************************************************************
* Copyright 2012-2018 Esri
*
* 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.... |
eb7adf8da0c5e6deb47a43067ff1171c7ab41d14 | f12c1ea10008863a801773857c1425e4dbb4f685 | /public/include/macrosdef.h | 8813787b4edbd6befe7a405b085d71305bbc8dae | [] | no_license | alterhz/WalkingGridGame | c09caa4b50fc8401155192da4bbbee36dfd82a60 | fb56f65184ee174119aeeb433aadaa0edb3cc1f5 | refs/heads/master | 2021-05-30T04:27:05.900721 | 2015-10-30T12:44:22 | 2015-10-30T12:44:22 | 38,820,181 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,663 | h | macrosdef.h | //-------------------------------------------
// author : alterhz
// date : 9/9/2015
// description :
#ifndef _MACROSDEF_H_
#define _MACROSDEF_H_
#include <map>
#include <vector>
#include <list>
#include "mymath.h"
#define SAFE_DELETE(p) { delete p; p = nullptr; }
typedef std::vector<int> VtInt;
ty... |
7b59619beb08df6c84296d46089e64c4ba426036 | 570a9425f2f32df2c75b0241f86d761b48a06a9e | /547test.cpp | 1a92997a4952d323e4c6878adda0982fcca130df | [] | no_license | Brilliantrocks/leetcodelib | 18169b3f8c9f1302af72d0dbdc52d542a64494ce | e048b7189056fa5d57c78e9a06095dde1a76e96d | refs/heads/main | 2023-05-24T00:13:29.837423 | 2021-06-03T16:54:50 | 2021-06-03T16:54:50 | 366,859,144 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,016 | cpp | 547test.cpp | #include<vector>
#include<iostream>
using namespace std;
class Solution {
public:
int findCircleNum(vector<vector<int>>& isConnected) {
int n = isConnected.size(),cnt = 0;
vector<int> head(n);
for (int i = 0; i < n; ++i){
head[i] = i;
}
for (int i = 0; i < n; ++i... |
a8362e1de91ae0de5f9d861e7b506454c4720db6 | 839ed24e7ecf66b6983f4f2629ef87b90c02d41e | /B/C++/b010.cpp | f45be0482574c5c72251115fb41b824f813d5a62 | [] | no_license | ht0919/ProgrammingExercises | 86634153be11d08ba45c8d06bf2574b48974a2a6 | 5a9dc356603e3a54d7fdd9d8780c8851f7f37928 | refs/heads/master | 2020-04-04T07:32:09.083569 | 2018-10-17T04:28:37 | 2018-10-17T04:28:37 | 25,193,626 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,048 | cpp | b010.cpp | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int XA[11];
int XB[11];
char T[4];
int U,pass,flg,num,a,b;
int i;
cin >> T;
cin >> U;
for (i=0; i<11; i++) { cin >> XA[i]; }
for (i=0; i<11; i++) { cin >> XB[i]; }
if (strcmp(T,"A") =... |
51c7769302983698f5d7d3f00d9fd2200fb82e39 | 0dfad761d04379de7386a09281357a60f89ee46c | /sort.cpp | d9eca53e9d7e9155c3c0b96d1de77c115b925e01 | [] | no_license | xzatkalik/line-sort | 1bf20ee5a5d0f11ce37fd15d7c74a6aa8654b6f2 | 056fbe90dac553fa3f1a5a15c697f9a3f5b4560b | refs/heads/master | 2020-03-28T22:45:10.240004 | 2018-09-18T04:16:10 | 2018-09-18T04:16:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 550 | cpp | sort.cpp | #include "sort.h"
#include <string>
#include <iterator>
#include <vector>
#include <algorithm>
#include <cctype>
#include <sstream>
namespace
{
struct Line : public std::string {};
std::istream & operator >> (std::istream & is, Line & line)
{
return std::getline(is, line);
}
}
bool sort::process(Order order,... |
b80f51eda445d1883813b2ea61851f63c620e707 | 922a9d59ca84346dc93aa787b26e291ce3fc1649 | /src/enemyChar.hpp | a6e3e2af89076a24dd1d2288842938823bcd771e | [] | no_license | Khchobo/TowerDefense-2 | 3e665502689a7426556eaf78f8cf3a70e03bdf4a | a4dbb7e5d4e7b3ccd18b93c6cc4ac9c9dd19b530 | refs/heads/master | 2022-04-13T09:09:05.031251 | 2020-01-31T10:36:29 | 2020-01-31T10:36:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,836 | hpp | enemyChar.hpp | #ifndef ENEMYCHAR__HPP
#define ENEMYCHAR__HPP
// Include std::libs
#include <math.h>
#include <iostream>
#include <stdlib.h> /* srand, rand */
#include <vector>
#include <memory>
// Include external libs
#ifdef INCLUDE
#include <jsoncpp/json/json.h>
#else
#include <json/json.h>
#endif // INCLUDE
#include <SFML/... |
734d99ad0ec12b12b79dd979edbd9a44c09e75c9 | 37daba6ba2620d5bbb734abf67a0e517e67a4397 | /src/Cqual/CQualNStore.cpp | ead8f9716dca09a51dd59f1bdf50af670d160857 | [] | no_license | BioinformaticsArchive/libCSAM | 4b8be64eb09d55705aebf98d5bc898cb8efaa36f | 7ec68901af614a7fd1faadd38df56aec270b284f | refs/heads/master | 2020-02-26T13:40:57.780866 | 2014-03-14T05:18:09 | 2014-03-14T05:18:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,392 | cpp | CQualNStore.cpp | /********************************************************************************
Copyright (c) 2013, Rodrigo Canovas
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 ... |
20b3ed40f43db060e50c85dc3911a66a39f389b9 | 8264dae28229bc6b8d09c72f34c0bd2a27a71019 | /src/pop_menu.cpp | 4bbc1204fad346dd3ece2c567939559b13642caa | [] | no_license | Bayonetta5/hge-gui | a502d9c725ea3460aa5d3b4820f2bcb68b22eb37 | 7859b47c6c204534276533f05b987111fadbb451 | refs/heads/master | 2023-03-19T13:28:19.128148 | 2013-10-16T18:39:32 | 2013-10-16T18:39:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,737 | cpp | pop_menu.cpp | #include "list_box.h"
#include "pop_menu.h"
namespace Gui
{
PopMenu::PopMenu(float x, float y, float width, float height, Widget *parent)
: Widget(x, y, width, height, parent)
{
float delta = 20;
//m_line_edit = new TextLine(0, 0, width - 10, GetManager())
GetStyle().back_color_... |
68d17c7cb3a77eccef3ee75c6268a2b95effc26c | 837a73e0e50ac7d5aec3eb5bfff6f6bde5a9d506 | /binary-search-no-recursion.cc | 00392d244ff41acf5f2b96d3b2e2d3baf362bdcd | [] | no_license | narubond007/datastructure | 4d73a8b421c4c61021cc070b3f629adc920f3807 | 79377c9df37c56e4de4cf4e8e4dd34836dfe727b | refs/heads/master | 2016-09-05T20:09:01.755867 | 2015-11-17T22:47:19 | 2015-11-17T22:47:19 | 28,770,083 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 613 | cc | binary-search-no-recursion.cc | #include <iostream>
using namespace std;
//for binary search, array has to be in ascending order
int a[] = {4,7,9,13,25,31,67,73,401,513};
int main(){
int NUM=0;
int start=0;
int end = 9;
int mid = (start + end)/2;
//remember the termination case. This works for all the numbers
// no infinite loops, we have test... |
36180530547eb450b1e8d7662ac952ae9da5a1fa | bc2360489e6dbab068b36d96e10a3ad03bbbeb24 | /customer.cpp | e48cf1f921a46be85b51304ac9ff5d6638aa5652 | [] | no_license | Kyloman/movie-theatre | 8f22c6ef5453cd2b7769c27b2392f9824fcaa38d | 64e3ddd0d460c2d665ed9ddc6b009b56a3978df3 | refs/heads/master | 2020-04-25T01:26:42.494799 | 2019-03-21T06:56:52 | 2019-03-21T06:56:52 | 172,408,438 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,061 | cpp | customer.cpp | // ---------------------------------- customer.h-------------------------------------------
// Programmer Name Course Section Number
// 3/12/2019
// Date of Last Modification 3/20/19
// --------------------------------------------------------------------------------------------------------------------
// Purpose - this... |
5b187390a2bfd4b7b8b438023ebd3135efacfe25 | 1b07ecb8aa5a209ee4a2c746d4a219431d09b9a0 | /Point.h | 17b604f6ad6ee775f7fcf03d7d3db3ee626a12ec | [] | no_license | Apig-Sharbo/Geometry-Shape-Point-Circle-Cylinder | a1cfd0fd02a989412421b369f796c5a980b9e98e | 5deb94f0f0bc7c7795c634aa20b8adfbfd241fb4 | refs/heads/master | 2020-09-11T16:42:34.559293 | 2019-11-16T16:41:19 | 2019-11-16T16:41:19 | 222,129,076 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 229 | h | Point.h | #pragma once
#include "Shape.h"
class Point :
public Shape
{
public:
Point(int , int ,const char* );
virtual void print();
virtual double Area();
virtual double Volume();
~Point();
protected:
int x, y;
};
|
5303c0cb1cde59db763ce56acec74dd42c61f3a6 | abc7c8f0f9dd247642ac74b0a46f00523693ab2e | /Pow.cpp | 53c7d064f84186a5a1ebbf75eefb5c08c38748e0 | [] | no_license | suyangzhu/leetcode | e2bd38c03e7fca85d6767ae52db17d7b83365c85 | 4c0d5c100adcce85a14929fbef81922a4a4e2282 | refs/heads/master | 2020-05-17T15:21:46.382598 | 2014-11-26T20:01:44 | 2014-11-26T20:01:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 272 | cpp | Pow.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
double Pow(double x, int n) {
double result = 1.0;
int i;
for(i = 0; i < n; i++)
result *= x;
return result;
}
int main() {
std::cout << Pow(1.1, 2) << std::endl;
return 0;
}
|
9f5d3076772579ff38d46757fd3189fbfbd283b7 | 0d25c05396ea7a23088366f65e3012f297e98bb7 | /HM_StructureTest3/minioncard.cpp | 6a9c45288d1609ed092363fc88b001ac6c3ff25c | [] | no_license | CoderDuan/HearthMason | 2d85f074a51e20969b08b4bef7fc2e0d5789b394 | dec33b2dd43a0373bed33b603421e62999c06341 | refs/heads/master | 2021-01-10T18:21:18.745527 | 2016-02-06T15:34:52 | 2016-02-06T15:34:52 | 50,272,296 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 327 | cpp | minioncard.cpp | #include "minioncard.h"
MinionCard::MinionCard()
{
setMinion(NULL);
}
Minion* MinionCard::minion()
{
return m_minion;
}
void MinionCard::setMinion(Minion *minion)
{
if(m_minion != minion){
m_minion = minion;
if(m_minion)
m_minion->setCard(this);
emit minionChanged();
... |
7936e1aab6c4d83ab8a5296938f6a2ac3cec5be4 | bacaab3607353ecaa3ba94441039825e5d8553bb | /cf/555d.cpp | a7201feefe9abb22f665714e0c5c63cb13340c3f | [] | no_license | allenwhale/code | fc0c0e0dbb5d799484c43c26c3bd286f49342bb3 | 31d72b801791589602159ea5b5137e7f0bb42d05 | refs/heads/master | 2021-01-17T00:53:05.481576 | 2019-09-18T14:46:00 | 2019-09-18T14:46:00 | 27,023,130 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 846 | cpp | 555d.cpp | #include <bits/stdc++.h>
using namespace std;
int ss[200010], p[200010];
map<int,int>mp;
int main(){
int N, Q;
scanf("%d%d",&N,&Q);
for(int i=0;i<N;i++)
scanf("%d",&ss[i]), p[i]=ss[i],mp[ss[i]]=i;
sort(p,p+N);
while(Q--){
int a, l, flag=1;
scanf("%d%d",&a,&l);
int s=l... |
458199b9eb76b0f4160eefb5642518a17bf19d2b | a7e234deb466a3cb1034525d88a79e8e1bbf21ed | /semester2/lab 6/perfect/main.cpp | b2e7f11c32c47c07ef4e564722f11e7ae0937314 | [] | no_license | Anninster/Coding-Projects | 39e49a4120d6839b24bdcf2f8d55923c155cdce7 | 16de7f760cdca63422bf08be2441ba12642e6857 | refs/heads/master | 2020-04-11T21:34:20.303895 | 2018-12-17T12:55:46 | 2018-12-17T12:55:46 | 162,110,136 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 869 | cpp | main.cpp | #include <iostream>
using namespace std;
bool myperfect(int a);
void myfactors(int a);
int main()
{
int nama=1;
for (int i=6;nama<5;i++)
{
if (myperfect(i))
{
cout << i << " is a perfect number\n" ;
myfactors(i);
nama++;
cout <<... |
29fd6e5bbcb52282a016b5fee05df4c74e31b195 | 609c7a153e9abe1d0b4d71846de0b0a9926a9d15 | /Velvet/vmt.h | a5ab02165dae20b9f49162d4f9ae79e116194b27 | [
"Apache-2.0"
] | permissive | AlvyPiper/Velvet | 2ce478a14932e8f9b61eba17235a75a428d1cc3f | 743e8177536ef17c4c8364ecf7c37e4472cec03d | refs/heads/master | 2021-05-24T04:08:49.647475 | 2020-11-04T08:18:36 | 2020-11-04T08:18:36 | 45,608,314 | 29 | 13 | null | 2016-11-07T22:55:26 | 2015-11-05T11:55:31 | C++ | UTF-8 | C++ | false | false | 14,459 | h | vmt.h | #pragma once
//----------------------------------------------------------------
// Toolkit: Virtual method table hooks
//----------------------------------------------------------------
// These can be hooked in two distinct manners.
//
// The VMTManager class hooks by replacing the vmt pointer with a custom crafted o... |
54ca5cfa518e5cbe9bff66d61f0891a01086619d | 75d24ce86e1fb833974615a8c21521c918f575b4 | /Oschlex.h | eab87c3146589bfc66bc7f15dc6aecbd207b3a49 | [] | no_license | ndilday/virtualu | 059100ec82b46c1def39643fdf7123d05db3796d | 96012dccd26e32460403b3438ca0ce0ef7fe469b | refs/heads/master | 2021-01-10T07:06:13.960690 | 2014-05-22T04:16:38 | 2014-05-22T04:16:38 | 47,211,286 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,022 | h | Oschlex.h | //Filename : OSCHLEX.H
//Description: Class SchoolEx Declaration
//Owner : Fred
#ifndef __OSCHLEX_H
#define __OSCHLEX_H
#ifndef __OSCHOOL_H
#include <OSCHOOL.H>
#endif
#include <OSTUDENT.H> // MAX_STUDENT_LEVEL
#include <OFIELD.H> // IPED_FIELD_COUNT
... |
b1c479e1150fe24a13389d54506865f18cde1ea5 | 1048998f99a92115f4bb78d7b34b8c03a37bd6c8 | /DNCB440.d/backup/local/include/octave-2.1.36/octave/symtab.h | 789cfb8d23319f54506332eaf1be9c5e279a1332 | [] | no_license | tetazoo/sodalord | c70dcecf6284fbbc25b7d2a2fcd3743869e38509 | ce705f48a9eb7694476dc9b5b267936855bc00be | refs/heads/master | 2020-12-14T16:55:53.178363 | 2020-01-18T23:56:39 | 2020-01-18T23:56:39 | 234,811,643 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,345 | h | symtab.h | /*
Copyright (C) 1996, 1997 John W. Eaton
This file is part of Octave.
Octave 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, or (at your option) any
later version.
Octave is distributed in t... |
4055b12754242801b56d9a58d1d384a211c8c261 | 07b0b72f5af0972dba1ed53560dcb4de7049bc3e | /src/includes/DOEngine.h | e3342ad556adcd7c6cb4513ccad8c2c5acdcace6 | [] | no_license | aneury1/DOEngine | 8b90e14de41a1f9dc2c899c63b00acaf834772e2 | 6b384119b6fc10f45be856414250d2e0ea237967 | refs/heads/master | 2023-08-17T06:49:41.598503 | 2023-08-03T11:56:57 | 2023-08-03T11:56:57 | 170,516,909 | 0 | 1 | null | 2023-08-03T11:54:10 | 2019-02-13T13:57:45 | Makefile | UTF-8 | C++ | false | false | 644 | h | DOEngine.h | #ifndef DOENGINE_HPP_DEFINED
#define DOENGINE_HPP_DEFINED
#include<SDL2/SDL_image.h>
#include<SDL2/SDL_ttf.h>
#include<SDL2/SDL.h>
#include <vector>
#include <string>
#include <map>
#include <iostream>
#include <sstream>
#include <string>
#include "defines.h"
#include "Window.h"
#include "sort.h"
#include "LinkLis... |
257ee6edd158d476754ab5ff3013eb1ea128bef3 | 57f336a72304666d0d8d21ebd25246fcae263401 | /Project_for_study/Binary_Search/main.cpp | ab813423ddf5adcbaa28e0c63daa8e6889b7f22e | [] | no_license | kalinichika/C-Cpp | 52a641432a8d985e7a6853b4a4084ad00637559f | de0895436592edf1e7d9389b1385eeef82809446 | refs/heads/master | 2020-04-29T12:25:53.262278 | 2019-07-10T09:09:40 | 2019-07-10T09:09:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,504 | cpp | main.cpp | #include <iostream>
#include <vector>
using std::vector;
using std::cout;
using std::endl;
// ПОИСК МЕСТА "РАЗРЫВА"
template <typename T>
int search_break(vector<T>& v){
if(v[0] < v[v.size()-1]) return v.size()-1;
int a = 0;
int b = v.size()-1;
int count = b/2;
int middle = count;
while ((a... |
2ce3e7c1e91ef6238fca9e0ebd809a5cbf85cb42 | 79547aa20cb6da706d63300ff21aba6af1fc212b | /UnitTest/Set1Test.cpp | d7f8a5d77a63e789bc96c087f5cd0e525c1e931a | [] | no_license | wilzegers/CounterMachine | eeade069038d5c439d2099f472fc555e280d90ad | ad2546bca148453f8d4917fce1573ecc2b58d6fb | refs/heads/master | 2021-05-10T10:14:08.902891 | 2018-05-14T13:50:37 | 2018-05-14T13:50:37 | 118,374,159 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 85 | cpp | Set1Test.cpp | #include "TransformationTestUtils.h"
namespace UnitTest
{
CREATE_SET_TEST(1);
}
|
56b5d524edae5f7d2d55a2b429fc60f4e586309d | d1697d7be7e0be965f3a2334eb6b54feb1c4c30e | /hw_09/guess.cpp | af40b90d2c79204f590b7c7dba2bffdc57ff8766 | [] | no_license | Jhe0031/csci127-assignments | fa02e06421ab9175ffaa7c9024409f79ec956020 | 8e5b670aa2467429f77f55551ec1c20f846d78b0 | refs/heads/master | 2020-03-28T03:45:32.408565 | 2018-12-20T15:07:57 | 2018-12-20T15:07:57 | 147,669,138 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,273 | cpp | guess.cpp | #include <iostream>
#include <stdlib.h>
#include <cstdlib>
int main()
{
int i;
int g;
int rand();
int num;
srand (time(NULL));
g = rand()%100;
std::cout << "Please enter an integer from 0 to 99, inclusive: ";
std::cin >> i;
std::cout << "Is this your number: " << g << "?\n";
std::cout << "Please enter '-1' i... |
7f3b7604f4b15e7483f83d604b3198c5c8bfc3c6 | 5e6b8e78e689e0cdfb529ff4fac9d057ea3c3bb3 | /Codeforces/QuanHeHoHang.cpp | f08ef38e0c314e129a9871807d3c43c36a23963a | [] | no_license | tielse/Example_C | bb214c61423ce9424950a736bb5ec15346531c8c | 21f728c0a58c5d9523779227edd5cca799625fd1 | refs/heads/master | 2021-01-02T22:36:47.555419 | 2017-08-04T16:08:24 | 2017-08-04T16:08:24 | 99,354,138 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 564 | cpp | QuanHeHoHang.cpp | #include<iostream>
#include<ctime>
#include<cstring>
using namespace std;
int64_t ans=0,b[1024]={0};
string s;
int main()
{
clock_t aa=clock();
int n,x,l;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>s;
l=s.size();
x=0;
for(int j=0;j<l;j++)
x|=(1<<(s[j]-48));
++b[x];
}
for(int i=0;i<1024... |
98b59001b4015c4c48fafad6460b19e98735e2a2 | 8de0753ea95eac28c7078f6c2782fb8cb9d89e21 | /src/utils/JsonData.cpp | adabc2d2a0aeeadf493e204eafb6574c9290bc3c | [
"MIT"
] | permissive | shady2017/game | 3de1ef7ea5039540f678526075f6cbc151b3fcd5 | b3040841904d716dcce76e47ef704e7a7af00eca | refs/heads/master | 2021-05-11T10:56:10.431732 | 2017-12-20T22:07:49 | 2017-12-20T22:07:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,128 | cpp | JsonData.cpp | #include "JsonData.h"
void JsonData::prettify() {
std::vector<char> formatted;
int tabs = 0;
bool in_string = false;
bool newline_after_char = false;
bool add_space_after_char = false;
auto newline = [&]() {
... |
72f2800877c518d919d0f39a83506680de6cbe29 | 1237e2b307b8f8d22ffde9124aa036c4cd1c104f | /Database.h | ff990f698a30c904dbf3c59c57d5475c8f401466 | [] | no_license | TELEUZI/handling_workers_info | 343c2837266c01da1f106243f9ce4d294beb21d5 | e6b7b6275803fd93b30fa6d696d34bc1ade8bc59 | refs/heads/master | 2023-02-19T05:19:37.434444 | 2021-01-17T17:51:12 | 2021-01-17T17:51:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 504 | h | Database.h | #pragma once
#include "worker.h"
class Database
{
private:
Database() {}
Database(const Database&);
Database& operator=(Database&);
public:
static Database& getInstance() {
static Database instance;
return instance;
}
void read_from_database(vector<worker>& workers_from_database, int num);
... |
2c1e961d81a414546401edfd4447f1a8f9dccc17 | 282ec49f8ce8aa176c24e4f13a8852c9b0752e4a | /jumble/box_and_hits/src/ih/key_binding.cc | 33e5a683928c5e5710a86da8c535ed51fe5dc8c8 | [] | no_license | montreal91/workshop | b118b9358094f91defdae1d11ff8a1553d67cee6 | 8c05e15417e99d7236744fe9f960f4d6b09e4e31 | refs/heads/master | 2023-05-22T00:26:09.170584 | 2023-01-28T12:41:08 | 2023-01-28T12:41:08 | 40,283,198 | 3 | 1 | null | 2023-05-01T20:19:11 | 2015-08-06T03:53:44 | C++ | UTF-8 | C++ | false | false | 2,013 | cc | key_binding.cc |
#include "key_binding.h"
namespace ih {
EKeyBinding::EKeyBinding() {
// TODO: make this staff load from configs
this->m_key_map[sf::Keyboard::Up] = player_action::MoveForward;
this->m_key_map[sf::Keyboard::Down] = player_action::MoveBackward;
this->m_key_map[sf::Keyboard::Left] = player_... |
9ee714ddede976864e1730c7a5c409de8bef09f3 | 08574c741e81ccb7e89f3060a9be4649fb3b6e2c | /Kursach/fourofakind.h | 4cc2556313aeedf16c8d6d3f30b4563dd4730fdf | [] | no_license | Margotaro/PokerKursach | 54bd5ec92b7e0bb46c266a0e9177c6bc9acd10eb | f91eecf66aed6a8b6920a9924f92626e358165f8 | refs/heads/master | 2020-05-21T21:43:23.084690 | 2017-06-18T20:10:07 | 2017-06-18T20:10:07 | 84,651,242 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 363 | h | fourofakind.h | #ifndef FOUROFAKIND_H
#define FOUROFAKIND_H
#include "card.h"
#include "combination.h"
class FourOfaKind : public Combination
{
public:
FourOfaKind::FourOfaKind() : Combination() { value = 17; }
FourOfaKind(Rank t4KindCard);
Rank getRankOfCard();
virtual int compareTo(Combination *c);
private:
Rank... |
fdd4d291b06406b2a87e53e4f11b5f982392149b | f23c3e9e4088e568b260f934422187f8427a2678 | /runners/characters/charrunner.h | 3d757d334048d5efad7adfb3ced8a220fe493d33 | [] | no_license | KDE/kdeplasma-addons | 330e2e01676b3dc07d434899643cef00a1f1a7ef | 4c877cf788356202b2aee3cfdf4ca0597ffa34a9 | refs/heads/master | 2023-09-01T15:51:35.997634 | 2023-08-30T02:14:10 | 2023-08-30T02:14:10 | 42,733,222 | 90 | 33 | null | 2023-01-24T22:28:20 | 2015-09-18T16:18:29 | C++ | UTF-8 | C++ | false | false | 819 | h | charrunner.h | /* SPDX-FileCopyrightText: 2010 Anton Kreuzkamp <akreuzkamp@web.de>
* SPDX-FileCopyrightText: 2020 Alexander Lohnau <alexander.lohnau@gmx.de>
*
* SPDX-License-Identifier: LGPL-2.1-only OR LGPL-3.0-only OR LicenseRef-KDE-Accepted-LGPL
*/
#ifndef CHARRUNNER_H
#define CHARRUNNER_H
#include <KRunner/AbstractRunner>
... |
1e03d7de5681d1facb1a86c1f515b785c6a9b51d | 76261aae39cfc15a2b3444665ebcb23a657db361 | /Main/Source/Ripley/ModerateMediaAssetsBuilder.cpp | ab912904c595be54c6b1005ccd3907a0276e9cea | [] | no_license | rocketeerbkw/DNA | d208c72690ccfae261beb531fb52d1c2647783e3 | de5993d6d0f8dd735085ebca4c86f4363c498615 | refs/heads/master | 2021-01-21T13:29:52.930616 | 2015-10-01T17:05:40 | 2015-10-01T17:05:40 | 43,528,993 | 1 | 0 | null | 2015-10-02T00:43:08 | 2015-10-02T00:43:08 | null | UTF-8 | C++ | false | false | 27,348 | cpp | ModerateMediaAssetsBuilder.cpp | #include "stdafx.h"
#include ".\moderatemediaassetsbuilder.h"
#include "stdafx.h"
#include "SiteData.h"
#include "WholePage.h"
#include "PageUI.h"
#include "TDVAssert.h"
#include "./emailtemplate.h"
#include "ModerationClasses.h"
#include "ModReasons.h"
#include "RefereeList.h"
#include "MediaAsset.h"
#in... |
5a9425f8468164e2fb3c953bef1b6858ecc0d52a | 45716a35c9fa862145b20e68b47a3187bbfbfb81 | /src/pks/test_pks/divgrad_test/divgrad_test_reg.hh | 720ff92e3fb23bee16bc80f36d399104b7d44ac9 | [
"BSD-3-Clause"
] | permissive | ddwivedi08/ats | 3c5f3e69797ddcd07110a4c80c47581034c28a2f | 932aba910b977e86121942cd24f2059f0b6bee65 | refs/heads/master | 2021-01-19T14:53:40.104447 | 2017-04-06T01:16:22 | 2017-04-06T01:16:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 535 | hh | divgrad_test_reg.hh | /* -*- mode: c++; c-default-style: "google"; indent-tabs-mode: nil -*- */
/* -------------------------------------------------------------------------
A high level test class for the MatrixMFD operator.
License: BSD
Authors: Ethan Coon (ATS version) (ecoon@lanl.gov)
--------------------------------------------... |
260b0ff558c851f774e471285ac63071d4fb6392 | 9997cb296b19a9ae3149484caa2290c26c1f030a | /boj/02501/02501.cpp14.cpp | f0c662ed59a89a1358020aea3c9a6e7a945833fb | [] | no_license | pukuba/Algorithm | 0eca36297a5a278e666cb2d851bd0a4c99e11357 | ea71d0e21534a2a54626fc89da58e58ea8eb1791 | refs/heads/master | 2023-06-03T05:54:43.564074 | 2021-06-23T02:26:06 | 2021-06-23T02:26:06 | 317,562,256 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 257 | cpp | 02501.cpp14.cpp | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n,k,cnt=0;
scanf("%d %d",&n ,&k);
for(int i=1; i<=n; i++){
if(n%i==0){
cnt++;
if(cnt==k){
cout<<i<<'\n';
return 0;
}
}
}
cout<<"0"<<'\n';
} |
a7fd2c877f95f6aa75ee4c3b11026343d4f44528 | 6cdf2f5570c35f723695a6aa9d28248b5b1823ec | /src/aadcBase/src/arduino/AADC_ArduinoSensors/cArduinoSensors.h | 30f69ea5731cb4b68e2f01a5ca953cfe17658d77 | [
"BSD-2-Clause"
] | permissive | TeamAutonomousCarOffenburg/A2O_2015 | 24d92040c286c75345dd8353a50b3da19519ec55 | 19a2ac67d743ad23e5a259ca70aed6b3d1f2e3ac | refs/heads/master | 2021-05-30T06:46:30.745077 | 2016-02-01T17:18:31 | 2016-02-01T17:18:31 | 42,807,199 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,779 | h | cArduinoSensors.h | /**
Copyright (c)
Audi Autonomous Driving Cup. All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of conditions and th... |
fef743fe5dc1b4709b2ff2e32a08ca674215bf8d | 30799e01ce24e922ac7a810fefb37767e8bd3567 | /HashTable.hpp | 18d7e0636e3c204db1e4299351ebe6369e484b9b | [] | no_license | vladimirantigua/MallocReplacement | 02afc99aa3db8d93bb5b4136fe50104a770f1bf1 | ee05b0227063198897743c3e54554aca604b23d3 | refs/heads/main | 2023-03-29T00:49:23.511400 | 2021-03-28T06:18:19 | 2021-03-28T06:18:19 | 352,256,093 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,334 | hpp | HashTable.hpp | //
// HashTable.hpp
// WritingMallocReplacement
//
// Created by Vladimir Antigua on 3/17/21.
//
#ifndef HashTable_hpp
#define HashTable_hpp
#include <stdio.h>
class TableEntry {
public:
void* pointer;
size_t size;
int flag; // to indicate if the part of memory is free or not 0 means memory is availab... |
1de2256563dfa636839f72c7749a1e16e1d6e096 | d86dee3a88a619603bd3b7ea265373d1f6fb71cc | /JOI/JOI16_selling_rna.cpp | 6e287bf8fe89b261d54b165c40fea9967870fc8b | [] | no_license | vzsky/submissions | 17ca8b096450170cc077b70a9efb4c7d7e21479d | 78211da43e9b51b98bb7f42a294330507af92a65 | refs/heads/master | 2023-04-02T03:44:04.193078 | 2021-04-19T05:57:52 | 2021-04-19T05:57:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,227 | cpp | JOI16_selling_rna.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n,m,suf[N],ans[N];
pair<string,int> sx[N];
string s[N],t[N];
tuple<string,string,int> q[N];
tuple<int,int,int,int> qe[N];
int fw[N];
void update(int idx,int val){ if(!idx) return; while(idx<N) fw[idx]+=val,idx+=(idx & -idx); }
int read(int idx... |
2ba63737aa3333d8e5fc6eb056aab99cd631bb3a | 8b4c7652384e08b2ab0f41d4d0962c212a1e32aa | /static/areal/arithmetic/addition.cpp | 89d9442e9e8de408e5b11f77a3563ebdbaf6df51 | [
"MIT",
"LicenseRef-scancode-free-unknown",
"LGPL-3.0-only",
"LicenseRef-scancode-public-domain"
] | permissive | stillwater-sc/universal | cd9e63d8672663de6716733c3a59c64f7a745e13 | e0d76cdd1f901d3c779ef6c1e8adf8d323b4aa53 | refs/heads/main | 2023-08-21T14:53:02.747975 | 2023-08-08T16:14:14 | 2023-08-08T16:14:14 | 89,959,055 | 352 | 72 | MIT | 2023-09-07T21:23:58 | 2017-05-01T20:13:06 | C++ | UTF-8 | C++ | false | false | 3,373 | cpp | addition.cpp | // addition.cpp: test suite runner for addition on arbitrary reals
//
// Copyright (C) 2017-2022 Stillwater Supercomputing, Inc.
//
// This file is part of the universal numbers project, which is released under an MIT Open Source license.
#include <universal/utility/directives.hpp>
#include <universal/number/areal/area... |
1e1f823bf9863d6d111b357836647e6c2c3e8f23 | 2422071887f96c92ffb573b690cfa7f8ba60937c | /binding/libavutil_dict.inc | bc871ecefe99faa70fcf9f0b5160d24dbb8a71c3 | [] | no_license | GuvaCode/ffmpeg-fpc | c25349be11297ac69eb97794d4ba154a47f6a01f | c7a39368cfdb0316f7c43fc30bb2dfb24e2d698a | refs/heads/master | 2021-01-20T13:03:56.329479 | 2017-08-26T12:18:04 | 2017-08-26T12:18:04 | 101,732,006 | 1 | 1 | null | 2017-08-29T07:21:32 | 2017-08-29T07:21:32 | null | UTF-8 | C++ | false | false | 8,606 | inc | libavutil_dict.inc | //
// avutil.h header binding for the Free Pascal Compiler aka FPC
//
// Binaries and demos available at http://www.djmaster.com/
//
(*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as pu... |
9bffca7c108fe4a1c4a986064e0bb65f88bcbdcf | 522eb32044bd2dd01aea5e89e428da43ae901988 | /vs3.cpp | 350ac178c104c37547270c11d966d9186e3ac0d5 | [] | no_license | vikas0799/DSA-using-CPP | fb9328f248bff6b260fc22a11c7a6a2d1ee72cbe | a80585ca0725ff0e4325b1b3b90d8273521dd666 | refs/heads/master | 2023-07-10T09:18:19.928850 | 2021-08-18T23:14:22 | 2021-08-18T23:14:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 609 | cpp | vs3.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long int T;cin>>T;
while(T--)
{ long long int n,k;cin>>n>>k;
long long int a[n];
for(long long int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
long long int flag=0,sum=0;int t=0;
for(long long int i=n-1;i... |
c5b84186c53090f97c745a2b23460f0456e0c9cd | 575cc98c63c459db0806ea8a87f12a582c64c963 | /leap_2.cpp | 3a49ebca4ebfcee48c1d5e276d8ecd63dfee2cad | [] | no_license | techrushu/cpp | eace02b9ddbe67b35c10dc7a03ad4165693f5550 | 6cf351eb33e87bcdf7f7998c903c7c838a4d8e1e | refs/heads/master | 2020-04-28T00:19:14.852038 | 2019-03-10T12:10:48 | 2019-03-10T12:10:48 | 174,811,359 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 228 | cpp | leap_2.cpp | #include<iostream>
using namespace std;
void check(int year)
{
if((year%4==0) && (year%100!=0))
{
cout<<year<<" is Leap Year ";
}
else
{
cout<<year<<" not Leap Year ";
}
}
int main()
{
check(1987);
}
|
2de32999c9b33204533ed15ae6c5b42e9c740dc3 | 669c3f287f7cc6839b2c1c50de47e9187f8b4487 | /client/src/AIConsole.cpp | 33c9812ec2f085f2437fc1f78cca3d0a6b93e35b | [] | no_license | asheryi/Reversi | e5dbb38b09b76a32e79eafd7f26e3fdf6b5f8940 | 5dcb0e8eaa8cf04d9c7244d89ecd8b9aad2a8e7d | refs/heads/master | 2021-09-04T12:29:32.552474 | 2018-01-18T17:56:26 | 2018-01-18T17:56:26 | 111,551,427 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 336 | cpp | AIConsole.cpp |
#include "../include/AIConsole.h"
using namespace std;
void AIConsole::show(const Board &board, const std::vector<Path *> &moves, const Color &currPlayerColor, bool passTurn,
int blacks,
int whites) const {
}
void AIConsole::showError(Error errorType) const {
}
AIConsole:... |
9822ae2e12b94b92cfd36f9339b3ceb845d093ad | 851323a039cfe810cf0d30e8649447921db64115 | /SourceGame/BossClaw.cpp | 3d12855d1f154bcd5a256e30acd3d6c2998d5e5e | [] | no_license | minhnhut568/SourceGame | e6b84839b62866f773fe735869cffd68edf09ae3 | 366fe01130003f44d1fb2f36e6d9226d9dd6a0bf | refs/heads/master | 2023-02-23T14:08:19.785306 | 2021-01-23T01:35:51 | 2021-01-23T01:35:51 | 314,829,861 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 776 | cpp | BossClaw.cpp | #include "BossClaw.h"
#include"SpriteManager.h"
#include"Boss.h"
#include"PlayerOverWorld.h"
#include"Scorebar.h"
#include<string>
BossClaw::BossClaw()
{
setSprite(SpriteManager::getInstance()->getSprite(SPRITE_INFO_BOSS_BODY));
setAnimation(0);
relativeX = 0;
relativeY = 0;
inmortal = true;
setDx(0);
setDy(0);... |
9d049155dedea8ae634b9a00fef90cf6b85c4809 | 225792e3d31604ded3fc4d2686303bfb8acf4caa | /PixelsOSXBothTCP/src/ofApp.cpp | c179c13cf0ba65dee87f3f588f86a4784e0e0707 | [] | no_license | lvjh/iOSP2PVideoStreaming | 3801a0c6791dae5933c80b13a71e8dede3896e6c | 19ed6b19772c59a6c13dd9f17eceac2be13428a3 | refs/heads/master | 2021-01-20T21:53:39.219768 | 2014-03-06T06:18:29 | 2014-03-06T06:18:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,831 | cpp | ofApp.cpp | #include "ofApp.h"
//--------------------------------------------------------------
void ofApp::setup(){
//ofSetFrameRate(30);
ofSetVerticalSync(true);
ofEnableAlphaBlending();
ofBackground(0);
//ofSetLogLevel(OF_LOG_VERBOSE);
// setup a standard video grabber
int width ... |
2b3e00077e2e83e9d786be460fb5a068feb82369 | 66ceb72940737fdd9eabdbeb8f3bffc3538d4aab | /Diablo2/Act2.cpp | b1afbb99c3b74510a551eb50467811c3a617beba | [] | no_license | bmjoy/diablo2-dx | d5678511f42ebc6e76c9e660776fdfb61aff556d | 87ae6fea70e5b85fcdd53ad93c37f4557ac357c4 | refs/heads/master | 2022-11-21T14:30:02.334660 | 2020-07-24T07:55:58 | 2020-07-24T07:55:58 | 285,954,322 | 1 | 0 | null | 2020-08-08T01:56:43 | 2020-08-08T01:56:42 | null | UHC | C++ | false | false | 8,198 | cpp | Act2.cpp | #include "StdAfx.h"
#include "Act2.h"
#include "TextureMgr.h"
#include "Act2Proto.h"
#include "ObjMgr.h"
#include "StateMgr.h"
#include "KeyMgr.h"
CAct2::CAct2(void)
{
}
CAct2::~CAct2(void)
{
Release();
}
void CAct2::Initialize(void)
{
//Study #2
//시작할때마다 Instance를 날려버리기 때문에 기존에 저장된 m_MapObj이나 m_mapTex들은 죄다 날아간다
... |
aa1975180fb196408c4ba3977143a4bd7539bbd2 | 3c8cf4de6c08e21b2c10094ef20488e93d7a34be | /TktkGameProcessDxlibAppendLib/TktkAppendDxlib3DComponentLib/src/TktkAppendDxlib3DComponent/Graphics/ColliderWireFrameDrawer3D/ColliderWireFrameDrawer3DMaker.cpp | 5903b6641e0268412e7615a8133a2dfa75027142 | [] | no_license | tktk2104/TktkLib | 07762028c8a3a7378d7e82be8f1ed8c6a0cdc97c | 2af549bfb8448ace9f9fee6c2225ea7d2e6329b8 | refs/heads/master | 2022-11-30T12:26:33.290941 | 2020-08-11T17:50:14 | 2020-08-11T17:50:14 | 213,307,835 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 869 | cpp | ColliderWireFrameDrawer3DMaker.cpp | #include "TktkAppendDxlib3DComponent/Graphics/ColliderWireFrameDrawer3D/ColliderWireFrameDrawer3DMaker.h"
namespace tktk
{
ColliderWireFrameDrawer3DMaker ColliderWireFrameDrawer3DMaker::m_self;
ColliderWireFrameDrawer3DMaker & ColliderWireFrameDrawer3DMaker::makeStart(GameObjectPtr user)
{
m_self = ColliderWireF... |
ea230321c6f1c18e2a91cb994ef04c23ea607469 | e7afa2b000ff1d17aee79af9d291284bec5fb911 | /common/options.h | 76e5eb9e3fbce0b7805e754a89a50160efb7af13 | [] | no_license | matze999/MathX | 33be5eed0c9d01ace4c91ae56500945da48b8066 | 1eb74999391d420cae8cc84298d78baa4c246604 | refs/heads/master | 2020-04-09T11:12:30.527955 | 2015-01-02T09:35:18 | 2015-01-02T09:35:18 | 24,848,616 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,510 | h | options.h | #ifndef __OPTIONS_
#define __OPTIONS_
#include "listing.h"
enum option_type
{
OPT_NOARG,
OPT_INTARG,
OPT_STRARG
};
struct optionT
{
optionT () {}
optionT (char idx, option_type ty, char *desc, int val = 0)
{
id = idx;
type = ty;
description = desc;
value ... |
17ebb7804511c904dc57ff515cb097fb1a8b304c | f511b387dc67727badf6007eed0c3da7f8a4d17c | /栈的压入弹出队列/源.cpp | 993307ab87c9e35637a73b3a97af92cf4bef0283 | [] | no_license | wujiqiang11/offer | 82875fe616552347e4b0d9e5fc5865c8ee63df31 | a1f09f2b34a68d94d20a293aa7852696a98f53a8 | refs/heads/master | 2023-03-14T15:34:35.201004 | 2021-02-23T14:25:28 | 2021-02-23T14:25:28 | 331,807,634 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,918 | cpp | 源.cpp | #include<vector>
using namespace std;
class Solution {
public:
bool IsPopOrder(vector<int> pushV, vector<int> popV) {
vector<int> marker(pushV.size(), 1);
int p1;
int p2;
for (int i = 0; i < popV.size(); i++)
{
if (i == 0)
{
for (int j... |
c96ad27407ceab0f6e78a52747fc01494d5b69ed | e475756f480200f344b05a984e0d1585d5a9f1cf | /stack.cpp | 55db5ef205e84e6036b18e10e0afdac9a28825fb | [] | no_license | ravindra1234567/DSA | 54daf09c079298eef112d3290789c82f35d59658 | 3c4e03f011930679041a9162d37310ead011accd | refs/heads/master | 2022-03-09T00:16:56.214496 | 2019-11-14T18:01:27 | 2019-11-14T18:01:27 | 221,757,650 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 686 | cpp | stack.cpp | #include<stdio.h>
int s[10];
int max=10,top=-1;
void push()
{
int x;
if(top==max-1)
{
printf("Overflow");
}
else
{
printf("Enter value in a stack => ");
scanf("%d",&x);
top=top+1;
s[top]=x;
}
}
void pop()
{
int f;
if(top==-1)
{
printf("Underflow");
}
f=s[top];
top=top-1;
printf("\npoped value of stack => %d\n ",f);
}
... |
34d8770ba3553171d1c79bfb9fdf2e83af2b76d4 | 810b26019957e90a09325e47fe6fea47c18c2123 | /WinMine.cpp | c8e7811ac8e75ea564a9dd23e388f84725f69fc9 | [] | no_license | evenharder/minesweeper | 34f020f343b8eb64cf35be0f54e07361d26c95bc | b7faaf1ffa25009416b3ad3b1758f60eb3627f9b | refs/heads/master | 2016-09-06T15:51:58.903169 | 2015-06-10T17:22:11 | 2015-06-10T17:22:11 | 37,210,343 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 18,168 | cpp | WinMine.cpp | // - - - - - - - - - - - - - - - - - - - //
// W I N M I N E //
// - - - - - - - - - - - - - - - - - - - //
// array[y][x]...... //
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <windows.h>
// - - - - - - - - - - - - - - - - -... |
d3b48be9bd8e64ee7128d30cec19747c91e4f68d | c79ac2abb6b3720b4ef71a93e570cde91ef1a152 | /libhoomd/data_structures/GPUBufferMapped.h | 0fff0c5a08da1476854c1df2589a7f605d8b47a9 | [] | no_license | harperic/hoomd-blue | 810590b817875ef6787b87c5d1896a7bc1fb0d29 | bb901438c1249aa2de1e32a293818efeb23e8c86 | refs/heads/master | 2020-04-14T19:46:53.787982 | 2013-08-26T19:34:47 | 2013-08-26T19:34:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,429 | h | GPUBufferMapped.h | /*
Highly Optimized Object-oriented Many-particle Dynamics -- Blue Edition
(HOOMD-blue) Open Source Software License Copyright 2008-2011 Ames Laboratory
Iowa State University and The Regents of the University of Michigan All rights
reserved.
HOOMD-blue may contain modifications ("Contributions") provided, and to which... |
c81a6b8946509ca8f98f5eaaab56db5e189c7e98 | 9e81c76da4b51a9eb9f99c59e994afb89d7b5f10 | /DrinkMixer.h | c2f6fbe8e04bc465795cf42be1b27e8417ed2fd4 | [] | no_license | harounhajem/ArduBarBotSlave | e466fc1de8410f62e32a3f5110f33ef7333bd29e | ca42ffcfc3a8ff4806da60f6e9b5b65f66be51f3 | refs/heads/master | 2021-01-17T14:03:49.387269 | 2017-06-04T10:27:55 | 2017-06-04T10:27:55 | 83,431,617 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 830 | h | DrinkMixer.h | // DrinkMixer.h
#ifndef _DRINKMIXER_h
#define _DRINKMIXER_h
#if defined(ARDUINO) && ARDUINO >= 100
#include "arduino.h"
#include "Adafruit_NeoPixel.h"
#else
#include "WProgram.h"
#endif
class DrinkMixerClass
{
private:
int soleniod[8];
Adafruit_NeoPixel _strip = Adafruit_NeoPixel(16, 10, NEO_GRB + NEO_KHZ800);
i... |
0da13206b987fbfcda5ed0dbcd342be412c2f613 | 747e2d79f77c64094de69df9128a4943c170d171 | /Info/Info/Items/BagInfos.cpp | 1db0054fb75010484088443efe9fcd5e26f057c8 | [
"MIT"
] | permissive | Teles1/LuniaAsio | 8854b6d59e5b2622dec8eb0d74c4e4a6cafc76a1 | 62e404442cdb6e5523fc6e7a5b0f64a4471180ed | refs/heads/main | 2023-06-14T00:39:11.740469 | 2021-07-05T23:29:44 | 2021-07-05T23:29:44 | 383,286,395 | 0 | 0 | MIT | 2021-07-05T23:29:45 | 2021-07-05T23:26:46 | C++ | UTF-8 | C++ | false | false | 9,550 | cpp | BagInfos.cpp | #include "BagInfos.h"
#include <Info/Info/Enchant/Enchant.h>
namespace Lunia {
namespace XRated {
namespace Database {
namespace Info {
void BagInfos::BagInfo::Serialize(Serializer::IStreamWriter& out) const
{
out.Begin(L"AllM::XRated::Database::Info::BagInfos::BagInfo");
out.Write(L"BagNumberR... |
a85df0ff8f3fb4de1664e5e46e699eb7841bc6cf | 44c3c5749c039312e48c18217e84449506760910 | /ForwardPlus-old/main.h | 954bdebde214793701bd89f164ffa1d979b58af5 | [] | no_license | leothomas77/MATE20-Projetos | ceec536deced4ab32690feeeb24ab877e0c8c0c7 | 73eeaa2c93bc4df476e593c8e947d6d53b1dafcb | refs/heads/master | 2021-05-11T21:31:49.344237 | 2018-06-27T00:04:21 | 2018-06-27T00:04:21 | 117,465,459 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 350 | h | main.h | #ifndef MAIN_H 1
#include <glm/vec3.hpp>
#include <glm/vec4.hpp>
#include <assimp/cimport.h>
#include <assimp/scene.h>
#include <assimp/postprocess.h>
using namespace std;
static void loadMesh(char* filename, const aiScene* scene, aiVector3D scene_min, aiVector3D scene_max, aiVector3D scene_center);
void iniciaL... |
c0af6547cc8bba13f1be20fdfc822a695ab12157 | 4bfcb0d20707e600818fa3a95b503a6b8fe7a561 | /Scratch3D/src/Defines.h | a2d2bdcb5be1b6ef5441b22d23f68ddf1d5a5fa7 | [] | no_license | Eearslya/Scratch3D | 8623211a94a1206a33d52ffbf33c5c93378f0f96 | 6a8e065b462df9555e407361e8a4bec7c15ddd41 | refs/heads/master | 2022-11-19T02:47:26.332620 | 2020-07-07T23:51:22 | 2020-07-07T23:51:22 | 277,946,204 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,478 | h | Defines.h | #pragma once
#define FORCEINLINE __forceinline
#define FORCENOINLINE _declspec(noinline)
#define ALIGN(n) __declspec(align(n))
#define WIN32_LEAN_AND_MEAN
#define NOMINMAX
#ifndef NO_ASSERT
#define ASSERT_ENABLE
#endif
#ifdef ASSERT_ENABLE
#include <iostream>
#if _MSC_VER
#include <intrin.h>
#define DebugBreak() __d... |
5232608e5890a67688c0a2f107d9a727e80ba460 | 4e8b7ab42953b43c263e0715b53e23e74b5b1a44 | /src/tasklist.cpp | 0e02283e8292db6bcda64d76d7a636aa4c00c35f | [] | no_license | Kris1100/PlannerApplication | 6ef1a0e52db45947f6516b83b96d111d305b0106 | 8dbd2245e8879ab7732ace6125df52a0ca589eae | refs/heads/master | 2023-06-19T15:17:07.762527 | 2021-07-14T01:07:14 | 2021-07-14T01:07:14 | 383,720,949 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,315 | cpp | tasklist.cpp | #include "tasklist.h"
#include <QVariant>
#include "datastorertask.h"
#include <QDebug>
TaskList::TaskList(QObject* parent) : QAbstractListModel(parent), m_tasks()
{
}
QHash<int, QByteArray> TaskList::roleNames() const {
QHash<int, QByteArray> roles;
roles[NameRole] = "name";
roles[TextRole] = "text";
... |
225b5318c49f61f557f08b7d9b339a2e14860ceb | 76171660651f1c680d5b5a380c07635de5b2367c | /SH6_43_msh4/0.13005/T | 260cb2fc0d34942b91d55a650d49c5d6737e14eb | [] | no_license | lisegaAM/SH_Paper1 | 3cd0cac0d95cc60d296268e65e2dd6fed4cc6127 | 12ceadba5c58c563ccac236b965b4b917ac47551 | refs/heads/master | 2021-04-27T19:44:19.527187 | 2018-02-21T16:16:50 | 2018-02-21T16:16:50 | 122,360,661 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 218,035 | T | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 3.0.x |
... | |
8a50b06870274809cc2a9887d92cea59d6cd7af3 | f17a88ddef74abe099a0c9d9d9aa91b90075959c | /Code/Runtime/Asset/Ops/AssetDeleteOp.h | ad8385a4237a63ecdfbc3b2ea631bcde1f782074 | [
"MIT",
"Apache-2.0"
] | permissive | NathanSaidas/LiteForgeMirror | bf4b0feb9702b590b510f98f32a3cc1d472f9bb0 | dcb7f690378dd0abe0d1dc3e2783510ce9462fde | refs/heads/master | 2022-06-12T11:55:06.321048 | 2022-05-30T04:37:59 | 2022-05-30T04:37:59 | 184,840,363 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,989 | h | AssetDeleteOp.h | #pragma once
// ********************************************************************
// Copyright (c) 2020 Nathan Hanlan
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files(the "Software"),
// to deal in the Software without restri... |
251aee31190f522ce53e03e4b797b51394a65f02 | 785073523bf04e66432ac7c99af628362e0b9732 | /selective/HardeningUtils.cpp | 9caafdc33c2d2e4420d1287bf9df487a1baea15e | [] | no_license | gabrielseibel1/DIANA-FT | 69a73c6bb57f593fcbe9066ac36a36e2493d7280 | 930591a7bf31b4c2b89f0ebde3ace21a88dbb91c | refs/heads/master | 2020-03-20T01:52:50.460631 | 2018-10-04T01:13:55 | 2018-10-04T01:13:55 | 137,091,852 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 911 | cpp | HardeningUtils.cpp | //
// Created by gabriel on 7/7/18.
//
#include <fstream>
#include "HardeningUtils.h"
void onSDCDetected() {
int previousSDCs;
//open file as `in` to read it
std::ifstream fileIn(sdcDetectionsFilename);
//get SDCs reported until now
if (!fileIn.is_open())
previousSDCs = 0;
else {
... |
7a172b82473d12b173275313acfa46c0e5642205 | 6471a4d0df9c5ed9a7d1fd9cb64e3306366c3dee | /FinalProject/parser.cpp | 0b6eb3f2313e078e3180ec7af4ee2bd4db95c340 | [] | no_license | argnsoccer/Final-Project | d69f973ec83059d1e6e049b31a768522beabe578 | f03757a6be741656eb03bf3128970ecf652b41a4 | refs/heads/master | 2021-01-10T19:20:50.945858 | 2014-12-08T11:08:14 | 2014-12-08T11:08:14 | 26,942,946 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,074 | cpp | parser.cpp | #include "parser.h"
Parser::Parser()
{
}
AVLTree *Parser::parse(char *fileName)
{
xml_document<> doc;
inputFile = new file<>(fileName);
doc.parse<0>((*inputFile).data());//creates the DOM tree
char* start;
char* endWord;
char* pageStart;
bool stopWord;
curNode = doc.first_node()->fir... |
b49b24c175239a0767854d285f60593e1577f113 | 4418f86b56eb89e0bf83d1cb61d67e30fbf0cab9 | /helperfiles/misc/QuadControl-cpp-master/Ground_station/src/vicon_data_custom.h | 80be18bdc09a773d3fb1eaf18b5d786f7a9e897b | [] | no_license | nadurthi/ros_roverbot_ws | 95441893610d64010e4f4c44b94dc6300e77c6fb | 9f1330d30c170b817a8df3d229d63082eec6697d | refs/heads/master | 2020-12-29T21:53:00.650936 | 2020-02-10T16:41:02 | 2020-02-10T16:41:02 | 238,745,801 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,107 | h | vicon_data_custom.h | ///////////////////////////////////////////////////////////////////////////////
//
// Copyright (C) OMG Plc 2009.
// All rights reserved. This software is protected by copyright
// law and international treaties. No part of this software / document
// may be reproduced or distributed in any form or by any means,
// w... |
227696081df6b653f6297fbcf756ec80f7b6d968 | 214dbcc732e0f6a49336164c793bd4af4754a6f7 | /Algorithmics/Problems from various contests/bile3.cpp | 61cde53b13756930d21f41b103d13182b9563f87 | [] | no_license | IrinaMBejan/Personal-work-contests | f878c25507a8bfdab3f7af8d55b780d7632efecb | 4ab2841244a55d074d25e721aefa56431e508c43 | refs/heads/master | 2021-01-20T08:24:47.492233 | 2017-05-03T12:22:26 | 2017-05-03T12:22:26 | 90,142,452 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 791 | cpp | bile3.cpp | #include <fstream>
#define Nmax 2005
using namespace std;
ifstream fin("bile3.in");
ofstream fout("bile3.out");
int N;
int A[Nmax],C[Nmax], B[Nmax];
char S[Nmax*2];
int main()
{
fin>>N;
int i;
for(i=1; i<=N; i++)
fin>>A[i];
for(i=1; i<=N; i++)
fin>>C[i];
int k=1, ok=1, j=0;
int... |
7db706cd21e68597fbaf9f6c6f5e2e580aa0246f | cc2d24f86650c1cec87e05ffe9e14f661eb7dcb3 | /signal_SPGR_DE.h | 414da39a4a880c8eb49b2067aee18b86a36bf71d | [] | no_license | mriphysics/mcDESPOT | ea10e64669b1533888f39f3c8a6c7f7fd7e52817 | 839ff041eeff6b01cd01e4811071e547ed99ba68 | refs/heads/master | 2021-06-16T08:29:23.488869 | 2021-03-09T13:10:50 | 2021-03-09T13:10:50 | 175,249,698 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 612 | h | signal_SPGR_DE.h | #ifndef __signal_SPGR_DE_h__
#define __signal_SPGR_DE_h__
#include <Eigen/Core>
#include <limits>
#include "NaN.h"
class SPGR_steady_state_M0
{
public:
SPGR_steady_state_M0 () :
params (5)
{
params = Eigen::VectorXd::Constant(5,1,NaN);
}
void compute ();
double& T1_F() { return par... |
3ee33c602d3a1e40073d3410a45a5fb9e91c8144 | c728261f153d8ddd9fe96982e1a9c940fd314b71 | /build/cpp/qtcore/QPoint_wrapper.cpp | 7aee02240f272bcae254ec7643d0836a8bb1029b | [] | no_license | alynch4047/sqt | 7382f309721a266ceeea67e3cbbdf5f2da2a15eb | 86c45e30b952bdaaee9326461ec65f0c1bf05143 | refs/heads/master | 2020-06-06T11:16:10.632432 | 2014-02-22T11:18:44 | 2014-02-22T11:18:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,004 | cpp | QPoint_wrapper.cpp |
/*
* CPP Wrapper for QPoint
*/
#include <instance_tracker.h>
#include <qpoint.h>
// These externs declare the functions in the D wrapper, used for virtual method calls
extern "C" void SMID_QPoint_destructor(void* wrappedObject);
// This class is used to wrap virtual and protected methods. All instances created
... |
04e69b32bd92a06a7747cf3dedab4320ff39feed | eefd00f309bcfad68e0f6cf7245d17cefe033c99 | /秋招/8.27 2016/数据结构_逆序打印链表/数据结构_逆序打印链表/main.cpp | 3b51aa1607c3343b71b3aa1160de2365df66c570 | [] | no_license | gujinyue1010/2016GraduationFindJob | a794b213784cb71d86735175a20ec1f30e9fa24f | 1e61df1cf1df374219af59c24b9198aeb44c2586 | refs/heads/master | 2020-06-11T09:49:57.597426 | 2016-12-06T02:44:16 | 2016-12-06T02:44:16 | 75,686,502 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,338 | cpp | main.cpp | //
// main.cpp
// 数据结构_逆序打印链表
//
// Created by 顾金跃 on 16/8/27.
// Copyright © 2016年 顾金跃. All rights reserved.
//
/*
链表逆序输出:
(1)借用栈:栈是先进后出的，链表前面的元素在栈底，后面的元素在栈顶。
(2)先逆置链表，再顺序输出。
(3)利用递归。
(4)利用数组。
*/
#include <iostream>
#include <stack>
using namespace std;
typedef struct ListNode
{
int data;
struct Lis... |
bac75eeaf6bcae21b78ff271438a08e6786ec895 | 4e62fa9da73e1a30773c6e589493a90bcbe7a31a | /IntelligentTransportation/Network/protocol.h | 3abe28c17e651cf88475d797882b57994672680f | [] | no_license | yeholdon/IntelligentTransportation | f7cd681b7d423a412f311770ac0f01a99e5886cb | c0367f2ce75a51c2739ec8c181e49f509317b656 | refs/heads/master | 2020-06-19T12:13:14.066682 | 2019-07-18T03:24:05 | 2019-07-18T03:24:05 | 196,702,073 | 8 | 3 | null | 2019-07-18T03:24:06 | 2019-07-13T09:14:20 | C++ | UTF-8 | C++ | false | false | 823 | h | protocol.h | #ifndef PROTOCOL_H
#define PROTOCOL_H
// 协议类
#include <QObject>
#include <QJsonObject> // json对象,以键值对形式
#include <QJsonDocument> // json文档，提供数据
#include <QJsonArray> // json数组，可以放json对象，也可放标准数据类型
class Protocol : public QObject
{
Q_OBJECT
public:
explicit Protocol(QObject *parent = nullptr);
// 1. 信息的唯一标识符... |
69fc0df1adbff254a22cfbeb405a0c6d50ed6846 | 398c971ecc11761bfe4296e038da7dcdc373cd61 | /code/Queue.h | c001cb7027f6fc3fa1022a934d26dc0885e02eab | [] | no_license | FuXin-1024/code | df3b17dd8f2d65e7e244c5eb5981a49474a56724 | 08dbeff97c1ffdc97ef56db4dd4a58aec5d35aa1 | refs/heads/master | 2021-01-17T09:12:58.950332 | 2017-09-29T02:26:32 | 2017-09-29T02:26:32 | 95,556,445 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 833 | h | Queue.h | #pragma once
#include<iostream>
#include<stack>
#include<assert.h>
using namespace std;
//两个栈实现一个队列
template<class T>
class Queue
{
public:
void Push(const T& x)
{
s1.push(x);
}
void Pop()
{
if (s1.empty() && s2.empty())
{
cout << "Queue is NULL" << endl;
return;
}
if (s2.empty())
{
while (s... |
e5367495ad9e9900659c2127938cc8f2bd9e93b6 | 36d854a1b56213feba7fa2a4bde50ce56821f820 | /src/continuum/continuum_import.hpp | e1013dabba1d5e22c40e76fc8137bb8a84b1c576 | [] | no_license | Slight-wpx/A-parallel-3D-lattice-Boltzmann-CFD-solver | 893653981db196e09fa0e8b687f37649f4fbf5cb | d7a1d57fbcebb8784c89c3d7889c1cc4817a4a69 | refs/heads/master | 2023-04-11T14:27:57.821904 | 2021-04-25T17:08:48 | 2021-04-25T17:08:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,143 | hpp | continuum_import.hpp | #ifndef LBT_CONTINUUM_IMPORT
#define LBT_CONTINUUM_IMPORT
/**
* \file continuum_import.hpp
* \mainpage Class members for importing macroscopic values
* \author Tobit Flatscher (github.com/2b-t)
*/
#include <iostream>
#include <filesystem>
#include <fstream>
#include <memory>
#include <sstream>
#include <s... |
1a9e0efd15ddd522b4d4cf913bc095188a45b866 | c41b3f4d3b0c8a1098faa739f94e406b52661fed | /move zeroes to end .cpp | 5b653dd7545cbea826e63cca3e3c8209cb51f2c9 | [] | no_license | sukhpreet-singh1/Algorithms | 33b917bfb2ea7ef1c4279ff691744cdbfacc6ca0 | 65891610dc5bb677c8cce0bd7753efee483792ce | refs/heads/master | 2023-04-28T23:28:21.816836 | 2021-05-25T16:01:17 | 2021-05-25T16:01:17 | 343,027,716 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 449 | cpp | move zeroes to end .cpp | void moveZeroes(vector<int>& nums) {
int index=0;
int count=0;
for(int i=0;i<nums.size();++i)
{
if(nums[i]==0)
{
count++;
continue;
}
else
{
nums[index]=nums[i];
i... |
1d6aaa03beb62d1f54ffc4495828b57dbdbd3844 | cba6468b4c297856e5f1f12f52063c1332d123d0 | /COMP 371/Assignment 1/VS2017/src/Shader.cpp | 5460272af8488252953e04a6f15f3a718adf1634 | [] | no_license | neoJINXD/Concordia-Projects | 578595e65ecf098067d0013a4e09e957d44f3d3b | 06fe93befa82c5ab22680012963005706a401dc8 | refs/heads/master | 2022-06-22T22:13:16.932278 | 2022-04-07T00:02:35 | 2022-04-07T00:02:35 | 171,685,283 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,647 | cpp | Shader.cpp | #include "Shader.h"
#include <iostream>
#include <fstream>
#include <sstream>
#ifndef GLEW_STATIC
#define GLEW_STATIC 1
#endif
#include <GL/glew.h>
Shader::Shader(string vertFilePath, string fragFilePath) {
vertShader = readShaderFile(vertFilePath.c_str());
fragShader = readShaderFile(fragFilePath.c_str());... |
7e302b7bd2b91a2034971a715be2517d6a5a730e | 3cd3e19b0d8bf6225ebff4a9b1545cb2b2ca4570 | /flexvolume/windows/utils/iscsiHelper/iscsiHelper/iscsiHelper.cpp | e674eacc97f4f33dd885a953b8d97945c59bca6d | [
"LicenseRef-scancode-generic-cla",
"MIT"
] | permissive | microsoft/K8s-Storage-Plugins | d0a6831ef24934bd126237b653c26c348b62af87 | 6628bdad1b79029b4194fbaff2f49f1f2222b976 | refs/heads/master | 2023-09-06T06:24:45.962915 | 2022-11-28T19:11:14 | 2022-11-28T19:11:14 | 130,767,566 | 28 | 17 | MIT | 2022-11-28T19:11:16 | 2018-04-23T23:16:55 | PowerShell | UTF-8 | C++ | false | false | 15,989 | cpp | iscsiHelper.cpp | // iscsiHelper.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#define NOMINMAX
#include <windows.h>
#define _NTSCSI_USER_MODE_
#include "scsi.h"
#include "iscsierr.h"
#include "Iscsidsc.h"
#include <iostream>
#include <optional>
#include <variant>
#include <vector>
... |
eeb3b8da23db035b651c06e660b67d15b027eb78 | 556b00634d0de073f8b0268c1d1d9922a0fddda8 | /gl_testbench/DX12/VertexBufferDX12.h | 4dc5de77082aa1dd00c7f7454859ee0edd4bd02c | [] | no_license | henrikvik/DV2551-3D-Programmering-3 | 191a57c92162b20566ac65ab17857f2408e99bd3 | f2ace085863d2173cbcdd890c069b1736cb60f9c | refs/heads/master | 2021-04-29T12:11:45.149884 | 2018-02-16T14:05:38 | 2018-02-16T14:05:38 | 121,724,519 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 375 | h | VertexBufferDX12.h | #pragma once
#include "../VertexBuffer.h"
class VertexBufferDX12 : public VertexBuffer
{
public:
// Inherited via VertexBuffer
virtual void setData(const void * data, size_t size, size_t offset) override;
virtual void bind(size_t offset, size_t size, unsigned int location) override;
virtual void unbin... |
e00ff3472c236afe34105836736b052ae2163bfe | dde479d03896b14c7e076f27cff68c3f496c0100 | /Part Two/Тест прашања случајно извлекување/main.cpp | d67c743e380908e6748c7f72089b67ebc3ff8c0c | [] | no_license | MarioTalevski/FICT | 59404904cc62261db810f05f69157e8748925713 | 9ecdaa03426100fe044a25d9188b835f1dca3eb4 | refs/heads/master | 2020-03-29T19:05:37.251739 | 2017-01-18T09:00:55 | 2017-01-18T09:00:55 | 60,782,461 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,704 | cpp | main.cpp | #include <cstdlib>
#include <iostream>
#include <ctime>
#include <iomanip>
#include <fstream>
using namespace std;
char prasanje [7][255]={"prasanje 1:\n a)a\n b)b\n","prasanje 2:\n a)a\n b)b\n","prasanje 3:\na)a\n b)b\n","prasanje 4:\na)a\n b)b\n","prasanje 5:\na)a\n b)b\n","prasanje 6:\na)a\n b)b\n","pras... |
18c41d8522a4759dde3a6a3d3a5226f9164461aa | 0a4effb210bcb83b8887e1c9b823e0c3abf36a0d | /Кузнецова/Лаба_№4/Лаба_№4.Обход_графа_в_ширину.cpp | af6e2a91da44f2b62588f51dcedf2bf9f327c49a | [] | no_license | tapoton/PLT_2017_2sem_2c_61gr | c357f9779ea498c66c40efc1c8b5c1a6e6a66751 | 4de6967817dcef735209cb98224e00cecc1433db | refs/heads/master | 2021-01-22T09:16:37.477863 | 2017-06-05T08:51:20 | 2017-06-05T08:51:20 | 81,943,007 | 6 | 20 | null | 2017-09-23T14:12:37 | 2017-02-14T12:27:26 | C++ | UTF-8 | C++ | false | false | 1,680 | cpp | Лаба_№4.Обход_графа_в_ширину.cpp | #include <iostream>
#include <queue>
#include <fstream>
using namespace std;
void Init_n(int *nodes, int N)
{
for (int i = 0; i < N; i++)
nodes[i] = 0;
}
bool BFS(queue<int> Queue, int *nodes, int **a, int N, int k)
{
int node = Queue.front();
if (nodes[node] < 2)
{
Queue.pop();
nodes[n... |
1249759f43ba897551e4b456cb935bd5998ca944 | f3580f803b472d2326bac0d987860cca35137cad | /ms3/utils.h | 8e5431c5f2ec6e0ced12e5274bfdab83cb54da54 | [] | no_license | tahsinr14/OOP244-GENERAL-HOSPITAL | 53b663dfcc32d50552810c64d3e202e9d0ad2888 | 3d0284779e71df7699889f75dea0afad1bbb1e52 | refs/heads/main | 2023-04-02T13:06:42.522236 | 2021-04-09T00:58:19 | 2021-04-09T00:58:19 | 327,715,161 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 860 | h | utils.h | /*
Final Project Milestone 3
Module: utils
Filename: utils.h
Version 1.0
Author John Doe
-----------------------------------------------------------
I have done all the coding by myself and only copied the code
that my professor provided to complete my workshops and assignments.
----------------------------------------... |
6a4a0e0bf8e59badc017e376bc3f88bc6c1a398f | f8fb8d52727b3279155de614dc750dc1fc066910 | /include/nano-caf/core/actor/shutdown_notifier.h | 3a4b4ed312f8067c9fc6ad7020d6108c2f1d7c1a | [] | no_license | yanxicheung/nano-caf | f2b95d512b9573bd0d5b5fd741eaede70c489fe0 | 16d61b1341ddded55291618678e97c66534e74d2 | refs/heads/master | 2023-06-02T16:15:52.182536 | 2021-06-23T11:45:50 | 2021-06-23T11:47:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 552 | h | shutdown_notifier.h | //
// Created by Darwin Yuan on 2020/8/26.
//
#ifndef NANO_CAF_SHUTDOWN_NOTIFIER_H
#define NANO_CAF_SHUTDOWN_NOTIFIER_H
#include <nano-caf/nano-caf-ns.h>
#include <atomic>
NANO_CAF_NS_BEGIN
struct shutdown_notifier {
inline auto shutdown_notified() const noexcept -> bool {
return shutdown_.load(std::memory... |
f48206d8f19c05653aa16ca58c2ad0619d93e940 | 10178cca8d88f0de374be48dc69757069992dc86 | /problema2.cpp | 7351f1858cd6ca5f53403f6a2cce333cf2abb132 | [] | no_license | MirunaRux/Divide-et-impera | 7bf08844d9963173c4603c72d31d8a6589ba2851 | e4e08ea2338ec217019a06cbc17dead63a8c1a56 | refs/heads/master | 2021-01-24T09:09:43.599960 | 2018-02-26T17:38:44 | 2018-02-26T17:38:44 | 123,002,864 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,304 | cpp | problema2.cpp | #include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("date.in.txt");
ofstream g("date.out.txt");
struct nod
{
int data;
nod *stg,*dr;
};
nod* newNode(int nr) ///functie care returneaza un nod cu informatia nr
{
nod *aux=new nod;
aux->stg=aux->dr=... |
81274188238e9e060719ed39fcef1f8801f24a1b | 00d712168ab09a7be4d77b0c2e0639df13fa2854 | /CapsEngine/CAPS/Header/Debug/Debug.hpp | bf20409ea4c787dc115d85902343138163dec09d | [] | no_license | Aladin-Saleh/Moteur-Graphique-Physique | 4db381ce18b50aa65de4b05a7c1b72a7c1de513b | dcbc3e69b056c4d5deeff80575dc6cc811627416 | refs/heads/main | 2023-03-16T06:17:54.235711 | 2021-03-16T11:30:37 | 2021-03-16T11:30:37 | 348,312,327 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,102 | hpp | Debug.hpp | #ifndef __CAPS_DEBUG__
#define __CAPS_DEBUG__
#include "termcolor/termcolor.hpp"
#include <iostream>
#include <cstdarg>
#include "I_Debug.hpp"
#include "PointeurFonction.hpp"
#include "Caps_Console_HUD.hpp"
#ifdef NDEBUG
#if defined(_WIN32) || defined(_WIN64)
#pragma comment(linker, "/subsystem:windows /ENTRY:mainCRT... |
e3b616dc6d422a7ccd160a45b27349f224468fe5 | 7da42b3291d205574642e8fba26bdb9e6c9d524a | /src/ib_port.cpp | d6dd437659852b445dc0aa41c789333cf4b21ca7 | [
"BSD-3-Clause"
] | permissive | NCAR/libibautils | a0c1b9ad615b717bb3a10b991c79e85ff18c2735 | 03efb1f567a8be3134377d0c92d0c09dc0842eeb | refs/heads/master | 2021-05-31T22:57:05.159450 | 2015-10-27T20:05:12 | 2015-10-27T20:05:12 | 44,636,161 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 7,536 | cpp | ib_port.cpp | /*
* Copyright (c) 2015, University Corporation for Atmospheric Research
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyri... |
e93dd1157da1c3257795538538ab7cb10cd0aeae | a585a7eda8a745e36ac43a8883b12708ee9bfc94 | /test/input/arrowCall.cpp | db4ad4dfacd2598883fa7b46682fb1577c85117b | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | jplehr/InstRO | 5aaa4ee70cf45ae5a335783973256e00841dda79 | 62a27e2c0cd24abc615e102c53bad08225aa8c0d | refs/heads/master | 2020-04-19T06:07:34.871732 | 2016-10-19T15:04:04 | 2016-10-19T15:04:04 | 168,009,003 | 0 | 0 | NOASSERTION | 2019-01-28T17:57:09 | 2019-01-28T17:57:08 | null | UTF-8 | C++ | false | false | 115 | cpp | arrowCall.cpp | struct A {
void b() {}
};
void foo() {
A a;
A *pa = &a;
pa->b();
}
int main(int argc, char **){
return 0;
}
|
292a9cb11c1c92f46ee478d97cb8566efa39fb24 | c7257154dafc6ac70528c93c64c93a498edf9cdc | /IMatch.cpp | 5b7618b7dbe07af159f5406d10767b7dd26f6fbe | [] | no_license | springbarley/ttp | 9574698ff41c4bb453eece657d9c4228e0f3083d | b678bd75638aafd570225f4425cbe66a92db59f8 | refs/heads/master | 2021-01-25T05:57:49.206813 | 2012-10-12T17:47:10 | 2012-10-12T17:47:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 86 | cpp | IMatch.cpp | #include "IMatch.h"
IMatch::IMatch(void)
{
}
IMatch::~IMatch(void)
{
}
|
ad440b857c4b123fe84098de120c26af2711f06f | 99fca07461b704d7293205c0b218393dbc2bf06a | /EBRqueue.cpp | 663a9514367312008325972339df9367d4cacf9a | [] | no_license | dachshu/Lock-FreeStructureMemoryReclamationTest | 82c34f9f1616f1e63d9b65e10398b8a88c07e18a | 2f5a1c1401fbc1703d8f81d2c3e52d3a95154f48 | refs/heads/main | 2023-03-30T01:33:44.925769 | 2021-04-04T13:02:57 | 2021-04-04T13:02:57 | 305,433,312 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 4,268 | cpp | EBRqueue.cpp | #include <iostream>
#include <thread>
#include <chrono>
#include <atomic>
#include <mutex>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
using namespace std::chrono;
class NODE {
public:
int key;
NODE* next;
NODE() { next = nullptr; }
NODE(int key_value) {
next = nullptr;
key =... |
b7cde2bdd20460d4c86a19720a91aa23d3f0daf1 | fec1e3d99fc7de1f76e25945c3cdd38bd37c62a5 | /CPP_04/ex00/Peon.cpp | 069be9df13c9e1f0e47528debdc85b131c007fbf | [] | no_license | Nath-G/CPP_Module | 1282ab7c98266e194d7b88a31d03c166cd19a27c | af11de2498204fd92c48d1636175de302c5fa919 | refs/heads/main | 2023-08-03T03:58:21.561340 | 2021-09-26T18:30:42 | 2021-09-26T18:30:42 | 329,921,343 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 766 | cpp | Peon.cpp | # include "Peon.hpp"
// Parametric constructor (std::string
Peon::Peon(std::string name) : Victim(name)
{
std::cout << GREY << "Zog zog." << C_RES << std::endl;
return ;
}
// Copy constructor
Peon::Peon(const Peon& src) : Victim(src)
{
std::cout << GREY << "Copy Peon creation..." << C_RES << std::endl;
*this = sr... |
335fd740c60fb9edc79c8d7174df97821f799562 | a65c77b44164b2c69dfe4bfa2772d18ae8e0cce2 | /catagories/QTREES/QTREE2.cpp | f4350898e1969d78b6c64ba4710283a4ee9e9af8 | [] | no_license | dl8sd11/online-judge | 553422b55080e49e6bd9b38834ccf1076fb95395 | 5ef8e3c5390e54381683f62f88d03629e1355d1d | refs/heads/master | 2021-12-22T15:13:34.279988 | 2021-12-13T06:45:49 | 2021-12-13T06:45:49 | 111,268,306 | 1 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 3,362 | cpp | QTREE2.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#define eb emplace_back
#define ALL(i) i.begin(),i.end()
#define X first
#defin... |
4541acdf0b22618fe56aee786302c5712f4d3abc | 496948edf435619772d2aa1683d7bd0df75eeed9 | /testing/batch_triangular/test_Xgeqrf_batch.cpp | a47aeb02da02f5f06358ba59ecf9de2d440595d1 | [
"BSD-3-Clause"
] | permissive | ecrc/kblas-gpu | aeb4174951f9ae5c2a7e5275d34fd40182be9924 | 8af76dc862c74cbe880569ff2ccf6e5e54245430 | refs/heads/master | 2023-04-04T02:05:47.981475 | 2023-03-27T13:20:24 | 2023-03-27T13:20:24 | 66,200,952 | 53 | 15 | BSD-3-Clause | 2023-03-27T13:20:27 | 2016-08-21T13:45:35 | Cuda | UTF-8 | C++ | false | false | 12,094 | cpp | test_Xgeqrf_batch.cpp | /**
* @copyright (c) 2012- King Abdullah University of Science and
* Technology (KAUST). All rights reserved.
**/
/**
* @file testing/batch_triangular/test_Xgeqrf_batch.cpp
* KBLAS is a high performance CUDA library for subset of BLAS
* and LAPACK routines optimized for NVIDIA... |
665043c0f9a250e214a3412e8fe41673c38e7424 | c73ffb0f08ff3c786fb656c83e3c968090bc9c0a | /src/debug.h | a5030c8e19c1a57cdd4999537bf4f41657bdc5e9 | [] | no_license | kotborealis/mokou | 5c1d8b027a49b06873d92cab29ea46db831438d4 | e303d8c9fbdedde461b58d851cb54dc04e751aac | refs/heads/master | 2021-01-21T13:52:30.041575 | 2016-05-29T21:07:08 | 2016-05-29T21:07:08 | 51,956,589 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 188 | h | debug.h | #pragma once
#include <string>
#include <iostream>
#include <ctime>
#include <iomanip>
namespace debug{
std::string get_time();
void i_log(std::string s);
void e_log(std::string s);
} |
aacaab0bad2a1eeec29790765e45bcdc72b343c3 | 1501f50acc22b9e915d04df435210d68e2a907ee | /include/System/ComponentModel/Component.hpp | 3507314ffe0376df43132f9ddcba81befe0dba3f | [
"Unlicense"
] | permissive | sc2ad/BeatSaber-Quest-Codegen | cd944128d6c7b61f2014f13313d2d6cf424df811 | 4bfd0c0f705e7a302afe6ec1ef996b5b2e3f4600 | refs/heads/master | 2023-03-11T11:07:22.074423 | 2023-02-28T22:15:16 | 2023-02-28T22:15:16 | 285,669,750 | 31 | 25 | Unlicense | 2023-02-28T22:15:18 | 2020-08-06T20:56:01 | C++ | UTF-8 | C++ | false | false | 11,309 | hpp | Component.hpp | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "beatsaber-hook/shared/utils/typedefs.h"
#include "beatsaber-hook/shared/utils/byref.hpp"
// Including type: System.MarshalByRefObject
#... |
882ce3a7b4b4838df39a13fcc38f37a618e77315 | e4fe8fa7d29e293afd38870a44d42f163133813e | /cpp_backend/record.cpp | 78ab149f1bc93a859f1e1a765d425f196672040b | [
"MIT"
] | permissive | chengxuanying/MapSystem | 27c0f75c5a68e3f0540dab38a0b4af83c83d2294 | 7da7c6c4952ff181eafc2569b9ac49ab4cbbab2f | refs/heads/master | 2023-03-27T19:12:45.078973 | 2020-09-13T05:17:02 | 2020-09-13T05:17:02 | 220,892,860 | 0 | 0 | null | 2021-03-31T04:01:47 | 2019-11-11T03:22:45 | C++ | UTF-8 | C++ | false | false | 2,998 | cpp | record.cpp | //
// Created by 派星星 on 2019/11/11.
//
#include <codecvt>
#include <utility>
#include "record.h"
#include "utils.h"
void endianChange(struct _struct_record &t) {
// change the endian mode
t._struct_size = swap_uint16(t._struct_size);
t._id = swap_uint32(t._id);
t._name_size = swap_uint16(t._name_size);... |
9ccad9f67422b5df371efae1bf0623582eff89da | c32ee8ade268240a8064e9b8efdbebfbaa46ddfa | /Libraries/m2sdk/ue/sys/memorymanager/C_ComposerAllocatorAndStatistics_TPL_61175C1B.h | 781fcf10c8a4fbd1eae8b331e9c84601b313976f | [] | no_license | hopk1nz/maf2mp | 6f65bd4f8114fdeb42f9407a4d158ad97f8d1789 | 814cab57dc713d9ff791dfb2a2abeb6af0e2f5a8 | refs/heads/master | 2021-03-12T23:56:24.336057 | 2015-08-22T13:53:10 | 2015-08-22T13:53:10 | 41,209,355 | 19 | 21 | null | 2015-08-31T05:28:13 | 2015-08-22T13:56:04 | C++ | UTF-8 | C++ | false | false | 1,069 | h | C_ComposerAllocatorAndStatistics_TPL_61175C1B.h | // auto-generated file (rttidump-exporter by h0pk1nz)
#pragma once
#include <ue/sys/memorymanager/I_ResetableAllocator.h>
namespace ue
{
namespace sys
{
namespace memorymanager
{
/** ue::sys::memorymanager::C_ComposerAllocatorAndStatistics<ue::sys::memorymanager::C_IncrementalAllocator<ue::sys::memorymanager::I_A... |
8d3e5918a816686a3f266b136d3ccdcf42f544b7 | 647ffb9d3e077ae75deaf9fbec6e0a5fa72253ae | /cppcore/include/detail/config.hpp | 12df9dab516df744f919bb07d723ba2c432b0a0a | [
"BSD-2-Clause"
] | permissive | Yukee/pybinding | 365e8e08bc43b5a2f0f53e0225b7a98455d88377 | 823dacee421e7d1cf99fe31751ff9a308b61e0aa | refs/heads/master | 2021-01-12T20:07:04.165783 | 2016-05-15T19:36:05 | 2016-05-15T20:20:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 190 | hpp | config.hpp | #pragma once
#ifdef TBM_USE_MKL
#define EIGEN_USE_MKL_ALL
#define TBM_USE_FEAST
#endif
// disable Eigen's internal multi-threading (doesn't do much anyway)
#define EIGEN_DONT_PARALLELIZE
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.