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 109 | 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 48.5k ⌀ | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
fa0916f810206180426544fdf9db4310b2e390a0 | 12,292 | cxx | C++ | xp_comm_proj/rd_shape/shprdpnt.cxx | avs/express-community | c699a68330d3b678b7e6bcea823e0891b874049c | [
"Apache-2.0"
] | 3 | 2020-08-03T08:52:20.000Z | 2021-04-10T11:55:49.000Z | xp_comm_proj/rd_shape/shprdpnt.cxx | avs/express-community | c699a68330d3b678b7e6bcea823e0891b874049c | [
"Apache-2.0"
] | null | null | null | xp_comm_proj/rd_shape/shprdpnt.cxx | avs/express-community | c699a68330d3b678b7e6bcea823e0891b874049c | [
"Apache-2.0"
] | 1 | 2021-06-08T18:16:45.000Z | 2021-06-08T18:16:45.000Z | #include "pnt_gen.h"
#include "gsshape.h"
#include "gsesri.h"
int
ReadShape_ReadShapeMods_ReadShapePoint::ReadShapePoint(OMevent_mask event_mask, int seq_num)
{
// ShapeFileName (OMXstr read req notify)
// FeatureNumber (OMXint read notify)
// Coordinates (OMXdouble_array write)
double *Coordinates_arr;
... | 30.501241 | 92 | 0.537179 | avs |
fa0cc8fd0f23c1f4fa9ba5bd8faf9bdf174fc2fa | 1,205 | cpp | C++ | codebook/code/Matching/Blossom.cpp | NCTU-PCCA/NCTU_Yggdrasill | 4f086c9737502f69044f574514cf191d536aaf22 | [
"MIT"
] | null | null | null | codebook/code/Matching/Blossom.cpp | NCTU-PCCA/NCTU_Yggdrasill | 4f086c9737502f69044f574514cf191d536aaf22 | [
"MIT"
] | null | null | null | codebook/code/Matching/Blossom.cpp | NCTU-PCCA/NCTU_Yggdrasill | 4f086c9737502f69044f574514cf191d536aaf22 | [
"MIT"
] | null | null | null | #define MAXN 505
vector<int>g[MAXN];//用vector存圖
int pa[MAXN],match[MAXN],st[MAXN],S[MAXN],vis[MAXN];
int t,n;
inline int lca(int u,int v){//找花的花托
for(++t;;swap(u,v)){
if(u==0)continue;
if(vis[u]==t)return u;
vis[u]=t;//這種方法可以不用清空vis陣列
u=st[pa[match[u]]];
}
}
#define qpush(u) q.push(u),S[u]=0
inline void fl... | 23.173077 | 52 | 0.559336 | NCTU-PCCA |
fa0d99ae5c5f24a96a0bd0f127c0cedd118144ff | 1,214 | cpp | C++ | Problem201-250/p222_2.cpp | dingqunfei/LeetCode | c74a21ea56ee7b35308d2f387ef24ab29b031e24 | [
"Apache-2.0"
] | null | null | null | Problem201-250/p222_2.cpp | dingqunfei/LeetCode | c74a21ea56ee7b35308d2f387ef24ab29b031e24 | [
"Apache-2.0"
] | null | null | null | Problem201-250/p222_2.cpp | dingqunfei/LeetCode | c74a21ea56ee7b35308d2f387ef24ab29b031e24 | [
"Apache-2.0"
] | null | null | null | /**
* @file p222_2.cpp
* @brief
* @author dingqunfei (dqflying@gmail.com)
* @version 1.0
* @date 2021-04-11
*
* @copyright Copyright (c) 2021 DQFLYING
*
* @par :
*
*
* Date : 2021-04-11
* Version : 1.0
* Author : dqflying
* Lisence :
* Description :
*
*
*
*
*/
/**
... | 19.580645 | 93 | 0.474465 | dingqunfei |
fa0e0437ec04fa419d4d14000c86ed654c7fe6b8 | 1,002 | cpp | C++ | CLASSES/inheritance/practice_question2(absract class).cpp | shauryauppal/Algo-DS-StudyMaterial | 1c481f066d21b33ec2533156e75f45fa9b6a7606 | [
"Apache-2.0"
] | 3 | 2020-12-03T14:52:23.000Z | 2021-12-19T09:26:50.000Z | CLASSES/inheritance/practice_question2(absract class).cpp | shauryauppal/Algo-DS-StudyMaterial | 1c481f066d21b33ec2533156e75f45fa9b6a7606 | [
"Apache-2.0"
] | null | null | null | CLASSES/inheritance/practice_question2(absract class).cpp | shauryauppal/Algo-DS-StudyMaterial | 1c481f066d21b33ec2533156e75f45fa9b6a7606 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <cstdio>
using namespace std;
//give act as a virtual class
class give
{
//protected members
protected:
int width,height;
public:
//pure virtual function used
virtual int getarea()=0;
//use to get data
void getheight()
{
cout<<"\nEn... | 17.892857 | 44 | 0.533932 | shauryauppal |
fa116ab2dba71367016ae32a0d280ef1ceac0c7a | 11,082 | cxx | C++ | src/escape.cxx | jktjkt/replxx | 12f2adee7f9123880db1f870c360a88c1f7ba182 | [
"Apache-2.0"
] | 1 | 2019-06-11T06:49:15.000Z | 2019-06-11T06:49:15.000Z | src/escape.cxx | jktjkt/replxx | 12f2adee7f9123880db1f870c360a88c1f7ba182 | [
"Apache-2.0"
] | null | null | null | src/escape.cxx | jktjkt/replxx | 12f2adee7f9123880db1f870c360a88c1f7ba182 | [
"Apache-2.0"
] | 1 | 2019-06-10T16:48:55.000Z | 2019-06-10T16:48:55.000Z | #include "escape.hxx"
#include "io.hxx"
#include "keycodes.hxx"
#ifndef _WIN32
namespace replxx {
namespace EscapeSequenceProcessing { // move these out of global namespace
// This chunk of code does parsing of the escape sequences sent by various Linux
// terminals.
//
// It handles arrow keys, Home, End and Delet... | 35.748387 | 86 | 0.750135 | jktjkt |
fa145534ed2ca5a09dd724073d7b787b656e1cc4 | 816 | cpp | C++ | Notebook/codes/estruturas/map.cpp | rodrigoAMF7/Notebook---Maratonas | 06b38197a042bfbd27b20f707493e0a19fda7234 | [
"MIT"
] | 4 | 2019-01-25T21:22:55.000Z | 2019-03-20T18:04:01.000Z | Notebook/codes/estruturas/map.cpp | rodrigoAMF/competitive-programming-notebook | 06b38197a042bfbd27b20f707493e0a19fda7234 | [
"MIT"
] | null | null | null | Notebook/codes/estruturas/map.cpp | rodrigoAMF/competitive-programming-notebook | 06b38197a042bfbd27b20f707493e0a19fda7234 | [
"MIT"
] | null | null | null | // Map é uma variação da estrutura set e sua implementação também é feita utilizando Red- Black Trees. A principal diferença entre um set e um map é o segundo armazena os conjuntos chave, valor e o primeiro apenas chave.
map<string, int> M; // Declaração
M.insert(make_pair("Alana", 10)); //Inserimos uma variável do tip... | 74.181818 | 220 | 0.714461 | rodrigoAMF7 |
fa1acb3ec000410176148209f2e3ef08501890b6 | 511 | cpp | C++ | Luogu/P3912.cpp | XenonWZH/involution | 189f6ce2bbfe3a7c5d536bbd769f353e4c06e7c6 | [
"MIT"
] | null | null | null | Luogu/P3912.cpp | XenonWZH/involution | 189f6ce2bbfe3a7c5d536bbd769f353e4c06e7c6 | [
"MIT"
] | null | null | null | Luogu/P3912.cpp | XenonWZH/involution | 189f6ce2bbfe3a7c5d536bbd769f353e4c06e7c6 | [
"MIT"
] | null | null | null | // P3912 素数个数
// WzhDnwzWzh
#include <cstring>
#include <cstdio>
const int MAXN = 100000000;
int main() {
int n;
scanf("%d", &n);
static bool a[MAXN + 1];
memset(a, true, sizeof(a));
for (int i = 2; i * i <= n; i++) {
if (a[i]) {
for (int j = i * i; j <= n; j += i) {
... | 15.484848 | 49 | 0.395303 | XenonWZH |
fa1d427f4907498834b2f85ae3fa22c683432fd1 | 7,916 | cpp | C++ | CodeSnippets/rotateMatrix.cpp | Teabeans/CPP_Learn | a767dd323d67fab5c2baffb5aa6dd3f1e6baa35a | [
"MIT"
] | 1 | 2019-01-31T23:42:59.000Z | 2019-01-31T23:42:59.000Z | CodeSnippets/rotateMatrix.cpp | Teabeans/CPP_Learn | a767dd323d67fab5c2baffb5aa6dd3f1e6baa35a | [
"MIT"
] | null | null | null | CodeSnippets/rotateMatrix.cpp | Teabeans/CPP_Learn | a767dd323d67fab5c2baffb5aa6dd3f1e6baa35a | [
"MIT"
] | 1 | 2020-03-04T18:09:15.000Z | 2020-03-04T18:09:15.000Z | //-----------------------------------------------------------------------------|
// Authorship
//-----------------------------------------------------------------------------|
//
// Tim Lum
// twhlum@gmail.com
// Created: 2018.07.15
// Modified: 2018.08.22
//
/*
1.7 - RotateMatrix() - P.91
Given an image represented ... | 28.681159 | 84 | 0.457302 | Teabeans |
fa2773883101d19fb4a9236d013891fd8d8796f5 | 2,172 | cpp | C++ | src/e101_200/q1414.cpp | extremedeckguru/leetcode | e45923ccbca7ae1c5f85d8c996392e8b492c1306 | [
"MIT"
] | 9 | 2020-04-09T12:37:50.000Z | 2021-04-01T14:01:14.000Z | src/e101_200/q1414.cpp | extremedeckguru/leetcode | e45923ccbca7ae1c5f85d8c996392e8b492c1306 | [
"MIT"
] | 3 | 2020-05-05T02:43:54.000Z | 2020-05-20T11:12:16.000Z | src/e101_200/q1414.cpp | extremedeckguru/leetcode | e45923ccbca7ae1c5f85d8c996392e8b492c1306 | [
"MIT"
] | 5 | 2020-04-17T02:32:10.000Z | 2020-05-20T10:12:26.000Z | /*
#面试刷题# 第0101期
#Leetcode# Q1414 找出和为K的斐波那契数的最小个数
难度：中
给定一个数k，返回其总和等于k的斐波那契数的最小值，一个斐波那契数是否可以多次使用。
斐波那契数的定义为。
F1 = 1
F2 = 1
Fn = Fn-1 + Fn-2 ，对于 n > 2。
可以保证，对于给定的约束，我们总是可以找到这样的斐波那契数和k。
约束条件：
1 <= k <= 10^9
示例1:
Input: k = 7
Output: 2
Explanation: The Fibonacci numbers are: 1, 1, 2, 3, 5, 8, 13, ...
For k = 7 we can ... | 21.939394 | 70 | 0.521179 | extremedeckguru |
fa33c7e062e7c5ed1374704d895628d0627ec2a1 | 2,474 | hpp | C++ | include/rcppmath/clamp.hpp | shumov-ag/rcpputils | a7898d98ab684bb5d0cb2c20c823a1b4014fa0dc | [
"Apache-2.0"
] | 14 | 2019-05-05T06:36:41.000Z | 2022-02-11T06:43:37.000Z | include/rcppmath/clamp.hpp | shumov-ag/rcpputils | a7898d98ab684bb5d0cb2c20c823a1b4014fa0dc | [
"Apache-2.0"
] | 125 | 2019-02-26T18:38:18.000Z | 2022-01-21T20:18:59.000Z | include/rcppmath/clamp.hpp | shumov-ag/rcpputils | a7898d98ab684bb5d0cb2c20c823a1b4014fa0dc | [
"Apache-2.0"
] | 39 | 2019-02-26T18:12:29.000Z | 2022-03-11T15:23:01.000Z | // Copyright 2020 PAL Robotics S.L.
//
// 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 ... | 35.342857 | 98 | 0.710994 | shumov-ag |
fa35dd16f796e2efc6d61495c26e22b135919be9 | 406 | cpp | C++ | src/techniques/lrel.cpp | shibii/nn | 2022ec423c3bfe179997630d6ba705aeaabdd918 | [
"MIT"
] | 1 | 2020-11-17T14:25:28.000Z | 2020-11-17T14:25:28.000Z | src/techniques/lrel.cpp | shibii/nn | 2022ec423c3bfe179997630d6ba705aeaabdd918 | [
"MIT"
] | null | null | null | src/techniques/lrel.cpp | shibii/nn | 2022ec423c3bfe179997630d6ba705aeaabdd918 | [
"MIT"
] | null | null | null | #include "lrel.hpp"
namespace nn {
LReL::LReL(float leak) : leak_(leak) {}
void LReL::forward(Feed &f) {
input_ = f.signal;
f.signal = (input_ > 0.f) * input_ + (input_ <= 0.f) * input_ * leak_;
}
void LReL::backward(Feed &f) {
f.signal = (input_ > 0.f) * f.signal + (input_ <= 0.f) * f.signal * leak_;
}
template... | 25.375 | 76 | 0.618227 | shibii |
fa3601c6cb60c9c0200636a17693bc5d3438e55b | 471 | cpp | C++ | BASIC c++/pointer-and-referencers/pointer1.cpp | jattramesh/Learning_git | 5191ecc6c0c11b69b9786f2a8bdd3db7228987d6 | [
"MIT"
] | null | null | null | BASIC c++/pointer-and-referencers/pointer1.cpp | jattramesh/Learning_git | 5191ecc6c0c11b69b9786f2a8bdd3db7228987d6 | [
"MIT"
] | null | null | null | BASIC c++/pointer-and-referencers/pointer1.cpp | jattramesh/Learning_git | 5191ecc6c0c11b69b9786f2a8bdd3db7228987d6 | [
"MIT"
] | null | null | null | //
// Created by Rahul on 6/5/2019.
//
#include <iostream>
#include<math.h>
using namespace std;
int var,*ptr;
int main()
{
var=100;
ptr=&var;
cout<<"value of var "<<var<<"address of ptr"<<&var<<endl;
cout<<"value pf ptr "<<ptr<<"address od ptr "<<&ptr<<endl;
long a=10,b;
long *ptr;
ptr=&a;... | 17.444444 | 62 | 0.532909 | jattramesh |
fa3685a95830cfa707379fe292adfeb218693d7e | 76,936 | hpp | C++ | snark-logic/libs-source/marshalling/include/nil/marshalling/options.hpp | idealatom/podlodkin-freeton-year-control | 6aa96e855fe065c9a75c76da976a87fe2d1668e6 | [
"MIT"
] | null | null | null | snark-logic/libs-source/marshalling/include/nil/marshalling/options.hpp | idealatom/podlodkin-freeton-year-control | 6aa96e855fe065c9a75c76da976a87fe2d1668e6 | [
"MIT"
] | null | null | null | snark-logic/libs-source/marshalling/include/nil/marshalling/options.hpp | idealatom/podlodkin-freeton-year-control | 6aa96e855fe065c9a75c76da976a87fe2d1668e6 | [
"MIT"
] | 1 | 2021-09-15T20:27:27.000Z | 2021-09-15T20:27:27.000Z | //---------------------------------------------------------------------------//
// Copyright (c) 2017-2021 Mikhail Komarov <nemo@nil.foundation>
// Copyright (c) 2020-2021 Nikita Kaskov <nbering@nil.foundation>
//
// MIT License
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of th... | 56.82127 | 119 | 0.578312 | idealatom |
fa3b963e8bff7662eee819b9d93b379986e5926b | 3,241 | cpp | C++ | tests/utils_test.cpp | louiz/batajelo | 4d8edce8da9d3b17dbad68eb4881d7f6fee2f76e | [
"BSL-1.0",
"BSD-2-Clause",
"Zlib",
"MIT"
] | 7 | 2015-01-28T09:17:08.000Z | 2020-04-21T13:51:16.000Z | tests/utils_test.cpp | louiz/batajelo | 4d8edce8da9d3b17dbad68eb4881d7f6fee2f76e | [
"BSL-1.0",
"BSD-2-Clause",
"Zlib",
"MIT"
] | null | null | null | tests/utils_test.cpp | louiz/batajelo | 4d8edce8da9d3b17dbad68eb4881d7f6fee2f76e | [
"BSL-1.0",
"BSD-2-Clause",
"Zlib",
"MIT"
] | 1 | 2020-07-11T09:20:25.000Z | 2020-07-11T09:20:25.000Z | #include <utils/base64.hpp>
#include <utils/string.hpp>
#include <utils/scopeguard.hpp>
#include <utils/zlib.hpp>
#include <utils/time.hpp>
#include "catch.hpp"
TEST_CASE("Both", "[base64]")
{
std::string hello = "Coucou ici";
CHECK(base64_decode(base64_encode(reinterpret_cast<const unsigned char*>(hello.c_str())... | 24.930769 | 386 | 0.676026 | louiz |
fa3e9a0bc2dd0bcba79d797ef2269824617ff5b6 | 3,440 | cpp | C++ | genome/genome.cpp | nicodex/lianzifu | 67c08abf0636e85512bfc91ac9ebe43dc2255186 | [
"MIT"
] | 2 | 2018-02-01T04:08:48.000Z | 2018-02-03T16:33:38.000Z | genome/genome.cpp | nicodex/lianzifu | 67c08abf0636e85512bfc91ac9ebe43dc2255186 | [
"MIT"
] | 1 | 2018-02-02T12:28:32.000Z | 2018-02-09T13:13:53.000Z | genome/genome.cpp | nicodex/lianzifu | 67c08abf0636e85512bfc91ac9ebe43dc2255186 | [
"MIT"
] | 1 | 2020-05-20T15:52:21.000Z | 2020-05-20T15:52:21.000Z | //
// Copyright (c) 2018 Nico Bendlin <nico@nicode.net>
//
// 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 restriction, including without limitation the rights
// to use, copy, mod... | 20.598802 | 80 | 0.623256 | nicodex |
fa41bd932a3d0556d52ae51a1763aa49055ceffe | 2,106 | cc | C++ | kernel/src/arch/x86_64/hal/task/context.cc | igarfieldi/Danaos64 | f4a2df8de5f214af7a4d18e14790740d2c481c48 | [
"Apache-2.0"
] | 2 | 2017-09-16T19:41:14.000Z | 2017-11-04T10:41:38.000Z | kernel/src/arch/x86_64/hal/task/context.cc | igarfieldi/Danaos64 | f4a2df8de5f214af7a4d18e14790740d2c481c48 | [
"Apache-2.0"
] | null | null | null | kernel/src/arch/x86_64/hal/task/context.cc | igarfieldi/Danaos64 | f4a2df8de5f214af7a4d18e14790740d2c481c48 | [
"Apache-2.0"
] | null | null | null | #include "context.h"
#include "hal/interrupts/gdt.h"
#include "main/task/task.h"
namespace hal {
task_context create_context(volatile uint64_t *stack, task::task &task) {
task_context context(&stack[-21]);
// New state
stack[-21] = reinterpret_cast<uint64_t>(&stack[0]); // RBP... | 55.421053 | 101 | 0.395537 | igarfieldi |
fa425c1f643a874587973399f192364a916e82ae | 139,538 | cxx | C++ | SimModel_Python_API/simmodel_swig/SimModel_Dll_lib/framework/SimFlowPlant_ElectricalGenerator_Photovoltaic.cxx | EnEff-BIM/EnEffBIM-Framework | 6328d39b498dc4065a60b5cc9370b8c2a9a1cddf | [
"MIT"
] | 3 | 2016-05-30T15:12:16.000Z | 2022-03-22T08:11:13.000Z | SimModel_Python_API/simmodel_swig/SimModel_Dll_lib/framework/SimFlowPlant_ElectricalGenerator_Photovoltaic.cxx | EnEff-BIM/EnEffBIM-Framework | 6328d39b498dc4065a60b5cc9370b8c2a9a1cddf | [
"MIT"
] | 21 | 2016-06-13T11:33:45.000Z | 2017-05-23T09:46:52.000Z | SimModel_Python_API/simmodel_swig/SimModel_Dll_lib/framework/SimFlowPlant_ElectricalGenerator_Photovoltaic.cxx | EnEff-BIM/EnEffBIM-Framework | 6328d39b498dc4065a60b5cc9370b8c2a9a1cddf | [
"MIT"
] | null | null | null | // Copyright (c) 2005-2014 Code Synthesis Tools CC
//
// This program was generated by CodeSynthesis XSD, an XML Schema to
// C++ data binding compiler.
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License version 2 as
// published by the Fre... | 43.769762 | 195 | 0.725179 | EnEff-BIM |
fa436636d8dac56b1c2ef14b9a1b811fc6eae866 | 10,898 | hpp | C++ | include/algebra/array/multi_array.hpp | hyperpower/Nablla | 5a9be9f3b064a235572a1a2c9c5c2c19118697c5 | [
"MIT"
] | null | null | null | include/algebra/array/multi_array.hpp | hyperpower/Nablla | 5a9be9f3b064a235572a1a2c9c5c2c19118697c5 | [
"MIT"
] | null | null | null | include/algebra/array/multi_array.hpp | hyperpower/Nablla | 5a9be9f3b064a235572a1a2c9c5c2c19118697c5 | [
"MIT"
] | null | null | null | /************************
// \file multi_array.hpp
// \brief
//
// \author czhou
// \date 20 janv. 2018
***********************/
#ifndef MULTI_ARRAY_HPP_
#define MULTI_ARRAY_HPP_
#include <iostream>
#include <assert.h>
#include "algebra/algebra_define.hpp"
#include <array>
#include "array_list.hpp"
nam... | 22.751566 | 73 | 0.497706 | hyperpower |
fa490073c133f6add5e423d69c2ba6046a6935e4 | 1,636 | cpp | C++ | cpp/subprojects/common/src/common/sampling/weight_vector_dense.cpp | mrapp-ke/SyndromeLearner | ed18c282949bebbc8e1dd5d2ddfb0b224ee71293 | [
"MIT"
] | null | null | null | cpp/subprojects/common/src/common/sampling/weight_vector_dense.cpp | mrapp-ke/SyndromeLearner | ed18c282949bebbc8e1dd5d2ddfb0b224ee71293 | [
"MIT"
] | null | null | null | cpp/subprojects/common/src/common/sampling/weight_vector_dense.cpp | mrapp-ke/SyndromeLearner | ed18c282949bebbc8e1dd5d2ddfb0b224ee71293 | [
"MIT"
] | 1 | 2022-03-08T22:06:56.000Z | 2022-03-08T22:06:56.000Z | #include "common/sampling/weight_vector_dense.hpp"
template<class T>
DenseWeightVector<T>::DenseWeightVector(uint32 numElements)
: DenseWeightVector<T>(numElements, false) {
}
template<class T>
DenseWeightVector<T>::DenseWeightVector(uint32 numElements, bool init)
: vector_(DenseVector<T>(numElements, init)... | 25.169231 | 84 | 0.76956 | mrapp-ke |
fa492905fb125ca0c75a842e3ef0c326fc54635d | 395 | cpp | C++ | taint/src/riscv/targetcontext.cpp | ClasSun9/riscv-dynamic-taint-analysis | 8a96f5ea8d07580315253dc074f60955fc633da9 | [
"MIT"
] | null | null | null | taint/src/riscv/targetcontext.cpp | ClasSun9/riscv-dynamic-taint-analysis | 8a96f5ea8d07580315253dc074f60955fc633da9 | [
"MIT"
] | null | null | null | taint/src/riscv/targetcontext.cpp | ClasSun9/riscv-dynamic-taint-analysis | 8a96f5ea8d07580315253dc074f60955fc633da9 | [
"MIT"
] | null | null | null | #include "./targetcontext.hpp"
namespace riscv {
addr_t targetcontext::pc() {
return _pc;
}
const instruction& targetcontext::insn() {
return _insn;
}
const registerset& targetcontext::regs() {
return _regs;
}
targetcontext::targetcontext() { }
targetcontext::targetcontext(addr_t pc, instruction insn, ... | 17.173913 | 76 | 0.678481 | ClasSun9 |
fa4ad8c3c50f540ea9be50d2aababf37cee4df09 | 1,216 | cpp | C++ | Sources/AGEngine/Utils/RWLock.cpp | Another-Game-Engine/AGE | d5d9e98235198fe580a43007914f515437635830 | [
"MIT"
] | 47 | 2015-03-29T09:44:25.000Z | 2020-11-30T10:05:56.000Z | Sources/AGEngine/Utils/RWLock.cpp | Another-Game-Engine/AGE | d5d9e98235198fe580a43007914f515437635830 | [
"MIT"
] | 313 | 2015-01-01T18:16:30.000Z | 2015-11-30T07:54:07.000Z | Sources/AGEngine/Utils/RWLock.cpp | Another-Game-Engine/AGE | d5d9e98235198fe580a43007914f515437635830 | [
"MIT"
] | 9 | 2015-06-07T13:21:54.000Z | 2020-08-25T09:50:07.000Z | #include "RWLock.hpp"
#include "Debug.hpp"
#include <thread>
namespace AGE
{
RWLock::RWLock()
{
_sharedLock.store(0, std::memory_order_relaxed);
_uniqueLock.store(false, std::memory_order_relaxed);
}
void RWLock::ReadLock()
{
while (_uniqueLock.exchange(true, std::memory_order_relaxed))
{
std::this_t... | 16 | 63 | 0.67352 | Another-Game-Engine |
fa51378664eecd4a1bb9ef10d04f177fb4fe41a2 | 2,335 | cpp | C++ | cmfe/compute_sdk/examples/sample/kernel.cpp | dmitryryintel/cm-compiler | 1ef7651dc1c33d3e4853f8779d6a720e45e20e19 | [
"Intel",
"MIT"
] | 115 | 2018-02-01T18:56:44.000Z | 2022-03-21T13:23:00.000Z | cmfe/compute_sdk/examples/sample/kernel.cpp | dmitryryintel/cm-compiler | 1ef7651dc1c33d3e4853f8779d6a720e45e20e19 | [
"Intel",
"MIT"
] | 27 | 2018-09-17T17:49:49.000Z | 2021-11-03T04:31:51.000Z | cmfe/compute_sdk/examples/sample/kernel.cpp | dmitryryintel/cm-compiler | 1ef7651dc1c33d3e4853f8779d6a720e45e20e19 | [
"Intel",
"MIT"
] | 55 | 2018-02-01T07:11:49.000Z | 2022-03-04T01:20:23.000Z | /*===================== begin_copyright_notice ==================================
Copyright (c) 2021, Intel Corporation
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 restriction, i... | 34.850746 | 125 | 0.71606 | dmitryryintel |
fa54286fcc62fa3538bbf968e29a5b4093dfce47 | 8,310 | cpp | C++ | examples/fast_fourier_transform/test.cpp | drichmond/HOPS | 9684c0c9ebe5511fe0c202219a0bcd51fbf61079 | [
"BSD-3-Clause"
] | 10 | 2018-10-03T09:19:48.000Z | 2021-09-15T14:46:32.000Z | examples/fast_fourier_transform/test.cpp | drichmond/HOPS | 9684c0c9ebe5511fe0c202219a0bcd51fbf61079 | [
"BSD-3-Clause"
] | 1 | 2019-09-24T17:38:25.000Z | 2019-09-24T17:38:25.000Z | examples/fast_fourier_transform/test.cpp | drichmond/HOPS | 9684c0c9ebe5511fe0c202219a0bcd51fbf61079 | [
"BSD-3-Clause"
] | null | null | null | // ----------------------------------------------------------------------
// Copyright (c) 2018, The Regents of the University of California All
// rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
... | 30.43956 | 162 | 0.633213 | drichmond |
fa594fe597bfb13624c70b7b714310278eecc85b | 776 | hpp | C++ | android-28/javax/security/auth/SubjectDomainCombiner.hpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 12 | 2020-03-26T02:38:56.000Z | 2022-03-14T08:17:26.000Z | android-31/javax/security/auth/SubjectDomainCombiner.hpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 1 | 2021-01-27T06:07:45.000Z | 2021-11-13T19:19:43.000Z | android-29/javax/security/auth/SubjectDomainCombiner.hpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 3 | 2021-02-02T12:34:55.000Z | 2022-03-08T07:45:57.000Z | #pragma once
#include "../../../JObject.hpp"
class JArray;
class JArray;
class JString;
namespace java::security
{
class ProtectionDomain;
}
namespace javax::security::auth
{
class Subject;
}
namespace javax::security::auth
{
class SubjectDomainCombiner : public JObject
{
public:
// Fields
// QJniObject ... | 20.972973 | 162 | 0.716495 | YJBeetle |
fa60e041eac01f3fb44db8322fce99f975a32b55 | 926 | cpp | C++ | OOP - Laborator 9/Problema 1/Problema 1/main.cpp | alexrobert02/oop-2022 | 277655132fb8618b1ce1bd4bb53edc147a53028b | [
"MIT"
] | null | null | null | OOP - Laborator 9/Problema 1/Problema 1/main.cpp | alexrobert02/oop-2022 | 277655132fb8618b1ce1bd4bb53edc147a53028b | [
"MIT"
] | null | null | null | OOP - Laborator 9/Problema 1/Problema 1/main.cpp | alexrobert02/oop-2022 | 277655132fb8618b1ce1bd4bb53edc147a53028b | [
"MIT"
] | null | null | null | #include <string>
#include <iostream>
#include <vector>
#include <map>
#include "map.h"
int main()
{
Map<int, const char*> m;
m[10] = "C++";
m[20] = "test";
m[30] = "Poo";
for (auto [key, value, index] : m) {
printf("Index:%d, Key=%d, Value=%s\n", index, key, value);
}
m[20] = "r... | 19.702128 | 66 | 0.5 | alexrobert02 |
fa61a1793e2b57b94e64326851a048b2a43f300f | 1,172 | hpp | C++ | source/NanairoCore/Data/intersection_test_result.hpp | byzin/Nanairo | 23fb6deeec73509c538a9c21009e12be63e8d0e4 | [
"MIT"
] | 30 | 2015-09-06T03:14:29.000Z | 2021-06-18T11:00:19.000Z | source/NanairoCore/Data/intersection_test_result.hpp | byzin/Nanairo | 23fb6deeec73509c538a9c21009e12be63e8d0e4 | [
"MIT"
] | 31 | 2016-01-14T14:50:34.000Z | 2018-06-25T13:21:48.000Z | source/NanairoCore/Data/intersection_test_result.hpp | byzin/Nanairo | 23fb6deeec73509c538a9c21009e12be63e8d0e4 | [
"MIT"
] | 6 | 2017-04-09T13:07:47.000Z | 2021-05-29T21:17:34.000Z | /*!
\file intersection_test_result.hpp
\author Sho Ikeda
Copyright (c) 2015-2018 Sho Ikeda
This software is released under the MIT License.
http://opensource.org/licenses/mit-license.php
*/
#ifndef NANAIRO_INTERSECTION_TEST_RESULT_HPP
#define NANAIRO_INTERSECTION_TEST_RESULT_HPP
// Nanairo
#include "Nana... | 21.309091 | 52 | 0.756826 | byzin |
fa63f29fe52e415cd068788f3ad21da08e907982 | 17,604 | cpp | C++ | src/GenCVisitor.cpp | jkolek/cparser | 13a18cdfdd1e3fc4104b7def1dc7d81bdd8a8164 | [
"MIT"
] | 10 | 2017-12-16T14:40:30.000Z | 2022-02-20T09:09:02.000Z | src/GenCVisitor.cpp | jkolek/cparser | 13a18cdfdd1e3fc4104b7def1dc7d81bdd8a8164 | [
"MIT"
] | 3 | 2018-04-27T08:16:02.000Z | 2018-09-01T16:01:41.000Z | src/GenCVisitor.cpp | jkolek/cparser | 13a18cdfdd1e3fc4104b7def1dc7d81bdd8a8164 | [
"MIT"
] | 2 | 2019-02-06T14:02:31.000Z | 2021-11-02T02:34:21.000Z | // Generate C visitor - implementation file.
// Copyright (C) 2017, 2018 Jozef Kolek <jkolek@gmail.com>
//
// All rights reserved.
//
// See the LICENSE file for more details.
#include "../include/GenCVisitor.h"
#include "../include/ASTNode.h"
#include "../include/TreeVisitor.h"
#include <iostream>
#define TAB_SIZE... | 21.057416 | 85 | 0.526869 | jkolek |
fa6acb14331e9c56515c39ac495c021bfdd368d6 | 661 | cpp | C++ | queue/circular.cpp | sans712/SDE-Interview-Questions | 44f5bda60b9ed301b93a944e1c333d833c9b054b | [
"MIT"
] | null | null | null | queue/circular.cpp | sans712/SDE-Interview-Questions | 44f5bda60b9ed301b93a944e1c333d833c9b054b | [
"MIT"
] | null | null | null | queue/circular.cpp | sans712/SDE-Interview-Questions | 44f5bda60b9ed301b93a944e1c333d833c9b054b | [
"MIT"
] | null | null | null | #include<iostream>
using namespace std;
#include<bits/stdc++.h>
class queues{
int *arr;
int f,r,cs,ms;
public:
queues(int ds=5){
arr=new int [ds];
cs=0;
ms=ds;
f=0;
r=ms-1;
}
bool full(){
return cs==ms;
}
bool empty(){
return cs==0;
}
void push(int x){
if(!full()){
r=(r+1)%ms;
arr[r]=x;
... | 11.596491 | 23 | 0.497731 | sans712 |
fa6bc6d07b389ee5b05c8ce9109b5bbbb258565e | 969 | cpp | C++ | codes/UVA/10001-19999/uva11014.cpp | JeraKrs/ACM | edcd61ec6764b8cd804bf1538dfde53d0ff572b5 | [
"Apache-2.0"
] | null | null | null | codes/UVA/10001-19999/uva11014.cpp | JeraKrs/ACM | edcd61ec6764b8cd804bf1538dfde53d0ff572b5 | [
"Apache-2.0"
] | null | null | null | codes/UVA/10001-19999/uva11014.cpp | JeraKrs/ACM | edcd61ec6764b8cd804bf1538dfde53d0ff572b5 | [
"Apache-2.0"
] | null | null | null | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 200000;
int np, pri[maxn+5], vis[maxn+5];
void priTable (int n) {
np = 0;
memset(vis, 0, sizeof(vis));
for (int i = 2; i <= n; i++) {
if (vis[i])
continue;
pri[np++] = i;
for (int j = 2*... | 14.907692 | 47 | 0.4871 | JeraKrs |
fa6e6425724669d527e75115990d1f7fe9b20ced | 73 | hpp | C++ | benchmarks/benchmark.hpp | stdml/stdnn-ops | 0e6132bd65319e318f918094e482482698482e9e | [
"MIT"
] | 3 | 2018-10-23T18:46:39.000Z | 2019-06-24T00:46:10.000Z | benchmarks/benchmark.hpp | stdml/stdnn-ops | 0e6132bd65319e318f918094e482482698482e9e | [
"MIT"
] | 27 | 2018-11-10T14:19:16.000Z | 2020-03-08T23:33:01.000Z | benchmarks/benchmark.hpp | stdml/stdnn-ops | 0e6132bd65319e318f918094e482482698482e9e | [
"MIT"
] | 1 | 2018-11-05T06:17:12.000Z | 2018-11-05T06:17:12.000Z | #pragma once
#include <benchmark/benchmark.h>
#include "build_info.hpp"
| 14.6 | 32 | 0.767123 | stdml |
fa75e9117e534ec6e8c6b5dae4c83b9277ed8ae6 | 338 | cpp | C++ | Codeforces Online Judge Solve/68A - Irrational problem.cpp | Remonhasan/programming-solve | 5a4ac8c738dd361e1c974162e0eaebbaae72fd80 | [
"Apache-2.0"
] | null | null | null | Codeforces Online Judge Solve/68A - Irrational problem.cpp | Remonhasan/programming-solve | 5a4ac8c738dd361e1c974162e0eaebbaae72fd80 | [
"Apache-2.0"
] | null | null | null | Codeforces Online Judge Solve/68A - Irrational problem.cpp | Remonhasan/programming-solve | 5a4ac8c738dd361e1c974162e0eaebbaae72fd80 | [
"Apache-2.0"
] | null | null | null | // Remon Hasan
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int p[4], a, b;
cin >> p[0] >> p[1] >> p[2] >> p[3] >> a >> b;
int m = *min_element(p, p + 4);
if (a < m)
{
cout << min(b, m - 1) - a + 1 << endl;
}
else
{
cout << 0 << endl;
... | 14.695652 | 50 | 0.423077 | Remonhasan |
fa7877aae48974b80d2d09d051de5f5d06ce8bc7 | 1,761 | cpp | C++ | src/astro/basic_astro/bodyShapeModel.cpp | kimonito98/tudat | c28f2a3e78b8492e2e054ad5e0d1f9ad785cd092 | [
"BSD-3-Clause"
] | null | null | null | src/astro/basic_astro/bodyShapeModel.cpp | kimonito98/tudat | c28f2a3e78b8492e2e054ad5e0d1f9ad785cd092 | [
"BSD-3-Clause"
] | null | null | null | src/astro/basic_astro/bodyShapeModel.cpp | kimonito98/tudat | c28f2a3e78b8492e2e054ad5e0d1f9ad785cd092 | [
"BSD-3-Clause"
] | null | null | null | /* Copyright (c) 2010-2019, Delft University of Technology
* All rigths reserved
*
* This file is part of the Tudat. Redistribution and use in source and
* binary forms, with or without modification, are permitted exclusively
* under the terms of the Modified BSD license. You should have received
*... | 39.133333 | 99 | 0.720045 | kimonito98 |
fa7ba8a28c1e8de79e5ff218c649b797b3e8b818 | 4,748 | cpp | C++ | src/zenoh_flow_local_planner.cpp | autocore-ai/zenoh_flow_autoware | 8b5320fe95cfeb3d0573d7f520a6bab925ff6208 | [
"Apache-2.0"
] | 1 | 2022-03-31T08:53:16.000Z | 2022-03-31T08:53:16.000Z | src/zenoh_flow_local_planner.cpp | autocore-ai/zenoh_flow_autoware | 8b5320fe95cfeb3d0573d7f520a6bab925ff6208 | [
"Apache-2.0"
] | 2 | 2022-01-03T20:36:57.000Z | 2022-01-19T03:55:51.000Z | src/zenoh_flow_local_planner.cpp | autocore-ai/zenoh_flow_autoware | 8b5320fe95cfeb3d0573d7f520a6bab925ff6208 | [
"Apache-2.0"
] | null | null | null | // Copyright 2021 The AutoCore.AI.
//
// 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 t... | 48.948454 | 134 | 0.639427 | autocore-ai |
fa7d3d4044a2f033f206ade8d5558b3ed03c9040 | 2,098 | cpp | C++ | classnote/Midexam/DB_Conversion.cpp | Alex-Lin5/cpp_practice | c249362d6bbe932dc1eb4a4b8c51728d58db2aa7 | [
"MIT"
] | null | null | null | classnote/Midexam/DB_Conversion.cpp | Alex-Lin5/cpp_practice | c249362d6bbe932dc1eb4a4b8c51728d58db2aa7 | [
"MIT"
] | null | null | null | classnote/Midexam/DB_Conversion.cpp | Alex-Lin5/cpp_practice | c249362d6bbe932dc1eb4a4b8c51728d58db2aa7 | [
"MIT"
] | null | null | null |
#include <iostream>
#include <vector>
#include <list>
#include <map>
using namespace std;
//Implement the following function
void DB1_to_DB2(list<vector<list<int>*>* >& DB1, vector<list<list<int*> >*>* pDB2);
template <typename T> ostream& operator<<(ostream& str, const vector<T>& V);
template <typename T> ostream& ... | 25.901235 | 126 | 0.577216 | Alex-Lin5 |
fa7dba3908b35bf14a87cfe638101b39a1dd2dce | 6,743 | cpp | C++ | src/make_detect.cpp | cschreib/qdeblend | dceee75f3ff475995dbbb8660a6665ece205494f | [
"MIT"
] | null | null | null | src/make_detect.cpp | cschreib/qdeblend | dceee75f3ff475995dbbb8660a6665ece205494f | [
"MIT"
] | null | null | null | src/make_detect.cpp | cschreib/qdeblend | dceee75f3ff475995dbbb8660a6665ece205494f | [
"MIT"
] | null | null | null | #include <vif.hpp>
#include <vif/astro/ds9.hpp>
using namespace vif;
using namespace vif::astro;
int vif_main(int argc, char* argv[]) {
vec1s files = {"acs-f435w", "acs-f606w", "acs-f775w", "acs-f814w", "acs-f850lp",
"wfc3-f105w", "wfc3-f125w", "wfc3-f140w", "wfc3-f160w"};
files += ".fits";
std::... | 30.102679 | 103 | 0.547976 | cschreib |
fa82b6e764767ec297ffd9060a087f242751acf1 | 8,957 | cpp | C++ | src/XspfDateTime.cpp | ezdev128/libxspf | ba71431e24293510c44d6581e2c05b901a372880 | [
"BSD-3-Clause"
] | null | null | null | src/XspfDateTime.cpp | ezdev128/libxspf | ba71431e24293510c44d6581e2c05b901a372880 | [
"BSD-3-Clause"
] | null | null | null | src/XspfDateTime.cpp | ezdev128/libxspf | ba71431e24293510c44d6581e2c05b901a372880 | [
"BSD-3-Clause"
] | null | null | null | /*
* libxspf - XSPF playlist handling library
*
* Copyright (C) 2006-2008, Sebastian Pipping / Xiph.Org Foundation
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistrib... | 21.275534 | 96 | 0.620744 | ezdev128 |
fa8625618391b436b5d3793376c4526443b27842 | 3,821 | cpp | C++ | scripts/da_shotgun.cpp | mpforums/RenSharp | 5b3fb8bff2a1772a82a4148bcf3e1265a11aa097 | [
"Apache-2.0"
] | 1 | 2021-10-04T02:34:33.000Z | 2021-10-04T02:34:33.000Z | scripts/da_shotgun.cpp | TheUnstoppable/RenSharp | 2a123c6018c18f3fc73501737d600e291ac3afa7 | [
"Apache-2.0"
] | 9 | 2019-07-03T19:19:59.000Z | 2020-03-02T22:00:21.000Z | scripts/da_shotgun.cpp | TheUnstoppable/RenSharp | 2a123c6018c18f3fc73501737d600e291ac3afa7 | [
"Apache-2.0"
] | 2 | 2019-08-14T08:37:36.000Z | 2020-09-29T06:44:26.000Z | /* Renegade Scripts.dll
Dragonade Shotgun Wars Game Mode
Copyright 2017 Whitedragon, Tiberian Technologies
This file is part of the Renegade scripts.dll
The Renegade scripts.dll 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... | 44.430233 | 175 | 0.772311 | mpforums |
fa8cab7d2db90b6c1d432127901d174625e5eb3e | 362 | hh | C++ | fields/versionchecker.hh | 45G/libsocks6msg | 73b778bfe8efb2c311520617debdfbadf10b6d88 | [
"MIT"
] | 2 | 2020-08-18T11:20:21.000Z | 2022-03-08T23:49:02.000Z | fields/versionchecker.hh | 45G/libsocks6msg | 73b778bfe8efb2c311520617debdfbadf10b6d88 | [
"MIT"
] | null | null | null | fields/versionchecker.hh | 45G/libsocks6msg | 73b778bfe8efb2c311520617debdfbadf10b6d88 | [
"MIT"
] | null | null | null | #ifndef SOCKS6MSG_VERSIONCHECKER_HH
#define SOCKS6MSG_VERSIONCHECKER_HH
#include "bytebuffer.hh"
namespace S6M
{
template <uint8_t VER>
struct VersionChecker
{
VersionChecker() {}
VersionChecker(ByteBuffer *bb)
{
uint8_t *ver = bb->peek<uint8_t>();
if (*ver != VER)
throw BadVersionException(*ver);
}
};
... | 14.48 | 37 | 0.732044 | 45G |
fa90467c310331ed5de2fbe188d6fa0e46e86225 | 9,392 | hh | C++ | wersja szablonowa/include/macierz.hh | KPO-2020-2021/zad3-AdamStypczyc | 68c9b63d1b9b0176536ae46cc6863127d608433c | [
"Unlicense"
] | null | null | null | wersja szablonowa/include/macierz.hh | KPO-2020-2021/zad3-AdamStypczyc | 68c9b63d1b9b0176536ae46cc6863127d608433c | [
"Unlicense"
] | null | null | null | wersja szablonowa/include/macierz.hh | KPO-2020-2021/zad3-AdamStypczyc | 68c9b63d1b9b0176536ae46cc6863127d608433c | [
"Unlicense"
] | null | null | null | #ifndef MACIERZ_HH
#define MACIERZ_HH
#include <iostream>
#include <cstdlib>
#include <cmath>
#include "wektor.hh"
template <typename Templ_Typ, unsigned int Templ_Rozmiar>
class Macierz
{
private:
Templ_Typ value[Templ_Rozmiar][Templ_Rozmiar]; // Wartosci macierzy
double kat_stopnie;
double kat_radian;
... | 27.144509 | 118 | 0.622658 | KPO-2020-2021 |
fa94f3a3046e6cbd35b7f1ec92771ba7927d1907 | 913 | hpp | C++ | Applications/ZilchShadersTests/Helpers.hpp | jodavis42/ZilchShaders | a161323165c54d2824fe184f5d540e0a008b4d59 | [
"MIT"
] | 1 | 2019-08-31T00:45:45.000Z | 2019-08-31T00:45:45.000Z | Applications/ZilchShadersTests/Helpers.hpp | jodavis42/ZilchShaders | a161323165c54d2824fe184f5d540e0a008b4d59 | [
"MIT"
] | 5 | 2020-04-13T00:17:11.000Z | 2021-04-20T23:11:42.000Z | Applications/ZilchShadersTests/Helpers.hpp | jodavis42/ZilchShaders | a161323165c54d2824fe184f5d540e0a008b4d59 | [
"MIT"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
///
/// Authors: Joshua Davis
/// Copyright 2015, DigiPen Institute of Technology
///
///////////////////////////////////////////////////////////////////////////////
#pragma once
void LoadSettingsOrDefault(ZilchShaderSpirVSettings& setting... | 50.722222 | 109 | 0.684556 | jodavis42 |
fa965d14c8328527988ae1edb2011efab9fa57a5 | 404 | hpp | C++ | server/world.hpp | irl-game/irl | ba507a93371ab172b705c1ede8cd062123fc96f5 | [
"MIT"
] | null | null | null | server/world.hpp | irl-game/irl | ba507a93371ab172b705c1ede8cd062123fc96f5 | [
"MIT"
] | null | null | null | server/world.hpp | irl-game/irl | ba507a93371ab172b705c1ede8cd062123fc96f5 | [
"MIT"
] | null | null | null | #pragma once
#include <memory>
#include <unordered_map>
#include <unordered_set>
class Entity;
class Client;
class World
{
public:
World();
~World();
auto tick() noexcept -> void;
std::unordered_map<Client *, std::unique_ptr<Client>> clients;
private:
std::unordered_map<const Entity *, std::unique_ptr<Enti... | 20.2 | 71 | 0.717822 | irl-game |
b71232d372e0f2221c02359b6f2eb745778fe0b7 | 634 | cpp | C++ | Lista_2/mike_new.cpp | Thulio-Carvalho/Advanced-Algorithms-Problems | 724bfb765d056ddab414df7dd640914aa0c665ae | [
"MIT"
] | null | null | null | Lista_2/mike_new.cpp | Thulio-Carvalho/Advanced-Algorithms-Problems | 724bfb765d056ddab414df7dd640914aa0c665ae | [
"MIT"
] | null | null | null | Lista_2/mike_new.cpp | Thulio-Carvalho/Advanced-Algorithms-Problems | 724bfb765d056ddab414df7dd640914aa0c665ae | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define MAXN 200014
using namespace std;
int N, arr[MAXN], l[MAXN], r[MAXN];
stack<int> s;
int main(){
cin >> N;
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
fill(l, l + MAXN, -1);
fill(r, r + MAXN, N);
for (int i = 0; i < N; i++) {
while(!s.empty... | 17.611111 | 51 | 0.388013 | Thulio-Carvalho |
b71300420aeed2ab23a6a8af5412a20fed020f3c | 4,213 | cpp | C++ | test/lib/Dialect/VectorExt/TestVectorMaskingUtils.cpp | giuseros/iree-llvm-sandbox | d47050d04d299dab799f8a1c6eb7e5d85bda535f | [
"Apache-2.0"
] | null | null | null | test/lib/Dialect/VectorExt/TestVectorMaskingUtils.cpp | giuseros/iree-llvm-sandbox | d47050d04d299dab799f8a1c6eb7e5d85bda535f | [
"Apache-2.0"
] | null | null | null | test/lib/Dialect/VectorExt/TestVectorMaskingUtils.cpp | giuseros/iree-llvm-sandbox | d47050d04d299dab799f8a1c6eb7e5d85bda535f | [
"Apache-2.0"
] | null | null | null | //===- TestMaskingUtils.cpp - Utilities for vector masking ----------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... | 33.704 | 80 | 0.61785 | giuseros |
b71353bd1158764cddf2d9e45be1599d3d6c7708 | 12,774 | hpp | C++ | src/codegen/bytecode.hpp | Zoxc/mirb | 14c2fe2d2a026fb3bb62c883e8839e1078ebc3b6 | [
"BSD-3-Clause"
] | 10 | 2016-10-06T06:22:20.000Z | 2022-02-28T05:33:09.000Z | src/codegen/bytecode.hpp | Zoxc/mirb | 14c2fe2d2a026fb3bb62c883e8839e1078ebc3b6 | [
"BSD-3-Clause"
] | null | null | null | src/codegen/bytecode.hpp | Zoxc/mirb | 14c2fe2d2a026fb3bb62c883e8839e1078ebc3b6 | [
"BSD-3-Clause"
] | 3 | 2018-01-08T03:34:34.000Z | 2021-09-12T12:12:22.000Z | #pragma once
#include "../common.hpp"
#include "opcodes.hpp"
#include "../tree/nodes.hpp"
#include "../tree/tree.hpp"
#include <Prelude/JoiningBuffer.hpp>
namespace Mirb
{
namespace Tree
{
class Scope;
};
namespace CodeGen
{
class ByteCodeGenerator;
class VariableGroup
{
private:
size_t addres... | 27.95186 | 232 | 0.617739 | Zoxc |
b7176c107b4c4c326de6c7ac47392a995897d323 | 9,801 | hpp | C++ | include/mflib/waveformTemplate.hpp | uofuseismo/mflib | 14695f62082d28d4cc5603bb6edcaf1efe9dd980 | [
"MIT"
] | 5 | 2019-12-06T21:14:17.000Z | 2021-09-21T03:36:58.000Z | include/mflib/waveformTemplate.hpp | uofuseismo/mflib | 14695f62082d28d4cc5603bb6edcaf1efe9dd980 | [
"MIT"
] | 5 | 2019-11-27T19:06:06.000Z | 2020-04-24T19:07:44.000Z | include/mflib/waveformTemplate.hpp | uofuseismo/mflib | 14695f62082d28d4cc5603bb6edcaf1efe9dd980 | [
"MIT"
] | 2 | 2021-09-09T11:15:50.000Z | 2021-12-04T00:50:53.000Z | #ifndef MFLIB_WAVEFORMTEMPLATE_HPP
#define MFLIB_WAVEFORMTEMPLATE_HPP
#include <memory>
#include "mflib/enums.hpp"
namespace MFLib
{
class NetworkStationPhase;
/*!
* @brief Defines a waveform template.
* @copyright Ben Baker (University of Utah) distributed under the MIT license.
*/
class WaveformTemplate
{
public:
... | 35.255396 | 84 | 0.605755 | uofuseismo |
b7195e0b4a7870d5eb1e153904e59c4b42652bbe | 2,773 | cpp | C++ | systems/polyvox/PolyVoxShader.cpp | phisko/kengine | c30f98cc8e79cce6574b5f61088b511f29bbe8eb | [
"MIT"
] | 259 | 2018-11-01T05:12:37.000Z | 2022-03-28T11:15:27.000Z | systems/polyvox/PolyVoxShader.cpp | raptoravis/kengine | 619151c20e9db86584faf04937bed3d084e3bc21 | [
"MIT"
] | 2 | 2018-11-30T13:58:44.000Z | 2018-12-17T11:58:42.000Z | systems/polyvox/PolyVoxShader.cpp | raptoravis/kengine | 619151c20e9db86584faf04937bed3d084e3bc21 | [
"MIT"
] | 16 | 2018-12-01T13:38:18.000Z | 2021-12-04T21:31:55.000Z | #include "PolyVoxShader.hpp"
#include "EntityManager.hpp"
#include "data/TransformComponent.hpp"
#include "data/PolyVoxComponent.hpp"
#include "data/GraphicsComponent.hpp"
#include "data/ModelComponent.hpp"
#include "data/OpenGLModelComponent.hpp"
#include "systems/opengl/shaders/ApplyTransparencySrc.hpp"
#include ... | 25.440367 | 135 | 0.728814 | phisko |
b726b6a2a934148784791d29bdc232ba711d26fe | 942 | hpp | C++ | sdk/keyvault/azure-security-keyvault-keys/inc/azure/keyvault/keys/key_create_options.hpp | sjoubert/azure-sdk-for-cpp | 5e2e84cdbcf49497ac67b77f642c2c7d0f2f0278 | [
"MIT"
] | null | null | null | sdk/keyvault/azure-security-keyvault-keys/inc/azure/keyvault/keys/key_create_options.hpp | sjoubert/azure-sdk-for-cpp | 5e2e84cdbcf49497ac67b77f642c2c7d0f2f0278 | [
"MIT"
] | null | null | null | sdk/keyvault/azure-security-keyvault-keys/inc/azure/keyvault/keys/key_create_options.hpp | sjoubert/azure-sdk-for-cpp | 5e2e84cdbcf49497ac67b77f642c2c7d0f2f0278 | [
"MIT"
] | null | null | null | // Copyright (c) Microsoft Corporation. All rights reserved.
// SPDX-License-Identifier: MIT
/**
* @brief Defines the supported options to create a Key Vault Key.
*
*/
#pragma once
#include <azure/core/context.hpp>
#include <azure/core/datetime.hpp>
#include <azure/core/nullable.hpp>
#include "azure/keyvault/key... | 22.428571 | 76 | 0.707006 | sjoubert |
b727edd6f6e528c256e2dc56b9a9c2e0379019bf | 1,531 | cpp | C++ | tests/test_cpu.cpp | Ma-Dan/ncnn | 8e94566ffb6b676b05a3d2875eaa9463acc4a176 | [
"BSD-3-Clause"
] | 59 | 2020-12-28T02:46:58.000Z | 2022-02-10T14:50:48.000Z | tests/test_cpu.cpp | Ma-Dan/ncnn | 8e94566ffb6b676b05a3d2875eaa9463acc4a176 | [
"BSD-3-Clause"
] | 2 | 2020-11-05T05:39:31.000Z | 2020-11-27T06:08:23.000Z | tests/test_cpu.cpp | Ma-Dan/ncnn | 8e94566ffb6b676b05a3d2875eaa9463acc4a176 | [
"BSD-3-Clause"
] | 13 | 2020-12-28T02:49:01.000Z | 2022-03-12T11:58:33.000Z | #include <stdio.h>
#include "cpu.h"
#if defined __ANDROID__ || defined __linux__
static int test_cpu_set()
{
ncnn::CpuSet set;
if (set.num_enabled() != 0)
{
fprintf(stderr, "By default all cpus should be disabled\n");
return 1;
}
set.enable(0);
if (!set.is_enabled(0))
{
... | 16.641304 | 108 | 0.555846 | Ma-Dan |
b728245881598bd173e019180fb2863faf68151d | 1,845 | cpp | C++ | 1135/main.cpp | Heliovic/PAT_Solutions | 7c5dd554654045308f2341713c3e52cc790beb59 | [
"MIT"
] | 2 | 2019-03-18T12:55:38.000Z | 2019-09-07T10:11:26.000Z | 1135/main.cpp | Heliovic/My_PAT_Answer | 7c5dd554654045308f2341713c3e52cc790beb59 | [
"MIT"
] | null | null | null | 1135/main.cpp | Heliovic/My_PAT_Answer | 7c5dd554654045308f2341713c3e52cc790beb59 | [
"MIT"
] | null | null | null | #include <cstdio>
//#include <cstdlib>
#define MAX_N 64
#define RED -1
#define BLACK 1
using namespace std;
struct node
{
int type, data;
node* lc;
node* rc;
node() {lc = rc = NULL;}
};
int K, N;
node* root = NULL;
int black_cnt = -1;
bool is_rbtree = true;
void insert_bst(int data, node* & r, in... | 15.769231 | 91 | 0.416802 | Heliovic |
b72addd0b84922e8ce3620fd8c1a1584a73f03d6 | 2,562 | cpp | C++ | Samples/RadialController/cpp/RadialController.cpp | windows-development/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | 8 | 2017-04-30T17:38:27.000Z | 2021-11-29T00:59:03.000Z | Samples/RadialController/cpp/RadialController.cpp | TomeSq/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | null | null | null | Samples/RadialController/cpp/RadialController.cpp | TomeSq/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | 1 | 2020-01-18T09:12:02.000Z | 2020-01-18T09:12:02.000Z | #include "stdafx.h"
#include <tchar.h>
#include <StrSafe.h>
#include <wrl\implements.h>
#include <wrl\module.h>
#include <wrl\event.h>
#include <roapi.h>
#include <wrl.h>
#include "DeviceListener.h"
#include <ShellScalingApi.h>
#define CLASSNAME L"Radial Device Controller"
#define BUFFER_SIZE 2000
LRESU... | 23.943925 | 91 | 0.607728 | windows-development |
b72bcdc1cba305dc1b857157a455e1a46417bce8 | 2,902 | hpp | C++ | src/xalanc/XPath/XNumber.hpp | kidaa/xalan-c | bb666d0ab3d0a192410823e6857c203d83c27b16 | [
"Apache-2.0"
] | null | null | null | src/xalanc/XPath/XNumber.hpp | kidaa/xalan-c | bb666d0ab3d0a192410823e6857c203d83c27b16 | [
"Apache-2.0"
] | 1 | 2021-08-18T12:32:31.000Z | 2021-08-18T12:32:31.000Z | src/xalanc/XPath/XNumber.hpp | AaronNGray/xalan | 6741bbdcb64a9d33df8bd7e21b558d66bb4292ec | [
"Apache-2.0"
] | null | null | null | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the "License");
* you m... | 23.216 | 75 | 0.677119 | kidaa |
b734f0cd3f3cc7fa7d4671f172f94cf7d4a471b7 | 2,361 | cpp | C++ | Examples/CPP/WorkingWithResourceAssignments/GetResourceAssignmentOvertimes.cpp | aspose-tasks/Aspose.Tasks-for-C | acb3e2b75685f65cbe34dd739c7eae0dfc285aa1 | [
"MIT"
] | 1 | 2022-03-16T14:31:36.000Z | 2022-03-16T14:31:36.000Z | Examples/CPP/WorkingWithResourceAssignments/GetResourceAssignmentOvertimes.cpp | aspose-tasks/Aspose.Tasks-for-C | acb3e2b75685f65cbe34dd739c7eae0dfc285aa1 | [
"MIT"
] | null | null | null | Examples/CPP/WorkingWithResourceAssignments/GetResourceAssignmentOvertimes.cpp | aspose-tasks/Aspose.Tasks-for-C | acb3e2b75685f65cbe34dd739c7eae0dfc285aa1 | [
"MIT"
] | 1 | 2020-07-01T01:26:17.000Z | 2020-07-01T01:26:17.000Z | #include "GetResourceAssignmentOvertimes.h"
#include <system/type_info.h>
#include <system/string.h>
#include <system/shared_ptr.h>
#include <system/reflection/method_base.h>
#include <system/object_ext.h>
#include <system/object.h>
#include <system/decimal.h>
#include <system/console.h>
#include <system/collections/i... | 35.772727 | 164 | 0.725964 | aspose-tasks |
b73b91877c6c37a97da62a77dd2023b25fd36147 | 1,310 | cpp | C++ | week 4/Linked List/10. Minimum Platforms .cpp | arpit456jain/gfg-11-Weeks-Workshop-on-DSA-in-CPP | ed7fd8bc0a581f54ba3a3588dd01013776c4ece6 | [
"MIT"
] | 6 | 2021-08-06T14:36:41.000Z | 2022-03-22T11:22:07.000Z | week 4/Linked List/10. Minimum Platforms .cpp | arpit456jain/11-Weeks-Workshop-on-DSA-in-CPP | ed7fd8bc0a581f54ba3a3588dd01013776c4ece6 | [
"MIT"
] | 1 | 2021-08-09T05:09:48.000Z | 2021-08-09T05:09:48.000Z | week 4/Linked List/10. Minimum Platforms .cpp | arpit456jain/11-Weeks-Workshop-on-DSA-in-CPP | ed7fd8bc0a581f54ba3a3588dd01013776c4ece6 | [
"MIT"
] | 1 | 2021-08-09T14:25:17.000Z | 2021-08-09T14:25:17.000Z | // { Driver Code Starts
// Program to find minimum number of platforms
// required on a railway station
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
//Function to find the minimum number of platforms required at the
//railway station such that no train waits... | 19.264706 | 70 | 0.468702 | arpit456jain |
b73fce49595bcb5c50d37701f3db5ffd4bff29e6 | 2,052 | cpp | C++ | src/VisumScriptMain.cpp | Mokon/visum | 53f602fcf22eadd60f446d04a26b4a6e7217c052 | [
"RSA-MD"
] | null | null | null | src/VisumScriptMain.cpp | Mokon/visum | 53f602fcf22eadd60f446d04a26b4a6e7217c052 | [
"RSA-MD"
] | null | null | null | src/VisumScriptMain.cpp | Mokon/visum | 53f602fcf22eadd60f446d04a26b4a6e7217c052 | [
"RSA-MD"
] | null | null | null | /* Copyright (C) 2013-2016 David 'Mokon' Bond, All Rights Reserved */
#include <config.h>
#include <glog/logging.h>
#include <visum/entities/common/Bank.hpp>
#include <visum/entities/common/CreditCard.hpp>
#include <visum/entities/common/Person.hpp>
#include <visum/entities/Entity.hpp>
#include <visum/entities/EntityG... | 30.626866 | 96 | 0.640838 | Mokon |
b7415fabb9cac20eba8cc19edb1a7fa026a177f7 | 1,139 | cpp | C++ | gpu_lib/external_gpu_algorithm.cpp | ARGO-group/Argo_CUDA | 7a15252906860f4a725e37b6add211f625b91869 | [
"MIT"
] | null | null | null | gpu_lib/external_gpu_algorithm.cpp | ARGO-group/Argo_CUDA | 7a15252906860f4a725e37b6add211f625b91869 | [
"MIT"
] | null | null | null | gpu_lib/external_gpu_algorithm.cpp | ARGO-group/Argo_CUDA | 7a15252906860f4a725e37b6add211f625b91869 | [
"MIT"
] | 1 | 2021-07-10T09:59:52.000Z | 2021-07-10T09:59:52.000Z | #include "external_gpu_algorithm.h"
#include <thread>
#include <config.h>
#include <hash_conversions.h>
#include <run_parallel.h>
#include <safe_counter.h>
#include <gpu_info.h>
#include "finder_kernel.cuh"
void external_gpu_algorithm(const std::vector<uint32_t> &motif_hashes,
const Seq... | 32.542857 | 108 | 0.639157 | ARGO-group |
b74bf15f46745c90202343ea77a3026b857f93c9 | 784 | cpp | C++ | Software/app/nixie_state.cpp | gotlaufs/rtu-nixie-clock | 7fe43f13deb8f5314ce19d00fe6623337c0d0df7 | [
"MIT"
] | null | null | null | Software/app/nixie_state.cpp | gotlaufs/rtu-nixie-clock | 7fe43f13deb8f5314ce19d00fe6623337c0d0df7 | [
"MIT"
] | 5 | 2019-02-19T22:23:19.000Z | 2019-02-19T22:27:27.000Z | Software/app/nixie_state.cpp | gotlaufs/rtu-nixie-clock | 7fe43f13deb8f5314ce19d00fe6623337c0d0df7 | [
"MIT"
] | null | null | null | // Nixie state class implementation
#include "nixie_state.h"
NixieState::NixieState(NixieClock & app_) : app(app_)
{
memset(&nixie_data, 0, sizeof(nixie_data_type));
}
void NixieState::writeTimeToNixie()
{
if (sec > 99)
{
// Blank tubes if too big digit
nixie_data.N6 = 10;
nixie_da... | 17.422222 | 53 | 0.512755 | gotlaufs |
b74c2f463fe2ec1f3eab79af4dbebde53df4d597 | 90 | cpp | C++ | core/src/backend/task/FunctionDataTemplate.cpp | ExaBerries/spruce | 85845244f7d6cd5a662f0dbc9b4079a1230d9a4b | [
"MIT"
] | null | null | null | core/src/backend/task/FunctionDataTemplate.cpp | ExaBerries/spruce | 85845244f7d6cd5a662f0dbc9b4079a1230d9a4b | [
"MIT"
] | null | null | null | core/src/backend/task/FunctionDataTemplate.cpp | ExaBerries/spruce | 85845244f7d6cd5a662f0dbc9b4079a1230d9a4b | [
"MIT"
] | null | null | null | #include <backend/task/FunctionDataTemplate.h>
namespace spruce {
namespace task {
}
}
| 12.857143 | 46 | 0.744444 | ExaBerries |
b753e58ff00bc994c8dc9e157fe23b35e3166aa9 | 8,811 | hpp | C++ | include/mockturtle/algorithms/aqfp/detail/dag_util.hpp | shi27feng/mockturtle | 032dcd590b57040c5ff10d80b515353ffe822671 | [
"MIT"
] | null | null | null | include/mockturtle/algorithms/aqfp/detail/dag_util.hpp | shi27feng/mockturtle | 032dcd590b57040c5ff10d80b515353ffe822671 | [
"MIT"
] | null | null | null | include/mockturtle/algorithms/aqfp/detail/dag_util.hpp | shi27feng/mockturtle | 032dcd590b57040c5ff10d80b515353ffe822671 | [
"MIT"
] | null | null | null | /* mockturtle: C++ logic network library
* Copyright (C) 2018-2021 EPFL
*
* 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
* restriction, including without limitation the rights... | 27.794953 | 139 | 0.637726 | shi27feng |
b75582d23033bd9636bd190462cb22da89e5bd0b | 61,137 | cpp | C++ | vphysics_bullet/Physics_Environment.cpp | SwagSoftware/Kisak-Strike | 7498c886b5199b37cbd156ceac9377ecac73b982 | [
"Unlicense"
] | 252 | 2020-12-16T15:34:43.000Z | 2022-03-31T23:21:37.000Z | vphysics_bullet/Physics_Environment.cpp | SwagSoftware/Kisak-Strike | 7498c886b5199b37cbd156ceac9377ecac73b982 | [
"Unlicense"
] | 23 | 2020-12-20T18:02:54.000Z | 2022-03-28T16:58:32.000Z | vphysics_bullet/Physics_Environment.cpp | SwagSoftware/Kisak-Strike | 7498c886b5199b37cbd156ceac9377ecac73b982 | [
"Unlicense"
] | 42 | 2020-12-19T04:32:33.000Z | 2022-03-30T06:00:28.000Z | #include "StdAfx.h"
#include <cmodel.h>
#include <cstring>
#include "Physics_Environment.h"
#include "Physics.h"
#include "Physics_Object.h"
#include "Physics_ShadowController.h"
#include "Physics_PlayerController.h"
#include "Physics_FluidController.h"
#include "Physics_DragController.h"
#include "Physics_MotionCont... | 36.0053 | 354 | 0.762828 | SwagSoftware |
b755fae74c436939a563f178a7d1bb9e6675d203 | 1,106 | cpp | C++ | Source/src/Json Parser/DataTypeHandlers/JsonObject.cpp | codenameone-akshat/LittleJsonReader | 2a28219ef494d4d3a02961d74fb90fa4829a14c5 | [
"MIT"
] | null | null | null | Source/src/Json Parser/DataTypeHandlers/JsonObject.cpp | codenameone-akshat/LittleJsonReader | 2a28219ef494d4d3a02961d74fb90fa4829a14c5 | [
"MIT"
] | null | null | null | Source/src/Json Parser/DataTypeHandlers/JsonObject.cpp | codenameone-akshat/LittleJsonReader | 2a28219ef494d4d3a02961d74fb90fa4829a14c5 | [
"MIT"
] | null | null | null | #include "JsonObjectItem.h"
JsonReader::JsonItem * JsonReader::JsonObjectItem::GetValue()
{
return this;
}
JsonReader::JsonItem * JsonReader::JsonObjectItem::GetFirstChild()
{
it = m_value.begin();
return *it;
}
JsonReader::JsonItem * JsonReader::JsonObjectItem::GetNextChild()
{
std::vector<JsonIt... | 16.757576 | 80 | 0.664557 | codenameone-akshat |
b758578b94442795754abc3bccdd5a85647c9325 | 677 | cpp | C++ | sources codes/tute30b.cpp | darkrabel/c-personal-reference-code- | 0ea62666a6f8b7ea876e96498e3c0b6b4e773a7f | [
"MIT"
] | 2 | 2021-06-17T11:05:01.000Z | 2021-11-15T11:39:46.000Z | sources codes/tute30b.cpp | darkrabel/c-personal-reference-code- | 0ea62666a6f8b7ea876e96498e3c0b6b4e773a7f | [
"MIT"
] | null | null | null | sources codes/tute30b.cpp | darkrabel/c-personal-reference-code- | 0ea62666a6f8b7ea876e96498e3c0b6b4e773a7f | [
"MIT"
] | null | null | null | #include<iostream>
using namespace std;
class Point{
int x, y;
public:
Point(int a, int b){
x = a;
y = b;
}
void displayPoint(){
cout<<"The point is ("<<x<<", "<<y<<")"<<endl;
}
};
// Create a function (Hint: Make it a friend function) which... | 21.83871 | 131 | 0.552437 | darkrabel |
b75b6cd1faa782a6f70b5eddbb1aacaba1f7d65b | 860 | hpp | C++ | src/Camera.hpp | Philipp-M/CG_Project1 | 19e6b96c8c6d6fe4323af50f247ed07120c74f9c | [
"MIT"
] | null | null | null | src/Camera.hpp | Philipp-M/CG_Project1 | 19e6b96c8c6d6fe4323af50f247ed07120c74f9c | [
"MIT"
] | null | null | null | src/Camera.hpp | Philipp-M/CG_Project1 | 19e6b96c8c6d6fe4323af50f247ed07120c74f9c | [
"MIT"
] | null | null | null | #pragma once
#include <GL/gl.h>
#include <glm/glm.hpp>
#include <glm/gtc/constants.hpp>
const GLfloat PI_4 = 0.78539816339744830962;
class Camera
{
private:
GLfloat fieldOfView;
GLfloat width;
GLfloat height;
GLfloat nearPlane;
GLfloat farPlane;
glm::mat4 viewMat;
public:
Camera(GLfloat width = 1920, GLfloat... | 17.916667 | 127 | 0.727907 | Philipp-M |
b75cfe6dbda9e66acdf42f4480e39184ba41ea21 | 449 | cpp | C++ | code/data-structures/segment_tree_node.cpp | viswamy/CompetitiveProgramming | 497d58adce25cfe4fc327301d977da275ad80201 | [
"MIT"
] | null | null | null | code/data-structures/segment_tree_node.cpp | viswamy/CompetitiveProgramming | 497d58adce25cfe4fc327301d977da275ad80201 | [
"MIT"
] | null | null | null | code/data-structures/segment_tree_node.cpp | viswamy/CompetitiveProgramming | 497d58adce25cfe4fc327301d977da275ad80201 | [
"MIT"
] | 1 | 2019-07-28T03:12:29.000Z | 2019-07-28T03:12:29.000Z | #ifndef STNODE
#define STNODE
struct node {
int l, r;
ll x, lazy;
node() {}
node(int _l, int _r) : l(_l), r(_r), x(0), lazy(0) { }
node(int _l, int _r, ll _x) : node(_l,_r) { x = _x; }
node(node a, node b) : node(a.l,b.r) { x = a.x + b.x; }
void update(ll v) { x = v; }
void range_update(... | 29.933333 | 59 | 0.492205 | viswamy |
b75e80dfc6b4645d842b4b4bce139b667dddd272 | 1,416 | cpp | C++ | VIIL/src/renderer/interface/Shader.cpp | Vixnil/VIIL | 0057464a1bc6e938825cfdf59a977cbe53c03a00 | [
"Apache-2.0"
] | null | null | null | VIIL/src/renderer/interface/Shader.cpp | Vixnil/VIIL | 0057464a1bc6e938825cfdf59a977cbe53c03a00 | [
"Apache-2.0"
] | null | null | null | VIIL/src/renderer/interface/Shader.cpp | Vixnil/VIIL | 0057464a1bc6e938825cfdf59a977cbe53c03a00 | [
"Apache-2.0"
] | null | null | null | #include "core/standardUse.h"
#include "renderer/interface/Shader.h"
#include "renderer//interface/RendererLibrary.h"
#include "renderer/OpenGL/OpenGLShader.h"
namespace VIIL
{
std::shared_ptr<Shader> Shader::Create(const std::shared_ptr<File>& shaderSrc)
{
switch (RendererLibrary::getType())
{
case RendererL... | 27.764706 | 148 | 0.737288 | Vixnil |
b767de3fcf18ad1ff838a3b3ee458af38573a642 | 5,173 | cpp | C++ | test/System/Session.cpp | ntoskrnl7/win32api-ex | e91521b53745655fd8fb7d6532770f4888420814 | [
"MIT"
] | 18 | 2022-01-12T23:01:55.000Z | 2022-03-28T01:50:56.000Z | test/System/Session.cpp | ntoskrnl7/win32api-ex | e91521b53745655fd8fb7d6532770f4888420814 | [
"MIT"
] | null | null | null | test/System/Session.cpp | ntoskrnl7/win32api-ex | e91521b53745655fd8fb7d6532770f4888420814 | [
"MIT"
] | 3 | 2022-02-25T10:55:41.000Z | 2022-02-25T13:06:21.000Z | #include <Win32Ex/System/Session.hpp>
#include <gtest/gtest.h>
TEST(SessionTest, ThisSession)
{
EXPECT_EQ(Win32Ex::ThisSession::Id(), WTSGetActiveConsoleSessionId());
EXPECT_STREQ(Win32Ex::ThisSession::Name().c_str(),
Win32Ex::System::Session(Win32Ex::ThisSession::Id()).Name().c_str());
EX... | 32.534591 | 115 | 0.635028 | ntoskrnl7 |
b76d9160b34a21db97aa8eac8705d37d6e0abf72 | 13,690 | cpp | C++ | cppLib/code/dep/G3D/source/ConvexPolyhedron.cpp | DrYaling/ProcedureContentGenerationForUnity | 3c4f1e70b01e4fe2b9f847324b60b15016b9a740 | [
"MIT"
] | 3 | 2019-05-14T07:19:59.000Z | 2019-05-14T08:08:25.000Z | cppLib/code/dep/G3D/source/ConvexPolyhedron.cpp | DrYaling/ProcedureContentGenerationForUnity | 3c4f1e70b01e4fe2b9f847324b60b15016b9a740 | [
"MIT"
] | null | null | null | cppLib/code/dep/G3D/source/ConvexPolyhedron.cpp | DrYaling/ProcedureContentGenerationForUnity | 3c4f1e70b01e4fe2b9f847324b60b15016b9a740 | [
"MIT"
] | 1 | 2018-08-08T07:39:16.000Z | 2018-08-08T07:39:16.000Z | /**
@file ConvexPolyhedron.cpp
@author Morgan McGuire, http://graphics.cs.williams.edu
@created 2001-11-11
@edited 2009-08-10
Copyright 2000-2009, Morgan McGuire.
All rights reserved.
*/
#include "G3D/platform.h"
#include "G3D/ConvexPolyhedron.h"
#include "G3D/debug.h"
namespace G3D {
ConvexPolyg... | 29.89083 | 112 | 0.530533 | DrYaling |
b7726f6aa53071e6a333dd5784e55ebad81a0659 | 2,367 | cpp | C++ | src/red4ext.dll/Utils.cpp | gammaparticle/RED4ext | 1d5ad2745cc806acf1111cde7e46d3f250d42474 | [
"MIT",
"BSD-3-Clause"
] | null | null | null | src/red4ext.dll/Utils.cpp | gammaparticle/RED4ext | 1d5ad2745cc806acf1111cde7e46d3f250d42474 | [
"MIT",
"BSD-3-Clause"
] | null | null | null | src/red4ext.dll/Utils.cpp | gammaparticle/RED4ext | 1d5ad2745cc806acf1111cde7e46d3f250d42474 | [
"MIT",
"BSD-3-Clause"
] | null | null | null | #include "stdafx.hpp"
#include "Utils.hpp"
#include "App.hpp"
std::wstring Utils::FormatErrorMessage(uint32_t aErrorCode)
{
wchar_t* buffer = nullptr;
auto errorCode = GetLastError();
FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS, nullptr,
... | 29.222222 | 119 | 0.635403 | gammaparticle |
b77cfa1b68cff6fbd2eca0a1d11220cf9d3b33ec | 1,158 | cpp | C++ | common/gui/win32/WinFileUtil.cpp | lesit/NeuroStudio | f505065d694a8614587e7cc243ede72c141bd80b | [
"W3C"
] | 21 | 2018-11-15T08:23:14.000Z | 2022-03-30T15:44:59.000Z | common/gui/win32/WinFileUtil.cpp | lesit/NeuroStudio | f505065d694a8614587e7cc243ede72c141bd80b | [
"W3C"
] | null | null | null | common/gui/win32/WinFileUtil.cpp | lesit/NeuroStudio | f505065d694a8614587e7cc243ede72c141bd80b | [
"W3C"
] | 1 | 2021-12-08T01:17:27.000Z | 2021-12-08T01:17:27.000Z | #include "stdafx.h"
#include "WinFileUtil.h"
using namespace np::gui::win32;
bool WinFileUtil::IsDirectory(const wchar_t* strFilePath)
{
DWORD dwAttr = GetFileAttributes(strFilePath);
if (dwAttr == INVALID_FILE_ATTRIBUTES)
return false;
return (dwAttr & FILE_ATTRIBUTE_DIRECTORY)>0;
}
bool WinFileUtil::GetNorm... | 22.705882 | 89 | 0.765976 | lesit |
b77eb22e05e8b69ed2c7767aa7a8eab4bed43f85 | 10,700 | cpp | C++ | src/openpose/utilities/fileSystem.cpp | meiwanlanjun/openpose | 71078eb1b7571789c7589cf6c8de1786c3227a90 | [
"DOC",
"MIT-CMU"
] | null | null | null | src/openpose/utilities/fileSystem.cpp | meiwanlanjun/openpose | 71078eb1b7571789c7589cf6c8de1786c3227a90 | [
"DOC",
"MIT-CMU"
] | null | null | null | src/openpose/utilities/fileSystem.cpp | meiwanlanjun/openpose | 71078eb1b7571789c7589cf6c8de1786c3227a90 | [
"DOC",
"MIT-CMU"
] | null | null | null | #include <cstdio> // fopen
#ifdef _WIN32
#include <direct.h> // _mkdir
#include <windows.h> // DWORD, GetFileAttributesA
#elif defined __unix__
#include <dirent.h> // opendir
#include <sys/stat.h> // mkdir
#else
#error Unknown environment!
#endif
#include <openpose/utilities/string.hpp>
#include <op... | 34.96732 | 117 | 0.497383 | meiwanlanjun |
b7828e490770598d7cbe06bfad2e50233ce92d64 | 1,838 | hpp | C++ | src/backnocles/utils/disablewarnings.hpp | dsiroky/backnocles | 889ab5f65fc1beb27f6dfff36d5fcda8544a9be2 | [
"MIT"
] | 3 | 2017-10-22T17:57:10.000Z | 2017-11-06T12:33:31.000Z | src/backnocles/utils/disablewarnings.hpp | dsiroky/backnocles | 889ab5f65fc1beb27f6dfff36d5fcda8544a9be2 | [
"MIT"
] | null | null | null | src/backnocles/utils/disablewarnings.hpp | dsiroky/backnocles | 889ab5f65fc1beb27f6dfff36d5fcda8544a9be2 | [
"MIT"
] | null | null | null | /// Place this include above thirdparty includes. Pair with enablewarnings.hpp.
///
/// Project has very restrictive warnings and lots of libraries does not
/// conform to that. MSVC++ does not have "-isystem" equivalent.
///
/// @file
#ifdef _MSC_VER
#pragma warning(push)
#pragma warning(disable: 4244)
#pragma ... | 37.510204 | 79 | 0.73667 | dsiroky |
b783c70fbc58bdd7d14e497c5f0d07c4cb71122b | 320 | cpp | C++ | DwarfDash/src/Geometry.cpp | Zai-shen/DwarfDash | 2a991a33dc4550bdf89a665a092b0b8db6a03724 | [
"MIT"
] | null | null | null | DwarfDash/src/Geometry.cpp | Zai-shen/DwarfDash | 2a991a33dc4550bdf89a665a092b0b8db6a03724 | [
"MIT"
] | null | null | null | DwarfDash/src/Geometry.cpp | Zai-shen/DwarfDash | 2a991a33dc4550bdf89a665a092b0b8db6a03724 | [
"MIT"
] | null | null | null | #include "Geometry.h"
glm::mat4 Geometry::getModelMatrix() {
return _modelMatrix;
}
void Geometry::setTransformMatrix(glm::mat4 transformationMatrix) {
_transformMatrix = transformationMatrix;
}
//void Geometry::transform(glm::mat4 transformationMatrix) {
// _modelMatrix = _modelMatrix * transformationMatrix;
//} | 22.857143 | 67 | 0.775 | Zai-shen |
b785a7ba88c2fcb13ae1a182ee56c29a5e6721f2 | 8,966 | cpp | C++ | game/graphics/texture/jak1_tpage_dir.cpp | Hat-Kid/jak-project | 0e2320ca9584118316313e41e646b179a1083feb | [
"ISC"
] | 54 | 2022-02-08T13:07:50.000Z | 2022-03-31T14:18:42.000Z | game/graphics/texture/jak1_tpage_dir.cpp | Hat-Kid/jak-project | 0e2320ca9584118316313e41e646b179a1083feb | [
"ISC"
] | 120 | 2022-02-08T05:19:11.000Z | 2022-03-30T22:26:52.000Z | game/graphics/texture/jak1_tpage_dir.cpp | Hat-Kid/jak-project | 0e2320ca9584118316313e41e646b179a1083feb | [
"ISC"
] | 8 | 2022-02-13T22:39:55.000Z | 2022-03-30T02:17:57.000Z | #include <vector>
#include "common/common_types.h"
#include "jak1_tpage_dir.h"
namespace {
std::vector<u32> tpage_dir = {
0x0, 0x2, 0x37, 0x1, 0x1, 0x10, 0x2, 0x4, 0x3, 0x2, 0x1, 0x5, 0x7, 0x8, 0x1, 0x1, 0x1, 0xb, 0xe,
0x8, 0x1, 0x6, 0x4, 0x6, 0x3, 0x3, 0x6, 0x6, 0x4, 0x4, 0x4, 0xd, 0x1, 0x4, 0x9, 0xc, 0x1, 0x... | 87.901961 | 100 | 0.593241 | Hat-Kid |
b7919637242c503f2e2d26342b5b56d84824bc24 | 14,642 | cpp | C++ | depricated/acyclic_graph_nodes.cpp | imikejackson/bingocpp | 6ba00a490c8cb46edebfd78f56b1604a76d668e9 | [
"Apache-2.0"
] | 13 | 2019-03-14T09:54:02.000Z | 2021-09-26T14:01:30.000Z | depricated/acyclic_graph_nodes.cpp | imikejackson/bingocpp | 6ba00a490c8cb46edebfd78f56b1604a76d668e9 | [
"Apache-2.0"
] | 35 | 2019-08-29T19:12:05.000Z | 2021-07-15T22:17:53.000Z | depricated/acyclic_graph_nodes.cpp | imikejackson/bingocpp | 6ba00a490c8cb46edebfd78f56b1604a76d668e9 | [
"Apache-2.0"
] | 9 | 2018-10-18T02:43:03.000Z | 2021-09-02T22:08:39.000Z | /*!
* \file acyclic_graph_nodes.cc
*
* \author Ethan Adams
* \date 2/6/2018
*
* This file contains the functions associated with each class
* implementation of Operation.
*/
#include "BingoCpp/acyclic_graph_nodes.h"
namespace agraphnodes{
namespace {
void x_load_evaluate(const Eigen::ArrayX3i &stack,
... | 46.044025 | 99 | 0.523562 | imikejackson |
b7962ad897f8c79a4958223474666710ab234556 | 3,059 | cpp | C++ | GP/FrmProj.cpp | wsu-cb/cbwindows | 55d3797ed0c639b36fe3f677777fcc31e3449360 | [
"MIT"
] | 4 | 2020-06-22T16:59:51.000Z | 2020-06-28T19:35:23.000Z | GP/FrmProj.cpp | wsu-cb/cbwindows | 55d3797ed0c639b36fe3f677777fcc31e3449360 | [
"MIT"
] | 59 | 2020-09-12T23:54:16.000Z | 2022-03-24T18:51:43.000Z | GP/FrmProj.cpp | wsu-cb/cbwindows | 55d3797ed0c639b36fe3f677777fcc31e3449360 | [
"MIT"
] | 4 | 2020-06-22T13:37:40.000Z | 2021-01-29T12:42:54.000Z | // FrmProg.cpp
//
// Copyright (c) 1994-2020 By Dale L. Larson, All Rights Reserved.
//
// 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 restriction, including
// without limitation... | 28.324074 | 77 | 0.652501 | wsu-cb |
b7979d4151b9fc7fe8cc8bc8d2db246cdb4860fc | 2,018 | hh | C++ | include/Apertures/StandardAperturePolygon.hh | aaronbamberger/gerber_rs274x_parser | d2bbd6c66d322ab47715771642255f8302521300 | [
"BSD-2-Clause"
] | 6 | 2016-09-28T18:26:42.000Z | 2021-04-10T13:19:05.000Z | include/Apertures/StandardAperturePolygon.hh | aaronbamberger/gerber_rs274x_parser | d2bbd6c66d322ab47715771642255f8302521300 | [
"BSD-2-Clause"
] | 1 | 2021-02-09T00:24:04.000Z | 2021-02-27T22:08:05.000Z | include/Apertures/StandardAperturePolygon.hh | aaronbamberger/gerber_rs274x_parser | d2bbd6c66d322ab47715771642255f8302521300 | [
"BSD-2-Clause"
] | 5 | 2017-09-14T09:48:17.000Z | 2021-07-19T07:58:34.000Z | /*
* Copyright 2021 Aaron Bamberger
* Licensed under BSD 2-clause license
* See LICENSE file at root of source tree,
* or https://opensource.org/licenses/BSD-2-Clause
*/
#ifndef _STANDARD_APERTURE_POLYGON_H
#define _STANDARD_APERTURE_POLYGON_H
#include "Apertures/StandardAperture.hh"
#include "GlobalDefs.hh"
#in... | 38.075472 | 113 | 0.806739 | aaronbamberger |
b79d98c9ccf6ae2243b193a04a675881028db9e4 | 12,562 | cpp | C++ | core/RTAudio.cpp | amilo/soundcoreA | 30b14ce3d34f74c2385126fc244a0c252c3aa4c4 | [
"MIT"
] | null | null | null | core/RTAudio.cpp | amilo/soundcoreA | 30b14ce3d34f74c2385126fc244a0c252c3aa4c4 | [
"MIT"
] | null | null | null | core/RTAudio.cpp | amilo/soundcoreA | 30b14ce3d34f74c2385126fc244a0c252c3aa4c4 | [
"MIT"
] | null | null | null | /*
* RTAudio.cpp
*
* Central control code for hard real-time audio on BeagleBone Black
* using PRU and Xenomai Linux extensions. This code began as part
* of the Hackable Instruments project (EPSRC) at Queen Mary University
* of London, 2013-14.
*
* (c) 2014 Victor Zappi and Andrew McPherson
* Queen Mar... | 29.419204 | 133 | 0.71581 | amilo |
b79dc57c8d87ed9ac355024072cc3b95897d7c8d | 412 | hpp | C++ | src/graphics/index-buffer.hpp | guillaume-haerinck/imac-tower-defense | 365a32642ea0d3ad8b2b7d63347d585c44d9f670 | [
"MIT"
] | 44 | 2019-06-06T21:33:30.000Z | 2022-03-26T06:18:23.000Z | src/graphics/index-buffer.hpp | guillaume-haerinck/imac-tower-defense | 365a32642ea0d3ad8b2b7d63347d585c44d9f670 | [
"MIT"
] | 1 | 2019-09-27T12:04:52.000Z | 2019-09-29T13:30:42.000Z | src/graphics/index-buffer.hpp | guillaume-haerinck/imac-tower-defense | 365a32642ea0d3ad8b2b7d63347d585c44d9f670 | [
"MIT"
] | 8 | 2019-07-26T16:44:26.000Z | 2020-11-24T17:56:18.000Z | #pragma once
class IndexBuffer {
private:
unsigned int m_rendererID;
unsigned int m_count;
public:
IndexBuffer();
IndexBuffer(const unsigned int* data, unsigned int count);
~IndexBuffer();
void init(const unsigned int* data, unsigned int count);
void bind() const;
void unbind() const;
inline unsigned int g... | 20.6 | 59 | 0.735437 | guillaume-haerinck |
b7a6d58765808f0bc9e9d6961d800f875ee4e177 | 740 | cpp | C++ | Difficulty 1/luhn_check_sum.cpp | BrynjarGeir/Kattis | a151972cbae3db04a8e6764d5fa468d0146c862b | [
"MIT"
] | null | null | null | Difficulty 1/luhn_check_sum.cpp | BrynjarGeir/Kattis | a151972cbae3db04a8e6764d5fa468d0146c862b | [
"MIT"
] | null | null | null | Difficulty 1/luhn_check_sum.cpp | BrynjarGeir/Kattis | a151972cbae3db04a8e6764d5fa468d0146c862b | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main() {
int tests;
cin >> tests;
for (int j = 0; j < tests; j++) {
string number;
int curr_number, ans = 0;
cin >> number;
int size = number.size();
bool second = false;
for(int i = 1; i <= size; i++) {
... | 23.870968 | 57 | 0.412162 | BrynjarGeir |
b7a7a97dc4621a06fda2b867d490ded5d636c919 | 545 | cpp | C++ | examples/multithreading/bots/abstractbot.cpp | mamontov-cpp/saddy | f20a0030e18af9e0714fe56c19407fbeacc529a7 | [
"BSD-2-Clause"
] | 58 | 2015-08-09T14:56:35.000Z | 2022-01-15T22:06:58.000Z | examples/multithreading/bots/abstractbot.cpp | mamontov-cpp/saddy-graphics-engine-2d | e25a6637fcc49cb26614bf03b70e5d03a3a436c7 | [
"BSD-2-Clause"
] | 245 | 2015-08-08T08:44:22.000Z | 2022-01-04T09:18:08.000Z | examples/multithreading/bots/abstractbot.cpp | mamontov-cpp/saddy | f20a0030e18af9e0714fe56c19407fbeacc529a7 | [
"BSD-2-Clause"
] | 23 | 2015-12-06T03:57:49.000Z | 2020-10-12T14:15:50.000Z | #include "abstractbot.h"
bots::AbstractBot::AbstractBot() : m_strategy(nullptr)
{
}
bots::AbstractBot::~AbstractBot()
{
if (m_strategy)
{
m_strategy->delRef();
}
}
void bots::AbstractBot::setStrategy(bots::shootingstrategies::ShootingStrategy* strategy)
{
if (m_strategy)
{
m_... | 16.515152 | 89 | 0.638532 | mamontov-cpp |
b7a8f645c57e2970d5f4437928de8934fc50f6de | 619 | cpp | C++ | test/ordinal/container/ordinal_range/ordinal_range_pass.cpp | jwakely/std-make | f09d052983ace70cf371bb8ddf78d4f00330bccd | [
"BSL-1.0"
] | 105 | 2015-01-24T13:26:41.000Z | 2022-02-18T15:36:53.000Z | test/ordinal/container/ordinal_range/ordinal_range_pass.cpp | jwakely/std-make | f09d052983ace70cf371bb8ddf78d4f00330bccd | [
"BSL-1.0"
] | 37 | 2015-09-04T06:57:10.000Z | 2021-09-09T18:01:44.000Z | test/ordinal/container/ordinal_range/ordinal_range_pass.cpp | jwakely/std-make | f09d052983ace70cf371bb8ddf78d4f00330bccd | [
"BSL-1.0"
] | 23 | 2015-01-27T11:09:18.000Z | 2021-10-04T02:23:30.000Z | // Copyright (C) 2016 Vicente J. Botet Escriba
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
// <experimental/ordinal_range.hpp>
#include <experimental/ordinal_range.hpp>
#include "../../Bool.hpp"
#include ... | 22.107143 | 80 | 0.688207 | jwakely |
b7abb6c084120928b4a69973d6c300eb896ff568 | 128 | hpp | C++ | command.hpp | RustedBot/Pong | 8e75d64b306cc4c3db433061dd2e3418b7102354 | [
"MIT"
] | null | null | null | command.hpp | RustedBot/Pong | 8e75d64b306cc4c3db433061dd2e3418b7102354 | [
"MIT"
] | null | null | null | command.hpp | RustedBot/Pong | 8e75d64b306cc4c3db433061dd2e3418b7102354 | [
"MIT"
] | null | null | null | #ifndef COMMAND_H
#define COMMAND_H
class Command
{
public:
virtual void execute() = 0;
private:
};
#endif // COMMAND_H
| 9.142857 | 31 | 0.6875 | RustedBot |
5d9a76fabdd5f79b03fb5b4e69757d24f1f55a0f | 5,766 | cpp | C++ | src/resqml2_0_1/NonSealedSurfaceFrameworkRepresentation.cpp | ringmesh/fesapi | 0b518e71f805f35679a65c78332b5cb64ed97830 | [
"Apache-2.0"
] | null | null | null | src/resqml2_0_1/NonSealedSurfaceFrameworkRepresentation.cpp | ringmesh/fesapi | 0b518e71f805f35679a65c78332b5cb64ed97830 | [
"Apache-2.0"
] | null | null | null | src/resqml2_0_1/NonSealedSurfaceFrameworkRepresentation.cpp | ringmesh/fesapi | 0b518e71f805f35679a65c78332b5cb64ed97830 | [
"Apache-2.0"
] | null | null | null | /*-----------------------------------------------------------------------
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements. See the NOTICE file
distributed with this work for additional information
regarding copyright ownership. The ASF licenses this file
to you under ... | 41.482014 | 208 | 0.776968 | ringmesh |
5d9f9f81221136850585ba427482db4aef9ce359 | 3,499 | cpp | C++ | MasterServer/LMasterServer_PacketProcess_Proc.cpp | MBeanwenshengming/linuxgameserver | f03bf6ba0d625609c9654ddf0dc821386337e7dc | [
"MIT"
] | 5 | 2018-04-02T07:16:20.000Z | 2021-08-01T05:25:37.000Z | MasterServer/LMasterServer_PacketProcess_Proc.cpp | MBeanwenshengming/linuxgameserver | f03bf6ba0d625609c9654ddf0dc821386337e7dc | [
"MIT"
] | null | null | null | MasterServer/LMasterServer_PacketProcess_Proc.cpp | MBeanwenshengming/linuxgameserver | f03bf6ba0d625609c9654ddf0dc821386337e7dc | [
"MIT"
] | 2 | 2015-08-21T07:31:41.000Z | 2018-05-10T12:36:32.000Z | /*
The MIT License (MIT)
Copyright (c) <2010-2020> <wenshengming>
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 restriction, including without limitation the rights
to use, copy, modify... | 31.809091 | 117 | 0.823092 | MBeanwenshengming |
5da40434f93e40fac22f2e9e9ea7bee7395e3bcd | 1,761 | hpp | C++ | RType.Server/Headers/TCPServer.hpp | Mikyan0207/RType | ae3d0e4b3192577eccfb3ba55ac86bd7238e9451 | [
"MIT",
"Unlicense"
] | null | null | null | RType.Server/Headers/TCPServer.hpp | Mikyan0207/RType | ae3d0e4b3192577eccfb3ba55ac86bd7238e9451 | [
"MIT",
"Unlicense"
] | null | null | null | RType.Server/Headers/TCPServer.hpp | Mikyan0207/RType | ae3d0e4b3192577eccfb3ba55ac86bd7238e9451 | [
"MIT",
"Unlicense"
] | null | null | null | #pragma once
#include <memory>
#include <vector>
#include <optional>
#include <thread>
#include <string>
#include <Network/IPacketManager.hpp>
#include <Network/ITCPNetwork.hpp>
#include <Network/Connection.hpp>
#include <Lobby.hpp>
namespace RType
{
class TCPServer : public ITCPNetwork
{
public:
... | 32.611111 | 106 | 0.664395 | Mikyan0207 |
5da4c4c25c5180de10e006f11ebaa79e2b4777e8 | 4,925 | cpp | C++ | Crowny/Source/Crowny/Scripting/Mono/MonoMethod.cpp | bojosos/Nworc | a59cb18412a45a101f877caedf6ed0025a9e44a9 | [
"MIT"
] | 2 | 2021-05-13T17:57:04.000Z | 2021-10-04T07:07:01.000Z | Crowny/Source/Crowny/Scripting/Mono/MonoMethod.cpp | bojosos/Crowny | 5aef056d2c95e04870d2372a87257ad9dccf168a | [
"MIT"
] | null | null | null | Crowny/Source/Crowny/Scripting/Mono/MonoMethod.cpp | bojosos/Crowny | 5aef056d2c95e04870d2372a87257ad9dccf168a | [
"MIT"
] | null | null | null | #include "cwpch.h"
#include "Crowny/Scripting/Mono/MonoClass.h"
#include "Crowny/Scripting/Mono/MonoManager.h"
#include "Crowny/Scripting/Mono/MonoMethod.h"
#include "Crowny/Scripting/Mono/MonoUtils.h"
#include <mono/metadata/attrdefs.h>
#include <mono/metadata/debug-helpers.h>
#include <mono/metadata/loader.h>
#incl... | 32.615894 | 108 | 0.643249 | bojosos |
5da760efdd8c8eaa8b7bff8dbd6d3dc1c382a22f | 4,019 | cpp | C++ | simplefvm/src/FVMSolver/MatrixBuilder/SleMatrixBuilder.cpp | artvns/SimpleFvm | 5a8eca332d6780e738c0bc6c8c2b787b47b5b20d | [
"MIT"
] | 4 | 2022-01-03T08:45:55.000Z | 2022-01-06T19:57:11.000Z | simplefvm/src/FVMSolver/MatrixBuilder/SleMatrixBuilder.cpp | artvns/SimpleFvm | 5a8eca332d6780e738c0bc6c8c2b787b47b5b20d | [
"MIT"
] | null | null | null | simplefvm/src/FVMSolver/MatrixBuilder/SleMatrixBuilder.cpp | artvns/SimpleFvm | 5a8eca332d6780e738c0bc6c8c2b787b47b5b20d | [
"MIT"
] | null | null | null | #include "SleMatrixBuilder.h"
namespace fvmsolver {
SleMatrixBuilder::SleMatrixBuilder(
AbstractCoeffsCalculator& coeffsCalculator,
uPtrDataPort spData) :
spDataPort_(std::move(spData)),
dataPort_(*spDataPort_),
... | 33.491667 | 91 | 0.631003 | artvns |
5da8da04f30037a3ebffb28d5b021149c11fed2d | 951 | cpp | C++ | 2017-08-19/C.cpp | tangjz/Three-Investigators | 46dc9b2f0fbb4fe89b075a81feaacc33feeb1b52 | [
"MIT"
] | 3 | 2018-04-02T06:00:51.000Z | 2018-05-29T04:46:29.000Z | 2017-08-19/C.cpp | tangjz/Three-Investigators | 46dc9b2f0fbb4fe89b075a81feaacc33feeb1b52 | [
"MIT"
] | 2 | 2018-03-31T17:54:30.000Z | 2018-05-02T11:31:06.000Z | 2017-08-19/C.cpp | tangjz/Three-Investigators | 46dc9b2f0fbb4fe89b075a81feaacc33feeb1b52 | [
"MIT"
] | 2 | 2018-10-07T00:08:06.000Z | 2021-06-28T11:02:59.000Z | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int NMAX = 31;
int T, N;
int adj[NMAX][NMAX];
int main()
{
int i, j, k, t;
bool flag;
scanf("%d", &T);
for(t = 0;t < T;t += 1)
{
flag = true;
scanf("%d", &N);
if(N >= 6)
{
for(i = 1;i <= N;i += 1)... | 14.630769 | 51 | 0.392219 | tangjz |
5daa35f4e79a8828c2318ae5eb271a8db9a6d1ab | 1,742 | cpp | C++ | PE/ch14/14.2/winei.cpp | DustOfStars/CppPrimerPlus6 | 391e3ad76eaa99f331981cee72139d83115fc93d | [
"MIT"
] | null | null | null | PE/ch14/14.2/winei.cpp | DustOfStars/CppPrimerPlus6 | 391e3ad76eaa99f331981cee72139d83115fc93d | [
"MIT"
] | null | null | null | PE/ch14/14.2/winei.cpp | DustOfStars/CppPrimerPlus6 | 391e3ad76eaa99f331981cee72139d83115fc93d | [
"MIT"
] | null | null | null | #include <iostream>
#include "winei.h"
using std::cin;
using std::cout;
using std::cerr;
using std::endl;
using std::string;
Wine::Wine(const char * l, int y, const int yr[], const int bot[])
: string(l), years(y), PairArray(ArrayInt(yr,y),ArrayInt(bot,y))
{
}
Wine::Wine(const char * l, const ArrayInt & yr, cons... | 21.775 | 74 | 0.538462 | DustOfStars |
5dacb2657b4b72c1f174c12be72a8cc9e8347f3b | 194 | hpp | C++ | include/mruby_integration/models/colour.hpp | HellRok/Taylor | aa9d901b4db77395a0bde896500016353adcd73b | [
"MIT"
] | 40 | 2021-05-25T04:21:49.000Z | 2022-02-19T05:05:45.000Z | include/mruby_integration/models/colour.hpp | HellRok/Taylor | aa9d901b4db77395a0bde896500016353adcd73b | [
"MIT"
] | 4 | 2021-09-17T06:52:35.000Z | 2021-12-29T23:07:18.000Z | include/mruby_integration/models/colour.hpp | HellRok/Taylor | aa9d901b4db77395a0bde896500016353adcd73b | [
"MIT"
] | 1 | 2021-12-23T00:59:27.000Z | 2021-12-23T00:59:27.000Z | #pragma once
#include "mruby.h"
#include "raylib.h"
extern RClass *Colour_class;
void setup_Colour(mrb_state*, mrb_value, Color*, int, int, int, int);
void append_models_Colour(mrb_state*);
| 17.636364 | 69 | 0.747423 | HellRok |
5dad76ffbddaefea91423f5e315c49c177c7cac1 | 2,745 | cpp | C++ | 图论/差分约束/acwing_1170.cpp | tempure/algorithm-advance | 38c4504f64cd3fd15fc32cf20a541ad5ba2ad82b | [
"MIT"
] | 3 | 2020-11-16T08:58:30.000Z | 2020-11-16T08:58:33.000Z | 图论/差分约束/acwing_1170.cpp | tempure/algorithm-advance | 38c4504f64cd3fd15fc32cf20a541ad5ba2ad82b | [
"MIT"
] | null | null | null | 图论/差分约束/acwing_1170.cpp | tempure/algorithm-advance | 38c4504f64cd3fd15fc32cf20a541ad5ba2ad82b | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a; i< n; i++)
#define per(i,a,n) for(int i=n-1; i>=a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define x first
#define y second
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef long lo... | 26.394231 | 112 | 0.488889 | tempure |
5dade33a7eb95eb746d98e0eecfccaeba73f0c6f | 3,870 | cpp | C++ | MMC/MMCKeys/keysmanager.cpp | Myweik/MMC_qgroundcontrol | 3aa97928d30fc9de56fde2a0d37a49245de83da4 | [
"Apache-2.0"
] | 2 | 2020-04-14T12:50:53.000Z | 2021-07-19T02:09:04.000Z | MMC/MMCKeys/keysmanager.cpp | Myweik/MMC_qgroundcontrol | 3aa97928d30fc9de56fde2a0d37a49245de83da4 | [
"Apache-2.0"
] | 5 | 2020-07-01T21:31:53.000Z | 2021-02-01T10:53:39.000Z | MMC/MMCKeys/keysmanager.cpp | Myweik/MMC_qgroundcontrol | 3aa97928d30fc9de56fde2a0d37a49245de83da4 | [
"Apache-2.0"
] | 2 | 2020-05-11T03:11:11.000Z | 2021-02-03T10:53:03.000Z | #include "keysmanager.h"
#include "QGCApplication.h"
#include "MMC/MMCMount/mmcmount.h"
MMCKey::MMCKey(int id, QObject *parent) : QObject(parent), _id(id)
{
_timer = new QTimer(this);
_timer->setInterval(100);
connect(_timer, SIGNAL(timeout()), this, SLOT(onTimerOut()));
}
void MMCKey::setKey(bool key)
{
... | 26.326531 | 164 | 0.576486 | Myweik |
5db2c6544db63edb6f90ac06ac4cdcc4bd2e6add | 2,796 | cpp | C++ | src/vm/systemCalls.optionals.cpp | DosWorld/tmbasic | 99bd593bb074df6af83d952259b5eb81588f1e3f | [
"MIT"
] | 1 | 2022-01-29T05:45:46.000Z | 2022-01-29T05:45:46.000Z | src/vm/systemCalls.optionals.cpp | DosWorld/tmbasic | 99bd593bb074df6af83d952259b5eb81588f1e3f | [
"MIT"
] | null | null | null | src/vm/systemCalls.optionals.cpp | DosWorld/tmbasic | 99bd593bb074df6af83d952259b5eb81588f1e3f | [
"MIT"
] | null | null | null | #include "systemCall.h"
#include "Error.h"
#include "Optional.h"
namespace vm {
static std::pair<const ValueOptional*, const ObjectOptional*> valueOrObjectOptional(const Object& object) {
const auto* valueOptional = dynamic_cast<const ValueOptional*>(&object);
if (valueOptional != nullptr) {
return { ... | 39.380282 | 107 | 0.664521 | DosWorld |
5db4dcaa97c8e90d29947b66e5a3ddc51388d606 | 7,673 | hpp | C++ | contrib/native/client/src/clientlib/streamSocket.hpp | akumarb2010/incubator-drill | a690b97074376a65ac0c1d86ee2a9fa32e997003 | [
"Apache-2.0"
] | 1 | 2020-12-27T04:08:49.000Z | 2020-12-27T04:08:49.000Z | contrib/native/client/src/clientlib/streamSocket.hpp | akumarb2010/incubator-drill | a690b97074376a65ac0c1d86ee2a9fa32e997003 | [
"Apache-2.0"
] | null | null | null | contrib/native/client/src/clientlib/streamSocket.hpp | akumarb2010/incubator-drill | a690b97074376a65ac0c1d86ee2a9fa32e997003 | [
"Apache-2.0"
] | 2 | 2019-11-12T09:21:02.000Z | 2019-12-16T09:51:25.000Z | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you ... | 35.03653 | 114 | 0.619314 | akumarb2010 |
5db85986044fcfd4415bf089cdc1a101c59bbf90 | 12,638 | hpp | C++ | src/bpsw.hpp | NewYaroslav/xalgorithms | ffb9abc6107bed496382b053f333c40fab61a700 | [
"MIT"
] | null | null | null | src/bpsw.hpp | NewYaroslav/xalgorithms | ffb9abc6107bed496382b053f333c40fab61a700 | [
"MIT"
] | null | null | null | src/bpsw.hpp | NewYaroslav/xalgorithms | ffb9abc6107bed496382b053f333c40fab61a700 | [
"MIT"
] | null | null | null | /*
Тест BPSW на простоту чисел
Источник: http://e-maxx.ru/algo/bpsw
*/
#ifndef XA_BPSW_HPP_INCLUDED
#define XA_BPSW_HPP_INCLUDED
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
namespace xaBPSW {
//! Модуль 64-битного числа
long long abs (long long n) {
return n < 0 ? ... | 26.219917 | 228 | 0.438835 | NewYaroslav |
5dbcd6f5f5fb732707e72a761ff1cc70ea0b752d | 1,202 | hpp | C++ | src/custom_topic/include/topic_pubsub/pub.hpp | IntelligentSystemsLabUTV/ros2_examples | b34d9238d680dd6b06177586f81bfed0bae31eb2 | [
"MIT"
] | null | null | null | src/custom_topic/include/topic_pubsub/pub.hpp | IntelligentSystemsLabUTV/ros2_examples | b34d9238d680dd6b06177586f81bfed0bae31eb2 | [
"MIT"
] | null | null | null | src/custom_topic/include/topic_pubsub/pub.hpp | IntelligentSystemsLabUTV/ros2_examples | b34d9238d680dd6b06177586f81bfed0bae31eb2 | [
"MIT"
] | null | null | null | /**
* Publisher definition.
*
* Roberto Masocco <robmasocco@gmail.com>
*
* November 22, 2021
*/
#ifndef PUB_HPP
#define PUB_HPP
#include <rclcpp/rclcpp.hpp> //! rclcpp base library
#include <ros2_examples_interfaces/msg/string.hpp> //! This time we use our own
#define PUB_PERIOD 300 // Publisher transmission ... | 26.130435 | 81 | 0.72629 | IntelligentSystemsLabUTV |
5dbfe826e98c69989b1f53d2c6478b563182aedc | 1,664 | cpp | C++ | B05576_07_Code/rosbook_arm_snippets/src/move_group_plan_single_target.cpp | podhrmic/Effective-Robotics-Programming-with-ROS | 9c5f3188bfdb47d6d0ee5c36da803e2381fb1a00 | [
"MIT"
] | 46 | 2017-02-11T18:28:57.000Z | 2021-12-12T07:55:22.000Z | B05576_07_Code/rosbook_arm_snippets/src/move_group_plan_single_target.cpp | podhrmic/Effective-Robotics-Programming-with-ROS | 9c5f3188bfdb47d6d0ee5c36da803e2381fb1a00 | [
"MIT"
] | 1 | 2017-03-22T13:07:55.000Z | 2020-11-02T09:12:52.000Z | B05576_07_Code/rosbook_arm_snippets/src/move_group_plan_single_target.cpp | podhrmic/Effective-Robotics-Programming-with-ROS | 9c5f3188bfdb47d6d0ee5c36da803e2381fb1a00 | [
"MIT"
] | 23 | 2016-12-30T05:11:37.000Z | 2021-05-04T15:08:34.000Z | #include <moveit/move_group_interface/move_group.h>
#include <moveit_msgs/DisplayTrajectory.h>
int main(int argc, char **argv)
{
// Initialize ROS, create the node handle and an async spinner
ros::init(argc, argv, "move_group_plan_single_target");
ros::NodeHandle nh;
ros::AsyncSpinner spin(1);
sp... | 30.254545 | 123 | 0.695913 | podhrmic |
5dc04855bd8ddedfd58cc73ff07656b9fcc9f8ac | 882 | cpp | C++ | leetcode/Hashmap/49.cpp | codehuanglei/- | 933a55b5c5a49163f12e0c39b4edfa9c4f01678f | [
"MIT"
] | null | null | null | leetcode/Hashmap/49.cpp | codehuanglei/- | 933a55b5c5a49163f12e0c39b4edfa9c4f01678f | [
"MIT"
] | null | null | null | leetcode/Hashmap/49.cpp | codehuanglei/- | 933a55b5c5a49163f12e0c39b4edfa9c4f01678f | [
"MIT"
] | null | null | null | #include<iostream>
#include<unordered_map>
#include<vector>
#include<algorithm>
using namespace std;
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
vector<vector<string>> res;
unordered_map<string,vector<string>> map;
for(string s : strs){
... | 23.837838 | 65 | 0.510204 | codehuanglei |
5dc40e9c639f7b42e1895144a209170499da2c2e | 561 | hpp | C++ | include/ccbase/utility/bytes.hpp | adityaramesh/ccbase | 595e1416aab3cc8bc976aad9bb3e262c7d11e3b2 | [
"BSD-3-Clause-Clear"
] | 8 | 2015-01-08T05:44:43.000Z | 2021-05-11T15:54:17.000Z | include/ccbase/utility/bytes.hpp | adityaramesh/ccbase | 595e1416aab3cc8bc976aad9bb3e262c7d11e3b2 | [
"BSD-3-Clause-Clear"
] | 1 | 2016-01-31T08:48:53.000Z | 2016-01-31T08:54:28.000Z | include/ccbase/utility/bytes.hpp | adityaramesh/ccbase | 595e1416aab3cc8bc976aad9bb3e262c7d11e3b2 | [
"BSD-3-Clause-Clear"
] | 2 | 2015-03-26T11:08:18.000Z | 2016-01-30T03:28:06.000Z | /*
** File Name: bytes.hpp
** Author: Aditya Ramesh
** Date: 07/09/2014
** Contact: _@adityaramesh.com
*/
#ifndef Z66BE627C_AD04_47FD_9360_9A51E7280DC8
#define Z66BE627C_AD04_47FD_9360_9A51E7280DC8
#include <cstdint>
constexpr uint64_t
operator ""_KB(unsigned long long int x)
{ return x << 10; }
constexpr... | 18.7 | 45 | 0.716578 | adityaramesh |
5dc5ddbdb072da284c0a9d7aafb8e7ebed1790e8 | 2,377 | cpp | C++ | mp/src/game/server/Mod/ClassicPhases.cpp | hekar/luminousforts-2013 | 09f07df4def93fa0d774721375a6c7c9da26d71f | [
"Unlicense"
] | 7 | 2019-02-04T01:17:26.000Z | 2022-02-26T21:36:34.000Z | mp/src/game/server/Mod/ClassicPhases.cpp | hekar/luminousforts-2013 | 09f07df4def93fa0d774721375a6c7c9da26d71f | [
"Unlicense"
] | 11 | 2016-05-06T22:44:46.000Z | 2016-05-06T22:45:03.000Z | mp/src/game/server/Mod/ClassicPhases.cpp | hekar/luminousforts-2013 | 09f07df4def93fa0d774721375a6c7c9da26d71f | [
"Unlicense"
] | 2 | 2016-06-28T11:34:53.000Z | 2017-04-01T18:08:46.000Z | /* ***** BEGIN LICENSE BLOCK *****
Version: MPL 1.1/LGPL 2.1/GPL 2.0
The contents of this file are subject to the Mozilla Public License Version
1.1 (the "License"); you may not use this file except in compliance with
...
for the specific language governing rights and limitations under the
License.
The Original Code... | 22.855769 | 76 | 0.700042 | hekar |
5dcaaef856d43a2166ded3825b63f727ed989dbf | 770 | hpp | C++ | src/OpenJijDotNet.Native/openjij/utility/Xorshift.hpp | takuya-takeuchi/OpenJijDotNet | e1cd30efbf0c561e89bc10bd90cd36a3176ad09a | [
"MIT"
] | null | null | null | src/OpenJijDotNet.Native/openjij/utility/Xorshift.hpp | takuya-takeuchi/OpenJijDotNet | e1cd30efbf0c561e89bc10bd90cd36a3176ad09a | [
"MIT"
] | null | null | null | src/OpenJijDotNet.Native/openjij/utility/Xorshift.hpp | takuya-takeuchi/OpenJijDotNet | e1cd30efbf0c561e89bc10bd90cd36a3176ad09a | [
"MIT"
] | null | null | null | #ifndef _CPP_UTILITY_XORSHIFT_H_
#define _CPP_UTILITY_XORSHIFT_H_
#include "../export.hpp"
#include "../shared.hpp"
#include <random>
#include <utility/random.hpp>
using namespace openjij;
using namespace openjij::utility;
DLLEXPORT Xorshift* utility_Xorshift_new()
{
return new Xorshift();
}
DLLEXPORT Xorshift... | 17.5 | 64 | 0.758442 | takuya-takeuchi |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.