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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
09da727c16c4cd84060325b971f7415a4e9f8f4d | 4,359 | cpp | C++ | jsk_rviz_plugins/src/ambient_sound_visual.cpp | ShunjiroOsada/jsk_visualization_package | f5305ccb79b41a2efc994a535cb316e7467961de | [
"MIT"
] | 5 | 2016-07-18T02:20:30.000Z | 2022-01-23T13:12:20.000Z | jsk_rviz_plugins/src/ambient_sound_visual.cpp | ShunjiroOsada/jsk_visualization_package | f5305ccb79b41a2efc994a535cb316e7467961de | [
"MIT"
] | null | null | null | jsk_rviz_plugins/src/ambient_sound_visual.cpp | ShunjiroOsada/jsk_visualization_package | f5305ccb79b41a2efc994a535cb316e7467961de | [
"MIT"
] | 7 | 2015-11-01T13:40:30.000Z | 2020-02-21T12:59:18.000Z | #include <OGRE/OgreVector3.h>
#include <OGRE/OgreSceneNode.h>
#include <OGRE/OgreSceneManager.h>
#include <rviz/ogre_helpers/billboard_line.h>
#include <rviz/ogre_helpers/axes.h>
#include "ambient_sound_visual.h"
namespace jsk_rviz_plugins
{
// BEGIN_TUTORIAL
AmbientSoundVisual::AmbientSoundVisual( Ogre::Sc... | 34.054688 | 164 | 0.599679 | [
"render",
"object",
"vector",
"transform"
] |
09dd9d4344d8f77aa9f2e2bfecf5e513bdd3dfb7 | 3,358 | cpp | C++ | leetcode/cpp/qt_mini_parser.cpp | qiaotian/CodeInterview | 294c1ba86d8ace41a121c5ada4ba4c3765ccc17d | [
"WTFPL"
] | 5 | 2016-10-29T09:28:11.000Z | 2019-10-19T23:02:48.000Z | leetcode/cpp/qt_mini_parser.cpp | qiaotian/CodeInterview | 294c1ba86d8ace41a121c5ada4ba4c3765ccc17d | [
"WTFPL"
] | null | null | null | leetcode/cpp/qt_mini_parser.cpp | qiaotian/CodeInterview | 294c1ba86d8ace41a121c5ada4ba4c3765ccc17d | [
"WTFPL"
] | null | null | null | /*
Given a nested list of integers represented as a string, implement a parser to deserialize it.
Each element is either an integer, or a list -- whose elements may also be integers or other lists.
Note: You may assume that the string is well-formed:
String is non-empty.
String does not contain white spaces.
String ... | 27.983333 | 99 | 0.637582 | [
"object",
"vector"
] |
09eaba817440dd683d286274b68024bab8e951c9 | 5,495 | cpp | C++ | example-customclass/src/ofApp.cpp | nariakiiwatani/ofxNNG | 443827c4d4d6bd47c66682fdbd50ae9abf3ef7ee | [
"MIT"
] | 3 | 2019-05-20T10:06:37.000Z | 2021-08-08T02:30:23.000Z | example-customclass/src/ofApp.cpp | nariakiiwatani/ofxNNG | 443827c4d4d6bd47c66682fdbd50ae9abf3ef7ee | [
"MIT"
] | null | null | null | example-customclass/src/ofApp.cpp | nariakiiwatani/ofxNNG | 443827c4d4d6bd47c66682fdbd50ae9abf3ef7ee | [
"MIT"
] | null | null | null | #include "ofApp.h"
#include "ofxNNGPair.h"
#include "Serialize.h"
// you can use any types which you define
struct Memcopyable {
int index;
glm::vec3 pos;
// if you are sure it's safe to use memcpy to pack this type into message,
// you can notify that to ofxNNG by putting this macro in its scope.
// typically, t... | 29.074074 | 113 | 0.602366 | [
"mesh"
] |
09f3b9a07d3715b719729d9980dcfaa711ccfcca | 109,494 | cpp | C++ | cisco-ios-xe/ydk/models/cisco_ios_xe/CISCO_IF_EXTENSION_MIB.cpp | CiscoDevNet/ydk-cpp | ef7d75970f2ef1154100e0f7b0a2ee823609b481 | [
"ECL-2.0",
"Apache-2.0"
] | 17 | 2016-12-02T05:45:49.000Z | 2022-02-10T19:32:54.000Z | cisco-ios-xe/ydk/models/cisco_ios_xe/CISCO_IF_EXTENSION_MIB.cpp | CiscoDevNet/ydk-cpp | ef7d75970f2ef1154100e0f7b0a2ee823609b481 | [
"ECL-2.0",
"Apache-2.0"
] | 2 | 2017-03-27T15:22:38.000Z | 2019-11-05T08:30:16.000Z | cisco-ios-xe/ydk/models/cisco_ios_xe/CISCO_IF_EXTENSION_MIB.cpp | CiscoDevNet/ydk-cpp | ef7d75970f2ef1154100e0f7b0a2ee823609b481 | [
"ECL-2.0",
"Apache-2.0"
] | 11 | 2016-12-02T05:45:52.000Z | 2019-11-07T08:28:17.000Z |
#include <sstream>
#include <iostream>
#include <ydk/entity_util.hpp>
#include "bundle_info.hpp"
#include "generated_entity_lookup.hpp"
#include "CISCO_IF_EXTENSION_MIB.hpp"
using namespace ydk;
namespace cisco_ios_xe {
namespace CISCO_IF_EXTENSION_MIB {
CISCOIFEXTENSIONMIB::CISCOIFEXTENSIONMIB()
:
ciscoife... | 37.293597 | 689 | 0.741694 | [
"vector"
] |
09fea2ccc2c50cc7eaf42280fdebaac234ebcb44 | 1,011 | cxx | C++ | languages/python/opa/pythonmodules.cxx | ouroboros-project/ouroboros | 0edce6600f570a901a818161f77db9792f120e11 | [
"Zlib"
] | 1 | 2020-12-24T14:37:31.000Z | 2020-12-24T14:37:31.000Z | languages/python/opa/pythonmodules.cxx | ouroboros-project/ouroboros | 0edce6600f570a901a818161f77db9792f120e11 | [
"Zlib"
] | null | null | null | languages/python/opa/pythonmodules.cxx | ouroboros-project/ouroboros | 0edce6600f570a901a818161f77db9792f120e11 | [
"Zlib"
] | null | null | null | #include <python/opa/modules.h>
#include <vector>
#include <cstdio>
#include <opa/module.h>
#include <python/opa/pythonmachine.h>
namespace opa {
namespace python {
typedef std::vector< Module<inittype> > PythonModuleList;
static PythonModuleList& get_module_list() {
static PythonModuleList lua_modules;
re... | 26.605263 | 116 | 0.661721 | [
"vector"
] |
6700c659199e16bc1ae11ed08fad03945afbbbac | 645 | cpp | C++ | entity.cpp | rapucadyil/Rogue-Engine | 08e8312641da796074e67015248dce117e52dae0 | [
"BSD-3-Clause"
] | null | null | null | entity.cpp | rapucadyil/Rogue-Engine | 08e8312641da796074e67015248dce117e52dae0 | [
"BSD-3-Clause"
] | null | null | null | entity.cpp | rapucadyil/Rogue-Engine | 08e8312641da796074e67015248dce117e52dae0 | [
"BSD-3-Clause"
] | null | null | null | #include "entity.h"
/* ENTITY CLASS */
Entity::Entity() {
this->entity_id = 0;
this->entity_name = "entity";
this->active = true;
}
Entity::Entity(u32 id, const str name, bool active) {
this->entity_id = id;
this->entity_name = name;
this->active = active;
}
Entity::~Entity() {
delete[] this->entity_name; /... | 16.538462 | 53 | 0.613953 | [
"render"
] |
670487b0556907422966eec9d99e7763a56ce0ee | 7,034 | cpp | C++ | src/coherence/net/cache/BundlingNamedCache.cpp | 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 | src/coherence/net/cache/BundlingNamedCache.cpp | 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 | src/coherence/net/cache/BundlingNamedCache.cpp | 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.
*/
#include "coherence/net/cache/BundlingNamedCache.hpp"
COH_OPEN_NAMESPACE3(coherence,net,cache)
BundlingNamedCache::BundlingNamedCache(NamedCa... | 27.053846 | 96 | 0.623969 | [
"object"
] |
670585da94d4f0225231ed08799f78e46399d244 | 396 | hh | C++ | src/parser/grammar/grammar.hh | Turanic/WESH | 0ff939415861b86ada705bcffd0e2eef6c841104 | [
"Unlicense"
] | 3 | 2015-08-07T18:29:10.000Z | 2016-07-28T16:41:30.000Z | src/parser/grammar/grammar.hh | Turanic/wesh | 0ff939415861b86ada705bcffd0e2eef6c841104 | [
"Unlicense"
] | 2 | 2015-09-27T09:30:11.000Z | 2015-10-14T20:41:55.000Z | src/parser/grammar/grammar.hh | Turanic/WESH | 0ff939415861b86ada705bcffd0e2eef6c841104 | [
"Unlicense"
] | 1 | 2017-10-18T19:41:45.000Z | 2017-10-18T19:41:45.000Z | #pragma once
#include <vector>
#include <ast/ast.hh>
#include <boost/spirit/home/x3.hpp>
namespace parser
{
namespace grammar
{
using boost::spirit::x3::rule;
struct wesh_rule_class;
using wesh_rule_type = rule<wesh_rule_class, ast::ast_root>;
using wesh_rule_id = wesh_rule_type::id;
BOOST_SPIRIT_DECLARE(wesh_rule_t... | 17.217391 | 60 | 0.762626 | [
"vector"
] |
6707518cd804de4c28c908b4153f5822c35b3933 | 12,450 | hpp | C++ | include/pcp/algorithm/estimate_normals.hpp | Q-Minh/octree | 0c3fd5a791d660b37461daf968a68ffb1c80b965 | [
"BSL-1.0"
] | 2 | 2021-03-10T09:57:45.000Z | 2021-04-13T21:19:57.000Z | include/pcp/algorithm/estimate_normals.hpp | Q-Minh/octree | 0c3fd5a791d660b37461daf968a68ffb1c80b965 | [
"BSL-1.0"
] | 22 | 2020-12-07T20:09:39.000Z | 2021-04-12T20:42:59.000Z | include/pcp/algorithm/estimate_normals.hpp | Q-Minh/octree | 0c3fd5a791d660b37461daf968a68ffb1c80b965 | [
"BSL-1.0"
] | null | null | null | #ifndef PCP_ALGORITHM_ESTIMATE_NORMALS_HPP
#define PCP_ALGORITHM_ESTIMATE_NORMALS_HPP
/**
* @file
* @ingroup algorithm
*/
#include "pcp/common/norm.hpp"
#include "pcp/common/normals/normal.hpp"
#include "pcp/common/normals/normal_estimation.hpp"
#include "pcp/common/points/point.hpp"
#include "pcp/common/vector3d_... | 40.553746 | 100 | 0.682008 | [
"object",
"transform"
] |
67082bfb26ae830190d2e42400175b95a7fbbdbf | 1,771 | cpp | C++ | sample/intrinsic/03_load_add/load_add.cpp | termoshtt/xbyak_aarch64_handson | bf8c318a4025077d52af91df7a61c5c12ca449fe | [
"MIT"
] | 15 | 2021-11-18T07:17:24.000Z | 2022-01-10T09:57:07.000Z | sample/intrinsic/03_load_add/load_add.cpp | termoshtt/xbyak_aarch64_handson | bf8c318a4025077d52af91df7a61c5c12ca449fe | [
"MIT"
] | 2 | 2021-11-27T07:15:55.000Z | 2021-11-28T01:58:29.000Z | sample/intrinsic/03_load_add/load_add.cpp | termoshtt/xbyak_aarch64_handson | bf8c318a4025077d52af91df7a61c5c12ca449fe | [
"MIT"
] | 2 | 2021-11-27T04:33:56.000Z | 2021-11-27T13:22:49.000Z | #include <arm_sve.h>
#include <cstdio>
#include <iostream>
#include <vector>
void svshow(svfloat64_t va) {
int n = svcntd();
std::vector<double> a(n);
svbool_t tp = svptrue_b64();
svst1_f64(tp, a.data(), va);
for (int i = 0; i < n; i++) {
printf("%+.7f ", a[n - i - 1]);
}
printf("\n");
}
void load_p... | 24.597222 | 65 | 0.59345 | [
"vector"
] |
670c8d19cbfee3315f15b38f66023c9f79356c43 | 814 | hpp | C++ | src/projects/repeat_resolution/mdbg_vertex_processor.hpp | fedarko/LJA | f20c85395d741b0f94f6d0172c7451d72d7c8713 | [
"BSD-3-Clause"
] | null | null | null | src/projects/repeat_resolution/mdbg_vertex_processor.hpp | fedarko/LJA | f20c85395d741b0f94f6d0172c7451d72d7c8713 | [
"BSD-3-Clause"
] | null | null | null | src/projects/repeat_resolution/mdbg_vertex_processor.hpp | fedarko/LJA | f20c85395d741b0f94f6d0172c7451d72d7c8713 | [
"BSD-3-Clause"
] | null | null | null | //
// Created by Andrey Bzikadze on 11/25/21.
//
#pragma once
#include "mdbg.hpp"
namespace repeat_resolution {
class MDBGSimpleVertexProcessor {
void Process0In1Pout(MultiplexDBG &graph, const RRVertexType &vertex);
void Process1Pin0Out(MultiplexDBG &graph, const RRVertexType &vertex);
public:
void ... | 24.666667 | 74 | 0.700246 | [
"vector"
] |
e252947acbbfaab535cf068743353adc78a18257 | 1,901 | cpp | C++ | C++/13_Two_pointers/MEDIUM_3SUM.cpp | animeshramesh/interview-prep | 882e8bc8b4653a713754ab31a3b08e05505be2bc | [
"Apache-2.0"
] | null | null | null | C++/13_Two_pointers/MEDIUM_3SUM.cpp | animeshramesh/interview-prep | 882e8bc8b4653a713754ab31a3b08e05505be2bc | [
"Apache-2.0"
] | null | null | null | C++/13_Two_pointers/MEDIUM_3SUM.cpp | animeshramesh/interview-prep | 882e8bc8b4653a713754ab31a3b08e05505be2bc | [
"Apache-2.0"
] | null | null | null | /* Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0?
Find all unique triplets in the array which gives the sum of zero.
Note: The solution set must not contain duplicate triplets.
For example, given array S = [-1, 0, 1, 2, -1, -4],
A solution set is:
[
[-1, 0, 1],
[-1, -1,... | 27.955882 | 92 | 0.500263 | [
"vector"
] |
e252f85523742ccf0b6d579885155402572c6b84 | 2,832 | cpp | C++ | src/systemif.cpp | hugoboss00/HeaterMeter | 0aee2e7189753da69e73319b8684af0132f18ed5 | [
"MIT"
] | 2 | 2018-07-19T12:14:57.000Z | 2018-07-19T12:14:59.000Z | src/systemif.cpp | hugoboss00/HeaterMeter | 0aee2e7189753da69e73319b8684af0132f18ed5 | [
"MIT"
] | null | null | null | src/systemif.cpp | hugoboss00/HeaterMeter | 0aee2e7189753da69e73319b8684af0132f18ed5 | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <fcntl.h>
#include <sys/shm.h>
#include <sys/stat.h>
#include <inttypes.h>
#include <math.h>
#include <time.h>
#include "systemif.h"
#include <unistd.h>
#include <sys/mman.h>
const char *hm_version = VERSION;
#ifdef PIN_SIMULATION
typedef struct {
... | 17.268293 | 77 | 0.623234 | [
"object"
] |
e2556cb374f8d82e29bf6b2d7b2a065ccaf5a31c | 1,620 | cpp | C++ | Engine/Source/Manager/ColorManager.cpp | ReDEnergy/OpenGL4.5-GameEngine | 79468b7807677372bbc0450ea49b48ad66bbbd41 | [
"MIT"
] | 11 | 2016-02-18T03:22:33.000Z | 2021-01-21T13:05:30.000Z | Engine/Source/Manager/ColorManager.cpp | ReDEnergy/OpenGL4.5-GameEngine | 79468b7807677372bbc0450ea49b48ad66bbbd41 | [
"MIT"
] | 3 | 2015-04-26T09:52:12.000Z | 2015-05-13T13:06:58.000Z | Engine/Source/Manager/ColorManager.cpp | ReDEnergy/GameEngine | 79468b7807677372bbc0450ea49b48ad66bbbd41 | [
"MIT"
] | 11 | 2015-03-14T13:35:22.000Z | 2015-09-16T16:26:08.000Z | #include "ColorManager.h"
#include <Core/GameObject.h>
typedef unsigned int uint;
ColorManager::ColorManager()
{
colorID = glm::ivec3(255, 255, 255);
offset = glm::ivec3(1, 1, 1);
auto size = colorID / offset;
colorMap.resize(size.x + size.y * 16 + size.z * 256);
}
ColorManager::~ColorManager()
{
}
unsigned in... | 21.315789 | 96 | 0.658025 | [
"object"
] |
e25bde243c4f6d9a2f8f2b6b1c480bcaf7de3d69 | 52,530 | cpp | C++ | da/src/da/da_icp_laser.cpp | anpl-technion/anpl_mrbsp | 973734fd2d1c7bb5e1405922300add489f088e81 | [
"MIT"
] | 1 | 2021-12-03T03:11:20.000Z | 2021-12-03T03:11:20.000Z | da/src/da/da_icp_laser.cpp | anpl-technion/anpl_mrbsp | 973734fd2d1c7bb5e1405922300add489f088e81 | [
"MIT"
] | null | null | null | da/src/da/da_icp_laser.cpp | anpl-technion/anpl_mrbsp | 973734fd2d1c7bb5e1405922300add489f088e81 | [
"MIT"
] | 1 | 2021-12-03T03:11:23.000Z | 2021-12-03T03:11:23.000Z | /* ---------------------------------------------------------------------------
*
* Autonomous Navigation and Perception Lab (ANPL),
* Technion, Israel Institute of Technology,
* Faculty of Aerospace Engineering,
* Haifa, Israel, 32000
* All Rights Reserved
*
* See LICENSE for the license information
*
* -----... | 43.413223 | 210 | 0.663031 | [
"vector",
"model",
"3d"
] |
e25ebbcbba4766d2ae5ae20cbd5789bc5858d560 | 3,847 | cpp | C++ | cvlib/src/select_texture.cpp | SeregaVM/cvclasses19 | 0a901171a40b4c6c91332664383f9e4f6ae7e154 | [
"MIT"
] | null | null | null | cvlib/src/select_texture.cpp | SeregaVM/cvclasses19 | 0a901171a40b4c6c91332664383f9e4f6ae7e154 | [
"MIT"
] | null | null | null | cvlib/src/select_texture.cpp | SeregaVM/cvclasses19 | 0a901171a40b4c6c91332664383f9e4f6ae7e154 | [
"MIT"
] | null | null | null | /* Split and merge segmentation algorithm implementation.
* @file
* @date 2018-09-18
* @author Anonymous
*/
#include "cvlib.hpp"
namespace
{
std::vector<cv::Mat> filter_kernels;
std::vector<cv::Mat> feture_maps;
struct Descriptor : public std::vector<double>
{
using std::vector<double>::vector;
... | 26.349315 | 118 | 0.59033 | [
"vector"
] |
e261e0a4fbe0399e23633adf3a7bb1020c7fef98 | 589 | cpp | C++ | lib/grid/domain_index.cpp | mdavezac/bempp | bc573062405bda107d1514e40b6153a8350d5ab5 | [
"BSL-1.0"
] | null | null | null | lib/grid/domain_index.cpp | mdavezac/bempp | bc573062405bda107d1514e40b6153a8350d5ab5 | [
"BSL-1.0"
] | null | null | null | lib/grid/domain_index.cpp | mdavezac/bempp | bc573062405bda107d1514e40b6153a8350d5ab5 | [
"BSL-1.0"
] | null | null | null | #include "domain_index.hpp"
#include "entity_pointer.hpp"
#include "entity.hpp"
#include "../common/acc.hpp"
namespace Bempp {
int DomainIndex::domain(const Entity<0> &entity) const {
std::unique_ptr<EntityPointer<0>> father;
const Entity<0> *level0Entity = &entity;
while (level0Entity->hasFather()) {
fat... | 24.541667 | 79 | 0.716469 | [
"vector"
] |
e26a0649f1d53df6478429e88a4802eded7dd701 | 18,348 | cpp | C++ | src/main.cpp | Hubertzjz/CarND-Path-Planning-Project-master | 8289fbbd8f10ff05549493abfe306970079bc592 | [
"MIT"
] | null | null | null | src/main.cpp | Hubertzjz/CarND-Path-Planning-Project-master | 8289fbbd8f10ff05549493abfe306970079bc592 | [
"MIT"
] | null | null | null | src/main.cpp | Hubertzjz/CarND-Path-Planning-Project-master | 8289fbbd8f10ff05549493abfe306970079bc592 | [
"MIT"
] | null | null | null | #include <uWS/uWS.h>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include "Eigen-3.3/Eigen/Core"
#include "Eigen-3.3/Eigen/QR"
#include "helpers.h"
#include "spline.h"
#include "json.hpp"
// for convenience
using nlohmann::json;
using std::string;
using std::vector;
int get_lane(float d... | 34.040816 | 174 | 0.530794 | [
"object",
"vector",
"transform"
] |
e276e62011aebbd6214821cccd7338c69661b97b | 12,521 | cc | C++ | external/netdef_models/lmbspecialops/src/flowwarp.cc | zhuhu00/MOTSFusion_modify | 190224a7c3fbded69fedf9645a0ebbf08227fb6d | [
"MIT"
] | null | null | null | external/netdef_models/lmbspecialops/src/flowwarp.cc | zhuhu00/MOTSFusion_modify | 190224a7c3fbded69fedf9645a0ebbf08227fb6d | [
"MIT"
] | null | null | null | external/netdef_models/lmbspecialops/src/flowwarp.cc | zhuhu00/MOTSFusion_modify | 190224a7c3fbded69fedf9645a0ebbf08227fb6d | [
"MIT"
] | null | null | null | //
// lmbspecialops - a collection of tensorflow ops
// Copyright (C) 2017 Oezguen Cicek, Eddy Ilg
//
// 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 3 of the License, ... | 37.376119 | 138 | 0.516173 | [
"shape"
] |
e27740a8aac9a079c34671c8e4b3df7cb90cff9c | 3,388 | cpp | C++ | src/LogicalProcessorObjectInstanceSubscribed.cpp | hnrck/seaplanes | 1455dd8854b4a0555c04268c10c8c5c02458ddd0 | [
"MIT"
] | null | null | null | src/LogicalProcessorObjectInstanceSubscribed.cpp | hnrck/seaplanes | 1455dd8854b4a0555c04268c10c8c5c02458ddd0 | [
"MIT"
] | null | null | null | src/LogicalProcessorObjectInstanceSubscribed.cpp | hnrck/seaplanes | 1455dd8854b4a0555c04268c10c8c5c02458ddd0 | [
"MIT"
] | null | null | null | //! \file SeaplanesObjectInstanceSubscribed.cc
//! \author Henrick Deschamps (henrick.deschamps [at] isae-supaero [dot] fr)
//! \version 1.0.0
//! \date July, 2016
//! \brief Rosace Subscribed object instance manipulation implementation.
#include <LogicalProcessorObjectInstanceSubscribed.h>
using std... | 34.571429 | 81 | 0.7134 | [
"object"
] |
e284a938c2c3d301833e4c323076e34ca090aff1 | 719 | cpp | C++ | Algorithmic Toolbox/week2_algorithmic_warmup/8_last_digit_of_the_sum_of_squares_of_fibonacci_numbers/fibonacci_sum_squares.cpp | linroid/my_practice | 74490cf296d6373fe04304c9d7d4827e0aea8741 | [
"MIT"
] | 3 | 2016-11-29T06:13:05.000Z | 2021-03-12T17:56:21.000Z | Algorithmic Toolbox/week2_algorithmic_warmup/8_last_digit_of_the_sum_of_squares_of_fibonacci_numbers/fibonacci_sum_squares.cpp | linroid/my_practice | 74490cf296d6373fe04304c9d7d4827e0aea8741 | [
"MIT"
] | null | null | null | Algorithmic Toolbox/week2_algorithmic_warmup/8_last_digit_of_the_sum_of_squares_of_fibonacci_numbers/fibonacci_sum_squares.cpp | linroid/my_practice | 74490cf296d6373fe04304c9d7d4827e0aea8741 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
const int kPeriodLength = 60;
int fibonacci_sum_squares(long long n) {
if (n <= 1) {
return n;
}
long long sum = 0;
long long previous = 0;
long long current = 1;
std::vector<int> last_digits(kPeriodLength);
last_digits[0] = 0;
last_digits[1] = 1;
for (int... | 21.787879 | 86 | 0.613352 | [
"vector"
] |
e288377800d1d470e5eff0577718915f7095d3c8 | 3,023 | cc | C++ | RAVL2/Math/Optimisation/FitHomog2dPoints.cc | isuhao/ravl2 | 317e0ae1cb51e320b877c3bad6a362447b5e52ec | [
"BSD-Source-Code"
] | null | null | null | RAVL2/Math/Optimisation/FitHomog2dPoints.cc | isuhao/ravl2 | 317e0ae1cb51e320b877c3bad6a362447b5e52ec | [
"BSD-Source-Code"
] | null | null | null | RAVL2/Math/Optimisation/FitHomog2dPoints.cc | isuhao/ravl2 | 317e0ae1cb51e320b877c3bad6a362447b5e52ec | [
"BSD-Source-Code"
] | null | null | null | // This file is part of RAVL, Recognition And Vision Library
// Copyright (C) 2002, University of Surrey
// This code may be redistributed under the terms of the GNU Lesser
// General Public License (LGPL). See the lgpl.licence file for details or
// see http://www.gnu.org/copyleft/lesser.html
// file-header-ends-here... | 32.159574 | 116 | 0.652994 | [
"vector"
] |
e28af36e00178c85a82a1f662a09a30357183e28 | 474 | cpp | C++ | Leetcode Problems/645.SetMismatch.cpp | rishusingh022/My-Journey-of-Data-Structures-and-Algorithms | 28a70fdf10366fc97ddb9f6a69852b3478b564e6 | [
"MIT"
] | 1 | 2021-01-13T07:20:57.000Z | 2021-01-13T07:20:57.000Z | Leetcode Problems/645.SetMismatch.cpp | rishusingh022/My-Journey-of-Data-Structures-and-Algorithms | 28a70fdf10366fc97ddb9f6a69852b3478b564e6 | [
"MIT"
] | 1 | 2021-10-01T18:26:34.000Z | 2021-10-01T18:26:34.000Z | Leetcode Problems/645.SetMismatch.cpp | rishusingh022/My-Journey-of-Data-Structures-and-Algorithms | 28a70fdf10366fc97ddb9f6a69852b3478b564e6 | [
"MIT"
] | 7 | 2021-10-01T16:07:29.000Z | 2021-10-04T13:23:48.000Z |
class Solution {
public:
vector<int> findErrorNums(vector<int>& nums) {
vector<bool>seen(nums.size() + 1);
int twice;
for (auto& val : nums) {
if (seen[val])
twice = val;
else
seen[val] = true;
}
for (int i = 1; i < see... | 22.571429 | 50 | 0.405063 | [
"vector"
] |
e291b14ca95fb6a88378ddb0ca6ad9286d43b026 | 10,744 | hpp | C++ | inc/tinyLMP.hpp | TankleL/tinyLMP | d6f2a28509480531a4d7b205f369a10af678d13d | [
"MIT"
] | null | null | null | inc/tinyLMP.hpp | TankleL/tinyLMP | d6f2a28509480531a4d7b205f369a10af678d13d | [
"MIT"
] | null | null | null | inc/tinyLMP.hpp | TankleL/tinyLMP | d6f2a28509480531a4d7b205f369a10af678d13d | [
"MIT"
] | null | null | null | /* ----------------------------------------------------------------------------
MIT License
Copyright (c) 2018 廖添(Tankle L.)
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, i... | 24.87037 | 118 | 0.441176 | [
"vector"
] |
e29f17c2622b002b4bd46e55a0d12b769341d16d | 1,827 | hpp | C++ | include/codegen/include/System/Runtime/Serialization/Formatters/Binary/BinaryCrossAppDomainAssembly.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 1 | 2021-11-12T09:29:31.000Z | 2021-11-12T09:29:31.000Z | include/codegen/include/System/Runtime/Serialization/Formatters/Binary/BinaryCrossAppDomainAssembly.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | null | null | null | include/codegen/include/System/Runtime/Serialization/Formatters/Binary/BinaryCrossAppDomainAssembly.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"
// Completed includes
// Begin forward declares
// Forward declaring names... | 42.488372 | 188 | 0.730159 | [
"object"
] |
e2a877b3d4ee2b3ea03b7cf3d81a3cc908f6769d | 8,724 | cpp | C++ | src/ScrollButtons.cpp | Futuremappermydud/Menu-Utils | ccc5ee6bafd155bda7c6e32774c39a7663034e73 | [
"MIT"
] | null | null | null | src/ScrollButtons.cpp | Futuremappermydud/Menu-Utils | ccc5ee6bafd155bda7c6e32774c39a7663034e73 | [
"MIT"
] | null | null | null | src/ScrollButtons.cpp | Futuremappermydud/Menu-Utils | ccc5ee6bafd155bda7c6e32774c39a7663034e73 | [
"MIT"
] | null | null | null | #include "ScrollButtons.hpp"
#include "BeatSaberUI.hpp"
Button* _pageUpFastButton;
Button* _pageDownFastButton;
Button* _scrollBottomButton;
Button* _scrollTopButton;
Button* originalUp;
Button* originalDown;
TableView* tableview;
LevelCollectionTableView* CollectionTableView;
const float SEGMENT_PERCENT = 0.1f;
const... | 39.121076 | 212 | 0.742779 | [
"object"
] |
e2ac26a7318842d84a56231865790f46edd14df6 | 7,945 | cpp | C++ | EtherlinkerExampleProject/Plugins/Etherlinker/Source/Etherlinker/Private/EtherlinkerRemoteWalletManager.cpp | DeVerse-World/integration-server | b0a5d3db8a801727d972c294b8660346d3fc4753 | [
"MIT"
] | null | null | null | EtherlinkerExampleProject/Plugins/Etherlinker/Source/Etherlinker/Private/EtherlinkerRemoteWalletManager.cpp | DeVerse-World/integration-server | b0a5d3db8a801727d972c294b8660346d3fc4753 | [
"MIT"
] | null | null | null | EtherlinkerExampleProject/Plugins/Etherlinker/Source/Etherlinker/Private/EtherlinkerRemoteWalletManager.cpp | DeVerse-World/integration-server | b0a5d3db8a801727d972c294b8660346d3fc4753 | [
"MIT"
] | null | null | null | // Copyright 2019 Ruslan Nazirov. All Rights Reserved.
#include "EtherlinkerRemoteWalletManager.h"
#include "EtherlinkerSettings.h"
UEtherlinkerRemoteWalletManager::UEtherlinkerRemoteWalletManager()
{
PrimaryComponentTick.bCanEverTick = false;
}
void UEtherlinkerRemoteWalletManager::GetWalletData(FWalletAuthentica... | 34.543478 | 162 | 0.778351 | [
"object"
] |
e2b2c490aa8e205ffb3b1bfd242c8cbfcb9ee767 | 1,141 | cpp | C++ | leetcode/115. distinct-subsequences.cpp | cycheng/coding-for-fun | 3596ee6e029a9c16bc56d2cadfbe914ce0a03102 | [
"MIT"
] | null | null | null | leetcode/115. distinct-subsequences.cpp | cycheng/coding-for-fun | 3596ee6e029a9c16bc56d2cadfbe914ce0a03102 | [
"MIT"
] | null | null | null | leetcode/115. distinct-subsequences.cpp | cycheng/coding-for-fun | 3596ee6e029a9c16bc56d2cadfbe914ce0a03102 | [
"MIT"
] | null | null | null | // [1] https://leetcode.com/problems/distinct-subsequences/
// [2] https://ithelp.ithome.com.tw/articles/10218596
// #dp, #string
#include "std.h"
// r a b b b i t
// 1 1 1 1 1 1 1 1
// r 0 1 1 1 1 1 1 1
// a 0 0 1 1 1 1 1 1
// b 0 0 0 1 2 3 3 3
// b 0 0 0 0 1 3 3 3
// i 0 0 0 0 0 0 3 3
// t 0 0 0 0 0 0 0 3
// ... | 21.12963 | 59 | 0.432954 | [
"vector"
] |
e2b47c375dc89eb01b023c28b7c1566d99da3c87 | 2,568 | cpp | C++ | src/ias/technology/factory/value_type_database_factory.cpp | JoeriHermans/Intelligent-Automation-System | b09c9f2b0c018ac5d12ab01d25297a0a92724e4c | [
"Apache-2.0"
] | 1 | 2021-08-12T10:07:27.000Z | 2021-08-12T10:07:27.000Z | src/ias/technology/factory/value_type_database_factory.cpp | JoeriHermans/Intelligent-Automation-System | b09c9f2b0c018ac5d12ab01d25297a0a92724e4c | [
"Apache-2.0"
] | null | null | null | src/ias/technology/factory/value_type_database_factory.cpp | JoeriHermans/Intelligent-Automation-System | b09c9f2b0c018ac5d12ab01d25297a0a92724e4c | [
"Apache-2.0"
] | 2 | 2016-12-06T23:16:18.000Z | 2016-12-07T07:26:56.000Z | /**
* A value type factory which fetches value type instances from
* a database.
*
* @date Jul 4, 2014
* @author Joeri HERMANS
* @version 0.1
*
* Copyright 2013 Joeri HERMANS
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may... | 30.571429 | 78 | 0.582944 | [
"vector"
] |
e2c0ee0ee0ac1bed0129fad3a49668006b1fd35d | 4,838 | cc | C++ | A/6/PerfectHashing.cc | Menci/DataStructureAndAlgorithms | e5d773bd927e83f72dc0c1579e48469200f31620 | [
"Unlicense"
] | null | null | null | A/6/PerfectHashing.cc | Menci/DataStructureAndAlgorithms | e5d773bd927e83f72dc0c1579e48469200f31620 | [
"Unlicense"
] | null | null | null | A/6/PerfectHashing.cc | Menci/DataStructureAndAlgorithms | e5d773bd927e83f72dc0c1579e48469200f31620 | [
"Unlicense"
] | 1 | 2019-11-29T03:59:46.000Z | 2019-11-29T03:59:46.000Z | #include <iostream>
#include <random>
#include <algorithm>
#include <tuple>
#include <vector>
#include <cassert>
#include <optional>
#include <memory>
#include <chrono>
template <typename T>
class PerfectHashing {
std::vector<std::tuple<size_t, size_t, std::vector<std::optional<T>>>> data;
size_t n, m, p, a, b... | 27.645714 | 108 | 0.509921 | [
"vector"
] |
e2c10b1b78268e52bec414ec26bd5ab28e73e1d9 | 937 | cpp | C++ | Dataset/Leetcode/train/56/246.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/56/246.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/56/246.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | class Solution {
public:
bool static cmp(vector<int>&a,vector<int>&b){//排序方式，第一个元素越小排越前面，第二个元素越大排越前面
if(a[0]!=b[0])
return a[0]<b[0];
else
return a[1]>b[1];
}
vector<vector<int>> XXX(vector<vector<int>>& intervals) {
sort(intervals.begin(),intervals.end(),cmp... | 30.225806 | 82 | 0.504803 | [
"vector"
] |
e2ceb997c464e8d0986e98d9329c15baa204f515 | 6,659 | cpp | C++ | src/plugins/visualisenormals/visualisenormals.cpp | circlingthesun/cloudclean | 4b9496bc3b52143c35f0ad83ee68bbc5e8aa32d5 | [
"MIT"
] | 2 | 2018-10-18T16:10:21.000Z | 2020-05-28T01:52:24.000Z | src/plugins/visualisenormals/visualisenormals.cpp | circlingthesun/cloudclean | 4b9496bc3b52143c35f0ad83ee68bbc5e8aa32d5 | [
"MIT"
] | null | null | null | src/plugins/visualisenormals/visualisenormals.cpp | circlingthesun/cloudclean | 4b9496bc3b52143c35f0ad83ee68bbc5e8aa32d5 | [
"MIT"
] | 4 | 2017-12-13T07:39:18.000Z | 2021-05-29T13:13:48.000Z | #include "plugins/visualisenormals/visualisenormals.h"
#include <QDebug>
#include <QAction>
#include <QMessageBox>
#include <QGLShaderProgram>
#include <QGLBuffer>
#include <QApplication>
#include <QResource>
#include "model/cloudlist.h"
#include "gui/glwidget.h"
#include "gui/flatview.h"
#include "gui/mainwindow.h"
#i... | 31.116822 | 97 | 0.612554 | [
"geometry",
"model"
] |
e2e07d680cde190d5cca96c4c65d37f77cf57a1e | 5,031 | cpp | C++ | kratos/mpi/utilities/data_communicator_factory.cpp | lkusch/Kratos | e8072d8e24ab6f312765185b19d439f01ab7b27b | [
"BSD-4-Clause"
] | 778 | 2017-01-27T16:29:17.000Z | 2022-03-30T03:01:51.000Z | kratos/mpi/utilities/data_communicator_factory.cpp | lkusch/Kratos | e8072d8e24ab6f312765185b19d439f01ab7b27b | [
"BSD-4-Clause"
] | 6,634 | 2017-01-15T22:56:13.000Z | 2022-03-31T15:03:36.000Z | kratos/mpi/utilities/data_communicator_factory.cpp | lkusch/Kratos | e8072d8e24ab6f312765185b19d439f01ab7b27b | [
"BSD-4-Clause"
] | 224 | 2017-02-07T14:12:49.000Z | 2022-03-06T23:09:34.000Z | // | / |
// ' / __| _` | __| _ \ __|
// . \ | ( | | ( |\__ `
// _|\_\_| \__,_|\__|\___/ ____/
// Multi-Physics
//
// License: BSD License
// Kratos default license: kratos/license.txt
//
// Main author: Jordi Cotela
//
#include "dat... | 38.40458 | 117 | 0.758497 | [
"vector"
] |
e2e339d1ec223accfed14e1592cfed5d5d347773 | 5,478 | cpp | C++ | TAO/tests/Bug_3276_Regression/Manager.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 36 | 2015-01-10T07:27:33.000Z | 2022-03-07T03:32:08.000Z | TAO/tests/Bug_3276_Regression/Manager.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 2 | 2018-08-13T07:30:51.000Z | 2019-02-25T03:04:31.000Z | TAO/tests/Bug_3276_Regression/Manager.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 38 | 2015-01-08T14:12:06.000Z | 2022-01-19T08:33:00.000Z | //$Id: Manager.cpp 91825 2010-09-17 09:10:22Z johnnyw $
#include "ace/SString.h"
#include "Manager.h"
#include "test_i.h"
#include "ace/Get_Opt.h"
#include "ace/OS_NS_stdio.h"
const ACE_TCHAR *control_ior = 0;
const ACE_TCHAR *proxy_ior = 0;
int
parse_args (int argc, ACE_TCHAR *argv[])
{
ACE_Get_Opt get_opts (arg... | 24.346667 | 89 | 0.592369 | [
"object"
] |
e2e51ad22a5293b4f2d6a63d13e8f8709ee94655 | 40,066 | cc | C++ | simlib/src/calendar.cc | MichalCab/IMS | d45dd8e7c0f794b4ee7f2ce1ccbc45edeaaa106e | [
"MIT"
] | null | null | null | simlib/src/calendar.cc | MichalCab/IMS | d45dd8e7c0f794b4ee7f2ce1ccbc45edeaaa106e | [
"MIT"
] | null | null | null | simlib/src/calendar.cc | MichalCab/IMS | d45dd8e7c0f794b4ee7f2ce1ccbc45edeaaa106e | [
"MIT"
] | null | null | null | /////////////////////////////////////////////////////////////////////////////
//! \file calendar.cc Calendar queue implementation
//
// Copyright (c) 1991-2008 Petr Peringer
//
// This library is licensed under GNU Library GPL. See the file COPYING.
//
// implementation of class CalendarList
// <br> interface is stat... | 29.460294 | 101 | 0.562122 | [
"object"
] |
e2e6b34c2c11a75f99871a31821820875f9927d3 | 8,640 | cpp | C++ | SharedCode/scenes/SplayFingers2Scene.cpp | jing-interactive/digital_art_2014 | 736ce10ea3fa92b415c57fa5a1a41a64e6d98622 | [
"MIT"
] | 1 | 2019-10-10T12:23:21.000Z | 2019-10-10T12:23:21.000Z | SharedCode/scenes/SplayFingers2Scene.cpp | jing-interactive/digital_art_2014 | 736ce10ea3fa92b415c57fa5a1a41a64e6d98622 | [
"MIT"
] | null | null | null | SharedCode/scenes/SplayFingers2Scene.cpp | jing-interactive/digital_art_2014 | 736ce10ea3fa92b415c57fa5a1a41a64e6d98622 | [
"MIT"
] | 3 | 2019-05-02T11:20:41.000Z | 2021-07-26T16:38:38.000Z | #pragma once
#include "SplayFingers2Scene.h"
SplayFingers2Scene::SplayFingers2Scene(ofxPuppet* puppet, HandWithFingertipsSkeleton* handWithFingertipsSkeleton, HandWithFingertipsSkeleton* immutableHandWithFingertipsSkeleton) {
Scene::Scene();
Scene::setup("Splay Fingers 2", "Splay Fingers 2 (Hand With Fingertips)", ... | 42.561576 | 215 | 0.699537 | [
"vector"
] |
e2e6d663668bc5d03e765ae2ffb0074c99763e2f | 1,590 | cpp | C++ | 2015/NOIP&NOI/NOIP2007tigao/core.cpp | jasha64/jasha64 | 653881f0f79075a628f98857e77eac27aef1919d | [
"MIT"
] | null | null | null | 2015/NOIP&NOI/NOIP2007tigao/core.cpp | jasha64/jasha64 | 653881f0f79075a628f98857e77eac27aef1919d | [
"MIT"
] | null | null | null | 2015/NOIP&NOI/NOIP2007tigao/core.cpp | jasha64/jasha64 | 653881f0f79075a628f98857e77eac27aef1919d | [
"MIT"
] | 1 | 2020-06-15T07:58:13.000Z | 2020-06-15T07:58:13.000Z | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 307, INF = 300007;
int f[N][N], n, d, e[N][N];
bool G[N][N], v[N];
vector<int> r;
vector<vector<int> > Roadlist;
bool DFS(int x)
{
v[x] = true;
if (G[x][d]) {r.push_back(x); return true;}
for (int i = 1; i <= n; i++)
i... | 19.875 | 70 | 0.409434 | [
"vector"
] |
e2e9b6d8bfc226ba505ef98f1a4d2ec38c03a34e | 2,060 | hpp | C++ | src/NetTcpJson/Extractor.hpp | OlivierLDff/NetTcpJson | e63d126cd0149b09cdf7f1c67d44da014c71c687 | [
"MIT"
] | 3 | 2021-06-08T23:59:35.000Z | 2021-12-01T09:03:45.000Z | src/NetTcpJson/Extractor.hpp | OlivierLDff/NetTcpJson | e63d126cd0149b09cdf7f1c67d44da014c71c687 | [
"MIT"
] | null | null | null | src/NetTcpJson/Extractor.hpp | OlivierLDff/NetTcpJson | e63d126cd0149b09cdf7f1c67d44da014c71c687 | [
"MIT"
] | null | null | null | //
// MIT License
//
// Copyright (c) 2021 Olivier Le Doeuff
//
// 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, cop... | 31.212121 | 81 | 0.735922 | [
"vector"
] |
e2eaec55358ebab22b1df6083124ced4234f7325 | 3,145 | cpp | C++ | Game/GameObject.cpp | Floppy/alienation | d2fca9344f88f70f1547573bea2244f77bd23379 | [
"BSD-3-Clause"
] | null | null | null | Game/GameObject.cpp | Floppy/alienation | d2fca9344f88f70f1547573bea2244f77bd23379 | [
"BSD-3-Clause"
] | null | null | null | Game/GameObject.cpp | Floppy/alienation | d2fca9344f88f70f1547573bea2244f77bd23379 | [
"BSD-3-Clause"
] | null | null | null | #include "Game/GameObject.h"
int CGameObject::m_iLastID = 0;
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////
CGameObject::CGameObject(int num, float mass) :
CSimulation(num, mass),
m_poTar... | 22.625899 | 87 | 0.647695 | [
"render"
] |
e2ed86c2cb5a5ab5b5c7b14bc12362458c85ffab | 3,447 | cpp | C++ | applications/physbam/physbam-lib/Public_Library/PhysBAM_Rendering/PhysBAM_Ray_Tracing/Rendering_Objects/RENDERING_UNIFORM_GRID_ACCELERATOR.cpp | schinmayee/nimbus | 170cd15e24a7a88243a6ea80aabadc0fc0e6e177 | [
"BSD-3-Clause"
] | 20 | 2017-07-03T19:09:09.000Z | 2021-09-10T02:53:56.000Z | applications/physbam/physbam-lib/Public_Library/PhysBAM_Rendering/PhysBAM_Ray_Tracing/Rendering_Objects/RENDERING_UNIFORM_GRID_ACCELERATOR.cpp | schinmayee/nimbus | 170cd15e24a7a88243a6ea80aabadc0fc0e6e177 | [
"BSD-3-Clause"
] | null | null | null | applications/physbam/physbam-lib/Public_Library/PhysBAM_Rendering/PhysBAM_Ray_Tracing/Rendering_Objects/RENDERING_UNIFORM_GRID_ACCELERATOR.cpp | schinmayee/nimbus | 170cd15e24a7a88243a6ea80aabadc0fc0e6e177 | [
"BSD-3-Clause"
] | 9 | 2017-09-17T02:05:06.000Z | 2020-01-31T00:12:01.000Z | //#####################################################################
// Copyright 2004, Ron Fedkiw, Andrew Selle.
// This file is part of PhysBAM whose distribution is governed by the license contained in the accompanying file PHYSBAM_COPYRIGHT.txt.
//#################################################################... | 67.588235 | 167 | 0.659124 | [
"object",
"vector"
] |
e2faf1f015608fc96caf9e68e3543bd09e9ed8d9 | 2,994 | cc | C++ | src/stack/phy/das/DasFilter.cc | talal00/Simu5G | ffbdda3e4cd873b49d7022912fe25e39d1a503e8 | [
"Intel"
] | 58 | 2021-04-15T09:20:26.000Z | 2022-03-31T08:52:23.000Z | src/stack/phy/das/DasFilter.cc | talal00/Simu5G | ffbdda3e4cd873b49d7022912fe25e39d1a503e8 | [
"Intel"
] | 34 | 2021-05-14T15:05:36.000Z | 2022-03-31T20:51:33.000Z | src/stack/phy/das/DasFilter.cc | talal00/Simu5G | ffbdda3e4cd873b49d7022912fe25e39d1a503e8 | [
"Intel"
] | 30 | 2021-04-16T05:46:13.000Z | 2022-03-28T15:26:29.000Z | //
// Simu5G
//
// Authors: Giovanni Nardini, Giovanni Stea, Antonio Virdis (University of Pisa)
//
// This file is part of a software released under the license included in file
// "license.pdf". Please read LICENSE and README files before using it.
// The above files and the present reference are par... | 27.218182 | 116 | 0.627255 | [
"vector",
"model"
] |
c3b8dd802a4cb08dfb91ec151f2618394b125d9e | 710 | hpp | C++ | source/CGTutorial/source/CarGhost.hpp | cg-htw/proof | dcee0468356b09e94b82508ced46b59cb4abe943 | [
"Apache-2.0"
] | null | null | null | source/CGTutorial/source/CarGhost.hpp | cg-htw/proof | dcee0468356b09e94b82508ced46b59cb4abe943 | [
"Apache-2.0"
] | null | null | null | source/CGTutorial/source/CarGhost.hpp | cg-htw/proof | dcee0468356b09e94b82508ced46b59cb4abe943 | [
"Apache-2.0"
] | null | null | null | //
// GhostController.hpp
// CG_Beleg
//
// Created by Janis on 18.06.19.
//
#pragma once
#include <stdio.h>
#include "Constants.h"
#include "Car.hpp"
class CarGhost
{
std::vector<HistoryEntry> history;
Model carModel;
glm::mat4 *carModelMatrix;
int currentPosition;
double previousTimestamp;... | 20.882353 | 81 | 0.695775 | [
"vector",
"model"
] |
c3bf27e9e0e18c248e18ee1fb690eb764337baf4 | 3,015 | cpp | C++ | src/prediction.cpp | enkhtuvshinj/CarND-Path-Planning | cbe0b36669c6279e82556f53bdb9fc3df33cd96a | [
"MIT"
] | null | null | null | src/prediction.cpp | enkhtuvshinj/CarND-Path-Planning | cbe0b36669c6279e82556f53bdb9fc3df33cd96a | [
"MIT"
] | null | null | null | src/prediction.cpp | enkhtuvshinj/CarND-Path-Planning | cbe0b36669c6279e82556f53bdb9fc3df33cd96a | [
"MIT"
] | null | null | null | #include "prediction.h"
vector<double> NaiveBayesClassifier(const NaiveBayesParameters_t ¶m, vector<double> observation)
{
/**
* Once trained, this method is called and expected to return
* a predicted behavior for the given observation.
* @param observation - a 4 tuple with s, d, s_dot, d_dot.
*... | 37.222222 | 157 | 0.678275 | [
"vector"
] |
c3c1b058f17eb11aa0d159fe41d01bb744a0e05b | 26,113 | cpp | C++ | test/test.cpp | markparticle/TinyJson | 4eaa9a3d7e58dcb85e35623b3b80b0a073baaddd | [
"Apache-2.0"
] | 2 | 2020-08-04T08:23:55.000Z | 2021-07-13T08:03:59.000Z | test/test.cpp | markparticle/TinyJson | 4eaa9a3d7e58dcb85e35623b3b80b0a073baaddd | [
"Apache-2.0"
] | null | null | null | test/test.cpp | markparticle/TinyJson | 4eaa9a3d7e58dcb85e35623b3b80b0a073baaddd | [
"Apache-2.0"
] | 1 | 2021-10-13T02:32:39.000Z | 2021-10-13T02:32:39.000Z | /*
* @Author : mark
* @Date : 2020-05-26
* @copyleft Apache 2.0
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "../code/tinyjson.h"
static int testCount = 0;
static int testPass = 0;
static int mainRet = 0;
#define EXPECT_EQ_BASE(equality, expect, actual, format) \
do {\... | 37.304286 | 128 | 0.647034 | [
"object"
] |
c3c3c95ca9272843aae7c7f63eca1f286971df0c | 16,097 | hpp | C++ | include/ilasynth/horn.hpp | Bo-Yuan-Huang/ItSy | aade7a0456461fcd160cd6a90bbca646c0d7990d | [
"MIT"
] | 1 | 2018-12-08T07:32:38.000Z | 2018-12-08T07:32:38.000Z | include/ilasynth/horn.hpp | PrincetonUniversity/ILA-Synthesis-Python | 084564f5a8fbe9ae4c7e3d3c4995bf85885972f0 | [
"MIT"
] | 5 | 2018-12-07T15:59:41.000Z | 2019-01-18T06:11:12.000Z | include/ilasynth/horn.hpp | PrincetonUniversity/ILA-Synthesis-Python | 084564f5a8fbe9ae4c7e3d3c4995bf85885972f0 | [
"MIT"
] | 1 | 2019-05-15T14:56:43.000Z | 2019-05-15T14:56:43.000Z | #ifndef __HORN_HPP_DEFINED__
#define __HORN_HPP_DEFINED__
#include <map>
#include <set>
#include <string>
#include <ilasynth/ast.hpp>
#include <ilasynth/type.hpp>
namespace ilasynth {
// ---------------------------------------------------------------------- //
class HornVar;
class HornLiteral;
class HornClause;
clas... | 34.248936 | 80 | 0.596633 | [
"model"
] |
c3d489974062f576b069c4257fb1aa118ef5bf0e | 3,397 | cpp | C++ | src/core/CL/CLTracePoint.cpp | Ehsan-aghapour/AI-Sheduling-Reprodution | 657dfa7c875445ab275c8a4418bbf29ed4d94891 | [
"MIT"
] | 1 | 2021-08-24T15:44:31.000Z | 2021-08-24T15:44:31.000Z | src/core/CL/CLTracePoint.cpp | Ehsan-aghapour/AI-Sheduling-Reprodution | 657dfa7c875445ab275c8a4418bbf29ed4d94891 | [
"MIT"
] | 1 | 2021-08-31T14:38:07.000Z | 2022-02-16T16:34:13.000Z | src/core/CL/CLTracePoint.cpp | Ehsan-aghapour/AI-Sheduling-Reprodution | 657dfa7c875445ab275c8a4418bbf29ed4d94891 | [
"MIT"
] | 1 | 2021-03-28T07:09:48.000Z | 2021-03-28T07:09:48.000Z | /*
* Copyright (c) 2020-2021 Arm Limited.
*
* SPDX-License-Identifier: MIT
*
* 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
* ri... | 39.5 | 81 | 0.814248 | [
"vector"
] |
c3d8d278b420ad75f241c21c929f60b50508cedc | 802 | cpp | C++ | GCJ/kickstart/2017/round-B/A/sol.cpp | Zovube/Tasks-solutions | fde056189dd5f630197d0516d3837044bc339e49 | [
"MIT"
] | 2 | 2018-11-08T05:57:22.000Z | 2018-11-08T05:57:27.000Z | GCJ/kickstart/2017/round-B/A/sol.cpp | Zovube/Tasks-solutions | fde056189dd5f630197d0516d3837044bc339e49 | [
"MIT"
] | null | null | null | GCJ/kickstart/2017/round-B/A/sol.cpp | Zovube/Tasks-solutions | fde056189dd5f630197d0516d3837044bc339e49 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
int main() {
freopen("test.in", "r", stdin);
freopen("test.out", "w", stdout);
int T; cin >> T;
for(int test = 1; test <= T; test++) {
int n; cin >> n;
vector < int > aa(n);
for(int i = 0; i < n; i++) cin >> aa[i];
... | 22.914286 | 68 | 0.386534 | [
"vector"
] |
c3d9a68f02b5ea0344f1f42e019afb6659e4b98a | 39,628 | cpp | C++ | src/MayaBridge/DeviceGrabber/NuiMayaDeviceGrabber.cpp | hustztz/NatureUserInterfaceStudio | 3cdac6b6ee850c5c8470fa5f1554c7447be0d8af | [
"MIT"
] | 3 | 2016-07-14T13:04:35.000Z | 2017-04-01T09:58:27.000Z | src/MayaBridge/DeviceGrabber/NuiMayaDeviceGrabber.cpp | hustztz/NatureUserInterfaceStudio | 3cdac6b6ee850c5c8470fa5f1554c7447be0d8af | [
"MIT"
] | null | null | null | src/MayaBridge/DeviceGrabber/NuiMayaDeviceGrabber.cpp | hustztz/NatureUserInterfaceStudio | 3cdac6b6ee850c5c8470fa5f1554c7447be0d8af | [
"MIT"
] | 1 | 2021-11-21T15:33:35.000Z | 2021-11-21T15:33:35.000Z | #include "../api_macros.h"
#include "NuiMayaDeviceGrabber.h"
#include "NuiMayaPreviewerRenderOverride.h"
#include "Frame/Buffer/NuiFrameCache.h"
#include "Frame/Buffer/NuiFrameBuffer.h"
#include "DeviceManager/NuiRGBDDeviceController.h"
#include "SLAM/Backend/NuiSLAMController.h"
#include "../SkeletonDriver/NuiM... | 34.549259 | 182 | 0.707858 | [
"mesh",
"geometry",
"object",
"shape",
"model"
] |
c3dde5d9bf869d279d92b0058feed6e2c066e5d2 | 20,166 | cpp | C++ | WaveletTL/ring/ring_basis.cpp | kedingagnumerikunimarburg/Marburg_Software_Library | fe53c3ae9db23fc3cb260a735b13a1c6d2329c17 | [
"MIT"
] | 3 | 2018-05-20T15:25:58.000Z | 2021-01-19T18:46:48.000Z | WaveletTL/ring/ring_basis.cpp | agnumerikunimarburg/Marburg_Software_Library | fe53c3ae9db23fc3cb260a735b13a1c6d2329c17 | [
"MIT"
] | null | null | null | WaveletTL/ring/ring_basis.cpp | agnumerikunimarburg/Marburg_Software_Library | fe53c3ae9db23fc3cb260a735b13a1c6d2329c17 | [
"MIT"
] | 2 | 2019-04-24T18:23:26.000Z | 2020-09-17T10:00:27.000Z | // implementation for ring_basis.h
#include <set>
#include <numerics/quadrature.h>
#include <numerics/iteratsolv.h>
#include <algebra/sparse_matrix.h>
#include <algebra/kronecker_matrix.h>
using MathTL::KroneckerMatrix;
namespace WaveletTL
{
template <int d, int dt, int s0, int s1>
RingBasis<d,dt,s0,s1>::RingBas... | 33.554077 | 121 | 0.611128 | [
"vector"
] |
c3e2da45f1efa5e92223b048b645d3ea2a32662d | 2,255 | cpp | C++ | leetcode-problems/easy-125-valid-palindrome.cpp | formatkaka/dsalgo | a7c7386c5c161e23bc94456f93cadd0f91f102fa | [
"Unlicense"
] | null | null | null | leetcode-problems/easy-125-valid-palindrome.cpp | formatkaka/dsalgo | a7c7386c5c161e23bc94456f93cadd0f91f102fa | [
"Unlicense"
] | null | null | null | leetcode-problems/easy-125-valid-palindrome.cpp | formatkaka/dsalgo | a7c7386c5c161e23bc94456f93cadd0f91f102fa | [
"Unlicense"
] | null | null | null | //
// Created by Siddhant on 2019-09-10.
//
#include "iostream"
#include "vector"
#include "string"
using namespace std;
int main(){
string input = ".,,ab";
auto inputStart = input.begin();
auto inputEnd = input.end() - 1;
while(inputStart < inputEnd){
/* Added while loops below ... | 20.5 | 108 | 0.473614 | [
"vector"
] |
c3e710c27fafa1800a5b552f1c398631fa7c0ca1 | 2,824 | cpp | C++ | WonderBrush/src/tools/filters/SimpleBrightness.cpp | waddlesplash/WonderBrush-v2 | df20b6a43115d02e4606c71f27d0712ac2aebb62 | [
"MIT"
] | 11 | 2018-11-10T11:14:11.000Z | 2021-12-27T17:17:08.000Z | WonderBrush/src/tools/filters/SimpleBrightness.cpp | waddlesplash/WonderBrush-v2 | df20b6a43115d02e4606c71f27d0712ac2aebb62 | [
"MIT"
] | 27 | 2018-11-11T00:06:25.000Z | 2021-06-24T06:43:38.000Z | WonderBrush/src/tools/filters/SimpleBrightness.cpp | waddlesplash/WonderBrush-v2 | df20b6a43115d02e4606c71f27d0712ac2aebb62 | [
"MIT"
] | 7 | 2018-11-10T20:32:49.000Z | 2021-03-15T18:03:42.000Z | // SimpleBrightness.cpp
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <Bitmap.h>
#include <Message.h>
#include "bitmap_compression.h"
#include "bitmap_support.h"
#include "blending.h"
#include "defines.h"
#include "support.h"
#include "CommonPropertyIDs.h"
#include "FilterFactory.h"
#include "Fl... | 19.611111 | 88 | 0.725212 | [
"object"
] |
c3efafe574b19f17e3a65d1610958e4b782c58e2 | 3,563 | hpp | C++ | src/libraries/regionModels/surfaceFilmModels/submodels/kinematic/injectionModel/drippingInjection/drippingInjection.hpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | src/libraries/regionModels/surfaceFilmModels/submodels/kinematic/injectionModel/drippingInjection/drippingInjection.hpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | src/libraries/regionModels/surfaceFilmModels/submodels/kinematic/injectionModel/drippingInjection/drippingInjection.hpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | /*---------------------------------------------------------------------------*\
Copyright (C) 2011-2018 OpenFOAM Foundation
-------------------------------------------------------------------------------
License
This file is part of CAELUS.
CAELUS is free software: you can redistribute it and/or modify it
... | 25.818841 | 79 | 0.536907 | [
"model"
] |
c3fab3055087686d90482db2a43ff7286dffd8a0 | 385 | hpp | C++ | modules/rep/kernel.hpp | hxmhuang/OpenArray_Dev | 863866a6b7accf21fa253567b0e66143c7506cdf | [
"MIT"
] | 3 | 2020-09-08T05:01:56.000Z | 2020-11-23T13:11:25.000Z | modules/rep/kernel.hpp | hxmhuang/OpenArray_Dev | 863866a6b7accf21fa253567b0e66143c7506cdf | [
"MIT"
] | null | null | null | modules/rep/kernel.hpp | hxmhuang/OpenArray_Dev | 863866a6b7accf21fa253567b0e66143c7506cdf | [
"MIT"
] | 2 | 2019-08-16T08:32:30.000Z | 2020-02-10T08:44:04.000Z | #ifndef __REP_KERNEL_HPP__
#define __REP_KERNEL_HPP__
#include "../../NodePool.hpp"
#include "../../NodeDesc.hpp"
#include "../../Function.hpp"
#include <vector>
using namespace std;
namespace oa{
namespace kernel{
ArrayPtr kernel_rep(vector<ArrayPtr> &ops_ap);
ArrayPtr kernel_rep_with_partition(vector<Ar... | 18.333333 | 64 | 0.706494 | [
"vector"
] |
c3fb94ee731e7cb37ac71ff7b574e391adf94dd5 | 9,026 | cpp | C++ | python/pySpriteComponent.cpp | indigames/igeScene | caf6e5c7575ac9fb4d7e887764707d4faa5d168e | [
"MIT"
] | null | null | null | python/pySpriteComponent.cpp | indigames/igeScene | caf6e5c7575ac9fb4d7e887764707d4faa5d168e | [
"MIT"
] | null | null | null | python/pySpriteComponent.cpp | indigames/igeScene | caf6e5c7575ac9fb4d7e887764707d4faa5d168e | [
"MIT"
] | null | null | null | #include "python/pySpriteComponent.h"
#include "python/pySpriteComponent_doc_en.h"
#include "components/SpriteComponent.h"
#include "utils/PyxieHeaders.h"
using namespace pyxie;
#include <pyVectorMath.h>
#include <pythonResource.h>
namespace ige::scene
{
void SpriteComponent_dealloc(PyObject_SpriteComponent *se... | 39.587719 | 138 | 0.481276 | [
"object"
] |
7f01341bdcacf40ebcd9aea022e41aa382eef871 | 456 | hpp | C++ | includes/components/mover.hpp | wagnrd/simple-graphics-engine | 92e8277a267c364fadecb725ecd4af1b1a753e32 | [
"MIT"
] | null | null | null | includes/components/mover.hpp | wagnrd/simple-graphics-engine | 92e8277a267c364fadecb725ecd4af1b1a753e32 | [
"MIT"
] | null | null | null | includes/components/mover.hpp | wagnrd/simple-graphics-engine | 92e8277a267c364fadecb725ecd4af1b1a753e32 | [
"MIT"
] | null | null | null | #ifndef SIMPLE_GRAPHICS_ENGINE_MOVER_HPP
#define SIMPLE_GRAPHICS_ENGINE_MOVER_HPP
#include <memory>
#include <glm/vec2.hpp>
#include "includes/component.hpp"
class Transform;
class Mover: public Component {
std::shared_ptr<Transform> transform;
glm::vec2 maxPosition;
public:
explicit Mover(const glm::... | 19.826087 | 49 | 0.765351 | [
"transform"
] |
7f046b3587b327df790b2389af8437674c21a34e | 5,496 | cpp | C++ | src/utils.cpp | diegoob11/GalaxyOnFire | a694f10792743031da7500c20b676840d92b3b66 | [
"Apache-2.0"
] | null | null | null | src/utils.cpp | diegoob11/GalaxyOnFire | a694f10792743031da7500c20b676840d92b3b66 | [
"Apache-2.0"
] | null | null | null | src/utils.cpp | diegoob11/GalaxyOnFire | a694f10792743031da7500c20b676840d92b3b66 | [
"Apache-2.0"
] | null | null | null | #include "utils.h"
#ifdef WIN32
#include <windows.h>
#else
#include <sys/time.h>
#endif
#include "includes.h"
#include "game.h"
#include "camera.h"
#include "shader.h"
#include "extra/stb_easy_font.h"
//quick dirty global
GLuint grid_vao;
GLuint grid_vbo_vert;
GLuint grid_vbo_ind;
GLuint grid_num_points;
Shader*... | 24.105263 | 122 | 0.689592 | [
"vector"
] |
7f0e4ff91e408d21fbd1dd792373f90106595347 | 2,294 | cc | C++ | cpp/Codeforces/451-500/489B_BerSU_Ball.cc | phongvcao/CP_Contests_Solutions | 2e76e73ee7e53c798f63e1870be47653c75180a9 | [
"MIT"
] | null | null | null | cpp/Codeforces/451-500/489B_BerSU_Ball.cc | phongvcao/CP_Contests_Solutions | 2e76e73ee7e53c798f63e1870be47653c75180a9 | [
"MIT"
] | null | null | null | cpp/Codeforces/451-500/489B_BerSU_Ball.cc | phongvcao/CP_Contests_Solutions | 2e76e73ee7e53c798f63e1870be47653c75180a9 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <unordered_map>
#include <stdint.h>
#include <cmath>
using namespace std;
typedef int64_t Int;
typedef uint64_t UInt;
void quickSort(Int *intArr, Int first, Int last) {
Int left = first;
Int right = last;
Int pivot = int... | 19.606838 | 70 | 0.512642 | [
"vector"
] |
7f1646945be13ec926ccdbd0e9170e46160fef2a | 880 | cpp | C++ | Test/Cpp/ACM/HDU/1014.cpp | intLyc/Undergraduate-Courses | 8eba20b6b8c43d4eee0af4b0ebca68d708f27aa9 | [
"Apache-2.0"
] | null | null | null | Test/Cpp/ACM/HDU/1014.cpp | intLyc/Undergraduate-Courses | 8eba20b6b8c43d4eee0af4b0ebca68d708f27aa9 | [
"Apache-2.0"
] | null | null | null | Test/Cpp/ACM/HDU/1014.cpp | intLyc/Undergraduate-Courses | 8eba20b6b8c43d4eee0af4b0ebca68d708f27aa9 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
using namespace std;
int main()
{
int step,mod;
string str(" Good Choice");
string bad(" Bad Choice");
while (cin >> step >> mod)
{
vector<int> arr;
int temp;
temp = (step)%mod;
... | 25.882353 | 63 | 0.45 | [
"vector"
] |
7f230d91ea4be41f22d34ad830e8a95ab7757606 | 435 | hpp | C++ | src/tank/include/tank/tank_base.hpp | northdk/ros2practice | 8ed919169585faa36b052363e05b817f3c54b71d | [
"MIT"
] | null | null | null | src/tank/include/tank/tank_base.hpp | northdk/ros2practice | 8ed919169585faa36b052363e05b817f3c54b71d | [
"MIT"
] | null | null | null | src/tank/include/tank/tank_base.hpp | northdk/ros2practice | 8ed919169585faa36b052363e05b817f3c54b71d | [
"MIT"
] | null | null | null | /**
* @file tank_base.h
* @author North.D.K (north24@qq.com)
* @brief plugin base for tank model, all actions start here
* @version 0.1
* @date 2021-11-30
*
* @copyright See the LICENSE file.
*
*/
#ifndef TANK_BASE_HPP
#define TANK_BASE_HPP
#include <string>
class Tank
{
public:
virtual void init(const ... | 17.4 | 60 | 0.641379 | [
"model"
] |
b525c81ee5a304e3ea237d32fb7d399b9c881598 | 11,336 | cpp | C++ | data/555.cpp | TianyiChen/rdcpp-data | 75c6868c876511e3ce143fdc3c08ddd74c7aa4ea | [
"MIT"
] | null | null | null | data/555.cpp | TianyiChen/rdcpp-data | 75c6868c876511e3ce143fdc3c08ddd74c7aa4ea | [
"MIT"
] | null | null | null | data/555.cpp | TianyiChen/rdcpp-data | 75c6868c876511e3ce143fdc3c08ddd74c7aa4ea | [
"MIT"
] | null | null | null | int
FVaP, hS ,
wewN //
,//
XZG
,u,
JX
, T2 , H
, hPXC , IjMce ,UfDe , J8 , crRNW//j
, vcr ,STGz,Lyf ,BEDFG,/*0*/ LzbBlv
,
/*JPo*/Xkl
,/*ez*/
Slfl ,
M5S , IZ ,
OAS2,dEq//u0
, W,Ku9//XQf
,
c5f
,
gjGyHu3
,U,
D1xf, Djn ,
wK,LB ,jU, K4
,
OT9
, MD//3
,
K6AP ; void
f_f0//LOm
(){ int
Nz; v... | 10.343066 | 68 | 0.443278 | [
"3d"
] |
b5273461478f0156abdccdf0f5508505d20b6156 | 11,726 | cpp | C++ | MenuToolsHook/MenuToolsHook.cpp | kokolorix/MenuTools | c13f966feb4a4851e7909a52d9e9e25b85a69c07 | [
"MIT"
] | null | null | null | MenuToolsHook/MenuToolsHook.cpp | kokolorix/MenuTools | c13f966feb4a4851e7909a52d9e9e25b85a69c07 | [
"MIT"
] | null | null | null | MenuToolsHook/MenuToolsHook.cpp | kokolorix/MenuTools | c13f966feb4a4851e7909a52d9e9e25b85a69c07 | [
"MIT"
] | null | null | null | // MenuToolsHook.cpp : Defines the exported functions for the DLL application.
//
#include "stdafx.h"
#include <windowsx.h>
#include <sstream>
#include <chrono>
#include <future>
#include "MenuTools.h"
#include "MenuCommon/Logger.h"
#include "MenuCommon/TrayIcon.h"
#include "MenuCommon/ScreenToolWnd.h"
#include <Sh... | 24.078029 | 121 | 0.624851 | [
"transform"
] |
b52775210b4752d7d2d0f9a636194636ef5ef6a3 | 2,876 | cpp | C++ | problems/elementarymath/output_validators/jeroen/check.cpp | stoman/CompetitiveProgramming | 0000b64369b50e31c6f48939e837bdf6cece8ce4 | [
"MIT"
] | 2 | 2020-12-22T13:21:25.000Z | 2021-12-12T22:26:26.000Z | problems/elementarymath/output_validators/jeroen/check.cpp | stoman/CompetitiveProgramming | 0000b64369b50e31c6f48939e837bdf6cece8ce4 | [
"MIT"
] | null | null | null | problems/elementarymath/output_validators/jeroen/check.cpp | stoman/CompetitiveProgramming | 0000b64369b50e31c6f48939e837bdf6cece8ce4 | [
"MIT"
] | null | null | null | #include <vector>
#include <map>
#include <iostream>
#include <cstring>
#include "streamcorr.h"
using namespace std;
int n;
vector<int> a;
vector<int> b;
struct equation {
int a;
char op;
int b;
long long ans;
};
struct solution {
equation *eqs; // NULL means impossible, otherwise length == n
};
solution read... | 26.878505 | 111 | 0.608136 | [
"vector"
] |
b53130d0237d363e303f9c6d6b38fae37c2d988f | 839 | cpp | C++ | vm/builtin/weakref.cpp | godfat/rubinius | d6a7a3323af0348800118ccd0b13fdf80adbbcef | [
"BSD-3-Clause"
] | 3 | 2015-02-02T01:21:27.000Z | 2016-04-29T22:30:01.000Z | vm/builtin/weakref.cpp | godfat/rubinius | d6a7a3323af0348800118ccd0b13fdf80adbbcef | [
"BSD-3-Clause"
] | null | null | null | vm/builtin/weakref.cpp | godfat/rubinius | d6a7a3323af0348800118ccd0b13fdf80adbbcef | [
"BSD-3-Clause"
] | 1 | 2018-03-04T03:19:02.000Z | 2018-03-04T03:19:02.000Z | #include "builtin/weakref.hpp"
#include "builtin/class.hpp"
#include "object_utils.hpp"
#include "gc/gc.hpp"
#include "ontology.hpp"
#include "configuration.hpp"
namespace rubinius {
void WeakRef::init(STATE) {
Class* super_class;
if(!LANGUAGE_18_ENABLED(state)) {
super_class = G(basicobject);
} ... | 23.305556 | 76 | 0.656734 | [
"object"
] |
b53c041ad9c66eaa00cb92201192a62affe6cf46 | 925 | cpp | C++ | geeksforgeeks/Transitive closure of a Graph.cpp | him1411/algorithmic-coding-and-data-structures | 685aa95539692daca68ce79c20467c335aa9bb7f | [
"MIT"
] | null | null | null | geeksforgeeks/Transitive closure of a Graph.cpp | him1411/algorithmic-coding-and-data-structures | 685aa95539692daca68ce79c20467c335aa9bb7f | [
"MIT"
] | null | null | null | geeksforgeeks/Transitive closure of a Graph.cpp | him1411/algorithmic-coding-and-data-structures | 685aa95539692daca68ce79c20467c335aa9bb7f | [
"MIT"
] | 2 | 2018-10-04T19:01:52.000Z | 2018-10-05T08:49:57.000Z | using namespace std;
void dfs(vector<int> graph[],int adj[][1000],int i,int k,int visited[])
{
visited[i]=1;
for(int x=0;x<graph[i].size();x++)
{
if(!visited[graph[i][x]])
{
adj[k][graph[i][x]]=1;
dfs(graph,adj,graph[i][x],k,visited);
}
}
}
int... | 16.517857 | 71 | 0.422703 | [
"vector"
] |
b53d4c5db615a374224f79dff0c124651a919cb0 | 4,350 | cpp | C++ | src/llvm/Random.cpp | gitter-badger/sbmlsolver | c92936832297ea1d2ad7f17223b68ada43c8f0b2 | [
"Apache-2.0"
] | null | null | null | src/llvm/Random.cpp | gitter-badger/sbmlsolver | c92936832297ea1d2ad7f17223b68ada43c8f0b2 | [
"Apache-2.0"
] | null | null | null | src/llvm/Random.cpp | gitter-badger/sbmlsolver | c92936832297ea1d2ad7f17223b68ada43c8f0b2 | [
"Apache-2.0"
] | null | null | null | /*
* Random.cpp
*
* Created on: Sep 23, 2014
* Author: andy
*/
#include "Random.h"
#include "ModelGeneratorContext.h"
#include "LLVMIncludes.h"
#include "rrLogger.h"
#include "rrConfig.h"
#include "rrUtils.h"
#include <stdint.h>
#if INTPTR_MAX == INT32_MAX
#define RR_32BIT
#elif INTPTR_MAX == INT64_MA... | 24.033149 | 92 | 0.672874 | [
"object"
] |
b53eaa529ac8a8f06a23d3f03c4a0671b64941fa | 8,440 | cpp | C++ | plugins/robobo_imu_sensor.cpp | BPRamos/robobo-gazebo-simulator | 105ef054d8e352f89a3b5dd3521f42a18c16c61a | [
"Apache-2.0"
] | 3 | 2020-12-24T11:54:20.000Z | 2021-02-16T20:26:17.000Z | plugins/robobo_imu_sensor.cpp | BPRamos/robobo-gazebo-simulator | 105ef054d8e352f89a3b5dd3521f42a18c16c61a | [
"Apache-2.0"
] | 2 | 2020-10-20T08:10:35.000Z | 2020-10-20T11:27:16.000Z | plugins/robobo_imu_sensor.cpp | BPRamos/robobo-gazebo-simulator | 105ef054d8e352f89a3b5dd3521f42a18c16c61a | [
"Apache-2.0"
] | 5 | 2020-06-14T11:32:43.000Z | 2021-11-25T23:57:27.000Z | /*This work has been funded by rosin.org (contract agreement 732287)
through EP project "Robobo AI"*/
/*******************************************************************************
*
* Copyright 2019, Manufactura de Ingenios Tecnológicos S.L.
* <http://www.mintforpeople.com>
*
* Redistribution, modific... | 34.590164 | 121 | 0.663152 | [
"vector",
"transform"
] |
b54125ac4452b7b8b05eea04ff6b00c761faa565 | 1,642 | hxx | C++ | MddProxyGit/WorkDispatcher.hxx | dkhedekar/ProxyDataRouter | db49040de93085d397b7a057bf2d759dd65f48ac | [
"0BSD"
] | 2 | 2015-05-28T20:25:32.000Z | 2015-05-29T13:15:35.000Z | MddProxyGit/WorkDispatcher.hxx | dkhedekar/ProxyDataRouter | db49040de93085d397b7a057bf2d759dd65f48ac | [
"0BSD"
] | null | null | null | MddProxyGit/WorkDispatcher.hxx | dkhedekar/ProxyDataRouter | db49040de93085d397b7a057bf2d759dd65f48ac | [
"0BSD"
] | null | null | null | /*
* WorkDispatcher.hxx
*
* Created on: May 12, 2015
* Author: kheddar
*/
#ifndef WORKDISPATCHER_HXX_
#define WORKDISPATCHER_HXX_
#include "PendingWorkQueue.hxx"
#include "Worker.hxx"
#include "Socket.hxx"
#include <vector>
#include <map>
#include <sys/epoll.h>
#define MAX_WORKER_THREADS 10
namespace md... | 20.02439 | 90 | 0.735688 | [
"vector"
] |
b5431435458b84b3cddfb816153a6e5c6d4b6e97 | 1,761 | cpp | C++ | tables/typetable.cpp | Paracetamol56/Observeur2 | d15e0adfaf9a517a01383abafb601673cda9fbfe | [
"Apache-2.0"
] | 1 | 2022-01-19T21:40:25.000Z | 2022-01-19T21:40:25.000Z | tables/typetable.cpp | Paracetamol56/Observeur2 | d15e0adfaf9a517a01383abafb601673cda9fbfe | [
"Apache-2.0"
] | 25 | 2021-08-22T23:07:48.000Z | 2022-03-11T16:12:52.000Z | tables/typetable.cpp | Paracetamol56/Observeur2 | d15e0adfaf9a517a01383abafb601673cda9fbfe | [
"Apache-2.0"
] | null | null | null | /**
* Created on Tue Jul 31 2021
*
* Copyright (c) 2021 - Mathéo G - All Right Reserved
*
* Licensed under the Apache License, Version 2.0
* Available on GitHub at https://github.com/Paracetamol56/Observeur2 */
#include "typetable.h"
#include "ui_tabledialog.h"
TypeTable::TypeTable(QWidget *parent, QSqlDatab... | 27.952381 | 99 | 0.661556 | [
"model"
] |
b543e6d9f43f56a0a34b87f7c05ef1e4ee93f12b | 3,921 | cc | C++ | PWGGA/NtuplizerTask/GJNtuples/example/photon_ml/update_ntuple.cc | nashimiz/AliPhysics | b688b622bdcb9926e09fe8652a2aa5bd1b3e775d | [
"BSD-3-Clause"
] | null | null | null | PWGGA/NtuplizerTask/GJNtuples/example/photon_ml/update_ntuple.cc | nashimiz/AliPhysics | b688b622bdcb9926e09fe8652a2aa5bd1b3e775d | [
"BSD-3-Clause"
] | null | null | null | PWGGA/NtuplizerTask/GJNtuples/example/photon_ml/update_ntuple.cc | nashimiz/AliPhysics | b688b622bdcb9926e09fe8652a2aa5bd1b3e775d | [
"BSD-3-Clause"
] | null | null | null | #include <numeric>
#include <TFile.h>
#include <TTree.h>
#include <TLorentzVector.h>
#include <TROOT.h>
#include <TApplication.h>
#include <TCanvas.h>
#include <TStyle.h>
#include <TH2D.h>
#include <TProfile.h>
#include <H5Cpp.h>
#include <emcal.h>
#define RANK 2
#define NCLUSTER_MAX (1U << 17)
int main(in... | 29.044444 | 80 | 0.58735 | [
"vector",
"model"
] |
b54f03aa42e45517036cc0e3d38a374a962d6f82 | 220 | cpp | C++ | Leetcode2/215.cpp | nolink/algorithm | 29d15403a2d720771cf266a1ab04b0ab29d4cb6c | [
"MIT"
] | null | null | null | Leetcode2/215.cpp | nolink/algorithm | 29d15403a2d720771cf266a1ab04b0ab29d4cb6c | [
"MIT"
] | null | null | null | Leetcode2/215.cpp | nolink/algorithm | 29d15403a2d720771cf266a1ab04b0ab29d4cb6c | [
"MIT"
] | null | null | null | class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
priority_queue<int> q;
for(auto num : nums) q.push(num);
for(int i=1;i<k;i++) q.pop();
return q.top();
}
};
| 22 | 50 | 0.536364 | [
"vector"
] |
b54fc8cf805750deedb01e1a84c98e2339a8f995 | 5,238 | hpp | C++ | lib/Bitboard.hpp | waegemans/MChessTS | c84851d923308a605f8926b7a2ecf52c6478cc31 | [
"MIT"
] | null | null | null | lib/Bitboard.hpp | waegemans/MChessTS | c84851d923308a605f8926b7a2ecf52c6478cc31 | [
"MIT"
] | null | null | null | lib/Bitboard.hpp | waegemans/MChessTS | c84851d923308a605f8926b7a2ecf52c6478cc31 | [
"MIT"
] | null | null | null | #pragma once
#include <cstdint>
#include <string>
#include <string_view>
#include <bitset>
#include <vector>
#include <cstring>
#include <stdexcept>
#include "Move.hpp"
namespace chess {
class Bitboard {
private:
uint64_t kings;
uint64_t queens;
uint64_t rooks;
uint64_t knight... | 28.78022 | 124 | 0.66323 | [
"vector"
] |
b55ff85e5f59fb4922623b4ff07b64ac2ac3c1b0 | 257 | cpp | C++ | strings/shiftingLetters.cpp | Gooner1886/DSA-101 | 44092e10ad39bebbf7da93e897927106d5a45ae7 | [
"MIT"
] | 20 | 2022-01-04T19:36:14.000Z | 2022-03-21T15:35:09.000Z | strings/shiftingLetters.cpp | Gooner1886/DSA-101 | 44092e10ad39bebbf7da93e897927106d5a45ae7 | [
"MIT"
] | null | null | null | strings/shiftingLetters.cpp | Gooner1886/DSA-101 | 44092e10ad39bebbf7da93e897927106d5a45ae7 | [
"MIT"
] | null | null | null | // Leetcode - 848 - Shifting Letters
string shiftingLetters(string s, vector<int> &shifts)
{
int k = 0;
for (int i = s.size() - 1; i >= 0; i--)
{
k = (k + shifts[i]) % 26;
s[i] = (s[i] - 'a' + k) % 26 + 'a';
}
return s;
} | 23.363636 | 53 | 0.455253 | [
"vector"
] |
b56db69d5079073867afdd617620d80a11aad000 | 15,028 | cpp | C++ | Enose_Simul/GasMapModelBase.cpp | OpenMORA/uma-olfaction-pkg | 5c9caa3da605035e80a0f7eb5af39dc65a191983 | [
"BSD-3-Clause"
] | 1 | 2016-04-13T09:58:06.000Z | 2016-04-13T09:58:06.000Z | Enose_Simul/GasMapModelBase.cpp | OpenMORA/uma-olfaction-pkg | 5c9caa3da605035e80a0f7eb5af39dc65a191983 | [
"BSD-3-Clause"
] | null | null | null | Enose_Simul/GasMapModelBase.cpp | OpenMORA/uma-olfaction-pkg | 5c9caa3da605035e80a0f7eb5af39dc65a191983 | [
"BSD-3-Clause"
] | null | null | null | /* +---------------------------------------------------------------------------+
| Open MORA (MObile Robot Arquitecture) |
| |
| http://sourceforge.net/p/openmora/home/ ... | 36.833333 | 138 | 0.638475 | [
"vector",
"model",
"3d"
] |
b57326de2ad9edfe189437a24f089cdbcfba9a38 | 7,930 | cpp | C++ | aegisub/src/ass_file.cpp | rcombs/Aegisub | 58f35cd31c7f0f5728e0a28e6a7a9fd6fce70c50 | [
"ISC"
] | 1 | 2018-02-12T02:44:57.000Z | 2018-02-12T02:44:57.000Z | aegisub/src/ass_file.cpp | rcombs/Aegisub | 58f35cd31c7f0f5728e0a28e6a7a9fd6fce70c50 | [
"ISC"
] | null | null | null | aegisub/src/ass_file.cpp | rcombs/Aegisub | 58f35cd31c7f0f5728e0a28e6a7a9fd6fce70c50 | [
"ISC"
] | 2 | 2018-02-12T03:46:24.000Z | 2018-02-12T14:36:07.000Z | // Copyright (c) 2005, Rodrigo Braz Monteiro
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list o... | 29.37037 | 116 | 0.696091 | [
"vector"
] |
b5761c9da68c9cd79a5d016f79140c114cc3f20d | 15,533 | cpp | C++ | Sources/Elastos/Packages/Providers/MediaProvider/src/elastos/droid/providers/media/MediaScannerService.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 7 | 2017-07-13T10:34:54.000Z | 2021-04-16T05:40:35.000Z | Sources/Elastos/Packages/Providers/MediaProvider/src/elastos/droid/providers/media/MediaScannerService.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | null | null | null | Sources/Elastos/Packages/Providers/MediaProvider/src/elastos/droid/providers/media/MediaScannerService.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
//
// ... | 33.404301 | 105 | 0.646366 | [
"object"
] |
b577321f8ddf704c7758db2541f7fd97ab324a9a | 3,494 | cpp | C++ | KernelObjectView/ObjectManager.cpp | zodiacon/KernelObjectView | d62c9db6a959dcb00642c8741a92952121ab48ac | [
"MIT"
] | 45 | 2019-07-23T18:44:44.000Z | 2022-02-01T08:09:22.000Z | KernelObjectView/ObjectManager.cpp | c3358/KernelObjectView | d62c9db6a959dcb00642c8741a92952121ab48ac | [
"MIT"
] | null | null | null | KernelObjectView/ObjectManager.cpp | c3358/KernelObjectView | d62c9db6a959dcb00642c8741a92952121ab48ac | [
"MIT"
] | 18 | 2019-07-24T05:14:20.000Z | 2022-01-12T21:28:22.000Z | #include "stdafx.h"
#include "ObjectManager.h"
#include <assert.h>
#pragma comment(lib, "ntdll")
ObjectManager::ObjectManager() {
}
ObjectManager::~ObjectManager() {
}
int ObjectManager::EnumObjectTypes() {
ULONG len = 1 << 17;
auto buffer = std::make_unique<BYTE[]>(len);
if (!NT_SUCCESS(NT::NtQueryObject(nullpt... | 36.020619 | 140 | 0.743274 | [
"vector"
] |
b57de223acefe0c955562767237b89d8df50b3b7 | 119,245 | cpp | C++ | src/RocketSim.cpp | RCrockford/ksp-launch-optimisation | cadd73b24c6e50e3981f904806efc280995b0f60 | [
"MIT"
] | null | null | null | src/RocketSim.cpp | RCrockford/ksp-launch-optimisation | cadd73b24c6e50e3981f904806efc280995b0f60 | [
"MIT"
] | null | null | null | src/RocketSim.cpp | RCrockford/ksp-launch-optimisation | cadd73b24c6e50e3981f904806efc280995b0f60 | [
"MIT"
] | null | null | null | // RocketSim.cpp : Defines the entry point for the application.
//
#include "stdafx.h"
#include "RocketSim.h"
#define MAX_LOADSTRING 100
// Global Variables:
static wchar_t szTitle[MAX_LOADSTRING]; // The title bar text
static wchar_t szWindowClass[MAX_LOADSTRING]; // the main window clas... | 38.994441 | 238 | 0.610525 | [
"render",
"object",
"vector"
] |
b5800dda2ad8569714d5bca617eaa7fde7657a28 | 5,183 | cpp | C++ | src/ui_text.cpp | Tizzio/EngineT | b9975634bbfa4ac0d5729928bb50a71e977344e0 | [
"MIT"
] | 1 | 2020-09-25T12:38:03.000Z | 2020-09-25T12:38:03.000Z | src/ui_text.cpp | Tizzio/EngineT | b9975634bbfa4ac0d5729928bb50a71e977344e0 | [
"MIT"
] | null | null | null | src/ui_text.cpp | Tizzio/EngineT | b9975634bbfa4ac0d5729928bb50a71e977344e0 | [
"MIT"
] | null | null | null | #include "ui_text.h"
#include "style.h"
#include "font.h"
#include "texture.h"
#include "utils.h"
namespace EngineT
{
Text::Text(wstring text, Style* style)
{
this->name = "text";
this->style = style;
if(text.length() <= 0)
return;
GenerateBuffers()... | 28.955307 | 131 | 0.450897 | [
"object"
] |
b58238a1a258e85911a78274f96d33d3774a7609 | 1,256 | cpp | C++ | aws-cpp-sdk-gamelift/source/model/UpdateAliasRequest.cpp | lintonv/aws-sdk-cpp | 15e19c265ffce19d2046b18aa1b7307fc5377e58 | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-gamelift/source/model/UpdateAliasRequest.cpp | lintonv/aws-sdk-cpp | 15e19c265ffce19d2046b18aa1b7307fc5377e58 | [
"Apache-2.0"
] | 1 | 2022-01-03T23:59:37.000Z | 2022-01-03T23:59:37.000Z | aws-cpp-sdk-gamelift/source/model/UpdateAliasRequest.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2021-11-09T11:58:03.000Z | 2021-11-09T11:58:03.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/gamelift/model/UpdateAliasRequest.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::GameLift::Model;
using namespace Aws::Utils::Json;
using na... | 19.323077 | 86 | 0.738057 | [
"model"
] |
b5932fee10111d1abaad10089c47e919d11664d0 | 2,551 | hpp | C++ | source/cppx-core-language/x-propagation/x-unwrapping.hpp | alf-p-steinbach/cppx-core-language | 930351fe0df65e231e8e91998f1c94d345938107 | [
"MIT"
] | 3 | 2020-05-24T16:29:42.000Z | 2021-09-10T13:33:15.000Z | source/cppx-core-language/x-propagation/x-unwrapping.hpp | alf-p-steinbach/cppx-core-language | 930351fe0df65e231e8e91998f1c94d345938107 | [
"MIT"
] | null | null | null | source/cppx-core-language/x-propagation/x-unwrapping.hpp | alf-p-steinbach/cppx-core-language | 930351fe0df65e231e8e91998f1c94d345938107 | [
"MIT"
] | null | null | null | #pragma once // Source encoding: UTF-8 with BOM (π is a lowercase Greek "pi").
#include <cppx-core-language/syntax/string-expressions/basic-string-assembly.hpp>
#include <cppx-core-language/syntax/collection-util.hpp> // cppx::is_empty
#include <cppx-core-language/syntax/declarations.hpp> ... | 32.705128 | 98 | 0.558996 | [
"vector"
] |
b59693b630f1ecb43f6ca1afb0c8eaae9ae9ff12 | 9,004 | cpp | C++ | src/Services/StatusReportService.cpp | loonwerks/case-ta6-experimental-platform-OpenUxAS | 2db8b04b12f34d4c43119740cd665be554e85b95 | [
"NASA-1.3"
] | 88 | 2017-08-24T07:02:01.000Z | 2022-03-18T04:34:17.000Z | src/Services/StatusReportService.cpp | loonwerks/case-ta6-experimental-platform-OpenUxAS | 2db8b04b12f34d4c43119740cd665be554e85b95 | [
"NASA-1.3"
] | 46 | 2017-06-08T18:18:08.000Z | 2022-03-15T18:24:43.000Z | src/Services/StatusReportService.cpp | loonwerks/case-ta6-experimental-platform-OpenUxAS | 2db8b04b12f34d4c43119740cd665be554e85b95 | [
"NASA-1.3"
] | 53 | 2017-06-22T14:48:05.000Z | 2022-02-15T16:59:38.000Z | // ===============================================================================
// Authors: AFRL/RQQA
// Organization: Air Force Research Laboratory, Aerospace Systems Directorate, Power and Control Division
//
// Copyright (c) 2017 Government of the United State of America, as represented by
// the Secretary of th... | 43.288462 | 130 | 0.712017 | [
"vector"
] |
b59ec8ff78e4187b96eb9be10d34ce545cd6a42b | 15,460 | cpp | C++ | structured/StorageSummaryInformation.cpp | djp952/storage-legacy | 0aa77be62e4fd84feab4781d2e849692d80ccf99 | [
"MIT"
] | null | null | null | structured/StorageSummaryInformation.cpp | djp952/storage-legacy | 0aa77be62e4fd84feab4781d2e849692d80ccf99 | [
"MIT"
] | null | null | null | structured/StorageSummaryInformation.cpp | djp952/storage-legacy | 0aa77be62e4fd84feab4781d2e849692d80ccf99 | [
"MIT"
] | 1 | 2020-03-07T17:41:52.000Z | 2020-03-07T17:41:52.000Z | //---------------------------------------------------------------------------
// Copyright (c) 2016 Michael G. Brehm
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restri... | 36.462264 | 90 | 0.667853 | [
"object"
] |
b26df1a0b3f8fee8d2cd7ac74ac7174e46188180 | 7,911 | cpp | C++ | SimSpark/rcssserver3d/plugin/soccer/kickeffector/kickeffector.cpp | IllyasvielEin/Robocup3dInstaller | 12e91d9372dd08a92feebf98e916c98bc2242ff4 | [
"MIT"
] | null | null | null | SimSpark/rcssserver3d/plugin/soccer/kickeffector/kickeffector.cpp | IllyasvielEin/Robocup3dInstaller | 12e91d9372dd08a92feebf98e916c98bc2242ff4 | [
"MIT"
] | null | null | null | SimSpark/rcssserver3d/plugin/soccer/kickeffector/kickeffector.cpp | IllyasvielEin/Robocup3dInstaller | 12e91d9372dd08a92feebf98e916c98bc2242ff4 | [
"MIT"
] | null | null | null | /* -*- mode: c++; c-basic-offset: 4; indent-tabs-mode: nil -*-
this file is part of rcssserver3D
Fri May 9 2003
Copyright (C) 2002,2003 Koblenz University
Copyright (C) 2003 RoboCup Soccer Server 3D Maintenance Group
$Id$
This program is free software; you can redistribute it and/or modify
it und... | 27.855634 | 92 | 0.621034 | [
"geometry",
"object",
"transform",
"3d"
] |
b2734ba9ce3ed00bde2c47be601a8766d7360c08 | 938 | cpp | C++ | PROX/FOUNDATION/SPARSE/unit_tests/sparse_element_prod/sparse_element_prod.cpp | diku-dk/PROX | c6be72cc253ff75589a1cac28e4e91e788376900 | [
"MIT"
] | 2 | 2019-11-27T09:44:45.000Z | 2020-01-13T00:24:21.000Z | PROX/FOUNDATION/SPARSE/unit_tests/sparse_element_prod/sparse_element_prod.cpp | erleben/matchstick | 1cfdc32b95437bbb0063ded391c34c9ee9b9583b | [
"MIT"
] | null | null | null | PROX/FOUNDATION/SPARSE/unit_tests/sparse_element_prod/sparse_element_prod.cpp | erleben/matchstick | 1cfdc32b95437bbb0063ded391c34c9ee9b9583b | [
"MIT"
] | null | null | null | #include <sparse.h>
#define BOOST_AUTO_TEST_MAIN
#include <boost/test/auto_unit_test.hpp>
#include <boost/test/unit_test_suite.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/test/test_tools.hpp>
BOOST_AUTO_TEST_SUITE(SPARSE);
BOOST_AUTO_TEST_CASE(element_prod_test)
{
typedef sparse::B... | 19.142857 | 51 | 0.602345 | [
"vector"
] |
b27a64b4a087c6d62f0812431f310e1cf4f96e3a | 2,412 | cpp | C++ | Algorithms/1801.Number_of_Orders_in_the_Backlog.cpp | metehkaya/LeetCode | 52f4a1497758c6f996d515ced151e8783ae4d4d2 | [
"MIT"
] | 2 | 2020-07-20T06:40:22.000Z | 2021-11-20T01:23:26.000Z | Problems/LeetCode/Problems/1801.Number_of_Orders_in_the_Backlog.cpp | metehkaya/Algo-Archive | 03b5fdcf06f84a03125c57762c36a4e03ca6e756 | [
"MIT"
] | null | null | null | Problems/LeetCode/Problems/1801.Number_of_Orders_in_the_Backlog.cpp | metehkaya/Algo-Archive | 03b5fdcf06f84a03125c57762c36a4e03ca6e756 | [
"MIT"
] | null | null | null | typedef long long LL;
class Solution {
public:
const int mod = (int) 1e9+7;
int getNumberOfBacklogOrders(vector<vector<int>>& orders) {
map<int,LL> mpbuy,mpsell;
map<int,LL>::iterator it;
int n = orders.size();
for( int i = 0 ; i < n ; i++ ) {
if(orders[i][2] == 0) {... | 34.457143 | 63 | 0.307214 | [
"vector"
] |
b27bb6379dfb02d2799c0c597a9a14d8269ec1dd | 6,677 | cpp | C++ | src/main/cpp/linux/desktopicons.cpp | ghedlund/desktopicons | ddcf892e1ca267ac36d3dd646441a534451372ee | [
"Apache-2.0"
] | null | null | null | src/main/cpp/linux/desktopicons.cpp | ghedlund/desktopicons | ddcf892e1ca267ac36d3dd646441a534451372ee | [
"Apache-2.0"
] | null | null | null | src/main/cpp/linux/desktopicons.cpp | ghedlund/desktopicons | ddcf892e1ca267ac36d3dd646441a534451372ee | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2012-2018 Gregory Hedlund
*
* 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 ... | 29.675556 | 109 | 0.731616 | [
"object"
] |
b28196f28313df289cea6f2c2151059ef94b5479 | 4,940 | cpp | C++ | src/FileReader.cpp | Spoock01/The-Capacitated-Vehicle-Routing-Problem | 0f05acbf02020a2f7761f2ebe4afdd6bef609304 | [
"MIT"
] | 1 | 2019-09-25T18:20:57.000Z | 2019-09-25T18:20:57.000Z | src/FileReader.cpp | Spoock01/The-Capacitated-Vehicle-Routing-Problem | 0f05acbf02020a2f7761f2ebe4afdd6bef609304 | [
"MIT"
] | null | null | null | src/FileReader.cpp | Spoock01/The-Capacitated-Vehicle-Routing-Problem | 0f05acbf02020a2f7761f2ebe4afdd6bef609304 | [
"MIT"
] | 2 | 2019-09-10T03:58:03.000Z | 2020-02-20T17:32:56.000Z | #include "../include/FileReader.h"
#include <time.h>
#include <cmath>
#include "../include/ConstructiveHeuristic.h"
#include "../include/Graph.h"
#include "../include/Grasp.h"
#include "../include/Helper.h"
#include "../include/MovementHeuristic.h"
int DIMENSION;
int VEHICLE;
int CAPACITY;
int g_distance = 0;
std::ifs... | 27.597765 | 91 | 0.484615 | [
"vector"
] |
b282742f05d0c4ce39434fb9224d0cb68a0f8021 | 7,656 | cpp | C++ | Dalton/Filters.cpp | DaltonLens/DaltonLens | 65f8655d5fe0166d41ae91d145a219f4796acc45 | [
"BSD-2-Clause"
] | 7 | 2018-02-05T23:29:13.000Z | 2021-11-23T08:53:12.000Z | Dalton/Filters.cpp | DaltonLens/DaltonLens | 65f8655d5fe0166d41ae91d145a219f4796acc45 | [
"BSD-2-Clause"
] | 9 | 2018-05-01T18:27:52.000Z | 2022-03-19T00:32:33.000Z | Dalton/Filters.cpp | DaltonLens/DaltonLens | 65f8655d5fe0166d41ae91d145a219f4796acc45 | [
"BSD-2-Clause"
] | 1 | 2020-04-04T17:02:17.000Z | 2020-04-04T17:02:17.000Z | //
// Copyright (c) 2017, Nicolas Burrus
// This software may be modified and distributed under the terms
// of the BSD license. See the LICENSE file for details.
//
#include "Filters.h"
#include <Dalton/OpenGL.h>
#include <Dalton/OpenGL_Shaders.h>
#include <Dalton/Utils.h>
#include <Dalton/ColorConversion.h>
#incl... | 28.567164 | 156 | 0.624869 | [
"render"
] |
b287238d61774ff0fea09dc779d7f0b7a4959688 | 769 | cpp | C++ | test/container/tree/equal.cpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | test/container/tree/equal.cpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | test/container/tree/equal.cpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | // Copyright Carl Philipp Reh 2009 - 2018.
// 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 <fcppt/container/tree/comparison.hpp>
#include <fcppt/container/tree/object_impl.hpp>
#in... | 13.491228 | 61 | 0.663199 | [
"object"
] |
b287810bd8d521baf6de3ce096fc61fd37de6e47 | 14,212 | cxx | C++ | private/inet/xml/core/util/hashtable.cxx | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | 11 | 2017-09-02T11:27:08.000Z | 2022-01-02T15:25:24.000Z | private/inet/xml/core/util/hashtable.cxx | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | null | null | null | private/inet/xml/core/util/hashtable.cxx | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | 14 | 2019-01-16T01:01:23.000Z | 2022-02-20T15:54:27.000Z | /*
*
* Copyright (c) 1998,1999 Microsoft Corporation. All rights reserved.
* EXEMPT: copyright change only, no build required
*
*/
#include "core.hxx"
#pragma hdrstop
#include "core/util/hashtable.hxx"
Enumeration * HashtableEnumerator::newHashtableEnumerator(
Hashtable *table, EnumType en... | 24.933333 | 88 | 0.517943 | [
"object"
] |
b2888d4645c486ed5031ad0c96141317c05c5a7d | 12,193 | cpp | C++ | src/physics/rigid_body_problem.cpp | ipc-sim/rigid-ipc | d839af457236e7363b14c2e482a01d8160fa447e | [
"MIT"
] | 71 | 2021-09-08T13:16:43.000Z | 2022-03-27T10:23:33.000Z | src/physics/rigid_body_problem.cpp | ipc-sim/rigid-ipc | d839af457236e7363b14c2e482a01d8160fa447e | [
"MIT"
] | 4 | 2021-09-08T00:16:20.000Z | 2022-01-05T17:44:08.000Z | src/physics/rigid_body_problem.cpp | ipc-sim/rigid-ipc | d839af457236e7363b14c2e482a01d8160fa447e | [
"MIT"
] | 2 | 2021-09-18T15:15:38.000Z | 2021-09-21T15:15:38.000Z | #include "rigid_body_problem.hpp"
#include <iostream>
#include <tbb/parallel_for_each.h>
#include <finitediff.hpp>
#include <igl/PI.h>
#include <igl/predicates/segment_segment_intersect.h>
#include <ipc/utils/intersection.hpp>
#include <ccd/rigid/broad_phase.hpp>
#include <ccd/rigid/rigid_body_hash_grid.hpp>
#incl... | 33.589532 | 80 | 0.606988 | [
"geometry",
"vector",
"3d"
] |
b2910fa2d2f9ae048b759934004f548e8da2718f | 15,095 | cpp | C++ | ks/KsEventLoop.cpp | preet/kscore | 5460cb12d60f10bb07ca1a7f07b02730b5d94a12 | [
"Apache-2.0"
] | 3 | 2015-12-12T01:39:25.000Z | 2018-04-24T00:02:16.000Z | ks/KsEventLoop.cpp | preet/kscore | 5460cb12d60f10bb07ca1a7f07b02730b5d94a12 | [
"Apache-2.0"
] | null | null | null | ks/KsEventLoop.cpp | preet/kscore | 5460cb12d60f10bb07ca1a7f07b02730b5d94a12 | [
"Apache-2.0"
] | 4 | 2017-01-13T10:07:13.000Z | 2018-09-27T06:43:18.000Z | /*
Copyright (C) 2015 Preet Desai (preet.desai@gmail.com)
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applic... | 26.669611 | 85 | 0.499304 | [
"object"
] |
b29e30214f8f86e25432271431fdb7abb4f876c4 | 4,989 | cpp | C++ | hackathon/xiaoxiaol/consensus_skeleton_2/kd-tree.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | 1 | 2021-12-27T19:14:03.000Z | 2021-12-27T19:14:03.000Z | hackathon/xiaoxiaol/consensus_skeleton_2/kd-tree.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | 1 | 2016-12-03T05:33:13.000Z | 2016-12-03T05:33:13.000Z | hackathon/xiaoxiaol/consensus_skeleton_2/kd-tree.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | null | null | null | #include "kd-tree.h"
#include "color_xyz.h"
using namespace std;
ANNkd_tree *nt_to_kdt(NeuronTree nt, int nPts)
{
const int dim = 3;
ANNpointArray kd_pts = annAllocPts(nPts, dim);
//add all points from the neuron tree to the ANN point array
for (int m = 0; m < nPts; ++m) {
//hard-coded for 3D
... | 25.454082 | 152 | 0.538384 | [
"3d"
] |
b2a81bf65bb9df8175de3f09dce2c0cd5a13d88b | 20,243 | cpp | C++ | IntervalManagement/IMKinematicTimeBasedMaintain.cpp | mitre/im_sample_algorithm | c49038f56faf05e15484ac9b01526fd6a0a8169f | [
"Apache-2.0"
] | null | null | null | IntervalManagement/IMKinematicTimeBasedMaintain.cpp | mitre/im_sample_algorithm | c49038f56faf05e15484ac9b01526fd6a0a8169f | [
"Apache-2.0"
] | 8 | 2020-01-27T14:12:50.000Z | 2021-08-10T14:41:41.000Z | IntervalManagement/IMKinematicTimeBasedMaintain.cpp | mitre/im_sample_algorithm | c49038f56faf05e15484ac9b01526fd6a0a8169f | [
"Apache-2.0"
] | 1 | 2019-11-07T08:31:17.000Z | 2019-11-07T08:31:17.000Z | // ****************************************************************************
// NOTICE
//
// This is the copyright work of The MITRE Corporation, and was produced
// for the U. S. Government under Contract Number DTFAWA-10-C-00080, and
// is subject to Federal Aviation Administration Acquisition Management
// System... | 56.074792 | 147 | 0.624315 | [
"vector"
] |
b2accd5334da142c4c8be7a814e48ec34ca9fd0a | 1,329 | cpp | C++ | gdip/core/src/opendubins/dubins3D.cpp | jarajanos/gdip | 5b56268d8eef2b2a845e3e1433ffa2b1f09b7726 | [
"BSD-2-Clause"
] | null | null | null | gdip/core/src/opendubins/dubins3D.cpp | jarajanos/gdip | 5b56268d8eef2b2a845e3e1433ffa2b1f09b7726 | [
"BSD-2-Clause"
] | null | null | null | gdip/core/src/opendubins/dubins3D.cpp | jarajanos/gdip | 5b56268d8eef2b2a845e3e1433ffa2b1f09b7726 | [
"BSD-2-Clause"
] | null | null | null | /**
* @file dubins3D.cpp
* @author Jaroslav Janos (janosjar@fel.cvut.cz)
* @brief
* @version 1.0
* @date 04. 02. 2022
*
* @copyright Copyright (c) 2022
*
*/
#include "dubins3D.h"
namespace opendubins
{
Dubins3D::Dubins3D() : radiusMin{GDIP_NAN}, maxPitch{GDIP_NAN}, minPitch{GDIP_NAN},
length{std::nu... | 26.058824 | 95 | 0.62152 | [
"3d"
] |
b2af6a6b0f249fc98e89b9f0d2c3eb07c20da5e8 | 1,357 | hpp | C++ | src/Record.hpp | ddovod/libkvs | 81497d95541a1581bdeefd68b55ede61e8b6683c | [
"MIT"
] | null | null | null | src/Record.hpp | ddovod/libkvs | 81497d95541a1581bdeefd68b55ede61e8b6683c | [
"MIT"
] | null | null | null | src/Record.hpp | ddovod/libkvs | 81497d95541a1581bdeefd68b55ede61e8b6683c | [
"MIT"
] | null | null | null |
#pragma once
#include <cstdint>
#include <vector>
#include "ValueType.hpp"
namespace kvs
{
/** A low level value record. */
class Record
{
public:
Record() = default;
Record(ValueType valueType,
const std::vector<uint8_t>& rawValue,
int64_t creationTimestampMs,... | 30.155556 | 84 | 0.638909 | [
"vector"
] |
b2b18de79bb23154461fc593fcf922a57b0ac6eb | 4,612 | cc | C++ | src/renderer/renderer.cc | DoCGameDev/RPG-Engine | a2553f25c801816e37a3499c39f9ed2d15a32f39 | [
"MIT"
] | 1 | 2019-04-22T09:09:53.000Z | 2019-04-22T09:09:53.000Z | src/renderer/renderer.cc | JamesLinus/RPG-Engine | a2553f25c801816e37a3499c39f9ed2d15a32f39 | [
"MIT"
] | null | null | null | src/renderer/renderer.cc | JamesLinus/RPG-Engine | a2553f25c801816e37a3499c39f9ed2d15a32f39 | [
"MIT"
] | 1 | 2016-03-07T12:19:20.000Z | 2016-03-07T12:19:20.000Z | // This file is part of the :(){ :|:& };:'s project
// Licensing information can be found in the LICENSE file
// (C) 2014 :(){ :|:& };:. All rights reserved.
#include "sys/common.h"
// -----------------------------------------------------------------------------
CVar Renderer::vpWidth("vpWidth", CVAR_INT, "800", "Widt... | 24.795699 | 80 | 0.501518 | [
"mesh",
"render"
] |
b2b88b15232c55f8c13f9e8b55757aad31106972 | 21,928 | cpp | C++ | src/spec_miaf_brands.cpp | y-guyon/ComplianceWarden | 7315f1266b083a1cd958eae9ce7c8f07a8a6ad2d | [
"BSD-3-Clause"
] | 3 | 2020-01-02T17:30:16.000Z | 2021-09-27T18:32:18.000Z | src/spec_miaf_brands.cpp | y-guyon/ComplianceWarden | 7315f1266b083a1cd958eae9ce7c8f07a8a6ad2d | [
"BSD-3-Clause"
] | 34 | 2020-01-22T01:41:22.000Z | 2021-12-09T13:20:33.000Z | src/spec_miaf_brands.cpp | y-guyon/ComplianceWarden | 7315f1266b083a1cd958eae9ce7c8f07a8a6ad2d | [
"BSD-3-Clause"
] | 2 | 2020-11-05T01:41:08.000Z | 2021-11-19T13:12:35.000Z | #include "spec.h"
#include "fourcc.h"
#include <algorithm> // std::find
#include <cstring>
#include <map>
bool isVisualSampleEntry(uint32_t fourcc);
bool checkRuleSection(const SpecDesc& spec, const char* section, Box const& root);
const std::initializer_list<RuleDesc> getRulesMiafBrands(const SpecDesc& spec)
{
sta... | 42.911937 | 201 | 0.530281 | [
"vector"
] |
b2bbf15e68506d57cd8b64bcf387e5e25cdb87ef | 4,876 | cpp | C++ | Tool Jump/main.cpp | Barry0310/Tool-jump-Game-in-cpp | b54bd672045e9dfd2156074255ada3073f553d3f | [
"MIT"
] | null | null | null | Tool Jump/main.cpp | Barry0310/Tool-jump-Game-in-cpp | b54bd672045e9dfd2156074255ada3073f553d3f | [
"MIT"
] | null | null | null | Tool Jump/main.cpp | Barry0310/Tool-jump-Game-in-cpp | b54bd672045e9dfd2156074255ada3073f553d3f | [
"MIT"
] | null | null | null | #include <SFML/Graphics.hpp>
#include <math.h>
#include <stdlib.h>
#include <time.h>
#include <vector>
#include "Player.h"
#include "platform.h"
#include "Menu.h"
int main()
{
srand(time(0));
sf::RenderWindow window(sf::VideoMode(400.0f,600.0f),"Tool Jump",sf::Style::Close);
sf::RectangleShape background(s... | 30.098765 | 143 | 0.431501 | [
"vector"
] |
b2c230a15ed71b41a1453834cec6963349ca1903 | 2,965 | cpp | C++ | plaidml/bridge/openvino/tests/functional/shared_tests_instances/single_layer_tests/psroi_pooling.cpp | IsolatedMy/plaidml | 34538a9224e770fd79151105399d8d7ea08678c0 | [
"Apache-2.0"
] | null | null | null | plaidml/bridge/openvino/tests/functional/shared_tests_instances/single_layer_tests/psroi_pooling.cpp | IsolatedMy/plaidml | 34538a9224e770fd79151105399d8d7ea08678c0 | [
"Apache-2.0"
] | 65 | 2020-08-24T07:41:09.000Z | 2021-07-19T09:13:49.000Z | plaidml/bridge/openvino/tests/functional/shared_tests_instances/single_layer_tests/psroi_pooling.cpp | Flex-plaidml-team/plaidml | 1070411a87b3eb3d94674d4d041ed904be3e7d87 | [
"Apache-2.0"
] | null | null | null | // Copyright (C) 2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include <vector>
#include "common_test_utils/test_constants.hpp"
#include "single_layer_tests/psroi_pooling.hpp"
using LayerTestsDefinitions::PSROIPoolingLayerTest;
namespace {
const std::vector<InferenceEngine::Precision> netPrecis... | 60.510204 | 103 | 0.382799 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.