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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e8cb15e39feaa838f92184222cc2e1ee28b3de1b | 4,059 | hpp | C++ | include/aikido/control/Executor.hpp | personalrobotics/r3 | 1303e3f3ef99a0c2249abc7415d19113f0026565 | [
"BSD-3-Clause"
] | null | null | null | include/aikido/control/Executor.hpp | personalrobotics/r3 | 1303e3f3ef99a0c2249abc7415d19113f0026565 | [
"BSD-3-Clause"
] | null | null | null | include/aikido/control/Executor.hpp | personalrobotics/r3 | 1303e3f3ef99a0c2249abc7415d19113f0026565 | [
"BSD-3-Clause"
] | null | null | null | #ifndef AIKIDO_CONTROL_EXECUTOR_HPP_
#define AIKIDO_CONTROL_EXECUTOR_HPP_
#include <chrono>
#include <set>
#include <vector>
#include <dart/dart.hpp>
#include "aikido/common/ExecutorThread.hpp"
#include "aikido/common/pointers.hpp"
namespace aikido {
namespace control {
AIKIDO_DECLARE_POINTERS(Executor)
/// Type ... | 28.1875 | 79 | 0.705346 | [
"vector"
] |
e8dac6d858b496c7ca0f96d94fc284905f8ecf03 | 260 | cpp | C++ | LeetCode/Array/88_merge_sorted_array.cpp | Shaownak/Data-Structures | 5077333755f27effcc7e454a446192294bc84a59 | [
"MIT"
] | null | null | null | LeetCode/Array/88_merge_sorted_array.cpp | Shaownak/Data-Structures | 5077333755f27effcc7e454a446192294bc84a59 | [
"MIT"
] | null | null | null | LeetCode/Array/88_merge_sorted_array.cpp | Shaownak/Data-Structures | 5077333755f27effcc7e454a446192294bc84a59 | [
"MIT"
] | null | null | null | class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int j = 0;
for(int i=m; i<m+n; i++){
nums1[i] = nums2[j];
j++;
}
sort(nums1.begin(), nums1.end());
}
};
| 21.666667 | 70 | 0.446154 | [
"vector"
] |
e8e01a15a26f39f2a728933333c19f7d985ed9cb | 457 | cpp | C++ | leetcode/852.peak-index-in-a-mountain-array.cpp | geemaple/algorithm | 68bc5032e1ee52c22ef2f2e608053484c487af54 | [
"MIT"
] | 177 | 2017-08-21T08:57:43.000Z | 2020-06-22T03:44:22.000Z | leetcode/852.peak-index-in-a-mountain-array.cpp | geemaple/algorithm | 68bc5032e1ee52c22ef2f2e608053484c487af54 | [
"MIT"
] | 2 | 2018-09-06T13:39:12.000Z | 2019-06-03T02:54:45.000Z | leetcode/852.peak-index-in-a-mountain-array.cpp | geemaple/algorithm | 68bc5032e1ee52c22ef2f2e608053484c487af54 | [
"MIT"
] | 23 | 2017-08-23T06:01:28.000Z | 2020-04-20T03:17:36.000Z | class Solution {
public:
int peakIndexInMountainArray(vector<int>& A) {
int start = 0;
int end = A.size() - 1;
while (start + 1 < end)
{
int mid = start + (end - start) / 2;
if (A[mid] > A[mid + 1])
{
end = mid;
}
... | 19.869565 | 50 | 0.358862 | [
"vector"
] |
e8e752e629a86560ba7a24639cbaa5c1a676f008 | 4,788 | cpp | C++ | src_code/AdvancedQt/censusvisualizer/censusvisualizer.cpp | yanrong/book_demo | 20cd13f3c3507a11e826ebbf22bd1c7bcb36e06f | [
"Apache-2.0"
] | null | null | null | src_code/AdvancedQt/censusvisualizer/censusvisualizer.cpp | yanrong/book_demo | 20cd13f3c3507a11e826ebbf22bd1c7bcb36e06f | [
"Apache-2.0"
] | null | null | null | src_code/AdvancedQt/censusvisualizer/censusvisualizer.cpp | yanrong/book_demo | 20cd13f3c3507a11e826ebbf22bd1c7bcb36e06f | [
"Apache-2.0"
] | null | null | null | /*
Copyright (c) 2009-10 Qtrac Ltd. All rights reserved.
This program or module is free software: you can redistribute it
and/or modify it under the terms of the GNU General Public License
as published by the Free Software Foundation, either version 3 of
the License, or (at your option) any later v... | 31.294118 | 72 | 0.654971 | [
"model"
] |
e8f5ae7e7359d023ffb994a4a21b0a5169af6cbb | 2,632 | cpp | C++ | src/Application/Application.cpp | Frostie314159/FrostEngine | bb7781c5c90baf77ca836d69d6c38a4a5381e27f | [
"MIT"
] | null | null | null | src/Application/Application.cpp | Frostie314159/FrostEngine | bb7781c5c90baf77ca836d69d6c38a4a5381e27f | [
"MIT"
] | null | null | null | src/Application/Application.cpp | Frostie314159/FrostEngine | bb7781c5c90baf77ca836d69d6c38a4a5381e27f | [
"MIT"
] | null | null | null | #include "Application.hpp"
Application::Application() {
}
Application::~Application() {
}
void Application::run() {
Config m_appConfig = ConfigLoader::loadConfigFile("../res/Config.json");
glfwInit();
ImageLoadingScheduler m_imageLoadingScheduler = ImageLoadingScheduler(m_appConfig);
Window m_appWindow = Window... | 34.631579 | 152 | 0.74962 | [
"vector"
] |
e8fa83bbaf7b227a46f59f666cd50cabeefec95c | 4,811 | cpp | C++ | pwiz_tools/Bumbershoot/idpicker/Qonverter/waffles/GKeyPair.cpp | austinkeller/pwiz | aa8e575cb40fd5e97cc7d922e4d8da44c9277cca | [
"Apache-2.0"
] | 2 | 2019-12-28T21:24:36.000Z | 2020-04-18T03:52:05.000Z | pwiz_tools/Bumbershoot/idpicker/Qonverter/waffles/GKeyPair.cpp | austinkeller/pwiz | aa8e575cb40fd5e97cc7d922e4d8da44c9277cca | [
"Apache-2.0"
] | null | null | null | pwiz_tools/Bumbershoot/idpicker/Qonverter/waffles/GKeyPair.cpp | austinkeller/pwiz | aa8e575cb40fd5e97cc7d922e4d8da44c9277cca | [
"Apache-2.0"
] | null | null | null | /*
Copyright (C) 2006, Mike Gashler
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
see http://www.gnu.org/copy... | 21.968037 | 189 | 0.704843 | [
"object"
] |
3306caf4f48df9308bb3e19d90492f595b998944 | 2,982 | cpp | C++ | effective-modern-cpp/src/1-template-type-deduction/deduct.cpp | ahxxm/cpp-exercise | abbe530770d49843ceaf706fb55b91ef100b1162 | [
"WTFPL"
] | 2 | 2016-12-06T00:49:35.000Z | 2017-01-15T07:00:24.000Z | effective-modern-cpp/src/1-template-type-deduction/deduct.cpp | ahxxm/cpp-exercise | abbe530770d49843ceaf706fb55b91ef100b1162 | [
"WTFPL"
] | 5 | 2016-05-02T13:52:52.000Z | 2016-09-28T07:57:09.000Z | effective-modern-cpp/src/1-template-type-deduction/deduct.cpp | ahxxm/cpp-exercise | abbe530770d49843ceaf706fb55b91ef100b1162 | [
"WTFPL"
] | null | null | null | #include <array>
#include <iostream>
#include "gtest/gtest.h"
// Case 1: pointer/reference ParamType
// reasonable deduction
template<typename T>
void f1(T& param) {
std::cout << __PRETTY_FUNCTION__ << std::endl;
std::cout << ¶m << std::endl;
};
template<typename T>
void f11(const T ¶m) {
std::cout <<... | 20.708333 | 69 | 0.589537 | [
"object"
] |
3307cefdbae031b9ea8dc976fd4bc49149bc209f | 490 | cpp | C++ | examples/geography/geoplot/geoplot_2.cpp | kurogane1031/matplotplusplus | 44d21156edba8effe1e764a8642b0b70590d597b | [
"MIT"
] | 2 | 2020-09-02T14:02:26.000Z | 2020-10-28T07:00:44.000Z | examples/geography/geoplot/geoplot_2.cpp | kurogane1031/matplotplusplus | 44d21156edba8effe1e764a8642b0b70590d597b | [
"MIT"
] | null | null | null | examples/geography/geoplot/geoplot_2.cpp | kurogane1031/matplotplusplus | 44d21156edba8effe1e764a8642b0b70590d597b | [
"MIT"
] | 2 | 2020-09-01T16:22:07.000Z | 2020-09-02T14:02:27.000Z | #include <cmath>
#include <matplot/matplot.h>
int main() {
using namespace matplot;
double lat_seattle = 47.62;
double lon_seattle = -122.33;
double lat_anchorage = 61.20;
double lon_anchorage = -149.9;
geoplot(std::vector{lat_seattle,lat_anchorage}, std::vector{lon_seattle,lon_anchorage},"g-*... | 25.789474 | 98 | 0.667347 | [
"vector"
] |
330c5d397f7cdba1dad91a5a2a30d32f458c0eea | 6,630 | cpp | C++ | hackerrank.com/fraud-prevention.cpp | bolatov/contests | 39654ec36e1b7ff62052e324428141a9564fd576 | [
"MIT"
] | null | null | null | hackerrank.com/fraud-prevention.cpp | bolatov/contests | 39654ec36e1b7ff62052e324428141a9564fd576 | [
"MIT"
] | null | null | null | hackerrank.com/fraud-prevention.cpp | bolatov/contests | 39654ec36e1b7ff62052e324428141a9564fd576 | [
"MIT"
] | null | null | null | #include <cmath>
#include <cstdio>
#include <map>
#include <set>
#include <vector>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cassert>
using namespace std;
string trim(string s) {
string t = "";
int end = (int)s.size() - 1;
for (; end >= 0; end--) {
if (s[end] != ' ')
... | 24.924812 | 77 | 0.486576 | [
"vector"
] |
330cae1434be59db366367ef4e351562499f7ab6 | 702 | cpp | C++ | sim_algorithm/binary_search.cpp | pachicobue/CacheObliviousAlgorithms | db6e5f19c708d83208206091ae44cd6d7c71c4e0 | [
"Unlicense"
] | null | null | null | sim_algorithm/binary_search.cpp | pachicobue/CacheObliviousAlgorithms | db6e5f19c708d83208206091ae44cd6d7c71c4e0 | [
"Unlicense"
] | null | null | null | sim_algorithm/binary_search.cpp | pachicobue/CacheObliviousAlgorithms | db6e5f19c708d83208206091ae44cd6d7c71c4e0 | [
"Unlicense"
] | null | null | null | #include <algorithm>
#include "binary_search.hpp"
#include "simulator/simulator.hpp"
binary_search::binary_search(std::vector<data_t> vs)
{
std::sort(vs.begin(), vs.end());
vs.push_back(Max + 1);
for (const auto v : vs) { m_datas.push_back(disk_var<data_t>{v}); }
}
data_t binary_search::lower_bound(const... | 29.25 | 72 | 0.609687 | [
"vector"
] |
330ff7620f7c1194d1758a205897a17400d750f5 | 482 | cpp | C++ | Scripts/174_std.cpp | zzz0906/LeetCode | cd0b4a4fd03d0dff585c9ef349984eba1922ece0 | [
"MIT"
] | 17 | 2018-08-23T08:53:56.000Z | 2021-04-17T00:06:13.000Z | Scripts/174_std.cpp | zzz0906/LeetCode | cd0b4a4fd03d0dff585c9ef349984eba1922ece0 | [
"MIT"
] | null | null | null | Scripts/174_std.cpp | zzz0906/LeetCode | cd0b4a4fd03d0dff585c9ef349984eba1922ece0 | [
"MIT"
] | null | null | null | class Solution {
public:
int calculateMinimumHP(vector<vector<int>>& dungeon) {
int m = dungeon.size(), n = dungeon[0].size();
vector<vector<int>> dp(m + 1, vector<int>(n + 1, INT_MAX));
dp[m][n - 1] = 1; dp[m - 1][n] = 1;
for (int i = m - 1; i >= 0; --i) {
for (int j = n... | 34.428571 | 83 | 0.421162 | [
"vector"
] |
3310fbbfece2e1715fa04228f347315c89299bf4 | 7,102 | cpp | C++ | mpc/kmpc_casadi/casadi_windows/include/casadi/core/transpose.cpp | se-hwan/MIT_Driverless | 7674b29887ba518c134cfba805432f9c98f92270 | [
"MIT"
] | 29 | 2020-05-11T16:59:10.000Z | 2022-02-24T11:30:16.000Z | mpc/kmpc_casadi/casadi_windows/include/casadi/core/transpose.cpp | se-hwan/MIT_Driverless | 7674b29887ba518c134cfba805432f9c98f92270 | [
"MIT"
] | 1 | 2021-02-04T04:20:55.000Z | 2021-02-28T20:47:02.000Z | mpc/kmpc_casadi/casadi_windows/include/casadi/core/transpose.cpp | se-hwan/MIT_Driverless | 7674b29887ba518c134cfba805432f9c98f92270 | [
"MIT"
] | 10 | 2020-06-22T22:41:32.000Z | 2021-12-15T12:26:13.000Z | /*
* This file is part of CasADi.
*
* CasADi -- A symbolic framework for dynamic optimization.
* Copyright (C) 2010-2014 Joel Andersson, Joris Gillis, Moritz Diehl,
* K.U. Leuven. All rights reserved.
* Copyright (C) 2011-2014 Greg Horn
*
* CasADi is free software; you ... | 30.350427 | 95 | 0.579696 | [
"vector"
] |
331c2ace31fe6b85319350dd6eef435768c299dd | 3,874 | cpp | C++ | src/App.cpp | tgcy210/cyclus | b9402710be94403d33aa5a9b9aa546cdcca1cb86 | [
"Unlicense"
] | 1 | 2018-07-29T16:10:02.000Z | 2018-07-29T16:10:02.000Z | src/App.cpp | tgcy210/cyclus | b9402710be94403d33aa5a9b9aa546cdcca1cb86 | [
"Unlicense"
] | null | null | null | src/App.cpp | tgcy210/cyclus | b9402710be94403d33aa5a9b9aa546cdcca1cb86 | [
"Unlicense"
] | null | null | null | #include <iostream>
#include <cstdlib>
#include <cstring>
#include <string>
#include "boost/program_options.hpp"
#include "boost/shared_ptr.hpp"
#include "Model.h"
#include "BookKeeper.h"
#include "Timer.h"
#include "InputXML.h"
#include "CycException.h"
#include "Env.h"
#include "Logger.h"
using namespace std;
names... | 28.072464 | 125 | 0.569437 | [
"model"
] |
33264675695a4afdc52210acafa9645bc4001c22 | 47,628 | cpp | C++ | sumo/src/netedit/GNELane.cpp | iltempe/osmosi | c0f54ecdbb7c7b5602d587768617d0dc50f1d75d | [
"MIT"
] | null | null | null | sumo/src/netedit/GNELane.cpp | iltempe/osmosi | c0f54ecdbb7c7b5602d587768617d0dc50f1d75d | [
"MIT"
] | null | null | null | sumo/src/netedit/GNELane.cpp | iltempe/osmosi | c0f54ecdbb7c7b5602d587768617d0dc50f1d75d | [
"MIT"
] | 2 | 2017-12-14T16:41:59.000Z | 2020-10-16T17:51:27.000Z | /****************************************************************************/
/// @file GNELane.cpp
/// @author Jakob Erdmann
/// @date Feb 2011
/// @version $Id$
///
// A class for visualizing Lane geometry (adapted from GNELaneWrapper)
/*************************************************************************... | 41.742331 | 158 | 0.604098 | [
"geometry",
"object",
"shape",
"vector",
"transform"
] |
06bc743c1c61a9ae4f8d6ff3b96516ccf47324dd | 3,694 | cxx | C++ | src/CalibXMLCnv/cnv/XmlAncQdcPedCnv.cxx | fermi-lat/CalibSvc | c262bbd5481a01af3f75a250fc1ba385bb5c775f | [
"BSD-3-Clause"
] | null | null | null | src/CalibXMLCnv/cnv/XmlAncQdcPedCnv.cxx | fermi-lat/CalibSvc | c262bbd5481a01af3f75a250fc1ba385bb5c775f | [
"BSD-3-Clause"
] | null | null | null | src/CalibXMLCnv/cnv/XmlAncQdcPedCnv.cxx | fermi-lat/CalibSvc | c262bbd5481a01af3f75a250fc1ba385bb5c775f | [
"BSD-3-Clause"
] | null | null | null | // $Header: /nfs/slac/g/glast/ground/cvs/GlastRelease-scons/CalibSvc/src/CalibXMLCnv/cnv/XmlAncQdcPedCnv.cxx,v 1.1.618.1 2010/10/18 02:50:19 heather Exp $
#include <string>
#include "GaudiKernel/CnvFactory.h"
#include "GaudiKernel/IOpaqueAddress.h"
#include "GaudiKernel/DataObject.h"
#include "GaudiKernel/IAddressCre... | 27.161765 | 154 | 0.710612 | [
"object"
] |
06c02245fcc8507c67dbb75ace5a14466a3a431b | 3,148 | hpp | C++ | reflecxx/include/reflecxx/json_visitor.hpp | jimmyorourke/reflecxx | 4be3ebb741ba540e447b5353c6abd057d2ee3d80 | [
"MIT"
] | null | null | null | reflecxx/include/reflecxx/json_visitor.hpp | jimmyorourke/reflecxx | 4be3ebb741ba540e447b5353c6abd057d2ee3d80 | [
"MIT"
] | null | null | null | reflecxx/include/reflecxx/json_visitor.hpp | jimmyorourke/reflecxx | 4be3ebb741ba540e447b5353c6abd057d2ee3d80 | [
"MIT"
] | null | null | null | // Copyright (c) 2021-2022 Jimmy O'Rourke
// Licensed under and subject to the terms of the LICENSE file accompanying this distribution.
// Official repository: https://github.com/jimmyorourke/reflecxx
#pragma once
// The code below uses the generated visitor acceptors. To avoid problems if this header is inclu... | 35.370787 | 121 | 0.671855 | [
"object"
] |
06c324d6ecb09dad26965308e028f2d9d5ea101d | 1,196 | cpp | C++ | src/Cpp/10_Listy_dwie_listy/Zad3.cpp | djeada/Nauka-programowania | b1eb6840c15b830acf552f0a0fc5cc692759152f | [
"MIT"
] | 3 | 2020-09-19T21:38:30.000Z | 2022-03-30T11:02:26.000Z | src/Cpp/10_Listy_dwie_listy/Zad3.cpp | djeada/Nauka-programowania | b1eb6840c15b830acf552f0a0fc5cc692759152f | [
"MIT"
] | null | null | null | src/Cpp/10_Listy_dwie_listy/Zad3.cpp | djeada/Nauka-programowania | b1eb6840c15b830acf552f0a0fc5cc692759152f | [
"MIT"
] | 1 | 2022-02-04T09:13:20.000Z | 2022-02-04T09:13:20.000Z | #include <cassert>
#include <vector>
/*
Dla otrzymanych dwoch list, zwroc liste, ktorej elementy sa suma odpowiadajacych
sobie elementow otrzymanych list. Jesli listy nie sa rownej dlugosci, zaloz ze
brakujace elementy krotszej listy sa rowne 0.
*/
std::vector<int> suma(std::vector<int> &listaA, std::vector<int> &... | 20.982456 | 81 | 0.622074 | [
"vector"
] |
06c863fc8e0a21b726f4a5a6b8208b2eae8a0253 | 467 | cpp | C++ | source/qml/Library/RendererQml/RenderedQmlAdaptiveCard.cpp | rohshar6/AdaptiveCards | 13305e82f47ef24db4582599e01615e623f16d26 | [
"MIT"
] | null | null | null | source/qml/Library/RendererQml/RenderedQmlAdaptiveCard.cpp | rohshar6/AdaptiveCards | 13305e82f47ef24db4582599e01615e623f16d26 | [
"MIT"
] | 29 | 2021-02-16T15:51:01.000Z | 2021-12-22T12:46:11.000Z | source/qml/Library/RendererQml/RenderedQmlAdaptiveCard.cpp | rohshar6/AdaptiveCards | 13305e82f47ef24db4582599e01615e623f16d26 | [
"MIT"
] | 16 | 2021-02-10T07:46:07.000Z | 2021-11-23T10:22:44.000Z | #include "pch.h"
#include "RenderedQmlAdaptiveCard.h"
namespace RendererQml
{
RenderedQmlAdaptiveCard::RenderedQmlAdaptiveCard(std::shared_ptr<QmlTag> qmlTag, std::shared_ptr<AdaptiveCards::AdaptiveCard> originatingCard, const std::vector<AdaptiveWarning>& warnings) :
RenderedQmlAdaptiveCardBase(originati... | 27.470588 | 194 | 0.740899 | [
"vector"
] |
06cb980d4b4567aea8f6592107c575c764b2db83 | 4,797 | cpp | C++ | Graphics.DX12/DX12Renderer.cpp | MartijnTerpstra/CainEngine | da52dc065e619ba5761521a024055c6f03d04c8e | [
"MIT"
] | null | null | null | Graphics.DX12/DX12Renderer.cpp | MartijnTerpstra/CainEngine | da52dc065e619ba5761521a024055c6f03d04c8e | [
"MIT"
] | null | null | null | Graphics.DX12/DX12Renderer.cpp | MartijnTerpstra/CainEngine | da52dc065e619ba5761521a024055c6f03d04c8e | [
"MIT"
] | null | null | null | #include "Precomp.h"
#include "Event.h"
#include "DX12Renderer.h"
using namespace ::CainEngine;
using namespace ::CainEngine::Graphics;
using namespace ::CainEngine::Graphics::DX12;
DX12Renderer::DX12Renderer()
{
}
DX12Renderer::~DX12Renderer()
{
}
void DX12Renderer::Init(flag<RendererInitFlags> initFlags)
{
COMM... | 28.724551 | 162 | 0.791745 | [
"mesh",
"render"
] |
06cc9ad31077182cd8494dd5fdec537dba575dae | 3,739 | cpp | C++ | sgfx/src/ppm.cpp | keithoma/the_shape_of_data | 143f94685f5b77e562463f158cc97544579f14ad | [
"MIT"
] | null | null | null | sgfx/src/ppm.cpp | keithoma/the_shape_of_data | 143f94685f5b77e562463f158cc97544579f14ad | [
"MIT"
] | null | null | null | sgfx/src/ppm.cpp | keithoma/the_shape_of_data | 143f94685f5b77e562463f158cc97544579f14ad | [
"MIT"
] | null | null | null | #include <iostream>
#include <sgfx/ppm.hpp>
#include <vector>
#define let auto /* Pure provocation with respect to my dire love to F# & my hate to C++ auto keyword. */
namespace sgfx::ppm {
using namespace std;
canvas Parser::parseString(std::string const& data)
{
offset_ = 0;
source_ = &data;
consumeTo... | 23.664557 | 105 | 0.585183 | [
"vector"
] |
06ced825008b5ca9cf6b3a8ae9540aedc523ee20 | 89,583 | cpp | C++ | src/imaging/ossimEquationCombiner.cpp | vladislav-horbatiuk/ossim | 82417ad868fac022672335e1684bdd91d662c18c | [
"MIT"
] | 251 | 2015-10-20T09:08:11.000Z | 2022-03-22T18:16:38.000Z | src/imaging/ossimEquationCombiner.cpp | IvanLJF/ossim | 2e0143f682b9884a09ff2598ef8737f29e44fbdf | [
"MIT"
] | 73 | 2015-11-02T17:12:36.000Z | 2021-11-15T17:41:47.000Z | src/imaging/ossimEquationCombiner.cpp | IvanLJF/ossim | 2e0143f682b9884a09ff2598ef8737f29e44fbdf | [
"MIT"
] | 146 | 2015-10-15T16:00:15.000Z | 2022-03-22T12:37:14.000Z | //*******************************************************************
// Copyright (C) 2000 ImageLinks Inc.
//
// License: LGPL
//
// See LICENSE.txt file in the top level directory for more details.
//
// Author: Garrett Potts
//
//*************************************************************************
// $Id: os... | 25.044171 | 135 | 0.474688 | [
"object",
"vector"
] |
06d457b24f3d9966012745f9b1c6d7a762cd80b9 | 3,964 | hpp | C++ | composite/graph/compute_loss.hpp | kingang1986/purine2 | e53447da173e83fb62bae8cf50bde17f75723203 | [
"BSD-2-Clause"
] | 312 | 2015-03-16T15:29:38.000Z | 2021-09-16T22:48:41.000Z | composite/graph/compute_loss.hpp | zuiwufenghua/purine2 | e53447da173e83fb62bae8cf50bde17f75723203 | [
"BSD-2-Clause"
] | 19 | 2015-03-17T16:20:19.000Z | 2015-10-03T03:34:09.000Z | composite/graph/compute_loss.hpp | zuiwufenghua/purine2 | e53447da173e83fb62bae8cf50bde17f75723203 | [
"BSD-2-Clause"
] | 108 | 2015-03-16T07:07:30.000Z | 2021-08-22T07:32:13.000Z | // Copyright Lin Min 2015
#ifndef PURINE_COMPUTE_LOSS
#define PURINE_COMPUTE_LOSS
#include <iomanip>
#include <fstream>
#include <set>
#include "composite/composite.hpp"
using namespace std;
namespace purine {
template <typename Net>
class ComputeLoss : public Runnable {
protected:
Net* net_;
vector<Blob*> dat... | 29.147059 | 78 | 0.606458 | [
"vector",
"transform"
] |
06d743df20a1807a753aa73e2c1d4a3f23a2b8d6 | 11,675 | cc | C++ | media/gpu/ipc/service/picture_buffer_manager.cc | zipated/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 2,151 | 2020-04-18T07:31:17.000Z | 2022-03-31T08:39:18.000Z | media/gpu/ipc/service/picture_buffer_manager.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 395 | 2020-04-18T08:22:18.000Z | 2021-12-08T13:04:49.000Z | media/gpu/ipc/service/picture_buffer_manager.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 338 | 2020-04-18T08:03:10.000Z | 2022-03-29T12:33:22.000Z | // Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "media/gpu/ipc/service/picture_buffer_manager.h"
#include <map>
#include <set>
#include <utility>
#include "base/bind.h"
#include "base/locatio... | 35.378788 | 80 | 0.685824 | [
"vector"
] |
06db1950339410af32731a681c028012767ce9dd | 3,609 | cpp | C++ | ds/security/ssr/te/ssrcore.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | ds/security/ssr/te/ssrcore.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | ds/security/ssr/te/ssrcore.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | // SsrCore.cpp : Implementation of CSsrCore
#include "stdafx.h"
#include "SSRTE.h"
#include "ActionData.h"
#include "SSRTEngine.h"
#include "SsrCore.h"
#include "SSRLog.h"
#include "global.h"
#include "util.h"
//-------------------------------------------------------------------------------
// ISsrC... | 13.366667 | 84 | 0.511222 | [
"object"
] |
06f2dd80349f298755d7adb03f5c2a85415c40ba | 1,387 | cpp | C++ | 0617-Maximum Average Subarray/0617-Maximum Average Subarray.cpp | lightwindy/LintCode-1 | 316fa395c9a6de9bfac1d9c9cf58acb5ffb384a6 | [
"MIT"
] | 77 | 2017-12-30T13:33:37.000Z | 2022-01-16T23:47:08.000Z | 0601-0700/0617-Maximum Average Subarray/0617-Maximum Average Subarray.cpp | jxhangithub/LintCode-1 | a8aecc65c47a944e9debad1971a7bc6b8776e48b | [
"MIT"
] | 1 | 2018-05-14T14:15:40.000Z | 2018-05-14T14:15:40.000Z | 0601-0700/0617-Maximum Average Subarray/0617-Maximum Average Subarray.cpp | jxhangithub/LintCode-1 | a8aecc65c47a944e9debad1971a7bc6b8776e48b | [
"MIT"
] | 39 | 2017-12-07T14:36:25.000Z | 2022-03-10T23:05:37.000Z | class Solution {
public:
/**
* @param nums an array with positive and negative numbers
* @param k an integer
* @return the maximum average
*/
double maxAverage(vector<int>& nums, int k) {
// Write your code here
int minNum = INT_MAX, maxNum = INT_MIN;
for (int num : n... | 25.685185 | 64 | 0.427541 | [
"vector"
] |
06f44b3747d5fec719968f8d7c7997e5b0b4f8f4 | 42,004 | cpp | C++ | Code/C++_OpenCV_Projeto_TCII/main.cpp | aabling2/projeto_tcc_2017 | d276ddb40c49eb75271977953502d3a08e4f4fe5 | [
"MIT"
] | null | null | null | Code/C++_OpenCV_Projeto_TCII/main.cpp | aabling2/projeto_tcc_2017 | d276ddb40c49eb75271977953502d3a08e4f4fe5 | [
"MIT"
] | null | null | null | Code/C++_OpenCV_Projeto_TCII/main.cpp | aabling2/projeto_tcc_2017 | d276ddb40c49eb75271977953502d3a08e4f4fe5 | [
"MIT"
] | null | null | null | //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//Term Paper - Electrical Engineering - UNISC
//Start date: 27/09/2016
//By: Augusto Abling
//Description: This program was designed for a computer vision system that inspects some parts (D... | 44.876068 | 150 | 0.52795 | [
"object",
"vector"
] |
06f71dcff04d8a2184c14e1c076c1e33b214f1e8 | 1,208 | cpp | C++ | week 2/queue.cpp | mtereshkin/coursera-white-belt-cpp | 54c57315bdc8733ebfdbd83b72d767f1c6e9a2d7 | [
"MIT"
] | null | null | null | week 2/queue.cpp | mtereshkin/coursera-white-belt-cpp | 54c57315bdc8733ebfdbd83b72d767f1c6e9a2d7 | [
"MIT"
] | null | null | null | week 2/queue.cpp | mtereshkin/coursera-white-belt-cpp | 54c57315bdc8733ebfdbd83b72d767f1c6e9a2d7 | [
"MIT"
] | null | null | null | #include <iostream>
#include<vector>
#include<string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> people;
vector<int> count_vector;
string command;
int number;
for (int i = 0; i < n; i++) {
cin >> command;
if (command == "COME") {
cin >> numbe... | 23.230769 | 53 | 0.379967 | [
"vector"
] |
06f7f570035d4d9d318558232b216c2f5879f984 | 737 | cpp | C++ | cpp/1001-10000/1631-1640/Check Array Formation Through Concatenation.cpp | KaiyuWei/leetcode | fd61f5df60cfc7086f7e85774704bacacb4aaa5c | [
"MIT"
] | 150 | 2015-04-04T06:53:49.000Z | 2022-03-21T13:32:08.000Z | cpp/1001-10000/1631-1640/Check Array Formation Through Concatenation.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 1 | 2015-04-13T15:15:40.000Z | 2015-04-21T20:23:16.000Z | cpp/1001-10000/1631-1640/Check Array Formation Through Concatenation.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 64 | 2015-06-30T08:00:07.000Z | 2022-01-01T16:44:14.000Z | class Solution {
public:
bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces) {
map<int, int> mymap;
for (int i = 0; i < arr.size(); i++) {
mymap[arr[i]] = i;
}
for (const vector<int>& piece : pieces) {
for (int i = 0; i < piece.size(); i+... | 26.321429 | 70 | 0.378562 | [
"vector"
] |
66001a65b6381905e8ffaaf4a8449f3852963a87 | 22,942 | cpp | C++ | projects/pbr_viewer/pbr_viewer.cpp | crocdialer/vierkant_projects | 0f84ff6c809f303b19babe8093544d967e60207e | [
"MIT"
] | null | null | null | projects/pbr_viewer/pbr_viewer.cpp | crocdialer/vierkant_projects | 0f84ff6c809f303b19babe8093544d967e60207e | [
"MIT"
] | null | null | null | projects/pbr_viewer/pbr_viewer.cpp | crocdialer/vierkant_projects | 0f84ff6c809f303b19babe8093544d967e60207e | [
"MIT"
] | null | null | null | #include <fstream>
#include <crocore/filesystem.hpp>
#include <crocore/http.hpp>
#include <crocore/Image.hpp>
#include <crocore/json.hpp>
#include <vierkant/imgui/imgui_util.h>
#include <vierkant/Visitor.hpp>
#include <vierkant/PBRDeferred.hpp>
#include <vierkant/cubemap_utils.hpp>
#include <vierkant/assimp.hpp>
#in... | 35.241167 | 119 | 0.618821 | [
"mesh",
"geometry",
"render",
"vector",
"model",
"transform"
] |
660148d2fae59c10c2e0e76ab6bc630533f93fc3 | 2,175 | cpp | C++ | data/dailyCodingProblem34.cpp | vidit1999/daily_coding_problem | b90319cb4ddce11149f54010ba36c4bd6fa0a787 | [
"MIT"
] | 2 | 2020-09-04T20:56:23.000Z | 2021-06-11T07:42:26.000Z | data/dailyCodingProblem509.cpp | vidit1999/daily_coding_problem | b90319cb4ddce11149f54010ba36c4bd6fa0a787 | [
"MIT"
] | null | null | null | data/dailyCodingProblem509.cpp | vidit1999/daily_coding_problem | b90319cb4ddce11149f54010ba36c4bd6fa0a787 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
/*
Given a string, find the palindrome that can be made by inserting
the fewest number of characters as possible anywhere in the word.
If there is more than one palindrome of minimum length that can
be made, return the lexicographically earliest one
(the first one alphabet... | 22.193878 | 74 | 0.611954 | [
"vector"
] |
66033ebeb987632531d26a0e1d7f920859ea64e5 | 8,623 | cpp | C++ | languages/cxx/chain_proxy/12-mutex.cpp | amerlyq/aeternum-langs | 8424dd2ff1680cb82ea78a44a798a15fc87de103 | [
"MIT"
] | 4 | 2018-05-18T20:29:53.000Z | 2021-12-06T04:57:44.000Z | languages/cxx/chain_proxy/12-mutex.cpp | amerlyq/aeternum-langs | 8424dd2ff1680cb82ea78a44a798a15fc87de103 | [
"MIT"
] | null | null | null | languages/cxx/chain_proxy/12-mutex.cpp | amerlyq/aeternum-langs | 8424dd2ff1680cb82ea78a44a798a15fc87de103 | [
"MIT"
] | null | null | null | //bin/mkdir -p "/tmp${d:=$(realpath -s "${0%/*}")}/${n:=${0##*/}}" && exec \
//usr/bin/make -C "$_" -sf/dev/null --eval="!:${n%.*};./$<" VPATH="$d" CXXFLAGS=-g LDFLAGS=-lpthread "$@"
#include <atomic>
#include <cassert>
#include <chrono>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#includ... | 32.175373 | 105 | 0.560362 | [
"vector"
] |
66046218635f5f61c726f4f7ec3b45b13e0dbc8a | 1,225 | cpp | C++ | cpp/331-340/Nested List Weight Sum.cpp | KaiyuWei/leetcode | fd61f5df60cfc7086f7e85774704bacacb4aaa5c | [
"MIT"
] | 150 | 2015-04-04T06:53:49.000Z | 2022-03-21T13:32:08.000Z | cpp/331-340/Nested List Weight Sum.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 1 | 2015-04-13T15:15:40.000Z | 2015-04-21T20:23:16.000Z | cpp/331-340/Nested List Weight Sum.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 64 | 2015-06-30T08:00:07.000Z | 2022-01-01T16:44:14.000Z | /**
* // This is the interface that allows for creating nested lists.
* // You should not implement it, or speculate about its implementation
* class NestedInteger {
* public:
* // Return true if this NestedInteger holds a single integer, rather than a nested list.
* bool isInteger() const;
*
* //... | 34.027778 | 95 | 0.626122 | [
"vector"
] |
6609f7ad8b77eb229645771296b0cf4f748c6b14 | 1,784 | cpp | C++ | uva/599 - The Forrest for the Trees.cpp | terror/Solutions | 1ad33daec95b565a38ac4730261593bcf249ac86 | [
"CC0-1.0"
] | 2 | 2021-04-05T14:26:37.000Z | 2021-06-10T04:22:01.000Z | uva/599 - The Forrest for the Trees.cpp | terror/Solutions | 1ad33daec95b565a38ac4730261593bcf249ac86 | [
"CC0-1.0"
] | null | null | null | uva/599 - The Forrest for the Trees.cpp | terror/Solutions | 1ad33daec95b565a38ac4730261593bcf249ac86 | [
"CC0-1.0"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | 20.044944 | 72 | 0.5213 | [
"vector"
] |
660ee7ad18a7b1d9ef72035bd1cb3c6cec61c255 | 38,744 | cpp | C++ | libarea/kbool/src/line.cpp | JohnyEngine/CNC | e4c77250ab2b749d3014022cbb5eb9924e939993 | [
"Apache-2.0"
] | null | null | null | libarea/kbool/src/line.cpp | JohnyEngine/CNC | e4c77250ab2b749d3014022cbb5eb9924e939993 | [
"Apache-2.0"
] | null | null | null | libarea/kbool/src/line.cpp | JohnyEngine/CNC | e4c77250ab2b749d3014022cbb5eb9924e939993 | [
"Apache-2.0"
] | null | null | null | /*! \file kbool/src/line.cpp
\brief Mainly used for calculating crossings
\author Klaas Holwerda
Copyright: 2001-2004 (C) Klaas Holwerda
Licence: see kboollicense.txt
RCS-ID: $Id: line.cpp,v 1.10 2005/06/17 22:48:46 kbluck Exp $
*/
#ifdef __GNUG__
#pragma implementation
#endif
// Standard in... | 26.23155 | 128 | 0.655121 | [
"shape"
] |
660faf4f1df801815c69735670ec34d864cc374e | 3,014 | cpp | C++ | src/swagger/v1/model/PacketProtocolMpls.cpp | DerangedMonkeyNinja/openperf | cde4dc6bf3687f0663c11e9e856e26a0dc2b1d16 | [
"Apache-2.0"
] | 20 | 2019-12-04T01:28:52.000Z | 2022-03-17T14:09:34.000Z | src/swagger/v1/model/PacketProtocolMpls.cpp | DerangedMonkeyNinja/openperf | cde4dc6bf3687f0663c11e9e856e26a0dc2b1d16 | [
"Apache-2.0"
] | 115 | 2020-02-04T21:29:54.000Z | 2022-02-17T13:33:51.000Z | src/swagger/v1/model/PacketProtocolMpls.cpp | DerangedMonkeyNinja/openperf | cde4dc6bf3687f0663c11e9e856e26a0dc2b1d16 | [
"Apache-2.0"
] | 16 | 2019-12-03T16:41:18.000Z | 2021-11-06T04:44:11.000Z | /**
* OpenPerf API
* REST API interface for OpenPerf
*
* OpenAPI spec version: 1
* Contact: support@spirent.com
*
* NOTE: This class is auto generated by the swagger code generator program.
* https://github.com/swagger-api/swagger-codegen.git
* Do not edit the class manually.
*/
#include "PacketProtocolMpls.h"
names... | 18.604938 | 75 | 0.680823 | [
"object",
"model"
] |
6616c0aca7080bcf3940f2731e2bf33744b4bcd9 | 11,560 | cpp | C++ | framework_c++/jugimap/jmVectorShapesUtilities.cpp | Jugilus/jugimapAPI | 93fba7827b16169f858f7bd88c87236c5cf27183 | [
"MIT"
] | 8 | 2020-11-23T23:34:39.000Z | 2022-02-23T12:14:02.000Z | framework_c++/jugimap/jmVectorShapesUtilities.cpp | Jugilus/jugimapAPI | 93fba7827b16169f858f7bd88c87236c5cf27183 | [
"MIT"
] | null | null | null | framework_c++/jugimap/jmVectorShapesUtilities.cpp | Jugilus/jugimapAPI | 93fba7827b16169f858f7bd88c87236c5cf27183 | [
"MIT"
] | 3 | 2019-12-19T13:44:43.000Z | 2020-05-15T01:02:10.000Z | #include <assert.h>
#include "jmDrawing.h"
#include "jmVectorShapesUtilities.h"
namespace jugimap{
bool IsPolygonConvex(std::vector<Vec2f> &vertices, bool &cw)
{
bool negative = false;
bool positive = false;
int nVertices = vertices.size();
for (int i = 0; i < nVertices; i++){
int iNext ... | 26.821346 | 137 | 0.548183 | [
"vector",
"transform"
] |
6617d99771719e3cbd48b934285a2ad3cc3df382 | 4,234 | cpp | C++ | tests/majority_element_tester.cpp | pawel-kieliszczyk/algorithms | 0703ec99ce9fb215709b56fb0eefbdd576c71ed2 | [
"MIT"
] | null | null | null | tests/majority_element_tester.cpp | pawel-kieliszczyk/algorithms | 0703ec99ce9fb215709b56fb0eefbdd576c71ed2 | [
"MIT"
] | null | null | null | tests/majority_element_tester.cpp | pawel-kieliszczyk/algorithms | 0703ec99ce9fb215709b56fb0eefbdd576c71ed2 | [
"MIT"
] | null | null | null | #include <vector>
#include <gtest/gtest.h>
#include "majority_element.hpp"
namespace gt = testing;
namespace pk
{
namespace testing
{
struct majority_element_tester : public gt::Test
{
std::vector<int> numbers;
};
TEST_F(majority_element_tester, tests_existing_majority_element_in_one_element_sequence)
{
... | 21.383838 | 102 | 0.691308 | [
"vector"
] |
6627db63de52924ae81724447003264209f32798 | 13,872 | cpp | C++ | src/main/cpp/subsystems/Shooter.cpp | crephoto/Wilson2021 | 542f13b613e5ffe135123d6c1e1850f7b9f80712 | [
"BSD-3-Clause"
] | null | null | null | src/main/cpp/subsystems/Shooter.cpp | crephoto/Wilson2021 | 542f13b613e5ffe135123d6c1e1850f7b9f80712 | [
"BSD-3-Clause"
] | null | null | null | src/main/cpp/subsystems/Shooter.cpp | crephoto/Wilson2021 | 542f13b613e5ffe135123d6c1e1850f7b9f80712 | [
"BSD-3-Clause"
] | null | null | null | /*----------------------------------------------------------------------------*/
/* Copyright (c) 2019 FIRST. All Rights Reserved. */
/* Open Source Software - may be modified and shared by FRC teams. The code */
/* must be accompanied by the FIRST BSD license file in the root directory of... | 35.478261 | 129 | 0.712731 | [
"object"
] |
663255f80c11a8f6194f9b9c7b8f2b997e63cdce | 6,483 | cc | C++ | src/HostManager.cc | ARCCN/Host-Manager | f574471839f4bc404229f92f566b54d68bfcdc72 | [
"Apache-2.0"
] | null | null | null | src/HostManager.cc | ARCCN/Host-Manager | f574471839f4bc404229f92f566b54d68bfcdc72 | [
"Apache-2.0"
] | null | null | null | src/HostManager.cc | ARCCN/Host-Manager | f574471839f4bc404229f92f566b54d68bfcdc72 | [
"Apache-2.0"
] | 1 | 2019-10-24T17:11:07.000Z | 2019-10-24T17:11:07.000Z | /*
* Copyright 2015 Applied Research Center for Computer Networks
*
* 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 b... | 25.72619 | 120 | 0.594786 | [
"object"
] |
6641244609956b2e3b022a252b70c40c7f58a7e3 | 22,732 | cc | C++ | client/client.cc | rescrv/Consus | bb05df2f314b1dc7510a3fb73604491227ebc516 | [
"BSD-3-Clause"
] | 239 | 2016-12-13T16:27:52.000Z | 2021-09-19T20:46:38.000Z | client/client.cc | ngaut/Consus | bb05df2f314b1dc7510a3fb73604491227ebc516 | [
"BSD-3-Clause"
] | 6 | 2016-12-19T02:11:28.000Z | 2017-09-07T02:44:47.000Z | client/client.cc | ngaut/Consus | bb05df2f314b1dc7510a3fb73604491227ebc516 | [
"BSD-3-Clause"
] | 16 | 2016-12-18T09:48:28.000Z | 2019-01-27T08:51:34.000Z | // Copyright (c) 2015-2017, Robert Escriva, Cornell University
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice... | 25.949772 | 111 | 0.571705 | [
"vector"
] |
664af8d4238d924fc7efebcb47dc19ea0d6068c4 | 833 | cpp | C++ | HackerRank/C++/VariableSizedArray.cpp | Iltwats/Competitive-Programming- | 5e3af928e10d06a11dd5daab1b572184029ac3a4 | [
"MIT"
] | 1 | 2020-09-29T11:21:22.000Z | 2020-09-29T11:21:22.000Z | HackerRank/C++/VariableSizedArray.cpp | Iltwats/Competitive-Programming- | 5e3af928e10d06a11dd5daab1b572184029ac3a4 | [
"MIT"
] | null | null | null | HackerRank/C++/VariableSizedArray.cpp | Iltwats/Competitive-Programming- | 5e3af928e10d06a11dd5daab1b572184029ac3a4 | [
"MIT"
] | null | null | null | // For problem and its details: https://www.hackerrank.com/challenges/variable-sized-arrays/problem
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
int q;
cin >> n >> q;
vector<int> a[n];
for(int i = 0; i ... | 22.513514 | 109 | 0.510204 | [
"vector"
] |
664b8cb55b0076ecbadbe1788971340d34899571 | 791 | cpp | C++ | 1st/plus_one.cpp | buptlxb/leetcode | b641419de040801c4f54618d7ee26edcf10ee53c | [
"BSD-3-Clause"
] | null | null | null | 1st/plus_one.cpp | buptlxb/leetcode | b641419de040801c4f54618d7ee26edcf10ee53c | [
"BSD-3-Clause"
] | null | null | null | 1st/plus_one.cpp | buptlxb/leetcode | b641419de040801c4f54618d7ee26edcf10ee53c | [
"BSD-3-Clause"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> plusOne(vector<int> &digits) {
int carry, tmp;
for (vector<int>::reverse_iterator iter = digits.rbegin(); iter != digits.rend(); iter++) {
tmp = *iter + 1;
... | 23.969697 | 103 | 0.472819 | [
"vector"
] |
664d1daf4fdcaf7aea12fcc9f85ad1e1d8b6adab | 5,085 | hpp | C++ | src/SivComponent/Collision/Colliders.hpp | mak1a/SivComponent | 1043cde67a5dc14f2d4e0128aecfee7f54ed7002 | [
"MIT"
] | 1 | 2021-01-24T08:55:59.000Z | 2021-01-24T08:55:59.000Z | src/SivComponent/Collision/Colliders.hpp | mak1a/SivComponent | 1043cde67a5dc14f2d4e0128aecfee7f54ed7002 | [
"MIT"
] | 2 | 2021-01-24T06:12:12.000Z | 2021-01-24T14:37:10.000Z | src/SivComponent/Collision/Colliders.hpp | mak1a/SivComponent | 1043cde67a5dc14f2d4e0128aecfee7f54ed7002 | [
"MIT"
] | null | null | null | #pragma once
#define NO_S3D_USING
#include <Siv3D.hpp>
#include "ICollider.hpp"
// #include <list>
#include "../../ComponentEngine/AttachableComponent.hpp"
// #include "../ComponentEngine/GameObject.hpp"
// #include "../ComponentEngine/IComponent.hpp"
#include "CollisionSystem.hpp"
namespace ComponentEngine::Coll... | 33.453947 | 117 | 0.616912 | [
"shape",
"transform"
] |
5949743e38c474f5ff0620d764aa20f751b43978 | 1,082 | cpp | C++ | src/camlsnark_c/libsnark-caml/depends/libfqfft/tutorials/polynomial_multiplication_on_fft_example.cpp | Pratyush/snarky | 4776e98ba72d4c8706c689fd747462ef87db8799 | [
"MIT"
] | 71 | 2016-07-21T02:49:57.000Z | 2022-03-23T12:46:13.000Z | src/camlsnark_c/libsnark-caml/depends/libfqfft/tutorials/polynomial_multiplication_on_fft_example.cpp | Pratyush/snarky | 4776e98ba72d4c8706c689fd747462ef87db8799 | [
"MIT"
] | 11 | 2017-05-09T03:47:55.000Z | 2021-03-26T01:53:39.000Z | src/camlsnark_c/libsnark-caml/depends/libfqfft/tutorials/polynomial_multiplication_on_fft_example.cpp | Pratyush/snarky | 4776e98ba72d4c8706c689fd747462ef87db8799 | [
"MIT"
] | 41 | 2016-07-22T05:54:38.000Z | 2022-03-28T12:11:55.000Z | #include <cstdio>
#include <vector>
#include <libff/common/double.hpp>
#include <libfqfft/polynomial_arithmetic/basic_operations.hpp>
using namespace libfqfft;
/* Polynomial Multiplication via FFT */
template <typename FieldT>
void polynomial_multiplication_on_FFT_example ()
{
/* Polynomial a = 1 + 2x + 3x^2 + x^... | 25.162791 | 67 | 0.577634 | [
"vector"
] |
5950778a887cb6711d509e8bd3406d2f0321de70 | 2,107 | cpp | C++ | src/graphicsnodescene.cpp | rochus/qt5-node-editor | 9c9bc9b713aa6fe4c59e6d70ce0115a2800d461a | [
"MIT"
] | 168 | 2015-07-02T09:41:31.000Z | 2020-12-29T11:33:09.000Z | src/graphicsnodescene.cpp | Guyiguang/qt5-node-editor | 9c9bc9b713aa6fe4c59e6d70ce0115a2800d461a | [
"MIT"
] | 11 | 2015-06-19T07:39:40.000Z | 2018-09-04T13:49:23.000Z | src/graphicsnodescene.cpp | rochus/qt5-node-editor | 9c9bc9b713aa6fe4c59e6d70ce0115a2800d461a | [
"MIT"
] | 52 | 2015-04-02T03:59:26.000Z | 2020-12-29T11:33:10.000Z | /* See LICENSE file for copyright and license details. */
#include "graphicsnodescene.hpp"
#include <cmath>
#include <QPainter>
#include <QGraphicsTextItem>
#include <algorithm>
#include <iostream>
// TODO: move to graphicsnodeview. use graphicsnodescene for management
GraphicsNodeScene::GraphicsNodeScene(QObject *p... | 27.723684 | 75 | 0.713811 | [
"vector"
] |
5960dca9f40b38f0c1acdea47da49d5bd00231b2 | 3,603 | cpp | C++ | modules/task_2/zarubin_m_bubble_sort_even_odd_algorithm/main.cpp | Stepakrap/pp_2021_autumn | 716803a14183172337d51712fb28fe8e86891a3d | [
"BSD-3-Clause"
] | 1 | 2021-12-09T17:20:25.000Z | 2021-12-09T17:20:25.000Z | modules/task_2/zarubin_m_bubble_sort_even_odd_algorithm/main.cpp | Stepakrap/pp_2021_autumn | 716803a14183172337d51712fb28fe8e86891a3d | [
"BSD-3-Clause"
] | null | null | null | modules/task_2/zarubin_m_bubble_sort_even_odd_algorithm/main.cpp | Stepakrap/pp_2021_autumn | 716803a14183172337d51712fb28fe8e86891a3d | [
"BSD-3-Clause"
] | 3 | 2022-02-23T14:20:50.000Z | 2022-03-30T09:00:02.000Z | // Copyright 2021 Zarubin Mikhail
#include <gtest/gtest.h>
#include <vector>
#include "./bubble_sort_even_odd_algorithm.h"
#include <gtest-mpi-listener.hpp>
TEST(GENERATE_VECTOR, can_generate_random_vector) {
std::vector<int> vector(5);
ASSERT_NO_THROW(generateRandomVector(&vector, 5));
}
TEST(SEQUENTIAL_OPE... | 29.056452 | 78 | 0.679989 | [
"vector"
] |
596d4f022f78fecab3a1d89c20dfdb46f172bc9d | 4,351 | cpp | C++ | test-chargingcurrent-range.cpp | clean-code-craft-tcq-2/tdd-buckets-Vedashree-Dayananda | a8c08f403e5a421e66d6d85834f139f2a3c1349b | [
"MIT"
] | null | null | null | test-chargingcurrent-range.cpp | clean-code-craft-tcq-2/tdd-buckets-Vedashree-Dayananda | a8c08f403e5a421e66d6d85834f139f2a3c1349b | [
"MIT"
] | null | null | null | test-chargingcurrent-range.cpp | clean-code-craft-tcq-2/tdd-buckets-Vedashree-Dayananda | a8c08f403e5a421e66d6d85834f139f2a3c1349b | [
"MIT"
] | null | null | null | #define CATCH_CONFIG_MAIN // This tells Catch to provide a main() - only do this in one cpp file
#include "test/catch.hpp"
#include "chargingcurrent-range.h"
TEST_CASE("detect the ranges in the given input list with 2 elements") {
std::vector<Range> listofRanges1 = {};
std::vector<double> inputList1 = { 4, 5 };
l... | 43.51 | 189 | 0.730177 | [
"vector"
] |
596f63286c443297a93663ea932d5931a79deb63 | 2,072 | cc | C++ | src/type.cc | neeilan/neeilang | 1c7776bfd7d895f3f203adde5c2606096f12cc46 | [
"MIT"
] | 50 | 2019-10-15T23:14:06.000Z | 2022-02-03T20:59:50.000Z | src/type.cc | neeilan/neeilang | 1c7776bfd7d895f3f203adde5c2606096f12cc46 | [
"MIT"
] | null | null | null | src/type.cc | neeilan/neeilang | 1c7776bfd7d895f3f203adde5c2606096f12cc46 | [
"MIT"
] | 4 | 2020-01-22T20:14:00.000Z | 2020-03-25T08:36:14.000Z | #include "type.h"
struct FuncType;
bool Type::has_field(const std::string &name) {
if (supertype && supertype->has_field(name)) {
return true;
}
for (auto field : fields) {
if (field.name == name) {
return true;
}
}
return false;
}
Field Type::get_field(const std::string &name) {
if (... | 20.116505 | 69 | 0.609073 | [
"vector"
] |
5977c67625b314bb91516e34bd92f49af3fabe65 | 5,346 | hpp | C++ | include/blmc_controllers/impedance_controller.hpp | jviereck/blmc_controllers | f7f6f83874151c6e8cc33cb7c30bec5893a2e9d0 | [
"BSD-3-Clause"
] | 1 | 2020-12-17T17:51:52.000Z | 2020-12-17T17:51:52.000Z | include/blmc_controllers/impedance_controller.hpp | jviereck/blmc_controllers | f7f6f83874151c6e8cc33cb7c30bec5893a2e9d0 | [
"BSD-3-Clause"
] | 1 | 2020-12-17T11:08:11.000Z | 2021-01-11T16:47:45.000Z | include/blmc_controllers/impedance_controller.hpp | jviereck/blmc_controllers | f7f6f83874151c6e8cc33cb7c30bec5893a2e9d0 | [
"BSD-3-Clause"
] | 1 | 2020-12-17T11:04:40.000Z | 2020-12-17T11:04:40.000Z | /**
* @file
* @license BSD 3-clause
* @copyright Copyright (c) 2020, New York University and Max Planck
* Gesellschaft
*
* @brief This is the implementation for impedance controller between any two
* frames of the robot.
*
*/
#pragma once
#include "pinocchio/multibody/data.hpp"
#include "pinocchio/multibody/... | 34.269231 | 80 | 0.65376 | [
"object",
"vector",
"model"
] |
59830d9520547d9c5dec2dba622c7f8b058ae175 | 3,153 | cpp | C++ | test/src/TotpTests.cpp | rhymu8354/Hash | 35e0ec07343d81dd1ae4e13be168b60b2ad50101 | [
"MIT"
] | null | null | null | test/src/TotpTests.cpp | rhymu8354/Hash | 35e0ec07343d81dd1ae4e13be168b60b2ad50101 | [
"MIT"
] | null | null | null | test/src/TotpTests.cpp | rhymu8354/Hash | 35e0ec07343d81dd1ae4e13be168b60b2ad50101 | [
"MIT"
] | null | null | null | /**
* @file TotpTests.cpp
*
* This module contains the unit tests of the Totp functions.
*
* © 2018 by Richard Walters
*/
#include <gtest/gtest.h>
#include <Hash/Sha1.hpp>
#include <Hash/Sha2.hpp>
#include <Hash/Templates.hpp>
#include <Hash/Totp.hpp>
#include <stddef.h>
#include <stdint.h>
#include <string>
#in... | 47.059701 | 139 | 0.697114 | [
"vector"
] |
59935e90e1b93e4a979bd002d6df612b358c0186 | 1,600 | cpp | C++ | src/parsers/ApacheParser.cpp | daladim/access-log-monitor | 497751cd8ca99b0520c565579c6a53f4cf561c02 | [
"MIT"
] | null | null | null | src/parsers/ApacheParser.cpp | daladim/access-log-monitor | 497751cd8ca99b0520c565579c6a53f4cf561c02 | [
"MIT"
] | null | null | null | src/parsers/ApacheParser.cpp | daladim/access-log-monitor | 497751cd8ca99b0520c565579c6a53f4cf561c02 | [
"MIT"
] | null | null | null | #include "ApacheParser.hpp"
#include <string>
using namespace std;
namespace LogSupervisor::LogParser{
Apache::Apache(const string& filePath) :
logFile(filePath)
{
if(logFile.fail()){
throw runtime_error(string("Unable to open file ") + filePath + ": " + strerror(errno));
}
}
std::string Apache:... | 24.615385 | 96 | 0.629375 | [
"vector"
] |
599c1681cab38fa69aa744e4fec1fffbffdf367f | 1,404 | cpp | C++ | src/linear_interpolate_1.cpp | eodus/LinearInterpolator | 4a488e40861233f53c7c981a9b47782e28f18701 | [
"MIT"
] | null | null | null | src/linear_interpolate_1.cpp | eodus/LinearInterpolator | 4a488e40861233f53c7c981a9b47782e28f18701 | [
"MIT"
] | null | null | null | src/linear_interpolate_1.cpp | eodus/LinearInterpolator | 4a488e40861233f53c7c981a9b47782e28f18701 | [
"MIT"
] | null | null | null | #include "linear_interpolate_1.hpp"
#include <algorithm>
#include <vector>
struct Vertex {
double x, value;
bool operator<(const Vertex &b) const {
return x < b.x;
}
};
class LinearInterpolator_1 {
public:
LinearInterpolator_1(const double *points,
const double *values,
... | 24.206897 | 88 | 0.593305 | [
"vector"
] |
599ee6bde32717954e4e1abd4c9203ba13dbf44d | 2,389 | cpp | C++ | BAC_2nd/ch9/UVa1627.cpp | Anyrainel/aoapc-code | e787a01380698fb9236d933462052f97b20e6132 | [
"Apache-2.0"
] | 3 | 2017-08-15T06:00:01.000Z | 2018-12-10T09:05:53.000Z | BAC_2nd/ch9/UVa1627.cpp | Anyrainel/aoapc-related-code | e787a01380698fb9236d933462052f97b20e6132 | [
"Apache-2.0"
] | null | null | null | BAC_2nd/ch9/UVa1627.cpp | Anyrainel/aoapc-related-code | e787a01380698fb9236d933462052f97b20e6132 | [
"Apache-2.0"
] | 2 | 2017-09-16T18:46:27.000Z | 2018-05-22T05:42:03.000Z | // UVa1627 Team them up!
// Rujia Liu
#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 100 + 5;
int n, G[maxn][maxn], color[maxn], diff[maxn], cc;
vector<int> team[maxn][2]; // team[cc][c] is the list of people in connected-component cc, ... | 24.377551 | 98 | 0.508581 | [
"vector"
] |
59a12229adaf4b7b4c495563e8ab314f38875af7 | 580 | cpp | C++ | Sparky-core/src/sp/graphics/TextureManager.cpp | LifeOrGame/Sparky | 2ebcba2613b47011a224ddce5bc9267b46ba0119 | [
"Apache-2.0"
] | 1,303 | 2015-02-15T05:12:55.000Z | 2022-03-18T18:23:28.000Z | Sparky-core/src/sp/graphics/TextureManager.cpp | WildFire212/Sparky | a679d0834e37eb3570dff18b01550210734cb97e | [
"Apache-2.0"
] | 124 | 2015-04-02T14:15:05.000Z | 2021-05-05T12:47:16.000Z | Sparky-core/src/sp/graphics/TextureManager.cpp | WildFire212/Sparky | a679d0834e37eb3570dff18b01550210734cb97e | [
"Apache-2.0"
] | 538 | 2015-02-19T21:53:15.000Z | 2022-03-11T06:18:05.000Z | #include "sp/sp.h"
#include "sp/Common.h"
#include "TextureManager.h"
namespace sp { namespace graphics {
std::vector<API::Texture*> TextureManager::m_Textures;
API::Texture* TextureManager::Add(API::Texture* texture)
{
m_Textures.push_back(texture);
return texture;
}
API::Texture* TextureManager::Get(con... | 18.125 | 57 | 0.667241 | [
"vector"
] |
59a2b8605c4ea15d6573222f1136d901b4813402 | 2,414 | cpp | C++ | codeforces/815d.cpp | sogapalag/problems | 0ea7d65448e1177f8b3f81124a82d187980d659c | [
"MIT"
] | 1 | 2020-04-04T14:56:12.000Z | 2020-04-04T14:56:12.000Z | codeforces/815d.cpp | sogapalag/problems | 0ea7d65448e1177f8b3f81124a82d187980d659c | [
"MIT"
] | null | null | null | codeforces/815d.cpp | sogapalag/problems | 0ea7d65448e1177f8b3f81124a82d187980d659c | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
// when range [l, r), has property P~notP, want last P.
// when return l-1, means not found.
template <typename T>
T bs_last(T l, T r, function<bool (T)> f) {
assert(l < r);
T mid;
while (l != r) {
mid = l + (r-l)/2;
if (f(mi... | 30.948718 | 107 | 0.478873 | [
"vector"
] |
59ad6c2201658c8af5ca81f98aa617e1d87c96a2 | 8,225 | cpp | C++ | karp.cpp | nuno-cameira/Edmonds-Karp-Algorithm | 8d79b149ec92a80644b8d92a49798f5b37951de4 | [
"MIT"
] | null | null | null | karp.cpp | nuno-cameira/Edmonds-Karp-Algorithm | 8d79b149ec92a80644b8d92a49798f5b37951de4 | [
"MIT"
] | null | null | null | karp.cpp | nuno-cameira/Edmonds-Karp-Algorithm | 8d79b149ec92a80644b8d92a49798f5b37951de4 | [
"MIT"
] | null | null | null | //============================================================================
// Instituto Superior Tecnico
// Analise e Sintese de Algoritmos
// 2 Projecto
//
// Date: : Abril, 2014
// Author : Nuno Cameira, 69769
// Author : Vasco Loureiro, 70993
// Version : 1.0.7.0
// Description :
//============... | 21.25323 | 78 | 0.632948 | [
"vector"
] |
59bc55ad87894c8616215b741c21d25abb4bda0a | 666 | hpp | C++ | detection/include/interfaces/IDetectionDataHandler.hpp | JMassing/Pokerbot | 40b2e4756fc8ef1be4af4d649deb6035a9774bdc | [
"MIT"
] | 1 | 2021-12-10T06:27:47.000Z | 2021-12-10T06:27:47.000Z | detection/include/interfaces/IDetectionDataHandler.hpp | JMassing/Pokerbot | 40b2e4756fc8ef1be4af4d649deb6035a9774bdc | [
"MIT"
] | null | null | null | detection/include/interfaces/IDetectionDataHandler.hpp | JMassing/Pokerbot | 40b2e4756fc8ef1be4af4d649deb6035a9774bdc | [
"MIT"
] | null | null | null | #pragma once
#include <vector>
#include "Card.hpp"
#include "ImProcSettings.hpp"
#include "Image.hpp"
namespace detect
{
/** *\ingroup shared
* @class IDetectionDataHandler
* @author Julian Massing (julimassing@gmail.com)
* @brief Interface for sending/receiving data from/to detection module
*
* @versio... | 20.8125 | 72 | 0.695195 | [
"vector"
] |
59bf3427e1ddd7d769647e4db6ecd90a9746869d | 5,294 | cpp | C++ | BinaryTree/print_k_path.cpp | krayong/DS---Algo | 5105dab434fa59580b4068e64468a4a37245d763 | [
"Apache-2.0"
] | 2 | 2021-01-30T08:50:12.000Z | 2021-05-30T19:56:53.000Z | BinaryTree/print_k_path.cpp | krayong/Data-Structures-and-Algorithms | 5105dab434fa59580b4068e64468a4a37245d763 | [
"Apache-2.0"
] | null | null | null | BinaryTree/print_k_path.cpp | krayong/Data-Structures-and-Algorithms | 5105dab434fa59580b4068e64468a4a37245d763 | [
"Apache-2.0"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
/*************************************************************************************************************
*
* Link : https://www.geeksforgeeks.org/print-k-sum-paths-binary-tree/
* Description:
A binary tree and a nu... | 22.432203 | 110 | 0.475066 | [
"vector"
] |
59c02b31591973355634edc573c67418d74e9a8c | 1,258 | cc | C++ | day25/seabed.cc | HappyCerberus/moderncpp-aoc-2021 | 0973201f2e1c2c6c2900162e3829a68477818ced | [
"MIT"
] | 20 | 2021-12-04T04:53:22.000Z | 2022-02-24T23:37:31.000Z | day25/seabed.cc | HappyCerberus/moderncpp-aoc-2021 | 0973201f2e1c2c6c2900162e3829a68477818ced | [
"MIT"
] | null | null | null | day25/seabed.cc | HappyCerberus/moderncpp-aoc-2021 | 0973201f2e1c2c6c2900162e3829a68477818ced | [
"MIT"
] | 1 | 2022-01-04T22:12:05.000Z | 2022-01-04T22:12:05.000Z | #include "seabed.h"
#include <algorithm>
#include <istream>
#include <string>
SeaBed parse_seabed(std::istream &s) {
SeaBed result;
std::string line;
while (getline(s, line)) {
result.push_back(std::vector<char>(line.begin(), line.end()));
}
return result;
}
std::pair<SeaBed, size_t> tick(const SeaBed ... | 26.208333 | 84 | 0.518283 | [
"vector"
] |
59c2dbd721002e4efaaa4308ed144bbda123837e | 1,921 | cpp | C++ | src/mlpack/tests/main_tests/adaboost_classify_test.cpp | ahmedr2001/mlpack | 127d7e76a61ef0e282db8eae644c4337fd54307a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | src/mlpack/tests/main_tests/adaboost_classify_test.cpp | ahmedr2001/mlpack | 127d7e76a61ef0e282db8eae644c4337fd54307a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | src/mlpack/tests/main_tests/adaboost_classify_test.cpp | ahmedr2001/mlpack | 127d7e76a61ef0e282db8eae644c4337fd54307a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | /**
* @file tests/main_tests/adaboost_classify_test.cpp
* @author Nippun Sharma
*
* Test RUN_BINDING() of adaboost_predict_main.cpp.
*
* mlpack is free software; you may redistribute it and/or modify it under the
* terms of the 3-clause BSD license. You should have received a copy of the
* 3-clause BSD license... | 30.983871 | 78 | 0.715773 | [
"model"
] |
59c6c40aab3b8915b635e316923d239c32b5d529 | 9,489 | cpp | C++ | src/particle_filter.cpp | Jequirity0504/CarND-Kidnapped-Vehicle-Project | dd2b62ddea22a24bd4fed176c56e4fc46f50b908 | [
"MIT"
] | null | null | null | src/particle_filter.cpp | Jequirity0504/CarND-Kidnapped-Vehicle-Project | dd2b62ddea22a24bd4fed176c56e4fc46f50b908 | [
"MIT"
] | null | null | null | src/particle_filter.cpp | Jequirity0504/CarND-Kidnapped-Vehicle-Project | dd2b62ddea22a24bd4fed176c56e4fc46f50b908 | [
"MIT"
] | null | null | null | /**
* particle_filter.cpp
*
* Created on: Dec 12, 2016
* Author: Tiffany Huang
*/
#include "particle_filter.h"
#include <math.h>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <random>
#include <string>
#include <vector>
#include "helper_functions.h"
using std::string;... | 38.108434 | 183 | 0.638213 | [
"vector",
"transform"
] |
59ce7582affc0c385144e1876e33276010513940 | 4,282 | hpp | C++ | contracts/eden/include/distributions.hpp | guilledk/Eden | 251d1b10d6ec1a9a8e1ec4c461ffac16fe425a32 | [
"MIT"
] | 35 | 2021-04-02T02:17:39.000Z | 2021-11-23T17:46:50.000Z | contracts/eden/include/distributions.hpp | guilledk/Eden | 251d1b10d6ec1a9a8e1ec4c461ffac16fe425a32 | [
"MIT"
] | 323 | 2021-04-07T15:07:39.000Z | 2022-01-25T01:11:38.000Z | contracts/eden/include/distributions.hpp | guilledk/Eden | 251d1b10d6ec1a9a8e1ec4c461ffac16fe425a32 | [
"MIT"
] | 8 | 2021-05-10T01:19:47.000Z | 2022-01-24T23:05:00.000Z | #pragma once
#include <eosio/asset.hpp>
#include <eosio/multi_index.hpp>
#include <eosio/name.hpp>
#include <eosio/time.hpp>
#include <utils.hpp>
#include <variant>
#include <vector>
namespace eden
{
struct member;
inline uint128_t distribution_account_key(eosio::name owner,
... | 32.439394 | 100 | 0.686362 | [
"vector"
] |
59d7454700c66392fa71b00b19704f436ff9af0b | 1,107 | hpp | C++ | src/ocr/Feature_Loader.hpp | bitwizeshift/Numeric-OCR | 2f2c51bb169ea5614789a4e961392946177a4357 | [
"MIT"
] | 1 | 2018-12-25T07:58:39.000Z | 2018-12-25T07:58:39.000Z | src/ocr/Feature_Loader.hpp | bitwizeshift/Numeric-Digit-OCR | 2f2c51bb169ea5614789a4e961392946177a4357 | [
"MIT"
] | null | null | null | src/ocr/Feature_Loader.hpp | bitwizeshift/Numeric-Digit-OCR | 2f2c51bb169ea5614789a4e961392946177a4357 | [
"MIT"
] | 1 | 2021-02-14T20:25:44.000Z | 2021-02-14T20:25:44.000Z | /**
* @file Feature_Loader.hpp
*
* @todo Add description
*
* @author Matthew Rodusek (matthew.rodusek@gmail.com)
* @date Nov 16, 2015
*
*/
/*
* Change Log:
*
* Nov 16, 2015:
* - Feature_Loader.hpp created
*/
#ifndef OCR_FEATURE_LOADER_HPP_
#define OCR_FEATURE_LOADER_HPP_
#if defined(_MSC_VER) && (_MSC... | 19.421053 | 66 | 0.626016 | [
"vector"
] |
59e6d7239a63eae4e7be810493f68d6e6e173a08 | 4,939 | cpp | C++ | src/renderer/main.cpp | kamilsan/ogl-renderer | c74f5c25276b8ae185e1f9cd8cc8d0497ef31521 | [
"MIT"
] | null | null | null | src/renderer/main.cpp | kamilsan/ogl-renderer | c74f5c25276b8ae185e1f9cd8cc8d0497ef31521 | [
"MIT"
] | null | null | null | src/renderer/main.cpp | kamilsan/ogl-renderer | c74f5c25276b8ae185e1f9cd8cc8d0497ef31521 | [
"MIT"
] | null | null | null | #include <glad/glad.h>
#include <GLFW/glfw3.h>
#include <iostream>
#include <cmath>
#include "window.hpp"
#include "shaderProgram.hpp"
#include "mesh.hpp"
#include "matrix.hpp"
#include "vertex.hpp"
#include "camera.hpp"
#include "texture.hpp"
const unsigned int WINDOW_WIDTH = 800;
const unsigned int WINDOW_HEIGHT =... | 32.071429 | 90 | 0.562462 | [
"mesh"
] |
59ed381fbaab65fff341f562f2c39c381fffc84f | 51,650 | cpp | C++ | xiablo/Plugins/SketchFabPlugin/Source/GLTFExporter/Private/Tasks/GLTFMaterialTasks.cpp | jing-interactive/ucd | 8fc8722291f086a0c0037a94d11c14562375e862 | [
"MIT"
] | 1 | 2022-02-02T23:36:07.000Z | 2022-02-02T23:36:07.000Z | xiablo/Plugins/SketchFabPlugin/Source/GLTFExporter/Private/Tasks/GLTFMaterialTasks.cpp | jing-interactive/ucd | 8fc8722291f086a0c0037a94d11c14562375e862 | [
"MIT"
] | null | null | null | xiablo/Plugins/SketchFabPlugin/Source/GLTFExporter/Private/Tasks/GLTFMaterialTasks.cpp | jing-interactive/ucd | 8fc8722291f086a0c0037a94d11c14562375e862 | [
"MIT"
] | null | null | null | // Copyright Epic Games, Inc. All Rights Reserved.
#include "Tasks/SKGLTFMaterialTasks.h"
#include "Converters/SKGLTFConverterUtility.h"
#include "Converters/SKGLTFNameUtility.h"
#include "Converters/SKGLTFMaterialUtility.h"
#include "Builders/SKGLTFContainerBuilder.h"
#include "MaterialPropertyEx.h"
#include ... | 37.185025 | 221 | 0.764627 | [
"mesh",
"object",
"vector",
"model",
"transform"
] |
59f8f82faaa9f9f160b58dbc1ec728c05e46f08d | 10,538 | cpp | C++ | src/phg/utils/point_cloud_export.cpp | kpilyugin/PhotogrammetryTasks2021 | 7da69f04909075340a220a7021efeeb42283d9dc | [
"MIT"
] | null | null | null | src/phg/utils/point_cloud_export.cpp | kpilyugin/PhotogrammetryTasks2021 | 7da69f04909075340a220a7021efeeb42283d9dc | [
"MIT"
] | null | null | null | src/phg/utils/point_cloud_export.cpp | kpilyugin/PhotogrammetryTasks2021 | 7da69f04909075340a220a7021efeeb42283d9dc | [
"MIT"
] | null | null | null | //
// DataExporter.cpp
//
// Created by Cedric Leblond Menard on 16-06-27.
// Copyright © 2016 Cedric Leblond Menard. All rights reserved.
//
#include "point_cloud_export.h"
#include <stdio.h>
#include <string>
#include "opencv2/core/core.hpp"
#include <fstream>
#include <iomanip>
#include <iostream>
#include <algo... | 41.81746 | 198 | 0.484532 | [
"vector"
] |
59f99100cd9f1197ab1fcf862dbba559223f4ff8 | 1,203 | cpp | C++ | src/ComponentFactory.cpp | Df458/DFEngine | 67aea5e2fa14ccd446162fead1dd07f71b38c759 | [
"Zlib"
] | null | null | null | src/ComponentFactory.cpp | Df458/DFEngine | 67aea5e2fa14ccd446162fead1dd07f71b38c759 | [
"Zlib"
] | null | null | null | src/ComponentFactory.cpp | Df458/DFEngine | 67aea5e2fa14ccd446162fead1dd07f71b38c759 | [
"Zlib"
] | null | null | null | #include "Component.h"
#include "ComponentFactory.h"
#include "Util.h"
#include <algorithm>
using namespace rapidxml;
IComponent* ComponentFactory::buildComponent(xml_node<>* node, Actor* actor) const {
if(!node) {
error("Trying to create a component from null data.");
return NULL;
}
std... | 28.642857 | 101 | 0.64921 | [
"transform"
] |
9402fc7da9c94254c601eab937a36f9a7961b79d | 680 | hpp | C++ | output/FileOutputHandler.hpp | CaDS-Studentprojects/PixelGames | a1d7b57bdd9699fc36a64f8a86b92fbd61a3c3df | [
"MIT"
] | null | null | null | output/FileOutputHandler.hpp | CaDS-Studentprojects/PixelGames | a1d7b57bdd9699fc36a64f8a86b92fbd61a3c3df | [
"MIT"
] | null | null | null | output/FileOutputHandler.hpp | CaDS-Studentprojects/PixelGames | a1d7b57bdd9699fc36a64f8a86b92fbd61a3c3df | [
"MIT"
] | null | null | null | /*
* FileOutputHandler.hpp
*
* Created on: Mar 7, 2018
* Author: daniel
*/
#ifndef FILEOUTPUTHANDLER_HPP_
#define FILEOUTPUTHANDLER_HPP_
#include <string>
#include <fstream>
#include "IOutputHandler.hpp"
using namespace std;
namespace pixelgames {
namespace output {
class FileOutputHandler: public IOutp... | 18.888889 | 70 | 0.720588 | [
"vector"
] |
940a4265937a21346e41bc2948cd7b537f5d8c4f | 1,203 | cpp | C++ | utility/object.cpp | DFrye333/BD3GE | 39a02f10273154f66238b4ea6a08845081f03f94 | [
"MIT"
] | null | null | null | utility/object.cpp | DFrye333/BD3GE | 39a02f10273154f66238b4ea6a08845081f03f94 | [
"MIT"
] | null | null | null | utility/object.cpp | DFrye333/BD3GE | 39a02f10273154f66238b4ea6a08845081f03f94 | [
"MIT"
] | null | null | null | #include "object.h"
namespace BD3GE {
Object::Object() : renderable(nullptr), ogg(nullptr) {}
Object::Object(const Vector3 position, const Vector3 velocity) : Object(position, velocity, nullptr) {}
Object::Object(const Vector3 position, const Vector3 velocity, Renderable* renderable) : velocity(velocity), rendera... | 26.152174 | 148 | 0.720698 | [
"render",
"object",
"transform"
] |
940d0f76855cbee198db4de61e72373c5739c5e5 | 55,251 | cpp | C++ | coh2_rgt_extractor/Rainman_src/CDoWModule.cpp | tranek/coh2_rgt_extractor | dba2db9a06d3f31fb815ca865181d8f631306522 | [
"MIT"
] | 1 | 2016-09-24T14:57:56.000Z | 2016-09-24T14:57:56.000Z | coh2_rgt_extractor/Rainman_src/CDoWModule.cpp | tranek/coh2_rgt_extractor | dba2db9a06d3f31fb815ca865181d8f631306522 | [
"MIT"
] | null | null | null | coh2_rgt_extractor/Rainman_src/CDoWModule.cpp | tranek/coh2_rgt_extractor | dba2db9a06d3f31fb815ca865181d8f631306522 | [
"MIT"
] | null | null | null | /*
Rainman Library
Copyright (C) 2006 Corsix <corsix@gmail.com>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This ... | 26.160511 | 236 | 0.671445 | [
"object",
"vector",
"model"
] |
941ea4d8a4b4dd8f03fed0edd233fd4abd51aadc | 988 | cpp | C++ | AtCoder/arc014/b/main.cpp | H-Tatsuhiro/Com_Pro-Cpp | fd79f7821a76b11f4a6f83bbb26a034db577a877 | [
"MIT"
] | null | null | null | AtCoder/arc014/b/main.cpp | H-Tatsuhiro/Com_Pro-Cpp | fd79f7821a76b11f4a6f83bbb26a034db577a877 | [
"MIT"
] | 1 | 2021-10-19T08:47:23.000Z | 2022-03-07T05:23:56.000Z | AtCoder/arc014/b/main.cpp | H-Tatsuhiro/Com_Pro-Cpp | fd79f7821a76b11f4a6f83bbb26a034db577a877 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
using namespace std;
int main() {
int n; cin >> n;
unordered_map<string, bool> Map;
char c = '-';
for (int i = 0; i < n; i++) {
string s; cin >> s;
if (c == '-') c = s[0];
if (i %... | 23.52381 | 39 | 0.347166 | [
"vector"
] |
94248c522fafd69f516ed63180b02cf3d61d50ed | 2,858 | cpp | C++ | Progression/Progression.cpp | kravitz/transims4 | ea0848bf3dc71440d54724bb3ecba3947b982215 | [
"NASA-1.3"
] | 2 | 2018-04-27T11:07:02.000Z | 2020-04-24T06:53:21.000Z | Progression/Progression.cpp | idkravitz/transims4 | ea0848bf3dc71440d54724bb3ecba3947b982215 | [
"NASA-1.3"
] | null | null | null | Progression/Progression.cpp | idkravitz/transims4 | ea0848bf3dc71440d54724bb3ecba3947b982215 | [
"NASA-1.3"
] | null | null | null | //*********************************************************
// Progression.cpp - Signal Progression Utility
//*********************************************************
#include "Progression.hpp"
char * Progression::LINK_EQUIVALENCE_FILE = "LINK_EQUIVALENCE_FILE";
char * Progression::CLEAR_EXISTING_OFFSETS = "CLEAR_... | 30.404255 | 88 | 0.641358 | [
"shape"
] |
942a7305b5f8c157c2f73cb1519a161cfcfe2c8e | 658 | cpp | C++ | game/src/ballistic.cpp | Maddy1107/Speed_Racer | 8012f8a087d471ff574ebb462e80fec2de0fd639 | [
"MIT"
] | null | null | null | game/src/ballistic.cpp | Maddy1107/Speed_Racer | 8012f8a087d471ff574ebb462e80fec2de0fd639 | [
"MIT"
] | null | null | null | game/src/ballistic.cpp | Maddy1107/Speed_Racer | 8012f8a087d471ff574ebb462e80fec2de0fd639 | [
"MIT"
] | null | null | null | #include "pch.h"
#include "Ballistic.h"
ballistic::ballistic()
{}
ballistic::~ballistic()
{}
void ballistic::initialise(engine::ref<engine::game_object> object)
{
m_object = object;
}
void ballistic::fire(engine::ref<engine::game_object> object, float speed)
{
m_object->set_position(object->position());
m_object... | 21.225806 | 98 | 0.729483 | [
"object"
] |
942c6781e9c7cb3b91120925b43b1c17a9493ddb | 1,692 | cpp | C++ | Code/Framework/AzFramework/AzFramework/Logging/MissingAssetLogger.cpp | cypherdotXd/o3de | bb90c4ddfe2d495e9c00ebf1e2650c6d603a5676 | [
"Apache-2.0",
"MIT"
] | 11 | 2021-07-08T09:58:26.000Z | 2022-03-17T17:59:26.000Z | Code/Framework/AzFramework/AzFramework/Logging/MissingAssetLogger.cpp | RoddieKieley/o3de | e804fd2a4241b039a42d9fa54eaae17dc94a7a92 | [
"Apache-2.0",
"MIT"
] | 29 | 2021-07-06T19:33:52.000Z | 2022-03-22T10:27:49.000Z | Code/Framework/AzFramework/AzFramework/Logging/MissingAssetLogger.cpp | RoddieKieley/o3de | e804fd2a4241b039a42d9fa54eaae17dc94a7a92 | [
"Apache-2.0",
"MIT"
] | 4 | 2021-07-06T19:24:43.000Z | 2022-03-31T12:42:27.000Z | /*
* Copyright (c) Contributors to the Open 3D Engine Project.
* For complete copyright and license terms please see the LICENSE at the root of this distribution.
*
* SPDX-License-Identifier: Apache-2.0 OR MIT
*
*/
#include <AzFramework/Logging/MissingAssetLogger.h>
#include <AzCore/std/string/string.h>
#include... | 29.684211 | 136 | 0.631206 | [
"3d"
] |
94437060cd43ec12b64e420340d303449c25ff05 | 5,122 | cpp | C++ | src/filters/connect.cpp | zengyuxing007/pipy | c60e08560b08728fa181940a4b9d67807a0ee625 | [
"BSL-1.0"
] | null | null | null | src/filters/connect.cpp | zengyuxing007/pipy | c60e08560b08728fa181940a4b9d67807a0ee625 | [
"BSL-1.0"
] | null | null | null | src/filters/connect.cpp | zengyuxing007/pipy | c60e08560b08728fa181940a4b9d67807a0ee625 | [
"BSL-1.0"
] | null | null | null | /*
* Copyright (c) 2019 by flomesh.io
*
* Unless prior written consent has been obtained from the copyright
* owner, the following shall not be allowed.
*
* 1. The distribution of any source codes, header files, make files,
* or libraries of the software.
*
* 2. Disclosure of any source codes pertaini... | 28.455556 | 111 | 0.630418 | [
"object"
] |
9444a6841f9bd66caf56ded1c3d5a3dc1b60d4d4 | 729 | cpp | C++ | Shape/Shape.cpp | AKoudounis/refactored-journey | 81719c57104f14b141f0f7cd2aa805f9007ed79e | [
"MIT"
] | null | null | null | Shape/Shape.cpp | AKoudounis/refactored-journey | 81719c57104f14b141f0f7cd2aa805f9007ed79e | [
"MIT"
] | null | null | null | Shape/Shape.cpp | AKoudounis/refactored-journey | 81719c57104f14b141f0f7cd2aa805f9007ed79e | [
"MIT"
] | null | null | null | //Andreas Koudounis 40089191
#include "Shape.h"
#include <iomanip>
//Default Constructor
Shape::Shape()
{
}
//Default Constructor
Shape::~Shape()
{
std::cout << "Shape object deleted";
}
void Shape::print() const
{
}
void Shape::outputLine(const char* const object, const char* const Field1, const ... | 18.225 | 154 | 0.584362 | [
"object",
"shape"
] |
9449cc1e4242c84e767ba2ddb31af37a4d6e8d9f | 2,391 | cpp | C++ | Chapter_8_Advanced_Topics/8.6_NP_Hard_or_Complete_Problems/kattis_europeantrip.cpp | BrandonTang89/CP4_Code | 5114471f439978dd11f6f2cbf6af20ca654593da | [
"MIT"
] | 2 | 2021-12-29T04:12:59.000Z | 2022-03-30T09:32:19.000Z | Chapter_8_Advanced_Topics/8.6_NP_Hard_or_Complete_Problems/kattis_europeantrip.cpp | BrandonTang89/CP4_Code | 5114471f439978dd11f6f2cbf6af20ca654593da | [
"MIT"
] | null | null | null | Chapter_8_Advanced_Topics/8.6_NP_Hard_or_Complete_Problems/kattis_europeantrip.cpp | BrandonTang89/CP4_Code | 5114471f439978dd11f6f2cbf6af20ca654593da | [
"MIT"
] | 1 | 2022-03-01T06:12:46.000Z | 2022-03-01T06:12:46.000Z | /**Kattis - europeantrip
* This is the Euclidean Steiner Tree problem with 3 terminal and 1 internal vertex. We can try to find the fermat point
* with a lot of mathematics. But we can also use some very very very sketchy iterative optimization to find this...
*
* At first I did what CP4 hint suggested: 2 ternary ... | 35.686567 | 120 | 0.590548 | [
"vector"
] |
9453e616c603aa6cfc9d3531409649ef54db6302 | 4,868 | cpp | C++ | game.cpp | jasonhutchens/kranzky_ice | 8b1cf40f7948ac8811cdf49729d1df0acb7fc611 | [
"Unlicense"
] | 4 | 2016-06-05T04:36:12.000Z | 2016-08-21T20:11:49.000Z | game.cpp | kranzky/kranzky_ice | 8b1cf40f7948ac8811cdf49729d1df0acb7fc611 | [
"Unlicense"
] | null | null | null | game.cpp | kranzky/kranzky_ice | 8b1cf40f7948ac8811cdf49729d1df0acb7fc611 | [
"Unlicense"
] | null | null | null | //==============================================================================
#include <game.hpp>
#include <engine.hpp>
#include <entity.hpp>
#include <entity_manager.hpp>
#include <viewport.hpp>
#include <score.hpp>
#include <droplet.hpp>
#include <girder.hpp>
#include <hgeresource.h>
#include <algorithm>
#inclu... | 24.964103 | 96 | 0.400781 | [
"render",
"vector"
] |
94590a37a02976b0c687e8bdbe2f3db6eb5cce24 | 3,519 | cpp | C++ | Graph/CSES Problem Set [ Graph Algorithms ]/Investigation.cpp | Edith-3000/Algorithmic-Implementations | 7ff8cd615fd453a346b4e851606d47c26f05a084 | [
"MIT"
] | 8 | 2021-02-13T17:07:27.000Z | 2021-08-20T08:20:40.000Z | Graph/CSES Problem Set [ Graph Algorithms ]/Investigation.cpp | Edith-3000/Algorithmic-Implementations | 7ff8cd615fd453a346b4e851606d47c26f05a084 | [
"MIT"
] | null | null | null | Graph/CSES Problem Set [ Graph Algorithms ]/Investigation.cpp | Edith-3000/Algorithmic-Implementations | 7ff8cd615fd453a346b4e851606d47c26f05a084 | [
"MIT"
] | 5 | 2021-02-17T18:12:20.000Z | 2021-10-10T17:49:34.000Z | // Problem: Investigation
// Contest: CSES - CSES Problem Set
// URL: https://cses.fi/problemset/task/1202
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// Parsed on: 02-03-2021 12:42:28 IST (UTC+05:30)
// Author: Kapil Choudhary
// ********************************************************************
// कर्मण्येवाधिका... | 24.608392 | 81 | 0.56607 | [
"vector"
] |
94594f4de2f786dc872c37cf98e785369664f7d0 | 5,291 | cc | C++ | IR/src/FunctionOp.cc | avartak/DIMPLE | b117baa2880cdae4afdeecea733c301e54980ef6 | [
"MIT"
] | 3 | 2021-04-04T08:49:38.000Z | 2021-07-03T02:01:26.000Z | IR/src/FunctionOp.cc | avartak/DIMPLE | b117baa2880cdae4afdeecea733c301e54980ef6 | [
"MIT"
] | null | null | null | IR/src/FunctionOp.cc | avartak/DIMPLE | b117baa2880cdae4afdeecea733c301e54980ef6 | [
"MIT"
] | null | null | null | #include <FunctionOp.h>
#include <BinaryOp.h>
#include <FunctionType.h>
#include <PrimitiveType.h>
#include <Statement.h>
#include <CodeBlock.h>
#include <LST.h>
#include <Globals.h>
namespace avl {
std::shared_ptr<Value> FunctionOp::call(const std::shared_ptr<Function>& func, const std::vector<std::shared_ptr<Va... | 32.460123 | 173 | 0.483084 | [
"vector"
] |
945eddfa63b5925fd94f497a0bb8caa16f5f2b4c | 2,445 | hpp | C++ | source/audio/Recorder.hpp | RobertDamerius/CKeys | 3a861e033abee595472770e85acba47b17f37bf8 | [
"MIT"
] | 3 | 2020-08-13T18:43:40.000Z | 2020-08-14T08:58:56.000Z | source/audio/Recorder.hpp | RobertDamerius/CKeys | 3a861e033abee595472770e85acba47b17f37bf8 | [
"MIT"
] | null | null | null | source/audio/Recorder.hpp | RobertDamerius/CKeys | 3a861e033abee595472770e85acba47b17f37bf8 | [
"MIT"
] | null | null | null | #pragma once
#include <SequenceTrack.hpp>
class Recorder {
public:
SequenceTrack track; ///< Track data for visualization.
std::mutex mtxTrack; ///< Protect @ref track.
std::vector<std::pair<double, std::vector<unsigned char>>> rawRecordedData; ///< Raw MIDI data received during recordin... | 35.434783 | 165 | 0.549693 | [
"object",
"vector"
] |
9467591ea4a1800d0d660d7d5c825dfc081d7ba6 | 5,365 | hpp | C++ | attic/include/boost/afio/v2/detail/ErrorHandling.hpp | grassofsky/llfio | 8b27842c25c47fd49ab64209463fc23268270975 | [
"Apache-2.0"
] | 356 | 2018-07-09T23:00:22.000Z | 2022-03-27T11:41:35.000Z | attic/include/boost/afio/v2/detail/ErrorHandling.hpp | grassofsky/llfio | 8b27842c25c47fd49ab64209463fc23268270975 | [
"Apache-2.0"
] | 80 | 2018-07-22T13:05:36.000Z | 2022-01-12T11:34:57.000Z | attic/include/boost/afio/v2/detail/ErrorHandling.hpp | grassofsky/llfio | 8b27842c25c47fd49ab64209463fc23268270975 | [
"Apache-2.0"
] | 35 | 2018-11-08T20:44:11.000Z | 2022-02-27T16:03:01.000Z | /* NiallsCPP11Utilities
(C) 2012 Niall Douglas http://www.nedprod.com/
File Created: Nov 2012
Boost Software License - Version 1.0 - August 17th, 2003
Permission is hereby granted, free of charge, to any person or organization
obtaining a copy of the software and accompanying documentation covered by
this license (t... | 65.426829 | 265 | 0.7726 | [
"object"
] |
9468082318c7ba976e7f3102be414d38694df169 | 11,127 | cpp | C++ | local_task_planner/test/DrawingByTrajectorysTest_old.cpp | AlexeiOvcharov/kuka_kr6r900_simulation | 0d9125fe0cf56ca0a48aa1be2eb6ec72884bda4c | [
"Apache-2.0"
] | 10 | 2020-06-12T08:00:16.000Z | 2022-03-23T09:54:35.000Z | local_task_planner/test/DrawingByTrajectorysTest_old.cpp | airalab/kuka_kr6r900_simulation | 0d9125fe0cf56ca0a48aa1be2eb6ec72884bda4c | [
"Apache-2.0"
] | 7 | 2020-11-17T19:58:58.000Z | 2021-04-19T12:01:24.000Z | local_task_planner/test/DrawingByTrajectorysTest_old.cpp | airalab/kuka_kr6r900_simulation | 0d9125fe0cf56ca0a48aa1be2eb6ec72884bda4c | [
"Apache-2.0"
] | 2 | 2020-11-16T14:33:45.000Z | 2021-05-31T02:02:14.000Z | #include <ros/ros.h>
#include <ros/package.h>
#include <kuka_manipulation_moveit/KukaMoveit.hpp>
#include <kuka_cv/Color.h>
#include <kuka_cv/RequestPalette.h>
#include <kuka_cv/RequestCanvas.h>
#include <std_srvs/Empty.h>
#include <visualization_msgs/Marker.h>
#include <boost/thread/thread.hpp>
// TF
#include <tf2_r... | 34.880878 | 114 | 0.624427 | [
"vector",
"transform"
] |
9468ad2e45b5bd7b7f797ea00f5fff7ee723195c | 65,833 | cpp | C++ | src/srcnn.cpp | Cuda-Chen/SRCNN-cpp | 4e8d4ef3e41f48f20fbdbe60ead58cb805d19b84 | [
"MIT"
] | 4 | 2020-01-28T20:38:43.000Z | 2020-11-23T13:07:46.000Z | src/srcnn.cpp | Cuda-Chen/SRCNN-cpp | 4e8d4ef3e41f48f20fbdbe60ead58cb805d19b84 | [
"MIT"
] | 2 | 2020-01-29T14:25:45.000Z | 2020-07-03T02:02:43.000Z | src/srcnn.cpp | Cuda-Chen/SRCNN-cpp | 4e8d4ef3e41f48f20fbdbe60ead58cb805d19b84 | [
"MIT"
] | 1 | 2020-05-29T09:41:19.000Z | 2020-05-29T09:41:19.000Z | #include <iostream>
#include <iomanip>
#include <string>
#include <tuple>
#include <fstream>
#include <cassert>
#include <chrono>
#include "opencv2/opencv.hpp"
#include "srcnn.hpp"
#include "datatype.hpp"
#include "gaussian.hpp"
#ifdef __x86_64__
#include <immintrin.h>
#else
#include "sse2neon.h"
#endif
//#... | 33.571137 | 143 | 0.502423 | [
"vector"
] |
20dfae213bd2c0cddfa3a5d709a6a569de089fcb | 5,699 | cpp | C++ | mariadb/src/v20170312/model/DescribeDBSlowLogsResponse.cpp | sinjoywong/tencentcloud-sdk-cpp | 1b931d20956a90b15a6720f924e5c69f8786f9f4 | [
"Apache-2.0"
] | null | null | null | mariadb/src/v20170312/model/DescribeDBSlowLogsResponse.cpp | sinjoywong/tencentcloud-sdk-cpp | 1b931d20956a90b15a6720f924e5c69f8786f9f4 | [
"Apache-2.0"
] | null | null | null | mariadb/src/v20170312/model/DescribeDBSlowLogsResponse.cpp | sinjoywong/tencentcloud-sdk-cpp | 1b931d20956a90b15a6720f924e5c69f8786f9f4 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
... | 30.805405 | 132 | 0.670644 | [
"object",
"vector",
"model"
] |
20e813c4a1d0569a245db55b501aff1af4634e6e | 3,855 | cpp | C++ | eip/src/v2/model/ProfileResp.cpp | yangzhaofeng/huaweicloud-sdk-cpp-v3 | 4f3caac5ba9a9b75b4e5fd61683d1c4d57ec1c23 | [
"Apache-2.0"
] | 5 | 2021-03-03T08:23:43.000Z | 2022-02-16T02:16:39.000Z | eip/src/v2/model/ProfileResp.cpp | yangzhaofeng/huaweicloud-sdk-cpp-v3 | 4f3caac5ba9a9b75b4e5fd61683d1c4d57ec1c23 | [
"Apache-2.0"
] | null | null | null | eip/src/v2/model/ProfileResp.cpp | yangzhaofeng/huaweicloud-sdk-cpp-v3 | 4f3caac5ba9a9b75b4e5fd61683d1c4d57ec1c23 | [
"Apache-2.0"
] | 7 | 2021-02-26T13:53:35.000Z | 2022-03-18T02:36:43.000Z |
#include "huaweicloud/eip/v2/model/ProfileResp.h"
namespace HuaweiCloud {
namespace Sdk {
namespace Eip {
namespace V2 {
namespace Model {
ProfileResp::ProfileResp()
{
orderId_ = "";
orderIdIsSet_ = false;
productId_ = "";
productIdIsSet_ = false;
regionId_ = "";
regionIdIsSet_ = false;
... | 20.614973 | 101 | 0.639689 | [
"object",
"model"
] |
20e99a58997209cf08e3b9cce65535554aba7053 | 1,461 | cpp | C++ | test/src/test_infix_ostream_iterator.cpp | steinwurf/tables | fd6fa3a4dc7949621ca4e33ee8d3a63a08100d64 | [
"BSD-3-Clause"
] | 3 | 2017-12-09T20:49:43.000Z | 2020-06-27T23:25:04.000Z | test/src/test_infix_ostream_iterator.cpp | steinwurf/tables | fd6fa3a4dc7949621ca4e33ee8d3a63a08100d64 | [
"BSD-3-Clause"
] | 3 | 2015-04-11T01:26:23.000Z | 2015-05-26T19:01:23.000Z | test/src/test_infix_ostream_iterator.cpp | steinwurf/tables | fd6fa3a4dc7949621ca4e33ee8d3a63a08100d64 | [
"BSD-3-Clause"
] | 4 | 2015-05-06T06:16:51.000Z | 2020-05-13T01:22:58.000Z | // Copyright (c) 2014 Steinwurf ApS
// All Rights Reserved
//
// Distributed under the "BSD License". See the accompanying LICENSE.rst file.
#include <algorithm>
#include <cstdint>
#include <string>
#include <vector>
#include <gtest/gtest.h>
#include <tables/infix_ostream_iterator.hpp>
template <typename T>
void te... | 33.976744 | 78 | 0.616701 | [
"vector"
] |
20ebb4ec2336b8cfc81f7718337106529ee2d7c5 | 1,130 | cpp | C++ | 02_Programming_Fundamentals/06_Programming_Fundamentals_CPP/02_FunctionsArraysAndVectors/Exercise_2019/05_noiseTestGenerator.cpp | Knightwalker/Knowledgebase | 00c6dea5e52c0d2b0fe0dc3b7b5c298d445f0161 | [
"MIT"
] | 1 | 2019-07-21T13:00:31.000Z | 2019-07-21T13:00:31.000Z | C++/C++ Fundamentals Sept 2019/04. Exercise/codecpp/src/NoiseTestGenerator.cpp | galin-kostadinov/Software-Engineering | 55189648d787b35f1e9cd24cc4449c6beda51c90 | [
"MIT"
] | null | null | null | C++/C++ Fundamentals Sept 2019/04. Exercise/codecpp/src/NoiseTestGenerator.cpp | galin-kostadinov/Software-Engineering | 55189648d787b35f1e9cd24cc4449c6beda51c90 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include<cstdlib>
#include <ctime>
#include<cctype>
using namespace std;
char generateRandomSymbol() {
int randomNumber = rand();
char symbol = randomNumber % 255;
return symbol;
}
void print(const vector<char> &randomText) {
int size = (int) randomText.size();
... | 19.152542 | 48 | 0.50708 | [
"vector"
] |
20f24aac0d6bbc10491d418df7a04b102e5135d0 | 2,866 | cc | C++ | Sources/Hilbert/doubled_hilbert.cc | vigsterkr/netket | 1e187ae2b9d2aa3f2e53b09fe743e50763d04c9a | [
"Apache-2.0"
] | null | null | null | Sources/Hilbert/doubled_hilbert.cc | vigsterkr/netket | 1e187ae2b9d2aa3f2e53b09fe743e50763d04c9a | [
"Apache-2.0"
] | null | null | null | Sources/Hilbert/doubled_hilbert.cc | vigsterkr/netket | 1e187ae2b9d2aa3f2e53b09fe743e50763d04c9a | [
"Apache-2.0"
] | null | null | null | //
// Created by Filippo Vicentini on 12/11/2019.
//
#include "doubled_hilbert.hpp"
namespace netket {
DoubledHilbert::DoubledHilbert(
std::shared_ptr<const AbstractHilbert> hilbert,
std::unique_ptr<const AbstractGraph> doubled_graph)
: hilbert_physical_(std::move(hilbert)),
graph_doubled_(std::mov... | 28.949495 | 80 | 0.696441 | [
"vector"
] |
20f7e1efe480bdbb15f6b4aab3514a573bc8ca8c | 11,070 | cpp | C++ | moveit_ros/hybrid_planning/test/test_basic_integration.cpp | ruelj2/moveit2 | c5cc837597f85e01a262c66b7ef66e80c6746d5d | [
"BSD-3-Clause"
] | null | null | null | moveit_ros/hybrid_planning/test/test_basic_integration.cpp | ruelj2/moveit2 | c5cc837597f85e01a262c66b7ef66e80c6746d5d | [
"BSD-3-Clause"
] | 2 | 2022-01-11T13:47:07.000Z | 2022-03-31T10:44:25.000Z | moveit_ros/hybrid_planning/test/test_basic_integration.cpp | ruelj2/moveit2 | c5cc837597f85e01a262c66b7ef66e80c6746d5d | [
"BSD-3-Clause"
] | null | null | null | /*********************************************************************
* Software License Agreement (BSD License)
*
* Copyright (c) 2022, PickNik Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following condit... | 41.152416 | 120 | 0.710388 | [
"object",
"vector"
] |
20ff4ad9fee5343e95d3c11f4fac405608ca0b96 | 772 | hpp | C++ | video_file_hdl/include/video_file_hdl.hpp | majorx234/qt_videocam_hough | bb8c5ac8045a1d312e3428705967960496688846 | [
"BSD-2-Clause"
] | null | null | null | video_file_hdl/include/video_file_hdl.hpp | majorx234/qt_videocam_hough | bb8c5ac8045a1d312e3428705967960496688846 | [
"BSD-2-Clause"
] | null | null | null | video_file_hdl/include/video_file_hdl.hpp | majorx234/qt_videocam_hough | bb8c5ac8045a1d312e3428705967960496688846 | [
"BSD-2-Clause"
] | null | null | null | #ifndef VIDEO_FILE_HDL_HPP
#define VIDEO_FILE_HDL_HPP
#include "opencv2/highgui/highgui.hpp"
#include "opencv2/opencv.hpp"
class VideoFile_hdl{
int imagecount;
std::vector<cv::Mat>::iterator frame_iter;
cv::Size videoSize;
//std::string path;
std::vector<cv::Mat> video_vec;
bool videoLoadedBool;
public:... | 20.864865 | 53 | 0.722798 | [
"vector"
] |
1f0266b1448065183639fb6d7a5b909087af6b39 | 57,343 | cpp | C++ | mediaMicroservices/gen-cpp/MovieInfoService.cpp | rodrigo-bruno/DeathStarBench | c9ce09aaf7c1298a7c88efacd1010a71db0fa59d | [
"Apache-2.0"
] | 364 | 2019-04-28T01:45:37.000Z | 2022-03-31T15:08:03.000Z | mediaMicroservices/gen-cpp/MovieInfoService.cpp | rodrigo-bruno/DeathStarBench | c9ce09aaf7c1298a7c88efacd1010a71db0fa59d | [
"Apache-2.0"
] | 111 | 2019-04-15T11:08:49.000Z | 2022-03-31T17:39:16.000Z | mediaMicroservices/gen-cpp/MovieInfoService.cpp | rodrigo-bruno/DeathStarBench | c9ce09aaf7c1298a7c88efacd1010a71db0fa59d | [
"Apache-2.0"
] | 229 | 2019-05-14T08:55:57.000Z | 2022-03-31T03:14:55.000Z | /**
* Autogenerated by Thrift Compiler (0.12.0)
*
* DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
* @generated
*/
#include "MovieInfoService.h"
namespace media_service {
MovieInfoService_WriteMovieInfo_args::~MovieInfoService_WriteMovieInfo_args() throw() {
}
uint32_t MovieInfoService_Writ... | 33.47519 | 439 | 0.649582 | [
"vector"
] |
1f1240cb9ab72e2a357a4b9feab62a107d3cdf61 | 3,346 | cpp | C++ | RenderOverlays/DebugHotKeys.cpp | alexgithubber/XLE-Another-Fork | cdd8682367d9e9fdbdda9f79d72bb5b1499cec46 | [
"MIT"
] | null | null | null | RenderOverlays/DebugHotKeys.cpp | alexgithubber/XLE-Another-Fork | cdd8682367d9e9fdbdda9f79d72bb5b1499cec46 | [
"MIT"
] | null | null | null | RenderOverlays/DebugHotKeys.cpp | alexgithubber/XLE-Another-Fork | cdd8682367d9e9fdbdda9f79d72bb5b1499cec46 | [
"MIT"
] | null | null | null | // Copyright 2015 XLGAMES Inc.
//
// Distributed under the MIT License (See
// accompanying file "LICENSE" or the website
// http://www.opensource.org/licenses/mit-license.php)
#include "DebugHotKeys.h"
#include "DebuggingDisplay.h"
#include "../Assets/Assets.h"
#include "../ConsoleRig/Console.h"
#include "../Utility/... | 34.142857 | 143 | 0.621339 | [
"vector"
] |
1f124389110938bc579ab1f249cfda5bd4cbe6d7 | 650 | cpp | C++ | src/tools.cpp | schafer14/Unscented-Kalman-Filter | 749fc7fd432f38fba159a06578ef5295a31b75bf | [
"MIT"
] | null | null | null | src/tools.cpp | schafer14/Unscented-Kalman-Filter | 749fc7fd432f38fba159a06578ef5295a31b75bf | [
"MIT"
] | null | null | null | src/tools.cpp | schafer14/Unscented-Kalman-Filter | 749fc7fd432f38fba159a06578ef5295a31b75bf | [
"MIT"
] | null | null | null | #include <iostream>
#include "tools.h"
using Eigen::VectorXd;
using Eigen::MatrixXd;
using std::vector;
Tools::Tools() {}
Tools::~Tools() {}
VectorXd Tools::CalculateRMSE(const vector<VectorXd> &estimations,
const vector<VectorXd> &ground_truth) {
/**
TODO:
* Calculate the RMSE... | 19.117647 | 69 | 0.612308 | [
"vector"
] |
1f2ea035a4adeb4d63558d2204514840992ddcf6 | 3,016 | cpp | C++ | emitter.cpp | JulioC/Particles | 267d7a058be7b36f09ff34d6b7e63739aebfd778 | [
"MIT"
] | 2 | 2020-03-30T01:53:08.000Z | 2021-03-27T03:46:52.000Z | emitter.cpp | JulioC/Particles | 267d7a058be7b36f09ff34d6b7e63739aebfd778 | [
"MIT"
] | null | null | null | emitter.cpp | JulioC/Particles | 267d7a058be7b36f09ff34d6b7e63739aebfd778 | [
"MIT"
] | 2 | 2021-03-27T03:46:53.000Z | 2021-12-27T10:01:51.000Z | #include "emitter.h"
#include <stddef.h>
#include "particle.h"
#include "renderer.h"
#include "operator.h"
#include "initializer.h"
Emitter::Emitter(const Vector3D &pos, float itv, int max) :
_position(pos),
_interval(itv),
_maxParticles(max),
_renderer(NULL),
_initializers(NULL),
_operators(NULL),
_pa... | 19.712418 | 59 | 0.631631 | [
"render"
] |
1f394a6c24834a0e8a423a5cd166afd766b26a5d | 14,115 | hpp | C++ | mtlpp_ue4_ex_03/renderer/mtlpp/device.hpp | dtonna/mtlpp_ue4_ex_03 | 80b945c5b5dbbf6efbe525fb371a2e77657cd595 | [
"Unlicense"
] | null | null | null | mtlpp_ue4_ex_03/renderer/mtlpp/device.hpp | dtonna/mtlpp_ue4_ex_03 | 80b945c5b5dbbf6efbe525fb371a2e77657cd595 | [
"Unlicense"
] | null | null | null | mtlpp_ue4_ex_03/renderer/mtlpp/device.hpp | dtonna/mtlpp_ue4_ex_03 | 80b945c5b5dbbf6efbe525fb371a2e77657cd595 | [
"Unlicense"
] | null | null | null | /*
* Copyright 2016-2017 Nikolay Aleksiev. All rights reserved.
* License: https://github.com/naleksiev/mtlpp/blob/master/LICENSE
*/
// Copyright Epic Games, Inc. All Rights Reserved.
// Modifications for Unreal Engine
#pragma once
#include "declare.hpp"
#include "imp_Device.hpp"
#include "types.hpp"
#include "pi... | 42.902736 | 226 | 0.763018 | [
"object"
] |
1f406896de376ffc24c7a4958b9f6f0f9441d0dc | 6,358 | cpp | C++ | src/utility.reader.urdf/parsers/RobotElementParser.cpp | toeb/sine | 96bcde571218f89a2b0b3cc51c19ad2b7be89c13 | [
"MIT"
] | null | null | null | src/utility.reader.urdf/parsers/RobotElementParser.cpp | toeb/sine | 96bcde571218f89a2b0b3cc51c19ad2b7be89c13 | [
"MIT"
] | null | null | null | src/utility.reader.urdf/parsers/RobotElementParser.cpp | toeb/sine | 96bcde571218f89a2b0b3cc51c19ad2b7be89c13 | [
"MIT"
] | null | null | null | #include "RobotElementParser.h"
#include <utility.reader.urdf/parsers/UrdfExtensionParser.h>
#include <utility.reader.urdf/parsers/LinkParser.h>
#include <utility.reader.urdf/parsers/JointParser.h>
#include <utility.reader.urdf/structs/UrdfConnection.h>
using namespace nspace;
using namespace std;
RobotEle... | 33.640212 | 121 | 0.738754 | [
"object",
"vector",
"model"
] |
1f47bb6e6ca86be08e997d23f0b83456809972b4 | 2,066 | cpp | C++ | graph-source-code/327-D/6610527.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | graph-source-code/327-D/6610527.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | graph-source-code/327-D/6610527.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | //Language: GNU C++0x
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <iostream>
#include <iterator>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <sstream>
#include <utility>
#includ... | 23.213483 | 105 | 0.550823 | [
"vector"
] |
48faf695afe2ec9b8dad480f1185dda90c52e454 | 10,892 | cpp | C++ | engine/scene/Animators.cpp | tsukoyumi/ouzel | 43f4f4871d49a310529366a4a4db061a96097164 | [
"Unlicense"
] | null | null | null | engine/scene/Animators.cpp | tsukoyumi/ouzel | 43f4f4871d49a310529366a4a4db061a96097164 | [
"Unlicense"
] | null | null | null | engine/scene/Animators.cpp | tsukoyumi/ouzel | 43f4f4871d49a310529366a4a4db061a96097164 | [
"Unlicense"
] | null | null | null | // Ouzel by Elviss Strazdins
#include <cmath>
#include <limits>
#include "Animators.hpp"
#include "Actor.hpp"
#include "../core/Engine.hpp"
#include "../hash/Fnv1.hpp"
#include "../utils/Utils.hpp"
namespace ouzel::scene
{
Ease::Ease(Animator& animator, easing::Func initFunc, easing::Mode initMode):
Anima... | 30.68169 | 190 | 0.56087 | [
"vector"
] |
5b07ecfee229e928f4f494662d0a1e86f337d2ed | 3,226 | hpp | C++ | src/Library/math/Vector_tfs.hpp | ut-issl/s2e-core | 900fae6b738eb8765cd98c48acb2b74f05dcc68c | [
"MIT"
] | 16 | 2021-12-28T18:30:01.000Z | 2022-03-26T12:59:48.000Z | src/Library/math/Vector_tfs.hpp | ut-issl/s2e-core | 900fae6b738eb8765cd98c48acb2b74f05dcc68c | [
"MIT"
] | 61 | 2022-01-04T22:56:36.000Z | 2022-03-31T13:19:29.000Z | src/Library/math/Vector_tfs.hpp | ut-issl/s2e-core | 900fae6b738eb8765cd98c48acb2b74f05dcc68c | [
"MIT"
] | 2 | 2022-03-03T03:39:25.000Z | 2022-03-12T04:50:30.000Z | /*!
\file Vector_impl.hpp
\author TAKISAWA Jun'ichi.
\brief Vector.hppのテンプレート実装
*/
#ifndef VECTOR_HPP_TFS_HPP_
#define VECTOR_HPP_TFS_HPP_
#include <cmath>
namespace libra {
template <size_t N, typename T>
Vector<N, T>::Vector(const T& n) {
for (size_t i = 0; i < N; ++i) {
vector_[i] = n;
}
}
templ... | 21.506667 | 84 | 0.572536 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.