hexsha stringlengths 40 40 | size int64 19 11.4M | ext stringclasses 13
values | lang stringclasses 1
value | max_stars_repo_path stringlengths 3 270 | max_stars_repo_name stringlengths 5 110 | max_stars_repo_head_hexsha stringlengths 40 40 | max_stars_repo_licenses listlengths 1 9 | max_stars_count float64 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 3 270 | max_issues_repo_name stringlengths 5 116 | max_issues_repo_head_hexsha stringlengths 40 78 | max_issues_repo_licenses listlengths 1 9 | max_issues_count float64 1 67k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 3 270 | max_forks_repo_name stringlengths 5 116 | max_forks_repo_head_hexsha stringlengths 40 78 | max_forks_repo_licenses listlengths 1 9 | max_forks_count float64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 19 11.4M | avg_line_length float64 1.93 229k | max_line_length int64 12 688k | alphanum_fraction float64 0.07 0.99 | matches listlengths 1 10 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
25db8cf7a5ca8f23db9e1b15505d7c17828426e7 | 4,016 | cpp | C++ | src/Graph.cpp | pimmen89/Overseer | cc92aa13a875b573d509034a16354b515b575afc | [
"MIT"
] | 10 | 2017-09-25T18:00:38.000Z | 2018-02-12T06:09:30.000Z | src/Graph.cpp | pimmen89/Overseer | cc92aa13a875b573d509034a16354b515b575afc | [
"MIT"
] | 4 | 2017-09-25T18:23:41.000Z | 2018-01-24T19:33:59.000Z | src/Graph.cpp | pimmen89/Overseer | cc92aa13a875b573d509034a16354b515b575afc | [
"MIT"
] | null | null | null | #include "Graph.h"
namespace Overseer{
/*
****************************
*** Public members start ***
****************************
*/
Graph::Graph(){}
Graph::Graph(Map* map):p_map(map){}
std::vector<ChokePoint> Graph::getChokePoints(size_t region_id_a, size_t region_id_b) const {
assert(ValidId(region... | 31.622047 | 111 | 0.513446 | [
"vector"
] |
25dd73c9b07483ec25868959f26d76918819fa0c | 29,149 | cpp | C++ | src/modules/osgParticle/generated_code/Particle.pypp.cpp | cmbruns/osgpyplusplus | f8bfca2cf841e15f6ddb41c958f3ad0d0b9e4b75 | [
"BSD-3-Clause"
] | 3 | 2017-04-20T09:11:47.000Z | 2021-04-29T19:24:03.000Z | src/modules/osgParticle/generated_code/Particle.pypp.cpp | cmbruns/osgpyplusplus | f8bfca2cf841e15f6ddb41c958f3ad0d0b9e4b75 | [
"BSD-3-Clause"
] | null | null | null | src/modules/osgParticle/generated_code/Particle.pypp.cpp | cmbruns/osgpyplusplus | f8bfca2cf841e15f6ddb41c958f3ad0d0b9e4b75 | [
"BSD-3-Clause"
] | null | null | null | // This file has been generated by Py++.
#include "boost/python.hpp"
#include "wrap_osgParticle.h"
#include "Particle.pypp.hpp"
namespace bp = boost::python;
void register_Particle_class(){
{ //::osgParticle::Particle
typedef bp::class_< osgParticle::Particle > Particle_exposer_t;
Particle_expos... | 43.119822 | 1,098 | 0.539229 | [
"render",
"shape"
] |
25e0dbe7da29a9b73734fcc0c40a7a8a8e769f36 | 194 | cpp | C++ | training-olinfo/galattici/main.cpp | GabrieleRolleri/competitive_programming | 8459e5045a16e01aa28248614ef9b88c7bae2ac0 | [
"MIT"
] | null | null | null | training-olinfo/galattici/main.cpp | GabrieleRolleri/competitive_programming | 8459e5045a16e01aa28248614ef9b88c7bae2ac0 | [
"MIT"
] | null | null | null | training-olinfo/galattici/main.cpp | GabrieleRolleri/competitive_programming | 8459e5045a16e01aa28248614ef9b88c7bae2ac0 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main(){
int M, N, K;
cin>>M>>N>>K;
string S;
vector<char> S(K);
for(int i=0; i<K; ++i){
}
return 0;
} | 7.461538 | 27 | 0.458763 | [
"vector"
] |
25e10f3a1025350d66d13913aa9e5d728e60f740 | 2,252 | cpp | C++ | Barracks.cpp | dianabacon/stalag-escape | 445085f1d95bec4190f29d72843bf4878d8f45ac | [
"MIT"
] | null | null | null | Barracks.cpp | dianabacon/stalag-escape | 445085f1d95bec4190f29d72843bf4878d8f45ac | [
"MIT"
] | null | null | null | Barracks.cpp | dianabacon/stalag-escape | 445085f1d95bec4190f29d72843bf4878d8f45ac | [
"MIT"
] | null | null | null | /*********************************************************************
** Program Filename: Barracks.cpp
** Author: Diana Bacon
** Date: 2015-11-28
** Description: Implementation of the Barracks class. Functions
** related to the derived class for Barracks spaces.
**********************************************... | 34.121212 | 72 | 0.463588 | [
"object"
] |
25e65851eaf068bb1fbca9742ea47fe6308b680e | 1,690 | cc | C++ | dadt/internal/executor/nccl_coo_all_reduce_executor.cc | amazingyyc/DADT | da6cf2c15923d2be6a10d2c5ece95ff6a6f98ebc | [
"MIT"
] | 5 | 2019-08-30T11:13:33.000Z | 2022-03-26T03:11:10.000Z | dadt/internal/executor/nccl_coo_all_reduce_executor.cc | amazingyyc/DADT | da6cf2c15923d2be6a10d2c5ece95ff6a6f98ebc | [
"MIT"
] | null | null | null | dadt/internal/executor/nccl_coo_all_reduce_executor.cc | amazingyyc/DADT | da6cf2c15923d2be6a10d2c5ece95ff6a6f98ebc | [
"MIT"
] | null | null | null | #include "executor/nccl_coo_all_reduce_executor.h"
#include "common/exception.h"
namespace dadt {
NCCLCooAllReduceExecutor::NCCLCooAllReduceExecutor() {
CUDA_CALL(cudaEventCreate(&finish_event_));
}
NCCLCooAllReduceExecutor::~NCCLCooAllReduceExecutor() {
cudaEventDestroy(finish_event_);
}
Tensor NCCLCooAllRedu... | 26.825397 | 75 | 0.668047 | [
"shape",
"vector"
] |
25e8d8da5c5b1f31cdc035b439da16997e564275 | 1,295 | cpp | C++ | codeBase/HackerRank/Algorithms/Dynamic Programming/Bricks Game/Solution.cpp | suren3141/codeBase | 10ed9a56aca33631dc8c419cd83859c19dd6ff09 | [
"Apache-2.0"
] | 3 | 2020-03-16T14:59:08.000Z | 2021-07-28T20:51:53.000Z | codeBase/HackerRank/Algorithms/Dynamic Programming/Bricks Game/Solution.cpp | suren3141/codeBase | 10ed9a56aca33631dc8c419cd83859c19dd6ff09 | [
"Apache-2.0"
] | 1 | 2020-03-15T10:57:02.000Z | 2020-03-15T10:57:02.000Z | codeBase/HackerRank/Algorithms/Dynamic Programming/Bricks Game/Solution.cpp | killerilaksha/codeBase | 91cbd950fc90066903e58311000784aeba4ffc02 | [
"Apache-2.0"
] | 18 | 2020-02-17T23:17:37.000Z | 2021-07-28T20:52:13.000Z | /*
Copyright (C) 2020, Sathira Silva.
Problem Statement: You and your friend decide to play a game using a stack consisting of N bricks. In this game, you can
alternatively remove 1, 2 or 3 bricks from the top, and the numbers etched on the removed bricks are
... | 37 | 131 | 0.593822 | [
"vector"
] |
25efd61f7a23fe685167b8e9073e39a9dd397e78 | 4,352 | cpp | C++ | core/animated_vector.cpp | ppearson/ImaginePartial | 9871b052f2edeb023e2845578ad69c25c5baf7d2 | [
"Apache-2.0"
] | 1 | 2018-07-10T13:36:38.000Z | 2018-07-10T13:36:38.000Z | core/animated_vector.cpp | ppearson/ImaginePartial | 9871b052f2edeb023e2845578ad69c25c5baf7d2 | [
"Apache-2.0"
] | null | null | null | core/animated_vector.cpp | ppearson/ImaginePartial | 9871b052f2edeb023e2845578ad69c25c5baf7d2 | [
"Apache-2.0"
] | null | null | null | /*
Imagine
Copyright 2011-2012 Peter Pearson.
Licensed under the Apache License, Version 2.0 (the "License");
You may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in wr... | 21.333333 | 94 | 0.725643 | [
"vector"
] |
25f298d46c7367dd24ecd58f8d1131c8ffe2650e | 8,228 | cpp | C++ | docs/template_plugin/tests/functional/op_reference/einsum.cpp | ivkalgin/openvino | 81685c8d212135dd9980da86a18db41fbf6d250a | [
"Apache-2.0"
] | null | null | null | docs/template_plugin/tests/functional/op_reference/einsum.cpp | ivkalgin/openvino | 81685c8d212135dd9980da86a18db41fbf6d250a | [
"Apache-2.0"
] | 18 | 2022-01-21T08:42:58.000Z | 2022-03-28T13:21:31.000Z | docs/template_plugin/tests/functional/op_reference/einsum.cpp | ematroso/openvino | 403339f8f470c90dee6f6d94ed58644b2787f66b | [
"Apache-2.0"
] | null | null | null | // Copyright (C) 2018-2022 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include <gtest/gtest.h>
#include "openvino/opsets/opset7.hpp"
#include "openvino/opsets/opset1.hpp"
#include "base_reference_test.hpp"
using namespace reference_tests;
using namespace ov;
namespace {
struct EinsumParams {
st... | 44.961749 | 113 | 0.478853 | [
"shape",
"vector",
"model"
] |
25f647d73e1dee31c9eab2d23bc39cc34f0458a3 | 16,598 | cpp | C++ | src/slib/network/network_async.cpp | inogroup/SLib | 6c053c8f47f04240b8444eac5f316effdee2eb01 | [
"MIT"
] | null | null | null | src/slib/network/network_async.cpp | inogroup/SLib | 6c053c8f47f04240b8444eac5f316effdee2eb01 | [
"MIT"
] | null | null | null | src/slib/network/network_async.cpp | inogroup/SLib | 6c053c8f47f04240b8444eac5f316effdee2eb01 | [
"MIT"
] | null | null | null | /*
* Copyright (c) 2008-2021 SLIBIO <https://github.com/SLIBIO>
*
* 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
* ... | 23.985549 | 133 | 0.700627 | [
"object"
] |
25f6bc3adaff13baedad106c0b34c6124d839afe | 13,622 | cpp | C++ | libcaf_core/test/composable_behavior.cpp | dosuperuser/actor-framework | bee96d84bbc95414df5084b2d65f4886ba731558 | [
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | libcaf_core/test/composable_behavior.cpp | dosuperuser/actor-framework | bee96d84bbc95414df5084b2d65f4886ba731558 | [
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | libcaf_core/test/composable_behavior.cpp | dosuperuser/actor-framework | bee96d84bbc95414df5084b2d65f4886ba731558 | [
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | /******************************************************************************
* ____ _ _____ *
* / ___| / \ | ___| C++ *
* | | / _ \ | |_ Actor *
... | 33.469287 | 80 | 0.643518 | [
"render",
"vector"
] |
d3078b52209dc0050531a2b4381e6441c6a4a3a7 | 17,263 | cpp | C++ | model/mosesdecoder/moses/FF/LexicalReordering/LexicalReorderingTable.cpp | saeedesm/UNMT_AH | cc171bf66933b5c0ad8a0ab87e57f7364312a7df | [
"Apache-2.0"
] | 3 | 2019-12-02T14:53:29.000Z | 2020-08-12T18:01:49.000Z | tools/mosesdecoder-master/moses/FF/LexicalReordering/LexicalReorderingTable.cpp | Pangeamt/nectm | 6b84f048698f2530b9fdbb30695f2e2217c3fbfe | [
"Apache-2.0"
] | 2 | 2020-11-06T14:40:10.000Z | 2020-12-29T19:03:11.000Z | tools/mosesdecoder-master/moses/FF/LexicalReordering/LexicalReorderingTable.cpp | Pangeamt/nectm | 6b84f048698f2530b9fdbb30695f2e2217c3fbfe | [
"Apache-2.0"
] | 2 | 2020-03-26T16:05:11.000Z | 2020-08-06T16:35:39.000Z | // -*- c++ -*-
#include "LexicalReorderingTable.h"
#include "moses/InputFileStream.h"
#include "moses/StaticData.h"
#include "moses/TranslationModel/PhraseDictionary.h"
#include "moses/GenerationDictionary.h"
#include "moses/TargetPhrase.h"
#include "moses/TargetPhraseCollection.h"
#include "moses/TranslationTask.h"
... | 29.06229 | 116 | 0.605109 | [
"object",
"vector",
"transform"
] |
d307d2070af3930341784c12ee76be872a33cb09 | 2,769 | cpp | C++ | common/src/module_linux.cpp | tyoma/micro-profiler | 32f6981c643b93997752d414f631fd6684772b28 | [
"MIT"
] | 194 | 2015-07-27T09:54:24.000Z | 2022-03-21T20:50:22.000Z | common/src/module_linux.cpp | tyoma/micro-profiler | 32f6981c643b93997752d414f631fd6684772b28 | [
"MIT"
] | 63 | 2015-08-19T16:42:33.000Z | 2022-02-22T20:30:49.000Z | common/src/module_linux.cpp | tyoma/micro-profiler | 32f6981c643b93997752d414f631fd6684772b28 | [
"MIT"
] | 33 | 2015-08-21T17:48:03.000Z | 2022-02-23T03:54:17.000Z | // Copyright (c) 2011-2021 by Artem A. Gevorkyan (gevorkyan.org)
//
// 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, ... | 31.11236 | 86 | 0.70242 | [
"vector"
] |
d31220617356ee986b31040c88c186424a8d0c2b | 1,156 | hpp | C++ | src/chunk.hpp | DylanSp/cpplox | 97186dba4a22402c626a2de588fadd5bfbc69ae3 | [
"MIT"
] | null | null | null | src/chunk.hpp | DylanSp/cpplox | 97186dba4a22402c626a2de588fadd5bfbc69ae3 | [
"MIT"
] | 4 | 2021-08-29T05:49:12.000Z | 2021-09-02T01:35:24.000Z | src/chunk.hpp | DylanSp/cpplox | 97186dba4a22402c626a2de588fadd5bfbc69ae3 | [
"MIT"
] | null | null | null | #pragma once
#include "value.hpp"
#include <cstdint>
#include <string>
#include <vector>
namespace lox {
class OpCode {
public:
static constexpr uint8_t OP_CONSTANT = 0;
static constexpr uint8_t OP_RETURN = 1;
static constexpr uint8_t OP_NEGATE = 2;
static constexpr uint8_t OP_ADD = 3;
static constexpr uin... | 27.52381 | 76 | 0.719723 | [
"vector"
] |
d319f9e9a7ff37e1ba2a6458ab50e7a1a5570a64 | 4,427 | cpp | C++ | DT3Core/Types/FileBuffer/FileHandleCompressedFD.cpp | nemerle/DT3 | 801615d507eda9764662f3a34339aa676170e93a | [
"MIT"
] | 3 | 2016-01-27T13:17:18.000Z | 2019-03-19T09:18:25.000Z | DT3Core/Types/FileBuffer/FileHandleCompressedFD.cpp | nemerle/DT3 | 801615d507eda9764662f3a34339aa676170e93a | [
"MIT"
] | 1 | 2016-01-28T14:39:49.000Z | 2016-01-28T22:12:07.000Z | DT3Core/Types/FileBuffer/FileHandleCompressedFD.cpp | adderly/DT3 | e2605be091ec903d3582e182313837cbaf790857 | [
"MIT"
] | 3 | 2016-01-25T16:44:51.000Z | 2021-01-29T19:59:45.000Z | //==============================================================================
///
/// File: FileHandleCompressedFD.cpp
///
/// Copyright (C) 2000-2014 by Smells Like Donkey Software Inc. All rights reserved.
///
/// This file is subject to the terms and conditions defined in
/// file 'LICENSE.txt', which is part of ... | 28.018987 | 123 | 0.52225 | [
"vector"
] |
d323795a1884ba5eab823f645226245e92cf7c54 | 4,877 | cc | C++ | src/tools/reconstruct_video.cc | h33p/libmv | fc7f41a484c3cb8df94e71b591076ab3c9e84827 | [
"MIT"
] | 1 | 2016-04-17T12:53:00.000Z | 2016-04-17T12:53:00.000Z | src/tools/reconstruct_video.cc | rgkoo/libmv-blender | cdf65edbb80d8904e2df9a20116d02546df93a81 | [
"MIT"
] | null | null | null | src/tools/reconstruct_video.cc | rgkoo/libmv-blender | cdf65edbb80d8904e2df9a20116d02546df93a81 | [
"MIT"
] | null | null | null | // Copyright (c) 2011 libmv authors.
//
// 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... | 36.395522 | 80 | 0.647119 | [
"transform",
"3d"
] |
d327c7bc5a758c3192d31b0cd90e1622e5043235 | 27,217 | cpp | C++ | fem/tmop_amr.cpp | pghysels/mfem | 3c1859e1d7d9d7bb35ed3a5261f15dcc24343d9a | [
"BSD-3-Clause"
] | null | null | null | fem/tmop_amr.cpp | pghysels/mfem | 3c1859e1d7d9d7bb35ed3a5261f15dcc24343d9a | [
"BSD-3-Clause"
] | null | null | null | fem/tmop_amr.cpp | pghysels/mfem | 3c1859e1d7d9d7bb35ed3a5261f15dcc24343d9a | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) 2010-2022, Lawrence Livermore National Security, LLC. Produced
// at the Lawrence Livermore National Laboratory. All Rights reserved. See files
// LICENSE and NOTICE for details. LLNL-CODE-806117.
//
// This file is part of the MFEM library. For more information and source code
// availability visit ht... | 30.27475 | 105 | 0.557923 | [
"mesh",
"geometry",
"vector",
"3d"
] |
d329a07a07c9cd56f2c6f29a83f1b63f7ceaffa7 | 17,134 | cpp | C++ | src/ramen/core/queue.cpp | helixd2s/Ramen | 5b1ebcfdc796b2276b607e71e09c5842d0c52933 | [
"MIT"
] | 4 | 2021-05-13T21:12:09.000Z | 2022-01-26T18:24:30.000Z | src/ramen/core/queue.cpp | helixd2s/Ramen | 5b1ebcfdc796b2276b607e71e09c5842d0c52933 | [
"MIT"
] | null | null | null | src/ramen/core/queue.cpp | helixd2s/Ramen | 5b1ebcfdc796b2276b607e71e09c5842d0c52933 | [
"MIT"
] | null | null | null | #pragma once
#include <ramen/core/core.hpp>
#include <ramen/core/device.hpp>
#include <ramen/core/queue.hpp>
#include <ramen/core/memory.hpp>
#include <ramen/core/consumer.hpp>
#include <ramen/core/keyed.hpp>
#include <ramen/core/commandBuffer.hpp>
//
namespace rmc {
//
vk::Buffer QueueObject::createUnif... | 53.711599 | 297 | 0.646084 | [
"vector"
] |
d32c27d64c0226fa9d6433c953e43ca64c50ea01 | 5,187 | cc | C++ | src/zero_inspector_sync.cc | devsnek/ivan | 98fc08ddb8daa9218cf9c803358edb057df2cd78 | [
"MIT"
] | 6 | 2018-05-10T14:27:49.000Z | 2018-05-31T02:44:39.000Z | src/zero_inspector_sync.cc | devsnek/zero-archive | 98fc08ddb8daa9218cf9c803358edb057df2cd78 | [
"MIT"
] | 123 | 2017-11-05T23:34:05.000Z | 2022-03-08T08:42:06.000Z | src/zero_inspector_sync.cc | devsnek/zero | 98fc08ddb8daa9218cf9c803358edb057df2cd78 | [
"MIT"
] | 3 | 2020-09-13T03:15:22.000Z | 2021-12-13T02:54:45.000Z | #include "v8.h"
#include "v8-inspector.h"
#include "zero.h"
using v8::Array;
using v8::Context;
using v8::Global;
using v8::Local;
using v8::Function;
using v8::FunctionCallbackInfo;
using v8::FunctionTemplate;
using v8::Object;
using v8::Isolate;
using v8::String;
using v8::Value;
using v8::Value;
namespace zero {
n... | 31.628049 | 96 | 0.712358 | [
"object"
] |
d32cd38807fa059d5d67cb0ec27a494cdbd09bc5 | 1,483 | cpp | C++ | Algorithm/arrays/array_sum_and_operations/C++/0001_solution.cpp | BitsCoding/DS-and-Algo | 481cfdf23429c1b9a60898628afbb93dfbbefc12 | [
"MIT"
] | 5 | 2020-10-08T16:53:05.000Z | 2020-11-29T09:35:49.000Z | Algorithm/arrays/array_sum_and_operations/C++/0001_solution.cpp | BitsCoding/DS-and-Algo | 481cfdf23429c1b9a60898628afbb93dfbbefc12 | [
"MIT"
] | 4 | 2020-10-17T14:18:15.000Z | 2020-10-17T18:22:13.000Z | Algorithm/arrays/array_sum_and_operations/C++/0001_solution.cpp | BitsCoding/DS-and-Algo | 481cfdf23429c1b9a60898628afbb93dfbbefc12 | [
"MIT"
] | 3 | 2020-10-17T14:42:47.000Z | 2021-10-01T09:55:12.000Z | /**
* Solution of problem 'array_sum_and_operations'.
* @file 001_solution.cpp
* @author Nischay Sharma
* @version 1.0
* */
#include <iostream>
#include <vector>
#define M 1000000007
#define ll long long
// formula to find sum from one to 'n'.
#define SUM(n) ((n * (n - 1)) / 2)
using namespace std;
/**
* Fin... | 24.716667 | 78 | 0.498989 | [
"vector"
] |
d3301e4e294cc0b44f5276ac74b5f31639b49344 | 2,385 | hpp | C++ | include/Sphere_d.hpp | sdmg15/CDT-plusplus | 13071b61677e0c1db077f252dcab25ea672bbe9d | [
"BSD-3-Clause"
] | 1 | 2019-10-05T10:58:34.000Z | 2019-10-05T10:58:34.000Z | include/Sphere_d.hpp | sdmg15/CDT-plusplus | 13071b61677e0c1db077f252dcab25ea672bbe9d | [
"BSD-3-Clause"
] | null | null | null | include/Sphere_d.hpp | sdmg15/CDT-plusplus | 13071b61677e0c1db077f252dcab25ea672bbe9d | [
"BSD-3-Clause"
] | 1 | 2020-07-13T03:39:34.000Z | 2020-07-13T03:39:34.000Z | /// Causal Dynamical Triangulations in C++ using CGAL
///
/// Copyright © 2014-2017 Adam Getchell
///
/// Inserts a given number of points into a d-dimensional sphere of
/// a given radius
/// \todo Make the vector compatible with the triangulation data structure
/// @file sphere_d.hpp
/// @brief Functions on d-Spher... | 32.671233 | 78 | 0.693501 | [
"vector"
] |
d330c1285c06be31312c5af4400ac499b644ddf1 | 10,091 | cc | C++ | test/matrix_bss.cc | upperwal/valhalla | fa1d104c123a8a33ef8e50b36951b9f89fd53480 | [
"MIT"
] | null | null | null | test/matrix_bss.cc | upperwal/valhalla | fa1d104c123a8a33ef8e50b36951b9f89fd53480 | [
"MIT"
] | null | null | null | test/matrix_bss.cc | upperwal/valhalla | fa1d104c123a8a33ef8e50b36951b9f89fd53480 | [
"MIT"
] | 1 | 2021-01-24T16:46:01.000Z | 2021-01-24T16:46:01.000Z | #include "proto/options.pb.h"
#include "sif/costconstants.h"
#include "test.h"
#include <iostream>
#include <string>
#include <valhalla/baldr/rapidjson_utils.h>
#include <vector>
#include "loki/worker.h"
#include "midgard/logging.h"
#include "odin/worker.h"
#include "thor/worker.h"
#include "sif/costfactory.h"
#incl... | 37.374074 | 200 | 0.63076 | [
"geometry",
"vector"
] |
d34c254d76870ab510f91d070601cbfd85701f97 | 201,475 | cc | C++ | wrappers/perl5/EST_Track_wrap.cc | zeehio/speech-tools | 0b0fb9387cbee2b1a5cb010b5a5ca04f5fe8f785 | [
"Unlicense"
] | 8 | 2015-06-12T12:13:59.000Z | 2021-03-16T17:56:49.000Z | wrappers/perl5/EST_Track_wrap.cc | zeehio/speech-tools | 0b0fb9387cbee2b1a5cb010b5a5ca04f5fe8f785 | [
"Unlicense"
] | 1 | 2017-01-02T08:02:45.000Z | 2017-01-02T08:02:45.000Z | wrappers/perl5/EST_Track_wrap.cc | zeehio/speech-tools | 0b0fb9387cbee2b1a5cb010b5a5ca04f5fe8f785 | [
"Unlicense"
] | 5 | 2015-10-13T12:54:31.000Z | 2020-01-21T07:46:14.000Z | /* ----------------------------------------------------------------------------
* This file was automatically generated by SWIG (http://www.swig.org).
* Version 1.3.27
*
* This file is not intended to be easily readable and contains a number of
* coding conventions designed to improve portability and efficiency.... | 28.127181 | 152 | 0.460831 | [
"object"
] |
d34f29cdc679ce89c6495f8778a806a15b80a066 | 3,241 | cpp | C++ | SPOJ/trash/5-longlong.cpp | AbstractXan/CompetitiveProgramming | a53bf9c3d5dbabd6bc8f13fd1e42613fdd4968d7 | [
"MIT"
] | null | null | null | SPOJ/trash/5-longlong.cpp | AbstractXan/CompetitiveProgramming | a53bf9c3d5dbabd6bc8f13fd1e42613fdd4968d7 | [
"MIT"
] | null | null | null | SPOJ/trash/5-longlong.cpp | AbstractXan/CompetitiveProgramming | a53bf9c3d5dbabd6bc8f13fd1e42613fdd4968d7 | [
"MIT"
] | null | null | null | // Find next smallest palindrome
// Issue : Trailing zeroes
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
typedef long long int ll;
// Helper
ll FindLength(ll k){return ceil(log10(k));}
ll reverse(ll k){
ll rev=0;
while(k){ rev = rev*10 + k%10; k/=10; }
return rev;
}
class Sol... | 27.466102 | 108 | 0.533477 | [
"vector"
] |
d35bfd2e4c9ecc2798b8c3ed0c331c8ab0183a15 | 7,814 | cpp | C++ | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/media/CFaceDetector.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 7 | 2017-07-13T10:34:54.000Z | 2021-04-16T05:40:35.000Z | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/media/CFaceDetector.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | null | null | null | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/media/CFaceDetector.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 9 | 2017-07-13T12:33:20.000Z | 2021-06-19T02:46:48.000Z | //=========================================================================
// Copyright (C) 2012 The Elastos Open Source Project
//
// 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
//
// ... | 28.311594 | 113 | 0.592398 | [
"object"
] |
d35ebc1095d89f565f81879cd84f02383d879860 | 1,332 | cpp | C++ | zg_morph.cpp | kejran/zenglue | cdd84ab539b958c09669a2a4091f15a55d139e65 | [
"MIT"
] | null | null | null | zg_morph.cpp | kejran/zenglue | cdd84ab539b958c09669a2a4091f15a55d139e65 | [
"MIT"
] | null | null | null | zg_morph.cpp | kejran/zenglue | cdd84ab539b958c09669a2a4091f15a55d139e65 | [
"MIT"
] | null | null | null | #include <vdfs/fileIndex.h>
#include <zenload/zenParser.h>
#include <zenload/zCMorphMesh.h>
#define EXPORT extern "C" __declspec(dllexport)
using Mesh = ZenLoad::zCMorphMesh;
EXPORT Mesh *zg_morph_init(VDFS::FileIndex *vdfs, const char *name) {
return new Mesh(name, *vdfs);
}
EXPORT void zg_morph_deinit(Mesh *mesh... | 28.956522 | 96 | 0.768769 | [
"mesh"
] |
d35f1798e1c355c814d1e44f016404b4046ac702 | 15,707 | hpp | C++ | craam/Transition.hpp | marekpetrik/CRAAM | 62cc392e876b5383faa5cb15ab1f6b70b26ff395 | [
"MIT"
] | 22 | 2015-09-28T14:41:00.000Z | 2020-07-03T00:16:19.000Z | craam/Transition.hpp | marekpetrik/CRAAM | 62cc392e876b5383faa5cb15ab1f6b70b26ff395 | [
"MIT"
] | 6 | 2017-08-10T18:35:40.000Z | 2018-10-13T01:38:04.000Z | craam/Transition.hpp | marekpetrik/CRAAM | 62cc392e876b5383faa5cb15ab1f6b70b26ff395 | [
"MIT"
] | 10 | 2016-09-19T18:31:07.000Z | 2018-07-05T08:59:45.000Z | // This file is part of CRAAM, a C++ library for solving plain
// and robust Markov decision processes.
//
// MIT License
//
// 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 restric... | 37.939614 | 112 | 0.646463 | [
"vector"
] |
d3676bddfdf3d3fc190b53411f290af27d216c73 | 4,321 | hpp | C++ | data-structures-and-algorithms/project-hashmap/map_vector.hpp | vampy/university | 9496cb63594dcf1cc2cec8650b8eee603f85fdab | [
"MIT"
] | 6 | 2015-06-22T19:43:13.000Z | 2019-07-15T18:08:41.000Z | data-structures-and-algorithms/project-hashmap/map_vector.hpp | vampy/university | 9496cb63594dcf1cc2cec8650b8eee603f85fdab | [
"MIT"
] | null | null | null | data-structures-and-algorithms/project-hashmap/map_vector.hpp | vampy/university | 9496cb63594dcf1cc2cec8650b8eee603f85fdab | [
"MIT"
] | 1 | 2015-09-26T09:01:54.000Z | 2015-09-26T09:01:54.000Z | #ifndef MAP_VECTOR_H_
#define MAP_VECTOR_H_
#include "vector.hpp"
namespace MapVector
{
template <typename TKey, typename TValue>
class Map;
template <typename TKey, typename TValue>
class Entry
{
public:
Entry() {}
Entry(TKey key, TValue value)
{
this->key = key;
this->value = value;
... | 21.93401 | 108 | 0.558436 | [
"vector"
] |
d36b3291896c0c31961ebcff73b6d4593a33cd65 | 867 | hpp | C++ | three/extras/geometries/text_2d_geometry.hpp | Lecrapouille/three_cpp | 5c3b4f4ca02bda6af232898c17e62caf8f887aa0 | [
"MIT"
] | null | null | null | three/extras/geometries/text_2d_geometry.hpp | Lecrapouille/three_cpp | 5c3b4f4ca02bda6af232898c17e62caf8f887aa0 | [
"MIT"
] | null | null | null | three/extras/geometries/text_2d_geometry.hpp | Lecrapouille/three_cpp | 5c3b4f4ca02bda6af232898c17e62caf8f887aa0 | [
"MIT"
] | null | null | null | #ifndef THREE_TEXT_2D_GEOMETRY_HPP
#define THREE_TEXT_2D_GEOMETRY_HPP
#include <three/core/geometry.hpp>
#include <three/extras/utils/font.hpp>
namespace three {
class Text2DGeometry : public Geometry
{
public:
typedef std::shared_ptr<Text2DGeometry> Ptr;
THREE_DECL static Ptr create(const std::string& tex... | 22.815789 | 64 | 0.700115 | [
"geometry"
] |
d36b846be01d930b28819829b578fac499b97acb | 6,055 | cpp | C++ | src/tools/ast_generator.cpp | spraza/lox-cpp | 7ebd34080324051371e00cd9e9d0fea5022a2c3a | [
"MIT"
] | 5 | 2019-08-04T17:32:46.000Z | 2022-01-03T07:37:19.000Z | src/tools/ast_generator.cpp | paymaan/lox-cpp | 7ebd34080324051371e00cd9e9d0fea5022a2c3a | [
"MIT"
] | null | null | null | src/tools/ast_generator.cpp | paymaan/lox-cpp | 7ebd34080324051371e00cd9e9d0fea5022a2c3a | [
"MIT"
] | 2 | 2021-11-13T19:28:57.000Z | 2022-02-03T04:21:12.000Z | #include <fstream>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
namespace so_utils {
// source:
// https://stackoverflow.com/questions/14265581/parse-split-a-string-in-c-using-string-delimiter-standard-c
static std::vector<std::string> split(const std::string& str,
... | 36.69697 | 111 | 0.488026 | [
"vector"
] |
d36fdd67d218821cc458b599bf5db8dc1eb05f5a | 17,174 | cpp | C++ | apiwzsk/CrdWzskLlv.cpp | mpsitech/wzsk-Whiznium-StarterK | 94a0a8a05a0fac06c4360b8f835556a299b9425a | [
"MIT"
] | 1 | 2020-09-20T16:25:07.000Z | 2020-09-20T16:25:07.000Z | apiwzsk/CrdWzskLlv.cpp | mpsitech/wzsk-Whiznium-StarterKit | 94a0a8a05a0fac06c4360b8f835556a299b9425a | [
"MIT"
] | null | null | null | apiwzsk/CrdWzskLlv.cpp | mpsitech/wzsk-Whiznium-StarterKit | 94a0a8a05a0fac06c4360b8f835556a299b9425a | [
"MIT"
] | null | null | null | /**
* \file CrdWzskLlv.cpp
* API code for job CrdWzskLlv (implementation)
* \copyright (C) 2016-2020 MPSI Technologies GmbH
* \author Emily Johnson (auto-generation)
* \date created: 5 Dec 2020
*/
// IP header --- ABOVE
#include "CrdWzskLlv.h"
using namespace std;
using namespace Sbecore;
using namespace Xmlio;... | 35.04898 | 267 | 0.685862 | [
"vector"
] |
c965350f6d02526c1c29e826b20bca60b951f964 | 4,062 | hpp | C++ | src/lib/FeltElements/internal/Format.hpp | feltech/FeltElements | 8f6374945e46a9c9a2a742482ffe6b923b8b5c25 | [
"MIT"
] | null | null | null | src/lib/FeltElements/internal/Format.hpp | feltech/FeltElements | 8f6374945e46a9c9a2a742482ffe6b923b8b5c25 | [
"MIT"
] | null | null | null | src/lib/FeltElements/internal/Format.hpp | feltech/FeltElements | 8f6374945e46a9c9a2a742482ffe6b923b8b5c25 | [
"MIT"
] | null | null | null | #pragma once
#ifndef EIGEN_DEFAULT_IO_FORMAT
#define EIGEN_DEFAULT_IO_FORMAT Eigen::IOFormat(12, 0, ", ", ",\n", "", "", "", "")
#endif
#include <fmt/format.h>
#include <fmt/ostream.h>
#include <spdlog/fmt/ostr.h>
#include <FeltElements/Typedefs.hpp>
#include <boost/algorithm/string/join.hpp>
#include <boost/range/ada... | 29.867647 | 97 | 0.625062 | [
"vector"
] |
c96b4b83a7bf71dff6c4389fa44002f061d6b808 | 4,959 | cc | C++ | mindspore/lite/tools/benchmark/nnie/src/custom_infer.cc | wsjlovecode/mindspore | 0b5ad5318041172c1e1d825343d496100a4ae2dc | [
"Apache-2.0"
] | null | null | null | mindspore/lite/tools/benchmark/nnie/src/custom_infer.cc | wsjlovecode/mindspore | 0b5ad5318041172c1e1d825343d496100a4ae2dc | [
"Apache-2.0"
] | null | null | null | mindspore/lite/tools/benchmark/nnie/src/custom_infer.cc | wsjlovecode/mindspore | 0b5ad5318041172c1e1d825343d496100a4ae2dc | [
"Apache-2.0"
] | null | null | null | /**
* Copyright 2021 Huawei Technologies Co., Ltd
*
* 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... | 30.801242 | 114 | 0.64509 | [
"shape",
"vector"
] |
c981119688cfd11698931df5a4eae655ad90a14c | 1,913 | hpp | C++ | include/codegen/include/GlobalNamespace/OnRenderImageTest.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 1 | 2021-11-12T09:29:31.000Z | 2021-11-12T09:29:31.000Z | include/codegen/include/GlobalNamespace/OnRenderImageTest.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | null | null | null | include/codegen/include/GlobalNamespace/OnRenderImageTest.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 2 | 2021-10-03T02:14:20.000Z | 2021-11-12T09:29:36.000Z | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
#pragma pack(push, 8)
// Begin includes
#include "extern/beatsaber-hook/shared/utils/typedefs.h"
// Including type: UnityEngine.MonoBehaviour
#include "UnityEngine/MonoBeh... | 37.509804 | 113 | 0.711448 | [
"object"
] |
c984aee592d96f7520c945def5be8d458dab800e | 12,758 | cpp | C++ | src/Compiler/Parser/Expr.cpp | BenjaminNavarro/Feral | 579411c36a1cc66f96fcda1b82e3259e22022ac2 | [
"BSD-3-Clause"
] | null | null | null | src/Compiler/Parser/Expr.cpp | BenjaminNavarro/Feral | 579411c36a1cc66f96fcda1b82e3259e22022ac2 | [
"BSD-3-Clause"
] | null | null | null | src/Compiler/Parser/Expr.cpp | BenjaminNavarro/Feral | 579411c36a1cc66f96fcda1b82e3259e22022ac2 | [
"BSD-3-Clause"
] | null | null | null | /*
Copyright (c) 2020, Electrux
All rights reserved.
Using the BSD 3-Clause license for the project,
main LICENSE file resides in project's root directory.
Please read that file and understand the license terms
before using or altering the project.
*/
#include "Internal.hpp"
Errors parse_expr_cols( phelper_t & ... | 20.644013 | 99 | 0.603543 | [
"vector"
] |
c98cb40871ece6c08ceec3fc5a1bebe4237013a7 | 1,068 | cpp | C++ | SearchingAndSorting/find_common_elements_in_three_sorted_arrays.cpp | xiaorancs/xr-Algorithm | 4b522b2936b986f7891756fc610917b99864c534 | [
"MIT"
] | 7 | 2017-12-11T12:42:39.000Z | 2019-11-17T15:10:26.000Z | SearchingAndSorting/find_common_elements_in_three_sorted_arrays.cpp | xiaorancs/xr-Algorithm | 4b522b2936b986f7891756fc610917b99864c534 | [
"MIT"
] | 1 | 2018-08-29T12:29:51.000Z | 2018-08-29T12:29:51.000Z | SearchingAndSorting/find_common_elements_in_three_sorted_arrays.cpp | xiaorancs/xr-Algorithm | 4b522b2936b986f7891756fc610917b99864c534 | [
"MIT"
] | 2 | 2018-01-29T08:26:30.000Z | 2018-08-10T01:30:44.000Z | /**
*Author: xiaoran
*Time: 2017-12-07 23:28
*Problem: 在三个排序数组中找到公共元素.
*
*分析:
* 合并排序中的一个比较合并,O(n1+n2+n3)
*/
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
template <class Type>
vector<Type> findCommonElements(vector<Type> a,vector<Type> b,vector<Type> c){
int n1,n2,n3,i=0,j=0... | 15.257143 | 78 | 0.552434 | [
"vector"
] |
c997042e964c19a4a226b100d1a3e6ff9c8d097c | 4,540 | cpp | C++ | src/utils.cpp | spolitov/cassandra-cpp-driver | 697c783f83e03cec8cd1881169d334dab42d311b | [
"Apache-2.0"
] | 4 | 2020-02-21T00:15:30.000Z | 2022-01-20T22:56:42.000Z | src/utils.cpp | spolitov/cassandra-cpp-driver | 697c783f83e03cec8cd1881169d334dab42d311b | [
"Apache-2.0"
] | 5 | 2020-10-22T16:53:03.000Z | 2021-05-19T17:29:33.000Z | src/utils.cpp | spolitov/cassandra-cpp-driver | 697c783f83e03cec8cd1881169d334dab42d311b | [
"Apache-2.0"
] | 5 | 2019-11-12T07:40:24.000Z | 2021-01-15T11:29:41.000Z | /*
Copyright (c) DataStax, Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, so... | 25.795455 | 103 | 0.624229 | [
"vector",
"transform"
] |
c997df903aecc75ddf4e1b56a8f4a6958bc042bd | 3,513 | cpp | C++ | hardware-control/TDD/transducers.cpp | julian-becker/hardware-control | 183844c4807c4360c467bf10c2e2ed47f8d7aa75 | [
"MIT"
] | null | null | null | hardware-control/TDD/transducers.cpp | julian-becker/hardware-control | 183844c4807c4360c467bf10c2e2ed47f8d7aa75 | [
"MIT"
] | null | null | null | hardware-control/TDD/transducers.cpp | julian-becker/hardware-control | 183844c4807c4360c467bf10c2e2ed47f8d7aa75 | [
"MIT"
] | null | null | null | //
// transducers.cpp
// hardware-control
//
// Created by Julian Becker on 19.01.16.
// Copyright (c) 2016 Julian Becker. All rights reserved.
//
#include "transducers.h"
#include <catch.h>
#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <streambuf>
#include <sstream>
#incl... | 25.830882 | 126 | 0.498434 | [
"vector"
] |
c99b6c2b0a9dc7094dcec79cf39d02eae68d0854 | 8,905 | cpp | C++ | src/test_example/safeactionselectortestclass.cpp | bbouvrie/jenkins-experimentation | ea64d8401b2cdcbfa4baa9fc67bf62f4a6862e72 | [
"MIT"
] | null | null | null | src/test_example/safeactionselectortestclass.cpp | bbouvrie/jenkins-experimentation | ea64d8401b2cdcbfa4baa9fc67bf62f4a6862e72 | [
"MIT"
] | null | null | null | src/test_example/safeactionselectortestclass.cpp | bbouvrie/jenkins-experimentation | ea64d8401b2cdcbfa4baa9fc67bf62f4a6862e72 | [
"MIT"
] | null | null | null | #include "safeactionselectortestclass.h"
#include "goofgamestate.h"
#include "public_define.h"
#include "DecisionMaker/safeactionselector.h"
#include <vector>
void SafeActionSelectorTestClass::GivenEmptyFieldWhenCallingGetActionVectorThenShouldGetAllActions()
{
// Given
FieldLayout layout = {3,3};
GoofGame... | 49.748603 | 150 | 0.739023 | [
"vector"
] |
c99e4939f70a05b06ef35177bb10571f4dfc95ba | 2,376 | cpp | C++ | codeforces/B - 0-1 MST/Accepted.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | 1 | 2022-02-11T16:55:36.000Z | 2022-02-11T16:55:36.000Z | codeforces/B - 0-1 MST/Accepted.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | codeforces/B - 0-1 MST/Accepted.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | /****************************************************************************************
* @author: kzvd4729 created: Aug/01/2020 21:01
* solution_verdict: Accepted language: GNU C++14
* run... | 23.524752 | 111 | 0.481902 | [
"vector"
] |
c9a0968aced81f530884c9bbff0affd39ed38f4c | 21,392 | cpp | C++ | src/R3Graphics/p5d.cpp | ReillyBova/Global-Illumination | 9657d34bbde926e8364337020e6d28016310ee45 | [
"MIT"
] | 33 | 2019-02-24T18:57:08.000Z | 2022-02-28T09:43:19.000Z | src/R3Graphics/p5d.cpp | ReillyBova/Global-Illumination | 9657d34bbde926e8364337020e6d28016310ee45 | [
"MIT"
] | null | null | null | src/R3Graphics/p5d.cpp | ReillyBova/Global-Illumination | 9657d34bbde926e8364337020e6d28016310ee45 | [
"MIT"
] | 5 | 2020-06-09T13:56:14.000Z | 2021-12-21T09:17:39.000Z | ////////////////////////////////////////////////////////////////////////
// Include files
////////////////////////////////////////////////////////////////////////
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <limits.h>
#include ... | 29.224044 | 128 | 0.571896 | [
"object",
"vector"
] |
c9a40b86e662bc77564445ff9b60a7c080cf5398 | 838 | cpp | C++ | 404.sum_of_left_leaves.cpp | liangwt/leetcode | 8f279343e975666a63ee531228c6836f20f199ca | [
"Apache-2.0"
] | 5 | 2019-09-12T05:23:44.000Z | 2021-11-15T11:19:39.000Z | 404.sum_of_left_leaves.cpp | liangwt/leetcode | 8f279343e975666a63ee531228c6836f20f199ca | [
"Apache-2.0"
] | 18 | 2019-09-23T13:11:06.000Z | 2019-11-09T11:20:17.000Z | 404.sum_of_left_leaves.cpp | liangwt/leetcode | 8f279343e975666a63ee531228c6836f20f199ca | [
"Apache-2.0"
] | null | null | null | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
#include "include/header/tree.hpp"
using namespace std;
class Solution
{
public:
int sumOfLeftLeaves(TreeNode *root)
... | 19.045455 | 86 | 0.5358 | [
"vector"
] |
c9ac3581c13e9a1a74d7e617329a8f953c8679d6 | 8,476 | hpp | C++ | include/VROSC/LightUpRenderersOnHover.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/VROSC/LightUpRenderersOnHover.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/VROSC/LightUpRenderersOnHover.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | 1 | 2022-03-30T21:07:35.000Z | 2022-03-30T21:07:35.000Z | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "beatsaber-hook/shared/utils/typedefs.h"
#include "beatsaber-hook/shared/utils/byref.hpp"
// Including type: UnityEngine.MonoBehaviour
#include ... | 46.571429 | 190 | 0.727584 | [
"vector"
] |
c9ae0db5c3aa5974a418ea6502701abab37a1236 | 6,339 | cpp | C++ | Modules/Segmentation/src/HoughTransformation2DFilter.cpp | SarahGrimm/MctAnalyzer | c2e8fe62304ff4357a66aca6f65aa10f8ce1c20e | [
"BSD-3-Clause"
] | null | null | null | Modules/Segmentation/src/HoughTransformation2DFilter.cpp | SarahGrimm/MctAnalyzer | c2e8fe62304ff4357a66aca6f65aa10f8ce1c20e | [
"BSD-3-Clause"
] | null | null | null | Modules/Segmentation/src/HoughTransformation2DFilter.cpp | SarahGrimm/MctAnalyzer | c2e8fe62304ff4357a66aca6f65aa10f8ce1c20e | [
"BSD-3-Clause"
] | null | null | null |
#include "HoughTransformation2DFilter.h"
HoughTransformation2DFilter::HoughTransformation2DFilter(){
initParams = HoughTransform2DInitParameters();
}
HoughTransformation2DFilter::~HoughTransformation2DFilter(){
}
void HoughTransformation2DFilter::InitFilter(HoughTransform2DInitParameters parameterList){
this-... | 34.080645 | 136 | 0.76826 | [
"geometry",
"vector"
] |
c9b56eb2c6cc43d596f59d37b4ae5d2e24bf0014 | 4,399 | cpp | C++ | explore.cpp | hi7/explore | 67829444422eba2efb25c5476adbdaa5aeab752a | [
"MIT"
] | null | null | null | explore.cpp | hi7/explore | 67829444422eba2efb25c5476adbdaa5aeab752a | [
"MIT"
] | null | null | null | explore.cpp | hi7/explore | 67829444422eba2efb25c5476adbdaa5aeab752a | [
"MIT"
] | null | null | null | #include "explore.hpp"
#include "assets.hpp"
using namespace blit;
const Point center(160, 120);
Point bones_position = center;
int32_t anim_x = 0;
int32_t anim_y = 0;
enum Direction { NE = 0, SE = 1, SW = 2, NW = 3 };
void init() {
set_screen_mode(ScreenMode::hires);
screen.sprites = Surface::load(bones_s... | 31.876812 | 119 | 0.55308 | [
"render"
] |
c9b59694f08b9341443d96beddfe1563df234d14 | 8,680 | cpp | C++ | samples/LoginCpp-UWP/LoginCpp/App.xaml.cpp | omer-ispl/winsdkfb1 | e3bcd1d1e49e5ff94e6a9c971e4d8a9c82fad93b | [
"MIT"
] | 197 | 2015-07-14T22:33:14.000Z | 2019-05-05T15:26:15.000Z | samples/LoginCpp-UWP/LoginCpp/App.xaml.cpp | omer-ispl/winsdkfb1 | e3bcd1d1e49e5ff94e6a9c971e4d8a9c82fad93b | [
"MIT"
] | 209 | 2015-07-15T14:49:48.000Z | 2019-02-15T14:39:48.000Z | samples/LoginCpp-UWP/LoginCpp/App.xaml.cpp | omer-ispl/winsdkfb1 | e3bcd1d1e49e5ff94e6a9c971e4d8a9c82fad93b | [
"MIT"
] | 115 | 2015-07-15T06:57:34.000Z | 2019-01-12T08:55:15.000Z | //******************************************************************************
//
// Copyright (c) 2015 Microsoft Corporation. All rights reserved.
//
// This code is licensed under the MIT License (MIT).
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT L... | 31.911765 | 197 | 0.704147 | [
"object"
] |
c9c2415badea623ebba48dd5feb615669dee8515 | 779 | cpp | C++ | C++/binary-subarrays-with-sum.cpp | black-shadows/LeetCode-Solutions | b1692583f7b710943ffb19b392b8bf64845b5d7a | [
"Fair",
"Unlicense"
] | 1 | 2020-04-16T08:38:14.000Z | 2020-04-16T08:38:14.000Z | binary-subarrays-with-sum.cpp | Jeevan-kumar-Raj/LeetCode-Solutions-Topicwise | f1111b4edd401a3fc47111993bd7250cf4dc76da | [
"MIT"
] | null | null | null | binary-subarrays-with-sum.cpp | Jeevan-kumar-Raj/LeetCode-Solutions-Topicwise | f1111b4edd401a3fc47111993bd7250cf4dc76da | [
"MIT"
] | 1 | 2021-12-25T14:48:56.000Z | 2021-12-25T14:48:56.000Z | // Time: O(n)
// Space: O(1)
// Two pointers solution.
class Solution {
public:
int numSubarraysWithSum(vector<int>& A, int S) {
int result = 0;
int left = 0, right = 0, sum_left = 0, sum_right = 0;
for (int i = 0; i < A.size(); ++i) {
for (sum_left += A[i];
... | 27.821429 | 80 | 0.377407 | [
"vector"
] |
c9c2a3a4fdfad0e54f28e4a3fa2e98e20314d067 | 8,694 | cpp | C++ | src/TempoDetectCmd/TempoDetectCmd.cpp | madmaxoft/SkauTan | 941ea86e35d101cc3694b478689cd269ea371eac | [
"Unlicense"
] | 1 | 2018-05-02T11:51:35.000Z | 2018-05-02T11:51:35.000Z | src/TempoDetectCmd/TempoDetectCmd.cpp | madmaxoft/SkauTan | 941ea86e35d101cc3694b478689cd269ea371eac | [
"Unlicense"
] | 181 | 2018-01-06T08:39:30.000Z | 2019-12-02T09:25:24.000Z | src/TempoDetectCmd/TempoDetectCmd.cpp | madmaxoft/SkauTan | 941ea86e35d101cc3694b478689cd269ea371eac | [
"Unlicense"
] | 1 | 2022-03-10T05:25:04.000Z | 2022-03-10T05:25:04.000Z | #include <iostream>
#include <thread>
#include <vector>
#include <string>
#include <mutex>
#include <QString>
#include <QFile>
#include "../SongTempoDetector.hpp"
#include "../Song.hpp"
#include "../MetadataScanner.hpp"
using namespace std;
struct Results
{
/** The detected tempo. */
double mTempo;
/** Th... | 23 | 109 | 0.646538 | [
"vector"
] |
c9c576ba292035fd05206d5aaf993d49b122c8ed | 829 | cpp | C++ | class/screen/screen.cpp | leimingyu/notes-cpp | 496ea31bb733eee50914b7c2ae5a3cef4bfadc15 | [
"MIT"
] | null | null | null | class/screen/screen.cpp | leimingyu/notes-cpp | 496ea31bb733eee50914b7c2ae5a3cef4bfadc15 | [
"MIT"
] | null | null | null | class/screen/screen.cpp | leimingyu/notes-cpp | 496ea31bb733eee50914b7c2ae5a3cef4bfadc15 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
using namespace std;
// size_type need to go with containers
// it is like size_t, but more dynamic and tolerable on the data size
class Screen
{
public:
typedef string::size_type pos;
Screen() = default;
Screen(pos ht, pos wd, char c) : h... | 16.918367 | 78 | 0.66345 | [
"vector"
] |
c9c7c4f9fb0970d3bda73641b516eeba79fc7e91 | 1,573 | cpp | C++ | Conch/source/webglPlus/v8/JCWebGLPlusV8.cpp | waitingchange/ModifyLayanative2.0 | 05370d79a14f5b85367251c8ea846da4316f60f3 | [
"Apache-2.0"
] | null | null | null | Conch/source/webglPlus/v8/JCWebGLPlusV8.cpp | waitingchange/ModifyLayanative2.0 | 05370d79a14f5b85367251c8ea846da4316f60f3 | [
"Apache-2.0"
] | null | null | null | Conch/source/webglPlus/v8/JCWebGLPlusV8.cpp | waitingchange/ModifyLayanative2.0 | 05370d79a14f5b85367251c8ea846da4316f60f3 | [
"Apache-2.0"
] | null | null | null | /**
@file JCWebGLPlus.cpp
@brief
@author James
@version 1.0
@date 2019_8_24
*/
#include "../JCWebGLPlus.h"
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "../Log.h"
#include "JSWebGLPlus.h"
#include "JSArrayBufferRef.h"
#include "JSKeyframeNode.h"
#include "JSFloatKeyframe.h"
#include "J... | 29.12963 | 78 | 0.650985 | [
"object"
] |
c9c9e170649f130e5b6f76e4406593c607934b22 | 7,922 | cc | C++ | net/dns/host_resolver_impl_fuzzer.cc | Wzzzx/chromium-crosswalk | 768dde8efa71169f1c1113ca6ef322f1e8c9e7de | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 2 | 2019-01-28T08:09:58.000Z | 2021-11-15T15:32:10.000Z | net/dns/host_resolver_impl_fuzzer.cc | Wzzzx/chromium-crosswalk | 768dde8efa71169f1c1113ca6ef322f1e8c9e7de | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | net/dns/host_resolver_impl_fuzzer.cc | Wzzzx/chromium-crosswalk | 768dde8efa71169f1c1113ca6ef322f1e8c9e7de | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 6 | 2020-09-23T08:56:12.000Z | 2021-11-18T03:40:49.000Z | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <stddef.h>
#include <stdint.h>
#include <memory>
#include <vector>
#include "base/bind.h"
#include "base/logging.h"
#include "base/run_loop.h"
... | 33.008333 | 80 | 0.670412 | [
"vector"
] |
c9d63ace98b03ffe74b982b7e77c4a441eb19a2a | 57,086 | hpp | C++ | mtl/string.hpp | MichaelTrikergiotis/mtl | a761cc28cac50438d2e225c032ab51bdfc6a2e5c | [
"MIT"
] | 5 | 2020-10-29T19:45:34.000Z | 2021-09-02T17:07:46.000Z | examples/mtl/string.hpp | MichaelTrikergiotis/mtl-examples | ac95c85a7d73847a2331da8b54e382b23d8f0a05 | [
"MIT"
] | 1 | 2021-09-19T09:26:55.000Z | 2021-09-19T09:26:55.000Z | examples/mtl/string.hpp | MichaelTrikergiotis/mtl-examples | ac95c85a7d73847a2331da8b54e382b23d8f0a05 | [
"MIT"
] | null | null | null | #pragma once
// string header by Michael Trikergiotis
// 13/10/2017
//
//
// This header contains algorithms used for manipulating strings.
//
//
// Copyright (c) Michael Trikergiotis. All Rights Reserved.
// Licensed under the MIT license. See LICENSE in the project root for license information.
// See ThirdPartyN... | 35.567601 | 99 | 0.680692 | [
"vector"
] |
c9d79715ce22817c9961f0ff10ec87b1878b27f7 | 14,291 | cpp | C++ | src/qt/~~askpassphrasedialog.cpp | artboomerangwin/artboomerang | 86c507b803a6a7c34d9da663fea19b936e70cc27 | [
"MIT"
] | null | null | null | src/qt/~~askpassphrasedialog.cpp | artboomerangwin/artboomerang | 86c507b803a6a7c34d9da663fea19b936e70cc27 | [
"MIT"
] | null | null | null | src/qt/~~askpassphrasedialog.cpp | artboomerangwin/artboomerang | 86c507b803a6a7c34d9da663fea19b936e70cc27 | [
"MIT"
] | null | null | null | #include "askpassphrasedialog.h"
#include "ui_askpassphrasedialog.h"
#include "guiconstants.h"
#include "walletmodel.h"
#include <QMessageBox>
#include <QPushButton>
#include <QKeyEvent>
#include <QBitmap>
#include <QDebug>
extern bool fWalletUnlockStakingOnly;
AskPassphraseDialog::AskPassphraseDialog(Mode mode, QW... | 40.143258 | 192 | 0.590162 | [
"geometry",
"object",
"model",
"solid"
] |
c9d85ed48ce75ad6188b03a174ca17421643af98 | 40,215 | cpp | C++ | ugene/src/plugins/query_designer/src/QueryViewController.cpp | iganna/lspec | c75cba3e4fa9a46abeecbf31b5d467827cf4fec0 | [
"MIT"
] | null | null | null | ugene/src/plugins/query_designer/src/QueryViewController.cpp | iganna/lspec | c75cba3e4fa9a46abeecbf31b5d467827cf4fec0 | [
"MIT"
] | null | null | null | ugene/src/plugins/query_designer/src/QueryViewController.cpp | iganna/lspec | c75cba3e4fa9a46abeecbf31b5d467827cf4fec0 | [
"MIT"
] | null | null | null | /**
* UGENE - Integrated Bioinformatics Tools.
* Copyright (C) 2008-2012 UniPro <ugene@unipro.ru>
* http://ugene.unipro.ru
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version... | 33.153339 | 118 | 0.626731 | [
"render"
] |
518af20dba54c5e63a656b14256d4d818dd57b9a | 26,487 | cpp | C++ | Simple_Game_Engine/Source/SceneWorldData.cpp | HoloDev42/SimpleGameEngine | f8101781ab6705452d5edf0dacf85335d8b9f0c6 | [
"MIT"
] | null | null | null | Simple_Game_Engine/Source/SceneWorldData.cpp | HoloDev42/SimpleGameEngine | f8101781ab6705452d5edf0dacf85335d8b9f0c6 | [
"MIT"
] | null | null | null | Simple_Game_Engine/Source/SceneWorldData.cpp | HoloDev42/SimpleGameEngine | f8101781ab6705452d5edf0dacf85335d8b9f0c6 | [
"MIT"
] | 1 | 2018-09-15T00:41:19.000Z | 2018-09-15T00:41:19.000Z | #include "SceneWorldData.h"
SceneWorldData::SceneWorldData()
{
}
SceneWorldData::SceneWorldData(const SceneWorldData& other)
{
}
SceneWorldData::~SceneWorldData()
{
}
void SceneWorldData::Init(ID3D11Device* device, MaterialManager* materialManager)
{
// Init the model manager
m_ModelManager.Init(device, materia... | 27.504673 | 351 | 0.744856 | [
"object",
"vector",
"model",
"transform"
] |
51969953a4e53d8d0a011b773ed23152e4ecb91c | 4,458 | cc | C++ | src/operator/numpy/np_delete_op.cc | wms2537/incubator-mxnet | b7d7e02705deb1dc4942bf39efc19f133e2181f7 | [
"Apache-2.0",
"MIT"
] | 1 | 2019-12-20T11:25:06.000Z | 2019-12-20T11:25:06.000Z | src/operator/numpy/np_delete_op.cc | wms2537/incubator-mxnet | b7d7e02705deb1dc4942bf39efc19f133e2181f7 | [
"Apache-2.0",
"MIT"
] | null | null | null | src/operator/numpy/np_delete_op.cc | wms2537/incubator-mxnet | b7d7e02705deb1dc4942bf39efc19f133e2181f7 | [
"Apache-2.0",
"MIT"
] | 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 ... | 43.705882 | 99 | 0.606999 | [
"vector"
] |
51a27b8767c5f1bdf5bfa9ffff1b16d435eab088 | 4,069 | cpp | C++ | src/forces/gravity.cpp | mattstvan/arc | 1e86947ba70bacd718dcbecbe08b5d4242fe8117 | [
"MIT"
] | null | null | null | src/forces/gravity.cpp | mattstvan/arc | 1e86947ba70bacd718dcbecbe08b5d4242fe8117 | [
"MIT"
] | null | null | null | src/forces/gravity.cpp | mattstvan/arc | 1e86947ba70bacd718dcbecbe08b5d4242fe8117 | [
"MIT"
] | 1 | 2022-03-31T02:27:33.000Z | 2022-03-31T02:27:33.000Z | #include <gravity.h>
/*
Gravity model functions
*/
/*
Default constructor
Sets central body to Earth with aspherical effects disabled
*/
GravityModel::GravityModel() {
this->body = EARTH;
this->model = J2;
this->is_aspherical = false;
this->degree = 0;
this->order = 0;
}
/*
Direct constructor
@param body... | 31.789063 | 80 | 0.68985 | [
"vector",
"model"
] |
51ac11025999874a1904c56479d6ab8ea868ca64 | 4,024 | cpp | C++ | src/utility/stdirectoryservices.cpp | Starstructor/starstructor-cpp | dc64a2ef9ff0990ebfeec845d2104f4fc9e7d1e7 | [
"MIT"
] | 6 | 2015-06-09T18:34:12.000Z | 2020-09-09T11:57:26.000Z | src/utility/stdirectoryservices.cpp | Starstructor/starstructor-cpp | dc64a2ef9ff0990ebfeec845d2104f4fc9e7d1e7 | [
"MIT"
] | 1 | 2017-01-24T09:05:20.000Z | 2017-01-24T09:05:20.000Z | src/utility/stdirectoryservices.cpp | Starstructor/starstructor-cpp | dc64a2ef9ff0990ebfeec845d2104f4fc9e7d1e7 | [
"MIT"
] | 3 | 2015-01-01T12:44:41.000Z | 2020-01-15T18:58:47.000Z | /*
Starstructor, the Starbound Toolset
Copyright (C) 2013-2014 Chris Stamford
Licensed under terms of The MIT License (MIT)
Source file contributers:
Chris Stamford contact: cstamford@gmail.com
*/
#include "utility/stdirectoryservices.hpp"
#include "utility/sttimer.hpp"
using std::lock_guard;
using std::mu... | 25.794872 | 88 | 0.645626 | [
"object"
] |
51b1c813860b7742e1809c560490397be2d24041 | 14,915 | cpp | C++ | src/gameutils/microscenarioprovider.cpp | unghee/TorchCraftAI | e6d596483d2a9a8b796765ed98097fcae39b6ac0 | [
"MIT"
] | 629 | 2018-11-19T21:03:01.000Z | 2022-02-25T03:31:40.000Z | src/gameutils/microscenarioprovider.cpp | unghee/TorchCraftAI | e6d596483d2a9a8b796765ed98097fcae39b6ac0 | [
"MIT"
] | 27 | 2018-11-23T22:49:28.000Z | 2020-05-15T21:09:30.000Z | src/gameutils/microscenarioprovider.cpp | unghee/TorchCraftAI | e6d596483d2a9a8b796765ed98097fcae39b6ac0 | [
"MIT"
] | 129 | 2018-11-22T01:16:56.000Z | 2022-03-29T15:24:16.000Z | /*
* Copyright (c) 2017-present, Facebook, Inc.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "microscenarioprovider.h"
#include "buildtype.h"
#include "microplayer.h"
#include "modules/once.h"
namespace cherrypi {
name... | 33.820862 | 80 | 0.655783 | [
"vector"
] |
51b36f99226263e87fc92b4dab05343d46eb5c6f | 3,734 | cpp | C++ | lib/Interpreter/Program.cpp | kwalberg/allium | 13b98d56fe480f0e87a45cf870a76ef7a96f398d | [
"MIT"
] | null | null | null | lib/Interpreter/Program.cpp | kwalberg/allium | 13b98d56fe480f0e87a45cf870a76ef7a96f398d | [
"MIT"
] | null | null | null | lib/Interpreter/Program.cpp | kwalberg/allium | 13b98d56fe480f0e87a45cf870a76ef7a96f398d | [
"MIT"
] | null | null | null | #include <iostream>
#include "Interpreter/Program.h"
#include "Interpreter/WitnessProducer.h"
namespace interpreter {
bool Program::prove(const Expression &expr) {
// TODO: if `main` ever takes arguments, they need to be allocated here.
std::vector<Value> mainArgs;
if(witnesses(*this, expr, mainArgs).ne... | 30.357724 | 77 | 0.603107 | [
"vector"
] |
51b3f47000ea9d5eafcbcea40e0b1a39a35ff492 | 4,162 | cpp | C++ | client/testMain.cpp | jgbarbosa/display-wall | ed5c42a16a20065747707ea5bec969d799609d44 | [
"MIT"
] | 3 | 2017-03-14T23:19:49.000Z | 2017-03-27T09:53:01.000Z | client/testMain.cpp | jgbarbosa/display-wall | ed5c42a16a20065747707ea5bec969d799609d44 | [
"MIT"
] | null | null | null | client/testMain.cpp | jgbarbosa/display-wall | ed5c42a16a20065747707ea5bec969d799609d44 | [
"MIT"
] | 1 | 2017-03-16T16:11:44.000Z | 2017-03-16T16:11:44.000Z | /*
Copyright (c) 2016-17 Ingo Wald
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, distribute, s... | 32.771654 | 94 | 0.596828 | [
"vector"
] |
51b41967c2b1b8c6ef0bf91aa47c1b9b63b9c129 | 1,704 | cpp | C++ | Model Algorithms/Graphs/Shortest Path from Source to Destination with exactly k edges.cpp | UtkarshPathrabe/Competitive-Coding | ba322fbb1b88682d56a9b80bdd92a853f1caa84e | [
"MIT"
] | 13 | 2021-09-02T07:30:02.000Z | 2022-03-22T19:32:03.000Z | Model Algorithms/Graphs/Shortest Path from Source to Destination with exactly k edges.cpp | UtkarshPathrabe/Competitive-Coding | ba322fbb1b88682d56a9b80bdd92a853f1caa84e | [
"MIT"
] | null | null | null | Model Algorithms/Graphs/Shortest Path from Source to Destination with exactly k edges.cpp | UtkarshPathrabe/Competitive-Coding | ba322fbb1b88682d56a9b80bdd92a853f1caa84e | [
"MIT"
] | 3 | 2021-08-24T16:06:22.000Z | 2021-09-17T15:39:53.000Z | /* Time Complexity: O((V^3)*k); Space Complexity: O(V^2) */
#include <bits/stdc++.h>
using namespace std;
int shortestPath (vector < vector <int> > &graph, int src, int dest, int k) {
int V = graph.size();
int sp[V][V][2];
for (int e = 0; e <= k; e++) {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j+... | 26.625 | 169 | 0.539906 | [
"vector"
] |
51c526d681a0cb3808e3c57b138dfbcc53563229 | 6,379 | cpp | C++ | fbpcs/emp_games/attribution/test/AttributionAppTest.cpp | adshastri/fbpcs | 81d816ee56ea36f8f58dca6ae803fa50138cb91e | [
"MIT"
] | null | null | null | fbpcs/emp_games/attribution/test/AttributionAppTest.cpp | adshastri/fbpcs | 81d816ee56ea36f8f58dca6ae803fa50138cb91e | [
"MIT"
] | null | null | null | fbpcs/emp_games/attribution/test/AttributionAppTest.cpp | adshastri/fbpcs | 81d816ee56ea36f8f58dca6ae803fa50138cb91e | [
"MIT"
] | null | null | null | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include <cstdint>
#include <filesystem>
#include <string>
#include <unordered_map>
#include <vector>
#include <gtest/gtest.h>
#i... | 34.295699 | 80 | 0.684747 | [
"vector"
] |
51cef6e43ce38d58954c12bce0ede9f06c0dc7a0 | 2,310 | cpp | C++ | test/basic_tests/GameMapTest.cpp | ezalenski/MechMania-2016-AI | ffab99043294a43a67eacbb02d215b72cd704581 | [
"MIT"
] | null | null | null | test/basic_tests/GameMapTest.cpp | ezalenski/MechMania-2016-AI | ffab99043294a43a67eacbb02d215b72cd704581 | [
"MIT"
] | null | null | null | test/basic_tests/GameMapTest.cpp | ezalenski/MechMania-2016-AI | ffab99043294a43a67eacbb02d215b72cd704581 | [
"MIT"
] | null | null | null | //
// Created by Edmund Zalenski on 10/9/16.
//
#include <gtest/gtest.h>
#include "GameMap.h"
class GameMapTest : public ::testing::Test
{
protected:
virtual void TearDown() {
}
virtual void SetUp() {
}
public:
GameMapTest() : Test() {
g = new GameMap();
}
virtual ~GameMapTest() ... | 21.588785 | 54 | 0.625541 | [
"vector"
] |
51d36d355efa76a35923ff40c273698e2ca33b13 | 310 | cpp | C++ | company questions/binary.cpp | yusufkhan004/DSA-practice-problems | 04e0ea2b311a63a38fbf9d28e974b266da1a60a1 | [
"MIT"
] | null | null | null | company questions/binary.cpp | yusufkhan004/DSA-practice-problems | 04e0ea2b311a63a38fbf9d28e974b266da1a60a1 | [
"MIT"
] | null | null | null | company questions/binary.cpp | yusufkhan004/DSA-practice-problems | 04e0ea2b311a63a38fbf9d28e974b266da1a60a1 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> bin;
while (n != 0){
int rem = n % 2;
bin.push_back(rem);
n = n / 2;
}
reverse(bin.begin(), bin.end());
for (int i : bin){
cout << i << "";
}
return 0;
} | 16.315789 | 36 | 0.43871 | [
"vector"
] |
51e0371f04bae4bdd737c642640b641d4e412647 | 1,568 | cc | C++ | extern/acgl/src/ACGL/OpenGL/Data/GeometryDataLoadStore.cc | Faerbit/Saxum | 3b255142337e08988f2b4f1f56d6e061e8754336 | [
"CC-BY-3.0",
"CC-BY-4.0"
] | 2 | 2015-03-12T16:19:10.000Z | 2015-11-24T20:23:26.000Z | extern/acgl/src/ACGL/OpenGL/Data/GeometryDataLoadStore.cc | Faerbit/Saxum | 3b255142337e08988f2b4f1f56d6e061e8754336 | [
"CC-BY-3.0",
"CC-BY-4.0"
] | 15 | 2015-03-14T14:13:12.000Z | 2015-06-02T18:39:55.000Z | extern/acgl/src/ACGL/OpenGL/Data/GeometryDataLoadStore.cc | Faerbit/Saxum | 3b255142337e08988f2b4f1f56d6e061e8754336 | [
"CC-BY-3.0",
"CC-BY-4.0"
] | null | null | null | /***********************************************************************
* Copyright 2011-2012 Computer Graphics Group RWTH Aachen University. *
* All rights reserved. *
* Distributed under the terms of the MIT License (see LICENSE.TXT). *
***************************... | 31.36 | 99 | 0.478316 | [
"geometry"
] |
51e111f9f83aa55d88b99c57c08d9d2958751fa0 | 1,246 | cpp | C++ | ch09/274.cpp | mallius/CppPrimer | 0285fabe5934492dfed0a9cf67ba5650982a5f76 | [
"MIT"
] | null | null | null | ch09/274.cpp | mallius/CppPrimer | 0285fabe5934492dfed0a9cf67ba5650982a5f76 | [
"MIT"
] | null | null | null | ch09/274.cpp | mallius/CppPrimer | 0285fabe5934492dfed0a9cf67ba5650982a5f76 | [
"MIT"
] | 1 | 2022-01-25T15:51:34.000Z | 2022-01-25T15:51:34.000Z | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <deque>
using std::string;
using std::vector;
using std::list;
using std::deque;
using std::cout;
using std::endl;
using std::cin;
int main(void)
{
list<int> ilist;
for(size_t ix = 0; ix != 4; ++ix)
ilist.push_back(ix);
for(list<i... | 20.096774 | 72 | 0.5939 | [
"vector"
] |
51e7359f51407022ab82257f7cbd9951ea9198f7 | 12,299 | hpp | C++ | include/System/Single.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/System/Single.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/System/Single.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "extern/beatsaber-hook/shared/utils/typedefs.h"
// Including type: System.ValueType
#include "System/ValueType.hpp"
// Including type: S... | 51.676471 | 207 | 0.730872 | [
"object"
] |
51e838ff2900cf28e90978acdf0ac129e0f802d0 | 2,330 | cpp | C++ | src/LightBulb/Learning/Evolution/TeachingEvolutionEnvironment.cpp | domin1101/ANNHelper | 50acb5746d6dad6777532e4c7da4983a7683efe0 | [
"Zlib"
] | 5 | 2016-02-04T06:14:42.000Z | 2017-02-06T02:21:43.000Z | src/LightBulb/Learning/Evolution/TeachingEvolutionEnvironment.cpp | domin1101/ANNHelper | 50acb5746d6dad6777532e4c7da4983a7683efe0 | [
"Zlib"
] | 41 | 2015-04-15T21:05:45.000Z | 2015-07-09T12:59:02.000Z | src/LightBulb/Learning/Evolution/TeachingEvolutionEnvironment.cpp | domin1101/LightBulb | 50acb5746d6dad6777532e4c7da4983a7683efe0 | [
"Zlib"
] | null | null | null | // Includes
#include "LightBulb/Learning/Evolution/TeachingEvolutionEnvironment.hpp"
#include "LightBulb/Learning/Evolution/TeachedIndividual.hpp"
#include "LightBulb/Learning/LearningState.hpp"
#include "LightBulb/NetworkTopology/FeedForwardNetworkTopology.hpp"
//Library includes
namespace LightBulb
{
TeachingEvolu... | 36.984127 | 142 | 0.807296 | [
"vector"
] |
51f3e9e6de4ef5363c939d9b07ebeac99176ceea | 15,124 | cpp | C++ | src/top_quantifier_desc.cpp | b1f6c1c4/cfg-enum | 1a08071bde87f578ceaf834004c01b593db9bce8 | [
"BSD-3-Clause"
] | 4 | 2021-06-11T07:34:50.000Z | 2022-03-30T15:32:07.000Z | src/top_quantifier_desc.cpp | b1f6c1c4/cfg-enum | 1a08071bde87f578ceaf834004c01b593db9bce8 | [
"BSD-3-Clause"
] | null | null | null | src/top_quantifier_desc.cpp | b1f6c1c4/cfg-enum | 1a08071bde87f578ceaf834004c01b593db9bce8 | [
"BSD-3-Clause"
] | 2 | 2021-11-16T09:13:46.000Z | 2021-12-20T14:53:57.000Z | #include "top_quantifier_desc.h"
#include <set>
#include <cassert>
#include <iostream>
using namespace std;
TopQuantifierDesc::TopQuantifierDesc(value v) {
while (true) {
if (Forall* f = dynamic_cast<Forall*>(v.get())) {
for (VarDecl decl : f->decls) {
d.push_back(make_pair(QType::Forall, vector<... | 24.793443 | 124 | 0.575707 | [
"vector"
] |
51f5f4a2055d0a2575f74f4a3b458b965c0a3556 | 1,120 | cpp | C++ | 11838 - Come and Go.cpp | MohammadShakhatreh/Problems | c91b1f33828f6c891967d015df36b7cd3164d421 | [
"MIT"
] | null | null | null | 11838 - Come and Go.cpp | MohammadShakhatreh/Problems | c91b1f33828f6c891967d015df36b7cd3164d421 | [
"MIT"
] | null | null | null | 11838 - Come and Go.cpp | MohammadShakhatreh/Problems | c91b1f33828f6c891967d015df36b7cd3164d421 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
const int N = 2010;
bool vis[N];
stack<int> st;
vector<vector<int> > g;
int n, m, dfstime, idx[N], low[N], cmp;
void dfs(int u){
idx[u] = low[u] = ++dfstime;
st.push(u);
vis[u] = true;
for(int i = 0, v; i < (int)g[u].size(); ++i) {
v = g[u][i];
if(idx[v] == 0)... | 15.555556 | 47 | 0.514286 | [
"vector"
] |
51f753ae0879171d4070563f49fdaba0c18196a4 | 761 | cpp | C++ | Leetcode Solution/Binary Search/Easy/349. Intersection of Two Arrays.cpp | bilwa496/Placement-Preparation | bd32ee717f671d95c17f524ed28b0179e0feb044 | [
"MIT"
] | 169 | 2021-05-30T10:02:19.000Z | 2022-03-27T18:09:32.000Z | Leetcode Solution/Binary Search/Easy/349. Intersection of Two Arrays.cpp | bilwa496/Placement-Preparation | bd32ee717f671d95c17f524ed28b0179e0feb044 | [
"MIT"
] | 1 | 2021-10-02T14:46:26.000Z | 2021-10-02T14:46:26.000Z | Leetcode Solution/Binary Search/Easy/349. Intersection of Two Arrays.cpp | bilwa496/Placement-Preparation | bd32ee717f671d95c17f524ed28b0179e0feb044 | [
"MIT"
] | 44 | 2021-05-30T19:56:29.000Z | 2022-03-17T14:49:00.000Z |
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
vector<int> ans;
unordered_map<int,int> mp;
for(int i=0;i<nums1.size();i++)
{
if(mp[nums1[i]])
{
conti... | 22.382353 | 70 | 0.277267 | [
"vector"
] |
51fb3e94bee6c72c615f497fe4a38c97a1d63ecd | 2,116 | cpp | C++ | swapusage.cpp | hhoffstaette/swapusage | d3109815b6bb154f1254bafa29fecf72d6f17e57 | [
"Apache-2.0"
] | 3 | 2018-10-19T17:47:55.000Z | 2021-12-25T19:56:52.000Z | swapusage.cpp | hhoffstaette/swapusage | d3109815b6bb154f1254bafa29fecf72d6f17e57 | [
"Apache-2.0"
] | null | null | null | swapusage.cpp | hhoffstaette/swapusage | d3109815b6bb154f1254bafa29fecf72d6f17e57 | [
"Apache-2.0"
] | null | null | null |
#include "pid.h"
#include "process.h"
#include "swap.h"
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// lambda for sorting by swap
static auto orderBySwap = [](const unique_ptr<ProcessInfo>& first, const unique_ptr<ProcessInfo>& second)
{
retu... | 19.962264 | 105 | 0.558129 | [
"vector"
] |
51fc59f0c76203a59d438d1714b353976aefe40d | 1,040 | cc | C++ | algo/trees/preorder.cc | liuheng/recipes | 6f3759ab4e4fa64d9fd83a60ee6b6846510d910b | [
"MIT"
] | null | null | null | algo/trees/preorder.cc | liuheng/recipes | 6f3759ab4e4fa64d9fd83a60ee6b6846510d910b | [
"MIT"
] | null | null | null | algo/trees/preorder.cc | liuheng/recipes | 6f3759ab4e4fa64d9fd83a60ee6b6846510d910b | [
"MIT"
] | null | null | null | #include <stack>
#include <vector>
#include <cstdio>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
vector<int> preorderTraversal(TreeNode *root) {
stack<TreeNode*> S;
vector<int> values;
TreeNode *n... | 18.245614 | 56 | 0.555769 | [
"vector"
] |
a4010939da8f1b50c4106150f42c9a0107452e44 | 1,512 | hpp | C++ | gcpp/classes/ocode.hpp | razzlefratz/MotleyTools | 3c69c574351ce6f4b7e687c13278d4b6cbb200f3 | [
"0BSD"
] | 2 | 2015-10-15T19:32:42.000Z | 2021-12-20T15:56:04.000Z | gcpp/classes/ocode.hpp | razzlefratz/MotleyTools | 3c69c574351ce6f4b7e687c13278d4b6cbb200f3 | [
"0BSD"
] | null | null | null | gcpp/classes/ocode.hpp | razzlefratz/MotleyTools | 3c69c574351ce6f4b7e687c13278d4b6cbb200f3 | [
"0BSD"
] | null | null | null | /*====================================================================*
*
* ocode.hpp - declaration of ocode class;
*
* this object implements a generic means of storing information by
* name and classification; it is used by the olist, oheap, oroster,
* oglossary and ocatalog oject classes;
*
*. Motle... | 28.528302 | 72 | 0.439153 | [
"object"
] |
a408f6f73317ee830062ef4878b32cb3f81f053b | 3,979 | cpp | C++ | src/core/classfactory.cpp | dream-overflow/o3d | 087ab870cc0fd9091974bb826e25c23903a1dde0 | [
"FSFAP"
] | 2 | 2019-06-22T23:29:44.000Z | 2019-07-07T18:34:04.000Z | src/core/classfactory.cpp | dream-overflow/o3d | 087ab870cc0fd9091974bb826e25c23903a1dde0 | [
"FSFAP"
] | null | null | null | src/core/classfactory.cpp | dream-overflow/o3d | 087ab870cc0fd9091974bb826e25c23903a1dde0 | [
"FSFAP"
] | null | null | null | /**
* @file classfactory.cpp
* @brief
* @author Frederic SCHERMA (frederic.scherma@dreamoverflow.org)
* @date 2001-12-25
* @copyright Copyright (c) 2001-2017 Dream Overflow. All rights reserved.
* @details
*/
#include "o3d/core/precompiled.h"
#include "o3d/core/classfactory.h"
#include "o3d/core/baseobject.h... | 23.269006 | 100 | 0.703192 | [
"object"
] |
a4232b0a3b7c5b693e0ed087140f96cabbc46ce9 | 4,639 | hpp | C++ | mi/MeshImporterObj.hpp | tmichi/xendocast | 482c7e668423c11b1cc0f6e2fa98bd3b582536a8 | [
"MIT"
] | null | null | null | mi/MeshImporterObj.hpp | tmichi/xendocast | 482c7e668423c11b1cc0f6e2fa98bd3b582536a8 | [
"MIT"
] | 1 | 2017-06-14T04:32:12.000Z | 2017-06-14T04:32:12.000Z | mi/MeshImporterObj.hpp | tmichi/xendocast | 482c7e668423c11b1cc0f6e2fa98bd3b582536a8 | [
"MIT"
] | null | null | null | /**
* @file MeshImporterObj.hpp
* @author Takashi Michikawa <michikawa@acm.org>
*/
#ifndef MI_MESH_IMPORTER_OBJ_HPP
#define MI_MESH_IMPORTER_OBJ_HPP 1
#include <vector>
#include "Tokenizer.hpp"
#include "MeshImporter.hpp"
namespace mi
{
/**
* @class MeshImporterObj MeshImporterObj.hpp... | 43.764151 | 119 | 0.318388 | [
"mesh",
"object",
"vector"
] |
a425d7dca537d1dd1b8c3210d642afb40ae6292f | 5,237 | cc | C++ | src/memo/model/steg/Steg.cc | infinit/memo | 3a8394d0f647efe03ccb8bfe885a7279cb8be8a6 | [
"Apache-2.0"
] | 124 | 2017-06-22T19:20:54.000Z | 2021-12-23T21:36:37.000Z | src/memo/model/steg/Steg.cc | infinit/memo | 3a8394d0f647efe03ccb8bfe885a7279cb8be8a6 | [
"Apache-2.0"
] | 4 | 2017-08-21T15:57:29.000Z | 2019-01-10T02:52:35.000Z | src/memo/model/steg/Steg.cc | infinit/memo | 3a8394d0f647efe03ccb8bfe885a7279cb8be8a6 | [
"Apache-2.0"
] | 12 | 2017-06-29T09:15:35.000Z | 2020-12-31T12:39:52.000Z | #include <arpa/inet.h>
#include <boost/filesystem/fstream.hpp>
#include <elle/cryptography/hash.hh>
#include <elle/random.hh>
#include <elle/reactor/filesystem.hh>
#include <elle/system/Process.hh>
#include <memo/model/steg/Steg.hh>
#include <memo/model/MissingBlock.hh>
#include <memo/model/blocks/Block.hh>
extern ... | 25.42233 | 90 | 0.647508 | [
"model"
] |
a4277fe202eb525052ec019efda5e13a85a73ad8 | 1,171 | cpp | C++ | framework/GUI/GUIJavascript/Sources/ModuleGUIJavascript.cpp | RakeshShrestha/kigs | 2ada0068c8618935ed029db442ecf58f6bf96126 | [
"MIT"
] | 38 | 2020-05-08T13:39:57.000Z | 2022-03-28T05:58:41.000Z | framework/GUI/GUIJavascript/Sources/ModuleGUIJavascript.cpp | RakeshShrestha/kigs | 2ada0068c8618935ed029db442ecf58f6bf96126 | [
"MIT"
] | 3 | 2020-06-01T14:12:36.000Z | 2020-06-24T13:05:21.000Z | framework/GUI/GUIJavascript/Sources/ModuleGUIJavascript.cpp | RakeshShrestha/kigs | 2ada0068c8618935ed029db442ecf58f6bf96126 | [
"MIT"
] | 16 | 2020-05-04T19:20:35.000Z | 2022-01-25T08:31:29.000Z | #include "Core.h"
#include "ModuleGUIJavascript.h"
#include "WindowJavascript.h"
#include "DisplayDeviceCapsJavascript.h"
IMPLEMENT_CLASS_INFO(ModuleGUIJavascript);
ModuleGUIJavascript::ModuleGUIJavascript(const kstl::string& name,CLASS_NAME_TREE_ARG) : ModuleBase(name,PASS_CLASS_NAME_TREE_ARG)
{
}
ModuleGUIJavascr... | 26.613636 | 130 | 0.809564 | [
"vector"
] |
a42cfab99d23e86eec3ef4f53c3ab040303a5ccf | 5,781 | cpp | C++ | src/webservice/WebService.cpp | zhangguoqing/nebula | cd3b7d58c3165de28528c4e64abbc8f2b87a3ca5 | [
"Apache-2.0"
] | null | null | null | src/webservice/WebService.cpp | zhangguoqing/nebula | cd3b7d58c3165de28528c4e64abbc8f2b87a3ca5 | [
"Apache-2.0"
] | null | null | null | src/webservice/WebService.cpp | zhangguoqing/nebula | cd3b7d58c3165de28528c4e64abbc8f2b87a3ca5 | [
"Apache-2.0"
] | null | null | null | /* Copyright (c) 2018 vesoft inc. All rights reserved.
*
* This source code is licensed under Apache 2.0 License,
* attached with Common Clause Condition 1.0, found in the LICENSES directory.
*/
#include "base/Base.h"
#include "webservice/WebService.h"
#include <proxygen/httpserver/RequestHandlerFactory.h>
#includ... | 30.914439 | 91 | 0.572392 | [
"vector"
] |
a42f0b2074600181ca8a1c92d033cd11cf38c9f9 | 3,241 | cpp | C++ | segment_tree/counting_zeros.cpp | KishoreKaushal/CS2800 | c50bf8f3b05d3d226f467e654da82360f7a3e1e0 | [
"MIT"
] | 3 | 2018-03-13T07:44:56.000Z | 2018-12-20T11:04:36.000Z | segment_tree/counting_zeros.cpp | KishoreKaushal/CS2800 | c50bf8f3b05d3d226f467e654da82360f7a3e1e0 | [
"MIT"
] | null | null | null | segment_tree/counting_zeros.cpp | KishoreKaushal/CS2800 | c50bf8f3b05d3d226f467e654da82360f7a3e1e0 | [
"MIT"
] | null | null | null | #include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<utility>
using namespace std;
#define RIGHT(i) ((i*2 + 2))
#define LEFT(i) ((i*2 + 1))
#define MAXN (100000)
class segment_tree{
public:
int size;
vector<int> arr;
vector<int> tree;
segment_tree(int n){
size = ... | 25.519685 | 68 | 0.471768 | [
"vector"
] |
bf9a645da2b97565c00d42aa4975cacbf04d69d0 | 6,903 | cpp | C++ | src/GraphSeg.cpp | Shengzi99/GraphSegmentation-plug-play-python-lib | ccf21246053bd6a889d9cbbae33bb43e9b0396f5 | [
"MIT"
] | 1 | 2020-08-10T03:43:12.000Z | 2020-08-10T03:43:12.000Z | src/GraphSeg.cpp | Shengzi99/GraphSegmentation-DLL-for-Python | ccf21246053bd6a889d9cbbae33bb43e9b0396f5 | [
"MIT"
] | null | null | null | src/GraphSeg.cpp | Shengzi99/GraphSegmentation-DLL-for-Python | ccf21246053bd6a889d9cbbae33bb43e9b0396f5 | [
"MIT"
] | null | null | null | #include <pybind11/pybind11.h>
#include <pybind11/numpy.h>
#include <iostream>
#include <set>
#include <string>
#include <assert.h>
#include "segAlgorithm.h"
#include "gaussianFilter.h"
namespace py = pybind11;
class GraphSeg {
public:
GraphSeg(py::array_t<double, py::array::c_style | py::array::forcecast> inImg);
... | 25.951128 | 142 | 0.583804 | [
"shape",
"vector"
] |
bfa0c0b133adf3321545dbda1775af961c37c8ae | 5,798 | cpp | C++ | toolkits/graphical_models/deprecated/gibbs_sampling/image.cpp | RealM10/package | 3bcec9b677226ee0395e82e908f542aba0ecaad7 | [
"ECL-2.0",
"Apache-2.0"
] | 333 | 2016-07-29T19:22:07.000Z | 2022-03-30T02:40:34.000Z | toolkits/graphical_models/deprecated/gibbs_sampling/image.cpp | HybridGraph/GraphLab-PowerGraph | ba333c1cd82325ab2bfc6dd7ebb871b3fff64a94 | [
"ECL-2.0",
"Apache-2.0"
] | 17 | 2016-09-15T00:31:59.000Z | 2022-02-08T07:51:07.000Z | toolkits/graphical_models/deprecated/gibbs_sampling/image.cpp | HybridGraph/GraphLab-PowerGraph | ba333c1cd82325ab2bfc6dd7ebb871b3fff64a94 | [
"ECL-2.0",
"Apache-2.0"
] | 163 | 2016-07-29T19:22:11.000Z | 2022-03-07T07:15:24.000Z | /**
* Copyright (c) 2009 Carnegie Mellon University.
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2... | 25.318777 | 80 | 0.589859 | [
"vector"
] |
bfa0f94b5d4146680883fcad827ae2dfd9c4e3bb | 12,372 | cpp | C++ | exp/Lettvin_Repulsion/cpp/diffuse.cpp | LightStage-Aber/LightStage-Repo | 92f21b1b8a9f701cac3976a8db7034ecfefc58c7 | [
"Apache-2.0"
] | 10 | 2015-10-06T00:14:17.000Z | 2022-02-04T14:03:30.000Z | exp/Lettvin_Repulsion/cpp/diffuse.cpp | LightStage-Aber/LightStage-Repo | 92f21b1b8a9f701cac3976a8db7034ecfefc58c7 | [
"Apache-2.0"
] | 10 | 2017-05-05T11:10:19.000Z | 2019-06-04T15:30:24.000Z | exp/Lettvin_Repulsion/cpp/diffuse.cpp | LightStage-Aber/LightStage-Repo | 92f21b1b8a9f701cac3976a8db7034ecfefc58c7 | [
"Apache-2.0"
] | 2 | 2016-04-16T13:47:54.000Z | 2019-10-09T20:16:41.000Z | //******************************************************************************
// Diffuse.cpp Copyright(c) 2003 Jonathan D. Lettvin, All Rights Reserved.
//******************************************************************************
// Permission to use this code if and only if the first eight lines are first.
// T... | 47.76834 | 85 | 0.589638 | [
"object",
"vector",
"solid"
] |
bfa37c62fa517fba7557963faf964703bdd3614f | 2,239 | cc | C++ | release/src/router/aria2/test/UTMetadataRequestFactoryTest.cc | Clarkmania/ripetomato | 5eda5521468cb9cb7156ae6750cf8229b776d10e | [
"FSFAP"
] | 3 | 2019-01-13T09:19:57.000Z | 2022-01-15T12:16:14.000Z | release/src/router/aria2/test/UTMetadataRequestFactoryTest.cc | Clarkmania/ripetomato | 5eda5521468cb9cb7156ae6750cf8229b776d10e | [
"FSFAP"
] | 1 | 2020-07-28T08:22:45.000Z | 2020-07-28T08:22:45.000Z | release/src/router/aria2/test/UTMetadataRequestFactoryTest.cc | Clarkmania/ripetomato | 5eda5521468cb9cb7156ae6750cf8229b776d10e | [
"FSFAP"
] | 1 | 2020-03-06T21:17:24.000Z | 2020-03-06T21:17:24.000Z | #include "UTMetadataRequestFactory.h"
#include <vector>
#include <deque>
#include <cppunit/extensions/HelperMacros.h>
#include "MockPieceStorage.h"
#include "DownloadContext.h"
#include "Peer.h"
#include "BtMessage.h"
#include "extension_message_test_helper.h"
#include "BtHandshakeMessage.h"
#include "ExtensionMessa... | 27.304878 | 70 | 0.747655 | [
"vector"
] |
bfb1c9eb76b4ec5bbd2a49fcb2b2b95b369b5580 | 1,218 | cpp | C++ | LeetCode/889-1.cpp | LauZyHou/- | 66c047fe68409c73a077eae561cf82b081cf8e45 | [
"MIT"
] | 7 | 2019-02-25T13:15:00.000Z | 2021-12-21T22:08:39.000Z | LeetCode/889-1.cpp | LauZyHou/- | 66c047fe68409c73a077eae561cf82b081cf8e45 | [
"MIT"
] | null | null | null | LeetCode/889-1.cpp | LauZyHou/- | 66c047fe68409c73a077eae561cf82b081cf8e45 | [
"MIT"
] | 1 | 2019-04-03T06:12:46.000Z | 2019-04-03T06:12:46.000Z | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* traceback(vector<int>& pre,int e1,int e2,
vector<int>& rpost,int t1,int t2) {
if... | 25.914894 | 73 | 0.604269 | [
"vector"
] |
bfb3bb6dc03b656c564583c6517304f6266dd9d7 | 40,625 | cpp | C++ | VSBin/make_steering.cpp | sfegan/ChiLA | 916bdd95348c2df2ecc736511d5f5b2bfb4a831e | [
"BSD-3-Clause"
] | 1 | 2018-04-17T14:03:36.000Z | 2018-04-17T14:03:36.000Z | VSBin/make_steering.cpp | sfegan/ChiLA | 916bdd95348c2df2ecc736511d5f5b2bfb4a831e | [
"BSD-3-Clause"
] | null | null | null | VSBin/make_steering.cpp | sfegan/ChiLA | 916bdd95348c2df2ecc736511d5f5b2bfb4a831e | [
"BSD-3-Clause"
] | null | null | null | //-*-mode:c++; mode:font-lock;-*-
/*! \file make_steering.cpp
Make the steering file for CORSIKA
\author Stephen Fegan \n
UCLA \n
sfegan@astro.ucla.edu \n
\version 1.0
\date 03/02/2005
*/
#ifndef NO_CEFFIC
#ifndef CE... | 34.633419 | 79 | 0.624295 | [
"vector"
] |
bfb7d0b1fbfd257ccc91739f4b60eb0dfa4f55e5 | 2,436 | cpp | C++ | vslib/src/sai_vs_generic_remove.cpp | qiluo-msft/sonic-sairedis | 2059e4580d04dab68b5e15241c366fac9b3eaf30 | [
"Apache-2.0"
] | null | null | null | vslib/src/sai_vs_generic_remove.cpp | qiluo-msft/sonic-sairedis | 2059e4580d04dab68b5e15241c366fac9b3eaf30 | [
"Apache-2.0"
] | null | null | null | vslib/src/sai_vs_generic_remove.cpp | qiluo-msft/sonic-sairedis | 2059e4580d04dab68b5e15241c366fac9b3eaf30 | [
"Apache-2.0"
] | null | null | null | #include "sai_vs.h"
#include "sai_vs_state.h"
sai_status_t internal_vs_generic_remove(
_In_ sai_object_type_t object_type,
_In_ const std::string &serialized_object_id)
{
SWSS_LOG_ENTER();
auto it = g_objectHash.find(serialized_object_id);
if (it == g_objectHash.end())
{
SWSS_... | 24.118812 | 126 | 0.714286 | [
"object"
] |
bfb87085ce87970c0356d4fbba00e4a24cf71be7 | 7,710 | cpp | C++ | src/mapleall/maple_be/src/cg/x86_64/x64_call_conv.cpp | venshine/OpenArkCompiler | 264cd4463834356658154f0d254672ef559f245f | [
"MulanPSL-1.0"
] | 2 | 2019-09-06T07:02:41.000Z | 2019-09-09T12:24:46.000Z | src/mapleall/maple_be/src/cg/x86_64/x64_call_conv.cpp | venshine/OpenArkCompiler | 264cd4463834356658154f0d254672ef559f245f | [
"MulanPSL-1.0"
] | null | null | null | src/mapleall/maple_be/src/cg/x86_64/x64_call_conv.cpp | venshine/OpenArkCompiler | 264cd4463834356658154f0d254672ef559f245f | [
"MulanPSL-1.0"
] | null | null | null | /*
* Copyright (c) [2022] Huawei Technologies Co.,Ltd.All rights reserved.
*
* OpenArkCompiler is licensed under Mulan PSL v2.
* You can use this software according to the terms and conditions of the Mulan PSL v2.
* You may obtain a copy of Mulan PSL v2 at:
*
* http://license.coscl.org.cn/MulanPSL2
*
* THI... | 35.205479 | 108 | 0.679248 | [
"object"
] |
bfbdb7bcdf886485ebc4d29d2d9227c06cee000e | 345 | cpp | C++ | LeetCode/Palindrome Permutation/main.cpp | Code-With-Aagam/competitive-programming | 610520cc396fb13a03c606b5fb6739cfd68cc444 | [
"MIT"
] | 2 | 2022-02-08T12:37:41.000Z | 2022-03-09T03:48:56.000Z | LeetCode/Palindrome Permutation/main.cpp | ShubhamJagtap2000/competitive-programming-1 | 3a9a2e3dd08f8fa8ab823f295cd020d08d3bff84 | [
"MIT"
] | null | null | null | LeetCode/Palindrome Permutation/main.cpp | ShubhamJagtap2000/competitive-programming-1 | 3a9a2e3dd08f8fa8ab823f295cd020d08d3bff84 | [
"MIT"
] | null | null | null | class Solution {
public:
bool canPermutePalindrome(string s) {
vector<int> freq(257, 0);
for (const auto &ch : s) {
freq[ch]++;
}
int odd = 0;
for (const auto &ele : freq) {
if (ele % 2 == 1) {
odd++;
}
}
... | 21.5625 | 41 | 0.388406 | [
"vector"
] |
bfd726b2050311929a035a1f56bff04c3c765f2c | 2,753 | cpp | C++ | ABC/ABC033/D.cpp | rajyan/AtCoder | 2c1187994016d4c19b95489d2f2d2c0eab43dd8e | [
"MIT"
] | 1 | 2021-06-01T17:13:44.000Z | 2021-06-01T17:13:44.000Z | ABC/ABC033/D.cpp | rajyan/AtCoder | 2c1187994016d4c19b95489d2f2d2c0eab43dd8e | [
"MIT"
] | null | null | null | ABC/ABC033/D.cpp | rajyan/AtCoder | 2c1187994016d4c19b95489d2f2d2c0eab43dd8e | [
"MIT"
] | null | null | null | //#pragma GCC optimize ("-O3", "unroll-loops")
//#pragma GCC target ("arch=ivybridge")
//
//#include <cassert>
//#include <cstdio>
//#include <cmath>
//#include <iostream>
//#include <iomanip>
//#include <sstream>
//#include <vector>
//#include <set>
//#include <map>
//#include <queue>
//#include <numeric>
//#include <... | 28.091837 | 108 | 0.525972 | [
"vector"
] |
bfddebac0292fd57612e32996b77f227944efcc4 | 303,393 | cpp | C++ | pywinrt/winsdk/src/py.Windows.ApplicationModel.Email.cpp | pywinrt/python-winsdk | 1e2958a712949579f5e84d38220062b2cec12511 | [
"MIT"
] | 3 | 2022-02-14T14:53:08.000Z | 2022-03-29T20:48:54.000Z | pywinrt/winsdk/src/py.Windows.ApplicationModel.Email.cpp | pywinrt/python-winsdk | 1e2958a712949579f5e84d38220062b2cec12511 | [
"MIT"
] | 4 | 2022-01-28T02:53:52.000Z | 2022-02-26T18:10:05.000Z | pywinrt/winsdk/src/py.Windows.ApplicationModel.Email.cpp | pywinrt/python-winsdk | 1e2958a712949579f5e84d38220062b2cec12511 | [
"MIT"
] | null | null | null | // WARNING: Please don't edit this file. It was generated by Python/WinRT v1.0.0-beta.4
#include "pybase.h"
#include "py.Windows.ApplicationModel.Email.h"
PyTypeObject* py::winrt_type<winrt::Windows::ApplicationModel::Email::EmailAttachment>::python_type;
PyTypeObject* py::winrt_type<winrt::Windows::ApplicationModel:... | 33.376568 | 269 | 0.590571 | [
"object"
] |
bfe0c475fdce6708025e778ccae3254f01a08921 | 11,808 | hh | C++ | benchmarks/solvers/minizinc/include/minizinc/astiterator.hh | 95A31/MDD-LNS | 9b78143e13ce8b3916bf3cc9662d9cbfe63fd7c7 | [
"MIT"
] | null | null | null | benchmarks/solvers/minizinc/include/minizinc/astiterator.hh | 95A31/MDD-LNS | 9b78143e13ce8b3916bf3cc9662d9cbfe63fd7c7 | [
"MIT"
] | null | null | null | benchmarks/solvers/minizinc/include/minizinc/astiterator.hh | 95A31/MDD-LNS | 9b78143e13ce8b3916bf3cc9662d9cbfe63fd7c7 | [
"MIT"
] | null | null | null | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <guido.tack@monash.edu>
*/
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozil... | 31.913514 | 90 | 0.539634 | [
"vector"
] |
bfe60d97992693765ca5eae3d001774ce7517d1b | 1,724 | cpp | C++ | KickStart/2022/C/c.cpp | a4org/Angorithm4 | d2227d36608491bed270375bcea67fbde134209a | [
"MIT"
] | null | null | null | KickStart/2022/C/c.cpp | a4org/Angorithm4 | d2227d36608491bed270375bcea67fbde134209a | [
"MIT"
] | null | null | null | KickStart/2022/C/c.cpp | a4org/Angorithm4 | d2227d36608491bed270375bcea67fbde134209a | [
"MIT"
] | null | null | null | #include <iostream>
#include <unordered_map>
#include <vector>
using namespace::std;
int all = 0;
void move(unordered_map<int, pair<int, int>>& pd, unordered_map<int, int> pa, int ant, int L) {
pair<int, int> *antp = &pd[ant];
// Handle the first situation
if (antp->second == -1) return; // falls off
int cu... | 18.340426 | 95 | 0.482019 | [
"vector"
] |
bfe68e9f7ed4a1ee45f065780b0c0b3c2a97f5b3 | 1,143 | cpp | C++ | L2-027/main.cpp | Heliovic/GPLT | 7e8745e589a6b6594d4db24a2030f3b0e6efe38b | [
"MIT"
] | 1 | 2019-03-14T05:35:16.000Z | 2019-03-14T05:35:16.000Z | L2-027/main.cpp | Heliovic/GPLT | 7e8745e589a6b6594d4db24a2030f3b0e6efe38b | [
"MIT"
] | null | null | null | L2-027/main.cpp | Heliovic/GPLT | 7e8745e589a6b6594d4db24a2030f3b0e6efe38b | [
"MIT"
] | null | null | null | #include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#define MAX_N 10240
using namespace std;
struct stu
{
char account[64];
int score;
};
int N, G, K;
vector<stu> stus;
int rnk[MAX_N];
bool cmp(stu& s1, stu& s2)
{
if (s1.score != s2.score)
return s1.score > s2.score;
... | 16.565217 | 75 | 0.461942 | [
"vector"
] |
bfed12420b046e72448d5805dc39aec62eec209f | 6,223 | cc | C++ | src/table_store/table/table_store.cc | avwsolutions/pixie | 21f4726499d0c4ed0a5ed1be29977dc639ac98c6 | [
"Apache-2.0"
] | null | null | null | src/table_store/table/table_store.cc | avwsolutions/pixie | 21f4726499d0c4ed0a5ed1be29977dc639ac98c6 | [
"Apache-2.0"
] | null | null | null | src/table_store/table/table_store.cc | avwsolutions/pixie | 21f4726499d0c4ed0a5ed1be29977dc639ac98c6 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2018- The Pixie Authors.
*
* 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 ag... | 38.41358 | 99 | 0.713643 | [
"vector"
] |
bff47d431f87effd5d17355dca770456db761725 | 6,984 | cpp | C++ | Source/Entity/Components/StaticMeshComponent.cpp | MrFrenik/Enjon | 405733f1b8d05c65bc6b4f4c779d3c6845a8c12b | [
"BSD-3-Clause"
] | 121 | 2019-05-02T01:22:17.000Z | 2022-03-19T00:16:14.000Z | Source/Entity/Components/StaticMeshComponent.cpp | MrFrenik/Enjon | 405733f1b8d05c65bc6b4f4c779d3c6845a8c12b | [
"BSD-3-Clause"
] | 42 | 2019-08-17T20:33:43.000Z | 2019-09-25T14:28:50.000Z | Source/Entity/Components/StaticMeshComponent.cpp | MrFrenik/Enjon | 405733f1b8d05c65bc6b4f4c779d3c6845a8c12b | [
"BSD-3-Clause"
] | 20 | 2019-05-02T01:22:20.000Z | 2022-01-30T04:04:57.000Z | #include "Entity/Components/StaticMeshComponent.h"
#include "Entity/EntityManager.h"
#include "Graphics/GraphicsScene.h"
#include "Serialize/AssetArchiver.h"
#include "Asset/AssetManager.h"
#include "Graphics/GraphicsSubsystem.h"
#include "SubsystemCatalog.h"
#include "ImGui/ImGuiManager.h"
#include "Entity/EntityMana... | 26.555133 | 98 | 0.535796 | [
"mesh",
"transform"
] |
870e7ba21a41ed6a903164e47b29e3a922b1c885 | 5,987 | cc | C++ | src/ui/base/models/list_selection_model_unittest.cc | jxjnjjn/chromium | 435c1d02fd1b99001dc9e1e831632c894523580d | [
"Apache-2.0"
] | 9 | 2018-09-21T05:36:12.000Z | 2021-11-15T15:14:36.000Z | ui/base/models/list_selection_model_unittest.cc | devasia1000/chromium | 919a8a666862fb866a6bb7aa7f3ae8c0442b4828 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | ui/base/models/list_selection_model_unittest.cc | devasia1000/chromium | 919a8a666862fb866a6bb7aa7f3ae8c0442b4828 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 3 | 2018-11-28T14:54:13.000Z | 2020-07-02T07:36:07.000Z | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/base/models/list_selection_model.h"
#include <algorithm>
#include <string>
#include "base/string_number_conversions.h"
#include "testin... | 30.237374 | 80 | 0.747787 | [
"model"
] |
870fb58e3f09f795a26bd4a46abeee59a306b373 | 1,544 | hpp | C++ | src/log.hpp | C2python/TRAFT | 01974979f76f66330a3031f036fce6f4f5b4aa28 | [
"BSL-1.0"
] | null | null | null | src/log.hpp | C2python/TRAFT | 01974979f76f66330a3031f036fce6f4f5b4aa28 | [
"BSL-1.0"
] | null | null | null | src/log.hpp | C2python/TRAFT | 01974979f76f66330a3031f036fce6f4f5b4aa28 | [
"BSL-1.0"
] | null | null | null | #ifndef TRAFT_LOG_H
#define TRAFT_LOG_H
#include<vector>
#include<queue>
#include<mutex>
#include<thread>
#include<condition_variable>
#include<atomic>
#include<cassert>
#include<string>
#include<iostream>
#include "on_exit.hpp"
#include "util.hpp"
#include "entry.hpp"
namespace TRAFT{
class Log{
private:
... | 20.586667 | 85 | 0.685881 | [
"vector"
] |
8712c7522f36ea7d80d3dc9f4342cc20c8b152c1 | 9,308 | cpp | C++ | archive/olddraw/Draw/DrawOpX11.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | 2 | 2016-04-07T07:54:26.000Z | 2020-04-14T12:37:34.000Z | archive/olddraw/Draw/DrawOpX11.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | null | null | null | archive/olddraw/Draw/DrawOpX11.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | null | null | null | #include "Draw.h"
NAMESPACE_UPP
#ifdef PLATFORM_X11
#define LLOG(x) // LOG(x)
#define LTIMING(x) // TIMING(x)
void Draw::BeginOp()
{
Cloff f = cloff.Top();
Vector<Rect> newclip;
newclip <<= clip.Top();
f.clipi = clip.GetCount();
clip.Add() = newclip;
cloff.Add(f);
}
void Draw::OffsetOp(Point p)
{
Cloff... | 28.996885 | 102 | 0.643962 | [
"vector"
] |
8716023e5980309115025450702235f71bceaee1 | 3,395 | hpp | C++ | applications/unit_tests/helpers.hpp | Rythe-Interactive/Legion-LLRI | e0cc449cc8c2ba0701a73b8c07b80ccfd8f20477 | [
"MIT"
] | 16 | 2021-09-10T18:11:37.000Z | 2022-01-26T06:28:51.000Z | applications/unit_tests/helpers.hpp | Rythe-Interactive/Legion-LLRI | e0cc449cc8c2ba0701a73b8c07b80ccfd8f20477 | [
"MIT"
] | 13 | 2021-09-12T16:28:47.000Z | 2022-02-07T19:34:01.000Z | applications/unit_tests/helpers.hpp | Rythe-Interactive/Legion-LLRI | e0cc449cc8c2ba0701a73b8c07b80ccfd8f20477 | [
"MIT"
] | 1 | 2021-08-15T23:35:32.000Z | 2021-08-15T23:35:32.000Z | /**
* @file helpers.hpp
* @copyright 2021-2021 Leon Brands. All rights served.
* @license: https://github.com/Legion-Engine/Legion-LLRI/blob/main/LICENSE
*/
#pragma once
#include <doctest/doctest.h>
#include <llri/llri.hpp>
namespace helpers
{
inline llri::Instance* defaultInstance()
{
llri::Insta... | 37.307692 | 140 | 0.660972 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.