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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
690095aced1b3f275984c0857daade52d479cd4a | 11,997 | cc | C++ | tensorflow/core/kernels/epu_conv_ops.cc | tangcongyuan/tensorflow-r1.9 | 4dbef31044a95ce318dee304e163582fa68b1d75 | [
"Apache-2.0"
] | null | null | null | tensorflow/core/kernels/epu_conv_ops.cc | tangcongyuan/tensorflow-r1.9 | 4dbef31044a95ce318dee304e163582fa68b1d75 | [
"Apache-2.0"
] | null | null | null | tensorflow/core/kernels/epu_conv_ops.cc | tangcongyuan/tensorflow-r1.9 | 4dbef31044a95ce318dee304e163582fa68b1d75 | [
"Apache-2.0"
] | null | null | null | #define USE_EIGEN_TENSOR
#define EIGEN_USE_THREADS
#if GOOGLE_CUDA
#define EIGEN_USE_GPU
#endif // GOOGLE_CUDA
#include "tensorflow/core/kernels/conv_ops.h"
#include <string.h>
#include <map>
#include <vector>
#include "tensorflow/core/common_runtime/epu/epu_device.h"
#include "tensorflow/core/framework/numeric_o... | 43.467391 | 87 | 0.631241 | [
"shape",
"vector"
] |
6901582348e44f1f60380dcc40114fc5bbc561cc | 8,102 | cpp | C++ | src/Engine/bitboard.cpp | vieiramauricio/Chessqdl | 3c76a626dbb9ed8880539a90f72e175a9e07e9fb | [
"MIT"
] | 6 | 2019-11-20T04:02:12.000Z | 2022-02-16T15:49:39.000Z | src/Engine/bitboard.cpp | vieiramauricio/Chessqdl | 3c76a626dbb9ed8880539a90f72e175a9e07e9fb | [
"MIT"
] | null | null | null | src/Engine/bitboard.cpp | vieiramauricio/Chessqdl | 3c76a626dbb9ed8880539a90f72e175a9e07e9fb | [
"MIT"
] | 1 | 2020-10-02T23:44:18.000Z | 2020-10-02T23:44:18.000Z | #include "bitboard.hpp"
#include "const.hpp"
#include <string>
#include <iostream>
#include <cctype>
using namespace chessqdl;
/**
* @details Initializes bitboards in order to obtain the following board: <br><br>
* r n b q k b n r <br>
* p p p p p p p p <br>
* - - - - - - - - <br>
* - - - - - - - - <br>
* - - ... | 23.899705 | 167 | 0.637373 | [
"vector"
] |
690ac6c28c223f130be34f1c562f533860e6ae07 | 682 | cpp | C++ | test/append_test.cpp | CppPhil/graph_algorithms | 6742fccf83a85fd7b1e500ac495b35c7d0670b84 | [
"Unlicense"
] | null | null | null | test/append_test.cpp | CppPhil/graph_algorithms | 6742fccf83a85fd7b1e500ac495b35c7d0670b84 | [
"Unlicense"
] | null | null | null | test/append_test.cpp | CppPhil/graph_algorithms | 6742fccf83a85fd7b1e500ac495b35c7d0670b84 | [
"Unlicense"
] | null | null | null | #include "gtest/gtest.h"
#include <append.hpp>
#include <vector>
using namespace gp;
using namespace std;
TEST(append, firstEmpty)
{
const vector<int> result{append(vector<int>{}, vector<int>{1, 2, 3, 4})};
const vector<int> expected{1, 2, 3, 4};
EXPECT_EQ(result, expected);
}
TEST(append, secondEmpty)... | 19.485714 | 77 | 0.636364 | [
"vector"
] |
6917422e3016d69f26279d812437e8ba8a65f920 | 3,148 | cpp | C++ | crazyrc/rgb_txt_parser.cpp | mojmir-svoboda/BlackBoxTT | 0c87b989827107695538e1bf1266c08b083dda44 | [
"MIT"
] | 11 | 2017-06-19T14:21:15.000Z | 2020-03-04T06:43:16.000Z | crazyrc/rgb_txt_parser.cpp | mojmir-svoboda/BlackBoxTT | 0c87b989827107695538e1bf1266c08b083dda44 | [
"MIT"
] | null | null | null | crazyrc/rgb_txt_parser.cpp | mojmir-svoboda/BlackBoxTT | 0c87b989827107695538e1bf1266c08b083dda44 | [
"MIT"
] | 3 | 2017-07-23T18:08:55.000Z | 2019-09-16T16:28:18.000Z | #include "rgb_txt_parser.h"
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/phoenix.hpp>
#include <boost/spirit/include/phoenix_core.hpp>
#include <boost/spirit/include/phoenix_operator.hpp>
#include <boost/fusion/include/adapt_struct.hpp>
#include <boost/fusion/include/std_pair.hpp>
#include <boo... | 26.453782 | 155 | 0.662961 | [
"vector"
] |
69177f692dae2f94a1cea8e337cbfb3b664412f8 | 20,888 | inl | C++ | thrust/system/cuda/detail/sort.inl | MultithreadCorner/thrust-multi-permutation-iterator | c62bd5c6d8b29921f3759599b2586a9ce0e129a7 | [
"Apache-2.0"
] | null | null | null | thrust/system/cuda/detail/sort.inl | MultithreadCorner/thrust-multi-permutation-iterator | c62bd5c6d8b29921f3759599b2586a9ce0e129a7 | [
"Apache-2.0"
] | null | null | null | thrust/system/cuda/detail/sort.inl | MultithreadCorner/thrust-multi-permutation-iterator | c62bd5c6d8b29921f3759599b2586a9ce0e129a7 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2008-2012 NVIDIA Corporation
*
* 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... | 43.157025 | 155 | 0.635389 | [
"vector"
] |
691dbabdcd27bf906d9522825a2f9755e657f32b | 2,855 | cpp | C++ | src/network/emg_data_client.cpp | BiRDLab-UMinho/trignoclient | 507351e818b37199aa00aefedb124885dda1ea98 | [
"MIT"
] | null | null | null | src/network/emg_data_client.cpp | BiRDLab-UMinho/trignoclient | 507351e818b37199aa00aefedb124885dda1ea98 | [
"MIT"
] | null | null | null | src/network/emg_data_client.cpp | BiRDLab-UMinho/trignoclient | 507351e818b37199aa00aefedb124885dda1ea98 | [
"MIT"
] | null | null | null | #include <string>
#include <vector>
#include "core/sensor.hpp"
#include "core/duration.hpp" // trigno::Duration
#include "core/frame.hpp" // trigno::Frame
#include "network/configuration.hpp" // trigno::network::MultiSensorConfiguration, trigno::network::ConnectionConfiguration
#include "net... | 37.565789 | 148 | 0.680911 | [
"vector"
] |
6925b2bbc7f18dc42d7caedd27db5316ba4fa89e | 1,219 | cpp | C++ | code-forces/Educational 84/C.cpp | ErickJoestar/competitive-programming | 76afb766dbc18e16315559c863fbff19a955a569 | [
"MIT"
] | 1 | 2020-04-23T00:35:38.000Z | 2020-04-23T00:35:38.000Z | code-forces/Educational 84/C.cpp | ErickJoestar/competitive-programming | 76afb766dbc18e16315559c863fbff19a955a569 | [
"MIT"
] | null | null | null | code-forces/Educational 84/C.cpp | ErickJoestar/competitive-programming | 76afb766dbc18e16315559c863fbff19a955a569 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define ENDL '\n'
#define deb(u) cout << #u " : " << (u) << ENDL;
#define deba(alias, u) cout << alias << ": " << (u) << ENDL;
#define debp(u, v) cout << u << " : " << v << ENDL;
#define pb push_back
#define F first
#define S second
#define lli long long
#define pii pair<int, int>
#define pll p... | 18.469697 | 60 | 0.423298 | [
"vector"
] |
6936f38fe562c8bf0e57a1e773b239222808fdf4 | 862 | cpp | C++ | contests/Codeforces Round #700 Div 2/Searching_local_minimum.cpp | Razdeep/Codeforces-Solutions | e808575219ec15bc07720d6abafe3c4c8df036f4 | [
"MIT"
] | 2 | 2020-08-27T18:21:04.000Z | 2020-08-30T13:24:39.000Z | contests/Codeforces Round #700 Div 2/Searching_local_minimum.cpp | Razdeep/Codeforces-Solutions | e808575219ec15bc07720d6abafe3c4c8df036f4 | [
"MIT"
] | null | null | null | contests/Codeforces Round #700 Div 2/Searching_local_minimum.cpp | Razdeep/Codeforces-Solutions | e808575219ec15bc07720d6abafe3c4c8df036f4 | [
"MIT"
] | null | null | null | // https://codeforces.com/contest/1480/problem/C
#include <bits/stdc++.h>
#define trace(x) cerr << #x << ": " << x << endl;
#define all(v) v.begin(), v.end()
#define int ll
typedef long long ll;
using namespace std;
constexpr int oo = INT_MAX;
void solve() {
int n;
cin >> n;
vector<int> arr(n + 1, oo);
int lef... | 14.862069 | 49 | 0.549884 | [
"vector"
] |
693896635ab96ab72e6b643dfd0efc77be38c6f7 | 432 | cpp | C++ | aoj/Volume00/0062/solve.cpp | tobyapi/online-judge-solutions | 4088adb97ea592e8e6582ae7d2ecde2f85e2ed9c | [
"MIT"
] | null | null | null | aoj/Volume00/0062/solve.cpp | tobyapi/online-judge-solutions | 4088adb97ea592e8e6582ae7d2ecde2f85e2ed9c | [
"MIT"
] | null | null | null | aoj/Volume00/0062/solve.cpp | tobyapi/online-judge-solutions | 4088adb97ea592e8e6582ae7d2ecde2f85e2ed9c | [
"MIT"
] | null | null | null | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void){
string s;
vector<int>num;
while(cin >> s){
num.clear();
for(int i=0;i<10;i++)
num.push_back(s[i]-'0');
vector<int>n;
for(int i=0;i<9;i++){
for(int j=0;j<num.size()-1;j++){
n.push_back((... | 16 | 38 | 0.518519 | [
"vector"
] |
6938bf57566f04ff98f10e34439b10adc951c4be | 4,619 | cc | C++ | Cassie_Example/opt_two_step/gen/opt/J_torque_integral.cc | prem-chand/Cassie_CFROST | da4bd51442f86e852cbb630cc91c9a380a10b66d | [
"BSD-3-Clause"
] | null | null | null | Cassie_Example/opt_two_step/gen/opt/J_torque_integral.cc | prem-chand/Cassie_CFROST | da4bd51442f86e852cbb630cc91c9a380a10b66d | [
"BSD-3-Clause"
] | null | null | null | Cassie_Example/opt_two_step/gen/opt/J_torque_integral.cc | prem-chand/Cassie_CFROST | da4bd51442f86e852cbb630cc91c9a380a10b66d | [
"BSD-3-Clause"
] | null | null | null | /*
* Automatically Generated from Mathematica.
* Thu 14 Oct 2021 09:51:49 GMT-04:00
*/
#ifdef MATLAB_MEX_FILE
#include <stdexcept>
#include <cmath>
#include<math.h>
/**
* Copied from Wolfram Mathematica C Definitions file mdefs.hpp
* Changed marcos to inline functions (Eric Cousineau)
*/
inline double Power(doub... | 25.804469 | 104 | 0.639316 | [
"vector"
] |
6939b61c40b76cd88c302c25ea1701bf4f5a3791 | 17,501 | cpp | C++ | base/cluster/mgmt/cluscfg/server/ccluscfgcapabilities.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | base/cluster/mgmt/cluscfg/server/ccluscfgcapabilities.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | base/cluster/mgmt/cluscfg/server/ccluscfgcapabilities.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | //////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2000-2001 Microsoft Corporation
//
// Module Name:
// CClusCfgCapabilities.cpp
//
// Description:
// This file contains the definition of the CClusCfgCapabilities class.
//
// The class CClusCf... | 23.618084 | 99 | 0.427061 | [
"object"
] |
694d824f6806c461df6493dee545b053c368d5e5 | 181,979 | cpp | C++ | fennel/calctest/testCalc.cpp | alexavila150/luciddb | e3125564eb18238677e6efb384b630cab17bb472 | [
"Apache-2.0"
] | 14 | 2015-07-21T06:31:22.000Z | 2020-05-13T14:18:33.000Z | fennel/calctest/testCalc.cpp | alexavila150/luciddb | e3125564eb18238677e6efb384b630cab17bb472 | [
"Apache-2.0"
] | 1 | 2020-05-04T23:08:51.000Z | 2020-05-04T23:08:51.000Z | fennel/calctest/testCalc.cpp | alexavila150/luciddb | e3125564eb18238677e6efb384b630cab17bb472 | [
"Apache-2.0"
] | 22 | 2015-01-03T14:27:36.000Z | 2021-09-14T02:09:13.000Z | /*
// Licensed to DynamoBI Corporation (DynamoBI) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. DynamoBI licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may ... | 35.23993 | 80 | 0.600218 | [
"object",
"vector"
] |
694d9f2cd65e110bc1d6754996b2a01db5872dbe | 1,569 | cpp | C++ | src/mxml/attributes/AlterSequence.cpp | dkun7944/mxml | 6450e7cab88eb6ee0ac469f437047072e1868ea4 | [
"MIT"
] | 18 | 2016-05-22T00:55:28.000Z | 2021-03-29T08:44:23.000Z | src/mxml/attributes/AlterSequence.cpp | dkun7944/mxml | 6450e7cab88eb6ee0ac469f437047072e1868ea4 | [
"MIT"
] | 6 | 2017-05-17T13:20:09.000Z | 2018-10-22T20:00:57.000Z | src/mxml/attributes/AlterSequence.cpp | dkun7944/mxml | 6450e7cab88eb6ee0ac469f437047072e1868ea4 | [
"MIT"
] | 14 | 2016-05-12T22:54:34.000Z | 2021-10-19T12:43:16.000Z | // Copyright © 2016 Venture Media Labs.
//
// This file is part of mxml. The full mxml copyright notice, including
// terms governing use, modification, and redistribution, is contained in the
// file LICENSE at the root of the source code distribution tree.
#include "AlterSequence.h"
#include <mxml/dom/Measure.h>
#i... | 31.38 | 118 | 0.692161 | [
"vector"
] |
69530653e466cc45cdefdf6b3662a80cb1df330f | 603 | cpp | C++ | src/Generator.cpp | JaredDyreson/BetterScheduler | 311d9f4b958dcbd8fcc129abca647f7efd7d3c12 | [
"MIT"
] | null | null | null | src/Generator.cpp | JaredDyreson/BetterScheduler | 311d9f4b958dcbd8fcc129abca647f7efd7d3c12 | [
"MIT"
] | null | null | null | src/Generator.cpp | JaredDyreson/BetterScheduler | 311d9f4b958dcbd8fcc129abca647f7efd7d3c12 | [
"MIT"
] | null | null | null | #include "../includes/Generator.hpp"
#include "../includes/dataclasses/OrderTicket.hpp"
Generator::Generator() {}
OrderTicket Generator::dispense() {
/*
* Once we give the contents of our OrderTicket
* we no longer want the information persist
*/
return this->currentTicket;
//OrderTicket returnTicket =... | 30.15 | 127 | 0.729685 | [
"object"
] |
6966723e67c361052f9ed0960ca13d2de034df30 | 3,666 | cpp | C++ | examples/cpp/parameters_cpp/parameters_service_cpp.cpp | asorbini/rticonnextdds-ros2-adapter | a8073e5bcd3ccd5cabf7bc6b73aff3a90d1116c8 | [
"Apache-2.0"
] | null | null | null | examples/cpp/parameters_cpp/parameters_service_cpp.cpp | asorbini/rticonnextdds-ros2-adapter | a8073e5bcd3ccd5cabf7bc6b73aff3a90d1116c8 | [
"Apache-2.0"
] | null | null | null | examples/cpp/parameters_cpp/parameters_service_cpp.cpp | asorbini/rticonnextdds-ros2-adapter | a8073e5bcd3ccd5cabf7bc6b73aff3a90d1116c8 | [
"Apache-2.0"
] | null | null | null | /* Copyright 2022 Real-Time Innovations, Inc. (RTI)
*
* 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 applicabl... | 32.157895 | 79 | 0.721768 | [
"object"
] |
696910738db8648749172dfc36ce9045127dc33e | 3,819 | cpp | C++ | SimulationEngineLib/universe/UniverseImpl.cpp | KevinMcGin/Simulation | f1dbed05d6024274f6a69e0679f529feaae1e26e | [
"MIT"
] | 4 | 2021-12-11T17:59:07.000Z | 2021-12-24T11:08:55.000Z | SimulationEngineLib/universe/UniverseImpl.cpp | KevinMcGin/Simulation | f1dbed05d6024274f6a69e0679f529feaae1e26e | [
"MIT"
] | 121 | 2021-12-11T09:20:47.000Z | 2022-03-13T18:36:48.000Z | SimulationEngineLib/universe/UniverseImpl.cpp | KevinMcGin/Simulation | f1dbed05d6024274f6a69e0679f529feaae1e26e | [
"MIT"
] | null | null | null | #include "universe/UniverseImpl.h"
#include "util/Timing.h"
#include "particle/helper/ParticlesHelper.h"
#include <cmath>
#include <iostream>
#include <map>
UniverseImpl::UniverseImpl(
std::vector<std::shared_ptr<Law>> laws,
std::shared_ptr<SimulationInput> input,
std::shared_ptr<SimulationOutput> output,
unsi... | 36.028302 | 163 | 0.722964 | [
"vector"
] |
69727e0d6d18b24a6ae9362dd53bc9e163969ebe | 2,020 | cpp | C++ | solutions/longest-consecutive-sequence/solution.cpp | locker/leetcode | bf34a697de47aaf32823224d054f9a45613ce180 | [
"BSD-2-Clause-FreeBSD"
] | null | null | null | solutions/longest-consecutive-sequence/solution.cpp | locker/leetcode | bf34a697de47aaf32823224d054f9a45613ce180 | [
"BSD-2-Clause-FreeBSD"
] | null | null | null | solutions/longest-consecutive-sequence/solution.cpp | locker/leetcode | bf34a697de47aaf32823224d054f9a45613ce180 | [
"BSD-2-Clause-FreeBSD"
] | 1 | 2019-08-30T06:53:23.000Z | 2019-08-30T06:53:23.000Z | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v)
{
out << '[';
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
out << ',';
out << *it;
}
out << ']';
retu... | 21.489362 | 56 | 0.558911 | [
"vector"
] |
697c4d181fe92e6399dd1963265e0fa2a0a9a276 | 25,953 | hpp | C++ | include/hil/hil.hpp | Ruin0x11/microhil | c67013600dd2c4e1dbffe174bc2ceaa6925d707a | [
"MIT"
] | null | null | null | include/hil/hil.hpp | Ruin0x11/microhil | c67013600dd2c4e1dbffe174bc2ceaa6925d707a | [
"MIT"
] | null | null | null | include/hil/hil.hpp | Ruin0x11/microhil | c67013600dd2c4e1dbffe174bc2ceaa6925d707a | [
"MIT"
] | null | null | null | #ifndef MICROHIL_H_
#define MICROHIL_H_
#include <fstream>
#include <iostream>
#include <istream>
#include <iterator>
#include <sstream>
#include <vector>
#include <string>
#include <cassert>
namespace hil
{
class Value;
struct FunctionCall
{
FunctionCall(std::string& v) : name(v) {}
FunctionCall(const char... | 24.27783 | 152 | 0.520287 | [
"vector"
] |
6985372e07a767f3ac9a9db481d244007a673ba1 | 727 | cpp | C++ | Codeforces/Practice/A12.cpp | MayThirtyOne/DS-Algo | 12d2d02612fc59c877dcc05f42add5a7f5c88337 | [
"MIT"
] | null | null | null | Codeforces/Practice/A12.cpp | MayThirtyOne/DS-Algo | 12d2d02612fc59c877dcc05f42add5a7f5c88337 | [
"MIT"
] | null | null | null | Codeforces/Practice/A12.cpp | MayThirtyOne/DS-Algo | 12d2d02612fc59c877dcc05f42add5a7f5c88337 | [
"MIT"
] | null | null | null |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
void solve()
{
int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v.begin(),v.end());
bool flag=false;
for(int i=1;i<v.size();i++){
if(abs(v[i]-v[i-1]>1)){
flag=true;
break;
}
}
if(flag) cout<<"NO"<<endl;... | 12.754386 | 93 | 0.52132 | [
"vector"
] |
698d73a8ec31bf1ba28fd776579cd45abd87d222 | 9,011 | cpp | C++ | mplapack/reference/Rlasd3.cpp | Ndersam/mplapack | f2ef54d7ce95e4028d3f101a901c75d18d3f1327 | [
"BSD-3-Clause-Open-MPI"
] | 26 | 2019-03-20T04:06:03.000Z | 2022-03-02T10:21:01.000Z | mplapack/reference/Rlasd3.cpp | Ndersam/mplapack | f2ef54d7ce95e4028d3f101a901c75d18d3f1327 | [
"BSD-3-Clause-Open-MPI"
] | 5 | 2019-03-04T03:32:41.000Z | 2021-12-01T07:47:25.000Z | mplapack/reference/Rlasd3.cpp | Ndersam/mplapack | f2ef54d7ce95e4028d3f101a901c75d18d3f1327 | [
"BSD-3-Clause-Open-MPI"
] | 5 | 2019-03-09T17:50:26.000Z | 2022-03-10T19:46:20.000Z | /*
* Copyright (c) 2008-2021
* Nakata, Maho
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, th... | 37.235537 | 311 | 0.478082 | [
"vector"
] |
7e38aab80826c8d3add57042996037c890e928e8 | 12,305 | cpp | C++ | sgviewer/sgviewerDoc.cpp | Andrewich/deadjustice | 48bea56598e79a1a10866ad41aa3517bf7d7c724 | [
"BSD-3-Clause"
] | 3 | 2019-04-20T10:16:36.000Z | 2021-03-21T19:51:38.000Z | sgviewer/sgviewerDoc.cpp | Andrewich/deadjustice | 48bea56598e79a1a10866ad41aa3517bf7d7c724 | [
"BSD-3-Clause"
] | null | null | null | sgviewer/sgviewerDoc.cpp | Andrewich/deadjustice | 48bea56598e79a1a10866ad41aa3517bf7d7c724 | [
"BSD-3-Clause"
] | 2 | 2020-04-18T20:04:24.000Z | 2021-09-19T05:07:41.000Z | #include "stdafx.h"
#include "sgviewer.h"
#include "sgviewerDoc.h"
#include "createCube.h"
#include <io/File.h>
#include <io/DirectoryInputStreamArchive.h>
#include <sg/Mesh.h>
#include <sg/Texture.h>
#include <sg/LineList.h>
#include <sg/Scene.h>
#include <sg/Model.h>
#include <sg/TriangleList.h>
#include ... | 27.839367 | 136 | 0.613328 | [
"mesh",
"model",
"transform"
] |
7e3cee1782bc5705df5ef2780549cf7189a2f43a | 4,919 | cpp | C++ | application/dialogs/LoginDialog.cpp | StephenGss/Polycraft-Launcher | d70f6729dba876e0252b075dcfd4c9caa45113b2 | [
"Apache-2.0"
] | 3 | 2020-10-08T19:55:33.000Z | 2021-11-28T04:02:39.000Z | application/dialogs/LoginDialog.cpp | StephenGss/Polycraft-Launcher | d70f6729dba876e0252b075dcfd4c9caa45113b2 | [
"Apache-2.0"
] | null | null | null | application/dialogs/LoginDialog.cpp | StephenGss/Polycraft-Launcher | d70f6729dba876e0252b075dcfd4c9caa45113b2 | [
"Apache-2.0"
] | null | null | null | /* Copyright 2013-2018 PolycraftLauncher Contributors
*
* 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 applica... | 32.361842 | 120 | 0.705021 | [
"object"
] |
7e403f911c7dad162a9ccd1bf56c12e5d7ac5c85 | 2,144 | hpp | C++ | src/utils.hpp | berkonat/AtomNeighbors | 1ce0785c327c8c96309af6715e4804f589941262 | [
"MIT"
] | null | null | null | src/utils.hpp | berkonat/AtomNeighbors | 1ce0785c327c8c96309af6715e4804f589941262 | [
"MIT"
] | null | null | null | src/utils.hpp | berkonat/AtomNeighbors | 1ce0785c327c8c96309af6715e4804f589941262 | [
"MIT"
] | null | null | null | #include <vector>
#include <string>
std::vector<double> read_radius(std::string fname);
std::vector<double> read_xyz(std::string fname,
std::vector<double>* box_lengths);
template<typename T>
std::vector<T> vecslice(std::vector<T> const &A, int start, int step);
template<typename T>
std... | 33.5 | 84 | 0.688899 | [
"vector"
] |
7e48d9a1deba060c47e4d999509fcc5f75d891f1 | 34,609 | cpp | C++ | OVP/D3D9Client/D3D9Effect.cpp | Ybalrid/orbiter | 7bed82f845ea8347f238011367e07007b0a24099 | [
"MIT"
] | null | null | null | OVP/D3D9Client/D3D9Effect.cpp | Ybalrid/orbiter | 7bed82f845ea8347f238011367e07007b0a24099 | [
"MIT"
] | null | null | null | OVP/D3D9Client/D3D9Effect.cpp | Ybalrid/orbiter | 7bed82f845ea8347f238011367e07007b0a24099 | [
"MIT"
] | null | null | null | // ===========================================================================================
// D3D9Effect.cpp
// Part of the ORBITER VISUALISATION PROJECT (OVP)
// Dual licensed under GPL v3 and LGPL v3
// Copyright (C) 2011 - 2016 Jarmo Nikkanen
// ===================================================================... | 34.131164 | 175 | 0.623884 | [
"mesh",
"render",
"vector"
] |
7e4e1f4daa994038d01188dd661b4e7b6b7ff843 | 2,813 | hpp | C++ | auth.hpp | xen0napp/example | 81374f3cd6773af7860802d6819e71c1949212e1 | [
"MIT"
] | null | null | null | auth.hpp | xen0napp/example | 81374f3cd6773af7860802d6819e71c1949212e1 | [
"MIT"
] | null | null | null | auth.hpp | xen0napp/example | 81374f3cd6773af7860802d6819e71c1949212e1 | [
"MIT"
] | 1 | 2021-06-03T21:11:25.000Z | 2021-06-03T21:11:25.000Z | /*
Copyright (c) 2021-2022 [xen0n.app]
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, di... | 26.790476 | 93 | 0.693921 | [
"vector"
] |
7e4ebfec36bc4440dd970b98066110b6990880a4 | 9,483 | cpp | C++ | examples/GPIO/autoDrive.cpp | shawandshaw/rpi | bbe139f8cb51cde28d244f12b4da310ddbba1fc1 | [
"MIT"
] | null | null | null | examples/GPIO/autoDrive.cpp | shawandshaw/rpi | bbe139f8cb51cde28d244f12b4da310ddbba1fc1 | [
"MIT"
] | null | null | null | examples/GPIO/autoDrive.cpp | shawandshaw/rpi | bbe139f8cb51cde28d244f12b4da310ddbba1fc1 | [
"MIT"
] | 1 | 2018-10-18T03:10:53.000Z | 2018-10-18T03:10:53.000Z | #include <iostream>
#include <stdlib.h>
#include <vector>
#include <opencv2/highgui.hpp>
#include <opencv2/imgproc.hpp>
#include <opencv2/opencv.hpp>
#include <signal.h>
#include <termios.h>
#include <unistd.h>
#include "GPIOlib.h"
#define PI 3.1415926
//Uncomment this line at run-time to skip GUI rendering
//#def... | 27.25 | 115 | 0.65918 | [
"vector"
] |
7e561f588390d5672037e9582fd2df0905706c3c | 6,450 | cpp | C++ | example/wiki/graph/KokkosGraph_wiki_coloring.cpp | trmcnealy/kokkos-kernels | a952807dc29948b9eb1ae8486f553c23ad7e7806 | [
"BSD-3-Clause"
] | null | null | null | example/wiki/graph/KokkosGraph_wiki_coloring.cpp | trmcnealy/kokkos-kernels | a952807dc29948b9eb1ae8486f553c23ad7e7806 | [
"BSD-3-Clause"
] | null | null | null | example/wiki/graph/KokkosGraph_wiki_coloring.cpp | trmcnealy/kokkos-kernels | a952807dc29948b9eb1ae8486f553c23ad7e7806 | [
"BSD-3-Clause"
] | null | null | null | #include <vector>
#include <cstdio>
#include <cmath>
#include <sstream>
#include "Kokkos_Core.hpp"
#include "KokkosKernels_default_types.hpp"
#include "KokkosKernels_Handle.hpp"
#include "KokkosGraph_Distance1Color.hpp"
#include "KokkosGraph_Distance2Color.hpp"
//Greedy Graph Coloring
// -Generate the graph for a rec... | 39.090909 | 121 | 0.687752 | [
"shape",
"vector"
] |
7e582d66e6ec1f58b22b8a33be6c50542a907b85 | 262 | cpp | C++ | acmicpc.net/13129.cpp | kbu1564/SimpleAlgorithm | 7e5b0d2fe19461417d88de0addd2235da55787d3 | [
"MIT"
] | 4 | 2016-04-15T07:54:39.000Z | 2021-01-11T09:02:16.000Z | acmicpc.net/13129.cpp | kbu1564/SimpleAlgorithm | 7e5b0d2fe19461417d88de0addd2235da55787d3 | [
"MIT"
] | null | null | null | acmicpc.net/13129.cpp | kbu1564/SimpleAlgorithm | 7e5b0d2fe19461417d88de0addd2235da55787d3 | [
"MIT"
] | null | null | null | #include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
using namespace std;
int main() {
int A, B, N;
cin >> A >> B >> N;
for (int i = 1; i <= N; i++) {
cout << A * N + B * i << " ";
}
cout << endl;
return 0;
}
| 16.375 | 31 | 0.545802 | [
"vector"
] |
7e612d60bce50419b7dbec60af00e4a303a1fda2 | 1,058 | cpp | C++ | Online-Judges/CodeForces/900/320A.Magic_Numbers.cpp | shihab4t/Competitive-Programming | e8eec7d4f7d86bfa1c00b7fbbedfd6a1518f19be | [
"Unlicense"
] | 3 | 2021-06-15T01:19:23.000Z | 2022-03-16T18:23:53.000Z | Online-Judges/CodeForces/900/320A.Magic_Numbers.cpp | shihab4t/Competitive-Programming | e8eec7d4f7d86bfa1c00b7fbbedfd6a1518f19be | [
"Unlicense"
] | null | null | null | Online-Judges/CodeForces/900/320A.Magic_Numbers.cpp | shihab4t/Competitive-Programming | e8eec7d4f7d86bfa1c00b7fbbedfd6a1518f19be | [
"Unlicense"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
//typedef
typedef long long int lli;
typedef long double ld;
//define
#define endn "\n"
#define faststdio ios_base::sync_with_stdio(false);
#define fastcincout cin.tie(NULL); cout.tie(NULL);
#define fastio faststdio fastcincout
#define tc(sl) int T; cin >>T; while (T--) {sl... | 21.591837 | 69 | 0.516068 | [
"vector"
] |
7e72bd0d4024cca7f77e96cbefc6607498fc32f3 | 11,281 | cpp | C++ | src/fmd.cpp | softmaterialslab/nanoconfinement-cpmd | 0e59ba29c5f411bd67dc6d3b7daf6c3e76b42b0a | [
"BSD-3-Clause"
] | null | null | null | src/fmd.cpp | softmaterialslab/nanoconfinement-cpmd | 0e59ba29c5f411bd67dc6d3b7daf6c3e76b42b0a | [
"BSD-3-Clause"
] | null | null | null | src/fmd.cpp | softmaterialslab/nanoconfinement-cpmd | 0e59ba29c5f411bd67dc6d3b7daf6c3e76b42b0a | [
"BSD-3-Clause"
] | null | null | null | // This is fictitious molecular dynamics
// This program is used to estimate the correct w(k)'s on the interface
#include "fmd.h"
void fmd(vector<PARTICLE> &ion, INTERFACE &box, CONTROL &fmdremote, CONTROL &cpmdremote) {
// Part I : Initialize
for (unsigned int k = 0; k < box.leftplane.size(); k++) {
... | 58.755208 | 214 | 0.582041 | [
"vector"
] |
7e7641f53c3d6555c449c26318021c2a977d07db | 11,781 | cpp | C++ | camera/hal/mediatek/mtkcam/utils/imgbuf/ImageBufferHeap.cpp | strassek/chromiumos-platform2 | 12c953f41f48b8a6b0bd1c181d09bdb1de38325c | [
"BSD-3-Clause"
] | 4 | 2020-07-24T06:54:16.000Z | 2021-06-16T17:13:53.000Z | camera/hal/mediatek/mtkcam/utils/imgbuf/ImageBufferHeap.cpp | strassek/chromiumos-platform2 | 12c953f41f48b8a6b0bd1c181d09bdb1de38325c | [
"BSD-3-Clause"
] | 1 | 2021-04-02T17:35:07.000Z | 2021-04-02T17:35:07.000Z | camera/hal/mediatek/mtkcam/utils/imgbuf/ImageBufferHeap.cpp | strassek/chromiumos-platform2 | 12c953f41f48b8a6b0bd1c181d09bdb1de38325c | [
"BSD-3-Clause"
] | 1 | 2020-11-04T22:31:45.000Z | 2020-11-04T22:31:45.000Z | /*
* Copyright (C) 2019 MediaTek Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agr... | 37.519108 | 80 | 0.47984 | [
"vector"
] |
7e764bca0bd2eba9d988b7daf04af00c8ab9b745 | 12,846 | cpp | C++ | tests/Basic/BlockchainSynchronizer/main.cpp | CASH2-js/cash2 | 17d5582ec41149567fcad12ba58c392fab502097 | [
"BSD-3-Clause"
] | null | null | null | tests/Basic/BlockchainSynchronizer/main.cpp | CASH2-js/cash2 | 17d5582ec41149567fcad12ba58c392fab502097 | [
"BSD-3-Clause"
] | null | null | null | tests/Basic/BlockchainSynchronizer/main.cpp | CASH2-js/cash2 | 17d5582ec41149567fcad12ba58c392fab502097 | [
"BSD-3-Clause"
] | 1 | 2020-05-13T19:39:58.000Z | 2020-05-13T19:39:58.000Z | // Copyright (c) 2018-2020 The Cash2 developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "gtest/gtest.h"
#include "helperFunctions.h"
#include "Transfers/BlockchainSynchronizer.h"
#include "CryptoNoteCore/Cry... | 34.907609 | 290 | 0.778219 | [
"vector"
] |
7e7cf7edf5cc7a098b3e313bc880af959431c061 | 10,441 | cpp | C++ | src/statement.cpp | holodnii/Mython-Interpreter | e06aa9fca3646c1d0ebadbe03fa6c0e34af97546 | [
"MIT"
] | null | null | null | src/statement.cpp | holodnii/Mython-Interpreter | e06aa9fca3646c1d0ebadbe03fa6c0e34af97546 | [
"MIT"
] | null | null | null | src/statement.cpp | holodnii/Mython-Interpreter | e06aa9fca3646c1d0ebadbe03fa6c0e34af97546 | [
"MIT"
] | null | null | null | #include "statement.h"
#include <iostream>
#include <sstream>
#include <utility>
using namespace std;
namespace ast{
using runtime::Closure;
using runtime::Context;
using runtime::ObjectHolder;
namespace{
const string ADD_METHOD = "__add__"s;
const string INIT_METHOD = "__init__"s;
}
... | 31.074405 | 99 | 0.674456 | [
"object",
"vector"
] |
7e8018ac3b074fe72a178dbc3aa00edeac9e3dd9 | 711 | cpp | C++ | nonrepeatingnumberwhileothernumbersrepeatktimes.cpp | procheta1999/dsaonechallenge | b89608f473c6dc164eeb33107563dd1b1e2e05c9 | [
"MIT"
] | null | null | null | nonrepeatingnumberwhileothernumbersrepeatktimes.cpp | procheta1999/dsaonechallenge | b89608f473c6dc164eeb33107563dd1b1e2e05c9 | [
"MIT"
] | null | null | null | nonrepeatingnumberwhileothernumbersrepeatktimes.cpp | procheta1999/dsaonechallenge | b89608f473c6dc164eeb33107563dd1b1e2e05c9 | [
"MIT"
] | null | null | null | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int k;
cin>>k;
int num=0;
vector<int> arr;
vector<int> arr32(32,0);
for(int i=0;i<n;i++)
{
int el;
int x=0;
cin>>el;
arr.push_back(el);
while(el)
{
... | 16.159091 | 38 | 0.367089 | [
"vector"
] |
7e89b56b05ef8ff6ec4e75bd8a1b1f101b5cdc7a | 6,270 | hxx | C++ | src/mdtrec.hxx | re-Isearch/re-Isearch | f2a2012c1814b0940a6004b6186a5e6896c1135a | [
"BSD-4-Clause-UC",
"Apache-2.0"
] | 2 | 2022-02-05T17:48:29.000Z | 2022-02-06T15:25:04.000Z | src/mdtrec.hxx | re-Isearch/re-Isearch | f2a2012c1814b0940a6004b6186a5e6896c1135a | [
"BSD-4-Clause-UC",
"Apache-2.0"
] | null | null | null | src/mdtrec.hxx | re-Isearch/re-Isearch | f2a2012c1814b0940a6004b6186a5e6896c1135a | [
"BSD-4-Clause-UC",
"Apache-2.0"
] | 1 | 2022-03-30T20:14:00.000Z | 2022-03-30T20:14:00.000Z | /*
Copyright (c) 2020-21 Project re-Isearch and its contributors: See CONTRIBUTORS.
It is made available and licensed under the Apache 2.0 license: see LICENSE
*/
/************************************************************************
************************************************************************/
/*@@@
Fi... | 29.857143 | 90 | 0.662679 | [
"object"
] |
7e90343c7c1d85f25d4d30b6e250d67df4c7eb84 | 1,066 | cpp | C++ | src/process.cpp | LucasSabbatini/udacity_cpp_system_monitor_project | 537c25bdcd7e4199b2aefefff94bb833471bbe09 | [
"MIT"
] | null | null | null | src/process.cpp | LucasSabbatini/udacity_cpp_system_monitor_project | 537c25bdcd7e4199b2aefefff94bb833471bbe09 | [
"MIT"
] | null | null | null | src/process.cpp | LucasSabbatini/udacity_cpp_system_monitor_project | 537c25bdcd7e4199b2aefefff94bb833471bbe09 | [
"MIT"
] | null | null | null | #include <unistd.h>
#include <cctype>
#include <sstream>
#include <string>
#include <vector>
#include "process.h"
#include "linux_parser.h"
using std::string;
using std::to_string;
using std::vector;
Process::Process(int pid) : _pid(pid) {
_user = LinuxParser::User(_pid);
_command = LinuxParser::Command(_pid);
}... | 27.333333 | 99 | 0.712946 | [
"vector"
] |
7ea79d685cc789654f41f3e7294c4a3fa7ccb57c | 707 | cpp | C++ | 239.cpp | ducthienbui97/Random-leetcode | 209cbf537319875735b5dea876103f13eecef6d1 | [
"MIT"
] | null | null | null | 239.cpp | ducthienbui97/Random-leetcode | 209cbf537319875735b5dea876103f13eecef6d1 | [
"MIT"
] | null | null | null | 239.cpp | ducthienbui97/Random-leetcode | 209cbf537319875735b5dea876103f13eecef6d1 | [
"MIT"
] | null | null | null | // Leetcode 239. Sliding Window Maximum
class Solution {
public:
deque<int> slide;
void insert(vector<int>&nums, int idx){
while(!slide.empty() && nums[slide.back()] < nums[idx])
slide.pop_back();
slide.push_back(idx);
}
void check(int k){
while(!slide.empty() && slid... | 28.28 | 66 | 0.506365 | [
"vector"
] |
7ea92b2d550fee9170668487f96dbe4c217650f6 | 6,409 | cpp | C++ | src/application/tools/app_report_settings_loader.cpp | lpea/cppinclude | dc126c6057d2fe30569e6e86f66d2c8eebb50212 | [
"MIT"
] | 177 | 2020-08-24T19:20:35.000Z | 2022-03-27T01:58:04.000Z | src/application/tools/app_report_settings_loader.cpp | lpea/cppinclude | dc126c6057d2fe30569e6e86f66d2c8eebb50212 | [
"MIT"
] | 15 | 2020-08-30T17:59:42.000Z | 2022-01-12T11:14:10.000Z | src/application/tools/app_report_settings_loader.cpp | lpea/cppinclude | dc126c6057d2fe30569e6e86f66d2c8eebb50212 | [
"MIT"
] | 11 | 2020-09-17T23:31:10.000Z | 2022-03-04T13:15:21.000Z | #include "application/tools/app_report_settings_loader.hpp"
#include "application/exceptions/app_incorrect_thousands_separator_impl.hpp"
#include "application/tools/app_configuration_file.hpp"
#include "application/tools/app_parser_arg_wrapper.hpp"
#include "reporter/api/rp_factory.hpp"
#include "reporter/api/rp_sett... | 30.374408 | 80 | 0.655328 | [
"vector"
] |
7eaced5ee3cb996c2a2bc8fb4c94c5833b8370bb | 747 | cpp | C++ | leetcode/5554.cpp | upupming/algorithm | 44edcffe886eaf4ce8c7b27a8db50d7ed5d29ef1 | [
"MIT"
] | 107 | 2019-10-25T07:46:59.000Z | 2022-03-29T11:10:56.000Z | leetcode/5554.cpp | upupming/algorithm | 44edcffe886eaf4ce8c7b27a8db50d7ed5d29ef1 | [
"MIT"
] | 1 | 2021-08-13T05:42:27.000Z | 2021-08-13T05:42:27.000Z | leetcode/5554.cpp | upupming/algorithm | 44edcffe886eaf4ce8c7b27a8db50d7ed5d29ef1 | [
"MIT"
] | 18 | 2020-12-09T14:24:22.000Z | 2022-03-30T06:56:01.000Z | // https://leetcode.com/contest/weekly-contest-213/problems/check-array-formation-through-concatenation/
#include <bits/stdc++.h>
using namespace std;
// Input: arr = [91,4,64,78], pieces = [[78],[4,64],[91]]
class Solution {
public:
bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces) {
for... | 37.35 | 104 | 0.515395 | [
"vector"
] |
9d1909344b710b9cb00d5f3fa441a54721af43b4 | 27,012 | hpp | C++ | SDK/PUBG_PhysXVehicles_classes.hpp | realrespecter/PUBG-FULL-SDK | 5e2b0f103c74c95d2329c4c9dfbfab48aa0da737 | [
"MIT"
] | 7 | 2019-03-06T11:04:52.000Z | 2019-07-10T20:00:51.000Z | SDK/PUBG_PhysXVehicles_classes.hpp | realrespecter/PUBG-FULL-SDK | 5e2b0f103c74c95d2329c4c9dfbfab48aa0da737 | [
"MIT"
] | null | null | null | SDK/PUBG_PhysXVehicles_classes.hpp | realrespecter/PUBG-FULL-SDK | 5e2b0f103c74c95d2329c4c9dfbfab48aa0da737 | [
"MIT"
] | 10 | 2019-03-06T11:53:46.000Z | 2021-02-18T14:01:11.000Z | #pragma once
// PUBG FULL SDK - Generated By Respecter (5.3.4.11 [06/03/2019]) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "PUBG_PhysXVehicles_structs.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//-------------------------------------... | 84.677116 | 272 | 0.485303 | [
"mesh"
] |
9d19d06093ed16e4704792209399eb4f12191782 | 2,608 | cpp | C++ | Computer Vision/KL.cpp | yashgandhijee2018/Applications-of-C- | 7c030f9bf7b748aa8227b987db0b398f6d500b96 | [
"MIT"
] | null | null | null | Computer Vision/KL.cpp | yashgandhijee2018/Applications-of-C- | 7c030f9bf7b748aa8227b987db0b398f6d500b96 | [
"MIT"
] | null | null | null | Computer Vision/KL.cpp | yashgandhijee2018/Applications-of-C- | 7c030f9bf7b748aa8227b987db0b398f6d500b96 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
#define mod 1000000007
#define small INT_MIN
#define large INT_MAX
#define inl long long
#define ll long long
#define ld long double
#define lli long long int
#define rep(i,n) for(ll i=0;i<n;i++)
#define f(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep2(i,j,n) rep(i,n) rep(j... | 22.101695 | 77 | 0.488113 | [
"vector"
] |
9d1b0b6b825a25ccc3c051602ae9dc3a5b338aa0 | 10,191 | cpp | C++ | src/audio/sndlistener.cpp | dream-overflow/o3d | 087ab870cc0fd9091974bb826e25c23903a1dde0 | [
"FSFAP"
] | 2 | 2019-06-22T23:29:44.000Z | 2019-07-07T18:34:04.000Z | src/audio/sndlistener.cpp | dream-overflow/o3d | 087ab870cc0fd9091974bb826e25c23903a1dde0 | [
"FSFAP"
] | null | null | null | src/audio/sndlistener.cpp | dream-overflow/o3d | 087ab870cc0fd9091974bb826e25c23903a1dde0 | [
"FSFAP"
] | null | null | null | /**
* @file sndlistener.cpp
* @brief Implementation of SndListener.h
* @author Frederic SCHERMA (frederic.scherma@dreamoverflow.org)
* @date 2003-04-11
* @copyright Copyright (c) 2001-2017 Dream Overflow. All rights reserved.
* @details
*/
#include "o3d/audio/precompiled.h"
#include "o3d/audio/sndlistener.h"
... | 27.103723 | 123 | 0.744382 | [
"object",
"model"
] |
9d1d8ad4577f96cb3f3bab59ccf0c0e3d3cd5f7b | 6,435 | cpp | C++ | Assignments/Final_Project/src2/main.cpp | CaoSY/PittCompMethods | 853c36676df140eecd249bd9905eb9fa704f1585 | [
"MIT"
] | null | null | null | Assignments/Final_Project/src2/main.cpp | CaoSY/PittCompMethods | 853c36676df140eecd249bd9905eb9fa704f1585 | [
"MIT"
] | null | null | null | Assignments/Final_Project/src2/main.cpp | CaoSY/PittCompMethods | 853c36676df140eecd249bd9905eb9fa704f1585 | [
"MIT"
] | null | null | null | #include <charmonia.h>
#include <visual.h>
#include <iostream>
#include <string>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <memory>
#include <sstream>
#include <QApplication>
#include <QToolBar>
#include <QAction>
#include <QTextEdit>
#include <QFont>
#include <QatPlotWidgets/MultipleViewWindow... | 35.163934 | 126 | 0.548096 | [
"vector"
] |
9d1fab32358ed5ddf1a60ef7b052e66c8ad0ea57 | 803 | cpp | C++ | jmedia/filter/filter_buffersink.cpp | paopaol/jmedia | 9aa083b107892a2c8c80b150523229155978f013 | [
"MIT"
] | 2 | 2020-05-11T08:45:00.000Z | 2021-12-15T01:25:06.000Z | jmedia/filter/filter_buffersink.cpp | paopaol/jmedia | 9aa083b107892a2c8c80b150523229155978f013 | [
"MIT"
] | null | null | null | jmedia/filter/filter_buffersink.cpp | paopaol/jmedia | 9aa083b107892a2c8c80b150523229155978f013 | [
"MIT"
] | 1 | 2021-01-11T09:28:33.000Z | 2021-01-11T09:28:33.000Z |
#include "filter_buffersink.h"
extern "C"{
#include <libavfilter/buffersrc.h>
#include <libavutil/channel_layout.h>
#include <libavutil/opt.h>
}
#include <assert.h>
namespace JMedia{
FilterBuffersink::FilterBuffersink(FilterGraph *filter_graph, const std::string &name):
Filter(name)
{
m... | 25.09375 | 110 | 0.694894 | [
"vector"
] |
9d20e306f7e54cf72e271198c243ad788213574f | 2,930 | cpp | C++ | experimental/Pomdog.Experimental/Skeletal2D/AnimationSystem.cpp | ValtoForks/pomdog | 73798ae5f4a4c3b9b1e1e96239187c4b842c93b2 | [
"MIT"
] | null | null | null | experimental/Pomdog.Experimental/Skeletal2D/AnimationSystem.cpp | ValtoForks/pomdog | 73798ae5f4a4c3b9b1e1e96239187c4b842c93b2 | [
"MIT"
] | null | null | null | experimental/Pomdog.Experimental/Skeletal2D/AnimationSystem.cpp | ValtoForks/pomdog | 73798ae5f4a4c3b9b1e1e96239187c4b842c93b2 | [
"MIT"
] | null | null | null | // Copyright (c) 2013-2018 mogemimi. Distributed under the MIT license.
#include "AnimationSystem.hpp"
#include "AnimationClip.hpp"
#include "AnimationState.hpp"
#include "JointIndex.hpp"
#include "Skeleton.hpp"
#include "SkeletonPose.hpp"
#include "SkeletonHelper.hpp"
#include "Pomdog/Math/Matrix4x4.hpp"
#include "Po... | 27.383178 | 105 | 0.717406 | [
"vector"
] |
9d2408ca66028523f7cd39b1326a33164212fa36 | 12,791 | cc | C++ | lib/debugger_utils/jobs.cc | PowerOlive/garnet | 16b5b38b765195699f41ccb6684cc58dd3512793 | [
"BSD-3-Clause"
] | null | null | null | lib/debugger_utils/jobs.cc | PowerOlive/garnet | 16b5b38b765195699f41ccb6684cc58dd3512793 | [
"BSD-3-Clause"
] | null | null | null | lib/debugger_utils/jobs.cc | PowerOlive/garnet | 16b5b38b765195699f41ccb6684cc58dd3512793 | [
"BSD-3-Clause"
] | null | null | null | // Copyright 2018 The Fuchsia 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 "garnet/lib/debugger_utils/jobs.h"
#include <inttypes.h>
#include <stdlib.h>
#include <list>
#include <lib/zx/job.h>
#include <lib/zx/process.h... | 30.382423 | 79 | 0.628958 | [
"object"
] |
9d2937491a8ebdb060e5203c0b437008969269e8 | 658 | cpp | C++ | examples.legacy/critical_point_tracking_2d/main1.cpp | robertu94/ftk | 96c53ec21b795bb596908910b0b6d379f3dca157 | [
"MIT"
] | null | null | null | examples.legacy/critical_point_tracking_2d/main1.cpp | robertu94/ftk | 96c53ec21b795bb596908910b0b6d379f3dca157 | [
"MIT"
] | null | null | null | examples.legacy/critical_point_tracking_2d/main1.cpp | robertu94/ftk | 96c53ec21b795bb596908910b0b6d379f3dca157 | [
"MIT"
] | null | null | null | #include <ftk/filters/critical_point_tracker_2d_regular.hh>
#include <ftk/ndarray/synthetic.hh>
#include <ftk/ndarray/grad.hh>
#if FTK_HAVE_VTK
#include <ftk/geometry/points2vtk.hh>
#endif
const int DW = 256, DH = 256, DT = 10;
int main(int argc, char **argv)
{
diy::mpi::environment env;
auto scalar = ftk::synt... | 22.689655 | 61 | 0.743161 | [
"geometry"
] |
9d2b5975f1c3a5e0e765651733da9edaf870635a | 482 | cpp | C++ | Day1(Arrays)/287.FindtheDuplicateNumber.cpp | rishusingh022/30-Days-of-Code | 021fa9ab5fca81912ea97853746a49ffd011e249 | [
"MIT"
] | null | null | null | Day1(Arrays)/287.FindtheDuplicateNumber.cpp | rishusingh022/30-Days-of-Code | 021fa9ab5fca81912ea97853746a49ffd011e249 | [
"MIT"
] | null | null | null | Day1(Arrays)/287.FindtheDuplicateNumber.cpp | rishusingh022/30-Days-of-Code | 021fa9ab5fca81912ea97853746a49ffd011e249 | [
"MIT"
] | null | null | null | //space complexity jada hai bas
class Solution {
public:
int findDuplicate(vector<int>& nums) {
int n=nums.size();
vector<int> frequency(n);
for(int i=0;i<n;i++){
frequency[nums[i]]++;
}
int result=0;
for(int i=0;i<n;i++){
if(frequency[i]>1){
... | 22.952381 | 57 | 0.479253 | [
"vector"
] |
9d329109ebb3d4aa3185d1c4404ff7cf93ff14a4 | 4,005 | hpp | C++ | external/vulkancts/modules/vulkan/sparse_resources/vktSparseResourcesBase.hpp | hustwei/deqp | 812d768b55dcedf2c0fda63e69db3c05600f379d | [
"Apache-2.0"
] | null | null | null | external/vulkancts/modules/vulkan/sparse_resources/vktSparseResourcesBase.hpp | hustwei/deqp | 812d768b55dcedf2c0fda63e69db3c05600f379d | [
"Apache-2.0"
] | null | null | null | external/vulkancts/modules/vulkan/sparse_resources/vktSparseResourcesBase.hpp | hustwei/deqp | 812d768b55dcedf2c0fda63e69db3c05600f379d | [
"Apache-2.0"
] | null | null | null | #ifndef _VKTSPARSERESOURCESBASE_HPP
#define _VKTSPARSERESOURCESBASE_HPP
/*------------------------------------------------------------------------
* Vulkan Conformance Tests
* ------------------------
*
* Copyright (c) 2016 The Khronos Group Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");... | 31.785714 | 113 | 0.669663 | [
"vector"
] |
9d3418ea3a40c69e4e8925c6809aebca83b83a25 | 1,377 | cpp | C++ | day-05.cpp | MarioLiebisch/Advent-of-Code-2020 | da8b2e8e86fa473818a690df2219d4f9c7abd9b6 | [
"MIT"
] | null | null | null | day-05.cpp | MarioLiebisch/Advent-of-Code-2020 | da8b2e8e86fa473818a690df2219d4f9c7abd9b6 | [
"MIT"
] | null | null | null | day-05.cpp | MarioLiebisch/Advent-of-Code-2020 | da8b2e8e86fa473818a690df2219d4f9c7abd9b6 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <set>
#include "utility.h"
auto day05part1(const std::vector<aoc::BoardingPass>& passes) -> unsigned int {
unsigned int highest = 0;
for (const auto& pass : passes) {
if (pass.id > highest) {
highe... | 28.102041 | 91 | 0.595497 | [
"vector"
] |
9d34216fab4e9120a3dac09d4f7006d348eb79b4 | 18,111 | hpp | C++ | novelty.hpp | guillaumeboehm/gaga | f0d59718fa8222b72dc590685330ce2b798ef783 | [
"MIT"
] | null | null | null | novelty.hpp | guillaumeboehm/gaga | f0d59718fa8222b72dc590685330ce2b798ef783 | [
"MIT"
] | null | null | null | novelty.hpp | guillaumeboehm/gaga | f0d59718fa8222b72dc590685330ce2b798ef783 | [
"MIT"
] | null | null | null | #pragma once
#include <chrono>
#include <vector>
#include "gaga.hpp"
namespace GAGA {
// Just to be clear on the terms:
// signature = signature = phenotype/behavior/feature characterization
//
//
template <typename DNA, typename sig> struct NoveltyIndividual : public Individual<DNA> {
using sig_t = sig;
using ba... | 38.208861 | 89 | 0.638893 | [
"vector"
] |
9d452e5dd3cea0150b33b312be674b3a4831bad3 | 5,221 | hpp | C++ | src/cep/search_manager.hpp | mogproject/cluster-editing-2021 | 20356800d594f3aaae9cad30a52af3c6f94f049b | [
"Apache-2.0"
] | 1 | 2021-06-23T19:53:25.000Z | 2021-06-23T19:53:25.000Z | src/cep/search_manager.hpp | mogproject/cluster-editing-2021 | 20356800d594f3aaae9cad30a52af3c6f94f049b | [
"Apache-2.0"
] | null | null | null | src/cep/search_manager.hpp | mogproject/cluster-editing-2021 | 20356800d594f3aaae9cad30a52af3c6f94f049b | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "rand_search.hpp"
#include "branch_and_bound.hpp"
namespace mog {
namespace cep {
template <int L>
class SearchManager {
public:
// Types
typedef mog::data::Graph<L> G;
static constexpr int const N = L * B;
static std::vector<mog::data::Edge> run(G const& root, int seed = 12345) {
... | 32.030675 | 119 | 0.502777 | [
"vector"
] |
9d45ce16431e0a8afb8160992bc63b69c596d444 | 9,905 | cc | C++ | src/graph.cc | mathstuf/ninja | abd33d5e3b11ae5470f62cbce49723a4cf62870d | [
"Apache-2.0"
] | null | null | null | src/graph.cc | mathstuf/ninja | abd33d5e3b11ae5470f62cbce49723a4cf62870d | [
"Apache-2.0"
] | null | null | null | src/graph.cc | mathstuf/ninja | abd33d5e3b11ae5470f62cbce49723a4cf62870d | [
"Apache-2.0"
] | null | null | null | // Copyright 2011 Google Inc. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable... | 31.444444 | 80 | 0.630692 | [
"vector"
] |
9d46993dab28a2549145b33835dc7c43d0122161 | 5,175 | cpp | C++ | test-suite/creditriskplus.cpp | jiangjiali/QuantLib | 37c98eccfa18a95acb1e98b276831641be92b38e | [
"BSD-3-Clause"
] | 3,358 | 2015-12-18T02:56:17.000Z | 2022-03-31T02:42:47.000Z | test-suite/creditriskplus.cpp | jiangjiali/QuantLib | 37c98eccfa18a95acb1e98b276831641be92b38e | [
"BSD-3-Clause"
] | 965 | 2015-12-21T10:35:28.000Z | 2022-03-30T02:47:00.000Z | test-suite/creditriskplus.cpp | jiangjiali/QuantLib | 37c98eccfa18a95acb1e98b276831641be92b38e | [
"BSD-3-Clause"
] | 1,663 | 2015-12-17T17:45:38.000Z | 2022-03-31T07:58:29.000Z | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2013 Peter Caspers
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/o... | 40.748031 | 83 | 0.643478 | [
"vector",
"model"
] |
9d598d81713b0b3e3dab1e1fdd6cc2d0e87ee553 | 2,462 | cpp | C++ | src/game/src/systems/system_manager.cpp | Sampas/cavez | b89185554477b92bf987c9e5d26b0a8abe1ae568 | [
"MIT"
] | 2 | 2019-03-11T11:26:52.000Z | 2019-09-26T07:50:55.000Z | src/game/src/systems/system_manager.cpp | Sampas/cavez | b89185554477b92bf987c9e5d26b0a8abe1ae568 | [
"MIT"
] | 1 | 2020-10-29T15:44:47.000Z | 2020-10-29T15:44:47.000Z | src/game/src/systems/system_manager.cpp | Sampas/cavez | b89185554477b92bf987c9e5d26b0a8abe1ae568 | [
"MIT"
] | 1 | 2020-10-28T18:56:46.000Z | 2020-10-28T18:56:46.000Z | /// Copyright (c) 2019 Joni Louhela
///
/// 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, pub... | 44.763636 | 95 | 0.721771 | [
"render"
] |
9d60c5b130ce57ab6f5d0932b821dce729d2ebbf | 6,982 | cpp | C++ | cyberdog_ception/cyberdog_scenedetection/scenedetection/src/scene_detection.cpp | gitter-badger/cyberdog_ros2 | f995b3cbf5773a47cd2d7293b0622d91fb409cdc | [
"Apache-2.0"
] | 9 | 2021-12-27T02:51:35.000Z | 2022-03-07T14:08:28.000Z | cyberdog_ception/cyberdog_scenedetection/scenedetection/src/scene_detection.cpp | gitter-badger/cyberdog_ros2 | f995b3cbf5773a47cd2d7293b0622d91fb409cdc | [
"Apache-2.0"
] | 1 | 2021-12-21T03:05:58.000Z | 2021-12-21T03:05:58.000Z | cyberdog_ception/cyberdog_scenedetection/scenedetection/src/scene_detection.cpp | gitter-badger/cyberdog_ros2 | f995b3cbf5773a47cd2d7293b0622d91fb409cdc | [
"Apache-2.0"
] | 3 | 2021-10-24T01:14:44.000Z | 2021-12-20T11:54:41.000Z | // Copyright (c) 2021 Beijing Xiaomi Mobile Software Co., Ltd. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//... | 30.757709 | 95 | 0.743054 | [
"vector"
] |
9d621df5aca928385f634596342432748fb14a84 | 26,191 | cpp | C++ | src/main.cpp | Q2499279972/klotski | 18c16546432f407f74d0c77c41453f5366f6d65f | [
"MIT"
] | 1 | 2017-09-09T13:13:09.000Z | 2017-09-09T13:13:09.000Z | src/main.cpp | Q2499279972/klotski | 18c16546432f407f74d0c77c41453f5366f6d65f | [
"MIT"
] | null | null | null | src/main.cpp | Q2499279972/klotski | 18c16546432f407f74d0c77c41453f5366f6d65f | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <windows.h>
#include "window.hpp"
#include "Klotski.hpp"
#include "texture.hpp"
#include "misc.hpp"
#include "history.hpp"
#include "RightButtonMenu.hpp"
#include "ReadLuaConfig.hpp"
#include <gl/glext.h>
#define VERSIONSTRING "0.01"
static int delaycnt=0;
void KlotskiBloc... | 37.848266 | 143 | 0.390554 | [
"shape"
] |
9d7e3234c33184aabf2078af19e43391822b6746 | 6,366 | cpp | C++ | src/layers/legacy/medUtilities/medUtilitiesVTK.cpp | arthursw/medInria-public | d52af882c36f0d96cc433cc1a4082accaa1ca11a | [
"BSD-4-Clause"
] | null | null | null | src/layers/legacy/medUtilities/medUtilitiesVTK.cpp | arthursw/medInria-public | d52af882c36f0d96cc433cc1a4082accaa1ca11a | [
"BSD-4-Clause"
] | null | null | null | src/layers/legacy/medUtilities/medUtilitiesVTK.cpp | arthursw/medInria-public | d52af882c36f0d96cc433cc1a4082accaa1ca11a | [
"BSD-4-Clause"
] | null | null | null | #include "medUtilities.h"
#include "medUtilitiesVTK.h"
#include <dtkCoreSupport/dtkAbstractProcessFactory.h>
#include <medAbstractProcessLegacy.h>
#include <vtkCellData.h>
#include <vtkLinearTransform.h>
#include <vtkMetaDataSet.h>
#include <vtkPointData.h>
#include <vtkPolyData.h>
medAbstractData* medUtilitiesVTK:... | 32.314721 | 144 | 0.544769 | [
"mesh"
] |
9d84b76f1cfc999419dcf7427f26595c3342509b | 7,175 | cpp | C++ | win32gui/win32textarea.cpp | matthew-macgregor/blitzplus_msvc2019 | 2a4b3b8b9f8e9b7ad2dc81bd80e08bb62c98bcdc | [
"Zlib"
] | 69 | 2015-01-04T08:42:44.000Z | 2022-03-13T09:56:24.000Z | win32gui/win32textarea.cpp | JamesLinus/blitzplus | a4615c064f99a70fdd131554b6f5e2241611aff9 | [
"Zlib"
] | 3 | 2016-09-24T04:13:55.000Z | 2021-11-04T11:11:44.000Z | win32gui/win32textarea.cpp | JamesLinus/blitzplus | a4615c064f99a70fdd131554b6f5e2241611aff9 | [
"Zlib"
] | 29 | 2015-05-14T03:59:52.000Z | 2020-07-25T02:46:25.000Z |
#include "win32textarea.h"
#include <vector>
using std::vector;
static DWORD CALLBACK streamIn( DWORD cookie,BYTE *buff,LONG n,LONG *n_out ){
const char **p=(const char**)cookie;
const char *t=*p;
while( n-- && *t ) *buff++=*t++;
*n_out=t-*p;
*p=t;
return 0;
}
static DWORD CALLBACK streamOut( DWORD cookie,BY... | 23.145161 | 95 | 0.6977 | [
"vector"
] |
9d8c525d0f6a92de30f8cdc7d026204341cd3c30 | 3,146 | hpp | C++ | include/dracosha/validator/utils/is_container.hpp | evgeniums/cpp-validator | e4feccdce19c249369ddb631571b60613926febd | [
"BSL-1.0"
] | 27 | 2020-09-18T13:45:33.000Z | 2022-03-16T21:14:37.000Z | include/dracosha/validator/utils/is_container.hpp | evgeniums/cpp-validator | e4feccdce19c249369ddb631571b60613926febd | [
"BSL-1.0"
] | 7 | 2020-08-07T21:48:14.000Z | 2021-01-14T12:25:37.000Z | include/dracosha/validator/utils/is_container.hpp | evgeniums/cpp-validator | e4feccdce19c249369ddb631571b60613926febd | [
"BSL-1.0"
] | 1 | 2021-03-30T09:17:58.000Z | 2021-03-30T09:17:58.000Z | /**
@copyright Evgeny Sidorov 2020
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
*/
/****************************************************************************/
/** @file validator/utils/is_container.hpp
*
* Defines helpe... | 29.401869 | 98 | 0.534965 | [
"object"
] |
9d8d4c69f19fb158f7314e2ffc4c54de8226b400 | 7,996 | cc | C++ | plugins/eeui/WeexSDK/ios/weex_core/Source/js_runtime/runtime/runtime_values.cc | bonniesl/yktapp | 3f96b7aad945e9aa110f0643d9a57e28d0645ab6 | [
"MIT"
] | null | null | null | plugins/eeui/WeexSDK/ios/weex_core/Source/js_runtime/runtime/runtime_values.cc | bonniesl/yktapp | 3f96b7aad945e9aa110f0643d9a57e28d0645ab6 | [
"MIT"
] | null | null | null | plugins/eeui/WeexSDK/ios/weex_core/Source/js_runtime/runtime/runtime_values.cc | bonniesl/yktapp | 3f96b7aad945e9aa110f0643d9a57e28d0645ab6 | [
"MIT"
] | null | null | null | /**
# Copyright 2018 Taobao (China) Inc.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agr... | 30.06015 | 88 | 0.518134 | [
"object"
] |
9d8f4e6d2fdbc82bf95a20371d21849f2f2ac47f | 3,257 | cpp | C++ | source/FAST/Examples/Segmentation/convertMeshToSegmentation.cpp | SINTEFMedtek/FAST | d4c1ec49bd542f78d84c00e990bbedd2126cfffa | [
"BSD-2-Clause"
] | 3 | 2019-12-13T07:53:51.000Z | 2020-02-05T09:11:58.000Z | source/FAST/Examples/Segmentation/convertMeshToSegmentation.cpp | SINTEFMedtek/FAST | d4c1ec49bd542f78d84c00e990bbedd2126cfffa | [
"BSD-2-Clause"
] | 1 | 2020-02-05T09:28:37.000Z | 2020-02-05T09:28:37.000Z | source/FAST/Examples/Segmentation/convertMeshToSegmentation.cpp | SINTEFMedtek/FAST | d4c1ec49bd542f78d84c00e990bbedd2126cfffa | [
"BSD-2-Clause"
] | 1 | 2020-12-10T12:40:59.000Z | 2020-12-10T12:40:59.000Z | #include <FAST/Algorithms/MeshToSegmentation/MeshToSegmentation.hpp>
#include <FAST/Importers/VTKMeshFileImporter.hpp>
#include <FAST/Tools/CommandLineParser.hpp>
#include <FAST/Exporters/MetaImageExporter.hpp>
#include <FAST/Importers/MetaImageImporter.hpp>
#include <FAST/Visualization/SimpleWindow.hpp>
#include <FAST... | 43.426667 | 118 | 0.678846 | [
"mesh",
"3d"
] |
9d9f2162dc177cf94127b9ca9f4e7fb125617ecc | 2,818 | cpp | C++ | cpp/equation-solver/src/Main.cpp | sigalor/lookwhaticando | 46dae592ad1664e9439c71dee285340a3e55ed5f | [
"Apache-2.0"
] | 3 | 2018-04-11T17:54:07.000Z | 2018-10-23T04:33:00.000Z | cpp/equation-solver/src/Main.cpp | sigalor/lookwhaticando | 46dae592ad1664e9439c71dee285340a3e55ed5f | [
"Apache-2.0"
] | null | null | null | cpp/equation-solver/src/Main.cpp | sigalor/lookwhaticando | 46dae592ad1664e9439c71dee285340a3e55ed5f | [
"Apache-2.0"
] | 3 | 2018-04-11T02:44:23.000Z | 2019-12-21T22:47:53.000Z | #include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
#include <stdexcept>
#include "Formula.hpp"
#include "Condition.hpp"
#include "LinearSystem.hpp"
void quit(int code=0)
{
std::cout << "\n\nFinished.\n";
exit(code);
}
int main()
{
std::vector<std::string> conditionsSt... | 27.359223 | 161 | 0.614265 | [
"vector"
] |
9da4cf802276456ba660640e1ce1c921045e4960 | 3,052 | cpp | C++ | src/devices/bus/tmc600/euro.cpp | Robbbert/messui | 49b756e2140d8831bc81335298ee8c5471045e79 | [
"BSD-3-Clause"
] | 26 | 2015-03-31T06:25:51.000Z | 2021-12-14T09:29:04.000Z | src/devices/bus/tmc600/euro.cpp | Robbbert/messui | 49b756e2140d8831bc81335298ee8c5471045e79 | [
"BSD-3-Clause"
] | null | null | null | src/devices/bus/tmc600/euro.cpp | Robbbert/messui | 49b756e2140d8831bc81335298ee8c5471045e79 | [
"BSD-3-Clause"
] | 10 | 2015-03-27T05:45:51.000Z | 2022-02-04T06:57:36.000Z | // license:BSD-3-Clause
// copyright-holders:Curt Coder
/**********************************************************************
Telercas Telmac TMC-600 Eurobus emulation
**********************************************************************/
#include "emu.h"
#include "euro.h"
//*******************************... | 38.632911 | 137 | 0.539646 | [
"model"
] |
9da57775def77432bc01d46e6d8f8e85785d9dbf | 1,284 | cpp | C++ | src/frontend/frontend.cpp | ericmei/graphit-exploratory | aa12687a1a0c714653cff0503f4c154488097cfb | [
"MIT"
] | null | null | null | src/frontend/frontend.cpp | ericmei/graphit-exploratory | aa12687a1a0c714653cff0503f4c154488097cfb | [
"MIT"
] | null | null | null | src/frontend/frontend.cpp | ericmei/graphit-exploratory | aa12687a1a0c714653cff0503f4c154488097cfb | [
"MIT"
] | null | null | null | //
// Created by Yunming Zhang on 1/15/17.
//
#include <graphit/frontend/frontend.h>
#include <graphit/frontend/parser.h>
namespace graphit {
/// Parses, typechecks and turns a given Simit-formated stream into Simit IR.
int Frontend::parseStream(std::istream &programStream, FIRContext *context, std::vector... | 28.533333 | 114 | 0.61215 | [
"vector"
] |
9dabc84d47a526356192f8e4fc68de4320fa789d | 185 | cpp | C++ | minimize_maximum_pair_sum_in_array.cpp | spencercjh/sync-leetcode-today-problem-cpp-example | 178a974e5848e3a620f4565170b459d50ecfdd6b | [
"Apache-2.0"
] | null | null | null | minimize_maximum_pair_sum_in_array.cpp | spencercjh/sync-leetcode-today-problem-cpp-example | 178a974e5848e3a620f4565170b459d50ecfdd6b | [
"Apache-2.0"
] | 1 | 2020-12-17T07:54:03.000Z | 2020-12-17T08:00:22.000Z | minimize_maximum_pair_sum_in_array.cpp | spencercjh/sync-leetcode-today-problem-cpp-example | 178a974e5848e3a620f4565170b459d50ecfdd6b | [
"Apache-2.0"
] | null | null | null | package leetcode
// https://leetcode-cn.com/problems/minimize-maximum-pair-sum-in-array/
class MinimizeMaximumPairSumInArray {
public:
int minPairSum(vector<int>& nums) {
}
}; | 20.555556 | 71 | 0.735135 | [
"vector"
] |
9daef77b6da99e2ca85848ba294a432bd9ec5cb5 | 4,102 | cpp | C++ | test/test_clip.cpp | nextgis-borsch/lib_geojsonvt | d24412747fe3054ce4d645767bc0f2eae97a72f5 | [
"ISC"
] | null | null | null | test/test_clip.cpp | nextgis-borsch/lib_geojsonvt | d24412747fe3054ce4d645767bc0f2eae97a72f5 | [
"ISC"
] | null | null | null | test/test_clip.cpp | nextgis-borsch/lib_geojsonvt | d24412747fe3054ce4d645767bc0f2eae97a72f5 | [
"ISC"
] | 1 | 2018-08-01T11:28:18.000Z | 2018-08-01T11:28:18.000Z | #include "util.hpp"
#include <mapbox/geojsonvt/clip.hpp>
#include <gtest/gtest.h>
using namespace mapbox::geojsonvt;
ProjectedPoint intersectX(const ProjectedPoint& p0, const ProjectedPoint& p1, double x) {
return { x, (x - p0.x) * (p1.y - p0.y) / (p1.x - p0.x) + p0.y };
}
using F = ProjectedFeature;
using P = P... | 36.300885 | 100 | 0.537543 | [
"geometry",
"vector"
] |
9daf0e1c14b6a038d810fe05c6f1db9e4d799a8a | 34,421 | cpp | C++ | cpp/basix/e-lagrange.cpp | FEniCS/libtab | 653b783d90be2501e03813cad0ce572a679bf46a | [
"MIT"
] | 3 | 2020-11-19T19:17:06.000Z | 2020-12-04T11:00:26.000Z | cpp/basix/e-lagrange.cpp | FEniCS/libtab | 653b783d90be2501e03813cad0ce572a679bf46a | [
"MIT"
] | 33 | 2020-11-08T18:55:27.000Z | 2020-12-14T10:08:19.000Z | cpp/basix/e-lagrange.cpp | FEniCS/libtab | 653b783d90be2501e03813cad0ce572a679bf46a | [
"MIT"
] | 1 | 2020-11-23T19:40:31.000Z | 2020-11-23T19:40:31.000Z | // Copyright (c) 2020 Chris Richardson & Matthew Scroggs
// FEniCS Project
// SPDX-License-Identifier: MIT
#include "e-lagrange.h"
#include "lattice.h"
#include "maps.h"
#include "moments.h"
#include "polynomials.h"
#include "polyset.h"
#include "quadrature.h"
#include <xtensor/xbuilder.hpp>
#include <xtensor/xpad.... | 32.813155 | 80 | 0.485953 | [
"shape",
"vector"
] |
9db2b9dc5e35c90485e6b290e808168c2acd32f1 | 665 | cpp | C++ | 10050 Hartals.cpp | zihadboss/UVA-Solutions | 020fdcb09da79dc0a0411b04026ce3617c09cd27 | [
"Apache-2.0"
] | 86 | 2016-01-20T11:36:50.000Z | 2022-03-06T19:43:14.000Z | 10050 Hartals.cpp | Mehedishihab/UVA-Solutions | 474fe3d9d9ba574b97fd40ca5abb22ada95654a1 | [
"Apache-2.0"
] | null | null | null | 10050 Hartals.cpp | Mehedishihab/UVA-Solutions | 474fe3d9d9ba574b97fd40ca5abb22ada95654a1 | [
"Apache-2.0"
] | 113 | 2015-12-04T06:40:57.000Z | 2022-02-11T02:14:28.000Z | #include <iostream>
#include <vector>
using namespace std;
int parties[123];
int N, P;
bool IsDayOff(int d)
{
for (int i = 0; i < P; ++i)
if (d % parties[i] == 0)
return true;
return false;
}
int main()
{
int T;
cin >> T;
while (T--)
{
cin >> N >> P;... | 16.219512 | 56 | 0.354887 | [
"vector"
] |
9db7d5590e547ce1f7d56ad29325f202e2080a59 | 6,654 | cpp | C++ | src/qt/qtwebkit/Source/WebCore/css/CSSSegmentedFontFace.cpp | viewdy/phantomjs | eddb0db1d253fd0c546060a4555554c8ee08c13c | [
"BSD-3-Clause"
] | 1 | 2015-05-27T13:52:20.000Z | 2015-05-27T13:52:20.000Z | src/qt/qtwebkit/Source/WebCore/css/CSSSegmentedFontFace.cpp | mrampersad/phantomjs | dca6f77a36699eb4e1c46f7600cca618f01b0ac3 | [
"BSD-3-Clause"
] | null | null | null | src/qt/qtwebkit/Source/WebCore/css/CSSSegmentedFontFace.cpp | mrampersad/phantomjs | dca6f77a36699eb4e1c46f7600cca618f01b0ac3 | [
"BSD-3-Clause"
] | 1 | 2017-03-19T13:03:23.000Z | 2017-03-19T13:03:23.000Z | /*
* Copyright (C) 2008 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions a... | 35.206349 | 230 | 0.695521 | [
"object",
"vector"
] |
9dbd90590edd0692e2aa41b6fe0c62408e33917d | 1,842 | cpp | C++ | CSES/Dynamic_Range_min.cpp | aldew5/Competitve-Programming | eb0b93a35af3bd5e806aedc44b835830af01d496 | [
"MIT"
] | 2 | 2020-05-09T15:54:18.000Z | 2021-01-23T22:32:53.000Z | CSES/Dynamic_Range_min.cpp | aldew5/Competitive-Programming | fc93723fae739d0b06bcf2dbe3b9274584a79a66 | [
"MIT"
] | null | null | null | CSES/Dynamic_Range_min.cpp | aldew5/Competitive-Programming | fc93723fae739d0b06bcf2dbe3b9274584a79a66 | [
"MIT"
] | null | null | null | /*
ID: alec3
LANG: C++14
PROG:
*/
/*
*/
#include <bits/stdc++.h>
#define check(x) cout<<(#x)<<": "<<x<<" " << endl;
#define line cout << "--------------------" << endl;
#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ss second
#define ff first
#define pb push_back
#define lb lower_bound
#... | 20.241758 | 65 | 0.497828 | [
"vector"
] |
e38804efb8aab8e90b03b6bffe1c9542548863ed | 9,781 | cpp | C++ | test/SpanIntervalTest.cpp | JunLi-Galios/repel | e4e7f4ffc95f8d65dd478861080c9c77bab9b797 | [
"MIT"
] | null | null | null | test/SpanIntervalTest.cpp | JunLi-Galios/repel | e4e7f4ffc95f8d65dd478861080c9c77bab9b797 | [
"MIT"
] | null | null | null | test/SpanIntervalTest.cpp | JunLi-Galios/repel | e4e7f4ffc95f8d65dd478861080c9c77bab9b797 | [
"MIT"
] | null | null | null | #define BOOST_TEST_MODULE SpanInterval
#define BOOST_TEST_MAIN
#include "../src/config.h"
#ifdef USE_DYNAMIC_UNIT_TEST
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#else
#include <boost/test/included/unit_test.hpp>
#endif
#include <boost/optional.hpp>
#include <boost/assign/list_of.hpp>
#include "..... | 32.280528 | 260 | 0.632962 | [
"vector"
] |
e38bc3bac710332bfaa06fa2476d2955e9de2221 | 275 | cpp | C++ | chess_game/source/piece.cpp | mwkpe/apeiron-examples | dc28324479b4583478b68ee0251af8969b0ff5cf | [
"MIT"
] | null | null | null | chess_game/source/piece.cpp | mwkpe/apeiron-examples | dc28324479b4583478b68ee0251af8969b0ff5cf | [
"MIT"
] | null | null | null | chess_game/source/piece.cpp | mwkpe/apeiron-examples | dc28324479b4583478b68ee0251af8969b0ff5cf | [
"MIT"
] | null | null | null | #include "piece.h"
example::chess::Piece::Piece(Type type, Chess_color color, const apeiron::opengl::Model* model)
: type_{type}, chess_color_{color}, model_{model}
{
}
void example::chess::Piece::render() const
{
for (const auto& mesh : *model_)
mesh.render();
}
| 18.333333 | 95 | 0.683636 | [
"mesh",
"render",
"model"
] |
e390e08778c0d4a0da9d80032019a615ce534bb5 | 8,175 | cpp | C++ | jni/SDL/src/core/android/SDL_android.cpp | kerlw/CorsixTH-Android | 283c787d87f3f48954e0fb1877b679e60c065062 | [
"MIT"
] | 1 | 2015-11-06T03:21:09.000Z | 2015-11-06T03:21:09.000Z | jni/SDL/src/core/android/SDL_android.cpp | kerlw/CorsixTH-Android | 283c787d87f3f48954e0fb1877b679e60c065062 | [
"MIT"
] | null | null | null | jni/SDL/src/core/android/SDL_android.cpp | kerlw/CorsixTH-Android | 283c787d87f3f48954e0fb1877b679e60c065062 | [
"MIT"
] | null | null | null | /*
SDL - Simple DirectMedia Layer
Copyright (C) 1997-2011 Sam Lantinga
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later ve... | 31.442308 | 89 | 0.701774 | [
"object"
] |
e396113a43a4ccb79170b4240c26025519f54975 | 7,438 | cpp | C++ | examples/diffusion_2d/diffusion_2d.cpp | ikorotkin/dae-cpp | 4c538d5d82d95a2147efe0dce742831750d6184f | [
"MIT"
] | 31 | 2019-05-10T17:56:23.000Z | 2022-02-23T09:22:11.000Z | examples/diffusion_2d/diffusion_2d.cpp | ikorotkin/dae-cpp | 4c538d5d82d95a2147efe0dce742831750d6184f | [
"MIT"
] | 17 | 2019-05-09T16:11:42.000Z | 2021-07-13T09:12:01.000Z | examples/diffusion_2d/diffusion_2d.cpp | ikorotkin/dae-cpp | 4c538d5d82d95a2147efe0dce742831750d6184f | [
"MIT"
] | 6 | 2019-12-11T13:21:31.000Z | 2021-09-30T12:00:24.000Z | /*
* This example solves the system of ODEs that describes diffusion in 2D plane:
*
* dC/dt = D*(d/dx(dC/dx) + d/dy(dC/dy)),
*
* where C is the concentration (dimensionless) on the square unit domain,
* 0 <= x <= 1 and 0 <= y <= 1. D is the diffusion coefficient.
*
* Initial condition is an instantaneous point ... | 31.516949 | 80 | 0.574348 | [
"vector"
] |
e3a37e35640315f72b0115796392e9aa5aa1a1a4 | 28,942 | cpp | C++ | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/app/CDownloadManager.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 7 | 2017-07-13T10:34:54.000Z | 2021-04-16T05:40:35.000Z | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/app/CDownloadManager.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | null | null | null | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/app/CDownloadManager.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
//
// ... | 34.332147 | 123 | 0.651199 | [
"object"
] |
e3a94c776e57180785fd30abd4d16e94a3750769 | 5,217 | cpp | C++ | CENTRAL 3D/Source/ImporterScene.cpp | AitorSimona/3DEngines | 01700230b4733e6976fb14971dcc835374f8db12 | [
"MIT"
] | 2 | 2020-01-20T12:28:42.000Z | 2020-05-10T23:06:58.000Z | CENTRAL 3D/Source/ImporterScene.cpp | AitorSimona/3DEngines | 01700230b4733e6976fb14971dcc835374f8db12 | [
"MIT"
] | 3 | 2020-01-20T13:15:28.000Z | 2020-04-07T10:53:53.000Z | CENTRAL 3D/Source/ImporterScene.cpp | AitorSimona/3DEngines | 01700230b4733e6976fb14971dcc835374f8db12 | [
"MIT"
] | 4 | 2019-10-22T20:56:48.000Z | 2021-01-10T14:24:43.000Z | #include "ImporterScene.h"
#include "Application.h"
#include "ModuleResourceManager.h"
#include "ModuleFileSystem.h"
#include "ModuleSceneManager.h"
#include "ResourceScene.h"
#include "GameObject.h"
#include "ImporterMeta.h"
#include "ResourceMeta.h"
#include "mmgr/mmgr.h"
ImporterScene::ImporterScene() : Importer(... | 34.098039 | 270 | 0.677017 | [
"vector",
"model"
] |
e3ae12c71fd7dc4cb9fe545c3b940232eec52e0e | 2,144 | cpp | C++ | Mina.cpp | VictorCastao/NEPS_Academy-Resolvidos | 71800aaf24770fde368e62b223bdf2b8099817eb | [
"MIT"
] | null | null | null | Mina.cpp | VictorCastao/NEPS_Academy-Resolvidos | 71800aaf24770fde368e62b223bdf2b8099817eb | [
"MIT"
] | null | null | null | Mina.cpp | VictorCastao/NEPS_Academy-Resolvidos | 71800aaf24770fde368e62b223bdf2b8099817eb | [
"MIT"
] | null | null | null | #include <iostream>
#include <bitset>
#include <queue>
#include <cstdio>
using namespace std;
struct ponto{
int peso, x, y;
};
struct Comp{
bool operator()(const ponto& a, const ponto& b){
return a.peso>b.peso;
}
};
int main(){
int ordem, resp;
scanf("%d", &ordem);
int M[ordem][ordem];
for(int... | 20.815534 | 84 | 0.564366 | [
"vector"
] |
e3ae9d1add5de6c1ae9ba03da6fa48752e2462a9 | 21,625 | cpp | C++ | inetsrv/iis/svcs/staxcore/dnslib/mxdns.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | inetsrv/iis/svcs/staxcore/dnslib/mxdns.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | inetsrv/iis/svcs/staxcore/dnslib/mxdns.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | #include "dnsincs.h"
#include <stdlib.h>
extern void DeleteDnsRec(PSMTPDNS_RECS pDnsRec);
CAsyncMxDns::CAsyncMxDns(char *MyFQDN)
{
lstrcpyn(m_FQDNToDrop, MyFQDN, sizeof(m_FQDNToDrop));
m_fUsingMx = TRUE;
m_Index = 0;
m_LocalPref = 256;
m_SeenLocal = FALSE;
m_AuxList = NULL;
m_... | 31.708211 | 152 | 0.523422 | [
"object"
] |
e3af70abe87b0980efcd68270829a58225410a86 | 26,826 | cpp | C++ | enigma.cpp | blastdoor7/enigma | 01937f4d8a23b225aa968960d2fdf1a5f11dc48e | [
"MIT"
] | null | null | null | enigma.cpp | blastdoor7/enigma | 01937f4d8a23b225aa968960d2fdf1a5f11dc48e | [
"MIT"
] | null | null | null | enigma.cpp | blastdoor7/enigma | 01937f4d8a23b225aa968960d2fdf1a5f11dc48e | [
"MIT"
] | null | null | null | #include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <stdexcept>
#include <iostream>
#include <sstream>
#include <exception>
#include <limits>
#include <assert.h>
#include <time.h>
using namespace std;
const char* R... | 32.165468 | 236 | 0.557854 | [
"object",
"vector",
"transform"
] |
e3b3de91e24bb003b0d793b357084f514198634a | 310 | hpp | C++ | framework/include/star.hpp | flor2468/-CGLab_Wichmann121512_Doering119611 | ac9014ea402ed5e06c40ee9230488a2be5b55eb1 | [
"MIT"
] | 2 | 2020-11-13T15:59:08.000Z | 2020-11-13T16:04:22.000Z | framework/include/star.hpp | flor2468/CGLab_Wichmann121512_Doering119611 | ac9014ea402ed5e06c40ee9230488a2be5b55eb1 | [
"MIT"
] | null | null | null | framework/include/star.hpp | flor2468/CGLab_Wichmann121512_Doering119611 | ac9014ea402ed5e06c40ee9230488a2be5b55eb1 | [
"MIT"
] | null | null | null | #ifndef STAR_HPP
#define STAR_HPP
#include <iostream>
#include <cmath>
#include <math.h>
#include <list>
#include <../../external/glm-0.9.6.3/glm/glm.hpp>
struct Star {
std::vector<float> position_;
std::vector<float> color_;
std::vector<float> posColData_;
model_object model_;
};
#endif | 16.315789 | 49 | 0.677419 | [
"vector"
] |
e3c50eaed600fd532810b3a2574691ab7d18c61e | 6,196 | hpp | C++ | inference-engine/tests_deprecated/functional/shared_tests/single_layer_tests/activation_tests.hpp | anton-potapov/openvino | 84119afe9a8c965e0a0cd920fff53aee67b05108 | [
"Apache-2.0"
] | 2 | 2021-02-26T15:46:19.000Z | 2021-05-16T20:48:13.000Z | inference-engine/tests_deprecated/functional/shared_tests/single_layer_tests/activation_tests.hpp | anton-potapov/openvino | 84119afe9a8c965e0a0cd920fff53aee67b05108 | [
"Apache-2.0"
] | 4 | 2021-04-01T08:29:48.000Z | 2021-08-30T16:12:52.000Z | inference-engine/tests_deprecated/functional/shared_tests/single_layer_tests/activation_tests.hpp | anton-potapov/openvino | 84119afe9a8c965e0a0cd920fff53aee67b05108 | [
"Apache-2.0"
] | 3 | 2021-03-09T08:27:29.000Z | 2021-04-07T04:58:54.000Z | // Copyright (C) 2018-2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include <gtest/gtest.h>
#include <ie_core.hpp>
#include "tests_common.hpp"
#include "single_layer_common.hpp"
#include "ir_gen_helper.hpp"
using namespace ::testing;
using namespace InferenceEngine;
using namespace single_layer_t... | 34.422222 | 134 | 0.549548 | [
"model"
] |
e3c8a49ce77b25ab3cc9af34e05db04a86eae6bf | 7,704 | cpp | C++ | test/ssc_test/cmod_battwatts_test.cpp | NREL/ssc | bf6e73a89dbe81ac7c896d192929c28011bc6d24 | [
"BSD-3-Clause"
] | 61 | 2017-08-09T15:10:59.000Z | 2022-02-15T21:45:31.000Z | test/ssc_test/cmod_battwatts_test.cpp | NREL/ssc | 4ce1d67d0e709ff3f016135c80cdb6aca0fccf34 | [
"BSD-3-Clause"
] | 462 | 2017-07-31T21:26:46.000Z | 2022-03-30T22:53:50.000Z | test/ssc_test/cmod_battwatts_test.cpp | NREL/ssc | bf6e73a89dbe81ac7c896d192929c28011bc6d24 | [
"BSD-3-Clause"
] | 73 | 2017-08-24T17:39:31.000Z | 2022-03-28T08:37:47.000Z | /**
BSD-3-Clause
Copyright 2019 Alliance for Sustainable Energy, LLC
Redistribution and use in source and binary forms, with or without modification, are permitted provided
that the following conditions are met :
1. Redistributions of source code must retain the above copyright notice, this list of conditions
and the f... | 44.275862 | 117 | 0.757269 | [
"vector"
] |
e3cd5bdcb9fb66c8639d71cb57e54ff4828672fc | 3,309 | cpp | C++ | GEC_2/MarioBaseProject/GameScreenWinHatquest.cpp | nerolileung/cgd_year1 | 211e91c37831a388b1abe1a1cc496716a4e9ca44 | [
"MIT"
] | null | null | null | GEC_2/MarioBaseProject/GameScreenWinHatquest.cpp | nerolileung/cgd_year1 | 211e91c37831a388b1abe1a1cc496716a4e9ca44 | [
"MIT"
] | null | null | null | GEC_2/MarioBaseProject/GameScreenWinHatquest.cpp | nerolileung/cgd_year1 | 211e91c37831a388b1abe1a1cc496716a4e9ca44 | [
"MIT"
] | 1 | 2019-12-09T22:41:49.000Z | 2019-12-09T22:41:49.000Z | #include "GameScreenWinHatquest.h"
#include <fstream>
GameScreenWinHatquest::GameScreenWinHatquest(SDL_Renderer* renderer) : GameScreen::GameScreen(renderer){
mRenderer = renderer;
mTextParser = new TextParser(renderer);
mBackgroundTexture = new Texture2D(mRenderer);
if (!mBackgroundTexture->LoadFromFile("I... | 39.86747 | 105 | 0.711998 | [
"render"
] |
e3d2ac37a9e48ab595a28de93639ec90a3078555 | 3,714 | cpp | C++ | intro/intro.cpp | ddolzhenko/training_algos_2017_03 | e622b391a87b1ce0435854acad3cfaddcebb8bb8 | [
"MIT"
] | null | null | null | intro/intro.cpp | ddolzhenko/training_algos_2017_03 | e622b391a87b1ce0435854acad3cfaddcebb8bb8 | [
"MIT"
] | null | null | null | intro/intro.cpp | ddolzhenko/training_algos_2017_03 | e622b391a87b1ce0435854acad3cfaddcebb8bb8 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
template <class T>
ostream& operator<<(ostream& o, const vector<T>& v) {
o << "[";
for(auto& x : v) {
o << x << ", ";
}
return o << "]";
}
template <class TFunc, class TResult, class TParam1>
void test(TResult expect, TFunc f, TParam1 ... | 23.96129 | 81 | 0.475767 | [
"vector"
] |
e3dbfe812c223db9b07a95dfc3cd8290b50fb492 | 10,587 | hh | C++ | Shared/BrainCloudMatchMaking.hh | pascalf1309/braincloud-objc | d3519eb26d753515a0d57d2ce07fe26399c14fac | [
"Apache-2.0"
] | null | null | null | Shared/BrainCloudMatchMaking.hh | pascalf1309/braincloud-objc | d3519eb26d753515a0d57d2ce07fe26399c14fac | [
"Apache-2.0"
] | 3 | 2018-10-02T12:30:24.000Z | 2020-02-21T12:53:12.000Z | Shared/BrainCloudMatchMaking.hh | pascalf1309/braincloud-objc | d3519eb26d753515a0d57d2ce07fe26399c14fac | [
"Apache-2.0"
] | 5 | 2018-05-23T17:06:24.000Z | 2021-02-24T18:57:20.000Z | //
// BrainCloudMatchMaking.h
// brainCloudClientObjc
//
// Created by Hill, Bradley on 2015-08-10.
// Copyright (c) 2016 bitHeads. All rights reserved.
//
#import <Foundation/Foundation.h>
#import "BrainCloudCompletionBlocks.hh"
@class BrainCloudClient;
@interface BrainCloudMatchMaking : NSObject
/**
* Initia... | 37.017483 | 86 | 0.752338 | [
"object"
] |
e3de899f16760f6ff3c206d4a6c910a82665c5d6 | 5,431 | cpp | C++ | HP_ID_Print_App/Classes/PopupLayer/PopupLayer.cpp | yangboz/petulant-octo-dubstep | 61a475ee8a94ad7cb2ade4fab8911ea0d6857c1e | [
"MIT"
] | 1 | 2021-06-25T21:59:17.000Z | 2021-06-25T21:59:17.000Z | HP_ID_Print_App/Classes/PopupLayer/PopupLayer.cpp | yangboz/petulant-octo-dubstep | 61a475ee8a94ad7cb2ade4fab8911ea0d6857c1e | [
"MIT"
] | null | null | null | HP_ID_Print_App/Classes/PopupLayer/PopupLayer.cpp | yangboz/petulant-octo-dubstep | 61a475ee8a94ad7cb2ade4fab8911ea0d6857c1e | [
"MIT"
] | null | null | null | //
// PopupLayer.cpp
// TestCpp
//
// Created by leafsoar on 7/29/13.
//
//
#include "PopupLayer.h"
PopupLayer::PopupLayer() :
m__pMenu(NULL)
, m_contentPadding(0)
, m_contentPaddingTop(0)
, m_callbackListener(NULL)
, m_callback(NULL)
, m__sfBackGround(NULL)
, m__s9BackGround(NULL)
, m__ltContentText(NULL)
, m__lt... | 27.994845 | 134 | 0.719941 | [
"vector"
] |
e3f1fc525c296170564b218e2ab595e556263a60 | 2,257 | cpp | C++ | src/GSparseVolumesVdb/VdbUtil.cpp | matthew-reid/Graphtane | 3148039993da185cfb328f89b96c9e5a5b384197 | [
"MIT"
] | 38 | 2015-01-01T05:55:38.000Z | 2022-03-12T23:19:50.000Z | src/GSparseVolumesVdb/VdbUtil.cpp | matthew-reid/Graphtane | 3148039993da185cfb328f89b96c9e5a5b384197 | [
"MIT"
] | 1 | 2019-07-29T21:48:40.000Z | 2020-01-13T12:08:08.000Z | src/GSparseVolumesVdb/VdbUtil.cpp | matthew-reid/Graphtane | 3148039993da185cfb328f89b96c9e5a5b384197 | [
"MIT"
] | 8 | 2016-04-22T06:41:47.000Z | 2021-11-23T23:44:22.000Z | // Copyright (c) 2013-2014 Matthew Paul Reid
// 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, p... | 31.788732 | 126 | 0.727514 | [
"vector"
] |
e3f653bff25bb03e8231fc71f7789d4d76640316 | 2,466 | hh | C++ | include/kbbq/readutils.hh | adamjorr/cbbq | 9167b72599892a33493d8ebdc01fac33990c1738 | [
"MIT"
] | 4 | 2019-11-03T08:18:55.000Z | 2021-03-17T01:05:04.000Z | include/kbbq/readutils.hh | adamjorr/cbbq | 9167b72599892a33493d8ebdc01fac33990c1738 | [
"MIT"
] | 9 | 2019-02-11T22:33:03.000Z | 2021-05-21T05:34:46.000Z | include/kbbq/readutils.hh | adamjorr/cbbq | 9167b72599892a33493d8ebdc01fac33990c1738 | [
"MIT"
] | null | null | null | #ifndef READUTILS_H
#define READUTILS_H
#include <vector>
#include <unordered_map>
#include <string>
#include <errno.h>
//
#include <htslib/sam.h>
#include <htslib/kseq.h>
#include <htslib/bgzf.h>
#include "bloom.hh"
#include "covariateutils.hh"
#include "kseq.hh"
#define INFER_ERROR_BAD_QUAL 2
//fwd declare
namespa... | 31.615385 | 110 | 0.697486 | [
"vector"
] |
e3f91e5e87dfc109f61a23311a72a8db54d945f0 | 2,054 | cpp | C++ | leetcode/30_days_challenge/2021_2_Feb/27.cpp | bvbasavaraju/competitive_programming | a82ffc1b639588a84f4273b44285d57cdc2f4b11 | [
"Apache-2.0"
] | 1 | 2020-05-05T13:06:51.000Z | 2020-05-05T13:06:51.000Z | leetcode/30_days_challenge/2021_2_Feb/27.cpp | bvbasavaraju/competitive_programming | a82ffc1b639588a84f4273b44285d57cdc2f4b11 | [
"Apache-2.0"
] | null | null | null | leetcode/30_days_challenge/2021_2_Feb/27.cpp | bvbasavaraju/competitive_programming | a82ffc1b639588a84f4273b44285d57cdc2f4b11 | [
"Apache-2.0"
] | null | null | null | /****************************************************
Date: Feb 27th
link: https://leetcode.com/explore/challenge/card/february-leetcoding-challenge-2021/587/week-4-february-22nd-february-28th/3649/
****************************************************/
#include <iostream>
#include <vector>
#include <list>
#include <a... | 23.883721 | 129 | 0.597858 | [
"vector"
] |
e3fce6219f0cbabf981af869858fbbb02efed0b3 | 3,281 | cpp | C++ | lonestar/patternmining/rest_plan.cpp | bowu/Galois | 81f619a2bb1bdc95899729f2d96a7da38dd0c0a3 | [
"BSD-3-Clause"
] | null | null | null | lonestar/patternmining/rest_plan.cpp | bowu/Galois | 81f619a2bb1bdc95899729f2d96a7da38dd0c0a3 | [
"BSD-3-Clause"
] | null | null | null | lonestar/patternmining/rest_plan.cpp | bowu/Galois | 81f619a2bb1bdc95899729f2d96a7da38dd0c0a3 | [
"BSD-3-Clause"
] | null | null | null | #include "def.h"
#include <iostream>
RestPlan::RestPlan(ExecutionPlan& ep, int _id): id(_id), vertices(ep.vertices), rest(ep.restrictions) {
//construct the plans at each level for what we loop on
//first element on loopon is the set for v1
//first construct what they depend on, put them in
//This loop implem... | 32.485149 | 103 | 0.640354 | [
"vector"
] |
541548c126a3bbf8738d4313eb9fbb4720c7d552 | 530 | cpp | C++ | uppsrc/Updater/Updater.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | 2 | 2016-04-07T07:54:26.000Z | 2020-04-14T12:37:34.000Z | uppsrc/Updater/Updater.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | null | null | null | uppsrc/Updater/Updater.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | null | null | null | #include <CtrlLib/CtrlLib.h>
using namespace Upp;
GUI_APP_MAIN
{
const Vector<String>& cmdline = CommandLine();
SetDefaultCharset(CHARSET_WIN1250);
if(cmdline.IsEmpty())
{
Exclamation("[* UPDATER] should be run from another applications");
return;
}
String name = cmdline[0];
UpdateFile(name);
String exec ... | 22.083333 | 69 | 0.64717 | [
"vector"
] |
54162ad7cfa894f30d78c1fc96e845465d30050f | 3,676 | hpp | C++ | Libraries/Macaronlib/include/Macaronlib/Vector.hpp | Plunkerusr/podsOS | b68e2ebdaa4eb99366dea6cc5509ba0c92c3601a | [
"MIT"
] | 21 | 2021-08-22T19:06:54.000Z | 2022-03-31T12:44:30.000Z | Libraries/Macaronlib/include/Macaronlib/Vector.hpp | Plunkerusr/podsOS | b68e2ebdaa4eb99366dea6cc5509ba0c92c3601a | [
"MIT"
] | 1 | 2021-09-01T22:55:59.000Z | 2021-09-08T20:52:09.000Z | Libraries/Macaronlib/include/Macaronlib/Vector.hpp | Plunkerusr/podsOS | b68e2ebdaa4eb99366dea6cc5509ba0c92c3601a | [
"MIT"
] | null | null | null | #pragma once
#include "Common.hpp"
#include "Runtime.hpp"
#include "SimpleIterator.hpp"
template <typename T>
class Vector {
public:
Vector() = default;
Vector(size_t size)
: m_size(size)
, m_capacity(size)
{
m_data = (T*)malloc(m_capacity * sizeof(T));
}
Vector(const Vect... | 21.623529 | 70 | 0.480141 | [
"vector"
] |
5428019b61fabf905a9cb026eb193a9dc4d9b0e9 | 29,631 | cpp | C++ | asteria/src/statement.cpp | MaskRay/asteria | 56a9251f5bb80b92e5aff25eac145f8cd2495096 | [
"BSD-3-Clause"
] | null | null | null | asteria/src/statement.cpp | MaskRay/asteria | 56a9251f5bb80b92e5aff25eac145f8cd2495096 | [
"BSD-3-Clause"
] | null | null | null | asteria/src/statement.cpp | MaskRay/asteria | 56a9251f5bb80b92e5aff25eac145f8cd2495096 | [
"BSD-3-Clause"
] | null | null | null | // This file is part of Asteria.
// Copyleft 2018, LH_Mouse. All wrongs reserved.
#include "precompiled.hpp"
#include "statement.hpp"
#include "xpnode.hpp"
#include "global_context.hpp"
#include "analytic_context.hpp"
#include "executive_context.hpp"
#include "variable.hpp"
#include "instantiated_function.hpp"
#includ... | 43.897778 | 150 | 0.604873 | [
"object"
] |
f9b404c696c6a7633dda4df916b2d5aeb1ead2da | 4,756 | cpp | C++ | src/engine/scene/lights/SpotLight.cpp | kosua20/GL_Template | ba0dcf3c041389a333f6c21e674d1ddfea5e0a99 | [
"MIT"
] | 108 | 2016-11-15T20:27:46.000Z | 2019-05-22T01:09:58.000Z | src/engine/scene/lights/SpotLight.cpp | kosua20/GL_Template | ba0dcf3c041389a333f6c21e674d1ddfea5e0a99 | [
"MIT"
] | 1 | 2016-10-14T22:58:21.000Z | 2016-11-14T10:46:02.000Z | src/engine/scene/lights/SpotLight.cpp | kosua20/GL_Template | ba0dcf3c041389a333f6c21e674d1ddfea5e0a99 | [
"MIT"
] | 7 | 2017-08-05T21:44:36.000Z | 2019-02-22T02:48:25.000Z | #include "scene/lights/SpotLight.hpp"
#include "graphics/GPU.hpp"
#include "resources/Bounds.hpp"
SpotLight::SpotLight(const glm::vec3 & worldPosition, const glm::vec3 & worldDirection, const glm::vec3 & color, float innerAngle, float outerAngle, float radius) :
Light(color),
_lightDirection(glm::normalize(worldDire... | 38.983607 | 164 | 0.701009 | [
"vector",
"model"
] |
f9bfe706ec3643f2131310994865d3da3620361a | 1,092 | cpp | C++ | sorts/odd_even_sort/main.cpp | Kingcitaldo125/Sorts | ce6d60359497490e982640de39370d56d4f17eba | [
"Apache-2.0"
] | null | null | null | sorts/odd_even_sort/main.cpp | Kingcitaldo125/Sorts | ce6d60359497490e982640de39370d56d4f17eba | [
"Apache-2.0"
] | 5 | 2021-12-21T13:08:27.000Z | 2022-01-17T14:37:41.000Z | sorts/odd_even_sort/main.cpp | Kingcitaldo125/Sorts | ce6d60359497490e982640de39370d56d4f17eba | [
"Apache-2.0"
] | null | null | null | #include <algorithm>
#include <iostream>
#include <vector>
#include "SortUtils.hpp"
void odd_even_sort(std::vector<int>::iterator begin,
std::vector<int>::iterator end) {
bool swap = true;
while (swap) {
swap = false;
for (auto i = begin; i < end - 1; i += 2) {
const auto second =... | 25.395349 | 76 | 0.489927 | [
"vector"
] |
f9c43d28b1cadb7c4d7529b5076e83c491b06e2f | 1,980 | cpp | C++ | src/differentiation/differentiation.cpp | rvillegasm/Numalizer | 3903d070b168cf184cc14a6fb2b8368f82448634 | [
"MIT"
] | 3 | 2019-11-28T01:14:27.000Z | 2020-12-29T12:55:19.000Z | src/differentiation/differentiation.cpp | rvillegasm/Numalizer | 3903d070b168cf184cc14a6fb2b8368f82448634 | [
"MIT"
] | null | null | null | src/differentiation/differentiation.cpp | rvillegasm/Numalizer | 3903d070b168cf184cc14a6fb2b8368f82448634 | [
"MIT"
] | 4 | 2019-08-29T04:23:31.000Z | 2020-01-25T20:40:14.000Z |
#include "differentiation.h"
#include "../../lib/point.h"
#include "../../lib/exceptions.h"
#include <vector>
#include <iostream>
/**
* x, y lista de x y f(x)
* direction 0=backwards, 1=forward, 2 = central
*/
namespace numath{
namespace differentiation{
double differentiation( std::vec... | 38.823529 | 121 | 0.435354 | [
"vector"
] |
f9c46481cd325df1280a070186ccb91601569155 | 866 | cpp | C++ | src/39.cpp | dxscjx123/SwordOffer | e04958beb3f99c103f879b09f3da547679a208c4 | [
"MIT"
] | 3 | 2018-04-20T14:07:14.000Z | 2019-08-29T14:35:30.000Z | src/39.cpp | dxscjx123/SwordOffer | e04958beb3f99c103f879b09f3da547679a208c4 | [
"MIT"
] | null | null | null | src/39.cpp | dxscjx123/SwordOffer | e04958beb3f99c103f879b09f3da547679a208c4 | [
"MIT"
] | null | null | null | // 分析：
// 由于数组是递增有序的，定义头指针和尾指针。头+尾>num,尾后移，头+尾<num，
// 头前移。找到满足条件的元素，判断乘积大小是否进一步满足条件，更新结果。
class Solution {
public:
vector<int> FindNumbersWithSum(vector<int> array,int sum) {
if (array.empty())
return vector<int>();
int start = 0;
int end = array.size() - 1;
int head, tail;
int cursum = 0;
... | 16.980392 | 63 | 0.556582 | [
"vector"
] |
f9c4b8a82c668272700b7b3514361c8c9a9b2b19 | 1,249 | hpp | C++ | module-audio/Audio/test/MockEndpoint.hpp | bitigchi/MuditaOS | 425d23e454e09fd6ae274b00f8d19c57a577aa94 | [
"BSL-1.0"
] | 369 | 2021-11-10T09:20:29.000Z | 2022-03-30T06:36:58.000Z | module-audio/Audio/test/MockEndpoint.hpp | bitigchi/MuditaOS | 425d23e454e09fd6ae274b00f8d19c57a577aa94 | [
"BSL-1.0"
] | 149 | 2021-11-10T08:38:35.000Z | 2022-03-31T23:01:52.000Z | module-audio/Audio/test/MockEndpoint.hpp | bitigchi/MuditaOS | 425d23e454e09fd6ae274b00f8d19c57a577aa94 | [
"BSL-1.0"
] | 41 | 2021-11-10T08:30:37.000Z | 2022-03-29T08:12:46.000Z | // Copyright (c) 2017-2021, Mudita Sp. z.o.o. All rights reserved.
// For licensing, see https://github.com/mudita/MuditaOS/LICENSE.md
#pragma once
#include <Audio/Endpoint.hpp>
#include <gmock/gmock.h>
namespace testing::audio
{
class MockSink : public ::audio::Sink
{
public:
MOCK_METHOD(::au... | 35.685714 | 92 | 0.640512 | [
"vector"
] |
f9c91577bed18c31232fb44099d778007ad470d3 | 22,987 | cpp | C++ | src/assoc.cpp | njau-sri/rtm-gwas-assoc | db8d8ce2803e119e1034240a460c102ddf442a8a | [
"MIT"
] | null | null | null | src/assoc.cpp | njau-sri/rtm-gwas-assoc | db8d8ce2803e119e1034240a460c102ddf442a8a | [
"MIT"
] | null | null | null | src/assoc.cpp | njau-sri/rtm-gwas-assoc | db8d8ce2803e119e1034240a460c102ddf442a8a | [
"MIT"
] | null | null | null | #include <cmath>
#include <fstream>
#include <iostream>
#include <functional>
#include "version.h"
#include "cmdline.h"
#include "util.h"
#include "vcf.h"
#include "pheno.h"
#include "statsutil.h"
#include "lsfit.h"
#include "stepreg.h"
#include "anova.h"
using std::ptrdiff_t;
using std::size_t;
namespace {
struc... | 27.695181 | 118 | 0.435333 | [
"vector",
"model",
"transform"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.