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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
254b058a8157b56d70e2c8273b7b0fa5f6995ce2 | 755 | cpp | C++ | LeetCode/64 - Minimum Path Sum.cpp | zhussupov/algo | 8c940c1663a035cc8adf403253b2e9ba967cb528 | [
"MIT"
] | 1 | 2019-03-13T18:15:34.000Z | 2019-03-13T18:15:34.000Z | LeetCode/64 - Minimum Path Sum.cpp | zhussupov/algo | 8c940c1663a035cc8adf403253b2e9ba967cb528 | [
"MIT"
] | null | null | null | LeetCode/64 - Minimum Path Sum.cpp | zhussupov/algo | 8c940c1663a035cc8adf403253b2e9ba967cb528 | [
"MIT"
] | null | null | null | class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int m = grid.size();
if (m == 0)
return 0;
int n = grid[0].size();
if (n == 0)
return 0;
vector<vector<int>> dp(m, vector<int> (n, 0));
dp[m-1][n-1] = grid[m-1][n-1];
... | 32.826087 | 61 | 0.350993 | [
"vector"
] |
2554994d71e111c52b341d5a8dc2bf6d35b4800e | 1,009 | cpp | C++ | src/kernel/triangle_3.cpp | rgcv/libcgal-julia | 8d5bc5f13d3c9c6160cfff795d2a0bbe1e473d94 | [
"MIT"
] | 5 | 2020-01-22T14:06:29.000Z | 2021-09-23T11:29:18.000Z | src/kernel/triangle_3.cpp | rgcv/libcgal-julia | 8d5bc5f13d3c9c6160cfff795d2a0bbe1e473d94 | [
"MIT"
] | null | null | null | src/kernel/triangle_3.cpp | rgcv/libcgal-julia | 8d5bc5f13d3c9c6160cfff795d2a0bbe1e473d94 | [
"MIT"
] | 2 | 2021-02-16T13:56:02.000Z | 2022-03-14T17:17:30.000Z | #include <jlcxx/module.hpp>
#include <julia.h>
#include "io.hpp"
#include "kernel.hpp"
namespace jlcgal {
void wrap_triangle_3(jlcxx::Module& kernel,
jlcxx::TypeWrapper<Triangle_3>& triangle_3) {
triangle_3
// Creation
.constructor<const Point_3&, const Point_3&, const Point_3&>()
;
kernel.set_o... | 26.552632 | 86 | 0.660059 | [
"transform"
] |
255c9578b2588676a32e7110edf0c42aa94458bd | 956 | hpp | C++ | hitagi/physics/include/hitagi/physics/physics_manager.hpp | L-Sun/game_engine | e153280dae975c2770a202ca3b55e672626a172e | [
"MIT"
] | null | null | null | hitagi/physics/include/hitagi/physics/physics_manager.hpp | L-Sun/game_engine | e153280dae975c2770a202ca3b55e672626a172e | [
"MIT"
] | null | null | null | hitagi/physics/include/hitagi/physics/physics_manager.hpp | L-Sun/game_engine | e153280dae975c2770a202ca3b55e672626a172e | [
"MIT"
] | null | null | null | #pragma once
#include <hitagi/resource/scene_node.hpp>
#include <hitagi/core/runtime_module.hpp>
#include <hitagi/math/vector.hpp>
#include <hitagi/math/matrix.hpp>
#include <vector>
namespace hitagi::physics {
class IPhysicsManager : public IRuntimeModule {
public:
int Initialize() override = 0;
void Final... | 30.83871 | 84 | 0.720711 | [
"geometry",
"vector"
] |
255e28717e9b6243adad91189adc3e88acd41707 | 5,523 | cxx | C++ | src/main.cxx | FlowPhysics/FlowTK | 853778b5a485bf8059aa0b01b91de62ee927f6a4 | [
"Zlib"
] | 2 | 2015-06-30T17:44:43.000Z | 2022-03-22T10:58:19.000Z | src/main.cxx | FlowPhysics/FlowTK | 853778b5a485bf8059aa0b01b91de62ee927f6a4 | [
"Zlib"
] | null | null | null | src/main.cxx | FlowPhysics/FlowTK | 853778b5a485bf8059aa0b01b91de62ee927f6a4 | [
"Zlib"
] | 3 | 2015-03-04T13:23:57.000Z | 2022-03-22T10:58:20.000Z | /*
* =====================================================================================
*
* Filename: main.cxx
*
* Description: A Complete Pipeline Test
*
* Version: 1.0
* Created: 08/31/2012 03:19:07 PM
* Revision: none
* Compiler: gcc
*
* Author: Siavas... | 29.693548 | 133 | 0.62285 | [
"object"
] |
2567b600f8c5875a8a2bb6c3fa3deafd3a4d1bab | 16,129 | cpp | C++ | src/graph/GridGraph.cpp | DarkWingMcQuack/GridGraphPathFinder | d8f9a237f17516141bf58c8c86d468f3559af5e3 | [
"Apache-2.0"
] | null | null | null | src/graph/GridGraph.cpp | DarkWingMcQuack/GridGraphPathFinder | d8f9a237f17516141bf58c8c86d468f3559af5e3 | [
"Apache-2.0"
] | null | null | null | src/graph/GridGraph.cpp | DarkWingMcQuack/GridGraphPathFinder | d8f9a237f17516141bf58c8c86d468f3559af5e3 | [
"Apache-2.0"
] | null | null | null | #include <algorithm>
#include <fmt/core.h>
#include <fstream>
#include <graph/GridGraph.hpp>
#include <graph/NeigbourCalculator.hpp>
#include <random>
#include <selection/NodeSelection.hpp>
#include <vector>
using graph::GridGraph;
using graph::Node;
using graph::NeigbourCalculator;
namespace {
auto findClipValues(c... | 26.615512 | 100 | 0.557629 | [
"vector",
"transform"
] |
256eaee36afa641fba820a2ab416ae9f0c9dcf46 | 4,387 | cpp | C++ | src/implements/text-labels_impl.cpp | philip1337/samp-plugin-streamer | 54b08afd5e73bd5f68f67f9cf8cc78189bf6ef8a | [
"Apache-2.0"
] | 2 | 2017-07-23T23:27:03.000Z | 2017-07-24T06:18:13.000Z | src/implements/text-labels_impl.cpp | Sphinxila/samp-plugin-streamer | 54b08afd5e73bd5f68f67f9cf8cc78189bf6ef8a | [
"Apache-2.0"
] | null | null | null | src/implements/text-labels_impl.cpp | Sphinxila/samp-plugin-streamer | 54b08afd5e73bd5f68f67f9cf8cc78189bf6ef8a | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2017 Incognito (Edited by ProMetheus)
*
* 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... | 37.177966 | 252 | 0.736038 | [
"geometry"
] |
257438da66a8e97b8b815be9b126741b67bd71ee | 748 | cpp | C++ | boboleetcode/Play-Leetcode-master/0982-Triples-with-Bitwise-AND-Equal-To-Zero/cpp-0982/main.cpp | yaominzh/CodeLrn2019 | adc727d92904c5c5d445a2621813dfa99474206d | [
"Apache-2.0"
] | 2 | 2021-03-25T05:26:55.000Z | 2021-04-20T03:33:24.000Z | boboleetcode/Play-Leetcode-master/0982-Triples-with-Bitwise-AND-Equal-To-Zero/cpp-0982/main.cpp | mcuallen/CodeLrn2019 | adc727d92904c5c5d445a2621813dfa99474206d | [
"Apache-2.0"
] | 6 | 2019-12-04T06:08:32.000Z | 2021-05-10T20:22:47.000Z | boboleetcode/Play-Leetcode-master/0982-Triples-with-Bitwise-AND-Equal-To-Zero/cpp-0982/main.cpp | mcuallen/CodeLrn2019 | adc727d92904c5c5d445a2621813dfa99474206d | [
"Apache-2.0"
] | null | null | null | /// Source : https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/
/// Author : liuyubobobo
/// Time : 2019-01-26
#include <iostream>
#include <vector>
using namespace std;
/// Using HashSet
/// Time Complexity: O(max(2^16 * n, n^2))
/// Space Complexity: O(2^16 * n)
class Solution {
public:
i... | 20.216216 | 82 | 0.485294 | [
"vector"
] |
2574cc521e619edc571361de6fad19188092f8f3 | 4,130 | cpp | C++ | src/lib/dhtclient/SKAsyncKeyedOperation.cpp | Clara19/SilverKing | dd0db242ac0864ae4f5912cfc595e782ffdf0484 | [
"Apache-2.0"
] | 1 | 2021-09-08T11:55:18.000Z | 2021-09-08T11:55:18.000Z | src/lib/dhtclient/SKAsyncKeyedOperation.cpp | Clara19/SilverKing | dd0db242ac0864ae4f5912cfc595e782ffdf0484 | [
"Apache-2.0"
] | 2 | 2021-01-21T19:47:34.000Z | 2021-12-14T14:58:01.000Z | src/lib/dhtclient/SKAsyncKeyedOperation.cpp | Clara19/SilverKing | dd0db242ac0864ae4f5912cfc595e782ffdf0484 | [
"Apache-2.0"
] | 7 | 2021-01-21T18:57:06.000Z | 2022-03-04T06:51:31.000Z | /**
*
* $Header: $
* $Change: $
* $DateTime: $
*/
#include "SKAsyncKeyedOperation.h"
#include <iostream>
using std::endl;
#include "jace/Jace.h"
using jace::java_new;
using jace::java_cast;
using namespace jace;
#include "jace/JArray.h"
using jace::JArray;
#include "jace/proxy/java/lang/Object.h"
using ::jace::proxy... | 33.04 | 113 | 0.693947 | [
"object"
] |
2577a7edf3bbe2018a621f4c2170729a4619ffcd | 10,055 | cc | C++ | chrome/browser/chromeos/gdata/gdata_file_system_proxy.cc | 1065672644894730302/Chromium | 239dd49e906be4909e293d8991e998c9816eaa35 | [
"BSD-3-Clause"
] | 1 | 2019-04-23T15:57:04.000Z | 2019-04-23T15:57:04.000Z | chrome/browser/chromeos/gdata/gdata_file_system_proxy.cc | 1065672644894730302/Chromium | 239dd49e906be4909e293d8991e998c9816eaa35 | [
"BSD-3-Clause"
] | null | null | null | chrome/browser/chromeos/gdata/gdata_file_system_proxy.cc | 1065672644894730302/Chromium | 239dd49e906be4909e293d8991e998c9816eaa35 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) 2012 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 "chrome/browser/chromeos/gdata/gdata_file_system_proxy.h"
#include <string>
#include <vector>
#include "base/bind.h"
#include "base/platfor... | 34.672414 | 79 | 0.713874 | [
"vector"
] |
258106fa13ade8e771544b8c393ee2001520ba65 | 1,806 | cpp | C++ | src/tests/tests.cpp | Future-Game-Studio/cpp-way | 9eaf0e807c97826a315cd4f72e531f319d7dec44 | [
"MIT"
] | null | null | null | src/tests/tests.cpp | Future-Game-Studio/cpp-way | 9eaf0e807c97826a315cd4f72e531f319d7dec44 | [
"MIT"
] | null | null | null | src/tests/tests.cpp | Future-Game-Studio/cpp-way | 9eaf0e807c97826a315cd4f72e531f319d7dec44 | [
"MIT"
] | null | null | null | #include <memory>
#include <string>
#include <sstream>
#include "../thirdparty/acutest.h"
#include "../oop/shapes/helpers/exceptions.h"
#include "../oop/shapes/models/abstractions/shape.h"
#include "../oop/shapes/views/shapeConsoleView.h"
#include "../oop/shapes/views/cylinderConsoleView.h"
#include "../oop/shapes/cont... | 25.083333 | 99 | 0.713178 | [
"render",
"shape"
] |
258106fa68b0ea8cad00159ecdfbdd77473b18a0 | 18,439 | cpp | C++ | scheduler/src/scipUser.cpp | mudrole1/strands_executive | 72d983d8f8dba09febbcf105ed2bdac3491dc8d7 | [
"MIT"
] | null | null | null | scheduler/src/scipUser.cpp | mudrole1/strands_executive | 72d983d8f8dba09febbcf105ed2bdac3491dc8d7 | [
"MIT"
] | null | null | null | scheduler/src/scipUser.cpp | mudrole1/strands_executive | 72d983d8f8dba09febbcf105ed2bdac3491dc8d7 | [
"MIT"
] | null | null | null | /**
This class contains usage of SCIP solver.
@author Lenka Mudrova
@version 1.0 29/10/2014
*/
#include "scipUser.h"
#include "task.h"
/* scip includes */
#include "objscip/objscip.h"
#include "objscip/objscipdefplugins.h"
#include <vector>
#include <chrono>
#include <iostream> //TODO:delete this
#include... | 27.036657 | 201 | 0.568252 | [
"vector"
] |
25884df431ad8b2171c72db91ec0b712c8c75c10 | 742 | cpp | C++ | #Preparation/Placement-Overview/LeetCode 30s Challange/weightage-stones.cpp | sounishnath003/CPP-for-beginner | d4755ab4ae098d63c9a0666d8eb4d152106d4a20 | [
"MIT"
] | 4 | 2020-05-14T04:41:04.000Z | 2021-06-13T06:42:03.000Z | #Preparation/Placement-Overview/LeetCode 30s Challange/weightage-stones.cpp | sounishnath003/CPP-for-beginner | d4755ab4ae098d63c9a0666d8eb4d152106d4a20 | [
"MIT"
] | null | null | null | #Preparation/Placement-Overview/LeetCode 30s Challange/weightage-stones.cpp | sounishnath003/CPP-for-beginner | d4755ab4ae098d63c9a0666d8eb4d152106d4a20 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
#define fo(i, n) for(int i = n; i >= 0; i--)
using namespace std ;
#define deb(x) {cout << #x << " " << x << endl ;}
void go(vector<int> &stones) {
make_heap(stones.begin(), stones.end()) ;
while(stones.size() > 1) {
pop_heap(stones.begin(), stones.end()) ;
int x = ston... | 25.586207 | 93 | 0.541779 | [
"vector"
] |
258a009110e57bbf26b2d1d7523220ee7b409033 | 529,952 | cpp | C++ | src/main_2400.cpp | sc2ad/BeatSaber-Quest-Codegen | ba8acaae541cfe1161e05fbc3bf87f4bc46bc4ab | [
"Unlicense"
] | 23 | 2020-08-07T04:09:00.000Z | 2022-03-31T22:10:29.000Z | src/main_2400.cpp | sc2ad/BeatSaber-Quest-Codegen | ba8acaae541cfe1161e05fbc3bf87f4bc46bc4ab | [
"Unlicense"
] | 6 | 2021-09-29T23:47:31.000Z | 2022-03-30T20:49:23.000Z | src/main_2400.cpp | sc2ad/BeatSaber-Quest-Codegen | ba8acaae541cfe1161e05fbc3bf87f4bc46bc4ab | [
"Unlicense"
] | 17 | 2020-08-20T19:36:52.000Z | 2022-03-30T18:28:24.000Z | // Autogenerated from CppSourceCreator
// Created by Sc2ad
// =========================================================================
// Begin includes
#include "extern/beatsaber-hook/shared/utils/typedefs.h"
// Including type: LiteNetLib.InvalidPacketException
#include "LiteNetLib/InvalidPacketException.hpp"
... | 79.704016 | 580 | 0.778582 | [
"object",
"vector",
"transform"
] |
2593ec9122c90a18948fd39e73e7df2cf6d0a3ac | 4,190 | cpp | C++ | DX11Sandbox/Source/Renderer/Mesh.cpp | DDreher/DX11Sandbox | 4bdbc14be853ac2b5d5addbbe6b425aab43c0264 | [
"MIT"
] | null | null | null | DX11Sandbox/Source/Renderer/Mesh.cpp | DDreher/DX11Sandbox | 4bdbc14be853ac2b5d5addbbe6b425aab43c0264 | [
"MIT"
] | null | null | null | DX11Sandbox/Source/Renderer/Mesh.cpp | DDreher/DX11Sandbox | 4bdbc14be853ac2b5d5addbbe6b425aab43c0264 | [
"MIT"
] | null | null | null | #include "Mesh.h"
#include "assimp/Importer.hpp"
#include "assimp/postprocess.h"
#include "assimp/scene.h"
SharedPtr<MeshData> MeshData::LoadFromFile(const GraphicsContext& context, const std::string& asset_path)
{
LOG("Loading mesh: {}", asset_path);
SharedPtr<MeshData> mesh_data = MakeShared<MeshData>();
... | 35.811966 | 141 | 0.684726 | [
"mesh",
"render",
"vector"
] |
259cbb5449ab3113be7d6c330df090c9b3fdd0aa | 2,303 | cpp | C++ | GUI/src/viewport.cpp | zpervan/GameOfLife | 5de94ef837ada33e700b5e9e5b14b9371c00fe43 | [
"MIT"
] | 3 | 2020-12-12T15:49:03.000Z | 2021-05-22T02:04:02.000Z | GUI/src/viewport.cpp | zpervan/GameOfLife | 5de94ef837ada33e700b5e9e5b14b9371c00fe43 | [
"MIT"
] | null | null | null | GUI/src/viewport.cpp | zpervan/GameOfLife | 5de94ef837ada33e700b5e9e5b14b9371c00fe43 | [
"MIT"
] | null | null | null | #include "GUI/src/viewport.h"
#include <thread>
#include <chrono>
Viewport::Viewport(sf::RenderWindow &window) : window_(window) {}
void Viewport::SetGridSize(std::size_t row, std::size_t column) {
grid_ = std::make_unique<Grid>();
row_ = row;
column_ = column;
}
void Viewport::Initialize() {
CreateG... | 27.094118 | 105 | 0.690404 | [
"vector"
] |
25a33fed11d96b67e679d58a86c82b01af67ef3b | 16,510 | cpp | C++ | asl/base/Win32Backtrace.cpp | artcom/asl | d47748983678c245ac2da3b5de56245ac41768fe | [
"BSL-1.0"
] | 2 | 2016-01-11T01:06:11.000Z | 2019-07-24T02:27:13.000Z | asl/base/Win32Backtrace.cpp | artcom/asl | d47748983678c245ac2da3b5de56245ac41768fe | [
"BSL-1.0"
] | null | null | null | asl/base/Win32Backtrace.cpp | artcom/asl | d47748983678c245ac2da3b5de56245ac41768fe | [
"BSL-1.0"
] | 1 | 2016-01-31T18:14:37.000Z | 2016-01-31T18:14:37.000Z | /* __ ___ ____ _____ ______ _______ ________ _______ ______ _____ ____ ___ __
//
// Copyright (C) 1993-2012, ART+COM AG Berlin, Germany <www.artcom.de>
//
// This file is part of the ART+COM Standard Library (asl).
//
// It is distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_... | 27.379768 | 126 | 0.564688 | [
"vector"
] |
25aeb5daa11487d8470b9eba933fb30b24aed16f | 3,498 | cpp | C++ | solutions/LeetCode/C++/93.cpp | timxor/leetcode-journal | 5f1cb6bcc44a5bc33d88fb5cdb4126dfc6f4232a | [
"MIT"
] | 854 | 2018-11-09T08:06:16.000Z | 2022-03-31T06:05:53.000Z | solutions/LeetCode/C++/93.cpp | timxor/leetcode-journal | 5f1cb6bcc44a5bc33d88fb5cdb4126dfc6f4232a | [
"MIT"
] | 29 | 2019-06-02T05:02:25.000Z | 2021-11-15T04:09:37.000Z | solutions/LeetCode/C++/93.cpp | timxor/leetcode-journal | 5f1cb6bcc44a5bc33d88fb5cdb4126dfc6f4232a | [
"MIT"
] | 347 | 2018-12-23T01:57:37.000Z | 2022-03-12T14:51:21.000Z | __________________________________________________________________________________________________
4ms
class Solution {
public:
vector<string> restoreIpAddresses(string s) {
if (s.empty() || s.size() > 12 || s.size() < 4 ) return {};
vector<string> res;
restore(s, 0, "", res);
... | 33.961165 | 104 | 0.478845 | [
"vector"
] |
25af379c05764f434377caf86fd8d31083814cde | 15,168 | cpp | C++ | WpdApiSample.cpp | Golax/UberExporter-Mobile | 98702c96040bb2756f74fe2cee2c2a62400d41c7 | [
"MIT"
] | 2 | 2019-04-11T11:28:44.000Z | 2019-04-11T11:28:47.000Z | WpdApiSample.cpp | Golax/UberExporter-Mobile | 98702c96040bb2756f74fe2cee2c2a62400d41c7 | [
"MIT"
] | null | null | null | WpdApiSample.cpp | Golax/UberExporter-Mobile | 98702c96040bb2756f74fe2cee2c2a62400d41c7 | [
"MIT"
] | null | null | null | // THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
// PARTICULAR PURPOSE.
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// Defines the entry poi... | 41.442623 | 168 | 0.598233 | [
"object",
"vector"
] |
25c0c5e58f94453045e5eecfd7730bebcd0b5e23 | 8,179 | cpp | C++ | testbench/astar/mpi/main.cpp | Arka2009/LOCUS | a0ef0bc9a25456668ef381734b17385da738805a | [
"BSD-3-Clause"
] | 8 | 2017-09-16T10:07:04.000Z | 2021-07-27T06:07:28.000Z | testbench/astar/mpi/main.cpp | tancheng/iot-kernels-locus | 82da0214bf52061f2739dffd2713dc8691e82b18 | [
"BSD-3-Clause"
] | 3 | 2018-08-17T13:13:11.000Z | 2018-12-04T03:05:16.000Z | testbench/astar/mpi/main.cpp | tancheng/iot-kernels-locus | 82da0214bf52061f2739dffd2713dc8691e82b18 | [
"BSD-3-Clause"
] | 1 | 2021-08-08T04:30:55.000Z | 2021-08-08T04:30:55.000Z | #include<stdio.h>
#include<vector>
#define DUMP
#ifdef DUMP
#include "mpi.h"
#include <m5op.h>
#endif
#ifndef DUMP
#include <mpi/mpi.h>
#endif
#define NUM 16
#define MAX 1024
int SIZE = 0;
using namespace std;
int numprocs, myid;
MPI_Status status;
MPI_Request request;
class Node;
Node** nodes;
vector<Node*> vec... | 21.868984 | 108 | 0.474263 | [
"vector"
] |
25c375d25da030ba84cdd2b2eefe1591e22b3ba9 | 63,358 | cpp | C++ | test/span_iterator_suite.cpp | breese/trial.circular | 8b8269c1ba90f1cb3c7a8970a27ccb149069ed24 | [
"BSL-1.0"
] | 5 | 2020-06-06T20:33:43.000Z | 2020-11-03T01:21:20.000Z | test/span_iterator_suite.cpp | breese/trial.circular | 8b8269c1ba90f1cb3c7a8970a27ccb149069ed24 | [
"BSL-1.0"
] | null | null | null | test/span_iterator_suite.cpp | breese/trial.circular | 8b8269c1ba90f1cb3c7a8970a27ccb149069ed24 | [
"BSL-1.0"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2019 Bjorn Reese <breese@users.sourceforge.net>
//
// 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)
/... | 33.505024 | 194 | 0.580353 | [
"vector"
] |
5adfd59c60a82d2f50b02e5cf2671dc3ed7a3015 | 3,901 | cpp | C++ | externals/numeric_bindings/libs/numeric/bindings/lapack/test/ublas_syev.cpp | fperignon/sandbox | 649f09d6db7bbd84c2418de74eb9453c0131f070 | [
"Apache-2.0"
] | 137 | 2015-06-16T15:55:28.000Z | 2022-03-26T06:01:59.000Z | externals/numeric_bindings/libs/numeric/bindings/lapack/test/ublas_syev.cpp | fperignon/sandbox | 649f09d6db7bbd84c2418de74eb9453c0131f070 | [
"Apache-2.0"
] | 381 | 2015-09-22T15:31:08.000Z | 2022-02-14T09:05:23.000Z | externals/numeric_bindings/libs/numeric/bindings/lapack/test/ublas_syev.cpp | fperignon/sandbox | 649f09d6db7bbd84c2418de74eb9453c0131f070 | [
"Apache-2.0"
] | 30 | 2015-08-06T22:57:51.000Z | 2022-03-02T20:30:20.000Z | //
// Copyright Toon Knapen, Karl Meerbergen
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
#include "ublas_heev.hpp"
#include <boost/numeric/bindings/lapack/driver/syev.hpp>
#include <boost/numeric/bin... | 24.229814 | 97 | 0.688285 | [
"vector"
] |
5ae0a01a0029db0cefe0ab0ce5c9f72335033a24 | 5,264 | hpp | C++ | dpt/com/manager.hpp | patflick/dpt | 5b300500c97f41d1d24c4e660af2d4499ad40520 | [
"BSD-2-Clause"
] | 7 | 2017-03-23T05:19:53.000Z | 2021-02-26T14:25:08.000Z | dpt/com/manager.hpp | patflick/dpt | 5b300500c97f41d1d24c4e660af2d4499ad40520 | [
"BSD-2-Clause"
] | 2 | 2019-04-04T02:24:06.000Z | 2019-04-04T02:57:08.000Z | dpt/com/manager.hpp | patflick/dpt | 5b300500c97f41d1d24c4e660af2d4499ad40520 | [
"BSD-2-Clause"
] | 2 | 2019-04-03T20:09:47.000Z | 2021-10-30T16:06:47.000Z | /*******************************************************************************
* dpt/com/manager.hpp
*
* Part of dpt - Distributed Patricia Trie
*
* Copyright (C) 2016-2017 Florian Kurpicz <florian.kurpicz@tu-dortmund.de>
*
* All rights reserved. Published under the BSD-2 license in the LICENSE file.
********... | 40.492308 | 80 | 0.682561 | [
"vector"
] |
5ae9765a2fcdae59f9e855509730690c941625f4 | 6,915 | cpp | C++ | windows/appcompat/shims/general/ieunharden.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | windows/appcompat/shims/general/ieunharden.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | windows/appcompat/shims/general/ieunharden.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | /*++
Copyright (c) 2002-2003 Microsoft Corporation
Module Name:
IEUnHarden.cpp
Abstract:
IESoftening modifications
History:
01/15/2003 prashkud Created
--*/
#include "precomp.h"
IMPLEMENT_SHIM_BEGIN(IEUnHarden)
#include <windows.h>
#include <urlmon.h>
#include ... | 25.611111 | 128 | 0.491974 | [
"object"
] |
5aedbcfb17fceac436b2863a8a4f59a3be1daae7 | 341 | hpp | C++ | server/player.hpp | PythonNut/omnomnom | 588f9a93e535c4ba2c14530dc269d7ac0475db1e | [
"MIT"
] | null | null | null | server/player.hpp | PythonNut/omnomnom | 588f9a93e535c4ba2c14530dc269d7ac0475db1e | [
"MIT"
] | null | null | null | server/player.hpp | PythonNut/omnomnom | 588f9a93e535c4ba2c14530dc269d7ac0475db1e | [
"MIT"
] | 1 | 2019-10-16T10:37:35.000Z | 2019-10-16T10:37:35.000Z | #pragma once
#include <SFML/Graphics.hpp>
#include "helper.hpp"
#include "texprite.hpp"
class Player
{
private:
bool omNomming;
int version;
public:
Direction direction;
void draw(sf::RenderWindow& window, float dt);
void update(Direction direction, float dt);
sf::Sprite sprite;
Texprite ts;
sf::CircleShape... | 15.5 | 47 | 0.730205 | [
"shape"
] |
5aeded76581bc227e118f579caa76e1440c2e832 | 36,537 | cxx | C++ | Source/VTKExtensions/Meshing/vtkTINStitcher.cxx | developkits/cmb | caaf9cd7ffe0b7c1ac3be9edbce0f9430068d2cb | [
"BSD-3-Clause"
] | null | null | null | Source/VTKExtensions/Meshing/vtkTINStitcher.cxx | developkits/cmb | caaf9cd7ffe0b7c1ac3be9edbce0f9430068d2cb | [
"BSD-3-Clause"
] | null | null | null | Source/VTKExtensions/Meshing/vtkTINStitcher.cxx | developkits/cmb | caaf9cd7ffe0b7c1ac3be9edbce0f9430068d2cb | [
"BSD-3-Clause"
] | null | null | null | //=========================================================================
// Copyright (c) Kitware, Inc.
// All rights reserved.
// See LICENSE.txt for details.
//
// This software is distributed WITHOUT ANY WARRANTY; without even
// the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
// PURPOSE... | 33.155172 | 100 | 0.669322 | [
"mesh",
"vector",
"transform"
] |
5af036e0af4d70cb960881ea29bfd228229a2b4b | 1,374 | cc | C++ | TC/DP-Practice-DIV1-500.cc | aajjbb/contest-files | b8842681b96017063a7baeac52ae1318bf59d74d | [
"Apache-2.0"
] | 1 | 2018-08-28T19:58:40.000Z | 2018-08-28T19:58:40.000Z | TC/DP-Practice-DIV1-500.cc | aajjbb/contest-files | b8842681b96017063a7baeac52ae1318bf59d74d | [
"Apache-2.0"
] | 2 | 2017-04-16T00:48:05.000Z | 2017-08-03T20:12:26.000Z | TC/DP-Practice-DIV1-500.cc | aajjbb/contest-files | b8842681b96017063a7baeac52ae1318bf59d74d | [
"Apache-2.0"
] | 4 | 2016-03-04T19:42:00.000Z | 2018-01-08T11:42:00.000Z | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 19.352113 | 72 | 0.586608 | [
"vector"
] |
5af36702f833ff0307dc2da0fdcc708e70ba3a6f | 40,022 | cpp | C++ | openrave/python/bindings/openravepy_sensor.cpp | jdsika/TUM_HOly | a2ac55fa1751a3a8038cf61d29b95005f36d6264 | [
"MIT"
] | 2 | 2015-11-13T16:40:57.000Z | 2017-09-15T15:37:19.000Z | openrave/python/bindings/openravepy_sensor.cpp | jdsika/holy | a2ac55fa1751a3a8038cf61d29b95005f36d6264 | [
"MIT"
] | 1 | 2016-06-13T01:29:51.000Z | 2016-06-14T00:38:27.000Z | openrave/python/bindings/openravepy_sensor.cpp | jdsika/holy | a2ac55fa1751a3a8038cf61d29b95005f36d6264 | [
"MIT"
] | null | null | null | // -*- coding: utf-8 -*-
// Copyright (C) 2006-2011 Rosen Diankov <rosen.diankov@gmail.com>
//
// This file is part of OpenRAVE.
// OpenRAVE 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 vers... | 45.844215 | 251 | 0.692644 | [
"geometry",
"object",
"vector",
"transform"
] |
5afc17dccd790b5addf61ecc0298aa457cbe7c3d | 3,010 | hh | C++ | extern/typed-geometry/src/typed-geometry/types/objects/aabb.hh | rovedit/Fort-Candle | 445fb94852df56c279c71b95c820500e7fb33cf7 | [
"MIT"
] | null | null | null | extern/typed-geometry/src/typed-geometry/types/objects/aabb.hh | rovedit/Fort-Candle | 445fb94852df56c279c71b95c820500e7fb33cf7 | [
"MIT"
] | null | null | null | extern/typed-geometry/src/typed-geometry/types/objects/aabb.hh | rovedit/Fort-Candle | 445fb94852df56c279c71b95c820500e7fb33cf7 | [
"MIT"
] | null | null | null | #pragma once
#include <typed-geometry/feature/assert.hh>
#include <typed-geometry/types/scalars/default.hh>
#include "../pos.hh"
#include "../vec.hh"
#include "traits.hh"
namespace tg
{
template <int D, class ScalarT, class TraitsT = default_object_tag>
struct aabb;
// Common aabb types
using aabb1 = aabb<1, f32>;... | 26.637168 | 103 | 0.625581 | [
"geometry"
] |
5afd9f8b5e0758a20a4163ab5ef9192cd0905e93 | 21,959 | cc | C++ | src/traverse.cc | taepatipol/nogdb.js | 04278b2cd7538479e5273eb1f844c370c5d3af83 | [
"MIT"
] | 1 | 2018-07-27T14:54:01.000Z | 2018-07-27T14:54:01.000Z | src/traverse.cc | taepatipol/nogdb.js | 04278b2cd7538479e5273eb1f844c370c5d3af83 | [
"MIT"
] | null | null | null | src/traverse.cc | taepatipol/nogdb.js | 04278b2cd7538479e5273eb1f844c370c5d3af83 | [
"MIT"
] | 1 | 2019-06-21T08:24:53.000Z | 2019-06-21T08:24:53.000Z | #include <nogdb/nogdb.h>
#include "classFilter.hpp"
#include "txn.hpp"
#include "toV8type.hpp"
#include "traverse.hpp"
NAN_MODULE_INIT(Traverse::Init)
{
v8::Handle<v8::Object> t = v8::Object::New(v8::Isolate::GetCurrent());
Nan::SetMethod(t, "inEdgeBfs", inEdgeBfs);
Nan::SetMethod(t, "outEd... | 53.953317 | 140 | 0.607177 | [
"object"
] |
85004d3c1d6f2485e23cf1ad70a3ab9d3121e932 | 6,981 | cpp | C++ | Curve.cpp | bplevin36/167_P4 | e91fd484168a68b210d418f88c767a03a81e4d0f | [
"MIT"
] | 1 | 2021-02-22T08:32:59.000Z | 2021-02-22T08:32:59.000Z | Curve.cpp | bplevin36/167_P4 | e91fd484168a68b210d418f88c767a03a81e4d0f | [
"MIT"
] | 1 | 2020-04-29T05:40:50.000Z | 2021-02-22T01:04:27.000Z | Curve.cpp | bplevin36/167_P4 | e91fd484168a68b210d418f88c767a03a81e4d0f | [
"MIT"
] | null | null | null | #include "Curve.h"
#include "Window.h"
#include <math.h>
glm::vec3 Curve::maxHeight = glm::vec3(0.0, -INFINITY, 0.0);
Curve::Curve()
{
int i;
for (i = 0; i < 4; i++) {
controls[i] = new Point();
}
}
Curve::Curve(glm::mat4 pointMat)
{
int i;
for (i = 0; i < 4; i++) {
controls[i] = new Point(glm::vec3(glm::co... | 34.220588 | 220 | 0.698467 | [
"object",
"model"
] |
8506023e4fe5c5319b130dfc3b1e881d58e00e03 | 814,855 | cpp | C++ | commands/save/oui.cpp | Zerwer-Malek/NetworkManagement | 7626e95fa300ad047fc70b0e6ad44d7093859a45 | [
"MIT"
] | null | null | null | commands/save/oui.cpp | Zerwer-Malek/NetworkManagement | 7626e95fa300ad047fc70b0e6ad44d7093859a45 | [
"MIT"
] | null | null | null | commands/save/oui.cpp | Zerwer-Malek/NetworkManagement | 7626e95fa300ad047fc70b0e6ad44d7093859a45 | [
"MIT"
] | null | null | null | #include "../../main.h"
#include "oui.h"
/*
* OUI Mac lookup file is loaded into memory as a string for
* quick loading times
*/
string oui = "\n"
"E043DB Shenzhen ViewAt Technology Co.,Ltd. \n"
"2405F5 Integrated Device Technology (Malaysia) Sdn. Bhd.\n"
"3CD92B Hewlett Packard\n"
"9C8E99 Hewlett Packard\n"
"B499... | 33.468394 | 100 | 0.757071 | [
"cad",
"mesh",
"vector",
"3d",
"solid"
] |
850f0f501689f3bcc89f444cb0d86dcbc4a0589a | 2,648 | cpp | C++ | raytracer/transform.cpp | bdolinar/ray_tracer_challenge_cpp | 96e746b58ca4a173583ecbccfcde714a22b12935 | [
"BSD-2-Clause"
] | null | null | null | raytracer/transform.cpp | bdolinar/ray_tracer_challenge_cpp | 96e746b58ca4a173583ecbccfcde714a22b12935 | [
"BSD-2-Clause"
] | null | null | null | raytracer/transform.cpp | bdolinar/ray_tracer_challenge_cpp | 96e746b58ca4a173583ecbccfcde714a22b12935 | [
"BSD-2-Clause"
] | null | null | null | #include <raytracer/transform.h>
#include <raytracer/matrix.h>
//------------------------------------------------------------------------------
Matrix translation(double a_x_translation, double a_y_translation,
double a_z_translation)
{
Matrix t = Matrix::identity_matrix(4);
t[0][3] = a_x_translation;
t[1]... | 25.708738 | 80 | 0.46148 | [
"transform"
] |
851791e32e74b165e03f53679370fab1f9ab50df | 2,285 | hpp | C++ | libmiso/miso.hpp | jason-richards/ImageCloud | 0b574a384b78c5e1d8f05ffaabb88320605963b0 | [
"MIT"
] | null | null | null | libmiso/miso.hpp | jason-richards/ImageCloud | 0b574a384b78c5e1d8f05ffaabb88320605963b0 | [
"MIT"
] | null | null | null | libmiso/miso.hpp | jason-richards/ImageCloud | 0b574a384b78c5e1d8f05ffaabb88320605963b0 | [
"MIT"
] | null | null | null | #pragma once
#include <memory>
#include <string>
#include <vector>
#include <ostream>
namespace Miso {
/**************
* 0-------X
* |
* | []
* Y
**************/
typedef struct
FaceRectangle {
int x;
int y;
int width;
int height;
} FaceRectangleT;
/*
EXAMPLE Manifest JSON:
{
"UUID": "1A8... | 28.209877 | 84 | 0.63326 | [
"vector"
] |
8522d0de378fc7b1818a8c1da8f274047cbb36af | 2,970 | cpp | C++ | 20180816/DailyTest/test.cpp | jJayyyyyyy/USTC-2018-Summer-Course | c3620be859c55b4dc06507ec350a1c0aa84784c6 | [
"MIT"
] | 15 | 2018-08-04T15:13:13.000Z | 2021-02-05T22:43:29.000Z | 20180816/DailyTest/test.cpp | jJayyyyyyy/USTC-2018-Summer-Course | c3620be859c55b4dc06507ec350a1c0aa84784c6 | [
"MIT"
] | 1 | 2018-08-06T03:55:50.000Z | 2018-08-06T04:43:29.000Z | 20180816/DailyTest/test.cpp | jJayyyyyyy/USTC-2018-Summer-Course | c3620be859c55b4dc06507ec350a1c0aa84784c6 | [
"MIT"
] | 5 | 2018-08-05T01:00:43.000Z | 2021-02-05T22:43:32.000Z | #include <iostream>
#include <vector>
#include <iomanip>
#define LRU 1
#define FIFO 2
using namespace std;
vector<int> pageList; // 页面块
vector<int> itemList; // 作业序列
// 由用户输入页面块的大小
void resizePageList(){
cout<<"请输入页面块大小: ";
int size = 0;
cin>>size;
pageList.resize(size, -1);
}
// 输入作业序列
void getItemList(){
... | 16.875 | 90 | 0.592256 | [
"vector"
] |
8532b1af48f7d486b95929687b6d4ab4c4bb67c6 | 1,096 | cpp | C++ | test/BatteryTest.cpp | leetnz/bittleet | 08e38e78cbc9ace83e494b53a7dba0979d2107e1 | [
"MIT"
] | 1 | 2022-01-15T21:05:57.000Z | 2022-01-15T21:05:57.000Z | test/BatteryTest.cpp | leetnz/bittleet | 08e38e78cbc9ace83e494b53a7dba0979d2107e1 | [
"MIT"
] | 1 | 2021-11-12T03:28:07.000Z | 2021-11-12T03:28:07.000Z | test/BatteryTest.cpp | leetnz/Bittleet | 08e38e78cbc9ace83e494b53a7dba0979d2107e1 | [
"MIT"
] | null | null | null | //
// Battery Tests
//
// Hoani Bryson (github.com/hoani)
// Copyright (c) 2021 Leetware Limited.
// License - MIT
//
#include "catch.hpp"
#include <vector>
#include "Arduino.h"
#include "state/Battery.h"
#include "state/Status.h"
using namespace Battery;
TEST_CASE("State", "[Battery]" )
{
struct TestCase ... | 24.909091 | 80 | 0.604015 | [
"vector"
] |
854be01a949e831e28f10c8b6ccea4e7492aa257 | 11,035 | cpp | C++ | PIPS-NLP/Test/parleastsquares.cpp | jalving/PIPS | 62f664237447c7ce05a62552952c86003d90e68f | [
"BSD-3-Clause-LBNL"
] | 65 | 2016-02-04T18:03:39.000Z | 2022-03-24T08:59:38.000Z | PIPS-NLP/Test/parleastsquares.cpp | jalving/PIPS | 62f664237447c7ce05a62552952c86003d90e68f | [
"BSD-3-Clause-LBNL"
] | 34 | 2015-11-17T04:26:51.000Z | 2020-09-24T16:00:22.000Z | PIPS-NLP/Test/parleastsquares.cpp | jalving/PIPS | 62f664237447c7ce05a62552952c86003d90e68f | [
"BSD-3-Clause-LBNL"
] | 26 | 2015-10-15T20:27:52.000Z | 2021-07-14T08:13:34.000Z | #include "./Drivers/parallelPipsNlp_C_Callback.h"
#include "mpi.h"
#include "global_var.h"
#include <iostream>
#include <cassert>
#include <cmath>
#include <cstdlib>
#ifdef TIMING
double timeFromAMPL;
double probGenTime;
double PartSolver_GenTime;
double PartSolver_SolTime;
double PartSolver_FactTime;
int... | 33.849693 | 86 | 0.60299 | [
"mesh"
] |
8556ba8db3ba93ec319ee96df525a2f78d34bf11 | 2,514 | cc | C++ | LeetCode/MS Prep/spiralMatrix.cc | ChakreshSinghUC/CPPCodes | d82a3f467303566afbfcc927b660b0f7bf7c0432 | [
"MIT"
] | null | null | null | LeetCode/MS Prep/spiralMatrix.cc | ChakreshSinghUC/CPPCodes | d82a3f467303566afbfcc927b660b0f7bf7c0432 | [
"MIT"
] | null | null | null | LeetCode/MS Prep/spiralMatrix.cc | ChakreshSinghUC/CPPCodes | d82a3f467303566afbfcc927b660b0f7bf7c0432 | [
"MIT"
] | null | null | null | // https://leetcode.com/problems/spiral-matrix/
// Given an m x n matrix, return all elements of the matrix in spiral order.
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
int numberOfElements = matrix.size() * mat... | 27.626374 | 95 | 0.324582 | [
"vector"
] |
8563aa8b4b465bf02340a39b7c7c74940c070e1e | 1,533 | cpp | C++ | 02/tests.cpp | wtrsltnk/adventofcode17 | 13ba6bd3a64413973971134ae17465029a884933 | [
"MIT"
] | 1 | 2017-12-06T08:00:35.000Z | 2017-12-06T08:00:35.000Z | 02/tests.cpp | wtrsltnk/adventofcode17 | 13ba6bd3a64413973971134ae17465029a884933 | [
"MIT"
] | null | null | null | 02/tests.cpp | wtrsltnk/adventofcode17 | 13ba6bd3a64413973971134ae17465029a884933 | [
"MIT"
] | null | null | null |
#include "library.h"
#define CATCH_CONFIG_FAST_COMPILE
#define CATCH_CONFIG_MAIN
#include <catch.hpp>
#include <sstream>
// readAsVectorOfVectorOfInt
TEST_CASE("readAsVectorOfVectorOfInt should work", "[day2]")
{
std::stringstream input("5 1 9 5\n7 5 3\n2 4 6 8");
auto result = readAsVectorOfVectorOfInt(inpu... | 30.058824 | 83 | 0.692759 | [
"vector"
] |
856660fd706262a505a6a1eed69735416a41c24a | 4,141 | cpp | C++ | n_queens/main.cpp | phoenix-zero/SFML-Projects | 66c35c495b89141dbd820ab86ccbae3317b8da27 | [
"MIT"
] | null | null | null | n_queens/main.cpp | phoenix-zero/SFML-Projects | 66c35c495b89141dbd820ab86ccbae3317b8da27 | [
"MIT"
] | null | null | null | n_queens/main.cpp | phoenix-zero/SFML-Projects | 66c35c495b89141dbd820ab86ccbae3317b8da27 | [
"MIT"
] | null | null | null | #include <SFML/Graphics.hpp>
#include <bits/stdc++.h>
#include <ctime>
#include <unistd.h>
const unsigned int SIZE = 50;
class ChessBoard
{
std::vector<std::pair<size_t,size_t>> queens;
sf::RenderWindow window;
size_t n;
sf::Image image;
void addQueen(size_t c,size_t r);
void removeQueen();
... | 26.044025 | 114 | 0.487322 | [
"vector"
] |
8566f4539c53a28ecd56eedbd9ce57a75468a1d4 | 339 | cpp | C++ | solutions/1403.minimum-subsequence-in-non-increasing-order.331212935.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | 78 | 2020-10-22T11:31:53.000Z | 2022-02-22T13:27:49.000Z | solutions/1403.minimum-subsequence-in-non-increasing-order.331212935.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | null | null | null | solutions/1403.minimum-subsequence-in-non-increasing-order.331212935.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | 26 | 2020-10-23T15:10:44.000Z | 2021-11-07T16:13:50.000Z | class Solution {
public:
vector<int> minSubsequence(vector<int> &nums) {
int sum = accumulate(nums.begin(), nums.end(), 0);
sort(nums.rbegin(), nums.rend());
int s = 0;
vector<int> ans;
for (int a : nums) {
ans.push_back(a);
s += a;
if (s > sum - s)
return ans;
}
... | 18.833333 | 54 | 0.516224 | [
"vector"
] |
85701bd9cca76a7d70391cef47ad906820ec8f3c | 1,090 | cpp | C++ | algorithm/hw18.cpp | scott306lr/coding_exercise | 2bca11a1e68b468d6c5422f8cec2eb9e090664f7 | [
"MIT"
] | null | null | null | algorithm/hw18.cpp | scott306lr/coding_exercise | 2bca11a1e68b468d6c5422f8cec2eb9e090664f7 | [
"MIT"
] | null | null | null | algorithm/hw18.cpp | scott306lr/coding_exercise | 2bca11a1e68b468d6c5422f8cec2eb9e090664f7 | [
"MIT"
] | null | null | null | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef pair<int,int> pii;
vector<int> adj[int(1e5+10)], adjT[int(1e5+10)];
bool rec[int(1e5+10)];
int fin[int(1e5+10)];
int top=0;
int dfsCnt(int u){
rec[u]=true;
int Largest=0;
for(auto a: adjT[u]){
if(!rec[a]) Largest += dfsCnt(a);... | 14.931507 | 48 | 0.533028 | [
"vector"
] |
857d6e5f5b18e0bc8a7be0da7a0fab7c8df00306 | 48,948 | cxx | C++ | Reconstruction.cxx | marcelkunze/trackml | 0638f1389ef5e63a066551e36a6479975335bc27 | [
"MIT"
] | 3 | 2019-07-08T20:48:14.000Z | 2020-09-19T14:54:56.000Z | Reconstruction.cxx | marcelkunze/trackml | 0638f1389ef5e63a066551e36a6479975335bc27 | [
"MIT"
] | null | null | null | Reconstruction.cxx | marcelkunze/trackml | 0638f1389ef5e63a066551e36a6479975335bc27 | [
"MIT"
] | 2 | 2019-07-08T20:31:54.000Z | 2019-07-12T12:14:09.000Z | // Neural Network based path reconstruction
// M.Kunze, Heidelberg University, 2018
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include "Parameters.h"
#include "Reconstruction.h"
#include "PolarModule.h"
#ifdef USETMVA
#ifdef TMVAREADER
#include "TMVA/Tools.h"
#include "TMVA/Reader.h"
#end... | 32.632 | 518 | 0.518448 | [
"vector",
"model"
] |
8581362423a113ae75d076df71f980ab4af80810 | 1,589 | hpp | C++ | src/obstacle_detection/point_histogram.hpp | cogsys-tuebingen/csapex_generic_obstacle_detection | bf076db25030bca76b2dc87248937f3d5a0db748 | [
"BSD-3-Clause"
] | 14 | 2017-06-15T02:01:04.000Z | 2022-01-08T09:57:04.000Z | src/obstacle_detection/point_histogram.hpp | jiaquan301/csapex_generic_obstacle_detection | bf076db25030bca76b2dc87248937f3d5a0db748 | [
"BSD-3-Clause"
] | 2 | 2019-05-14T14:24:10.000Z | 2019-05-26T08:41:22.000Z | src/obstacle_detection/point_histogram.hpp | jiaquan301/csapex_generic_obstacle_detection | bf076db25030bca76b2dc87248937f3d5a0db748 | [
"BSD-3-Clause"
] | 13 | 2017-07-25T01:05:10.000Z | 2021-12-07T09:19:15.000Z | /// HEADER
#include "point_histogram.h"
/// SYSTEM
#include <limits>
using namespace csapex;
namespace od {
template <class PointT>
bool sortPts(const std::pair<PointT, unsigned>& a, const std::pair<PointT, unsigned>& b) {
return a.first.z < b.first.z;
}
}
template <class PointT>
PointHistogram<PointT>::PointHi... | 23.716418 | 90 | 0.615481 | [
"vector"
] |
3feddc3dff5dfccc7d6fd8a1fd896e29b5130b79 | 939 | cc | C++ | middle-end-optis/superblock-cloning/src/lib/cloner.cc | obs145628/cle | 4a4a18b2ab5a6fbf26629f6845147541edabd7c9 | [
"MIT"
] | null | null | null | middle-end-optis/superblock-cloning/src/lib/cloner.cc | obs145628/cle | 4a4a18b2ab5a6fbf26629f6845147541edabd7c9 | [
"MIT"
] | null | null | null | middle-end-optis/superblock-cloning/src/lib/cloner.cc | obs145628/cle | 4a4a18b2ab5a6fbf26629f6845147541edabd7c9 | [
"MIT"
] | null | null | null | #include "cloner.hh"
Instruction &Cloner::clone_ins(Instruction &ins, BasicBlock &bb_pos,
ins_iterator_t insert_pos) {
auto ops = _map(ins.ops());
Instruction &res = *bb_pos.insert_ins(insert_pos, ins.get_opname(), ops, "",
ins.get_def_idx())... | 24.076923 | 78 | 0.593184 | [
"vector"
] |
3ff62d072167c11b6c6af5533f75ef194bcd0d4a | 7,120 | hpp | C++ | include/nix/Hydra.hpp | balint42/nix | 50f1de33b946b7b194c82fb0efd9b0cecba9ed54 | [
"BSD-4-Clause",
"BSD-3-Clause"
] | 53 | 2015-02-10T01:04:34.000Z | 2021-04-24T14:26:04.000Z | include/nix/Hydra.hpp | balint42/nix | 50f1de33b946b7b194c82fb0efd9b0cecba9ed54 | [
"BSD-4-Clause",
"BSD-3-Clause"
] | 262 | 2015-01-09T13:24:21.000Z | 2021-07-02T13:45:31.000Z | include/nix/Hydra.hpp | gicmo/nix | 17a5b90e6c12a22e921c181b79eb2a3db1bf61af | [
"BSD-3-Clause"
] | 34 | 2015-03-27T16:41:14.000Z | 2020-03-27T06:47:59.000Z | // Copyright © 2013,2014 German Neuroinformatics Node (G-Node)
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted under the terms of the BSD License. See
// LICENSE file in the root of the Project.
//
// Author: Christian Kellner <kellner@b... | 24.982456 | 95 | 0.62809 | [
"shape",
"vector"
] |
3fffdb92f11da30f171def6c1fb890446da868fb | 1,690 | hpp | C++ | include/gaia/ReactThread.hpp | chenzd123456/Gaia | f821052eba83e2494df686ffb3dabf31b410970c | [
"MIT"
] | null | null | null | include/gaia/ReactThread.hpp | chenzd123456/Gaia | f821052eba83e2494df686ffb3dabf31b410970c | [
"MIT"
] | null | null | null | include/gaia/ReactThread.hpp | chenzd123456/Gaia | f821052eba83e2494df686ffb3dabf31b410970c | [
"MIT"
] | null | null | null | #ifndef __GAIA_REACTTHREAD_H__
#define __GAIA_REACTTHREAD_H__
#include <exception>
#include <functional>
#include <thread>
#include "BlockQueue.hpp"
namespace gaia {
/**
* @brief 可复用的线程。
* 内部维护一个任务队列，可以设置任务队列的最大任务数
*/
class ReactThread {
private:
/**
* @brief 用于终止线程
* 当线程内抛出 ReactThreadStop 异常，线程终止。
... | 18.172043 | 71 | 0.588166 | [
"object"
] |
b20c17b09de510fcaf7e12f3ffc736877dc53457 | 3,738 | cc | C++ | tests/cpp/plugin/test_federated_server.cc | asprasad/xgboost | bb47fd8c496ccd25e6499f722f0d9f2ee3965500 | [
"Apache-2.0"
] | null | null | null | tests/cpp/plugin/test_federated_server.cc | asprasad/xgboost | bb47fd8c496ccd25e6499f722f0d9f2ee3965500 | [
"Apache-2.0"
] | 1 | 2022-02-01T16:14:41.000Z | 2022-02-01T16:14:41.000Z | tests/cpp/plugin/test_federated_server.cc | asprasad/xgboost | bb47fd8c496ccd25e6499f722f0d9f2ee3965500 | [
"Apache-2.0"
] | null | null | null | /*!
* Copyright 2017-2020 XGBoost contributors
*/
#include <grpcpp/server_builder.h>
#include <gtest/gtest.h>
#include <thread>
#include "federated_client.h"
#include "federated_server.h"
namespace xgboost {
class FederatedServerTest : public ::testing::Test {
public:
static void VerifyAllgather(int rank) {
... | 28.534351 | 100 | 0.680578 | [
"vector"
] |
b2171465717c07c631ac879c6f4c3d41e248477a | 852 | cpp | C++ | 102-binary-tree-level-order-traversal/102-binary-tree-level-order-traversal.cpp | SouvikChan/-Leetcode_Souvik | cc4b72cb4a14a1c6b8be8bd8390de047443fe008 | [
"MIT"
] | null | null | null | 102-binary-tree-level-order-traversal/102-binary-tree-level-order-traversal.cpp | SouvikChan/-Leetcode_Souvik | cc4b72cb4a14a1c6b8be8bd8390de047443fe008 | [
"MIT"
] | null | null | null | 102-binary-tree-level-order-traversal/102-binary-tree-level-order-traversal.cpp | SouvikChan/-Leetcode_Souvik | cc4b72cb4a14a1c6b8be8bd8390de047443fe008 | [
"MIT"
] | null | null | null | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... | 28.4 | 93 | 0.552817 | [
"vector"
] |
b2196c9b8e7614def256f9a0e7d5ae7153527145 | 2,614 | hpp | C++ | stan/math/prim/err/check_consistent_sizes_mvt.hpp | LaudateCorpus1/math | 990a66b3cccd27a5fd48626360bb91093a48278b | [
"BSD-3-Clause"
] | 1 | 2020-06-14T14:33:37.000Z | 2020-06-14T14:33:37.000Z | stan/math/prim/err/check_consistent_sizes_mvt.hpp | LaudateCorpus1/math | 990a66b3cccd27a5fd48626360bb91093a48278b | [
"BSD-3-Clause"
] | null | null | null | stan/math/prim/err/check_consistent_sizes_mvt.hpp | LaudateCorpus1/math | 990a66b3cccd27a5fd48626360bb91093a48278b | [
"BSD-3-Clause"
] | 1 | 2020-05-10T12:55:07.000Z | 2020-05-10T12:55:07.000Z | #ifndef STAN_MATH_PRIM_ERR_CHECK_CONSISTENT_SIZES_MVT_HPP
#define STAN_MATH_PRIM_ERR_CHECK_CONSISTENT_SIZES_MVT_HPP
#include <stan/math/prim/err/invalid_argument.hpp>
#include <stan/math/prim/fun/size.hpp>
#include <stan/math/prim/meta/is_vector.hpp>
#include <algorithm>
#include <sstream>
#include <string>
namespace... | 35.808219 | 80 | 0.663351 | [
"vector"
] |
b21cd9a5dc15c76a8467da43097ada9ea6246c93 | 1,043 | cpp | C++ | chapter06/ex04_Name_value.cpp | ClassAteam/stroustrup-ppp | ea9e85d4ea9890038eb5611c3bc82734c8706ce7 | [
"MIT"
] | 124 | 2018-06-23T10:16:56.000Z | 2022-03-19T15:16:12.000Z | chapter06/ex04_Name_value.cpp | therootfolder/stroustrup-ppp | b1e936c9a67b9205fdc9712c42496b45200514e2 | [
"MIT"
] | 23 | 2018-02-08T20:57:46.000Z | 2021-10-08T13:58:29.000Z | chapter06/ex04_Name_value.cpp | ClassAteam/stroustrup-ppp | ea9e85d4ea9890038eb5611c3bc82734c8706ce7 | [
"MIT"
] | 65 | 2019-05-27T03:05:56.000Z | 2022-03-26T03:43:05.000Z | #include "../text_lib/std_lib_facilities.h"
class Name_value {
public:
string name;
int value;
Name_value(string n, int v)
:name(n), value(v) { }
};
int main()
{
// Accept name value pairs, store them in vectors, print them in the end.
vector<Name_value> record;
... | 22.191489 | 77 | 0.457335 | [
"vector"
] |
b221cc4547258223c1169ac44f8ed016fd35775c | 646 | cpp | C++ | FESTIVAL/Scaachan_2.cpp | Yunhyunjo/Advanced-Algorithm-Study | 55a7a548a09d5ca7398a494fb54f0db5fff38358 | [
"MIT"
] | 9 | 2021-01-06T04:17:37.000Z | 2021-01-11T12:44:47.000Z | FESTIVAL/Scaachan_2.cpp | Yunhyunjo/Advanced-Algorithm-Study | 55a7a548a09d5ca7398a494fb54f0db5fff38358 | [
"MIT"
] | 115 | 2022-01-13T07:37:23.000Z | 2022-03-13T14:09:15.000Z | FESTIVAL/Scaachan_2.cpp | Yunhyunjo/Advanced-Algorithm-Study | 55a7a548a09d5ca7398a494fb54f0db5fff38358 | [
"MIT"
] | 8 | 2021-01-09T16:46:48.000Z | 2021-01-24T01:13:48.000Z | #include <bits/stdc++.h>
#define endl '\n'
#define rep(V,S,T) for(int V=S; V<T; ++V)
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int TC; cin >> TC;
while (TC--) {
int N, L; cin >> N >> L;
vector<int> fee(1000), sum(1000);
rep(i, 0, N) cin >> fee[i]; // end of input
... | 19 | 52 | 0.518576 | [
"vector"
] |
b22a0430a52fc711aa686ea5d2651e3812c16fa0 | 27,014 | hpp | C++ | src/Core/Geometry/trianglekdtree.hpp | sylvaindeker/Radium-Engine | 64164a258b3f7864c73a07c070e49b7138488d62 | [
"Apache-2.0"
] | 1 | 2018-04-16T13:55:45.000Z | 2018-04-16T13:55:45.000Z | src/Core/Geometry/trianglekdtree.hpp | sylvaindeker/Radium-Engine | 64164a258b3f7864c73a07c070e49b7138488d62 | [
"Apache-2.0"
] | null | null | null | src/Core/Geometry/trianglekdtree.hpp | sylvaindeker/Radium-Engine | 64164a258b3f7864c73a07c070e49b7138488d62 | [
"Apache-2.0"
] | null | null | null | #ifndef TRIANGLEKDTREE_H
#define TRIANGLEKDTREE_H
#include "Core/Math/bbox.hpp"
#include "Eigen/Core"
#include "Core/Geometry/TriangleMesh.hpp"
#include "Core/Geometry/Triangle/TriangleOperation.hpp"
#include "Core/Geometry/Distance/DistanceQueries.hpp"
#include <iostream>
#include <limits>
#include <numeric>
//... | 38.702006 | 100 | 0.449767 | [
"geometry",
"vector"
] |
b23132a9bbbff430230a720360f584b6a50978ae | 1,156 | hh | C++ | src/Kernel/KernelTraits.hh | jmikeowen/Spheral | 3e1082a7aefd6b328bd3ae24ca1a477108cfc3c4 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 22 | 2018-07-31T21:38:22.000Z | 2020-06-29T08:58:33.000Z | src/Kernel/KernelTraits.hh | markguozhiming/spheral | bbb982102e61edb8a1d00cf780bfa571835e1b61 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 41 | 2020-09-28T23:14:27.000Z | 2022-03-28T17:01:33.000Z | src/Kernel/KernelTraits.hh | markguozhiming/spheral | bbb982102e61edb8a1d00cf780bfa571835e1b61 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 7 | 2019-12-01T07:00:06.000Z | 2020-09-15T21:12:39.000Z | //---------------------------------Spheral++----------------------------------//
// KernelTraits -- trait class for dimensional type information.
//
// Created by JMO, Mon Nov 29 21:51:58 PST 1999
//----------------------------------------------------------------------------//
#ifndef KERNELTRAITS_HH
#define KERNELTRA... | 22.666667 | 80 | 0.621972 | [
"geometry",
"3d"
] |
b234bfa25500e9c9b2a4a82c3df1fede9b4b72fd | 859 | cpp | C++ | solutions/__202_codeforces169_div2c.cpp | peanutzhen/leetcode | aa7c5f4741427e8de379f32495d4a3200f6e3ba6 | [
"MIT"
] | 2 | 2021-09-15T09:39:32.000Z | 2022-01-31T18:40:26.000Z | solutions/__202_codeforces169_div2c.cpp | peanutzhen/leetcode | aa7c5f4741427e8de379f32495d4a3200f6e3ba6 | [
"MIT"
] | null | null | null | solutions/__202_codeforces169_div2c.cpp | peanutzhen/leetcode | aa7c5f4741427e8de379f32495d4a3200f6e3ba6 | [
"MIT"
] | null | null | null | /*
* Author: peanutzhen
* Created time: 2021/8/24 22:03:59
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q, l, r;
cin >> n >> q;
// ai <= 2 * 1e5 cnti <= 2 * 1e5
// 不能用int去存 否则 ai * cnti overflowed.
vector... | 19.976744 | 55 | 0.452852 | [
"vector"
] |
b245cf66c8850c31388c9e4b1bd3cad3413ce79c | 4,199 | cpp | C++ | B2G/gecko/widget/xpwidgets/nsClipboardHelper.cpp | wilebeast/FireFox-OS | 43067f28711d78c429a1d6d58c77130f6899135f | [
"Apache-2.0"
] | 3 | 2015-08-31T15:24:31.000Z | 2020-04-24T20:31:29.000Z | B2G/gecko/widget/xpwidgets/nsClipboardHelper.cpp | wilebeast/FireFox-OS | 43067f28711d78c429a1d6d58c77130f6899135f | [
"Apache-2.0"
] | null | null | null | B2G/gecko/widget/xpwidgets/nsClipboardHelper.cpp | wilebeast/FireFox-OS | 43067f28711d78c429a1d6d58c77130f6899135f | [
"Apache-2.0"
] | 3 | 2015-07-29T07:17:15.000Z | 2020-11-04T06:55:37.000Z | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*-
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "nsClipboardHelper.h"
//... | 33.062992 | 82 | 0.66754 | [
"object"
] |
b255eaeef6c3ef057377fb65075cd79f5a19aba2 | 12,299 | cpp | C++ | source/nmt/Decoder.cpp | ishine/NiuTrans.NMT | f3ef9094a7c6e282e30f3057373fe154ed95acdc | [
"Apache-2.0"
] | null | null | null | source/nmt/Decoder.cpp | ishine/NiuTrans.NMT | f3ef9094a7c6e282e30f3057373fe154ed95acdc | [
"Apache-2.0"
] | null | null | null | source/nmt/Decoder.cpp | ishine/NiuTrans.NMT | f3ef9094a7c6e282e30f3057373fe154ed95acdc | [
"Apache-2.0"
] | null | null | null | /* NiuTrans.NMT - an open-source neural machine translation system.
* Copyright (C) 2020 NiuTrans Research. 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
*
* h... | 28.870892 | 106 | 0.610131 | [
"model"
] |
b267b9de1daf6b77a0cf4e5915516af9566dd533 | 2,216 | cc | C++ | node_modules/re2/lib/addon.cc | professorbashorun/jaw-parser | be8099c4f1dbb154bb3929453c1a4c3dc4157443 | [
"MIT"
] | null | null | null | node_modules/re2/lib/addon.cc | professorbashorun/jaw-parser | be8099c4f1dbb154bb3929453c1a4c3dc4157443 | [
"MIT"
] | null | null | null | node_modules/re2/lib/addon.cc | professorbashorun/jaw-parser | be8099c4f1dbb154bb3929453c1a4c3dc4157443 | [
"MIT"
] | null | null | null | #include "./wrapped_re2.h"
#include <node_buffer.h>
using v8::FunctionTemplate;
using v8::Integer;
using v8::Local;
using v8::ObjectTemplate;
using v8::String;
Nan::Persistent<Function> WrappedRE2::constructor;
static NAN_METHOD(GetUtf8Length) {
String::Value s(info[0]->ToString());
info.GetReturnValue().Set(s... | 29.945946 | 100 | 0.721119 | [
"object"
] |
b269a156e4d58bd1c355ce951ed2cfb2a65f9d34 | 1,447 | cpp | C++ | BlackVision/LibBlackVision/Source/Engine/Models/Lights/HelperModelLights.cpp | black-vision-engine/bv-engine | 85089d41bb22afeaa9de070646e12aa1777ecedf | [
"MIT"
] | 1 | 2022-01-28T11:43:47.000Z | 2022-01-28T11:43:47.000Z | BlackVision/LibBlackVision/Source/Engine/Models/Lights/HelperModelLights.cpp | black-vision-engine/bv-engine | 85089d41bb22afeaa9de070646e12aa1777ecedf | [
"MIT"
] | null | null | null | BlackVision/LibBlackVision/Source/Engine/Models/Lights/HelperModelLights.cpp | black-vision-engine/bv-engine | 85089d41bb22afeaa9de070646e12aa1777ecedf | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "HelperModelLights.h"
#include "Engine/Models/Lights/ModelDirectionalLight.h"
#include "Engine/Models/Lights/ModelPointLight.h"
#include "Engine/Models/Lights/ModelSpotLight.h"
#include "Serialization/SerializationHelper.h"
#include "Serialization/SerializationHelper.inl"
... | 20.971014 | 133 | 0.602626 | [
"model"
] |
05d925ff47e5188a3f7e56b618b906df022b4fd6 | 5,290 | hpp | C++ | src/lib/coordination/geometry.hpp | bitslow/fcpp | abdaed70ccedb1a377e24d3b7c78b2ec203e111f | [
"ECL-2.0",
"Apache-2.0"
] | 3 | 2020-05-03T15:53:22.000Z | 2020-11-30T12:14:01.000Z | src/lib/coordination/geometry.hpp | bitslow/fcpp | abdaed70ccedb1a377e24d3b7c78b2ec203e111f | [
"ECL-2.0",
"Apache-2.0"
] | 4 | 2021-05-17T16:46:22.000Z | 2021-12-22T15:12:22.000Z | src/lib/coordination/geometry.hpp | bitslow/fcpp | abdaed70ccedb1a377e24d3b7c78b2ec203e111f | [
"ECL-2.0",
"Apache-2.0"
] | 7 | 2020-05-08T11:47:57.000Z | 2022-01-15T21:28:10.000Z | // Copyright © 2021 Giorgio Audrito. All Rights Reserved.
/**
* @file geometry.hpp
* @brief Collection of field calculus utility functions.
*/
#ifndef FCPP_COORDINATION_GEOMETRY_H_
#define FCPP_COORDINATION_GEOMETRY_H_
#include <algorithm>
#include "lib/coordination/utils.hpp"
#include "lib/data/vec.hpp"
/**
... | 40.381679 | 144 | 0.698299 | [
"geometry"
] |
05da70b77cffc92edad830972ba031cc88ecb376 | 440 | hpp | C++ | source/problem/Green-Naghdi/discretization_EHDG/boundary_conditions/ehdg_gn_bc_tide.hpp | elenabac/dgswemv2 | ecc776811de304cbae7bfa696b3d22c513e7d4de | [
"MIT"
] | null | null | null | source/problem/Green-Naghdi/discretization_EHDG/boundary_conditions/ehdg_gn_bc_tide.hpp | elenabac/dgswemv2 | ecc776811de304cbae7bfa696b3d22c513e7d4de | [
"MIT"
] | null | null | null | source/problem/Green-Naghdi/discretization_EHDG/boundary_conditions/ehdg_gn_bc_tide.hpp | elenabac/dgswemv2 | ecc776811de304cbae7bfa696b3d22c513e7d4de | [
"MIT"
] | null | null | null | #ifndef EHDG_GN_BC_TIDE_HPP
#define EHDG_GN_BC_TIDE_HPP
namespace GN {
namespace EHDG {
namespace BC {
class Tide : public SWE_SIM::BC::Tide {
public:
Tide() = default;
Tide(const std::vector<SWE::TideNode>& tide_input) : SWE_SIM::BC::Tide(tide_input) {}
template <typename StepperType, typename EdgeBoun... | 22 | 92 | 0.734091 | [
"vector"
] |
05df5120222985e98669b39e93d6244a6a676f56 | 16,150 | cpp | C++ | lib/Target/AArch64/AArch64LegalizerInfo.cpp | vangthao95/llvm | 7161a90f679d8d52ab57a3166361a7ebd1ba5459 | [
"Apache-2.0"
] | 115 | 2018-02-01T18:56:44.000Z | 2022-03-21T13:23:00.000Z | FRProtector/lib/Target/AArch64/AArch64LegalizerInfo.cpp | whucs303/randomizationlib | 07a1f495e1cf878ad9dd4c79b7ff1c6b48cff876 | [
"MIT"
] | 27 | 2018-09-17T17:49:49.000Z | 2021-11-03T04:31:51.000Z | FRProtector/lib/Target/AArch64/AArch64LegalizerInfo.cpp | whucs303/randomizationlib | 07a1f495e1cf878ad9dd4c79b7ff1c6b48cff876 | [
"MIT"
] | 55 | 2018-02-01T07:11:49.000Z | 2022-03-04T01:20:23.000Z | //===- AArch64LegalizerInfo.cpp ----------------------------------*- C++ -*-==//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... | 35.339168 | 80 | 0.651703 | [
"vector"
] |
05e0275fde9ee708bbba6d7b681a70766630a95b | 702 | cpp | C++ | CodeFights/setUnion.cpp | AREA44/competitive-programming | 00cede478685bf337193bce4804f13c4ff170903 | [
"MIT"
] | null | null | null | CodeFights/setUnion.cpp | AREA44/competitive-programming | 00cede478685bf337193bce4804f13c4ff170903 | [
"MIT"
] | null | null | null | CodeFights/setUnion.cpp | AREA44/competitive-programming | 00cede478685bf337193bce4804f13c4ff170903 | [
"MIT"
] | null | null | null | // Apply union operation to the given sets of integers.
// Sets may contain duplicate elements.
// Example
// * For A = [1, 1] and B = [1, 1, 1], the output should be
// setUnion(A, B) = [1, 1, 1].
std::vector<int> setUnion(std::vector<int> A, std::vector<int> B) {
int pos_b = 0;
std::sort(A.begin(), A.end());
... | 21.9375 | 67 | 0.539886 | [
"vector"
] |
05e9e5474630ae726e0457402cf35f28ebfd251a | 7,240 | cc | C++ | SgtCore/PowerToolsSupport.cc | dexterurbane/SmartGridToolbox | ff2eb98e28b0c0ea9690ec6f522ccf1c306f79b7 | [
"Apache-2.0"
] | null | null | null | SgtCore/PowerToolsSupport.cc | dexterurbane/SmartGridToolbox | ff2eb98e28b0c0ea9690ec6f522ccf1c306f79b7 | [
"Apache-2.0"
] | null | null | null | SgtCore/PowerToolsSupport.cc | dexterurbane/SmartGridToolbox | ff2eb98e28b0c0ea9690ec6f522ccf1c306f79b7 | [
"Apache-2.0"
] | null | null | null | // Copyright 2015 National ICT Australia Limited (NICTA)
//
// 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 appl... | 33.99061 | 118 | 0.492818 | [
"model"
] |
05f3fe90d022e8004edf636ec67c8179becff2e8 | 965 | cpp | C++ | cmdstan/stan/lib/stan_math/test/unit/math/prim/mat/fun/array_builder_test.cpp | yizhang-cae/torsten | dc82080ca032325040844cbabe81c9a2b5e046f9 | [
"BSD-3-Clause"
] | null | null | null | cmdstan/stan/lib/stan_math/test/unit/math/prim/mat/fun/array_builder_test.cpp | yizhang-cae/torsten | dc82080ca032325040844cbabe81c9a2b5e046f9 | [
"BSD-3-Clause"
] | null | null | null | cmdstan/stan/lib/stan_math/test/unit/math/prim/mat/fun/array_builder_test.cpp | yizhang-cae/torsten | dc82080ca032325040844cbabe81c9a2b5e046f9 | [
"BSD-3-Clause"
] | null | null | null | #include <stan/math/prim/mat.hpp>
#include <gtest/gtest.h>
using std::vector;
using Eigen::Dynamic;
using Eigen::Matrix;
using stan::math::array_builder;
using stan::math::to_matrix;
using stan::math::to_row_vector;
TEST(MathMatrix,arrayBuilder) {
vector<Matrix<double, 1, Dynamic> > mEmpty
= array_builder<Matr... | 23.536585 | 59 | 0.655959 | [
"vector"
] |
05f44c6b467633b1965f77735fd13837c0ca82bd | 1,168 | cpp | C++ | ch4/c04t02.cpp | doomydot/PPPUCPP2nd | a97bc600029ad8ee7a45d0fe5a572970c784d08a | [
"MIT"
] | null | null | null | ch4/c04t02.cpp | doomydot/PPPUCPP2nd | a97bc600029ad8ee7a45d0fe5a572970c784d08a | [
"MIT"
] | null | null | null | ch4/c04t02.cpp | doomydot/PPPUCPP2nd | a97bc600029ad8ee7a45d0fe5a572970c784d08a | [
"MIT"
] | null | null | null | //c04t02
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
constexpr double yen_per_dollar = 113.95;
constexpr double euro_per_dollar = 0.89;
constexpr double pounds_per_dollar = 0.74;
constexpr double kroner_per_dollar = 9;
constexpr double yuan_per_do... | 22.461538 | 106 | 0.559075 | [
"vector"
] |
05f5e5fcc1a29cd084b0efdcdbf4e1a77da46f58 | 7,944 | cpp | C++ | main.cpp | CakeWithSteak/fpf | e3a48478215a5b8623f0df76f730534b545ae9c3 | [
"MIT"
] | null | null | null | main.cpp | CakeWithSteak/fpf | e3a48478215a5b8623f0df76f730534b545ae9c3 | [
"MIT"
] | null | null | null | main.cpp | CakeWithSteak/fpf | e3a48478215a5b8623f0df76f730534b545ae9c3 | [
"MIT"
] | null | null | null | #include <iostream>
#include <thread>
#include "Rendering/Window.h"
#include "Rendering/Renderer.h"
#include "utils/Viewport.h"
#include "utils/Timer.h"
#include "Compilation/compileExpression.h"
#include "Computation/runtime_template.h"
#include "cli.h"
#include "controls.h"
#include "utils/serialization.h"
#include "... | 45.136364 | 166 | 0.59567 | [
"render"
] |
05f70dd3b4117607fe435e88e0aecb0b8c9f17eb | 1,544 | cpp | C++ | src/lava_lib/reader_bgeo/ops/cookSphere.cpp | cinepost/Falcor | f70bd1d97c064d6f91a017d4409aa2037fd6903a | [
"BSD-3-Clause"
] | 7 | 2018-09-25T23:45:52.000Z | 2021-07-07T04:08:01.000Z | src/lava_lib/reader_bgeo/ops/cookSphere.cpp | cinepost/Falcor | f70bd1d97c064d6f91a017d4409aa2037fd6903a | [
"BSD-3-Clause"
] | 2 | 2021-03-02T10:16:06.000Z | 2021-08-13T10:10:21.000Z | src/lava_lib/reader_bgeo/ops/cookSphere.cpp | cinepost/Lava | f70bd1d97c064d6f91a017d4409aa2037fd6903a | [
"BSD-3-Clause"
] | 3 | 2020-06-07T05:47:48.000Z | 2020-10-03T12:34:54.000Z | /*
* Copyright 2018 Laika, LLC. Authored by Peter Stuart
*
* Licensed under the Apache License, Version 2.0, <LICENSE-APACHE or
* http://apache.org/licenses/LICENSE-2.0> or the MIT license <LICENSE-MIT or
* http://opensource.org/licenses/MIT>, at your option. This file may not be
* copied, modified, or distr... | 27.087719 | 85 | 0.704016 | [
"geometry"
] |
af036105b05a65a89713e159f99ee8ddd1575626 | 1,793 | hpp | C++ | include/emu/stack.hpp | nfsu/emu | b0e24d39d51797306f5e336786eccd48b42bc1f8 | [
"MIT"
] | null | null | null | include/emu/stack.hpp | nfsu/emu | b0e24d39d51797306f5e336786eccd48b42bc1f8 | [
"MIT"
] | null | null | null | include/emu/stack.hpp | nfsu/emu | b0e24d39d51797306f5e336786eccd48b42bc1f8 | [
"MIT"
] | null | null | null | #pragma once
#include "types/types.hpp"
namespace emu {
//The stack class; taking a type T (can even be floats)
//AddressSpace is the type for the address space
//This is an interface for how stacks work in low-level architectures and doesn't provide memory management
//If ascending = true, the stack pointer will... | 25.985507 | 143 | 0.659788 | [
"object"
] |
af05a604269084bcd59f978313e8e043e9ebed42 | 19,234 | cpp | C++ | Cube.cpp | chuckwolber/Cube | 56aae900c3c0c866940cade9d814c3fc7281ec33 | [
"MIT"
] | 2 | 2021-04-09T18:11:35.000Z | 2022-02-12T18:12:10.000Z | Cube.cpp | chuckwolber/Cube | 56aae900c3c0c866940cade9d814c3fc7281ec33 | [
"MIT"
] | 5 | 2019-08-29T07:54:56.000Z | 2021-08-19T07:01:34.000Z | Cube.cpp | chuckwolber/Cube | 56aae900c3c0c866940cade9d814c3fc7281ec33 | [
"MIT"
] | 1 | 2021-04-08T20:04:27.000Z | 2021-04-08T20:04:27.000Z | /**
* SPDX-License-Identifier: MIT
*
* Copyright (c) 2019 Chuck Wolber
*
* 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... | 30.627389 | 99 | 0.58225 | [
"vector"
] |
af0d9df3b2af250686761bba7de1c27743448906 | 2,711 | hpp | C++ | localgraphclustering/src/lib/include/ppr_path.hpp | vishalbelsare/LocalGraphClustering | a6325350997932d548a876deb259c2387fc2c809 | [
"MIT"
] | 106 | 2017-09-06T04:47:02.000Z | 2022-03-30T07:43:27.000Z | localgraphclustering/src/lib/include/ppr_path.hpp | pmacg/local-bipartite-clusters | d29e8d37c79e27b48e785b7b2c4bad9ea5d66b6d | [
"MIT"
] | 51 | 2017-09-06T02:22:09.000Z | 2021-12-15T11:39:28.000Z | localgraphclustering/src/lib/include/ppr_path.hpp | vishalbelsare/LocalGraphClustering | a6325350997932d548a876deb259c2387fc2c809 | [
"MIT"
] | 38 | 2017-09-04T21:45:13.000Z | 2022-01-19T09:48:25.000Z | #ifndef PPR_PATH_HPP
#define PPR_PATH_HPP
#include <vector>
#include <limits>
using namespace std;
template<typename vtype>
struct sweep_info {
vtype num_sweeps;
std::vector<vtype> rank_of_best_cond;
std::vector<double> cond;
std::vector<double> vol;
std::vector<double> cut;
double best_cond... | 25.336449 | 102 | 0.653633 | [
"vector"
] |
af1307d5232db78e4d080328514f4638ce5f7eac | 8,049 | cpp | C++ | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/telecom/VideoCallImpl.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 7 | 2017-07-13T10:34:54.000Z | 2021-04-16T05:40:35.000Z | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/telecom/VideoCallImpl.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | null | null | null | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/telecom/VideoCallImpl.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 9 | 2017-07-13T12:33:20.000Z | 2021-06-19T02:46:48.000Z | //=========================================================================
// Copyright (C) 2012 The Elastos Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// ... | 31.564706 | 84 | 0.628774 | [
"object"
] |
af152e51f00a7a0ba44296edaeed3aa99c8f946a | 570 | cpp | C++ | matriz_segura.cpp | Gambl3r08/ejercicios-C- | 331ba0309d18e6d1700dc55da0f4f6a9ec0fe653 | [
"MIT"
] | null | null | null | matriz_segura.cpp | Gambl3r08/ejercicios-C- | 331ba0309d18e6d1700dc55da0f4f6a9ec0fe653 | [
"MIT"
] | null | null | null | matriz_segura.cpp | Gambl3r08/ejercicios-C- | 331ba0309d18e6d1700dc55da0f4f6a9ec0fe653 | [
"MIT"
] | null | null | null | //Matriz que se borre de memoria aunque ocurra un error en tiempo de ejecucion
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int int_from( istream& in){
int x = 0;
in >> x;
return x;
}
int main(int argc, char const *argv[])
{
cout<<"Organizando enteros"<<endl;
vector<int> a;
... | 16.285714 | 78 | 0.607018 | [
"vector"
] |
af21f1bb6c1b0f7d7297fac64faa97dd20a71c35 | 1,543 | cpp | C++ | src/Parser/GFFParser.cpp | fritzsedlazeck/SURVIVOR_ant | 0f71ab7bf6b68f57d3212b0d6a1074a9ce0a87d9 | [
"MIT"
] | 11 | 2017-12-17T09:02:41.000Z | 2020-05-11T06:04:31.000Z | src/Parser/GFFParser.cpp | fritzsedlazeck/SURVIVOR_ant | 0f71ab7bf6b68f57d3212b0d6a1074a9ce0a87d9 | [
"MIT"
] | 13 | 2016-11-22T12:20:59.000Z | 2020-04-27T14:34:34.000Z | src/Parser/GFFParser.cpp | fritzsedlazeck/SURVIVOR_ant | 0f71ab7bf6b68f57d3212b0d6a1074a9ce0a87d9 | [
"MIT"
] | 2 | 2016-11-06T14:56:31.000Z | 2019-07-30T14:24:07.000Z | /*
* GFFParser.cpp
*
* Created on: Aug 15, 2016
* Author: fsedlaze
*/
#include "GFFParser.h"
std::string parse_name(char * buffer){
size_t i=0;
std::string name;
bool flag=false;
while(buffer[i]!=';'){
if(flag){
if(buffer[i]!='"'){
name+=buffer[i];
}
}
if(buffer[i]=='=' || buffer[i]==' ... | 20.851351 | 86 | 0.562541 | [
"vector"
] |
af240d856e669e0f153d94efd51918d5e39cce51 | 3,043 | cpp | C++ | Prism/src/Core/TaskSystem/TaskSystem.cpp | AdrianSchuhmaier/Prism | c744036660f5b9f34e16c504946b454e42cb346d | [
"Apache-2.0"
] | null | null | null | Prism/src/Core/TaskSystem/TaskSystem.cpp | AdrianSchuhmaier/Prism | c744036660f5b9f34e16c504946b454e42cb346d | [
"Apache-2.0"
] | null | null | null | Prism/src/Core/TaskSystem/TaskSystem.cpp | AdrianSchuhmaier/Prism | c744036660f5b9f34e16c504946b454e42cb346d | [
"Apache-2.0"
] | null | null | null | #include "TaskSystem.h"
#include "TaskQueue.h"
#include "Util/Log/Log.h"
#include <atomic>
// uncomment for detailed logging
#define PR_THREAD_TRACE(...) //PR_CORE_TRACE(__VA_ARGS__)
namespace Prism {
Prism::TaskQueue<256> g_Queue;
uint32_t g_NumThreads;
std::vector<std::thread> g_Threads;
std::mutex g_Signal... | 24.942623 | 98 | 0.679264 | [
"vector"
] |
af264f9496d3739c9e467c74e63ef9e282d87a58 | 1,811 | hpp | C++ | kernel/include/tupai/util/ref.hpp | zesterer/tupai | a2b7b6c535f59a05fdbb11416add1c83d7536101 | [
"ISC"
] | 15 | 2017-08-03T12:56:23.000Z | 2021-11-24T16:49:42.000Z | kernel/include/tupai/util/ref.hpp | zesterer/tupai | a2b7b6c535f59a05fdbb11416add1c83d7536101 | [
"ISC"
] | 2 | 2017-08-09T11:07:09.000Z | 2017-10-11T21:21:46.000Z | kernel/include/tupai/util/ref.hpp | zesterer/tupai | a2b7b6c535f59a05fdbb11416add1c83d7536101 | [
"ISC"
] | 1 | 2017-08-04T01:59:57.000Z | 2017-08-04T01:59:57.000Z | //
// file : ref.hpp
//
// Copyright (c) 2017 Joshua Barretto <joshua.s.barretto@gmail.com>
//
// This file is part of Tupai.
//
// Permission to use, copy, modify, and distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission noti... | 25.152778 | 90 | 0.695748 | [
"object"
] |
af312492f9c286a048f35aa98ec741bdf86b18b6 | 65,054 | cxx | C++ | anonymize.cxx | mmiv-center/DICOMAnonymizer | f0762643caab3d84e522b99cdec4b8d271b12039 | [
"Unlicense"
] | 3 | 2019-12-06T11:12:52.000Z | 2021-03-02T18:09:10.000Z | anonymize.cxx | mmiv-center/DICOMAnonymizer | f0762643caab3d84e522b99cdec4b8d271b12039 | [
"Unlicense"
] | 13 | 2019-09-05T20:32:07.000Z | 2021-12-23T18:43:20.000Z | anonymize.cxx | mmiv-center/DICOMAnonymizer | f0762643caab3d84e522b99cdec4b8d271b12039 | [
"Unlicense"
] | null | null | null | /*=========================================================================
Program: Anonymization using gdcm
Copyright (c) 2019 Hauke Bartsch
For debugging use:
cmake -DCMAKE_BUILD_TYPE=Release ..
to build gdcm.
// DumpSiemensBase64.cxx - add CSA header information
=================================... | 44.164291 | 159 | 0.589526 | [
"vector"
] |
af31c0ef9eca160840ca65185a02b7aa8f7740af | 1,365 | hpp | C++ | include/AnimationController.hpp | Haerezis/LED_Cube_Animator | a23787f2508c8aec050e0f9705cf251ea1b8d4e4 | [
"MIT"
] | null | null | null | include/AnimationController.hpp | Haerezis/LED_Cube_Animator | a23787f2508c8aec050e0f9705cf251ea1b8d4e4 | [
"MIT"
] | null | null | null | include/AnimationController.hpp | Haerezis/LED_Cube_Animator | a23787f2508c8aec050e0f9705cf251ea1b8d4e4 | [
"MIT"
] | null | null | null | #ifndef __ANIMATION_CONTROLLER_HPP
#define __ANIMATION_CONTROLLER_HPP
#include <QObject>
#include <QStandardItemModel>
#include "AnimationFrameController.hpp"
#include "Animation.hpp"
#include "CubeOpenGL.hpp"
#include "ui_MainWindows.h"
class AnimationController : public QObject
{
Q_OBJECT
public:
Animation... | 23.534483 | 97 | 0.734066 | [
"vector"
] |
af38670cf6d0b8b967540a2f20f1cacc72873a4f | 42,263 | cc | C++ | code-generate/cgen.cc | Snowfall99/seal-compiler | 8ea600d6312d1da145e6d8f018c20751826d4efa | [
"MIT"
] | 4 | 2020-10-25T14:40:20.000Z | 2020-11-22T05:38:17.000Z | code-generate/cgen.cc | Snowfall99/seal-compiler | 8ea600d6312d1da145e6d8f018c20751826d4efa | [
"MIT"
] | 1 | 2020-10-17T16:18:18.000Z | 2020-10-19T14:46:31.000Z | code-generate/cgen.cc | Snowfall99/seal-compiler | 8ea600d6312d1da145e6d8f018c20751826d4efa | [
"MIT"
] | 2 | 2020-12-01T06:17:05.000Z | 2020-12-02T10:13:18.000Z |
//**************************************************************
//
// Code generator SKELETON
//
//
//**************************************************************
#include "cgen.h"
#include "cgen_gc.h"
#include <vector>
using namespace std;
extern void emit_string_constant(ostream& str, char *s);
extern int cgen... | 28.730795 | 206 | 0.581407 | [
"object",
"vector"
] |
af39c7cfee6ed3cafdef0cf66159b4a0064afdae | 5,970 | cpp | C++ | src/npsv/simulation.cpp | mlinderm/npsv | 02a17f7c889e345a3d2af67ec26f0492c308cf73 | [
"MIT"
] | 12 | 2021-02-03T15:13:19.000Z | 2022-02-17T01:06:54.000Z | src/npsv/simulation.cpp | mlinderm/npsv | 02a17f7c889e345a3d2af67ec26f0492c308cf73 | [
"MIT"
] | 3 | 2021-08-04T07:54:55.000Z | 2021-11-18T16:24:32.000Z | src/npsv/simulation.cpp | mlinderm/npsv | 02a17f7c889e345a3d2af67ec26f0492c308cf73 | [
"MIT"
] | null | null | null | #include "simulation.hpp"
#include "utility.hpp"
#include <fstream>
#include <random>
#include <stdexcept>
#include <vector>
#include "SeqLib/BamReader.h"
#include "SeqLib/BamWriter.h"
#include "SeqLib/FastqReader.h"
#include "SeqLib/SeqLibUtils.h"
#include "SeqLib/UnalignedSequence.h"
namespace npsv {
void WriteF... | 34.508671 | 169 | 0.650586 | [
"vector"
] |
af46933bfbdf255903d0e11214a9d0452d3ba1ad | 516 | cpp | C++ | test.cpp | raptor/clip2tri | f62a734d22733814b8a970ed8a68a4d94c24fa5f | [
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | 79 | 2015-05-06T10:47:25.000Z | 2022-01-10T03:45:43.000Z | test.cpp | acres-com-au/clip2tri | 2ce187faa8229ee26f1d0aa4b6aea9b81cfd2271 | [
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | 2 | 2016-11-23T17:51:41.000Z | 2018-12-25T03:33:30.000Z | test.cpp | acres-com-au/clip2tri | 2ce187faa8229ee26f1d0aa4b6aea9b81cfd2271 | [
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | 18 | 2015-03-20T13:29:42.000Z | 2021-07-09T09:03:04.000Z |
#include "clipper/clipper.hpp"
#include "poly2tri/poly2tri.h"
#include "clip2tri/clip2tri.h"
#include <iostream>
#include <cstdio>
using namespace std;
using namespace c2t;
// TODO actually fill out some test data... this code compiles, but doesn't work!
int main() {
vector<vector<Point> > inputPolygons;
ve... | 22.434783 | 82 | 0.744186 | [
"vector"
] |
af47c99d803e41edcfe67e44871af70ce1b81578 | 1,226 | cpp | C++ | src/io.cpp | d3suu/bitdiff | d5c43c5ebf54c748a7354be6ffe47782cb007f7f | [
"MIT"
] | null | null | null | src/io.cpp | d3suu/bitdiff | d5c43c5ebf54c748a7354be6ffe47782cb007f7f | [
"MIT"
] | null | null | null | src/io.cpp | d3suu/bitdiff | d5c43c5ebf54c748a7354be6ffe47782cb007f7f | [
"MIT"
] | null | null | null | #include "io.h"
#include "math.h"
#include <string.h>
#include <stdio.h>
bytesOutputWithData fileToBytes(char* fileName){
FILE *fp;
fp = fopen(fileName, "r");
fseek(fp, 0L, SEEK_END); // check size of file (in bytes)
unsigned long long size = ftell(fp);
rewind(fp);
char* buffer = new char[size];
for(unsign... | 26.652174 | 114 | 0.69739 | [
"object"
] |
af5846bbadcfe625800dba0a9a95e30f796267e8 | 596 | cpp | C++ | DSA-450/01Array/25occurance.cpp | vikkastiwari/cpp-coding-questions | 020790e1a3b26c7b24991427004730b3f0785c71 | [
"MIT"
] | null | null | null | DSA-450/01Array/25occurance.cpp | vikkastiwari/cpp-coding-questions | 020790e1a3b26c7b24991427004730b3f0785c71 | [
"MIT"
] | null | null | null | DSA-450/01Array/25occurance.cpp | vikkastiwari/cpp-coding-questions | 020790e1a3b26c7b24991427004730b3f0785c71 | [
"MIT"
] | null | null | null | // question link: https://practice.geeksforgeeks.org/problems/count-element-occurences/1
#include <bits/stdc++.h>
using namespace std;
int countOccurence(vector<int> arr, int k)
{
// Your code here
int n = arr.size();
unordered_map<int, int> map;
for (int i = 0; i < n; i++)
{
map[arr[i]]++... | 19.225806 | 88 | 0.531879 | [
"vector"
] |
af60eb64743d1e5df301184a4f8730fdcd6d0a94 | 10,087 | cpp | C++ | src/TopoLite/Stability/Solver/Equilibrium/EquilibriumFrictionLessSolver.cpp | KIKI007/RigidBodyEquilibrium | 4137a0a9e947a6324cd75603495899fdb82e731c | [
"MIT"
] | 2 | 2021-08-08T01:24:56.000Z | 2021-08-11T00:57:43.000Z | src/TopoLite/Stability/Solver/Equilibrium/EquilibriumFrictionLessSolver.cpp | tangbohu/RigidBodyEquilibrium | 4137a0a9e947a6324cd75603495899fdb82e731c | [
"MIT"
] | null | null | null | src/TopoLite/Stability/Solver/Equilibrium/EquilibriumFrictionLessSolver.cpp | tangbohu/RigidBodyEquilibrium | 4137a0a9e947a6324cd75603495899fdb82e731c | [
"MIT"
] | 1 | 2021-08-10T10:17:22.000Z | 2021-08-10T10:17:22.000Z | //
// Created by ziqwang on 03.08.20.
//
#include "EquilibriumFrictionLessSolver.h"
/*************************************************
*
* Building block for the Interlocking Matrix
*
*************************************************/
template<int dim>
void EquilibriumFrictionLessSolver<dim>::get_force_from_no... | 35.146341 | 156 | 0.522752 | [
"vector"
] |
af66fc598bd1b813800a89e44df1ce9b1b3e643c | 1,611 | cpp | C++ | IndexationMultimedia/TP/code/Classify.cpp | vanthonguyen/m2 | 41b9380951a5e241cab591e186af80c40e4be663 | [
"BSD-3-Clause"
] | 1 | 2020-11-20T14:52:41.000Z | 2020-11-20T14:52:41.000Z | IndexationMultimedia/TP/code/Classify.cpp | vanthonguyen/m2 | 41b9380951a5e241cab591e186af80c40e4be663 | [
"BSD-3-Clause"
] | null | null | null | IndexationMultimedia/TP/code/Classify.cpp | vanthonguyen/m2 | 41b9380951a5e241cab591e186af80c40e4be663 | [
"BSD-3-Clause"
] | null | null | null | /*
* =====================================================================================
*
* Filename: Classify.cpp
*
* Description: implementation
* Version: 1.0
* Created: 12/09/2013 02:02:20 PM
* Revision: none
* Compiler: gcc
* Author: NGUYEN Van Tho (),... | 35.8 | 154 | 0.494103 | [
"vector"
] |
af6ad38d2dd61d98b1ef97a77b08714083006676 | 2,915 | cpp | C++ | examples/holstSpekfTex.cpp | jansendavid/many-body-lib | eb8fcb2d61b4fdba1c1effaa706e3c298a17042b | [
"MIT"
] | null | null | null | examples/holstSpekfTex.cpp | jansendavid/many-body-lib | eb8fcb2d61b4fdba1c1effaa706e3c298a17042b | [
"MIT"
] | null | null | null | examples/holstSpekfTex.cpp | jansendavid/many-body-lib | eb8fcb2d61b4fdba1c1effaa706e3c298a17042b | [
"MIT"
] | null | null | null | #include<iostream>
#define EIGEN_USE_MKL_ALL
#include"basis.hpp"
#include"operators.hpp"
#include"diag.h"
#include"tpoperators.hpp"
#include"files.hpp"
#include"timeev.hpp"
#include"ETH.hpp"
#include<iomanip>
#include <boost/program_options.hpp>
using namespace boost::program_options;
int main(int argc, char *argv[])
... | 24.495798 | 64 | 0.532419 | [
"vector"
] |
af7a44dee9afc605577e109b8e097f823a963e40 | 9,956 | cpp | C++ | main.cpp | TaylorCoons/xss-ftree | 2c1798455b12022bc74494ea3dfce39a6d3eea32 | [
"Unlicense"
] | null | null | null | main.cpp | TaylorCoons/xss-ftree | 2c1798455b12022bc74494ea3dfce39a6d3eea32 | [
"Unlicense"
] | null | null | null | main.cpp | TaylorCoons/xss-ftree | 2c1798455b12022bc74494ea3dfce39a6d3eea32 | [
"Unlicense"
] | null | null | null | #include <X11/Xlib.h>
#include <unistd.h>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include "CLIParser/CLIParser.h"
#include "vroot.h"
#include "FTree.h"
unsigned long int CreateColor(int red, int green, int blue) {
return (red << 16) + (green << 8) + blue;
}
CLIParser::OPTIONS Init... | 31.707006 | 92 | 0.55685 | [
"vector"
] |
af7b72a30678c76671e438e626b49943b2cb36d2 | 2,665 | cpp | C++ | src/rtpsession.cpp | weizhenwei/OpenRTP | 7254c61064b2ed5d0023c688daa1c9fe768c3cb0 | [
"BSD-3-Clause"
] | 13 | 2016-10-03T12:18:13.000Z | 2021-06-29T06:09:02.000Z | src/rtpsession.cpp | weizhenwei/OpenRTP | 7254c61064b2ed5d0023c688daa1c9fe768c3cb0 | [
"BSD-3-Clause"
] | null | null | null | src/rtpsession.cpp | weizhenwei/OpenRTP | 7254c61064b2ed5d0023c688daa1c9fe768c3cb0 | [
"BSD-3-Clause"
] | 6 | 2017-04-10T02:46:25.000Z | 2021-11-30T06:13:57.000Z | /*
============================================================================
* Name : rtpsession.cpp
* Author : weizhenwei, <weizhenwei1988@gmail.com>
* Date : 2016.10.04
*
* Copyright :
* Copyright (c) 2016, weizhenwei
* All rights reserved.
*
* Redistribution and use in source and bi... | 37.013889 | 81 | 0.700938 | [
"vector"
] |
502ebf7a3527629725c74ca0cf53859498dcf47c | 589 | hpp | C++ | src/lib/sampling/samplers/simple_sampler.hpp | idangerichter/CryptoWorkshop | c8d5e202fe3d02c85e58c8c01978db013a81eccd | [
"WTFPL"
] | null | null | null | src/lib/sampling/samplers/simple_sampler.hpp | idangerichter/CryptoWorkshop | c8d5e202fe3d02c85e58c8c01978db013a81eccd | [
"WTFPL"
] | null | null | null | src/lib/sampling/samplers/simple_sampler.hpp | idangerichter/CryptoWorkshop | c8d5e202fe3d02c85e58c8c01978db013a81eccd | [
"WTFPL"
] | null | null | null | #pragma once
#include "../sampler.hpp"
#include "../sampler_primitive.hpp"
// Sampler that sample a single memory cell.
// It will wait `delay` nanoseconds between the preparation and sampling
class SimpleSampler : public Sampler
{
public:
explicit SimpleSampler(size_t index, size_t delay, std::shared_ptr<SamplerPri... | 29.45 | 106 | 0.780985 | [
"vector"
] |
50391d39b0ee8abbfc07fe1ea30bdcf95be6fe90 | 17,282 | cpp | C++ | minetest-ego/src/chat.cpp | medialab-prado/Interactivos-15-Ego | 4c7e184b9495d07fc1008573ef1b752d20ebc1ab | [
"MIT"
] | null | null | null | minetest-ego/src/chat.cpp | medialab-prado/Interactivos-15-Ego | 4c7e184b9495d07fc1008573ef1b752d20ebc1ab | [
"MIT"
] | null | null | null | minetest-ego/src/chat.cpp | medialab-prado/Interactivos-15-Ego | 4c7e184b9495d07fc1008573ef1b752d20ebc1ab | [
"MIT"
] | null | null | null | /*
Minetest
Copyright (C) 2013 celeron55, Perttu Ahola <celeron55@gmail.com>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later ve... | 22.15641 | 85 | 0.691471 | [
"vector"
] |
50411873ce84d2bb08a3691221bd03b5df7171d0 | 10,786 | hpp | C++ | include/ciphey/swig.hpp | Cyclic3/CipheyCore | 63cc5fa79b68602e92fd1e16abdbd16b53fcbc53 | [
"MIT"
] | 35 | 2020-05-30T10:25:14.000Z | 2022-03-09T05:46:28.000Z | include/ciphey/swig.hpp | Cyclic3/CipheyCore | 63cc5fa79b68602e92fd1e16abdbd16b53fcbc53 | [
"MIT"
] | 12 | 2020-08-01T16:52:49.000Z | 2021-12-25T22:04:42.000Z | include/ciphey/swig.hpp | Cyclic3/CipheyCore | 63cc5fa79b68602e92fd1e16abdbd16b53fcbc53 | [
"MIT"
] | 14 | 2020-08-06T01:36:08.000Z | 2022-02-02T09:53:18.000Z | #pragma once
#include <ciphey/ausearch.hpp>
#include <ciphey/ciphers.hpp>
#include <memory>
namespace ciphey {
// We use the same names for the various analysis functions to simplify the API
// +-------------------------------------------------------------------------+
// | SIMPLE A... | 43.668016 | 127 | 0.562488 | [
"vector"
] |
5041f971641515e2a2ba6922d10e4173bee9620b | 15,564 | cpp | C++ | src/ukf.cpp | frtunikj/sdc_unscented_kalman_filter | 60161098782653301bef45c57c4bc961230e41bf | [
"MIT"
] | null | null | null | src/ukf.cpp | frtunikj/sdc_unscented_kalman_filter | 60161098782653301bef45c57c4bc961230e41bf | [
"MIT"
] | null | null | null | src/ukf.cpp | frtunikj/sdc_unscented_kalman_filter | 60161098782653301bef45c57c4bc961230e41bf | [
"MIT"
] | null | null | null | #include "ukf.h"
#include "Eigen/Dense"
#include <iostream>
#include <iomanip> // for std::setprecision
using namespace std;
using Eigen::MatrixXd;
using Eigen::VectorXd;
using std::vector;
void NormalizeAngle(double& phi) {
phi = atan2(sin(phi), cos(phi));
}
/**
* Initializes Unscented Kalman filter
* This is... | 29.988439 | 151 | 0.593806 | [
"object",
"vector",
"model",
"transform"
] |
5047e5d59b3b8a9b2b9d6e5b22d276a9ae98818e | 4,983 | cc | C++ | src/attributes/KMLDriverAttributes.cc | b8raoult/magics | eb2c86ec6e392e89c90044128dc671f22283d6ad | [
"ECL-2.0",
"Apache-2.0"
] | 41 | 2018-12-07T23:10:50.000Z | 2022-02-19T03:01:49.000Z | src/attributes/KMLDriverAttributes.cc | b8raoult/magics | eb2c86ec6e392e89c90044128dc671f22283d6ad | [
"ECL-2.0",
"Apache-2.0"
] | 59 | 2019-01-04T15:43:30.000Z | 2022-03-31T09:48:15.000Z | src/attributes/KMLDriverAttributes.cc | b8raoult/magics | eb2c86ec6e392e89c90044128dc671f22283d6ad | [
"ECL-2.0",
"Apache-2.0"
] | 13 | 2019-01-07T14:36:33.000Z | 2021-09-06T14:48:36.000Z |
/****************************** LICENSE *******************************
* (C) Copyright 1996-2017 ECMWF.
*
* This software is licensed under the terms of the Apache Licence Version 2.0
* which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
* In applying this licence, ECMWF does not waive the pr... | 28.152542 | 89 | 0.686534 | [
"vector"
] |
50519559a043f660a159f75fb89240ed3a21482f | 2,256 | cpp | C++ | Nature/GrassGenerator.cpp | Gekoncze/ExamplesOpenglNature | fb3e2a331ff092137893a15efe66184a01c73c05 | [
"BSD-3-Clause"
] | null | null | null | Nature/GrassGenerator.cpp | Gekoncze/ExamplesOpenglNature | fb3e2a331ff092137893a15efe66184a01c73c05 | [
"BSD-3-Clause"
] | null | null | null | Nature/GrassGenerator.cpp | Gekoncze/ExamplesOpenglNature | fb3e2a331ff092137893a15efe66184a01c73c05 | [
"BSD-3-Clause"
] | null | null | null | #include "GrassGenerator.h"
GrassGenerator::GrassGenerator()
{
}
GrassGenerator::~GrassGenerator()
{
}
void GrassGenerator::generate(ModelReader& terrain, float scale, int count, int seed, float xmin, float ymin, float xmax, float ymax, std::vector<GrassClump>& clumps)
{
clumps.resize(count);
FloatGenerator genera... | 28.923077 | 166 | 0.628989 | [
"vector"
] |
5053f343eb6bf7081e486fad22b4244ca18a7644 | 546 | cpp | C++ | OldSchool/stage.cpp | Saahitya/pipeline_design_pattern | afe027f1674ce5d17c7c1e2f8f45c883aee643f4 | [
"MIT"
] | null | null | null | OldSchool/stage.cpp | Saahitya/pipeline_design_pattern | afe027f1674ce5d17c7c1e2f8f45c883aee643f4 | [
"MIT"
] | null | null | null | OldSchool/stage.cpp | Saahitya/pipeline_design_pattern | afe027f1674ce5d17c7c1e2f8f45c883aee643f4 | [
"MIT"
] | null | null | null | #include "stage.h"
#include <algorithm>
#include <iostream>
#include <vector>
void Stage1::Execute(vector<int>& input)
{
for_each(input.begin(), input.end(), [](int& ele) { ele = ele * ele; });
// for_each(input.begin(), input.end(), [ ](int& ele){std:cout << ele << "\t";});
// std::cout << "\n";
}
void S... | 28.736842 | 85 | 0.551282 | [
"vector"
] |
505b1a3977df3c2c2f6be5783e0e6416aecdb91d | 4,053 | cpp | C++ | core/src/HTTP/HTTPSServerPoco.cpp | ConnectedVision/ConnectedVision | 210e49205ca50f73584178b6cedb298a74cea798 | [
"MIT"
] | 3 | 2017-08-12T18:14:00.000Z | 2018-11-19T09:15:35.000Z | core/src/HTTP/HTTPSServerPoco.cpp | ConnectedVision/ConnectedVision | 210e49205ca50f73584178b6cedb298a74cea798 | [
"MIT"
] | null | null | null | core/src/HTTP/HTTPSServerPoco.cpp | ConnectedVision/ConnectedVision | 210e49205ca50f73584178b6cedb298a74cea798 | [
"MIT"
] | 1 | 2018-11-09T15:57:13.000Z | 2018-11-09T15:57:13.000Z | /**
* Connected Vision - https://github.com/ConnectedVision
* MIT License
*/
/******************************************************
** HTTPSServerPoco.cpp
**
** written by Michael Rauter and Andi Zoufal
**
*******************************************************/
#include "HTTPSServerPoco.h"
#include <IConnectedVis... | 27.951724 | 109 | 0.682704 | [
"vector"
] |
506061b9b04846ab82047c81e93342ccbdb6c09e | 1,402 | cpp | C++ | 2288-apply-discount-to-prices/2288-apply-discount-to-prices.cpp | arpangoswami/LeetcodeSolutions | 17a2450cacf0020c2626023012a5a354c8fee5da | [
"MIT"
] | null | null | null | 2288-apply-discount-to-prices/2288-apply-discount-to-prices.cpp | arpangoswami/LeetcodeSolutions | 17a2450cacf0020c2626023012a5a354c8fee5da | [
"MIT"
] | null | null | null | 2288-apply-discount-to-prices/2288-apply-discount-to-prices.cpp | arpangoswami/LeetcodeSolutions | 17a2450cacf0020c2626023012a5a354c8fee5da | [
"MIT"
] | null | null | null | class Solution {
bool isPrice( string myString ) {
if(myString.size() == 0){
return false;
}
if(myString[0] != '$'){
return false;
}
myString = myString.substr(1);
std::istringstream iss(myString);
float f;
iss >> noskipws >> f;... | 27.490196 | 86 | 0.46719 | [
"vector"
] |
5060c056ad7a5d9224259bb68ff35749f4a8fe6c | 1,375 | cpp | C++ | templates/ACAM.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | 2 | 2018-02-24T06:45:56.000Z | 2018-05-29T04:47:39.000Z | templates/ACAM.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | null | null | null | templates/ACAM.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | 2 | 2018-06-28T09:53:27.000Z | 2022-03-23T13:29:57.000Z | #include <bits/stdc++.h>
using namespace std;
#pragma comment(linker,"/stack:1024000000,1024000000")
#define db(x) cout<<(x)<<endl
#define pc(x) putchar(x)
#define ps(x) puts(x)
#define pf(x) push_front(x)
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ms(x,y) memset(x,y,sizeof x)
typedef long long L... | 20.220588 | 56 | 0.599273 | [
"transform"
] |
50724d4ab323ecf2620aa8100a95405408521ea3 | 4,761 | cpp | C++ | util/measurement/main.cpp | e8035669/datamining_exam | c70bec47c18856b72a24cc2b7f1b533a89bb9ffa | [
"MIT"
] | null | null | null | util/measurement/main.cpp | e8035669/datamining_exam | c70bec47c18856b72a24cc2b7f1b533a89bb9ffa | [
"MIT"
] | null | null | null | util/measurement/main.cpp | e8035669/datamining_exam | c70bec47c18856b72a24cc2b7f1b533a89bb9ffa | [
"MIT"
] | null | null | null | #include <cmath>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <vector>
using namespace std;
void getSumRowCol(vector<vector<double>>& matrix, vector<double>& attrSum,
vector<double>& clsSum, double& allSum) {
// size_t size = matrix.size();
attrSum.clear();
attrSu... | 29.388889 | 78 | 0.533501 | [
"vector"
] |
507303b3d318bc7388855fb7f85b004571fe6137 | 4,518 | cpp | C++ | Pointclouds/PCL.MAE683/src/voxel_grid.cpp | faipaz/Algorithms | 738991d5e4372ef6ba8e489ea867d92ea406b729 | [
"MIT"
] | 4 | 2016-08-19T14:00:56.000Z | 2021-03-09T09:11:48.000Z | Pointclouds/PCL.MAE683/src/voxel_grid.cpp | faipaz/Algorithms | 738991d5e4372ef6ba8e489ea867d92ea406b729 | [
"MIT"
] | 1 | 2019-07-12T19:20:47.000Z | 2019-07-12T19:20:47.000Z | Pointclouds/PCL.MAE683/src/voxel_grid.cpp | faipaz/Algorithms | 738991d5e4372ef6ba8e489ea867d92ea406b729 | [
"MIT"
] | 2 | 2016-06-21T15:02:30.000Z | 2019-07-09T10:55:36.000Z | #include <iostream>
#include <pcl/io/pcd_io.h>
#include <pcl/point_types.h>
#include <pcl/filters/voxel_grid.h>
#include <pcl/visualization/cloud_viewer.h>
#include <pcl/visualization/pcl_visualizer.h>
//http://www.pointclouds.org/documentation/tutorials/voxel_grid.php
// TODO : http://pointclouds.org/document... | 32.503597 | 129 | 0.645197 | [
"object",
"3d"
] |
5073313a8336164c20efd5ed13d7a79defea3255 | 3,809 | cpp | C++ | src/Modules/Physics/Shibboleth_RigidBodyComponent.cpp | Connway/Shibboleth | 23dda9a066db8dfaf8c8d56cb1e3d9929b6ced35 | [
"MIT"
] | 1 | 2020-04-06T17:35:47.000Z | 2020-04-06T17:35:47.000Z | src/Modules/Physics/Shibboleth_RigidBodyComponent.cpp | Connway/Shibboleth | 23dda9a066db8dfaf8c8d56cb1e3d9929b6ced35 | [
"MIT"
] | null | null | null | src/Modules/Physics/Shibboleth_RigidBodyComponent.cpp | Connway/Shibboleth | 23dda9a066db8dfaf8c8d56cb1e3d9929b6ced35 | [
"MIT"
] | null | null | null | /************************************************************************************
Copyright (C) 2021 by Nicholas LaCroix
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, in... | 30.472 | 106 | 0.719874 | [
"shape"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.