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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d8a4a799392ed4bd39f2c65c64010475ee5bc0c0 | 4,935 | hpp | C++ | planning/lib/helpers.hpp | Ewenwan/Path-Planning | 2b3e6e566933dbb40261e16bd97f0dbc2b9ef847 | [
"MIT"
] | 82 | 2015-09-04T08:42:44.000Z | 2022-03-12T12:10:47.000Z | planning/lib/helpers.hpp | etarakci-hvl/Path-Planning | 2b3e6e566933dbb40261e16bd97f0dbc2b9ef847 | [
"MIT"
] | 25 | 2015-09-07T14:11:33.000Z | 2015-09-26T08:06:06.000Z | planning/lib/helpers.hpp | etarakci-hvl/Path-Planning | 2b3e6e566933dbb40261e16bd97f0dbc2b9ef847 | [
"MIT"
] | 39 | 2015-09-04T04:46:48.000Z | 2022-03-25T14:36:21.000Z | #pragma once
#include <limits>
#include <algorithm>
#include <vector>
#include <map>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <string>
using std::max;
using std::make_pair;
using std::min;
using std::abs;
using std::hypot;
using std::vector;
using std::map;
using std::function;... | 26.675676 | 145 | 0.435664 | [
"vector"
] |
d8ab93c908459227d30da2ef4ca44f2e0324b855 | 17,299 | cpp | C++ | engine/src/graphics/GizmoRenderer.cpp | jsandham/PhysicsEngine | 51115ee9a59f3bc6e0895113c67563cfd4a1ef3c | [
"MIT"
] | 2 | 2018-12-19T01:52:39.000Z | 2022-03-29T16:04:15.000Z | engine/src/graphics/GizmoRenderer.cpp | jsandham/PhysicsEngine | 51115ee9a59f3bc6e0895113c67563cfd4a1ef3c | [
"MIT"
] | null | null | null | engine/src/graphics/GizmoRenderer.cpp | jsandham/PhysicsEngine | 51115ee9a59f3bc6e0895113c67563cfd4a1ef3c | [
"MIT"
] | null | null | null | #include "../../include/graphics/GizmoRenderer.h"
#include "../../include/core/World.h"
#include <GL/glew.h>
#include <gl/gl.h>
using namespace PhysicsEngine;
GizmoRenderer::GizmoRenderer()
{
}
GizmoRenderer::~GizmoRenderer()
{
destroyGizmoRenderer(mState);
}
void GizmoRenderer::init(World *world)
{
mWorld... | 32.45591 | 119 | 0.650905 | [
"mesh",
"vector",
"model",
"transform"
] |
d8b365f497c257015ebab0fd007bf7e984c3d267 | 9,591 | cpp | C++ | src/storm/graphics/cAnimationManager.cpp | master312/quantum-kidney | 042e97e9a9998be4fc062eb703c51141ea7bd2e4 | [
"MIT"
] | null | null | null | src/storm/graphics/cAnimationManager.cpp | master312/quantum-kidney | 042e97e9a9998be4fc062eb703c51141ea7bd2e4 | [
"MIT"
] | null | null | null | src/storm/graphics/cAnimationManager.cpp | master312/quantum-kidney | 042e97e9a9998be4fc062eb703c51141ea7bd2e4 | [
"MIT"
] | null | null | null | #include "cAnimationManager.h"
cAnimationManager::cAnimationManager(cTextureManager *_textureManager){
tManager = _textureManager;
}
cAnimationManager::~cAnimationManager(){
RemoveAll();
}
uint cAnimationManager::CreateAnimation(std::vector<uint> frames,
int fps, bool _useTextures){
cAnimation tmpAnim;
for(int... | 29.420245 | 87 | 0.680117 | [
"vector"
] |
d8b532c05bfbb3130bd9a1246a736860a0ab0292 | 28,935 | cpp | C++ | BenchElise/export_skel_vein.cpp | kikislater/micmac | 3009dbdad62b3ad906ec882b74b85a3db86ca755 | [
"CECILL-B"
] | 451 | 2016-11-25T09:40:28.000Z | 2022-03-30T04:20:42.000Z | BenchElise/export_skel_vein.cpp | kikislater/micmac | 3009dbdad62b3ad906ec882b74b85a3db86ca755 | [
"CECILL-B"
] | 143 | 2016-11-25T20:35:57.000Z | 2022-03-01T11:58:02.000Z | BenchElise/export_skel_vein.cpp | kikislater/micmac | 3009dbdad62b3ad906ec882b74b85a3db86ca755 | [
"CECILL-B"
] | 139 | 2016-12-02T10:26:21.000Z | 2022-03-10T19:40:29.000Z | /*eLiSe06/05/99
Copyright (C) 1999 Marc PIERROT DESEILLIGNY
eLiSe : Elements of a Linux Image Software Environment
This program 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 2 of the ... | 24.072379 | 80 | 0.433247 | [
"shape"
] |
d8bc5d7011726cbff25deef4f24359af01fda16f | 649 | cpp | C++ | leetcode/array/array_nesting.cpp | codingpotato/algorithm-cpp | 793dc9e141000f48ea19c77ef0047923a7667358 | [
"MIT"
] | null | null | null | leetcode/array/array_nesting.cpp | codingpotato/algorithm-cpp | 793dc9e141000f48ea19c77ef0047923a7667358 | [
"MIT"
] | null | null | null | leetcode/array/array_nesting.cpp | codingpotato/algorithm-cpp | 793dc9e141000f48ea19c77ef0047923a7667358 | [
"MIT"
] | null | null | null | #include <doctest/doctest.h>
#include <vector>
// 565. Array Nesting
class Solution {
public:
int arrayNesting(std::vector<int>& nums) {
auto index = 0;
auto max_len = 0;
auto current_len = 1;
while (index < static_cast<int>(nums.size())) {
if (nums[index] != index) {
std::swap(nums[i... | 20.935484 | 51 | 0.57319 | [
"vector"
] |
d8c0c8517e1f42ccd9b0faf947e21ddcab208547 | 945 | cpp | C++ | convex_hull/convex_hull.cpp | ryanmcdermott/katas | d23b8c131f03e4df0a3a5268de4b63c5b35058a1 | [
"MIT"
] | 46 | 2017-06-26T15:09:10.000Z | 2022-03-19T04:21:32.000Z | convex_hull/convex_hull.cpp | ryanmcdermott/katas | d23b8c131f03e4df0a3a5268de4b63c5b35058a1 | [
"MIT"
] | null | null | null | convex_hull/convex_hull.cpp | ryanmcdermott/katas | d23b8c131f03e4df0a3a5268de4b63c5b35058a1 | [
"MIT"
] | 13 | 2017-10-18T05:30:18.000Z | 2021-10-04T22:46:35.000Z | // Time complexity: O(m*n)
// Space complexity: O(1)
#include "./convex_hull.hpp"
#include <vector>
using std::vector;
// Find orientation of Point triplet: (p, q, r)
// Returns values as so:
// 0: p, q and r are colinear
// 1: Clockwise
// 2: Counterclockwise
int orientation(Point p, Point q, Point r) {
// clang-f... | 17.5 | 62 | 0.506878 | [
"vector"
] |
d8c3a94d0aac1ecfb92af788df03935e9cab0c59 | 3,476 | cc | C++ | server.cc | maxcong001/grpcTest | 545d2b24a316f4693215f0667d7ce828e2cd321f | [
"MIT"
] | null | null | null | server.cc | maxcong001/grpcTest | 545d2b24a316f4693215f0667d7ce828e2cd321f | [
"MIT"
] | null | null | null | server.cc | maxcong001/grpcTest | 545d2b24a316f4693215f0667d7ce828e2cd321f | [
"MIT"
] | null | null | null | #include "information.grpc.pb.h"
#include <grpcpp/grpcpp.h>
#include <vector>
#include <mutex>
#include <thread>
#include <algorithm>
class InfoServiceImpl final : public info::Manager::Service {
public:
grpc::Status AddRecord(grpc::ServerContext* context,
const info::Person* person,
... | 34.415842 | 109 | 0.516398 | [
"vector"
] |
d8ce6187e142c23aa12494ce037402bc0b96199d | 3,804 | hpp | C++ | include/Main.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 1 | 2021-11-12T09:29:31.000Z | 2021-11-12T09:29:31.000Z | include/Main.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | null | null | null | include/Main.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 2 | 2021-10-03T02:14:20.000Z | 2021-11-12T09:29:36.000Z | #include "codegen/include/GlobalNamespace/BeatmapObjectManager.hpp"
#include "codegen/include/GlobalNamespace/NoteData.hpp"
#include "codegen/include/GlobalNamespace/NoteJump.hpp"
#include "codegen/include/GlobalNamespace/NoteType.hpp"
#include "codegen/include/GlobalNamespace/AudioTimeSyncController.hpp"
#include "cod... | 39.625 | 92 | 0.79837 | [
"object",
"transform"
] |
d8d229419a635e45571a5ecb2fd2a1fd3c5c3483 | 403 | cpp | C++ | C++/0944-Delete-Columns-to-Make-Sorted/soln.cpp | wyaadarsh/LeetCode-Solutions | 3719f5cb059eefd66b83eb8ae990652f4b7fd124 | [
"MIT"
] | 5 | 2020-07-24T17:48:59.000Z | 2020-12-21T05:56:00.000Z | C++/0944-Delete-Columns-to-Make-Sorted/soln.cpp | zhangyaqi1989/LeetCode-Solutions | 2655a1ffc8678ad1de6c24295071308a18c5dc6e | [
"MIT"
] | null | null | null | C++/0944-Delete-Columns-to-Make-Sorted/soln.cpp | zhangyaqi1989/LeetCode-Solutions | 2655a1ffc8678ad1de6c24295071308a18c5dc6e | [
"MIT"
] | 2 | 2020-07-24T17:49:01.000Z | 2020-08-31T19:57:35.000Z | class Solution {
public:
int minDeletionSize(vector<string>& A) {
int nwords = A.size(), len = A[0].size();
int ans = 0;
for (int i = 0; i < len; ++i) {
for(int j = 0; j < nwords - 1; ++j) {
if (A[j + 1][i] < A[j][i]) {
ans += 1;
... | 25.1875 | 49 | 0.33995 | [
"vector"
] |
d8d31349e29dde330b1b36f79e04dbb2fc631da8 | 556 | cpp | C++ | 001_GFG/Data-Structures-And-Algorithms-Self-Paced/0020_Dynamic_Programming/003_print_fibo_vector.cpp | Sahil1515/coding | 2bd2a2257c8cac5a5c00b37e79bbb68a24e186d4 | [
"RSA-MD"
] | null | null | null | 001_GFG/Data-Structures-And-Algorithms-Self-Paced/0020_Dynamic_Programming/003_print_fibo_vector.cpp | Sahil1515/coding | 2bd2a2257c8cac5a5c00b37e79bbb68a24e186d4 | [
"RSA-MD"
] | null | null | null | 001_GFG/Data-Structures-And-Algorithms-Self-Paced/0020_Dynamic_Programming/003_print_fibo_vector.cpp | Sahil1515/coding | 2bd2a2257c8cac5a5c00b37e79bbb68a24e186d4 | [
"RSA-MD"
] | null | null | null | // vector<long long> printFibb(int n) {
// vector<long long> fibo;
// fibo.reserve(n);
// if(n==0)
// return fibo;
// fibo.push_back(1);
// if(n==1)
// return fibo;
// fibo.push_back(1);
// for(int i=2;i<n;i++)
// {
// fibo.push_back(fib... | 13.560976 | 47 | 0.442446 | [
"vector"
] |
d8da95f73aa89164f7ac30fa05c3afd4a903218a | 955 | hpp | C++ | libfma/include/fma/interpret/CallStack.hpp | BenjaminSchulte/fma | df2aa5b0644c75dd34a92defeff9beaa4a32ffea | [
"MIT"
] | 14 | 2018-01-25T10:31:05.000Z | 2022-02-19T13:08:11.000Z | libfma/include/fma/interpret/CallStack.hpp | BenjaminSchulte/fma | df2aa5b0644c75dd34a92defeff9beaa4a32ffea | [
"MIT"
] | 1 | 2020-12-24T10:10:28.000Z | 2020-12-24T10:10:28.000Z | libfma/include/fma/interpret/CallStack.hpp | BenjaminSchulte/fma | df2aa5b0644c75dd34a92defeff9beaa4a32ffea | [
"MIT"
] | null | null | null | #ifndef __FMA_INTERPRET_CALLSTACK_H__
#define __FMA_INTERPRET_CALLSTACK_H__
#include <vector>
#include <memory>
#include <fma/Reference.hpp>
namespace FMA {
namespace interpret {
struct CallStackItem {
CallStackItem(const CodeReference &ref) : ref(ref) {}
CodeReference ref;
};
typedef std::vector<CallStackItem... | 17.053571 | 62 | 0.740314 | [
"vector"
] |
d8dc94033d64d846fa0dd73c32d0ee99f9fd020f | 1,577 | cpp | C++ | torchshapelets/src/discrepancies.cpp | patrick-kidger/generalised_shapelets | 04930c89dc4673e2af402895fe67655f8375a808 | [
"MIT"
] | 32 | 2020-05-31T17:41:58.000Z | 2022-03-28T18:38:11.000Z | torchshapelets/src/discrepancies.cpp | patrick-kidger/generalised_shapelets | 04930c89dc4673e2af402895fe67655f8375a808 | [
"MIT"
] | 1 | 2022-02-09T22:13:03.000Z | 2022-02-09T23:55:28.000Z | torchshapelets/src/discrepancies.cpp | patrick-kidger/generalised_shapelets | 04930c89dc4673e2af402895fe67655f8375a808 | [
"MIT"
] | 9 | 2020-07-17T16:50:24.000Z | 2021-12-13T11:29:12.000Z | #include <torch/extension.h>
#include <cstdint> // int64_t
#include <functional> // std::function
#include "discrepancies.hpp"
namespace torchshapelets {
torch::Tensor l2_discrepancy(torch::Tensor times, torch::Tensor path1, torch::Tensor path2, torch::Tensor linear) {
// times has shape (length,)
... | 43.805556 | 122 | 0.601141 | [
"shape"
] |
d8ea37fde93ab906f85089d7d02c5ec3f3d4b76f | 1,580 | hpp | C++ | time_independent/include/stn.hpp | Kei18/time-independent-planning | 8540a2fa836f077406cbca7f6e442fdd7d2f840b | [
"MIT"
] | 6 | 2021-02-01T07:51:30.000Z | 2021-12-22T12:52:00.000Z | time_independent/include/stn.hpp | nobodyczcz/time-independent-planning | 92ec87de867e1f190c0c80a66c4a410a12da4821 | [
"MIT"
] | null | null | null | time_independent/include/stn.hpp | nobodyczcz/time-independent-planning | 92ec87de867e1f190c0c80a66c4a410a12da4821 | [
"MIT"
] | 2 | 2021-06-20T05:41:28.000Z | 2021-09-14T13:19:51.000Z | /*
* Simple Temporal Network
*
* used to convert time-independent planning to MAPF execution
*
* ref
* Hönig, W., Kumar, T. S., Cohen, L., Ma, H., Xu, H., Ayanian, N., & Koenig, S. (2016, June).
* Multi-Agent Path Finding with Kinematic Constraints.
* In ICAPS (Vol. 16, pp. 477-485).
*/
#pragma once
#include ... | 26.779661 | 94 | 0.660127 | [
"vector"
] |
2b033b048ff4e38c853874605c57f8a89b6a3bb1 | 699 | cpp | C++ | leetcode/890. Find and Replace Pattern.cpp | chamow97/Interview-Prep | 9ce13afef6090b1604f72bf5f80a6e1df65be24f | [
"MIT"
] | 1 | 2018-09-13T12:16:42.000Z | 2018-09-13T12:16:42.000Z | leetcode/890. Find and Replace Pattern.cpp | chamow97/Interview-Prep | 9ce13afef6090b1604f72bf5f80a6e1df65be24f | [
"MIT"
] | null | null | null | leetcode/890. Find and Replace Pattern.cpp | chamow97/Interview-Prep | 9ce13afef6090b1604f72bf5f80a6e1df65be24f | [
"MIT"
] | null | null | null | class Solution {
public:
string patternize(string str) {
unordered_map<char, string> m;
int curr = 11;
string pattern = "";
for(auto i : str) {
if(m.find(i) == m.end()) {
m[i] = (to_string(curr));
curr++;
}
pattern +... | 25.888889 | 81 | 0.463519 | [
"vector"
] |
2b0dfc13a0acd99016554485bf390009bef10a80 | 1,111 | cpp | C++ | LeetCodeCPP/_1042. Flower Planting With No Adjacent/main.cpp | 18600130137/leetcode | fd2dc72c0b85da50269732f0fcf91326c4787d3a | [
"Apache-2.0"
] | 1 | 2019-03-29T03:33:56.000Z | 2019-03-29T03:33:56.000Z | LeetCodeCPP/_1042. Flower Planting With No Adjacent/main.cpp | 18600130137/leetcode | fd2dc72c0b85da50269732f0fcf91326c4787d3a | [
"Apache-2.0"
] | null | null | null | LeetCodeCPP/_1042. Flower Planting With No Adjacent/main.cpp | 18600130137/leetcode | fd2dc72c0b85da50269732f0fcf91326c4787d3a | [
"Apache-2.0"
] | null | null | null | //
// main.cpp
// _1042. Flower Planting With No Adjacent
//
// Created by admin on 2019/5/13.
// Copyright © 2019年 liu. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> gardenNoAdj(int N, vector<vector<int>>& paths) {
vector<vect... | 22.22 | 64 | 0.475248 | [
"vector"
] |
2b1641d905d20d7a799b8093b7a279e03b67808a | 6,830 | hpp | C++ | src/libraries/core/interpolation/surfaceInterpolation/schemes/CentredFitScheme/CentredFitScheme.hpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | src/libraries/core/interpolation/surfaceInterpolation/schemes/CentredFitScheme/CentredFitScheme.hpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | src/libraries/core/interpolation/surfaceInterpolation/schemes/CentredFitScheme/CentredFitScheme.hpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | /*---------------------------------------------------------------------------*\
Copyright (C) 2011 OpenFOAM Foundation
-------------------------------------------------------------------------------
License
This file is part of CAELUS.
CAELUS is free software: you can redistribute it and/or modify it
under... | 36.524064 | 79 | 0.448463 | [
"mesh",
"vector"
] |
2b29ca9d6f9efbea3d0b38d18bf61a2525a4e6d1 | 4,716 | cpp | C++ | benchmarks/ovs/verif_ovs_list_test.cpp | Nic30/pclass-vectorized | 33bc92c66f717896fb48bd5c382729f8c76bc882 | [
"MIT"
] | 1 | 2020-07-14T17:24:33.000Z | 2020-07-14T17:24:33.000Z | benchmarks/ovs/verif_ovs_list_test.cpp | Nic30/pclass-vectorized | 33bc92c66f717896fb48bd5c382729f8c76bc882 | [
"MIT"
] | 14 | 2019-03-14T09:24:37.000Z | 2019-12-19T17:44:21.000Z | benchmarks/ovs/verif_ovs_list_test.cpp | Nic30/pclass-vectorized | 33bc92c66f717896fb48bd5c382729f8c76bc882 | [
"MIT"
] | null | null | null | #define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MAIN
#define BOOST_TEST_MODULE pcv_test
#include "test_common.h"
#include <limits>
#include <vector>
#include <pcv/partition_sort/b_tree.h>
#include <pcv/partition_sort/b_tree_search.h>
#include <pcv/partition_sort/b_tree_insert.h>
#include <pcv/partition_sort/b_tree_rem... | 29.291925 | 79 | 0.649915 | [
"vector"
] |
1a7ea8d9db25f45b204882e926e77d70d3f09c6c | 5,608 | cpp | C++ | nucleus/library/application/hoople_service.cpp | fredhamster/feisty_meow | 66dc4221dc485a5cf9e28b724fe36268e8843043 | [
"Apache-2.0"
] | 2 | 2019-01-22T23:34:37.000Z | 2021-10-31T15:44:15.000Z | nucleus/library/application/hoople_service.cpp | fredhamster/feisty_meow | 66dc4221dc485a5cf9e28b724fe36268e8843043 | [
"Apache-2.0"
] | 2 | 2020-06-01T16:35:46.000Z | 2021-10-05T21:02:09.000Z | nucleus/library/application/hoople_service.cpp | fredhamster/feisty_meow | 66dc4221dc485a5cf9e28b724fe36268e8843043 | [
"Apache-2.0"
] | null | null | null | //////////////
// Name : hoople_service
// Author : Chris Koeritz
//////////////
// Copyright (c) 2000-$now By Author. This program 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:
// http://www.gnu.or... | 25.035714 | 77 | 0.713802 | [
"object"
] |
1a847195caadbf7254cfb27cecaa84820e4bb08d | 655 | cpp | C++ | InterviewBit/Two Pointers/3_sum.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 36 | 2019-12-27T08:23:08.000Z | 2022-01-24T20:35:47.000Z | InterviewBit/Two Pointers/3_sum.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 10 | 2019-11-13T02:55:18.000Z | 2021-10-13T23:28:09.000Z | InterviewBit/Two Pointers/3_sum.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 53 | 2020-08-15T11:08:40.000Z | 2021-10-09T15:51:38.000Z | // https://www.interviewbit.com/problems/3-sum/
int Solution::threeSumClosest(vector<int> &A, int B) {
int n = A.size();
int minDiff = INT_MAX;
int bestSum = 0;
sort(A.begin(), A.end());
for(int i=0;i<n-2;i++) {
int j=i+1;
int k=n-1;
while(j<k) {
... | 21.129032 | 54 | 0.392366 | [
"vector"
] |
1a8bdcc18fde7f8de2778be5ec3b0517bf284512 | 6,976 | cc | C++ | compy/representations/extractors/clang_ast/clang_graph_frontendaction.cc | AndersonFaustino/compy-learn | 24a394bd1ddc109a37b348c3de440389fa9a1f23 | [
"Apache-2.0"
] | 12 | 2020-09-17T07:57:13.000Z | 2022-03-16T03:42:58.000Z | compy/representations/extractors/clang_ast/clang_graph_frontendaction.cc | bennofs/compy-learn | b8674e2c59a2abca98d9e2a3d49e073ca3ae91af | [
"Apache-2.0"
] | 11 | 2020-10-26T09:39:11.000Z | 2021-12-04T18:31:25.000Z | compy/representations/extractors/clang_ast/clang_graph_frontendaction.cc | bennofs/compy-learn | b8674e2c59a2abca98d9e2a3d49e073ca3ae91af | [
"Apache-2.0"
] | 10 | 2020-12-30T18:06:04.000Z | 2022-02-25T00:11:57.000Z | #include "clang_graph_frontendaction.h"
#include <exception>
#include <iostream>
#include <utility>
#include "clang/AST/ASTConsumer.h"
#include "clang/AST/Decl.h"
#include "clang/Analysis/CFG.h"
#include "clang/Frontend/ASTConsumers.h"
#include "clang/Frontend/CompilerInstance.h"
#include "clang/Frontend/MultiplexCon... | 28.242915 | 80 | 0.674025 | [
"vector"
] |
1a8cb167d4a1fb445bcc51452c527ed71b5dc176 | 694 | cpp | C++ | Classes/Model/LoadModel.cpp | jacket-code/Cocos3DEditor | 89b3542192de893a48c45e47e2fa3b183ca04c7b | [
"MIT"
] | 1 | 2020-05-14T05:52:34.000Z | 2020-05-14T05:52:34.000Z | Classes/Model/LoadModel.cpp | jacket-code/Cocos3DEditor | 89b3542192de893a48c45e47e2fa3b183ca04c7b | [
"MIT"
] | null | null | null | Classes/Model/LoadModel.cpp | jacket-code/Cocos3DEditor | 89b3542192de893a48c45e47e2fa3b183ca04c7b | [
"MIT"
] | 1 | 2020-10-31T11:59:48.000Z | 2020-10-31T11:59:48.000Z |
#include "../Global/GlobalDefine.h"
#include "../MyLibrary/MyLibrary.h"
#include "./LoadModel.h"
USING_NS_CC;
USING_NS_C3E;
USING_NS_STD;
LoadModel::LoadModel()
{
}
LoadModel::~LoadModel()
{
}
Sprite3D* LoadModel::loadModelData( const string& filePath )
{
string str = MyLibrary::StringUtility::getFileName( filePa... | 17.794872 | 85 | 0.68732 | [
"model"
] |
1a92812a14c7201c94cc8310890afcc29edc3eba | 3,074 | cpp | C++ | modules/Stubs/testing/source/StubMeshTests.cpp | nasa/swSim | 348ba39ea149711a2285916a2dcddc2c71da4859 | [
"Apache-2.0"
] | 5 | 2021-02-21T09:49:11.000Z | 2022-02-01T09:54:54.000Z | modules/Stubs/testing/source/StubMeshTests.cpp | ElsevierSoftwareX/SOFTX-D-21-00042 | 348ba39ea149711a2285916a2dcddc2c71da4859 | [
"Apache-2.0"
] | null | null | null | modules/Stubs/testing/source/StubMeshTests.cpp | ElsevierSoftwareX/SOFTX-D-21-00042 | 348ba39ea149711a2285916a2dcddc2c71da4859 | [
"Apache-2.0"
] | 4 | 2021-04-27T09:52:17.000Z | 2022-03-29T07:22:16.000Z | //
#include "StubMesh.hpp"
#include "gtest/gtest.h"
void boundingBoxCheck(double currentBox[6],double newPoint[3]);
class StubMeshTests : public ::testing::Test {
protected:
void SetUp() override {
mesh=std::make_shared<Stubs::StubMesh>(Stubs::StubMesh(ds,Nx,Ny,Nz));
};
void TearDown() override {
};
s... | 24.592 | 79 | 0.614834 | [
"mesh"
] |
1a960108694f1aa9a69d7ad3cfa2cd2c112f8f85 | 26,807 | cc | C++ | orly/data/twitter_live.cc | orlyatomics/orly | d413f999f51a8e553832dab4e3baa7ca68928840 | [
"Apache-2.0"
] | 69 | 2015-01-06T05:12:57.000Z | 2021-11-06T20:34:10.000Z | orly/data/twitter_live.cc | mpark/orly | 9d5033bb6034e97ebf944ab25398c6879709cc32 | [
"Apache-2.0"
] | 5 | 2015-07-09T02:21:50.000Z | 2021-08-13T11:10:26.000Z | orly/data/twitter_live.cc | mpark/orly | 9d5033bb6034e97ebf944ab25398c6879709cc32 | [
"Apache-2.0"
] | 15 | 2015-01-23T13:34:05.000Z | 2020-06-15T16:46:50.000Z | /* <orly/data/twitter_live.cc>
Copyright 2010-2014 OrlyAtomics, Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required... | 49.734694 | 211 | 0.702802 | [
"vector"
] |
1a9662b73606f6a504d58a1fc8d9f8f1395147e6 | 633 | cc | C++ | test/mdlConvert.cc | cwsmith/core | 840fbf6ec49a63aeaa3945f11ddb224f6055ac9f | [
"BSD-3-Clause"
] | 1 | 2021-12-02T09:25:32.000Z | 2021-12-02T09:25:32.000Z | test/mdlConvert.cc | cwsmith/core | 840fbf6ec49a63aeaa3945f11ddb224f6055ac9f | [
"BSD-3-Clause"
] | null | null | null | test/mdlConvert.cc | cwsmith/core | 840fbf6ec49a63aeaa3945f11ddb224f6055ac9f | [
"BSD-3-Clause"
] | null | null | null | #include <stdio.h>
#include <SimUtil.h>
#include <MeshSim.h>
#include <SimModel.h>
#include "gmi_sim.h"
#include "gmi_mesh.h"
int main(int argc, char** argv)
{
if (argc != 3) {
printf("Convert simmetrix smd model to a gmi dmg model\n");
printf("Usage: %s <simmetrix smd model> <gmi dmg model>\n", argv[0]);
... | 21.1 | 73 | 0.660348 | [
"model"
] |
1a9bbf60ab340367dd5350bdf48c55cc34fa4fba | 6,209 | cpp | C++ | core/model/src/xml_annotation_t.cpp | lkeegan/spatial-model-editor | 5dcb06550607b0a734acddd8b719035b68e35307 | [
"MIT"
] | 4 | 2019-07-18T15:05:09.000Z | 2020-03-14T09:50:07.000Z | core/model/src/xml_annotation_t.cpp | lkeegan/spatial-model-editor | 5dcb06550607b0a734acddd8b719035b68e35307 | [
"MIT"
] | 328 | 2019-06-30T12:03:01.000Z | 2020-10-05T15:56:35.000Z | core/model/src/xml_annotation_t.cpp | lkeegan/spatial-model-editor | 5dcb06550607b0a734acddd8b719035b68e35307 | [
"MIT"
] | 1 | 2019-06-08T22:47:14.000Z | 2019-06-08T22:47:14.000Z | #include "catch_wrapper.hpp"
#include "model_test_utils.hpp"
#include "sme/simulate_options.hpp"
#include "sme/xml_annotation.hpp"
#include <QFile>
using namespace sme;
using namespace sme::test;
TEST_CASE("XML Annotations",
"[core/model/xml_annotation][core/"
"model][core][model][xml_annotation][... | 49.672 | 79 | 0.744242 | [
"model"
] |
1a9c7e5d4bb6b4ee63cf48664064c350850df5ec | 28,222 | cpp | C++ | src/ExpressionMatrixLshGpu.cpp | iosonofabio/ExpressionMatrix2 | a6fc6938fe857fe1bd6a9200071957691295ba3c | [
"MIT"
] | null | null | null | src/ExpressionMatrixLshGpu.cpp | iosonofabio/ExpressionMatrix2 | a6fc6938fe857fe1bd6a9200071957691295ba3c | [
"MIT"
] | null | null | null | src/ExpressionMatrixLshGpu.cpp | iosonofabio/ExpressionMatrix2 | a6fc6938fe857fe1bd6a9200071957691295ba3c | [
"MIT"
] | null | null | null | #if CZI_EXPRESSION_MATRIX2_BUILD_FOR_GPU
#include "ExpressionMatrix.hpp"
#include "ExpressionMatrixSubset.hpp"
#include "heap.hpp"
#include "Lsh.hpp"
#include "SimilarPairs.hpp"
#include "timestamp.hpp"
using namespace ChanZuckerberg;
using namespace ExpressionMatrix2;
void ExpressionMatrix::findSimilarPairs4Gpu(
... | 44.23511 | 122 | 0.616753 | [
"object",
"vector"
] |
1a9d7a5aca20b70ebba52d74d144531007237089 | 8,230 | cpp | C++ | src/data/datasets/datasettensor.cpp | mhough/braingl | 53e2078adc10731ee62feec11dcb767c4c6c0d35 | [
"MIT"
] | 5 | 2016-03-17T07:02:11.000Z | 2021-12-12T14:43:58.000Z | src/data/datasets/datasettensor.cpp | mhough/braingl | 53e2078adc10731ee62feec11dcb767c4c6c0d35 | [
"MIT"
] | null | null | null | src/data/datasets/datasettensor.cpp | mhough/braingl | 53e2078adc10731ee62feec11dcb767c4c6c0d35 | [
"MIT"
] | 3 | 2015-10-29T15:21:01.000Z | 2020-11-25T09:41:21.000Z | /*
* dataset3d.cpp
*
* Created on: May 9, 2012
* @author Ralph Schurade
*/
#include "datasettensor.h"
#include "../models.h"
#include "../../algos/fmath.h"
#include "../../gui/gl/tensorrenderer.h"
#include "../../gui/gl/tensorrendererev.h"
DatasetTensor::DatasetTensor( QDir filename, std::vector<Matrix> data, n... | 34.008264 | 139 | 0.590036 | [
"vector"
] |
1aa4ac34c76862c5c12db3dea8b033868460e37f | 16,192 | cpp | C++ | mcp/src/include_manager.cpp | mvidelgauz/ferret | 3da27b1020e23d9f01a36a410622cdbad7e46b70 | [
"MIT"
] | null | null | null | mcp/src/include_manager.cpp | mvidelgauz/ferret | 3da27b1020e23d9f01a36a410622cdbad7e46b70 | [
"MIT"
] | null | null | null | mcp/src/include_manager.cpp | mvidelgauz/ferret | 3da27b1020e23d9f01a36a410622cdbad7e46b70 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cassert>
#include <cstdlib>
#include <sstream>
#include "include_manager.h"
#include "glob_utility.h"
#include "engine.h"
#include "base_node.h"
#include "hash_set.h"
using namespace std;
static bool isCppFile( const string &ext )
{
return ext == ".cpp" || ext == ".c" || ext == ".cc... | 32 | 138 | 0.443738 | [
"vector"
] |
1ab16749b856f5f32db73d4720f2f229925a2dc1 | 3,315 | cpp | C++ | Samples/Win32/ThunderRumble/Common/MineProjectile.cpp | yazhenchua/PlayFab-Samples | 85d1d252bd21d050575c382628caa6d0c9785ff7 | [
"MIT"
] | 160 | 2016-05-26T09:30:20.000Z | 2022-03-31T08:05:56.000Z | Samples/Win32/ThunderRumble/Common/MineProjectile.cpp | srivers8424/PlayFab-Samples | 9fe465858e7f9bae3250dfe77d4500bb57d9e7fd | [
"MIT"
] | 17 | 2016-03-22T17:37:16.000Z | 2021-11-20T23:20:07.000Z | Samples/Win32/ThunderRumble/Common/MineProjectile.cpp | srivers8424/PlayFab-Samples | 9fe465858e7f9bae3250dfe77d4500bb57d9e7fd | [
"MIT"
] | 204 | 2016-05-14T22:46:51.000Z | 2022-03-04T00:45:56.000Z | //--------------------------------------------------------------------------------------
// MineProjectile.cpp
//
// Advanced Technology Group (ATG)
// Copyright (C) Microsoft Corporation. All rights reserved.
//--------------------------------------------------------------------------------------
#include "pch.h"
#in... | 25.898438 | 131 | 0.625943 | [
"object"
] |
1acab83eb466e23deaf51e6498c69ea82874b2ce | 2,178 | cpp | C++ | clients/cpp-tizen/generated/src/ClockDifference.cpp | cliffano/jenkins-api-clients-generator | 522d02b3a130a29471df5ec1d3d22c822b3d0813 | [
"MIT"
] | 23 | 2017-08-01T12:25:26.000Z | 2022-01-25T03:44:11.000Z | clients/cpp-tizen/generated/src/ClockDifference.cpp | cliffano/jenkins-api-clients-generator | 522d02b3a130a29471df5ec1d3d22c822b3d0813 | [
"MIT"
] | 35 | 2017-06-14T03:28:15.000Z | 2022-02-14T10:25:54.000Z | clients/cpp-tizen/generated/src/ClockDifference.cpp | cliffano/jenkins-api-clients-generator | 522d02b3a130a29471df5ec1d3d22c822b3d0813 | [
"MIT"
] | 11 | 2017-08-31T19:00:20.000Z | 2021-12-19T12:04:12.000Z | #include <map>
#include <cstdlib>
#include <glib-object.h>
#include <json-glib/json-glib.h>
#include "Helpers.h"
#include "ClockDifference.h"
using namespace std;
using namespace Tizen::ArtikCloud;
ClockDifference::ClockDifference()
{
//__init();
}
ClockDifference::~ClockDifference()
{
//__cleanup();
}
void
Clo... | 16.014706 | 80 | 0.668962 | [
"object"
] |
1ad4bed618e361e83e33017d1c4348c781a26984 | 686 | cpp | C++ | data/train/cpp/1ad4bed618e361e83e33017d1c4348c781a26984ModelNode.cpp | harshp8l/deep-learning-lang-detection | 2a54293181c1c2b1a2b840ddee4d4d80177efb33 | [
"MIT"
] | 84 | 2017-10-25T15:49:21.000Z | 2021-11-28T21:25:54.000Z | data/train/cpp/1ad4bed618e361e83e33017d1c4348c781a26984ModelNode.cpp | vassalos/deep-learning-lang-detection | cbb00b3e81bed3a64553f9c6aa6138b2511e544e | [
"MIT"
] | 5 | 2018-03-29T11:50:46.000Z | 2021-04-26T13:33:18.000Z | data/train/cpp/1ad4bed618e361e83e33017d1c4348c781a26984ModelNode.cpp | vassalos/deep-learning-lang-detection | cbb00b3e81bed3a64553f9c6aa6138b2511e544e | [
"MIT"
] | 24 | 2017-11-22T08:31:00.000Z | 2022-03-27T01:22:31.000Z | // Copyright © 2008-2014 Pioneer Developers. See AUTHORS.txt for details
// Licensed under the terms of the GPL v3. See licenses/GPL-3.txt
#include "ModelNode.h"
#include "Model.h"
namespace SceneGraph {
ModelNode::ModelNode(Model *m)
: Node(m->GetRenderer())
, m_model(m)
{
}
ModelNode::ModelNode(const ModelNode &m... | 19.6 | 72 | 0.731778 | [
"render",
"model"
] |
1ad96c98e9acb5c8fd593545e9cfca172fd8e794 | 3,051 | cpp | C++ | src/fileio.cpp | sus304/ForRocket | 10fdcd0ce5a30fbbb4fec6315bcd64314bec6c12 | [
"MIT"
] | 21 | 2015-12-17T14:19:24.000Z | 2021-09-09T07:17:17.000Z | src/fileio.cpp | sus304/ForRocket | 10fdcd0ce5a30fbbb4fec6315bcd64314bec6c12 | [
"MIT"
] | 2 | 2015-12-17T19:45:50.000Z | 2021-02-07T05:28:34.000Z | src/fileio.cpp | sus304/ForRocket | 10fdcd0ce5a30fbbb4fec6315bcd64314bec6c12 | [
"MIT"
] | 10 | 2015-12-17T19:13:51.000Z | 2021-09-27T01:14:14.000Z | // ******************************************************
// Project Name : ForRocket
// File Name : fileio.cpp
// Creation Date : 2019/11/24
//
// Copyright (c) 2019 Susumu Tanaka. All rights reserved.
// ******************************************************
#include "fileio.hpp"
#include <iost... | 33.163043 | 95 | 0.504425 | [
"vector"
] |
1adc9fc7234038f27aecc71dde55fdf9ad9daeff | 4,952 | cpp | C++ | src/player.cpp | liu-chien/LoveLetter-BoardGame | 7609b2c763b4f109f54b7a14d48ade914088f35e | [
"MIT"
] | null | null | null | src/player.cpp | liu-chien/LoveLetter-BoardGame | 7609b2c763b4f109f54b7a14d48ade914088f35e | [
"MIT"
] | 1 | 2021-04-02T22:24:20.000Z | 2021-04-02T22:24:20.000Z | src/player.cpp | liu-chien/LoveLetter-BoardGame | 7609b2c763b4f109f54b7a14d48ade914088f35e | [
"MIT"
] | 1 | 2021-03-15T18:17:19.000Z | 2021-03-15T18:17:19.000Z | #include "player.h"
#include <assert.h>
#include <stdio.h>
#include <unistd.h>
#include <algorithm>
#include <iostream>
#include <random>
#include "card.h"
#define KEY_UP 65
#define KEY_DOWN 66
#define KEY_RIGHT 67
#define KEY_LEFT 68
namespace loveletter {
void Player::draw(Card card) {
assert(handCards.size()... | 25.926702 | 80 | 0.599556 | [
"vector"
] |
1ae18e5cb99740a5c60bd22d0e9f5d4029cf6626 | 9,579 | cpp | C++ | geomic.cpp | deevroman/algorithms-tasks | 2c854a0033eacb42a454dabec1ecb63461e8cb53 | [
"MIT"
] | null | null | null | geomic.cpp | deevroman/algorithms-tasks | 2c854a0033eacb42a454dabec1ecb63461e8cb53 | [
"MIT"
] | null | null | null | geomic.cpp | deevroman/algorithms-tasks | 2c854a0033eacb42a454dabec1ecb63461e8cb53 | [
"MIT"
] | null | null | null |
namespace Geomic{
const ld eps = 1e-12;
bool eq(ld x, ld y){
return x == y;
return fabs(x - y) < eps;
}
struct Point{
ld x, y;
Point(ld x_, ld y_) {
x = x_;
y = y_;
}
Point() {
x = 0.0;
y = 0.0;
}
... | 32.471186 | 118 | 0.371751 | [
"vector"
] |
1aec2ef2a64495834e6e574686e70c652ea4057d | 8,497 | cc | C++ | xdl-algorithm-solution/TDM/src/tdm/dist_tree_test.cc | hitflame/x-deeplearning | c8029396c6ae6dbf397a34a1801ceadc824e4f8d | [
"Apache-2.0"
] | 4,071 | 2018-12-13T04:17:38.000Z | 2022-03-30T03:29:35.000Z | xdl-algorithm-solution/TDM/src/tdm/dist_tree_test.cc | laozhuang727/x-deeplearning | 781545783a4e2bbbda48fc64318fb2c6d8bbb3cc | [
"Apache-2.0"
] | 359 | 2018-12-21T01:14:57.000Z | 2022-02-15T07:18:02.000Z | xdl-algorithm-solution/TDM/src/tdm/dist_tree_test.cc | laozhuang727/x-deeplearning | 781545783a4e2bbbda48fc64318fb2c6d8bbb3cc | [
"Apache-2.0"
] | 1,054 | 2018-12-20T09:57:42.000Z | 2022-03-29T07:16:53.000Z | /* Copyright (C) 2016-2018 Alibaba Group Holding Limited
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed ... | 27.767974 | 80 | 0.633165 | [
"vector"
] |
8c28f265fab58b8ef1b604dc11bfdb0235ac02ca | 12,639 | cpp | C++ | src/explore.cpp | Henryyy-Hung/LinuxTerminalGame-TheFission | 6309f4629fd219f04c10ac728ad8744c1ec78c99 | [
"Apache-2.0"
] | 11 | 2021-05-27T06:20:55.000Z | 2022-01-30T12:58:43.000Z | src/explore.cpp | Henryyy-Hung/TheFission | 6309f4629fd219f04c10ac728ad8744c1ec78c99 | [
"Apache-2.0"
] | null | null | null | src/explore.cpp | Henryyy-Hung/TheFission | 6309f4629fd219f04c10ac728ad8744c1ec78c99 | [
"Apache-2.0"
] | null | null | null | // File name: explore.cpp
// Author: Hung Ka Hing
// UID: 3035782750
// Description: To hold functions regarding explore (i.e. map, move, bag).
#include "explore.h" // include self defined structures, external library, and function header of explore.cpp
#include "interface.h" // include function header in inte... | 32.828571 | 147 | 0.622834 | [
"vector"
] |
8c329d9ce811ec53e94081a6f0368e5150022f00 | 6,548 | cpp | C++ | Netcode/Network/NetworkCommon.cpp | tyekx/netcode | c46fef1eeb33ad029d0c262d39309dfa83f76c4d | [
"MIT"
] | null | null | null | Netcode/Network/NetworkCommon.cpp | tyekx/netcode | c46fef1eeb33ad029d0c262d39309dfa83f76c4d | [
"MIT"
] | null | null | null | Netcode/Network/NetworkCommon.cpp | tyekx/netcode | c46fef1eeb33ad029d0c262d39309dfa83f76c4d | [
"MIT"
] | null | null | null | #include <algorithm>
#include "NetworkCommon.h"
#include "../Logger.h"
#include "Macros.h"
#include <NetcodeFoundation/Exceptions.h>
#include <string>
#include <iphlpapi.h>
#include <WinSock2.h>
namespace Netcode::Network {
NetworkContext::~NetworkContext() {
Stop();
}
NetworkContext::NetworkContext() : ioc{}... | 24.709434 | 144 | 0.680055 | [
"vector"
] |
8c38c15f9a21b335254dda19aeeacc26521066c6 | 1,340 | cpp | C++ | octopuses with watches(full score)/octopus.cpp | papachristoumarios/IEEEXtreme11.0 | 4c3b5aaa71641a6d0b3e9823c4738050f2553b27 | [
"MIT"
] | 13 | 2018-10-11T14:13:56.000Z | 2022-02-17T18:30:17.000Z | octopuses with watches(full score)/octopus.cpp | papachristoumarios/IEEEXtreme11.0-PComplete | 4c3b5aaa71641a6d0b3e9823c4738050f2553b27 | [
"MIT"
] | null | null | null | octopuses with watches(full score)/octopus.cpp | papachristoumarios/IEEEXtreme11.0-PComplete | 4c3b5aaa71641a6d0b3e9823c4738050f2553b27 | [
"MIT"
] | 7 | 2018-10-24T08:36:59.000Z | 2021-07-19T18:16:53.000Z | #include <cstdio>
#include <algorithm>
#include <vector>
#define MAXN 10
using namespace std;
int grid[ MAXN + 1 ][ MAXN + 1 ];
int main( void ) {
int N, M;
scanf("%d%d", &N, &M );
for( int i = 0; i < N; i++ ) {
for( int j = 0; j < M; j++ ) {
scanf("%d", &grid[ i ][ j ] );
... | 25.283019 | 69 | 0.324627 | [
"vector"
] |
8c3ba7dd0a3e87128a940dcbc794c93d05495fea | 23,776 | cpp | C++ | 11_learning_materials/stanford_self_driving_car/perception/chamfer_matching/src/chamfer_matching.cpp | EatAllBugs/autonomous_learning | 02ff7b0fa7b131a2f2203505ef5cc7e43b40bc47 | [
"MIT"
] | 14 | 2021-09-01T14:25:45.000Z | 2022-02-21T08:49:57.000Z | 11_learning_materials/stanford_self_driving_car/perception/chamfer_matching/src/chamfer_matching.cpp | yinflight/autonomous_learning | 02ff7b0fa7b131a2f2203505ef5cc7e43b40bc47 | [
"MIT"
] | null | null | null | 11_learning_materials/stanford_self_driving_car/perception/chamfer_matching/src/chamfer_matching.cpp | yinflight/autonomous_learning | 02ff7b0fa7b131a2f2203505ef5cc7e43b40bc47 | [
"MIT"
] | 3 | 2021-10-10T00:58:29.000Z | 2022-01-23T13:16:09.000Z | /*********************************************************************
* Software License Agreement (BSD License)
*
* Copyright (c) 2008, Willow Garage, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following condit... | 24.740895 | 158 | 0.657386 | [
"object",
"vector",
"transform"
] |
8c3d32b676e17e69210320d135d3a9471337c34d | 987 | cpp | C++ | problems/665-non-decreasing-array.cpp | ZhongRuoyu/leetcode | a905ec08e9b8ad8931d09e03efb154a648790c78 | [
"MIT"
] | 1 | 2022-01-11T06:32:41.000Z | 2022-01-11T06:32:41.000Z | problems/665-non-decreasing-array.cpp | ZhongRuoyu/LeetCode | 7472ef8b868165b485e5ce0676226bbe95561b73 | [
"MIT"
] | null | null | null | problems/665-non-decreasing-array.cpp | ZhongRuoyu/LeetCode | 7472ef8b868165b485e5ce0676226bbe95561b73 | [
"MIT"
] | null | null | null | // Solved 2021-03-03 18:29
// Runtime: 16 ms (99.70%)
// Memory Usage: 26.9 MB (84.29%)
class Solution {
public:
bool checkPossibility(vector<int> &nums) {
bool modified = false;
int prev = nums[0];
for (int i = 1; i < nums.size(); ++i) {
if (prev > nums[i]) {
... | 26.675676 | 68 | 0.454914 | [
"vector"
] |
8c409242021e8a7b8147a7a0c6aa65c4ddb51aae | 1,381 | cpp | C++ | Frunze/main.cpp | rusucosmin/Cplusplus | 0e95cd01d20b22404aa4166c71d5a9e834a5a21b | [
"MIT"
] | 11 | 2015-08-29T13:41:22.000Z | 2020-01-08T20:34:06.000Z | Frunze/main.cpp | rusucosmin/Cplusplus | 0e95cd01d20b22404aa4166c71d5a9e834a5a21b | [
"MIT"
] | null | null | null | Frunze/main.cpp | rusucosmin/Cplusplus | 0e95cd01d20b22404aa4166c71d5a9e834a5a21b | [
"MIT"
] | 5 | 2016-01-20T18:17:01.000Z | 2019-10-30T11:57:15.000Z | #include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>
using namespace std;
const char infile[] = "f... | 23.016667 | 86 | 0.569153 | [
"vector"
] |
8c4771f5accba0e5f20eb6f67feddf16bfada8ee | 1,453 | cpp | C++ | Graphs/colouring_slip.cpp | sanjay-rishi/ProgrammingHub | 459944ee9da7f25af7bd358b61b350678ee53882 | [
"MIT"
] | 10 | 2018-10-25T17:47:24.000Z | 2020-05-11T15:04:28.000Z | Graphs/colouring_slip.cpp | sanjay-rishi/ProgrammingHub | 459944ee9da7f25af7bd358b61b350678ee53882 | [
"MIT"
] | 22 | 2018-10-25T17:33:51.000Z | 2019-11-15T03:50:12.000Z | Graphs/colouring_slip.cpp | sanjay-rishi/ProgrammingHub | 459944ee9da7f25af7bd358b61b350678ee53882 | [
"MIT"
] | 150 | 2018-10-25T17:49:26.000Z | 2020-10-28T14:59:19.000Z | #include<iostream>
#include "bits/stdc++.h"
// #include<vector>
using namespace std;
queue <int> q;
int flag=0;
long long n=100000;
int v, e, v1,v2, visited[10000],level[100000], pop=1, colour[100000],c=1;
vector<int> g[100000];
void bfs(int i)
{
level[1]=1;
//cout<<i<<" at level = "<<level[i]<<endl;
visited[i... | 15.135417 | 75 | 0.462491 | [
"vector"
] |
8c566d3726a7c21ed12d1add4dd0473e72d4d4aa | 12,075 | cpp | C++ | soapy/src/test/test_client.cpp | siglabsoss/s-modem | 0a259b4f3207dd043c198b76a4bc18c8529bcf44 | [
"BSD-3-Clause"
] | null | null | null | soapy/src/test/test_client.cpp | siglabsoss/s-modem | 0a259b4f3207dd043c198b76a4bc18c8529bcf44 | [
"BSD-3-Clause"
] | null | null | null | soapy/src/test/test_client.cpp | siglabsoss/s-modem | 0a259b4f3207dd043c198b76a4bc18c8529bcf44 | [
"BSD-3-Clause"
] | null | null | null | #include <netinet/ip.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <string.h>
#include <unistd.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <unistd.h>
#include <chrono>
#include <queue>
#include "cpp_utils.hpp"
#include "driver/AirPacket.hpp"
#define BITS_PER_MEGA... | 34.110169 | 80 | 0.544845 | [
"vector",
"transform"
] |
8c6df31ba20dc16dc40e1e95fc472701d87df807 | 1,635 | hpp | C++ | include/depthai/pipeline/host_pipeline.hpp | rapyuta-robotics/depthai-core | 785c1c3a3a006d4ccc83c796ea205262a33a702a | [
"MIT"
] | null | null | null | include/depthai/pipeline/host_pipeline.hpp | rapyuta-robotics/depthai-core | 785c1c3a3a006d4ccc83c796ea205262a33a702a | [
"MIT"
] | null | null | null | include/depthai/pipeline/host_pipeline.hpp | rapyuta-robotics/depthai-core | 785c1c3a3a006d4ccc83c796ea205262a33a702a | [
"MIT"
] | null | null | null | #pragma once
#include <list>
#include <memory>
#include <set>
#include <tuple>
#include <vector>
#include <mutex>
#include <boost/lockfree/spsc_queue.hpp>
#include <boost/lockfree/queue.hpp>
#include "depthai/host_data_packet.hpp"
#include "depthai-shared/stream/stream_info.hpp"
#include "depthai-shared/general/da... | 29.196429 | 103 | 0.75474 | [
"vector"
] |
8c81c3845076d614419f2d82fcb5cab4fbda35ae | 3,208 | hpp | C++ | include/LiveProfiler/Collectors/CpuSampleLinuxCollector.hpp | cpv-project/live-profiler | 1ee3e2a8fa4de5c17d834ceaf69e63917e40093c | [
"MIT"
] | 19 | 2017-11-29T09:11:12.000Z | 2022-03-01T16:33:46.000Z | include/LiveProfiler/Collectors/CpuSampleLinuxCollector.hpp | cpv-project/live-profiler | 1ee3e2a8fa4de5c17d834ceaf69e63917e40093c | [
"MIT"
] | 9 | 2017-12-06T03:21:40.000Z | 2018-08-23T10:41:29.000Z | include/LiveProfiler/Collectors/CpuSampleLinuxCollector.hpp | cpv-project/live-profiler | 1ee3e2a8fa4de5c17d834ceaf69e63917e40093c | [
"MIT"
] | 7 | 2017-11-29T11:13:11.000Z | 2019-12-18T22:21:51.000Z | #pragma once
#include "BasePerfLinuxCollector.hpp"
#include "../Models/CpuSampleModel.hpp"
namespace LiveProfiler {
/**
* Collector for collecting cpu samples on linux, based on perf_events
*
* Q: Why callchain is incomplete for my program?
* A: Backtrace is based on frame pointer, please compile with -fno-om... | 32.08 | 95 | 0.70106 | [
"model"
] |
8c847f73b6376ec1ffb9040aef14c4743445f8ed | 1,818 | cpp | C++ | GRAPH ALGORITHM/WEEK 2 DECOMPOSITION 2/3 STRONGLY CONNECTED/strongly_connected.cpp | Mohit-007/DSA-UCDS-COURSERA | f5826a6f393e3b69ed8cf1c47df4d7a319b2d1fd | [
"MIT"
] | null | null | null | GRAPH ALGORITHM/WEEK 2 DECOMPOSITION 2/3 STRONGLY CONNECTED/strongly_connected.cpp | Mohit-007/DSA-UCDS-COURSERA | f5826a6f393e3b69ed8cf1c47df4d7a319b2d1fd | [
"MIT"
] | null | null | null | GRAPH ALGORITHM/WEEK 2 DECOMPOSITION 2/3 STRONGLY CONNECTED/strongly_connected.cpp | Mohit-007/DSA-UCDS-COURSERA | f5826a6f393e3b69ed8cf1c47df4d7a319b2d1fd | [
"MIT"
] | null | null | null | #include <algorithm>
#include <iostream>
#include <vector>
#include <stack>
using std::vector;
using std::pair;
using std::stack;
vector<vector<int> > reverse_edges(vector<vector<int> > &adjacency_list)
{
vector<vector<int> > reverse_adj(adjacency_list.size(), vector<int>());
int i,j;
for(i=0;i<adjacency_list... | 19.340426 | 110 | 0.628163 | [
"vector"
] |
8c8d4001c14374d509e23ca5181a7600b66fa2b0 | 19,134 | cxx | C++ | PWGLF/SPECTRA/PiKaPr/TestAOD/AliAnalysisTaskSpectraBoth.cxx | maroozm/AliPhysics | 22ec256928cfdf8f800e05bfc1a6e124d90b6eaf | [
"BSD-3-Clause"
] | 114 | 2017-03-03T09:12:23.000Z | 2022-03-03T20:29:42.000Z | PWGLF/SPECTRA/PiKaPr/TestAOD/AliAnalysisTaskSpectraBoth.cxx | maroozm/AliPhysics | 22ec256928cfdf8f800e05bfc1a6e124d90b6eaf | [
"BSD-3-Clause"
] | 19,637 | 2017-01-16T12:34:41.000Z | 2022-03-31T22:02:40.000Z | PWGLF/SPECTRA/PiKaPr/TestAOD/AliAnalysisTaskSpectraBoth.cxx | maroozm/AliPhysics | 22ec256928cfdf8f800e05bfc1a6e124d90b6eaf | [
"BSD-3-Clause"
] | 1,021 | 2016-07-14T22:41:16.000Z | 2022-03-31T05:15:51.000Z | /**************************************************************************
* Copyright(c) 1998-2009, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors ... | 34.537906 | 345 | 0.63996 | [
"object"
] |
8c8ef5da8dac0a5f2f1bb2f33d5d8c311b9b5739 | 1,917 | cpp | C++ | test/doge/meta/partial_sum.cpp | cjdb/doge | 421e1dce86df0eb73a6907408e93d0982adf057d | [
"Apache-2.0"
] | 6 | 2017-10-13T23:01:29.000Z | 2019-07-05T16:04:51.000Z | test/doge/meta/partial_sum.cpp | cjdb/doge | 421e1dce86df0eb73a6907408e93d0982adf057d | [
"Apache-2.0"
] | 46 | 2018-02-05T21:54:11.000Z | 2018-03-12T10:00:08.000Z | test/doge/meta/partial_sum.cpp | cjdb/doge | 421e1dce86df0eb73a6907408e93d0982adf057d | [
"Apache-2.0"
] | 3 | 2018-02-07T14:15:51.000Z | 2018-03-01T11:40:54.000Z | //
// Copyright 2018 Christopher Di Bella
//
// 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 ... | 34.854545 | 111 | 0.663015 | [
"vector"
] |
8c9a8d20777d78c5c025e9831bfe87a782c430f7 | 5,016 | cpp | C++ | smtp-mail.cpp | foglamp/foglamp-notif-email | 4cfe91614e8f9691f52a23a37215fe355349f296 | [
"Apache-2.0"
] | null | null | null | smtp-mail.cpp | foglamp/foglamp-notif-email | 4cfe91614e8f9691f52a23a37215fe355349f296 | [
"Apache-2.0"
] | 3 | 2019-01-17T09:02:22.000Z | 2019-03-28T07:56:21.000Z | smtp-mail.cpp | foglamp/foglamp-notif-email | 4cfe91614e8f9691f52a23a37215fe355349f296 | [
"Apache-2.0"
] | null | null | null | /***************************************************************************
* _ _ ____ _
* Project ___| | | | _ \| |
* / __| | | | |_) | |
* | (__| |_| | _ <| |___
* \___|\... | 30.962963 | 99 | 0.642344 | [
"vector"
] |
8ca99edac144b3a84a1dc484847c2228e5bba733 | 1,235 | hh | C++ | src/c++/include/workflow/MergeReferencesWorkflow.hh | Illumina/Isaac4 | 0924fba8b467868da92e1c48323b15d7cbca17dd | [
"BSD-3-Clause"
] | 13 | 2018-02-09T22:59:39.000Z | 2021-11-29T06:33:22.000Z | src/c++/include/workflow/MergeReferencesWorkflow.hh | Illumina/Isaac4 | 0924fba8b467868da92e1c48323b15d7cbca17dd | [
"BSD-3-Clause"
] | 17 | 2018-01-26T11:36:07.000Z | 2022-02-03T18:48:43.000Z | src/c++/include/workflow/MergeReferencesWorkflow.hh | Illumina/Isaac4 | 0924fba8b467868da92e1c48323b15d7cbca17dd | [
"BSD-3-Clause"
] | 4 | 2018-10-19T20:00:00.000Z | 2020-10-29T14:44:06.000Z | /**
** Isaac Genome Alignment Software
** Copyright (c) 2010-2017 Illumina, Inc.
** All rights reserved.
**
** This software is provided under the terms and conditions of the
** GNU GENERAL PUBLIC LICENSE Version 3
**
** You should have received a copy of the GNU GENERAL PUBLIC LICENSE Version 3
** along with ... | 24.215686 | 79 | 0.734413 | [
"vector"
] |
8cbb062e6fd8228d3bfc3d09e5065e4179300bf7 | 25,239 | cpp | C++ | src/RobustDubins_Solver.cpp | CRL-Technion/Variable-speed-Dubins-with-wind | 4c0cf8bb1ae11bcd78bffbba5392b892fee53608 | [
"MIT"
] | null | null | null | src/RobustDubins_Solver.cpp | CRL-Technion/Variable-speed-Dubins-with-wind | 4c0cf8bb1ae11bcd78bffbba5392b892fee53608 | [
"MIT"
] | null | null | null | src/RobustDubins_Solver.cpp | CRL-Technion/Variable-speed-Dubins-with-wind | 4c0cf8bb1ae11bcd78bffbba5392b892fee53608 | [
"MIT"
] | null | null | null | #include<iostream> // std::cout, std::endl
#include<cmath>
#include<math.h>
#include<RobustDubins_Solver.h>
#include<MathTools.h>
// constructor
RobustDubins::Solver::Solver() {
m_distanceErrorTolerance = 0.001;
m_thetaErrorTolerance = 0.001;
m_costTolerance = 0.0001;
m_psNormalizedFlag = false;
m... | 39.251944 | 124 | 0.569832 | [
"vector",
"solid"
] |
8cbce4037a2a9962d2bbd9e40f4aeda3b776a176 | 11,768 | hpp | C++ | include/standard_hough_transform.hpp | yirami/hough-transform | 5d74b8d267d448bf2c0fe52cbfe1f99a7e626e43 | [
"MIT"
] | null | null | null | include/standard_hough_transform.hpp | yirami/hough-transform | 5d74b8d267d448bf2c0fe52cbfe1f99a7e626e43 | [
"MIT"
] | null | null | null | include/standard_hough_transform.hpp | yirami/hough-transform | 5d74b8d267d448bf2c0fe52cbfe1f99a7e626e43 | [
"MIT"
] | null | null | null | /**
* Copyright (C) 2019 Yirami .
* All rights reserved.
* @file standard_hough_transform.hpp
* @brief Template class for Standard Hough Transform(SHT) .
* @author [Tang zhiyong](https://yirami.xyz)
* @date 2019-06-25
* @version 1.0
* @note
* @history
**/
#ifndef _STANDARD_HOUGH_TRANSFORM_HPP_
#defin... | 33.149296 | 86 | 0.580812 | [
"vector",
"transform"
] |
8cbdb4f87370bf8911562d8f330262c2b4b027f5 | 9,251 | cpp | C++ | sensors/radars/echodyne/radar.cpp | mission-systems-pty-ltd/snark | 2bc8a20292ee3684d3a9897ba6fee43fed8d89ae | [
"BSD-3-Clause"
] | 1 | 2022-03-27T00:24:37.000Z | 2022-03-27T00:24:37.000Z | sensors/radars/echodyne/radar.cpp | NEU-LC/snark | db890f73f4c4bbe679405f3a607fd9ea373deb2c | [
"BSD-3-Clause"
] | null | null | null | sensors/radars/echodyne/radar.cpp | NEU-LC/snark | db890f73f4c4bbe679405f3a607fd9ea373deb2c | [
"BSD-3-Clause"
] | 1 | 2020-10-30T02:11:55.000Z | 2020-10-30T02:11:55.000Z | // This file is part of snark, a generic and flexible library for robotics research
// Copyright (c) 2020 Mission Systems Pty Ltd
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
// 1. Redistri... | 47.685567 | 201 | 0.656902 | [
"vector"
] |
bc653ecb048e1c44725e21a254f367b7bd12de3f | 2,541 | cpp | C++ | UKIEPC2020/l.cpp | JackBai0914/Competitive-Programming-Codebase | a1cabf0fa5072b07a7da25d66bf455eb45b0b7e9 | [
"MIT"
] | null | null | null | UKIEPC2020/l.cpp | JackBai0914/Competitive-Programming-Codebase | a1cabf0fa5072b07a7da25d66bf455eb45b0b7e9 | [
"MIT"
] | null | null | null | UKIEPC2020/l.cpp | JackBai0914/Competitive-Programming-Codebase | a1cabf0fa5072b07a7da25d66bf455eb45b0b7e9 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1 << 20;
const double PI=acos(-1);
struct cp
{
double re,im;
cp(double _re=0.0,double _im=0.0) { re=_re; im=_im; }
cp operator+(const cp& b) const { return c... | 18.962687 | 83 | 0.385675 | [
"vector"
] |
bc6e8bc68a308b5e3b5569b0636666d3ac16fcbb | 614 | cpp | C++ | trview.graphics/PixelShader.cpp | sapper-trle/trview | dc9f945355a5976f2a539316a5dbf8323bb75064 | [
"MIT"
] | null | null | null | trview.graphics/PixelShader.cpp | sapper-trle/trview | dc9f945355a5976f2a539316a5dbf8323bb75064 | [
"MIT"
] | null | null | null | trview.graphics/PixelShader.cpp | sapper-trle/trview | dc9f945355a5976f2a539316a5dbf8323bb75064 | [
"MIT"
] | null | null | null | #include "PixelShader.h"
namespace trview
{
namespace graphics
{
PixelShader::PixelShader(const graphics::Device& device, const std::vector<uint8_t>& data)
{
if (data.empty())
{
throw std::exception("Data for PixelShader cannot be empty");
}
... | 26.695652 | 98 | 0.578176 | [
"vector"
] |
bc7aacb08777e410fb1639d3fcb016086c01ae86 | 8,657 | cpp | C++ | src/runjs_sm.cpp | kurazu/bridge | b44e4179233536f78f9161862655fe8527a01424 | [
"MIT"
] | null | null | null | src/runjs_sm.cpp | kurazu/bridge | b44e4179233536f78f9161862655fe8527a01424 | [
"MIT"
] | null | null | null | src/runjs_sm.cpp | kurazu/bridge | b44e4179233536f78f9161862655fe8527a01424 | [
"MIT"
] | null | null | null | #include "runjs.hpp"
#include <cstring>
#include <string>
/* The class of the global object. */
JSClass global_class = {
"global",
JSCLASS_GLOBAL_FLAGS
};
void
JSError::reset() {
occured = false;
if (message != NULL) {
delete [] message;
}
message = NULL;
if (file_name != NULL) {
... | 30.163763 | 106 | 0.673559 | [
"object"
] |
bc7f865b69c570d45c1b20713b3c2cd36f0da502 | 1,146 | cc | C++ | src/dependencies/libarchive-3.5.2/contrib/oss-fuzz/libarchive_fuzzer.cc | okaits/rpi-imager | 7ff45328400104e3a2f9ca520572712ed0186766 | [
"Apache-2.0"
] | 107 | 2020-03-05T11:50:42.000Z | 2020-03-09T10:40:49.000Z | src/dependencies/libarchive-3.5.2/contrib/oss-fuzz/libarchive_fuzzer.cc | okaits/rpi-imager | 7ff45328400104e3a2f9ca520572712ed0186766 | [
"Apache-2.0"
] | 20 | 2020-03-05T15:20:18.000Z | 2020-03-09T13:28:42.000Z | src/dependencies/libarchive-3.5.2/contrib/oss-fuzz/libarchive_fuzzer.cc | okaits/rpi-imager | 7ff45328400104e3a2f9ca520572712ed0186766 | [
"Apache-2.0"
] | 14 | 2020-03-05T11:55:52.000Z | 2020-03-08T12:16:19.000Z | #include <stddef.h>
#include <stdint.h>
#include <vector>
#include "archive.h"
struct Buffer {
const uint8_t *buf;
size_t len;
};
ssize_t reader_callback(struct archive *a, void *client_data,
const void **block) {
Buffer *buffer = reinterpret_cast<Buffer *>(client_data);
*block = buff... | 22.92 | 71 | 0.653578 | [
"vector"
] |
bc89c9fe53f2ce73618bc84661dc86948b785878 | 78,596 | cpp | C++ | src/sexp/Ast.cpp | WebAssembly/decompressor-prototype | 44075ebeef75b950fdd9c0cd0b369928ef05a09c | [
"Apache-2.0"
] | 11 | 2016-07-08T20:43:29.000Z | 2021-05-09T21:43:34.000Z | src/sexp/Ast.cpp | DalavanCloud/decompressor-prototype | 44075ebeef75b950fdd9c0cd0b369928ef05a09c | [
"Apache-2.0"
] | 62 | 2016-06-07T15:21:24.000Z | 2017-05-18T15:51:04.000Z | src/sexp/Ast.cpp | DalavanCloud/decompressor-prototype | 44075ebeef75b950fdd9c0cd0b369928ef05a09c | [
"Apache-2.0"
] | 5 | 2016-06-07T15:05:32.000Z | 2020-01-06T17:21:43.000Z | // -*- C++ -*-
//
// Copyright 2016 WebAssembly Community Group participants
//
// 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
//
// Unl... | 28.874357 | 80 | 0.615502 | [
"vector"
] |
bc963bc70cd49c6de36654f841d59ba3e2774019 | 2,817 | hpp | C++ | libraries/include/Engine/UI/Text.hpp | kermado/Total-Resistance | debaf40ba3be6590a70c9922e1d1a5e075f4ede3 | [
"MIT"
] | 3 | 2015-04-25T22:57:58.000Z | 2019-11-05T18:36:31.000Z | libraries/include/Engine/UI/Text.hpp | kermado/Total-Resistance | debaf40ba3be6590a70c9922e1d1a5e075f4ede3 | [
"MIT"
] | 1 | 2016-06-23T15:22:41.000Z | 2016-06-23T15:22:41.000Z | libraries/include/Engine/UI/Text.hpp | kermado/Total-Resistance | debaf40ba3be6590a70c9922e1d1a5e075f4ede3 | [
"MIT"
] | null | null | null | #ifndef TEXT_H
#define TEXT_H
#include <string>
#include <vector>
#include <glm/glm.hpp>
#include <Engine/UI/IShape.hpp>
#include <Engine/UI/Font.hpp>
namespace Engine
{
namespace UI
{
class Text : public IShape
{
public:
/**
* Constructor.
*/
Text();
/**
* Destructor.
*/
virtua... | 19.294521 | 71 | 0.611644 | [
"geometry",
"vector"
] |
bca642013289d453be88015f7e322eb04edd01a9 | 2,017 | cpp | C++ | Praktikum5/Praktikum5/Praktikum5/main.cpp | dekorlp/Codingtheory | 94c2caf72df73550b115bd5a53fc719d5932cfbc | [
"Apache-2.0"
] | null | null | null | Praktikum5/Praktikum5/Praktikum5/main.cpp | dekorlp/Codingtheory | 94c2caf72df73550b115bd5a53fc719d5932cfbc | [
"Apache-2.0"
] | null | null | null | Praktikum5/Praktikum5/Praktikum5/main.cpp | dekorlp/Codingtheory | 94c2caf72df73550b115bd5a53fc719d5932cfbc | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <vector>
struct RM
{
unsigned int r;
unsigned int m;
};
std::vector<std::vector<int>> ReedMuellerAlgorithm(RM rm);
void PrintMatrix(int rowCount, int columnCount, std::vector<std::vector<int>> matrix);
std::vector<std::vector<int>> ReedMuellerAlgorithm(RM rm)
{
std::vector<std::vector... | 21.010417 | 93 | 0.562717 | [
"vector"
] |
bca7b9ec7bca94bd92b73b9268fc624343dedcaa | 2,447 | cpp | C++ | using-cpp-standard-template-libraries-master/Chapter 8/Ex8_09.cpp | ai-chen2050/book-code | 74676efa50ef9e8a4a40b97978d9d42f18070102 | [
"MIT"
] | null | null | null | using-cpp-standard-template-libraries-master/Chapter 8/Ex8_09.cpp | ai-chen2050/book-code | 74676efa50ef9e8a4a40b97978d9d42f18070102 | [
"MIT"
] | null | null | null | using-cpp-standard-template-libraries-master/Chapter 8/Ex8_09.cpp | ai-chen2050/book-code | 74676efa50ef9e8a4a40b97978d9d42f18070102 | [
"MIT"
] | null | null | null | // Ex8_09.cpp
// Demonstrating the piecewise linear distribution
#include <random> // For distributions and random number generator
#include <vector> // For vector container
#include <map> // For map ... | 50.979167 | 105 | 0.531671 | [
"vector"
] |
bcb54babce1db34e1d1b3b9e33cac34c6391e212 | 13,545 | cpp | C++ | proj6/light_source.cpp | sumnerjj/6.172 | 53d22fe5f043f8170a426f167d32b648d7d4ee67 | [
"MIT"
] | null | null | null | proj6/light_source.cpp | sumnerjj/6.172 | 53d22fe5f043f8170a426f167d32b648d7d4ee67 | [
"MIT"
] | null | null | null | proj6/light_source.cpp | sumnerjj/6.172 | 53d22fe5f043f8170a426f167d32b648d7d4ee67 | [
"MIT"
] | null | null | null | #include <cmath>
#include <iostream>
#include <assert.h>
#include "light_source.h"
#include "photonmap.h"
#include "raytracer.h"
#include "random.h"
#include "config.h"
SquarePhotonLight::SquarePhotonLight(Colour col, Raytracer *raytracer ) :
col(col), raytracer(raytracer), icache(ICACHE_TOLERANCE,
... | 29.509804 | 92 | 0.501661 | [
"transform"
] |
bcc2f3d265bfd4eae0f97c36528e0adc8b095134 | 9,186 | cpp | C++ | compiler/html.cpp | iamrekcah/clay | dad107fd190da9a4a1e1f6d0c14927f1960d46e9 | [
"BSD-2-Clause"
] | 5 | 2015-06-05T17:48:58.000Z | 2015-10-03T22:20:12.000Z | compiler/html.cpp | iamrekcah/clay | dad107fd190da9a4a1e1f6d0c14927f1960d46e9 | [
"BSD-2-Clause"
] | 7 | 2015-03-22T06:13:42.000Z | 2015-12-28T19:07:24.000Z | compiler/html.cpp | iamrekcah/clay | dad107fd190da9a4a1e1f6d0c14927f1960d46e9 | [
"BSD-2-Clause"
] | 1 | 2018-10-20T20:38:31.000Z | 2018-10-20T20:38:31.000Z | #include "claydoc.hpp"
#include <fstream>
#include <sstream>
#include <errno.h>
using namespace clay;
using namespace std;
static string getCssStyle()
{
return
"* { padding: 0; margin: 0 }\n"
"body { background: #fff; font-family: sans-serif; font-size: 0.8em; }\n"
"#mainContentInner { margin-left: 10... | 32.231579 | 136 | 0.515676 | [
"vector",
"solid"
] |
bcc45d1c4e288f401c606f3073236780528cdc04 | 2,415 | cc | C++ | cpp_src/core/ft/filters/kblayout.cc | SolovyovAlexander/reindexer | 2c6fcd957c1743b57a4ce9a7963b52dffc13a519 | [
"Apache-2.0"
] | 695 | 2017-07-07T16:54:23.000Z | 2022-03-19T09:48:30.000Z | cpp_src/core/ft/filters/kblayout.cc | SolovyovAlexander/reindexer | 2c6fcd957c1743b57a4ce9a7963b52dffc13a519 | [
"Apache-2.0"
] | 63 | 2018-01-18T02:57:48.000Z | 2022-03-04T10:28:05.000Z | cpp_src/core/ft/filters/kblayout.cc | SolovyovAlexander/reindexer | 2c6fcd957c1743b57a4ce9a7963b52dffc13a519 | [
"Apache-2.0"
] | 72 | 2017-07-12T21:12:59.000Z | 2021-11-28T14:35:06.000Z | #include "kblayout.h"
#include <assert.h>
namespace reindexer {
void KbLayout::GetVariants(const std::wstring& data, std::vector<std::pair<std::wstring, int>>& result) {
std::wstring result_string;
result_string.reserve(data.length());
for (size_t i = 0; i < data.length(); ++i) {
auto sym = data[i];
if (sym >... | 29.814815 | 105 | 0.627743 | [
"vector"
] |
344d5af9a202736dfe8f06a5e09a62b980da4d91 | 1,355 | hpp | C++ | libraries/PrinterAPI/include/printer/JsonPrinter.hpp | StratifyLabs/API | ca0bf670653b78da43ad416cd1c5e977c8549eeb | [
"MIT"
] | 7 | 2020-12-15T14:27:02.000Z | 2022-03-23T12:00:13.000Z | libraries/PrinterAPI/include/printer/JsonPrinter.hpp | StratifyLabs/API | ca0bf670653b78da43ad416cd1c5e977c8549eeb | [
"MIT"
] | null | null | null | libraries/PrinterAPI/include/printer/JsonPrinter.hpp | StratifyLabs/API | ca0bf670653b78da43ad416cd1c5e977c8549eeb | [
"MIT"
] | 1 | 2021-01-06T14:51:51.000Z | 2021-01-06T14:51:51.000Z | // Copyright 2011-2021 Tyler Gilbert and Stratify Labs, Inc; see LICENSE.md
#ifndef PRINTER_API_PRINTER_JSONPRINTER_HPP_
#define PRINTER_API_PRINTER_JSONPRINTER_HPP_
#include "var/Vector.hpp"
#include "Printer.hpp"
namespace printer {
class JsonPrinter : public Printer {
public:
JsonPrinter();
private:
enum c... | 28.829787 | 87 | 0.757196 | [
"object",
"vector"
] |
345208328f90cb5a138e19a846cd3ccdf9db5811 | 2,585 | cc | C++ | workload/stat/result_collect.cc | satorikoishi/ford | ed3ccc4120c914d1b9b5464e4bdc459802a52b74 | [
"Apache-2.0"
] | 1 | 2022-02-22T05:04:45.000Z | 2022-02-22T05:04:45.000Z | workload/stat/result_collect.cc | yhuacode/ford | 0d966cfea8b859d69ef8c88252e841d01f134051 | [
"Apache-2.0"
] | null | null | null | workload/stat/result_collect.cc | yhuacode/ford | 0d966cfea8b859d69ef8c88252e841d01f134051 | [
"Apache-2.0"
] | null | null | null | // Author: Ming Zhang
// Copyright (c) 2021
#include "stat/result_collect.h"
std::atomic<uint64_t> tx_id_generator;
std::atomic<uint64_t> connected_t_num;
std::mutex mux;
std::vector<t_id_t> tid_vec;
std::vector<double> attemp_tp_vec;
std::vector<double> tp_vec;
std::vector<double> medianlat_vec;
std::vector<double>... | 34.466667 | 140 | 0.641779 | [
"vector"
] |
345210b8eed4fa38e44c1d47cc62f20a8435c671 | 2,668 | hpp | C++ | Hildr.hpp | Mizugola/HildrGUI | b69a5e78174ae9af6dd132b6ae024950846cdbf6 | [
"MIT"
] | 1 | 2016-10-31T16:33:11.000Z | 2016-10-31T16:33:11.000Z | Hildr.hpp | Mizugola/HildrGUI | b69a5e78174ae9af6dd132b6ae024950846cdbf6 | [
"MIT"
] | null | null | null | Hildr.hpp | Mizugola/HildrGUI | b69a5e78174ae9af6dd132b6ae024950846cdbf6 | [
"MIT"
] | null | null | null | #pragma once
#include <iostream>
#include <string>
#include <future>
#include <algorithm>
#include <vector>
#include <chrono>
#include <thread>
#include <map>
#include <SFML/Graphics.hpp>
namespace hg
{
class GraphicalElement;
class Container;
class Panel;
namespace Type
{
enum ElementTy... | 22.420168 | 98 | 0.527361 | [
"vector"
] |
34590f9f2f8cea0ac8d7113caffd985606fc044b | 11,708 | hpp | C++ | dakota-6.3.0.Windows.x86/include/HOPSPACK_SolveLinConstrProj.hpp | seakers/ExtUtils | b0186098063c39bd410d9decc2a765f24d631b25 | [
"BSD-2-Clause"
] | null | null | null | dakota-6.3.0.Windows.x86/include/HOPSPACK_SolveLinConstrProj.hpp | seakers/ExtUtils | b0186098063c39bd410d9decc2a765f24d631b25 | [
"BSD-2-Clause"
] | null | null | null | dakota-6.3.0.Windows.x86/include/HOPSPACK_SolveLinConstrProj.hpp | seakers/ExtUtils | b0186098063c39bd410d9decc2a765f24d631b25 | [
"BSD-2-Clause"
] | 1 | 2022-03-18T14:13:14.000Z | 2022-03-18T14:13:14.000Z | // $Id: HOPSPACK_SolveLinConstrProj.hpp 164 2010-03-15 18:53:15Z tplante $
// $URL: https://software.sandia.gov/svn/hopspack/tags/dakota-6.3/src/src-shared/HOPSPACK_SolveLinConstrProj.hpp $
//@HEADER
// ************************************************************************
//
// HOPSPACK: Hybrid Optimizatio... | 44.687023 | 114 | 0.5726 | [
"object",
"vector"
] |
3459b47cf375b1a6bc5b0b96d1279cd5511a21c5 | 430 | cc | C++ | ompa.cc | bitsofcotton/OMPA | 39044749cbeb5ecbcf9d34a9c82db41bd8f8b6fe | [
"BSD-3-Clause"
] | null | null | null | ompa.cc | bitsofcotton/OMPA | 39044749cbeb5ecbcf9d34a9c82db41bd8f8b6fe | [
"BSD-3-Clause"
] | null | null | null | ompa.cc | bitsofcotton/OMPA | 39044749cbeb5ecbcf9d34a9c82db41bd8f8b6fe | [
"BSD-3-Clause"
] | null | null | null | #include <cstdio>
#include <cstring>
#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include "lieonn.hh"
typedef myfloat num_t;
#include "ompa.hh"
vector<SimpleVector<myfloat> > filterM;
int main(int argc, const c... | 18.695652 | 79 | 0.716279 | [
"vector"
] |
345aa1c76af6c2b855f43dd3049d0f4b74d6a142 | 1,132 | cpp | C++ | WindowsProgram/PCore.cpp | bear1704/WindowsProgramming_Portfolio | 83f1d763c73d08b82291aa894ef246558fdf0198 | [
"Apache-2.0"
] | null | null | null | WindowsProgram/PCore.cpp | bear1704/WindowsProgramming_Portfolio | 83f1d763c73d08b82291aa894ef246558fdf0198 | [
"Apache-2.0"
] | null | null | null | WindowsProgram/PCore.cpp | bear1704/WindowsProgramming_Portfolio | 83f1d763c73d08b82291aa894ef246558fdf0198 | [
"Apache-2.0"
] | null | null | null | #include "PCore.h"
PCore::PCore()
{
}
PCore::~PCore()
{
}
bool PCore::Init()
{
return true;
}
bool PCore::Frame()
{
return true;
}
bool PCore::Render()
{
return true;
}
bool PCore::Release()
{
return true;
}
bool PCore::PCoreInit()
{
timer.Init();
PInput::GetInstance().Init();
PSoundMgr::GetInstance()... | 11.791667 | 50 | 0.636042 | [
"render"
] |
345c3b6655ef61a4ed4912716547928918050253 | 5,214 | cpp | C++ | libs/fastflow/tests/ocl/testRelease.cpp | GMAP/NPB-CPP | 2f77a1bce83c4efda56c4bafb555bcf9abe85dd2 | [
"MIT"
] | 11 | 2020-12-16T22:44:08.000Z | 2022-03-30T00:52:58.000Z | libs/fastflow/tests/ocl/testRelease.cpp | GMAP/NPB-CPP | 2f77a1bce83c4efda56c4bafb555bcf9abe85dd2 | [
"MIT"
] | 1 | 2021-04-01T09:07:52.000Z | 2021-07-21T22:10:07.000Z | libs/fastflow/tests/ocl/testRelease.cpp | GMAP/NPB-CPP | 2f77a1bce83c4efda56c4bafb555bcf9abe85dd2 | [
"MIT"
] | 3 | 2020-12-21T18:47:43.000Z | 2021-11-20T19:48:45.000Z | /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ***************************************************************************
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by ... | 30.138728 | 132 | 0.578443 | [
"vector"
] |
345e61f2e91cd780bcacc02dd6f2d7e9ae2ba43a | 692 | cc | C++ | Question/计算日期到天数转换.cc | lkimprove/Study_C | ee1153536f28e160d5daad4ddebaa547c3941ee7 | [
"MIT"
] | null | null | null | Question/计算日期到天数转换.cc | lkimprove/Study_C | ee1153536f28e160d5daad4ddebaa547c3941ee7 | [
"MIT"
] | null | null | null | Question/计算日期到天数转换.cc | lkimprove/Study_C | ee1153536f28e160d5daad4ddebaa547c3941ee7 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
bool IsLeapYear(int year){
if(year % 4 == 0 && year % 100 != 0){
return true;
}
else if(year % 400 == 0){
return true;
}
return false;
}
int main(){
vector<int> monthDay = {0, 31, 28, 31, 30, 31, 30 ,31, 31, 30, 3... | 18.702703 | 79 | 0.42052 | [
"vector"
] |
345fdee0a49da35fdbc6adae03eaefb8d7e71bee | 1,858 | cpp | C++ | windows-client/src/Macro/MacroCollection.cpp | Drew-j-Smith/switch-controller | ad4baec93fa99553a82c0f2aa3716b9a0caea45f | [
"MIT"
] | 1 | 2022-02-20T21:20:09.000Z | 2022-02-20T21:20:09.000Z | windows-client/src/Macro/MacroCollection.cpp | Drew-j-Smith/switch-controller | ad4baec93fa99553a82c0f2aa3716b9a0caea45f | [
"MIT"
] | null | null | null | windows-client/src/Macro/MacroCollection.cpp | Drew-j-Smith/switch-controller | ad4baec93fa99553a82c0f2aa3716b9a0caea45f | [
"MIT"
] | null | null | null | #include "MacroCollection.h"
MacroCollection::MacroCollection(const std::vector<std::shared_ptr<Macro>> & macros, const std::shared_ptr<DeciderCollectionBase> & deciders) {
this->macros = macros;
this->deciders = deciders;
}
MacroCollection::MacroCollection(const boost::property_tree::ptree & tree, const std:... | 35.056604 | 143 | 0.618407 | [
"vector"
] |
346a2cf0fe0e98d9fef3c5c9f913ab4b0da4100e | 997 | cpp | C++ | leetcode/819.most-common-word.cpp | ANONYMOUS609/Competitive-Programming | d3753eeee24a660963f1d8911bf887c8f41f5677 | [
"MIT"
] | 2 | 2019-01-30T12:45:18.000Z | 2021-05-06T19:02:51.000Z | leetcode/819.most-common-word.cpp | ANONYMOUS609/Competitive-Programming | d3753eeee24a660963f1d8911bf887c8f41f5677 | [
"MIT"
] | null | null | null | leetcode/819.most-common-word.cpp | ANONYMOUS609/Competitive-Programming | d3753eeee24a660963f1d8911bf887c8f41f5677 | [
"MIT"
] | 3 | 2020-10-02T15:42:04.000Z | 2022-03-27T15:14:16.000Z | /*
* @lc app=leetcode id=819 lang=cpp
*
* [819] Most Common Word
*/
// @lc code=start
class Solution {
public:
string mostCommonWord(string p, vector<string>& banned) {
transform(p.begin(), p.end(),p.begin(),::tolower);
string tmp="";
for(char ch: p) {
if((ch>='a' and ch<='z... | 22.155556 | 61 | 0.414243 | [
"vector",
"transform"
] |
346f0c767aa8a89967165b0e62a15548852c0403 | 84,309 | cxx | C++ | StRoot/StMtdQAMaker/StMtdQAMaker.cxx | xiaohaijin/RHIC-STAR | a305cb0a6ac15c8165bd8f0d074d7075d5e58752 | [
"MIT"
] | 2 | 2018-12-24T19:37:00.000Z | 2022-02-28T06:57:20.000Z | StRoot/StMtdQAMaker/StMtdQAMaker.cxx | xiaohaijin/RHIC-STAR | a305cb0a6ac15c8165bd8f0d074d7075d5e58752 | [
"MIT"
] | null | null | null | StRoot/StMtdQAMaker/StMtdQAMaker.cxx | xiaohaijin/RHIC-STAR | a305cb0a6ac15c8165bd8f0d074d7075d5e58752 | [
"MIT"
] | null | null | null | #include <iostream>
#include <math.h>
#include <vector>
#include <stdlib.h>
#include <iterator>
#include "TTree.h"
#include "TH1F.h"
#include "TH2F.h"
#include "StEventTypes.h"
#include "StThreeVectorF.hh"
#include "PhysicalConstants.h"
#include "StMemoryInfo.hh"
#include "StMessMgr.h"
#include "StTimer.hh"
#include ... | 39.470506 | 1,131 | 0.667805 | [
"geometry",
"vector"
] |
347b01cafe718e2be005c78fab5aaf766bb373a9 | 91 | cpp | C++ | 10/suit.cpp | itiszac/CS1B | 6d523fe93b047d0c8872fda68ae079e4ffaf1c2f | [
"CC0-1.0"
] | null | null | null | 10/suit.cpp | itiszac/CS1B | 6d523fe93b047d0c8872fda68ae079e4ffaf1c2f | [
"CC0-1.0"
] | null | null | null | 10/suit.cpp | itiszac/CS1B | 6d523fe93b047d0c8872fda68ae079e4ffaf1c2f | [
"CC0-1.0"
] | null | null | null | #include "hw10.h"
void guessSuit(std::vector<Card> deck)
{
std::cout << "guessSuit\n";
} | 15.166667 | 38 | 0.648352 | [
"vector"
] |
3488a2c442e071884b0c73f8a1f6a9650f103b2a | 582 | hpp | C++ | modules/Core/include/CuteVR/Components/Geometry/ConeFrustum.hpp | marmot722/CuteVR | 6be38dc3fa492dd08c4921bfe9e043708f61c946 | [
"BSD-3-Clause"
] | null | null | null | modules/Core/include/CuteVR/Components/Geometry/ConeFrustum.hpp | marmot722/CuteVR | 6be38dc3fa492dd08c4921bfe9e043708f61c946 | [
"BSD-3-Clause"
] | null | null | null | modules/Core/include/CuteVR/Components/Geometry/ConeFrustum.hpp | marmot722/CuteVR | 6be38dc3fa492dd08c4921bfe9e043708f61c946 | [
"BSD-3-Clause"
] | null | null | null | /// @file
/// @author Marcus Meeßen
/// @copyright Copyright (c) 2017-2018 Marcus Meeßen
/// @copyright Copyright (c) 2018 MASKOR Institute FH Aachen
#ifndef CUTE_VR_COMPONENTS_GEOMETRY_CONE_FRUSTUM
#define CUTE_VR_COMPONENTS_GEOMETRY_CONE_FRUSTUM
#include <CuteVR/Component.hpp>
namespace CuteVR { namespace Com... | 30.631579 | 83 | 0.752577 | [
"geometry"
] |
348cea0002ce63d12a546b2d9fe599bcf1d6a37d | 3,166 | hpp | C++ | generators.hpp | else-engine/ee_math | 2610f5d05263a35274f3aa1163f292e70f15452c | [
"Zlib"
] | null | null | null | generators.hpp | else-engine/ee_math | 2610f5d05263a35274f3aa1163f292e70f15452c | [
"Zlib"
] | null | null | null | generators.hpp | else-engine/ee_math | 2610f5d05263a35274f3aa1163f292e70f15452c | [
"Zlib"
] | null | null | null | /**
* Copyright (c) 2017 Gauthier ARNOULD
* This file is released under the zlib License (Zlib).
* See file LICENSE or go to https://opensource.org/licenses/Zlib
* for full license details.
*/
#pragma once
#include <cstddef>
#include <utility>
#include <ee_utils/templates.hpp>
#include "common.hpp"
#include "v... | 29.045872 | 118 | 0.642135 | [
"object"
] |
349203756ed436add2005f698e4881e000f6fc8e | 1,312 | cpp | C++ | isBipartite.cpp | DeeptanshuM/Algorithms | 48f91e952b71370127db33fa42d642062690f9d9 | [
"MIT"
] | null | null | null | isBipartite.cpp | DeeptanshuM/Algorithms | 48f91e952b71370127db33fa42d642062690f9d9 | [
"MIT"
] | null | null | null | isBipartite.cpp | DeeptanshuM/Algorithms | 48f91e952b71370127db33fa42d642062690f9d9 | [
"MIT"
] | null | null | null | /*
Used BFS to determine if graph is bipartite.
*/
#include <iostream>
#include <vector>
#include <queue>
using std::vector;
using std::queue;
int is_bipartite(vector<vector<int> > &adj) {
vector <int> color (adj.size(), -1); // -1 represents no color
int s = adj[0][0]; //arbitrarilty choosing this as a source... | 21.508197 | 70 | 0.529726 | [
"vector"
] |
349353056adafe5140ea16d36ff47ec9fb163627 | 18,526 | cpp | C++ | auxprogs/utrrnaseq/src/Genomic_Data.cpp | sestaton/Augustus | 893e0b21fa90bd57fcd0dff2c1e849e88bb02049 | [
"Artistic-1.0"
] | 178 | 2018-05-25T09:51:13.000Z | 2022-03-30T13:55:58.000Z | auxprogs/utrrnaseq/src/Genomic_Data.cpp | sestaton/Augustus | 893e0b21fa90bd57fcd0dff2c1e849e88bb02049 | [
"Artistic-1.0"
] | 249 | 2018-07-02T07:03:12.000Z | 2022-03-30T00:01:01.000Z | auxprogs/utrrnaseq/src/Genomic_Data.cpp | sestaton/Augustus | 893e0b21fa90bd57fcd0dff2c1e849e88bb02049 | [
"Artistic-1.0"
] | 95 | 2018-08-21T21:33:19.000Z | 2022-03-30T13:56:00.000Z | /*
* \file Genomic_Data.cpp
*/
#include "Genomic_Data.hpp"
#include "Global.hpp"
#include "Supporting_Methods.hpp"
#include "Splice_Sites.hpp"
#include "Error.hpp"
#include <string>
#include <vector>
#include <utility>
#include <iostream>
#include <fstream>
#include <sstream>
#include <stdlib.h>
#include <stdio.h... | 29.6416 | 152 | 0.619994 | [
"vector"
] |
34957473c5142f81c1f299765ba057e28bda5415 | 11,138 | cpp | C++ | src/dispatcher.cpp | hugo19941994/SpaceInvaders-Emu | cdff147ac1eb6fb5da8d0242e23015f9270a9cbd | [
"MIT"
] | 1 | 2020-03-02T23:28:57.000Z | 2020-03-02T23:28:57.000Z | src/dispatcher.cpp | hugo19941994/SpaceInvaders-Emu | cdff147ac1eb6fb5da8d0242e23015f9270a9cbd | [
"MIT"
] | null | null | null | src/dispatcher.cpp | hugo19941994/SpaceInvaders-Emu | cdff147ac1eb6fb5da8d0242e23015f9270a9cbd | [
"MIT"
] | 1 | 2020-03-02T23:28:58.000Z | 2020-03-02T23:28:58.000Z | #include "emu.h"
#include <array>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
// Macro to avoid verbose switch syntax
// https://gitlab.com/higan/higan/blob/master/higan/processor/mos6502/disassembler.cpp
#define op(id, oper) ... | 21.796477 | 86 | 0.442539 | [
"vector"
] |
3495c7179314f654b3a3757dd2d166647e430265 | 3,102 | cpp | C++ | Examples/source/ManageBarcodeImages/SaveBarcodeImageToStreams.cpp | aspose-barcode/Aspose.Barcode-for-C | 9741636d98a148d7438cc6ee790dc3c4bcc5a1e8 | [
"MIT"
] | 3 | 2018-12-07T18:39:59.000Z | 2021-06-08T13:08:29.000Z | Examples/source/ManageBarcodeImages/SaveBarcodeImageToStreams.cpp | aspose-barcode/Aspose.Barcode-for-C | 9741636d98a148d7438cc6ee790dc3c4bcc5a1e8 | [
"MIT"
] | null | null | null | Examples/source/ManageBarcodeImages/SaveBarcodeImageToStreams.cpp | aspose-barcode/Aspose.Barcode-for-C | 9741636d98a148d7438cc6ee790dc3c4bcc5a1e8 | [
"MIT"
] | 1 | 2018-07-13T14:22:11.000Z | 2018-07-13T14:22:11.000Z | /*
This project uses Automatic Package Restore feature of NuGet to resolve Aspose.BarCode for .NET API reference
when the project is build. Please check https://docs.nuget.org/consume/nuget-faq for more information.
If you do not wish to use NuGet, you can manually download Aspose.BarCode for .NET API from http://www.a... | 41.918919 | 146 | 0.727273 | [
"object"
] |
3496742989131efad2558f51bb3e905ad2cf3d03 | 8,012 | cpp | C++ | test/istrings.t.cpp | goto40/textx-cpp | 1d8ea2802c99e0ec145f843e7fe1c23e3cc076d1 | [
"MIT"
] | 3 | 2021-12-08T14:42:04.000Z | 2022-03-04T19:51:11.000Z | test/istrings.t.cpp | goto40/textx-cpp | 1d8ea2802c99e0ec145f843e7fe1c23e3cc076d1 | [
"MIT"
] | null | null | null | test/istrings.t.cpp | goto40/textx-cpp | 1d8ea2802c99e0ec145f843e7fe1c23e3cc076d1 | [
"MIT"
] | null | null | null | #include "catch.hpp"
#include "textx/istrings.h"
namespace {
auto get_example_model() {
auto mm = textx::metamodel_from_str(R"#(
Model: 'shapes' info=STRING ':' shapes+=Shape[','];
Shape: Point|ComplexShape;
ComplexShape: Circle|Line;
Point: type_name="Point"... | 20.283544 | 93 | 0.432351 | [
"object",
"shape",
"model"
] |
34a8df10ac13852bba10d7f05779a8125bf9730b | 6,607 | cc | C++ | browser_project/handlers/render_handler.cc | jsgrowing315/crawling | e75e7559cf4a7010dde423a23d01d7653e06dbff | [
"BSD-3-Clause"
] | null | null | null | browser_project/handlers/render_handler.cc | jsgrowing315/crawling | e75e7559cf4a7010dde423a23d01d7653e06dbff | [
"BSD-3-Clause"
] | null | null | null | browser_project/handlers/render_handler.cc | jsgrowing315/crawling | e75e7559cf4a7010dde423a23d01d7653e06dbff | [
"BSD-3-Clause"
] | null | null | null | #include "../browser_handler.h"
#include "../global.h"
#include <sys/stat.h>
#include <png.h>
bool write_png_for_image(unsigned char* buffer, int width, int height,const char *filename)
{
FILE *fp;
png_structp png_ptr;
png_infop png_info_ptr;
png_bytep png_row;
... | 29.627803 | 110 | 0.583018 | [
"render"
] |
34aca76901e32ae1fd7e860ccdbb086f8798243c | 8,563 | hpp | C++ | src/assembler/mechanics/latin_matrix.hpp | dbeurle/neon | 63cd2929a6eaaa0e1654c729cd35a9a52a706962 | [
"MIT"
] | 9 | 2018-07-12T17:06:33.000Z | 2021-11-20T23:13:26.000Z | src/assembler/mechanics/latin_matrix.hpp | dbeurle/neon | 63cd2929a6eaaa0e1654c729cd35a9a52a706962 | [
"MIT"
] | 119 | 2016-06-22T07:36:04.000Z | 2019-03-10T19:38:12.000Z | src/assembler/mechanics/latin_matrix.hpp | dbeurle/neon | 63cd2929a6eaaa0e1654c729cd35a9a52a706962 | [
"MIT"
] | 9 | 2017-10-08T16:51:38.000Z | 2021-03-15T08:08:04.000Z |
#pragma once
/// @file
#include "static_matrix.hpp"
namespace neon::mechanics
{
/// Generic latin matrix designed for solid mechanics problems using the
/// LATIN method for the solution of nonlinear equations.
/// This class is responsible for the assembly of the process stiffness matrix,
/// residual force vector... | 32.071161 | 108 | 0.639379 | [
"mesh",
"vector",
"solid"
] |
34b8db3a5add73dcda0aa5049ffe67b29c8b7979 | 2,410 | cpp | C++ | samples/gl/AdvancedGLSL.cpp | kunka/SoftRender | 8089844e9ab00ab71ef1a820641ec07ae8df248d | [
"MIT"
] | 6 | 2019-01-25T08:41:14.000Z | 2021-08-22T07:06:11.000Z | samples/gl/AdvancedGLSL.cpp | kunka/SoftRender | 8089844e9ab00ab71ef1a820641ec07ae8df248d | [
"MIT"
] | null | null | null | samples/gl/AdvancedGLSL.cpp | kunka/SoftRender | 8089844e9ab00ab71ef1a820641ec07ae8df248d | [
"MIT"
] | 3 | 2019-01-25T08:41:16.000Z | 2020-09-04T06:04:29.000Z | //
// Created by huangkun on 2018/4/11.
//
#include "AdvancedGLSL.h"
TEST_NODE_IMP_BEGIN
AdvancedGLSL::AdvancedGLSL() {
const char *vert = R"(
#version 330 core
layout (location = 0) in vec3 a_position;
uniform mat4 model;
uniform mat4 view;
uniform mat4 projection;
void main()
{
gl_Position = proj... | 26.195652 | 82 | 0.542739 | [
"model",
"transform"
] |
34bb3cf5bf33c7686e1429095afedddbc3ea0881 | 6,171 | cpp | C++ | src/ga/GAList.cpp | yuriyvolkov/galib | f3ca97f74f8a0318f3c0068006ea6cc0ae2adcd9 | [
"BSD-3-Clause"
] | 6 | 2017-12-07T16:19:08.000Z | 2022-03-23T09:22:11.000Z | src/ga/GAList.cpp | yuriyvolkov/galib | f3ca97f74f8a0318f3c0068006ea6cc0ae2adcd9 | [
"BSD-3-Clause"
] | 3 | 2016-11-12T17:36:02.000Z | 2018-07-13T09:07:07.000Z | src/ga/GAList.cpp | yuriyvolkov/galib | f3ca97f74f8a0318f3c0068006ea6cc0ae2adcd9 | [
"BSD-3-Clause"
] | 4 | 2015-09-20T18:24:39.000Z | 2021-04-09T18:26:55.000Z | // $Header$
/* ----------------------------------------------------------------------------
listtmpl.C
mbwall 25feb95
Copyright 1995 Massachusetts Institute of Technology
DESCRIPTION:
This defines the templatized list objects.
TO DO:
Make insert work better with size and depth so not so many recalcs neede... | 34.093923 | 92 | 0.590342 | [
"object"
] |
34c6532cfacea1d792825911339d6ecc8564afbe | 4,444 | cpp | C++ | testbed/car.cpp | DomiKoPL/BoxCar2D.cpp | a3bbb80304bccf7a8a232bfb8fe78718c47e03f7 | [
"MIT"
] | null | null | null | testbed/car.cpp | DomiKoPL/BoxCar2D.cpp | a3bbb80304bccf7a8a232bfb8fe78718c47e03f7 | [
"MIT"
] | null | null | null | testbed/car.cpp | DomiKoPL/BoxCar2D.cpp | a3bbb80304bccf7a8a232bfb8fe78718c47e03f7 | [
"MIT"
] | null | null | null | #include "car.h"
#include <exception>
#include <iostream>
Car::Car() {
}
Car::Car(Chromosome& chromosome, b2World* world, float init_speed) {
m_world = world;
chrom = chromosome;
m_done = false;
prev_step_count = -1;
best_x = -1e9;
b2PolygonShape chassis;
b2Vec2 vertices[8];
fo... | 23.892473 | 105 | 0.541854 | [
"shape"
] |
34c78e5c7bd2e1f044d7feb8ae227a92cfcc4b0b | 4,829 | hpp | C++ | frame/aio/aioobject.hpp | joydit/solidframe | 0539b0a1e77663ac4c701a88f56723d3e3688e8c | [
"BSL-1.0"
] | null | null | null | frame/aio/aioobject.hpp | joydit/solidframe | 0539b0a1e77663ac4c701a88f56723d3e3688e8c | [
"BSL-1.0"
] | null | null | null | frame/aio/aioobject.hpp | joydit/solidframe | 0539b0a1e77663ac4c701a88f56723d3e3688e8c | [
"BSL-1.0"
] | null | null | null | // frame/aio/aioobject.hpp
//
// Copyright (c) 2007, 2008 Valentin Palade (vipalade @ gmail . com)
//
// This file is part of SolidFrame framework.
//
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt.
//
#ifndef SOLID... | 30.563291 | 112 | 0.730172 | [
"object",
"solid"
] |
34c7c59a3e4739f143cf7880e52c115005a53537 | 13,142 | cxx | C++ | main/slideshow/source/engine/shapes/appletshape.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/slideshow/source/engine/shapes/appletshape.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/slideshow/source/engine/shapes/appletshape.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 331 | 2015-01-06T11:40:55.000Z | 2022-03-14T04:07:51.000Z | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to y... | 40.189602 | 114 | 0.439203 | [
"render",
"object",
"shape",
"vector"
] |
34c8084fcc156e637a42553828f476f1a4d06d7b | 6,041 | cpp | C++ | src/libs/qlib/qvector.cpp | 3dhater/Racer | d7fe4014b1efefe981528547649dc397da7fa780 | [
"Unlicense"
] | null | null | null | src/libs/qlib/qvector.cpp | 3dhater/Racer | d7fe4014b1efefe981528547649dc397da7fa780 | [
"Unlicense"
] | null | null | null | src/libs/qlib/qvector.cpp | 3dhater/Racer | d7fe4014b1efefe981528547649dc397da7fa780 | [
"Unlicense"
] | 1 | 2021-01-03T16:16:47.000Z | 2021-01-03T16:16:47.000Z | /*
* QVector3 - a 3D vector class
* 28-08-00: Created! (based on prof. Kenneth I. Joy's Vector.C)
* (C) MarketGraph/Ruud van Gaal
*/
#include <qlib/vector.h>
#include <math.h>
#include <qlib/debug.h>
DEBUG_ENABLE
//
// Constructors
//
QVector3::QVector3()
// Empty constructor gives 0 vector
{
x=y=z=0;
}
QVector... | 17.161932 | 69 | 0.557027 | [
"vector",
"3d"
] |
34d40618f66aba430c0711425b9618d2b287b603 | 21,188 | cpp | C++ | simularcorte.cpp | hectorratia/chipor | 7c4aa1cd4dc40f9032ec642d4851dead37ac27f7 | [
"MIT"
] | null | null | null | simularcorte.cpp | hectorratia/chipor | 7c4aa1cd4dc40f9032ec642d4851dead37ac27f7 | [
"MIT"
] | null | null | null | simularcorte.cpp | hectorratia/chipor | 7c4aa1cd4dc40f9032ec642d4851dead37ac27f7 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
using namespace std;
vector<string> colarchivo;
vector<double> probabilidades;
int n_col=0;
bool **relaciones;
double apostados[14][3];
double porcentajes[14][3];
double premios14[5][4... | 22.831897 | 188 | 0.571644 | [
"vector"
] |
34dbbd072626602962161fec4bb165dd0e64b781 | 44,515 | cpp | C++ | Tools/KFModTool/core/prettynames.cpp | IvanDSM/KingsFieldRE | b22549a7e93e3c0e77433d7bea8bbde6a5b9f6a3 | [
"MIT"
] | 16 | 2020-07-09T15:38:41.000Z | 2022-03-03T19:05:24.000Z | Tools/KFModTool/core/prettynames.cpp | IvanDSM/KingsFieldRE | b22549a7e93e3c0e77433d7bea8bbde6a5b9f6a3 | [
"MIT"
] | 7 | 2020-07-03T22:38:24.000Z | 2022-01-09T18:25:22.000Z | Tools/KFModTool/core/prettynames.cpp | IvanDSM/KingsFieldRE | b22549a7e93e3c0e77433d7bea8bbde6a5b9f6a3 | [
"MIT"
] | 2 | 2021-08-23T08:25:44.000Z | 2022-01-09T16:05:46.000Z | #include "prettynames.h"
namespace PrettyNames
{
const QHash<const QString, QString> prettyKF2{
{QStringLiteral("FDAT.T0"), QStringLiteral("Western Shore Tilemap")},
{QStringLiteral("FDAT.T1"), QStringLiteral("Western Shore Map DB")},
{QStringLiteral("FDAT.T2"), QStringLiteral("Western Shore Script")},
... | 71.914378 | 99 | 0.701696 | [
"model"
] |
34de0cea24cf0164a07eb33343c4b2360ab44141 | 3,264 | cpp | C++ | render/SpriteBuffer.cpp | yuriks/libyuriks | e80c599cdfe6294df8ce58ad5570af20e50b1072 | [
"Apache-2.0"
] | 6 | 2015-02-13T20:58:28.000Z | 2020-10-02T02:38:13.000Z | libyuriks/render/SpriteBuffer.cpp | yuriks/super-match-5-dx | 47d53b99cc8f93f7cd63a7b11b380ba935739662 | [
"Apache-2.0"
] | null | null | null | libyuriks/render/SpriteBuffer.cpp | yuriks/super-match-5-dx | 47d53b99cc8f93f7cd63a7b11b380ba935739662 | [
"Apache-2.0"
] | 2 | 2016-10-03T18:50:27.000Z | 2018-12-12T22:14:58.000Z | #include "SpriteBuffer.hpp"
#include "gl/gl_1_5.h"
#include "gl/gl_assert.hpp"
#include <cassert>
namespace yks {
void VertexData::setupVertexAttribs() {
YKS_CHECK_GL_PARANOID;
glVertexPointer(2, GL_FLOAT, sizeof(VertexData), reinterpret_cast<void*>(offsetof(VertexData, pos_x)));
glEnableClientState(GL_VERTE... | 25.5 | 112 | 0.708027 | [
"transform"
] |
34e3c7c44c9f6bed97fbf8d38e4e5ebe028d7af8 | 1,637 | cpp | C++ | Typon/src/tools.cpp | ihsuy/Typon | 55aa2d82ed3aecf10b88891e5b962daf5944b6f3 | [
"MIT"
] | 65 | 2019-03-06T15:47:27.000Z | 2022-03-05T09:14:29.000Z | Typon/src/tools.cpp | ihsuy/Typon | 55aa2d82ed3aecf10b88891e5b962daf5944b6f3 | [
"MIT"
] | null | null | null | Typon/src/tools.cpp | ihsuy/Typon | 55aa2d82ed3aecf10b88891e5b962daf5944b6f3 | [
"MIT"
] | 5 | 2019-04-11T01:15:04.000Z | 2021-11-21T18:57:47.000Z |
#include "tools.hpp"
bool isShifted(const int& key) {
return ((key >= 65 and key <= 90) or (key >= 33 and key <= 38) or
(key >= 40 and key <= 43) or (key == 58) or (key == 60) or
(key >= 62 and key <= 64) or (key >= 94 and key <= 95) or
(key == 123) or (key == 125));
}
string ... | 25.184615 | 70 | 0.48931 | [
"vector"
] |
34e89b81d8f178054aad8c53b6eedf61757a12b9 | 2,999 | cxx | C++ | smtk/attribute/ItemDefinition.cxx | yumin/SMTK | d280f10c5b70953b2a0196f71832955c7fc75e7f | [
"BSD-3-Clause-Clear"
] | null | null | null | smtk/attribute/ItemDefinition.cxx | yumin/SMTK | d280f10c5b70953b2a0196f71832955c7fc75e7f | [
"BSD-3-Clause-Clear"
] | 4 | 2016-11-10T15:49:51.000Z | 2017-02-06T23:24:16.000Z | smtk/attribute/ItemDefinition.cxx | yumin/SMTK | d280f10c5b70953b2a0196f71832955c7fc75e7f | [
"BSD-3-Clause-Clear"
] | 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... | 32.247312 | 83 | 0.48883 | [
"vector"
] |
34ec093050534c733074f3cdc3e72d717fdce153 | 1,237 | hpp | C++ | src/abnf/Rule_extension_identifier.hpp | medooze/sdp- | 4bf23de4cf6ade65fedb68a8c8a5baf4bd6a3e6d | [
"MIT"
] | 32 | 2018-01-01T17:01:19.000Z | 2022-02-25T10:30:47.000Z | src/abnf/Rule_extension_identifier.hpp | medooze/sdp- | 4bf23de4cf6ade65fedb68a8c8a5baf4bd6a3e6d | [
"MIT"
] | 4 | 2018-01-08T16:13:05.000Z | 2021-01-25T11:47:44.000Z | src/abnf/Rule_extension_identifier.hpp | medooze/sdp- | 4bf23de4cf6ade65fedb68a8c8a5baf4bd6a3e6d | [
"MIT"
] | 13 | 2018-09-30T05:59:24.000Z | 2022-02-24T08:58:36.000Z | /* -----------------------------------------------------------------------------
* Rule_extension_identifier.hpp
* -----------------------------------------------------------------------------
*
* Producer : com.parse2.aparse.Parser 2.5
* Produced : Mon Jan 08 13:30:55 CET 2018
*
* -----------------------... | 26.891304 | 91 | 0.48747 | [
"vector"
] |
34f7f7f3612b0dbbef4f42b15c426a12b1d7bbbe | 1,531 | cpp | C++ | src/analysis/linpred/burg.cpp | dequis/in-formant | 129b9b399c75cdbd834b68f04dabcb1d406af250 | [
"Apache-2.0"
] | null | null | null | src/analysis/linpred/burg.cpp | dequis/in-formant | 129b9b399c75cdbd834b68f04dabcb1d406af250 | [
"Apache-2.0"
] | null | null | null | src/analysis/linpred/burg.cpp | dequis/in-formant | 129b9b399c75cdbd834b68f04dabcb1d406af250 | [
"Apache-2.0"
] | null | null | null | #include "linpred.h"
#include <cmath>
using namespace Analysis::LP;
std::vector<double> Burg::solve(const double *x, int length, int lpcOrder, double *pGain)
{
int n = length, m = lpcOrder;
std::vector<double> a(m, 0.0);
b1.resize(n + 1, 0.0);
b2.resize(n + 1, 0.0);
aa.resize(m + 1, 0.0);
d... | 21.56338 | 89 | 0.36904 | [
"vector"
] |
5a510d79bacb264290324bdfe229e36d8053365b | 2,789 | cpp | C++ | src/Component/AOCS/InitGnssReceiver.cpp | ut-issl/s2e-core | 900fae6b738eb8765cd98c48acb2b74f05dcc68c | [
"MIT"
] | 16 | 2021-12-28T18:30:01.000Z | 2022-03-26T12:59:48.000Z | src/Component/AOCS/InitGnssReceiver.cpp | ut-issl/s2e-core | 900fae6b738eb8765cd98c48acb2b74f05dcc68c | [
"MIT"
] | 61 | 2022-01-04T22:56:36.000Z | 2022-03-31T13:19:29.000Z | src/Component/AOCS/InitGnssReceiver.cpp | ut-issl/s2e-core | 900fae6b738eb8765cd98c48acb2b74f05dcc68c | [
"MIT"
] | 2 | 2022-03-03T03:39:25.000Z | 2022-03-12T04:50:30.000Z | #include "InitGnssReceiver.hpp"
#include <string.h>
#include "Interface/InitInput/IniAccess.h"
typedef struct _gnssrecever_param {
int prescaler;
AntennaModel antenna_model;
Vector<3> antenna_pos_b;
Quaternion q_b2c;
double half_width;
std::string gnss_id;
int ch_max;
Vector<3> noise_std;
} GNSSRecei... | 44.269841 | 139 | 0.756902 | [
"vector",
"model"
] |
5a596bb29bcc31c8d8bc3608e8d6f90842888a70 | 17,002 | cpp | C++ | indra/newview/llchatbar.cpp | SaladDais/LLUDP-Encryption | 8a426cd0dd154e1a10903e0e6383f4deb2a6098a | [
"ISC"
] | 1 | 2022-01-29T07:10:03.000Z | 2022-01-29T07:10:03.000Z | indra/newview/llchatbar.cpp | SaladDais/LLUDP-Encryption | 8a426cd0dd154e1a10903e0e6383f4deb2a6098a | [
"ISC"
] | null | null | null | indra/newview/llchatbar.cpp | SaladDais/LLUDP-Encryption | 8a426cd0dd154e1a10903e0e6383f4deb2a6098a | [
"ISC"
] | 1 | 2021-10-01T22:22:27.000Z | 2021-10-01T22:22:27.000Z | /**
* @file llchatbar.cpp
* @brief LLChatBar class implementation
*
* $LicenseInfo:firstyear=2002&license=viewerlgpl$
* Second Life Viewer Source Code
* Copyright (C) 2010, Linden Research, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser Ge... | 25.917683 | 116 | 0.683861 | [
"object"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.