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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
502d240e6107c5f045e6ebcee9c875dd3a74e420 | 16,080 | cpp | C++ | src/client_main/graphics/ui/label.cpp | snowmeltarcade/projectfarm | 6a35330f63bff06465c4ee1a0fbc5277c0d22982 | [
"MIT"
] | null | null | null | src/client_main/graphics/ui/label.cpp | snowmeltarcade/projectfarm | 6a35330f63bff06465c4ee1a0fbc5277c0d22982 | [
"MIT"
] | 7 | 2021-05-30T21:52:39.000Z | 2021-06-25T22:35:28.000Z | src/client_main/graphics/ui/label.cpp | snowmeltarcade/projectfarm | 6a35330f63bff06465c4ee1a0fbc5277c0d22982 | [
"MIT"
] | null | null | null | #include <algorithm>
#include "label.h"
#include "graphics/graphics.h"
#include "api/logging/logging.h"
using namespace std::literals;
namespace projectfarm::graphics::ui
{
bool Label::SetText(std::string_view text,
bool forceUpdate) noexcept
{
if (!forceUpdate && text == this... | 33.995772 | 139 | 0.523632 | [
"render",
"vector"
] |
502e7cd52d109f7d5d767e092896148f83857c0d | 5,312 | cpp | C++ | lib/ErriezDS3231/platformio/src/main.cpp | Erriez/ESP8266UbidotsSensors | 498d932aca5c0a4d9f3f2a701e60f22ee068669d | [
"MIT"
] | null | null | null | lib/ErriezDS3231/platformio/src/main.cpp | Erriez/ESP8266UbidotsSensors | 498d932aca5c0a4d9f3f2a701e60f22ee068669d | [
"MIT"
] | null | null | null | lib/ErriezDS3231/platformio/src/main.cpp | Erriez/ESP8266UbidotsSensors | 498d932aca5c0a4d9f3f2a701e60f22ee068669d | [
"MIT"
] | 2 | 2020-01-30T18:35:58.000Z | 2021-12-02T14:22:53.000Z | /*
* MIT License
*
* Copyright (c) 2018 Erriez
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, m... | 29.027322 | 98 | 0.674322 | [
"object"
] |
5042bb13c65027e0c6595de1dfbae6329938a556 | 1,451 | cpp | C++ | #166_fraction-to-recurring-decimal/fraction-to-recurring-decimal.cpp | o-oppang/lets-solve-algorithm | 9983a112736ce48bbd309a9af16d1fd68b9420da | [
"MIT"
] | null | null | null | #166_fraction-to-recurring-decimal/fraction-to-recurring-decimal.cpp | o-oppang/lets-solve-algorithm | 9983a112736ce48bbd309a9af16d1fd68b9420da | [
"MIT"
] | null | null | null | #166_fraction-to-recurring-decimal/fraction-to-recurring-decimal.cpp | o-oppang/lets-solve-algorithm | 9983a112736ce48bbd309a9af16d1fd68b9420da | [
"MIT"
] | null | null | null | class Solution {
public:
string fractionToDecimal(int numerator, int denominator) {
stringstream ss;
if( numerator / static_cast<float>( denominator ) < 0.0 && numerator / static_cast<float>( denominator ) > -1.0 ) ss << "-";
ss << to_string( numerator / static_cast<long>( denominator ) );
... | 42.676471 | 133 | 0.548587 | [
"vector"
] |
505e2562057668530d2b8d121c89b1db857ec89e | 8,795 | hpp | C++ | bin/Thread.hpp | xywzwd/VT-Wireless | ec42e742e2be26310df4b25cef9cea873896890b | [
"MIT"
] | 6 | 2019-01-05T08:30:32.000Z | 2022-03-10T08:19:57.000Z | bin/Thread.hpp | xywzwd/VT-Wireless | ec42e742e2be26310df4b25cef9cea873896890b | [
"MIT"
] | 4 | 2019-10-18T14:31:04.000Z | 2020-10-16T16:52:30.000Z | bin/Thread.hpp | xywzwd/VT-Wireless | ec42e742e2be26310df4b25cef9cea873896890b | [
"MIT"
] | 5 | 2017-05-12T21:24:18.000Z | 2022-03-10T08:20:02.000Z |
// This must be a signal that is not caught by the main thread
// in crts_radio.cpp in variable exitSignals[].
//
#define THREAD_EXIT_SIG (SIGUSR2)
// A queue of condition variables.
//
// You might ask why are we writing our on queue and not using
// std:queue<>. The simple answer is that this is much much faster... | 33.826923 | 78 | 0.604093 | [
"object"
] |
505f8f75aebaa50b0077df3a97d351eba5a1d794 | 14,461 | cpp | C++ | Modules-old/openni/lua_openni.cpp | ToyotaResearchInstitute/rad-robot | 9a47e4d88382719ab9bf142932fbcc83dcbcd665 | [
"MIT"
] | null | null | null | Modules-old/openni/lua_openni.cpp | ToyotaResearchInstitute/rad-robot | 9a47e4d88382719ab9bf142932fbcc83dcbcd665 | [
"MIT"
] | null | null | null | Modules-old/openni/lua_openni.cpp | ToyotaResearchInstitute/rad-robot | 9a47e4d88382719ab9bf142932fbcc83dcbcd665 | [
"MIT"
] | 2 | 2018-06-04T12:38:54.000Z | 2018-09-22T10:31:27.000Z | /*****************************************************************************
* *
* OpenNI 2.x Alpha *
* Copyright (C) 2012 PrimeSense Ltd. *
... | 24.97582 | 152 | 0.644077 | [
"object"
] |
5064d1dadafd0bb47a2f6f9b2d8efc20916e10d3 | 14,638 | hpp | C++ | cisco-ios-xr/ydk/models/cisco_ios_xr/Cisco_IOS_XR_rptiming_tmg_oper.hpp | CiscoDevNet/ydk-cpp | ef7d75970f2ef1154100e0f7b0a2ee823609b481 | [
"ECL-2.0",
"Apache-2.0"
] | 17 | 2016-12-02T05:45:49.000Z | 2022-02-10T19:32:54.000Z | cisco-ios-xr/ydk/models/cisco_ios_xr/Cisco_IOS_XR_rptiming_tmg_oper.hpp | CiscoDevNet/ydk-cpp | ef7d75970f2ef1154100e0f7b0a2ee823609b481 | [
"ECL-2.0",
"Apache-2.0"
] | 2 | 2017-03-27T15:22:38.000Z | 2019-11-05T08:30:16.000Z | cisco-ios-xr/ydk/models/cisco_ios_xr/Cisco_IOS_XR_rptiming_tmg_oper.hpp | CiscoDevNet/ydk-cpp | ef7d75970f2ef1154100e0f7b0a2ee823609b481 | [
"ECL-2.0",
"Apache-2.0"
] | 11 | 2016-12-02T05:45:52.000Z | 2019-11-07T08:28:17.000Z | #ifndef _CISCO_IOS_XR_RPTIMING_TMG_OPER_
#define _CISCO_IOS_XR_RPTIMING_TMG_OPER_
#include <memory>
#include <vector>
#include <string>
#include <ydk/types.hpp>
#include <ydk/errors.hpp>
namespace cisco_ios_xr {
namespace Cisco_IOS_XR_rptiming_tmg_oper {
class TimingCard : public ydk::Entity
{
public:
Ti... | 45.74375 | 162 | 0.647766 | [
"vector"
] |
506905bba2c15afaa0f1ce5e3fdaf5c8eb46b9e6 | 829 | cpp | C++ | ALGORITHMS/Dynamic Programming/DP_25_Buy_And_Sell_Infi_Transaction_Fee.cpp | compl3xX/ROAD-TO-DSA | 2261c112135a51d9d88c4b57e6f062f6b32550a7 | [
"MIT"
] | null | null | null | ALGORITHMS/Dynamic Programming/DP_25_Buy_And_Sell_Infi_Transaction_Fee.cpp | compl3xX/ROAD-TO-DSA | 2261c112135a51d9d88c4b57e6f062f6b32550a7 | [
"MIT"
] | null | null | null | ALGORITHMS/Dynamic Programming/DP_25_Buy_And_Sell_Infi_Transaction_Fee.cpp | compl3xX/ROAD-TO-DSA | 2261c112135a51d9d88c4b57e6f062f6b32550a7 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
void transactions(vector<int> arr, int fee)
{
int obsp = -arr[0];
int ossp = 0;
for (int i = 1; i < arr.size(); i++)
{
int nbsp = 0;
int nssp = 0;
if (ossp - arr[i] > obsp)
{
nbsp = ossp - arr[i];
... | 15.942308 | 43 | 0.394451 | [
"vector"
] |
50720bd8a7ca4cce26c0dcf2e63a5b998eaaa74c | 2,580 | cxx | C++ | codes/Algorithm/Measurements/MeasurementFor3D.cxx | wuzhuobin/IADE_Analyzer | fa78f5999c820a7cf6bf740080933d84ef8952ca | [
"Apache-2.0"
] | 2 | 2021-01-09T08:13:23.000Z | 2021-04-28T14:16:50.000Z | codes/Algorithm/Measurements/MeasurementFor3D.cxx | wuzhuobin/IADE_Analyzer | fa78f5999c820a7cf6bf740080933d84ef8952ca | [
"Apache-2.0"
] | 8 | 2017-02-09T11:04:13.000Z | 2017-03-22T03:25:12.000Z | codes/Algorithm/Measurements/MeasurementFor3D.cxx | wuzhuobin/IADE_Analyzer | fa78f5999c820a7cf6bf740080933d84ef8952ca | [
"Apache-2.0"
] | null | null | null | #include "MeasurementFor3D.h"
#include <vtkImageAccumulate.h>
#include <vtkSmartPointer.h>
MeasurementFor3D::MeasurementFor3D()
{
this->overlay = NULL;
this->lookupTable = NULL;
this->volumes = NULL;
}
MeasurementFor3D::~MeasurementFor3D()
{
if (this->volumes != NULL) {
delete volumes;
}
}
void MeasurementFo... | 24.571429 | 88 | 0.665891 | [
"3d"
] |
50739bfc5cc2dc9156e691b8b1757b5a0631f608 | 2,174 | cpp | C++ | plugins/wininput/src/cursor/pixmap.cpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 2 | 2016-01-27T13:18:14.000Z | 2018-05-11T01:11:32.000Z | plugins/wininput/src/cursor/pixmap.cpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | null | null | null | plugins/wininput/src/cursor/pixmap.cpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 3 | 2018-05-11T01:11:34.000Z | 2021-04-24T19:47:45.000Z | // Copyright Carl Philipp Reh 2006 - 2019.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <sge/input/exception.hpp>
#include <sge/wininput/cursor/pixmap.hpp>
#include <awl/backends... | 36.233333 | 96 | 0.644434 | [
"vector"
] |
50895087908f67e597c272940144ecb2c206b9fc | 3,285 | cpp | C++ | Competitive Programming/Heap/Smallest range in K lists.cpp | shreejitverma/GeeksforGeeks | d7bcb166369fffa9a031a258e925b6aff8d44e6c | [
"MIT"
] | 2 | 2022-02-18T05:14:28.000Z | 2022-03-08T07:00:08.000Z | Competitive Programming/Heap/Smallest range in K lists.cpp | shivaniverma1/Competitive-Programming-1 | d7bcb166369fffa9a031a258e925b6aff8d44e6c | [
"MIT"
] | 6 | 2022-01-13T04:31:04.000Z | 2022-03-12T01:06:16.000Z | Competitive Programming/Heap/Smallest range in K lists.cpp | shivaniverma1/Competitive-Programming-1 | d7bcb166369fffa9a031a258e925b6aff8d44e6c | [
"MIT"
] | 2 | 2022-02-14T19:53:53.000Z | 2022-02-18T05:14:30.000Z | /*
https://practice.geeksforgeeks.org/problems/find-smallest-range-containing-elements-from-k-lists/1
Smallest range in K lists
Hard Accuracy: 50.36% Submissions: 11146 Points: 8
Given K sorted lists of integers, KSortedArray[] of size N each. The task is to find the smallest range that includes at least one element f... | 26.92623 | 240 | 0.542466 | [
"vector"
] |
509dcc7b9202ff3a3f04b8049c42272e3252e955 | 1,151 | cpp | C++ | CPP/Offer/14/CuttingRangeOffer.cpp | Insofan/LeetCode | d6722601886e181745a2e9c31cb146bc0826c906 | [
"Apache-2.0"
] | null | null | null | CPP/Offer/14/CuttingRangeOffer.cpp | Insofan/LeetCode | d6722601886e181745a2e9c31cb146bc0826c906 | [
"Apache-2.0"
] | null | null | null | CPP/Offer/14/CuttingRangeOffer.cpp | Insofan/LeetCode | d6722601886e181745a2e9c31cb146bc0826c906 | [
"Apache-2.0"
] | null | null | null | //
// Created by Insomnia on 18-8-30.
//
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int cuttingRange(int length) {
/*
if (length == 0) {
return 0;
}
*/
if (length <= 1) {
return 0;
}
if ... | 17.707692 | 55 | 0.372719 | [
"vector"
] |
509fd2c10112c699a7fc417c9b30236408b885a2 | 285 | cpp | C++ | 131-Palindrome-Partitioning/Palindrome-Partitioning.cpp | xta0/LeetCode-Solutions | ab0de97b35fb54c24bcef0398a9d75bdac9ee8b2 | [
"MIT"
] | 4 | 2018-08-07T11:45:32.000Z | 2019-05-19T08:52:19.000Z | 131-Palindrome-Partitioning/Palindrome-Partitioning.cpp | xta0/LeetCode-Solutions | ab0de97b35fb54c24bcef0398a9d75bdac9ee8b2 | [
"MIT"
] | null | null | null | 131-Palindrome-Partitioning/Palindrome-Partitioning.cpp | xta0/LeetCode-Solutions | ab0de97b35fb54c24bcef0398a9d75bdac9ee8b2 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class Solution {
private:
vector<string> helper(string& s){
return {};
}
public:
vector<vector<string>> partition(string s) {
return {};
}
};
int main(){
return 0;
} | 12.391304 | 48 | 0.592982 | [
"vector"
] |
50a4fdccbc20f0c5568b056b452d9afb930aa452 | 544 | cpp | C++ | src/stringUtils.cpp | frassom/ini-editor | 43df1942872b18980aca7a855fb4bf6e49d8d9ca | [
"MIT"
] | 1 | 2021-01-26T03:11:27.000Z | 2021-01-26T03:11:27.000Z | src/stringUtils.cpp | frassom/ini-editor | 43df1942872b18980aca7a855fb4bf6e49d8d9ca | [
"MIT"
] | 1 | 2021-01-26T03:14:22.000Z | 2021-01-26T03:14:22.000Z | src/stringUtils.cpp | frassom/ini-editor | 43df1942872b18980aca7a855fb4bf6e49d8d9ca | [
"MIT"
] | null | null | null | #include "stringUtils.h"
namespace ini { namespace StringUtils {
void trimLeft(std::string& s) {
s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](int ch) { return !std::isspace(ch); }));
}
void trimRight(std::string& s) {
s.erase(std::find_if(s.rbegin(), s.rend(), [](int ch) { return !std::isspace(ch); ... | 22.666667 | 97 | 0.606618 | [
"transform"
] |
50a6ed79f8c10a14af42ce0fd7bec54b38976273 | 2,281 | cc | C++ | src/sequence.cc | zhanghaicang/COLORS | 9a54a5e870b1b040a7455b93636f15652016c833 | [
"BSD-3-Clause"
] | 1 | 2021-05-26T08:47:47.000Z | 2021-05-26T08:47:47.000Z | src/sequence.cc | zhanghaicang/COLORS | 9a54a5e870b1b040a7455b93636f15652016c833 | [
"BSD-3-Clause"
] | null | null | null | src/sequence.cc | zhanghaicang/COLORS | 9a54a5e870b1b040a7455b93636f15652016c833 | [
"BSD-3-Clause"
] | null | null | null | #include "sequence.h"
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <string>
namespace colors {
int read_msa(const char* file_path, std::vector<std::string>& msa) {
std::ifstream fin;
fin.open(file_path);
if (fin.fail()) {
std::cerr << "Failed in open file " << fil... | 17.150376 | 77 | 0.469093 | [
"vector"
] |
50aa44d2f6486e13865ca132fa656af2c35125c6 | 10,397 | cpp | C++ | myNeat/coevGui/clientGui/mainwindow.cpp | hoodoer/NEAT_Thesis | b61521d1ee6ac0cdaca81971501039b93f0dbf08 | [
"BSD-2-Clause"
] | 3 | 2018-10-28T01:11:09.000Z | 2020-02-10T23:55:04.000Z | myNeat/coevGui/clientGui/mainwindow.cpp | hoodoer/NEAT_Thesis | b61521d1ee6ac0cdaca81971501039b93f0dbf08 | [
"BSD-2-Clause"
] | null | null | null | myNeat/coevGui/clientGui/mainwindow.cpp | hoodoer/NEAT_Thesis | b61521d1ee6ac0cdaca81971501039b93f0dbf08 | [
"BSD-2-Clause"
] | null | null | null | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <iostream>
using namespace std;
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
blockSize = 0;
connected = false;
systemPaused = false;
blueChampIndex = 0;
blueChampNumNeuron... | 25.174334 | 108 | 0.611811 | [
"render"
] |
27054d30f6c43b2e17a5f566763f257511c20932 | 441 | cpp | C++ | leetcode/algorithm/318.cpp | juseongkr/BOJ | 8f10a2bf9a7d695455493fbe7423347a8b648416 | [
"Apache-2.0"
] | 7 | 2020-02-03T10:00:19.000Z | 2021-11-16T11:03:57.000Z | leetcode/algorithm/318.cpp | juseongkr/Algorithm-training | 8f10a2bf9a7d695455493fbe7423347a8b648416 | [
"Apache-2.0"
] | 1 | 2021-01-03T06:58:24.000Z | 2021-01-03T06:58:24.000Z | leetcode/algorithm/318.cpp | juseongkr/Algorithm-training | 8f10a2bf9a7d695455493fbe7423347a8b648416 | [
"Apache-2.0"
] | 1 | 2020-01-22T14:34:03.000Z | 2020-01-22T14:34:03.000Z | class Solution {
public:
int maxProduct(vector<string>& words) {
vector<int> dict(words.size()+1, 0);
for (int i=0; i<words.size(); ++i)
for (int j=0; j<words[i].length(); ++j)
dict[i] |= (1 << (words[i][j]-'a'));
int ans = 0;
for (int i=0; i<words.size(); ++i)
for (int j=i+1; j<words.size(); ++j)
... | 24.5 | 66 | 0.526077 | [
"vector"
] |
270d2dd3979b6273825e6e6fbd6a031ac78be007 | 1,485 | hpp | C++ | node.hpp | Aleksej10/checkersAI | d696d092023b1f2da85ca3810819bf3765ea8d78 | [
"MIT"
] | null | null | null | node.hpp | Aleksej10/checkersAI | d696d092023b1f2da85ca3810819bf3765ea8d78 | [
"MIT"
] | null | null | null | node.hpp | Aleksej10/checkersAI | d696d092023b1f2da85ca3810819bf3765ea8d78 | [
"MIT"
] | null | null | null | #ifndef NODE_H
#define NODE_H
#include "pos.hpp"
#include "model.hpp"
#include <vector>
#include <cmath>
#include <cstdlib>
#include <map>
#include <torch/torch.h>
#include <queue>
#include <future>
class Node {
private:
Node * father_;
Pos pos_;
std::vector<Move>* moves_;
uint8_t move_n_;
uint8_... | 20.915493 | 77 | 0.626263 | [
"vector",
"model"
] |
270fe8a772a4c371471c58e7bdadecdd35999d7c | 1,991 | cpp | C++ | leetcode/144.cpp | laiyuling424/LeetCode | afb582026b4d9a4082fdb99fc65b437e55d1f64d | [
"Apache-2.0"
] | null | null | null | leetcode/144.cpp | laiyuling424/LeetCode | afb582026b4d9a4082fdb99fc65b437e55d1f64d | [
"Apache-2.0"
] | null | null | null | leetcode/144.cpp | laiyuling424/LeetCode | afb582026b4d9a4082fdb99fc65b437e55d1f64d | [
"Apache-2.0"
] | null | null | null | //
// Created by 赖於领 on 2021/8/18.
//
#include <vector>
#include <iostream>
using namespace std;
//二叉树的前序遍历
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int... | 22.625 | 93 | 0.579608 | [
"vector"
] |
271178a18b6f0a879bb29e0756a2e69b356f9337 | 662 | cpp | C++ | 10 Leetcode/Medium/longest-substring-without-repeating-characters.cpp | akritisneh/OnAndOn | a14f964c14d6a7a5fbef43db99f61a357b1f52f8 | [
"MIT"
] | 13 | 2021-10-05T15:50:21.000Z | 2022-03-04T19:43:18.000Z | 10 Leetcode/Medium/longest-substring-without-repeating-characters.cpp | akritisneh/OnAndOn | a14f964c14d6a7a5fbef43db99f61a357b1f52f8 | [
"MIT"
] | 18 | 2021-10-05T14:43:14.000Z | 2021-10-21T04:19:34.000Z | 10 Leetcode/Medium/longest-substring-without-repeating-characters.cpp | akritisneh/OnAndOn | a14f964c14d6a7a5fbef43db99f61a357b1f52f8 | [
"MIT"
] | 21 | 2021-10-05T14:34:25.000Z | 2021-10-17T09:07:46.000Z | class Solution {
public:
int lengthOfLongestSubstring(string s) {
vector<int> map(256,-1); //a string can have 256 different characters
//Each character is stored using eight bits of information, giving a total number of 256 different characters (2**8 = 256).
int left=0;
int... | 27.583333 | 131 | 0.489426 | [
"vector"
] |
2713f8da97a0b727990e1a2cee5a082afa8fb96c | 446 | cpp | C++ | src/Game.cpp | amoulis/Chessy | 7a31a79ee15eef25037ba316918c6a6f603caf6c | [
"Unlicense"
] | null | null | null | src/Game.cpp | amoulis/Chessy | 7a31a79ee15eef25037ba316918c6a6f603caf6c | [
"Unlicense"
] | null | null | null | src/Game.cpp | amoulis/Chessy | 7a31a79ee15eef25037ba316918c6a6f603caf6c | [
"Unlicense"
] | null | null | null | #include "Game.hpp"
namespace game {
std::vector <std::vector <int> >
Game::is_not_out_of_the_board(std::vector < std::vector <int> >& data_in)
{
for(int i = 0; i < data_in.size(); i++)
{
std::vector<int> vec = data_in[i];
if( vec[0] < 0 || vec[0] > m_board_size)
{
if( vec[1] < 0 || vec[1] > m_... | 17.84 | 73 | 0.547085 | [
"vector"
] |
271440429d560fe4541ae06371c7b975922191ee | 59,750 | cpp | C++ | implementations/ugene/src/corelibs/U2View/src/ov_sequence/AnnotatedDNAView.cpp | r-barnes/sw_comparison | 1ac2c9cc10a32badd6b8fb1e96516c97f7800176 | [
"BSD-Source-Code"
] | null | null | null | implementations/ugene/src/corelibs/U2View/src/ov_sequence/AnnotatedDNAView.cpp | r-barnes/sw_comparison | 1ac2c9cc10a32badd6b8fb1e96516c97f7800176 | [
"BSD-Source-Code"
] | null | null | null | implementations/ugene/src/corelibs/U2View/src/ov_sequence/AnnotatedDNAView.cpp | r-barnes/sw_comparison | 1ac2c9cc10a32badd6b8fb1e96516c97f7800176 | [
"BSD-Source-Code"
] | null | null | null | /**
* UGENE - Integrated Bioinformatics Tools.
* Copyright (C) 2008-2020 UniPro <ugene@unipro.ru>
* http://ugene.net
*
* 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
* ... | 39.335089 | 269 | 0.686678 | [
"geometry",
"object",
"3d"
] |
2725810676c6c2881ae2a73e0be4a377e8f706ab | 1,153 | cpp | C++ | test/beast/json/allocator.cpp | djarek/BeastLounge | 353b2397cf8507d6e36ed913d6682ae2d827a1ab | [
"BSL-1.0"
] | null | null | null | test/beast/json/allocator.cpp | djarek/BeastLounge | 353b2397cf8507d6e36ed913d6682ae2d827a1ab | [
"BSL-1.0"
] | null | null | null | test/beast/json/allocator.cpp | djarek/BeastLounge | 353b2397cf8507d6e36ed913d6682ae2d827a1ab | [
"BSL-1.0"
] | null | null | null | //
// Copyright (c) 2018-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/vinniefalco/BeastLounge
//
// Test tha... | 22.173077 | 79 | 0.629662 | [
"vector"
] |
27262481622cdb7c0add7073bee9b45f7312aa23 | 4,061 | cpp | C++ | src/main.cpp | 0V/raytracer | cbe8f90e7e9a67f0eebd7dac01ea7476b9dc0ca9 | [
"MIT"
] | 1 | 2020-05-28T19:17:45.000Z | 2020-05-28T19:17:45.000Z | src/main.cpp | 0V/raytracer | cbe8f90e7e9a67f0eebd7dac01ea7476b9dc0ca9 | [
"MIT"
] | null | null | null | src/main.cpp | 0V/raytracer | cbe8f90e7e9a67f0eebd7dac01ea7476b9dc0ca9 | [
"MIT"
] | null | null | null | #include <iostream>
#include "photonmap.h"
#include "photonmap_sample.h"
#include "ppm_sample.h"
#include "progressive_photonmapping.h"
#include "raw_ppm.h"
#include "render.h"
#include "simple-mlt.h"
#include "simple-mlt-raw.h"
#include "smallppm_exp.h"
#include "sppm2.h"
#include "stochastic_ppm.h"
i... | 41.438776 | 121 | 0.57769 | [
"render"
] |
272676376705ca4f95af0e15d58f9ad36c4a80d0 | 888 | cpp | C++ | projects/codility/zirconium2019/zirconium2019.cpp | antaljanosbenjamin/miscellaneous | 56d2f0030d1d8ff0dd6dd077c3d1ec981f6c2747 | [
"MIT"
] | 2 | 2021-06-24T21:46:56.000Z | 2021-09-24T07:51:04.000Z | projects/codility/zirconium2019/zirconium2019.cpp | antaljanosbenjamin/miscellaneous | 56d2f0030d1d8ff0dd6dd077c3d1ec981f6c2747 | [
"MIT"
] | null | null | null | projects/codility/zirconium2019/zirconium2019.cpp | antaljanosbenjamin/miscellaneous | 56d2f0030d1d8ff0dd6dd077c3d1ec981f6c2747 | [
"MIT"
] | null | null | null |
int main() {
{
std::vector<int> A{4, 2, 1}; // NOLINT(readability-magic-numbers)
std::vector<int> B{2, 5, 3}; // NOLINT(readability-magic-numbers)
std::cout << "10 == " << solution(A, B, 2) << '\n'; // NOLINT(readability-magic-numbers)
}
{
std::vector... | 46.736842 | 92 | 0.490991 | [
"vector"
] |
2728923cfaa73f814051136c1c3f4b692c90840e | 191,741 | cpp | C++ | deps/mozjs/src/shell/js.cpp | ktrzeciaknubisa/jxcore-binary-packaging | 5759df084be10a259a4a4f1b38c214c6084a7c0f | [
"Apache-2.0"
] | 2,494 | 2015-02-11T04:34:13.000Z | 2022-03-31T14:21:47.000Z | deps/mozjs/src/shell/js.cpp | ktrzeciaknubisa/jxcore-binary-packaging | 5759df084be10a259a4a4f1b38c214c6084a7c0f | [
"Apache-2.0"
] | 685 | 2015-02-11T17:14:26.000Z | 2021-04-13T09:58:39.000Z | deps/mozjs/src/shell/js.cpp | ktrzeciaknubisa/jxcore-binary-packaging | 5759df084be10a259a4a4f1b38c214c6084a7c0f | [
"Apache-2.0"
] | 442 | 2015-02-12T13:45:46.000Z | 2022-03-21T05:28:05.000Z | /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*- * vim: set ts=8 sts=4 et sw=4 tw=99:
* 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/. */
... | 30.507717 | 125 | 0.6071 | [
"object",
"shape",
"vector"
] |
27306396d37abbabf8c7e94f1d0044ac31570408 | 5,732 | cpp | C++ | src/standingpoint.cpp | zhenyushi/vrui_mdf | f1144ac11b678623cfeea0ae90bd9c2703cca9a1 | [
"BSD-3-Clause"
] | 8 | 2018-08-29T14:47:04.000Z | 2021-09-28T23:54:51.000Z | archive/src/standingpoint.cpp | ConradKent/vrui_mdf | 33c07a3e693d061bcd8a9566ce9667166ecbb3fa | [
"BSD-3-Clause"
] | 1 | 2019-03-04T23:56:50.000Z | 2021-01-01T03:41:49.000Z | archive/src/standingpoint.cpp | ConradKent/vrui_mdf | 33c07a3e693d061bcd8a9566ce9667166ecbb3fa | [
"BSD-3-Clause"
] | 3 | 2019-07-23T17:26:56.000Z | 2021-06-25T18:58:12.000Z | /*
*/
#include <stdlib.h>
#include<iostream>
#include<fstream>
#include <ros/ros.h>
#include <vrui_mdf/Vive.h>
#include "std_msgs/String.h"
#include <tf/transform_broadcaster.h> // translation between Eular angle and Quaternion, unnecessary for tracking since Quaternion can be received directly
#include "tf/trans... | 25.362832 | 180 | 0.720865 | [
"model"
] |
2737518b6a624315891517c4cfd61c512b16ad3b | 10,447 | cxx | C++ | repro/plugins/pyroute/PyRouteWorker.cxx | dulton/reSipServer | ac4241df81c1e3eef2e678271ffef4dda1fc6747 | [
"Apache-2.0"
] | 1 | 2019-04-15T14:10:58.000Z | 2019-04-15T14:10:58.000Z | repro/plugins/pyroute/PyRouteWorker.cxx | dulton/reSipServer | ac4241df81c1e3eef2e678271ffef4dda1fc6747 | [
"Apache-2.0"
] | null | null | null | repro/plugins/pyroute/PyRouteWorker.cxx | dulton/reSipServer | ac4241df81c1e3eef2e678271ffef4dda1fc6747 | [
"Apache-2.0"
] | 2 | 2019-10-31T09:11:09.000Z | 2021-09-17T01:00:49.000Z |
#include <memory>
/* Using the PyCXX API for C++ Python integration
* It is extremely convenient and avoids the need to write boilerplate
* code for handling the Python reference counts.
* It is licensed under BSD terms compatible with reSIProcate */
#include <Python.h>
#include <CXX/Objects.hxx>
#include "rutil/... | 30.457726 | 116 | 0.641907 | [
"object"
] |
2739d628cc3e3e035fe1a1a01fcf4c62e07fa43c | 4,025 | cc | C++ | src/kudu/master/mini_master.cc | AnupamaGupta01/kudu-1 | 79ee29db5ac1b458468b11f16f57f124601788e6 | [
"Apache-2.0"
] | 2 | 2016-09-12T06:53:49.000Z | 2016-09-12T15:47:46.000Z | src/kudu/master/mini_master.cc | AnupamaGupta01/kudu-1 | 79ee29db5ac1b458468b11f16f57f124601788e6 | [
"Apache-2.0"
] | null | null | null | src/kudu/master/mini_master.cc | AnupamaGupta01/kudu-1 | 79ee29db5ac1b458468b11f16f57f124601788e6 | [
"Apache-2.0"
] | 2 | 2018-04-03T05:49:03.000Z | 2020-05-29T21:18:46.000Z | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... | 27.013423 | 86 | 0.727453 | [
"vector"
] |
2751b512eb6b2015d129c7366cfe4a3886ba4b82 | 1,985 | cpp | C++ | src/xrGame/actor_mp_client.cpp | acidicMercury8/xray-1.6 | 52fba7348a93a52ff9694f2c9dd40c0d090e791e | [
"Linux-OpenIB"
] | 10 | 2021-05-04T06:40:27.000Z | 2022-01-20T20:24:28.000Z | src/xrGame/actor_mp_client.cpp | acidicMercury8/xray-1.6 | 52fba7348a93a52ff9694f2c9dd40c0d090e791e | [
"Linux-OpenIB"
] | null | null | null | src/xrGame/actor_mp_client.cpp | acidicMercury8/xray-1.6 | 52fba7348a93a52ff9694f2c9dd40c0d090e791e | [
"Linux-OpenIB"
] | 2 | 2020-05-17T10:01:14.000Z | 2020-09-11T20:17:27.000Z | #include "stdafx.h"
#include "actor_mp_client.h"
#include "actorcondition.h"
#include "../xrEngine/CameraBase.h"
#include "../xrEngine/CameraManager.h"
#include "game_cl_base.h"
#include "ui/UIActorMenu.h"
#include "ui/UIDragDropReferenceList.h"
#include "uigamecustom.h"
#include "eatable_item.h"
//if we ... | 22.055556 | 80 | 0.680605 | [
"object"
] |
2752081e2492f87877d8704e66de9b97b3de6168 | 975 | cpp | C++ | problems/162.Find_Peak_Element/AC_binary_search.cpp | subramp-prep/leetcode | d125201d9021ab9b1eea5e5393c2db4edd84e740 | [
"Unlicense"
] | null | null | null | problems/162.Find_Peak_Element/AC_binary_search.cpp | subramp-prep/leetcode | d125201d9021ab9b1eea5e5393c2db4edd84e740 | [
"Unlicense"
] | null | null | null | problems/162.Find_Peak_Element/AC_binary_search.cpp | subramp-prep/leetcode | d125201d9021ab9b1eea5e5393c2db4edd84e740 | [
"Unlicense"
] | null | null | null | /*
* Author: illuz <iilluzen[at]gmail.com>
* File: AC_binary_search.cpp
* Create Date: 2015-02-14 09:18:02
* Descripton: Binary search
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 0;
class Solution {
private:
int findPeakInRange(const vector<int> &num, int lhs, int rhs) {
... | 22.159091 | 67 | 0.530256 | [
"vector"
] |
275532ab92140c639fa8aa5513e246339e5a2cb7 | 6,522 | cpp | C++ | editor/core/src/Log.cpp | lizardkinger/blacksun | 0119948726d2a057c13d208044c7664a8348a1ea | [
"Linux-OpenIB"
] | null | null | null | editor/core/src/Log.cpp | lizardkinger/blacksun | 0119948726d2a057c13d208044c7664a8348a1ea | [
"Linux-OpenIB"
] | null | null | null | editor/core/src/Log.cpp | lizardkinger/blacksun | 0119948726d2a057c13d208044c7664a8348a1ea | [
"Linux-OpenIB"
] | null | null | null | /***************************************************************************
* Copyright (C) 2006 by Philipp Gruber
* pgruber@fh-landshut.de
*
* 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 Softw... | 26.512195 | 76 | 0.549525 | [
"vector",
"transform"
] |
275589a368330747723674b136619d499550d332 | 5,300 | cpp | C++ | SuperCap.cpp | eroicaleo/HEES | bfc1e297d6b0b7f928e590cdb97d9ccda069f483 | [
"MIT"
] | null | null | null | SuperCap.cpp | eroicaleo/HEES | bfc1e297d6b0b7f928e590cdb97d9ccda069f483 | [
"MIT"
] | null | null | null | SuperCap.cpp | eroicaleo/HEES | bfc1e297d6b0b7f928e590cdb97d9ccda069f483 | [
"MIT"
] | null | null | null | #include <string>
#include <iostream>
#include <fstream>
#include <sstream>
#include <stdio.h>
#include <math.h>
#include "SuperCap.hpp"
#include "main.hpp"
#include <vector>
using namespace std;
supcapacitor::supcapacitor() :
m_p(1),
m_s(4),
m_Totl(4),
m_Racc(0.0), m_Racc1(34e-3),
m_Rs(10e-3), m_Rp(10e-3),
m_R... | 22.649573 | 97 | 0.663208 | [
"vector"
] |
275e7ed0da93517eb324bf74004f97e95b9f9f4a | 530 | cc | C++ | cpp/p021.cc | tlming16/Projec_Euler | 797824c5159fae67493de9eba24c22cc7512d95d | [
"MIT"
] | 4 | 2018-11-14T12:03:05.000Z | 2019-09-03T14:33:28.000Z | cpp/p021.cc | tlming16/Projec_Euler | 797824c5159fae67493de9eba24c22cc7512d95d | [
"MIT"
] | null | null | null | cpp/p021.cc | tlming16/Projec_Euler | 797824c5159fae67493de9eba24c22cc7512d95d | [
"MIT"
] | 1 | 2018-11-17T14:39:22.000Z | 2018-11-17T14:39:22.000Z | # include <iostream>
# include <vector>
int compute();
int main(){
using std::cout;
using std::endl;
cout<<compute()<<endl;
}
int compute(){
const int N=10000;
std::vector<int> divisornum(N,0);
divisornum[1]=1;
for( int i=1;i<divisornum.size();i++){
for (int j=2*i;j<divisornum.size();... | 16.5625 | 54 | 0.558491 | [
"vector"
] |
27606f8bf5b73bd4c59ed71119f7b8d1cb1b5d95 | 12,993 | cpp | C++ | src/main.cpp | Skngg/pkss-data-log-service | 2904a6678048eac02da7184a49c397c0d13fdc6f | [
"MIT"
] | null | null | null | src/main.cpp | Skngg/pkss-data-log-service | 2904a6678048eac02da7184a49c397c0d13fdc6f | [
"MIT"
] | null | null | null | src/main.cpp | Skngg/pkss-data-log-service | 2904a6678048eac02da7184a49c397c0d13fdc6f | [
"MIT"
] | null | null | null | #include <iostream>
#include <pistache/endpoint.h>
#include <rapidjson/document.h>
#include <rapidjson/writer.h>
#include <rapidjson/stringbuffer.h>
#include <pqxx/pqxx>
#include "BuildingData.hpp"
#include "ProviderData.hpp"
#include "HeatExchangerData.hpp"
#include "ControllerData.hpp"
using namespace Pistache;
us... | 25.831014 | 110 | 0.608943 | [
"vector"
] |
27661511da1e2e94dbae1b5581be6c0859d524d0 | 1,212 | hh | C++ | src/GPU/gpu_data_allocator.hh | nandofioretto/GpuDBE | 0722f1f6f0e850795f76825cfaf833997f7fe4af | [
"MIT"
] | null | null | null | src/GPU/gpu_data_allocator.hh | nandofioretto/GpuDBE | 0722f1f6f0e850795f76825cfaf833997f7fe4af | [
"MIT"
] | null | null | null | src/GPU/gpu_data_allocator.hh | nandofioretto/GpuDBE | 0722f1f6f0e850795f76825cfaf833997f7fe4af | [
"MIT"
] | null | null | null | #ifndef ULYSSES_GPU_DATA_ALLOCATOR_H
#define ULYSSES_GPU_DATA_ALLOCATOR_H
#include <vector>
#include <utility> // std::pair, std::make_pair
#include <iostream>
#include <cuda_runtime.h>
#include "Kernel/types.hh"
class DCOPinstance;
namespace CUDA {
class GPU_allocator {
public:
static void allocate_data(int... | 24.734694 | 73 | 0.725248 | [
"vector"
] |
276b3cf86b1b94e1fa98e8f754154d8a9b089059 | 6,943 | hpp | C++ | CT_Recon/hf_texture_helper.hpp | hfan36/recon | a28e5adeb2d1571d466e0e7a58e662be7e645399 | [
"MIT"
] | 1 | 2020-05-28T18:31:34.000Z | 2020-05-28T18:31:34.000Z | CT_Recon/hf_texture_helper.hpp | hfan36/recon | a28e5adeb2d1571d466e0e7a58e662be7e645399 | [
"MIT"
] | null | null | null | CT_Recon/hf_texture_helper.hpp | hfan36/recon | a28e5adeb2d1571d466e0e7a58e662be7e645399 | [
"MIT"
] | null | null | null | //Written by Helen Fan
//Uses Danny Ruijters cubic b-spline interpolation code
//it helps me bind texture memory, allocate memory for binding and unallocate and unbind
//so I know what's being created and destroyed. Just something to use as little memory as possible
//and prevent code from allocating and deallocating ... | 38.359116 | 179 | 0.749532 | [
"3d"
] |
27721ca6e4dc6b1918fb4af19712ae382c317abe | 1,796 | cpp | C++ | solve.cpp | Jackie890621/Combinational-Sum | 3389cae4b98201c0f75195ea7262ba3287c63627 | [
"MIT"
] | null | null | null | solve.cpp | Jackie890621/Combinational-Sum | 3389cae4b98201c0f75195ea7262ba3287c63627 | [
"MIT"
] | null | null | null | solve.cpp | Jackie890621/Combinational-Sum | 3389cae4b98201c0f75195ea7262ba3287c63627 | [
"MIT"
] | null | null | null | //
// set.cpp
// DS_hw3_Stack_and_queue
//
#include <algorithm>
#include "solve.h"
#include <stdio.h>
#include <stdlib.h>
void combinationSum2(vector<int> &candidates, int target, vector< vector<int> > &sol, vector<int> &combination, int begin, int limit, int *count)
{
if (count[0] > limit) {
coun... | 29.933333 | 147 | 0.608575 | [
"vector"
] |
2778cfadd3a77b513614c3aefc520d6a07de61ad | 3,328 | cpp | C++ | Entry/entry.cpp | themonsterdev/Modding | f2711ff6f46981e96b97d193f9dd917e160b1b98 | [
"MIT"
] | null | null | null | Entry/entry.cpp | themonsterdev/Modding | f2711ff6f46981e96b97d193f9dd917e160b1b98 | [
"MIT"
] | null | null | null | Entry/entry.cpp | themonsterdev/Modding | f2711ff6f46981e96b97d193f9dd917e160b1b98 | [
"MIT"
] | null | null | null | #include "pch.h"
Entry::Entry(char* name)
: m_processName (name)
, m_processId (0)
, m_baseAddress (nullptr)
, m_baseSize (0)
{}
// Process Id
DWORD Entry::GetProcessId(DWORD th32ProcessID)
{
if (m_processId == 0)
{
PROCESSENTRY32 pe32{ 0 };
// Take a snapshot of all processes in the system.
HANDLE hPro... | 27.278689 | 94 | 0.685697 | [
"object"
] |
277c12978db17f2437a651d0a020a11761517375 | 1,748 | cpp | C++ | Day 10/Prims-Algorithm-Implementation.cpp | AnanyaDas162/4-th-Semester-DSA-Lab | 4cd343ec9f822da97c1daa01cb05191681a82e50 | [
"MIT"
] | null | null | null | Day 10/Prims-Algorithm-Implementation.cpp | AnanyaDas162/4-th-Semester-DSA-Lab | 4cd343ec9f822da97c1daa01cb05191681a82e50 | [
"MIT"
] | null | null | null | Day 10/Prims-Algorithm-Implementation.cpp | AnanyaDas162/4-th-Semester-DSA-Lab | 4cd343ec9f822da97c1daa01cb05191681a82e50 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#include <fstream>
#define m 10
using namespace std;
int n, i, j;
int g[m][m];
int parent[m], dist[m], mstSet[m];
typedef pair < int,pair < char,char > > p;
priority_queue<p, vector<p>, greater<p> > pq;
void initialize (){
for (i = 0; i < n; i ++){
parent[i] = -1;
dist[i] = I... | 23 | 125 | 0.425629 | [
"vector"
] |
9597fb47e3673fb5754c09a7d7a4c9d7f9983471 | 751 | cpp | C++ | crypto/src/main/native/dpf/test.cpp | arimitx/vizard | 1d40c26533705b48b638eb1491c18903020af4d7 | [
"MIT"
] | null | null | null | crypto/src/main/native/dpf/test.cpp | arimitx/vizard | 1d40c26533705b48b638eb1491c18903020af4d7 | [
"MIT"
] | null | null | null | crypto/src/main/native/dpf/test.cpp | arimitx/vizard | 1d40c26533705b48b638eb1491c18903020af4d7 | [
"MIT"
] | null | null | null | #include "common/DPF.h"
#include <iostream>
int dpfEval(DPF &dpf, std::pair<std::vector<uint8_t>, std::vector<uint8_t>> &keys, uint64_t x, int n) {
auto a = keys.first;
auto b = keys.second;
int ans0 = dpf.Eval(a, 0, x, n);
int ans1 = dpf.Eval(b, 1, x, n);
std::cout << "Ans0: " << ans0 << std::end... | 31.291667 | 103 | 0.557923 | [
"vector"
] |
959a0324d221b0ec2072fdf1d465641e30aabe1e | 2,344 | cc | C++ | public/util/index/index_test.cc | room77/77up | 736806fbf52a5e722e8e57ef5c248823b067175d | [
"MIT"
] | 3 | 2015-05-18T14:52:47.000Z | 2018-11-12T07:51:00.000Z | public/util/index/index_test.cc | room77/77up | 736806fbf52a5e722e8e57ef5c248823b067175d | [
"MIT"
] | null | null | null | public/util/index/index_test.cc | room77/77up | 736806fbf52a5e722e8e57ef5c248823b067175d | [
"MIT"
] | 3 | 2015-08-04T05:58:18.000Z | 2018-11-12T07:51:01.000Z | // Copyright 2012 Room77, Inc.
// Author: pramodg@room77.com (Pramod Gupta)
#include <memory>
#include <vector>
#include "util/index/index.h"
#include "util/memory/stringstorage_unlock.h"
#include "util/string/strutil.h"
#include "test/cc/test_main.h"
namespace test {
struct tIndexTestStr {
string value;
tInd... | 24.93617 | 78 | 0.696246 | [
"vector"
] |
959f1f70f6f990b37a48ff5812f01f07ad1ca373 | 1,740 | hpp | C++ | include/lug/Graphics/Vulkan/Render/Queue.hpp | Lugdunum3D/Lugdunum3D | b6d6907d034fdba1ffc278b96598eba1d860f0d4 | [
"MIT"
] | 275 | 2016-10-08T15:33:17.000Z | 2022-03-30T06:11:56.000Z | include/lug/Graphics/Vulkan/Render/Queue.hpp | Lugdunum3D/Lugdunum3D | b6d6907d034fdba1ffc278b96598eba1d860f0d4 | [
"MIT"
] | 24 | 2016-09-29T20:51:20.000Z | 2018-05-09T21:41:36.000Z | include/lug/Graphics/Vulkan/Render/Queue.hpp | Lugdunum3D/Lugdunum3D | b6d6907d034fdba1ffc278b96598eba1d860f0d4 | [
"MIT"
] | 37 | 2017-02-25T05:03:48.000Z | 2021-05-10T19:06:29.000Z | #pragma once
#include <map>
#include <vector>
#include <lug/Graphics/Export.hpp>
#include <lug/Graphics/Render/Queue.hpp>
#include <lug/Graphics/Vulkan/Render/Material.hpp>
#include <lug/Graphics/Vulkan/Render/Mesh.hpp>
#include <lug/Graphics/Vulkan/Render/SkyBox.hpp>
namespace lug {
namespace Graphics {
namespace V... | 27.619048 | 101 | 0.696552 | [
"mesh",
"render",
"vector"
] |
95a17d43b58cae99909abfcb2cc5019ae8cc8a66 | 7,423 | cpp | C++ | src/lib/operators/jit_operator/jit_types.cpp | cmfcmf/hyrise | d3465dfc83039876c1800bf245e73874947da114 | [
"MIT"
] | null | null | null | src/lib/operators/jit_operator/jit_types.cpp | cmfcmf/hyrise | d3465dfc83039876c1800bf245e73874947da114 | [
"MIT"
] | 17 | 2018-11-28T10:31:31.000Z | 2019-03-06T10:28:12.000Z | src/lib/operators/jit_operator/jit_types.cpp | cmfcmf/hyrise | d3465dfc83039876c1800bf245e73874947da114 | [
"MIT"
] | null | null | null | #include "jit_types.hpp"
namespace opossum {
#define JIT_VARIANT_VECTOR_GET(r, d, type) \
template <> \
BOOST_PP_TUPLE_ELEM(3, 0, type) \
JitVariant... | 52.274648 | 116 | 0.559612 | [
"vector"
] |
95a3fa468ac0f3b8a86b7dc0424761ed52361650 | 10,857 | cxx | C++ | main/connectivity/source/drivers/ado/ADriver.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/connectivity/source/drivers/ado/ADriver.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/connectivity/source/drivers/ado/ADriver.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... | 36.311037 | 263 | 0.610942 | [
"vector"
] |
95a89ec90ef8332affb879716ead10afd71cbf84 | 2,651 | cc | C++ | chrome/browser/privacy_budget/surface_set_with_valuation.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 14,668 | 2015-01-01T01:57:10.000Z | 2022-03-31T23:33:32.000Z | chrome/browser/privacy_budget/surface_set_with_valuation.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 86 | 2015-10-21T13:02:42.000Z | 2022-03-14T07:50:50.000Z | chrome/browser/privacy_budget/surface_set_with_valuation.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 5,941 | 2015-01-02T11:32:21.000Z | 2022-03-31T16:35:46.000Z | // Copyright 2021 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/privacy_budget/surface_set_with_valuation.h"
#include <type_traits>
#include <utility>
#include <vector>
#include "base/check.h... | 28.815217 | 78 | 0.71822 | [
"vector"
] |
95b3d7c7568855bf2bd9c99e89b17b1ac13b2feb | 2,280 | cpp | C++ | src/polycubed/src/server/Resources/Endpoint/LeafListResource.cpp | francescomessina/polycube | 38f2fb4ffa13cf51313b3cab9994be738ba367be | [
"ECL-2.0",
"Apache-2.0"
] | 337 | 2018-12-12T11:50:15.000Z | 2022-03-15T00:24:35.000Z | src/polycubed/src/server/Resources/Endpoint/LeafListResource.cpp | l1b0k/polycube | 7af919245c131fa9fe24c5d39d10039cbb81e825 | [
"ECL-2.0",
"Apache-2.0"
] | 253 | 2018-12-17T21:36:15.000Z | 2022-01-17T09:30:42.000Z | src/polycubed/src/server/Resources/Endpoint/LeafListResource.cpp | l1b0k/polycube | 7af919245c131fa9fe24c5d39d10039cbb81e825 | [
"ECL-2.0",
"Apache-2.0"
] | 90 | 2018-12-19T15:49:38.000Z | 2022-03-27T03:56:07.000Z | /*
* Copyright 2018 The Polycube Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agree... | 40.714286 | 79 | 0.691667 | [
"vector"
] |
95b8d5d57a749c410c281b73ac688a52303bb5fd | 663 | cpp | C++ | sandbox/polymorphtest.cpp | PitEG/poppingamer | 1eade7430b77ddf35098d4e500e2f75aaabbf891 | [
"MIT"
] | null | null | null | sandbox/polymorphtest.cpp | PitEG/poppingamer | 1eade7430b77ddf35098d4e500e2f75aaabbf891 | [
"MIT"
] | null | null | null | sandbox/polymorphtest.cpp | PitEG/poppingamer | 1eade7430b77ddf35098d4e500e2f75aaabbf891 | [
"MIT"
] | null | null | null | #include <string>
#include <iostream>
#include <vector>
using std::cout;
using std::endl;
class A {
public:
int a_thing;
int a_wow;
virtual void talk() {
cout << "I'm A\n";
}
};
class B : public A {
private:
int b_thing;
public:
virtual void talk() override {
cout << "I'm B\n";
}
};
int mai... | 15.785714 | 57 | 0.562594 | [
"vector"
] |
95bb318a954d59bdb329a7c378097a014c925653 | 13,511 | cpp | C++ | sourceCode/drawingObjects/drawingObject.cpp | mdecourse/CoppeliaSimLib | 934e65b4b6ea5a07d08919ae35c50fd3ae960ef2 | [
"RSA-MD"
] | null | null | null | sourceCode/drawingObjects/drawingObject.cpp | mdecourse/CoppeliaSimLib | 934e65b4b6ea5a07d08919ae35c50fd3ae960ef2 | [
"RSA-MD"
] | null | null | null | sourceCode/drawingObjects/drawingObject.cpp | mdecourse/CoppeliaSimLib | 934e65b4b6ea5a07d08919ae35c50fd3ae960ef2 | [
"RSA-MD"
] | null | null | null | #include "simInternal.h"
#include "drawingObject.h"
#include "app.h"
#include "tt.h"
#include "easyLock.h"
#include "drawingObjectRendering.h"
float CDrawingObject::getSize() const
{
return(_size);
}
int CDrawingObject::getMaxItemCount() const
{
return(_maxItemCount);
}
int CDrawingObject::getStartItem() con... | 29.43573 | 197 | 0.643476 | [
"vector"
] |
95bc4235d03b4d13a3696da666db9c8a3143f0ba | 7,386 | hpp | C++ | src/level/chunk.hpp | rohankumardubey/minecraft-again | 87846758854750a4609e39d58c04ec4f63f3a445 | [
"MIT"
] | 514 | 2022-01-15T15:57:08.000Z | 2022-03-30T10:06:06.000Z | src/level/chunk.hpp | cdetn/minecraft-again | eb8de5951d3a019dea3749de128318b3c21c6871 | [
"MIT"
] | 6 | 2022-01-16T03:00:41.000Z | 2022-03-31T14:28:02.000Z | src/level/chunk.hpp | cdetn/minecraft-again | eb8de5951d3a019dea3749de128318b3c21c6871 | [
"MIT"
] | 71 | 2022-01-15T16:31:18.000Z | 2022-03-28T15:18:59.000Z | #ifndef LEVEL_CHUNK_HPP
#define LEVEL_CHUNK_HPP
#include "util/util.hpp"
#include "gfx/gfx.hpp"
// TODO: figure out where to declare/define things for tiles
#include "tile/tile.hpp"
namespace level {
// forward declaration from area.hpp
struct Area;
struct Chunk final : util::Tickable {
static constexpr const ... | 29.426295 | 80 | 0.556458 | [
"mesh",
"render"
] |
95c91707e662e3220bb199dfb627be9bfc694fbd | 34,056 | cc | C++ | TrickFMI2/FMI2ModelBase.cc | nasa/TrickFMI | e3548fbd6611a0b3abdd6146e5d95cbd617d6cef | [
"NASA-1.3"
] | 17 | 2017-01-13T06:41:13.000Z | 2021-09-26T14:01:31.000Z | TrickFMI2/FMI2ModelBase.cc | nasa/TrickFMI | e3548fbd6611a0b3abdd6146e5d95cbd617d6cef | [
"NASA-1.3"
] | 1 | 2018-09-18T17:45:27.000Z | 2021-07-17T08:34:15.000Z | TrickFMI2/FMI2ModelBase.cc | nasa/TrickFMI | e3548fbd6611a0b3abdd6146e5d95cbd617d6cef | [
"NASA-1.3"
] | 16 | 2017-01-09T02:29:26.000Z | 2019-11-12T20:13:35.000Z | /**
@file FMI2ModelBase.cc
@ingroup FMITrickInterface
@brief Method implementations for the FMI2ModelBase class
@copyright Copyright 2017 United States Government as represented by the
Administrator of the National Aeronautics and Space Administration.
No copyright is claimed in the United States under Title 17, U.S. ... | 30.598383 | 134 | 0.652073 | [
"object",
"vector",
"model"
] |
95c9acec789dbe7fad8509bf197f0e36d20b2cee | 7,712 | cpp | C++ | local/etc/format-links.cpp | quotecenter/documentation-1 | f365703264761aa2b19d5d1d8ec55a3a6082ef4d | [
"BSD-3-Clause"
] | null | null | null | local/etc/format-links.cpp | quotecenter/documentation-1 | f365703264761aa2b19d5d1d8ec55a3a6082ef4d | [
"BSD-3-Clause"
] | null | null | null | local/etc/format-links.cpp | quotecenter/documentation-1 | f365703264761aa2b19d5d1d8ec55a3a6082ef4d | [
"BSD-3-Clause"
] | null | null | null | // TODO fix code block parsing (any number of backticks > 3, 4-space indent, etc)
#include <algorithm>
#include <fstream>
#include <iostream>
#include <sstream>
#include <unordered_map>
#include <vector>
#define TRY_OR_ERR(cmd) do { \
err = cmd; \
if (err) { \
return err; ... | 22.353623 | 99 | 0.476141 | [
"vector"
] |
95cadfa1d2059846d5b64dd3a2000078fa4285f3 | 15,214 | cpp | C++ | src/libraries/KIRK/Utils/DS_Visualizer.cpp | lucashilbig/BA_Pathtracing_Fur | bed01d44ef93ff674436e002c82cb8c4663e2832 | [
"MIT"
] | null | null | null | src/libraries/KIRK/Utils/DS_Visualizer.cpp | lucashilbig/BA_Pathtracing_Fur | bed01d44ef93ff674436e002c82cb8c4663e2832 | [
"MIT"
] | null | null | null | src/libraries/KIRK/Utils/DS_Visualizer.cpp | lucashilbig/BA_Pathtracing_Fur | bed01d44ef93ff674436e002c82cb8c4663e2832 | [
"MIT"
] | null | null | null | #include "DS_Visualizer.h"
#include "../CPU/CPU_Datastructures/CPU_BVH.h"
#include "../CPU/CPU_Datastructures/CPU_KD.h"
#include "../CPU/CPU_Datastructures/Octree.h"
#include "../CPU/CPU_Datastructures/UniformGrid.h"
namespace KIRK {
const char *Visualizer::cDrawShaders[2] = {SHADERS_PATH "/OCL_ParticleSystem/ocl_ps.... | 40.248677 | 188 | 0.661759 | [
"render"
] |
95db674e4a1b0457f8b007bedec105244c49365b | 946,587 | cpp | C++ | z80-parser/generated/Z80Parser.cpp | mcchatman8009/z80-core | 127f575aa4a441b7d35b4424c8eea9dab1b665c9 | [
"MIT"
] | null | null | null | z80-parser/generated/Z80Parser.cpp | mcchatman8009/z80-core | 127f575aa4a441b7d35b4424c8eea9dab1b665c9 | [
"MIT"
] | null | null | null | z80-parser/generated/Z80Parser.cpp | mcchatman8009/z80-core | 127f575aa4a441b7d35b4424c8eea9dab1b665c9 | [
"MIT"
] | null | null | null |
// Generated from Z80.g4 by ANTLR 4.8
#include "Z80Listener.h"
#include "Z80Parser.h"
using namespace antlrcpp;
using namespace antlr4;
Z80Parser::Z80Parser(TokenStream *input) : Parser(input) {
_interpreter = new atn::ParserATNSimulator(this, _atn, _decisionToDFA, _sharedContextCache);
}
Z80Parser::~Z80Parse... | 35.16819 | 198 | 0.699466 | [
"vector"
] |
95f860ca184b3ffede3cdd82dbda4af3330bb44b | 1,086 | cc | C++ | 1 - Two Sum.cc | Becavalier/leetcode-anwsers | a6071e9a1a5320cc99f6b9b6e9da59516240b391 | [
"MIT"
] | null | null | null | 1 - Two Sum.cc | Becavalier/leetcode-anwsers | a6071e9a1a5320cc99f6b9b6e9da59516240b391 | [
"MIT"
] | null | null | null | 1 - Two Sum.cc | Becavalier/leetcode-anwsers | a6071e9a1a5320cc99f6b9b6e9da59516240b391 | [
"MIT"
] | null | null | null | #include <vector>
#include <unordered_map>
using namespace std;
class Solution {
public:
vector<int> twoSum(vector<int> &nums, int target) {
/**
*
* Dict:
* -----------------
* | 0 | 1 | 2 | 3 | value(indices);
* -----------------
* | | | |
* -----------------
*... | 25.255814 | 100 | 0.480663 | [
"vector"
] |
95fa411bf81ebea148c8a528c9247ad121e65384 | 3,192 | cpp | C++ | stats-test.cpp | clean-code-craft-tcq-2/sense-cpp-SandeshSubramanya | fcbba2a4196e114449817559ed709e092731eaa0 | [
"MIT"
] | null | null | null | stats-test.cpp | clean-code-craft-tcq-2/sense-cpp-SandeshSubramanya | fcbba2a4196e114449817559ed709e092731eaa0 | [
"MIT"
] | null | null | null | stats-test.cpp | clean-code-craft-tcq-2/sense-cpp-SandeshSubramanya | fcbba2a4196e114449817559ed709e092731eaa0 | [
"MIT"
] | null | null | null | #define CATCH_CONFIG_MAIN // This tells Catch to provide a main() - only do this in one cpp file
#include "catch.hpp"
#include "stats.h"
#include <cmath>
#include <algorithm>
#include <vector>
TEST_CASE("reports average, minimum and maximum") {
auto computedStats = Statistics::ComputeStatistics({1.5, 8.9, 3.2, 4... | 28.247788 | 102 | 0.572368 | [
"vector"
] |
95fc8ed7ba3c1ab279aad3543923ca0cdd9342a3 | 45,955 | cpp | C++ | dwm.cpp | castillo055/castle-dwm | 7293c37e50858fbd6c5b031fffbfa8c5207251c5 | [
"MIT"
] | 1 | 2021-11-21T10:22:22.000Z | 2021-11-21T10:22:22.000Z | dwm.cpp | castillo055/castle-dwm | 7293c37e50858fbd6c5b031fffbfa8c5207251c5 | [
"MIT"
] | null | null | null | dwm.cpp | castillo055/castle-dwm | 7293c37e50858fbd6c5b031fffbfa8c5207251c5 | [
"MIT"
] | null | null | null | /* See LICENSE file for copyright and license details.
*
* dynamic window manager is designed like any other X client as well. It is
* driven through handling X events. In contrast to other X clients, a window
* manager selects for SubstructureRedirectMask on the root window, to receive
* events about window (dis-... | 32.27177 | 108 | 0.538614 | [
"geometry"
] |
250b944bcfbe21522b2a833e40870bfb3293bf62 | 7,789 | hpp | C++ | cule/atari/debug.hpp | cg31/cule | 6cd8e06059c3c3a193a4b2e0821dc1b9daeb726c | [
"BSD-3-Clause"
] | 208 | 2019-05-25T21:35:35.000Z | 2022-03-28T17:33:13.000Z | cule/atari/debug.hpp | cg31/cule | 6cd8e06059c3c3a193a4b2e0821dc1b9daeb726c | [
"BSD-3-Clause"
] | 30 | 2019-07-27T08:23:54.000Z | 2022-03-24T18:17:36.000Z | cule/atari/debug.hpp | cg31/cule | 6cd8e06059c3c3a193a4b2e0821dc1b9daeb726c | [
"BSD-3-Clause"
] | 27 | 2019-07-27T05:42:23.000Z | 2022-03-05T03:08:52.000Z | #pragma once
#include <cule/config.hpp>
#include <cule/macros.hpp>
#include <cule/atari/opcodes.hpp>
#include <cule/atari/internals.hpp>
#include <stdarg.h>
#ifdef __CUDACC__
#define WARN(TYPE, SUBTYPE, ...)
#define WARN_IF(E, TYPE, SUBTYPE, ...)
#define ERROR(TYPE, SUBTYPE, ...)
#define ERROR_IF(E, TYPE, SUBTYPE,... | 32.053498 | 180 | 0.628707 | [
"3d"
] |
250c4b0634e61f3334946f30a360ef7465f5f77e | 15,476 | cpp | C++ | Source/CorrespondenceEvaluator.cpp | Team-AllyHyeseongKim/http-image-server4bundle-fusion-scanner | 2a6c196aeb9bacd2c88a0bb6a8bbadd04afca260 | [
"RSA-MD"
] | null | null | null | Source/CorrespondenceEvaluator.cpp | Team-AllyHyeseongKim/http-image-server4bundle-fusion-scanner | 2a6c196aeb9bacd2c88a0bb6a8bbadd04afca260 | [
"RSA-MD"
] | null | null | null | Source/CorrespondenceEvaluator.cpp | Team-AllyHyeseongKim/http-image-server4bundle-fusion-scanner | 2a6c196aeb9bacd2c88a0bb6a8bbadd04afca260 | [
"RSA-MD"
] | null | null | null | #include "stdafx.h"
#include "CorrespondenceEvaluator.h"
#ifdef EVALUATE_SPARSE_CORRESPONDENCES
#include "CUDACache.h"
#include "SiftVisualization.h" //for debugging
const std::string CorrespondenceEvaluator::splitter = ",";
void CorrespondenceEvaluator::computeCachedData(const SIFTImageManager* siftManager, const C... | 48.3625 | 266 | 0.688615 | [
"vector"
] |
250efac0b3617d5ea9451637d36a315fea9e62dc | 2,132 | cpp | C++ | C&CPP/00-Code/cpp-program-basic/003-container/vectors.cpp | hiloWang/notes | 64a637a86f734e4e80975f4aa93ab47e8d7e8b64 | [
"Apache-2.0"
] | 2 | 2020-10-08T13:22:08.000Z | 2021-07-28T14:45:41.000Z | C&C++/cplusplus-program/003-container/vectors.cpp | flyfire/Programming-Notes-Code | 4b1bdd74c1ba0c007c504834e4508ec39f01cd94 | [
"Apache-2.0"
] | null | null | null | C&C++/cplusplus-program/003-container/vectors.cpp | flyfire/Programming-Notes-Code | 4b1bdd74c1ba0c007c504834e4508ec39f01cd94 | [
"Apache-2.0"
] | 6 | 2020-08-20T07:19:17.000Z | 2022-03-02T08:16:21.000Z | /*
============================================================================
Author : Ztiany
Description : 对象容器vector
============================================================================
*/
#include <vector>
#include <iostream>
using namespace std;
int sAge = 0;
class A {
private:
int ag... | 22.442105 | 94 | 0.542214 | [
"vector"
] |
251beb96a64b9b6d433ab71b9458a0d5cb2e054c | 9,325 | cpp | C++ | others/lccp.cpp | Siyu-ZOUZOU/Project | 9e6b97df35148ad28a547d34debaef13f2c2ebbb | [
"MIT"
] | 1 | 2018-07-18T02:02:47.000Z | 2018-07-18T02:02:47.000Z | others/lccp.cpp | Siyu-ZOUZOU/Project_siyu | 9e6b97df35148ad28a547d34debaef13f2c2ebbb | [
"MIT"
] | null | null | null | others/lccp.cpp | Siyu-ZOUZOU/Project_siyu | 9e6b97df35148ad28a547d34debaef13f2c2ebbb | [
"MIT"
] | null | null | null | // Stdlib
#include <stdlib.h>
#include <cmath>
#include <limits.h>
#include <iterator>
#include <vector>
#include <boost/format.hpp>
#include <stdint.h>
// PCL input/output
#include <pcl/console/parse.h>
#include <pcl/io/pcd_io.h>
#include <pcl/visualization/pcl_visualizer.h>
#include <pcl/visualization/point_cloud_co... | 34.157509 | 158 | 0.692011 | [
"vector"
] |
251f5f535262d9a08382964167833685c05d694d | 369 | cpp | C++ | cpp20_initializers.cpp | dominc8/c_cpp_examples | 3a5579aa848975276772f12ca495ea7ca97c72ce | [
"MIT"
] | null | null | null | cpp20_initializers.cpp | dominc8/c_cpp_examples | 3a5579aa848975276772f12ca495ea7ca97c72ce | [
"MIT"
] | null | null | null | cpp20_initializers.cpp | dominc8/c_cpp_examples | 3a5579aa848975276772f12ca495ea7ca97c72ce | [
"MIT"
] | null | null | null | #include <vector>
#include <iostream>
struct A {
int x;
int y;
int z = 123;
};
int main(void)
{
/* C-style initializers */
A a {.x{1}, .z = 2}; // a.x == 1, a.y == 0, a.z == 2
/* range-based for loop initializers */
for (std::vector v{1, 2, 3}; auto& e : v)
{
std::cout << e << ", "... | 14.192308 | 56 | 0.455285 | [
"vector"
] |
254419e13debc21056ad15fec2a3bc13f16b3777 | 3,045 | cpp | C++ | round-trip-through-throw/main.cpp | johnmcfarlane/ehct | 1d08c46d35d970a1cdcd41217b8f7d922b1b39cc | [
"MIT"
] | 3 | 2019-02-14T20:34:40.000Z | 2019-08-25T23:32:24.000Z | round-trip-through-throw/main.cpp | johnmcfarlane/ehct | 1d08c46d35d970a1cdcd41217b8f7d922b1b39cc | [
"MIT"
] | null | null | null | round-trip-through-throw/main.cpp | johnmcfarlane/ehct | 1d08c46d35d970a1cdcd41217b8f7d922b1b39cc | [
"MIT"
] | 1 | 2018-04-11T22:02:19.000Z | 2018-04-11T22:02:19.000Z |
#include <cassert>
#include <type_traits>
#include <vector>
#ifndef ROUND_TRIP_ERRORS_THROUGH_EH
#warning "you should pass -DROUND_TRIP_ERRORS_THROUGH_EH=0 if you want that"
#endif
struct throw_colored_t{};
template<class T>
struct Result {
T value;
int error;
};
#define MAGIC_THROWING(...) \
[&]() { ... | 26.946903 | 103 | 0.621675 | [
"vector",
"transform"
] |
8583809125812ece7432009f1e7e172e6fb2f666 | 1,559 | cxx | C++ | tests/parser_tests.cxx | lukaszgemborowski/args | cd9ee23c233554d4d8722f958e7339772dc00b18 | [
"MIT"
] | null | null | null | tests/parser_tests.cxx | lukaszgemborowski/args | cd9ee23c233554d4d8722f958e7339772dc00b18 | [
"MIT"
] | null | null | null | tests/parser_tests.cxx | lukaszgemborowski/args | cd9ee23c233554d4d8722f958e7339772dc00b18 | [
"MIT"
] | null | null | null | #include "catch.hpp"
#include <args/args.hpp>
struct CreateArgs
{
CreateArgs(std::initializer_list<std::string> a)
{
args_.push_back({});
for (auto v : a) {
std::vector<char> current{
v.begin(), v.end()};
current.push_back(0);
args_.push_back... | 21.067568 | 71 | 0.543297 | [
"vector"
] |
858430266aa458eceb8a19d61c49b18f6a66d9ad | 774 | cpp | C++ | src/Utilities/Mesh.cpp | BrianErikson/GameEngine | afe798607dda0a6a367867382d628fe02192643c | [
"MIT"
] | null | null | null | src/Utilities/Mesh.cpp | BrianErikson/GameEngine | afe798607dda0a6a367867382d628fe02192643c | [
"MIT"
] | 2 | 2017-04-05T01:23:55.000Z | 2017-04-05T02:29:45.000Z | src/Utilities/Mesh.cpp | BrianErikson/GameEngine | afe798607dda0a6a367867382d628fe02192643c | [
"MIT"
] | null | null | null |
#include "Mesh.h"
Mesh::Mesh(MeshType type) {
this->type = type;
this->mesh = std::vector<Vector3>();
this->polyMesh = std::vector<Polygon>();
}
void Mesh::add(Vector3 vert) {
if (this->type != MeshType::POLYGON) {
this->mesh.push_back(vert);
}
}
void Mesh::add(Polygon polygon) {
if (this->type == MeshType:... | 22.114286 | 59 | 0.624031 | [
"mesh",
"render",
"vector"
] |
8585edf4dd93c03d3badbd0ac1c015b3acd0ab28 | 2,893 | hpp | C++ | include/merely3d/renderable.hpp | digitalillusions/merely3d | c14326d4bef325b64da25fb8bf79c32665299549 | [
"MIT"
] | 5 | 2019-01-07T12:31:10.000Z | 2020-12-31T04:47:16.000Z | include/merely3d/renderable.hpp | digitalillusions/merely3d | c14326d4bef325b64da25fb8bf79c32665299549 | [
"MIT"
] | 8 | 2018-10-18T13:54:29.000Z | 2019-02-06T13:48:24.000Z | include/merely3d/renderable.hpp | digitalillusions/merely3d | c14326d4bef325b64da25fb8bf79c32665299549 | [
"MIT"
] | 2 | 2019-02-03T19:10:31.000Z | 2019-02-05T14:10:15.000Z | #pragma once
#include <Eigen/Dense>
#include <merely3d/material.hpp>
#include <merely3d/types.hpp>
namespace merely3d
{
template <typename Shape>
struct Renderable
{
Shape shape;
Eigen::Vector3f position;
UnalignedQuaternionf orientation;
Eigen... | 29.222222 | 81 | 0.538541 | [
"shape"
] |
858c49499a6b14a3482ff2d813ea81a6cca662d1 | 7,146 | cpp | C++ | EngineDX/EngineDX/DrawGui.cpp | khanIdris/DirectX-3D-Mesh-Editor | 0106297e132f4cfa29b6c48c3bc5c1defcd1de39 | [
"MIT"
] | 8 | 2021-09-21T15:26:09.000Z | 2021-12-15T06:29:22.000Z | EngineDX/EngineDX/DrawGui.cpp | IvanParera/DirectX-3D-Mesh-Editor | 0106297e132f4cfa29b6c48c3bc5c1defcd1de39 | [
"MIT"
] | null | null | null | EngineDX/EngineDX/DrawGui.cpp | IvanParera/DirectX-3D-Mesh-Editor | 0106297e132f4cfa29b6c48c3bc5c1defcd1de39 | [
"MIT"
] | 6 | 2021-09-21T15:26:25.000Z | 2021-12-14T18:36:06.000Z | #pragma once
#include "pch.h"
#include "drawgui.h"
#include "SolidShader.h"
#include "CGUI.h"
#include "ModelLoader.h"
// external objects decleared in main.h
extern ModelLoader SLoader;
extern CGUI SGUI;
extern std::vector<CMesh> vMeshString;
extern std::vector<short> vSelectedMeshID;
extern sh... | 25.891304 | 129 | 0.624965 | [
"vector",
"transform"
] |
85905af2667651810a5ffd731368bce697406941 | 10,892 | cpp | C++ | src/prod/src/Common/IpUtility.cpp | gridgentoo/ServiceFabricAzure | c3e7a07617e852322d73e6cc9819d266146866a4 | [
"MIT"
] | 2,542 | 2018-03-14T21:56:12.000Z | 2019-05-06T01:18:20.000Z | src/prod/src/Common/IpUtility.cpp | gridgentoo/ServiceFabricAzure | c3e7a07617e852322d73e6cc9819d266146866a4 | [
"MIT"
] | 994 | 2019-05-07T02:39:30.000Z | 2022-03-31T13:23:04.000Z | src/prod/src/Common/IpUtility.cpp | gridgentoo/ServiceFabricAzure | c3e7a07617e852322d73e6cc9819d266146866a4 | [
"MIT"
] | 300 | 2018-03-14T21:57:17.000Z | 2019-05-06T20:07:00.000Z | // ------------------------------------------------------------
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License (MIT). See License.txt in the repo root for license information.
// ------------------------------------------------------------
#include "stdafx.h"
#if define... | 29.759563 | 140 | 0.615406 | [
"vector"
] |
8593a8eb50b2d9b18dc71678e7968475db39b86b | 11,719 | cc | C++ | tensorflow/c/c_api_experimental.cc | jiongjiongli/mytensorflow | 641f19d880b2f32ac5a11243e0bfbb8e869856d7 | [
"Apache-2.0"
] | 1 | 2018-03-27T17:25:38.000Z | 2018-03-27T17:25:38.000Z | tensorflow/c/c_api_experimental.cc | DandelionCN/tensorflow | 1712002ad02f044f7569224bf465e0ea00e6a6c4 | [
"Apache-2.0"
] | null | null | null | tensorflow/c/c_api_experimental.cc | DandelionCN/tensorflow | 1712002ad02f044f7569224bf465e0ea00e6a6c4 | [
"Apache-2.0"
] | null | null | null | /* Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... | 35.620061 | 81 | 0.630515 | [
"shape",
"vector"
] |
8599ab9e2264db23b27706c1d27a834e2c53d70d | 1,642 | cpp | C++ | string/maximum-product-of-the-length-of-two-palindromic-substrings.cpp | Nilesh-Das/mustdogfg | bb39fe6eb9dd4964f97a7ab6d4e65e4c3994fc3f | [
"MIT"
] | null | null | null | string/maximum-product-of-the-length-of-two-palindromic-substrings.cpp | Nilesh-Das/mustdogfg | bb39fe6eb9dd4964f97a7ab6d4e65e4c3994fc3f | [
"MIT"
] | null | null | null | string/maximum-product-of-the-length-of-two-palindromic-substrings.cpp | Nilesh-Das/mustdogfg | bb39fe6eb9dd4964f97a7ab6d4e65e4c3994fc3f | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define ll int64_t
using namespace std;
// https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings
ll maxProduct(string s) {
int n = s.size();
// no of odd length palindrome with center i
vector<... | 24.507463 | 92 | 0.412911 | [
"vector"
] |
859f9521d77e3edaa19698e20c1887c335aed89e | 2,790 | hpp | C++ | src/Trigonometric.hpp | x4kkk3r/IOMath | 1101090023b57bd2db34e5a3e07a620b9311ac0b | [
"MIT"
] | 3 | 2020-07-23T11:49:35.000Z | 2020-07-24T12:22:28.000Z | src/Trigonometric.hpp | x4kkk3r/IOMath | 1101090023b57bd2db34e5a3e07a620b9311ac0b | [
"MIT"
] | null | null | null | src/Trigonometric.hpp | x4kkk3r/IOMath | 1101090023b57bd2db34e5a3e07a620b9311ac0b | [
"MIT"
] | 1 | 2020-07-23T12:18:58.000Z | 2020-07-23T12:18:58.000Z | /*
MIT License
Copyright (c) 2020 x4kkk3r
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, ... | 30 | 87 | 0.751254 | [
"object"
] |
85a40dcf01219859fb3f76abf2bc622dac1b5f57 | 638 | cpp | C++ | Src/Windows/CommandLine.cpp | cdoty/SuperPlayExtended | 0a9717c44b8e3820afeaf0673f86b152daf88cd7 | [
"MIT"
] | null | null | null | Src/Windows/CommandLine.cpp | cdoty/SuperPlayExtended | 0a9717c44b8e3820afeaf0673f86b152daf88cd7 | [
"MIT"
] | null | null | null | Src/Windows/CommandLine.cpp | cdoty/SuperPlayExtended | 0a9717c44b8e3820afeaf0673f86b152daf88cd7 | [
"MIT"
] | null | null | null | // This is an independent project of an individual developer. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++ and C#: http://www.viva64.com
#include <vector>
#include "CommandLine.h"
#include "CommandLineFlags.h"
#include "Functions.h"
void processCommandLine(const std::string& _strCo... | 24.538462 | 95 | 0.711599 | [
"vector"
] |
85b2eb7aa5ae1109ff822b2e98bdfffe8106ecef | 6,004 | cpp | C++ | oclint-driver/lib/Analytics.cpp | Minlison/oclint_xcode | 1ad5ff0496d0df19b7fdfe0d02e948d1f5bf30ed | [
"MIT"
] | null | null | null | oclint-driver/lib/Analytics.cpp | Minlison/oclint_xcode | 1ad5ff0496d0df19b7fdfe0d02e948d1f5bf30ed | [
"MIT"
] | null | null | null | oclint-driver/lib/Analytics.cpp | Minlison/oclint_xcode | 1ad5ff0496d0df19b7fdfe0d02e948d1f5bf30ed | [
"MIT"
] | null | null | null | #include "oclint/Analytics.h"
#ifndef COUNTLY_ANALYTICS
void oclint::Analytics::send(int) {}
void oclint::Analytics::ruleConfiguration(std::string key, std::string value) {}
void oclint::Analytics::languageOption(clang::LangOptions langOptions) {}
#else
#include <map>
#include <sstream>
#include <countly/Countly.h... | 28.865385 | 99 | 0.685876 | [
"vector"
] |
85b5a58d70422f01972ebfaafac4420410d48be6 | 6,985 | cpp | C++ | tests/dct.cpp | wfus/Fully-Homomorphic-Image-Processing | c4b3231cf299570340d9cdd8d19f7776edea5dbc | [
"MIT"
] | 34 | 2018-05-02T05:13:30.000Z | 2021-12-10T01:00:45.000Z | tests/dct.cpp | wfus/Fully-Homomorphic-Image-Processing | c4b3231cf299570340d9cdd8d19f7776edea5dbc | [
"MIT"
] | 3 | 2019-03-29T05:33:09.000Z | 2021-09-19T09:20:28.000Z | tests/dct.cpp | wfus/Fully-Homomorphic-Image-Processing | c4b3231cf299570340d9cdd8d19f7776edea5dbc | [
"MIT"
] | 7 | 2018-08-12T03:11:21.000Z | 2022-01-04T06:46:27.000Z | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <chrono>
#include <random>
#include <thread>
#include <mutex>
#include <random>
#include <limits>
#include <fstream>
#include "seal/seal.h"
using namespace seal;
auto start = std::chrono::steady_clock::now();
const std::vector<int>... | 32.640187 | 251 | 0.528418 | [
"vector"
] |
85baca415c71871b2249a639ca29168fa0d0dd04 | 8,317 | cpp | C++ | src/Domain.cpp | asr-ros/asr_intermediate_object_generator | cdd9a50a853c8e74d1c94971443772c7e54105d6 | [
"BSD-3-Clause"
] | 1 | 2019-10-29T13:37:28.000Z | 2019-10-29T13:37:28.000Z | src/Domain.cpp | asr-ros/asr_intermediate_object_generator | cdd9a50a853c8e74d1c94971443772c7e54105d6 | [
"BSD-3-Clause"
] | null | null | null | src/Domain.cpp | asr-ros/asr_intermediate_object_generator | cdd9a50a853c8e74d1c94971443772c7e54105d6 | [
"BSD-3-Clause"
] | null | null | null | /**
Copyright (c) 2016, Borella Jocelyn, Meißner Pascal
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of conditions... | 50.713415 | 755 | 0.735602 | [
"object",
"vector"
] |
85c351db36c3c5d34247006447a417d0b409f199 | 3,753 | cpp | C++ | SpriteSelector.cpp | interdpth/DoubleHelix-2 | d494cc7957b7470b12779d2cde14b13285fa6396 | [
"MIT"
] | 1 | 2021-11-23T13:57:03.000Z | 2021-11-23T13:57:03.000Z | SpriteSelector.cpp | interdpth/DoubleHelix-2 | d494cc7957b7470b12779d2cde14b13285fa6396 | [
"MIT"
] | null | null | null | SpriteSelector.cpp | interdpth/DoubleHelix-2 | d494cc7957b7470b12779d2cde14b13285fa6396 | [
"MIT"
] | 1 | 2021-11-12T22:47:58.000Z | 2021-11-12T22:47:58.000Z | #include "MainHeader.h"
#include "cOAMManager.h"
#include "GlobalVars.h"
#include "resource.h"
#include "SpriteObjectManager.h"
#include "FrameManager.h"
#include "Frames.h"
BOOL CALLBACK SSProc(HWND hWnd, unsigned int message, WPARAM wParam, LPARAM lParam) {
Frame* targetFrame = NULL;
PAINTSTRUCT ps;
HDC hdc;
... | 25.358108 | 163 | 0.706635 | [
"vector"
] |
85cdff7cd54778e5c56621ea7bfcb99733b8b8c8 | 4,483 | hxx | C++ | src/SplineConstant.hxx | ebertolazzi/Splines | 341abc55d5a672976a3e0b6f3eabcc60e221a36e | [
"BSD-2-Clause"
] | 113 | 2015-01-03T09:38:47.000Z | 2022-03-28T04:58:02.000Z | src/SplineConstant.hxx | ebertolazzi/Splines | 341abc55d5a672976a3e0b6f3eabcc60e221a36e | [
"BSD-2-Clause"
] | 3 | 2017-04-10T15:54:51.000Z | 2019-01-09T13:18:20.000Z | src/SplineConstant.hxx | ebertolazzi/Splines | 341abc55d5a672976a3e0b6f3eabcc60e221a36e | [
"BSD-2-Clause"
] | 20 | 2015-03-17T02:38:11.000Z | 2021-12-11T18:26:32.000Z | /*--------------------------------------------------------------------------*\
| |
| Copyright (C) 2016 |
| |
| ... | 32.722628 | 79 | 0.395494 | [
"vector"
] |
85d4a8c02d959d2b72434d8011eb7eb1dc16967b | 223 | cpp | C++ | bricks_falling_when_hit.cpp | spencercjh/sync-leetcode-today-problem-cpp-example | 178a974e5848e3a620f4565170b459d50ecfdd6b | [
"Apache-2.0"
] | null | null | null | bricks_falling_when_hit.cpp | spencercjh/sync-leetcode-today-problem-cpp-example | 178a974e5848e3a620f4565170b459d50ecfdd6b | [
"Apache-2.0"
] | 1 | 2020-12-17T07:54:03.000Z | 2020-12-17T08:00:22.000Z | bricks_falling_when_hit.cpp | spencercjh/sync-leetcode-today-problem-cpp-example | 178a974e5848e3a620f4565170b459d50ecfdd6b | [
"Apache-2.0"
] | null | null | null | /**
* https://leetcode-cn.com/problems/bricks-falling-when-hit/
*
* @author spencercjh
*/
class BricksFallingWhenHit {
public:
vector<int> hitBricks(vector<vector<int>>& grid, vector<vector<int>>& hits) {
}
}
| 17.153846 | 81 | 0.668161 | [
"vector"
] |
85d65338ea0b785b33b5e8a49a3ecb736a50dfe8 | 3,550 | hpp | C++ | Library/Source/EnergyManager/Utility/Logging/Loggable.hpp | NB4444/BachelorProjectEnergyManager | d1fd93dcc83af6d6acd36b7efda364ac2aab90eb | [
"MIT"
] | null | null | null | Library/Source/EnergyManager/Utility/Logging/Loggable.hpp | NB4444/BachelorProjectEnergyManager | d1fd93dcc83af6d6acd36b7efda364ac2aab90eb | [
"MIT"
] | null | null | null | Library/Source/EnergyManager/Utility/Logging/Loggable.hpp | NB4444/BachelorProjectEnergyManager | d1fd93dcc83af6d6acd36b7efda364ac2aab90eb | [
"MIT"
] | null | null | null | #pragma once
#include <string>
#include <vector>
namespace EnergyManager {
namespace Utility {
namespace Logging {
enum class Level;
/**
* Represents an object that can log information.
*/
class Loggable {
protected:
/**
* Generates the headers for logging.
* @return The headers.... | 28.629032 | 132 | 0.601127 | [
"object",
"vector"
] |
85d7925d0e571b4d29c5e72108da535224c30585 | 2,843 | cc | C++ | Filters/src/StepPointMCCollectionUpdater_module.cc | sophiemiddleton/Offline | d0c570158c88b7311e758666ab47fafc828f39b0 | [
"Apache-2.0"
] | null | null | null | Filters/src/StepPointMCCollectionUpdater_module.cc | sophiemiddleton/Offline | d0c570158c88b7311e758666ab47fafc828f39b0 | [
"Apache-2.0"
] | 1 | 2019-11-22T14:45:51.000Z | 2019-11-22T14:50:03.000Z | Filters/src/StepPointMCCollectionUpdater_module.cc | sophiemiddleton/Offline | d0c570158c88b7311e758666ab47fafc828f39b0 | [
"Apache-2.0"
] | 2 | 2019-10-14T17:46:58.000Z | 2020-03-30T21:05:15.000Z | // Update StepPointMCs to point to a new SimParticle collection
//
// Andrei Gaponenko, 2016
#include <string>
#include <vector>
#include <memory>
#include <iostream>
#include "cetlib_except/exception.h"
#include "art/Framework/Core/EDProducer.h"
#include "art/Framework/Core/ModuleMacros.h"
#include "art/Framework/P... | 35.098765 | 93 | 0.672881 | [
"vector"
] |
85da7bad7db0ed385aa980e78419865b5d0a386c | 2,978 | hpp | C++ | FFG/include/FFG_State.hpp | GarrettGutierrez1/FFG_Engine | ba61887f6db2bdc947118b50beb3388d49eeaad4 | [
"Apache-2.0"
] | null | null | null | FFG/include/FFG_State.hpp | GarrettGutierrez1/FFG_Engine | ba61887f6db2bdc947118b50beb3388d49eeaad4 | [
"Apache-2.0"
] | null | null | null | FFG/include/FFG_State.hpp | GarrettGutierrez1/FFG_Engine | ba61887f6db2bdc947118b50beb3388d49eeaad4 | [
"Apache-2.0"
] | null | null | null | #ifndef FFG_STATE_H_INCLUDED
#define FFG_STATE_H_INCLUDED
#include "FFG_Engine.hpp"
/***************************************************************************//**
* State implementation. Any user-created states should inherit from this. To
* execute them, instantiate them and register them through the FFG_StateMa... | 45.815385 | 81 | 0.322364 | [
"render"
] |
85dfcdaa86485a51f830c36684e1da46aa5425b3 | 5,281 | cpp | C++ | llvm/llvm/lib/Target/FPGA/FPGATargetMachine.cpp | pooyaww/HLS | da538325ea9cb410672be6bb15d6c2e6220bfeb3 | [
"Apache-2.0"
] | 1 | 2021-04-29T08:23:03.000Z | 2021-04-29T08:23:03.000Z | llvm/llvm/lib/Target/FPGA/FPGATargetMachine.cpp | pooyaww/HLS | da538325ea9cb410672be6bb15d6c2e6220bfeb3 | [
"Apache-2.0"
] | null | null | null | llvm/llvm/lib/Target/FPGA/FPGATargetMachine.cpp | pooyaww/HLS | da538325ea9cb410672be6bb15d6c2e6220bfeb3 | [
"Apache-2.0"
] | 1 | 2021-08-02T01:23:35.000Z | 2021-08-02T01:23:35.000Z | // (c) Copyright 2016-2020 Xilinx, Inc.
// All Rights Reserved.
//
// 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 yo... | 36.171233 | 103 | 0.616171 | [
"model"
] |
85e62106f52fd1c79207f345c0784c6dce796f00 | 247,626 | cpp | C++ | HololensBuild/Il2CppOutputProject/Source/il2cppOutput/Il2CppCCWs86.cpp | Reality-Hack-2022/TEAM-08 | 25e346560f9b7ea13ac67753ba908f30f4b4af46 | [
"MIT"
] | null | null | null | HololensBuild/Il2CppOutputProject/Source/il2cppOutput/Il2CppCCWs86.cpp | Reality-Hack-2022/TEAM-08 | 25e346560f9b7ea13ac67753ba908f30f4b4af46 | [
"MIT"
] | null | null | null | HololensBuild/Il2CppOutputProject/Source/il2cppOutput/Il2CppCCWs86.cpp | Reality-Hack-2022/TEAM-08 | 25e346560f9b7ea13ac67753ba908f30f4b4af46 | [
"MIT"
] | 2 | 2022-03-24T19:58:31.000Z | 2022-03-24T22:55:43.000Z | #include "pch-cpp.hpp"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
#include <limits>
#include "vm/CachedCCWBase.h"
#include "utils/New.h"
// System.Collections.Generic.List`1<System.Collections.Generic.KeyValuePair`2<System.Int32,UnityEngine.Vector3>>
struct List_1... | 55.224353 | 1,100 | 0.861158 | [
"object"
] |
85e7ab57c6d0cb38962cdeffbd0b127f557977ca | 2,133 | cpp | C++ | examples/cppx/Interface.cpp | OfekShilon/compiler-explorer | 7ee2ab17f29470575443bd67e5685ac54ce76158 | [
"BSD-2-Clause"
] | 4,668 | 2017-01-02T19:35:10.000Z | 2020-05-16T03:18:45.000Z | examples/cppx/Interface.cpp | OfekShilon/compiler-explorer | 7ee2ab17f29470575443bd67e5685ac54ce76158 | [
"BSD-2-Clause"
] | 1,750 | 2017-01-02T19:37:06.000Z | 2020-05-16T14:54:29.000Z | examples/cppx/Interface.cpp | OfekShilon/compiler-explorer | 7ee2ab17f29470575443bd67e5685ac54ce76158 | [
"BSD-2-Clause"
] | 620 | 2017-01-03T00:29:17.000Z | 2020-05-14T09:27:47.000Z | #include <experimental/meta>
#include <experimental/compiler>
using namespace std::experimental;
//====================================================================
// Library code: implementing the metaclass (once)
consteval void interface(meta::info source) {
for (meta::info mem : meta::member_range(source)) ... | 30.042254 | 90 | 0.595406 | [
"shape"
] |
85eb7918ea4241ca2c094fe25253265edfb267a8 | 344 | cpp | C++ | 27. LeetCode Problems/duplicateZeroes.cpp | Ujjawalgupta42/Hacktoberfest2021-DSA | eccd9352055085973e3d6a1feb10dd193905584b | [
"MIT"
] | 225 | 2021-10-01T03:09:01.000Z | 2022-03-11T11:32:49.000Z | 27. LeetCode Problems/duplicateZeroes.cpp | Ujjawalgupta42/Hacktoberfest2021-DSA | eccd9352055085973e3d6a1feb10dd193905584b | [
"MIT"
] | 252 | 2021-10-01T03:45:20.000Z | 2021-12-07T18:32:46.000Z | 27. LeetCode Problems/duplicateZeroes.cpp | Ujjawalgupta42/Hacktoberfest2021-DSA | eccd9352055085973e3d6a1feb10dd193905584b | [
"MIT"
] | 911 | 2021-10-01T02:55:19.000Z | 2022-02-06T09:08:37.000Z | Problem Link : https://leetcode.com/problems/duplicate-zeros/
class Solution {
public:
void duplicateZeros(vector<int>& arr) {
for(int i=0; i<arr.size(); i++){
if (arr[i] == 0){
arr.insert(arr.begin()+i, 0);
arr.pop_back();
i++;
... | 20.235294 | 61 | 0.444767 | [
"vector"
] |
85edf5e70585ff6c9cdd0edcede03eb0a0eb0444 | 11,735 | cpp | C++ | C++/hangman/CharList.cpp | stablestud/trainee | 6123095c3855c127dbc98857ca05aacaa12c2200 | [
"MIT"
] | null | null | null | C++/hangman/CharList.cpp | stablestud/trainee | 6123095c3855c127dbc98857ca05aacaa12c2200 | [
"MIT"
] | null | null | null | C++/hangman/CharList.cpp | stablestud/trainee | 6123095c3855c127dbc98857ca05aacaa12c2200 | [
"MIT"
] | null | null | null | #include <exception>
#include <stdexcept>
#include <iostream>
#include "CharList.h"
/*
* @author stablestud
* @date 13-06-2018
*/
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* N O D E -- F U N C T I O N D E F I N I T I O N S *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*... | 23.47 | 86 | 0.475075 | [
"object"
] |
c803d76a9cd829201b9893f5e2d79cc08cef40fb | 9,115 | cpp | C++ | Kuplung/kuplung/rendering/methods/RenderingSimple.cpp | supudo/Kuplung | f0e11934fde0675fa531e6dc263bedcc20a5ea1a | [
"Unlicense"
] | 14 | 2017-02-17T17:12:40.000Z | 2021-12-22T01:55:06.000Z | Kuplung/kuplung/rendering/methods/RenderingSimple.cpp | supudo/Kuplung | f0e11934fde0675fa531e6dc263bedcc20a5ea1a | [
"Unlicense"
] | null | null | null | Kuplung/kuplung/rendering/methods/RenderingSimple.cpp | supudo/Kuplung | f0e11934fde0675fa531e6dc263bedcc20a5ea1a | [
"Unlicense"
] | 1 | 2019-10-15T08:10:10.000Z | 2019-10-15T08:10:10.000Z | //
// RenderingSimple.cpp
// Kuplung
//
// Created by Sergey Petrov on 12/2/15.
// Copyright © 2015 supudo.net. All rights reserved.
//
#include "RenderingSimple.hpp"
#include <glm/gtc/matrix_inverse.hpp>
#include <glm/gtc/type_ptr.hpp>
RenderingSimple::RenderingSimple(ObjectsManager& managerObjects) : managerObj... | 55.920245 | 183 | 0.759298 | [
"geometry",
"render",
"vector"
] |
65a9bf9b6485c7c9bc26fade977035815893332f | 1,748 | cpp | C++ | graph/graph_scc_kosaraju.cpp | LuisMBaezCo/cpp-algorithm-snippets | 9736f97437cf52b3c8cdf6bfe00de919448d2e50 | [
"MIT"
] | 7 | 2020-12-11T00:24:42.000Z | 2022-03-14T05:59:35.000Z | graph/graph_scc_kosaraju.cpp | LuisMBaezCo/algorithms-template | 6290ee91eb2dd67e6e367887a815a7aac065fe3a | [
"MIT"
] | 15 | 2021-02-04T23:12:46.000Z | 2022-03-17T01:07:12.000Z | graph/graph_scc_kosaraju.cpp | LuisMBaezCo/cpp-algorithm-snippets | 9736f97437cf52b3c8cdf6bfe00de919448d2e50 | [
"MIT"
] | null | null | null | // graph_graph
// graph_digraph
template <typename T>
class SCC {
private:
digraph<T> g;
digraph<T> g_rev;
vector<bool> visited;
stack<int> toposort;
vector<vector<int>> components;
// Topological Sort
void toposort_dfs(int node) {
visited[node] = true;
for(link<T> neighbo... | 23.945205 | 78 | 0.48913 | [
"vector"
] |
65aa5bf1605d644b2bfa6dad7bfc7f9487943944 | 32,118 | cpp | C++ | src/gui/tab.cpp | ctlcltd/e2-sat-editor | 20a14cb8fb6a71afa3e62e2b2456a9b68c7cbce3 | [
"MIT"
] | null | null | null | src/gui/tab.cpp | ctlcltd/e2-sat-editor | 20a14cb8fb6a71afa3e62e2b2456a9b68c7cbce3 | [
"MIT"
] | null | null | null | src/gui/tab.cpp | ctlcltd/e2-sat-editor | 20a14cb8fb6a71afa3e62e2b2456a9b68c7cbce3 | [
"MIT"
] | null | null | null | /*!
* e2-sat-editor/src/gui/tab.cpp
*
* @link https://github.com/ctlcltd/e2-sat-editor
* @copyright e2 SAT Editor Team
* @author Leonardo Laureti
* @version 0.1
* @license MIT License
* @license GNU GPLv3 License
*/
#include <algorithm>
#include <cstdio>
#include <QtGlobal>
#include <QGuiApplication>
#includ... | 25.756215 | 180 | 0.689426 | [
"vector"
] |
65acfa4292368381ef284814a130ae790f234e53 | 8,359 | cpp | C++ | src/Engine/StaticSEEngine.cpp | 1c0e/Abacus | 167b826aeef966014f185e3b5d376f39111c9e9e | [
"Apache-2.0"
] | 11 | 2021-01-12T00:45:49.000Z | 2022-01-17T06:22:17.000Z | src/Engine/StaticSEEngine.cpp | 1c0e/Abacus | 167b826aeef966014f185e3b5d376f39111c9e9e | [
"Apache-2.0"
] | 3 | 2021-03-16T08:37:52.000Z | 2022-03-29T14:56:55.000Z | src/Engine/StaticSEEngine.cpp | s3team/Abacus | 31bb80f7ce2b5cf52590c2627cf37e99e7b6a17b | [
"MIT"
] | 3 | 2021-05-09T06:57:42.000Z | 2021-11-23T13:06:17.000Z | #include "StaticSEEngine.hpp"
#include "VarMap.hpp"
#include "error.hpp"
#include "ins_types.hpp"
#include <algorithm>
#include <cassert>
#include <limits.h>
#include <sstream>
#define ERROR(MESSAGE) tana::default_error_handler(__FILE__, __LINE__, MESSAGE)
namespace tana {
bool StaticSEEngine::memory_find(std::strin... | 29.433099 | 79 | 0.626151 | [
"vector"
] |
65ad0e152b16b05d8a3a374c591b27453c60f278 | 8,004 | cpp | C++ | Source/TrackViz/Private/TrackVizGameMode.cpp | BrainsGarden/TrackViz | c63c1f041fc4ee124d1e7113772dc3a2e52d7ea6 | [
"MIT"
] | 13 | 2018-12-04T10:40:56.000Z | 2020-07-05T15:48:12.000Z | Source/TrackViz/Private/TrackVizGameMode.cpp | BrainsGarden/TrackViz | c63c1f041fc4ee124d1e7113772dc3a2e52d7ea6 | [
"MIT"
] | null | null | null | Source/TrackViz/Private/TrackVizGameMode.cpp | BrainsGarden/TrackViz | c63c1f041fc4ee124d1e7113772dc3a2e52d7ea6 | [
"MIT"
] | 3 | 2020-03-07T12:53:49.000Z | 2020-07-05T15:48:32.000Z | // Fill out your copyright notice in the Description page of Project Settings.
#include "TrackVizGameMode.h"
#include "TrackVizBPLibrary.h"
#include "Core.h"
#include "EngineUtils.h"
#include "Engine.h"
#include "Engine/GameEngine.h"
#include "GameFramework/PlayerInput.h"
#include "Slate/SceneViewport.h"
#include "Mar... | 33.772152 | 158 | 0.751749 | [
"mesh"
] |
65b598c5154c385bd44b591c296fe3514c139f2f | 807 | cpp | C++ | api/src/SAM_eqns.cpp | bje-/SAM | a52536b211c90a8e5fb15e4998212f313abcbfbe | [
"BSD-3-Clause"
] | 1 | 2021-04-27T23:06:44.000Z | 2021-04-27T23:06:44.000Z | api/src/SAM_eqns.cpp | bje-/SAM | a52536b211c90a8e5fb15e4998212f313abcbfbe | [
"BSD-3-Clause"
] | null | null | null | api/src/SAM_eqns.cpp | bje-/SAM | a52536b211c90a8e5fb15e4998212f313abcbfbe | [
"BSD-3-Clause"
] | 1 | 2021-09-15T11:15:24.000Z | 2021-09-15T11:15:24.000Z | #include <string>
#include <utility>
#include <vector>
#include <memory>
#include <iostream>
#include <ssc/sscapi.h>
#include <ssc/cmod_windpower_eqns.h>
#include <ssc/cmod_pvsamv1_eqns.h>
#include <ssc/cmod_merchantplant_eqns.h>
#include "SAM_api.h"
#include "SAM_eqns.h"
#include "ErrorHandler.h"
SAM_EXPORT void S... | 24.454545 | 86 | 0.738538 | [
"vector"
] |
65c594294367a16f9e0337ea1fd4338682a39cf8 | 5,651 | hpp | C++ | include/fidstr/AprilTagGenerator.hpp | Humhu/FiducialStream | 51b534f64f030b685a78b3be734b6109a14c7279 | [
"AFL-3.0"
] | null | null | null | include/fidstr/AprilTagGenerator.hpp | Humhu/FiducialStream | 51b534f64f030b685a78b3be734b6109a14c7279 | [
"AFL-3.0"
] | null | null | null | include/fidstr/AprilTagGenerator.hpp | Humhu/FiducialStream | 51b534f64f030b685a78b3be734b6109a14c7279 | [
"AFL-3.0"
] | null | null | null | // Implementation for AprilTagGenerator
template <int N>
AprilTagGenerator<N>::AprilTagGenerator( unsigned int _minHammingDistance,
unsigned int _minComplexity,
unsigned long long _searchStride ) :
minHammingDistance( _minHammingDistance ),
minComplexity( _minComplexity ),
searchStride( _searc... | 25.454955 | 102 | 0.672447 | [
"vector"
] |
65c728af12555a083c73279eaf11a6cc2dc678d7 | 24,151 | cpp | C++ | firmware/main/menus/wifi_menu.cpp | cmdc0de/LEDSensorClock | 80f57f0668024461ee9e9c6d72d9716c6f50c12f | [
"MIT"
] | null | null | null | firmware/main/menus/wifi_menu.cpp | cmdc0de/LEDSensorClock | 80f57f0668024461ee9e9c6d72d9716c6f50c12f | [
"MIT"
] | null | null | null | firmware/main/menus/wifi_menu.cpp | cmdc0de/LEDSensorClock | 80f57f0668024461ee9e9c6d72d9716c6f50c12f | [
"MIT"
] | null | null | null | #include "wifi_menu.h"
#include "../app.h"
#include "calibration_menu.h"
#include "gui_list_processor.h"
#include <app/display_message_state.h>
#include <esp_log.h>
#include <esp_event.h>
#include <esp_wifi.h>
#include "menu_state.h"
#include <math/rectbbox.h>
#include <cJSON.h>
#include <system.h>
#include <net/utilit... | 33.083562 | 204 | 0.681918 | [
"vector",
"model"
] |
65cd2f60da1a5e69a3da568c859aa009d73bcd8c | 8,108 | hh | C++ | DdsJs/DomainParticipantWrap.hh | rjnieves/DdsJs | 90939e43b2f62d908b1f43dc61dc4fa54ba4c1e4 | [
"Apache-2.0"
] | 1 | 2019-11-13T01:22:39.000Z | 2019-11-13T01:22:39.000Z | DdsJs/DomainParticipantWrap.hh | rjnieves/DdsJs | 90939e43b2f62d908b1f43dc61dc4fa54ba4c1e4 | [
"Apache-2.0"
] | null | null | null | DdsJs/DomainParticipantWrap.hh | rjnieves/DdsJs | 90939e43b2f62d908b1f43dc61dc4fa54ba4c1e4 | [
"Apache-2.0"
] | 2 | 2019-11-04T01:54:10.000Z | 2019-11-12T20:03:47.000Z | /**
* \file DomainParticipantWrap.hh
* \brief Contains the definition of the \c DomainParticipantWrap class.
* \author Rolando J. Nieves
* \date 2014-07-28 16:02:00
*/
#ifndef _DOMAIN_PARTICIPANT_WRAP_HH_
#define _DOMAIN_PARTICIPANT_WRAP_HH_
#include <node.h>
#include <node_object_wrap.h>
#include <DdsJs/dds_prov... | 39.359223 | 99 | 0.660335 | [
"object"
] |
65cde1b16a48e5316bfb63c9851b9654f9efbcb4 | 3,960 | cpp | C++ | source/engine/rendering/util/SATGenerator.cpp | NTForked/VoxelConeTracingGI | 97867fce3cb1c14bd168359b40b54b7313166ab3 | [
"MIT"
] | 252 | 2016-12-05T08:08:01.000Z | 2022-03-26T14:47:34.000Z | source/engine/rendering/util/SATGenerator.cpp | NTForked/VoxelConeTracingGI | 97867fce3cb1c14bd168359b40b54b7313166ab3 | [
"MIT"
] | 3 | 2019-10-08T06:34:05.000Z | 2019-11-22T20:47:39.000Z | source/engine/rendering/util/SATGenerator.cpp | compix/CUDA-Path-Tracer | 429334456d75e8c939b94e1db288a51542f70926 | [
"MIT"
] | 29 | 2017-03-08T02:34:09.000Z | 2022-03-13T14:46:30.000Z | #include "SATGenerator.h"
#include <engine/rendering/util/GLUtil.h>
#include <engine/geometry/Rect.h>
#include <engine/resource/ResourceManager.h>
#include <engine/rendering/renderer/MeshRenderers.h>
SATGenerator::SATGenerator(int texWidth, int texHeight)
: m_width(texWidth), m_height(texHeight)
{
m_fullscreen... | 35.357143 | 145 | 0.682071 | [
"geometry",
"render"
] |
65e322b966e37733fdb508aea5937cf21e9cf049 | 5,298 | cpp | C++ | API/Driver/OpenGL/src/RenderPass.cpp | Gpinchon/OCRA | 341bb07facc616f1f8a27350054d1e86f022d7c6 | [
"Apache-2.0"
] | null | null | null | API/Driver/OpenGL/src/RenderPass.cpp | Gpinchon/OCRA | 341bb07facc616f1f8a27350054d1e86f022d7c6 | [
"Apache-2.0"
] | null | null | null | API/Driver/OpenGL/src/RenderPass.cpp | Gpinchon/OCRA | 341bb07facc616f1f8a27350054d1e86f022d7c6 | [
"Apache-2.0"
] | null | null | null | #include <RenderPass.hpp>
#include <GL/FrameBuffer.hpp>
#include <GL/RenderPass.hpp>
#include <GL/Command/Buffer.hpp>
#include <GL/Command/ExecutionState.hpp>
#include <GL/glew.h>
#include <vector>
#include <cassert>
OCRA_DECLARE_WEAK_HANDLE(OCRA::Device);
namespace OCRA::RenderPass
{
static inline auto GetClearOp... | 34.627451 | 141 | 0.746131 | [
"vector"
] |
65ed9307f1ee48e422844379c4ccb16393213044 | 4,378 | cpp | C++ | tests/ambient_occlusion.cpp | jdumas/aabb_benchmark | b63e43394508b2cc53f206a46472a0d7dbf917cb | [
"MIT"
] | 4 | 2019-07-18T21:48:00.000Z | 2021-01-04T18:15:07.000Z | tests/ambient_occlusion.cpp | jdumas/aabb_benchmark | b63e43394508b2cc53f206a46472a0d7dbf917cb | [
"MIT"
] | 1 | 2019-11-19T20:03:12.000Z | 2021-10-16T22:55:19.000Z | tests/ambient_occlusion.cpp | jdumas/aabb_benchmark | b63e43394508b2cc53f206a46472a0d7dbf917cb | [
"MIT"
] | null | null | null | #include "ambient_occlusion.h"
#include "utils.h"
#include <igl/Timer.h>
#include <igl/avg_edge_length.h>
#include <igl/embree/ambient_occlusion.h>
#include <igl/opengl/glfw/Viewer.h>
#include <igl/per_vertex_normals.h>
#include <igl/read_triangle_mesh.h>
#include <igl/embree/EmbreeIntersector.h>
#include <geogram/mesh... | 34.203125 | 99 | 0.611695 | [
"mesh",
"transform"
] |
65ee9d8f926c63125570aa21df2892a3b7d98644 | 1,156 | cpp | C++ | backup/2/codewars/c++/sum-of-a-beach.cpp | yangyanzhan/code-camp | 4272564e916fc230a4a488f92ae32c07d355dee0 | [
"Apache-2.0"
] | 21 | 2019-11-16T19:08:35.000Z | 2021-11-12T12:26:01.000Z | backup/2/codewars/c++/sum-of-a-beach.cpp | yangyanzhan/code-camp | 4272564e916fc230a4a488f92ae32c07d355dee0 | [
"Apache-2.0"
] | 1 | 2022-02-04T16:02:53.000Z | 2022-02-04T16:02:53.000Z | backup/2/codewars/c++/sum-of-a-beach.cpp | yangyanzhan/code-camp | 4272564e916fc230a4a488f92ae32c07d355dee0 | [
"Apache-2.0"
] | 4 | 2020-05-15T19:39:41.000Z | 2021-10-30T06:40:31.000Z | // Hi, I'm Yanzhan. For more algothmic problems, visit my Youtube Channel (Yanzhan Yang's Youtube Channel) : https://www.youtube.com/channel/UCDkz-__gl3frqLexukpG0DA?view_as=subscriber or my Twitter Account (Yanzhan Yang's Twitter) : https://twitter.com/YangYanzhan or my GitHub HomePage (Yanzhan Yang's GitHub HomePage)... | 36.125 | 345 | 0.57872 | [
"vector"
] |
65f28211ddbd51b84b17642187ec2c607ed58cc2 | 635 | cpp | C++ | chapter-14/14.43.cpp | zero4drift/Cpp-Primer-5th-Exercises | d3d0f0d228e8c2c5a3b3fe1fd03ce34e0894e93f | [
"MIT"
] | null | null | null | chapter-14/14.43.cpp | zero4drift/Cpp-Primer-5th-Exercises | d3d0f0d228e8c2c5a3b3fe1fd03ce34e0894e93f | [
"MIT"
] | null | null | null | chapter-14/14.43.cpp | zero4drift/Cpp-Primer-5th-Exercises | d3d0f0d228e8c2c5a3b3fe1fd03ce34e0894e93f | [
"MIT"
] | null | null | null | #include <vector>
#include <functional>
#include <iostream>
#include <algorithm>
using std::vector;
using std::modulus;
using std::placeholders::_1;
using std::cin;
using std::cout;
using std::endl;
using std::find_if;
int main()
{
int i;
vector<int> vi;
cout << "Please input integers: " << endl;
while(cin >>... | 19.242424 | 60 | 0.618898 | [
"vector"
] |
5a0e757777486336b925995499bb538cdecbcd4b | 15,258 | cc | C++ | psqlmatcher.cc | caomw/map_matching_plus | 319f78302fed812c771d3210e81b6e7d70b0328a | [
"BSD-3-Clause"
] | 3 | 2018-08-23T22:48:59.000Z | 2019-08-08T06:51:21.000Z | psqlmatcher.cc | caomw/map_matching_plus | 319f78302fed812c771d3210e81b6e7d70b0328a | [
"BSD-3-Clause"
] | null | null | null | psqlmatcher.cc | caomw/map_matching_plus | 319f78302fed812c771d3210e81b6e7d70b0328a | [
"BSD-3-Clause"
] | 2 | 2018-02-13T07:08:54.000Z | 2019-11-02T11:32:48.000Z | // -*- mode: c++ -*-
#include <unordered_map>
#include <vector>
#include <cassert>
#include <iostream>
// boost
#include <boost/property_tree/ptree.hpp>
#include <boost/property_tree/json_parser.hpp>
// psql
// #include <postgresql/libpq-fe.h>
#include <pqxx/pqxx>
// geos
#include <geos/io/WKBReader.h>
#include <ge... | 31.075356 | 171 | 0.655984 | [
"geometry",
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.