hexsha stringlengths 40 40 | size int64 7 1.05M | ext stringclasses 13
values | lang stringclasses 1
value | max_stars_repo_path stringlengths 4 269 | max_stars_repo_name stringlengths 5 108 | max_stars_repo_head_hexsha stringlengths 40 40 | max_stars_repo_licenses listlengths 1 9 | max_stars_count int64 1 191k ⌀ | max_stars_repo_stars_event_min_datetime stringlengths 24 24 ⌀ | max_stars_repo_stars_event_max_datetime stringlengths 24 24 ⌀ | max_issues_repo_path stringlengths 4 269 | max_issues_repo_name stringlengths 5 116 | max_issues_repo_head_hexsha stringlengths 40 40 | max_issues_repo_licenses listlengths 1 9 | max_issues_count int64 1 67k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 4 269 | max_forks_repo_name stringlengths 5 116 | max_forks_repo_head_hexsha stringlengths 40 40 | max_forks_repo_licenses listlengths 1 9 | max_forks_count int64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 7 1.05M | avg_line_length float64 1.21 330k | max_line_length int64 6 990k | alphanum_fraction float64 0.01 0.99 | author_id stringlengths 2 40 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3241a892c48085ce63e9e44d75ef0c0e59863597 | 232 | cpp | C++ | AtCoder/abc189/a/main.cpp | H-Tatsuhiro/Com_Pro-Cpp | fd79f7821a76b11f4a6f83bbb26a034db577a877 | [
"MIT"
] | null | null | null | AtCoder/abc189/a/main.cpp | H-Tatsuhiro/Com_Pro-Cpp | fd79f7821a76b11f4a6f83bbb26a034db577a877 | [
"MIT"
] | 1 | 2021-10-19T08:47:23.000Z | 2022-03-07T05:23:56.000Z | AtCoder/abc189/a/main.cpp | H-Tatsuhiro/Com_Pro-Cpp | fd79f7821a76b11f4a6f83bbb26a034db577a877 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
char a, b, c; cin >> a >> b >> c;
if (a == b && b == c) cout << "Won" << endl;
else cout << "Lost" << endl;
}
| 21.090909 | 48 | 0.543103 | H-Tatsuhiro |
3249e51c1a5b24abe217395fc251242472a546eb | 1,373 | cpp | C++ | 03/spiralsquare.t.cpp | ComicSansMS/AdventOfCode2017 | 238460dd82dae182d78b8460578b7f615cf99fd0 | [
"Unlicense"
] | null | null | null | 03/spiralsquare.t.cpp | ComicSansMS/AdventOfCode2017 | 238460dd82dae182d78b8460578b7f615cf99fd0 | [
"Unlicense"
] | null | null | null | 03/spiralsquare.t.cpp | ComicSansMS/AdventOfCode2017 | 238460dd82dae182d78b8460578b7f615cf99fd0 | [
"Unlicense"
] | null | null | null | #include <catch.hpp>
#include <spiralsquare.hpp>
#include <iostream>
TEST_CASE("Spiralsquare")
{
SECTION("Determine Ring")
{
CHECK(getRing(1) == 1);
CHECK(getRing(8) == 3);
CHECK(getRing(11) == 5);
CHECK(getRing(18) == 5);
}
SECTION("Check distance")
{
CH... | 25.425926 | 51 | 0.541151 | ComicSansMS |
324beca6e5532de8238fffbeaa9288b7b30c6364 | 1,070 | cpp | C++ | A2OnlineJudge/Ladder_1400_1499/GargariAndBishops.cpp | seeva92/Competitive-Programming | 69061c5409bb806148616fe7d86543e94bf76edd | [
"Apache-2.0"
] | null | null | null | A2OnlineJudge/Ladder_1400_1499/GargariAndBishops.cpp | seeva92/Competitive-Programming | 69061c5409bb806148616fe7d86543e94bf76edd | [
"Apache-2.0"
] | null | null | null | A2OnlineJudge/Ladder_1400_1499/GargariAndBishops.cpp | seeva92/Competitive-Programming | 69061c5409bb806148616fe7d86543e94bf76edd | [
"Apache-2.0"
] | null | null | null | #include <bits/stdc++.h>
typedef long long ll;
const int mod = 1e9 + 7;
const int MAX = 1e5 + 7;
using namespace std;
typedef vector<int> vi;
ll arr[2007][2007];
ll diag1[2 * 2007], diag2[2 * 2007];
int n;
struct soln {
ll val, i, j;
};
soln sols[2];
int main() {
#ifndef ONLINE_JUDGE
freopen("/Users/seeva92/Workspace... | 26.75 | 79 | 0.507477 | seeva92 |
324d9008bf81c4a99c2741b28ac055602ed1d524 | 2,557 | cpp | C++ | src/frame-counter.cpp | longlonghands/fps-challenge | 020c133a782285364d52b1c98e9661c9aedfd96d | [
"MIT"
] | null | null | null | src/frame-counter.cpp | longlonghands/fps-challenge | 020c133a782285364d52b1c98e9661c9aedfd96d | [
"MIT"
] | null | null | null | src/frame-counter.cpp | longlonghands/fps-challenge | 020c133a782285364d52b1c98e9661c9aedfd96d | [
"MIT"
] | null | null | null | #include "frame-coutner.hpp"
#include "packet-source.hpp"
#include <spdlog/spdlog.h>
namespace challenge { namespace media {
FrameCounter::FrameCounter(int duration)
: PacketSourceSubscriber(50)
, m_durations(15)
, m_targetDuration(duration)
, m_fps(0.0)
, m_frameCounts(-1)
,... | 30.440476 | 106 | 0.599922 | longlonghands |
3258bfb114e5fc25d237aab789c5616e7770abd5 | 5,698 | cpp | C++ | src/vendor/mariadb-10.6.7/storage/columnstore/columnstore/utils/common/MonitorProcMem.cpp | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | null | null | null | src/vendor/mariadb-10.6.7/storage/columnstore/columnstore/utils/common/MonitorProcMem.cpp | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | null | null | null | src/vendor/mariadb-10.6.7/storage/columnstore/columnstore/utils/common/MonitorProcMem.cpp | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | 2 | 2022-02-27T14:00:01.000Z | 2022-03-31T06:24:22.000Z | /* Copyright (C) 2014 InfiniDB, Inc.
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; version 2 of
the License.
This program is distributed in the hope that it will be useful,
but W... | 28.777778 | 82 | 0.501404 | zettadb |
325f1e2b5c247c926309ccd4a9b6ef7b2fe544e2 | 1,517 | cpp | C++ | src/impl/types/IDArray.cpp | ArkaprabhaChakraborty/milvus-sdk-cpp | 0d8b64fa7680888c4a2baba7363d5370a7195ad2 | [
"Apache-2.0"
] | 9 | 2021-11-11T07:17:51.000Z | 2022-03-22T04:56:24.000Z | src/impl/types/IDArray.cpp | ArkaprabhaChakraborty/milvus-sdk-cpp | 0d8b64fa7680888c4a2baba7363d5370a7195ad2 | [
"Apache-2.0"
] | 172 | 2021-11-12T03:42:39.000Z | 2022-03-31T07:24:43.000Z | src/impl/types/IDArray.cpp | ArkaprabhaChakraborty/milvus-sdk-cpp | 0d8b64fa7680888c4a2baba7363d5370a7195ad2 | [
"Apache-2.0"
] | 3 | 2021-11-12T03:50:18.000Z | 2022-03-22T04:56:31.000Z | // Licensed to the LF AI & Data foundation 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 may not use th... | 30.959184 | 114 | 0.742254 | ArkaprabhaChakraborty |
325fb0a34646bd74c67dbbe9f3e371ee3cb8345a | 613 | cpp | C++ | third_party/eigen-eigen-50812b426b7c/build_dir/doc/snippets/compile_BiCGSTAB_simple.cpp | shishaochen/TensorFlow-0.8-Win | 63221dfc4f1a1d064308e632ba12e6a54afe1fd8 | [
"Apache-2.0"
] | 1 | 2017-09-14T23:59:05.000Z | 2017-09-14T23:59:05.000Z | third_party/eigen-eigen-50812b426b7c/build_dir/doc/snippets/compile_BiCGSTAB_simple.cpp | shishaochen/TensorFlow-0.8-Win | 63221dfc4f1a1d064308e632ba12e6a54afe1fd8 | [
"Apache-2.0"
] | 1 | 2016-10-19T02:43:04.000Z | 2016-10-31T14:53:06.000Z | third_party/eigen-eigen-50812b426b7c/build_dir/doc/snippets/compile_BiCGSTAB_simple.cpp | shishaochen/TensorFlow-0.8-Win | 63221dfc4f1a1d064308e632ba12e6a54afe1fd8 | [
"Apache-2.0"
] | 8 | 2016-10-23T00:50:02.000Z | 2019-04-21T11:11:57.000Z | #include <Eigen/Eigen>
#include <iostream>
#ifndef M_PI
#define M_PI 3.1415926535897932384626433832795
#endif
using namespace Eigen;
using namespace std;
int main(int, char**)
{
cout.precision(3);
int n = 10000;
VectorXd x(n), b(n);
SparseMatrix<double> A(n,n);
/* ... fill A and b ... */
BiCGSTAB<Spa... | 21.892857 | 71 | 0.618271 | shishaochen |
32614b787817ebfe9ae8aaf18fef6228f9e25743 | 14,877 | cpp | C++ | cpp/src/variant/clustering.cpp | dylex/wecall | 35d24cefa4fba549e737cd99329ae1b17dd0156b | [
"MIT"
] | 8 | 2018-10-08T15:47:21.000Z | 2021-11-09T07:13:05.000Z | cpp/src/variant/clustering.cpp | dylex/wecall | 35d24cefa4fba549e737cd99329ae1b17dd0156b | [
"MIT"
] | 4 | 2018-11-05T09:16:27.000Z | 2020-04-09T12:32:56.000Z | cpp/src/variant/clustering.cpp | dylex/wecall | 35d24cefa4fba549e737cd99329ae1b17dd0156b | [
"MIT"
] | 4 | 2019-09-03T15:46:39.000Z | 2021-06-04T07:28:33.000Z | // All content Copyright (C) 2018 Genomics plc
#include "variant/clustering.hpp"
#include "haplotype.hpp"
#include "variantCombinations.hpp"
namespace wecall
{
namespace variant
{
VariantCluster::VariantCluster()
: m_variants(),
m_variantRegions(),
m_paddedRegion( "", -1, -1 ),
... | 41.672269 | 120 | 0.542314 | dylex |
326395e862184c104ace788e1341f2ce10dacb67 | 1,350 | cpp | C++ | Problem Solving with C++/Source Code/Chapter05/05-02.cpp | MorganBergen/Learning-CPP | a8d8ed92a6e4cb6c96d091d6c7e1ef551968932b | [
"Unlicense"
] | null | null | null | Problem Solving with C++/Source Code/Chapter05/05-02.cpp | MorganBergen/Learning-CPP | a8d8ed92a6e4cb6c96d091d6c7e1ef551968932b | [
"Unlicense"
] | null | null | null | Problem Solving with C++/Source Code/Chapter05/05-02.cpp | MorganBergen/Learning-CPP | a8d8ed92a6e4cb6c96d091d6c7e1ef551968932b | [
"Unlicense"
] | null | null | null | //DISPLAY 5.2 void Functions
//Program to convert a Fahrenheit temperature to a Celsius temperature.
#include <iostream>
void initializeScreen( );
//Separates current output from
//the output of the previously run program.
double celsius(double fahrenheit);
//Converts a Fahrenheit temperature
//to a Celsius temperatu... | 23.684211 | 71 | 0.692593 | MorganBergen |
3269b521ed568cb4aaed93e6dc287b04acb5dd21 | 4,499 | cpp | C++ | lc7/src/CLC7Updater.cpp | phixion/l0phtcrack | 48ee2f711134e178dbedbd925640f6b3b663fbb5 | [
"Apache-2.0",
"MIT"
] | 2 | 2021-10-20T00:25:39.000Z | 2021-11-08T12:52:42.000Z | lc7/src/CLC7Updater.cpp | Brute-f0rce/l0phtcrack | 25f681c07828e5e68e0dd788d84cc13c154aed3d | [
"Apache-2.0",
"MIT"
] | null | null | null | lc7/src/CLC7Updater.cpp | Brute-f0rce/l0phtcrack | 25f681c07828e5e68e0dd788d84cc13c154aed3d | [
"Apache-2.0",
"MIT"
] | 1 | 2022-03-14T06:41:16.000Z | 2022-03-14T06:41:16.000Z | #include"stdafx.h"
#include"lc7app.h"
CLC7Updater::CLC7Updater(ILC7Controller *ctrl) : QThread(NULL)
{
m_ctrl = ctrl;
m_manual_check = false;
}
CLC7Updater::~CLC7Updater()
{TR;
}
void CLC7Updater::setManualCheck()
{TR;
m_manual_check = true;
}
void CLC7Updater::run()
{TR;
bool manual_check... | 27.771605 | 227 | 0.691487 | phixion |
3269fd6a68173d2b376df0f394218affa6d0cf4a | 4,445 | hpp | C++ | include/expsum/fitting/function_fitter.hpp | hide-ikeno/expsum | 7b1be33b7c342f875d6d5e5c0cd8df9ec62abbda | [
"MIT"
] | null | null | null | include/expsum/fitting/function_fitter.hpp | hide-ikeno/expsum | 7b1be33b7c342f875d6d5e5c0cd8df9ec62abbda | [
"MIT"
] | null | null | null | include/expsum/fitting/function_fitter.hpp | hide-ikeno/expsum | 7b1be33b7c342f875d6d5e5c0cd8df9ec62abbda | [
"MIT"
] | null | null | null | #ifndef EXPSUM_FUNCTION_FITTER_HPP
#define EXPSUM_FUNCTION_FITTER_HPP
#include <type_traits>
#include "expsum/fitting/fast_esprit.hpp"
namespace expsum
{
template <typename T>
class function_fitter
{
public:
using esprit_type = expsum::fast_esprit<T>;
using size_type = typename esprit_type::size_type;
... | 24.832402 | 75 | 0.604499 | hide-ikeno |
326dff2290c203ff7db307d06a63b3e092f2e6ad | 730 | cpp | C++ | CompilationTest/StructureTest1/results/StructureTest1.cpp | onelang/TestArtifacts | 3f067308c8da3a6f95a001ff8b2d0a0421ae3285 | [
"MIT"
] | null | null | null | CompilationTest/StructureTest1/results/StructureTest1.cpp | onelang/TestArtifacts | 3f067308c8da3a6f95a001ff8b2d0a0421ae3285 | [
"MIT"
] | null | null | null | CompilationTest/StructureTest1/results/StructureTest1.cpp | onelang/TestArtifacts | 3f067308c8da3a6f95a001ff8b2d0a0421ae3285 | [
"MIT"
] | null | null | null | #include <OneLang-Core-v0.1/one.hpp>
#include <iostream>
#include <string>
template<typename T>
class MyList {
public:
one::vec<T> items;
private:
};
class Item {
public:
int offset = 5;
std::string str_test = std::string("test") + std::string("test2");
std::string str_constr = std::string("con... | 16.222222 | 70 | 0.594521 | onelang |
326f00c546dad683986278036c47676f5a404cf8 | 616 | cpp | C++ | solutions/316.remove-duplicate-letters.250689698.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | 78 | 2020-10-22T11:31:53.000Z | 2022-02-22T13:27:49.000Z | solutions/316.remove-duplicate-letters.250689698.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | null | null | null | solutions/316.remove-duplicate-letters.250689698.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | 26 | 2020-10-23T15:10:44.000Z | 2021-11-07T16:13:50.000Z | class Solution {
public:
string removeDuplicateLetters(string s) {
unordered_map<char, int> map;
unordered_set<char> set;
for (char c : s)
map[c]++;
vector<char> stack;
unordered_set<char> done;
for (char c : s) {
while (!done.count(c) && stack.size() && stack.back() >= c &&
... | 18.666667 | 67 | 0.501623 | satu0king |
326f044c6e5051da1ca410dacdf5f74719f290c4 | 1,976 | cc | C++ | test/common/network/configurator_test.cc | jpsim/envoy-mobile | 29855f6416b0af1c5b70db2a790212ce6d405946 | [
"Apache-2.0"
] | 1 | 2022-01-28T06:19:49.000Z | 2022-01-28T06:19:49.000Z | test/common/network/configurator_test.cc | jpsim/envoy-mobile | 29855f6416b0af1c5b70db2a790212ce6d405946 | [
"Apache-2.0"
] | null | null | null | test/common/network/configurator_test.cc | jpsim/envoy-mobile | 29855f6416b0af1c5b70db2a790212ce6d405946 | [
"Apache-2.0"
] | 1 | 2022-02-02T14:38:36.000Z | 2022-02-02T14:38:36.000Z | #include <net/if.h>
#include "test/extensions/common/dynamic_forward_proxy/mocks.h"
#include "gtest/gtest.h"
#include "library/common/network/configurator.h"
using testing::_;
using testing::Return;
namespace Envoy {
namespace Network {
class ConfiguratorTest : public testing::Test {
public:
ConfiguratorTest()
... | 32.933333 | 90 | 0.771255 | jpsim |
32747794e3ba8527b251085463fd9103ba7681a0 | 15,660 | cpp | C++ | frameworks/cocos2d-x/cocos/editor-support/spine/PathConstraint.cpp | a77654135/test | 8baad719292e1d04f5ad6a17ee56845437ea90d0 | [
"MIT"
] | null | null | null | frameworks/cocos2d-x/cocos/editor-support/spine/PathConstraint.cpp | a77654135/test | 8baad719292e1d04f5ad6a17ee56845437ea90d0 | [
"MIT"
] | null | null | null | frameworks/cocos2d-x/cocos/editor-support/spine/PathConstraint.cpp | a77654135/test | 8baad719292e1d04f5ad6a17ee56845437ea90d0 | [
"MIT"
] | null | null | null | /******************************************************************************
* Spine Runtimes License Agreement
* Last updated May 1, 2019. Replaces all prior versions.
*
* Copyright (c) 2013-2019, Esoteric Software LLC
*
* Integration of the Spine Runtimes into software or otherwise creating
* derivative wor... | 28.472727 | 136 | 0.621839 | a77654135 |
3275fb8c51851ade1abd2e1847d546ebc2bed813 | 9,292 | cpp | C++ | SimulationsOMP/Step_T3D_CHM_TBB.cpp | COFS-UWA/MPM3D | 1a0c5dc4e92dff3855367846002336ca5a18d124 | [
"MIT"
] | null | null | null | SimulationsOMP/Step_T3D_CHM_TBB.cpp | COFS-UWA/MPM3D | 1a0c5dc4e92dff3855367846002336ca5a18d124 | [
"MIT"
] | 2 | 2020-10-19T02:03:11.000Z | 2021-03-19T16:34:39.000Z | SimulationsOMP/Step_T3D_CHM_TBB.cpp | COFS-UWA/MPM3D | 1a0c5dc4e92dff3855367846002336ca5a18d124 | [
"MIT"
] | 1 | 2020-04-28T00:33:14.000Z | 2020-04-28T00:33:14.000Z | #include "SimulationsOMP_pcp.h"
#include <fstream>
#include "ParallelForTask.hpp"
#include "ParallelReduceTask.hpp"
#include "Step_T3D_CHM_TBB.h"
#ifdef _DEBUG
static std::fstream res_file_t3d_me_tbb;
#endif
Step_T3D_CHM_TBB::Step_T3D_CHM_TBB(const char* _name) :
Step_TBB(_name, "Step_T3D_CHM_TBB", &substep_func_T... | 31.605442 | 98 | 0.773999 | COFS-UWA |
32791a4fbc70b599ab5b86b630e78f35efc93a62 | 9,590 | cpp | C++ | cpp/Tests/TestsMatrixVsTensor.cpp | ExaScience/smurff | 29c3859badca49275833024cd77f8ca7fa6f76be | [
"MIT"
] | 65 | 2017-06-23T14:01:58.000Z | 2022-03-10T16:13:48.000Z | cpp/Tests/TestsMatrixVsTensor.cpp | ExaScience/smurff | 29c3859badca49275833024cd77f8ca7fa6f76be | [
"MIT"
] | 143 | 2017-08-11T10:43:52.000Z | 2021-09-23T17:07:51.000Z | cpp/Tests/TestsMatrixVsTensor.cpp | ExaScience/smurff | 29c3859badca49275833024cd77f8ca7fa6f76be | [
"MIT"
] | 14 | 2018-05-17T18:33:28.000Z | 2021-12-23T20:41:32.000Z | #include <cstdio>
#include <fstream>
#include "catch.hpp"
#include <SmurffCpp/Types.h>
#include <SmurffCpp/Configs/Config.h>
#include <SmurffCpp/Sessions/TrainSession.h>
#include <SmurffCpp/Utils/MatrixUtils.h>
#include <SmurffCpp/Utils/StateFile.h>
#include <SmurffCpp/result.h>
#include "Tests.h"
namespace smurff... | 47.009804 | 263 | 0.780813 | ExaScience |
327c45516859cedb1d7e360f7477bd0b6b4e2996 | 164 | cpp | C++ | codechef_problems/PRESENTS.cpp | Ankitahazra-1906/cpp | 31412ffc844cbafb6dd8a64e031676b48acadfe2 | [
"MIT"
] | 2 | 2021-11-11T19:18:16.000Z | 2021-11-13T11:23:03.000Z | codechef_problems/PRESENTS.cpp | Ankitahazra-1906/cp | 24ab374184e440c17b467967995b2f6324baa2a6 | [
"MIT"
] | null | null | null | codechef_problems/PRESENTS.cpp | Ankitahazra-1906/cp | 24ab374184e440c17b467967995b2f6324baa2a6 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main() {
// your code goes here
int t,n;
cin>>t;
while(t--){
cin>>n;
cout<<n-n/5<<endl;
}
return 0;
}
| 11.714286 | 23 | 0.560976 | Ankitahazra-1906 |
327d87ac2e2838fc06a568bda9754d102f832301 | 4,927 | hpp | C++ | ThirdParty-mod/java2cpp/java/security/cert/CertificateEncodingException.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 | [
"MIT"
] | 1 | 2019-04-03T01:53:28.000Z | 2019-04-03T01:53:28.000Z | ThirdParty-mod/java2cpp/java/security/cert/CertificateEncodingException.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 | [
"MIT"
] | null | null | null | ThirdParty-mod/java2cpp/java/security/cert/CertificateEncodingException.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 | [
"MIT"
] | null | null | null | /*================================================================================
code generated by: java2cpp
author: Zoran Angelov, mailto://baldzar@gmail.com
class: java.security.cert.CertificateEncodingException
================================================================================*/
#ifnde... | 34.943262 | 170 | 0.753603 | kakashidinho |
327f45f63abbd466212b6e6b5795612af411e995 | 381 | cpp | C++ | Dataset/Leetcode/train/53/18.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/53/18.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/53/18.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | class Solution {
public:
int XXX(vector<int>& nums) {
int ans = INT_MIN;
int curSum = 0;
for(int i = 0; i < nums.size(); i++){
if(curSum > 0){//延续之前的优势
curSum += nums[i];
}else{//抛弃累赘，自立门户
curSum = nums[i];
}
ans... | 21.166667 | 45 | 0.401575 | kkcookies99 |
32809798102508ac40bd6037d0c28437f6d38bf1 | 1,864 | cpp | C++ | src/subclass.cpp | ebayboy/cpp_demos | b01df202c0285bf232900662d336505520d5d24d | [
"Apache-2.0"
] | null | null | null | src/subclass.cpp | ebayboy/cpp_demos | b01df202c0285bf232900662d336505520d5d24d | [
"Apache-2.0"
] | null | null | null | src/subclass.cpp | ebayboy/cpp_demos | b01df202c0285bf232900662d336505520d5d24d | [
"Apache-2.0"
] | null | null | null | /* class_protect.class */
/* ���������ת���ɻ������ */
#include <iostream>
#include <cstring>
using namespace std;
/* ================ CLASS BOX ================== */
class Box
{
private:
double height;
protected:
double width;
public:
Box()
{
cout << "Box constructor..." << endl;
}
void setHeight(double h... | 17.420561 | 78 | 0.558476 | ebayboy |
32821babd81aacd718ff17fa62c07f08858fcc71 | 2,784 | hpp | C++ | libs/boost_1_72_0/boost/proto/detail/poly_function_traits.hpp | henrywarhurst/matrix | 317a2a7c35c1c7e3730986668ad2270dc19809ef | [
"BSD-3-Clause"
] | null | null | null | libs/boost_1_72_0/boost/proto/detail/poly_function_traits.hpp | henrywarhurst/matrix | 317a2a7c35c1c7e3730986668ad2270dc19809ef | [
"BSD-3-Clause"
] | null | null | null | libs/boost_1_72_0/boost/proto/detail/poly_function_traits.hpp | henrywarhurst/matrix | 317a2a7c35c1c7e3730986668ad2270dc19809ef | [
"BSD-3-Clause"
] | null | null | null | #if !defined(BOOST_PROTO_DONT_USE_PREPROCESSED_FILES)
#include <boost/proto/detail/preprocessed/poly_function_traits.hpp>
#elif !defined(BOOST_PP_IS_ITERATING)
#if defined(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES)
#pragma wave option(preserve : 2, line : 0, output \
... | 40.941176 | 96 | 0.603807 | henrywarhurst |
3282cb0cdc792a471c1c57f28cda6a63dc89d899 | 83 | cxx | C++ | Modules/ThirdParty/VNL/src/vxl/core/vnl/Templates/vnl_fortran_copy+long_double-.cxx | nalinimsingh/ITK_4D | 95a2eacaeaffe572889832ef0894239f89e3f303 | [
"Apache-2.0"
] | 3 | 2018-10-01T20:46:17.000Z | 2019-12-17T19:39:50.000Z | Modules/ThirdParty/VNL/src/vxl/core/vnl/Templates/vnl_fortran_copy+long_double-.cxx | nalinimsingh/ITK_4D | 95a2eacaeaffe572889832ef0894239f89e3f303 | [
"Apache-2.0"
] | null | null | null | Modules/ThirdParty/VNL/src/vxl/core/vnl/Templates/vnl_fortran_copy+long_double-.cxx | nalinimsingh/ITK_4D | 95a2eacaeaffe572889832ef0894239f89e3f303 | [
"Apache-2.0"
] | 4 | 2018-05-17T16:34:54.000Z | 2020-09-24T02:12:40.000Z | #include <vnl/vnl_fortran_copy.hxx>
VNL_FORTRAN_COPY_INSTANTIATE(long double);
| 20.75 | 43 | 0.807229 | nalinimsingh |
32880252f42720763ec72e6369578a577516f0d2 | 913 | cpp | C++ | tp2/ast/astPrintStr.cpp | diogodanielsoaresferreira/lfa-compiler_project | 65478b84fd28bfa48431068558bec1795596ab02 | [
"MIT"
] | null | null | null | tp2/ast/astPrintStr.cpp | diogodanielsoaresferreira/lfa-compiler_project | 65478b84fd28bfa48431068558bec1795596ab02 | [
"MIT"
] | null | null | null | tp2/ast/astPrintStr.cpp | diogodanielsoaresferreira/lfa-compiler_project | 65478b84fd28bfa48431068558bec1795596ab02 | [
"MIT"
] | null | null | null | #include "astPrintStr.h"
#include <stdint.h>
#include <stdio.h>
#include <string>
////////////////////////////////////////////////////
int ASTPrintStr::gcnt = 0;
void ASTPrintStr::show(uint32_t indent)
{
fprintf(stdout, ";%*s ASTPrintStr\n", 4*indent, "");
if(str!=NULL)
str->show(indent+1);
}
void AST... | 22.825 | 72 | 0.556407 | diogodanielsoaresferreira |
328a1d2464768465685d9c3436881e9f899cad16 | 573 | cpp | C++ | Challenge-2020-07/all_paths_from_source_to_target.cpp | qiufengyu/LetsCode | 196fae0bf5c78ee20d05798a9439596e702fdb24 | [
"MIT"
] | null | null | null | Challenge-2020-07/all_paths_from_source_to_target.cpp | qiufengyu/LetsCode | 196fae0bf5c78ee20d05798a9439596e702fdb24 | [
"MIT"
] | null | null | null | Challenge-2020-07/all_paths_from_source_to_target.cpp | qiufengyu/LetsCode | 196fae0bf5c78ee20d05798a9439596e702fdb24 | [
"MIT"
] | null | null | null | #include "../header.h"
class Solution {
public:
vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {
vector<vector<int>> res;
helper(graph, 0, {}, res);
return res;
}
void helper(vector<vector<int>> &graph, int current, vector<int> path, vector<vector<int>> &res) ... | 27.285714 | 102 | 0.530541 | qiufengyu |
328b1d7bb8bf5a8881c010362480daf3bb077a5b | 3,960 | ipp | C++ | include/pybind11_ext/boost/circular_buffer.ipp | lukaszlaszko/pybind11_ext | c999daf0869d9e83583985626407b1f190559775 | [
"MIT"
] | null | null | null | include/pybind11_ext/boost/circular_buffer.ipp | lukaszlaszko/pybind11_ext | c999daf0869d9e83583985626407b1f190559775 | [
"MIT"
] | 7 | 2018-06-03T04:32:12.000Z | 2018-06-18T06:46:39.000Z | include/pybind11_ext/boost/circular_buffer.ipp | lukaszlaszko/pybind11_ext | c999daf0869d9e83583985626407b1f190559775 | [
"MIT"
] | null | null | null | #pragma once
#include <boost/circular_buffer.hpp>
#include <boost/filesystem.hpp>
#include <boost/lexical_cast.hpp>
#include <list>
#include <memory>
#include <stdexcept>
#include <type_traits>
#include <sys/mman.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
namespace pybind11 { namespace detail ... | 28.695652 | 119 | 0.660101 | lukaszlaszko |
328c7163e6ec342cbddb59b877e816427a5a234d | 2,230 | cpp | C++ | test/identities/publickey.cpp | ciband/cpp-crypto | 19e2c92fb08b4e118380feb1452e6b7198309f50 | [
"MIT"
] | null | null | null | test/identities/publickey.cpp | ciband/cpp-crypto | 19e2c92fb08b4e118380feb1452e6b7198309f50 | [
"MIT"
] | 2 | 2019-02-18T15:51:34.000Z | 2019-04-16T03:36:08.000Z | test/identities/publickey.cpp | ciband/cpp-crypto | 19e2c92fb08b4e118380feb1452e6b7198309f50 | [
"MIT"
] | null | null | null |
#include "gtest/gtest.h"
#include "identities/publickey.h"
using namespace Ark::Crypto::Identities;
namespace {
const auto passphrase = "bullet parade snow bacon mutual deposit brass floor staff list concert ask";
const uint8_t testPublicKeyBytes[33] = {2, 159, 223, 65, 167, 214, 157, 142, 252, 123, 35,
... | 41.296296 | 115 | 0.770852 | ciband |
32917aefba32c304ba8b2b520e7f293542bb3d93 | 731 | cpp | C++ | solutions/URI_1042 - (2302638) - Accepted.cpp | KelwinKomka/URI-Online-Judge-1 | 3d6e37ebe3aa145f47dfcad8b219e53c3cae50f6 | [
"MIT"
] | null | null | null | solutions/URI_1042 - (2302638) - Accepted.cpp | KelwinKomka/URI-Online-Judge-1 | 3d6e37ebe3aa145f47dfcad8b219e53c3cae50f6 | [
"MIT"
] | null | null | null | solutions/URI_1042 - (2302638) - Accepted.cpp | KelwinKomka/URI-Online-Judge-1 | 3d6e37ebe3aa145f47dfcad8b219e53c3cae50f6 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
using namespace std;
int main(int argc, const char * argv[])
{
int x, y, z;
while(cin >> x >> y >> z){
if(x < y)
if(x < z)
if(y < z)
cout << x << endl << y << endl << z << endl;
else
cout << x << endl << z << e... | 22.151515 | 58 | 0.372093 | KelwinKomka |
329288e749a7cd095d9b804c06a7b7f7be69bc50 | 3,502 | cpp | C++ | src/raster_renderer.cpp | VIGameStudio/PhotonCaster | 947e62e2d8f65bd3526f3672436812b22816caa8 | [
"MIT"
] | null | null | null | src/raster_renderer.cpp | VIGameStudio/PhotonCaster | 947e62e2d8f65bd3526f3672436812b22816caa8 | [
"MIT"
] | null | null | null | src/raster_renderer.cpp | VIGameStudio/PhotonCaster | 947e62e2d8f65bd3526f3672436812b22816caa8 | [
"MIT"
] | null | null | null | #include "raster_renderer.h"
#include <string>
namespace graphics
{
static void ToInverseTranspose (glm::mat4& m)
{
glm::mat3 tmp = glm::mat3 (m);
tmp = glm::inverse (tmp);
tmp = glm::transpose (tmp);
m[0][0] = tmp[0][0]; m[0][1] = tmp[0][1]; m[0][2] = tmp[0][2];
m[1][... | 45.480519 | 119 | 0.604512 | VIGameStudio |
3292d242f9b1942d38fa8eae8294b8b5c1bbbf5d | 29,618 | inl | C++ | src/fonts/stb_font_consolas_26_usascii.inl | stetre/moonfonts | 5c8010c02ea62edcf42902e09478b0cd14af56ea | [
"MIT"
] | 3 | 2018-03-13T12:51:57.000Z | 2021-10-11T11:32:17.000Z | src/fonts/stb_font_consolas_26_usascii.inl | stetre/moonfonts | 5c8010c02ea62edcf42902e09478b0cd14af56ea | [
"MIT"
] | null | null | null | src/fonts/stb_font_consolas_26_usascii.inl | stetre/moonfonts | 5c8010c02ea62edcf42902e09478b0cd14af56ea | [
"MIT"
] | null | null | null | // Font generated by stb_font_inl_generator.c (4/1 bpp)
//
// Following instructions show how to use the only included font, whatever it is, in
// a generic way so you can replace it with any other font by changing the include.
// To use multiple fonts, replace STB_SOMEFONT_* below with STB_FONT_consolas_26_usascii... | 63.151386 | 123 | 0.774597 | stetre |
32948c9fb3458d490ccadd7ef77747a6f558d59e | 23,892 | hpp | C++ | test/testheader/cmath_test.hpp | onihusube/spook | a25c49e9fb7320faf1e718a2dc8f35545d3f4a40 | [
"BSL-1.0"
] | 1 | 2019-09-22T11:27:46.000Z | 2019-09-22T11:27:46.000Z | test/testheader/cmath_test.hpp | onihusube/spook | a25c49e9fb7320faf1e718a2dc8f35545d3f4a40 | [
"BSL-1.0"
] | 2 | 2019-08-01T06:05:36.000Z | 2019-08-01T06:11:20.000Z | test/testheader/cmath_test.hpp | onihusube/spook | a25c49e9fb7320faf1e718a2dc8f35545d3f4a40 | [
"BSL-1.0"
] | null | null | null | #include "doctest/doctest.h"
#include <cmath>
#include "spook.hpp"
namespace spook_test::cmath {
TEST_CASE("isinf test")
{
constexpr auto inf = std::numeric_limits<double>::infinity();
CHECK_UNARY(spook::isinf(inf));
CHECK_UNARY(spook::isinf(-inf));
CHECK_UNARY_FALSE(spook::isinf(0.0));
CHECK_UNARY_FA... | 25.885157 | 80 | 0.639084 | onihusube |
32978f2c96f85d14786f950106852d31493ef573 | 12,880 | cpp | C++ | src/MainWindow.cpp | dankrusi/optimal-lunar-landing-analysis | ba23b718a4ce6e8277a28ef1da3ae89abd95e399 | [
"MIT"
] | 5 | 2016-07-18T18:58:51.000Z | 2021-11-17T11:24:44.000Z | src/MainWindow.cpp | dankrusi/optimal-lunar-landing-analysis | ba23b718a4ce6e8277a28ef1da3ae89abd95e399 | [
"MIT"
] | null | null | null | src/MainWindow.cpp | dankrusi/optimal-lunar-landing-analysis | ba23b718a4ce6e8277a28ef1da3ae89abd95e399 | [
"MIT"
] | 1 | 2019-05-18T15:30:08.000Z | 2019-05-18T15:30:08.000Z | /*
* Optimal Lunar Landing Analysis
* https://github.com/dankrusi/optimal-lunar-landing-analysis
*
* Contributor(s):
* Dan Krusi <dan.krusi@nerves.ch> (original author)
* Stephan Krusi <stephan.krusi@gmail> (co-author)
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software a... | 33.11054 | 164 | 0.711724 | dankrusi |
329ad3a22e7e9ba0a73a6f7220a1e5de80a4a024 | 1,468 | cpp | C++ | Databases/ConsoleApplication1/ProfileEditor.cpp | henriquesqs/Codes | 59e5bb683f3de2ee1b13621569954be1e4f37396 | [
"MIT"
] | null | null | null | Databases/ConsoleApplication1/ProfileEditor.cpp | henriquesqs/Codes | 59e5bb683f3de2ee1b13621569954be1e4f37396 | [
"MIT"
] | 1 | 2021-09-21T03:26:14.000Z | 2021-09-21T03:26:14.000Z | Databases/ConsoleApplication1/ProfileEditor.cpp | henriquesqs/Codes | 59e5bb683f3de2ee1b13621569954be1e4f37396 | [
"MIT"
] | 1 | 2020-03-31T01:49:23.000Z | 2020-03-31T01:49:23.000Z | #include "SystemInterface.h"
void SystemInterface::ProfileEditor::UpdateName()
{
std::cout << "------------------- UPDATE -------------------" << std::endl;
std::cout << "Type the new Name: ";
std::getline(std::cin, name);
// UPDATE
st.Execute("update " + userType[type] + " set NOME ='" + name + "' wher... | 29.959184 | 124 | 0.541553 | henriquesqs |
32a5d7902202d0090fdfa96da1610453669f4416 | 1,277 | cpp | C++ | ccc/cpp/ccc13s4.cpp | tylertian123/CompSciSolutions | 33769a20ea613439f92055b40deeac4927cb0a91 | [
"MIT"
] | null | null | null | ccc/cpp/ccc13s4.cpp | tylertian123/CompSciSolutions | 33769a20ea613439f92055b40deeac4927cb0a91 | [
"MIT"
] | null | null | null | ccc/cpp/ccc13s4.cpp | tylertian123/CompSciSolutions | 33769a20ea613439f92055b40deeac4927cb0a91 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
std::vector<std::vector<int>> graph;
bool bfs(int start, int end) {
bool *visited = new bool[graph.size()]();
bool *queued = new bool[graph.size()]();
std::queue<int> q;
q.push(start);
while(!q.empty()) {
... | 18.779412 | 51 | 0.449491 | tylertian123 |
32a8a84b70f8851bf17b3da0cf3441abda7c7c0a | 1,345 | cpp | C++ | Chapter5/Exercise-5-14/main.cpp | kozborn/programing-principles-and-practise-using-cpp | 7fefba8765e26af83f138e660861fe5b90adcda4 | [
"MIT"
] | null | null | null | Chapter5/Exercise-5-14/main.cpp | kozborn/programing-principles-and-practise-using-cpp | 7fefba8765e26af83f138e660861fe5b90adcda4 | [
"MIT"
] | null | null | null | Chapter5/Exercise-5-14/main.cpp | kozborn/programing-principles-and-practise-using-cpp | 7fefba8765e26af83f138e660861fe5b90adcda4 | [
"MIT"
] | null | null | null | #include "../../std_lib_facilities.h"
void print_vector(const vector<int> &vec) {
for (auto const &a : vec) {
cout << a << endl;
}
}
int main() {
cout << "Enter pairs (day temp) " << endl;
string day;
int temp;
vector<int> pon;
vector<int> tue;
vector<int> wed;
vector<int> thu... | 23.189655 | 71 | 0.501115 | kozborn |
32aa6db4c59c08b5644f26fc487a56ac5f556f41 | 4,246 | cpp | C++ | src/widgets/keyboard.cpp | Windrill/GuiLite | 6577199c1c56626ac2436af2392ddf65bb50e761 | [
"Apache-2.0"
] | 6,304 | 2017-09-23T04:22:51.000Z | 2022-03-31T05:49:57.000Z | src/widgets/keyboard.cpp | Windrill/GuiLite | 6577199c1c56626ac2436af2392ddf65bb50e761 | [
"Apache-2.0"
] | 41 | 2017-12-01T13:36:21.000Z | 2022-03-22T08:16:13.000Z | src/widgets/keyboard.cpp | Windrill/GuiLite | 6577199c1c56626ac2436af2392ddf65bb50e761 | [
"Apache-2.0"
] | 764 | 2017-09-26T15:12:11.000Z | 2022-03-31T08:49:25.000Z | #include "../widgets_include/keyboard.h"
#ifdef GUILITE_ON
static c_keyboard_button s_key_0, s_key_1, s_key_2, s_key_3, s_key_4, s_key_5, s_key_6, s_key_7, s_key_8, s_key_9;
static c_keyboard_button s_key_A, s_key_B, s_key_C, s_key_D, s_key_E, s_key_F, s_key_G, s_key_H, s_key_I, s_key_J;
static c_keyboard_button s_ke... | 55.868421 | 114 | 0.639425 | Windrill |
32af9a775e68698e366e0b194d7ea26ff17ee7b2 | 402 | cpp | C++ | 374 Big Mod.cpp | zihadboss/UVA-Solutions | 020fdcb09da79dc0a0411b04026ce3617c09cd27 | [
"Apache-2.0"
] | 86 | 2016-01-20T11:36:50.000Z | 2022-03-06T19:43:14.000Z | 374 Big Mod.cpp | Mehedishihab/UVA-Solutions | 474fe3d9d9ba574b97fd40ca5abb22ada95654a1 | [
"Apache-2.0"
] | null | null | null | 374 Big Mod.cpp | Mehedishihab/UVA-Solutions | 474fe3d9d9ba574b97fd40ca5abb22ada95654a1 | [
"Apache-2.0"
] | 113 | 2015-12-04T06:40:57.000Z | 2022-02-11T02:14:28.000Z | #include <iostream>
using namespace std;
// Don't need to use long long because the mod^2 is still containable by a signed int
int myPow(int b, int p, int m)
{
b = b % m;
int total = 1;
while (p)
{
if (p & 1)
total = (total * b) % m;
b = (b * b) % m;
p >>= 1;
}
return total;
}
int main()
{
in... | 12.181818 | 85 | 0.50995 | zihadboss |
32b17590918c4e6468ac9424a0b02e24a4cb98db | 700 | hpp | C++ | Jimbo/Jimbo/graphics/renderer.hpp | BenStorey/Jimbo | 937ff92a432fea2cb9a8e837d0e6839405f1a6c6 | [
"MIT"
] | 3 | 2017-05-29T15:44:13.000Z | 2019-08-24T09:15:09.000Z | Jimbo/Jimbo/graphics/renderer.hpp | BenStorey/Jimbo | 937ff92a432fea2cb9a8e837d0e6839405f1a6c6 | [
"MIT"
] | null | null | null | Jimbo/Jimbo/graphics/renderer.hpp | BenStorey/Jimbo | 937ff92a432fea2cb9a8e837d0e6839405f1a6c6 | [
"MIT"
] | null | null | null |
#ifndef JIMBO_GRAPHICS_RENDERER_HPP
#define JIMBO_GRAPHICS_RENDERER_HPP
/////////////////////////////////////////////////////////
// Renderer.h
//
// Ben Storey
//
// More of a placeholder right now. The void* is obviously not ideal, but I don't want to build
// a whole lot of subclasses to implement a Renderer inter... | 22.580645 | 118 | 0.568571 | BenStorey |
32b1a798b47ff61b1923e607f021ec86034d2b65 | 781 | cpp | C++ | cpp/071-080/Minimum Window Substring.cpp | KaiyuWei/leetcode | fd61f5df60cfc7086f7e85774704bacacb4aaa5c | [
"MIT"
] | 150 | 2015-04-04T06:53:49.000Z | 2022-03-21T13:32:08.000Z | cpp/071-080/Minimum Window Substring.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 1 | 2015-04-13T15:15:40.000Z | 2015-04-21T20:23:16.000Z | cpp/071-080/Minimum Window Substring.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 64 | 2015-06-30T08:00:07.000Z | 2022-01-01T16:44:14.000Z | class Solution {
public:
string minWindow(string s, string t) {
unordered_map<char, int> dict;
int cnt = 0, start = 0, len = INT_MAX, first = 0;
for (char c : t) {
dict[c]++;
}
for (int i = 0; i < s.size(); i++) {
dict[s[i]]--;
if (dict[s[i... | 26.931034 | 58 | 0.326504 | KaiyuWei |
32b7aeb7009ef3ec4bd511a46c8648eec8fff33d | 3,242 | cpp | C++ | qt-async-lib/widgets/AsyncWidgetProgressBar.cpp | Qt-Widgets/qt-async | 7092eea0b219d3dc8aeb036c4807f27cc89a79df | [
"Apache-2.0"
] | 12 | 2018-10-26T08:15:34.000Z | 2021-09-18T00:10:09.000Z | qt-async-lib/widgets/AsyncWidgetProgressBar.cpp | Qt-Widgets/qt-async | 7092eea0b219d3dc8aeb036c4807f27cc89a79df | [
"Apache-2.0"
] | 1 | 2019-11-20T09:00:06.000Z | 2019-11-22T17:32:48.000Z | qt-async-lib/widgets/AsyncWidgetProgressBar.cpp | Qt-Widgets/qt-async | 7092eea0b219d3dc8aeb036c4807f27cc89a79df | [
"Apache-2.0"
] | 4 | 2018-10-26T08:15:20.000Z | 2020-05-01T11:26:27.000Z | /*
Copyright (c) 2018 Alex Zhondin <lexxmark.dev@gmail.com>
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appl... | 30.299065 | 122 | 0.648982 | Qt-Widgets |
32bd72c334520a7bb3a9d2d9b4d85f0d2b565929 | 3,991 | cpp | C++ | public/unitcodec.cpp | MDGSF/canproxy | fd5203abae6c8f399d860e3620ce9afc99a457f9 | [
"MIT"
] | null | null | null | public/unitcodec.cpp | MDGSF/canproxy | fd5203abae6c8f399d860e3620ce9afc99a457f9 | [
"MIT"
] | null | null | null | public/unitcodec.cpp | MDGSF/canproxy | fd5203abae6c8f399d860e3620ce9afc99a457f9 | [
"MIT"
] | null | null | null | #include "unitcodec.h"
int32_t
iEncode8(uint8_t ucValue, char ** ppcBuf, uint16_t * pusEncodeLen)
{
if(NULL == ppcBuf || NULL == *ppcBuf || NULL == pusEncodeLen) {
return EXIT_FAILURE;
}
(*ppcBuf)[0] = ucValue;
*ppcBuf += sizeof(uint8_t);
*pusEncodeLen += sizeof(uint8_t);
return EXIT_SUCCESS;
}
int32_t
iDecod... | 21.928571 | 69 | 0.637434 | MDGSF |
32bfc77695bc7f3cbd26f551e310dbfc4d865aae | 805 | cpp | C++ | ProcessingQueues/src/consumer/QueueConsumerWorker.cpp | seancfoley/HPQueues | e1e75d0afc8470e93d2c172c8f687bdc13f85d38 | [
"Apache-2.0"
] | 7 | 2016-09-29T02:17:02.000Z | 2021-02-19T13:55:56.000Z | ProcessingQueues/src/consumer/QueueConsumerWorker.cpp | seancfoley/HPQueues | e1e75d0afc8470e93d2c172c8f687bdc13f85d38 | [
"Apache-2.0"
] | null | null | null | ProcessingQueues/src/consumer/QueueConsumerWorker.cpp | seancfoley/HPQueues | e1e75d0afc8470e93d2c172c8f687bdc13f85d38 | [
"Apache-2.0"
] | 1 | 2018-05-23T08:53:52.000Z | 2018-05-23T08:53:52.000Z | /*
* ConsumingWorker.cpp
*
* Created on: Sep 22, 2010
* Author: sfoley
*/
#include <unistd.h>
#include "QueueConsumerWorker.h"
using namespace std;
namespace hpqueue {
void QueueConsumerWorker::init() {
queueAccess.startAccess();
}
void QueueConsumerWorker::finalize() {
queueAccess.endAccess();
upda... | 16.428571 | 48 | 0.720497 | seancfoley |
32c0fbad0f1966b8f5e2386942bf4b6b37aeca80 | 2,619 | cc | C++ | examples/toyExperiment/toyExperiment/Analyzers/InspectIntersections_module.cc | JeffersonLab/ARIEL | 49054ac62a84d48e269f7171daabb98e12a0be90 | [
"BSD-3-Clause"
] | null | null | null | examples/toyExperiment/toyExperiment/Analyzers/InspectIntersections_module.cc | JeffersonLab/ARIEL | 49054ac62a84d48e269f7171daabb98e12a0be90 | [
"BSD-3-Clause"
] | null | null | null | examples/toyExperiment/toyExperiment/Analyzers/InspectIntersections_module.cc | JeffersonLab/ARIEL | 49054ac62a84d48e269f7171daabb98e12a0be90 | [
"BSD-3-Clause"
] | 2 | 2020-09-26T01:37:11.000Z | 2021-05-03T13:02:24.000Z | //
// Inspect the MC truth about the intersections between tracks and detector
// shells.
//
#include "toyExperiment/MCDataProducts/IntersectionCollection.h"
#include "toyExperiment/Utilities/inputTagsFromStrings.h"
#include "art/Framework/Core/EDAnalyzer.h"
#include "art/Framework/Core/ModuleMacros.h"
#include "art/... | 24.25 | 80 | 0.673921 | JeffersonLab |
32c67479a8a81724719a8da3447b38bfd7363513 | 2,166 | cpp | C++ | day01.cpp | Sayansree/gfg30 | 2cd4c1a2a553c045e660ab974b8054d3bce0df2b | [
"MIT"
] | 1 | 2021-02-05T13:41:58.000Z | 2021-02-05T13:41:58.000Z | day01.cpp | Sayansree/gfg30 | 2cd4c1a2a553c045e660ab974b8054d3bce0df2b | [
"MIT"
] | null | null | null | day01.cpp | Sayansree/gfg30 | 2cd4c1a2a553c045e660ab974b8054d3bce0df2b | [
"MIT"
] | null | null | null | /*
/*Geek and his classmates are playing a prank on their Computer Science teacher. They change places every time the teacher turns to look at the blackboard.
Each of the N students in the class can be identified by a unique roll number X and each desk has a number i associated with it. Only one student can sit on on... | 24.337079 | 248 | 0.625115 | Sayansree |
32c8a86c58698e9d82358e4bf5fae3444fffe33b | 1,227 | cpp | C++ | c++/containers/list_remove.cpp | DevNaga/c_cpp_book | c08ac6c62a98c701d512ac432df77385b51af97b | [
"Apache-2.0"
] | 1 | 2020-11-25T02:06:23.000Z | 2020-11-25T02:06:23.000Z | c++/containers/list_remove.cpp | madmax440/c_cpp_book | c08ac6c62a98c701d512ac432df77385b51af97b | [
"Apache-2.0"
] | null | null | null | c++/containers/list_remove.cpp | madmax440/c_cpp_book | c08ac6c62a98c701d512ac432df77385b51af97b | [
"Apache-2.0"
] | null | null | null | /**
* Author Devendra Naga (devendra.aaru@gmail.com)
*
* License apache
*/
#include <list>
#include <string>
#include <iostream>
std::list<std::string>::const_iterator
find_element(std::list<std::string> &s, std::string _s)
{
std::list <std::string> :: const_iterator it;
for (it = s.begin(); it != s.end()... | 18.876923 | 60 | 0.485738 | DevNaga |
32c8e0b6add848dc51e92f9445faa589e79c2556 | 3,640 | cpp | C++ | WRK-V1.2/csharp/shared/positiondata.cpp | intj-t/openvmsft | 0d17fbce8607ab2b880be976c2e86d8cfc3e83bb | [
"Intel"
] | null | null | null | WRK-V1.2/csharp/shared/positiondata.cpp | intj-t/openvmsft | 0d17fbce8607ab2b880be976c2e86d8cfc3e83bb | [
"Intel"
] | null | null | null | WRK-V1.2/csharp/shared/positiondata.cpp | intj-t/openvmsft | 0d17fbce8607ab2b880be976c2e86d8cfc3e83bb | [
"Intel"
] | null | null | null | // ==++==
//
//
// Copyright (c) 2006 Microsoft Corporation. All rights reserved.
//
// The use and distribution terms for this software are contained in the file
// named license.txt, which can be found in the root of this distribution.
// By using this software in any fashion, you are agreeing to ... | 26.962963 | 95 | 0.437912 | intj-t |
32c96e4da3865a9079a6974e0eb5aedfbcf4c8fd | 2,011 | cc | C++ | sgw/src/model/DescribeGatewayLogsRequest.cc | iamzken/aliyun-openapi-cpp-sdk | 3c991c9ca949b6003c8f498ce7a672ea88162bf1 | [
"Apache-2.0"
] | 89 | 2018-02-02T03:54:39.000Z | 2021-12-13T01:32:55.000Z | sgw/src/model/DescribeGatewayLogsRequest.cc | iamzken/aliyun-openapi-cpp-sdk | 3c991c9ca949b6003c8f498ce7a672ea88162bf1 | [
"Apache-2.0"
] | 89 | 2018-03-14T07:44:54.000Z | 2021-11-26T07:43:25.000Z | sgw/src/model/DescribeGatewayLogsRequest.cc | aliyun/aliyun-openapi-cpp-sdk | 0cf5861ece17dfb0bb251f13bf3fbdb39c0c6e36 | [
"Apache-2.0"
] | 69 | 2018-01-22T09:45:52.000Z | 2022-03-28T07:58:38.000Z | /*
* Copyright 2009-2017 Alibaba Cloud All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required... | 27.175676 | 84 | 0.765788 | iamzken |
32caae615f90b25466de4fcdf9d3e4dc89fdd485 | 4,805 | cpp | C++ | src/tests/functional/inference_engine/serialization/single_layer/multiclass_nms.cpp | si-eun-kim/openvino | 1db4446e2a6ead55d066e0b4e718fa37f509353a | [
"Apache-2.0"
] | 1,127 | 2018-10-15T14:36:58.000Z | 2020-04-20T09:29:44.000Z | src/tests/functional/inference_engine/serialization/single_layer/multiclass_nms.cpp | si-eun-kim/openvino | 1db4446e2a6ead55d066e0b4e718fa37f509353a | [
"Apache-2.0"
] | 439 | 2018-10-20T04:40:35.000Z | 2020-04-19T05:56:25.000Z | src/tests/functional/inference_engine/serialization/single_layer/multiclass_nms.cpp | tuxedcat/openvino | 5939cb1b363ebb56b73c2ad95d8899961a084677 | [
"Apache-2.0"
] | 414 | 2018-10-17T05:53:46.000Z | 2020-04-16T17:29:53.000Z | // Copyright (C) 2018-2022 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include <vector>
#include "shared_test_classes/single_layer/multiclass_nms.hpp"
using namespace ngraph;
using namespace ov::test::subgraph;
namespace {
TEST_P(MulticlassNmsLayerTest, Serialize) {
serialize();
}
/* input for... | 39.710744 | 97 | 0.593132 | si-eun-kim |
32cd08e3b27676e3fb81b2d6dc36987c3d84f1e9 | 2,724 | cpp | C++ | emulator/src/lib/formats/fm7_cas.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | 1 | 2022-01-15T21:38:38.000Z | 2022-01-15T21:38:38.000Z | emulator/src/lib/formats/fm7_cas.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | null | null | null | emulator/src/lib/formats/fm7_cas.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | null | null | null | // license:BSD-3-Clause
// copyright-holders:Barry Rodewald
/*
* Fujitsu FM-7 series cassette handling
*/
#include <assert.h>
#include "fm7_cas.h"
#define WAVE_HIGH 0x5a9e
#define WAVE_LOW -0x5a9e
static int cas_size;
static int fm7_fill_wave(int16_t* buffer, uint8_t high, uint8_t low, int sample_p... | 24.106195 | 101 | 0.597651 | rjw57 |
32d3f75905f8f741f8b7216d7922fb313d8e1a88 | 1,023 | cpp | C++ | shared_model/backend/protobuf/commands/impl/proto_grant_permission.cpp | akshatkarani/iroha | 5acef9dd74720c6185360d951e9b11be4ef73260 | [
"Apache-2.0"
] | 1,467 | 2016-10-25T12:27:19.000Z | 2022-03-28T04:32:05.000Z | shared_model/backend/protobuf/commands/impl/proto_grant_permission.cpp | akshatkarani/iroha | 5acef9dd74720c6185360d951e9b11be4ef73260 | [
"Apache-2.0"
] | 2,366 | 2016-10-25T10:07:57.000Z | 2022-03-31T22:03:24.000Z | shared_model/backend/protobuf/commands/impl/proto_grant_permission.cpp | akshatkarani/iroha | 5acef9dd74720c6185360d951e9b11be4ef73260 | [
"Apache-2.0"
] | 662 | 2016-10-26T04:41:22.000Z | 2022-03-31T04:15:02.000Z | /**
* Copyright Soramitsu Co., Ltd. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#include "backend/protobuf/commands/proto_grant_permission.hpp"
#include "backend/protobuf/permissions.hpp"
namespace shared_model {
namespace proto {
GrantPermission::GrantPermission(iroha::protocol::Command ... | 30.088235 | 79 | 0.703812 | akshatkarani |
32d46cebd481def4fac62f718ae033c9ec21fd5f | 1,512 | hpp | C++ | Source/Core/Geometry/Hull2D.hpp | andraantariksa/PlasmaEngine | 481ea008ed15b531476533a6f675bc9bfdfa7db2 | [
"MIT"
] | 70 | 2020-10-19T15:17:36.000Z | 2022-03-29T06:23:20.000Z | Source/Core/Geometry/Hull2D.hpp | andraantariksa/PlasmaEngine | 481ea008ed15b531476533a6f675bc9bfdfa7db2 | [
"MIT"
] | 90 | 2020-10-21T09:56:03.000Z | 2022-02-19T18:36:37.000Z | Source/Core/Geometry/Hull2D.hpp | andraantariksa/PlasmaEngine | 481ea008ed15b531476533a6f675bc9bfdfa7db2 | [
"MIT"
] | 13 | 2020-12-28T20:18:57.000Z | 2022-01-20T08:43:29.000Z | // MIT Licensed (see LICENSE.md).
#pragma once
namespace Geometry
{
class Hull2D
{
typedef Plasma::Array<Vec2> Vec2Array;
typedef Plasma::Array<uint> IndexArray;
public:
Hull2D(void);
Hull2D(const Vec2Ptr vertices, uint count);
Hull2D(const Vec3Ptr vertices, uint count);
~Hull2D(void);
/// Builds the... | 25.627119 | 77 | 0.742063 | andraantariksa |
32d6c9fe109f8499a3ac3e150d6766a1336f79e6 | 1,256 | cpp | C++ | NbrhdNash/Scenes/scene_GameOver.cpp | OlavJDigranes/groupD | 1d1fdd4ec0117162d777d0c020cbf4ae1718cf5f | [
"MIT"
] | null | null | null | NbrhdNash/Scenes/scene_GameOver.cpp | OlavJDigranes/groupD | 1d1fdd4ec0117162d777d0c020cbf4ae1718cf5f | [
"MIT"
] | null | null | null | NbrhdNash/Scenes/scene_GameOver.cpp | OlavJDigranes/groupD | 1d1fdd4ec0117162d777d0c020cbf4ae1718cf5f | [
"MIT"
] | null | null | null | #include <iostream>
#include <thread>
#include "LevelSystem.h"
#include "scene_GameOver.h"
#include "scene_Level1.h"
#include "../lib_ecm/components/cmp_text.h"
#include "../game.h"
#include "SFML/Window.hpp"
#include "SFML/Window/Joystick.hpp"
using namespace std;
using namespace sf;
void GameOver::Load() {
tag = ... | 22.836364 | 94 | 0.710987 | OlavJDigranes |
32d9f30702116a90f8debd4ccd6330e2fdf285bc | 13,540 | cpp | C++ | src/ncorr/Data2D.cpp | relinc/ncorr_cpp | 1c04e78617d9354fbc9a3c07e28ef2bf98474b6f | [
"BSD-3-Clause"
] | null | null | null | src/ncorr/Data2D.cpp | relinc/ncorr_cpp | 1c04e78617d9354fbc9a3c07e28ef2bf98474b6f | [
"BSD-3-Clause"
] | 1 | 2017-11-22T00:08:35.000Z | 2017-11-22T12:42:17.000Z | src/ncorr/Data2D.cpp | relinc/ncorr_cpp | 1c04e78617d9354fbc9a3c07e28ef2bf98474b6f | [
"BSD-3-Clause"
] | 2 | 2019-07-17T07:27:48.000Z | 2020-01-07T06:31:48.000Z | /*
* File: Data2D.cpp
* Author: justin
*
* Created on February 28, 2015, 8:57 PM
*/
#include "Data2D.h"
namespace ncorr {
// Additional constructors ---------------------------------------------------//
Data2D::Data2D(Array2D<double> A, const ROI2D &roi, difference_type scalefactor) :
scalefactor(... | 42.180685 | 196 | 0.579321 | relinc |
32db68550508df24882a8f4e69d9e04483564ae8 | 193 | cpp | C++ | 16-templates-and-generic-programming/16-62.cpp | aafulei/cppp5e | f8d254073866e3025c3a08b919d9bbe3965b6918 | [
"MIT"
] | null | null | null | 16-templates-and-generic-programming/16-62.cpp | aafulei/cppp5e | f8d254073866e3025c3a08b919d9bbe3965b6918 | [
"MIT"
] | null | null | null | 16-templates-and-generic-programming/16-62.cpp | aafulei/cppp5e | f8d254073866e3025c3a08b919d9bbe3965b6918 | [
"MIT"
] | null | null | null | // Exercise 16.62: Define your own version of hash<Sales_data> and define an
// unordered_multiset of Sales_data objects. Put several transactions into the
// container and print its contents.
| 48.25 | 78 | 0.792746 | aafulei |
32dc351944aab16c6866c138c56ef662f56fa005 | 935 | cpp | C++ | extern/llvm/tools/clang/test/SemaCXX/address-of.cpp | chip5441/clReflect | d366cced2fff9aefcfc5ec6a0c97ed6c827263eb | [
"MIT"
] | null | null | null | extern/llvm/tools/clang/test/SemaCXX/address-of.cpp | chip5441/clReflect | d366cced2fff9aefcfc5ec6a0c97ed6c827263eb | [
"MIT"
] | 1 | 2020-02-22T09:59:21.000Z | 2020-02-22T09:59:21.000Z | extern/llvm/tools/clang/test/SemaCXX/address-of.cpp | chip5441/clReflect | d366cced2fff9aefcfc5ec6a0c97ed6c827263eb | [
"MIT"
] | null | null | null | // RUN: %clang_cc1 -fsyntax-only -verify %s
// PR clang/3175
void bar(int*);
class c {
int var;
static int svar;
void foo() {
bar(&var);
bar(&svar);
}
static void wibble() {
bar(&var); // expected-error{{invalid use of member 'var' in static member function}}
bar(&svar); ... | 19.893617 | 129 | 0.608556 | chip5441 |
77f900ea0cbd3fa5929d03bbd8b665a4d75c541f | 5,959 | cpp | C++ | lib/storage/in_memory_storage.cpp | pmqtt/pmq | 49f4b87c6c6dc5adfe7feab4ef3b2b73e0c435fb | [
"Apache-2.0"
] | 2 | 2019-09-08T11:59:05.000Z | 2019-12-04T09:29:43.000Z | lib/storage/in_memory_storage.cpp | pmqtt/pmq | 49f4b87c6c6dc5adfe7feab4ef3b2b73e0c435fb | [
"Apache-2.0"
] | 11 | 2019-06-08T20:13:58.000Z | 2019-12-17T12:03:01.000Z | lib/storage/in_memory_storage.cpp | pmqtt/pmq | 49f4b87c6c6dc5adfe7feab4ef3b2b73e0c435fb | [
"Apache-2.0"
] | 2 | 2019-12-04T08:06:27.000Z | 2021-06-03T21:24:40.000Z | //
// Created by pmqtt on 2019-06-29.
//
#include <algorithm>
#include <lib/storage/in_memory_storage.hpp>
#include <lib/detail/string.hpp>
#include <lib/mqtt/message.hpp>
#include <random>
namespace {
std::random_device dev;
std::mt19937 rng(dev());
std::uniform_int_distribution<std::mt19937::result_type> ... | 34.051429 | 123 | 0.662359 | pmqtt |
77f912987e3d6ae28e7dc7ef45b667a6f0e0ce8b | 1,278 | cpp | C++ | LeetCode/1631_Path_With_Minimum_Effort.cpp | sungmen/Acmicpc_Solve | 0298a6aec84993a4d8767bd2c00490b7201e06a4 | [
"MIT"
] | null | null | null | LeetCode/1631_Path_With_Minimum_Effort.cpp | sungmen/Acmicpc_Solve | 0298a6aec84993a4d8767bd2c00490b7201e06a4 | [
"MIT"
] | null | null | null | LeetCode/1631_Path_With_Minimum_Effort.cpp | sungmen/Acmicpc_Solve | 0298a6aec84993a4d8767bd2c00490b7201e06a4 | [
"MIT"
] | null | null | null | class Solution {
public:
int minimumEffortPath(vector<vector<int>>& heights) {
int MIN = 1e9;
constexpr int pos[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int yLen = heights.size(), xLen = heights[0].size();
vector<vector<int>> dp(yLen, vector<int>(xLen, INT_MAX));
int x= 0,... | 39.9375 | 127 | 0.355243 | sungmen |
77fbdc4b43634e29fd10db24ec0ecc4ad9f82a1d | 72 | cpp | C++ | SCRambl/AutoOperation.cpp | Deji69/SCRambl | cf6eb64272b4126094c77a720c2402ed47822a50 | [
"MIT"
] | 5 | 2015-07-10T18:31:14.000Z | 2021-12-31T18:35:10.000Z | SCRambl/AutoOperation.cpp | Deji69/SCRambl | cf6eb64272b4126094c77a720c2402ed47822a50 | [
"MIT"
] | null | null | null | SCRambl/AutoOperation.cpp | Deji69/SCRambl | cf6eb64272b4126094c77a720c2402ed47822a50 | [
"MIT"
] | 2 | 2015-03-21T20:03:24.000Z | 2021-09-18T02:46:26.000Z | #include "stdafx.h"
#include "AutoOperation.h"
using namespace SCRambl; | 18 | 26 | 0.777778 | Deji69 |
77ffb249731477fc03a1b1070ef129922d35b186 | 13,987 | cc | C++ | tests/system/src/subsystem_tests.cc | xiallc/pixie_sdk | a6cf38b0a0d73a55955f4f906f789ee16eb848d4 | [
"Apache-2.0"
] | 2 | 2021-04-14T13:58:50.000Z | 2021-08-09T19:42:25.000Z | tests/system/src/subsystem_tests.cc | xiallc/pixie_sdk | a6cf38b0a0d73a55955f4f906f789ee16eb848d4 | [
"Apache-2.0"
] | 1 | 2021-08-31T10:32:07.000Z | 2021-09-03T15:03:00.000Z | tests/system/src/subsystem_tests.cc | xiallc/pixie_sdk | a6cf38b0a0d73a55955f4f906f789ee16eb848d4 | [
"Apache-2.0"
] | 1 | 2022-03-25T12:32:52.000Z | 2022-03-25T12:32:52.000Z | /* SPDX-License-Identifier: Apache-2.0 */
/*
* Copyright 2021 XIA LLC, All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICE... | 33.223278 | 121 | 0.514692 | xiallc |
ae03c6442bc05122a457ba2559a07dbe6589544b | 1,603 | cc | C++ | sejf.cc | maaku33/jnp-zadanie3 | d84c93ed5328f03df1c4a5d9389a701091df9882 | [
"MIT"
] | null | null | null | sejf.cc | maaku33/jnp-zadanie3 | d84c93ed5328f03df1c4a5d9389a701091df9882 | [
"MIT"
] | null | null | null | sejf.cc | maaku33/jnp-zadanie3 | d84c93ed5328f03df1c4a5d9389a701091df9882 | [
"MIT"
] | null | null | null | #include "sejf.h"
#include <iostream>
#include <utility>
Sejf::Sejf (const std::string& napis, unsigned liczba)
: zawartosc(napis)
, dostepy(liczba)
, zmanipulowany(false)
, wlamanie(false)
{}
Sejf::Sejf (std::string&& napis, unsigned liczba)
: zawartosc(std::move(napis))
, dostepy(liczba)... | 21.092105 | 54 | 0.588272 | maaku33 |
ae065777706151d545fb3fe7ad598225be100161 | 4,827 | hpp | C++ | spline.hpp | mdimura/SplineApprox | de558dcdf906d0a556e6ec0fa01bc9a039596c89 | [
"MIT"
] | 1 | 2019-03-27T15:30:07.000Z | 2019-03-27T15:30:07.000Z | spline.hpp | mdimura/SplineApprox | de558dcdf906d0a556e6ec0fa01bc9a039596c89 | [
"MIT"
] | null | null | null | spline.hpp | mdimura/SplineApprox | de558dcdf906d0a556e6ec0fa01bc9a039596c89 | [
"MIT"
] | null | null | null | #ifndef SPLINE_H
#define SPLINE_H
//#pragma GCC optimize("O3")
#include "polynomial.hpp"
#include <Eigen/Dense>
template <unsigned Deg> class Spline
{
private:
using MatrixDXf = Eigen::Matrix<float,Deg+1,Eigen::Dynamic>;
using MatrixXDf = Eigen::Matrix<float,Eigen::Dynamic,Deg+1>;
MatrixDXf c;
float xmin, xmax;
... | 24.135 | 93 | 0.654029 | mdimura |
ae0827467f5f3e39a9af5981761d64270a540ebe | 4,601 | cc | C++ | comm/fiu_engine.cc | wahidHarb/rdp-1 | 73a0813d9a08f0aad34b56ba678167e6387b5e74 | [
"Apache-2.0"
] | 112 | 2018-12-05T07:45:42.000Z | 2022-01-24T11:28:11.000Z | comm/fiu_engine.cc | wahidHarb/rdp-1 | 73a0813d9a08f0aad34b56ba678167e6387b5e74 | [
"Apache-2.0"
] | 2 | 2020-02-29T02:34:59.000Z | 2020-05-12T06:34:29.000Z | comm/fiu_engine.cc | wahidHarb/rdp-1 | 73a0813d9a08f0aad34b56ba678167e6387b5e74 | [
"Apache-2.0"
] | 88 | 2018-12-16T07:35:10.000Z | 2022-03-09T17:41:16.000Z | //
//Copyright 2018 vip.com.
//
//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 applicable law or agreed to in writing, sof... | 26.595376 | 117 | 0.656162 | wahidHarb |
ae08db97523b4b60ef1b0541301361cc40e112ee | 2,114 | cpp | C++ | C, C++/Graph Algorithms/Single Source Shortest Path Printing using BFS.cpp | 3NCRY9T3R/HacktoberFest-DSC-ABESEC | 39546903020d7e0298dc5814429a3b32e6a2adf8 | [
"MIT"
] | 30 | 2020-10-26T21:20:01.000Z | 2020-12-12T12:05:06.000Z | C, C++/Graph Algorithms/Single Source Shortest Path Printing using BFS.cpp | parvezaalam786/HacktoberFest-DSC-ABESEC | 7ef51455f143a35fa172eea412a20f1468767138 | [
"MIT"
] | 74 | 2020-10-28T09:40:56.000Z | 2020-11-05T02:58:07.000Z | C, C++/Graph Algorithms/Single Source Shortest Path Printing using BFS.cpp | parvezaalam786/HacktoberFest-DSC-ABESEC | 7ef51455f143a35fa172eea412a20f1468767138 | [
"MIT"
] | 59 | 2020-10-26T20:36:36.000Z | 2021-05-09T14:03:52.000Z | #include<bits/stdc++.h>
using namespace std;
class Graph
{
int V; // Number of nodes in the graph
list<int> *adjList;
public:
Graph(int v)
{
V = v;
adjList = new list<int>[V + 1];
}
void addEdge(int u, int v, bool bidir = true)
{
adjList[u].push_back(v);
if (... | 21.571429 | 66 | 0.376537 | 3NCRY9T3R |
ae0b7717db104999a6dcf04f8819f7f54ba85dc6 | 7,707 | cpp | C++ | examples/file_server/main.cpp | Garcia6l20/g6-web | 6e9a1f9d85f26a977407d4c895f357e5f045efb9 | [
"MIT"
] | 3 | 2021-05-16T11:37:59.000Z | 2022-01-30T13:52:59.000Z | examples/file_server/main.cpp | Garcia6l20/g6-web | 6e9a1f9d85f26a977407d4c895f357e5f045efb9 | [
"MIT"
] | null | null | null | examples/file_server/main.cpp | Garcia6l20/g6-web | 6e9a1f9d85f26a977407d4c895f357e5f045efb9 | [
"MIT"
] | 1 | 2021-11-06T12:36:37.000Z | 2021-11-06T12:36:37.000Z | #include <spdlog/spdlog.h>
#include <g6/http/client.hpp>
#include <g6/http/router.hpp>
#include <g6/http/server.hpp>
#include <g6/io/context.hpp>
#include <unifex/scope_guard.hpp>
#include <unifex/sync_wait.hpp>
#include <unifex/task.hpp>
#include <unifex/when_all.hpp>
#include <ranges>
using namespace g6;
namespac... | 46.709091 | 218 | 0.563124 | Garcia6l20 |
ae0debacb6fdacb8525e411e5229ab720e071c2a | 17,955 | cpp | C++ | src/other/ext/openscenegraph/src/osgUtil/PolytopeIntersector.cpp | lf-/brlcad | f91ea585c1a930a2e97c3f5a8274db8805ebbb46 | [
"BSD-4-Clause",
"BSD-3-Clause"
] | null | null | null | src/other/ext/openscenegraph/src/osgUtil/PolytopeIntersector.cpp | lf-/brlcad | f91ea585c1a930a2e97c3f5a8274db8805ebbb46 | [
"BSD-4-Clause",
"BSD-3-Clause"
] | null | null | null | src/other/ext/openscenegraph/src/osgUtil/PolytopeIntersector.cpp | lf-/brlcad | f91ea585c1a930a2e97c3f5a8274db8805ebbb46 | [
"BSD-4-Clause",
"BSD-3-Clause"
] | null | null | null | /* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield
*
* This library is open source and may be redistributed and/or modified under
* the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or
* (at your option) any later version. The full license is in LICENSE file
* included with this... | 30.535714 | 140 | 0.590142 | lf- |
ae0df01395046443388103c3066066d2a57dd2c5 | 1,981 | hpp | C++ | 3rdparty/libkdtree++_0.7.0/kdtree++/function.hpp | rukletsov/bo | bfece9e8f910b0c8f522733854405bf0a801b0e8 | [
"BSD-2-Clause"
] | 3 | 2016-09-14T03:30:30.000Z | 2021-11-16T10:53:32.000Z | 3rdparty/libkdtree++_0.7.0/kdtree++/function.hpp | rukletsov/bo | bfece9e8f910b0c8f522733854405bf0a801b0e8 | [
"BSD-2-Clause"
] | null | null | null | 3rdparty/libkdtree++_0.7.0/kdtree++/function.hpp | rukletsov/bo | bfece9e8f910b0c8f522733854405bf0a801b0e8 | [
"BSD-2-Clause"
] | null | null | null | /** \file
* Defines the various functors and interfaces used for KDTree.
*
* \author Martin F. Krafft <libkdtree@pobox.madduck.net>
* \author Sylvain Bougerel <sylvain.bougerel.devel@gmail.com>
*/
#ifndef INCLUDE_KDTREE_ACCESSOR_HPP
#define INCLUDE_KDTREE_ACCESSOR_HPP
#include <cstddef>
namespace bo {
templa... | 22.011111 | 80 | 0.675416 | rukletsov |
ae17336b19ef229c2f5605c4a028b52b1c17bd72 | 6,372 | hpp | C++ | external/openglcts/modules/glesext/tessellation_shader/esextcTessellationShaderPoints.hpp | iabernikhin/VK-GL-CTS | a3338eb2ded98b5befda64f9325db0d219095a00 | [
"Apache-2.0"
] | 354 | 2017-01-24T17:12:38.000Z | 2022-03-30T07:40:19.000Z | external/openglcts/modules/glesext/tessellation_shader/esextcTessellationShaderPoints.hpp | iabernikhin/VK-GL-CTS | a3338eb2ded98b5befda64f9325db0d219095a00 | [
"Apache-2.0"
] | 275 | 2017-01-24T20:10:36.000Z | 2022-03-24T16:24:50.000Z | external/openglcts/modules/glesext/tessellation_shader/esextcTessellationShaderPoints.hpp | iabernikhin/VK-GL-CTS | a3338eb2ded98b5befda64f9325db0d219095a00 | [
"Apache-2.0"
] | 190 | 2017-01-24T18:02:04.000Z | 2022-03-27T13:11:23.000Z | #ifndef _ESEXTCTESSELLATIONSHADERPOINTS_HPP
#define _ESEXTCTESSELLATIONSHADERPOINTS_HPP
/*-------------------------------------------------------------------------
* OpenGL Conformance Test Suite
* -----------------------------
*
* Copyright (c) 2014-2016 The Khronos Group Inc.
*
* Licensed under the Apache Licen... | 28.573991 | 113 | 0.70951 | iabernikhin |
ae1770c349431cd096f8cf1257f02d373411ea24 | 8,098 | cpp | C++ | Backends/System/Windows/Libraries/OculusSDK/LibOVRKernel/Src/Util/Util_GL_Blitter.cpp | darmie/Kinc | 29b32fcab7fcf1e6ae1215f59f08f601c993dd9f | [
"Zlib"
] | null | null | null | Backends/System/Windows/Libraries/OculusSDK/LibOVRKernel/Src/Util/Util_GL_Blitter.cpp | darmie/Kinc | 29b32fcab7fcf1e6ae1215f59f08f601c993dd9f | [
"Zlib"
] | null | null | null | Backends/System/Windows/Libraries/OculusSDK/LibOVRKernel/Src/Util/Util_GL_Blitter.cpp | darmie/Kinc | 29b32fcab7fcf1e6ae1215f59f08f601c993dd9f | [
"Zlib"
] | null | null | null | /************************************************************************************
Filename : Util_GL_Blitter.cpp
Content : GL implementation for blitting, supporting scaling & rotation
Created : February 24, 2015
Authors : Reza Nourai
Copyright : Copyright 2014-2016 Oculus VR, LLC All R... | 29.992593 | 99 | 0.709434 | darmie |
ae19aa502a598910a401212d8974069928d643ee | 4,025 | hpp | C++ | SOLVER/src/preloop/se_model/quad/mapping/MappingSpherical.hpp | nicklinyi/AxiSEM-3D | cd11299605cd6b92eb867d4109d2e6a8f15e6b4d | [
"MIT"
] | 8 | 2020-06-05T01:13:20.000Z | 2022-02-24T05:11:50.000Z | SOLVER/src/preloop/se_model/quad/mapping/MappingSpherical.hpp | nicklinyi/AxiSEM-3D | cd11299605cd6b92eb867d4109d2e6a8f15e6b4d | [
"MIT"
] | 24 | 2020-10-21T19:03:38.000Z | 2021-11-17T21:32:02.000Z | SOLVER/src/preloop/se_model/quad/mapping/MappingSpherical.hpp | nicklinyi/AxiSEM-3D | cd11299605cd6b92eb867d4109d2e6a8f15e6b4d | [
"MIT"
] | 5 | 2020-06-21T11:54:22.000Z | 2021-06-23T01:02:39.000Z | //
// MappingSpherical.hpp
// AxiSEM3D
//
// Created by Kuangdai Leng on 3/21/20.
// Copyright © 2020 Kuangdai Leng. All rights reserved.
//
// spherical mapping
#ifndef MappingSpherical_hpp
#define MappingSpherical_hpp
#include "Mapping.hpp"
class MappingSpherical: public Mapping {
public:
// constructor
... | 35.307018 | 78 | 0.514037 | nicklinyi |
ae1aaf28bd46e84573f5fb420c8ef702064a5857 | 2,260 | cpp | C++ | src/main/cpp/disenum/entity_mine_protocolmode.cpp | Updownquark/DISEnumerations | 6b90dd4fb4323d3daf5e1d282078d9c0ffe0545c | [
"BSD-2-Clause"
] | 1 | 2022-03-04T16:17:47.000Z | 2022-03-04T16:17:47.000Z | src/main/cpp/disenum/entity_mine_protocolmode.cpp | Updownquark/DISEnumerations | 6b90dd4fb4323d3daf5e1d282078d9c0ffe0545c | [
"BSD-2-Clause"
] | 1 | 2020-03-11T04:12:32.000Z | 2020-03-11T23:55:58.000Z | src/main/cpp/disenum/entity_mine_protocolmode.cpp | Updownquark/DISEnumerations | 6b90dd4fb4323d3daf5e1d282078d9c0ffe0545c | [
"BSD-2-Clause"
] | 2 | 2021-11-04T20:35:56.000Z | 2022-01-10T07:57:53.000Z | #include <sstream>
#include <cstddef>
#include <disenum/entity_mine_protocolmode.h>
namespace DIS {
namespace entity_mine_protocolmode {
bitmask& bitmask::operator=(const unsigned char& i) {
(*this) = *( reinterpret_cast<bitmask *> (const_cast<unsigned char*>(&i))) ;
return (*this);
}
bitmask::bitmask(... | 23.789474 | 84 | 0.682743 | Updownquark |
ae1ed36c0059f7a8cc530a23594460647283b8a1 | 1,023 | hpp | C++ | dep/myvk/PipelineLayout.hpp | lilesper/SparseVoxelOctree | 9c4c79ab746758d21070bb733dafe4f78438e4b5 | [
"MIT"
] | 338 | 2019-08-02T03:57:05.000Z | 2022-03-29T20:49:21.000Z | dep/myvk/PipelineLayout.hpp | lilesper/SparseVoxelOctree | 9c4c79ab746758d21070bb733dafe4f78438e4b5 | [
"MIT"
] | 12 | 2020-01-10T09:03:22.000Z | 2022-03-25T02:03:23.000Z | dep/myvk/PipelineLayout.hpp | lilesper/SparseVoxelOctree | 9c4c79ab746758d21070bb733dafe4f78438e4b5 | [
"MIT"
] | 36 | 2019-08-08T11:15:23.000Z | 2022-02-26T00:31:13.000Z | #ifndef MYVK_PIPELINE_LAYOUT_HPP
#define MYVK_PIPELINE_LAYOUT_HPP
#include "DescriptorSetLayout.hpp"
#include "DeviceObjectBase.hpp"
#include <volk.h>
#include <memory>
#include <vector>
namespace myvk {
class PipelineLayout : public DeviceObjectBase {
private:
std::shared_ptr<Device> m_device_ptr;
std::vector<st... | 26.230769 | 88 | 0.783969 | lilesper |
ae201a5db5718886712d2d359bd10a1203b9fded | 1,193 | cpp | C++ | Data Structure/Stack/Stack Using Linked List/SolutionByKuljeet.cpp | Mdanish777/Programmers-Community | b5ca9582fc1cd4337baa7077ff62130a1052583f | [
"MIT"
] | 261 | 2019-09-30T19:47:29.000Z | 2022-03-29T18:20:07.000Z | Data Structure/Stack/Stack Using Linked List/SolutionByKuljeet.cpp | Mdanish777/Programmers-Community | b5ca9582fc1cd4337baa7077ff62130a1052583f | [
"MIT"
] | 647 | 2019-10-01T16:51:29.000Z | 2021-12-16T20:39:44.000Z | Data Structure/Stack/Stack Using Linked List/SolutionByKuljeet.cpp | Mdanish777/Programmers-Community | b5ca9582fc1cd4337baa7077ff62130a1052583f | [
"MIT"
] | 383 | 2019-09-30T19:32:07.000Z | 2022-03-24T16:18:26.000Z | #include <algorithm>
#include <iostream>
using namespace std;
struct Node {
int data;
Node* next;
Node(int x)
{
data = x;
next = NULL;
}
};
Node* push(Node* head, int x)
{
Node* new_node = new Node(x);
new_node->next = head;
head = new_node;
return head;
}
Node*... | 15.697368 | 58 | 0.435038 | Mdanish777 |
ae20672553d21f207de6a05069c8d47071eb504e | 2,467 | cpp | C++ | pixmap_art.cpp | gulesh/pixmap-ops | 573afdd349d7e4913d7dbc60f0b9d3edd33b39ca | [
"MIT"
] | null | null | null | pixmap_art.cpp | gulesh/pixmap-ops | 573afdd349d7e4913d7dbc60f0b9d3edd33b39ca | [
"MIT"
] | null | null | null | pixmap_art.cpp | gulesh/pixmap-ops | 573afdd349d7e4913d7dbc60f0b9d3edd33b39ca | [
"MIT"
] | null | null | null | #include <iostream>
#include "ppm_image.h"
#include <string>
#include <fstream>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace agl;
using namespace std;
int main(int argc, char** argv)
{
ppm_image image;
image.load("../images/imagePart5.ppm");
image.save("imagePart5.ppm"); // s... | 32.038961 | 84 | 0.717471 | gulesh |
ae2213166f4c876c2494f5dffc276b8deb45929d | 361 | hpp | C++ | src/behavior/stochasticgames/madynamicprogramming/SG_backup_operator.hpp | MarkieMark/fastrl | e4f0b9b60a7ecb6f13bbb79936ea82acb8adae0e | [
"Apache-2.0"
] | 4 | 2019-04-19T00:11:36.000Z | 2020-04-08T09:50:37.000Z | src/behavior/stochasticgames/madynamicprogramming/SG_backup_operator.hpp | MarkieMark/fastrl | e4f0b9b60a7ecb6f13bbb79936ea82acb8adae0e | [
"Apache-2.0"
] | null | null | null | src/behavior/stochasticgames/madynamicprogramming/SG_backup_operator.hpp | MarkieMark/fastrl | e4f0b9b60a7ecb6f13bbb79936ea82acb8adae0e | [
"Apache-2.0"
] | null | null | null |
/*
* Mark Benjamin 6th March 2019
* Copyright (c) 2019 Mark Benjamin
*/
#ifndef FASTRL_BEHAVIOR_STOCHASTICGAMES_MADYNAMICPROGRAMMING_SG_BACKUP_OPERATOR_HPP
#define FASTRL_BEHAVIOR_STOCHASTICGAMES_MADYNAMICPROGRAMMING_SG_BACKUP_OPERATOR_HPP
class SGBackupOperator {
};
#endif //FASTRL_BEHAVIOR_STOCHASTICGAMES_MAD... | 24.066667 | 84 | 0.867036 | MarkieMark |
ae237892645f7ca753016186578e3bc2d04e9410 | 1,333 | cpp | C++ | algorithm/homework/d.cpp | hiyouga/CPP-Learning | e05324bc73ae91a09d51145ecd21af78487405f2 | [
"MIT"
] | null | null | null | algorithm/homework/d.cpp | hiyouga/CPP-Learning | e05324bc73ae91a09d51145ecd21af78487405f2 | [
"MIT"
] | null | null | null | algorithm/homework/d.cpp | hiyouga/CPP-Learning | e05324bc73ae91a09d51145ecd21af78487405f2 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstring>
#include <set>
using namespace std;
int main()
{
int n;
string glt, raw;
cin >> glt >> raw >> n;
set<char> goods;
bool has = (raw.find('*') != string::npos) ? true : false;
for(int i = 0; i < glt.length(); i++){
goods.insert(glt[i]);
}
/*for(set<char>::iterator ite = g... | 19.318841 | 81 | 0.466617 | hiyouga |
ae239224c2b72cf1a6662221efad040feac555f6 | 881 | cpp | C++ | leetcode/prevPermOpt1.cpp | jcpince/algorithms | c43dd8e98a0f0df691ead5f25c2c17a9241db908 | [
"MIT"
] | null | null | null | leetcode/prevPermOpt1.cpp | jcpince/algorithms | c43dd8e98a0f0df691ead5f25c2c17a9241db908 | [
"MIT"
] | null | null | null | leetcode/prevPermOpt1.cpp | jcpince/algorithms | c43dd8e98a0f0df691ead5f25c2c17a9241db908 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<int> prevPermOpt1(vector<int>& A) {
if (A.size() == 0) return A;
int minleft = A.back(), leftidx = A.size()-1;
for (int idx = A.size()-2 ; idx >= 0 ; idx--) {
if (A[idx] > minleft) {
// find the left index
for (int ... | 29.366667 | 67 | 0.347333 | jcpince |
ae27dd19824a12b5c45f441b3024c297d3d02262 | 502 | cpp | C++ | solutions/AtCoder/cpsco2019_s2/B.cpp | yumeno-ukihashi/competitive-programming | 5cc3a7938b62133d8dc71a179cb11dfe985315d3 | [
"Unlicense"
] | null | null | null | solutions/AtCoder/cpsco2019_s2/B.cpp | yumeno-ukihashi/competitive-programming | 5cc3a7938b62133d8dc71a179cb11dfe985315d3 | [
"Unlicense"
] | null | null | null | solutions/AtCoder/cpsco2019_s2/B.cpp | yumeno-ukihashi/competitive-programming | 5cc3a7938b62133d8dc71a179cb11dfe985315d3 | [
"Unlicense"
] | null | null | null | #include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define MSET(x,y) memset(x,y,sizeof(x))
#define M 1005
using namespace std;
int n,in[M];
char c[M];
int main()
{
char buf[3];
while (~scanf("%d",&n)) {
REP(i,1,n) {
scanf("%s %d",buf,&in[i]);
c[i] = buf[0];
... | 19.307692 | 57 | 0.438247 | yumeno-ukihashi |
ae2a14e49f45f1fc5456da010e3fa29dab9904a6 | 4,519 | hh | C++ | src/include/JsonItem.hh | websurfer5/json-schema-enforcer | 99211a602b1c8177d9f9e67cd7773015f74a4080 | [
"Apache-2.0"
] | null | null | null | src/include/JsonItem.hh | websurfer5/json-schema-enforcer | 99211a602b1c8177d9f9e67cd7773015f74a4080 | [
"Apache-2.0"
] | null | null | null | src/include/JsonItem.hh | websurfer5/json-schema-enforcer | 99211a602b1c8177d9f9e67cd7773015f74a4080 | [
"Apache-2.0"
] | null | null | null | // JsonItem.hh
//
// Copyright 2018 Jeffrey Kintscher <websurfer@surf2c.net>
//
// 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... | 32.278571 | 101 | 0.571808 | websurfer5 |
ae2dfd8610a109ac5a235c42d2877ac6ffa51e56 | 2,078 | cc | C++ | tests/test_cobs_random.cc | oliverlee/phobos | eba4adcca8f9f6afb060904b056596f383b52d8d | [
"BSD-2-Clause"
] | 2 | 2016-12-14T01:21:34.000Z | 2018-09-04T10:43:10.000Z | tests/test_cobs_random.cc | oliverlee/phobos | eba4adcca8f9f6afb060904b056596f383b52d8d | [
"BSD-2-Clause"
] | 182 | 2016-04-25T13:36:52.000Z | 2020-07-20T10:24:18.000Z | tests/test_cobs_random.cc | oliverlee/phobos | eba4adcca8f9f6afb060904b056596f383b52d8d | [
"BSD-2-Clause"
] | 6 | 2016-04-25T13:20:53.000Z | 2021-02-18T18:25:32.000Z | #include "cobs.h"
#include "test_cobs_util.h"
#include "gtest/gtest.h"
#include <random>
#include <vector>
class CobsRandomDataTest: public ::testing::TestWithParam<size_t> {
public:
using value_type = uint8_t;
std::vector<value_type> b1;
std::vector<value_type> b2;
std::vector<valu... | 30.115942 | 100 | 0.658325 | oliverlee |
ae2fe37caeafd9619d0202873f643d4a2331fcff | 34,977 | inl | C++ | nTA/Source/std_Rect.inl | loganjones/nTA-Total-Annihilation-Clone | d7d0e4d33f1d452d17cf2fed2b2bcb7f6d7d4d14 | [
"MIT"
] | 2 | 2020-05-09T20:50:12.000Z | 2021-06-20T08:34:58.000Z | nTA/Source/std_Rect.inl | loganjones/nTA-Total-Annihilation-Clone | d7d0e4d33f1d452d17cf2fed2b2bcb7f6d7d4d14 | [
"MIT"
] | null | null | null | nTA/Source/std_Rect.inl | loganjones/nTA-Total-Annihilation-Clone | d7d0e4d33f1d452d17cf2fed2b2bcb7f6d7d4d14 | [
"MIT"
] | 2 | 2018-01-08T00:12:04.000Z | 2020-06-14T10:56:50.000Z | // std_Rect.inl // \author Logan Jones
///////////////// \date 10/3/2001
/// \file
/// \brief ...
/////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
// ... | 34.090643 | 106 | 0.305029 | loganjones |
ae34fe188210b8b2951d1aa684b082a4c440e5f0 | 2,533 | cpp | C++ | src/View.cpp | Djamel-Ali/card-games-framework | 8fc529b3a565dab7da2437e11d82236c0d6ccdc9 | [
"MIT"
] | null | null | null | src/View.cpp | Djamel-Ali/card-games-framework | 8fc529b3a565dab7da2437e11d82236c0d6ccdc9 | [
"MIT"
] | null | null | null | src/View.cpp | Djamel-Ali/card-games-framework | 8fc529b3a565dab7da2437e11d82236c0d6ccdc9 | [
"MIT"
] | null | null | null | #include "View.hpp"
#include <limits>
View::View()
{
}
View::~View() {
delete game;
}
int View::rejouer() {
int choice;
cout << "\n----------------------------------" << endl;
cout << "LA PARTIE EST TERMINÉE" << endl;
cout << "\n----------------------------------\n" << endl;
... | 21.649573 | 81 | 0.439005 | Djamel-Ali |
ae35d23dda31f644acc079b26ef663dea8b85ae8 | 8,530 | cpp | C++ | src/client/moduleprocessor.cpp | ivanmurashko/kalinka | 58a3f774c414dfc408aa06f560dde455c2271c6b | [
"MIT"
] | null | null | null | src/client/moduleprocessor.cpp | ivanmurashko/kalinka | 58a3f774c414dfc408aa06f560dde455c2271c6b | [
"MIT"
] | null | null | null | src/client/moduleprocessor.cpp | ivanmurashko/kalinka | 58a3f774c414dfc408aa06f560dde455c2271c6b | [
"MIT"
] | null | null | null | /**
@file moduleprocessor.cpp
@brief This file is part of Kalinka mediaserver.
@author Ivan Murashko <ivan.murashko@gmail.com>
Copyright (c) 2007-2012 Kalinka Team
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
... | 30.464286 | 83 | 0.602462 | ivanmurashko |
ae3a275095d7783b4c468c2fe502df0af89beba5 | 9,614 | cxx | C++ | libs/preprocessor/test/array.cxx | ballisticwhisper/boost | f72119ab640b564c4b983bd457457046b52af9ee | [
"BSL-1.0"
] | 2 | 2015-01-02T14:24:56.000Z | 2015-01-02T14:25:17.000Z | libs/preprocessor/test/array.cxx | ballisticwhisper/boost | f72119ab640b564c4b983bd457457046b52af9ee | [
"BSL-1.0"
] | 2 | 2019-01-13T23:45:51.000Z | 2019-02-03T08:13:26.000Z | libs/preprocessor/test/array.cxx | ballisticwhisper/boost | f72119ab640b564c4b983bd457457046b52af9ee | [
"BSL-1.0"
] | 1 | 2016-05-29T13:41:15.000Z | 2016-05-29T13:41:15.000Z | # /* **************************************************************************
# * *
# * (C) Copyright Paul Mensonides 2002.
# * Distributed under the Boost Software License, Version 1.0. (See
# * accompanying file LICENSE_1_0.txt... | 60.0875 | 322 | 0.670481 | ballisticwhisper |
ae3c1965221e7fa96d5c6255e0e4e3bfd33ab1fe | 2,081 | inl | C++ | include/as/as-mat4.inl | pr0g/as | 5698ded06abca884385b9deebe8a2e702e8a66a8 | [
"MIT"
] | 6 | 2019-06-16T22:20:55.000Z | 2021-11-13T17:16:16.000Z | include/as/as-mat4.inl | pr0g/as | 5698ded06abca884385b9deebe8a2e702e8a66a8 | [
"MIT"
] | null | null | null | include/as/as-mat4.inl | pr0g/as | 5698ded06abca884385b9deebe8a2e702e8a66a8 | [
"MIT"
] | 1 | 2020-04-11T14:24:13.000Z | 2020-04-11T14:24:13.000Z | namespace as
{
template<typename T>
AS_API constexpr index mat<T, 4>::dim()
{
return 4;
}
template<typename T>
AS_API constexpr index mat<T, 4>::size()
{
return 16;
}
template<typename T>
AS_API constexpr index mat<T, 4>::rows()
{
return mat<T, 4>::dim();
}
template<typename T>
AS_API constexpr index mat<T, 4... | 20.81 | 75 | 0.597309 | pr0g |
ae3d14712a0fe1d1e8d376c5771897b456ca0d8f | 1,443 | cpp | C++ | src/Hazel/Core/Engine.cpp | TroyNeubauer/hazel | f2c1993048e6e12ab0a44a533343c9da54004233 | [
"Apache-2.0"
] | 1 | 2019-10-21T20:50:07.000Z | 2019-10-21T20:50:07.000Z | src/Hazel/Core/Engine.cpp | TroyNeubauer/hazel | f2c1993048e6e12ab0a44a533343c9da54004233 | [
"Apache-2.0"
] | null | null | null | src/Hazel/Core/Engine.cpp | TroyNeubauer/hazel | f2c1993048e6e12ab0a44a533343c9da54004233 | [
"Apache-2.0"
] | null | null | null | #include "hzpch.h"
#include <FreeImage.h>
#include "Engine.h"
#include "Hazel/Core/Log.h"
#include "Hazel/Context/ContextManager.h"
#include "Hazel/Audio/AudioManager.h"
namespace Hazel {
static float m_DeltaTime = 1.0f / 60.0f;
static float m_LastTime = -1.0f;
static bool staticInitComplete = false, initDone =... | 15.684783 | 58 | 0.666667 | TroyNeubauer |
ae41065bb2735a873f387b7d608633f80d6a70a9 | 1,854 | hpp | C++ | Contrib-Intel/RSD-PSME-RMM/common/ipmi/include/ipmi/command/generic/warm_reset.hpp | opencomputeproject/Rack-Manager | e1a61d3eeeba0ff655fe9c1301e8b510d9b2122a | [
"MIT"
] | 5 | 2019-11-11T07:57:26.000Z | 2022-03-28T08:26:53.000Z | Contrib-Intel/RSD-PSME-RMM/common/ipmi/include/ipmi/command/generic/warm_reset.hpp | opencomputeproject/Rack-Manager | e1a61d3eeeba0ff655fe9c1301e8b510d9b2122a | [
"MIT"
] | 3 | 2019-09-05T21:47:07.000Z | 2019-09-17T18:10:45.000Z | Contrib-Intel/RSD-PSME-RMM/common/ipmi/include/ipmi/command/generic/warm_reset.hpp | opencomputeproject/Rack-Manager | e1a61d3eeeba0ff655fe9c1301e8b510d9b2122a | [
"MIT"
] | 11 | 2019-07-20T00:16:32.000Z | 2022-01-11T14:17:48.000Z | /*!
* @brief WarmReset command interface.
*
* @copyright Copyright (c) 2017-2019 Intel Corporation.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at http://www.apache.org/licenses/LICEN... | 18.356436 | 86 | 0.668285 | opencomputeproject |
ae43870a4b7d9e60b7937bebb98b0d4be22ebcd2 | 166 | cpp | C++ | test/chapter_03_strings_and_regular_expressions/url.cpp | rturrado/TheModernCppChallenge | 648284fb417b6aaa43c21ea2b12a5a21c8cb9269 | [
"MIT"
] | null | null | null | test/chapter_03_strings_and_regular_expressions/url.cpp | rturrado/TheModernCppChallenge | 648284fb417b6aaa43c21ea2b12a5a21c8cb9269 | [
"MIT"
] | null | null | null | test/chapter_03_strings_and_regular_expressions/url.cpp | rturrado/TheModernCppChallenge | 648284fb417b6aaa43c21ea2b12a5a21c8cb9269 | [
"MIT"
] | null | null | null | #include "chapter_03_strings_and_regular_expressions/url.h"
#include <gmock/gmock.h>
#include <gtest/gtest.h>
#include <sstream> // istringstream, ostringstream
| 18.444444 | 59 | 0.777108 | rturrado |
ae44c2e864673aa663e746d75050a8a0a7c7c263 | 2,227 | cpp | C++ | rev/tools/const_string.cpp | Roman-Skabin/REV | adfa0a742525784d66f98ff5b0d157343e5f1cf4 | [
"BSD-4-Clause"
] | 2 | 2020-12-12T20:37:32.000Z | 2022-01-06T22:20:30.000Z | rev/tools/const_string.cpp | Roman-Skabin/REV | adfa0a742525784d66f98ff5b0d157343e5f1cf4 | [
"BSD-4-Clause"
] | 2 | 2020-02-22T21:27:59.000Z | 2020-11-27T23:43:01.000Z | engine/tools/const_string.cpp | Roman-Skabin/cengine | 12c99a571246d3a7325d1d6a97e98d3c2c912bcb | [
"BSD-4-Clause"
] | null | null | null | // Copyright (c) 2020-2021, Roman-Skabin
// All rights reserved.
//
// This source code is licensed under the BSD-style license found in the
// LICENSE.md file in the root directory of this source tree.
#include "core/pch.h"
#include "tools/const_string.h"
#include "tools/string.h"
namespace REV
{
ConstString Cons... | 21.209524 | 125 | 0.572968 | Roman-Skabin |
ae49d6cd2ce1ee2ec470cf3174beac59627a9ab8 | 2,401 | cpp | C++ | node-llvm/loadinst.cpp | carlosalberto/echo-js | 1d92b782cf0465321635242138a1d8c902b5ebb2 | [
"MIT"
] | null | null | null | node-llvm/loadinst.cpp | carlosalberto/echo-js | 1d92b782cf0465321635242138a1d8c902b5ebb2 | [
"MIT"
] | null | null | null | node-llvm/loadinst.cpp | carlosalberto/echo-js | 1d92b782cf0465321635242138a1d8c902b5ebb2 | [
"MIT"
] | null | null | null | #include "node-llvm.h"
#include "type.h"
#include "value.h"
#include "basicblock.h"
#include "instruction.h"
#include "loadinst.h"
using namespace node;
using namespace v8;
namespace jsllvm {
void LoadInst::Init(Handle<Object> target)
{
HandleScope scope;
Local<FunctionTemplate> t = FunctionTemplate::Ne... | 24.252525 | 76 | 0.682632 | carlosalberto |
ae51cb024404c0b50b45bdb8fe0b32a15be78c02 | 11,783 | cpp | C++ | sdk/sdk/share/opencv/cxcore/src/cxswitcher.cpp | doyaGu/C0501Q_HWJL01 | 07a71328bd9038453cbb1cf9c276a3dd1e416d63 | [
"MIT"
] | 1 | 2021-10-09T08:05:50.000Z | 2021-10-09T08:05:50.000Z | sdk/sdk/share/opencv/cxcore/src/cxswitcher.cpp | doyaGu/C0501Q_HWJL01 | 07a71328bd9038453cbb1cf9c276a3dd1e416d63 | [
"MIT"
] | null | null | null | sdk/sdk/share/opencv/cxcore/src/cxswitcher.cpp | doyaGu/C0501Q_HWJL01 | 07a71328bd9038453cbb1cf9c276a3dd1e416d63 | [
"MIT"
] | null | null | null | /*M///////////////////////////////////////////////////////////////////////////////////////
//
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
// By downloading, copying, installing or using the software you agree to this license.
// If you do not agree to this license, do not download, instal... | 28.054762 | 101 | 0.588051 | doyaGu |
ae565493c82dcf171038ae864da5221c651b740e | 18,794 | cpp | C++ | i8086sim/KExec_Arithm.cpp | koutheir/i8086sim | c47fe1ad1cfe8121a7cd6c66f673097c283d2af6 | [
"BSD-3-Clause"
] | 3 | 2018-08-25T00:03:42.000Z | 2020-01-06T12:37:04.000Z | i8086sim/KExec_Arithm.cpp | koutheir/i8086sim | c47fe1ad1cfe8121a7cd6c66f673097c283d2af6 | [
"BSD-3-Clause"
] | null | null | null | i8086sim/KExec_Arithm.cpp | koutheir/i8086sim | c47fe1ad1cfe8121a7cd6c66f673097c283d2af6 | [
"BSD-3-Clause"
] | null | null | null |
#include "i8086sim.h"
/*
Bit set: 11 10 9 8 7 6 5 4 3 2 1 0
[OF] [DF] [IF] [TF] [SF] [ZF] [0] [AF] [0] [PF] [1] [CF]
*/
bool K8086VM::Execute_ADD_ADC_INC(K8086VM *VM, KInstructionID &II)
{
char mod, mem_reg_code, reg_code;
byte DispSize=0;
byte *REG, *EA, c;
us... | 24.187902 | 107 | 0.554166 | koutheir |
ae5a9c3dd3c3b13e66de9d54513e8a8e506d69d4 | 19,008 | cpp | C++ | src/mediasystem/util/StateMachine.cpp | m1keall1son/ofxMediaSystem | c4b1619111b43996aabcb5c123af90824f8eee63 | [
"MIT"
] | 6 | 2018-06-15T11:50:38.000Z | 2018-09-13T19:44:12.000Z | src/mediasystem/util/StateMachine.cpp | m1keall1son/ofxMediaSystem | c4b1619111b43996aabcb5c123af90824f8eee63 | [
"MIT"
] | null | null | null | src/mediasystem/util/StateMachine.cpp | m1keall1son/ofxMediaSystem | c4b1619111b43996aabcb5c123af90824f8eee63 | [
"MIT"
] | 1 | 2018-06-28T16:39:17.000Z | 2018-06-28T16:39:17.000Z | //
// StateMachine.c
// Aerialtronics
//
// Created by Michael Allison on 8/16/18.
//
#include "StateMachine.h"
#include "ofMain.h"
namespace mediasystem {
StateMachine::Transition::Transition(float dur):
duration(dur)
{}
void StateMachine::addState(State&& state)
{
auto name = st... | 41.321739 | 138 | 0.373264 | m1keall1son |
ae5d5dafb6faf03dbd226a01d524543818e70295 | 1,706 | cpp | C++ | Leetcode/Dynamic Programming/burst-balloons.cpp | susantabiswas/competitive_coding | 49163ecdc81b68f5c1bd90988cc0dfac34ad5a31 | [
"MIT"
] | 2 | 2021-04-29T14:44:17.000Z | 2021-10-01T17:33:22.000Z | Leetcode/Dynamic Programming/burst-balloons.cpp | adibyte95/competitive_coding | a6f084d71644606c21840875bad78d99f678a89d | [
"MIT"
] | null | null | null | Leetcode/Dynamic Programming/burst-balloons.cpp | adibyte95/competitive_coding | a6f084d71644606c21840875bad78d99f678a89d | [
"MIT"
] | 1 | 2021-10-01T17:33:29.000Z | 2021-10-01T17:33:29.000Z | /*
https://leetcode.com/problems/burst-balloons/
*/
class Solution {
public:
// iterative DP bottom up solution
int maxCoinsTabular(vector<int>& nums) {
if(nums.empty())
return 0;
const int N = nums.size();
// since nums[-1] = nums[N] = 1, pad the original nums
... | 39.674419 | 104 | 0.512896 | susantabiswas |
ae650cfb00cee9183ce44d215c9be8c5dafd16ac | 706 | cpp | C++ | ver1/answers/lp-07-53.cpp | aafulei/cppp5e | f8d254073866e3025c3a08b919d9bbe3965b6918 | [
"MIT"
] | null | null | null | ver1/answers/lp-07-53.cpp | aafulei/cppp5e | f8d254073866e3025c3a08b919d9bbe3965b6918 | [
"MIT"
] | null | null | null | ver1/answers/lp-07-53.cpp | aafulei/cppp5e | f8d254073866e3025c3a08b919d9bbe3965b6918 | [
"MIT"
] | null | null | null | // 18/02/11 = Sun
// Exercise 7.53: Define your own version of Debug.
#include <iostream>
using std::cerr;
using std::endl;
class Debug
{
bool hw; // hardware errors other than IO errors
bool io; // IO errors
bool ot; // others
public:
constexpr Debug(bool b = true) : hw(b), io(b), ot(b) {}
constexpr Debug(boo... | 22.0625 | 65 | 0.620397 | aafulei |
ae665d6d2e2ab7f195bac311ed45da4c7523a6cb | 19,785 | cpp | C++ | code_reading/oceanbase-master/src/storage/ob_sstable_multi_version_row_iterator.cpp | wangcy6/weekly_read | 3a8837ee9cd957787ee1785e4066dd623e02e13a | [
"Apache-2.0"
] | null | null | null | code_reading/oceanbase-master/src/storage/ob_sstable_multi_version_row_iterator.cpp | wangcy6/weekly_read | 3a8837ee9cd957787ee1785e4066dd623e02e13a | [
"Apache-2.0"
] | null | null | null | code_reading/oceanbase-master/src/storage/ob_sstable_multi_version_row_iterator.cpp | wangcy6/weekly_read | 3a8837ee9cd957787ee1785e4066dd623e02e13a | [
"Apache-2.0"
] | 1 | 2020-10-18T12:59:31.000Z | 2020-10-18T12:59:31.000Z | /**
* Copyright (c) 2021 OceanBase
* OceanBase CE is licensed under Mulan PubL v2.
* You can use this software according to the terms and conditions of the Mulan PubL v2.
* You may obtain a copy of Mulan PubL v2 at:
* http://license.coscl.org.cn/MulanPubL-2.0
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BAS... | 34.468641 | 119 | 0.677837 | wangcy6 |
ae6c22913deb9e610762e0a680a819fe7e878c3c | 655 | cpp | C++ | doubling/abc167_d2.cpp | Takumi1122/data-structure-algorithm | 6b9f26e4dbba981f034518a972ecfc698b86d837 | [
"MIT"
] | null | null | null | doubling/abc167_d2.cpp | Takumi1122/data-structure-algorithm | 6b9f26e4dbba981f034518a972ecfc698b86d837 | [
"MIT"
] | null | null | null | doubling/abc167_d2.cpp | Takumi1122/data-structure-algorithm | 6b9f26e4dbba981f034518a972ecfc698b86d837 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// ダブリング
/*
参考リンク
ABC 167 D - Teleporter
https://atcoder.jp/contests/abc167/tasks/abc167_d
*/
const int D = 60;
const int MAX_N = 200005;
int to[D][MAX_N];
int ... | 15.595238 | 61 | 0.465649 | Takumi1122 |
ae75423b900441c706cc573847eb2729288ffdd2 | 9,561 | cpp | C++ | Lib/src/PropertyExtractor/SelfEnergy.cpp | undisputed-seraphim/TBTK | 45a0875a11da951f900b6fd5e0773ccdf8462915 | [
"Apache-2.0"
] | 96 | 2016-04-21T16:46:56.000Z | 2022-01-15T21:40:25.000Z | Lib/src/PropertyExtractor/SelfEnergy.cpp | undisputed-seraphim/TBTK | 45a0875a11da951f900b6fd5e0773ccdf8462915 | [
"Apache-2.0"
] | 4 | 2016-10-19T16:56:20.000Z | 2020-04-14T01:31:40.000Z | Lib/src/PropertyExtractor/SelfEnergy.cpp | undisputed-seraphim/TBTK | 45a0875a11da951f900b6fd5e0773ccdf8462915 | [
"Apache-2.0"
] | 19 | 2016-10-19T14:21:58.000Z | 2021-04-15T13:52:09.000Z | /* Copyright 2018 Kristofer Björnson
*
* 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 applicable law or agreed... | 26.781513 | 86 | 0.679322 | undisputed-seraphim |
ae7c1014fe0d193a48a403d10670665db9cf211e | 1,023 | cpp | C++ | Server/Player.cpp | jackv24/NetworkingAIE | bb8ae376f18e4c2cee9681dbe61e0f67180232cf | [
"MIT"
] | null | null | null | Server/Player.cpp | jackv24/NetworkingAIE | bb8ae376f18e4c2cee9681dbe61e0f67180232cf | [
"MIT"
] | null | null | null | Server/Player.cpp | jackv24/NetworkingAIE | bb8ae376f18e4c2cee9681dbe61e0f67180232cf | [
"MIT"
] | null | null | null | #include <iostream>
#include <BitStream.h>
#include "GameMessages.h"
#include "GameConstants.h"
#include "Player.h"
Player::Player()
{
}
Player::~Player()
{
}
void Player::Move(float deltaTime)
{
if (moveDir != 0)
{
yPos += PADDLE_SPEED * moveDir * deltaTime;
if (yPos > STAGE_HEIGHT - PADDLE_HEIGHT)
yPos ... | 21.765957 | 104 | 0.718475 | jackv24 |
ae7c62774f36043f53012cd72b37ec76c33aa925 | 5,150 | cpp | C++ | class/app/widget_editor_color.cpp | TheMarlboroMan/go-fgj6 | fa1cdfcd5ecaf4f0ea25b23890310e76fd2504bd | [
"Beerware"
] | null | null | null | class/app/widget_editor_color.cpp | TheMarlboroMan/go-fgj6 | fa1cdfcd5ecaf4f0ea25b23890310e76fd2504bd | [
"Beerware"
] | null | null | null | class/app/widget_editor_color.cpp | TheMarlboroMan/go-fgj6 | fa1cdfcd5ecaf4f0ea25b23890310e76fd2504bd | [
"Beerware"
] | null | null | null | #include "widget_editor_color.h"
#include "framework_impl/input.h"
#include <def_video.h>
#include "definiciones.h"
#ifdef WINCOMPIL
/* Localización del parche mingw32... Esto debería estar en otro lado, supongo. */
#include <templates/parches_compat.h>
#endif
using namespace App;
Widget_editor_color::Widget_edito... | 26.546392 | 136 | 0.747379 | TheMarlboroMan |
ae7dc61cf9744dde0bb3b192f067edfa692d3c30 | 9,452 | cpp | C++ | lc7hashcat/src/jtrnodeworker.cpp | phixion/l0phtcrack | 48ee2f711134e178dbedbd925640f6b3b663fbb5 | [
"Apache-2.0",
"MIT"
] | 2 | 2021-10-20T00:25:39.000Z | 2021-11-08T12:52:42.000Z | lc7hashcat/src/jtrnodeworker.cpp | Brute-f0rce/l0phtcrack | 25f681c07828e5e68e0dd788d84cc13c154aed3d | [
"Apache-2.0",
"MIT"
] | null | null | null | lc7hashcat/src/jtrnodeworker.cpp | Brute-f0rce/l0phtcrack | 25f681c07828e5e68e0dd788d84cc13c154aed3d | [
"Apache-2.0",
"MIT"
] | 1 | 2022-03-14T06:41:16.000Z | 2022-03-14T06:41:16.000Z | #include"stdafx.h"
#if (PLATFORM == PLATFORM_WIN32) || (PLATFORM == PLATFORM_WIN64)
#include<io.h>
#include<fcntl.h>
#include<crtdbg.h>
#endif
CJTRNodeWorker::CJTRNodeWorker(JTRWORKERCTX *ctx, JTRPASS *pass, int passnode, bool restore, QString potfilename, QString sessionfilename, QString hashesfilename) ... | 22.135831 | 164 | 0.655417 | phixion |