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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
12e7da2b2de8bd46298e16ed9474a62f94fd3b57 | 548,660 | cpp | C++ | hphp/parser/hphp.tab.cpp | bauerj/hhvm | 6a6ba8ab941a08a7d0688c2eb222f6185c1b71fd | [
"PHP-3.01",
"Zend-2.0"
] | null | null | null | hphp/parser/hphp.tab.cpp | bauerj/hhvm | 6a6ba8ab941a08a7d0688c2eb222f6185c1b71fd | [
"PHP-3.01",
"Zend-2.0"
] | null | null | null | hphp/parser/hphp.tab.cpp | bauerj/hhvm | 6a6ba8ab941a08a7d0688c2eb222f6185c1b71fd | [
"PHP-3.01",
"Zend-2.0"
] | null | null | null | // @generated
/* A Bison parser, made by GNU Bison 2.4.1. */
/* Skeleton implementation for Bison's Yacc-like parsers in C
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
... | 39.841696 | 174 | 0.377004 | [
"shape",
"vector"
] |
12ec02db0a852d8107a6ae57d4a2823e75f9c30f | 17,133 | cc | C++ | bin/gearman.cc | xuyanjun/gearman | 36af368d6a0628f30f0654cc3ce2801c758ba292 | [
"BSD-3-Clause"
] | null | null | null | bin/gearman.cc | xuyanjun/gearman | 36af368d6a0628f30f0654cc3ce2801c758ba292 | [
"BSD-3-Clause"
] | null | null | null | bin/gearman.cc | xuyanjun/gearman | 36af368d6a0628f30f0654cc3ce2801c758ba292 | [
"BSD-3-Clause"
] | null | null | null | /* Gearman server and library
* Copyright (C) 2008 Brian Aker, Eric Day
* All rights reserved.
*
* Use and distribution licensed under the BSD license. See
* the COPYING file in the parent directory for full text.
*/
/**
* @file
* @brief Gearman Command Line Tool
*/
#include <config.h>
#include <assert.h>
... | 23.341962 | 100 | 0.549641 | [
"vector"
] |
12fe2259c5c834b33e03a266719e3f78f02e3ac3 | 981 | cpp | C++ | Leetcode/P17 电话号码的字母组合/sl.cpp | Wycers/Codelib | 86d83787aa577b8f2d66b5410e73102411c45e46 | [
"MIT"
] | 22 | 2018-08-07T06:55:10.000Z | 2021-06-12T02:12:19.000Z | Leetcode/P17 电话号码的字母组合/sl.cpp | Wycers/Codelib | 86d83787aa577b8f2d66b5410e73102411c45e46 | [
"MIT"
] | 28 | 2020-03-04T23:47:22.000Z | 2022-02-26T18:50:00.000Z | Leetcode/P17 电话号码的字母组合/sl.cpp | Wycers/Codelib | 86d83787aa577b8f2d66b5410e73102411c45e46 | [
"MIT"
] | 4 | 2019-11-09T15:41:26.000Z | 2021-10-10T08:56:57.000Z | /*
* @lc app=leetcode.cn id=17 lang=cpp
*
* [17] 电话号码的字母组合
*/
// #include <bits/stdc++.h>
// using namespace std;
class Solution {
public:
vector<string> table = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
vector<string> ans;
void work(string &digits, int now, string res)
{
/... | 24.525 | 86 | 0.482161 | [
"vector"
] |
42051a86fd3a7f1188f5ab5d3deb9ddfdf7f8c9c | 10,167 | cpp | C++ | src/GrainViewer/Behavior/ImpostorGrainRenderer.cpp | eliemichel/GrainViewer | 91d4922b3185ada90508f0944f2691ba8eba45e3 | [
"MIT"
] | 8 | 2020-12-14T13:14:22.000Z | 2021-12-11T20:04:54.000Z | src/GrainViewer/Behavior/ImpostorGrainRenderer.cpp | eliemichel/GrainViewer | 91d4922b3185ada90508f0944f2691ba8eba45e3 | [
"MIT"
] | null | null | null | src/GrainViewer/Behavior/ImpostorGrainRenderer.cpp | eliemichel/GrainViewer | 91d4922b3185ada90508f0944f2691ba8eba45e3 | [
"MIT"
] | 2 | 2020-12-16T10:02:15.000Z | 2021-03-16T16:06:19.000Z | /**
* This file is part of GrainViewer, the reference implementation of:
*
* Michel, Élie and Boubekeur, Tamy (2020).
* Real Time Multiscale Rendering of Dense Dynamic Stackings,
* Computer Graphics Forum (Proc. Pacific Graphics 2020), 39: 169-179.
* https://doi.org/10.1111/cgf.14135
*
* Copyright (c) 2... | 33.22549 | 126 | 0.723714 | [
"render",
"vector",
"transform"
] |
420ae8ec2a6cfe174ad97e5a187f72eb027de494 | 5,678 | cpp | C++ | core/src/vrex/PopulationManager.cpp | thiagofigcosta/V-REx | 1d89cca65b6572cd8c35969a6cc25dd596d52211 | [
"MIT"
] | null | null | null | core/src/vrex/PopulationManager.cpp | thiagofigcosta/V-REx | 1d89cca65b6572cd8c35969a6cc25dd596d52211 | [
"MIT"
] | null | null | null | core/src/vrex/PopulationManager.cpp | thiagofigcosta/V-REx | 1d89cca65b6572cd8c35969a6cc25dd596d52211 | [
"MIT"
] | null | null | null | #include "PopulationManager.hpp"
#include "NeuralGenome.hpp"
#include "HallOfFame.hpp"
PopulationManager::PopulationManager(GeneticAlgorithm &galg, SPACE_SEARCH space, function<float(Genome *self)> callback,int startPopulationSize, bool searchHighestFitness, bool useNeuralGenome, bool printDeltas,function<void(int pop... | 38.107383 | 344 | 0.620993 | [
"vector"
] |
420b59b1a3116b756868ee4292b47f2f18067011 | 16,261 | hpp | C++ | code/formatting.hpp | brunodccarvalho/competitive | 4177c439174fbe749293b9da3445ce7303bd23c2 | [
"MIT"
] | 7 | 2020-10-15T22:37:10.000Z | 2022-02-26T17:23:49.000Z | code/formatting.hpp | brunodccarvalho/competitive | 4177c439174fbe749293b9da3445ce7303bd23c2 | [
"MIT"
] | null | null | null | code/formatting.hpp | brunodccarvalho/competitive | 4177c439174fbe749293b9da3445ce7303bd23c2 | [
"MIT"
] | null | null | null | #pragma once
#include <bits/stdc++.h>
#include <fmt/format.h>
#include <fmt/ostream.h>
using namespace std;
using fmt::print;
using fmt::format;
string repeat(int n, const string& pat) {
string s;
for (int i = 0; i < n; i++)
s += pat;
return s;
}
string repeat(int n, const string& pat, const stri... | 30.973333 | 90 | 0.554455 | [
"vector"
] |
420e626f553b163e8184c2779e2245e638b44e19 | 954 | cpp | C++ | src/autopas/utils/Math.cpp | TheH0bbit/autopas_dem | d7761e6ba0f6353fb97ecf78fb60873a00e41e17 | [
"BSD-2-Clause"
] | null | null | null | src/autopas/utils/Math.cpp | TheH0bbit/autopas_dem | d7761e6ba0f6353fb97ecf78fb60873a00e41e17 | [
"BSD-2-Clause"
] | null | null | null | src/autopas/utils/Math.cpp | TheH0bbit/autopas_dem | d7761e6ba0f6353fb97ecf78fb60873a00e41e17 | [
"BSD-2-Clause"
] | null | null | null | /**
* @file Math.cpp
* @author Jan Nguyen
* @date 18.08.19
*/
#include "Math.h"
namespace autopas::utils::Math {
double normalPDF(double x) {
const double factor = 1. / std::sqrt(2 * M_PI);
return factor * std::exp(-x * x / 2.);
}
double normalCDF(double x) {
const double factor = -1. / std::sqrt(2);
re... | 23.268293 | 77 | 0.620545 | [
"vector"
] |
4212c32671d9b4dd3bb9f2eab7bbfba92305426f | 33,085 | cpp | C++ | source/librenderer/material_param.cpp | Lauvak/ray | 906d3991ddd232a7f78f0e51f29aeead008a139a | [
"BSD-3-Clause"
] | 113 | 2015-06-25T06:24:59.000Z | 2021-09-26T02:46:02.000Z | source/librenderer/material_param.cpp | Lauvak/ray | 906d3991ddd232a7f78f0e51f29aeead008a139a | [
"BSD-3-Clause"
] | 2 | 2015-05-03T07:22:49.000Z | 2017-12-11T09:17:20.000Z | source/librenderer/material_param.cpp | Lauvak/ray | 906d3991ddd232a7f78f0e51f29aeead008a139a | [
"BSD-3-Clause"
] | 17 | 2015-11-10T15:07:15.000Z | 2021-01-19T15:28:16.000Z | // +----------------------------------------------------------------------
// | Project : ray.
// | All rights reserved.
// +----------------------------------------------------------------------
// | Copyright (c) 2013-2017.
// +----------------------------------------------------------------------
// | * Redistributi... | 22.086115 | 110 | 0.73686 | [
"vector"
] |
42132d0308d37c083e4f692abd08703bb725a278 | 7,163 | cpp | C++ | DataBase/dslSQLiteQuery.cpp | TotteKarlsson/dsl | 3807cbe5f90a3cd495979eafa8cf5485367b634c | [
"BSD-2-Clause"
] | null | null | null | DataBase/dslSQLiteQuery.cpp | TotteKarlsson/dsl | 3807cbe5f90a3cd495979eafa8cf5485367b634c | [
"BSD-2-Clause"
] | null | null | null | DataBase/dslSQLiteQuery.cpp | TotteKarlsson/dsl | 3807cbe5f90a3cd495979eafa8cf5485367b634c | [
"BSD-2-Clause"
] | null | null | null | #pragma hdrstop
#include <string.h>
#include <cstring>
#include "sqlite/sqlite3.h"
#include "dslSQLite.h"
#include "dslSQLiteException.h"
#include "dslSQLiteQuery.h"
//---------------------------------------------------------------------------
//
namespace dsl
{
SQLiteQuery::SQLiteQuery(const SQLiteQuery& rQuery)
{
... | 19.255376 | 92 | 0.622225 | [
"object"
] |
42164faf488a2100f90b59e2a5b6ed9f916e4a6b | 5,827 | cpp | C++ | sourceCode/dotNet4.6/wpf/src/printing/cpp/src/genericprinterlevelthunk.cpp | csoap/csoap.github.io | 2a8db44eb63425deff147652b65c5912f065334e | [
"Apache-2.0"
] | 5 | 2017-03-03T02:13:16.000Z | 2021-08-18T09:59:56.000Z | sourceCode/dotNet4.6/wpf/src/printing/cpp/src/genericprinterlevelthunk.cpp | 295007712/295007712.github.io | 25241dbf774427545c3ece6534be6667848a6faf | [
"Apache-2.0"
] | null | null | null | sourceCode/dotNet4.6/wpf/src/printing/cpp/src/genericprinterlevelthunk.cpp | 295007712/295007712.github.io | 25241dbf774427545c3ece6534be6667848a6faf | [
"Apache-2.0"
] | 4 | 2016-11-15T05:20:12.000Z | 2021-11-13T16:32:11.000Z | /*++
Copyright (C) 2002 - 2003 Microsoft Corporation
All rights reserved.
... | 21.906015 | 108 | 0.616097 | [
"object",
"model"
] |
4219d03d0f2834b0f971c300de4f2b0c343d7317 | 3,100 | cc | C++ | ios/chrome/browser/language/language_model_factory.cc | zipated/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 2,151 | 2020-04-18T07:31:17.000Z | 2022-03-31T08:39:18.000Z | ios/chrome/browser/language/language_model_factory.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 395 | 2020-04-18T08:22:18.000Z | 2021-12-08T13:04:49.000Z | ios/chrome/browser/language/language_model_factory.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 338 | 2020-04-18T08:03:10.000Z | 2022-03-29T12:33:22.000Z | // Copyright 2017 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 "ios/chrome/browser/language/language_model_factory.h"
#include "base/feature_list.h"
#include "components/keyed_service/core/keyed_service.h"
#... | 40.789474 | 80 | 0.786129 | [
"model"
] |
422376c96bfc34d5c5c2559f564f9dc40681bab0 | 8,245 | cpp | C++ | models/pulp/gpio/gpio_v2_impl.cpp | stmach/gvsoc | 4e3d30afe8205ffab5c5f460a915c50a10aed309 | [
"Apache-2.0"
] | null | null | null | models/pulp/gpio/gpio_v2_impl.cpp | stmach/gvsoc | 4e3d30afe8205ffab5c5f460a915c50a10aed309 | [
"Apache-2.0"
] | null | null | null | models/pulp/gpio/gpio_v2_impl.cpp | stmach/gvsoc | 4e3d30afe8205ffab5c5f460a915c50a10aed309 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2018 ETH Zurich and University of Bologna
*
* 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... | 28.828671 | 126 | 0.690722 | [
"vector"
] |
422483668e75cca32e5294b18c4d56ffe21fbdf3 | 3,507 | hpp | C++ | src/XMLUtils.hpp | guritchi/Vulkan-cpp-generator | 4dc556a11c0562bde2f460ae0436a284fadba1a8 | [
"MIT"
] | null | null | null | src/XMLUtils.hpp | guritchi/Vulkan-cpp-generator | 4dc556a11c0562bde2f460ae0436a284fadba1a8 | [
"MIT"
] | null | null | null | src/XMLUtils.hpp | guritchi/Vulkan-cpp-generator | 4dc556a11c0562bde2f460ae0436a284fadba1a8 | [
"MIT"
] | null | null | null | /*
MIT License
Copyright (c) 2021 guritchi
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, distr... | 29.225 | 78 | 0.658397 | [
"vector"
] |
4232c5d2aa3fbee5196896f51043152587fb8d1e | 5,623 | cpp | C++ | Codeforces/577/D.cpp | Mindjolt2406/Competitive-Programming | d000d98bf7005ee4fb809bcea2f110e4c4793b80 | [
"MIT"
] | 2 | 2018-12-11T14:37:24.000Z | 2022-01-23T18:11:54.000Z | Codeforces/577/D.cpp | Mindjolt2406/Competitive-Programming | d000d98bf7005ee4fb809bcea2f110e4c4793b80 | [
"MIT"
] | null | null | null | Codeforces/577/D.cpp | Mindjolt2406/Competitive-Programming | d000d98bf7005ee4fb809bcea2f110e4c4793b80 | [
"MIT"
] | null | null | null | /*
Rathin Bhargava
IIIT Bangalore
*/
#include<bits/stdc++.h>
#define mt make_tuple
#define mp make_pair
#define pu push_back
#define INF 1e15
#define MOD 1000000007
#define ll long long int
#define ld long double
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define pr(v) { for(int i=0;i<v.size(... | 30.069519 | 226 | 0.477325 | [
"vector"
] |
4234fe840aa18386d20197118eb8d3f4c91f88a0 | 15,009 | cpp | C++ | Tudat/Astrodynamics/Gravitation/UnitTests/unitTestGravityFieldVariations.cpp | J-Westin/tudat | 82ebe9e6e2dd51d0688b77960e62e980e6b8bcb8 | [
"BSD-3-Clause"
] | null | null | null | Tudat/Astrodynamics/Gravitation/UnitTests/unitTestGravityFieldVariations.cpp | J-Westin/tudat | 82ebe9e6e2dd51d0688b77960e62e980e6b8bcb8 | [
"BSD-3-Clause"
] | null | null | null | Tudat/Astrodynamics/Gravitation/UnitTests/unitTestGravityFieldVariations.cpp | J-Westin/tudat | 82ebe9e6e2dd51d0688b77960e62e980e6b8bcb8 | [
"BSD-3-Clause"
] | null | null | null | /* Copyright (c) 2010-2018, Delft University of Technology
* All rigths reserved
*
* This file is part of the Tudat. Redistribution and use in source and
* binary forms, with or without modification, are permitted exclusively
* under the terms of the Modified BSD license. You should have received
*... | 47.050157 | 141 | 0.679459 | [
"object",
"vector"
] |
423622905f70badff4783ca586e5bce9fd2e2ff0 | 18,014 | cc | C++ | src/scsi2sd-util6/ConfigUtil.cc | tweakoz/SCSI2SD-V6 | 77db5f86712213e25c9b12fa5c9fa9c54b80cb80 | [
"BSD-3-Clause"
] | 2 | 2020-11-29T01:28:03.000Z | 2021-11-07T18:23:11.000Z | src/scsi2sd-util6/ConfigUtil.cc | tweakoz/SCSI2SD-V6 | 77db5f86712213e25c9b12fa5c9fa9c54b80cb80 | [
"BSD-3-Clause"
] | null | null | null | src/scsi2sd-util6/ConfigUtil.cc | tweakoz/SCSI2SD-V6 | 77db5f86712213e25c9b12fa5c9fa9c54b80cb80 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (C) 2014 Michael McMaster <michael@codesrc.com>
//
// This file is part of SCSI2SD.
//
// SCSI2SD 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, or
// (at your ... | 27.170437 | 92 | 0.577218 | [
"geometry",
"vector",
"model"
] |
4237fe4cf9d783e4bff8397cc98501716e7d2d5c | 59,268 | hpp | C++ | include/Newtonsoft/Json/Linq/JContainer.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/Newtonsoft/Json/Linq/JContainer.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/Newtonsoft/Json/Linq/JContainer.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: Newtonsoft.Json.Linq.JToken
#includ... | 70.894737 | 317 | 0.754876 | [
"object",
"vector"
] |
424b98d86d6c23c14976a757289d1521c6199a1e | 869 | cpp | C++ | World/Space/SolarSystem.cpp | Cultrarius/QuestWeaver | 311016e3ec67c74221ef20d4eeff8904d8222135 | [
"Unlicense"
] | 57 | 2016-02-11T09:07:31.000Z | 2022-03-04T02:57:50.000Z | World/Space/SolarSystem.cpp | Cultrarius/QuestWeaver | 311016e3ec67c74221ef20d4eeff8904d8222135 | [
"Unlicense"
] | 1 | 2016-08-27T20:52:31.000Z | 2016-11-28T14:58:24.000Z | World/Space/SolarSystem.cpp | Cultrarius/QuestWeaver | 311016e3ec67c74221ef20d4eeff8904d8222135 | [
"Unlicense"
] | 10 | 2016-08-27T20:06:42.000Z | 2022-02-08T06:13:50.000Z | //
// Created by michael on 12.10.15.
//
#include <World/Space/SolarSystem.h>
using namespace weave;
using namespace std;
const string SolarSystem::Type = "solarSystem";
string SolarSystem::ToString() const noexcept {
return Name;
}
SolarSystem::SolarSystem(ID id, string name, int seed, shared_ptr<SpaceLocatio... | 27.15625 | 119 | 0.698504 | [
"vector"
] |
4255e2828c21d331b83beaf86a07b4cbdecc4c8b | 570 | cpp | C++ | Wegscheider/ex9/PrimeNumbers.cpp | appfs/appfs | 8cbbfa0e40e4d4a75a498ce8dd894bb2fbc3a9e3 | [
"MIT"
] | 11 | 2017-04-21T11:39:55.000Z | 2022-02-11T20:25:18.000Z | Wegscheider/ex9/PrimeNumbers.cpp | appfs/appfs | 8cbbfa0e40e4d4a75a498ce8dd894bb2fbc3a9e3 | [
"MIT"
] | 69 | 2017-04-26T09:30:38.000Z | 2017-08-01T11:31:21.000Z | Wegscheider/ex9/PrimeNumbers.cpp | appfs/appfs | 8cbbfa0e40e4d4a75a498ce8dd894bb2fbc3a9e3 | [
"MIT"
] | 53 | 2017-04-20T16:16:11.000Z | 2017-07-19T12:53:01.000Z | /**
* @file PrimeNumbers.cpp
* @author Fabian Wegscheider
* @date Jul 14, 2017
*/
#include "PrimeNumbers.h"
vector<int> PrimeNumbers::findPrimes(int n) {
vector<int> primes;
if (n >= 2) primes.push_back(2);
for (int i = 3; i < n; ++i) {
bool isPrime = true;
for (unsigned int j = 0; j < primes.size()... | 14.25 | 80 | 0.550877 | [
"vector"
] |
425697f71ae246d7e186202e1cf99ebee2f25563 | 7,619 | hpp | C++ | include/rtseis/transforms/continuousWavelet.hpp | bakerb845/rtseis | 7d1e9493e68c9d848daa5b5e89239cdfcddaa757 | [
"MIT"
] | 2 | 2021-03-27T17:26:06.000Z | 2022-02-02T16:55:10.000Z | include/rtseis/transforms/continuousWavelet.hpp | bakerb845/rtseis | 7d1e9493e68c9d848daa5b5e89239cdfcddaa757 | [
"MIT"
] | 1 | 2019-05-05T13:46:07.000Z | 2019-05-05T13:46:07.000Z | include/rtseis/transforms/continuousWavelet.hpp | bakerb845/rtseis | 7d1e9493e68c9d848daa5b5e89239cdfcddaa757 | [
"MIT"
] | 2 | 2019-11-19T06:32:35.000Z | 2020-12-11T04:20:38.000Z | #ifndef RTSEIS_TRANSFORMS_CONTINUOUSWAVELET_HPP
#define RTSEIS_TRANSFORMS_CONTINUOUSWAVELET_HPP 1
#include <memory>
namespace RTSeis::Transforms
{
namespace Wavelets
{
class IContinuousWavelet;
}
/// @class ContinuousWavelet continuousWavelet.hpp "include/rtseis/utilities/transforms/continuousWavelet.hpp"
/// @brief Co... | 46.742331 | 110 | 0.590891 | [
"vector",
"transform"
] |
42575c8210a52571ba1e7213855cb1b14ec42321 | 9,172 | cpp | C++ | pwiz/analysis/eharmony/MSIAMTData.cpp | austinkeller/pwiz | aa8e575cb40fd5e97cc7d922e4d8da44c9277cca | [
"Apache-2.0"
] | null | null | null | pwiz/analysis/eharmony/MSIAMTData.cpp | austinkeller/pwiz | aa8e575cb40fd5e97cc7d922e4d8da44c9277cca | [
"Apache-2.0"
] | null | null | null | pwiz/analysis/eharmony/MSIAMTData.cpp | austinkeller/pwiz | aa8e575cb40fd5e97cc7d922e4d8da44c9277cca | [
"Apache-2.0"
] | null | null | null | //
// $Id$
//
//
// Original author: Kate Hoff <katherine.hoff@proteowizard.org>
//
// Copyright 2009 Center for Applied Molecular Medicine
// University of Southern California, Los Angeles, CA
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with... | 35.276923 | 137 | 0.664741 | [
"vector"
] |
425e0c7c76cb08f4f6cd826391ba72bc6e11c03f | 1,724 | cpp | C++ | src/fft.cpp | rainlabs/stranger | c4a6eb325cdf0e9f892f9ea513aa8c2ddbe9c16b | [
"MIT"
] | 2 | 2015-06-22T02:53:39.000Z | 2017-05-30T02:32:19.000Z | src/fft.cpp | rainlabs/stranger | c4a6eb325cdf0e9f892f9ea513aa8c2ddbe9c16b | [
"MIT"
] | null | null | null | src/fft.cpp | rainlabs/stranger | c4a6eb325cdf0e9f892f9ea513aa8c2ddbe9c16b | [
"MIT"
] | null | null | null | /*
* File: fft.cpp
* Author: Vladimir Zyablitskiy <https://github.com/rainlabs>
*
* Created on 10 апреля 2014 г., 22:41
*/
#include "stranger/fft.hpp"
namespace Stranger {
Fft::Fft(SizeType size, SizeType windowType)
: mSize(size) {
mWindow = Window::get(size, windowType);
}
... | 24.985507 | 86 | 0.541183 | [
"vector"
] |
425e448ea90e5769bc234f70781f503240fc7dc0 | 1,411 | ipp | C++ | include/edfio/writer/impl/WriterHeaderSignals.ipp | idotta/edfio | 0c78877145dfe4bb67db174e622ed4e273527322 | [
"MIT"
] | 2 | 2019-04-25T05:27:38.000Z | 2020-01-10T13:30:09.000Z | include/edfio/writer/impl/WriterHeaderSignals.ipp | idotta/edfio | 0c78877145dfe4bb67db174e622ed4e273527322 | [
"MIT"
] | null | null | null | include/edfio/writer/impl/WriterHeaderSignals.ipp | idotta/edfio | 0c78877145dfe4bb67db174e622ed4e273527322 | [
"MIT"
] | 2 | 2017-12-13T18:28:11.000Z | 2020-09-17T14:04:31.000Z | //
// Copyright(c) 2017-present Iuri Dotta (dotta dot iuri at gmail dot com)
//
// This source code is licensed under the MIT license found in the
// LICENSE file in the root directory of this source tree.
//
// Official repository: https://github.com/idotta/edfio
//
#pragma once
#include "../../Utils.hpp"
#include "... | 23.915254 | 102 | 0.658398 | [
"vector"
] |
42656fdbaa789614a2ca6322b0b5886b9af603a9 | 11,944 | cpp | C++ | velox/experimental/codegen/ast/ASTNode.cpp | vancexu/velox | fa076fd9eab6ae4090ed9b9b91c4e7658d4ee1e4 | [
"Apache-2.0"
] | 672 | 2021-09-22T16:45:58.000Z | 2022-03-31T13:42:31.000Z | velox/experimental/codegen/ast/ASTNode.cpp | vancexu/velox | fa076fd9eab6ae4090ed9b9b91c4e7658d4ee1e4 | [
"Apache-2.0"
] | 986 | 2021-09-22T17:02:52.000Z | 2022-03-31T23:57:25.000Z | velox/experimental/codegen/ast/ASTNode.cpp | vancexu/velox | fa076fd9eab6ae4090ed9b9b91c4e7658d4ee1e4 | [
"Apache-2.0"
] | 178 | 2021-09-22T17:27:47.000Z | 2022-03-31T03:18:37.000Z | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* 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... | 30.943005 | 80 | 0.66795 | [
"vector"
] |
426657d45b5913d17451250be98eccd17e1993d5 | 6,883 | cpp | C++ | common/Noise/Initiator.cpp | ZmnSCPxj/cldcb | 4375d95cacee2a51fe5c4c1accc9fc616474bd41 | [
"MIT"
] | 9 | 2020-06-02T16:40:40.000Z | 2021-10-03T15:22:40.000Z | common/Noise/Initiator.cpp | ZmnSCPxj/cldcb | 4375d95cacee2a51fe5c4c1accc9fc616474bd41 | [
"MIT"
] | 2 | 2020-11-06T00:00:24.000Z | 2022-02-14T01:59:08.000Z | common/Noise/Initiator.cpp | ZmnSCPxj/cldcb | 4375d95cacee2a51fe5c4c1accc9fc616474bd41 | [
"MIT"
] | 2 | 2021-01-02T15:29:50.000Z | 2022-02-23T07:26:00.000Z | #include<algorithm>
#include<assert.h>
#include<stdexcept>
#include"Noise/Detail/Aead.hpp"
#include"Noise/Detail/HS.hpp"
#include"Noise/Encryptor.hpp"
#include"Noise/Initiator.hpp"
#include"Secp256k1/KeyPair.hpp"
#include"Secp256k1/PrivKey.hpp"
#include"Secp256k1/PubKey.hpp"
#include"Secp256k1/ecdh.hpp"
#include"Util/m... | 28.093878 | 101 | 0.598867 | [
"vector"
] |
4267c741f0c3de0aef4bf73b2bc217c07efb9888 | 2,492 | cpp | C++ | Kaminec/download/GameDownload.cpp | kaniol-lck/Kaminec | bdbb6645035d6124a3772742362e683938b389fb | [
"BSD-2-Clause"
] | 23 | 2017-06-23T11:58:27.000Z | 2022-03-05T06:58:49.000Z | Kaminec/download/GameDownload.cpp | kaniol-lck/Kaminec | bdbb6645035d6124a3772742362e683938b389fb | [
"BSD-2-Clause"
] | 4 | 2017-12-08T11:41:19.000Z | 2021-04-03T17:50:39.000Z | Kaminec/download/GameDownload.cpp | kaniol-lck/Kaminec | bdbb6645035d6124a3772742362e683938b389fb | [
"BSD-2-Clause"
] | 5 | 2019-02-19T13:03:42.000Z | 2021-11-04T13:58:04.000Z | #include "GameDownload.h"
#include "assistance/PathReplacer.h"
#include "exception/Exceptions.hpp"
#include <QFile>
#include <QJsonDocument>
GameDownload::GameDownload(QObject *parent) :
QObject(parent),
manifestFile_(PathReplacer::replace("<launcher>/version_manifest.json"))
{
proxyModel_.setSourceModel(&model_)... | 31.15 | 94 | 0.727929 | [
"object"
] |
426955611cdd481015f17108c8ddda2b477f2ef1 | 3,960 | cpp | C++ | 684.redundant_connection.cpp | liangwt/leetcode | 8f279343e975666a63ee531228c6836f20f199ca | [
"Apache-2.0"
] | 5 | 2019-09-12T05:23:44.000Z | 2021-11-15T11:19:39.000Z | 684.redundant_connection.cpp | liangwt/leetcode | 8f279343e975666a63ee531228c6836f20f199ca | [
"Apache-2.0"
] | 18 | 2019-09-23T13:11:06.000Z | 2019-11-09T11:20:17.000Z | 684.redundant_connection.cpp | liangwt/leetcode | 8f279343e975666a63ee531228c6836f20f199ca | [
"Apache-2.0"
] | null | null | null | /**
* In this problem, a tree is an undirected graph that is connected and has no cycles.
*
* The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, ..., N), with one additional edge added. The added edge has two different vertices chosen from 1 to N, and was not an edge that alre... | 23.712575 | 241 | 0.52197 | [
"vector"
] |
f11aa4cd7346f3fe0c918bffeaba32c51aecff85 | 2,272 | cpp | C++ | c++/_ClassProjects/Programming_Project_6/Programming_Project_6/Programming_Project_6_SladeA.cpp | Andrew-Slade/cplusplus-projects | e5c5ac610f51d139f5d097ea00ac136c6fe1c365 | [
"MIT"
] | null | null | null | c++/_ClassProjects/Programming_Project_6/Programming_Project_6/Programming_Project_6_SladeA.cpp | Andrew-Slade/cplusplus-projects | e5c5ac610f51d139f5d097ea00ac136c6fe1c365 | [
"MIT"
] | null | null | null | c++/_ClassProjects/Programming_Project_6/Programming_Project_6/Programming_Project_6_SladeA.cpp | Andrew-Slade/cplusplus-projects | e5c5ac610f51d139f5d097ea00ac136c6fe1c365 | [
"MIT"
] | null | null | null | /*
Andrew Slade
Programming Project 6
*/
//preprocessors
#pragma message ("Definitely not playing with the code") //REMOVE
#include "Header_SladeA.h"
#include <iomanip>
#include <iostream>
#include <stdexcept>
using namespace std;
//-------------
//Prototypes
void outputData(Tank object);
//----------... | 20.844037 | 66 | 0.53257 | [
"object"
] |
f12c38b10210627a4aac2bde5df5625e7d00affa | 4,555 | hpp | C++ | Source/Samples/61_SHLighting/NvRayTraversal/Scene.hpp | elix22/Urho3D | 99902ae2a867be0d6dbe4c575f9c8c318805ec64 | [
"MIT"
] | 20 | 2019-04-18T07:37:34.000Z | 2022-02-02T21:43:47.000Z | Source/Samples/61_SHLighting/NvRayTraversal/Scene.hpp | Lumak/Urho3D-1.4-SphericalHarmonicLighting | c236d5627404a3e0f9fa69221d4af716b436a0a7 | [
"MIT"
] | 11 | 2019-10-21T13:39:41.000Z | 2021-11-05T08:11:54.000Z | Source/Samples/61_SHLighting/NvRayTraversal/Scene.hpp | Lumak/Urho3D-1.4-SphericalHarmonicLighting | c236d5627404a3e0f9fa69221d4af716b436a0a7 | [
"MIT"
] | 4 | 2017-02-10T04:02:29.000Z | 2018-07-07T06:10:45.000Z | /*
* Copyright (c) 2009-2011, NVIDIA Corporation
* 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,... | 37.958333 | 96 | 0.582876 | [
"mesh",
"vector",
"3d"
] |
f1303665aaa8231577e8b765ffdefc6f95f7e1da | 69,074 | cpp | C++ | third_party/skia_m79/third_party/externals/angle2/src/libANGLE/renderer/vulkan/FramebufferVk.cpp | kniefliu/WindowsSamples | c841268ef4a0f1c6f89b8e95bf68058ea2548394 | [
"MIT"
] | null | null | null | third_party/skia_m79/third_party/externals/angle2/src/libANGLE/renderer/vulkan/FramebufferVk.cpp | kniefliu/WindowsSamples | c841268ef4a0f1c6f89b8e95bf68058ea2548394 | [
"MIT"
] | null | null | null | third_party/skia_m79/third_party/externals/angle2/src/libANGLE/renderer/vulkan/FramebufferVk.cpp | kniefliu/WindowsSamples | c841268ef4a0f1c6f89b8e95bf68058ea2548394 | [
"MIT"
] | null | null | null | //
// Copyright 2016 The ANGLE Project Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
// FramebufferVk.cpp:
// Implements the class methods for FramebufferVk.
//
#include "libANGLE/renderer/vulkan/FramebufferVk.h"
#include <v... | 41.990274 | 100 | 0.646481 | [
"render",
"object",
"vector",
"transform",
"3d"
] |
f13256a4cf3364416950713dabc73e481ccf59e2 | 1,915 | cpp | C++ | add-two-numbers.cpp | algorhythms/LeetCode-Cpp | b787f42d14aca781c0260f0961061f9dee887334 | [
"BSD-3-Clause"
] | 5 | 2017-06-15T06:44:15.000Z | 2020-04-29T02:23:03.000Z | add-two-numbers.cpp | aykutmayali/LeetCode-Cpp | b787f42d14aca781c0260f0961061f9dee887334 | [
"BSD-3-Clause"
] | null | null | null | add-two-numbers.cpp | aykutmayali/LeetCode-Cpp | b787f42d14aca781c0260f0961061f9dee887334 | [
"BSD-3-Clause"
] | 3 | 2016-08-12T17:11:50.000Z | 2019-10-16T05:28:32.000Z | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode *root = new ListNode(0), *p = l1, *q = l2, *cur = root;
int v =... | 21.761364 | 68 | 0.406789 | [
"vector"
] |
f1363192325d358a19bd9930073c58ba8814c786 | 2,255 | cpp | C++ | src/Core/nodes/NodeSpeedAcceleration.cpp | timmb/HarmonicMotion | 4ddf8ce98377260e57b6293d093a144a25ce3132 | [
"MIT"
] | 1 | 2018-07-20T03:56:15.000Z | 2018-07-20T03:56:15.000Z | src/Core/nodes/NodeSpeedAcceleration.cpp | timmb/HarmonicMotion | 4ddf8ce98377260e57b6293d093a144a25ce3132 | [
"MIT"
] | null | null | null | src/Core/nodes/NodeSpeedAcceleration.cpp | timmb/HarmonicMotion | 4ddf8ce98377260e57b6293d093a144a25ce3132 | [
"MIT"
] | null | null | null | #include "nodes/NodeSpeedAcceleration.h"
#include "Inlet.h"
#include "Outlet.h"
using namespace hm;
NodeSpeedAcceleration::NodeSpeedAcceleration(Node::Params params, std::string className)
: NodeUnthreaded(params, className, "Speed and Acceleration", "Calculate the speed, velocity and acceleration of values.")
, mLas... | 34.692308 | 186 | 0.736142 | [
"vector",
"3d"
] |
f137aa675a55489243181e3edf79fcce7d556418 | 909 | cpp | C++ | December-22/cpp_rohithmsr_closestServers.cpp | rohith-bare-on/A-December-of-Algorithms-2020 | aadc6fc59c9e2046a2803d42466991b7357e64dc | [
"MIT"
] | 1 | 2020-12-09T06:12:43.000Z | 2020-12-09T06:12:43.000Z | December-22/cpp_rohithmsr_closestServers.cpp | rohith-bare-on/A-December-of-Algorithms-2020 | aadc6fc59c9e2046a2803d42466991b7357e64dc | [
"MIT"
] | null | null | null | December-22/cpp_rohithmsr_closestServers.cpp | rohith-bare-on/A-December-of-Algorithms-2020 | aadc6fc59c9e2046a2803d42466991b7357e64dc | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int farthest(vector<int> dist)
{
int far = 0;
int max_distance = 0;
for (int i = 0; i < dist.size(); i++)
{
if (max_distance < dist[i])
{
max_distance = dist[i];
far = i;
}
... | 18.55102 | 95 | 0.50495 | [
"vector"
] |
f1394b86152506797d49f5bdadfef7d7bf11e2b9 | 5,237 | cc | C++ | src/preprocessor.cc | sc2020user/jstream | 7ee3dfcacfe7a72d37dca53615066a5f8f33ad3a | [
"BSD-4-Clause"
] | 1 | 2021-02-12T01:36:09.000Z | 2021-02-12T01:36:09.000Z | src/preprocessor.cc | HPCRL/jstream_SC2020_AE | 8b23036f01a46af426dba5bff78548cb0351161d | [
"BSD-4-Clause"
] | null | null | null | src/preprocessor.cc | HPCRL/jstream_SC2020_AE | 8b23036f01a46af426dba5bff78548cb0351161d | [
"BSD-4-Clause"
] | null | null | null | #ifndef PREPROCESSOR_CC
#define PREPROCESSOR_CC
#define rem_mm(X) if(X!= NULL) {_mm_free(X); X=NULL;}
#define rem(X) if(X!= NULL) {free(X); X=NULL;}
#include "../inc/preprocessor.h"
int SM_K = 8;
int SM_WIDTH = 64;
bool HIGH_SD = false;
int* pb = NULL;
int* didx = NULL;
int* d = NULL;
TYPE* dv = NULL;
int* dc = NUL... | 20.377432 | 102 | 0.582395 | [
"vector"
] |
f14dbe47cb6cfd7a13bf20d33e66a578ca10bbba | 2,973 | cpp | C++ | source/userspace/InterfaceKernelTraceCreatingImpl.cpp | mmkayPL/standalone-linux-io-tracer | 3ae9f135a68470692822e704795bdf75e8fd2293 | [
"BSD-3-Clause-Clear"
] | null | null | null | source/userspace/InterfaceKernelTraceCreatingImpl.cpp | mmkayPL/standalone-linux-io-tracer | 3ae9f135a68470692822e704795bdf75e8fd2293 | [
"BSD-3-Clause-Clear"
] | null | null | null | source/userspace/InterfaceKernelTraceCreatingImpl.cpp | mmkayPL/standalone-linux-io-tracer | 3ae9f135a68470692822e704795bdf75e8fd2293 | [
"BSD-3-Clause-Clear"
] | null | null | null | /*
* Copyright(c) 2012-2018 Intel Corporation
* SPDX-License-Identifier: BSD-3-Clause-Clear
*/
#include "InterfaceKernelTraceCreatingImpl.h"
#include <octf/interface/TraceManager.h>
#include <octf/plugin/NodePlugin.h>
#include <octf/proto/trace.pb.h>
#include <octf/trace/iotrace_event.h>
#include <octf/utils/Except... | 33.784091 | 78 | 0.647158 | [
"vector"
] |
f158bba8e224aedcefbef2d13c5aa13360a2871e | 1,237 | cpp | C++ | SWEA/P_1493/main.cpp | BeautifulBeer/algorithms | 88b845dd1853ef11a839a7acb36999cf25a46fef | [
"MIT"
] | null | null | null | SWEA/P_1493/main.cpp | BeautifulBeer/algorithms | 88b845dd1853ef11a839a7acb36999cf25a46fef | [
"MIT"
] | null | null | null | SWEA/P_1493/main.cpp | BeautifulBeer/algorithms | 88b845dd1853ef11a839a7acb36999cf25a46fef | [
"MIT"
] | null | null | null | #include <iostream>
#include <queue>
#include <vector>
#include <tuple>
#include <cmath>
using namespace std;
tuple<int, int> getRange(int num) {
int x = 0, y = 0;
x = (int)floor((1+sqrt(8*num-7))/2);
y = (int)ceil((sqrt(8*num+1)-1)/2);
return make_tuple(x, y);
}
int getValue(int x, int y) {
return (int)(pow(x ... | 25.244898 | 86 | 0.479386 | [
"vector"
] |
f15f404181bcbd5db742f3433e5c06c5462dbd40 | 1,717 | cpp | C++ | 01. Svn/Client/UserInterface/VS2008-2010/PythonCharacterManager.cpp | Vegas007/Metin2-Tab-Targeting-GF-v16.1- | 7143f756be43b18f0bd9ce82d0757b7c2501b0ce | [
"MIT"
] | 3 | 2018-06-21T16:42:02.000Z | 2021-10-19T19:32:59.000Z | 01. Svn/Client/UserInterface/VS2008-2010/PythonCharacterManager.cpp | Vegas007/Metin2-Tab-Targeting-GF-v16.1- | 7143f756be43b18f0bd9ce82d0757b7c2501b0ce | [
"MIT"
] | null | null | null | 01. Svn/Client/UserInterface/VS2008-2010/PythonCharacterManager.cpp | Vegas007/Metin2-Tab-Targeting-GF-v16.1- | 7143f756be43b18f0bd9ce82d0757b7c2501b0ce | [
"MIT"
] | 3 | 2019-05-05T22:45:17.000Z | 2020-10-07T21:08:03.000Z | //1.1 Search for:
m_v2PickedInstProjPos = D3DXVECTOR2(0.0f, 0.0f);
//1.1 Add after:
#if defined(ENABLE_TAB_NEXT_TARGET)
ResetTabNextTargetVectorIndex();
#endif
//1.2 Search for:
void CPythonCharacterManager::SelectInstance(DWORD VirtualID)
{
TCharacterInstanceMap::iterator itor = m_kAliveInstMap.find(VirtualID);
... | 26.015152 | 92 | 0.753058 | [
"vector"
] |
f1641a6f416e2f0d76c82ecae0e519e0cc512eff | 5,786 | cpp | C++ | utils/uai2fg.cpp | chang-liang/HadoopBNEM | dd90a70786271ebf5b0beda2484f8e476ab4a97a | [
"BSD-2-Clause"
] | 48 | 2015-01-19T18:56:28.000Z | 2021-12-30T20:30:50.000Z | utils/uai2fg.cpp | chang-liang/HadoopBNEM | dd90a70786271ebf5b0beda2484f8e476ab4a97a | [
"BSD-2-Clause"
] | 2 | 2016-01-18T08:17:38.000Z | 2021-04-28T18:08:38.000Z | utils/uai2fg.cpp | chang-liang/HadoopBNEM | dd90a70786271ebf5b0beda2484f8e476ab4a97a | [
"BSD-2-Clause"
] | 29 | 2015-04-07T07:38:25.000Z | 2022-02-01T22:18:58.000Z | /* This file is part of libDAI - http://www.libdai.org/
*
* Copyright (c) 2006-2011, The libDAI 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 <iostream>
#include <fstream>
#include <cstdlib>
#include <dai/alldai.... | 43.503759 | 156 | 0.503284 | [
"vector"
] |
f165e9dd4b291e89661bf3692bda6a30b941b9a0 | 5,917 | cc | C++ | algac/common/common_test.cc | algac/algac | 09323a8bb27c8ac6a69bf7a076df1e93bf997b56 | [
"MIT"
] | 1 | 2019-01-23T23:01:31.000Z | 2019-01-23T23:01:31.000Z | algac/common/common_test.cc | algac/algac | 09323a8bb27c8ac6a69bf7a076df1e93bf997b56 | [
"MIT"
] | null | null | null | algac/common/common_test.cc | algac/algac | 09323a8bb27c8ac6a69bf7a076df1e93bf997b56 | [
"MIT"
] | null | null | null | // Copyright (C) 2019-2021, YU
#include "algac/common/common.h"
#include <algorithm>
#include <atomic>
#include <deque>
#include <functional> // function
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include "algac/test_utils/test_utils.h"
#i... | 24.966245 | 77 | 0.531181 | [
"vector"
] |
f1688d7e4e645b84acd3b8dc5070eee5a270e3ab | 1,551 | cpp | C++ | Segment Trees/12086(Fenwick).cpp | enricava/Competitive-Programming | ea39f5c74acc2202f3933f693f6d7f03f5435391 | [
"MIT"
] | null | null | null | Segment Trees/12086(Fenwick).cpp | enricava/Competitive-Programming | ea39f5c74acc2202f3933f693f6d7f03f5435391 | [
"MIT"
] | null | null | null | Segment Trees/12086(Fenwick).cpp | enricava/Competitive-Programming | ea39f5c74acc2202f3933f693f6d7f03f5435391 | [
"MIT"
] | null | null | null | #include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <sstream>
using namespace std;
int caso = 0;
class FenwickTree {
vector<int> ft;
public:
FenwickTree(int n) { ft.assign(n + 1, 0); }
int getSum(int b) {
... | 17.426966 | 46 | 0.53256 | [
"vector"
] |
f169829d40c90ecca72fb54e2beee3a30dfc0119 | 2,687 | cpp | C++ | examples/mock_user_control.cpp | 5cript/dbus-glue | c53661a38f20fbc9d44a647ede385bdd02a1cd0d | [
"MIT"
] | 2 | 2020-10-05T18:42:17.000Z | 2021-08-16T19:10:33.000Z | examples/mock_user_control.cpp | 5cript/dbus-glue | c53661a38f20fbc9d44a647ede385bdd02a1cd0d | [
"MIT"
] | 3 | 2019-10-10T23:59:32.000Z | 2019-10-11T06:06:23.000Z | examples/mock_user_control.cpp | 5cript/dbus-glue | c53661a38f20fbc9d44a647ede385bdd02a1cd0d | [
"MIT"
] | null | null | null | #include <dbus-glue/dbus_interface.hpp>
#include <iostream>
#include <vector>
#include <string>
using namespace DBusGlue;
/**
* @brief The IAccounts interface. Its the provided interface (org.freedesktop.Accounts) as a C++ class.
*/
class IAccounts
{
public:
virtual ~IAccounts() = default;
virtual auto CacheUse... | 32.373494 | 142 | 0.68329 | [
"vector"
] |
f1795ac10282218e84cae1e41ef96d916e020390 | 27,976 | cpp | C++ | User/Editor/Source/Editor.cpp | CrystaLamb/SeagullEngine | 2a4d776ff525dcfef1eb5d8ea53abe3aa2f9a462 | [
"MIT"
] | 4 | 2021-12-10T10:28:19.000Z | 2021-12-29T05:39:17.000Z | User/Editor/Source/Editor.cpp | ILLmew/SeagullEngine | 2a4d776ff525dcfef1eb5d8ea53abe3aa2f9a462 | [
"MIT"
] | null | null | null | User/Editor/Source/Editor.cpp | ILLmew/SeagullEngine | 2a4d776ff525dcfef1eb5d8ea53abe3aa2f9a462 | [
"MIT"
] | null | null | null | #include "Seagull.h"
using namespace SG;
#define IMAGE_COUNT 2
#define COUNT_OF(a) (sizeof(a) / sizeof(a[0]))
struct Vertex
{
Vec3 Position;
Vec2 TexCoord;
static float GetStructSize()
{
return sizeof(Vertex);
}
};
struct UniformBuffer
{
Matrix4 model;
Matrix4 view;
Matrix4 projection;
};
char* ParserP... | 31.718821 | 160 | 0.739062 | [
"geometry",
"render",
"vector",
"model"
] |
f184752ff079aa974d4077995d730cb06e6efbe8 | 3,208 | cpp | C++ | src/masked_histogram.cpp | BetaRavener/ZPO-Histogram | 2ac39cf9a891190ea48f4413548426ade98c9ead | [
"MIT"
] | null | null | null | src/masked_histogram.cpp | BetaRavener/ZPO-Histogram | 2ac39cf9a891190ea48f4413548426ade98c9ead | [
"MIT"
] | null | null | null | src/masked_histogram.cpp | BetaRavener/ZPO-Histogram | 2ac39cf9a891190ea48f4413548426ade98c9ead | [
"MIT"
] | null | null | null | #include "masked_histogram.h"
using namespace std;
MaskedHistogram::MaskedHistogram(int maskIdx) :
_maskIdx(maskIdx)
{
}
void MaskedHistogram::compute(const GrayscaleImage& img, GrayscaleImage* mark_img)
{
clear_data();
int width = img.width()/3;
int height = img.height()/3;
width = round... | 25.870968 | 82 | 0.38217 | [
"vector"
] |
f188a5d0f68675f8675d1a2d9e838c57a5f7c692 | 12,724 | hpp | C++ | cozygrad/tensor/tensor.hpp | dpazj/cozygrad | a0baf76cf113fc372df32e259da9ed9732af99f8 | [
"MIT"
] | 5 | 2021-01-04T14:31:45.000Z | 2022-02-26T13:56:32.000Z | cozygrad/tensor/tensor.hpp | dpazj/YAAGE | a0baf76cf113fc372df32e259da9ed9732af99f8 | [
"MIT"
] | null | null | null | cozygrad/tensor/tensor.hpp | dpazj/YAAGE | a0baf76cf113fc372df32e259da9ed9732af99f8 | [
"MIT"
] | null | null | null | #pragma once
#include "../utils.hpp"
#include "tensor_shape.hpp"
#include "tensor_broadcasting_utils.hpp"
#include <initializer_list>
#include <memory>
#include <ostream>
#include <cstring>
#include <random>
#include <functional>
#include <algorithm>
namespace czy{
template <typename T>
class tensor
{
public:... | 25.861789 | 192 | 0.546919 | [
"shape",
"vector"
] |
f18ca2c3e66e456917e787031ef8556a25b26b55 | 5,643 | cpp | C++ | main.cpp | VokunGahrotLaas/brainfuck | 1f66357b59cbd92e6cb19860a1fa155ad698ea79 | [
"MIT"
] | null | null | null | main.cpp | VokunGahrotLaas/brainfuck | 1f66357b59cbd92e6cb19860a1fa155ad698ea79 | [
"MIT"
] | null | null | null | main.cpp | VokunGahrotLaas/brainfuck | 1f66357b59cbd92e6cb19860a1fa155ad698ea79 | [
"MIT"
] | null | null | null | // C++ std
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <stdexcept>
// C std
#include <cstdlib>
// project
#include "my_args_parser.hpp"
void transcompile(const MyArgsParser& parser, const std::string& bf_filename, const std:... | 33.589286 | 130 | 0.520822 | [
"vector"
] |
1af8edc9dd76abf66ec7b37ee8900d04fd87604e | 9,204 | cpp | C++ | source/src/level.cpp | soikkea/dungeoncrawler | 16cd9e6ecc1885bc5701a762a7d0564dc4effe7a | [
"MIT"
] | null | null | null | source/src/level.cpp | soikkea/dungeoncrawler | 16cd9e6ecc1885bc5701a762a7d0564dc4effe7a | [
"MIT"
] | null | null | null | source/src/level.cpp | soikkea/dungeoncrawler | 16cd9e6ecc1885bc5701a762a7d0564dc4effe7a | [
"MIT"
] | null | null | null | #include "level.h"
#include "globals.h"
#include "creature.h"
#include "bspdungeon.h"
#include "rng.h"
#include "player.h"
bool Level::load(const sf::Vector2u tileSize, const Map2D & map)
{
int width = map.width;
int height = map.height;
// Resize the vertex array to fit the level size
_vertices.setPrimitiveType... | 23.360406 | 99 | 0.631682 | [
"vector",
"transform"
] |
1aff01b9fced7ac174210143746f7e9d0311ba82 | 62,515 | cpp | C++ | src/eos.modules/eosmodule.input/EOSModuleDSO.cpp | ultimoistante/eos-multimedia-scripting | 8cbc98fd6a2d53cbb322156ea8e83883b4fda6bc | [
"MIT"
] | 1 | 2015-05-04T21:12:58.000Z | 2015-05-04T21:12:58.000Z | src/eos.modules/eosmodule.input/EOSModuleDSO.cpp | ultimoistante/eos-multimedia-scripting | 8cbc98fd6a2d53cbb322156ea8e83883b4fda6bc | [
"MIT"
] | null | null | null | src/eos.modules/eosmodule.input/EOSModuleDSO.cpp | ultimoistante/eos-multimedia-scripting | 8cbc98fd6a2d53cbb322156ea8e83883b4fda6bc | [
"MIT"
] | null | null | null | /*
-----------------------------------------------------------------------------
This source file is part of EOS Multimedia Scripting System
For the latest info, see https://github.com/ultimoistante/eos-multimedia-scripting
The MIT License (MIT)
Copyright (c) 2014-2019 of Salvatore Carotenuto aka ultimoistante... | 113.047016 | 371 | 0.569335 | [
"vector"
] |
2105b6e561e1c3f156e6f72a6678182c4eb31c8d | 6,930 | cpp | C++ | Algorithms/1001.GridIllumination/solution.cpp | stdstring/leetcode | 84e6bade7d6fc1a737eb6796cb4e2565440db5e3 | [
"MIT"
] | null | null | null | Algorithms/1001.GridIllumination/solution.cpp | stdstring/leetcode | 84e6bade7d6fc1a737eb6796cb4e2565440db5e3 | [
"MIT"
] | null | null | null | Algorithms/1001.GridIllumination/solution.cpp | stdstring/leetcode | 84e6bade7d6fc1a737eb6796cb4e2565440db5e3 | [
"MIT"
] | null | null | null | #include <unordered_set>
#include <vector>
#include "gtest/gtest.h"
namespace
{
class Solution
{
public:
std::vector<int> gridIllumination(int n, std::vector<std::vector<int>> const &lamps, std::vector<std::vector<int>> const &queries) const
{
const size_t rowMax = static_cast<size_t>(n) - 1;
... | 48.461538 | 198 | 0.616162 | [
"vector"
] |
210a30e6a5c2009003a5fbfab9db63d9bbd0965f | 3,489 | cpp | C++ | lib/djvImage/DataFunc.cpp | pafri/DJV | 9db15673b6b03ad3743f57119118261b1fbe8810 | [
"BSD-3-Clause"
] | null | null | null | lib/djvImage/DataFunc.cpp | pafri/DJV | 9db15673b6b03ad3743f57119118261b1fbe8810 | [
"BSD-3-Clause"
] | null | null | null | lib/djvImage/DataFunc.cpp | pafri/DJV | 9db15673b6b03ad3743f57119118261b1fbe8810 | [
"BSD-3-Clause"
] | null | null | null | // SPDX-License-Identifier: BSD-3-Clause
// Copyright (c) 2004-2020 Darby Johnston
// All rights reserved.
#include <djvImage/DataFunc.h>
#include <djvImage/Color.h>
#include <djvImage/Data.h>
namespace djv
{
namespace Image
{
namespace
{
template<typename T, typename T2>
... | 39.647727 | 118 | 0.472342 | [
"vector"
] |
21181b94cb638fee9c7624f482bb28f64afac61b | 19,894 | cc | C++ | systems/analysis/test_utilities/test/spring_mass_system_test.cc | RobotLocomotion/drake-python3.7 | ae397a4c6985262d23e9675b9bf3927c08d027f5 | [
"BSD-3-Clause"
] | 2 | 2021-02-25T02:01:02.000Z | 2021-03-17T04:52:04.000Z | systems/analysis/test_utilities/test/spring_mass_system_test.cc | RobotLocomotion/drake-python3.7 | ae397a4c6985262d23e9675b9bf3927c08d027f5 | [
"BSD-3-Clause"
] | null | null | null | systems/analysis/test_utilities/test/spring_mass_system_test.cc | RobotLocomotion/drake-python3.7 | ae397a4c6985262d23e9675b9bf3927c08d027f5 | [
"BSD-3-Clause"
] | 1 | 2021-06-13T12:05:39.000Z | 2021-06-13T12:05:39.000Z | #include "drake/systems/analysis/test_utilities/spring_mass_system.h"
#include <memory>
#include <Eigen/Dense>
#include <gtest/gtest.h>
#include "drake/common/test_utilities/eigen_matrix_compare.h"
#include "drake/systems/framework/fixed_input_port_value.h"
#include "drake/systems/framework/state.h"
#include "drake/... | 39.238659 | 80 | 0.7169 | [
"vector"
] |
2121f62b626d10c06a64926d49d0dd5cd8c3a4c3 | 5,547 | cpp | C++ | source/Board.cpp | gmusya/reversi | 3a3c6843e6ba925acf2c6e4156dd0045715afaaf | [
"MIT"
] | null | null | null | source/Board.cpp | gmusya/reversi | 3a3c6843e6ba925acf2c6e4156dd0045715afaaf | [
"MIT"
] | null | null | null | source/Board.cpp | gmusya/reversi | 3a3c6843e6ba925acf2c6e4156dd0045715afaaf | [
"MIT"
] | null | null | null | #include "Board.h"
Board::Board(int32_t depth) : depth_(depth), last_move_(-2, -2) {
state_.resize(8, std::vector<char>(8, '*'));
PlacePiece(Cell(4, 3), 'o');
PlacePiece(Cell(3, 4), 'o');
PlacePiece(Cell(3, 3), 'x');
PlacePiece(Cell(4, 4), 'x');
player_ = Player::First;
print_board_mode_ = ... | 27.735 | 101 | 0.514512 | [
"vector"
] |
2126f3940f516142aa16b5d37f62eb8f941aade9 | 919 | cpp | C++ | templates/template-union.cpp | zhuhaijun753/cplusplus11.Examples | 30076615a88039084a4478e4ce091c00c3bfc9d6 | [
"Unlicense"
] | 59 | 2016-05-22T08:09:03.000Z | 2022-02-20T13:37:36.000Z | templates/template-union.cpp | zhuhaijun753/cplusplus11.Examples | 30076615a88039084a4478e4ce091c00c3bfc9d6 | [
"Unlicense"
] | 1 | 2017-10-26T11:40:43.000Z | 2017-10-26T15:14:04.000Z | templates/template-union.cpp | lostjared/cplusplus11.Examples | 30076615a88039084a4478e4ce091c00c3bfc9d6 | [
"Unlicense"
] | 15 | 2017-03-09T16:15:43.000Z | 2021-09-22T16:36:17.000Z | /* union templates */
#include<iostream>
template<typename T>
union DataArray {
T object;
unsigned char bytes[sizeof(T)];
};
template<typename T>
std::ostream &operator<<(std::ostream &out, const DataArray<T> &d) {
out << d.object;
return out;
}
int main() {
DataArray<unsigned int> value;
... | 17.339623 | 68 | 0.523395 | [
"object"
] |
212e16092aa63f2674f24a93e4bbc46854e3e5bf | 55,975 | cpp | C++ | Old Files/Chess.cpp | M1keZulu/CS217-CL217-ChessOOP | 4e18b1754695da28f8172bf7d323a1bbf4f6ce13 | [
"MIT"
] | 4 | 2021-05-31T13:26:06.000Z | 2021-05-31T16:53:34.000Z | Old Files/Chess.cpp | M1keZulu/CS217-CL217-ChessOOP | 4e18b1754695da28f8172bf7d323a1bbf4f6ce13 | [
"MIT"
] | null | null | null | Old Files/Chess.cpp | M1keZulu/CS217-CL217-ChessOOP | 4e18b1754695da28f8172bf7d323a1bbf4f6ce13 | [
"MIT"
] | 1 | 2021-05-31T15:19:41.000Z | 2021-05-31T15:19:41.000Z | #include<iostream>
#include<vector>
#include<fstream>
#include <SFML/System.hpp>
#include <SFML/Graphics.hpp>
#include<SFML/Network.hpp>
#include <SFML/Window.hpp>
#include <SFML/Audio.hpp>
#include<time.h>
#include<conio.h>
#include<sstream>
#define GRID 8
using namespace std;
//Data Types
enum PieceType{
king, que... | 32.299481 | 173 | 0.617097 | [
"vector"
] |
2140a6e55abc36c556a290feb62c39c966e9518d | 3,812 | inl | C++ | mini/crypto/cng/hash.inl | geralltf/mini-tor | 61d58749431fba970e19e0d35a53811956c69b16 | [
"MIT"
] | 380 | 2016-07-20T10:22:37.000Z | 2022-03-30T08:47:44.000Z | mini/crypto/cng/hash.inl | geralltf/mini-tor | 61d58749431fba970e19e0d35a53811956c69b16 | [
"MIT"
] | 24 | 2016-08-13T12:56:03.000Z | 2021-05-26T01:59:17.000Z | mini/crypto/cng/hash.inl | geralltf/mini-tor | 61d58749431fba970e19e0d35a53811956c69b16 | [
"MIT"
] | 105 | 2016-07-20T14:34:52.000Z | 2022-02-17T13:31:25.000Z | #include "hash.h"
#include "provider.h"
namespace mini::crypto::cng {
//
// constructors.
//
template <
hash_algorithm_type HASH_ALGORITHM
>
hash<HASH_ALGORITHM>::hash(
void
)
{
static constexpr auto alg_handle =
HASH_ALGORITHM == hash_algorithm_type::sha1 ? &provider::get_hash_sha1_handle :
nullptr;... | 14.171004 | 83 | 0.699108 | [
"object"
] |
2141cf1a21c700e9b3daa8b9229048f32ee21a2d | 10,592 | cc | C++ | cc/trees/ukm_manager.cc | sarang-apps/darshan_browser | 173649bb8a7c656dc60784d19e7bb73e07c20daa | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | cc/trees/ukm_manager.cc | sarang-apps/darshan_browser | 173649bb8a7c656dc60784d19e7bb73e07c20daa | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | cc/trees/ukm_manager.cc | sarang-apps/darshan_browser | 173649bb8a7c656dc60784d19e7bb73e07c20daa | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | // Copyright 2017 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 "cc/trees/ukm_manager.h"
#include "cc/metrics/throughput_ukm_reporter.h"
#include "services/metrics/public/cpp/ukm_builders.h"
#include "service... | 36.398625 | 104 | 0.710347 | [
"vector"
] |
21479bb85ca217654be7c66e51347618b1e088ee | 9,437 | cpp | C++ | flextyper/src/finder.cpp | wassermanlab/OpenFlexTyper_restore | f599011a8f856bd81e73e5472d50980b4695055c | [
"MIT"
] | 1 | 2020-02-20T20:01:38.000Z | 2020-02-20T20:01:38.000Z | flextyper/src/finder.cpp | wassermanlab/OpenFlexTyper_restore | f599011a8f856bd81e73e5472d50980b4695055c | [
"MIT"
] | null | null | null | flextyper/src/finder.cpp | wassermanlab/OpenFlexTyper_restore | f599011a8f856bd81e73e5472d50980b4695055c | [
"MIT"
] | null | null | null | #include "finder.h"
#include <future>
namespace ft {
//======================================================================
Finder::Finder()
: _fmIndex(&_ownedFmIndex)
{
}
//======================================================================
void Finder::searchMonoIndex(ResultsMap& indexPosResults, const Kme... | 35.882129 | 132 | 0.476211 | [
"vector"
] |
21568e00b3c9b1e68c4cf92003645a1b344d5e93 | 2,763 | cpp | C++ | codeforces/DivC/Vacations/main.cpp | jeevanpuchakay/a2oj | f867e9b2ced6619be3ca6b1a1a1838107322782d | [
"MIT"
] | null | null | null | codeforces/DivC/Vacations/main.cpp | jeevanpuchakay/a2oj | f867e9b2ced6619be3ca6b1a1a1838107322782d | [
"MIT"
] | null | null | null | codeforces/DivC/Vacations/main.cpp | jeevanpuchakay/a2oj | f867e9b2ced6619be3ca6b1a1a1838107322782d | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
#define endl "\n"
vector<vector<ll>> adjlist;
ll max(ll x, ll y) { return (x > y) ? x : y; }
ll min(ll x, ll y) { return (x > y) ? y : x; }
ll min(ll x, ll y, ll z)
{
return min(x, min(y, z));
}
#define mod 1000000007
#... | 40.043478 | 145 | 0.585957 | [
"vector"
] |
2158262b1dc01d3613998afbeccac477a519ffe3 | 22,447 | hpp | C++ | examples/localizer_test/localizer_runner.hpp | deepguider/RoadGPS | 7db4669a54da98a854886b89b6922fb8c7a60f33 | [
"Apache-2.0",
"BSD-3-Clause"
] | 2 | 2019-05-22T12:47:34.000Z | 2019-05-23T15:43:47.000Z | examples/localizer_test/localizer_runner.hpp | deepguider/RoadGPS | 7db4669a54da98a854886b89b6922fb8c7a60f33 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | examples/localizer_test/localizer_runner.hpp | deepguider/RoadGPS | 7db4669a54da98a854886b89b6922fb8c7a60f33 | [
"Apache-2.0",
"BSD-3-Clause"
] | 1 | 2019-08-09T06:50:46.000Z | 2019-08-09T06:50:46.000Z | #ifndef __LOCALIZER_RUNNER__
#define __LOCALIZER_RUNNER__
#include "dg_localizer.hpp"
#include "localizer/data_loader.hpp"
#include "intersection_cls/intersection_localizer.hpp"
#include "vps/vps_localizer.hpp"
#include "roadlr/roadlr_localizer.hpp"
#include "ocr_recog/ocr_localizer.hpp"
#include "dg_roadtheta.hpp"
#i... | 43.501938 | 184 | 0.5517 | [
"vector"
] |
2158fc9319eea72843c5454649c83978a9af8249 | 4,869 | hpp | C++ | lumino/LuminoEngine/include/LuminoEngine/Scene/Physics/RigidBodyComponent.hpp | GameDevery/Lumino | abce2ddca4b7678b04dbfd0ae5348e196c3c9379 | [
"MIT"
] | 113 | 2020-03-05T01:27:59.000Z | 2022-03-28T13:20:51.000Z | lumino/LuminoEngine/include/LuminoEngine/Scene/Physics/RigidBodyComponent.hpp | GameDevery/Lumino | abce2ddca4b7678b04dbfd0ae5348e196c3c9379 | [
"MIT"
] | 35 | 2016-04-18T06:14:08.000Z | 2020-02-09T15:51:58.000Z | lumino/LuminoEngine/include/LuminoEngine/Scene/Physics/RigidBodyComponent.hpp | GameDevery/Lumino | abce2ddca4b7678b04dbfd0ae5348e196c3c9379 | [
"MIT"
] | 12 | 2020-12-21T12:03:59.000Z | 2021-12-15T02:07:49.000Z |
#pragma once
#include "../Common.hpp"
#include "../Component.hpp"
#include "../../Physics/RigidBody.hpp"
#include "../../Physics/TriggerBody.hpp"
namespace ln {
class Collision;
class RigidBodyComponent;
class RigidBodyComponent
: public Component
, protected detail::IPhysicsObjectEventListener
{
public:
static ... | 32.898649 | 125 | 0.751078 | [
"shape"
] |
215caea2f2dae8a8f116c15c1198c0291e65f537 | 6,325 | cpp | C++ | src/lib/monitor/MemoryInfo.cpp | SeeForward/SysMonitor | fdaac5eacf28b62739c4e050e27abd1fdbfd18c4 | [
"MIT"
] | 2 | 2017-06-28T02:46:10.000Z | 2018-03-16T09:07:34.000Z | src/lib/monitor/MemoryInfo.cpp | SeeForward/SysMonitor | fdaac5eacf28b62739c4e050e27abd1fdbfd18c4 | [
"MIT"
] | null | null | null | src/lib/monitor/MemoryInfo.cpp | SeeForward/SysMonitor | fdaac5eacf28b62739c4e050e27abd1fdbfd18c4 | [
"MIT"
] | 1 | 2021-12-09T08:03:39.000Z | 2021-12-09T08:03:39.000Z | #include "MemoryInfo.h"
#include "MemoryUsage.h"
#ifdef __WINDOWS__
# include <Windows.h>
# include <TlHelp32.h>
# include <Psapi.h>
# include <comdef.h>
# include <WbemIdl.h>
# include <sstream>
using std::stringstream;
#else
# include <unistd.h>
# include <stdio.h>
# include <string.h>
# include <dirent.h>
# inclu... | 21.153846 | 149 | 0.615968 | [
"vector"
] |
215cffbeb3d2582177a1c1500b3d5d637fcba84a | 4,606 | cpp | C++ | graph-source-code/237-E/2755611.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | graph-source-code/237-E/2755611.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | graph-source-code/237-E/2755611.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | //Language: GNU C++
/**
* ///////////////////////
* // MIN COST MAX FLOW //
* ///////////////////////
*
* Authors: Frank Chu, Igor Naverniouk
**/
/*********************
* Min cost max flow * (Edmonds-Karp relabelling + Dijkstra)
*********************
* Takes a directed graph where each edge has a ca... | 23.742268 | 74 | 0.548632 | [
"vector"
] |
215e70dfebe6acbac373638cc18edac1363a6e55 | 11,679 | cpp | C++ | src/Daq/ProcessFactory.cpp | dfreese/Gray | fa941c0767a021b3344a374d0ef584f4c758447b | [
"MIT"
] | 1 | 2018-08-26T05:07:57.000Z | 2018-08-26T05:07:57.000Z | src/Daq/ProcessFactory.cpp | dfreese/Gray | fa941c0767a021b3344a374d0ef584f4c758447b | [
"MIT"
] | null | null | null | src/Daq/ProcessFactory.cpp | dfreese/Gray | fa941c0767a021b3344a374d0ef584f4c758447b | [
"MIT"
] | null | null | null | /*
* Gray: A Ray Tracing-based Monte Carlo Simulator for PET
*
* Copyright (c) 2018, David Freese, Peter Olcott, Sam Buss, Craig Levin
*
* This software is distributed under the terms of the MIT License unless
* otherwise noted. See LICENSE for further details.
*
*/
#include "Gray/Daq/ProcessFactory.h"
#inclu... | 32.622905 | 80 | 0.567942 | [
"vector"
] |
215ffb59db6180390665eb7c0ac372f1c9496040 | 1,274 | cpp | C++ | src/Blank12.cpp | flyingLowSounds/1-Seifert | 07f6d0b34e753cf163e7e6fb74dbbc2af1e2c2f4 | [
"MIT",
"BSD-3-Clause"
] | 4 | 2021-04-01T16:14:47.000Z | 2022-03-21T13:08:12.000Z | src/Blank12.cpp | flyingLowSounds/1-Seifert | 07f6d0b34e753cf163e7e6fb74dbbc2af1e2c2f4 | [
"MIT",
"BSD-3-Clause"
] | null | null | null | src/Blank12.cpp | flyingLowSounds/1-Seifert | 07f6d0b34e753cf163e7e6fb74dbbc2af1e2c2f4 | [
"MIT",
"BSD-3-Clause"
] | 1 | 2021-09-20T11:38:24.000Z | 2021-09-20T11:38:24.000Z | //============================================================================================================
//!
//! \file Blank12.cpp
//!
//! \brief Blank 12 is a simple do nothing 12-hole high quality blank.
//!
//======================================================================================================... | 23.592593 | 110 | 0.510204 | [
"model"
] |
21660ba3bea9cba7ba5ccd87def42f8b1109144d | 4,535 | cpp | C++ | pyymatcher/accel.cpp | abdulniyaspm/pyymatcher | 840453082a69cbc2c993598c18d2591773976363 | [
"MIT"
] | 6 | 2019-07-13T11:56:14.000Z | 2021-12-27T07:09:10.000Z | pyymatcher/accel.cpp | abdulniyaspm/pyymatcher | 840453082a69cbc2c993598c18d2591773976363 | [
"MIT"
] | null | null | null | pyymatcher/accel.cpp | abdulniyaspm/pyymatcher | 840453082a69cbc2c993598c18d2591773976363 | [
"MIT"
] | null | null | null | #include <Python.h>
#include <iostream>
#include <string>
#include <vector>
#include <stdexcept>
using namespace std;
// The c++ string.substr method raise 'out of range exception' when the stop parameter
// exceeds the size of the string. But that is not we want in our case. We need empty string instead.
// This hel... | 29.640523 | 146 | 0.614994 | [
"object",
"vector"
] |
21781f97c7c139800433bb39e02903bdb5055699 | 1,623 | cpp | C++ | Tracking/Viterbi/Appearance.cpp | BrockFletcher/BaxterAlgorithms | aeecaa39a782878798036e6724ad5027b7062959 | [
"MIT"
] | 31 | 2019-02-22T00:43:47.000Z | 2022-03-30T13:39:50.000Z | Tracking/Viterbi/Appearance.cpp | BrockFletcher/BaxterAlgorithms | aeecaa39a782878798036e6724ad5027b7062959 | [
"MIT"
] | 17 | 2019-01-26T19:51:49.000Z | 2021-05-15T07:21:57.000Z | Tracking/Viterbi/Appearance.cpp | BrockFletcher/BaxterAlgorithms | aeecaa39a782878798036e6724ad5027b7062959 | [
"MIT"
] | 14 | 2019-10-18T23:08:49.000Z | 2022-02-01T21:39:29.000Z | #include "Appearance.h"
#include <assert.h>
#include <vector>
#include "CellNode.h"
#include "Detection.h"
#include "IdleState.h"
#include "LogStream.h"
#include "State.h"
#include "Tree.h"
Appearance::Appearance(IdleState *aStartState, Detection *aEndDetection, int aValue, int aNumScores, const double *aScore)
: Eve... | 35.282609 | 122 | 0.641405 | [
"vector"
] |
218dca3565e9f3a8b5340ada209bf560b8eec05d | 6,411 | hpp | C++ | Visitors/AcceptanceVisitors/CorrelationAcceptanceVisitor.hpp | jingtangliao/ff | d308fe62045e241a4822bb855df97ee087420d9b | [
"Apache-2.0"
] | 39 | 2015-01-01T07:59:51.000Z | 2021-10-01T18:11:46.000Z | Visitors/AcceptanceVisitors/CorrelationAcceptanceVisitor.hpp | jingtangliao/ff | d308fe62045e241a4822bb855df97ee087420d9b | [
"Apache-2.0"
] | 1 | 2019-04-24T09:56:15.000Z | 2019-04-24T14:45:46.000Z | Visitors/AcceptanceVisitors/CorrelationAcceptanceVisitor.hpp | jingtangliao/ff | d308fe62045e241a4822bb855df97ee087420d9b | [
"Apache-2.0"
] | 18 | 2015-01-11T15:10:23.000Z | 2022-02-24T20:02:10.000Z | /*=========================================================================
*
* Copyright David Doria 2012 daviddoria@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
*
*... | 43.317568 | 150 | 0.733271 | [
"vector"
] |
219518bb0f07c1d8d2383683fcc65cf0fabda8b1 | 33,540 | cpp | C++ | mozilla/gfx/layers/apz/util/APZCCallbackHelper.cpp | naver/webgraphics | 4f9b9aa6a13428b5872dd020eaf34ec77b33f240 | [
"MS-PL"
] | 5 | 2016-12-20T15:48:05.000Z | 2020-05-01T20:12:09.000Z | mozilla/gfx/layers/apz/util/APZCCallbackHelper.cpp | naver/webgraphics | 4f9b9aa6a13428b5872dd020eaf34ec77b33f240 | [
"MS-PL"
] | null | null | null | mozilla/gfx/layers/apz/util/APZCCallbackHelper.cpp | naver/webgraphics | 4f9b9aa6a13428b5872dd020eaf34ec77b33f240 | [
"MS-PL"
] | 2 | 2016-12-20T15:48:13.000Z | 2019-12-10T15:15:05.000Z | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* 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://mozilla.org/MPL/2.0/. */
#include "APZCCallbackHelper.h"
#... | 36.064516 | 125 | 0.688074 | [
"transform"
] |
219f5989205e15fd90b62ebae5319dc887cd3b8c | 41,605 | cpp | C++ | main.cpp | dradisavljevic/SFML-Chess | 7ffe1d32d882e13607f86f5f2bbfbea511bb5f7f | [
"MIT"
] | null | null | null | main.cpp | dradisavljevic/SFML-Chess | 7ffe1d32d882e13607f86f5f2bbfbea511bb5f7f | [
"MIT"
] | null | null | null | main.cpp | dradisavljevic/SFML-Chess | 7ffe1d32d882e13607f86f5f2bbfbea511bb5f7f | [
"MIT"
] | null | null | null | #include <SFML/Graphics.hpp>
#include <SFML/Audio.hpp>
#include <iostream>
#include <string>
using namespace sf;
// Chess piece structure.
struct chessSprite {
Sprite sprite;
int value;
bool isWhite;
int moves = 0;
};
// Size of each square.
int size = 113;
// Array of pieces
chessSprite f[32];
// Pieces p... | 36.336245 | 98 | 0.535008 | [
"render",
"shape"
] |
427739f92fd9e27bcefacdd74f9a8e31f7e99a3e | 10,911 | cpp | C++ | Sources/AGEngine/Render/GeometryManagement/DebugDrawManager.cpp | Another-Game-Engine/AGE | d5d9e98235198fe580a43007914f515437635830 | [
"MIT"
] | 47 | 2015-03-29T09:44:25.000Z | 2020-11-30T10:05:56.000Z | Sources/AGEngine/Render/GeometryManagement/DebugDrawManager.cpp | Another-Game-Engine/AGE | d5d9e98235198fe580a43007914f515437635830 | [
"MIT"
] | 313 | 2015-01-01T18:16:30.000Z | 2015-11-30T07:54:07.000Z | Sources/AGEngine/Render/GeometryManagement/DebugDrawManager.cpp | Another-Game-Engine/AGE | d5d9e98235198fe580a43007914f515437635830 | [
"MIT"
] | 9 | 2015-06-07T13:21:54.000Z | 2020-08-25T09:50:07.000Z | #include "DebugDrawManager.hpp"
#include <mutex>
#include <Utils/OpenGL.hh>
#include <Utils/StringID.hpp>
#include <Render/GeometryManagement/Painting/PaintingManager.hh>
#include <Render/GeometryManagement/SimpleGeometryManager.hpp>
#include <Threads/ThreadManager.hpp>
#include <Threads/MainThread.hpp>
inline AGE... | 36.249169 | 179 | 0.754193 | [
"render",
"vector",
"3d"
] |
428f30703bac06a7ed02f9f9ffdf8df2703295d0 | 7,854 | cpp | C++ | src/modules/gdgem/tests/ReferenceDataTest.cpp | ess-dmsc/event-formation-un | 62a2842ea7140162ab9625d22b96f6df369ec07c | [
"BSD-2-Clause"
] | 8 | 2017-12-02T09:20:26.000Z | 2022-03-28T08:17:40.000Z | src/modules/gdgem/tests/ReferenceDataTest.cpp | ess-dmsc/event-formation-un | 62a2842ea7140162ab9625d22b96f6df369ec07c | [
"BSD-2-Clause"
] | 296 | 2017-10-24T09:06:10.000Z | 2022-03-31T07:31:06.000Z | src/modules/gdgem/tests/ReferenceDataTest.cpp | ess-dmsc/event-formation-un | 62a2842ea7140162ab9625d22b96f6df369ec07c | [
"BSD-2-Clause"
] | 8 | 2018-04-08T15:35:50.000Z | 2021-04-12T05:06:15.000Z | /** Copyright (C) 2017 European Spallation Source ERIC */
#include <common/testutils/TestBase.h>
#include <common/reduction/clustering/GapClusterer.h>
#include <common/reduction/matching/GapMatcher.h>
#include <memory>
#include <gdgem/NMXConfig.h>
using namespace Gem;
static constexpr size_t min_cluster_size {3};
... | 27.75265 | 77 | 0.691113 | [
"vector"
] |
4295cf2d70618b239ad6820e7121db58dda94498 | 1,614 | cpp | C++ | PC_Clase8/3Sum.cpp | Angelussz/ProgramacionCompetitiva | 681c0aa21020d8e843108e77abcf2a62dd471dc5 | [
"BSD-3-Clause"
] | null | null | null | PC_Clase8/3Sum.cpp | Angelussz/ProgramacionCompetitiva | 681c0aa21020d8e843108e77abcf2a62dd471dc5 | [
"BSD-3-Clause"
] | null | null | null | PC_Clase8/3Sum.cpp | Angelussz/ProgramacionCompetitiva | 681c0aa21020d8e843108e77abcf2a62dd471dc5 | [
"BSD-3-Clause"
] | null | null | null | /******************************************************************************
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debu... | 28.821429 | 94 | 0.32404 | [
"vector"
] |
429769f3b378b644fe8df585142ef965657a42ff | 6,539 | cpp | C++ | DarkSoulsAnimTool/readTaeFile.cpp | loosepolygon/DarkSoulsAnimTool | 5b04c44c9cc2d8d1d324a4008a61322cf1b77345 | [
"MIT"
] | 7 | 2017-12-23T05:02:37.000Z | 2021-04-17T03:20:56.000Z | DarkSoulsAnimTool/readTaeFile.cpp | loosepolygon/DarkSoulsAnimTool | 5b04c44c9cc2d8d1d324a4008a61322cf1b77345 | [
"MIT"
] | 1 | 2017-12-01T01:34:01.000Z | 2017-12-01T01:34:01.000Z | DarkSoulsAnimTool/readTaeFile.cpp | loosepolygon/DarkSoulsAnimTool | 5b04c44c9cc2d8d1d324a4008a61322cf1b77345 | [
"MIT"
] | 3 | 2017-11-02T18:28:18.000Z | 2019-10-06T04:58:50.000Z | #include "structs.hpp"
#include "funcs.hpp"
#include <string>
#include <cstdio>
#include <vector>
#include <exception>
using namespace TAE;
std::wstring readNameW(FILE* file, int offset) {
long posBuffer = ftell(file);
fseek(file, offset, SEEK_SET);
std::wstring text;
int peekChar = fge... | 29.454955 | 88 | 0.567671 | [
"vector"
] |
429920a399d05d134e0f4e2709bd1395aeb52ec5 | 2,451 | cpp | C++ | Hoowan-Editor/src/game/Player/Player.cpp | juanbecerra0/Hoowan | 27d535a8f700537fe7158b40a7cbfa9c54c46e71 | [
"Apache-2.0"
] | null | null | null | Hoowan-Editor/src/game/Player/Player.cpp | juanbecerra0/Hoowan | 27d535a8f700537fe7158b40a7cbfa9c54c46e71 | [
"Apache-2.0"
] | null | null | null | Hoowan-Editor/src/game/Player/Player.cpp | juanbecerra0/Hoowan | 27d535a8f700537fe7158b40a7cbfa9c54c46e71 | [
"Apache-2.0"
] | null | null | null | #include "hwpch.h"
#include "Player.h"
#include <glm\ext\matrix_transform.hpp>
#include <glm/gtx/compatibility.hpp>
Player::Player(Hoowan::Ref<Hoowan::Scene> scene, glm::vec2& startingPosition)
{
m_PlayerEntity = scene->CreateEntity("PlayerActor");
m_PlayerEntity.GetComponent<Hoowan::TransformComponent>().GetTransf... | 29.890244 | 134 | 0.761322 | [
"transform"
] |
429c6fd47ae3618b51d4063e0eef4574bca7580a | 9,673 | cpp | C++ | TMP/MainGameState.cpp | amecky/breakout | b580befabd1226c6c8c26550d5e0e0ca841fe67d | [
"MIT"
] | null | null | null | TMP/MainGameState.cpp | amecky/breakout | b580befabd1226c6c8c26550d5e0e0ca841fe67d | [
"MIT"
] | null | null | null | TMP/MainGameState.cpp | amecky/breakout | b580befabd1226c6c8c26550d5e0e0ca841fe67d | [
"MIT"
] | null | null | null | #include "MainGameState.h"
#include <core\log\Log.h>
#include "..\Constants.h"
#include <core\math\Bitset.h>
#include <core\io\FileRepository.h>
#include "..\WarpingGrid.h"
MainGameState::MainGameState(GameContext* context) : ds::GameState("MainGameState") , _context(context) {
_paddle = (Paddle*)ds::game::get_game_o... | 28.037681 | 135 | 0.529722 | [
"render",
"vector"
] |
429f1dd41bb32423c086b0854004b505f985a43a | 1,311 | cpp | C++ | willow/src/patterns/loggradoppattern.cpp | gglin001/popart | 3225214343f6d98550b6620e809a3544e8bcbfc6 | [
"MIT"
] | 61 | 2020-07-06T17:11:46.000Z | 2022-03-12T14:42:51.000Z | willow/src/patterns/loggradoppattern.cpp | gglin001/popart | 3225214343f6d98550b6620e809a3544e8bcbfc6 | [
"MIT"
] | 1 | 2021-02-25T01:30:29.000Z | 2021-11-09T11:13:14.000Z | willow/src/patterns/loggradoppattern.cpp | gglin001/popart | 3225214343f6d98550b6620e809a3544e8bcbfc6 | [
"MIT"
] | 6 | 2020-07-15T12:33:13.000Z | 2021-11-07T06:55:00.000Z | // Copyright (c) 2019 Graphcore Ltd. All rights reserved.
#include <memory>
#include <popart/graph.hpp>
#include <popart/op/div.hpp>
#include <popart/op/log.hpp>
#include <popart/patterns/loggradoppattern.hpp>
#include <popart/tensor.hpp>
#include <popart/tensorinfo.hpp>
namespace popart {
bool LogGradOpPattern::matc... | 27.893617 | 80 | 0.720061 | [
"vector"
] |
42bd519c31672142dbf18fe1df84fdf297a1efd7 | 110,603 | cxx | C++ | main/sw/source/core/unocore/unodraw.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/sw/source/core/unocore/unodraw.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/sw/source/core/unocore/unodraw.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 331 | 2015-01-06T11:40:55.000Z | 2022-03-14T04:07:51.000Z | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to y... | 37.441774 | 193 | 0.567806 | [
"object",
"shape"
] |
42ca6348800e2065ba4bf47144fa30ed62cbcef9 | 1,606 | cc | C++ | CondFormats/HcalObjects/src/HcalDetIdTransform.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 3 | 2018-08-24T19:10:26.000Z | 2019-02-19T11:45:32.000Z | CondFormats/HcalObjects/src/HcalDetIdTransform.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 3 | 2018-08-23T13:40:24.000Z | 2019-12-05T21:16:03.000Z | CondFormats/HcalObjects/src/HcalDetIdTransform.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 5 | 2018-08-21T16:37:52.000Z | 2020-01-09T13:33:17.000Z | #include "CondFormats/HcalObjects/interface/HcalDetIdTransform.h"
#include "DataFormats/HcalDetId/interface/HcalDetId.h"
#include "FWCore/Utilities/interface/Exception.h"
namespace HcalDetIdTransform
{
unsigned transform(const HcalDetId& id, const unsigned transformCode)
{
static const int ietaShift =... | 27.689655 | 75 | 0.531756 | [
"transform"
] |
42ec6f622555b26db27f19aba187a024c5450abc | 9,990 | cc | C++ | exec/kitti_eval.cc | kxhit/semantic-icp | 1405daacd92becafe1d3e589c6eeb90c893787a4 | [
"BSD-3-Clause"
] | 21 | 2020-03-09T04:21:32.000Z | 2022-03-24T07:16:41.000Z | exec/kitti_eval.cc | jtpils/semantic-icp | 1405daacd92becafe1d3e589c6eeb90c893787a4 | [
"BSD-3-Clause"
] | null | null | null | exec/kitti_eval.cc | jtpils/semantic-icp | 1405daacd92becafe1d3e589c6eeb90c893787a4 | [
"BSD-3-Clause"
] | 9 | 2019-04-19T06:28:56.000Z | 2022-03-21T05:18:32.000Z | #include <iostream>
#include <chrono>
#include <thread>
#include <cmath>
#include <string>
#include <dirent.h>
#include <algorithm>
#include <pcl/io/pcd_io.h>
#include <pcl/point_types.h>
#include <pcl/registration/gicp.h>
#include <pcl/console/parse.h>
#include <em_icp.h>
#include <gicp.h>
#include <pcl_2_semantic.h... | 35.678571 | 98 | 0.614715 | [
"vector",
"transform"
] |
42eca75b1cf5b2b0e8556ce8f1bad47fabc63653 | 1,656 | cpp | C++ | physics/ParticleEmitter.cpp | axoloto/Murmuration | b2cf1d1d0ad3822ded8c819a586eb0fe689a8372 | [
"MIT"
] | null | null | null | physics/ParticleEmitter.cpp | axoloto/Murmuration | b2cf1d1d0ad3822ded8c819a586eb0fe689a8372 | [
"MIT"
] | null | null | null | physics/ParticleEmitter.cpp | axoloto/Murmuration | b2cf1d1d0ad3822ded8c819a586eb0fe689a8372 | [
"MIT"
] | null | null | null | #include "ParticleEmitter.hpp"
#include "Geometry.hpp"
#include "Utils.hpp"
using namespace Physics;
std::vector<Math::float3> ParticleEmitter::getParticlesPos() const
{
std::vector<Math::float3> positions;
if (m_dimension == Dimension::dim2D)
{
const auto& subdiv2D = Utils::GetNbParticlesSubdiv2D((Utils::... | 36.8 | 126 | 0.726449 | [
"geometry",
"vector"
] |
0cd2d416fbe36486f50acdaf261bedee9dd847c7 | 7,771 | cpp | C++ | FTSensor/src/Force.cpp | yanglh14/InteractiveGrasping | b5bc1866a1847e7b0c11616fd6cbe949c64a355b | [
"MIT"
] | 3 | 2021-04-14T08:24:40.000Z | 2021-11-04T04:10:19.000Z | FTSensor/src/Force.cpp | yanglh14/InteractiveGrasping | b5bc1866a1847e7b0c11616fd6cbe949c64a355b | [
"MIT"
] | null | null | null | FTSensor/src/Force.cpp | yanglh14/InteractiveGrasping | b5bc1866a1847e7b0c11616fd6cbe949c64a355b | [
"MIT"
] | null | null | null | #include "Force.h"
#include <algorithm>
#include <iostream>
#include <fstream>
#include <iomanip>
void ForceSensor::MySleep(unsigned long ms)
{
usleep(ms * 1000);
}
int ForceSensor::GetSequence() const
{
return sequence_;
}
void ForceSensor::InitFTResponse()
{
if (SocketConnect() != 0)
... | 24.748408 | 130 | 0.583709 | [
"vector"
] |
0cd564883b22c72b1295ec12cb9fd8a84d9a61ea | 4,223 | cpp | C++ | src/student/archimedes/pointmass_body_2d.cpp | Tagglink/archimedes-principle | 93a2ce101bc8f3ac2653da667887c8d36a6e86a7 | [
"MIT"
] | null | null | null | src/student/archimedes/pointmass_body_2d.cpp | Tagglink/archimedes-principle | 93a2ce101bc8f3ac2653da667887c8d36a6e86a7 | [
"MIT"
] | null | null | null | src/student/archimedes/pointmass_body_2d.cpp | Tagglink/archimedes-principle | 93a2ce101bc8f3ac2653da667887c8d36a6e86a7 | [
"MIT"
] | null | null | null | #include "pointmass_body_2d.h"
#include <iostream>
#include <memory>
#include <vector>
#include "SF_src/DemoHandler.h"
#include "student/geometry.h"
#include "student/random.h"
namespace student::archimedes {
PointmassBody2D::PointmassBody2D(const std::vector<Pointmass>& pointmasses,
... | 26.39375 | 79 | 0.680559 | [
"geometry",
"shape",
"vector"
] |
0cde6695fa4e09c2607dea7c22f6ddae8824b2eb | 1,975 | hpp | C++ | obugre/include/system.hpp | javierdelapuente/tfm_ode_bullet | cc0d40b9a91e43b5045c10903b5244e680d909ef | [
"Zlib"
] | 1 | 2021-04-08T11:22:13.000Z | 2021-04-08T11:22:13.000Z | obugre/include/system.hpp | javierdelapuente/tfm_ode_bullet | cc0d40b9a91e43b5045c10903b5244e680d909ef | [
"Zlib"
] | null | null | null | obugre/include/system.hpp | javierdelapuente/tfm_ode_bullet | cc0d40b9a91e43b5045c10903b5244e680d909ef | [
"Zlib"
] | null | null | null | #ifndef OBUGRE_SYSTEM_HPP
#define OBUGRE_SYSTEM_HPP
#include <vector>
#include <obconfig.hpp>
#include "engine.hpp"
#include "body.hpp"
namespace OB
{
class System
{
public:
System() = default;
System(const System&) = delete;
System& operator=(const System&) = delete;
Eng... | 30.384615 | 90 | 0.589367 | [
"vector"
] |
0ce2cddc8bcd0323ab228103736a5fa65d5e41b8 | 1,410 | cpp | C++ | BOJ/12000~12999/12851.cpp | shinkeonkim/today-ps | f3e5e38c5215f19579bb0422f303a9c18c626afa | [
"Apache-2.0"
] | 2 | 2020-01-29T06:54:41.000Z | 2021-11-07T13:23:27.000Z | BOJ/12000~12999/12851.cpp | shinkeonkim/Today_PS | bb0cda0ee1b9c57e1cfa38355e29d0f1c6167a44 | [
"Apache-2.0"
] | null | null | null | BOJ/12000~12999/12851.cpp | shinkeonkim/Today_PS | bb0cda0ee1b9c57e1cfa38355e29d0f1c6167a44 | [
"Apache-2.0"
] | null | null | null | #include <bits/stdc++.h>
#define for1(s,n) for(int i = s; i < n; i++)
#define for1j(s,n) for(int j = s; j < n; j++)
#define foreach(k) for(auto i : k)
#define foreachj(k) for(auto j : k)
#define pb(a) push_back(a)
#define sz(a) a.size()
#define MX 220000
#define INF 44000000
#define DIFF 10
using namespace std;
typed... | 20.735294 | 73 | 0.519858 | [
"vector"
] |
0cf03b03c6b9f5b88cddc531b15ea08e3251c930 | 441 | cpp | C++ | Bit Manipulation/Sum vs XOR.cpp | jordantonni/HackerRank_Algorithms | 48c6df9688d4d45e7249c29fd70aba67234c74cd | [
"MIT"
] | null | null | null | Bit Manipulation/Sum vs XOR.cpp | jordantonni/HackerRank_Algorithms | 48c6df9688d4d45e7249c29fd70aba67234c74cd | [
"MIT"
] | null | null | null | Bit Manipulation/Sum vs XOR.cpp | jordantonni/HackerRank_Algorithms | 48c6df9688d4d45e7249c29fd70aba67234c74cd | [
"MIT"
] | null | null | null | // https://www.hackerrank.com/challenges/sum-vs-xor/problem
// Jordan Tonni
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
size_t zeros = 0;
size_t count = 0;
long n = 0;
cin >> n;
while(n){
(n & 1) ? : ... | 15.206897 | 59 | 0.53288 | [
"vector"
] |
0cf1017f7d3db61d9f50cb45767376cab40f794c | 3,692 | cpp | C++ | Graph/Tree/BST/Find a pair with given sum in a BST.cpp | Edith-3000/Algorithmic-Implementations | 7ff8cd615fd453a346b4e851606d47c26f05a084 | [
"MIT"
] | 8 | 2021-02-13T17:07:27.000Z | 2021-08-20T08:20:40.000Z | Graph/Tree/BST/Find a pair with given sum in a BST.cpp | Edith-3000/Algorithmic-Implementations | 7ff8cd615fd453a346b4e851606d47c26f05a084 | [
"MIT"
] | null | null | null | Graph/Tree/BST/Find a pair with given sum in a BST.cpp | Edith-3000/Algorithmic-Implementations | 7ff8cd615fd453a346b4e851606d47c26f05a084 | [
"MIT"
] | 5 | 2021-02-17T18:12:20.000Z | 2021-10-10T17:49:34.000Z | // Problem: https://www.interviewbit.com/problems/2sum-binary-tree/
// Ref: https://www.youtube.com/watch?v=nNwTWOhrffo&list=PL7JyMDSI2BfZugpAjdWc8ES_mYMz2F9Qo&index=4
/***************************************************************************************************/
#include<bits/stdc++.h>
using namespace std;
#de... | 21.97619 | 101 | 0.587486 | [
"vector"
] |
0cf8ba2a4b2d4fd12438f7f88b52151720b3662c | 3,879 | cpp | C++ | ynet/select.cpp | allenporter/thebends | 5e35c7e654e5260b37218e59b02fb0b1a5cb2eca | [
"Apache-2.0"
] | 4 | 2015-07-27T04:05:50.000Z | 2021-01-28T21:56:09.000Z | ynet/select.cpp | allenporter/thebends | 5e35c7e654e5260b37218e59b02fb0b1a5cb2eca | [
"Apache-2.0"
] | null | null | null | ynet/select.cpp | allenporter/thebends | 5e35c7e654e5260b37218e59b02fb0b1a5cb2eca | [
"Apache-2.0"
] | null | null | null | // select.cpp
// Author: Allen Porter <allen@thebends.org>
#include "select.h"
#include <assert.h>
#include <err.h>
#include <errno.h>
#include <sysexits.h>
#include <stdio.h>
#include <string.h>
#include <sys/select.h>
#include <algorithm>
#include <iostream>
using namespace std;
namespace ynet {
static void Add... | 24.707006 | 77 | 0.592421 | [
"vector"
] |
0cfc293bbebc0b6e65cb975e84f6bccfdadee093 | 1,050 | cpp | C++ | Modules/SolverSetupService/src/Initialization/SolverSetupServiceModuleActivator.cpp | carthurs/CRIMSONGUI | 1464df9c4d04cf3ba131ca90b91988a06845c68e | [
"BSD-3-Clause"
] | 10 | 2020-09-17T18:55:31.000Z | 2022-02-23T02:52:38.000Z | Modules/SolverSetupService/src/Initialization/SolverSetupServiceModuleActivator.cpp | carthurs/CRIMSONGUI | 1464df9c4d04cf3ba131ca90b91988a06845c68e | [
"BSD-3-Clause"
] | null | null | null | Modules/SolverSetupService/src/Initialization/SolverSetupServiceModuleActivator.cpp | carthurs/CRIMSONGUI | 1464df9c4d04cf3ba131ca90b91988a06845c68e | [
"BSD-3-Clause"
] | 3 | 2021-05-19T09:02:21.000Z | 2021-07-26T17:39:57.000Z | #include <usModuleActivator.h>
#include <usModuleContext.h>
#include <IO/SolutionDataIO.h>
#include <IO/SolverSetupServiceIOMimeTypes.h>
namespace crimson {
class SolverSetupServiceModuleActivator : public us::ModuleActivator
{
public:
void Load(us::ModuleContext* context) override
{
us::ServicePrope... | 27.631579 | 97 | 0.702857 | [
"vector"
] |
49005012046b90333610c478d20fe9e6a1c7cdfb | 11,748 | cpp | C++ | Biosphere/Source/bio/biocoenosis/fauna/hipc/Object.cpp | PMArkive/Biosphere | baf62450b084ce327c3fc2eb0aa918e32462164e | [
"MIT"
] | 1 | 2021-09-10T17:18:51.000Z | 2021-09-10T17:18:51.000Z | Biosphere/Source/bio/biocoenosis/fauna/hipc/Object.cpp | PMArkive/Biosphere | baf62450b084ce327c3fc2eb0aa918e32462164e | [
"MIT"
] | null | null | null | Biosphere/Source/bio/biocoenosis/fauna/hipc/Object.cpp | PMArkive/Biosphere | baf62450b084ce327c3fc2eb0aa918e32462164e | [
"MIT"
] | null | null | null | #include <bio/biocoenosis/fauna/hipc/Object.hpp>
namespace bio::hipc
{
Object::Object()
{
this->handle = 0;
this->objid = 0;
this->type = ObjectType::Uninitialized;
}
Object::Object(u32 Handle, bool Override)
{
this->handle = Handle;
this->objid = UINT32_MAX... | 34.757396 | 162 | 0.432925 | [
"object",
"vector"
] |
4901b33063a0bff654ce6d276ac7d60323408e53 | 6,150 | cpp | C++ | game/shared/takedamageinfo.cpp | Ochii/source-sdk-csgo | c95b57ce390dcc36d078efc680a3963b27de2f41 | [
"Unlicense"
] | 4 | 2018-11-27T23:11:55.000Z | 2019-07-23T14:27:08.000Z | game/shared/takedamageinfo.cpp | Ochii/source-sdk-csco | c95b57ce390dcc36d078efc680a3963b27de2f41 | [
"Unlicense"
] | null | null | null | game/shared/takedamageinfo.cpp | Ochii/source-sdk-csco | c95b57ce390dcc36d078efc680a3963b27de2f41 | [
"Unlicense"
] | 2 | 2019-06-01T15:24:29.000Z | 2019-07-23T14:27:09.000Z | #include "stdafx.h"
#include "takedamageinfo.h"
void CTakeDamageInfo::Init( CBaseEntity *pInflictor, CBaseEntity *pAttacker, CBaseEntity *pWeapon, const Vector &damageForce, const Vector &damagePosition, const Vector &reportedPosition, float flDamage, int bitsDamageType, int iCustomDamage, int iObjectsPenetrated )
{
... | 44.244604 | 267 | 0.700813 | [
"vector"
] |
49050718de31390509516fe224415e7be80b2519 | 51,303 | cpp | C++ | Rootkits/vault/admin/ce54releasesvn/underc/sourcecode/src/engine.cpp | dendisuhubdy/grokmachine | 120a21a25c2730ed356739231ec8b99fc0575c8b | [
"BSD-3-Clause"
] | 46 | 2017-05-15T11:15:08.000Z | 2018-07-02T03:32:52.000Z | Rootkits/vault/admin/ce54releasesvn/underc/sourcecode/src/engine.cpp | dendisuhubdy/grokmachine | 120a21a25c2730ed356739231ec8b99fc0575c8b | [
"BSD-3-Clause"
] | null | null | null | Rootkits/vault/admin/ce54releasesvn/underc/sourcecode/src/engine.cpp | dendisuhubdy/grokmachine | 120a21a25c2730ed356739231ec8b99fc0575c8b | [
"BSD-3-Clause"
] | 24 | 2017-05-17T03:26:17.000Z | 2018-07-09T07:00:50.000Z | /* ENGINE.CPP
* The stackcode engine
* UnderC C++ interpreter
* Steve Donovan, 2001
* This is GPL'd software, and the usual disclaimers apply.
* See LICENCE
*/
#include "classlib.h"
#include <list>
#include <memory.h>
#include "stack.h"
#include "opcodes.h"
#include "directcall.h"
#include "hard_exce... | 29.879441 | 118 | 0.562989 | [
"object",
"vector"
] |
4905ca22bc490c2ee34a1e64898a769606a00f4d | 2,415 | cpp | C++ | json-writer/json-writer-test.cpp | vogro-x/vogro-json | 6bd22e6799278d0e1cd9fabdad2d9733dfee100a | [
"Apache-2.0"
] | null | null | null | json-writer/json-writer-test.cpp | vogro-x/vogro-json | 6bd22e6799278d0e1cd9fabdad2d9733dfee100a | [
"Apache-2.0"
] | null | null | null | json-writer/json-writer-test.cpp | vogro-x/vogro-json | 6bd22e6799278d0e1cd9fabdad2d9733dfee100a | [
"Apache-2.0"
] | null | null | null | #include "json_writer.hpp"
#define BEGIN_TEST(name) { \
JsonWriter *w = new JsonWriter; \
w->SetInitialIndentDepth (2); \
if (compress) { \
w->ConfigureCompressedOutput (); \
} \
std::cout << #name << ":" << std::endl << std::endl;
#define END_TEST \
delete w; \
std::cout << std::endl << std::end... | 19.166667 | 54 | 0.556108 | [
"object"
] |
490da53e50656de7568c1e651df431ce4084520a | 1,559 | cpp | C++ | The_chocolate_boy.cpp | shalini264/Coding-problem-solutions | 77e8b12b771d24e62f4268d6ba8f29f592770bd9 | [
"MIT"
] | 4 | 2021-07-11T20:13:56.000Z | 2022-02-19T17:22:42.000Z | The_chocolate_boy.cpp | shalini264/long-challenge-solutions-in-my-way | 77e8b12b771d24e62f4268d6ba8f29f592770bd9 | [
"MIT"
] | null | null | null | The_chocolate_boy.cpp | shalini264/long-challenge-solutions-in-my-way | 77e8b12b771d24e62f4268d6ba8f29f592770bd9 | [
"MIT"
] | null | null | null |
#include<bits/stdc++.h>
using namespace std;
int dp[1001][1001][2];
void fun()
{
for(int i=0;i<1001;i++)
{
for(int j=0;j<1001;j++)
{
dp[i][j][0]=dp[i][j][1]=-1;
}
}
}
int func1(int n,int m,vector<pair<char,pair<int,int>>>vec,int p=0)
{
for(int i=0;i<=n;i++)
{for(int j=0... | 21.652778 | 167 | 0.486209 | [
"vector"
] |
491023e6cad50280d3efb7385b8e4bab2348f428 | 403 | cpp | C++ | Algorithms/0477.Total_Hamming_Distance.cpp | metehkaya/LeetCode | 52f4a1497758c6f996d515ced151e8783ae4d4d2 | [
"MIT"
] | 2 | 2020-07-20T06:40:22.000Z | 2021-11-20T01:23:26.000Z | Problems/LeetCode/Problems/0477.Total_Hamming_Distance.cpp | metehkaya/Algo-Archive | 03b5fdcf06f84a03125c57762c36a4e03ca6e756 | [
"MIT"
] | null | null | null | Problems/LeetCode/Problems/0477.Total_Hamming_Distance.cpp | metehkaya/Algo-Archive | 03b5fdcf06f84a03125c57762c36a4e03ca6e756 | [
"MIT"
] | null | null | null | class Solution {
public:
int n;
int cnt[30];
int totalHammingDistance(vector<int>& ar) {
n = ar.size();
for( int i = 0 ; i < n ; i++ )
for( int j = 0 ; j < 30 ; j++ )
if((ar[i] & (1<<j)))
cnt[j]++;
int ans = 0;
for( int i = 0 ; ... | 25.1875 | 47 | 0.362283 | [
"vector"
] |
4914520fb7b3efb36a77999908b41604f95e5852 | 714 | hpp | C++ | include/runtime/readlinestream.hpp | nohajc/llscheme | 9f20286f6ed6263fe138f825f47011f455b09891 | [
"MIT"
] | 1 | 2020-07-23T22:43:44.000Z | 2020-07-23T22:43:44.000Z | include/runtime/readlinestream.hpp | nohajc/llscheme | 9f20286f6ed6263fe138f825f47011f455b09891 | [
"MIT"
] | null | null | null | include/runtime/readlinestream.hpp | nohajc/llscheme | 9f20286f6ed6263fe138f825f47011f455b09891 | [
"MIT"
] | null | null | null | #ifndef LLSCHEME_READLINESTREAM_HPP
#define LLSCHEME_READLINESTREAM_HPP
#include <streambuf>
#include <iostream>
#include <vector>
using namespace std;
class readlinebuf: public streambuf {
virtual int_type underflow() override;
readlinebuf(const readlinebuf &) = delete;
readlinebuf & operator=(const rea... | 21 | 58 | 0.717087 | [
"vector"
] |
491a4ae75613affb315ecf61e435aa5bf42f9f5d | 2,281 | cpp | C++ | src/gausspoint/gausspoints.cpp | ellery85/sparselizard | 7d09e97e9443a436d74cbd241b8466527edb9e2f | [
"MIT"
] | null | null | null | src/gausspoint/gausspoints.cpp | ellery85/sparselizard | 7d09e97e9443a436d74cbd241b8466527edb9e2f | [
"MIT"
] | null | null | null | src/gausspoint/gausspoints.cpp | ellery85/sparselizard | 7d09e97e9443a436d74cbd241b8466527edb9e2f | [
"MIT"
] | null | null | null | #include "gausspoints.h"
gausspoints::gausspoints(int elementtypenumber, int integrationorder)
{
myelementtypenumber = elementtypenumber;
myintegrationorder = integrationorder;
if (integrationorder < 0)
{
std::cout << "Error in 'gausspoints' object: cannot get the Gauss points for negativ... | 34.044776 | 239 | 0.583078 | [
"object"
] |
491f766aa2d0809d8857d616e4d219560e1f6e0b | 899 | cpp | C++ | codeforces/1285c.cpp | sogapalag/problems | 0ea7d65448e1177f8b3f81124a82d187980d659c | [
"MIT"
] | 1 | 2020-04-04T14:56:12.000Z | 2020-04-04T14:56:12.000Z | codeforces/1285c.cpp | sogapalag/problems | 0ea7d65448e1177f8b3f81124a82d187980d659c | [
"MIT"
] | null | null | null | codeforces/1285c.cpp | sogapalag/problems | 0ea7d65448e1177f8b3f81124a82d187980d659c | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
void solve() {
ll n; cin >> n;
vector<ll> a;
ll x = n;
for (ll i = 2; i*i <= x; i++) {
if (x%i==0){
ll d = 1;
while (x%i==0) {
x/=i;
d*=i;
}
a.push_... | 19.977778 | 83 | 0.39822 | [
"vector"
] |
4920a97f837cd6cbc29f68248ba9a9c06439a692 | 3,444 | hh | C++ | Diagnostic/mdsd/mdsdlog/Logger.hh | shridpant/azure-linux-extensions | 4b5e66f33d5b93b15b427a9438931f0414f12a6e | [
"Apache-2.0"
] | 266 | 2015-01-05T04:13:15.000Z | 2022-03-24T17:52:51.000Z | Diagnostic/mdsd/mdsdlog/Logger.hh | shridpant/azure-linux-extensions | 4b5e66f33d5b93b15b427a9438931f0414f12a6e | [
"Apache-2.0"
] | 703 | 2015-01-27T07:16:57.000Z | 2022-03-29T09:01:23.000Z | Diagnostic/mdsd/mdsdlog/Logger.hh | shridpant/azure-linux-extensions | 4b5e66f33d5b93b15b427a9438931f0414f12a6e | [
"Apache-2.0"
] | 276 | 2015-01-20T11:11:15.000Z | 2022-03-24T12:40:49.000Z | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT license.
#ifndef _LOGGER_HH_
#define _LOGGER_HH_
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <memory>
struct timeval;
class Logger
{
public:
class Timestamp {
public:
Timestamp() {}
vi... | 29.947826 | 120 | 0.689605 | [
"vector"
] |
49217cfa6118c3bf945c511c8864ebfc28e469a9 | 1,760 | cpp | C++ | datastructure/vertex_add_subtree_sum/sol/correct.cpp | tko919/library-checker-problems | 007a3ef79d1a1824e68545ab326d1523d9c05262 | [
"Apache-2.0"
] | 290 | 2019-06-06T22:20:36.000Z | 2022-03-27T12:45:04.000Z | datastructure/vertex_add_subtree_sum/sol/correct.cpp | tko919/library-checker-problems | 007a3ef79d1a1824e68545ab326d1523d9c05262 | [
"Apache-2.0"
] | 536 | 2019-06-06T18:25:36.000Z | 2022-03-29T11:46:36.000Z | datastructure/vertex_add_subtree_sum/sol/correct.cpp | tko919/library-checker-problems | 007a3ef79d1a1824e68545ab326d1523d9c05262 | [
"Apache-2.0"
] | 82 | 2019-06-06T18:17:55.000Z | 2022-03-21T07:40:31.000Z | #include <iostream>
#include <vector>
#include <cassert>
#include <tuple>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>... | 18.723404 | 66 | 0.402841 | [
"vector"
] |
4926d439109fd5c82963635828f81a7cea7ed21b | 9,473 | cpp | C++ | src/functions/func_arithmetic.cpp | jsoniq/jsoniq | f7af29417f809d64d1f0b2622d880bc4d87f2e42 | [
"Apache-2.0"
] | 94 | 2015-01-18T09:40:36.000Z | 2022-03-02T21:14:55.000Z | src/functions/func_arithmetic.cpp | jsoniq/jsoniq | f7af29417f809d64d1f0b2622d880bc4d87f2e42 | [
"Apache-2.0"
] | 72 | 2015-01-05T22:00:31.000Z | 2021-07-17T11:35:03.000Z | src/functions/func_arithmetic.cpp | jsoniq/jsoniq | f7af29417f809d64d1f0b2622d880bc4d87f2e42 | [
"Apache-2.0"
] | 27 | 2015-01-18T20:20:54.000Z | 2020-11-01T18:01:07.000Z | /*
* Copyright 2006-2008 The FLWOR Foundation.
*
* 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... | 28.533133 | 81 | 0.613533 | [
"vector"
] |
4929b4ef74bb9fbfa5ce2305571c6e4c8c241211 | 5,629 | cpp | C++ | 2_term/3_module/Task1/main.cpp | ilyabelow/algorithms_tasks | 33718497fd2f16daa2c6101dc656124a540714fa | [
"MIT"
] | null | null | null | 2_term/3_module/Task1/main.cpp | ilyabelow/algorithms_tasks | 33718497fd2f16daa2c6101dc656124a540714fa | [
"MIT"
] | null | null | null | 2_term/3_module/Task1/main.cpp | ilyabelow/algorithms_tasks | 33718497fd2f16daa2c6101dc656124a540714fa | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <tuple>
#include <memory>
//Convenient struct for storing edges that hold full pair from -> to
struct FullEdge {
int from;
int to;
int weight;
FullEdge(int from, int to, int weight);
};
//Functor for sorting edges
struct Fu... | 27.193237 | 104 | 0.694262 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.