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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d896163823ae01eb3832beaccbb5f68748304b9c | 1,752 | hpp | C++ | Siv3D/include/Siv3D/Types.hpp | Fuyutsubaki/OpenSiv3D | 4370f6ebe28addd39bfdd75915c5a18e3e5e9273 | [
"MIT"
] | 1 | 2018-05-23T10:57:32.000Z | 2018-05-23T10:57:32.000Z | Siv3D/include/Siv3D/Types.hpp | Fuyutsubaki/OpenSiv3D | 4370f6ebe28addd39bfdd75915c5a18e3e5e9273 | [
"MIT"
] | null | null | null | Siv3D/include/Siv3D/Types.hpp | Fuyutsubaki/OpenSiv3D | 4370f6ebe28addd39bfdd75915c5a18e3e5e9273 | [
"MIT"
] | 1 | 2019-10-06T17:09:26.000Z | 2019-10-06T17:09:26.000Z | //-----------------------------------------------
//
// This file is part of the Siv3D Engine.
//
// Copyright (c) 2008-2018 Ryo Suzuki
// Copyright (c) 2016-2018 OpenSiv3D Project
//
// Licensed under the MIT License.
//
//-----------------------------------------------
# pragma once
# include <cstdint>
# include <io... | 20.372093 | 50 | 0.526826 | Fuyutsubaki |
d896b849aca3377adb70454abf8381637548e109 | 538 | hpp | C++ | include/sktest/ansi_color.hpp | kagurakanon/skjvm | bca3354777eebaf531087f19bb0c6914f639a15a | [
"Unlicense"
] | null | null | null | include/sktest/ansi_color.hpp | kagurakanon/skjvm | bca3354777eebaf531087f19bb0c6914f639a15a | [
"Unlicense"
] | null | null | null | include/sktest/ansi_color.hpp | kagurakanon/skjvm | bca3354777eebaf531087f19bb0c6914f639a15a | [
"Unlicense"
] | null | null | null | #ifndef sktest_ansi_color_hpp
#define sktest_ansi_color_hpp
#define BOLD_RED "\033[31;1m"
#define RED "\033[31m"
#define BOLD_GREEN "\033[32;1m"
#define GREEN "\033[32m"
#define BLUE "\033[34m"
#define BOLD "\033[1m"
#define RESET "\033[0m"
#define bold_red(string) BOLD_RED string RESET
#define red(string) RED str... | 21.52 | 50 | 0.760223 | kagurakanon |
d8b7ab0f0d2fc85cccd5b4d753b21f947470e5fe | 2,154 | cpp | C++ | main.cpp | hamada147/Turning-Machine | 572619594084e8321789e543188f5958854f23f7 | [
"MIT"
] | null | null | null | main.cpp | hamada147/Turning-Machine | 572619594084e8321789e543188f5958854f23f7 | [
"MIT"
] | null | null | null | main.cpp | hamada147/Turning-Machine | 572619594084e8321789e543188f5958854f23f7 | [
"MIT"
] | null | null | null | #include <iostream>
#include <list>
#include "TurningMachine.h"
#include "TurningMachineTransition.h"
using namespace std;
void main()
{
string Q0 = "q0"; // start state
string q[] = { "q0", "q1", "q2", "q3" }; // the exisiting state
char s[] = { '0', '1' }; // the existing letters
TurningMachineTransit... | 36.508475 | 125 | 0.623955 | hamada147 |
d8b997e1ee4d6e1f2f4d31a8d3b97d270036a67e | 797 | cpp | C++ | Kattis/oddmanout.cpp | YourName0729/competitive-programming | 437ef18a46074f520e0bfa0bdd718bb6b1c92800 | [
"MIT"
] | 3 | 2021-02-19T17:01:11.000Z | 2021-03-11T16:50:19.000Z | Kattis/oddmanout.cpp | YourName0729/competitive-programming | 437ef18a46074f520e0bfa0bdd718bb6b1c92800 | [
"MIT"
] | null | null | null | Kattis/oddmanout.cpp | YourName0729/competitive-programming | 437ef18a46074f520e0bfa0bdd718bb6b1c92800 | [
"MIT"
] | null | null | null | //
// https://open.kattis.com/problems/oddmanout
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <iomanip>
#include <sstream>
#include <vector>
#include <iomanip>
#include <map>
#define Forcase int T; cin>>T; for(int t = 1; t <= T; t++)
#define Forever while(true)
using namespace ... | 16.604167 | 58 | 0.449184 | YourName0729 |
d8bcc4329605103d6e07398a907ca7a2e51d5f4b | 1,496 | cpp | C++ | tests/all_tests.cpp | olegpublicprofile/stdfwd | 19671bcc8e53bd4c008f07656eaf25a22495e093 | [
"MIT"
] | 11 | 2021-03-15T07:06:21.000Z | 2021-09-27T13:54:25.000Z | tests/all_tests.cpp | olegpublicprofile/stdfwd | 19671bcc8e53bd4c008f07656eaf25a22495e093 | [
"MIT"
] | null | null | null | tests/all_tests.cpp | olegpublicprofile/stdfwd | 19671bcc8e53bd4c008f07656eaf25a22495e093 | [
"MIT"
] | 1 | 2021-06-24T10:46:46.000Z | 2021-06-24T10:46:46.000Z | #include "all_tests.hpp"
#include "tests/headers_tests/container_headers_tests.hpp"
#include "tests/headers_tests/utility_headers_tests.hpp"
#include "tests/headers_tests/string_headers_tests.hpp"
#include "tests/headers_tests/filesystem_headers_tests.hpp"
#include "tests/headers_tests/thread_headers_tests.hpp"
#inclu... | 34.790698 | 80 | 0.692513 | olegpublicprofile |
d8c740d37896fbecdfa2ab1292e0c02eeb78c423 | 2,596 | cpp | C++ | Lumi/src/Lumi/Renderer/Buffer.cpp | ChillyHub/Lumi | 54977f228207471ba917e7fd93d0b44f49bec04e | [
"MIT"
] | null | null | null | Lumi/src/Lumi/Renderer/Buffer.cpp | ChillyHub/Lumi | 54977f228207471ba917e7fd93d0b44f49bec04e | [
"MIT"
] | null | null | null | Lumi/src/Lumi/Renderer/Buffer.cpp | ChillyHub/Lumi | 54977f228207471ba917e7fd93d0b44f49bec04e | [
"MIT"
] | null | null | null | #include "pch.h"
#include "Buffer.h"
#include "Renderer.h"
#include "Platform/OpenGL/OpenGLBuffer.h"
namespace Lumi
{
/////////////////////////////////////////////////////////////////////
// class VertexBuffer
// ------------------
std::shared_ptr<VertexBuffer> VertexBuffer::Create(unsigned int count)
{
LM_PR... | 28.527473 | 92 | 0.678737 | ChillyHub |
d8cd74fed69e6b3a7dc40297ab8056c00d592561 | 4,357 | cpp | C++ | Project/12-QPainter_Coord/mainwindow.cpp | liukai-tech/Qt-Learning | 5f7d29f5868b6fa8b9340095af6cd025f94f698f | [
"MIT"
] | null | null | null | Project/12-QPainter_Coord/mainwindow.cpp | liukai-tech/Qt-Learning | 5f7d29f5868b6fa8b9340095af6cd025f94f698f | [
"MIT"
] | null | null | null | Project/12-QPainter_Coord/mainwindow.cpp | liukai-tech/Qt-Learning | 5f7d29f5868b6fa8b9340095af6cd025f94f698f | [
"MIT"
] | null | null | null | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <QPainter>
#include <QPaintEvent>
#include <QEvent>
//在label控件内动态绘制轨迹
//参考 https://blog.csdn.net/qq_41399894/article/details/88051337
int count = 0;
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent)
, ui(new Ui::MainWindow)
{
ui->se... | 23.175532 | 82 | 0.611889 | liukai-tech |
d8d2c822be16eb71314a5cba0bf6a003b66a276a | 541 | cpp | C++ | ecs256/BoxPack/src/RcppExports.cpp | nick-ulle/teaching-notes | 3ffc527153570c1f4d31d4d19fe0d993442ea225 | [
"BSD-3-Clause-Clear"
] | 28 | 2017-03-31T03:15:13.000Z | 2020-09-21T19:58:35.000Z | ecs256/BoxPack/src/RcppExports.cpp | nick-ulle/teaching-notes | 3ffc527153570c1f4d31d4d19fe0d993442ea225 | [
"BSD-3-Clause-Clear"
] | null | null | null | ecs256/BoxPack/src/RcppExports.cpp | nick-ulle/teaching-notes | 3ffc527153570c1f4d31d4d19fe0d993442ea225 | [
"BSD-3-Clause-Clear"
] | 33 | 2018-01-12T04:17:08.000Z | 2021-11-24T04:31:05.000Z | // This file was generated by Rcpp::compileAttributes
// Generator token: 10BE3573-1514-4C36-9D1C-5A225CD40393
#include <Rcpp.h>
using namespace Rcpp;
// pack_boxes
List pack_boxes(int n, NumericVector p);
RcppExport SEXP BoxPack_pack_boxes(SEXP nSEXP, SEXP pSEXP) {
BEGIN_RCPP
Rcpp::RObject __result;
Rcpp::R... | 27.05 | 66 | 0.735675 | nick-ulle |
d8d994ab48010e4940d3829f9bc226ae044f3e9e | 3,339 | cpp | C++ | tests/FIRTestSuite.cpp | ianran/DSP-lite | 6c4cf040abf18a4c8e7bc0ba970df7ad77b1f0fe | [
"MIT"
] | null | null | null | tests/FIRTestSuite.cpp | ianran/DSP-lite | 6c4cf040abf18a4c8e7bc0ba970df7ad77b1f0fe | [
"MIT"
] | null | null | null | tests/FIRTestSuite.cpp | ianran/DSP-lite | 6c4cf040abf18a4c8e7bc0ba970df7ad77b1f0fe | [
"MIT"
] | null | null | null | /* Copyright 2018 Ian Rankin
*
* 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, merge,
* publish, distri... | 35.147368 | 99 | 0.573824 | ianran |
d8e0dea5dd13274eb7a46f819792391f73b292ab | 3,387 | hpp | C++ | include/Type.hpp | LudwigBoltzmann/NeuralNetwork | 490b345b3b6dd7bb0b97302c55bb5b7cc13f9598 | [
"MIT"
] | 1 | 2017-02-25T23:11:09.000Z | 2017-02-25T23:11:09.000Z | include/Type.hpp | LudwigBoltzmann/NeuralNetwork | 490b345b3b6dd7bb0b97302c55bb5b7cc13f9598 | [
"MIT"
] | null | null | null | include/Type.hpp | LudwigBoltzmann/NeuralNetwork | 490b345b3b6dd7bb0b97302c55bb5b7cc13f9598 | [
"MIT"
] | null | null | null | #ifndef TYPE_H
#define TYPE_H
#include "vector"
#include <iostream>
#include "math.h"
#include "time.h"
#include "omp.h"
#include "cilk/reducer.h"
#include "cilk/cilk.h"
#include "cilk/reducer_opadd.h"
namespace DeepLearning
{
// columnwise template matrix class
template <typename type>
class tensor
{... | 27.762295 | 95 | 0.517272 | LudwigBoltzmann |
d8e1e430ac443761d808f53ae9dc141b10ac0150 | 385 | cpp | C++ | FileUtilities.cpp | refik-karic/ZSharp | 643d4d7603e91d5b9150bf8ddfed8b1eab930b92 | [
"MIT"
] | null | null | null | FileUtilities.cpp | refik-karic/ZSharp | 643d4d7603e91d5b9150bf8ddfed8b1eab930b92 | [
"MIT"
] | null | null | null | FileUtilities.cpp | refik-karic/ZSharp | 643d4d7603e91d5b9150bf8ddfed8b1eab930b92 | [
"MIT"
] | null | null | null | #include "FileUtilities.h"
#include <fstream>
namespace ZSharp {
void ReadFileToBuffer(const char* fileName, std::vector<char>& fileBuffer) {
std::ifstream inputStream(fileName, std::ios::binary);
if (!inputStream.is_open()) {
return;
}
fileBuffer = std::vector<char>(std::istreambuf_iterato... | 20.263158 | 114 | 0.685714 | refik-karic |
d8e926ac4563a9be38abdfd8db7e4d3db8060434 | 549 | cpp | C++ | A/A1375.cpp | Darknez07/Codeforces-sol | afd926c197f43784c12220430bb3c06011bb185e | [
"MIT"
] | null | null | null | A/A1375.cpp | Darknez07/Codeforces-sol | afd926c197f43784c12220430bb3c06011bb185e | [
"MIT"
] | null | null | null | A/A1375.cpp | Darknez07/Codeforces-sol | afd926c197f43784c12220430bb3c06011bb185e | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
// Not understood
using namespace std;
int main(){
int t,n;
cin>>t;
while(t--){
cin>>n;
vector<long> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
for(int i=0;i<n;i++){
if(v[i] >= 0 && i % 2 == 1){
... | 20.333333 | 46 | 0.333333 | Darknez07 |
d8e949088456e3247276d296f1708ac31c5076aa | 14,635 | cpp | C++ | gcsdk/sqlaccess/schemafull.cpp | DannyParker0001/Kisak-Strike | 99ed85927336fe3aff2efd9b9382b2b32eb1d05d | [
"Unlicense"
] | 252 | 2020-12-16T15:34:43.000Z | 2022-03-31T23:21:37.000Z | tf2_src/gcsdk/sqlaccess/schemafull.cpp | Counter2828/TeamFortress2 | 1b81dded673d49adebf4d0958e52236ecc28a956 | [
"MIT"
] | 23 | 2020-12-20T18:02:54.000Z | 2022-03-28T16:58:32.000Z | tf2_src/gcsdk/sqlaccess/schemafull.cpp | Counter2828/TeamFortress2 | 1b81dded673d49adebf4d0958e52236ecc28a956 | [
"MIT"
] | 42 | 2020-12-19T04:32:33.000Z | 2022-03-30T06:00:28.000Z | //========= Copyright Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
// $NoKeywords: $
//=============================================================================
#include "stdafx.h"
// memdbgon must be the last include file in a .cpp file!!!
#include "tier0/memdbgon.h"
namespace GCSDK... | 35.695122 | 164 | 0.553946 | DannyParker0001 |
d8eb7288ba741f466815cc973fa5a71c6f977d4c | 11,165 | cc | C++ | xentrace.cc | chonghw/xenpwn | de3f3c2f839cd18099042585fa9900097082a314 | [
"MIT"
] | 150 | 2016-08-04T02:00:20.000Z | 2021-11-23T08:04:35.000Z | xentrace.cc | chonghw/xenpwn | de3f3c2f839cd18099042585fa9900097082a314 | [
"MIT"
] | 2 | 2016-11-02T08:53:20.000Z | 2020-07-16T14:11:42.000Z | xentrace.cc | felixwilhelm/xenpwn | de3f3c2f839cd18099042585fa9900097082a314 | [
"MIT"
] | 29 | 2016-08-04T04:23:33.000Z | 2021-11-23T08:04:36.000Z | #include <iostream>
#include <set>
#include "spdlog/spdlog.h"
#include "cmdline/cmdline.h"
#include "utils.h"
#include "error.h"
#include "state.h"
#include "events.h"
#include "vmi_helper.h"
void main_loop(std::string log, int debug, std::string vmid);
std::vector<std::pair<addr_t, uint16_t>> get_domains(State* s);
... | 32.456395 | 80 | 0.593372 | chonghw |
d8f21da4c84a6dd612f22d65ae1c51b36ddcde88 | 345 | hpp | C++ | libs/dkutil/include/dkutil_cli_misc.hpp | Goreli/DKCPPDEV | 9436183d8b92fe62f32c3d227fa044c429724129 | [
"MIT"
] | 1 | 2019-10-27T13:26:55.000Z | 2019-10-27T13:26:55.000Z | libs/dkutil/include/dkutil_cli_misc.hpp | Goreli/DKCPPDEV | 9436183d8b92fe62f32c3d227fa044c429724129 | [
"MIT"
] | null | null | null | libs/dkutil/include/dkutil_cli_misc.hpp | Goreli/DKCPPDEV | 9436183d8b92fe62f32c3d227fa044c429724129 | [
"MIT"
] | null | null | null | /* dkutil_cli_misc.hpp
Declares miscellaneous CLI routines.
Copyright(c) 2019 David Krikheli
Modification history:
10/May/2020 - David Krikheli created the module.
*/
#ifndef dkutil_cli_misc_hpp
#define dkutil_cli_misc_hpp
namespace dk {
void forceThousandsSeparators(std::ostream& os);
}; // namespace dk
#endi... | 20.294118 | 52 | 0.782609 | Goreli |
2b05a4e19bc257b76b62efd11e94c950102aa0b7 | 752 | cpp | C++ | csgocheat/menu/framework/c_text.cpp | garryhvh420/e_xyz | 668d8c8c2b7ccfc3bae9e321b1a50379a5e33ec9 | [
"Apache-2.0"
] | 4 | 2020-08-13T11:11:31.000Z | 2021-09-24T16:55:42.000Z | csgocheat/menu/framework/c_text.cpp | garryhvh420/e_xyz | 668d8c8c2b7ccfc3bae9e321b1a50379a5e33ec9 | [
"Apache-2.0"
] | null | null | null | csgocheat/menu/framework/c_text.cpp | garryhvh420/e_xyz | 668d8c8c2b7ccfc3bae9e321b1a50379a5e33ec9 | [
"Apache-2.0"
] | 6 | 2020-07-15T17:00:14.000Z | 2022-03-25T07:45:13.000Z | #include "c_text.h"
#include "../../hooks/idirect3ddevice9.h"
c_text::c_text(const std::pair<std::string, char> text, const c_color color, const uint32_t font, const uint8_t flags, const bool centered) :
c_drawable(c_vector2d()), text(text), color(color), font(font), flags(flags), centered(centered)
{
_rt(txt, text)... | 25.066667 | 141 | 0.702128 | garryhvh420 |
2b06f4bbfb0a0e3b6618de85ead334359ba0504a | 134 | cpp | C++ | GameIntegration/Random.cpp | AdiBaby/NetworkingGame | 31b3ec1acd3711bdb43c609a74076e0650dea642 | [
"FSFAP"
] | null | null | null | GameIntegration/Random.cpp | AdiBaby/NetworkingGame | 31b3ec1acd3711bdb43c609a74076e0650dea642 | [
"FSFAP"
] | null | null | null | GameIntegration/Random.cpp | AdiBaby/NetworkingGame | 31b3ec1acd3711bdb43c609a74076e0650dea642 | [
"FSFAP"
] | null | null | null | #include "Random.h"
#include <chrono>
std::mt19937 Random::generator(std::chrono::system_clock::now().time_since_epoch().count()); | 33.5 | 92 | 0.723881 | AdiBaby |
2b09d138df8e2662826497db9ec577feb8a0ad54 | 13,131 | cpp | C++ | GCS_UTM.cpp | ClaudioLelis/UTM_TestBed | fee8d42cf481125f944ea5f70b31a13ec29fa378 | [
"MIT"
] | null | null | null | GCS_UTM.cpp | ClaudioLelis/UTM_TestBed | fee8d42cf481125f944ea5f70b31a13ec29fa378 | [
"MIT"
] | null | null | null | GCS_UTM.cpp | ClaudioLelis/UTM_TestBed | fee8d42cf481125f944ea5f70b31a13ec29fa378 | [
"MIT"
] | 1 | 2021-09-03T21:33:52.000Z | 2021-09-03T21:33:52.000Z | #include "GCS_UTM.h"
void GCS_UTM::updateSlots()
{
for (auto company : CompanyList)
{
for (auto const& [key, uav] : company->UAV_MAP)
{
//Update UAV Data
Coord uavGridPos = geoToGrid(Geo( uav->lat, uav->lon), gconf);
... | 35.975342 | 153 | 0.444749 | ClaudioLelis |
2b0dde5ff26e2c98a3c8f43e4c6b32770d9fb5d4 | 7,233 | cpp | C++ | test/planner/plan_node_test.cpp | AndiLynn/terrier | 6002f8a902d3d0d19bc67998514098f8b41ca264 | [
"MIT"
] | null | null | null | test/planner/plan_node_test.cpp | AndiLynn/terrier | 6002f8a902d3d0d19bc67998514098f8b41ca264 | [
"MIT"
] | 5 | 2019-04-08T20:47:46.000Z | 2019-04-24T22:11:28.000Z | test/planner/plan_node_test.cpp | AndiLynn/terrier | 6002f8a902d3d0d19bc67998514098f8b41ca264 | [
"MIT"
] | 1 | 2021-10-08T01:22:25.000Z | 2021-10-08T01:22:25.000Z | #include <memory>
#include <random>
#include <string>
#include <utility>
#include <vector>
#include "parser/expression/comparison_expression.h"
#include "parser/expression/star_expression.h"
#include "parser/expression/tuple_value_expression.h"
#include "parser/postgresparser.h"
#include "planner/plannodes/create_datab... | 46.365385 | 118 | 0.671644 | AndiLynn |
2b0e4b24d3a6ca701c0c5a056bd29ad0f28a6991 | 981 | hpp | C++ | VMIGameEngine/include/VMIGame/Keyboard.hpp | bakerjm24450/EE142 | 71ac007fe6850ced5b57336edfd9ddbae37f28c3 | [
"MIT"
] | null | null | null | VMIGameEngine/include/VMIGame/Keyboard.hpp | bakerjm24450/EE142 | 71ac007fe6850ced5b57336edfd9ddbae37f28c3 | [
"MIT"
] | null | null | null | VMIGameEngine/include/VMIGame/Keyboard.hpp | bakerjm24450/EE142 | 71ac007fe6850ced5b57336edfd9ddbae37f28c3 | [
"MIT"
] | null | null | null | #pragma once
#ifndef VMI_GAME_KEYBOARD_H
#define VMI_GAME_KEYBOARD_H
namespace vmi {
// Define the keycodes. Note that we're just
// copying the definition from SFML so that we can
// simply pass the keycode on to the SFML function.
enum class Key {
Unknown = -1, A = 0, B, C,
D, E, F, G,
H, I, J, K,
... | 23.357143 | 52 | 0.643221 | bakerjm24450 |
2b13351b82d798a74f23709e50aea49f8087165f | 1,756 | cpp | C++ | src/game/GameState.cpp | ciscprocess/pe-econ-sim | 0d33507a451aace0d8157b45c29bfc582e6b3c18 | [
"Apache-2.0"
] | null | null | null | src/game/GameState.cpp | ciscprocess/pe-econ-sim | 0d33507a451aace0d8157b45c29bfc582e6b3c18 | [
"Apache-2.0"
] | 5 | 2015-07-14T02:30:37.000Z | 2015-07-26T22:11:28.000Z | src/game/GameState.cpp | ciscprocess/pe-econ-sim | 0d33507a451aace0d8157b45c29bfc582e6b3c18 | [
"Apache-2.0"
] | null | null | null | //
// Created by Nathan on 7/10/2015.
//
#include <numeric/Random.h>
#include "game/GameState.h"
namespace undocked {
namespace game {
using world::CellularBoard;
extern numeric::Random random;
void GameState::tick() {
for (std::map<void*, GameActionQueue>::iterator i = actions... | 29.762712 | 107 | 0.470387 | ciscprocess |
2b1385fbfc701e9357ed02fed578927d086e89de | 2,431 | cc | C++ | src/cpu/vpred/lvp.cc | surya00060/ece-565-course-project | cb96f9be0aa21b6e1a5e10fa62bbb119f3c3a1cd | [
"BSD-3-Clause"
] | null | null | null | src/cpu/vpred/lvp.cc | surya00060/ece-565-course-project | cb96f9be0aa21b6e1a5e10fa62bbb119f3c3a1cd | [
"BSD-3-Clause"
] | null | null | null | src/cpu/vpred/lvp.cc | surya00060/ece-565-course-project | cb96f9be0aa21b6e1a5e10fa62bbb119f3c3a1cd | [
"BSD-3-Clause"
] | 1 | 2020-12-15T20:53:56.000Z | 2020-12-15T20:53:56.000Z | #include "cpu/vpred/lvp.hh"
#include "base/intmath.hh"
// #include "base/logging.hh"
// #include "base/trace.hh"
// #include "debug/Fetch.hh"
#include "iostream"
LVP::LVP(const LVPParams *params)
: VPredUnit(params),
lastPredictorSize(params->lastPredictorSize),
lastCtrBits(params->lastCtrBits),
... | 23.152381 | 111 | 0.642123 | surya00060 |
2b13fd65e3b42d8bdc2baed02661e2f9a49ef0a8 | 16,715 | cpp | C++ | src/utils/ofxInfiniteCanvas.cpp | radamchin/ofxNCKinect | ddfae48497e6303cd167f2972601db5cfd90eab7 | [
"MIT"
] | 58 | 2019-03-18T14:38:09.000Z | 2021-08-03T19:24:07.000Z | src/utils/ofxInfiniteCanvas.cpp | radamchin/ofxNCKinect | ddfae48497e6303cd167f2972601db5cfd90eab7 | [
"MIT"
] | 1 | 2016-08-22T18:38:44.000Z | 2016-08-23T09:08:40.000Z | src/utils/ofxInfiniteCanvas.cpp | radamchin/ofxNCKinect | ddfae48497e6303cd167f2972601db5cfd90eab7 | [
"MIT"
] | 7 | 2016-08-22T15:35:58.000Z | 2020-02-11T17:40:31.000Z | //
// ofxInfiniteCanvas.cpp
// ofxInfiniteCanvas
//
// Created by Roy Macdonald on 27-06-15.
//
//
#include "ofxInfiniteCanvas.h"
ofMatrix4x4 ofxInfiniteCanvas::FM = ofMatrix4x4( 1, 0, 0, 0,
0, 1, 0, 0,
0, 0, 1, 0,
... | 36.898455 | 163 | 0.516183 | radamchin |
2b141b20cca6e54a940f73c3f58294c65c341742 | 6,533 | cpp | C++ | Core/commonCore.cpp | glwagner/Exasim | ee4540443435f958fa2ca78d59cbf9cff0fe69de | [
"MIT"
] | 37 | 2020-12-09T20:24:36.000Z | 2022-02-18T17:19:23.000Z | Core/commonCore.cpp | glwagner/Exasim | ee4540443435f958fa2ca78d59cbf9cff0fe69de | [
"MIT"
] | 25 | 2020-11-25T20:37:33.000Z | 2022-02-25T15:53:11.000Z | Core/commonCore.cpp | glwagner/Exasim | ee4540443435f958fa2ca78d59cbf9cff0fe69de | [
"MIT"
] | 8 | 2020-11-30T15:34:06.000Z | 2022-01-09T21:06:00.000Z | #ifndef __COMMONCORE
#define __COMMONCORE
#include <math.h>
#include <algorithm>
void faceindex2(int *in1, int *in2, int *facecon, int npf, int ncu, int npe, int nc, int f1, int f2)
{
int nf = f2-f1;
int ndf = npf*ncu;
int N = ndf*nf;
for (int idx = 0; idx<N; idx++)
{
int i... | 27.682203 | 121 | 0.452931 | glwagner |
2b1434a159cfdc742584ef0c9277adf6aaebf973 | 316 | cpp | C++ | Level 1/Conditions avancees, operateurs booleens/Nombre de personnes a la fete/main.cpp | Wurlosh/France-ioi | f5fb36003cbfc56a2e7cf64ad43c4452f086f198 | [
"MIT"
] | 31 | 2018-10-30T09:54:23.000Z | 2022-03-02T21:45:51.000Z | Level 1/Conditions avancees, operateurs booleens/Nombre de personnes a la fete/main.cpp | Wurlosh/France-ioi | f5fb36003cbfc56a2e7cf64ad43c4452f086f198 | [
"MIT"
] | 2 | 2016-12-24T23:39:20.000Z | 2017-07-02T22:51:28.000Z | Level 1/Conditions avancees, operateurs booleens/Nombre de personnes a la fete/main.cpp | Wurlosh/France-ioi | f5fb36003cbfc56a2e7cf64ad43c4452f086f198 | [
"MIT"
] | 30 | 2018-10-25T12:28:36.000Z | 2022-01-31T14:31:02.000Z | #include <iostream>
using namespace std;
int main()
{
int n,a;
cin>>n;
int cnt=0;
int maximum=0;
for(int i=0;i<2*n;++i)
{
cin>>a;
if(a>0)
cnt++;
else cnt--;
maximum=(maximum>cnt)?maximum:cnt;
}
cout<<maximum<<endl;
return 0;
} | 15.047619 | 42 | 0.458861 | Wurlosh |
2b19122acf80e931a12bcd2425e74039efb3079e | 2,782 | cpp | C++ | Core/Renderer/OpenGL/src/OGLFramebuffer.cpp | SDurand7/AVLIT-Engine | c7a8e361d91e57fb96acfc1c96a88c3b480bb256 | [
"MIT"
] | null | null | null | Core/Renderer/OpenGL/src/OGLFramebuffer.cpp | SDurand7/AVLIT-Engine | c7a8e361d91e57fb96acfc1c96a88c3b480bb256 | [
"MIT"
] | null | null | null | Core/Renderer/OpenGL/src/OGLFramebuffer.cpp | SDurand7/AVLIT-Engine | c7a8e361d91e57fb96acfc1c96a88c3b480bb256 | [
"MIT"
] | null | null | null | #include "OGLFramebuffer.hpp"
#include <random>
#include <cmath>
#include <Core/Base/include/Math.hpp>
#include <Core/Renderer/OpenGL/include/OGLTexture.hpp>
#include "bluenoise.h"
namespace AVLIT {
GLint OGLFramebuffer::m_defaultID = -1;
OGLFramebuffer::OGLFramebuffer(GLuint textureCount) : m_textures(textu... | 33.119048 | 120 | 0.723221 | SDurand7 |
2b22643ace63cb46c2d6a23877f2a46d29b493b6 | 6,285 | hpp | C++ | Algorithm/arcsim/adaptiveCloth/mesh.hpp | dolphin-li/ClothDesigner | 82b186d6db320b645ac67a4d32d7746cc9bdd391 | [
"MIT"
] | 32 | 2016-12-13T05:49:12.000Z | 2022-02-04T06:15:47.000Z | Algorithm/arcsim/adaptiveCloth/mesh.hpp | dolphin-li/ClothDesigner | 82b186d6db320b645ac67a4d32d7746cc9bdd391 | [
"MIT"
] | 2 | 2019-07-30T02:01:16.000Z | 2020-03-12T15:06:51.000Z | Algorithm/arcsim/adaptiveCloth/mesh.hpp | dolphin-li/ClothDesigner | 82b186d6db320b645ac67a4d32d7746cc9bdd391 | [
"MIT"
] | 18 | 2017-11-16T13:37:06.000Z | 2022-03-11T08:13:46.000Z | /*
Copyright ©2013 The Regents of the University of California
(Regents). All Rights Reserved. Permission to use, copy, modify, and
distribute this software and its documentation for educational,
research, and not-for-profit purposes, without fee and without a
signed licensing agreement, is hereby granted, pr... | 29.78673 | 78 | 0.689578 | dolphin-li |
2b230c57699fdf09df76b5eb1898060440304bb2 | 3,413 | cpp | C++ | Core/MAGESLAM/Source/MageUtil.cpp | syntheticmagus/mageslam | ba79a4e6315689c072c29749de18d70279a4c5e4 | [
"MIT"
] | 70 | 2020-05-07T03:09:09.000Z | 2022-02-11T01:04:54.000Z | Core/MAGESLAM/Source/MageUtil.cpp | syntheticmagus/mageslam | ba79a4e6315689c072c29749de18d70279a4c5e4 | [
"MIT"
] | 3 | 2020-06-01T00:34:01.000Z | 2020-10-08T07:43:32.000Z | Core/MAGESLAM/Source/MageUtil.cpp | syntheticmagus/mageslam | ba79a4e6315689c072c29749de18d70279a4c5e4 | [
"MIT"
] | 16 | 2020-05-07T03:09:13.000Z | 2022-03-31T15:36:49.000Z | // Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.
#include "MageUtil.h"
#include "Utils/cv.h"
#include "Utils/Logging.h"
#include "Tracking/Reprojection.h"
#include "Device/CameraCalibration.h"
namespace mage
{
mage::Rect CalculateOverlapCropSourceInTarget(const mage::Matrix& targetToSou... | 59.877193 | 180 | 0.709054 | syntheticmagus |
1a7477a5d631d204099e7db6edafb9c8ac0f7161 | 5,255 | cpp | C++ | src/setops/ii/ii-setops.cpp | daboyuka/PIQUE | d0e2ba4cc47aaeaf364b3c76339306e1795adb5e | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | src/setops/ii/ii-setops.cpp | daboyuka/PIQUE | d0e2ba4cc47aaeaf364b3c76339306e1795adb5e | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | src/setops/ii/ii-setops.cpp | daboyuka/PIQUE | d0e2ba4cc47aaeaf364b3c76339306e1795adb5e | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | /*
* Copyright 2015 David A. Boyuka II
*
* 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 ... | 31.848485 | 133 | 0.72902 | daboyuka |
1a7560bb6d50c829230220d5225446360b3b2fdc | 593 | cpp | C++ | ParallelForLoopBenchmark/StopWatch.cpp | shaovoon/vcpp_parallel_loops | 93a45f640073cfec76b1fd8ca568470230b2e735 | [
"MIT"
] | 2 | 2018-11-19T12:54:17.000Z | 2020-01-11T02:43:35.000Z | ParallelForLoopBenchmark/StopWatch.cpp | shaovoon/vcpp_parallel_loops | 93a45f640073cfec76b1fd8ca568470230b2e735 | [
"MIT"
] | null | null | null | ParallelForLoopBenchmark/StopWatch.cpp | shaovoon/vcpp_parallel_loops | 93a45f640073cfec76b1fd8ca568470230b2e735 | [
"MIT"
] | 1 | 2020-01-11T02:43:37.000Z | 2020-01-11T02:43:37.000Z | #include "StdAfx.h"
#include "StopWatch.h"
#define TARGET_RESOLUTION 1 // 1-millisecond target resolution
StopWatch::StopWatch(void)
{
TIMECAPS tc;
if (timeGetDevCaps(&tc, sizeof(TIMECAPS)) != TIMERR_NOERROR)
{
// Error; application can't continue.
}
m_wTimerRes = min(max(tc.wPeriodMin, TARGET_RESOL... | 16.472222 | 73 | 0.715008 | shaovoon |
1a7569e528464edeee8ea37a226f6a88a5f8741a | 16,376 | hpp | C++ | include/json.hpp | smbss1/FoxJson | c4aa06d8ff062ff99c1c6776f1e50b46a5266973 | [
"MIT"
] | 2 | 2021-05-25T12:26:50.000Z | 2021-05-25T12:27:36.000Z | include/json.hpp | smbss1/FoxJson | c4aa06d8ff062ff99c1c6776f1e50b46a5266973 | [
"MIT"
] | null | null | null | include/json.hpp | smbss1/FoxJson | c4aa06d8ff062ff99c1c6776f1e50b46a5266973 | [
"MIT"
] | null | null | null |
#ifndef FOX_JSON_HPP_
#define FOX_JSON_HPP_
#include <assert.h>
#include <string>
#include <vector>
#include <unordered_map>
#include <iostream>
namespace fox
{
namespace json
{
enum json_type
{
null,
object,
array,
string,
number_i... | 33.082828 | 122 | 0.418234 | smbss1 |
1a7e91735629263f7f87154abcad0e7ae29da8ff | 44 | hpp | C++ | contracts/beoslib/beos_privileged.hpp | terradacs/beos-core | 31e19170bcad573b1d498811284e62babd478f92 | [
"MIT"
] | 9 | 2019-04-04T18:46:14.000Z | 2022-03-03T16:22:56.000Z | contracts/beoslib/beos_privileged.hpp | terradacs/beos-core | 31e19170bcad573b1d498811284e62babd478f92 | [
"MIT"
] | null | null | null | contracts/beoslib/beos_privileged.hpp | terradacs/beos-core | 31e19170bcad573b1d498811284e62babd478f92 | [
"MIT"
] | 3 | 2019-03-19T17:45:08.000Z | 2021-03-22T21:45:35.000Z | #pragma once
#include "beos_privileged.h"
| 8.8 | 28 | 0.75 | terradacs |
1a861fcc3d51dd79c5e7554eeb735f4290c85e41 | 390 | hpp | C++ | src/version.hpp | pmenzel/kiq | 61c62917abc4392d6c79540762a7941b69f69945 | [
"MIT"
] | 5 | 2018-12-11T12:12:48.000Z | 2019-02-26T10:47:23.000Z | src/version.hpp | pmenzel/kiq | 61c62917abc4392d6c79540762a7941b69f69945 | [
"MIT"
] | 1 | 2019-01-10T16:31:58.000Z | 2019-01-11T09:43:10.000Z | src/version.hpp | pmenzel/kiq | 61c62917abc4392d6c79540762a7941b69f69945 | [
"MIT"
] | null | null | null | #pragma once
#define KIQ_VERSION_MAJOR 0
#define KIQ_VERSION_MINOR 2
#define KIQ_VERSION_PATCH 0
#define KIQ_VERSION_SUFFIX ""
#define KIQ_STR_HELPER(x) #x
#define KIQ_STR(x) KIQ_STR_HELPER(x)
#define KIQ_VERSION_STRING \
(KIQ_STR(KIQ_VERSION_MAJOR) "." KIQ_STR(KIQ_VE... | 24.375 | 75 | 0.694872 | pmenzel |
1a8a5c0f12a459fb6c74177405da68e35bfd3be5 | 4,501 | cpp | C++ | log/src/LogColorizer.cpp | Arthapz/StormKit | 7c8dead874734d04b97776287b25bf2ebe9be617 | [
"MIT"
] | 17 | 2019-02-12T14:40:06.000Z | 2021-12-21T12:54:17.000Z | log/src/LogColorizer.cpp | Arthapz/StormKit | 7c8dead874734d04b97776287b25bf2ebe9be617 | [
"MIT"
] | null | null | null | log/src/LogColorizer.cpp | Arthapz/StormKit | 7c8dead874734d04b97776287b25bf2ebe9be617 | [
"MIT"
] | 2 | 2019-02-21T10:07:42.000Z | 2020-05-08T19:49:10.000Z | // Copyright (C) 2021 Arthur LAURENT <arthur.laurent4@gmail.com>
// This file is subject to the license terms in the LICENSE file
// found in the top-level of this distribution
#include <storm/log/LogColorizer.hpp>
#include <storm/core/Platform.hpp>
using namespace storm;
using namespace storm::log;
#if ... | 39.831858 | 95 | 0.532548 | Arthapz |
1a8db25027951d689fafc646dea2503f5645a35e | 1,116 | hpp | C++ | sprig/policy/detail/is_policy_any_of_check_impl.hpp | bolero-MURAKAMI/Sprig | 51ce4db4f4d093dee659a136f47249e4fe91fc7a | [
"BSL-1.0"
] | 2 | 2017-10-24T13:56:24.000Z | 2018-09-28T13:21:22.000Z | sprig/policy/detail/is_policy_any_of_check_impl.hpp | bolero-MURAKAMI/Sprig | 51ce4db4f4d093dee659a136f47249e4fe91fc7a | [
"BSL-1.0"
] | null | null | null | sprig/policy/detail/is_policy_any_of_check_impl.hpp | bolero-MURAKAMI/Sprig | 51ce4db4f4d093dee659a136f47249e4fe91fc7a | [
"BSL-1.0"
] | 2 | 2016-04-12T03:26:06.000Z | 2018-09-28T13:21:22.000Z | /*=============================================================================
Copyright (c) 2010-2016 Bolero MURAKAMI
https://github.com/bolero-MURAKAMI/Sprig
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)
===... | 33.818182 | 79 | 0.678315 | bolero-MURAKAMI |
1a91061e9e20d97192d6a681f4fc61e79a0c97f4 | 6,683 | cpp | C++ | src/readCSV.cpp | Fs2a/fs2a | d860ca2e6e4abd938a1ddba809b5332ccfbdfb34 | [
"BSD-3-Clause"
] | null | null | null | src/readCSV.cpp | Fs2a/fs2a | d860ca2e6e4abd938a1ddba809b5332ccfbdfb34 | [
"BSD-3-Clause"
] | null | null | null | src/readCSV.cpp | Fs2a/fs2a | d860ca2e6e4abd938a1ddba809b5332ccfbdfb34 | [
"BSD-3-Clause"
] | null | null | null | /* BSD 3-Clause License
*
* Copyright (c) 2020, Fs2a, Simon de Hartog <simon@fs2a.pro>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the... | 28.682403 | 106 | 0.617088 | Fs2a |
1a92d09bc8c493a9f7a0e50fab7dfc9ab951a78e | 2,229 | cpp | C++ | GpuMiner/XDagCore/XFee.cpp | swordlet/DaggerAOCLminer | f4fa5b5aec4942863c234463d3aeb244c472eae4 | [
"MIT"
] | 5 | 2019-03-08T11:26:35.000Z | 2022-01-15T12:53:57.000Z | GpuMiner/XDagCore/XFee.cpp | swordlet/DaggerAOCLminer | f4fa5b5aec4942863c234463d3aeb244c472eae4 | [
"MIT"
] | null | null | null | GpuMiner/XDagCore/XFee.cpp | swordlet/DaggerAOCLminer | f4fa5b5aec4942863c234463d3aeb244c472eae4 | [
"MIT"
] | 6 | 2019-03-07T08:46:33.000Z | 2022-02-15T17:38:18.000Z | // Implementation of fee
// Author: Evgeniy Sukhomlinov
// 2018
// Licensed under GNU General Public License, Version 3. See the LICENSE file.
#include "XFee.h"
#include "Core/Log.h"
#ifdef _DEBUG
#define FEE_PERIOD 4
const std::string GpuDevAddress = "YMB0XWN1vxY5jLiZwSDeTDQTRO2NVEW9";
#else
#define FE... | 25.044944 | 121 | 0.656797 | swordlet |
1a93da20f884d28297c65880ee825abe5305f220 | 560 | hpp | C++ | lib/src/cpu/cpu_median.hpp | akowalew/cuda-imgproc | 5d8f8b13ff94e9d914e9106cd6cdefee2ee549ff | [
"MIT"
] | null | null | null | lib/src/cpu/cpu_median.hpp | akowalew/cuda-imgproc | 5d8f8b13ff94e9d914e9106cd6cdefee2ee549ff | [
"MIT"
] | null | null | null | lib/src/cpu/cpu_median.hpp | akowalew/cuda-imgproc | 5d8f8b13ff94e9d914e9106cd6cdefee2ee549ff | [
"MIT"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
// cpu_median.hpp
//
// Contains declarations for CPU median filterer
///////////////////////////////////////////////////////////////////////////////
#pragma once
#include "image.hpp"
//
// Public declarations
//
void cpu_median(Image& ... | 21.538462 | 79 | 0.496429 | akowalew |
1a9d421505c12c352499a2a69177f61a421ccf3f | 965 | hpp | C++ | src/Commands/RemoveDirCommand.hpp | lucastarche/HacknetPlusPlus | 9221be47157da5402ea7a0cc1f769ddeb4eca5c0 | [
"MIT"
] | 1 | 2021-12-15T17:24:17.000Z | 2021-12-15T17:24:17.000Z | src/Commands/RemoveDirCommand.hpp | lucastarche/HacknetPlusPlus | 9221be47157da5402ea7a0cc1f769ddeb4eca5c0 | [
"MIT"
] | 2 | 2020-11-26T14:05:36.000Z | 2021-02-17T23:16:28.000Z | src/Commands/RemoveDirCommand.hpp | lucastarche/HacknetPlusPlus | 9221be47157da5402ea7a0cc1f769ddeb4eca5c0 | [
"MIT"
] | 4 | 2020-11-26T03:19:07.000Z | 2021-02-16T21:15:01.000Z | #pragma once
#include "Command.hpp"
class RemoveDirCommand : public Command {
public:
void run(const std::vector<std::string> &args) override {
if (!hasExactArguments(2, args)) return;
GameManager *game = GameManager::getInstance();
FileSystemElement* elem = game->getDi... | 33.275862 | 80 | 0.47772 | lucastarche |
1aa011bbb55992c21f0f6dfae0f06c10fce80157 | 71 | hpp | C++ | src/zerocopy/args.hpp | ZaidQureshi/comm_scope | a3dc1a117c30e7f453c9be5dcc68cd979bd852d8 | [
"Apache-2.0"
] | 12 | 2020-05-07T20:48:01.000Z | 2021-11-24T17:57:28.000Z | src/zerocopy/args.hpp | ZaidQureshi/comm_scope | a3dc1a117c30e7f453c9be5dcc68cd979bd852d8 | [
"Apache-2.0"
] | 41 | 2018-09-03T21:18:49.000Z | 2021-03-05T21:55:27.000Z | src/zerocopy/args.hpp | ZaidQureshi/comm_scope | a3dc1a117c30e7f453c9be5dcc68cd979bd852d8 | [
"Apache-2.0"
] | 5 | 2019-12-14T19:38:47.000Z | 2022-02-20T12:50:24.000Z | #pragma once
#define ARGS() DenseRange(10, 33, 1)->ArgName("log2(N)")
| 17.75 | 56 | 0.661972 | ZaidQureshi |
1aa644e52a3c05f7a6478536636e0d9ee02c2e2b | 833 | hpp | C++ | include/public/coherence/lang/Runnable.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-01T21:38:30.000Z | 2021-11-03T01:35:11.000Z | include/public/coherence/lang/Runnable.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 1 | 2020-07-24T17:29:22.000Z | 2020-07-24T18:29:04.000Z | include/public/coherence/lang/Runnable.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-10T18:40:58.000Z | 2022-02-18T01:23:40.000Z | /*
* Copyright (c) 2000, 2020, Oracle and/or its affiliates.
*
* Licensed under the Universal Permissive License v 1.0 as shown at
* http://oss.oracle.com/licenses/upl.
*/
#ifndef COH_RUNNABLE_HPP
#define COH_RUNNABLE_HPP
#include "coherence/lang/compatibility.hpp"
#include "coherence/lang/interface_spec.hpp"
#i... | 21.358974 | 77 | 0.654262 | chpatel3 |
1aa81052438d8c556bd7dab6e8bb63bef581c130 | 2,223 | cpp | C++ | ql/experimental/compoundoption/compoundoption.cpp | quantosaurosProject/quantLib | 84b49913d3940cf80d6de8f70185867373f45e8d | [
"BSD-3-Clause"
] | null | null | null | ql/experimental/compoundoption/compoundoption.cpp | quantosaurosProject/quantLib | 84b49913d3940cf80d6de8f70185867373f45e8d | [
"BSD-3-Clause"
] | null | null | null | ql/experimental/compoundoption/compoundoption.cpp | quantosaurosProject/quantLib | 84b49913d3940cf80d6de8f70185867373f45e8d | [
"BSD-3-Clause"
] | 1 | 2022-03-29T05:44:27.000Z | 2022-03-29T05:44:27.000Z | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2009 Dimitri Reiswich
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it an... | 37.677966 | 79 | 0.689159 | quantosaurosProject |
1aaadfec6f8daab0b0ff59a6614b1bbb1aa4186c | 1,152 | hpp | C++ | mpskit/point_functions.hpp | f-koehler/dmrg | 335250d066170e7da6f1ee80b9ec1d30e80570c5 | [
"MIT"
] | null | null | null | mpskit/point_functions.hpp | f-koehler/dmrg | 335250d066170e7da6f1ee80b9ec1d30e80570c5 | [
"MIT"
] | null | null | null | mpskit/point_functions.hpp | f-koehler/dmrg | 335250d066170e7da6f1ee80b9ec1d30e80570c5 | [
"MIT"
] | null | null | null | #ifndef MPSKIT_POINT_FUNCTIONS
#define MPSKIT_POINT_FUNCTIONS
#include <itensor/itensor.h>
#include <itensor/mps/mps.h>
#include <itensor/mps/siteset.h>
#include <string>
#include "types.hpp"
namespace itensor
{
class MPS;
} // namespace itensor
struct OnePointFunction
{
protected:
int m_index;
Real m_pre... | 22.588235 | 108 | 0.689236 | f-koehler |
1aafe7be8b7c7e50491925c56c7bf405e4865fb0 | 1,739 | cpp | C++ | Instances/Matrix_Chain.cpp | namespace-Pt/Algorithm | 59f70e4b82107ae37b3a06338e8ac73be6937d3f | [
"MIT"
] | null | null | null | Instances/Matrix_Chain.cpp | namespace-Pt/Algorithm | 59f70e4b82107ae37b3a06338e8ac73be6937d3f | [
"MIT"
] | null | null | null | Instances/Matrix_Chain.cpp | namespace-Pt/Algorithm | 59f70e4b82107ae37b3a06338e8ac73be6937d3f | [
"MIT"
] | null | null | null | #include<iostream>
#include<limits.h>
using namespace std;
// 备忘录法自顶向下实现动态规划
int Lookup_Chain(int **M,int ** S,int *p,int i,int j){
// 如果值不是初始化的最大值，则返回
// O(1)
if(M[i][j] < INT_MAX){
return M[i][j];
}
// 如果只有一个矩阵，直接返回0
// O(1)
if(i == j){
return 0;
}
else
... | 20.702381 | 91 | 0.454284 | namespace-Pt |
1abb1f5affa4d04b9cdebaa179cddf9c4fc5fba7 | 1,642 | cpp | C++ | test/unit-test/src/test-csv-001.cpp | solosTec/cyng | 3862a6b7a2b536d1f00fef20700e64170772dcff | [
"MIT"
] | null | null | null | test/unit-test/src/test-csv-001.cpp | solosTec/cyng | 3862a6b7a2b536d1f00fef20700e64170772dcff | [
"MIT"
] | null | null | null | test/unit-test/src/test-csv-001.cpp | solosTec/cyng | 3862a6b7a2b536d1f00fef20700e64170772dcff | [
"MIT"
] | null | null | null |
/*
* The MIT License (MIT)
*
* Copyright (c) 2019 Sylko Olzscher
*
*/
#include "test-csv-001.h"
#include <iostream>
#include <boost/test/unit_test.hpp>
#include <cyng/csv.h>
#include <cyng/object.h>
#include <cyng/factory.h>
#include <cyng/io/serializer.h>
#include <boost/uuid/random_generator.hpp>
#include <... | 22.493151 | 130 | 0.626066 | solosTec |
1abc792b90764a91ee35efa988a490c7cbc236f6 | 2,269 | cxx | C++ | MITK/Modules/OpenCV/Features/mitkSurfTester.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | 13 | 2018-07-28T13:36:38.000Z | 2021-11-01T19:17:39.000Z | MITK/Modules/OpenCV/Features/mitkSurfTester.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | null | null | null | MITK/Modules/OpenCV/Features/mitkSurfTester.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | 10 | 2018-08-20T07:06:00.000Z | 2021-07-07T07:55:27.000Z | /*=============================================================================
NifTK: A software platform for medical image computing.
Copyright (c) University College London (UCL). All rights reserved.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY o... | 28.721519 | 127 | 0.581313 | NifTK |
1abdc6707530839ae47867e71ec1459b8c89c32a | 13,453 | cpp | C++ | GameServer/Source/ItemUpgradeJewels.cpp | sp3cialk/MU-S8EP2-Repack | 202856a74c905c203b9b2795fd161f564ca8b257 | [
"MIT"
] | 10 | 2019-04-09T23:36:43.000Z | 2022-02-10T19:20:52.000Z | GameServer/Source/ItemUpgradeJewels.cpp | microvn/mu-s8ep2-repack | 202856a74c905c203b9b2795fd161f564ca8b257 | [
"MIT"
] | 1 | 2019-09-25T17:12:36.000Z | 2019-09-25T17:12:36.000Z | GameServer/Source/ItemUpgradeJewels.cpp | microvn/mu-s8ep2-repack | 202856a74c905c203b9b2795fd161f564ca8b257 | [
"MIT"
] | 9 | 2019-09-25T17:12:57.000Z | 2021-08-18T01:21:25.000Z | #include "stdafx.h"
#include "ItemUpgradeJewels.h"
#include "..\pugixml\pugixml.hpp"
#include "logproc.h"
#include "GameMain.h"
#include "..\common\SetItemOption.h"
using namespace pugi;
ItemUpgradeJewels g_ItemUpgradeJewels;
ItemUpgradeJewels::ItemUpgradeJewels()
{
}
ItemUpgradeJewels::~ItemUpgradeJewels()
{
}
v... | 26.021277 | 153 | 0.674125 | sp3cialk |
1ad143769b25d61f79dc4f586e188da3149be318 | 342 | cpp | C++ | Easy/169_Majority_Element.cpp | ShehabMMohamed/LeetCodeCPP | 684340f29ac15c5e8fa9f6ef5c3f99d4c95ce780 | [
"MIT"
] | 1 | 2021-03-15T10:02:10.000Z | 2021-03-15T10:02:10.000Z | Easy/169_Majority_Element.cpp | ShehabMMohamed/LeetCodeCPP | 684340f29ac15c5e8fa9f6ef5c3f99d4c95ce780 | [
"MIT"
] | null | null | null | Easy/169_Majority_Element.cpp | ShehabMMohamed/LeetCodeCPP | 684340f29ac15c5e8fa9f6ef5c3f99d4c95ce780 | [
"MIT"
] | null | null | null | class Solution {
public:
int majorityElement(vector<int>& nums) {
unordered_map<int, int> freq;
for(int& n : nums)
freq[n]++;
int major = nums[0];
for(auto it : freq) {
if(it.second > floor(nums.size() / 2))
major = it.first;
}
... | 24.428571 | 50 | 0.473684 | ShehabMMohamed |
1ad418a38a314be3ba44b9ed3a9cd93639f4325e | 8,578 | cpp | C++ | ch09/9.exercise.12.cpp | 0p3r4t4/PPPUCPP2nd | cf1bd23bb22ee00a77172e43678b7eaa91f592e0 | [
"MIT"
] | 51 | 2017-03-24T06:08:11.000Z | 2022-03-18T00:28:14.000Z | ch09/9.exercise.12.cpp | 0p3r4t4/PPPUCPP2nd | cf1bd23bb22ee00a77172e43678b7eaa91f592e0 | [
"MIT"
] | 1 | 2019-06-23T07:33:42.000Z | 2019-12-12T13:14:04.000Z | ch09/9.exercise.12.cpp | 0p3r4t4/PPPUCPP2nd | cf1bd23bb22ee00a77172e43678b7eaa91f592e0 | [
"MIT"
] | 25 | 2017-04-07T13:22:45.000Z | 2022-03-18T00:28:15.000Z | // 9.exercise.12.cpp
//
// Change the representation of a Date to be the number of days since January
// 1, 1970 (known as day 0), represented as a long int, and re-implement the
// functions from §9.8. Be sure to reject dates outside the range we can
// represent that way (feel free to reject days before day 0, i.... | 40.084112 | 80 | 0.646887 | 0p3r4t4 |
1ada697321cc4bc20111abc71c345f2f1004c128 | 427 | cpp | C++ | src/sensors/clocks/DS3231.cpp | el-fuego/Arduino-devices | 2bc0fa1a9cbc3343f118eda73387e71d59ae4657 | [
"MIT"
] | null | null | null | src/sensors/clocks/DS3231.cpp | el-fuego/Arduino-devices | 2bc0fa1a9cbc3343f118eda73387e71d59ae4657 | [
"MIT"
] | null | null | null | src/sensors/clocks/DS3231.cpp | el-fuego/Arduino-devices | 2bc0fa1a9cbc3343f118eda73387e71d59ae4657 | [
"MIT"
] | null | null | null | #include <Arduino.h>
#include "Sodaq_DS3231.h"
#include "./DS3231.h"
void DS3231_Sensor::init() {
rtc.begin();
};
void DS3231_Sensor::update() {
dateTime = rtc.now();
}
// hours and minutes in int
unsigned int DS3231_Sensor::getIntTime() {
return dateTime.hour() * 60 + dateTime.minute();
}
// number of minut... | 17.791667 | 50 | 0.688525 | el-fuego |
1ae352af7b11e11c919a0a4d658a3b9f14a1e01c | 181 | hpp | C++ | src/2d/Layout.hpp | kochol/ari2 | ca185191531acc1954cd4acfec2137e32fdb5c2d | [
"MIT"
] | 81 | 2018-12-11T20:48:41.000Z | 2022-03-18T22:24:11.000Z | src/2d/Layout.hpp | kochol/ari2 | ca185191531acc1954cd4acfec2137e32fdb5c2d | [
"MIT"
] | 7 | 2020-04-19T11:50:39.000Z | 2021-11-12T16:08:53.000Z | src/2d/Layout.hpp | kochol/ari2 | ca185191531acc1954cd4acfec2137e32fdb5c2d | [
"MIT"
] | 4 | 2019-04-24T11:51:29.000Z | 2021-03-10T05:26:33.000Z | #pragma once
#include "Node2D.hpp"
namespace ari::en
{
struct Layout : public Node2D
{
ARI_COMPONENT_CHILD(Layout, Node2D)
};
} // namespace ari::en
| 12.928571 | 43 | 0.60221 | kochol |
1aeada443644154ed8f45a2520a105c3c26dd70e | 1,087 | cpp | C++ | week5/MergeIntervals2.cpp | AngelaJubeJudy/Algorithms | 3a6eef59fd2fcb54d80013c067273d73bc6e79b9 | [
"MIT"
] | null | null | null | week5/MergeIntervals2.cpp | AngelaJubeJudy/Algorithms | 3a6eef59fd2fcb54d80013c067273d73bc6e79b9 | [
"MIT"
] | null | null | null | week5/MergeIntervals2.cpp | AngelaJubeJudy/Algorithms | 3a6eef59fd2fcb54d80013c067273d73bc6e79b9 | [
"MIT"
] | null | null | null | class MergeIntervals2 {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
// 双关键字排序：2个长为2的数组的比较
sort(intervals.begin(), intervals.end(), [](vector<int>& a, vector<int>& b){
return a[0] < b[0] || (a[0] == b[0] && a[1] < b[1]);
});
// “差分”
... | 31.057143 | 85 | 0.471021 | AngelaJubeJudy |
1aeed8bde00b3dfdbdb3d99ce7a0c572d2956660 | 5,944 | cpp | C++ | ql/models/marketmodels/products/multistep/multistepvolswap.cpp | universe1987/QuantLib | bbb0145aff285853755b9f6ed013f53a41163acb | [
"BSD-3-Clause"
] | 4 | 2016-03-28T15:05:23.000Z | 2020-02-17T23:05:57.000Z | ql/models/marketmodels/products/multistep/multistepvolswap.cpp | universe1987/QuantLib | bbb0145aff285853755b9f6ed013f53a41163acb | [
"BSD-3-Clause"
] | 1 | 2015-02-02T20:32:43.000Z | 2015-02-02T20:32:43.000Z | ql/models/marketmodels/products/multistep/multistepvolswap.cpp | pcaspers/quantlib | bbb0145aff285853755b9f6ed013f53a41163acb | [
"BSD-3-Clause"
] | 10 | 2015-01-26T14:50:24.000Z | 2015-10-23T07:41:30.000Z | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2012 Peter Caspers
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/o... | 47.935484 | 251 | 0.728129 | universe1987 |
8c19629bba9b92700937ef7313aefa4480840d3b | 807 | cpp | C++ | Catch2/include/internal/catch_decomposer.cpp | TheBlindMick/MPU6050 | 66880369fa7a73755846e60568137dfc07da1b5c | [
"BSL-1.0"
] | 1,461 | 2022-02-25T17:44:34.000Z | 2022-03-30T06:18:29.000Z | Catch2/include/internal/catch_decomposer.cpp | TheBlindMick/MPU6050 | 66880369fa7a73755846e60568137dfc07da1b5c | [
"BSL-1.0"
] | 116 | 2021-05-29T16:32:51.000Z | 2021-08-13T16:05:29.000Z | Catch2/include/internal/catch_decomposer.cpp | TheBlindMick/MPU6050 | 66880369fa7a73755846e60568137dfc07da1b5c | [
"BSL-1.0"
] | 135 | 2019-04-16T09:10:13.000Z | 2022-03-18T10:22:40.000Z | /*
* Created by Phil Nash on 8/8/2017.
* Copyright 2017 Two Blue Cubes Ltd. All rights reserved.
*
* Distributed under the Boost Software License, Version 1.0. (See accompanying
* file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*/
#include "catch_decomposer.h"
#include "catch_config.hpp... | 32.28 | 122 | 0.583643 | TheBlindMick |
8c1bf2b4549b3ff3e548af905dcf22df75e7c4ea | 581 | cpp | C++ | MET/main.cpp | elem-azar-unis/Redis-RPQ | 96cb520a1985a01ab67069ab2a2bc22e656c7583 | [
"BSD-3-Clause"
] | 2 | 2018-07-11T03:06:10.000Z | 2018-07-19T06:12:47.000Z | MET/main.cpp | elem-azar-unis/Redis-RPQ | 96cb520a1985a01ab67069ab2a2bc22e656c7583 | [
"BSD-3-Clause"
] | null | null | null | MET/main.cpp | elem-azar-unis/Redis-RPQ | 96cb520a1985a01ab67069ab2a2bc22e656c7583 | [
"BSD-3-Clause"
] | null | null | null | #include "exp_runner.h"
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
// run<rpq_op_script, rpq_oracle>("TLA/rwf_rpq/rwf_rpq_2_4.script");
// run<rpq_op_script, rpq_oracle>("TLA/rwf_rpq/rwf_rpq_3_3.script");
std::ofstream out_2_4("out_2_4.script");
run<list_op_script, ... | 29.05 | 82 | 0.702238 | elem-azar-unis |
8c1c1bd6337aac99a4e87cb820358c91841b9427 | 1,485 | cpp | C++ | src/stage/dungeon.cpp | djoyahoy/eng | 848f7f5e5ed9cfca4703b69fb6af8c2e24721619 | [
"MIT"
] | null | null | null | src/stage/dungeon.cpp | djoyahoy/eng | 848f7f5e5ed9cfca4703b69fb6af8c2e24721619 | [
"MIT"
] | null | null | null | src/stage/dungeon.cpp | djoyahoy/eng | 848f7f5e5ed9cfca4703b69fb6af8c2e24721619 | [
"MIT"
] | null | null | null | #include <stdexcept>
#include "stage/dungeon.h"
#include "enemy_maker.h"
#include "json/json.h"
#include "prop_maker.h"
namespace stage
{
Dungeon::Dungeon(std::unique_ptr<Zone> zone, enemy::EnemyVec enemies, prop::PropVec props) :
zone(std::move(zone)), enemies(std::move(enemies)), props(std::move(props))
{
... | 28.557692 | 94 | 0.606061 | djoyahoy |
8c22679a999ae85e2f2c14d641656edc6e84e8fe | 1,180 | cpp | C++ | YorozuyaGSLib/source/_darkhole_job_pass_inform_zoclDetail.cpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | YorozuyaGSLib/source/_darkhole_job_pass_inform_zoclDetail.cpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | YorozuyaGSLib/source/_darkhole_job_pass_inform_zoclDetail.cpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 44 | 2017-12-19T08:02:59.000Z | 2022-02-24T23:15:01.000Z | #include <_darkhole_job_pass_inform_zoclDetail.hpp>
#include <common/ATFCore.hpp>
START_ATF_NAMESPACE
namespace Detail
{
Info::_darkhole_job_pass_inform_zoclsize2_ptr _darkhole_job_pass_inform_zoclsize2_next(nullptr);
Info::_darkhole_job_pass_inform_zoclsize2_clbk _darkhole_job_pass_inform_zoc... | 42.142857 | 126 | 0.714407 | lemkova |
8c2699b8e11dce7408442feff0d0d8aef640e163 | 1,018 | cpp | C++ | src/termui/signals.cpp | numerodix/bmon-cpp | fae0613776b879a33e327f9ccf1d3819383634dd | [
"MIT"
] | 1 | 2020-07-31T01:34:47.000Z | 2020-07-31T01:34:47.000Z | src/termui/signals.cpp | numerodix/bmon-cpp | fae0613776b879a33e327f9ccf1d3819383634dd | [
"MIT"
] | null | null | null | src/termui/signals.cpp | numerodix/bmon-cpp | fae0613776b879a33e327f9ccf1d3819383634dd | [
"MIT"
] | null | null | null | #include <csignal>
#include <stdexcept>
#include "except.hpp"
#include "signals.hpp"
namespace bandwit {
namespace termui {
void SignalSuspender::suspend() {
sigset_t mask;
sigemptyset(&mask);
for (auto signo : signums_) {
sigaddset(&mask, signo);
}
if (sigprocmask(SIG_BLOCK, &mask, nul... | 22.622222 | 79 | 0.631631 | numerodix |
8c2b424387a1f74c1059ca6adba94eb9e7f0ecfd | 3,292 | hpp | C++ | source/hougfx/include/hou/gfx/vertex2.hpp | DavideCorradiDev/houzi-game-engine | d704aa9c5b024300578aafe410b7299c4af4fcec | [
"MIT"
] | 2 | 2018-04-12T20:59:20.000Z | 2018-07-26T16:04:07.000Z | source/hougfx/include/hou/gfx/vertex2.hpp | DavideCorradiDev/houzi-game-engine | d704aa9c5b024300578aafe410b7299c4af4fcec | [
"MIT"
] | null | null | null | source/hougfx/include/hou/gfx/vertex2.hpp | DavideCorradiDev/houzi-game-engine | d704aa9c5b024300578aafe410b7299c4af4fcec | [
"MIT"
] | null | null | null | // Houzi Game Engine
// Copyright (c) 2018 Davide Corradi
// Licensed under the MIT license.
#ifndef HOU_GFX_VERTEX_2_HPP
#define HOU_GFX_VERTEX_2_HPP
#include "hou/gfx/gfx_config.hpp"
#include "hou/cor/pragmas.hpp"
#include "hou/gl/open_gl.hpp"
#include "hou/mth/matrix.hpp"
#include "hou/sys/color.hpp"
namesp... | 21.946667 | 77 | 0.70079 | DavideCorradiDev |
8c2bdc13fa7d0c0196bba8d7d51f7c0978e1f90d | 42 | cpp | C++ | test/autogen/smp@list@swap_index.cpp | jonathanpoelen/jln.mp | e5f05fc4467f14ac0047e3bdc75a04076e689985 | [
"MIT"
] | 9 | 2020-07-04T16:46:13.000Z | 2022-01-09T21:59:31.000Z | test/autogen/smp@list@swap_index.cpp | jonathanpoelen/jln.mp | e5f05fc4467f14ac0047e3bdc75a04076e689985 | [
"MIT"
] | null | null | null | test/autogen/smp@list@swap_index.cpp | jonathanpoelen/jln.mp | e5f05fc4467f14ac0047e3bdc75a04076e689985 | [
"MIT"
] | 1 | 2021-05-23T13:37:40.000Z | 2021-05-23T13:37:40.000Z | #include "jln/mp/smp/list/swap_index.hpp"
| 21 | 41 | 0.761905 | jonathanpoelen |
8c2e32682e810154c5e8a4a9d5593809a86fd2b6 | 621 | cpp | C++ | Codeforces/899C/math.cpp | codgician/ACM | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | [
"MIT"
] | 2 | 2018-02-14T01:59:31.000Z | 2018-03-28T03:30:45.000Z | Codeforces/899C/math.cpp | codgician/ACM | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | [
"MIT"
] | null | null | null | Codeforces/899C/math.cpp | codgician/ACM | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | [
"MIT"
] | 2 | 2017-12-30T02:46:35.000Z | 2018-03-28T03:30:49.000Z | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <iomanip>
#include <climits>
using namespace std;
int ans[4] = {0, 1, 1, 0}, dArr[4] = {0, 1, 1, 2}, iArr[4] = {2, 1, 2, 1};
int main()
{
ios::sync_with_stdio(false);
int n;
cin >> n;
... | 17.25 | 74 | 0.47504 | codgician |
8c323418ba1817ed1d0831df8f896cfffdf45a18 | 3,805 | cpp | C++ | src/DlgQueryMsgID.cpp | taviso/mpgravity | f6a2a7a02014b19047e44db76ae551bd689c16ac | [
"BSD-3-Clause"
] | 9 | 2020-04-01T04:15:22.000Z | 2021-09-26T21:03:47.000Z | src/DlgQueryMsgID.cpp | taviso/mpgravity | f6a2a7a02014b19047e44db76ae551bd689c16ac | [
"BSD-3-Clause"
] | 17 | 2020-04-02T19:38:40.000Z | 2020-04-12T05:47:08.000Z | src/DlgQueryMsgID.cpp | taviso/mpgravity | f6a2a7a02014b19047e44db76ae551bd689c16ac | [
"BSD-3-Clause"
] | null | null | null | /*****************************************************************************/
/* SOURCE CONTROL VERSIONS */
/*---------------------------------------------------------------------------*/
/* ... | 36.586538 | 85 | 0.561104 | taviso |
8c36c165d0deb2ec37a64655ac16a8ccf282f4ff | 5,333 | cpp | C++ | src/qif191cli/QifResourcesDocument.cpp | QualityInformationFramework/QIFResourcesEditor | 4ff1de9d1dd20d9c43eaa9cc320caeff1c57760e | [
"BSL-1.0"
] | null | null | null | src/qif191cli/QifResourcesDocument.cpp | QualityInformationFramework/QIFResourcesEditor | 4ff1de9d1dd20d9c43eaa9cc320caeff1c57760e | [
"BSL-1.0"
] | null | null | null | src/qif191cli/QifResourcesDocument.cpp | QualityInformationFramework/QIFResourcesEditor | 4ff1de9d1dd20d9c43eaa9cc320caeff1c57760e | [
"BSL-1.0"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
///
/// Copyright 2018-2020, Capvidia, Metrosage, and project contributors
/// https://www.capvidia.com/
///
/// This software is provided for free use to the QIF Community under the
/// following license:
///
/// Boost Software License ... | 38.644928 | 146 | 0.690606 | QualityInformationFramework |
8c432690893a0fe12d02abddaea7cc348c177fb9 | 676 | hpp | C++ | Loyalty/ApiServer/Managers/ClientsManagerDB.hpp | uno-labs-solana-hackathon/core-server | fdbdefd32e12fcaa19227f56154e0163c18a35cb | [
"Apache-2.0"
] | null | null | null | Loyalty/ApiServer/Managers/ClientsManagerDB.hpp | uno-labs-solana-hackathon/core-server | fdbdefd32e12fcaa19227f56154e0163c18a35cb | [
"Apache-2.0"
] | 1 | 2021-03-06T11:38:01.000Z | 2021-03-15T21:33:16.000Z | Loyalty/ApiServer/Managers/ClientsManagerDB.hpp | uno-labs-solana-hackathon/core-server | fdbdefd32e12fcaa19227f56154e0163c18a35cb | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "../ApiServer_global.hpp"
namespace Sol::Loyalty::API::RPC {
class ClientsManagerDB
{
CLASS_REMOVE_CTRS(ClientsManagerDB);
using ClientDescT = Sol::Loyalty::DataModel::ClientDesc;
using SelectResT = std::tuple<ClientDescT::SP, SInt64/*version*/>;
public:
static SelectResT SSelectById ... | 27.04 | 67 | 0.680473 | uno-labs-solana-hackathon |
8c43fe4e52fc2be1ed2dd56b6a4ddbb46ac9acdf | 2,228 | cpp | C++ | test/types/ds/test_priority_queue.cpp | iamantony/CppNotes | 2707db6560ad80b0e5e286a04b2d46e5c0280b3f | [
"MIT"
] | 2 | 2020-07-31T14:13:56.000Z | 2021-02-03T09:51:43.000Z | test/types/ds/test_priority_queue.cpp | iamantony/CppNotes | 2707db6560ad80b0e5e286a04b2d46e5c0280b3f | [
"MIT"
] | 28 | 2015-09-22T07:38:21.000Z | 2018-10-02T11:00:58.000Z | test/types/ds/test_priority_queue.cpp | iamantony/CppNotes | 2707db6560ad80b0e5e286a04b2d46e5c0280b3f | [
"MIT"
] | 2 | 2018-10-11T14:10:50.000Z | 2021-02-27T08:53:50.000Z | #include <boost/test/unit_test.hpp>
#include "types/ds/priority_queue.hpp"
BOOST_AUTO_TEST_SUITE(DSPriorityQueue)
BOOST_AUTO_TEST_CASE(create_empty_pq) {
{
Types::DS::PriorityQueue<int> pq(Types::DS::PriorityQueue<int>::Type::MAX);
BOOST_CHECK(pq.size() == 0);
BOOST_CHECK(pq.isEmpty());
... | 21.219048 | 83 | 0.586176 | iamantony |
8c49d6557e119ddce3db1420594d1eaf02d1c0ea | 3,113 | cpp | C++ | RWracesDBII/RWracesDBII.prj/LocationPrefTbl.cpp | rrvt/RWracesDB | 4f01fed973df7dfb7ec516b2969b20fc6744d7fe | [
"MIT"
] | null | null | null | RWracesDBII/RWracesDBII.prj/LocationPrefTbl.cpp | rrvt/RWracesDB | 4f01fed973df7dfb7ec516b2969b20fc6744d7fe | [
"MIT"
] | null | null | null | RWracesDBII/RWracesDBII.prj/LocationPrefTbl.cpp | rrvt/RWracesDB | 4f01fed973df7dfb7ec516b2969b20fc6744d7fe | [
"MIT"
] | null | null | null | // LocationPref Table
#include "stdafx.h"
#include "LocationPrefTbl.h"
#include "DAOfields.h"
#include "DAOrecords.h"
#include "NotePad.h"
#include "Utilities.h"
bool LocationPrefTbl::load(DAOtable* daoTable) {
DAOrcdsIter iter(daoTable);
FieldsP fields;
int count;
for (count = 0, fields = iter(DAOde... | 23.583333 | 114 | 0.609059 | rrvt |
8c4af24c1d86a6b4129e4ee3a0348640660b0869 | 2,577 | cpp | C++ | samples/simple/simple/simple.cpp | techsoft3d/exchange-polygonica-bridge | e626fdbe61738c28a76e04f22c0ae409da1b1d32 | [
"MIT"
] | 1 | 2021-07-13T21:07:08.000Z | 2021-07-13T21:07:08.000Z | samples/simple/simple/simple.cpp | techsoft3d/exchange-polygonica-bridge | e626fdbe61738c28a76e04f22c0ae409da1b1d32 | [
"MIT"
] | null | null | null | samples/simple/simple/simple.cpp | techsoft3d/exchange-polygonica-bridge | e626fdbe61738c28a76e04f22c0ae409da1b1d32 | [
"MIT"
] | 1 | 2020-06-05T19:22:52.000Z | 2020-06-05T19:22:52.000Z | // simple.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
// Loads a file using HOOPS Exchange, converts part into a Polygonica Solid and saves to an STL.
//
#include <iostream>
#include "pgapi.h"
#include "pgkey.h"
#include "../../src/ExchangePolygonicaBridge.h"
PTEnvironm... | 27.126316 | 96 | 0.737679 | techsoft3d |
8c51e4b9441d8e80bd8b6bde671c8f40a716f820 | 10,059 | cpp | C++ | MSVC/14.24.28314/atlmfc/src/mfc/afxheaderctrl.cpp | 825126369/UCRT | 8853304fdc2a5c216658d08b6dbbe716aa2a7b1f | [
"MIT"
] | 2 | 2021-01-27T10:19:30.000Z | 2021-02-09T06:24:30.000Z | MSVC/14.24.28314/atlmfc/src/mfc/afxheaderctrl.cpp | 825126369/UCRT | 8853304fdc2a5c216658d08b6dbbe716aa2a7b1f | [
"MIT"
] | null | null | null | MSVC/14.24.28314/atlmfc/src/mfc/afxheaderctrl.cpp | 825126369/UCRT | 8853304fdc2a5c216658d08b6dbbe716aa2a7b1f | [
"MIT"
] | 1 | 2021-01-27T10:19:36.000Z | 2021-01-27T10:19:36.000Z | // This is a part of the Microsoft Foundation Classes C++ library.
// Copyright (C) Microsoft Corporation
// All rights reserved.
//
// This source code is only intended as a supplement to the
// Microsoft Foundation Classes Reference and related
// electronic documentation provided with the library.
// See these sourc... | 19.087287 | 134 | 0.689532 | 825126369 |
8c5491ac41eb6cbb41d2cb6f5ec1207bebae42bd | 1,074 | cpp | C++ | Math/SieveOfEratosthenes/SieveOfEratosthenes.cpp | PrachieNaik/DSA | 083522bb3c8a0694adec1f2856d4d4cd0fb51722 | [
"MIT"
] | null | null | null | Math/SieveOfEratosthenes/SieveOfEratosthenes.cpp | PrachieNaik/DSA | 083522bb3c8a0694adec1f2856d4d4cd0fb51722 | [
"MIT"
] | null | null | null | Math/SieveOfEratosthenes/SieveOfEratosthenes.cpp | PrachieNaik/DSA | 083522bb3c8a0694adec1f2856d4d4cd0fb51722 | [
"MIT"
] | null | null | null | /*
Problem statement: Sieve of Eratosthenes
Given a number N, calculate the prime numbers up to N using Sieve of Eratosthenes.
Example 1:
Input:
N = 10
Output:
2 3 5 7
Explanation:
Prime numbers less than equal to N
are 2 3 5 and 7.
Time Complexity: O(NloglogN)
Auxiliary Space: O(N)
*/
void SieveOfEratosthen... | 23.866667 | 161 | 0.588454 | PrachieNaik |
8c66312d8fd432d3b74dd1d092ce79aeab2b76f1 | 782 | cpp | C++ | tic-tac-toe/services/PlayerService.cpp | abdul699/Machine_Coding | 7e71397aa25a77d7d96c4117eda8b473af341d4a | [
"MIT"
] | null | null | null | tic-tac-toe/services/PlayerService.cpp | abdul699/Machine_Coding | 7e71397aa25a77d7d96c4117eda8b473af341d4a | [
"MIT"
] | null | null | null | tic-tac-toe/services/PlayerService.cpp | abdul699/Machine_Coding | 7e71397aa25a77d7d96c4117eda8b473af341d4a | [
"MIT"
] | null | null | null | #include "PlayerService.h"
#include "../models/Board.h"
bool PlayerService :: winCurrentPlayer(Board br) {
for(int i=0; i<3; i++) {
if(br.getValueAt(i, 0) == br.getValueAt(i, 1) && br.getValueAt(i, 1)== br.getValueAt(i, 2) && br.getValueAt(i, 1) != '-') return true;
}
// check column
for(int i=0; i<3; i++) ... | 46 | 141 | 0.595908 | abdul699 |
8c70c2a8ca9bb611b6577a084fdd2ddc57acb178 | 923 | cpp | C++ | test/dag_to_dot.cpp | mdsudara/percy | b593922b98c9c20fe0a3e4726e50401e54b9cb09 | [
"MIT"
] | 14 | 2018-03-10T21:50:20.000Z | 2021-11-22T04:09:09.000Z | test/dag_to_dot.cpp | mdsudara/percy | b593922b98c9c20fe0a3e4726e50401e54b9cb09 | [
"MIT"
] | 3 | 2018-06-12T15:17:22.000Z | 2019-06-20T12:00:45.000Z | test/dag_to_dot.cpp | mdsudara/percy | b593922b98c9c20fe0a3e4726e50401e54b9cb09 | [
"MIT"
] | 12 | 2018-03-10T17:02:07.000Z | 2022-01-09T16:04:56.000Z | #include <percy/percy.hpp>
#include <percy/io.hpp>
#include <cstdio>
#include <fstream>
using namespace percy;
/*******************************************************************************
Verifies that the DAG to .dot conversion works properly.
*****************************************************************... | 20.511111 | 80 | 0.423619 | mdsudara |
8c7122d5ebd3acbefd3caeadd18c26e6092602a9 | 1,967 | cc | C++ | benchmark/rtti_benchmark.cc | royvandam/r | 6450874cf442684f2129021e1b23cc16b5f7fed0 | [
"MIT"
] | 11 | 2020-12-03T21:57:34.000Z | 2020-12-18T15:16:35.000Z | benchmark/rtti_benchmark.cc | royvandam/r | 6450874cf442684f2129021e1b23cc16b5f7fed0 | [
"MIT"
] | null | null | null | benchmark/rtti_benchmark.cc | royvandam/r | 6450874cf442684f2129021e1b23cc16b5f7fed0 | [
"MIT"
] | 2 | 2020-12-04T12:41:43.000Z | 2021-08-15T12:24:51.000Z | #include <benchmark/benchmark.h>
#include <rtti.hh>
struct GrandParent : virtual RTTI::Enable {
RTTI_DECLARE_TYPEINFO(GrandParent);
};
struct ParentA : virtual GrandParent {
RTTI_DECLARE_TYPEINFO(ParentA, GrandParent);
};
struct ParentB : virtual GrandParent {
RTTI_DECLARE_TYPEINFO(ParentB, GrandParent)... | 24.898734 | 75 | 0.635994 | royvandam |
8c71a3bbebe556870f5434f7c41c4258870c7e28 | 311 | cpp | C++ | sum_digit_using_recursion/main.cpp | narendrajethi220/Getting-Started | fd1b910228b6cfb30b82f50f52f6c32e79437ea3 | [
"MIT"
] | null | null | null | sum_digit_using_recursion/main.cpp | narendrajethi220/Getting-Started | fd1b910228b6cfb30b82f50f52f6c32e79437ea3 | [
"MIT"
] | null | null | null | sum_digit_using_recursion/main.cpp | narendrajethi220/Getting-Started | fd1b910228b6cfb30b82f50f52f6c32e79437ea3 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int s(int num,int sum)
{
if(num==0)
return sum;
sum+=num%10;
return s(num/10,sum);
}
int main()
{
int digit;
cout<<"Enter digit ";
cin>>digit;
int sum=0;
cout<<"Sum of digit is "<<s(digit,sum);
return 0;
}
| 15.55 | 44 | 0.5209 | narendrajethi220 |
8c726e57467af13f972449e486392ade7c675836 | 1,896 | cpp | C++ | tests/network/http/websocket_test.cpp | jmjatlanta/bitshares-fc | 8b571580c8646c487def1b4b517401e58fa82c9e | [
"Zlib",
"Apache-2.0",
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | 2 | 2020-08-20T01:13:55.000Z | 2020-08-20T01:24:06.000Z | tests/network/http/websocket_test.cpp | jmjatlanta/bitshares-fc | 8b571580c8646c487def1b4b517401e58fa82c9e | [
"Zlib",
"Apache-2.0",
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | tests/network/http/websocket_test.cpp | jmjatlanta/bitshares-fc | 8b571580c8646c487def1b4b517401e58fa82c9e | [
"Zlib",
"Apache-2.0",
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | #include <boost/test/unit_test.hpp>
#include <fc/network/http/websocket.hpp>
#include <iostream>
BOOST_AUTO_TEST_SUITE(fc_network)
BOOST_AUTO_TEST_CASE(websocket_test)
{
fc::http::websocket_client client;
fc::http::websocket_connection_ptr s_conn, c_conn;
int port;
{
fc::http::websocket_ser... | 32.689655 | 96 | 0.582806 | jmjatlanta |
8c7754958d70ba7980e976379ed4c3d0d4bc5712 | 1,505 | hh | C++ | primer/examples/factory.hh | CaffeineViking/concepts-primer | 041cec40fa4a25cd954ce91da6d9d10ee31499a3 | [
"MIT"
] | 17 | 2019-05-01T21:49:43.000Z | 2022-02-25T06:50:47.000Z | primer/examples/factory.hh | CaffeineViking/concepts-primer | 041cec40fa4a25cd954ce91da6d9d10ee31499a3 | [
"MIT"
] | null | null | null | primer/examples/factory.hh | CaffeineViking/concepts-primer | 041cec40fa4a25cd954ce91da6d9d10ee31499a3 | [
"MIT"
] | null | null | null | #ifndef FACTORY_HH
#define FACTORY_HH
#include <type_traits>
#if false
struct NumberFactory {
enum { INTEGRAL, FLOATING } number_type;
template<typename T,
typename = std::enable_if<
std::is_integral_v<T>>>
NumberFactory(T) : number_type { INTEGRAL } {}
int create_number()... | 20.616438 | 62 | 0.628571 | CaffeineViking |
8c779250ea01a82b13be6db32fe4149db75a62a3 | 1,737 | cpp | C++ | Sandbox/src/Sandbox3D.cpp | Kingalidj/Atlas | a4a6a1315b18bd72637702e76d148de912377482 | [
"Apache-2.0"
] | 3 | 2021-07-29T19:15:46.000Z | 2021-09-28T15:29:57.000Z | Sandbox/src/Sandbox3D.cpp | Kingalidj/Atlas | a4a6a1315b18bd72637702e76d148de912377482 | [
"Apache-2.0"
] | null | null | null | Sandbox/src/Sandbox3D.cpp | Kingalidj/Atlas | a4a6a1315b18bd72637702e76d148de912377482 | [
"Apache-2.0"
] | null | null | null | #include "Sandbox3D.h"
#include "ImGui/imgui.h"
#include <memory>
#include <glm/gtc/matrix_transform.hpp>
#include <glm/gtc/type_ptr.hpp>
#include "Atlas/Renderer/Mesh.h"
using namespace Atlas;
Sandbox3D::Sandbox3D()
: Layer("Sandbox3D") {}
void Sandbox3D::OnAttach()
{
Ref<Scene> scene = Applic... | 29.948276 | 135 | 0.724237 | Kingalidj |
8c827a3acfa11b8d4421ffcd52b263ad714ba17e | 504 | cpp | C++ | a17/dispatch/topic.cpp | SRI-IPS/general-tools | b3113cbcf83c3a430c630d050d1b96e722dfb043 | [
"BSD-3-Clause"
] | null | null | null | a17/dispatch/topic.cpp | SRI-IPS/general-tools | b3113cbcf83c3a430c630d050d1b96e722dfb043 | [
"BSD-3-Clause"
] | null | null | null | a17/dispatch/topic.cpp | SRI-IPS/general-tools | b3113cbcf83c3a430c630d050d1b96e722dfb043 | [
"BSD-3-Clause"
] | null | null | null | #include "topic.h"
namespace a17 {
namespace dispatch {
std::string Topic::str() const {
auto str = std::string{""};
if (!device_name.empty()) {
str.append(device_name);
}
if (!node_name.empty()) {
if (!str.empty() && str.back() != '/') {
str.append("/");
}
str.append(node_name);
}
i... | 18 | 44 | 0.531746 | SRI-IPS |
8c83556c0aa9a4d923a0b62fae6c8681b0504e1b | 429 | hpp | C++ | src/wire/wire2lua/generate_options.hpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | 5 | 2016-04-07T19:49:39.000Z | 2021-08-03T05:24:11.000Z | src/wire/wire2lua/generate_options.hpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | null | null | null | src/wire/wire2lua/generate_options.hpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | 1 | 2020-12-27T11:47:31.000Z | 2020-12-27T11:47:31.000Z | /*
* generate_options.hpp
*
* Created on: May 13, 2016
* Author: zmij
*/
#ifndef WIRE_WIRE2LUA_GENERATE_OPTIONS_HPP_
#define WIRE_WIRE2LUA_GENERATE_OPTIONS_HPP_
#include <string>
namespace wire {
namespace idl {
namespace lua {
struct generate_options {
::std::string target_file;
};
} /* namespa... | 14.793103 | 48 | 0.694639 | zmij |
8c84768841166dad2649cf110ad5c9cd34c08bf9 | 1,507 | cpp | C++ | ceres_test/curve_fitting.cpp | HeadReaper-hc/mystudy-and-test | 4220093304592237a0d9ab56d610206ded89ffe7 | [
"MIT"
] | null | null | null | ceres_test/curve_fitting.cpp | HeadReaper-hc/mystudy-and-test | 4220093304592237a0d9ab56d610206ded89ffe7 | [
"MIT"
] | null | null | null | ceres_test/curve_fitting.cpp | HeadReaper-hc/mystudy-and-test | 4220093304592237a0d9ab56d610206ded89ffe7 | [
"MIT"
] | null | null | null | #include <iostream>
#include <stdlib.h>
#include <math.h>
#include <ceres/ceres.h>
#include <vector>
using namespace std;
using namespace ceres;
struct CostFunctor {
CostFunctor(double observed_x , double observed_y):_observed_x(observed_x),_observed_y(observed_y){}
template <typename T>
bool operator()(cons... | 25.116667 | 103 | 0.606503 | HeadReaper-hc |
8c886a2a571dbcd71d63c516583be8dfd082b872 | 2,612 | hpp | C++ | include/utility/EventType.hpp | benhj/KnoxCrypt | 41d2c2518fb42728a5a07f6de43682bf881ec77e | [
"BSD-3-Clause"
] | 21 | 2016-08-24T04:48:43.000Z | 2021-12-21T18:41:00.000Z | include/utility/EventType.hpp | benhj/KnoxCrypt | 41d2c2518fb42728a5a07f6de43682bf881ec77e | [
"BSD-3-Clause"
] | 2 | 2016-02-16T16:20:12.000Z | 2016-02-27T16:51:14.000Z | include/utility/EventType.hpp | benhj/KnoxCrypt | 41d2c2518fb42728a5a07f6de43682bf881ec77e | [
"BSD-3-Clause"
] | 3 | 2016-09-15T17:29:58.000Z | 2021-04-26T21:59:07.000Z | /*
Copyright (c) <2014-2015>, <BenHJ>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and th... | 52.24 | 85 | 0.672665 | benhj |
8c8ca008978b8807ba1c0c050f2526089ea5cf36 | 7,096 | hpp | C++ | include/IteratorRecognition/Analysis/GraphUpdater.hpp | robcasloz/IteratorRecognition | fa1a1e67c36cde3639ac40528228ae85e54e3b13 | [
"MIT"
] | null | null | null | include/IteratorRecognition/Analysis/GraphUpdater.hpp | robcasloz/IteratorRecognition | fa1a1e67c36cde3639ac40528228ae85e54e3b13 | [
"MIT"
] | 6 | 2019-05-29T21:11:03.000Z | 2021-07-01T10:47:02.000Z | include/IteratorRecognition/Analysis/GraphUpdater.hpp | robcasloz/IteratorRecognition | fa1a1e67c36cde3639ac40528228ae85e54e3b13 | [
"MIT"
] | 1 | 2019-05-13T11:55:39.000Z | 2019-05-13T11:55:39.000Z | //
//
//
#pragma once
#include "IteratorRecognition/Config.hpp"
#include "IteratorRecognition/Analysis/IteratorValueTracking.hpp"
#include "IteratorRecognition/Support/Utils/StringConversion.hpp"
#include "Pedigree/Analysis/Hazards.hpp"
#include "llvm/Support/JSON.h"
// using json::Value
// using json::Object
#i... | 28.963265 | 80 | 0.654594 | robcasloz |
8c8fe7c6ec689f8dfdf0c4748e1c408ac3949bad | 3,153 | cpp | C++ | src/model/WxToolbarPanel.cpp | xzrunner/easyone | c6cc33585a3a5affd44e51938a1bae5b146ab7af | [
"MIT"
] | 1 | 2020-07-07T07:14:01.000Z | 2020-07-07T07:14:01.000Z | src/model/WxToolbarPanel.cpp | xzrunner/easyone | c6cc33585a3a5affd44e51938a1bae5b146ab7af | [
"MIT"
] | null | null | null | src/model/WxToolbarPanel.cpp | xzrunner/easyone | c6cc33585a3a5affd44e51938a1bae5b146ab7af | [
"MIT"
] | null | null | null | #include "model/WxToolbarPanel.h"
#ifdef MODULE_MODEL
#include "model/WxStagePage.h"
#include <ee0/SubjectMgr.h>
#include <ee0/WxImageVList.h>
#include <ee0/WxLibraryItem.h>
#include <ee3/WxSkeletalTreeCtrl.h>
#include <node0/SceneNode.h>
#include <node3/CompModelInst.h>
#include <model/Model.h>
#include <model/Mod... | 23.183824 | 99 | 0.68633 | xzrunner |
8c93b6455389186169e1ba624b7979eefda443b9 | 1,221 | cpp | C++ | Contest/Qualification Round Oct 2010/dinner.cpp | felikjunvianto/kfile-usaco-submissions | d4afdc0cbde7e19f09afc70c4b02d4bc5992696d | [
"MIT"
] | null | null | null | Contest/Qualification Round Oct 2010/dinner.cpp | felikjunvianto/kfile-usaco-submissions | d4afdc0cbde7e19f09afc70c4b02d4bc5992696d | [
"MIT"
] | null | null | null | Contest/Qualification Round Oct 2010/dinner.cpp | felikjunvianto/kfile-usaco-submissions | d4afdc0cbde7e19f09afc70c4b02d4bc5992696d | [
"MIT"
] | null | null | null | /*
PROG: dinner
LANG: C++
ID: felikju1
*/
#include <cstdio>
#include <iostream>
#include <string>
#include <cstring>
#include <utility>
#include <algorithm>
#define fi first
#define se second
using namespace std;
pair < long long, long long > sapi[1100];
pair < long long, long long > meja[1100... | 17.442857 | 79 | 0.579853 | felikjunvianto |
8c96b6b8d78cc49c8dc3ca8b1b93021797ce1c74 | 1,817 | cpp | C++ | lib/protobuf/qml/server_method.cpp | pauldotknopf/protobuf-qml | e10f46567344738563140e8f06d5a2569b961d06 | [
"MIT"
] | 56 | 2015-05-14T16:00:43.000Z | 2022-02-11T20:25:36.000Z | lib/protobuf/qml/server_method.cpp | pauldotknopf/protobuf-qml | e10f46567344738563140e8f06d5a2569b961d06 | [
"MIT"
] | 19 | 2015-05-11T14:50:33.000Z | 2018-09-06T05:45:34.000Z | lib/protobuf/qml/server_method.cpp | pauldotknopf/protobuf-qml | e10f46567344738563140e8f06d5a2569b961d06 | [
"MIT"
] | 16 | 2015-10-29T13:25:48.000Z | 2021-06-30T18:34:32.000Z | #include "protobuf/qml/server_method.h"
#include <private/qv4arrayobject_p.h>
#include <private/qv4scopedvalue_p.h>
using namespace QV4;
namespace protobuf {
namespace qml {
void ServerMethodHolder::respond(QQmlV4Function* args) {
if (!impl()) {
qWarning() << "Server method is not initialized.";
args->set... | 25.236111 | 79 | 0.598239 | pauldotknopf |
8c9bd8c59c2be336d4bf321d13f63e4b09e0ab4b | 1,824 | hh | C++ | srcs/algorithm/Simulation.hh | JeremyPouyet/equation_finder | bac228b7aeb720c083c4d673545573b65e42e784 | [
"BSD-3-Clause"
] | null | null | null | srcs/algorithm/Simulation.hh | JeremyPouyet/equation_finder | bac228b7aeb720c083c4d673545573b65e42e784 | [
"BSD-3-Clause"
] | null | null | null | srcs/algorithm/Simulation.hh | JeremyPouyet/equation_finder | bac228b7aeb720c083c4d673545573b65e42e784 | [
"BSD-3-Clause"
] | null | null | null | #pragma once
#include <string>
#include <iostream>
#include "AProblem.hh"
#include "Config.hh"
#include "Population.hh"
#include "Display.hpp"
#include "Chrono.hpp"
#include "DynamicLoader.hpp"
class Simulation {
public:
Simulation();
/**
* Initialise the simulation
* @param ac, command line p... | 25.333333 | 82 | 0.648026 | JeremyPouyet |
8c9c094c9a7247ac578d2f9050891faa0a715e85 | 1,364 | cpp | C++ | brian2/codegen/runtime/weave_rt/templates/lumped_variable.cpp | divyashivaram/brian2 | ac086e478efa50be772c6cee55b52b43018bc77a | [
"BSD-2-Clause"
] | 1 | 2019-12-25T16:33:37.000Z | 2019-12-25T16:33:37.000Z | brian2/codegen/runtime/weave_rt/templates/lumped_variable.cpp | divyashivaram/brian2 | ac086e478efa50be772c6cee55b52b43018bc77a | [
"BSD-2-Clause"
] | null | null | null | brian2/codegen/runtime/weave_rt/templates/lumped_variable.cpp | divyashivaram/brian2 | ac086e478efa50be772c6cee55b52b43018bc77a | [
"BSD-2-Clause"
] | null | null | null | ////////////////////////////////////////////////////////////////////////////
//// MAIN CODE /////////////////////////////////////////////////////////////
{% macro main() %}
// USES_VARIABLES { _synaptic_post, _synaptic_pre, _num_target_neurons }
////// HANDLE DENORMALS ///
{% for line in denormals_code_lines %... | 27.836735 | 76 | 0.502933 | divyashivaram |
8ca3aba8c8312b563ce5db9432626ec50cbf5601 | 21,269 | cpp | C++ | exploitimpl.cpp | smalltong02/Bruce-Ma | 2ee9455635af9f0300f53781382de88d3ef99003 | [
"MIT"
] | 1 | 2021-06-22T04:41:41.000Z | 2021-06-22T04:41:41.000Z | exploitimpl.cpp | smalltong02/Bruce-Ma | 2ee9455635af9f0300f53781382de88d3ef99003 | [
"MIT"
] | 1 | 2021-02-23T17:45:30.000Z | 2021-02-23T17:45:30.000Z | exploitimpl.cpp | smalltong02/Bruce-Ma | 2ee9455635af9f0300f53781382de88d3ef99003 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "hookimpl.h"
#include "HookImplementObject.h"
#include "utils.h"
#include "exploitmpl.h"
#include "UniversalObject.h"
using namespace cchips;
processing_status WINAPI CHookImplementObject::detour_virtualAlloc(detour_node* node, LPVOID lpAddress, SIZE_T dwSize, DWORD flAllocationType, DWOR... | 39.68097 | 432 | 0.669613 | smalltong02 |
8caa26682c79e0eab7a19e45a9da271cc67aefdc | 710 | cpp | C++ | Graphs/Traverse/BFS.cpp | xdanielsb/Marathon-book | 620f1eb9ce54fc05a923e087ef1b130c98251b60 | [
"MIT"
] | 4 | 2017-01-15T04:59:55.000Z | 2018-04-06T19:51:49.000Z | Graphs/Traverse/BFS.cpp | xdanielsb/MarathonBook | 620f1eb9ce54fc05a923e087ef1b130c98251b60 | [
"MIT"
] | 1 | 2017-02-21T01:00:51.000Z | 2017-03-06T03:24:27.000Z | Graphs/Traverse/BFS.cpp | xdanielsb/MarathonBook | 620f1eb9ce54fc05a923e087ef1b130c98251b60 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef vector < int > vi;
vi dis;
vector < vi > graph;
void show_distances(){
for( int i = 0; i< dis.size(); i++){
cout << i << " : " << dis[i] << "\n";
}
}
void bfs(int origin){
queue < int > q;
dis[origin] = 0;
q.push(origin);
while( ... | 18.205128 | 41 | 0.530986 | xdanielsb |
8cac01860bd3a906cd8d1492b09240f19944d139 | 3,630 | hpp | C++ | include/STELA/binding.hpp | Kerndog73/STELA | 11449b4bb440494f3ec4b1172b2688b5ec1bcd0a | [
"MIT"
] | 10 | 2018-06-20T05:12:59.000Z | 2021-11-23T02:56:04.000Z | include/STELA/binding.hpp | Kerndog73/STELA | 11449b4bb440494f3ec4b1172b2688b5ec1bcd0a | [
"MIT"
] | null | null | null | include/STELA/binding.hpp | Kerndog73/STELA | 11449b4bb440494f3ec4b1172b2688b5ec1bcd0a | [
"MIT"
] | null | null | null | //
// binding.hpp
// STELA
//
// Created by Indi Kernick on 13/12/18.
// Copyright © 2018 Indi Kernick. All rights reserved.
//
#ifndef stela_binding_hpp
#define stela_binding_hpp
#include <tuple>
#include <memory>
#include <algorithm>
#include <type_traits>
#include "retain ptr.hpp"
#include "pass traits.hpp"
n... | 26.115108 | 89 | 0.664738 | Kerndog73 |
8caf5b87ce063dcc81b8972ce58f417e9fec1e4e | 6,159 | hpp | C++ | src/R.hpp | dantehemerson/Arkanoid-Returns | 478ae8df92f978dce95fd227a9047e83dea9a855 | [
"MIT"
] | 3 | 2018-09-25T07:59:06.000Z | 2019-08-24T09:35:43.000Z | src/R.hpp | dantehemerson/Arkanoid-Returns | 478ae8df92f978dce95fd227a9047e83dea9a855 | [
"MIT"
] | 1 | 2018-05-08T11:34:05.000Z | 2018-05-08T11:34:05.000Z | src/R.hpp | dantehemerson/Arkanoid-Returns | 478ae8df92f978dce95fd227a9047e83dea9a855 | [
"MIT"
] | 1 | 2020-06-07T21:23:24.000Z | 2020-06-07T21:23:24.000Z | #pragma once
#ifndef R_HPP
#define R_HPP
#include <allegro5/allegro.h>
#include <allegro5/allegro_color.h>
#include <string>
#include <array>
namespace R {
namespace Constant {
// Frames por segundo.
static const int FPS = 60;
static const int SIZE_FONT_VENUS_18 = 18;
static const int SIZE_FONT_VENUS_20 = ... | 31.106061 | 99 | 0.732911 | dantehemerson |
8cb7bdd20573b785824dcaf639fcd55279fd8b1a | 853 | cpp | C++ | luogu/P1182.cpp | delphi122/knowledge_planet | e86cb8f9aa47ef8918cde0e814984a6535023c21 | [
"Apache-2.0"
] | 1 | 2020-07-24T03:07:08.000Z | 2020-07-24T03:07:08.000Z | luogu/P1182.cpp | delphi122/knowledge_planet | e86cb8f9aa47ef8918cde0e814984a6535023c21 | [
"Apache-2.0"
] | null | null | null | luogu/P1182.cpp | delphi122/knowledge_planet | e86cb8f9aa47ef8918cde0e814984a6535023c21 | [
"Apache-2.0"
] | null | null | null | //
// Created by yangtao on 20-4-21.
//
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 5;
int a[N];
int l, r;
int n, m;
int mmax, ssum;
int calc(int step) {
int team = 0;
int s = a[0];
for(int i = 1; i < n; i++) {
if(s + a[i] ... | 16.09434 | 33 | 0.393904 | delphi122 |
8cc1f4903612346513193a1c4c8303abb19724af | 47 | hpp | C++ | src/boost_bimap_views_multiset_view.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 10 | 2018-03-17T00:58:42.000Z | 2021-07-06T02:48:49.000Z | src/boost_bimap_views_multiset_view.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 2 | 2021-03-26T15:17:35.000Z | 2021-05-20T23:55:08.000Z | src/boost_bimap_views_multiset_view.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 4 | 2019-05-28T21:06:37.000Z | 2021-07-06T03:06:52.000Z | #include <boost/bimap/views/multiset_view.hpp>
| 23.5 | 46 | 0.808511 | miathedev |
bc4b8e0170b513dc78154fe2976e4e5333999e02 | 54,459 | cpp | C++ | FDPS-5.0g/src/particle_mesh/decomposition.cpp | subarutaro/GPLUM | 89b1dadb08a0c6adcdc48879ddf2b7b0fb02912f | [
"MIT"
] | 77 | 2015-02-12T02:35:40.000Z | 2022-03-11T01:10:31.000Z | FDPS-5.0g/src/particle_mesh/decomposition.cpp | subarutaro/GPLUM | 89b1dadb08a0c6adcdc48879ddf2b7b0fb02912f | [
"MIT"
] | 9 | 2015-03-24T09:44:29.000Z | 2021-11-30T19:42:58.000Z | FDPS-5.0g/src/particle_mesh/decomposition.cpp | subarutaro/GPLUM | 89b1dadb08a0c6adcdc48879ddf2b7b0fb02912f | [
"MIT"
] | 28 | 2015-03-17T06:58:09.000Z | 2022-02-14T07:16:25.000Z | #include "pp.h"
namespace ParticleSimulator{
namespace ParticleMesh{
extern double (*p_cache)[4];
static char cbuf[CHARMAX];
void createDivision( const int n, int *ndiv){
int nx, ny, nz;
int n0, n1;
n0 = (int)pow(n+0.1,0.33333333333333333333);
while(n%n0)n0--;
nx = n0;
n1 = n/nx;
n0 = (int)sqrt... | 28.334547 | 128 | 0.631246 | subarutaro |
bc507b82a15ddcf6137dbb7d418e83b632962315 | 655 | hpp | C++ | src/mxd.hpp | DavidR86/mxd | bf0a72305701dd5c76c2b3daa4bdba14d638b29d | [
"MIT"
] | 2 | 2018-11-06T18:57:29.000Z | 2018-11-06T19:06:36.000Z | src/mxd.hpp | DavidR86/mxd | bf0a72305701dd5c76c2b3daa4bdba14d638b29d | [
"MIT"
] | 27 | 2018-11-12T23:45:43.000Z | 2019-01-21T15:39:18.000Z | src/mxd.hpp | DavidR86/mxd | bf0a72305701dd5c76c2b3daa4bdba14d638b29d | [
"MIT"
] | 3 | 2018-11-08T00:38:49.000Z | 2020-06-18T04:40:11.000Z | // -*- coding:utf-8; mode:c++; mode:auto-fill; fill-column:80; -*-
/// @file mxd.hpp
/// @brief
/// @author J. Arrieta <Juan.Arrieta@nablazerolabs.com>
/// @date November 13, 2018
/// @copyright (C) 2018 Nabla Zero Labs
#pragma once
// C++ Standard Library
namespace nzl {
/// @brief Initialize mxd.
//... | 24.259259 | 72 | 0.683969 | DavidR86 |
bc512300cf211cac876998370987f2d78c9adb65 | 1,888 | hpp | C++ | src/Parser.hpp | yatsuha4/lilyan | 6005667fb0bc887a74be8957b462f9963a75a6b6 | [
"MIT"
] | null | null | null | src/Parser.hpp | yatsuha4/lilyan | 6005667fb0bc887a74be8957b462f9963a75a6b6 | [
"MIT"
] | null | null | null | src/Parser.hpp | yatsuha4/lilyan | 6005667fb0bc887a74be8957b462f9963a75a6b6 | [
"MIT"
] | null | null | null | /***********************************************************************//**
@file
***************************************************************************/
#pragma once
#include "Grammer.hpp"
#include "Output.hpp"
#include "Action.hpp"
/***********************************************************************//**
... | 28.606061 | 77 | 0.581568 | yatsuha4 |
bc5cd5834144b4965f8e7fbfa8e2b9e1db2d595c | 470 | cpp | C++ | option.cpp | sovaz1997/Zevra | cef3318279f9092e8e1a046ad74492c39cdbd67e | [
"Apache-2.0"
] | 3 | 2017-03-03T18:49:47.000Z | 2018-03-11T12:51:34.000Z | option.cpp | sovaz1997/Zevra | cef3318279f9092e8e1a046ad74492c39cdbd67e | [
"Apache-2.0"
] | 6 | 2016-10-11T18:17:56.000Z | 2016-11-27T11:46:20.000Z | option.cpp | sovaz1997/Zevra | cef3318279f9092e8e1a046ad74492c39cdbd67e | [
"Apache-2.0"
] | 12 | 2018-01-17T22:23:15.000Z | 2020-02-22T19:29:42.000Z | #include "option.hpp"
Option::Option() : UCI_AnalyseMode(false) {}
void Option::print() {
std::cout << "option name Clear Hash type button\n";
std::cout << "option name Hash type spin default 256 min " << min_hash_size << " max "<< max_hash_size << "\n";
std::cout << "option name UCI_AnalyseMode type check... | 42.727273 | 126 | 0.657447 | sovaz1997 |
bc64bb3d8b67cbb7348a0c554dcf9406fa90178c | 1,059 | cpp | C++ | RegisterFile.cpp | AaqilZ/RISK-Non-pipelined-Processor-Simulation | 148b5e8cc6b71296f524e5cef62225cb7052be9e | [
"MIT"
] | null | null | null | RegisterFile.cpp | AaqilZ/RISK-Non-pipelined-Processor-Simulation | 148b5e8cc6b71296f524e5cef62225cb7052be9e | [
"MIT"
] | null | null | null | RegisterFile.cpp | AaqilZ/RISK-Non-pipelined-Processor-Simulation | 148b5e8cc6b71296f524e5cef62225cb7052be9e | [
"MIT"
] | null | null | null | #include "RegisterFile.h"
#include "Utilities.h"
void RegisterFile::
print(){
if(writeToFile){
o << "*********** Register File ***********" << std::endl;
o << "---Inputs---" << std::endl;
o << "Read Register 1:" << readReg1 << std::endl;
o << "Read Register 2:" << readReg2 << std::endl;
o << "Write Regist... | 40.730769 | 68 | 0.524079 | AaqilZ |
bc65200dd0dc4a52b859c40c98bf8417f5bd67f5 | 1,150 | cpp | C++ | src/handlers/file/FileOpenHandler.cpp | Aerijo/latex-language-server | fbd520e40e7878ca9b114e408b21b6b1e181a875 | [
"MIT"
] | 4 | 2019-04-08T17:03:24.000Z | 2019-09-13T17:20:20.000Z | src/handlers/file/FileOpenHandler.cpp | Aerijo/latex-language-server | fbd520e40e7878ca9b114e408b21b6b1e181a875 | [
"MIT"
] | null | null | null | src/handlers/file/FileOpenHandler.cpp | Aerijo/latex-language-server | fbd520e40e7878ca9b114e408b21b6b1e181a875 | [
"MIT"
] | null | null | null | #include <iostream>
#include <filesystem/File.h>
#include <filesystem/FileManager.h>
#include <biber/BibIndexer.h>
#include <lconfig.h>
#include "FileOpenHandler.h"
void FileOpenHandler::run (optional<Value> ¶ms) {
if (!params) { handleMissingFileOpenParams(); return; }
Value &value = *params;
Valu... | 25.555556 | 91 | 0.654783 | Aerijo |
bc658dd458b5532dcdd1d02c79a284b34b91d4a1 | 1,398 | hpp | C++ | include/user_view.hpp | aaronamk/WM-GDC-Project-Parry | 77c829e2ea241a3d0a47ea1263b10afb20d76ca2 | [
"MIT"
] | 7 | 2020-11-11T17:36:07.000Z | 2021-09-23T00:19:39.000Z | include/user_view.hpp | aaronamk/WM-GDC-Project-Parry | 77c829e2ea241a3d0a47ea1263b10afb20d76ca2 | [
"MIT"
] | 79 | 2020-12-06T21:42:56.000Z | 2021-08-24T03:09:44.000Z | include/user_view.hpp | aaronamk/WM-GDC-Project-Parry | 77c829e2ea241a3d0a47ea1263b10afb20d76ca2 | [
"MIT"
] | 5 | 2021-01-29T12:27:13.000Z | 2021-04-24T01:52:53.000Z | #ifndef USER_VIEW_HPP
#define USER_VIEW_HPP
#include <chrono>
#include <list>
#include <memory>
#include <SFML/Graphics.hpp>
#include <SFML/Audio.hpp>
#include <box2d/box2d.h>
#include "view.hpp"
#include "game_state_factory.hpp"
class GameController;
class Actor;
class Pari;
/**
* Draw the screen for the playe... | 16.642857 | 55 | 0.693133 | aaronamk |
bc66c348c440aa1bc034ee555b6df4b673b4455c | 31,809 | cc | C++ | src/KnowledgeBase.cc | mnowotnik/fovris | 82f692743fa6c96fef05041e686d716b03c22f07 | [
"BSD-3-Clause"
] | 4 | 2017-01-04T17:22:55.000Z | 2018-12-08T02:10:18.000Z | src/KnowledgeBase.cc | Mike-Now/fovris | 82f692743fa6c96fef05041e686d716b03c22f07 | [
"BSD-3-Clause"
] | null | null | null | src/KnowledgeBase.cc | Mike-Now/fovris | 82f692743fa6c96fef05041e686d716b03c22f07 | [
"BSD-3-Clause"
] | 1 | 2022-03-24T05:26:13.000Z | 2022-03-24T05:26:13.000Z | #include "KnowledgeBase.h"
#include "Utils.h"
#include "DataPool.h"
#include "KB/KBRuleDisjunct.h"
#include "Pred/BinPredicateFunction.h"
#include <cassert>
#include <functional>
#include <set>
#include <utility>
namespace fovris {
namespace {
struct VarInfo {
TermType type;
bool satisfied;
};
/**
* @par... | 33.412815 | 80 | 0.594014 | mnowotnik |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.