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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5d885d1ff87d767371c8581aa31115334786d9d2 | 9,289 | cpp | C++ | ee569/hw4/feature/FeatureMatcher.cpp | chenying-wang/usc-ee-coursework-public | 5bc94c2350bcebf1036fb058fe7dc4f7e31e1de1 | [
"MIT"
] | 1 | 2021-03-24T10:46:20.000Z | 2021-03-24T10:46:20.000Z | ee569/hw4/feature/FeatureMatcher.cpp | chenying-wang/usc-ee-coursework-public | 5bc94c2350bcebf1036fb058fe7dc4f7e31e1de1 | [
"MIT"
] | null | null | null | ee569/hw4/feature/FeatureMatcher.cpp | chenying-wang/usc-ee-coursework-public | 5bc94c2350bcebf1036fb058fe7dc4f7e31e1de1 | [
"MIT"
] | 1 | 2021-03-25T09:18:45.000Z | 2021-03-25T09:18:45.000Z | /**
* Name: Chenying Wang
* Email: chenying.wang@usc.edu
* USC ID: ****-****-**
* Date: Friday, March 20, 2020
**/
#include <iostream>
#include <vector>
#include <unordered_map>
#include "opencv2/core.hpp"
#include "opencv2/features2d.hpp"
#include "opencv2/xfeatures2d.hpp"
#include "FeatureMatcher.h"
#define N... | 38.704167 | 126 | 0.669502 | [
"vector"
] |
5d8a566518ad1ba8998ae86d9bcb37dcbd0956fa | 5,176 | cpp | C++ | src/MapGeneration/TileMap.cpp | Panzareon/RoguePG | 7c276c1c961c8b7a24cd88dc4b2de2ef99cd832c | [
"Zlib",
"MIT"
] | null | null | null | src/MapGeneration/TileMap.cpp | Panzareon/RoguePG | 7c276c1c961c8b7a24cd88dc4b2de2ef99cd832c | [
"Zlib",
"MIT"
] | null | null | null | src/MapGeneration/TileMap.cpp | Panzareon/RoguePG | 7c276c1c961c8b7a24cd88dc4b2de2ef99cd832c | [
"Zlib",
"MIT"
] | null | null | null | #include "MapGeneration/TileMap.h"
#include <iostream>
TileMap::TileMap()
{
//ctor
m_tileWidth = 32;
m_tileHeight = 32;
m_halfTileWidth = m_tileWidth/2;
m_halfTileHeight = m_tileHeight/2;
}
TileMap::~TileMap()
{
//dtor
}
int TileMap::GetTileMapWith()
{
return 32;
}
int TileMap::GetTileWidt... | 37.507246 | 142 | 0.490726 | [
"transform"
] |
5d91567a5e6e4819d4f19ddf21f41d93fec3cfdf | 1,495 | cpp | C++ | lib/DataStructures/BIT.cpp | LeoRiether/Competicao-Programativa | ad5bd4eba58792ad1ce7057fdf9fa6ef8970b17e | [
"MIT"
] | 1 | 2019-12-15T22:23:20.000Z | 2019-12-15T22:23:20.000Z | lib/DataStructures/BIT.cpp | LeoRiether/Competicao-Programativa | ad5bd4eba58792ad1ce7057fdf9fa6ef8970b17e | [
"MIT"
] | null | null | null | lib/DataStructures/BIT.cpp | LeoRiether/Competicao-Programativa | ad5bd4eba58792ad1ce7057fdf9fa6ef8970b17e | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
// Least Significant Bit
#define LSB(x) ((x) & (-(x)))
// Implementação de uma Binary Indexed Tree aka Fenwick Tree
// sum() e set() são executadas em O(log n)
// Os índices começam em 1!! (tanto dos dados quanto da árvore)
template <typename T>
... | 22.313433 | 64 | 0.519732 | [
"vector"
] |
4b6877ce65eeab3788557163cc4a2c7d2233a01e | 5,672 | cpp | C++ | cradle/src/cradle/io/services/calc_service.cpp | dotdecimal/open-cradle | f8b06f8d40b0f17ac8d2bf845a32fcd57bf5ce1d | [
"MIT"
] | null | null | null | cradle/src/cradle/io/services/calc_service.cpp | dotdecimal/open-cradle | f8b06f8d40b0f17ac8d2bf845a32fcd57bf5ce1d | [
"MIT"
] | null | null | null | cradle/src/cradle/io/services/calc_service.cpp | dotdecimal/open-cradle | f8b06f8d40b0f17ac8d2bf845a32fcd57bf5ce1d | [
"MIT"
] | 4 | 2018-09-28T17:12:54.000Z | 2022-03-20T14:22:29.000Z | #include <cradle/io/services/calc_service.hpp>
#include <cradle/io/services/core_services.hpp>
#include <cradle/io/web_io.hpp>
#include <cradle/io/services/calc_internals.hpp>
#include <cradle/io/services/iss.hpp>
#include <cradle/io/generic_io.hpp>
#ifdef WIN32
#include <windows.h>
#endif
namespace cradle {
string
... | 30.494624 | 114 | 0.650035 | [
"object",
"vector"
] |
4b69c61e27d9a37c9f56367a87c6df612a6470c1 | 14,664 | cpp | C++ | p2/p2.cpp | DavidSolanas/APD | 431670b737898fd0148b9400967a93404b70b40d | [
"MIT"
] | null | null | null | p2/p2.cpp | DavidSolanas/APD | 431670b737898fd0148b9400967a93404b70b40d | [
"MIT"
] | null | null | null | p2/p2.cpp | DavidSolanas/APD | 431670b737898fd0148b9400967a93404b70b40d | [
"MIT"
] | 1 | 2021-01-05T13:01:37.000Z | 2021-01-05T13:01:37.000Z | #include <iostream>
#include <fstream>
#include <cstring>
#include "huffman.cpp"
using namespace std;
// Variables auxiliares para determinar fin de un string (caracteres que no pueden estar en el texto)
//const int NULO = 0x00;
const int NULO = 0x00;
/**
* Devuelve cierto si el par (x1,x2) es menor que el par (y1,y... | 29.86558 | 129 | 0.566421 | [
"vector"
] |
4b69d2599d9075e756d8ac6793016375d05294c3 | 450 | cpp | C++ | Cpp/Arrays/Problems/find-duplicate-in-array.cpp | mailtokartik1/InterviewBit-Solutions | 8a9be25cf55947aff456c7c138e2ee6f518aa6a5 | [
"MIT"
] | 58 | 2019-06-15T01:35:06.000Z | 2021-04-27T08:32:39.000Z | Arrays/Problems/find-duplicate-in-array.cpp | mojo912/InterviewBit-Solutions | 62fb19efff15bbe3b42183c12d2e6adf7c4c2a84 | [
"MIT"
] | 3 | 2019-06-17T00:20:13.000Z | 2019-06-30T05:41:10.000Z | Arrays/Problems/find-duplicate-in-array.cpp | mojo912/InterviewBit-Solutions | 62fb19efff15bbe3b42183c12d2e6adf7c4c2a84 | [
"MIT"
] | 14 | 2019-06-15T01:35:09.000Z | 2020-08-27T19:45:28.000Z | int Solution::repeatedNumber(const vector<int> &arr) {
int slow = arr[0];
int fast = arr[0];
// Flloyd's cycle finding algorithm
do
{
slow = arr[slow];
fast = arr[arr[fast]];
} while (slow != fast);
// Find the entrance to the cycle
int ptr1 = arr[0];
int pt... | 18.75 | 54 | 0.497778 | [
"vector"
] |
4b6bc624ba3ed39ec7863913a1ba86bc5b0623de | 1,366 | cpp | C++ | compress_main.cpp | AndresFZapataR/Nemesis | dacb03233df3ef5f778ae6b0eaa39b2b4f377b1f | [
"Apache-2.0"
] | null | null | null | compress_main.cpp | AndresFZapataR/Nemesis | dacb03233df3ef5f778ae6b0eaa39b2b4f377b1f | [
"Apache-2.0"
] | null | null | null | compress_main.cpp | AndresFZapataR/Nemesis | dacb03233df3ef5f778ae6b0eaa39b2b4f377b1f | [
"Apache-2.0"
] | null | null | null | #include<iostream>
#include<vector>
#include <map>
#include<fstream>
#include "HuffmanCode.hpp"
using namespace std;
int main(){
vector<Tree*> vector;
char c;
bool in = false;
ifstream file;
file.open("txt.txt");
cout<<"Generando histograma... "<<endl;
std::vector<char> keys;
while (file.get(c)){
for(size... | 21.68254 | 84 | 0.507321 | [
"vector"
] |
4b7787df5f01eebeaafa671ad2f8ec67af1e129b | 1,788 | cpp | C++ | BashuOJ-Code/3991.cpp | magicgh/algorithm-contest-code | c21a90b11f73535c61e6363a4305b74cff24a85b | [
"MIT"
] | null | null | null | BashuOJ-Code/3991.cpp | magicgh/algorithm-contest-code | c21a90b11f73535c61e6363a4305b74cff24a85b | [
"MIT"
] | null | null | null | BashuOJ-Code/3991.cpp | magicgh/algorithm-contest-code | c21a90b11f73535c61e6363a4305b74cff24a85b | [
"MIT"
] | null | null | null | #include<iostream>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
struct node
{
int to,val;
};
vector<node>a[20005];
int N;
int CoreMin,Core,dn=0;
bool vst[20005];
int c[3],s[20005],dist[20005],Ans=0;
inline int gcd(int a,int b)
{
return ... | 17.70297 | 57 | 0.5783 | [
"vector"
] |
4b77d049c30011f6b9c17598fa8c49b286662d7a | 7,420 | hpp | C++ | include/System/Xml/XmlWellFormedWriter_NamespaceResolverProxy.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/System/Xml/XmlWellFormedWriter_NamespaceResolverProxy.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/System/Xml/XmlWellFormedWriter_NamespaceResolverProxy.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | 1 | 2022-03-30T21:07:35.000Z | 2022-03-30T21:07:35.000Z | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "beatsaber-hook/shared/utils/typedefs.h"
#include "beatsaber-hook/shared/utils/byref.hpp"
// Including type: System.Xml.XmlWellFormedWriter
#inc... | 65.663717 | 351 | 0.77965 | [
"vector"
] |
4b79231a07603516c8b3e8ee05fc56d15d752b2e | 3,270 | cpp | C++ | development/Common/Utility/source/VTS/BlobLoader.cpp | eglowacki/zloty | 9c864ae0beb1ac64137a096795261768b7fc6710 | [
"MIT"
] | null | null | null | development/Common/Utility/source/VTS/BlobLoader.cpp | eglowacki/zloty | 9c864ae0beb1ac64137a096795261768b7fc6710 | [
"MIT"
] | 44 | 2018-06-28T03:01:44.000Z | 2022-03-20T19:53:00.000Z | development/Common/Utility/source/VTS/BlobLoader.cpp | eglowacki/zloty | 9c864ae0beb1ac64137a096795261768b7fc6710 | [
"MIT"
] | null | null | null | #include "VTS/BlobLoader.h"
#include "Debugging/DevConfiguration.h"
#include "Exception/Exception.h"
#include "Metrics/Concurrency.h"
#include "Platform/Support.h"
#include <filesystem>
namespace fs = std::filesystem;
yaget::io::BlobLoader::BlobLoader(bool loadAllFiles, ErrorCallback errorCallback)
: mErrorCallb... | 33.367347 | 181 | 0.659021 | [
"vector"
] |
4b8277f474aab4d3d43e9efe1d60f4f81f79c6db | 3,073 | cc | C++ | src/two.cc | bobpaw/motion | 05e5082eac072bd83f7a63d5a0bd086d14f3f174 | [
"MIT"
] | null | null | null | src/two.cc | bobpaw/motion | 05e5082eac072bd83f7a63d5a0bd086d14f3f174 | [
"MIT"
] | null | null | null | src/two.cc | bobpaw/motion | 05e5082eac072bd83f7a63d5a0bd086d14f3f174 | [
"MIT"
] | null | null | null | #include <iostream>
#include <random>
#include <SFML/System.hpp>
#include <SFML/Graphics.hpp>
#include "physics.h"
const int ScreenWidth = 640;
const int ScreenHeight = 400;
#undef main
int main (int argc, char* argv[]) {
sf::RenderWindow graphics_window(sf::VideoMode(ScreenWidth, ScreenHeight), "Motion", sf::Styl... | 31.040404 | 167 | 0.687602 | [
"render",
"object"
] |
4b8a425b2e5ff7136e2aea85b9c10659b2756455 | 2,625 | cpp | C++ | AudioKit/Core/STK/Plucked.cpp | ethi1989/AudioKit | 97acc8da6dfb75408b2276998073de7a4511d480 | [
"MIT"
] | 206 | 2020-10-28T12:47:49.000Z | 2022-03-26T14:09:30.000Z | AudioKit/Core/STK/Plucked.cpp | ethi1989/AudioKit | 97acc8da6dfb75408b2276998073de7a4511d480 | [
"MIT"
] | 7 | 2020-10-29T10:29:23.000Z | 2021-08-07T00:22:03.000Z | AudioKit/Core/STK/Plucked.cpp | ethi1989/AudioKit | 97acc8da6dfb75408b2276998073de7a4511d480 | [
"MIT"
] | 30 | 2020-10-28T16:11:40.000Z | 2021-12-28T01:15:23.000Z | /***************************************************/
/*! \class Plucked
\brief STK basic plucked string class.
This class implements a simple plucked string
physical model based on the Karplus-Strong
algorithm.
For a more advanced plucked string implementation,
see the stk::Twang class.
... | 26.785714 | 78 | 0.649143 | [
"model"
] |
4b8d6ca246a9ad6a6895e22055510e041add77f9 | 40,087 | cpp | C++ | src/topology/TMRQuadConstitutive.cpp | 12libao/tmr | 30110e5c82bdf3874fbbf514a3c4b6f2c97ff696 | [
"Apache-2.0"
] | 6 | 2018-05-21T02:05:05.000Z | 2020-06-29T11:04:42.000Z | src/topology/TMRQuadConstitutive.cpp | 12libao/tmr | 30110e5c82bdf3874fbbf514a3c4b6f2c97ff696 | [
"Apache-2.0"
] | null | null | null | src/topology/TMRQuadConstitutive.cpp | 12libao/tmr | 30110e5c82bdf3874fbbf514a3c4b6f2c97ff696 | [
"Apache-2.0"
] | 5 | 2019-04-16T16:27:50.000Z | 2020-06-17T08:15:32.000Z | /*
This file is part of the package TMR for adaptive mesh refinement.
Copyright (C) 2015 Georgia Tech Research Corporation.
Additional copyright (C) 2015 Graeme Kennedy.
All rights reserved.
TMR is licensed under the Apache License, Version 2.0 (the "License");
you may not use this software except in comp... | 28.654039 | 87 | 0.506523 | [
"mesh",
"object",
"shape",
"vector"
] |
4b938db007c3100e8fe7a7404d3b3fbc8467ff8f | 4,175 | cpp | C++ | model/src/pendulum/pendulum_driver/test/test_pendulum_driver_node.cpp | swgu931/ros2-pendulum-caas | b8464633366eddd20845ffb4f104bb41e12d9a72 | [
"MIT"
] | 81 | 2019-10-25T16:08:30.000Z | 2022-03-22T23:25:33.000Z | model/src/pendulum/pendulum_driver/test/test_pendulum_driver_node.cpp | swgu931/ros2-pendulum-caas | b8464633366eddd20845ffb4f104bb41e12d9a72 | [
"MIT"
] | 57 | 2019-11-20T16:41:15.000Z | 2022-03-26T23:17:54.000Z | model/src/pendulum/pendulum_driver/test/test_pendulum_driver_node.cpp | swgu931/ros2-pendulum-caas | b8464633366eddd20845ffb4f104bb41e12d9a72 | [
"MIT"
] | 20 | 2019-11-07T02:12:50.000Z | 2022-02-23T20:42:01.000Z | // Copyright 2020 Carlos San Vicente, Igor Recio
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable l... | 38.302752 | 94 | 0.77006 | [
"vector"
] |
4b9a1eb8b2b096dec1afcfc7743cb8a716a74f33 | 8,697 | hpp | C++ | cisco-ios-xr/ydk/models/cisco_ios_xr/Cisco_IOS_XR_nto_misc_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_nto_misc_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_nto_misc_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_NTO_MISC_OPER_
#define _CISCO_IOS_XR_NTO_MISC_OPER_
#include <memory>
#include <vector>
#include <string>
#include <ydk/types.hpp>
#include <ydk/errors.hpp>
namespace cisco_ios_xr {
namespace Cisco_IOS_XR_nto_misc_oper {
class MemorySummary : public ydk::Entity
{
public:
MemorySumma... | 46.015873 | 162 | 0.686214 | [
"vector"
] |
4b9da269d2b7b192378835f68f20ca0fe165a078 | 2,971 | cpp | C++ | Game/Gun.cpp | eleanorichards/DXTK_Code_Base | e1829fb7467c020392d5df29dda7d45532e4f7b7 | [
"MIT"
] | null | null | null | Game/Gun.cpp | eleanorichards/DXTK_Code_Base | e1829fb7467c020392d5df29dda7d45532e4f7b7 | [
"MIT"
] | null | null | null | Game/Gun.cpp | eleanorichards/DXTK_Code_Base | e1829fb7467c020392d5df29dda7d45532e4f7b7 | [
"MIT"
] | null | null | null | #include "Gun.h"
Gun::Gun(string _fileName, ID3D11Device * _pd3dDevice, IEffectFactory * _EF, GameObject * _parent, string _bulletFileName, int _numBullets, float _pitch, float _yaw, float _roll, Vector3 _scale) : CMOGO(_fileName, _pd3dDevice, _EF)
{
GameObject::Tick(nullptr);
m_fudge;
m_parent = _parent;
m_pos ... | 25.393162 | 231 | 0.664759 | [
"vector",
"transform"
] |
4bab97b1d2aaf0c023b324d61369738d62b18b8b | 18,155 | cpp | C++ | clients/ros1/free_fleet_client/src/Client.cpp | tsedl/free_fleet | 338a90cc70f8793570b1de06c609ce042996fcd0 | [
"Apache-2.0"
] | null | null | null | clients/ros1/free_fleet_client/src/Client.cpp | tsedl/free_fleet | 338a90cc70f8793570b1de06c609ce042996fcd0 | [
"Apache-2.0"
] | null | null | null | clients/ros1/free_fleet_client/src/Client.cpp | tsedl/free_fleet | 338a90cc70f8793570b1de06c609ce042996fcd0 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2019 Open Source Robotics Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by appl... | 29.811166 | 86 | 0.690113 | [
"model",
"transform"
] |
4bacbefe438c6975d9a2cac5cfba12e6a12f0581 | 601 | cpp | C++ | src/lumberyard/chunk/model/Node.cpp | healingbrew/fmt_dragon | 7f98860d2081c2bede3315bf114aef3f1da639a7 | [
"MIT"
] | 1 | 2021-12-09T05:41:20.000Z | 2021-12-09T05:41:20.000Z | src/lumberyard/chunk/model/Node.cpp | healingbrew/fmt_dragon | 7f98860d2081c2bede3315bf114aef3f1da639a7 | [
"MIT"
] | null | null | null | src/lumberyard/chunk/model/Node.cpp | healingbrew/fmt_dragon | 7f98860d2081c2bede3315bf114aef3f1da639a7 | [
"MIT"
] | 1 | 2021-12-09T05:41:22.000Z | 2021-12-09T05:41:22.000Z | //
// Created by yretenai on 6/5/2020.
//
#include "Node.h"
namespace dragon::lumberyard::chunk::model {
Node::Node(Array<char>* buffer, CRCH_CHUNK_HEADER chunk_header) {
Chunk = chunk_header;
assert(Chunk.Version == 0x824 || Chunk.Version == 0x823);
Name = std::string(buffer->slice(0, 64)... | 35.352941 | 112 | 0.635607 | [
"model"
] |
4bb139d509d4208f9167ed6e6d284af00e147309 | 622 | cpp | C++ | graph/shortest-path/dijkstra.cpp | beet-aizu/library-2 | 51579421d2c695ae298eed3943ca90f5224f768a | [
"Unlicense"
] | null | null | null | graph/shortest-path/dijkstra.cpp | beet-aizu/library-2 | 51579421d2c695ae298eed3943ca90f5224f768a | [
"Unlicense"
] | null | null | null | graph/shortest-path/dijkstra.cpp | beet-aizu/library-2 | 51579421d2c695ae298eed3943ca90f5224f768a | [
"Unlicense"
] | 1 | 2020-10-14T20:51:44.000Z | 2020-10-14T20:51:44.000Z | template< typename T >
vector< T > dijkstra(WeightedGraph< T > &g, int s) {
const auto INF = numeric_limits< T >::max();
vector< T > dist(g.size(), INF);
using Pi = pair< T, int >;
priority_queue< Pi, vector< Pi >, greater< Pi > > que;
dist[s] = 0;
que.emplace(dist[s], s);
while(!que.empty()) {
T cos... | 24.88 | 56 | 0.55627 | [
"vector"
] |
4bb547771bfa88c277b1a988ce0936b4e693b8be | 7,047 | cpp | C++ | gui/components/TextureRect.cpp | TrapGameStudio/MouseTraps | 1160f8b6ef865b180f418bd6d83f40d59d938130 | [
"MIT"
] | null | null | null | gui/components/TextureRect.cpp | TrapGameStudio/MouseTraps | 1160f8b6ef865b180f418bd6d83f40d59d938130 | [
"MIT"
] | null | null | null | gui/components/TextureRect.cpp | TrapGameStudio/MouseTraps | 1160f8b6ef865b180f418bd6d83f40d59d938130 | [
"MIT"
] | 1 | 2020-04-19T23:20:25.000Z | 2020-04-19T23:20:25.000Z | #include "TextureRect.h"
void TextureRect::updateTextureInfo() {
if (textureColumn > 0 && textureRow > 0) {
textureTileSize->setTo(-1.0f / textureColumn, -1.0f / textureRow);
currentTextureCoordinate->setTo(
1- (currentTextureColumn * textureTileSize->getX()),
1 - (curren... | 28.763265 | 118 | 0.694764 | [
"vector"
] |
4bb8bbcc9c98d2606c2fc8b90664ad45a545aa0c | 55,824 | cpp | C++ | emulator/src/mame/drivers/sms.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | 1 | 2022-01-15T21:38:38.000Z | 2022-01-15T21:38:38.000Z | emulator/src/mame/drivers/sms.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | null | null | null | emulator/src/mame/drivers/sms.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | null | null | null | // license:BSD-3-Clause
// copyright-holders:Wilbert Pol, Charles MacDonald,Mathis Rosenhauer,Brad Oliver,Michael Luong,Fabio Priuli,Enik Land
/******************************************************************************
Contributors:
Marat Fayzullin (MG source)
Charles MacDonald
Mathis Rosenhauer
B... | 44.44586 | 199 | 0.705825 | [
"3d"
] |
4bc2fa090989598ef9123046718d2fb245c8099d | 7,685 | cpp | C++ | pong.cpp | thegamedragon/PongMaybe | 1bd654f896742f274de1c76ccb895cb73b4ec921 | [
"MIT"
] | null | null | null | pong.cpp | thegamedragon/PongMaybe | 1bd654f896742f274de1c76ccb895cb73b4ec921 | [
"MIT"
] | null | null | null | pong.cpp | thegamedragon/PongMaybe | 1bd654f896742f274de1c76ccb895cb73b4ec921 | [
"MIT"
] | null | null | null | #include "pong.h"
GameTexture Game::LoadTextTexture(std::string Text)
{
SDL_Surface* textSurface=TTF_RenderText_Solid(Font,Text.c_str(),WhiteColor);
GameTexture NewTexture;
NewTexture.Texture=SDL_CreateTextureFromSurface(renderer,textSurface);
NewTexture.Height=textSurface->h;
NewTexture.Wi... | 35.252294 | 230 | 0.644632 | [
"render"
] |
4bc5036becd9945eb7de847587973b3b25e3d9fc | 36,032 | cpp | C++ | daemons/STS-Dev-Kit/Spectrometer.cpp | KOLANICH/SeaBreeze | 615b6c689d432c2f901a4505ed0abff5ff799e13 | [
"MIT"
] | null | null | null | daemons/STS-Dev-Kit/Spectrometer.cpp | KOLANICH/SeaBreeze | 615b6c689d432c2f901a4505ed0abff5ff799e13 | [
"MIT"
] | 1 | 2022-01-10T19:33:53.000Z | 2022-02-02T14:53:07.000Z | daemons/STS-Dev-Kit/Spectrometer.cpp | KOLANICH/SeaBreeze | 615b6c689d432c2f901a4505ed0abff5ff799e13 | [
"MIT"
] | null | null | null | /***************************************************/ /**
* @file Spectrometer.cpp
* @date February 2015
* @author Ocean Optics, Inc.
*
* Provides the functionality to accept a command/request for a spectrometer and return a response to the
* response handler. An Active Object is used to queue requests on ... | 36.580711 | 1,685 | 0.747086 | [
"object",
"vector",
"model",
"transform"
] |
4bc5927e5f68fa5d4de1cecd8ef9144c52447ccd | 3,243 | cpp | C++ | aws-cpp-sdk-kinesis-video-archived-media/source/model/Fragment.cpp | curiousjgeorge/aws-sdk-cpp | 09b65deba03cfbef9a1e5d5986aa4de71bc03cd8 | [
"Apache-2.0"
] | 2 | 2019-03-11T15:50:55.000Z | 2020-02-27T11:40:27.000Z | aws-cpp-sdk-kinesis-video-archived-media/source/model/Fragment.cpp | curiousjgeorge/aws-sdk-cpp | 09b65deba03cfbef9a1e5d5986aa4de71bc03cd8 | [
"Apache-2.0"
] | null | null | null | aws-cpp-sdk-kinesis-video-archived-media/source/model/Fragment.cpp | curiousjgeorge/aws-sdk-cpp | 09b65deba03cfbef9a1e5d5986aa4de71bc03cd8 | [
"Apache-2.0"
] | 1 | 2019-01-18T13:03:55.000Z | 2019-01-18T13:03:55.000Z | /*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. 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.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" fil... | 24.568182 | 89 | 0.763799 | [
"model"
] |
4bc7924111ac13df7ff0ad418221362342b033f1 | 917 | cpp | C++ | #077.cpp | LiFantastic/LeetCode | ed7a25b96595531009e55de9aeebe758ca0734d2 | [
"Apache-2.0"
] | null | null | null | #077.cpp | LiFantastic/LeetCode | ed7a25b96595531009e55de9aeebe758ca0734d2 | [
"Apache-2.0"
] | null | null | null | #077.cpp | LiFantastic/LeetCode | ed7a25b96595531009e55de9aeebe758ca0734d2 | [
"Apache-2.0"
] | null | null | null | /*============================================================
Problem: Combinations
==============================================================
Given two integers n and k, return all possible combinations
of k numbers out of 1 ... n.
For example,
If n = 4 and k = 2, a solution is:
[
[2,4],
[3,4],
[2,3],
[... | 21.325581 | 62 | 0.38277 | [
"vector"
] |
4bc79a21e6cb45567aa21379ee176e2dff0f9a5d | 5,309 | hpp | C++ | src/expr.hpp | ThorNielsen/loxint | a5456afad37f22973e2b1292aff0276ac2c6fcdd | [
"MIT"
] | 7 | 2018-03-09T10:10:39.000Z | 2021-12-23T07:19:39.000Z | src/expr.hpp | ThorNielsen/loxint | a5456afad37f22973e2b1292aff0276ac2c6fcdd | [
"MIT"
] | 1 | 2021-12-23T07:19:29.000Z | 2021-12-23T07:19:29.000Z | src/expr.hpp | ThorNielsen/loxint | a5456afad37f22973e2b1292aff0276ac2c6fcdd | [
"MIT"
] | 1 | 2019-06-09T21:00:46.000Z | 2019-06-09T21:00:46.000Z | // Warning: This code is auto-generated and may be changed at any
// time by a script. Edits will be reverted.
#ifndef EXPR_HPP_INCLUDED
#define EXPR_HPP_INCLUDED
#include "loxobject.hpp"
#include "token.hpp"
#include <memory>
#include <vector>
using ExprRetType = LoxObject;
class AssignmentExpr;
class BinaryExpr;
cl... | 19.958647 | 103 | 0.64174 | [
"object",
"vector"
] |
4bc834479fe9acafcde4d3258f6a81f227823671 | 240,305 | cc | C++ | storage/innobase/handler/i_s.cc | hervewenjie/mysql | 49a37eda4e2cc87e20ba99e2c29ffac2fc322359 | [
"BSD-3-Clause"
] | null | null | null | storage/innobase/handler/i_s.cc | hervewenjie/mysql | 49a37eda4e2cc87e20ba99e2c29ffac2fc322359 | [
"BSD-3-Clause"
] | null | null | null | storage/innobase/handler/i_s.cc | hervewenjie/mysql | 49a37eda4e2cc87e20ba99e2c29ffac2fc322359 | [
"BSD-3-Clause"
] | null | null | null | /*****************************************************************************
Copyright (c) 2007, 2015, Oracle and/or its affiliates. All Rights Reserved.
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
Founda... | 28.069735 | 103 | 0.698238 | [
"object",
"vector"
] |
4bce3323ea75dd71e5282154751d262b85e38a95 | 4,158 | cc | C++ | tests/unit_tests/ntcp2/router/info.cc | coneiric/ntcp2 | cbc68d99bb9035be545365ac99d24c3a9f43e45f | [
"BSD-3-Clause"
] | 2 | 2019-01-19T02:19:42.000Z | 2019-05-23T05:47:37.000Z | tests/unit_tests/ntcp2/router/info.cc | coneiric/ntcp2 | cbc68d99bb9035be545365ac99d24c3a9f43e45f | [
"BSD-3-Clause"
] | null | null | null | tests/unit_tests/ntcp2/router/info.cc | coneiric/ntcp2 | cbc68d99bb9035be545365ac99d24c3a9f43e45f | [
"BSD-3-Clause"
] | 1 | 2022-01-02T22:37:06.000Z | 2022-01-02T22:37:06.000Z | /* Copyright (c) 2019, oneiric
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice, this
* list of conditions and t... | 32.484375 | 83 | 0.718374 | [
"vector"
] |
4bd219dc7f99b355e8f7608f729147066c2e332e | 46,199 | cpp | C++ | simulation_intersection_scenario/car.cpp | SirTobias/DMPCRobotSimulation | e393538b37e5a63bfe4da94e9bd13feba45699db | [
"MIT"
] | 2 | 2021-12-06T08:05:12.000Z | 2022-03-22T13:56:38.000Z | simulation_intersection_scenario/car.cpp | SirTobias/DMPCRobotSimulation | e393538b37e5a63bfe4da94e9bd13feba45699db | [
"MIT"
] | null | null | null | simulation_intersection_scenario/car.cpp | SirTobias/DMPCRobotSimulation | e393538b37e5a63bfe4da94e9bd13feba45699db | [
"MIT"
] | 1 | 2022-03-29T12:46:37.000Z | 2022-03-29T12:46:37.000Z | #include "car.h"
#include "costfunction.h"
#include "intersection.h"
#include "astarpathcalculation.h"
#include "dstarlite.h"
#include "floydwarshallpathcalculation.h"
#include "mpccontroller.h"
#include "globalcarlist.h"
#include <QtCore/QDebug>
/**
* @brief Car::Car constructs the car
* with cost function and ta... | 44.853398 | 233 | 0.647893 | [
"vector"
] |
4bd3d904d7cfb37d545e1bbc79d0bef7fa902031 | 5,115 | cpp | C++ | water.cpp | gberthou/PeacefulWorld | 50c32b16c550799f3b7ba52b4bf8c1c66dcbdf43 | [
"MIT"
] | null | null | null | water.cpp | gberthou/PeacefulWorld | 50c32b16c550799f3b7ba52b4bf8c1c66dcbdf43 | [
"MIT"
] | null | null | null | water.cpp | gberthou/PeacefulWorld | 50c32b16c550799f3b7ba52b4bf8c1c66dcbdf43 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
#include <deque>
#include "water.h"
#include "randutils.h"
#include "multilist.h"
static std::vector<glm::vec3> generate_segment(
const glm::vec3 &a,
const glm::vec3 &b,
float d,
float new_radius,
float distance_per_division)
{
const float distance = new_ra... | 29.228571 | 105 | 0.584555 | [
"vector"
] |
4bd713d8ee011b68040da9cd3e116ed5cc2bd061 | 1,698 | cpp | C++ | Codechef/August Challenge 2020 Division 2/SKMP.cpp | V1NT4G3K0D3/ProCodes | 60308f84c94f5fc9cafff8a4a45b49717171eb83 | [
"MIT"
] | 5 | 2020-08-07T14:33:46.000Z | 2021-10-04T12:00:58.000Z | Codechef/August Challenge 2020 Division 2/SKMP.cpp | Manvi1203/ProCodes | ae99bddc6fe035df51bab6682afe743b2a21eda0 | [
"MIT"
] | 1 | 2021-10-02T16:37:36.000Z | 2021-10-02T16:37:36.000Z | Codechef/August Challenge 2020 Division 2/SKMP.cpp | Manvi1203/ProCodes | ae99bddc6fe035df51bab6682afe743b2a21eda0 | [
"MIT"
] | 11 | 2020-08-07T14:34:45.000Z | 2021-10-08T19:23:46.000Z | #include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL)
#define lo(n) for(int i=0;i<n;i++)
#define fo(k,n) for(int i=k;i<n;i++)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#defin... | 18.659341 | 63 | 0.481743 | [
"vector"
] |
4bd8bc2f94fd5189fc6ea0424819b0de74a44619 | 9,174 | cpp | C++ | source/reporter.cpp | Oleh-Kravchenko/binder-aio | 46e283e25e1a956f44fd83eadf5b3377885d9c87 | [
"MIT"
] | null | null | null | source/reporter.cpp | Oleh-Kravchenko/binder-aio | 46e283e25e1a956f44fd83eadf5b3377885d9c87 | [
"MIT"
] | null | null | null | source/reporter.cpp | Oleh-Kravchenko/binder-aio | 46e283e25e1a956f44fd83eadf5b3377885d9c87 | [
"MIT"
] | 2 | 2019-02-01T17:22:34.000Z | 2020-03-23T10:45:03.000Z | // Copyright (c) 2018 Vadym Yatsenko <vadim.yatsenko@gmail.com>
//
// All rights reserved. Use of this source code is governed by a
// MIT license that can be found in the LICENSE file.
/// @file binder/reporter.cpp
/// @brief Binding statistic reporting
/// @author Vadym Yatsenko
#include <boost/property_tree/ptr... | 31.417808 | 126 | 0.603772 | [
"vector"
] |
4be7ac1ddbccf62b8e35659671dd583389024d3c | 20,192 | cc | C++ | src/json2IRTree.cc | thelichenhao/Compiler2020Project | a86a4cc65783033822704d7b10d914b6c8fd2199 | [
"MIT"
] | null | null | null | src/json2IRTree.cc | thelichenhao/Compiler2020Project | a86a4cc65783033822704d7b10d914b6c8fd2199 | [
"MIT"
] | null | null | null | src/json2IRTree.cc | thelichenhao/Compiler2020Project | a86a4cc65783033822704d7b10d914b6c8fd2199 | [
"MIT"
] | null | null | null | #include "json2IRTree.h"
using namespace Boost::Internal;
void IndexParse::insertPart(std::string s, std::set<std::string>& tmpVar) {
// s: i*4/2, i, 1
std::vector<tempStruct> r;
int t=0;
std::string v;
v.clear();
while(s[t] != '*' && s[t] != '/' && s[t] !='%' && s[t]!='\0') v+=s[t++];
if (s[t]=='... | 32.3072 | 174 | 0.557102 | [
"shape",
"vector"
] |
4bed1c92c015bbd540683c279d94f8f297b70934 | 753 | cpp | C++ | OOP/Lab4/cube_shape.cpp | samurai-of-honor/my-labs-1 | 111a9302093b1ad6a358560bd926544aa2479d80 | [
"MIT"
] | 1 | 2022-01-30T11:26:23.000Z | 2022-01-30T11:26:23.000Z | OOP/Lab4/cube_shape.cpp | samurai-of-honor/my-labs-1 | 111a9302093b1ad6a358560bd926544aa2479d80 | [
"MIT"
] | 6 | 2022-01-20T16:59:03.000Z | 2022-02-12T22:30:55.000Z | OOP/Lab4/cube_shape.cpp | samurai-of-honor/my-labs-1 | 111a9302093b1ad6a358560bd926544aa2479d80 | [
"MIT"
] | null | null | null | #include "framework.h"
#include "cube_shape.h"
void CubeShape::Show(HDC hdc, bool isDash) {
long x1, x2, y1, y2;
x1 = xs1; y1 = ys1; x2 = xs2; y2 = ys2;
RectShape::Set(x1 - 75, y1 - 75, x1 + 75, y1 + 75);
RectShape::Show(hdc, isDash);
RectShape::Set(x2 - 75, y2 - 75, x2 + 75, y2 + 75);
RectShape::Show(hdc, isDa... | 26.892857 | 52 | 0.605578 | [
"shape"
] |
4bee7d70d876ba850bff0d71103336e8f3639e47 | 6,193 | cpp | C++ | src/Core/JPetStatistics/JPetStatistics.cpp | kdulski/j-pet-framework | f7eeff83828de8e832f044abd3a7b7293dd31444 | [
"Apache-2.0"
] | null | null | null | src/Core/JPetStatistics/JPetStatistics.cpp | kdulski/j-pet-framework | f7eeff83828de8e832f044abd3a7b7293dd31444 | [
"Apache-2.0"
] | null | null | null | src/Core/JPetStatistics/JPetStatistics.cpp | kdulski/j-pet-framework | f7eeff83828de8e832f044abd3a7b7293dd31444 | [
"Apache-2.0"
] | null | null | null | /**
* @copyright Copyright 2018 The J-PET Framework 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 find a copy of the License in the LICENCE file.
*
* Unless required by applicable la... | 32.424084 | 119 | 0.687389 | [
"object"
] |
4bf7d000bd711d679d5e364acdf1566c7892c4b2 | 2,833 | cc | C++ | src/memo/silo/Strip.cc | infinit/memo | 3a8394d0f647efe03ccb8bfe885a7279cb8be8a6 | [
"Apache-2.0"
] | 124 | 2017-06-22T19:20:54.000Z | 2021-12-23T21:36:37.000Z | src/memo/silo/Strip.cc | infinit/memo | 3a8394d0f647efe03ccb8bfe885a7279cb8be8a6 | [
"Apache-2.0"
] | 4 | 2017-08-21T15:57:29.000Z | 2019-01-10T02:52:35.000Z | src/memo/silo/Strip.cc | infinit/memo | 3a8394d0f647efe03ccb8bfe885a7279cb8be8a6 | [
"Apache-2.0"
] | 12 | 2017-06-29T09:15:35.000Z | 2020-12-31T12:39:52.000Z | #include <memo/silo/Strip.hh>
#include <elle/algorithm.hh>
#include <memo/model/Address.hh>
#include <boost/algorithm/string.hpp>
#include <elle/factory.hh>
#include <elle/reactor/Scope.hh>
namespace memo
{
namespace silo
{
Strip::Strip(std::vector<std::unique_ptr<Silo>> backend)
: _backend(std::move... | 23.03252 | 75 | 0.589834 | [
"vector",
"model"
] |
4bff1d65dc42dabe9def7e89396e131594d6d20a | 14,411 | cpp | C++ | mesh.cpp | tkoziara/parmec | fefe0586798cd65744334f9abeab183159bd3d7a | [
"MIT"
] | null | null | null | mesh.cpp | tkoziara/parmec | fefe0586798cd65744334f9abeab183159bd3d7a | [
"MIT"
] | 15 | 2017-06-09T12:05:27.000Z | 2018-10-25T13:59:58.000Z | mesh.cpp | parmes/parmec | fefe0586798cd65744334f9abeab183159bd3d7a | [
"MIT"
] | null | null | null | /*
The MIT License (MIT)
Copyright (c) 2016 Tomasz Koziara
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... | 27.13936 | 113 | 0.562001 | [
"mesh",
"vector"
] |
ef061ca835b3fcd6c0a0efb5f17df8536b3c07e8 | 572 | hpp | C++ | includes/graphic/receiver.hpp | gabrielepongelli/web-graphic | 303d81c88e32ace7b8b3dd423fb881195fad0a21 | [
"BSL-1.0"
] | 1 | 2021-05-08T09:51:31.000Z | 2021-05-08T09:51:31.000Z | includes/graphic/receiver.hpp | gabrielepongelli/web-graphic | 303d81c88e32ace7b8b3dd423fb881195fad0a21 | [
"BSL-1.0"
] | null | null | null | includes/graphic/receiver.hpp | gabrielepongelli/web-graphic | 303d81c88e32ace7b8b3dd423fb881195fad0a21 | [
"BSL-1.0"
] | null | null | null | #pragma once
#include "../utilities/string_utilities.hpp"
#include <string>
namespace graphic
{
/**
* This class represent the receiver which interacts with a Sender object.
*/
class Receiver
{
public:
/**
* Start the receiver present in the position specified.... | 23.833333 | 88 | 0.61014 | [
"object"
] |
ef0696f20d619cdf80ec1ebf5ed36304cd3c547b | 9,993 | hpp | C++ | src/system.hpp | trbauer/cls | 3709dfd2b670c703c0d7d7454c99378cc74dd057 | [
"MIT"
] | 2 | 2020-05-20T16:56:25.000Z | 2020-05-27T16:49:43.000Z | src/system.hpp | trbauer/cls | 3709dfd2b670c703c0d7d7454c99378cc74dd057 | [
"MIT"
] | 8 | 2018-12-10T18:34:33.000Z | 2020-05-19T17:58:43.000Z | src/system.hpp | trbauer/cls | 3709dfd2b670c703c0d7d7454c99378cc74dd057 | [
"MIT"
] | null | null | null | #ifndef SYSTEM_HPP
#define SYSTEM_HPP
#include <cstdarg>
#include <cstdint>
#include <cstring>
#include <initializer_list>
#include <ostream>
#include <string>
#include <vector>
///////////////////////////////////////////////////////////////////////////////
// FUNCTION ATTRIBUTES AND FEATURES
#define FATAL(...) \
d... | 33.31 | 97 | 0.561093 | [
"vector"
] |
ef10e0d2fcba8f304b53c233523c9a7cddb4ba56 | 949 | cpp | C++ | main/sort-by-set-bit-count/sort-by-set-bit-count.cpp | EliahKagan/old-practice-snapshot | 1b53897eac6902f8d867c8f154ce2a489abb8133 | [
"0BSD"
] | null | null | null | main/sort-by-set-bit-count/sort-by-set-bit-count.cpp | EliahKagan/old-practice-snapshot | 1b53897eac6902f8d867c8f154ce2a489abb8133 | [
"0BSD"
] | null | null | null | main/sort-by-set-bit-count/sort-by-set-bit-count.cpp | EliahKagan/old-practice-snapshot | 1b53897eac6902f8d867c8f154ce2a489abb8133 | [
"0BSD"
] | null | null | null | #include <algorithm>
#include <iostream>
#include <vector>
namespace {
std::vector<int> get(std::vector<int>::size_type n)
{
std::vector<int> a;
for (a.reserve(n); n != 0u; --n) {
auto x = 0;
std::cin >> x;
a.push_back(x);
}
return a;... | 21.088889 | 75 | 0.418335 | [
"vector"
] |
ef15901058192580199fa6546a7e214ae00e5c51 | 14,389 | cpp | C++ | src/initialisation.cpp | CarlWhitfield/PULMsim | 3f7e135e44c0cbae2064a3a43dcaf3239fef5c67 | [
"MIT"
] | 1 | 2021-12-07T15:53:30.000Z | 2021-12-07T15:53:30.000Z | src/initialisation.cpp | CarlWhitfield/PULMsim | 3f7e135e44c0cbae2064a3a43dcaf3239fef5c67 | [
"MIT"
] | null | null | null | src/initialisation.cpp | CarlWhitfield/PULMsim | 3f7e135e44c0cbae2064a3a43dcaf3239fef5c67 | [
"MIT"
] | null | null | null | //
// initialisation.cpp
//
//
// Created by Carl Whitfield on 09/03/2017.
//
//
//--Checked and commented 16/05/18---//
//-----Initialisation functions-----//
#include "lung_model_discrete_branching.hpp"
int initialise_system(Tree &stree, Conversions &cons, Options &o)
{
//-- Output file of simulation summary --... | 44.686335 | 350 | 0.535409 | [
"vector"
] |
ef17e1cedaf39ab42624b71070cf8504a3840144 | 1,611 | cpp | C++ | leetcode/top-k-elem.cpp | amsubhash/competitive-programming | 02c801c631d5a830e9a4c41914091c3ac7eaf39e | [
"MIT"
] | null | null | null | leetcode/top-k-elem.cpp | amsubhash/competitive-programming | 02c801c631d5a830e9a4c41914091c3ac7eaf39e | [
"MIT"
] | null | null | null | leetcode/top-k-elem.cpp | amsubhash/competitive-programming | 02c801c631d5a830e9a4c41914091c3ac7eaf39e | [
"MIT"
] | null | null | null | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define assertm(exp, msg) ... | 22.068493 | 80 | 0.49162 | [
"vector"
] |
fa9c751184e4f3367bb99543cafad9f683e78970 | 14,432 | cpp | C++ | Co-Simulation/Sumo/sumo-1.7.0/src/gui/TraCIServerAPI_GUI.cpp | uruzahe/carla | 940c2ab23cce1eda1ef66de35f66b42d40865fb1 | [
"MIT"
] | null | null | null | Co-Simulation/Sumo/sumo-1.7.0/src/gui/TraCIServerAPI_GUI.cpp | uruzahe/carla | 940c2ab23cce1eda1ef66de35f66b42d40865fb1 | [
"MIT"
] | null | null | null | Co-Simulation/Sumo/sumo-1.7.0/src/gui/TraCIServerAPI_GUI.cpp | uruzahe/carla | 940c2ab23cce1eda1ef66de35f66b42d40865fb1 | [
"MIT"
] | null | null | null | /****************************************************************************/
// Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.org/sumo
// Copyright (C) 2001-2020 German Aerospace Center (DLR) and others.
// This program and the accompanying materials are made available under the
// terms of the Ecli... | 48.592593 | 167 | 0.58883 | [
"object",
"vector"
] |
fa9e25d902be465f92d3e9b24127fa95678b8d2a | 8,066 | cpp | C++ | Source/TrashLevelStreamer/Private/TrashStreamer.cpp | chris5451/ue4-trash-level-streaming | a287f8e59ec3a3a32baba65390ab766bfdf20150 | [
"MIT"
] | null | null | null | Source/TrashLevelStreamer/Private/TrashStreamer.cpp | chris5451/ue4-trash-level-streaming | a287f8e59ec3a3a32baba65390ab766bfdf20150 | [
"MIT"
] | null | null | null | Source/TrashLevelStreamer/Private/TrashStreamer.cpp | chris5451/ue4-trash-level-streaming | a287f8e59ec3a3a32baba65390ab766bfdf20150 | [
"MIT"
] | 1 | 2021-09-17T13:13:47.000Z | 2021-09-17T13:13:47.000Z | // Fill out your copyright notice in the Description page of Project Settings.
#include "TrashStreamer.h"
#include "Engine/LevelStreaming.h"
#include "ContentStreaming.h"
#include "Misc/App.h"
#include "UObject/Package.h"
#include "UObject/ReferenceChainSearch.h"
#include "Misc/PackageName.h"
#include "UObject/LinkerLo... | 34.767241 | 196 | 0.765807 | [
"object"
] |
faa553a4d793b26989261cf3d7802e8cd9a91bdf | 3,674 | cpp | C++ | test/test_initialise.cpp | dominicpalmer/spatial-tangled-nature | 95b97735357b1fe8cdddf768f407f36183b69e09 | [
"MIT"
] | null | null | null | test/test_initialise.cpp | dominicpalmer/spatial-tangled-nature | 95b97735357b1fe8cdddf768f407f36183b69e09 | [
"MIT"
] | null | null | null | test/test_initialise.cpp | dominicpalmer/spatial-tangled-nature | 95b97735357b1fe8cdddf768f407f36183b69e09 | [
"MIT"
] | null | null | null | #include "gtest/gtest.h"
#include "stn3d/initialise.h"
#include "stn3d/util.h"
// Tests for successful initialisation of genotype bitsets
TEST(InitialiseGenotypes, BitsetsAreInitialised) {
// Arrange: initialise all genotype bitsets
InitialiseGenotypes();
// Assert: the bitsets are initialised as expected
int... | 36.74 | 79 | 0.70196 | [
"vector"
] |
faaa19c636f8af8f6d768231f2274ed41ffbe325 | 6,823 | cpp | C++ | demo.cpp | jaswantp/GeometricPredicates | 7dca1c67051cc1ed3966ba7bf217773c7bb0a76e | [
"BSD-3-Clause"
] | null | null | null | demo.cpp | jaswantp/GeometricPredicates | 7dca1c67051cc1ed3966ba7bf217773c7bb0a76e | [
"BSD-3-Clause"
] | null | null | null | demo.cpp | jaswantp/GeometricPredicates | 7dca1c67051cc1ed3966ba7bf217773c7bb0a76e | [
"BSD-3-Clause"
] | null | null | null | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* *
* Copyright (c) 2016, William C. Lenthe *
* All rights reserved. ... | 46.414966 | 100 | 0.49553 | [
"vector"
] |
fab830b90be7dd6db92e937921a01a86d3e8bba2 | 636 | cpp | C++ | Codeforces/284 Divison 2/Problem C/C.cpp | VastoLorde95/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | 170 | 2017-07-25T14:47:29.000Z | 2022-01-26T19:16:31.000Z | Codeforces/284 Divison 2/Problem C/C.cpp | navodit15/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | null | null | null | Codeforces/284 Divison 2/Problem C/C.cpp | navodit15/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | 55 | 2017-07-28T06:17:33.000Z | 2021-10-31T03:06:22.000Z | #include<stdio.h>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<map>
#include<set>
#include<vector>
#include<utility>
#include<math.h>
#define sd(x) scanf("%d",&x)
#define sd2(x,y) scanf("%d%d",&x,&y)
#define sd3(x,y,z) scanf("%d%d%d",&x,&y,&z)
using namespace std;
int main(){
i... | 18.171429 | 50 | 0.553459 | [
"vector"
] |
fac707a3d3a971682ee15b1100aaa209b3c161ca | 1,627 | cpp | C++ | prob_of_the_day/max_min_hr_greedy_1001.cpp | gavincangan/hacker-rank | 340ec43af1850e9400360b1b985d70599d048c7d | [
"Unlicense"
] | 1 | 2018-09-11T14:27:37.000Z | 2018-09-11T14:27:37.000Z | prob_of_the_day/max_min_hr_greedy_1001.cpp | gavincangan/hacker-rank | 340ec43af1850e9400360b1b985d70599d048c7d | [
"Unlicense"
] | null | null | null | prob_of_the_day/max_min_hr_greedy_1001.cpp | gavincangan/hacker-rank | 340ec43af1850e9400360b1b985d70599d048c7d | [
"Unlicense"
] | null | null | null | /*
You will be given a list of integers, arr, and a single integer . You must create an array of length from elements of such that its unfairness is minimized. Call that array . Unfairness of an array is calculated as
Where:
- max denotes the largest integer in arr
- min denotes the smallest integer in arr
Testing fo... | 21.986486 | 214 | 0.58697 | [
"vector"
] |
facf3fe5174f7a8be48c01a4d96eb0c7766c976e | 87,552 | cpp | C++ | Blizzlike/ArcEmu/C++/World/AchievementMgr.cpp | 499453466/Lua-Other | 43fd2b72405faf3f2074fd2a2706ef115d16faa6 | [
"Unlicense"
] | 2 | 2015-06-23T16:26:32.000Z | 2019-06-27T07:45:59.000Z | Blizzlike/ArcEmu/C++/World/AchievementMgr.cpp | Eduardo-Silla/Lua-Other | db610f946dbcaf81b3de9801f758e11a7bf2753f | [
"Unlicense"
] | null | null | null | Blizzlike/ArcEmu/C++/World/AchievementMgr.cpp | Eduardo-Silla/Lua-Other | db610f946dbcaf81b3de9801f758e11a7bf2753f | [
"Unlicense"
] | 3 | 2015-01-10T18:22:59.000Z | 2021-04-27T21:28:28.000Z | /*
* ArcEmu MMORPG Server
* Copyright (C) 2005-2007 Ascent Team <http://www.ascentemu.com/>
* Copyright (C) 2008-2011 <http://www.ArcEmu.org/>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software... | 38.501319 | 184 | 0.69176 | [
"object"
] |
fad4c9bbc63fc67d3dcb07cc2da46d0fb94e10b7 | 3,374 | cpp | C++ | src/plugins/monocle/docinfodialog.cpp | MellonQ/leechcraft | 71cbb238d2dade56b3865278a6a8e6a58c217fc5 | [
"BSL-1.0"
] | 1 | 2017-01-12T07:05:45.000Z | 2017-01-12T07:05:45.000Z | src/plugins/monocle/docinfodialog.cpp | MellonQ/leechcraft | 71cbb238d2dade56b3865278a6a8e6a58c217fc5 | [
"BSL-1.0"
] | null | null | null | src/plugins/monocle/docinfodialog.cpp | MellonQ/leechcraft | 71cbb238d2dade56b3865278a6a8e6a58c217fc5 | [
"BSL-1.0"
] | null | null | null | /**********************************************************************
* LeechCraft - modular cross-platform feature rich internet client.
* Copyright (C) 2006-2014 Georg Rudoy
*
* Boost Software License - Version 1.0 - August 17th, 2003
*
* Permission is hereby granted, free of charge, to any person or organiz... | 35.893617 | 98 | 0.691168 | [
"object"
] |
fadafa03a9610255b6bee387da8725b80aff7fb0 | 29,758 | cpp | C++ | src/messaging/boundobject.cpp | yumilceh/libqi | f094bcad506bcfd5a8dcfa7688cbcce864b0765b | [
"BSD-3-Clause"
] | null | null | null | src/messaging/boundobject.cpp | yumilceh/libqi | f094bcad506bcfd5a8dcfa7688cbcce864b0765b | [
"BSD-3-Clause"
] | null | null | null | src/messaging/boundobject.cpp | yumilceh/libqi | f094bcad506bcfd5a8dcfa7688cbcce864b0765b | [
"BSD-3-Clause"
] | null | null | null | /*
** Copyright (C) 2012 Aldebaran Robotics
** See COPYING for the license
*/
#include <boost/make_shared.hpp>
#include <qi/anyobject.hpp>
#include <qi/type/objecttypebuilder.hpp>
#include "boundobject.hpp"
qiLogCategory("qimessaging.boundobject");
const auto invalidValueError = "The value is invalid.";
namespac... | 39.310436 | 189 | 0.61318 | [
"object",
"vector"
] |
faf1116aa6a8224e9585ada58b31e8032320d189 | 1,396 | hpp | C++ | include/Furniture.hpp | mikaelmello/story-based-rpg | bc73c24ad0e41512c3e980ca3aad0fc5738af2f2 | [
"Zlib"
] | null | null | null | include/Furniture.hpp | mikaelmello/story-based-rpg | bc73c24ad0e41512c3e980ca3aad0fc5738af2f2 | [
"Zlib"
] | null | null | null | include/Furniture.hpp | mikaelmello/story-based-rpg | bc73c24ad0e41512c3e980ca3aad0fc5738af2f2 | [
"Zlib"
] | null | null | null | #ifndef FURNITURE_H
#define FURNITURE_H
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* INCLUDES E DEFINES
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
#include <memory>
#include <string>
#include "Component.hpp"
#include "GameObj... | 21.476923 | 80 | 0.619628 | [
"render",
"vector"
] |
faf55f77dbe2100e71a268d22ffbb0c3adaae800 | 4,728 | cpp | C++ | 07.cpp | gabrielivascu/AoC2019 | 59bc479d23da240e74038fc4e866df98188a9b79 | [
"MIT"
] | null | null | null | 07.cpp | gabrielivascu/AoC2019 | 59bc479d23da240e74038fc4e866df98188a9b79 | [
"MIT"
] | null | null | null | 07.cpp | gabrielivascu/AoC2019 | 59bc479d23da240e74038fc4e866df98188a9b79 | [
"MIT"
] | null | null | null | #include "aoc.h"
static void parse_op(int64_t input, int64_t& opcode, int64_t& step, std::vector<int64_t>& param_modes)
{
param_modes.clear();
opcode = input % 100;
switch (opcode) {
case 1: // add
case 2: // multiply
case 7: // less-than
case 8: // equals
if (input > 99) param_mod... | 32.606897 | 112 | 0.477792 | [
"vector"
] |
faf9b502b97141c9ebde11f918297d053e733c61 | 2,484 | cpp | C++ | voice/include/util/Samp.cpp | NixonSiagian/samp-client | 7a10dfeddc806e199688c645b12f3bf37eaa4f61 | [
"FSFAP"
] | null | null | null | voice/include/util/Samp.cpp | NixonSiagian/samp-client | 7a10dfeddc806e199688c645b12f3bf37eaa4f61 | [
"FSFAP"
] | null | null | null | voice/include/util/Samp.cpp | NixonSiagian/samp-client | 7a10dfeddc806e199688c645b12f3bf37eaa4f61 | [
"FSFAP"
] | null | null | null | #include "main.h"
#include "Samp.h"
bool Samp::Init() noexcept
{
if(Samp::initStatus)
return false;
LogVoice("[dbg:samp:init] : module initializing...");
Samp::loadCallbacks.clear();
Samp::exitCallbacks.clear();
Samp::loadStatus = false;
LogVoice("[dbg:samp:init] : module initializ... | 21.050847 | 66 | 0.619163 | [
"vector"
] |
fafb214cc7fa2a8187005d99c34409c640097048 | 5,119 | hxx | C++ | sip/base/Builder.hxx | icahoon/vocal | f2c67ec0561d7de764420e81793afde5ce81e965 | [
"VSL-1.0"
] | 5 | 2017-10-09T11:47:47.000Z | 2022-02-28T01:37:15.000Z | sip/base/Builder.hxx | greearb/vocal-ct | 35abdcd8732ce3a3bc936b523c895b0d5239c3b6 | [
"VSL-1.0"
] | null | null | null | sip/base/Builder.hxx | greearb/vocal-ct | 35abdcd8732ce3a3bc936b523c895b0d5239c3b6 | [
"VSL-1.0"
] | null | null | null | #ifndef BUILDER_HXX
#define BUILDER_HXX
/* ====================================================================
* The Vovida Software License, Version 1.0
*
* Copyright (c) 2000 Vovida Networks, Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, a... | 26.801047 | 76 | 0.672397 | [
"object"
] |
4f06ead17ee5d94ed171e7af93aab1d9afe96e89 | 405 | cpp | C++ | ARC/117/B/Main.cpp | okamoto2997/ProgrammingContest | b7b527e797d61f8fdceca5452c2e0966b7048db1 | [
"BSD-2-Clause"
] | null | null | null | ARC/117/B/Main.cpp | okamoto2997/ProgrammingContest | b7b527e797d61f8fdceca5452c2e0966b7048db1 | [
"BSD-2-Clause"
] | null | null | null | ARC/117/B/Main.cpp | okamoto2997/ProgrammingContest | b7b527e797d61f8fdceca5452c2e0966b7048db1 | [
"BSD-2-Clause"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
constexpr uint64_t MOD = 1000000007;
int main(){
int N;
cin >> N;
vector<int> A(N);
for (auto& a : A) cin >> a;
sort(A.begin(), A.end());
int current_step = 0;
uint64_t ret = 1;
for (auto a : A){
ret = ret * (a - cur... | 16.2 | 45 | 0.580247 | [
"vector"
] |
4f0de248fb6e597ac5d5a6309d20b33fe8631d52 | 1,442 | cpp | C++ | thirdparty/cpp/frc/ctrlsys/Output.cpp | Team3512/Robot-2017 | 1e5f3c1dcd78464d0c967aa17ca0e479775f7ed3 | [
"BSD-3-Clause"
] | null | null | null | thirdparty/cpp/frc/ctrlsys/Output.cpp | Team3512/Robot-2017 | 1e5f3c1dcd78464d0c967aa17ca0e479775f7ed3 | [
"BSD-3-Clause"
] | null | null | null | thirdparty/cpp/frc/ctrlsys/Output.cpp | Team3512/Robot-2017 | 1e5f3c1dcd78464d0c967aa17ca0e479775f7ed3 | [
"BSD-3-Clause"
] | 2 | 2018-04-07T23:39:43.000Z | 2018-05-08T00:43:07.000Z | // Copyright (c) 2017-2019 FRC Team 3512. All Rights Reserved.
#include "frc/ctrlsys/Output.h"
#include "frc/DriverStation.h"
using namespace frc;
/**
* Calls PIDWrite() on the output at a regular interval.
*
* @param input the node that is used to get values
* @param output the PIDOutput object that is set to ... | 22.53125 | 71 | 0.67337 | [
"object"
] |
4f0f84402481980a8a8f7658be25db5e82477ded | 5,634 | cpp | C++ | vm/profiler.cpp | deepakec/rubinius | 5ebbdf3d9a4e258204e0d21f00500de4f3fb6085 | [
"BSD-3-Clause"
] | 1 | 2016-05-08T21:05:11.000Z | 2016-05-08T21:05:11.000Z | vm/profiler.cpp | Winstonwzl/rubinius | 578033a43c4530ae2a1f00d51ef99d156fe3c846 | [
"BSD-3-Clause"
] | null | null | null | vm/profiler.cpp | Winstonwzl/rubinius | 578033a43c4530ae2a1f00d51ef99d156fe3c846 | [
"BSD-3-Clause"
] | null | null | null | #include "vm/profiler.hpp"
#include "vm/object_utils.hpp"
#include "vm/vm.hpp"
#include "builtin/symbol.hpp"
#include "detection.hpp"
// HACK figure out a better way to detect if we should use
// mach_absolute_time
#if defined(OS_X_ANCIENT) || \
defined(__ENVIRONMENT_MAC_OS_X_VERSION_MIN_REQUIRED__) && \
__ENVI... | 22.626506 | 80 | 0.548811 | [
"object",
"vector"
] |
4f126d724182e8fcb4562d2136dbc21a1c73d981 | 2,484 | cpp | C++ | native/test.cpp | kkennis/hufter | c548d12628612b038dcde91ae81b6ce7754380af | [
"MIT"
] | 7 | 2015-10-27T19:05:45.000Z | 2020-04-16T21:37:47.000Z | native/wrapper.cpp | kkennis/hufter | c548d12628612b038dcde91ae81b6ce7754380af | [
"MIT"
] | null | null | null | native/wrapper.cpp | kkennis/hufter | c548d12628612b038dcde91ae81b6ce7754380af | [
"MIT"
] | 6 | 2015-10-27T19:05:25.000Z | 2019-11-30T15:48:52.000Z | #include <iostream>
#include <string>
#include <vector>
#include "json/json-forwards.h"
#include "json/json.h"
#include "jsoncpp.cpp"
#include "algo.cpp"
using namespace std;
// Algo contract:
// Input: vector of struct with int timestamp and double price
// Output: two-element array (buy and sell signals) of
// vecto... | 29.571429 | 91 | 0.637681 | [
"vector"
] |
4f1540269677c065676db3754dcb293e2cc8bf8c | 2,251 | cc | C++ | src/extract_laser_line.cc | songyuncen/laser-triangulation | 228feda5497533ceac5e433e753f81ff1db38e20 | [
"MIT"
] | 7 | 2021-09-07T08:16:03.000Z | 2022-03-16T05:59:16.000Z | src/extract_laser_line.cc | songyuncen/laser-triangulation | 228feda5497533ceac5e433e753f81ff1db38e20 | [
"MIT"
] | null | null | null | src/extract_laser_line.cc | songyuncen/laser-triangulation | 228feda5497533ceac5e433e753f81ff1db38e20 | [
"MIT"
] | 2 | 2021-09-24T06:08:48.000Z | 2021-12-03T02:48:32.000Z | #include "laser_triangulation.h"
const double kSigma = 1.0;
const int kMinInterval = 1;
static cv::Mat getCannyFilter(double sigma);
void ExtractLaserLine(cv::Mat &image, int threshold, std::vector<cv::Point> &points) {
points.clear();
cv::Mat eye = cv::Mat::eye(1, 1, CV_64FC1);
// smooth with gaussian
int ... | 26.482353 | 86 | 0.556197 | [
"vector"
] |
4f155394f0bf98a6f37a377e3fff74c11ce76cae | 4,996 | cpp | C++ | MPI/MPI_Pagerank/parallel-bgl-0.7.0/libs/graph_parallel/test/distributed_rmat_cc.cpp | felidsche/BigDataBench_V5.0_BigData_ComponentBenchmark | c65c3df033b84dfb6d229f74e564d69cfe624556 | [
"Apache-2.0"
] | 2 | 2022-01-06T12:15:55.000Z | 2022-03-29T01:31:05.000Z | MPI/MPI_Pagerank/parallel-bgl-0.7.0/libs/graph_parallel/test/distributed_rmat_cc.cpp | felidsche/BigDataBench_V5.0_BigData_ComponentBenchmark | c65c3df033b84dfb6d229f74e564d69cfe624556 | [
"Apache-2.0"
] | null | null | null | MPI/MPI_Pagerank/parallel-bgl-0.7.0/libs/graph_parallel/test/distributed_rmat_cc.cpp | felidsche/BigDataBench_V5.0_BigData_ComponentBenchmark | c65c3df033b84dfb6d229f74e564d69cfe624556 | [
"Apache-2.0"
] | 1 | 2021-12-20T02:35:08.000Z | 2021-12-20T02:35:08.000Z | #include <boost/graph/use_mpi.hpp>
#include <boost/config.hpp>
#include <boost/throw_exception.hpp>
#include <boost/graph/distributed/adjacency_list.hpp>
#include <boost/property_map/parallel/distributed_property_map.hpp>
#include <boost/graph/distributed/mpi_process_group.hpp>
#include <boost/graph/distributed/concept... | 31.225 | 155 | 0.676341 | [
"object",
"vector"
] |
4f18a79312843d81b468e6cfe92a08676eabf7ae | 1,614 | hpp | C++ | search/v2/house_numbers_matcher.hpp | benwixen/tripfinger-ios | bbca1c83269a7015100d43997569b543025a4087 | [
"Apache-2.0"
] | null | null | null | search/v2/house_numbers_matcher.hpp | benwixen/tripfinger-ios | bbca1c83269a7015100d43997569b543025a4087 | [
"Apache-2.0"
] | 13 | 2015-09-28T13:59:23.000Z | 2015-10-08T20:12:45.000Z | search/v2/house_numbers_matcher.hpp | prebenl/tripfinger | bbca1c83269a7015100d43997569b543025a4087 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "base/string_utils.hpp"
#include "std/string.hpp"
#include "std/vector.hpp"
namespace search
{
namespace v2
{
// This class splits a string representing a house number to groups of
// symbols from the same class (separators, digits or other symbols,
// hope, letters).
class HouseNumberTokenizer... | 29.345455 | 97 | 0.725527 | [
"vector"
] |
b7b7140ecc150e0807e52c31c080aeea1ccf4eca | 1,152 | cpp | C++ | devdc13.cpp | vidit1999/coding_problems | b6c9fa7fda37d9424cd11bcd54b385fd8cf1ee0a | [
"BSD-2-Clause"
] | 1 | 2020-02-24T18:28:48.000Z | 2020-02-24T18:28:48.000Z | devdc13.cpp | vidit1999/coding_problems | b6c9fa7fda37d9424cd11bcd54b385fd8cf1ee0a | [
"BSD-2-Clause"
] | null | null | null | devdc13.cpp | vidit1999/coding_problems | b6c9fa7fda37d9424cd11bcd54b385fd8cf1ee0a | [
"BSD-2-Clause"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
/*
Consider a sequence u, where u is defined as follows:
The number u(0) = 1 is the first one in u.
For each x in u, y = 2 * x + 1 and z = 3 * x + 1 must also be in u.
There are no other numbers in u.
Ex: u = [1, 3, 4, 7, 9, 10, 13, 15, 19, 21, 22, 27, ...]
1 gives 3 and... | 27.428571 | 107 | 0.586806 | [
"vector"
] |
b7bf28b6796226b08d453aa6210ef34a6c6e1332 | 1,802 | cpp | C++ | PA/Laborator/2018-2019/lab02 - Greedy/skel-lab02/cpp/task-3/main.cpp | mihai-constantin/ACS | 098c99d82dad8fb5d0e909da930c72f1185a99e2 | [
"Apache-2.0"
] | null | null | null | PA/Laborator/2018-2019/lab02 - Greedy/skel-lab02/cpp/task-3/main.cpp | mihai-constantin/ACS | 098c99d82dad8fb5d0e909da930c72f1185a99e2 | [
"Apache-2.0"
] | null | null | null | PA/Laborator/2018-2019/lab02 - Greedy/skel-lab02/cpp/task-3/main.cpp | mihai-constantin/ACS | 098c99d82dad8fb5d0e909da930c72f1185a99e2 | [
"Apache-2.0"
] | null | null | null | #include <fstream>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
struct Homework {
int deadline;
int score;
Homework(int _deadline, int _score) : deadline(_deadline), score(_score) {}
};
bool cmp(Homework hw1, Homework hw2) {
if(hw1.deadline == hw2.deadline){
return hw1.score ... | 17.666667 | 76 | 0.559933 | [
"vector"
] |
b7c052ad46a74341871ff8cfce2148d190c76020 | 21,634 | cpp | C++ | src/main.cpp | ryanmart00/BlackHole | 8a63b8a67c1d6c4bb78166d360a091b4f1ae59fb | [
"MIT"
] | null | null | null | src/main.cpp | ryanmart00/BlackHole | 8a63b8a67c1d6c4bb78166d360a091b4f1ae59fb | [
"MIT"
] | null | null | null | src/main.cpp | ryanmart00/BlackHole | 8a63b8a67c1d6c4bb78166d360a091b4f1ae59fb | [
"MIT"
] | null | null | null | #include "glm/common.hpp"
#include "glm/gtx/quaternion.hpp"
#include <limits>
#include <string>
#include <ft2build.h>
#include FT_FREETYPE_H
#include <freetype/config/ftheader.h>
#include "glm/exponential.hpp"
#include "glm/ext/matrix_transform.hpp"
#include "glm/ext/quaternion_geometric.hpp"
#include "glm/ext/quaterni... | 31.955687 | 94 | 0.538227 | [
"object",
"vector"
] |
b7cdfd35f29ad82ceead01de696bc9c9c26d6ffd | 22,787 | cc | C++ | video/encoder_bitrate_adjuster_unittest.cc | gaoxiaoyang/webrtc | 21021f022be36f5d04f8a3a309e345f65c8603a9 | [
"BSD-3-Clause"
] | 305 | 2020-03-31T14:12:50.000Z | 2022-03-19T16:45:49.000Z | video/encoder_bitrate_adjuster_unittest.cc | gaoxiaoyang/webrtc | 21021f022be36f5d04f8a3a309e345f65c8603a9 | [
"BSD-3-Clause"
] | 51 | 2019-10-19T04:58:30.000Z | 2022-01-03T07:16:46.000Z | video/encoder_bitrate_adjuster_unittest.cc | gaoxiaoyang/webrtc | 21021f022be36f5d04f8a3a309e345f65c8603a9 | [
"BSD-3-Clause"
] | 122 | 2020-04-17T11:38:56.000Z | 2022-03-25T15:48:42.000Z | /*
* Copyright (c) 2019 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contribut... | 42.913371 | 80 | 0.702813 | [
"vector"
] |
b7d0ad80307a154f86df0f2a897fa29b7860a6bd | 4,618 | hpp | C++ | compendium/CM/include/cppmicroservices/cm/ConfigurationListener.hpp | fmilano/CppMicroServices | b7e79edb558a63e45f6788e4a8b4e787cf956689 | [
"Apache-2.0"
] | 588 | 2015-10-07T15:55:08.000Z | 2022-03-29T00:35:44.000Z | compendium/CM/include/cppmicroservices/cm/ConfigurationListener.hpp | fmilano/CppMicroServices | b7e79edb558a63e45f6788e4a8b4e787cf956689 | [
"Apache-2.0"
] | 459 | 2015-10-05T23:29:59.000Z | 2022-03-29T14:13:37.000Z | compendium/CM/include/cppmicroservices/cm/ConfigurationListener.hpp | fmilano/CppMicroServices | b7e79edb558a63e45f6788e4a8b4e787cf956689 | [
"Apache-2.0"
] | 218 | 2015-11-04T08:19:48.000Z | 2022-03-24T02:17:08.000Z | /*=============================================================================
Library: CppMicroServices
Copyright (c) The CppMicroServices developers. See the COPYRIGHT
file at the top-level directory of this distribution and at
https://github.com/CppMicroServices/CppMicroServices/COPYRIGHT .
Licensed under t... | 34.207407 | 101 | 0.730186 | [
"object"
] |
b7d1a23d532e15984a72c13d3e1fd6b4c5f2fa90 | 3,771 | cpp | C++ | src/snapshot/SnapshotRegistry.cpp | n-krueger/faabric | c95c3baf9406613629e5f382efc0fc8366b22752 | [
"Apache-2.0"
] | null | null | null | src/snapshot/SnapshotRegistry.cpp | n-krueger/faabric | c95c3baf9406613629e5f382efc0fc8366b22752 | [
"Apache-2.0"
] | null | null | null | src/snapshot/SnapshotRegistry.cpp | n-krueger/faabric | c95c3baf9406613629e5f382efc0fc8366b22752 | [
"Apache-2.0"
] | null | null | null | #include <faabric/snapshot/SnapshotRegistry.h>
#include <faabric/util/func.h>
#include <faabric/util/locks.h>
#include <faabric/util/logging.h>
#include <faabric/util/memory.h>
#include <sys/mman.h>
namespace faabric::snapshot {
SnapshotRegistry::SnapshotRegistry() {}
faabric::util::SnapshotData& SnapshotRegistry::g... | 27.727941 | 80 | 0.639883 | [
"object"
] |
b7d1ca2e014ab12287fce670c938f15995944b08 | 1,686 | cpp | C++ | CodeChef/MARRAYS/sol3 copy.cpp | raghavdubey/CP-Guide | 57458ed3ec5339defa2796ce0be2da707f66c1ec | [
"MIT"
] | 3 | 2017-10-09T08:50:54.000Z | 2017-11-01T02:28:15.000Z | CodeChef/MARRAYS/sol3 copy.cpp | raghavdubey/CP-Guide | 57458ed3ec5339defa2796ce0be2da707f66c1ec | [
"MIT"
] | 7 | 2017-10-09T08:39:06.000Z | 2017-10-20T22:25:00.000Z | CodeChef/MARRAYS/sol3 copy.cpp | raghavdubey/CP-Guide | 57458ed3ec5339defa2796ce0be2da707f66c1ec | [
"MIT"
] | 8 | 2017-10-09T08:51:44.000Z | 2018-10-01T11:01:07.000Z | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define pb push_back
#define mp make_pair
#define int long long
int MAX = 1000000;
vector<int> arr[1000011];
vector<lli> arr2[10000011];
int g(int n, int j){
if(j==0)
return arr[n].size()-1;
return j-1;
}
int32_t main(){
... | 21.341772 | 84 | 0.383749 | [
"vector"
] |
b7d61fda67e3b461c03f06c211abe9e270817786 | 718 | cpp | C++ | src/histogram.cpp | fritzo/kazoo | 7281fe382b98ec81a0e223bfc76c49749543afdb | [
"MIT"
] | 3 | 2015-04-29T11:38:29.000Z | 2018-08-31T01:32:13.000Z | src/histogram.cpp | fritzo/kazoo | 7281fe382b98ec81a0e223bfc76c49749543afdb | [
"MIT"
] | null | null | null | src/histogram.cpp | fritzo/kazoo | 7281fe382b98ec81a0e223bfc76c49749543afdb | [
"MIT"
] | null | null | null |
#include "histogram.h"
#include <vector>
#include <algorithm>
void Histogram::normalize ()
{
double total = 0;
for (Bins::const_iterator i = begin(), I = end(); i != I; ++i) {
total += i->second;
}
ASSERT_LT(0, total);
const double scale = 1.0 / total;
for (Bins::iterator i = m_bins.begin(), I = m_bi... | 22.4375 | 74 | 0.541783 | [
"vector"
] |
b7de4611f924ea51891cf1df776aa4fa1884d6f2 | 5,964 | cpp | C++ | jam/src/core/filesystem.cpp | gzito/jamengine | 451ab1e1d74231a3239a56aed4c40dc445fa6db8 | [
"MIT"
] | null | null | null | jam/src/core/filesystem.cpp | gzito/jamengine | 451ab1e1d74231a3239a56aed4c40dc445fa6db8 | [
"MIT"
] | null | null | null | jam/src/core/filesystem.cpp | gzito/jamengine | 451ab1e1d74231a3239a56aed4c40dc445fa6db8 | [
"MIT"
] | null | null | null | /**********************************************************************************
*
* filesystem.cpp
*
* This file is part of Jam
*
* Copyright (c) 2014-2019 Giovanni Zito.
* Copyright (c) 2014-2019 Jam contributors (cf. AUTHORS.md)
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
... | 23.951807 | 140 | 0.641348 | [
"vector"
] |
b7e508d12756343c136755a0d0a90f267f4afb5b | 5,788 | cpp | C++ | modules/vf_unfinished/graphics/vf_LayerGraphics.cpp | jrlanglois/VFLib | 95c662c435d6e6df1b2ebca4cdcdc3e84bc69e2b | [
"MIT"
] | 27 | 2015-05-07T02:10:39.000Z | 2021-06-22T14:52:50.000Z | modules/vf_unfinished/graphics/vf_LayerGraphics.cpp | jrlanglois/VFLib | 95c662c435d6e6df1b2ebca4cdcdc3e84bc69e2b | [
"MIT"
] | null | null | null | modules/vf_unfinished/graphics/vf_LayerGraphics.cpp | jrlanglois/VFLib | 95c662c435d6e6df1b2ebca4cdcdc3e84bc69e2b | [
"MIT"
] | 14 | 2015-09-12T12:00:22.000Z | 2022-03-08T22:24:24.000Z | /*============================================================================*/
/*
VFLib: https://github.com/vinniefalco/VFLib
Copyright (C) 2008 by Vinnie Falco <vinnie.falco@gmail.com>
This library contains portions of other open source products covered by
separate licenses. Please see the corresponding so... | 33.264368 | 94 | 0.662405 | [
"transform"
] |
b7e94cc1c79a0c7cd3ba3d841bd4e9206ff93bdb | 972 | hpp | C++ | headers/ImageProcessor.hpp | Muhammad-Magdi/image-processing | f7a817ce9ed4ef1cf08041c6fa7fcda69d8bc040 | [
"MIT"
] | 1 | 2019-07-22T13:26:08.000Z | 2019-07-22T13:26:08.000Z | headers/ImageProcessor.hpp | Muhammad-Magdi/image-processing | f7a817ce9ed4ef1cf08041c6fa7fcda69d8bc040 | [
"MIT"
] | null | null | null | headers/ImageProcessor.hpp | Muhammad-Magdi/image-processing | f7a817ce9ed4ef1cf08041c6fa7fcda69d8bc040 | [
"MIT"
] | null | null | null | #ifndef IMAGE_PROCESSOR_H
#define IMAGE_PROCESSOR_H
#include "bitmap_image.hpp"
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/*
Gray-Scaled images.
*/
#define Image bitmap_image
typedef unsigned int u_int32;
class ImageProcessor {
public:
struct Pair {
Pair() { }
... | 20.680851 | 89 | 0.644033 | [
"vector"
] |
b7f0e2a3f2eb6bc64e59c95257e1426b5e05a17a | 451 | cpp | C++ | test/SceneManagerTest.cpp | kbladin/creature_evolution | 39600f0783ddd2f1c8d4e85283bcddbfc8e7435c | [
"MIT"
] | 4 | 2016-09-20T23:29:10.000Z | 2020-12-30T17:33:30.000Z | test/SceneManagerTest.cpp | kbladin/creature_evolution | 39600f0783ddd2f1c8d4e85283bcddbfc8e7435c | [
"MIT"
] | null | null | null | test/SceneManagerTest.cpp | kbladin/creature_evolution | 39600f0783ddd2f1c8d4e85283bcddbfc8e7435c | [
"MIT"
] | 2 | 2015-05-26T11:28:24.000Z | 2019-03-27T16:02:07.000Z | #include <iostream>
#include <vector>
#include "gtest/gtest.h"
#include "SceneManager.h"
class SceneManagerTest : public ::testing::Test {
protected:
SceneManagerTest() {
//scene = new SceneManager(NULL);
}
virtual ~SceneManagerTest() {
//delete scene;
}
virtual void SetUp() {
}
virtual void TearDown()... | 15.033333 | 49 | 0.691796 | [
"vector"
] |
b7f633aed56f3c22c7f003b456721472ae01f640 | 7,607 | cpp | C++ | tests/string_format_tests.cpp | sandym/sutils | adf94578d48d1066f8b8177fcb20086efc9be962 | [
"MIT"
] | null | null | null | tests/string_format_tests.cpp | sandym/sutils | adf94578d48d1066f8b8177fcb20086efc9be962 | [
"MIT"
] | null | null | null | tests/string_format_tests.cpp | sandym/sutils | adf94578d48d1066f8b8177fcb20086efc9be962 | [
"MIT"
] | null | null | null | /*
* string_format_tests.cpp
* sutils_tests
*
* Created by Sandy Martel on 2008/05/30.
* Copyright 2015 Sandy Martel. All rights reserved.
*
* quick reference:
*
* TEST_ASSERT( condition )
* Assertions that a condition is true.
*
* TEST_ASSERT_EQUAL( expected, actual )
* As... | 28.070111 | 96 | 0.580781 | [
"3d"
] |
b7fa299d6a46049b8325014c9f48292192f44606 | 488,470 | cpp | C++ | libs/json/jsonparse.cpp | gknowles/dimapp | daadd9afe5fb1a6f716c431411e20c48ca180f9f | [
"BSL-1.0"
] | 1 | 2016-07-20T18:43:34.000Z | 2016-07-20T18:43:34.000Z | libs/json/jsonparse.cpp | gknowles/dimapp | daadd9afe5fb1a6f716c431411e20c48ca180f9f | [
"BSL-1.0"
] | 4 | 2016-08-30T05:29:18.000Z | 2016-11-07T04:02:15.000Z | libs/json/jsonparse.cpp | gknowles/dimapp | daadd9afe5fb1a6f716c431411e20c48ca180f9f | [
"BSL-1.0"
] | 1 | 2017-10-20T22:31:17.000Z | 2017-10-20T22:31:17.000Z | // jsonparse.cpp
// Generated by pargen 2.1.3 at 2018-05-07T11:55:14-0700
// clang-format off
#include "pch.h"
#pragma hdrstop
using namespace Dim::Detail;
/****************************************************************************
*
* JsonParser
*
* Normalized ABNF of syntax:
* %root = JSON-text
* CR = %x... | 35.205045 | 78 | 0.521316 | [
"object"
] |
b7fe2cb9b7620004ad677f587e21d36d444c4bdd | 1,360 | cpp | C++ | HackerRank Solutions/Algorithms/Greedy/Cutting Boards.cpp | UtkarshPathrabe/Competitive-Coding | ba322fbb1b88682d56a9b80bdd92a853f1caa84e | [
"MIT"
] | 13 | 2021-09-02T07:30:02.000Z | 2022-03-22T19:32:03.000Z | HackerRank Solutions/Algorithms/Greedy/Cutting Boards.cpp | UtkarshPathrabe/Competitive-Coding | ba322fbb1b88682d56a9b80bdd92a853f1caa84e | [
"MIT"
] | null | null | null | HackerRank Solutions/Algorithms/Greedy/Cutting Boards.cpp | UtkarshPathrabe/Competitive-Coding | ba322fbb1b88682d56a9b80bdd92a853f1caa84e | [
"MIT"
] | 3 | 2021-08-24T16:06:22.000Z | 2021-09-17T15:39:53.000Z | #include <bits/stdc++.h>
using namespace std;
bool myComparatorX (const pair<unsigned long long int, int> &x, const pair<unsigned long long int, int> &y) {
if (x.first == y.first)
return x.second < y.second;
else
return x.first > y.first;
}
bool myComparatorY (const pair<unsigned long long int, int> &x, const ... | 25.660377 | 109 | 0.595588 | [
"vector"
] |
b7ff059dd6d457144c5f642e94e75da609073c17 | 2,651 | cc | C++ | sdk/src/RequestMetaData.cc | aliyun/aliyun-pds-cpp-sdk-wrapper | 2029adae2c7e385d4e17389fd0a0ed8b003cd4aa | [
"Apache-2.0"
] | 2 | 2021-11-01T14:34:43.000Z | 2021-11-02T03:15:37.000Z | sdk/src/RequestMetaData.cc | aliyun/aliyun-pds-cpp-sdk-wrapper | 2029adae2c7e385d4e17389fd0a0ed8b003cd4aa | [
"Apache-2.0"
] | null | null | null | sdk/src/RequestMetaData.cc | aliyun/aliyun-pds-cpp-sdk-wrapper | 2029adae2c7e385d4e17389fd0a0ed8b003cd4aa | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2009-2021 Alibaba Cloud 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... | 32.728395 | 76 | 0.715579 | [
"model"
] |
4d0234c8585bdb046bebc60e25981de7cc0058f4 | 870 | cc | C++ | poj/2/2480.cc | eagletmt/procon | adbe503eb3c1bbcc1538b2ee8988aa353937e8d4 | [
"MIT"
] | 1 | 2015-04-17T09:54:23.000Z | 2015-04-17T09:54:23.000Z | poj/2/2480.cc | eagletmt/procon | adbe503eb3c1bbcc1538b2ee8988aa353937e8d4 | [
"MIT"
] | null | null | null | poj/2/2480.cc | eagletmt/procon | adbe503eb3c1bbcc1538b2ee8988aa353937e8d4 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <vector>
using namespace std;
long long phi(long long n)
{
long long ans = n;
for (long long i = 2LL; i*i <= n; i++) {
if (n % i == 0LL) {
ans -= ans / i;
while (n % i == 0LL) {
n /= i;
}
}
}
if (n > 1) {
ans -= ans / n;
}
return ans;
}
vect... | 18.125 | 83 | 0.473563 | [
"vector"
] |
4d026570aa64c78259911fcf431c3ffeece9a567 | 762 | hpp | C++ | Includes/baba-is-auto/baba-is-auto.hpp | siva-msft/baba-is-auto | 3237b5b70167130558827979bde7dcee14ef39f3 | [
"MIT"
] | 108 | 2019-09-11T06:31:35.000Z | 2022-03-28T13:02:56.000Z | Includes/baba-is-auto/baba-is-auto.hpp | siva-msft/baba-is-auto | 3237b5b70167130558827979bde7dcee14ef39f3 | [
"MIT"
] | 29 | 2019-09-12T00:28:04.000Z | 2022-02-20T14:56:27.000Z | Includes/baba-is-auto/baba-is-auto.hpp | utilForever/BabaIsAuto | fb444668914eb70c0a35197399d650d293b4b95f | [
"MIT"
] | 14 | 2020-02-24T05:41:43.000Z | 2022-03-28T12:43:34.000Z | // Copyright (c) 2020 Chris Ohk
// I am making my contributions/submissions to this project solely in our
// personal capacity and am not conveying any rights to any intellectual
// property of any third parties.
#ifndef BABA_IS_AUTO_HPP
#define BABA_IS_AUTO_HPP
#include <baba-is-auto/Agents/IAgent.hpp>
#include <ba... | 33.130435 | 73 | 0.769029 | [
"object"
] |
4d071c3fbd9f52db45b0700e809642537bfb8b09 | 3,364 | cpp | C++ | src/luaexport/EntitySystem.cpp | Oberon00/jd | 0724e059cfa56615afb0a50c27ce9885faa54ed6 | [
"BSD-2-Clause"
] | 1 | 2015-10-10T14:05:56.000Z | 2015-10-10T14:05:56.000Z | src/luaexport/EntitySystem.cpp | Oberon00/jd | 0724e059cfa56615afb0a50c27ce9885faa54ed6 | [
"BSD-2-Clause"
] | null | null | null | src/luaexport/EntitySystem.cpp | Oberon00/jd | 0724e059cfa56615afb0a50c27ce9885faa54ed6 | [
"BSD-2-Clause"
] | null | null | null | // Part of the Jade Engine -- Copyright (c) Christian Neumüller 2012--2013
// This file is subject to the terms of the BSD 2-Clause License.
// See LICENSE.txt or http://opensource.org/licenses/BSD-2-Clause
#include "compsys/Component.hpp"
#include "compsys/ComponentRegistry.hpp"
#include "compsys/Entity.hpp"
#include... | 32.038095 | 93 | 0.62396 | [
"object",
"vector"
] |
4d085326ecea04c766db9c4f4de753603cebca19 | 6,277 | cpp | C++ | flir_lepton_image_processing/src/processing_node/thermal_roi_detector.cpp | angetria/flir_lepton_rpi2 | 46b1de815e2bfb752954fb2c3648d416f56e6c93 | [
"BSD-3-Clause"
] | 15 | 2015-11-10T10:39:53.000Z | 2022-03-29T07:07:53.000Z | flir_lepton_image_processing/src/processing_node/thermal_roi_detector.cpp | angetria/flir_lepton | 46b1de815e2bfb752954fb2c3648d416f56e6c93 | [
"BSD-3-Clause"
] | 6 | 2015-10-23T12:18:45.000Z | 2019-07-02T09:55:46.000Z | flir_lepton_image_processing/src/processing_node/thermal_roi_detector.cpp | angetria/flir_lepton_rpi2 | 46b1de815e2bfb752954fb2c3648d416f56e6c93 | [
"BSD-3-Clause"
] | 6 | 2017-04-13T12:28:38.000Z | 2019-07-03T21:58:51.000Z | /*********************************************************************
*
* Software License Agreement (BSD License)
*
* Copyright (c) 2015, P.A.N.D.O.R.A. Team.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the follo... | 34.300546 | 77 | 0.655727 | [
"vector"
] |
4d08b07eb312e306e770f2a5d8eb408389e396f2 | 2,175 | cpp | C++ | hw2/q1/Trip.cpp | BenEf97/BarBenCPP | 556eebfeeadd210cc9552915d58c274b8f881eb7 | [
"MIT"
] | 1 | 2022-03-01T19:09:52.000Z | 2022-03-01T19:09:52.000Z | hw2/q1/Trip.cpp | BenEf97/BarBenCPP | 556eebfeeadd210cc9552915d58c274b8f881eb7 | [
"MIT"
] | 1 | 2022-03-01T19:14:11.000Z | 2022-03-01T19:14:34.000Z | hw2/q1/Trip.cpp | BenEf97/BarBenCPP | 556eebfeeadd210cc9552915d58c274b8f881eb7 | [
"MIT"
] | null | null | null | #include "Trip.h"
#include <iostream>
#include <cstring>
using namespace std;
/*Notes:
maybe need to do '=' operator.
need to do print trip*/
//check if date is correct
Trip::Trip()
{
NumOfTrip = 0;
Destination = NULL;
date;
}
//check if date is correct
Trip::Trip(int Num, const char * dest, Date d)
{
setNoT(Nu... | 18.125 | 89 | 0.667586 | [
"object"
] |
4d13340300b58ced7d1f05d97564f7dde5089be2 | 32,788 | cpp | C++ | openstudiocore/src/model/EnergyManagementSystemMeteredOutputVariable.cpp | hongyuanjia/OpenStudio | 6cc52f1b66c069cf13f2b6ca2a0cc3c137c37cf0 | [
"MIT"
] | 1 | 2019-04-21T15:38:54.000Z | 2019-04-21T15:38:54.000Z | openstudiocore/src/model/EnergyManagementSystemMeteredOutputVariable.cpp | hongyuanjia/OpenStudio | 6cc52f1b66c069cf13f2b6ca2a0cc3c137c37cf0 | [
"MIT"
] | null | null | null | openstudiocore/src/model/EnergyManagementSystemMeteredOutputVariable.cpp | hongyuanjia/OpenStudio | 6cc52f1b66c069cf13f2b6ca2a0cc3c137c37cf0 | [
"MIT"
] | 1 | 2019-07-18T06:52:29.000Z | 2019-07-18T06:52:29.000Z | /***********************************************************************************************************************
* OpenStudio(R), Copyright (c) 2008-2018, Alliance for Sustainable Energy, LLC. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are perm... | 50.058015 | 171 | 0.79032 | [
"object",
"vector",
"model"
] |
4d1d78400bbb9630cd3155d6643cf4e1a8e1e27e | 63,711 | cpp | C++ | windows/advcore/gdiplus/engine/imaging/png/pngencoder.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | windows/advcore/gdiplus/engine/imaging/png/pngencoder.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | windows/advcore/gdiplus/engine/imaging/png/pngencoder.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | /**************************************************************************\
*
* Copyright (c) 1999 Microsoft Corporation
*
* Module Name:
*
* pngencoder.cpp
*
* Abstract:
*
* Implementation of the PNG filter encoder. This file contains the
* methods for both the encoder (IImageEncoder) and the enco... | 29.386993 | 137 | 0.513224 | [
"object"
] |
4d1f5d3c3ef62c0b23b1b65016a24a0bd0975be3 | 1,965 | cpp | C++ | PolyEngine/RenderingDevice/OpenGL/Src/PostprocessRenderingPass.cpp | MuniuDev/PolyEngine | 9389537e4f551fa5dd621ebd3704e55b04c98792 | [
"MIT"
] | 1 | 2017-04-30T13:55:54.000Z | 2017-04-30T13:55:54.000Z | PolyEngine/RenderingDevice/OpenGL/Src/PostprocessRenderingPass.cpp | MuniuDev/PolyEngine | 9389537e4f551fa5dd621ebd3704e55b04c98792 | [
"MIT"
] | null | null | null | PolyEngine/RenderingDevice/OpenGL/Src/PostprocessRenderingPass.cpp | MuniuDev/PolyEngine | 9389537e4f551fa5dd621ebd3704e55b04c98792 | [
"MIT"
] | 3 | 2017-11-22T16:37:26.000Z | 2019-04-24T17:47:58.000Z | #include "PostprocessRenderingPass.hpp"
#include "GLMeshDeviceProxy.hpp"
#include "GLTextureDeviceProxy.hpp"
#include <World.hpp>
#include <CameraComponent.hpp>
#include <TransformComponent.hpp>
#include <MeshRenderingComponent.hpp>
using namespace Poly;
struct PostprocessQuad : public BaseObject<>
{
public:
Postp... | 24.873418 | 100 | 0.711959 | [
"geometry"
] |
4d290957773be3092edd377583e76fc166902939 | 3,336 | hpp | C++ | contrib/autoboost/autoboost/regex/user.hpp | CaseyCarter/autowiring | 48e95a71308318c8ffb7ed1348e034fd9110f70c | [
"Apache-2.0"
] | 87 | 2015-01-18T00:43:06.000Z | 2022-02-11T17:40:50.000Z | contrib/autoboost/autoboost/regex/user.hpp | CaseyCarter/autowiring | 48e95a71308318c8ffb7ed1348e034fd9110f70c | [
"Apache-2.0"
] | 274 | 2015-01-03T04:50:49.000Z | 2021-03-08T09:01:09.000Z | contrib/autoboost/autoboost/regex/user.hpp | CaseyCarter/autowiring | 48e95a71308318c8ffb7ed1348e034fd9110f70c | [
"Apache-2.0"
] | 15 | 2015-09-30T20:58:43.000Z | 2020-12-19T21:24:56.000Z | /*
*
* Copyright (c) 1998-2002
* John Maddock
*
* Use, modification and distribution are subject to 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)
*
*/
/*
* LOCATION: see http://www.boost.org for most recent version.... | 35.489362 | 103 | 0.765588 | [
"object"
] |
4d2c56ca234be788942b2eb693aece275abc7534 | 17,997 | cc | C++ | sulume/local.cc | imos/icfpc2017 | d50c76b1f44e9289a92f564f319750049d952a5d | [
"MIT"
] | 5 | 2017-08-07T14:05:59.000Z | 2017-08-09T11:24:57.000Z | sulume/local.cc | imos/icfpc2017 | d50c76b1f44e9289a92f564f319750049d952a5d | [
"MIT"
] | null | null | null | sulume/local.cc | imos/icfpc2017 | d50c76b1f44e9289a92f564f319750049d952a5d | [
"MIT"
] | null | null | null | #include <chrono>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include "base/base.h"
#include "json11.hpp"
#include "ninetan/ninestream_util.h"
#include "strings/numbers.... | 35.567194 | 80 | 0.53809 | [
"object",
"shape",
"vector"
] |
4d2c64e2a034779ecea2e5ea21645c99488aaf78 | 6,602 | cpp | C++ | SimSpark/spark/lib/zeitgeist/leaf.cpp | IllyasvielEin/Robocup3dInstaller | 12e91d9372dd08a92feebf98e916c98bc2242ff4 | [
"MIT"
] | null | null | null | SimSpark/spark/lib/zeitgeist/leaf.cpp | IllyasvielEin/Robocup3dInstaller | 12e91d9372dd08a92feebf98e916c98bc2242ff4 | [
"MIT"
] | null | null | null | SimSpark/spark/lib/zeitgeist/leaf.cpp | IllyasvielEin/Robocup3dInstaller | 12e91d9372dd08a92feebf98e916c98bc2242ff4 | [
"MIT"
] | null | null | null | /* -*- mode: c++; c-basic-offset: 4; indent-tabs-mode: nil -*-
this file is part of rcssserver3D
Fri May 9 2003
Copyright (C) 2002,2003 Koblenz University
Copyright (C) 2003 RoboCup Soccer Server 3D Maintenance Group
$Id$
This program is free software; you can redistribute it and/or modify
it und... | 22.844291 | 111 | 0.608603 | [
"object",
"3d"
] |
4d2f8d0b2508593caa02e882b5f35dd51e3fa6a9 | 3,871 | cpp | C++ | src/IR/index.cpp | ms-design/llvm-bindings | 683076514597b6c6cabc648fcd6fb3a04cba2ba8 | [
"MIT"
] | null | null | null | src/IR/index.cpp | ms-design/llvm-bindings | 683076514597b6c6cabc648fcd6fb3a04cba2ba8 | [
"MIT"
] | 6 | 2022-02-20T10:18:07.000Z | 2022-02-21T09:38:58.000Z | src/IR/index.cpp | ms-design/llvm-bindings | 683076514597b6c6cabc648fcd6fb3a04cba2ba8 | [
"MIT"
] | 1 | 2022-02-28T12:25:46.000Z | 2022-02-28T12:25:46.000Z | #include "IR/index.h"
void InitIR(Napi::Env env, Napi::Object &exports) {
LLVMContext::Init(env, exports);
Module::Init(env, exports);
Type::Init(env, exports);
IntegerType::Init(env, exports);
FunctionType::Init(env, exports);
FunctionCallee::Init(env, exports);
StructType::Init(env, expor... | 36.17757 | 51 | 0.677344 | [
"object"
] |
4d30c9b6445274c63417f53fa2a550398d891906 | 26,014 | hpp | C++ | src/LinAlg/hiopMatrixSparseCSRCUDA.hpp | fritzgoebel/hiop | 86e4e1b9899a0e21d74a3ad9a8aa973e0e289b98 | [
"BSD-3-Clause"
] | null | null | null | src/LinAlg/hiopMatrixSparseCSRCUDA.hpp | fritzgoebel/hiop | 86e4e1b9899a0e21d74a3ad9a8aa973e0e289b98 | [
"BSD-3-Clause"
] | null | null | null | src/LinAlg/hiopMatrixSparseCSRCUDA.hpp | fritzgoebel/hiop | 86e4e1b9899a0e21d74a3ad9a8aa973e0e289b98 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) 2022, Lawrence Livermore National Security, LLC.
// Produced at the Lawrence Livermore National Laboratory (LLNL).
// LLNL-CODE-742473. All rights reserved.
//
// This file is part of HiOp. For details, see https://github.com/LLNL/hiop. HiOp
// is released under the BSD 3-clause license (https://openso... | 43.868465 | 120 | 0.645076 | [
"vector"
] |
2eb9f0d2cd936799abd3ddeaae7edf503b061347 | 505 | cpp | C++ | Durna/Source/Runtime/Math/Transform.cpp | MrWpGg/Durna | 62c8ca2d69623e70e2dac49a5560cd3ac2c304ed | [
"Apache-2.0"
] | null | null | null | Durna/Source/Runtime/Math/Transform.cpp | MrWpGg/Durna | 62c8ca2d69623e70e2dac49a5560cd3ac2c304ed | [
"Apache-2.0"
] | null | null | null | Durna/Source/Runtime/Math/Transform.cpp | MrWpGg/Durna | 62c8ca2d69623e70e2dac49a5560cd3ac2c304ed | [
"Apache-2.0"
] | null | null | null | #include "DurnaPCH.h"
#include "Runtime/Math/Transform.h"
#include "Runtime/Math/Vector.h"
namespace Durna
{
const Transform Transform::IdentityTransform =
Transform(Vector::ZeroVector, Vector::ZeroVector, Vector::OneVector);
Transform::Transform()
: Translation(Vector::ZeroVector), Rotation(Vector::ZeroVecto... | 31.5625 | 94 | 0.768317 | [
"vector",
"transform"
] |
2ebadbcad8f8c3a6c727038390754735337aac0d | 316,153 | cpp | C++ | wznmcmbd/WznmGen/WznmGenDetui.cpp | mpsitech/wznm-WhizniumSBE | 4911d561b28392d485c46e98fb915168d82b3824 | [
"MIT"
] | 3 | 2020-09-20T16:24:48.000Z | 2021-12-01T19:44:51.000Z | wznmcmbd/WznmGen/WznmGenDetui.cpp | mpsitech/wznm-WhizniumSBE | 4911d561b28392d485c46e98fb915168d82b3824 | [
"MIT"
] | null | null | null | wznmcmbd/WznmGen/WznmGenDetui.cpp | mpsitech/wznm-WhizniumSBE | 4911d561b28392d485c46e98fb915168d82b3824 | [
"MIT"
] | null | null | null | /**
* \file WznmGenDetui.cpp
* Wznm operation processor - generate detailed user interface (implementation)
* \copyright (C) 2016-2020 MPSI Technologies GmbH
* \author Alexander Wirthmueller (auto-generation)
* \date created: 28 Nov 2020
*/
// IP header --- ABOVE
#ifdef WZNMCMBD
#include <Wznmcmbd.h>
#else
#i... | 49.725228 | 274 | 0.68878 | [
"vector"
] |
2ebf3de9016fe92afa4b1e844bf7485a613c924a | 1,426 | cpp | C++ | source/test/test_buffer_view.cpp | nsubiron/crypto | 54b8f78d7ee938492b04af9da1cc8bf5a1f4a918 | [
"MIT"
] | null | null | null | source/test/test_buffer_view.cpp | nsubiron/crypto | 54b8f78d7ee938492b04af9da1cc8bf5a1f4a918 | [
"MIT"
] | null | null | null | source/test/test_buffer_view.cpp | nsubiron/crypto | 54b8f78d7ee938492b04af9da1cc8bf5a1f4a918 | [
"MIT"
] | null | null | null | #include "crypto/buffer_view.h"
#include <gtest/gtest.h>
#include <array>
#include <cstring>
#include <string>
using namespace crypto;
static bool copy_buffer(const_buffer_view src, mutable_buffer_view dst) {
if (dst.size() >= src.size()) {
std::memcpy(dst.data(), src.data(), src.size());
return true;
}... | 25.464286 | 75 | 0.672511 | [
"vector"
] |
2ec1e2ff5f671ac26b5349ab1e61a6feaa044ce2 | 7,242 | hpp | C++ | Library/Storage2/EXPORTER.hpp | MicheleVidulis/Codim-IPC | 9ec44226bfba11696dc049afeefc6114d1abeb51 | [
"Apache-2.0"
] | 76 | 2021-11-09T19:19:01.000Z | 2022-03-28T12:28:34.000Z | Library/Storage2/EXPORTER.hpp | MicheleVidulis/Codim-IPC | 9ec44226bfba11696dc049afeefc6114d1abeb51 | [
"Apache-2.0"
] | 4 | 2021-11-10T10:18:07.000Z | 2022-01-26T17:24:29.000Z | Library/Storage2/EXPORTER.hpp | MicheleVidulis/Codim-IPC | 9ec44226bfba11696dc049afeefc6114d1abeb51 | [
"Apache-2.0"
] | 12 | 2021-11-25T22:37:02.000Z | 2022-03-25T02:04:29.000Z | #pragma once
#include "./FULL_STORAGE.hpp"
#include "./RANGED_STORAGE.hpp"
namespace py = pybind11;
namespace JGSL {
void Export_Storage_2(py::module &m) {
// -------------
// Full Storages
// -------------
// Basic Single Element, Single Precision Float Storages
py::class_<storage::FullStorage<... | 87.253012 | 187 | 0.686965 | [
"mesh",
"vector"
] |
2ec4662b19294a78f7d8a79bcbb7f00f158df5aa | 8,129 | hpp | C++ | 309551047_np_project4/console.hpp | Ksld154/Network-Programming | 9b92ba9118ecd11de801e1ac4f062ebcce8386f0 | [
"MIT"
] | 1 | 2021-09-16T01:15:33.000Z | 2021-09-16T01:15:33.000Z | 309551047_np_project4/console.hpp | Ksld154/Network-Programming | 9b92ba9118ecd11de801e1ac4f062ebcce8386f0 | [
"MIT"
] | null | null | null | 309551047_np_project4/console.hpp | Ksld154/Network-Programming | 9b92ba9118ecd11de801e1ac4f062ebcce8386f0 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <fstream>
#include <cstdio>
#include <boost/asio.hpp>
#include <boost/algorithm/string.hpp>
#include <boost/bind.hpp>
#define MAX_CONSOLE_RESULT_LEN 30000
#define SOCKS_REQUEST_LEN 9
#define SOCKS_REPLY_LEN 8
using boost::asio::ip:... | 32.910931 | 140 | 0.531062 | [
"vector"
] |
2ec4727764018a284b5279c157ea976d881eccac | 5,252 | hxx | C++ | src/varstr.hxx | takaho/snpexp | a357b63d3366263bee9328324edaa13471c4b812 | [
"MIT"
] | 1 | 2015-03-27T12:35:00.000Z | 2015-03-27T12:35:00.000Z | src/varstr.hxx | takaho/snpexp | a357b63d3366263bee9328324edaa13471c4b812 | [
"MIT"
] | 1 | 2020-06-07T23:17:59.000Z | 2020-06-07T23:17:59.000Z | src/varstr.hxx | takaho/snpexp | a357b63d3366263bee9328324edaa13471c4b812 | [
"MIT"
] | 1 | 2019-10-21T02:05:27.000Z | 2019-10-21T02:05:27.000Z | #ifndef TKBIO_VARSTR_H
#define TKBIO_VARSTR_H
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <string>
#include <stdexcept>
#include <vector>
#include <map>
using std::string;
using std::vector;
using std::exception;
#include <bam.h>
#include <recrec.hxx>
using namespace tkbio;
namespace tkbio {
ty... | 36.22069 | 150 | 0.638995 | [
"vector"
] |
2ecbec0ed4fc173958650e584cc24d6e2b0b43ed | 7,619 | cc | C++ | src/executor.cc | fknorr/celerity-runtime | c12b052c37343e010a14019e186320c3e942ff92 | [
"MIT"
] | null | null | null | src/executor.cc | fknorr/celerity-runtime | c12b052c37343e010a14019e186320c3e942ff92 | [
"MIT"
] | null | null | null | src/executor.cc | fknorr/celerity-runtime | c12b052c37343e010a14019e186320c3e942ff92 | [
"MIT"
] | null | null | null | #include "executor.h"
#include <queue>
#include "distr_queue.h"
#include "log.h"
#include "mpi_support.h"
#include "named_threads.h"
// TODO: Get rid of this. (This could potentialy even cause deadlocks on large clusters)
constexpr size_t MAX_CONCURRENT_JOBS = 20;
namespace celerity {
namespace detail {
void durat... | 36.454545 | 149 | 0.695761 | [
"vector"
] |
2ed870f5063fe2582d74695e6cdd2244da8e5c17 | 2,786 | hpp | C++ | components/homme/src/share/cxx/Context.hpp | jingxianwen/E3SM | bced6ba5e9247d6db6c8445b5fb828772a929b1b | [
"zlib-acknowledgement",
"RSA-MD",
"FTL"
] | 3 | 2020-02-24T21:58:57.000Z | 2020-09-29T23:06:45.000Z | components/homme/src/share/cxx/Context.hpp | jingxianwen/E3SM | bced6ba5e9247d6db6c8445b5fb828772a929b1b | [
"zlib-acknowledgement",
"RSA-MD",
"FTL"
] | 16 | 2019-09-27T02:16:37.000Z | 2020-08-01T17:51:12.000Z | components/homme/src/share/cxx/Context.hpp | jingxianwen/E3SM | bced6ba5e9247d6db6c8445b5fb828772a929b1b | [
"zlib-acknowledgement",
"RSA-MD",
"FTL"
] | 2 | 2020-12-09T07:30:20.000Z | 2022-03-18T04:22:25.000Z | /********************************************************************************
* HOMMEXX 1.0: Copyright of Sandia Corporation
* This software is released under the BSD license
* See the file 'COPYRIGHT' in the HOMMEXX/src/share/cxx directory
***********************************************************************... | 32.776471 | 81 | 0.703159 | [
"object"
] |
2edeebd8ce43a78a4e8abec6a1d2456bf919de2a | 1,778 | cc | C++ | tests/gas-stimulation-test.cc | aditik4/idealgas | 69f552c1a31ca6f5a1acb26c4b2667937768c403 | [
"MIT"
] | null | null | null | tests/gas-stimulation-test.cc | aditik4/idealgas | 69f552c1a31ca6f5a1acb26c4b2667937768c403 | [
"MIT"
] | null | null | null | tests/gas-stimulation-test.cc | aditik4/idealgas | 69f552c1a31ca6f5a1acb26c4b2667937768c403 | [
"MIT"
] | null | null | null | #include <catch2/catch.hpp>
#include <gas_container.h>
#include <particle.h>
using idealgas::GasContainer;
idealgas::Particle particle1 = idealgas::Particle(vec2(20, 19.9), vec2(1, -0.1), 1);
idealgas::Particle particle2 = idealgas::Particle(vec2(9, 25), vec2(1, 4), 1);
idealgas::Particle particle3 = idealgas::Parti... | 38.652174 | 87 | 0.745782 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.