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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4eebbe2162ead05950720b51dd843359298ae7f4 | 30,511 | cpp | C++ | ESMF/src/Infrastructure/Mesh/src/Moab/Range.cpp | joeylamcy/gchp | 0e1676300fc91000ecb43539cabf1f342d718fb3 | [
"NCSA",
"Apache-2.0",
"MIT"
] | 1 | 2018-07-05T16:48:58.000Z | 2018-07-05T16:48:58.000Z | ESMF/src/Infrastructure/Mesh/src/Moab/Range.cpp | joeylamcy/gchp | 0e1676300fc91000ecb43539cabf1f342d718fb3 | [
"NCSA",
"Apache-2.0",
"MIT"
] | 1 | 2022-03-04T16:12:02.000Z | 2022-03-04T16:12:02.000Z | ESMF/src/Infrastructure/Mesh/src/Moab/Range.cpp | joeylamcy/gchp | 0e1676300fc91000ecb43539cabf1f342d718fb3 | [
"NCSA",
"Apache-2.0",
"MIT"
] | null | null | null | /**
* MOAB, a Mesh-Oriented datABase, is a software component for creating,
* storing and accessing finite element mesh data.
*
* Copyright 2004 Sandia Corporation. Under the terms of Contract
* DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government
* retains certain rights in this software.
*
* This... | 28.947818 | 146 | 0.611255 | [
"mesh",
"vector"
] |
4ef163367f6b5197a80b70818c9a37283f2c8785 | 109,071 | cpp | C++ | source/utils/dx12/backend/rg_dx12_frontend.cpp | clayne/RGA | 7ed370e00b635c5b558d4af4eb050e2a38f77e53 | [
"MIT"
] | 97 | 2020-03-12T01:47:49.000Z | 2022-03-16T02:29:04.000Z | source/utils/dx12/backend/rg_dx12_frontend.cpp | clayne/RGA | 7ed370e00b635c5b558d4af4eb050e2a38f77e53 | [
"MIT"
] | 34 | 2020-03-10T16:38:48.000Z | 2022-03-19T04:05:04.000Z | source/utils/dx12/backend/rg_dx12_frontend.cpp | clayne/RGA | 7ed370e00b635c5b558d4af4eb050e2a38f77e53 | [
"MIT"
] | 14 | 2020-03-13T00:50:23.000Z | 2022-01-31T09:06:54.000Z | // D3D12.
#include <d3d12.h>
#include <d3dcompiler.h>
#include <d3dcommon.h>
#include <wrl.h>
#include "../backend/d3dx12.h"
// C++.
#include <cassert>
#include <iostream>
#include <sstream>
#include <locale>
#include <codecvt>
#include <vector>
#include <iomanip>
#include <algorithm>
// Local.
#inc... | 53.729557 | 202 | 0.498969 | [
"geometry",
"render",
"object",
"vector"
] |
f60196ab93fcb5c778a8c056e9da1b561a12ee55 | 461 | cpp | C++ | coursera/algorithms/week2/main.cpp | clpsz/algorithms | c537c65eea5176f64cb37af674c3f07bc7d47821 | [
"Apache-2.0"
] | 2 | 2019-08-14T09:32:07.000Z | 2019-12-22T10:54:35.000Z | coursera/algorithms/week2/main.cpp | clpsz/algorithms | c537c65eea5176f64cb37af674c3f07bc7d47821 | [
"Apache-2.0"
] | null | null | null | coursera/algorithms/week2/main.cpp | clpsz/algorithms | c537c65eea5176f64cb37af674c3f07bc7d47821 | [
"Apache-2.0"
] | null | null | null | #include "common.h"
#include "QuickSort.h"
#include <assert.h>
#include <stdio.h>
vector<int> datas;
void read_data()
{
int num;
while (cin >> num)
{
datas.push_back(num);
}
}
void print_data()
{
cout << "length: " << datas.size() << endl;
for (auto d : datas)
{
cout << d ... | 12.131579 | 47 | 0.507592 | [
"vector"
] |
f60aca291f47a694af0eecfa76d8f2228cd49b86 | 2,047 | cpp | C++ | input-output_example_gen/bench/mvt.cpp | dongchen-coder/symRIByInputOuputExamples | e7434699f44ceb01f153ac8623b5bafac57f8abf | [
"MIT"
] | null | null | null | input-output_example_gen/bench/mvt.cpp | dongchen-coder/symRIByInputOuputExamples | e7434699f44ceb01f153ac8623b5bafac57f8abf | [
"MIT"
] | null | null | null | input-output_example_gen/bench/mvt.cpp | dongchen-coder/symRIByInputOuputExamples | e7434699f44ceb01f153ac8623b5bafac57f8abf | [
"MIT"
] | null | null | null | #include "./utility/rt.h"
int N;
#define A_OFFSET 0
#define X1_OFFSET N * N
#define X2_OFFSET N * N + N
#define Y1_OFFSET N * N + N + N
#define Y2_OFFSET N * N + N + N + N
void runMvt_trace( double* a, double* x1, double* x2, double* y1, double* y2)
{
int i, j;
vector<int> idx;
for (i=0; i< N; i++)... | 23 | 77 | 0.465071 | [
"vector"
] |
f60b09f2c9b2f0eeec9384f0dd17d28f7408ba2c | 5,109 | hpp | C++ | hpx/runtime/agas/stubs/symbol_namespace.hpp | andreasbuhr/hpx | 4366a90aacbd3e95428a94ab24a1646a67459cc2 | [
"BSL-1.0"
] | null | null | null | hpx/runtime/agas/stubs/symbol_namespace.hpp | andreasbuhr/hpx | 4366a90aacbd3e95428a94ab24a1646a67459cc2 | [
"BSL-1.0"
] | null | null | null | hpx/runtime/agas/stubs/symbol_namespace.hpp | andreasbuhr/hpx | 4366a90aacbd3e95428a94ab24a1646a67459cc2 | [
"BSL-1.0"
] | null | null | null | ////////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2011 Bryce Adelstein-Lelbach
// Copyright (c) 2012-2013 Hartmut Kaiser
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_... | 34.755102 | 85 | 0.622431 | [
"vector"
] |
f60d388a69e05231ffd63f5f5148fb3816b291af | 18,953 | cpp | C++ | src/gfx/Shader/ShaderProgram.cpp | Robograde/Robograde | 2c9a7d0b8250ec240102d504127f5c54532cb2b0 | [
"Zlib"
] | 5 | 2015-10-11T10:22:39.000Z | 2019-07-24T10:09:13.000Z | src/gfx/Shader/ShaderProgram.cpp | Robograde/Robograde | 2c9a7d0b8250ec240102d504127f5c54532cb2b0 | [
"Zlib"
] | null | null | null | src/gfx/Shader/ShaderProgram.cpp | Robograde/Robograde | 2c9a7d0b8250ec240102d504127f5c54532cb2b0 | [
"Zlib"
] | null | null | null | /**************************************************
Zlib Copyright 2015 Henrik Johansson
***************************************************/
#include "ShaderProgram.h"
#include <utility/Logger.h>
gfx::ShaderProgram::ShaderProgram ( void )
{
m_LoadedShaders = false;
m_TextureCount = 0;
}
gfx::ShaderProgram::Sh... | 28.457958 | 151 | 0.580858 | [
"geometry"
] |
f6187204b12bf63ece9b847b00ab12cf68ad51e4 | 7,874 | cpp | C++ | Proj/XCOM Ai Behaviours Unknown/AI/Actions/MoveAction.cpp | PLockhart/XCOM-AI--Behaviours-Unknown | 73e82ae75ef09ba9463799f09ff999371927ef1e | [
"MIT"
] | null | null | null | Proj/XCOM Ai Behaviours Unknown/AI/Actions/MoveAction.cpp | PLockhart/XCOM-AI--Behaviours-Unknown | 73e82ae75ef09ba9463799f09ff999371927ef1e | [
"MIT"
] | null | null | null | Proj/XCOM Ai Behaviours Unknown/AI/Actions/MoveAction.cpp | PLockhart/XCOM-AI--Behaviours-Unknown | 73e82ae75ef09ba9463799f09ff999371927ef1e | [
"MIT"
] | null | null | null | #include "MoveAction.h"
#include "../AICharacter.h"
#include "../PathFinding.h"
MoveAction::MoveAction(int priority)
:Action(priority) {}
//Creates a new movement action with;
//the character that will be performing the action,
//the tile that the character must move to
MoveAction::MoveAction(AICharacter * characte... | 29.601504 | 125 | 0.729997 | [
"vector"
] |
f61f27d5bcbb7c34e3a07c47c849d167760528a1 | 5,425 | hpp | C++ | benchmarks/BenchmarkApp.hpp | irfanhamid/khyber | b6decef55ea199f884f2d77e049e979f1c7ba8bf | [
"Apache-2.0"
] | 1 | 2018-01-06T20:44:24.000Z | 2018-01-06T20:44:24.000Z | benchmarks/BenchmarkApp.hpp | irfanhamid/khyber | b6decef55ea199f884f2d77e049e979f1c7ba8bf | [
"Apache-2.0"
] | null | null | null | benchmarks/BenchmarkApp.hpp | irfanhamid/khyber | b6decef55ea199f884f2d77e049e979f1c7ba8bf | [
"Apache-2.0"
] | null | null | null | // Copyright 2014 Irfan Hamid
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writ... | 31.178161 | 145 | 0.641659 | [
"vector"
] |
f62525c9df2211a450a0e9385417ec05c280e10f | 1,690 | cpp | C++ | Unidad-2/Aula13/integerlist.cpp | luismoroco/ProgrCompetitiva | 011cdb18749a16d17fd635a7c36a8a21b2b643d9 | [
"BSD-3-Clause"
] | null | null | null | Unidad-2/Aula13/integerlist.cpp | luismoroco/ProgrCompetitiva | 011cdb18749a16d17fd635a7c36a8a21b2b643d9 | [
"BSD-3-Clause"
] | null | null | null | Unidad-2/Aula13/integerlist.cpp | luismoroco/ProgrCompetitiva | 011cdb18749a16d17fd635a7c36a8a21b2b643d9 | [
"BSD-3-Clause"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> res;
int i;
void solve(string x, string v){
deque<int> temp;
vector<int> t;
int cont = 0;
for (i = 0; i < v.length(); ++i){
if(v[i] == '[' || v[i] == ']' || v[i] == ','){continue;}
else{temp.push_back((int)v[i]-'0');++... | 22.236842 | 70 | 0.376923 | [
"vector"
] |
f626511b339af6b37373ad81f97337e8002e55d5 | 3,801 | hpp | C++ | include/touca/devkit/platform.hpp | cthulhu-irl/touca-cpp | 97392a1f84c7a92211ee86bcb527637a6c9a5cba | [
"Apache-2.0"
] | null | null | null | include/touca/devkit/platform.hpp | cthulhu-irl/touca-cpp | 97392a1f84c7a92211ee86bcb527637a6c9a5cba | [
"Apache-2.0"
] | null | null | null | include/touca/devkit/platform.hpp | cthulhu-irl/touca-cpp | 97392a1f84c7a92211ee86bcb527637a6c9a5cba | [
"Apache-2.0"
] | null | null | null | // Copyright 2021 Touca, Inc. Subject to Apache-2.0 License.
#pragma once
#include <memory>
#include <string>
#include <vector>
#include "touca/lib_api.hpp"
namespace touca {
struct Response {
Response(const int status, const std::string& body)
: status(status), body(body) {}
const int status = -1;
con... | 27.543478 | 76 | 0.661668 | [
"object",
"vector"
] |
f62a7c98528b03f941acf5279a7943ac1f9799af | 6,532 | hpp | C++ | source/framework/algorithm/include/lue/framework/algorithm/array_like.hpp | computationalgeography/lue | 71993169bae67a9863d7bd7646d207405dc6f767 | [
"MIT"
] | 2 | 2021-02-26T22:45:56.000Z | 2021-05-02T10:28:48.000Z | source/framework/algorithm/include/lue/framework/algorithm/array_like.hpp | pcraster/lue | e64c18f78a8b6d8a602b7578a2572e9740969202 | [
"MIT"
] | 262 | 2016-08-11T10:12:02.000Z | 2020-10-13T18:09:16.000Z | source/framework/algorithm/include/lue/framework/algorithm/array_like.hpp | computationalgeography/lue | 71993169bae67a9863d7bd7646d207405dc6f767 | [
"MIT"
] | 1 | 2020-03-11T09:49:41.000Z | 2020-03-11T09:49:41.000Z | #pragma once
#include "lue/framework/algorithm/policy/all_values_within_domain.hpp"
#include "lue/framework/algorithm/policy/default_policies.hpp"
#include "lue/framework/algorithm/policy/default_value_policies.hpp"
#include "lue/framework/partitioned_array.hpp"
#include "lue/framework/core/annotate.hpp"
namespace lu... | 35.693989 | 112 | 0.582823 | [
"shape"
] |
f62bdf33e0db716b446d0b9115e7e767a758c2eb | 181,515 | cpp | C++ | BigDataGeneratorSuite/Graph_datagen/snap-exp/wikinet.cpp | felidsche/BigDataBench_V5.0_BigData_ComponentBenchmark | c65c3df033b84dfb6d229f74e564d69cfe624556 | [
"Apache-2.0"
] | 1,805 | 2015-01-06T20:01:35.000Z | 2022-03-29T16:12:51.000Z | snap-exp/wikinet.cpp | lizhaoqing/snap | 907c34aac6bcddc7c2f8efb64be76e87dd7e4ea5 | [
"BSD-3-Clause"
] | 168 | 2015-01-07T22:57:29.000Z | 2022-03-15T01:20:24.000Z | snap-exp/wikinet.cpp | lizhaoqing/snap | 907c34aac6bcddc7c2f8efb64be76e87dd7e4ea5 | [
"BSD-3-Clause"
] | 768 | 2015-01-09T02:28:45.000Z | 2022-03-30T00:53:46.000Z | #include "stdafx.h"
#include "wikinet.h"
#include "trawling.h"
/////////////////////////////////////////////////
// Wikipedia Talk Network
TWikiUsr::TWikiUsr() : Usr(), Admin(false), ElecTm(), BarnStars(), MnEdCnt(), MnEdWrds(), MnTkEdCnt(), MnTkEdWrds(),
WkEdCnt(), WkEdWrds(), WkTkEdCnt(), WkTkEdWrds(), MnRe... | 44.445397 | 229 | 0.602617 | [
"3d"
] |
f62e12c4cd6deadef218504289229ecc0dbc6239 | 2,422 | cpp | C++ | utilities/C++/Linkedin high frequency/127. Word Ladder.cpp | JanathonL-CMU/tech-interview-handbook | be3adc5142ade45c5677eeb0b082e18e7ca5df92 | [
"MIT"
] | null | null | null | utilities/C++/Linkedin high frequency/127. Word Ladder.cpp | JanathonL-CMU/tech-interview-handbook | be3adc5142ade45c5677eeb0b082e18e7ca5df92 | [
"MIT"
] | null | null | null | utilities/C++/Linkedin high frequency/127. Word Ladder.cpp | JanathonL-CMU/tech-interview-handbook | be3adc5142ade45c5677eeb0b082e18e7ca5df92 | [
"MIT"
] | null | null | null | // 127. Word Ladder
// Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that:
// Only one letter can be changed at a time.
// Each transformed word must exist in the word list. Note that beginWord is not a transfo... | 29.901235 | 163 | 0.556565 | [
"vector"
] |
f632b3451a3ba5353200d45c6dd71f005564c766 | 19,190 | cxx | C++ | main/xmloff/source/text/XMLRedlineExport.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/xmloff/source/text/XMLRedlineExport.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/xmloff/source/text/XMLRedlineExport.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... | 28.684604 | 80 | 0.701928 | [
"model"
] |
f6334ad218cfc04debb73665bf8cdb78d3fa32df | 1,186 | cpp | C++ | LeetCode/1254. Number of Closed Islands/solution.cpp | InnoFang/oh-my-algorithms | f559dba371ce725a926725ad28d5e1c2facd0ab2 | [
"Apache-2.0"
] | 1 | 2017-03-31T15:24:01.000Z | 2017-03-31T15:24:01.000Z | LeetCode/1254. Number of Closed Islands/solution.cpp | InnoFang/Algorithm-Library | 1896b9d8b1fa4cd73879aaecf97bc32d13ae0169 | [
"Apache-2.0"
] | null | null | null | LeetCode/1254. Number of Closed Islands/solution.cpp | InnoFang/Algorithm-Library | 1896b9d8b1fa4cd73879aaecf97bc32d13ae0169 | [
"Apache-2.0"
] | null | null | null | /**
* 47 / 47 test cases passed.
* Runtime: 12 ms
* Memory Usage: 9.1 MB
*/
class Solution {
public:
int direct[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int m, n;
void dfs(vector<vector<int>> &grid, int x, int y) {
grid[x][y] = 1;
for (auto &d : direct) {
int xx = x + d[0... | 28.238095 | 65 | 0.352445 | [
"vector"
] |
f6375a0aab7acc3505b29a2f575e4bbe0263b2c6 | 7,996 | cpp | C++ | src/core/HDCSCore.cpp | isabella232/HDCS | 1a5ae046e3ff947cc7a42219b9b1959766687612 | [
"Apache-2.0"
] | null | null | null | src/core/HDCSCore.cpp | isabella232/HDCS | 1a5ae046e3ff947cc7a42219b9b1959766687612 | [
"Apache-2.0"
] | 1 | 2021-02-23T19:10:26.000Z | 2021-02-23T19:10:26.000Z | src/core/HDCSCore.cpp | isabella232/HDCS | 1a5ae046e3ff947cc7a42219b9b1959766687612 | [
"Apache-2.0"
] | null | null | null | // Copyright [2017] <Intel>
#include "core/HDCSCore.h"
#include "core/policy/CachePolicy.h"
#include "core/policy/TierPolicy.h"
#include "store/SimpleStore/SimpleBlockStore.h"
#include "store/KVStore/KVStore.h"
#include "store/DataStore.h"
#include "store/RBD/RBDImageStore.h"
#include "common/HDCS_REQUEST_HANDLER.h"
... | 36.678899 | 183 | 0.697974 | [
"vector"
] |
f63a31c3dc855f146af5af528028f6e3f5cf60ee | 16,990 | cpp | C++ | drlvm/vm/vmcore/src/lil/ipf/m2n_ipf.cpp | sirinath/Harmony | 724deb045a85b722c961d8b5a83ac7a697319441 | [
"Apache-2.0"
] | 8 | 2015-11-04T06:06:35.000Z | 2021-07-04T13:47:36.000Z | drlvm/vm/vmcore/src/lil/ipf/m2n_ipf.cpp | sirinath/Harmony | 724deb045a85b722c961d8b5a83ac7a697319441 | [
"Apache-2.0"
] | 1 | 2021-10-17T13:07:28.000Z | 2021-10-17T13:07:28.000Z | drlvm/vm/vmcore/src/lil/ipf/m2n_ipf.cpp | sirinath/Harmony | 724deb045a85b722c961d8b5a83ac7a697319441 | [
"Apache-2.0"
] | 13 | 2015-11-27T03:14:50.000Z | 2022-02-26T15:12:20.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 You under the Apache License, Version 2.0
* (the "License"); you... | 33.98 | 198 | 0.703767 | [
"object"
] |
f648fdecc846fbbdc7b5e71fc941597c505ae341 | 14,800 | cpp | C++ | pyis/ops/linear_chain_crf/src/SparseLinearModel.cpp | microsoft/python-inference-script | cbbbe9d16be0839e4df357b1bd9e8274ca44f1f7 | [
"MIT"
] | 5 | 2021-11-29T01:49:22.000Z | 2022-02-23T10:26:46.000Z | pyis/ops/linear_chain_crf/src/SparseLinearModel.cpp | microsoft/python-inference-script | cbbbe9d16be0839e4df357b1bd9e8274ca44f1f7 | [
"MIT"
] | 1 | 2021-11-01T02:22:32.000Z | 2021-11-01T02:22:32.000Z | pyis/ops/linear_chain_crf/src/SparseLinearModel.cpp | microsoft/python-inference-script | cbbbe9d16be0839e4df357b1bd9e8274ca44f1f7 | [
"MIT"
] | null | null | null | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT license.
#include "SparseLinearModel.h"
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#include "Common.h"
#include "Sentence.... | 37.18593 | 117 | 0.643851 | [
"vector",
"model"
] |
f64a41d7eb7c9996d7ed232c915c3b281737834d | 2,380 | cc | C++ | ChiTech/ChiMesh/chi_mesh_utilities.cc | Jrgriss2/chi-tech | db75df761d5f25ca4b79ee19d36f886ef240c2b5 | [
"MIT"
] | 7 | 2019-09-10T12:16:08.000Z | 2021-05-06T16:01:59.000Z | ChiTech/ChiMesh/chi_mesh_utilities.cc | Jrgriss2/chi-tech | db75df761d5f25ca4b79ee19d36f886ef240c2b5 | [
"MIT"
] | 72 | 2019-09-04T15:00:25.000Z | 2021-12-02T20:47:29.000Z | ChiTech/ChiMesh/chi_mesh_utilities.cc | Jrgriss2/chi-tech | db75df761d5f25ca4b79ee19d36f886ef240c2b5 | [
"MIT"
] | 41 | 2019-09-02T15:33:31.000Z | 2022-02-10T13:26:49.000Z | #include "chi_mesh.h"
#include "chi_log.h"
extern ChiLog& chi_log;
//###################################################################
/**Tensor product of two vectors.
* \f$ \vec{\vec{T}} = \vec{x} \otimes \vec{y} \f$*/
chi_mesh::TensorRank2Dim3 chi_mesh::Vector3::OTimes(const Vector3& that) const
{
TensorRank2... | 29.02439 | 85 | 0.527311 | [
"vector",
"3d"
] |
f651d516d6948ca299526842ad9b264066dac465 | 1,146 | hpp | C++ | include/world/Core.hpp | Tastyep/SFML-GameCore-2D | 51dfcd7f3a098b2efa76754703999c6b8d22369d | [
"MIT"
] | null | null | null | include/world/Core.hpp | Tastyep/SFML-GameCore-2D | 51dfcd7f3a098b2efa76754703999c6b8d22369d | [
"MIT"
] | null | null | null | include/world/Core.hpp | Tastyep/SFML-GameCore-2D | 51dfcd7f3a098b2efa76754703999c6b8d22369d | [
"MIT"
] | null | null | null | #ifndef GAME_CORE_WORLD_CORE_HPP
#define GAME_CORE_WORLD_CORE_HPP
#include <memory>
#include <mutex>
#include <vector>
#include <SFML/Graphics/Drawable.hpp>
#include "PlayRho/Common/Math.hpp"
#include "PlayRho/Dynamics/StepConf.hpp"
#include "PlayRho/Dynamics/World.hpp"
#include "world/Camera.hpp"
#include "world/c... | 24.913043 | 102 | 0.763525 | [
"vector"
] |
f6586ec0ac09c5500103aa2d93e0ab77980a391f | 3,935 | cpp | C++ | src/c++/lib/reference/Contig.cpp | Illumina/Isaac4 | 0924fba8b467868da92e1c48323b15d7cbca17dd | [
"BSD-3-Clause"
] | 13 | 2018-02-09T22:59:39.000Z | 2021-11-29T06:33:22.000Z | src/c++/lib/reference/Contig.cpp | Illumina/Isaac4 | 0924fba8b467868da92e1c48323b15d7cbca17dd | [
"BSD-3-Clause"
] | 17 | 2018-01-26T11:36:07.000Z | 2022-02-03T18:48:43.000Z | src/c++/lib/reference/Contig.cpp | Illumina/Isaac4 | 0924fba8b467868da92e1c48323b15d7cbca17dd | [
"BSD-3-Clause"
] | 4 | 2018-10-19T20:00:00.000Z | 2020-10-29T14:44:06.000Z | /**
** Isaac Genome Alignment Software
** Copyright (c) 2010-2017 Illumina, Inc.
** All rights reserved.
**
** This software is provided under the terms and conditions of the
** GNU GENERAL PUBLIC LICENSE Version 3
**
** You should have received a copy of the GNU GENERAL PUBLIC LICENSE Version 3
** along with ... | 39.747475 | 146 | 0.695299 | [
"transform"
] |
2cf9da2ace6512ee76237b48998b814824930f16 | 957 | cpp | C++ | src/MenusAndToolbars/StatusBar/StatusBar.cpp | ericfont/Examples_wxWidgets | 5cd123eff9a5f9971413ec2f8effc15b76622987 | [
"MIT"
] | 70 | 2019-11-18T15:04:23.000Z | 2022-03-28T22:42:16.000Z | src/MenusAndToolbars/StatusBar/StatusBar.cpp | gammasoft71/Examples.wxWidgets | c710f31c29d502fee699f044014a5eae4ce6ef22 | [
"MIT"
] | 10 | 2020-11-18T02:37:11.000Z | 2021-09-16T17:05:29.000Z | src/MenusAndToolbars/StatusBar/StatusBar.cpp | gammasoft71/Examples.wxWidgets | c710f31c29d502fee699f044014a5eae4ce6ef22 | [
"MIT"
] | 10 | 2021-05-14T11:41:42.000Z | 2022-03-20T00:38:17.000Z | #include <vector>
#include <wx/wx.h>
#include <wx/artprov.h>
namespace Examples {
class Frame : public wxFrame {
public:
Frame() : wxFrame(nullptr, wxID_ANY, "Statusbar example") {
SetStatusBar(statusBar);
std::vector statusWidths = {80, 80, -1};
std::vector statusStyles = {wxSB_SUNKEN, ... | 26.583333 | 75 | 0.654127 | [
"vector"
] |
2cfaf4da1f680611c6fa4fb71616c442e537274f | 325 | cpp | C++ | DMCpp/GottschlingRepo/c++03/ref_pair.cpp | tzaffi/cpp | 43d99e70d8fa712f90ea0f6147774e4e0f2b11da | [
"MIT"
] | 27 | 2017-12-27T14:35:02.000Z | 2021-01-31T14:28:17.000Z | DMCpp/GottschlingRepo/c++03/ref_pair.cpp | tzaffi/cpp | 43d99e70d8fa712f90ea0f6147774e4e0f2b11da | [
"MIT"
] | 52 | 2017-12-07T14:54:33.000Z | 2018-06-28T02:14:07.000Z | DMCpp/GottschlingRepo/c++03/ref_pair.cpp | tzaffi/cpp | 43d99e70d8fa712f90ea0f6147774e4e0f2b11da | [
"MIT"
] | 13 | 2019-06-29T02:58:27.000Z | 2020-05-07T08:52:22.000Z | #include <iostream>
#include <vector>
#include <functional>
#include <iterator>
using namespace std;
int main (int argc, char* argv[])
{
vector<int> v1(3);
pair<vector<int>&, int> p(v1, 8), p2(p);
copy(p2.first.begin(), p2.first.end(), ostream_iterator<int>(cout, ", ")); cout << endl;
return 0... | 18.055556 | 92 | 0.609231 | [
"vector"
] |
2cfcc95ddaa44ace455479d7ed32763b6e05de98 | 5,254 | cpp | C++ | higan/gb/cartridge/cartridge.cpp | defparam/higan-verilog | 25fe4d87f8ac31888e816c9c29498f41ad869e1e | [
"Intel",
"ISC"
] | 38 | 2018-04-05T05:00:05.000Z | 2022-02-06T00:02:02.000Z | higan/gb/cartridge/cartridge.cpp | defparam/higan-verilog | 25fe4d87f8ac31888e816c9c29498f41ad869e1e | [
"Intel",
"ISC"
] | null | null | null | higan/gb/cartridge/cartridge.cpp | defparam/higan-verilog | 25fe4d87f8ac31888e816c9c29498f41ad869e1e | [
"Intel",
"ISC"
] | 8 | 2018-04-16T22:37:46.000Z | 2021-02-10T07:37:03.000Z | #include <gb/gb.hpp>
namespace GameBoy {
Cartridge cartridge;
#include "mbc0/mbc0.cpp"
#include "mbc1/mbc1.cpp"
#include "mbc1m/mbc1m.cpp"
#include "mbc2/mbc2.cpp"
#include "mbc3/mbc3.cpp"
#include "mbc5/mbc5.cpp"
#include "mbc6/mbc6.cpp"
#include "mbc7/mbc7.cpp"
#include "mmm01/mmm01.cpp"
#include "huc1/huc1.cpp"
#i... | 28.247312 | 95 | 0.613057 | [
"model"
] |
2cfd016cbe830d6df66f4ddc8dea3de8e8d63229 | 135 | cpp | C++ | Source/EditorLib/Controls/ISignificantControl.cpp | Qt-Widgets/TexGraph | 8fe72cea1afcf5e235c810003bf4ee062bb3fc13 | [
"MIT"
] | 35 | 2017-04-07T22:49:41.000Z | 2021-08-03T13:59:20.000Z | Source/EditorLib/Controls/ISignificantControl.cpp | Qt-Widgets/TexGraph | 8fe72cea1afcf5e235c810003bf4ee062bb3fc13 | [
"MIT"
] | 1 | 2017-04-13T17:43:54.000Z | 2017-04-15T04:17:37.000Z | Source/EditorLib/Controls/ISignificantControl.cpp | Qt-Widgets/TexGraph | 8fe72cea1afcf5e235c810003bf4ee062bb3fc13 | [
"MIT"
] | 7 | 2019-03-11T19:26:53.000Z | 2021-03-04T07:17:10.000Z | #include "ISignificantControl.h"
std::vector<ISignificantControl*> ISignificantControl::list_ = std::vector<ISignificantControl*>(); | 45 | 99 | 0.792593 | [
"vector"
] |
2cfd878fbf9ec21bbd1158206fae5053b8bdefc7 | 5,324 | cpp | C++ | jerome/npc/detail/evaluation.cpp | leuski-ict/jerome | 6141a21c50903e98a04c79899164e7d0e82fe1c2 | [
"Apache-2.0"
] | 3 | 2018-06-11T10:48:54.000Z | 2021-05-30T07:10:15.000Z | jerome/npc/detail/evaluation.cpp | leuski-ict/jerome | 6141a21c50903e98a04c79899164e7d0e82fe1c2 | [
"Apache-2.0"
] | null | null | null | jerome/npc/detail/evaluation.cpp | leuski-ict/jerome | 6141a21c50903e98a04c79899164e7d0e82fe1c2 | [
"Apache-2.0"
] | null | null | null | //
// evaluation.cpp
//
// Created by Anton Leuski on 9/16/15.
// Copyright (c) 2015 Anton Leuski & ICT/USC. All rights reserved.
//
// This file is part of Jerome.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may... | 32.864198 | 105 | 0.700789 | [
"vector",
"model"
] |
fa05f8fa32ffdc6bdb42ada35eb8e4f42f873243 | 1,452 | cpp | C++ | Implementations/11 - Math (4)/Polynomials (6)/Linear Recurrence.cpp | Senpat/USACO | 7f65e083e70c10b43224c6e1acbab79af249b942 | [
"MIT"
] | null | null | null | Implementations/11 - Math (4)/Polynomials (6)/Linear Recurrence.cpp | Senpat/USACO | 7f65e083e70c10b43224c6e1acbab79af249b942 | [
"MIT"
] | null | null | null | Implementations/11 - Math (4)/Polynomials (6)/Linear Recurrence.cpp | Senpat/USACO | 7f65e083e70c10b43224c6e1acbab79af249b942 | [
"MIT"
] | null | null | null | /**
* Description: Berlekamp-Massey Algo
* Source: http://codeforces.com/blog/entry/61306
* Verification: http://codeforces.com/contest/506/problem/E
*/
using namespace vecOp;
struct linRec {
vector<vi> seq;
vi x, fail, delta, des;
linRec (vi _x) {
x = _x; seq.pb({}); int best = 0;
... | 26.888889 | 80 | 0.433196 | [
"vector"
] |
fa0706bc94316fdf406594babbd2b327d57d831f | 4,998 | cpp | C++ | marchingCubes/obsolete/mpi/Implementations/MpiAlgo.cpp | sandialabs/miniIsosurface | be51bb54e553e357a50cd95fce2fe9a5798993e4 | [
"BSD-3-Clause"
] | 5 | 2019-07-14T02:12:28.000Z | 2022-01-20T06:29:30.000Z | marchingCubes/obsolete/mpi/Implementations/MpiAlgo.cpp | sandialabs/miniIsosurface | be51bb54e553e357a50cd95fce2fe9a5798993e4 | [
"BSD-3-Clause"
] | null | null | null | marchingCubes/obsolete/mpi/Implementations/MpiAlgo.cpp | sandialabs/miniIsosurface | be51bb54e553e357a50cd95fce2fe9a5798993e4 | [
"BSD-3-Clause"
] | 3 | 2019-12-19T16:31:53.000Z | 2020-07-24T13:02:20.000Z | /*
* MpiAlgo.cpp
*
* Created on: Aug 17, 2015
* Author: sjmunn
*/
#include "MpiAlgo.h"
template<typename T>
MpiAlgo<T>::MpiAlgo(LoadImage3DMPI<T> & inFileHeader, int inPid, int inProcesses, Timer * inProcessTimer) : MarchAlgorithm<T>(),fileHeader(inFileHeader) {
pID = inPid;
processes=inProcesses;
unsig... | 28.078652 | 154 | 0.720688 | [
"mesh"
] |
fa0899e505efa0f764083efe2ac24a7b8d0fedba | 150 | hpp | C++ | dbscan.hpp | drdanz/dbscan | 4e40a2287ac2b85c5759865ef1aecb77150a30e9 | [
"MIT"
] | 6 | 2021-04-18T08:07:44.000Z | 2022-03-16T05:24:23.000Z | dbscan.hpp | drdanz/dbscan | 4e40a2287ac2b85c5759865ef1aecb77150a30e9 | [
"MIT"
] | null | null | null | dbscan.hpp | drdanz/dbscan | 4e40a2287ac2b85c5759865ef1aecb77150a30e9 | [
"MIT"
] | 3 | 2020-11-28T05:02:49.000Z | 2021-09-17T15:54:23.000Z | #include <vector>
auto dbscan(const std::vector<std::pair<float, float>>& data, float eps, int min_pts)
-> std::vector<std::vector<size_t>>; | 37.5 | 86 | 0.666667 | [
"vector"
] |
fa0941394bb378ce332ca5a5c9a80e1aac42aa05 | 2,571 | cpp | C++ | Day10/Day10.cpp | Zhoroaan/adventofcode2021 | 099b6ae8d58032045dfa4c2edc2d7b2f9f0fdab9 | [
"MIT"
] | null | null | null | Day10/Day10.cpp | Zhoroaan/adventofcode2021 | 099b6ae8d58032045dfa4c2edc2d7b2f9f0fdab9 | [
"MIT"
] | null | null | null | Day10/Day10.cpp | Zhoroaan/adventofcode2021 | 099b6ae8d58032045dfa4c2edc2d7b2f9f0fdab9 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include <stack>
#include <string>
#include <unordered_map>
#include "../Lib/CommonLib.h"
//const char* InputData = "TestInputData.txt";
const char* InputData = "MyInput.txt";
int64_t CalculateScoreOfLine(const std::string& InBuffer, std::unordered_map<char, std::pair<char, in... | 27.063158 | 140 | 0.543368 | [
"vector"
] |
fa09720fc90d0b98d770f3c7cfaa6c20b3e7fa9a | 7,314 | cc | C++ | src/runtime/registry.cc | BaldLee/tvm | b53472c7b6afa34260afeffc5f088591352c58c3 | [
"Apache-2.0"
] | 10 | 2019-03-09T07:51:56.000Z | 2021-09-14T03:06:20.000Z | src/runtime/registry.cc | BaldLee/tvm | b53472c7b6afa34260afeffc5f088591352c58c3 | [
"Apache-2.0"
] | 9 | 2021-10-20T13:48:52.000Z | 2021-12-09T07:14:24.000Z | src/runtime/registry.cc | BaldLee/tvm | b53472c7b6afa34260afeffc5f088591352c58c3 | [
"Apache-2.0"
] | 7 | 2021-08-03T14:24:00.000Z | 2021-11-11T04:34:37.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 you under the Apache License, Version 2.0 (the
* "License"); you ... | 31.525862 | 99 | 0.694285 | [
"vector"
] |
fa1df54025e4d19929f269cd1c0cdda5f2c12bda | 4,563 | cpp | C++ | oi/Contest/self/HNOI2017-Virtual-Test/split/brute.cpp | Riteme/test | b511d6616a25f4ae8c3861e2029789b8ee4dcb8d | [
"BSD-Source-Code"
] | 3 | 2018-08-30T09:43:20.000Z | 2019-12-03T04:53:43.000Z | oi/Contest/self/HNOI2017-Virtual-Test/split/brute.cpp | Riteme/test | b511d6616a25f4ae8c3861e2029789b8ee4dcb8d | [
"BSD-Source-Code"
] | null | null | null | oi/Contest/self/HNOI2017-Virtual-Test/split/brute.cpp | Riteme/test | b511d6616a25f4ae8c3861e2029789b8ee4dcb8d | [
"BSD-Source-Code"
] | null | null | null | #include <cassert>
#include <cstdio>
#include <cstring>
#include <climits>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
#define WMAX 30
#define NMAX 900
#define EMAX 2000
class NetworkFlow {
public:
NetworkFlow(int _n) : n(_n) {}
void link(int u, int v, int c... | 20.554054 | 73 | 0.419461 | [
"vector"
] |
fa1f9cd7fe6d3a008e21f92dcca2457d019466d5 | 7,150 | cc | C++ | ecclesia/magent/sysmodel/x86/fru.cc | pefoley2/ecclesia-machine-management | e795faafd9d43233a67765daff43bff887c27549 | [
"Apache-2.0"
] | null | null | null | ecclesia/magent/sysmodel/x86/fru.cc | pefoley2/ecclesia-machine-management | e795faafd9d43233a67765daff43bff887c27549 | [
"Apache-2.0"
] | null | null | null | ecclesia/magent/sysmodel/x86/fru.cc | pefoley2/ecclesia-machine-management | e795faafd9d43233a67765daff43bff887c27549 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to ... | 32.207207 | 80 | 0.719161 | [
"vector"
] |
fa2012f4670208b31afbf1fab96f71660142ab4f | 4,025 | hpp | C++ | src/color/cmy/get/magenta.hpp | ehtec/color | aa6d8c796303d1f3cfd7361978bfa58eac808b6e | [
"Apache-2.0"
] | 120 | 2015-12-31T22:30:14.000Z | 2022-03-29T15:08:01.000Z | src/color/cmy/get/magenta.hpp | ehtec/color | aa6d8c796303d1f3cfd7361978bfa58eac808b6e | [
"Apache-2.0"
] | 6 | 2016-08-22T02:14:56.000Z | 2021-11-06T22:39:52.000Z | src/color/cmy/get/magenta.hpp | ehtec/color | aa6d8c796303d1f3cfd7361978bfa58eac808b6e | [
"Apache-2.0"
] | 23 | 2016-02-03T01:56:26.000Z | 2021-09-28T16:36:27.000Z | #ifndef color_cmy_get_magenta
#define color_cmy_get_magenta
// ::color::get::magenta( c )
#include "../category.hpp"
#include "../place/place.hpp"
#include "../../generic/get/magenta.hpp"
namespace color
{
namespace get
{
namespace constant
{
namespace cmy { namespace magenta
... | 30.263158 | 143 | 0.541366 | [
"model"
] |
fa22bf2c632be784785c913bc995809684a8c22b | 12,241 | cpp | C++ | released_plugins/v3d_plugins/terastitcher/src/core/stitcher/TPAlgoMST.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | 1 | 2021-12-27T19:14:03.000Z | 2021-12-27T19:14:03.000Z | released_plugins/v3d_plugins/terastitcher/src/core/stitcher/TPAlgoMST.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | 1 | 2016-12-03T05:33:13.000Z | 2016-12-03T05:33:13.000Z | released_plugins/v3d_plugins/terastitcher/src/core/stitcher/TPAlgoMST.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | null | null | null | //------------------------------------------------------------------------------------------------
// Copyright (c) 2012 Alessandro Bria and Giulio Iannello (University Campus Bio-Medico of Rome).
// All rights reserved.
//-------------------------------------------------------------------------------------------... | 45.505576 | 206 | 0.575443 | [
"object",
"3d"
] |
fa2485e971066862918e2858fbc863747e5d4b00 | 726 | cpp | C++ | Dataset/Leetcode/valid/56/688.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/valid/56/688.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/valid/56/688.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | class Solution {
public:
static bool cmp(const vector<int>& a,const vector<int>& b){return a[0]<b[0];}
vector<vector<int>> XXX(vector<vector<int>>& intervals) {
vector<vector<int>> ans;
if (intervals.size()==0) return ans;
sort(intervals.begin(),intervals.end(),cmp);
int l=inter... | 30.25 | 81 | 0.491736 | [
"vector"
] |
fa28d4162af13c8936489ada96aaed841d2ccb9e | 91,883 | cpp | C++ | WebKit/Source/ThirdParty/ANGLE/src/compiler/glslang_lex.cpp | JavaScriptTesting/LJS | 9818dbdb421036569fff93124ac2385d45d01c3a | [
"Apache-2.0"
] | 1 | 2019-06-18T06:52:54.000Z | 2019-06-18T06:52:54.000Z | WebKit/Source/ThirdParty/ANGLE/src/compiler/glslang_lex.cpp | JavaScriptTesting/LJS | 9818dbdb421036569fff93124ac2385d45d01c3a | [
"Apache-2.0"
] | null | null | null | WebKit/Source/ThirdParty/ANGLE/src/compiler/glslang_lex.cpp | JavaScriptTesting/LJS | 9818dbdb421036569fff93124ac2385d45d01c3a | [
"Apache-2.0"
] | null | null | null | #line 17 "compiler/glslang.l"
//
// Copyright (c) 2010 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.
//
// This file is auto-generated by generate_glslang_lexer.sh. DO NOT EDIT!
#line 13 "compiler/glslang_lex.c... | 28.794422 | 126 | 0.621442 | [
"object"
] |
fa2a33a0877a5e4b9c5525c14b6362caac624303 | 666 | cpp | C++ | LeetCode/Problems/Algorithms/#22_GenerateParentheses_sol2_closure_number.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | 1 | 2022-01-26T14:50:07.000Z | 2022-01-26T14:50:07.000Z | LeetCode/Problems/Algorithms/#22_GenerateParentheses_sol2_closure_number.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | LeetCode/Problems/Algorithms/#22_GenerateParentheses_sol2_closure_number.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<string> generateParenthesis(int n) {
vector<string> solutions;
if(n == 0){
solutions.push_back("");
}else{
for(int c = 0; c < n; ++c){
vector<string> leftSeqAll = generateParenthesis(c);
for(stri... | 33.3 | 81 | 0.451952 | [
"vector"
] |
fa2db10d22f2a2531e098351c71046e0cdc125c8 | 2,873 | cpp | C++ | compiler/errors.cpp | basilTeam/basil | 3e88de0c33f4db814b63fdcbdfd473d378b6ec6b | [
"BSD-3-Clause"
] | 87 | 2020-08-13T16:40:22.000Z | 2022-03-20T13:26:10.000Z | compiler/errors.cpp | basilTeam/basil | 3e88de0c33f4db814b63fdcbdfd473d378b6ec6b | [
"BSD-3-Clause"
] | 33 | 2020-10-14T16:44:59.000Z | 2022-02-17T10:43:11.000Z | compiler/errors.cpp | basilTeam/basil | 3e88de0c33f4db814b63fdcbdfd473d378b6ec6b | [
"BSD-3-Clause"
] | 8 | 2020-10-22T08:59:34.000Z | 2022-03-22T04:34:04.000Z | /*
* Copyright (c) 2021, the Basil authors
* All rights reserved.
*
* This source code is licensed under the 3-Clause BSD License, the full text
* of which can be found in the LICENSE file in the root directory
* of this project.
*/
#include "errors.h"
#include "eval.h"
#include "util/vec.h"
#include "util/utf8... | 30.56383 | 103 | 0.524887 | [
"vector"
] |
fa2fd5c338c92f577b4eeb21159bd5e54b9cc76e | 5,246 | cpp | C++ | Signal_Calculator.cpp | AliNemat/EpiScale_Signal | 8799440b830a00554229f44ea1bbc368abce8af5 | [
"MIT"
] | null | null | null | Signal_Calculator.cpp | AliNemat/EpiScale_Signal | 8799440b830a00554229f44ea1bbc368abce8af5 | [
"MIT"
] | 5 | 2018-10-11T23:43:01.000Z | 2020-05-08T13:37:07.000Z | Signal_Calculator.cpp | arame002/EpiScale_Signal | 5215fd35ae60ad47b23fd36d94e68b4cf463f8f4 | [
"MIT"
] | 7 | 2018-06-14T23:42:28.000Z | 2019-12-13T22:04:07.000Z |
#include "MeshTissue.hpp"
#include "Signal_Calculator.h"
#include <chrono>
//---------------------------------------------------------------------------------------------
/*
vector<vector<double> > Signal_Calculator(vector< vector<double> > locX , vector< vector<double> > locY , vector<double > centX , vector<double ... | 35.687075 | 213 | 0.615707 | [
"vector"
] |
fa3955ffcc3a0c58414ee5a2beb1919204dc7ebc | 835 | cpp | C++ | test/ForEachTest.cpp | TheOsch2/boolinq | 5464cf801b046026e8d32cb37d9985fd672a34ec | [
"MIT"
] | 473 | 2015-01-03T03:58:48.000Z | 2022-03-18T19:27:09.000Z | test/ForEachTest.cpp | TheOsch2/boolinq | 5464cf801b046026e8d32cb37d9985fd672a34ec | [
"MIT"
] | 58 | 2015-01-13T14:43:35.000Z | 2022-03-02T16:48:55.000Z | test/ForEachTest.cpp | TheOsch2/boolinq | 5464cf801b046026e8d32cb37d9985fd672a34ec | [
"MIT"
] | 71 | 2015-02-17T20:30:50.000Z | 2022-03-21T00:56:54.000Z | #include <list>
#include <vector>
#include <string>
#include <gtest/gtest.h>
#include "boolinq.h"
using namespace boolinq;
TEST(ForEach, ThreeCharsSum)
{
std::vector<char> src;
src.push_back('a');
src.push_back('b');
src.push_back('c');
std::string str = "";
from(src).for_each([&](char a){s... | 17.040816 | 61 | 0.577246 | [
"vector"
] |
fa4dc9cf0be45990960e4b27746abed666abee87 | 5,300 | cpp | C++ | FutureExecutor/FutureExecutorsThen.cpp | google/cpp-from-the-sky-down | 10c8d16e877796f2906bedbd3a66fb6469b3a211 | [
"Apache-2.0"
] | 219 | 2018-08-15T22:01:07.000Z | 2022-03-23T11:46:54.000Z | FutureExecutor/FutureExecutorsThen.cpp | sthagen/cpp-from-the-sky-down | 72114a17a659e5919b4cbe3363e35c04f833d9d9 | [
"Apache-2.0"
] | 5 | 2018-09-11T06:15:28.000Z | 2022-01-05T15:27:31.000Z | FutureExecutor/FutureExecutorsThen.cpp | sthagen/cpp-from-the-sky-down | 72114a17a659e5919b4cbe3363e35c04f833d9d9 | [
"Apache-2.0"
] | 27 | 2018-09-11T06:14:40.000Z | 2022-03-20T09:46:14.000Z |
#include <condition_variable>
#include <iostream>
#include <mutex>
#include <optional>
#include <queue>
#include <sstream>
#include <thread>
template <typename T>
class mtq {
public:
mtq(std::size_t max_size) : max_size_(max_size) {}
void push(T t) {
std::unique_lock<std::mutex> lock{mut_};
for (;;) {
... | 22.746781 | 80 | 0.583019 | [
"vector"
] |
fa54f4a017cb25d32e6d59051189c25f07ed93e2 | 1,235 | cpp | C++ | llvm/lib/Target/AMDGPU/AMDGPUHSATargetObjectFile.cpp | zard49/kokkos-clang | c519a032853e6507075de1807c5730b8239ab936 | [
"Unlicense"
] | 4 | 2019-04-18T03:54:09.000Z | 2021-03-22T02:27:31.000Z | llvm/lib/Target/AMDGPU/AMDGPUHSATargetObjectFile.cpp | losalamos/kokkos-clang | d68d9c63cea3dbaad33454e4ebc9df829bca24fe | [
"Unlicense"
] | null | null | null | llvm/lib/Target/AMDGPU/AMDGPUHSATargetObjectFile.cpp | losalamos/kokkos-clang | d68d9c63cea3dbaad33454e4ebc9df829bca24fe | [
"Unlicense"
] | 2 | 2019-11-16T19:03:05.000Z | 2020-03-19T08:32:37.000Z | //===-- AMDGPUHSATargetObjectFile.cpp - AMDGPU Object Files ---------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... | 34.305556 | 81 | 0.591903 | [
"object"
] |
fa5be29ea46ea2f6c75a161469477b7ca9bfded2 | 7,702 | cpp | C++ | unittest/test_binaryivf.cpp | ChunelFeng/knowhere | 4c6ff55b5a23a9a38b12db40cbb5cd847cae1408 | [
"Apache-2.0"
] | null | null | null | unittest/test_binaryivf.cpp | ChunelFeng/knowhere | 4c6ff55b5a23a9a38b12db40cbb5cd847cae1408 | [
"Apache-2.0"
] | null | null | null | unittest/test_binaryivf.cpp | ChunelFeng/knowhere | 4c6ff55b5a23a9a38b12db40cbb5cd847cae1408 | [
"Apache-2.0"
] | null | null | null | // Copyright (C) 2019-2020 Zilliz. 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 l... | 35.823256 | 125 | 0.698909 | [
"vector"
] |
fa61f786b1e541d2a4101b2e22ad2cf6b4d97133 | 773 | cpp | C++ | Range Queries/Forest Queries.cpp | DecSP/cses-downloader | 12a8f37665a33f6f790bd2c355f84dea8a0e332c | [
"MIT"
] | 2 | 2022-02-12T12:30:13.000Z | 2022-02-12T13:59:20.000Z | Range Queries/Forest Queries.cpp | DecSP/cses-downloader | 12a8f37665a33f6f790bd2c355f84dea8a0e332c | [
"MIT"
] | 2 | 2022-02-12T11:09:41.000Z | 2022-02-12T11:55:49.000Z | Range Queries/Forest Queries.cpp | DecSP/cses-downloader | 12a8f37665a33f6f790bd2c355f84dea8a0e332c | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,q;
vector<vector<int>> F;
int sum(int r,int c){
if (r<0||c<0) return 0;
int re=0;
for (int i=r;i>=0;i=(i&(i+1))-1){
for (int j=c;j>=0;j=(j&(j+1))-1){
re+=F[i][j];
}
}
return re;
}
void increase(int r,int c,int num){
for (int i=r;i<... | 17.177778 | 66 | 0.521345 | [
"vector"
] |
fa66411b7b2f49d19f1ed969499fa049db087652 | 6,642 | cpp | C++ | Outils/ICoCo/ICoCo_src/share/Validation/Rapports_automatiques/ThermalPower/src/TrioField/main.cpp | cea-trust-platform/trust-code | c4f42d8f8602a8cc5e0ead0e29dbf0be8ac52f72 | [
"BSD-3-Clause"
] | 12 | 2021-06-30T18:50:38.000Z | 2022-03-23T09:03:16.000Z | Outils/ICoCo/ICoCo_src/share/Validation/Rapports_automatiques/ThermalPower/src/TrioField/main.cpp | pledac/trust-code | 46ab5c5da3f674185f53423090f526a38ecdbad1 | [
"BSD-3-Clause"
] | null | null | null | Outils/ICoCo/ICoCo_src/share/Validation/Rapports_automatiques/ThermalPower/src/TrioField/main.cpp | pledac/trust-code | 46ab5c5da3f674185f53423090f526a38ecdbad1 | [
"BSD-3-Clause"
] | 2 | 2021-10-04T09:19:39.000Z | 2021-12-15T14:21:04.000Z | #include <ICoCoProblem.h>
#include "CommInterface.hxx"
#include "ProcessorGroup.hxx"
#include "MPIProcessorGroup.hxx"
#include "TrioDEC.hxx"
#include <set>
#include <time.h>
#undef MM
#ifdef MM
#include <ICoCoMEDDoubleField.hxx>
#include <ICoCoProblem.h>
#else
#include <ICoCoTrioField.h>
#endif
#include <fstream>
#... | 30.893023 | 150 | 0.596206 | [
"vector"
] |
fa66c5f2d95e486cf8451b437982886634815016 | 762 | hpp | C++ | src/engine/effect/Shadow.hpp | stanfortonski/Procedural-Terrain-Generator-OpenGL | a88bf2d7a44e7efa10dd980147e2bad0d1a782bf | [
"MIT"
] | 93 | 2020-03-06T21:40:48.000Z | 2022-03-28T06:30:55.000Z | src/engine/effect/Shadow.hpp | pashashigalev/Shigalev-Pavel | 0c9094f409eb5a9d44ea4825fba86fcfe07a757e | [
"BSD-3-Clause"
] | 1 | 2021-08-31T07:56:37.000Z | 2021-08-31T16:06:35.000Z | src/engine/effect/Shadow.hpp | stanfortonski/Procedural-Terrain-Generator-OpenGL | a88bf2d7a44e7efa10dd980147e2bad0d1a782bf | [
"MIT"
] | 10 | 2020-06-06T11:21:35.000Z | 2022-03-24T01:55:20.000Z | /* Copyright (c) 2020 by Stan Fortoński */
#ifndef SHADOW_HPP
#define SHADOW_HPP 1
#include <vector>
#include <glm/glm.hpp>
#include "../buffer/FrameBuffer.hpp"
#include "../buffer/CubeDepthBuffer.hpp"
#include "../Config.hpp"
#include "../renderable/light/light.hpp"
namespace Engine
{
class Shadow
{
FrameBuf... | 23.8125 | 86 | 0.7021 | [
"vector"
] |
fa68c05d80a27a3dec216ad4f05c879ba95a7aef | 1,079 | cpp | C++ | grpc/cpp-cubic/cubic_model.cpp | cobaltspeech/sdk-cubic | 68ed5b67d4aa32f1b5085f6f167614b0fe6aeccb | [
"Apache-2.0"
] | 5 | 2019-10-10T09:30:58.000Z | 2020-05-28T11:08:00.000Z | grpc/cpp-cubic/cubic_model.cpp | cobaltspeech/sdk-cubic | 68ed5b67d4aa32f1b5085f6f167614b0fe6aeccb | [
"Apache-2.0"
] | 75 | 2019-04-18T07:55:25.000Z | 2022-02-11T02:36:04.000Z | grpc/cpp-cubic/cubic_model.cpp | cobaltspeech/sdk-cubic | 68ed5b67d4aa32f1b5085f6f167614b0fe6aeccb | [
"Apache-2.0"
] | 2 | 2020-01-07T19:57:19.000Z | 2020-01-08T22:02:12.000Z | // Copyright (2019) Cobalt Speech and Language, Inc.
#include "cubic_model.h"
CubicModel::CubicModel(const cobaltspeech::cubic::Model &model) :
mId(model.id()),
mName(model.name()),
mSampleRate(model.attributes().sample_rate()),
mSupportsContext(model.attributes().context_info().supports_context())
{ ... | 22.957447 | 85 | 0.714551 | [
"vector",
"model"
] |
fa6dcb86155c58b0c9c431e1386733f6cadc995a | 2,297 | cpp | C++ | src/OutputHID.cpp | erichlf/Hemiola | 3549be9b9cba907ddb5bb581872fc96d435995c7 | [
"MIT"
] | null | null | null | src/OutputHID.cpp | erichlf/Hemiola | 3549be9b9cba907ddb5bb581872fc96d435995c7 | [
"MIT"
] | 29 | 2021-12-16T16:00:28.000Z | 2022-02-01T18:37:28.000Z | src/OutputHID.cpp | erichlf/Hemiola | 3549be9b9cba907ddb5bb581872fc96d435995c7 | [
"MIT"
] | null | null | null | /*
MIT License
Copyright (c) 2021 Erich L Foster
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... | 35.338462 | 97 | 0.668698 | [
"vector"
] |
fa87918ad3b23b41dd96e4463bd704cb3722a890 | 11,999 | cpp | C++ | test/test_uart.cpp | JasonFevang/R502-interface | 73d842f5d23624625f2e687a2acdc3dcc3511eb5 | [
"MIT"
] | null | null | null | test/test_uart.cpp | JasonFevang/R502-interface | 73d842f5d23624625f2e687a2acdc3dcc3511eb5 | [
"MIT"
] | null | null | null | test/test_uart.cpp | JasonFevang/R502-interface | 73d842f5d23624625f2e687a2acdc3dcc3511eb5 | [
"MIT"
] | null | null | null | #include <limits.h>
#include "unity.h"
#include <array>
#include "R502Interface.hpp"
#include "esp_err.h"
#include "esp_log.h"
#include "esp32/rom/uart.h"
#define PIN_TXD (GPIO_NUM_4)
#define PIN_NC_1 (GPIO_NUM_16)
#define PIN_NC_2 (GPIO_NUM_17)
#define PIN_NC_3 (GPIO_NUM_18)
#define PIN_RXD (GPIO_NUM_5)
#define PIN... | 33.238227 | 77 | 0.708809 | [
"object"
] |
fa896dcfcb2527cc40cdc7a1705c1ef01972012c | 3,521 | cpp | C++ | src/Canvas.cpp | SpookyGhost2D/SpookyGhost | bfddccee9239aedf7928e781042e5ca1d78a49e1 | [
"MIT"
] | 182 | 2021-05-23T19:00:06.000Z | 2022-03-29T06:00:18.000Z | src/Canvas.cpp | SpookyGhost2D/SpookyGhost | bfddccee9239aedf7928e781042e5ca1d78a49e1 | [
"MIT"
] | 2 | 2021-05-25T04:56:23.000Z | 2021-11-08T17:52:26.000Z | src/Canvas.cpp | SpookyGhost2D/SpookyGhost | bfddccee9239aedf7928e781042e5ca1d78a49e1 | [
"MIT"
] | 9 | 2021-06-02T16:47:56.000Z | 2021-12-04T08:40:18.000Z | #include <ncine/config.h>
#include "Canvas.h"
#include "RenderingResources.h"
#include <ncine/Application.h>
#include <ncine/GLTexture.h>
#include <ncine/GLFramebufferObject.h>
#include <ncine/TextureSaverPng.h>
#include "shader_strings.h"
#ifdef __MINGW32__
#undef ERROR
#endif
////////////////////////////////////... | 27.944444 | 98 | 0.689577 | [
"object"
] |
fa8cf19242c9eac1df86bf3962f48be5458299fa | 2,717 | cpp | C++ | C++/Trajectory/graph.cpp | MohamedMkaouar/Some_Projects | 8170126dc91f313638595f9f4b81e9ae8b308334 | [
"Apache-2.0"
] | null | null | null | C++/Trajectory/graph.cpp | MohamedMkaouar/Some_Projects | 8170126dc91f313638595f9f4b81e9ae8b308334 | [
"Apache-2.0"
] | null | null | null | C++/Trajectory/graph.cpp | MohamedMkaouar/Some_Projects | 8170126dc91f313638595f9f4b81e9ae8b308334 | [
"Apache-2.0"
] | 1 | 2021-02-02T17:09:04.000Z | 2021-02-02T17:09:04.000Z | #include <iostream>
#include <iterator>
#include <map>
#include <cmath>
#include <vector>
#include <limits.h>
#include <stdio.h>
#include <fstream>
#include<omp.h>
#include "graph.h"
using namespace std;
void graph::confirmGraph(){
for(int i=0;i<A.size();i++)
{
cout<<"arc numero"<<... | 19 | 74 | 0.503865 | [
"vector"
] |
fa917e287655e93cd71a81af82d319dd1aeedb3e | 3,809 | cc | C++ | Samples/2_ConstantBuff/Source/FObjTriangle.cc | liliilli/SH-D3D11 | 1ffb4639d5d9dd06d08b2aa21ebc781ee22fb26c | [
"Unlicense",
"MIT"
] | null | null | null | Samples/2_ConstantBuff/Source/FObjTriangle.cc | liliilli/SH-D3D11 | 1ffb4639d5d9dd06d08b2aa21ebc781ee22fb26c | [
"Unlicense",
"MIT"
] | null | null | null | Samples/2_ConstantBuff/Source/FObjTriangle.cc | liliilli/SH-D3D11 | 1ffb4639d5d9dd06d08b2aa21ebc781ee22fb26c | [
"Unlicense",
"MIT"
] | null | null | null | ///
/// MIT License
/// Copyright (c) 2018-2019 Jongmin Yun
///
/// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
/// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
/// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
/// AUTHORS OR COPYR... | 29.757813 | 95 | 0.678918 | [
"render",
"object",
"model"
] |
fa93475b68ea78d51e0ff7a3470f1edde48d73fb | 24,500 | cpp | C++ | src/SubsetOfRegressors.cpp | snowpac/snowpac | ff4c6a83e01fc4ef6a78cf9ff9bf9358f972b305 | [
"BSD-2-Clause"
] | 3 | 2019-08-04T20:18:00.000Z | 2021-06-22T23:50:27.000Z | src/SubsetOfRegressors.cpp | snowpac/snowpac | ff4c6a83e01fc4ef6a78cf9ff9bf9358f972b305 | [
"BSD-2-Clause"
] | null | null | null | src/SubsetOfRegressors.cpp | snowpac/snowpac | ff4c6a83e01fc4ef6a78cf9ff9bf9358f972b305 | [
"BSD-2-Clause"
] | null | null | null | //
// Created by friedrich on 16.08.16.
//
#include <SubsetOfRegressors.hpp>
#include <assert.h>
#include <random>
#include <algorithm>
#include <iostream>
#include <cmath>
//--------------------------------------------------------------------------------
SubsetOfRegressors::SubsetOfRegressors(int n, double &delta_in... | 32.152231 | 122 | 0.578735 | [
"vector"
] |
fa97abff3a754015bd73371728abad56bb9ee912 | 4,386 | cc | C++ | tensorflow/core/user_ops/direct_sparse_to_dense.cc | TimoHackel/ILA-SCNN | 99ff4b3f68877d660dc56e086b6a12d6846b379a | [
"Apache-2.0"
] | 24 | 2018-02-01T15:49:22.000Z | 2021-01-11T16:31:18.000Z | tensorflow/core/user_ops/direct_sparse_to_dense.cc | TimoHackel/ILA-SCNN | 99ff4b3f68877d660dc56e086b6a12d6846b379a | [
"Apache-2.0"
] | null | null | null | tensorflow/core/user_ops/direct_sparse_to_dense.cc | TimoHackel/ILA-SCNN | 99ff4b3f68877d660dc56e086b6a12d6846b379a | [
"Apache-2.0"
] | 4 | 2018-10-29T18:43:22.000Z | 2020-09-28T07:19:52.000Z | #include <omp.h>
#include <map>
#include <sstream>
#include "tensorflow/core/framework/op.h"
#include "tensorflow/core/framework/shape_inference.h"
#include "tensorflow/core/framework/common_shape_fns.h"
#if GOOGLE_CUDA
#include "direct_sparse_to_dense_gpu.h"
#endif //GOOGLE_CUDA
/** DirectSparseConvKD
* \ingroup ... | 37.487179 | 177 | 0.727314 | [
"shape",
"3d"
] |
b703216a0be311e60b754497dfa1bf16660203b2 | 4,215 | cpp | C++ | test/vec/opr/num.cpp | Thhethssmuz/mmm | ee91a990fba3849db1fc2b6df0e89004e2df466f | [
"MIT"
] | 1 | 2017-03-14T20:45:54.000Z | 2017-03-14T20:45:54.000Z | test/vec/opr/num.cpp | Thhethssmuz/mmm | ee91a990fba3849db1fc2b6df0e89004e2df466f | [
"MIT"
] | 1 | 2017-03-08T17:14:03.000Z | 2017-03-08T23:40:35.000Z | test/vec/opr/num.cpp | Thhethssmuz/mmm | ee91a990fba3849db1fc2b6df0e89004e2df466f | [
"MIT"
] | null | null | null | #include <catch.hpp>
#include <mmm.hpp>
using namespace mmm;
TEST_CASE("vector numeric operator +", "[vec][num]") {
SECTION("vec2") {
vec2 v = vec2(1, 2);
vec2 u = vec2(3, 4);
REQUIRE(1 + v == vec2(2, 3));
REQUIRE(v + 1 == vec2(2, 3));
REQUIRE(v + u == vec2(4, 6));
REQUIRE(v.x + u == vec2(... | 26.180124 | 57 | 0.455516 | [
"vector"
] |
b718f79f51257d42f3e163c01c5cc05352af3605 | 14,078 | cpp | C++ | src/glfw_window.cpp | jfcameron/simple-glfw | 311a5732a147b270ceb6024b21ef103a2f9a17fc | [
"MIT"
] | null | null | null | src/glfw_window.cpp | jfcameron/simple-glfw | 311a5732a147b270ceb6024b21ef103a2f9a17fc | [
"MIT"
] | 11 | 2019-11-29T15:33:33.000Z | 2020-10-05T15:38:50.000Z | src/glfw_window.cpp | jfcameron/simple-glfw | 311a5732a147b270ceb6024b21ef103a2f9a17fc | [
"MIT"
] | null | null | null | // © 2018-2019 Joseph Cameron - All Rights Reserved
#include <simpleglfw/buildinfo.h>
#include <jfc/glfw_window.h>
#ifdef JFC_TARGET_PLATFORM_Emscripten
#include <emscripten/bind.h>
#include <emscripten/emscripten.h>
#define GLFW_INCLUDE_ES2
#elif defined JFC_TARGET_PLATFORM_Linux || defined JFC_TARGET_PLATFORM_Wind... | 41.163743 | 144 | 0.662452 | [
"render",
"vector"
] |
b71c5daebaebe707fb423ecb40b655c240484ea7 | 5,342 | cpp | C++ | src/ObjectTool.Sound.cpp | SiriusTR/dle-experimental | 2ee17b4277b68eef57960d5cf9762dd986eaa0d9 | [
"MIT"
] | null | null | null | src/ObjectTool.Sound.cpp | SiriusTR/dle-experimental | 2ee17b4277b68eef57960d5cf9762dd986eaa0d9 | [
"MIT"
] | 3 | 2019-09-10T03:50:40.000Z | 2019-09-23T04:20:14.000Z | src/ObjectTool.Sound.cpp | SiriusTR/dle-experimental | 2ee17b4277b68eef57960d5cf9762dd986eaa0d9 | [
"MIT"
] | 1 | 2021-10-02T14:16:28.000Z | 2021-10-02T14:16:28.000Z |
#include "stdafx.h"
#include "afxpriv.h"
#include <malloc.h>
#include <stdlib.h>
#undef abs
#include <math.h>
#include <mmsystem.h>
#include <stdio.h>
#include "mine.h"
#include "dle-xp.h"
#include "toolview.h"
#include "TextureManager.h"
//----------------------------------------------------------------------------... | 32.375758 | 160 | 0.549981 | [
"object"
] |
b71cb834048bead52bb73351a8f69a824315e3f7 | 9,019 | cpp | C++ | qtdoc/doc/src/snippets/modelview-subclasses/view.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 | [
"Apache-2.0"
] | 1 | 2020-04-30T15:47:35.000Z | 2020-04-30T15:47:35.000Z | qtdoc/doc/src/snippets/modelview-subclasses/view.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 | [
"Apache-2.0"
] | null | null | null | qtdoc/doc/src/snippets/modelview-subclasses/view.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 | [
"Apache-2.0"
] | null | null | null | /****************************************************************************
**
** Copyright (C) 2015 The Qt Company Ltd.
** Contact: http://www.qt.io/licensing/
**
** This file is part of the documentation of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:BSD$
** You may use this file under the terms of the BSD license as f... | 28.631746 | 93 | 0.647855 | [
"model"
] |
b727577841b6f2a518aafcf41951f57638181b81 | 4,831 | cc | C++ | diagnostics/wilco_dtc_supportd/telemetry/bluetooth_event_service_impl.cc | strassek/chromiumos-platform2 | 12c953f41f48b8a6b0bd1c181d09bdb1de38325c | [
"BSD-3-Clause"
] | 4 | 2020-07-24T06:54:16.000Z | 2021-06-16T17:13:53.000Z | diagnostics/wilco_dtc_supportd/telemetry/bluetooth_event_service_impl.cc | strassek/chromiumos-platform2 | 12c953f41f48b8a6b0bd1c181d09bdb1de38325c | [
"BSD-3-Clause"
] | 1 | 2021-04-02T17:35:07.000Z | 2021-04-02T17:35:07.000Z | diagnostics/wilco_dtc_supportd/telemetry/bluetooth_event_service_impl.cc | strassek/chromiumos-platform2 | 12c953f41f48b8a6b0bd1c181d09bdb1de38325c | [
"BSD-3-Clause"
] | 1 | 2020-11-04T22:31:45.000Z | 2020-11-04T22:31:45.000Z | // Copyright 2019 The Chromium OS 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 "diagnostics/wilco_dtc_supportd/telemetry/bluetooth_event_service_impl.h"
#include <algorithm>
#include <utility>
namespace diagnostics {
B... | 31.37013 | 82 | 0.772511 | [
"vector"
] |
b72e3ecd381c182224293a65b2d88d8e051b9012 | 7,427 | cc | C++ | fully_dynamic_submodular_maximization/dynamic_submodular_algorithm.cc | deepneuralmachine/google-research | d2ce2cf0f5c004f8d78bfeddf6e88e88f4840231 | [
"Apache-2.0"
] | 23,901 | 2018-10-04T19:48:53.000Z | 2022-03-31T21:27:42.000Z | fully_dynamic_submodular_maximization/dynamic_submodular_algorithm.cc | deepneuralmachine/google-research | d2ce2cf0f5c004f8d78bfeddf6e88e88f4840231 | [
"Apache-2.0"
] | 891 | 2018-11-10T06:16:13.000Z | 2022-03-31T10:42:34.000Z | fully_dynamic_submodular_maximization/dynamic_submodular_algorithm.cc | deepneuralmachine/google-research | d2ce2cf0f5c004f8d78bfeddf6e88e88f4840231 | [
"Apache-2.0"
] | 6,047 | 2018-10-12T06:31:02.000Z | 2022-03-31T13:59:28.000Z | // Copyright 2020 The Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... | 30.438525 | 80 | 0.632018 | [
"vector",
"model"
] |
b73776256296141663328b83a48b6b9102d21963 | 15,051 | cpp | C++ | BLAST CPU/main.cpp | FranklinAQP/BLAST | 411fa0818e8837204c6e1dd4c0c2faa75fc083c5 | [
"Apache-2.0"
] | null | null | null | BLAST CPU/main.cpp | FranklinAQP/BLAST | 411fa0818e8837204c6e1dd4c0c2faa75fc083c5 | [
"Apache-2.0"
] | null | null | null | BLAST CPU/main.cpp | FranklinAQP/BLAST | 411fa0818e8837204c6e1dd4c0c2faa75fc083c5 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <stdio.h> //printf
#include <time.h> //time, time_t, struct tm, difftime, mktime, clock_t, clock, CLOCKS_PER_SEC
#include <stdlib.h> //srand, rand
#include <algorithm> //fill_n(iterator,size,val)
#include "string.h"
#include <fstream>
#include <math.h>
#include <vector>
using namespace std;... | 29.339181 | 119 | 0.465484 | [
"vector"
] |
b73c376f5278e8e3d94a23ac45cf18bbad662ea0 | 2,093 | cpp | C++ | FroggerObjects/Utilities/HitableObject.cpp | RicardoEPRodrigues/FroggerOpenGL | dc02437dfe14203e9bdb39f160e4877b44363c42 | [
"MIT"
] | null | null | null | FroggerObjects/Utilities/HitableObject.cpp | RicardoEPRodrigues/FroggerOpenGL | dc02437dfe14203e9bdb39f160e4877b44363c42 | [
"MIT"
] | 1 | 2016-12-31T15:43:29.000Z | 2016-12-31T15:43:29.000Z | FroggerObjects/Utilities/HitableObject.cpp | RicardoEPRodrigues/FroggerOpenGL | dc02437dfe14203e9bdb39f160e4877b44363c42 | [
"MIT"
] | null | null | null | /*
* HitableObject.cpp
*
* Created on: Oct 30, 2014
* Author: ricardo
*/
#include "HitableObject.h"
HitableObject::HitableObject(Vector3 minBounds, Vector3 maxBounds) {
this->_min_bounds = minBounds;
this->_max_bounds = maxBounds;
}
HitableObject::~HitableObject() {
}
bool HitableObject::hitAux(V... | 44.531915 | 93 | 0.614429 | [
"object"
] |
b73d4b28125049d057ba1d70138f49ea165cf1f0 | 1,609 | cpp | C++ | main/utils/math.cpp | rain-377/rain-csgo-base | 58bed13ce272f5403ac7324f79ca9a6b3f7a63a5 | [
"MIT"
] | 13 | 2021-05-27T19:14:26.000Z | 2022-01-27T11:29:38.000Z | main/utils/math.cpp | rain-377/rain-csgo-base | 58bed13ce272f5403ac7324f79ca9a6b3f7a63a5 | [
"MIT"
] | 2 | 2021-06-03T16:18:59.000Z | 2022-03-29T15:29:17.000Z | main/utils/math.cpp | rain-377/rain-csgo-base | 58bed13ce272f5403ac7324f79ca9a6b3f7a63a5 | [
"MIT"
] | 4 | 2021-05-25T21:23:17.000Z | 2021-08-20T22:03:02.000Z | #include "math.h"
void math::vector_angles(const vector& forward, qangle& view_angle)
{
float pitch, yaw;
if (forward.x == 0.f && forward.y == 0.f)
{
pitch = (forward.z > 0.f) ? 270.f : 90.f;
yaw = 0.f;
}
else
{
pitch = std::atan2f(-forward.z, forward.length_2d()) * 180.f / M_PI;
if (pitch < 0.f)
pi... | 21.743243 | 92 | 0.614046 | [
"vector"
] |
b74604d36683a59ccda1e79f38c1ccc20a5e5995 | 8,596 | cpp | C++ | src/novatel_oem7_driver/src/receiverstatus_handler.cpp | ajay1606/novatel_oem7_driver | c18063a1ecd9a3ff1b824b73edb2d96dee511a39 | [
"MIT"
] | null | null | null | src/novatel_oem7_driver/src/receiverstatus_handler.cpp | ajay1606/novatel_oem7_driver | c18063a1ecd9a3ff1b824b73edb2d96dee511a39 | [
"MIT"
] | 1 | 2022-02-08T11:00:21.000Z | 2022-02-08T11:00:21.000Z | src/novatel_oem7_driver/src/receiverstatus_handler.cpp | ajay1606/novatel_oem7_driver | c18063a1ecd9a3ff1b824b73edb2d96dee511a39 | [
"MIT"
] | 1 | 2022-02-08T08:12:02.000Z | 2022-02-08T08:12:02.000Z | ////////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2020 NovAtel Inc.
//
// 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 restrictio... | 24.988372 | 117 | 0.601443 | [
"geometry",
"vector",
"model"
] |
b74674a36eed2728d79c2a3d1a3d502eadb8e22b | 2,210 | hh | C++ | STMGeom/inc/SupportTable.hh | bonventre/Offline | 77db9d6368f27ab9401c690c2c2a4257ade6c231 | [
"Apache-2.0"
] | 9 | 2020-03-28T00:21:41.000Z | 2021-12-09T20:53:26.000Z | STMGeom/inc/SupportTable.hh | bonventre/Offline | 77db9d6368f27ab9401c690c2c2a4257ade6c231 | [
"Apache-2.0"
] | 684 | 2019-08-28T23:37:43.000Z | 2022-03-31T22:47:45.000Z | STMGeom/inc/SupportTable.hh | bonventre/Offline | 77db9d6368f27ab9401c690c2c2a4257ade6c231 | [
"Apache-2.0"
] | 61 | 2019-08-16T23:28:08.000Z | 2021-12-20T08:29:48.000Z | #ifndef STMGeom_SupportTable_hh
#define STMGeom_SupportTable_hh
// Table to support things Object
//
// Author: Anthony Palladino
//
#include <string>
#include "CLHEP/Vector/Rotation.h"
#include "CLHEP/Vector/ThreeVector.h"
namespace mu2e {
class SupportTable {
public:
SupportTable(bool build, double table... | 34 | 91 | 0.652036 | [
"object",
"vector"
] |
b752922c25dffbff61d676817a118419beef8702 | 4,215 | ipp | C++ | TD3/Node.ipp | zdimension/tdpmp | 64b1560318c4790eaadbab8a41a8d8e02c93342c | [
"MIT"
] | null | null | null | TD3/Node.ipp | zdimension/tdpmp | 64b1560318c4790eaadbab8a41a8d8e02c93342c | [
"MIT"
] | null | null | null | TD3/Node.ipp | zdimension/tdpmp | 64b1560318c4790eaadbab8a41a8d8e02c93342c | [
"MIT"
] | null | null | null | //
// Created by Tom on 20/09/2021.
//
#ifndef TD3_NODE_IPP
#define TD3_NODE_IPP
#include <vector>
#include <ostream>
#include <stack>
template<typename T>
class Tree;
/**
* Binary tree node.
* @tparam T value type
*/
template<typename T>
class Node final
{
public:
explicit Node(T value) : value(value)
... | 19.788732 | 115 | 0.57153 | [
"vector"
] |
b756a7cb420a03f84a817e750e2b8bda93badea1 | 6,887 | cpp | C++ | lab-08/Scheduler/SimTask.cpp | drahosj/308labs | 718a02fa943749d906d10085d48dd4b4f69931e9 | [
"MIT"
] | null | null | null | lab-08/Scheduler/SimTask.cpp | drahosj/308labs | 718a02fa943749d906d10085d48dd4b4f69931e9 | [
"MIT"
] | null | null | null | lab-08/Scheduler/SimTask.cpp | drahosj/308labs | 718a02fa943749d906d10085d48dd4b4f69931e9 | [
"MIT"
] | null | null | null | /*
* SimTask.cpp
*
* Created on: Mar 9, 2016
* Author: vens
*/
#include <iostream>
#include "Scheduler/Scheduler.h"
#include "SimTask.h"
#include "Task/Task.h"
#include "Debug.h"
#include <string>
enum TaskJsonField
{
NAME,
PRIORITY,
ARRIVE_TIME,
RUN_TIMES,
BLOCK_TIMES,
DEADLINE,
UNKNOWN
};
TaskJso... | 23.266892 | 101 | 0.643676 | [
"object"
] |
b7605558d7dde3b27fc16987eddb8d9753bba421 | 9,926 | cpp | C++ | examples/example-ms2-ms1-matching.cpp | mkirchner/libfbi | 5a70ad70f38b4a9b9000610219e22ccaac7e3f5e | [
"MIT"
] | 6 | 2016-12-01T13:04:07.000Z | 2021-01-29T16:39:23.000Z | examples/example-ms2-ms1-matching.cpp | mkirchner/libfbi | 5a70ad70f38b4a9b9000610219e22ccaac7e3f5e | [
"MIT"
] | 3 | 2018-01-18T11:46:05.000Z | 2021-01-29T16:49:38.000Z | examples/example-ms2-ms1-matching.cpp | mkirchner/libfbi | 5a70ad70f38b4a9b9000610219e22ccaac7e3f5e | [
"MIT"
] | 5 | 2015-12-04T08:32:19.000Z | 2020-03-03T08:43:24.000Z | /*
* example-ms2-ms1-matching.cpp
*
* Copyright (c) 2010 Marc Kirchner <marc.kirchner@childrens.harvard.edu>
* Copyright (c) 2010 Buote Xu <buote.xu@gmail.com>
*
* This file is part of libfbi.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated d... | 29.108504 | 88 | 0.636006 | [
"vector"
] |
b76504235829ee3348bf992b21476f745a84bf45 | 3,798 | cc | C++ | GeneratorInterface/GenFilters/src/PythiaDauFilter.cc | pasmuss/cmssw | 566f40c323beef46134485a45ea53349f59ae534 | [
"Apache-2.0"
] | null | null | null | GeneratorInterface/GenFilters/src/PythiaDauFilter.cc | pasmuss/cmssw | 566f40c323beef46134485a45ea53349f59ae534 | [
"Apache-2.0"
] | null | null | null | GeneratorInterface/GenFilters/src/PythiaDauFilter.cc | pasmuss/cmssw | 566f40c323beef46134485a45ea53349f59ae534 | [
"Apache-2.0"
] | null | null | null |
#include "GeneratorInterface/GenFilters/interface/PythiaDauFilter.h"
#include "SimDataFormats/GeneratorProducts/interface/HepMCProduct.h"
#include "HepMC/PythiaWrapper6_4.h"
#include <iostream>
using namespace edm;
using namespace std;
PythiaDauFilter::PythiaDauFilter(const edm::ParameterSet& iConfig) :
token_(co... | 29.671875 | 134 | 0.603739 | [
"vector"
] |
b76a2bf3b4888983b2547c0fcb611f1e8ef14dac | 3,338 | cc | C++ | onnxruntime/core/providers/armnn/activation/activations.cc | KsenijaS/onnxruntime | 5086e55a35f83e3137bdb34b6d7210c97a512e6a | [
"MIT"
] | 2 | 2021-07-24T01:13:36.000Z | 2021-11-17T11:03:52.000Z | onnxruntime/core/providers/armnn/activation/activations.cc | KsenijaS/onnxruntime | 5086e55a35f83e3137bdb34b6d7210c97a512e6a | [
"MIT"
] | 4 | 2020-12-04T21:00:38.000Z | 2022-01-22T12:49:30.000Z | onnxruntime/core/providers/armnn/activation/activations.cc | KsenijaS/onnxruntime | 5086e55a35f83e3137bdb34b6d7210c97a512e6a | [
"MIT"
] | 1 | 2020-06-08T19:08:12.000Z | 2020-06-08T19:08:12.000Z | // Copyright (c) Microsoft Corporation. All rights reserved.
// Copyright (c) 2020, NXP Semiconductor, Inc. All rights reserved.
// Licensed under the MIT License
#ifdef RELU_ARMNN
#ifdef _WIN32
#pragma warning(disable : 4244)
#endif
#include "core/providers/armnn/armnn_common.h"
#include "core/providers/armnn/activ... | 33.049505 | 123 | 0.699221 | [
"shape"
] |
b76a657acd76e3c7c40ea4126a72875ae12ccdbe | 7,128 | cpp | C++ | src/visitor/AvoidParamMismatchVisitor.cpp | moritzwinger/ABC | 2d1f507dc7188b13767cce8050b8aa9daa7c1625 | [
"MIT"
] | null | null | null | src/visitor/AvoidParamMismatchVisitor.cpp | moritzwinger/ABC | 2d1f507dc7188b13767cce8050b8aa9daa7c1625 | [
"MIT"
] | null | null | null | src/visitor/AvoidParamMismatchVisitor.cpp | moritzwinger/ABC | 2d1f507dc7188b13767cce8050b8aa9daa7c1625 | [
"MIT"
] | null | null | null | #include "ast_opt/ast/AbstractNode.h"
#include "ast_opt/ast/Literal.h"
#include "ast_opt/visitor/IdentifyNoisySubtreeVisitor.h"
#include "ast_opt/visitor/AvoidParamMismatchVisitor.h"
#include <utility>
#include "ast_opt/ast/AbstractExpression.h"
SpecialAvoidParamMismatchVisitor::SpecialAvoidParamMismatchVisitor(std::u... | 45.987097 | 159 | 0.690657 | [
"vector"
] |
b7768711850341b0d117c387099d7c35c057d4c6 | 1,303 | cpp | C++ | acmicpc/14502.cpp | juseongkr/BOJ | 8f10a2bf9a7d695455493fbe7423347a8b648416 | [
"Apache-2.0"
] | 7 | 2020-02-03T10:00:19.000Z | 2021-11-16T11:03:57.000Z | acmicpc/14502.cpp | juseongkr/Algorithm-training | 8f10a2bf9a7d695455493fbe7423347a8b648416 | [
"Apache-2.0"
] | 1 | 2021-01-03T06:58:24.000Z | 2021-01-03T06:58:24.000Z | acmicpc/14502.cpp | juseongkr/Algorithm-training | 8f10a2bf9a7d695455493fbe7423347a8b648416 | [
"Apache-2.0"
] | 1 | 2020-01-22T14:34:03.000Z | 2020-01-22T14:34:03.000Z | #include <iostream>
#include <vector>
using namespace std;
int map[8][8];
int tmp[8][8];
int a[4] = {0, 1, 0, -1};
int b[4] = {1, 0, -1, 0};
int n, m;
void dfs(int x, int y)
{
tmp[x][y] = 2;
for (int i=0; i<4; ++i) {
int next_x = x + a[i];
int next_y = y + b[i];
if (next_x < 0 || next_y < 0 || next_x >= n ||... | 17.608108 | 61 | 0.450499 | [
"vector"
] |
b77bfb548cd13ed058dbeadd23edb5c185c0b3e3 | 6,483 | cpp | C++ | flappy/envs/fwmav/pydart2/pydart2_dof_api.cpp | ArbalestV/flappy | 9e715cacc842fab6b9dfd4d6f0f7fb65b769204f | [
"MIT"
] | 1 | 2021-02-03T16:38:03.000Z | 2021-02-03T16:38:03.000Z | flappy/envs/fwmav/pydart2/pydart2_dof_api.cpp | ArbalestV/flappy | 9e715cacc842fab6b9dfd4d6f0f7fb65b769204f | [
"MIT"
] | null | null | null | flappy/envs/fwmav/pydart2/pydart2_dof_api.cpp | ArbalestV/flappy | 9e715cacc842fab6b9dfd4d6f0f7fb65b769204f | [
"MIT"
] | 1 | 2019-10-21T23:14:10.000Z | 2019-10-21T23:14:10.000Z | #include <iostream>
#include <string>
#include <vector>
#include <map>
using std::cout;
using std::cerr;
using std::endl;
// Boost headers
#include <boost/algorithm/string.hpp>
#include "pydart2_manager.h"
#include "pydart2_api.h"
#include "pydart2_dof_api.h"
#include "pydart2_draw.h"
using namespace pydart;
////... | 29.60274 | 80 | 0.681166 | [
"vector"
] |
b78a42afc2de3ee816db46e8354c098a3ef496e7 | 9,987 | cpp | C++ | AI.cpp | VukanJ/Chess | 802f223985be9890fe02ae1da2ad90708cee5d6e | [
"MIT"
] | null | null | null | AI.cpp | VukanJ/Chess | 802f223985be9890fe02ae1da2ad90708cee5d6e | [
"MIT"
] | null | null | null | AI.cpp | VukanJ/Chess | 802f223985be9890fe02ae1da2ad90708cee5d6e | [
"MIT"
] | null | null | null | #include "AI.h"
AI::AI(string FEN, color computerColor)
: aiColor(computerColor), nodesVisited(0),
currentAge(0)
{
genChessData data;
data.genMoveData(); // Generates bitboards needed for move generation
board.setupBoard(FEN);
transpositionHash = ZobristHash(static_cast<size_t>(1e7));
}
AI::AI(string FEN, color... | 27.138587 | 117 | 0.649745 | [
"vector"
] |
b78c00a3c43ff2dacb8475c1c6540e6125c69e66 | 6,293 | cpp | C++ | DEM/Src/L2/Game/Mgr/StaticEnvManager.cpp | moltenguy1/deusexmachina | 134f4ca4087fff791ec30562cb250ccd50b69ee1 | [
"MIT"
] | 2 | 2017-04-30T20:24:29.000Z | 2019-02-12T08:36:26.000Z | DEM/Src/L2/Game/Mgr/StaticEnvManager.cpp | moltenguy1/deusexmachina | 134f4ca4087fff791ec30562cb250ccd50b69ee1 | [
"MIT"
] | null | null | null | DEM/Src/L2/Game/Mgr/StaticEnvManager.cpp | moltenguy1/deusexmachina | 134f4ca4087fff791ec30562cb250ccd50b69ee1 | [
"MIT"
] | null | null | null | #include "StaticEnvManager.h"
#include <Physics/Level.h>
#include <Physics/Event/SetTransform.h>
#include <Gfx/GfxServer.h>
#include <Gfx/ShapeEntity.h>
#include <Data/DataServer.h>
#include <Data/DataArray.h>
#include <Game/Mgr/EntityManager.h>
#include <DB/ValueTable.h>
namespace Attr
{
DeclareAttr(GU... | 29.824645 | 103 | 0.588749 | [
"object",
"transform"
] |
b78ea06af5f6b51a24b7773ac750c75b973b79a1 | 5,607 | cxx | C++ | src/Cxx/Visualization/BlobbyLogo.cxx | cvandijck/VTKExamples | b6bb89414522afc1467be8a1f0089a37d0c16883 | [
"Apache-2.0"
] | 309 | 2017-05-21T09:07:19.000Z | 2022-03-15T09:18:55.000Z | src/Cxx/Visualization/BlobbyLogo.cxx | yijianmingliu/VTKExamples | dc8aac47c4384f9a2de9facbdd1ab3249f62ec99 | [
"Apache-2.0"
] | 379 | 2017-05-21T09:06:43.000Z | 2021-03-29T20:30:50.000Z | src/Cxx/Visualization/BlobbyLogo.cxx | yijianmingliu/VTKExamples | dc8aac47c4384f9a2de9facbdd1ab3249f62ec99 | [
"Apache-2.0"
] | 170 | 2017-05-17T14:47:41.000Z | 2022-03-31T13:16:26.000Z | //
// use implicit modeller to create the VTK logo
//
#include <vtkActor.h>
#include <vtkAppendPolyData.h>
#include <vtkContourFilter.h>
#include <vtkImplicitModeller.h>
#include <vtkNamedColors.h>
#include <vtkPolyDataMapper.h>
#include <vtkPolyDataNormals.h>
#include <vtkPolyDataReader.h>
#include <vtkProperty.h>
#i... | 33.981818 | 75 | 0.759051 | [
"geometry",
"render",
"model",
"transform"
] |
b78eebea61fcf5ad062251065ce1b53adf2f3610 | 7,812 | cpp | C++ | Plugins/onAirVRServer/Source/onAirVRServer/Private/AirVRCameraRig.cpp | kteem/onairvr-server-for-ue4 | 169ed09d30aaf45ba0c2d7e2897052b972f619b9 | [
"MIT"
] | null | null | null | Plugins/onAirVRServer/Source/onAirVRServer/Private/AirVRCameraRig.cpp | kteem/onairvr-server-for-ue4 | 169ed09d30aaf45ba0c2d7e2897052b972f619b9 | [
"MIT"
] | null | null | null | Plugins/onAirVRServer/Source/onAirVRServer/Private/AirVRCameraRig.cpp | kteem/onairvr-server-for-ue4 | 169ed09d30aaf45ba0c2d7e2897052b972f619b9 | [
"MIT"
] | null | null | null | /***********************************************************
Copyright (c) 2017-2018 Clicked, Inc.
Licensed under the MIT license found in the LICENSE file
in the Docs folder of the distributed package.
***********************************************************/
#include "AirVRCameraRig.h"
#include "AirVRS... | 28.202166 | 154 | 0.670891 | [
"transform"
] |
b794b0ef0a83b07f04cfa35d8203ae188a42aaf6 | 1,478 | cpp | C++ | NeuroData/model/JavascriptProducerModel.cpp | lesit/NeuroStudio | f505065d694a8614587e7cc243ede72c141bd80b | [
"W3C"
] | 21 | 2018-11-15T08:23:14.000Z | 2022-03-30T15:44:59.000Z | NeuroData/model/JavascriptProducerModel.cpp | lesit/NeuroStudio | f505065d694a8614587e7cc243ede72c141bd80b | [
"W3C"
] | null | null | null | NeuroData/model/JavascriptProducerModel.cpp | lesit/NeuroStudio | f505065d694a8614587e7cc243ede72c141bd80b | [
"W3C"
] | 1 | 2021-12-08T01:17:27.000Z | 2021-12-08T01:17:27.000Z | #include "stdafx.h"
#include "JavascriptProducerModel.h"
#include "ModuleInterface/JSRunner/JavaScriptRunner.h"
using namespace np::ndr;
using namespace np::ndr::model;
JavascriptProducerModel::JavascriptProducerModel(neuro_u32 uid, const char* body)
: DynamicProducerModel(uid)
{
if (body)
m_js_body = body;
els... | 20.246575 | 105 | 0.698917 | [
"model"
] |
b7999892e476ec3074f4325313a1f0585a47f38a | 1,561 | hpp | C++ | libs/image/include/sge/image/pixel/object.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 2 | 2016-01-27T13:18:14.000Z | 2018-05-11T01:11:32.000Z | libs/image/include/sge/image/pixel/object.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | null | null | null | libs/image/include/sge/image/pixel/object.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 3 | 2018-05-11T01:11:34.000Z | 2021-04-24T19:47:45.000Z | // Copyright Carl Philipp Reh 2006 - 2019.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef SGE_IMAGE_PIXEL_OBJECT_HPP_INCLUDED
#define SGE_IMAGE_PIXEL_OBJECT_HPP_INCLUDED
#include <... | 25.590164 | 98 | 0.759769 | [
"object"
] |
b79afba6c13a506d48c3de977ad4a95ac3efeff6 | 832 | cpp | C++ | 279.cpp | pengzhezhe/LeetCode | 305ec0c5b4cb5ea7cd244b3308132dee778138bc | [
"Apache-2.0"
] | null | null | null | 279.cpp | pengzhezhe/LeetCode | 305ec0c5b4cb5ea7cd244b3308132dee778138bc | [
"Apache-2.0"
] | null | null | null | 279.cpp | pengzhezhe/LeetCode | 305ec0c5b4cb5ea7cd244b3308132dee778138bc | [
"Apache-2.0"
] | null | null | null | //
// Created by pzz on 2022/3/8.
//
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int numSquares(int n) {
vector<int> nums = generateNumSquares(n);
vector<int> dp(n + 1, n);
dp[0] = 0;
for (int i = 0; i < nums.size(); i++) {
for... | 19.809524 | 60 | 0.44351 | [
"vector"
] |
b79b686145496dc527ae39561957ca2ada6d79cb | 13,106 | cpp | C++ | src/evb/SFPPlotter.cpp | sesps/SPS_SABRE_EventBuilder | c044eed7cb10e31e76c13213e8bb5aef50391bba | [
"MIT"
] | null | null | null | src/evb/SFPPlotter.cpp | sesps/SPS_SABRE_EventBuilder | c044eed7cb10e31e76c13213e8bb5aef50391bba | [
"MIT"
] | null | null | null | src/evb/SFPPlotter.cpp | sesps/SPS_SABRE_EventBuilder | c044eed7cb10e31e76c13213e8bb5aef50391bba | [
"MIT"
] | null | null | null | /*SFPPlotter.h
*Class for generating histogram files for SPS-SABRE data
*Intended use case is generating a TChain of multiple analyzed files and making
*histograms of the larger data set.
*
*Created Jan 2020 by GWM
*/
#include "EventBuilder.h"
#include "SFPPlotter.h"
#include <TSystem.h>
/*Generates storage and... | 44.427119 | 120 | 0.701206 | [
"vector"
] |
b79f972b48b01e572a9cd233757ec383f343ee2b | 3,417 | cpp | C++ | shift/render.vk/private/shift/render/vk/smart_ptr.cpp | cspanier/shift | 5b3b9be310155fbc57d165d06259b723a5728828 | [
"Apache-2.0"
] | 2 | 2018-11-28T18:14:08.000Z | 2020-08-06T07:44:36.000Z | shift/render.vk/private/shift/render/vk/smart_ptr.cpp | cspanier/shift | 5b3b9be310155fbc57d165d06259b723a5728828 | [
"Apache-2.0"
] | 4 | 2018-11-06T21:01:05.000Z | 2019-02-19T07:52:52.000Z | shift/render.vk/private/shift/render/vk/smart_ptr.cpp | cspanier/shift | 5b3b9be310155fbc57d165d06259b723a5728828 | [
"Apache-2.0"
] | null | null | null | #include "shift/render/vk/smart_ptr.hpp"
namespace shift::render::vk
{
releaseable_wrapper::~releaseable_wrapper() = default;
thread_local std::unique_ptr<shared_object_queue>
shared_object_queue::_local_queue;
void shared_object_queue::initialize()
{
_local_queue = std::make_unique<shared_object_queue>();
}
vo... | 23.087838 | 79 | 0.729002 | [
"render",
"object"
] |
b7a1ad20700ccd9cdf16cfdf33596ff3ab4406a9 | 511 | cpp | C++ | eagleeye/processnode/ConstNode.cpp | MirrorYu/eagleeye | c251e7b3bc919673b41360212c38d5fda85bbe2f | [
"Apache-2.0"
] | 12 | 2020-09-21T02:24:11.000Z | 2022-03-10T03:02:03.000Z | eagleeye/processnode/ConstNode.cpp | MirrorYu/eagleeye | c251e7b3bc919673b41360212c38d5fda85bbe2f | [
"Apache-2.0"
] | 1 | 2020-11-30T08:22:50.000Z | 2020-11-30T08:22:50.000Z | eagleeye/processnode/ConstNode.cpp | MirrorYu/eagleeye | c251e7b3bc919673b41360212c38d5fda85bbe2f | [
"Apache-2.0"
] | 3 | 2020-03-16T12:10:55.000Z | 2021-07-20T09:58:15.000Z | #include "eagleeye/processnode/ConstNode.h"
namespace eagleeye
{
ConstNode::ConstNode(int input_port_num, std::vector<AnySignal*> output_const_sigs){
this->setNumberOfInputSignals(input_port_num);
// no input ports
this->setNumberOfOutputSignals(output_const_sigs.size());
for(int i=0; i<output_const_si... | 24.333333 | 84 | 0.712329 | [
"vector"
] |
b7aaf6d80fa2f3911bfb095fbda9f49ca7b0751c | 17,680 | cpp | C++ | sp/src/materialsystem/stdshaders/worldtwotextureblend.cpp | map-labs-source/Map-Labs | 29f60485c219dd8b4b0b4a7343c85ccad8ad1685 | [
"Unlicense"
] | 137 | 2019-07-13T03:40:58.000Z | 2022-03-17T21:53:10.000Z | sp/src/materialsystem/stdshaders/worldtwotextureblend.cpp | map-labs-source/Map-Labs | 29f60485c219dd8b4b0b4a7343c85ccad8ad1685 | [
"Unlicense"
] | 140 | 2019-10-24T16:48:00.000Z | 2022-03-27T06:17:50.000Z | sp/src/materialsystem/stdshaders/worldtwotextureblend.cpp | map-labs-source/Map-Labs | 29f60485c219dd8b4b0b4a7343c85ccad8ad1685 | [
"Unlicense"
] | 108 | 2019-09-30T22:00:56.000Z | 2022-03-30T00:14:58.000Z | //========= Copyright Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
// $Header: $
// $NoKeywords: $
//===========================================================================//
#include "BaseVSShader.h"
#include "convar.h"
#include "SDK_lightmappedgeneric_vs20.inc"
#include "SDK_worldt... | 34.940711 | 155 | 0.732466 | [
"transform"
] |
b7b2d9355e466f604992fe771b7bcac428e89632 | 1,307 | hpp | C++ | src/Magma/Framework/Thread/Mutex.hpp | RiscadoA/Magma | ea025e6762366d59b4841d174076c5aed3156623 | [
"MIT"
] | 1 | 2018-06-27T19:51:40.000Z | 2018-06-27T19:51:40.000Z | src/Magma/Framework/Thread/Mutex.hpp | RiscadoA/Simple-Game | ea025e6762366d59b4841d174076c5aed3156623 | [
"MIT"
] | 30 | 2018-08-19T15:42:59.000Z | 2018-09-09T19:09:34.000Z | src/Magma/Framework/Thread/Mutex.hpp | RiscadoA/Simple-Game | ea025e6762366d59b4841d174076c5aed3156623 | [
"MIT"
] | null | null | null | #pragma once
#include "../Memory/Handle.hpp"
#include "../Memory/Allocator.hpp"
#include "Mutex.h"
namespace Magma
{
namespace Framework
{
namespace Thread
{
/// <summary>
/// Mutex handle.
/// </summary>
class HMutex : public Memory::Handle
{
public:
using Handle::Handle;
using Handl... | 25.627451 | 98 | 0.629686 | [
"object"
] |
5d9f27a69419a6ab38025d5d427567d83eb10df7 | 1,187 | cpp | C++ | atcoder/agc009/B/main.cpp | Johniel/contests | b692eff913c20e2c1eb4ff0ce3cd4c57900594e0 | [
"Unlicense"
] | null | null | null | atcoder/agc009/B/main.cpp | Johniel/contests | b692eff913c20e2c1eb4ff0ce3cd4c57900594e0 | [
"Unlicense"
] | 19 | 2016-05-04T02:46:31.000Z | 2021-11-27T06:18:33.000Z | atcoder/agc009/B/main.cpp | Johniel/contests | b692eff913c20e2c1eb4ff0ce3cd4c57900594e0 | [
"Unlicense"
] | null | null | null | #include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template<typename P, typename Q>
ostream& operator << (ostream& os, pair<P, Q> p)
{
os << "(" << p.first <<... | 19.783333 | 75 | 0.506318 | [
"vector"
] |
5da28ac63f05c0e90d83f50fbc3bc5542068bb2a | 2,024 | hpp | C++ | include/bdlearn/SAMMEEnsemble.hpp | billythedummy/bdlearn | bdb7b22c326f8057ec3ec06a701d00885e801bfd | [
"MIT"
] | 2 | 2019-12-04T08:24:17.000Z | 2020-01-31T23:29:52.000Z | include/bdlearn/SAMMEEnsemble.hpp | billythedummy/bdlearn | bdb7b22c326f8057ec3ec06a701d00885e801bfd | [
"MIT"
] | null | null | null | include/bdlearn/SAMMEEnsemble.hpp | billythedummy/bdlearn | bdb7b22c326f8057ec3ec06a701d00885e801bfd | [
"MIT"
] | null | null | null | #ifndef _BDLEARN_SAMME_ENSEMBLE_H_
#define _BDLEARN_SAMME_ENSEMBLE_H_
#include "Halide.h"
#include "bdlearn/BufDims.hpp"
#include "bdlearn/Model.hpp"
#include "bdlearn/DataSet.hpp"
namespace bdlearn {
class SAMMEEnsemble {
public:
// constructor
SAMMEEnsemble(const bool training)
... | 36.142857 | 99 | 0.590909 | [
"vector",
"model"
] |
5da5738b433f66b709984e8985a7cdde647cbd8f | 1,401 | hpp | C++ | src/entities/items/Ghost.hpp | lonnort/thga | 22cc8868ec8bf9cee195771f0a88bef4d1fa1013 | [
"BSL-1.0"
] | 1 | 2022-02-14T12:32:23.000Z | 2022-02-14T12:32:23.000Z | src/entities/items/Ghost.hpp | lonnort/thga | 22cc8868ec8bf9cee195771f0a88bef4d1fa1013 | [
"BSL-1.0"
] | 16 | 2022-02-04T14:26:25.000Z | 2022-02-04T14:27:18.000Z | src/entities/items/Ghost.hpp | lonnort/thga | 22cc8868ec8bf9cee195771f0a88bef4d1fa1013 | [
"BSL-1.0"
] | null | null | null | #pragma once
#include "Item.hpp"
namespace Pacenstein {
/**
* Ghosts are item that move around on their own volition.
*
* Every ghost has a different AI for attacking the Player. Every ghost is capable of deducting
* a life from the player, unless the player has eaten a PowerPellet, then the g... | 29.808511 | 100 | 0.586724 | [
"object"
] |
5db0c20805e690d7699fc310ed83eb6c1837abae | 9,467 | cpp | C++ | test/test_cfd_transaction_controller.cpp | atomicfinance/cfd | 6e1ed9901be749408ec9b886973ce1e7f9a395ab | [
"MIT"
] | 4 | 2019-10-12T11:05:15.000Z | 2020-11-06T16:09:54.000Z | test/test_cfd_transaction_controller.cpp | atomicfinance/cfd | 6e1ed9901be749408ec9b886973ce1e7f9a395ab | [
"MIT"
] | 133 | 2019-10-04T05:36:15.000Z | 2022-02-07T04:02:39.000Z | test/test_cfd_transaction_controller.cpp | atomicfinance/cfd | 6e1ed9901be749408ec9b886973ce1e7f9a395ab | [
"MIT"
] | 2 | 2019-11-08T06:43:13.000Z | 2019-11-15T16:14:10.000Z | #include "gtest/gtest.h"
#include <vector>
#include "cfdcore/cfdcore_amount.h"
#include "cfdcore/cfdcore_bytedata.h"
#include "cfdcore/cfdcore_coin.h"
#include "cfdcore/cfdcore_exception.h"
#include "cfdcore/cfdcore_key.h"
#include "cfdcore/cfdcore_transaction_common.h"
#include "cfd/cfd_transaction.h"
using cfd::cor... | 45.080952 | 414 | 0.820218 | [
"vector"
] |
5db4520fde7a1617f21918b57903191b9c10c200 | 2,200 | hpp | C++ | Source/AllProjects/Drivers/CQCGenDrv/Server/CQCGenDrvS.hpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | 51 | 2020-12-26T18:17:16.000Z | 2022-03-15T04:29:35.000Z | Source/AllProjects/Drivers/CQCGenDrv/Server/CQCGenDrvS.hpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | null | null | null | Source/AllProjects/Drivers/CQCGenDrv/Server/CQCGenDrvS.hpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | 4 | 2020-12-28T07:24:39.000Z | 2021-12-29T12:09:37.000Z | //
// FILE NAME: CQCGenDrvS.hpp
//
// AUTHOR: Dean Roddey
//
// CREATED: 04/09/2003
//
// COPYRIGHT: Charmed Quark Systems, Ltd @ 2020
//
// This software is copyrighted by 'Charmed Quark Systems, Ltd' and
// the author (Dean Roddey.) It is licensed under the MIT Open Source
// license:
//
// https://opensource.o... | 31.884058 | 78 | 0.518182 | [
"object"
] |
5dc4a9832ed162e31602199d29b5980fa01e6d4a | 1,926 | hpp | C++ | benchsuite/utils/memory.hpp | angelicadavila/UNIZAR_PHD | 532a87467ceb49d3c3851bb23e26003bfc1888d3 | [
"MIT"
] | null | null | null | benchsuite/utils/memory.hpp | angelicadavila/UNIZAR_PHD | 532a87467ceb49d3c3851bb23e26003bfc1888d3 | [
"MIT"
] | null | null | null | benchsuite/utils/memory.hpp | angelicadavila/UNIZAR_PHD | 532a87467ceb49d3c3851bb23e26003bfc1888d3 | [
"MIT"
] | null | null | null | #ifndef ENGINECL_MEMORY_HPP
#define ENGINECL_MEMORY_HPP
#include <cstdint>
#include <iostream>
#include <type_traits>
#include <vector>
template<typename T, std::size_t N = alignof(T)>
class aligned_allocator
{
// helper type with the alignment we want
typedef typename std::aligned_storage<sizeof(T), N>::type ali... | 27.514286 | 82 | 0.734683 | [
"vector"
] |
5dc4efe7d93104b9dc2d51e2f894e479b06158b4 | 18,849 | cpp | C++ | work/desenet-sensor/src/common/platform/nucleo-stm32l476rg/board/display/eplib/paint.cpp | MacherelR/DeSemProject_20212022 | 7314e5787a3ff2ca5bf95c6de7fbbee9598b98ea | [
"MIT"
] | null | null | null | work/desenet-sensor/src/common/platform/nucleo-stm32l476rg/board/display/eplib/paint.cpp | MacherelR/DeSemProject_20212022 | 7314e5787a3ff2ca5bf95c6de7fbbee9598b98ea | [
"MIT"
] | null | null | null | work/desenet-sensor/src/common/platform/nucleo-stm32l476rg/board/display/eplib/paint.cpp | MacherelR/DeSemProject_20212022 | 7314e5787a3ff2ca5bf95c6de7fbbee9598b98ea | [
"MIT"
] | null | null | null | #include <cstdlib>
#include <cstring> // memset()
#include <cmath>
#include "paint.h"
namespace ep {
Paint::Paint()
{
buffer = nullptr;
}
void Paint::initialize(ep::Display * epd)
{
this->epd = epd;
}
/******************************************************************************
function: ... | 32.78087 | 143 | 0.497851 | [
"solid"
] |
5dc5073854fe36e115504d3dd8faf5cf86662c31 | 1,369 | cpp | C++ | 238.product_of_array_except_self.cpp | liangwt/leetcode | 8f279343e975666a63ee531228c6836f20f199ca | [
"Apache-2.0"
] | 5 | 2019-09-12T05:23:44.000Z | 2021-11-15T11:19:39.000Z | 238.product_of_array_except_self.cpp | liangwt/leetcode | 8f279343e975666a63ee531228c6836f20f199ca | [
"Apache-2.0"
] | 18 | 2019-09-23T13:11:06.000Z | 2019-11-09T11:20:17.000Z | 238.product_of_array_except_self.cpp | liangwt/leetcode | 8f279343e975666a63ee531228c6836f20f199ca | [
"Apache-2.0"
] | null | null | null | /**
* Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].
*
* Example:
*
* Input: [1,2,3,4]
* Output: [24,12,8,6]
* Note: Please solve it without division and in O(n).
*
* Follow up:
* Could you solve i... | 19.84058 | 161 | 0.527392 | [
"vector"
] |
5dc6dea83f9af22bf75a718bfb316f8a7bd53f3c | 10,318 | cpp | C++ | src/plugins/glance/glanceshower.cpp | Maledictus/leechcraft | 79ec64824de11780b8e8bdfd5d8a2f3514158b12 | [
"BSL-1.0"
] | 120 | 2015-01-22T14:10:39.000Z | 2021-11-25T12:57:16.000Z | src/plugins/glance/glanceshower.cpp | Maledictus/leechcraft | 79ec64824de11780b8e8bdfd5d8a2f3514158b12 | [
"BSL-1.0"
] | 8 | 2015-02-07T19:38:19.000Z | 2017-11-30T20:18:28.000Z | src/plugins/glance/glanceshower.cpp | Maledictus/leechcraft | 79ec64824de11780b8e8bdfd5d8a2f3514158b12 | [
"BSL-1.0"
] | 33 | 2015-02-07T16:59:55.000Z | 2021-10-12T00:36:40.000Z | /**********************************************************************
* LeechCraft - modular cross-platform feature rich internet client.
* Copyright (C) 2006-2014 Georg Rudoy
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE or copy at https://www.boost.org/LICENSE... | 26.8 | 111 | 0.626672 | [
"render"
] |
5dc874488f676656b6c47157f54106a8991af4a6 | 346 | cpp | C++ | DynamicProgramming/tilingmn.cpp | Ankitlenka26/IP2021 | 99322c9c84a8a9c9178a505afbffdcebd312b059 | [
"MIT"
] | null | null | null | DynamicProgramming/tilingmn.cpp | Ankitlenka26/IP2021 | 99322c9c84a8a9c9178a505afbffdcebd312b059 | [
"MIT"
] | null | null | null | DynamicProgramming/tilingmn.cpp | Ankitlenka26/IP2021 | 99322c9c84a8a9c9178a505afbffdcebd312b059 | [
"MIT"
] | null | null | null | #include<iostream>
#include<vector>
#include<algorithm>
#define ll long long int
using namespace std ;
int main(){
int n , m ;
cin >> n >> m ;
vector<int> dp(n+1);
for(int i=0 ;i<=n ;i++){
if(i<m){
dp[i] = 1;
}else if(i==m){
dp[i] = 2;
}else{
dp[i] = dp[i-1] + dp[i-m];
}
}
cout << dp[n... | 13.84 | 31 | 0.50289 | [
"vector"
] |
5dce984a1d67a8e048549231651a93f46b9bb286 | 3,102 | cc | C++ | src/rtff/filter_impl.cc | audionamix/rtff | 1a56bb3980d167feee3778001a420ea101d497e3 | [
"MIT"
] | 6 | 2019-07-16T08:37:20.000Z | 2022-01-06T02:57:42.000Z | src/rtff/filter_impl.cc | audionamix/rtff | 1a56bb3980d167feee3778001a420ea101d497e3 | [
"MIT"
] | 1 | 2020-06-19T08:12:58.000Z | 2020-06-23T18:53:19.000Z | src/rtff/filter_impl.cc | audionamix/rtff | 1a56bb3980d167feee3778001a420ea101d497e3 | [
"MIT"
] | 2 | 2020-01-16T14:22:03.000Z | 2020-02-09T12:03:49.000Z | #include "rtff/filter_impl.h"
#include "rtff/fft/fft.h"
namespace rtff {
void FilterImpl::Init(uint32_t fft_size, uint32_t overlap,
fft_window::Type windows_type,
uint8_t channel_count, std::error_code& err) {
fft_size_ = fft_size;
overlap_ = overlap;
// init the wi... | 35.25 | 78 | 0.690522 | [
"transform"
] |
5dd0f4ec1e3b54cdad3c78ed21597b42f3f1cd90 | 21,578 | cpp | C++ | third_party/llvm-project/raw_ostream.cpp | phated/binaryen | 50e66800dc28d67ea1cc88172f459df1ca96507d | [
"Apache-2.0"
] | 5,871 | 2015-11-13T19:06:43.000Z | 2022-03-31T17:40:21.000Z | third_party/llvm-project/raw_ostream.cpp | sthagen/binaryen | ce592cbdc8e58f36e7f39a3bd24b403f43adae34 | [
"Apache-2.0"
] | 2,743 | 2015-11-13T03:46:49.000Z | 2022-03-31T20:27:05.000Z | third_party/llvm-project/raw_ostream.cpp | sthagen/binaryen | ce592cbdc8e58f36e7f39a3bd24b403f43adae34 | [
"Apache-2.0"
] | 626 | 2015-11-23T08:00:11.000Z | 2022-03-17T01:58:18.000Z | //===--- raw_ostream.cpp - Implement the raw_ostream classes --------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... | 30.263675 | 80 | 0.614561 | [
"vector",
"model"
] |
5dd6e02b5e099093fb44d8fef18f4971cc892a6d | 72,811 | cpp | C++ | test/unit/test.unit.api.parse_format/test.unit.api.parse_format.cpp | synesissoftware/FastFormat | 53d3ccbb4313f908cb1a482372179db60e12e1a8 | [
"BSD-3-Clause"
] | 55 | 2015-10-06T21:42:05.000Z | 2022-01-21T04:14:29.000Z | test/unit/test.unit.api.parse_format/test.unit.api.parse_format.cpp | synesissoftware/FastFormat | 53d3ccbb4313f908cb1a482372179db60e12e1a8 | [
"BSD-3-Clause"
] | 2 | 2017-10-10T05:29:51.000Z | 2019-03-23T04:20:59.000Z | test/unit/test.unit.api.parse_format/test.unit.api.parse_format.cpp | synesissoftware/FastFormat | 53d3ccbb4313f908cb1a482372179db60e12e1a8 | [
"BSD-3-Clause"
] | 8 | 2016-01-02T17:47:41.000Z | 2021-09-30T21:58:36.000Z | /* /////////////////////////////////////////////////////////////////////////
* File: test.unit.api.parse_format.cpp
*
* Purpose: Implementation file for the test.unit.api.parse_format project.
*
* Created: 27th May 2008
* Updated: 26th September 2015
*
* Status: Wizard-generated
*
* Li... | 43.185647 | 179 | 0.688399 | [
"vector"
] |
5dd9d417a48dfe964ab9ffad5d342d3d223d70af | 3,426 | cpp | C++ | oi/Contest/self/2016-12/C.cpp | Riteme/test | b511d6616a25f4ae8c3861e2029789b8ee4dcb8d | [
"BSD-Source-Code"
] | 3 | 2018-08-30T09:43:20.000Z | 2019-12-03T04:53:43.000Z | oi/Contest/self/2016-12/C.cpp | Riteme/test | b511d6616a25f4ae8c3861e2029789b8ee4dcb8d | [
"BSD-Source-Code"
] | null | null | null | oi/Contest/self/2016-12/C.cpp | Riteme/test | b511d6616a25f4ae8c3861e2029789b8ee4dcb8d | [
"BSD-Source-Code"
] | null | null | null | #include <cstdio>
#include <cctype>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
#define INPUT_BUFFERSIZE 65536
static size_t ipos = INPUT_BUFFERSIZE;
static char ibuffer[INPUT_BUFFERSIZE];
inline char _getchar() {
if (ipos == INPUT_BUFFERSIZE) {
ipos = 0;
fread... | 18.928177 | 63 | 0.475773 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.