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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
87c4d8fa66c9f5f2e3ed02ff173f3d1779959733 | 9,058 | cpp | C++ | examples/common-qt/tcpclient.cpp | JohanVanslembrouck/corolib | 0ebbabfe368c29901bf96ae1d3b6e989e3ff82c9 | [
"MIT"
] | 1 | 2021-08-19T13:49:01.000Z | 2021-08-19T13:49:01.000Z | examples/common-qt/tcpclient.cpp | JohanVanslembrouck/corolib | 0ebbabfe368c29901bf96ae1d3b6e989e3ff82c9 | [
"MIT"
] | null | null | null | examples/common-qt/tcpclient.cpp | JohanVanslembrouck/corolib | 0ebbabfe368c29901bf96ae1d3b6e989e3ff82c9 | [
"MIT"
] | null | null | null | /**
* @file
* @brief
*
* @author Johan Vanslembrouck (johan.vanslembrouck@altran.com, johan.vanslembrouck@gmail.com)
*/
#include "tcpclient.h"
/**
* @brief TcpClient::TcpClient
* @param name
* @param autoConnect
* @param waitForConnectionTimeout
* @param reconnectTimeout
* @param reconnectTimeoutAfterDisco... | 30.093023 | 141 | 0.616582 | [
"object"
] |
87c55ac6b46a1870dfc17f0457d35f8fd906175e | 444 | cpp | C++ | AtCoder/abc126/b/main.cpp | H-Tatsuhiro/Com_Pro-Cpp | fd79f7821a76b11f4a6f83bbb26a034db577a877 | [
"MIT"
] | null | null | null | AtCoder/abc126/b/main.cpp | H-Tatsuhiro/Com_Pro-Cpp | fd79f7821a76b11f4a6f83bbb26a034db577a877 | [
"MIT"
] | 1 | 2021-10-19T08:47:23.000Z | 2022-03-07T05:23:56.000Z | AtCoder/abc126/b/main.cpp | H-Tatsuhiro/Com_Pro-Cpp | fd79f7821a76b11f4a6f83bbb26a034db577a877 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string S; cin >> S;
int a = (S[0] - '0') * 10 + (S[1] - '0'), b = (S[2] - '0') * 10 + (S[3] - '0');
if ((1 <= a && a <= 12) && (1 <= b && b <= 12)) printf("%s\n", "AMBIGUOUS");
else if (1 <= b &... | 31.714286 | 83 | 0.452703 | [
"vector"
] |
d7acfb2c39d4f836c378c6aba0b152e2bce1fb78 | 16,873 | cpp | C++ | code/EEC/csource/ECcrits_c.cpp | ftelschow/HPE | 9a6885d210bbc3235a859561fa180264d951755b | [
"MIT"
] | null | null | null | code/EEC/csource/ECcrits_c.cpp | ftelschow/HPE | 9a6885d210bbc3235a859561fa180264d951755b | [
"MIT"
] | null | null | null | code/EEC/csource/ECcrits_c.cpp | ftelschow/HPE | 9a6885d210bbc3235a859561fa180264d951755b | [
"MIT"
] | null | null | null | /***********************************************
* This file contains c implementations of the
* Euler characteristic for different dimensions
* using the lower star/critical value trick
*
***********************************************/
#include <math.h>
#include <matrix.h>
/* This is the C++ subroutine comp... | 45.357527 | 160 | 0.354057 | [
"3d"
] |
d7b4f4a6c601c3403336430c7429d2c48783836f | 3,468 | cpp | C++ | library/dynamicProgramming/optimizationDivideConquer_OptimalSquareDistance1D.cpp | bluedawnstar/algorithm_library | 4c7f64ec61fc2ba059b64ad7ba20fcb5b838ced6 | [
"Unlicense"
] | 40 | 2017-11-26T05:29:18.000Z | 2020-11-13T00:29:26.000Z | library/dynamicProgramming/optimizationDivideConquer_OptimalSquareDistance1D.cpp | bluedawnstar/algorithm_library | 4c7f64ec61fc2ba059b64ad7ba20fcb5b838ced6 | [
"Unlicense"
] | 101 | 2019-02-09T06:06:09.000Z | 2021-12-25T16:55:37.000Z | library/dynamicProgramming/optimizationDivideConquer_OptimalSquareDistance1D.cpp | bluedawnstar/algorithm_library | 4c7f64ec61fc2ba059b64ad7ba20fcb5b838ced6 | [
"Unlicense"
] | 6 | 2017-01-03T14:17:58.000Z | 2021-01-22T10:37:04.000Z | #include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
#include "optimizationDivideConquer_OptimalSquareDistance1D.h"
#include "optimizationDivideConquer_OptimalKMeans1D.h"
/////////// For Testing ///////////////////////////////////////////////////////
#include <time.h>
#include <cassert>
#in... | 27.967742 | 95 | 0.537486 | [
"vector"
] |
d7b8f2d9191b170100e86b7d4eb00d65c013035d | 28,427 | cpp | C++ | SOMTRANSIT/MAXTRANSIT/samples/objects/particles/pbomb.cpp | SOM-Firmwide/SOMTRANSIT | a83879c3b60bd24c45bcf4c01fcd11632e799973 | [
"MIT"
] | null | null | null | SOMTRANSIT/MAXTRANSIT/samples/objects/particles/pbomb.cpp | SOM-Firmwide/SOMTRANSIT | a83879c3b60bd24c45bcf4c01fcd11632e799973 | [
"MIT"
] | null | null | null | SOMTRANSIT/MAXTRANSIT/samples/objects/particles/pbomb.cpp | SOM-Firmwide/SOMTRANSIT | a83879c3b60bd24c45bcf4c01fcd11632e799973 | [
"MIT"
] | null | null | null | /**********************************************************************
*<
FILE: pbomb.cpp
DESCRIPTION: Particle Bomb
CREATED BY: Audrey Peterson
HISTORY: 12/11/96
Modified: 9/18/01 Bayboro: removed dependency to EDP
*> Copyright (c) 1996, All Rights Reserved. For Yost Group Inc.
*************************... | 27.787879 | 201 | 0.677279 | [
"mesh",
"render",
"object"
] |
d7bc055978d823d2d6c67708eebe87a2a64ab204 | 13,477 | cpp | C++ | ChaosEngine/src/Chaos/Nodes/Node.cpp | JJRWalker/ChaosEngine | 47efb82cf8fac75af50ae639b85423304c90a52f | [
"Apache-2.0"
] | 3 | 2020-06-15T01:47:07.000Z | 2021-06-11T22:20:59.000Z | ChaosEngine/src/Chaos/Nodes/Node.cpp | JJRWalker/ChaosEngine | 47efb82cf8fac75af50ae639b85423304c90a52f | [
"Apache-2.0"
] | null | null | null | ChaosEngine/src/Chaos/Nodes/Node.cpp | JJRWalker/ChaosEngine | 47efb82cf8fac75af50ae639b85423304c90a52f | [
"Apache-2.0"
] | null | null | null | #include "chaospch.h"
#include "Node.h"
#include "Math.h"
#include "Colliders.h"
#include "Chaos/Serialisation/Binary.h"
#include "Chaos/Core/Application.h"
// have to include all node types here in order to serialize them, not ideal but will have to do for the moment
#include <Chaos/Nodes/Camera.h>
#include <Chaos/... | 22.312914 | 131 | 0.656823 | [
"object",
"vector",
"transform"
] |
d7bd09508935d6502e562da2dd3a49141061e382 | 9,751 | cpp | C++ | benchmarks/accuracy_and_overhead/phoenix/phoenix++-1.0/tests/pca/pca.cpp | quanshousio/CompilerInterrupts | 67e72514a90c76c7106e4202001003b9ef359a5e | [
"MIT"
] | null | null | null | benchmarks/accuracy_and_overhead/phoenix/phoenix++-1.0/tests/pca/pca.cpp | quanshousio/CompilerInterrupts | 67e72514a90c76c7106e4202001003b9ef359a5e | [
"MIT"
] | null | null | null | benchmarks/accuracy_and_overhead/phoenix/phoenix++-1.0/tests/pca/pca.cpp | quanshousio/CompilerInterrupts | 67e72514a90c76c7106e4202001003b9ef359a5e | [
"MIT"
] | null | null | null | /* Copyright (c) 2007-2011, Stanford University
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of ... | 27.780627 | 164 | 0.605887 | [
"vector"
] |
d7bfa315c285628980404ec9c4b21e0e8f0efb95 | 4,269 | cpp | C++ | src/tests/kalman/test-kalman-eigen-benchmark.cpp | skyward-er/skyward-boardcore | 05b9fc2ef45d27487af57cc11ed8b85524451510 | [
"MIT"
] | 6 | 2022-01-06T14:20:45.000Z | 2022-02-28T07:32:39.000Z | src/tests/kalman/test-kalman-eigen-benchmark.cpp | skyward-er/skyward-boardcore | 05b9fc2ef45d27487af57cc11ed8b85524451510 | [
"MIT"
] | null | null | null | src/tests/kalman/test-kalman-eigen-benchmark.cpp | skyward-er/skyward-boardcore | 05b9fc2ef45d27487af57cc11ed8b85524451510 | [
"MIT"
] | null | null | null | /* Copyright (c) 2020 Skyward Experimental Rocketry
* Author: Luca Conterio
*
* 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... | 29.853147 | 80 | 0.593347 | [
"vector",
"model"
] |
d7c981fe5912d25f282cd97bb4c960943055bf1d | 8,404 | cc | C++ | src/main.cc | pstanisz/algorithms | 701d907704e8a33de242d4eabc4ee5164afd1be5 | [
"MIT"
] | null | null | null | src/main.cc | pstanisz/algorithms | 701d907704e8a33de242d4eabc4ee5164afd1be5 | [
"MIT"
] | null | null | null | src/main.cc | pstanisz/algorithms | 701d907704e8a33de242d4eabc4ee5164afd1be5 | [
"MIT"
] | null | null | null | /*
* @brief Entry point for algorithms application
*/
#include <iostream>
#include <vector>
#include <cstdlib>
#include <functional>
#include "utils.hh"
#include "sorting.hh"
#include "binarysearching.hh"
#include "merging.hh"
#include "set.hh"
int main()
{
using namespace Algorithms;
std::cout << "Sandbox... | 29.28223 | 99 | 0.597692 | [
"vector"
] |
d7cf81fcbf08a6da406bb7c09b882ceb06a85bfd | 3,632 | cc | C++ | code/dictionary_benchmark/benchmark.cc | dendisuhubdy/LowLatencyProgrammingPresentation | 73aade6543174c4c5427bd409039a08c6be86732 | [
"MIT"
] | 10 | 2018-07-10T12:04:17.000Z | 2022-03-30T21:22:37.000Z | code/dictionary_benchmark/benchmark.cc | dendisuhubdy/LowLatencyProgrammingPresentation | 73aade6543174c4c5427bd409039a08c6be86732 | [
"MIT"
] | 1 | 2018-01-24T16:17:37.000Z | 2018-01-24T20:27:10.000Z | code/dictionary_benchmark/benchmark.cc | dendisuhubdy/LowLatencyProgrammingPresentation | 73aade6543174c4c5427bd409039a08c6be86732 | [
"MIT"
] | 4 | 2018-03-13T19:05:38.000Z | 2020-04-07T09:24:33.000Z | #include "../v0/dictionary.hh"
#include "../v1/dictionary.hh"
#include "../v2/dictionary.hh"
#include "../v3/dictionary.hh"
#include "../v4/dictionary.hh"
#include <benchmark/benchmark.h>
// instrumentation
#include <papipp.h>
#include <valgrind/callgrind.h>
#include <iostream>
#include <vector>
#include <random>
#... | 27.938462 | 123 | 0.724394 | [
"vector"
] |
d7cf939e984231c6dbd1958578087ddea3cf5542 | 5,578 | cpp | C++ | src/turtle_input_helper.cpp | paulhilbert/duraark_rdf | 2f82913dcf1e62ca702c92d093c69b3d3dc2a71a | [
"CC0-1.0"
] | null | null | null | src/turtle_input_helper.cpp | paulhilbert/duraark_rdf | 2f82913dcf1e62ca702c92d093c69b3d3dc2a71a | [
"CC0-1.0"
] | null | null | null | src/turtle_input_helper.cpp | paulhilbert/duraark_rdf | 2f82913dcf1e62ca702c92d093c69b3d3dc2a71a | [
"CC0-1.0"
] | null | null | null | #include <turtle_input_helper.hpp>
#include <iostream>
#include <boost/spirit/include/qi.hpp>
#include <boost/filesystem.hpp>
namespace fs = boost::filesystem;
namespace duraark_rdf {
std::set<uint32_t> parse_index_list_(const std::string& str) {
using boost::spirit::qi::uint_;
using boost::spirit::qi::char_... | 36.697368 | 180 | 0.596988 | [
"object",
"vector",
"transform"
] |
d7dab3a309fb346d0ed3bead6e0b16a5725780c3 | 9,394 | cpp | C++ | src/model_data.cpp | Kotuon/pEngine | a80e268b8cfc99e212e5a0edd41991854adccd78 | [
"BSD-3-Clause"
] | null | null | null | src/model_data.cpp | Kotuon/pEngine | a80e268b8cfc99e212e5a0edd41991854adccd78 | [
"BSD-3-Clause"
] | null | null | null | src/model_data.cpp | Kotuon/pEngine | a80e268b8cfc99e212e5a0edd41991854adccd78 | [
"BSD-3-Clause"
] | null | null | null | /**
* @file model_data.cpp
* @author Kelson Wysocki (kelson.wysocki@gmail.com)
* @brief
* @version 0.1
* @date 2021-06-06
*
* @copyright Copyright (c) 2021
*
*/
// std includes //
#include <cstdio>
#include <cstring>
// Library includes //
#include <glew.h>
#include <glm.hpp>
#include <gtc/matrix_transfor... | 31.313333 | 120 | 0.614435 | [
"object",
"vector",
"model",
"transform"
] |
d7e35c9e9029e7c912587eb4965c2bf84827bdde | 6,516 | cpp | C++ | GUI.cpp | IndriesGeorge/MovieRentalApp | d89f6520d8c8644ab274116e8f908bc1a29b73ec | [
"MIT"
] | null | null | null | GUI.cpp | IndriesGeorge/MovieRentalApp | d89f6520d8c8644ab274116e8f908bc1a29b73ec | [
"MIT"
] | null | null | null | GUI.cpp | IndriesGeorge/MovieRentalApp | d89f6520d8c8644ab274116e8f908bc1a29b73ec | [
"MIT"
] | null | null | null | #include "GUI.h"
void GUI::initGUIComponents()
{
QHBoxLayout* mainLy = new QHBoxLayout{};
setLayout(mainLy);
QGridLayout* gridLy = new QGridLayout;
gridLy->addWidget(table);
mainLy->addLayout(gridLy);
QVBoxLayout* rightLy = new QVBoxLayout;
QFormLayout* formsLy = new QFormLayout;
formsLy->addRow("Movie ID: ... | 26.704918 | 99 | 0.701351 | [
"vector",
"model"
] |
d7e44e103f523379b2d3069aa0c783b8c011ea07 | 1,243 | cc | C++ | leetcode/leetcode_393.cc | math715/arts | ff73ccb7d67f7f7c87150204e15aeb46047f0e02 | [
"MIT"
] | null | null | null | leetcode/leetcode_393.cc | math715/arts | ff73ccb7d67f7f7c87150204e15aeb46047f0e02 | [
"MIT"
] | null | null | null | leetcode/leetcode_393.cc | math715/arts | ff73ccb7d67f7f7c87150204e15aeb46047f0e02 | [
"MIT"
] | null | null | null | #include <iostream>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <cstdint>
using namespace std;
int validbyte(uint8_t d[4], int n) {
auto is_valid = [](const uint8_t t) ->bool {
return (t & 0xc0 ) ^ 0... | 18.552239 | 70 | 0.531778 | [
"vector"
] |
d7fb460f2592d591d0963b1856d51922609eb94e | 818 | hpp | C++ | SickzilSFMLUI/includes/main_window.hpp | 0x00000FF/SickzilSFMLUI | a4c227ff8173f15742593b8d91fb1c9c575ab826 | [
"MIT"
] | 3 | 2019-08-16T05:48:40.000Z | 2019-08-19T13:22:48.000Z | SickzilSFMLUI/includes/main_window.hpp | 0x00000FF/SickzilSFMLUI | a4c227ff8173f15742593b8d91fb1c9c575ab826 | [
"MIT"
] | 4 | 2019-08-17T07:15:05.000Z | 2019-08-17T21:15:57.000Z | SickzilSFMLUI/includes/main_window.hpp | 0x00000FF/SickzilSFMLUI | a4c227ff8173f15742593b8d91fb1c9c575ab826 | [
"MIT"
] | null | null | null | #ifndef __MAIN_WINDOW_HPP__
#define __MAIN_WINDOW_HPP__
#include <SFML/Graphics.hpp>
#include <memory>
#include <draw_object.hpp>
using namespace sf;
struct ui_options
{
int width = 400;
int height = 500;
std::string title = "SickzilMachine";
};
using up_options = std::unique_ptr<ui_opt... | 19.023256 | 75 | 0.705379 | [
"vector"
] |
cc091cbe9ad457369569736629ee8bec002e4f4f | 414 | hpp | C++ | algorithms/contiguous-data/rectangle-in-histogram/aim.hpp | dubzzz/various-algorithms | 16af4c05acfcb23d199df0851402b0da3ebba91c | [
"MIT"
] | 1 | 2017-04-17T18:32:46.000Z | 2017-04-17T18:32:46.000Z | algorithms/contiguous-data/rectangle-in-histogram/aim.hpp | dubzzz/various-algorithms | 16af4c05acfcb23d199df0851402b0da3ebba91c | [
"MIT"
] | 10 | 2016-12-25T04:42:56.000Z | 2017-03-30T20:42:25.000Z | algorithms/contiguous-data/rectangle-in-histogram/aim.hpp | dubzzz/various-algorithms | 16af4c05acfcb23d199df0851402b0da3ebba91c | [
"MIT"
] | 1 | 2022-03-25T17:39:05.000Z | 2022-03-25T17:39:05.000Z | /*
The aim of this topic is:
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.
Taken from: http://www.programcreek.com/2014/05/leetcode-largest-rectangle-in-histogram-java/
*/
#include <cstddef>
#includ... | 29.571429 | 160 | 0.743961 | [
"vector"
] |
cc0bf6c35b0af5e600993ed643da1839fad4f87d | 6,442 | cpp | C++ | OOModel/src/CodeGenerationVisitor.cpp | dimitar-asenov/Envision | 1ab5c846fca502b7fe73ae4aff59e8746248446c | [
"BSD-3-Clause"
] | 75 | 2015-01-18T13:29:43.000Z | 2022-01-14T08:02:01.000Z | OOModel/src/CodeGenerationVisitor.cpp | dimitar-asenov/Envision | 1ab5c846fca502b7fe73ae4aff59e8746248446c | [
"BSD-3-Clause"
] | 364 | 2015-01-06T10:20:21.000Z | 2018-12-17T20:12:28.000Z | OOModel/src/CodeGenerationVisitor.cpp | dimitar-asenov/Envision | 1ab5c846fca502b7fe73ae4aff59e8746248446c | [
"BSD-3-Clause"
] | 14 | 2015-01-09T00:44:24.000Z | 2022-02-22T15:01:44.000Z | /***********************************************************************************************************************
**
** Copyright (c) 2011, 2015 ETH Zurich
** All rights reserved.
**
** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the
** follo... | 32.535354 | 120 | 0.672928 | [
"model"
] |
cc13c1a327fa42345d0e034d5581384d9a5536bb | 2,329 | cpp | C++ | Codeforces Round 375/st-Spanning Tree/main.cpp | sqc1999-oi/Codeforces | 5551e0e4b9dc66bb77c697568f0584aac3dbefae | [
"MIT"
] | 1 | 2016-07-18T12:05:56.000Z | 2016-07-18T12:05:56.000Z | Codeforces Round 375/st-Spanning Tree/main.cpp | sqc1999/Codeforces | 5551e0e4b9dc66bb77c697568f0584aac3dbefae | [
"MIT"
] | null | null | null | Codeforces Round 375/st-Spanning Tree/main.cpp | sqc1999/Codeforces | 5551e0e4b9dc66bb77c697568f0584aac3dbefae | [
"MIT"
] | null | null | null | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 2e5, M = 4e5;
pair<int, int> e[M], es[N], et[N];
int f[N];
bool cs[N], ct[N];
int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }
int main()
{
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
... | 19.571429 | 62 | 0.406612 | [
"vector"
] |
cc406974e61e6eadffd0842a07631dd1ead8fa23 | 1,537 | cc | C++ | dataworks-public/src/model/GetMetaTableIntroWikiRequest.cc | iamzken/aliyun-openapi-cpp-sdk | 3c991c9ca949b6003c8f498ce7a672ea88162bf1 | [
"Apache-2.0"
] | 89 | 2018-02-02T03:54:39.000Z | 2021-12-13T01:32:55.000Z | dataworks-public/src/model/GetMetaTableIntroWikiRequest.cc | iamzken/aliyun-openapi-cpp-sdk | 3c991c9ca949b6003c8f498ce7a672ea88162bf1 | [
"Apache-2.0"
] | 89 | 2018-03-14T07:44:54.000Z | 2021-11-26T07:43:25.000Z | dataworks-public/src/model/GetMetaTableIntroWikiRequest.cc | aliyun/aliyun-openapi-cpp-sdk | 0cf5861ece17dfb0bb251f13bf3fbdb39c0c6e36 | [
"Apache-2.0"
] | 69 | 2018-01-22T09:45:52.000Z | 2022-03-28T07:58:38.000Z | /*
* Copyright 2009-2017 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... | 29.557692 | 78 | 0.770332 | [
"model"
] |
cc439fab4cf4194050e20d68991f836ce04c6fdf | 3,014 | cc | C++ | plugins/behavior/testing/mutable_behavior_bench.cc | kstepanmpmg/mldb | f78791cd34d01796705c0f173a14359ec1b2e021 | [
"Apache-2.0"
] | 665 | 2015-12-09T17:00:14.000Z | 2022-03-25T07:46:46.000Z | plugins/behavior/testing/mutable_behavior_bench.cc | tomzhang/mldb | a09cf2d9ca454d1966b9e49ae69f2fe6bf571494 | [
"Apache-2.0"
] | 797 | 2015-12-09T19:48:19.000Z | 2022-03-07T02:19:47.000Z | plugins/behavior/testing/mutable_behavior_bench.cc | matebestek/mldb | f78791cd34d01796705c0f173a14359ec1b2e021 | [
"Apache-2.0"
] | 103 | 2015-12-25T04:39:29.000Z | 2022-02-03T02:55:22.000Z | // This file is part of MLDB. Copyright 2015 mldb.ai inc. All rights reserved.
#include <iostream>
#include <string>
#include <thread>
#include <vector>
#include <boost/program_options/cmdline.hpp>
#include <boost/program_options/options_description.hpp>
#include <boost/program_options/parsers.hpp>
#include <boost/pr... | 24.112 | 78 | 0.56503 | [
"vector"
] |
cc44284e0940563cedf9f4e0cd7907aaf9cffdbe | 2,317 | cpp | C++ | tools/benchmark/saga/saga_random_order_gtest_dense.cpp | timleathart/tick | 97e8fdc759358f377d414e09d2260454136911a2 | [
"BSD-3-Clause"
] | null | null | null | tools/benchmark/saga/saga_random_order_gtest_dense.cpp | timleathart/tick | 97e8fdc759358f377d414e09d2260454136911a2 | [
"BSD-3-Clause"
] | null | null | null | tools/benchmark/saga/saga_random_order_gtest_dense.cpp | timleathart/tick | 97e8fdc759358f377d414e09d2260454136911a2 | [
"BSD-3-Clause"
] | null | null | null | #include <chrono>
#include "tick/array/serializer.h"
#include "tick/random/test_rand.h"
#include "tick/optim/solver/saga.h"
#include "tick/optim/model/logreg.h"
#include "tick/optim/model/linreg.h"
#include "tick/optim/prox/prox_zero.h"
#ifdef _MKN_WITH_MKN_KUL_
#include "kul/os.hpp"
#endif
const constexpr size_t SE... | 35.646154 | 83 | 0.627104 | [
"model"
] |
cc4b046ed862439618da5607b0b294c25788fc9d | 1,227 | cpp | C++ | src/daily/NC15.cpp | hewei-nju/LeetCode | 39aafffa9cc260056435ef4611e305f402b32223 | [
"MIT"
] | null | null | null | src/daily/NC15.cpp | hewei-nju/LeetCode | 39aafffa9cc260056435ef4611e305f402b32223 | [
"MIT"
] | null | null | null | src/daily/NC15.cpp | hewei-nju/LeetCode | 39aafffa9cc260056435ef4611e305f402b32223 | [
"MIT"
] | null | null | null |
/*给定一个二叉树，返回该二叉树层序遍历的结果，（从左到右，一层一层地遍历）
例如：
给定的二叉树是{3,9,20,#,#,15,7},
该二叉树层序遍历的结果是
[
[3],
[9,20],
[15,7]
]
*/
/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
class Solution {
public:
/**
*
* @param root TreeNode类
* @return int整型vector<vector<>>
... | 21.910714 | 53 | 0.449063 | [
"vector"
] |
cc4efb4cff32d82e17dba5bd80e3aa6a02bbb996 | 9,443 | cpp | C++ | Viewer/ecflowUI/src/ViewerUtil.cpp | ecmwf/ecflow | 2498d0401d3d1133613d600d5c0e0a8a30b7b8eb | [
"Apache-2.0"
] | 11 | 2020-08-07T14:42:45.000Z | 2021-10-21T01:59:59.000Z | Viewer/ecflowUI/src/ViewerUtil.cpp | CoollRock/ecflow | db61dddc84d3d2c7dd6af95fd799d717c6bc2a6d | [
"Apache-2.0"
] | 10 | 2020-08-07T14:36:27.000Z | 2022-02-22T06:51:24.000Z | Viewer/ecflowUI/src/ViewerUtil.cpp | CoollRock/ecflow | db61dddc84d3d2c7dd6af95fd799d717c6bc2a6d | [
"Apache-2.0"
] | 6 | 2020-08-07T14:34:38.000Z | 2022-01-10T12:06:27.000Z | //============================================================================
// Copyright 2009-2020 ECMWF.
// This software is licensed under the terms of the Apache Licence version 2.0
// which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
// In applying this licence, ECMWF does not waive the privil... | 24.915567 | 108 | 0.550037 | [
"model"
] |
cc50e9843ffd0bb6343de684c7ec8d376395bb19 | 11,399 | cpp | C++ | src/qttypes/qtprotobufqttypes.cpp | pontaoski/qtprotobuf | 7225e6e324aa38c1bbeac1c0829cef73650e9d6f | [
"MIT"
] | 139 | 2019-06-28T10:35:07.000Z | 2022-03-23T05:54:26.000Z | src/qttypes/qtprotobufqttypes.cpp | pontaoski/qtprotobuf | 7225e6e324aa38c1bbeac1c0829cef73650e9d6f | [
"MIT"
] | 165 | 2019-10-22T14:51:10.000Z | 2022-02-24T22:46:56.000Z | src/qttypes/qtprotobufqttypes.cpp | pontaoski/qtprotobuf | 7225e6e324aa38c1bbeac1c0829cef73650e9d6f | [
"MIT"
] | 29 | 2019-08-06T11:15:41.000Z | 2022-01-04T02:51:43.000Z | /*
* MIT License
*
* Copyright (c) 2020 Alexey Edelev <semlanik@gmail.com>
*
* This file is part of qtprotobuf project https://git.semlanik.org/semlanik/qtprotobuf
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of this
* software and associated documentation files (the "Softwa... | 35.621875 | 200 | 0.649004 | [
"object",
"vector"
] |
cc5124131a8b7790ba5c5904bc49fc15fa4a968a | 1,878 | cpp | C++ | bfs_network_delay.cpp | MeredithCL/Algorithms-Basic-Exercises | c9cadfbe3cf5a0d6fabb34aa6ff170e97f1e4e83 | [
"MIT"
] | null | null | null | bfs_network_delay.cpp | MeredithCL/Algorithms-Basic-Exercises | c9cadfbe3cf5a0d6fabb34aa6ff170e97f1e4e83 | [
"MIT"
] | null | null | null | bfs_network_delay.cpp | MeredithCL/Algorithms-Basic-Exercises | c9cadfbe3cf5a0d6fabb34aa6ff170e97f1e4e83 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int networkDelayTime(vector<vector<int>>& times, int n, int k) {
int size = times.size();
if (!size && n > 0)
{
return -1;
}
int edges[n + 1][n + 1];
int been[n + 1];
for (int i... | 27.617647 | 75 | 0.275293 | [
"vector"
] |
7fe230046cd066de666ba97a2feec94925e73fbf | 4,233 | cpp | C++ | samples/CastorDvpTD/MainFrame.cpp | Mu-L/Castor3D | 7b9c6e7be6f7373ad60c0811d136c0004e50e76b | [
"MIT"
] | 245 | 2015-10-29T14:31:45.000Z | 2022-03-31T13:04:45.000Z | samples/CastorDvpTD/MainFrame.cpp | Mu-L/Castor3D | 7b9c6e7be6f7373ad60c0811d136c0004e50e76b | [
"MIT"
] | 64 | 2016-03-11T19:45:05.000Z | 2022-03-31T23:58:33.000Z | samples/CastorDvpTD/MainFrame.cpp | Mu-L/Castor3D | 7b9c6e7be6f7373ad60c0811d136c0004e50e76b | [
"MIT"
] | 11 | 2018-05-24T09:07:43.000Z | 2022-03-21T21:05:20.000Z | #include "MainFrame.hpp"
#include "RenderPanel.hpp"
#include "CastorDvpTD.hpp"
#include "Game.hpp"
#include <Castor3D/Event/Frame/CpuFunctorEvent.hpp>
#include <Castor3D/Render/RenderLoop.hpp>
#include <Castor3D/Render/RenderTarget.hpp>
#include <Castor3D/Render/RenderWindow.hpp>
#include <wx/sizer.h>
using namespa... | 20.852217 | 177 | 0.640917 | [
"render"
] |
7febb1745428654871f2b027ff2adbefa7d4bb10 | 26,500 | cpp | C++ | sourcedata/jedit40source/jEdit/jeditshell/jedinstl/JELRegInstaller.cpp | DXYyang/SDP | 6ad0daf242d4062888ceca6d4a1bd4c41fd99b63 | [
"Apache-2.0"
] | 6 | 2020-10-27T06:11:59.000Z | 2021-09-09T13:52:42.000Z | sourcedata/jedit41source/jEdit/jeditshell/jedinstl/JELRegInstaller.cpp | DXYyang/SDP | 6ad0daf242d4062888ceca6d4a1bd4c41fd99b63 | [
"Apache-2.0"
] | 8 | 2020-11-16T20:41:38.000Z | 2022-02-01T01:05:45.000Z | sourcedata/jedit41source/jEdit/jeditshell/jedinstl/JELRegInstaller.cpp | DXYyang/SDP | 6ad0daf242d4062888ceca6d4a1bd4c41fd99b63 | [
"Apache-2.0"
] | null | null | null | /*
* JELRegInstaller.cpp - part of jEditLauncher package
* Copyright (C) 2001 John Gellene
* jgellene@nyc.rr.com
*
* Notwithstanding the terms of the General Public License, the author grants
* permission to compile and link object code generated by the compilation of
* this program with object code and librarie... | 29.608939 | 101 | 0.709396 | [
"object"
] |
7feca11c06b3a5c0220a461919833275e5f72faa | 2,251 | cpp | C++ | ho.cpp | e-eight/basis_func | 5374e4c034c4d25c019d9338ac9c0ec39929dd70 | [
"MIT"
] | null | null | null | ho.cpp | e-eight/basis_func | 5374e4c034c4d25c019d9338ac9c0ec39929dd70 | [
"MIT"
] | null | null | null | ho.cpp | e-eight/basis_func | 5374e4c034c4d25c019d9338ac9c0ec39929dd70 | [
"MIT"
] | null | null | null | #include "ho.h"
#include <cmath>
#include <stdexcept>
namespace basis_func {
namespace ho {
void WaveFunctionsUptoMaxN(Eigen::ArrayXXd& vals, const Eigen::ArrayXd& pts,
const std::size_t& max_n, const std::size_t& l,
const double& length, const Space& space)
{
i... | 27.790123 | 79 | 0.522434 | [
"vector"
] |
7ff0ad1b2b7817ec50269b998199fb63fcfbaf67 | 1,675 | cpp | C++ | aws-cpp-sdk-sso-oidc/source/model/StartDeviceAuthorizationResult.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-sso-oidc/source/model/StartDeviceAuthorizationResult.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2022-01-03T23:59:37.000Z | 2022-01-03T23:59:37.000Z | aws-cpp-sdk-sso-oidc/source/model/StartDeviceAuthorizationResult.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2022-03-23T15:17:18.000Z | 2022-03-23T15:17:18.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/sso-oidc/model/StartDeviceAuthorizationResult.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <aws/core/AmazonWebServiceResult.h>
#include <aws/core/utils/StringUtils.h>
#inc... | 22.333333 | 128 | 0.740299 | [
"model"
] |
7ff4d945e8146d90ca92591dabc82a0871684b74 | 1,758 | cpp | C++ | NinjaGaiden/Ninja/CrouchingState.cpp | Kaos1105/Ninja-Gaiden-NES | 4d1cfd5ca045587ac6b14b738a46e78951f54bbe | [
"MIT"
] | null | null | null | NinjaGaiden/Ninja/CrouchingState.cpp | Kaos1105/Ninja-Gaiden-NES | 4d1cfd5ca045587ac6b14b738a46e78951f54bbe | [
"MIT"
] | null | null | null | NinjaGaiden/Ninja/CrouchingState.cpp | Kaos1105/Ninja-Gaiden-NES | 4d1cfd5ca045587ac6b14b738a46e78951f54bbe | [
"MIT"
] | 1 | 2019-05-15T07:37:00.000Z | 2019-05-15T07:37:00.000Z | #include "CrouchingState.h"
CrouchingState::CrouchingState(StateGameObject * gameObject)
{
this->gameObject = gameObject;
}
void CrouchingState::Idle()
{
gameObject->SetIsCrouching(false);
gameObject->SetState(gameObject->GetIdleState());
}
void CrouchingState::Attack()
{
//Tiếng kiếm kêu
if (this->gameObject->... | 21.975 | 88 | 0.726962 | [
"render"
] |
3d15aa52852114582da3a1ce862b75a8afd86ad1 | 5,070 | cpp | C++ | light.cpp | block8437/GameEngine | e4b452c33781566e55e9339efee9441ddb924f58 | [
"MIT"
] | null | null | null | light.cpp | block8437/GameEngine | e4b452c33781566e55e9339efee9441ddb924f58 | [
"MIT"
] | 1 | 2017-04-05T00:58:21.000Z | 2017-04-05T00:58:21.000Z | light.cpp | block8437/GameEngine | e4b452c33781566e55e9339efee9441ddb924f58 | [
"MIT"
] | null | null | null | #include "light.h"
static float ratio = 40.0f;
b2Vec2 b2Scale(b2Vec2 vector, float scale ) {
return b2Vec2(vector.x * scale, vector.y * scale);
}
namespace GameEngine {
Light::Light(World* _world, int _x, int _y, float _r, float _g, float _b, int _windowWidth, int _windowHeight, GLuint _shader) {
world = _world... | 31.296296 | 129 | 0.649112 | [
"render",
"object",
"shape",
"vector"
] |
3d1a70d80798bc7385c222baa98ed2b3ac55b7fb | 793 | cpp | C++ | VNOJ/Dynamic_Programming/DP_on_Trees/mtree.cpp | hoanghai1803/CP_Training | 03495a21509fb3ab7fc64674b9a1b0c7d4327ecb | [
"MIT"
] | 4 | 2021-08-25T10:53:32.000Z | 2021-09-30T03:25:50.000Z | VNOJ/Dynamic_Programming/DP_on_Trees/mtree.cpp | hoanghai1803/CP_Training | 03495a21509fb3ab7fc64674b9a1b0c7d4327ecb | [
"MIT"
] | null | null | null | VNOJ/Dynamic_Programming/DP_on_Trees/mtree.cpp | hoanghai1803/CP_Training | 03495a21509fb3ab7fc64674b9a1b0c7d4327ecb | [
"MIT"
] | null | null | null | // Author: __BruteForce__
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef pair<int, int> ii;
#define MAX_N 100005
#define MOD 1000000007
int n;
vector<ii> adj[MAX_N];
int64 sum[MAX_N], res = 0;
void dfs(int u, int par) {
for (auto e: adj[u]) {
int v = e.first, w = e.secon... | 19.825 | 60 | 0.48802 | [
"vector"
] |
3d1de0cb8f134e37cbc1b7a3a30b81bcfc9b5c96 | 332 | hpp | C++ | include/awl/cursor/const_optional_object_ref_fwd.hpp | freundlich/libawl | 0d51f388a6b662373058cb51a24ef25ed826fa0f | [
"BSL-1.0"
] | null | null | null | include/awl/cursor/const_optional_object_ref_fwd.hpp | freundlich/libawl | 0d51f388a6b662373058cb51a24ef25ed826fa0f | [
"BSL-1.0"
] | null | null | null | include/awl/cursor/const_optional_object_ref_fwd.hpp | freundlich/libawl | 0d51f388a6b662373058cb51a24ef25ed826fa0f | [
"BSL-1.0"
] | null | null | null | #ifndef AWL_CURSOR_CONST_OPTIONAL_OBJECT_REF_FWD_HPP_INCLUDED
#define AWL_CURSOR_CONST_OPTIONAL_OBJECT_REF_FWD_HPP_INCLUDED
#include <awl/cursor/object_fwd.hpp>
#include <fcppt/optional/reference_fwd.hpp>
namespace awl::cursor
{
using const_optional_object_ref = fcppt::optional::reference<awl::cursor::object const>;... | 22.133333 | 88 | 0.837349 | [
"object"
] |
3d2ad388c658ffb4e4e4bdc5d370b47177a53f59 | 49,873 | cpp | C++ | vlib/ssci/bio/randseq.cpp | syntheticgio/fda-hive | 5e645c6a5b76b5a437635631819a1c934c7fd7fc | [
"Unlicense",
"MIT"
] | null | null | null | vlib/ssci/bio/randseq.cpp | syntheticgio/fda-hive | 5e645c6a5b76b5a437635631819a1c934c7fd7fc | [
"Unlicense",
"MIT"
] | null | null | null | vlib/ssci/bio/randseq.cpp | syntheticgio/fda-hive | 5e645c6a5b76b5a437635631819a1c934c7fd7fc | [
"Unlicense",
"MIT"
] | null | null | null | /*
* ::718604!
*
* Copyright(C) November 20, 2014 U.S. Food and Drug Administration
* Authors: Dr. Vahan Simonyan (1), Dr. Raja Mazumder (2), et al
* Affiliation: Food and Drug Administration (1), George Washington University (2)
*
* All rights Reserved.
*
* The MIT License (MIT)
*
* Permission is hereb... | 36.113686 | 275 | 0.536603 | [
"vector"
] |
3d31c4c60ff5a10098f5ebf9e6d9292a03b852ee | 85,426 | cpp | C++ | drivers/ksfilter/ks/shmisc.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | drivers/ksfilter/ks/shmisc.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | drivers/ksfilter/ks/shmisc.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | /*++
Copyright (C) Microsoft Corporation, 1998 - 1999
Module Name:
shmisc.cpp
Abstract:
This module contains miscellaneous functions for the kernel streaming
filter .
Author:
Dale Sather (DaleSat) 31-Jul-1998
--*/
#include "ksp.h"
#include <kcom.h>
#ifdef ALLOC_DATA_PRAG... | 23.264161 | 130 | 0.574579 | [
"object"
] |
3d324818b2f052a7f78779088b1d9d4511c8ac7c | 16,746 | cpp | C++ | apps/pose_proposal/pose_proposal.cpp | mhalber/Rescan | f45283be31119e9bd955d40bc159b1774dfed092 | [
"MIT"
] | 15 | 2019-09-18T19:29:50.000Z | 2022-03-03T11:11:35.000Z | apps/pose_proposal/pose_proposal.cpp | mhalber/Rescan | f45283be31119e9bd955d40bc159b1774dfed092 | [
"MIT"
] | 1 | 2020-03-10T12:41:02.000Z | 2020-03-17T10:38:58.000Z | apps/pose_proposal/pose_proposal.cpp | mhalber/Rescan | f45283be31119e9bd955d40bc159b1774dfed092 | [
"MIT"
] | 4 | 2019-10-08T18:18:41.000Z | 2020-10-24T04:43:17.000Z |
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cassert>
#include "msh/msh_std.h"
#include "msh/msh_vec_math.h"
#include "msh/msh_geometry.h"
#include "msh/msh_hash_grid.h"
#include "mg/hashtable.h"
#include "msh/msh_ply.h"
#include "rs_pointcloud.h"
#include "rs_... | 35.254737 | 131 | 0.612445 | [
"object",
"shape",
"model",
"transform"
] |
3d424f66019488844ed588b4507a0573aad936c3 | 30,223 | cxx | C++ | panda/src/distort/projectionScreen.cxx | kestred/panda3d | 16bfd3750f726a8831771b81649d18d087917fd5 | [
"PHP-3.01",
"PHP-3.0"
] | 3 | 2018-03-09T12:07:29.000Z | 2021-02-25T06:50:25.000Z | panda/src/distort/projectionScreen.cxx | Sinkay/panda3d | 16bfd3750f726a8831771b81649d18d087917fd5 | [
"PHP-3.01",
"PHP-3.0"
] | null | null | null | panda/src/distort/projectionScreen.cxx | Sinkay/panda3d | 16bfd3750f726a8831771b81649d18d087917fd5 | [
"PHP-3.01",
"PHP-3.0"
] | null | null | null | // Filename: projectionScreen.cxx
// Created by: drose (11Dec01)
//
////////////////////////////////////////////////////////////////////
//
// PANDA 3D SOFTWARE
// Copyright (c) Carnegie Mellon University. All rights reserved.
//
// All use of this software is subject to the terms of the revised BSD
// license. You ... | 38.256962 | 128 | 0.585944 | [
"mesh",
"geometry",
"render",
"object",
"transform",
"3d"
] |
3d462b187953fb9945166356bf33db4ff0edf1c1 | 2,234 | hpp | C++ | include/global_kernel_functions.hpp | rgcv/libcgal-julia | 8d5bc5f13d3c9c6160cfff795d2a0bbe1e473d94 | [
"MIT"
] | 5 | 2020-01-22T14:06:29.000Z | 2021-09-23T11:29:18.000Z | include/global_kernel_functions.hpp | rgcv/libcgal-julia | 8d5bc5f13d3c9c6160cfff795d2a0bbe1e473d94 | [
"MIT"
] | null | null | null | include/global_kernel_functions.hpp | rgcv/libcgal-julia | 8d5bc5f13d3c9c6160cfff795d2a0bbe1e473d94 | [
"MIT"
] | 2 | 2021-02-16T13:56:02.000Z | 2022-03-14T17:17:30.000Z | #ifndef CGAL_JL_GLOBAL_KERNEL_FUNCTIONS_HPP
#define CGAL_JL_GLOBAL_KERNEL_FUNCTIONS_HPP
#include <boost/variant/apply_visitor.hpp>
#include <boost/variant/variant.hpp>
#include <jlcxx/type_conversion.hpp>
#include <julia.h>
#include "kernel.hpp"
#include "kernel_conversion.hpp"
namespace jlcgal {
struct Intersect... | 22.34 | 79 | 0.680394 | [
"vector"
] |
3d4801a5973f40bb75fc6a8ed6b21dc013be5c95 | 612 | cpp | C++ | test/math/enumerate_k-th_power.test.cpp | emthrm/library | 0876ba7ec64e23b5ec476a7a0b4880d497a36be1 | [
"Unlicense"
] | 1 | 2021-12-26T14:17:29.000Z | 2021-12-26T14:17:29.000Z | test/math/enumerate_k-th_power.test.cpp | emthrm/library | 0876ba7ec64e23b5ec476a7a0b4880d497a36be1 | [
"Unlicense"
] | 3 | 2020-07-13T06:23:02.000Z | 2022-02-16T08:54:26.000Z | test/math/enumerate_k-th_power.test.cpp | emthrm/library | 0876ba7ec64e23b5ec476a7a0b4880d497a36be1 | [
"Unlicense"
] | null | null | null | /*
* @brief 数学/$i^k \bmod m \ (0 \leq i \leq n)$
*/
#define PROBLEM "https://yukicoder.me/problems/no/1409"
#include <iostream>
#include <vector>
#include "../../math/enumerate_k-th_power.hpp"
int main() {
int t;
std::cin >> t;
while (t--) {
int v, x;
std::cin >> v >> x;
int p = x *... | 22.666667 | 72 | 0.477124 | [
"vector"
] |
3d48986c18abf006a3701f7db1505741dc0c51cd | 1,691 | hpp | C++ | vm/builtin/data.hpp | bruce/rubinius | 44d3bdd0d988a17de1fe446bd29d2e9dede65f45 | [
"BSD-3-Clause"
] | 1 | 2017-09-09T21:28:06.000Z | 2017-09-09T21:28:06.000Z | vm/builtin/data.hpp | bruce/rubinius | 44d3bdd0d988a17de1fe446bd29d2e9dede65f45 | [
"BSD-3-Clause"
] | null | null | null | vm/builtin/data.hpp | bruce/rubinius | 44d3bdd0d988a17de1fe446bd29d2e9dede65f45 | [
"BSD-3-Clause"
] | null | null | null | #ifndef RBX_BUILTIN_DATA_HPP
#define RBX_BUILTIN_DATA_HPP
#include "builtin/object.hpp"
#include "type_info.hpp"
namespace rubinius {
// HACK manually copied here from ruby.h
struct RDataExposed {
void (*dmark)(void*);
void (*dfree)(void*);
void *data;
};
class Data : public Object {
public:
... | 19.894118 | 80 | 0.612064 | [
"object"
] |
3d48c762de42d61ef0206ebfef037861c837557f | 26,627 | cpp | C++ | src/database/impl/BufferedSequenceDatabase.cpp | nileshpatra/plast-library | 7c962282fdb68ac1f48a587e03fbb1a1b70a7a32 | [
"Intel",
"DOC"
] | 9 | 2016-09-30T05:44:35.000Z | 2020-09-03T19:40:06.000Z | src/database/impl/BufferedSequenceDatabase.cpp | nileshpatra/plast-library | 7c962282fdb68ac1f48a587e03fbb1a1b70a7a32 | [
"Intel",
"DOC"
] | 10 | 2017-05-05T14:55:16.000Z | 2022-01-24T18:21:51.000Z | src/database/impl/BufferedSequenceDatabase.cpp | nileshpatra/plast-library | 7c962282fdb68ac1f48a587e03fbb1a1b70a7a32 | [
"Intel",
"DOC"
] | 1 | 2020-12-05T21:33:27.000Z | 2020-12-05T21:33:27.000Z | /*****************************************************************************
* *
* PLAST : Parallel Local Alignment Search Tool *
* Version 2.3, released November 2015 *
* ... | 33.493082 | 158 | 0.54272 | [
"vector"
] |
3d594e417a5e62ce743e17a7fa9953c2d429e5ba | 733 | cpp | C++ | moitre.cpp | darksidergod/CompetitiveProgramming | ea0ee53bddd87e41b4586dd30c1d4a6b8ae3a93a | [
"MIT"
] | null | null | null | moitre.cpp | darksidergod/CompetitiveProgramming | ea0ee53bddd87e41b4586dd30c1d4a6b8ae3a93a | [
"MIT"
] | null | null | null | moitre.cpp | darksidergod/CompetitiveProgramming | ea0ee53bddd87e41b4586dd30c1d4a6b8ae3a93a | [
"MIT"
] | 1 | 2020-10-03T19:48:05.000Z | 2020-10-03T19:48:05.000Z | #include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define ii pair<int, int>
using namespace std;
bool visited[1000000];
int main(void)
{
int t;
cin>>t;
while(t--)
{
int x, y, e, citiesbought=0;
cin>>e;
memset(visited, 0, sizeof(visited));
for(int i=0; i<e; i++)
{
cin>>x>>y... | 14.096154 | 39 | 0.521146 | [
"vector"
] |
3d5a17c6a6eee6c2350c951f86296e599040f318 | 3,826 | cc | C++ | cdrs/src/model/AddCdrsMonitorRequest.cc | aliyun/aliyun-openapi-cpp-sdk | 0cf5861ece17dfb0bb251f13bf3fbdb39c0c6e36 | [
"Apache-2.0"
] | 89 | 2018-02-02T03:54:39.000Z | 2021-12-13T01:32:55.000Z | cdrs/src/model/AddCdrsMonitorRequest.cc | aliyun/aliyun-openapi-cpp-sdk | 0cf5861ece17dfb0bb251f13bf3fbdb39c0c6e36 | [
"Apache-2.0"
] | 89 | 2018-03-14T07:44:54.000Z | 2021-11-26T07:43:25.000Z | cdrs/src/model/AddCdrsMonitorRequest.cc | aliyun/aliyun-openapi-cpp-sdk | 0cf5861ece17dfb0bb251f13bf3fbdb39c0c6e36 | [
"Apache-2.0"
] | 69 | 2018-01-22T09:45:52.000Z | 2022-03-28T07:58:38.000Z | /*
* Copyright 2009-2017 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... | 25.337748 | 93 | 0.769995 | [
"model"
] |
87e702f00e6e990041eb93b79acaf2e44ebf6d0c | 11,560 | cc | C++ | src/float-counts-to-pre-arpa.cc | RoseSAK/pocolm | 2da2b6e5a709fb40021f7bbcdd18d84f174dfe30 | [
"Apache-2.0"
] | 88 | 2016-04-16T03:42:04.000Z | 2022-02-10T17:45:39.000Z | src/float-counts-to-pre-arpa.cc | RoseSAK/pocolm | 2da2b6e5a709fb40021f7bbcdd18d84f174dfe30 | [
"Apache-2.0"
] | 81 | 2016-05-09T00:07:18.000Z | 2022-02-02T05:59:04.000Z | src/float-counts-to-pre-arpa.cc | RoseSAK/pocolm | 2da2b6e5a709fb40021f7bbcdd18d84f174dfe30 | [
"Apache-2.0"
] | 43 | 2016-05-17T04:51:10.000Z | 2022-01-25T12:14:15.000Z | // float-counts-to-pre-arpa.cc
// Copyright 2016 Johns Hopkins University (Author: Daniel Povey)
// See ../COPYING for clarification regarding multiple 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 obta... | 39.725086 | 126 | 0.630969 | [
"vector"
] |
87e9d6195ca146034f08f71f288a85d002023a85 | 3,301 | cpp | C++ | src/test-case/grammar.cpp | andrei-datcu/cxxhttp | dce2eb99fd9c61baa75d92cd328f355882daf698 | [
"MIT"
] | 29 | 2017-06-06T13:42:13.000Z | 2021-03-19T11:12:23.000Z | src/test-case/grammar.cpp | andrei-datcu/cxxhttp | dce2eb99fd9c61baa75d92cd328f355882daf698 | [
"MIT"
] | 1 | 2017-04-24T21:37:05.000Z | 2017-05-14T20:45:53.000Z | src/test-case/grammar.cpp | andrei-datcu/cxxhttp | dce2eb99fd9c61baa75d92cd328f355882daf698 | [
"MIT"
] | 5 | 2017-12-28T20:04:48.000Z | 2020-06-03T19:38:18.000Z | /* Test cases for some of the grammar rules.
*
* HTTP is described in a modified ABNF, which for this library was translated
* to regular expressions. Since the two aren't the same, this tests some of the
* grammar rules to ensure they allow things that ought to be allowed and reject
* things that aren't allowed.
... | 33.683673 | 80 | 0.588004 | [
"vector"
] |
e2013fd87d901e844261c53680b2fd6387131395 | 382 | cpp | C++ | Data Structures/Array/C++/Arrays - DS.cpp | abdzitter/Daily-Coding-DS-ALGO-Practice | 26ddbf7a3673608039a07d26d812fce31b69871a | [
"MIT"
] | 289 | 2021-05-15T22:56:03.000Z | 2022-03-28T23:13:25.000Z | Data Structures/Array/C++/Arrays - DS.cpp | abdzitter/Daily-Coding-DS-ALGO-Practice | 26ddbf7a3673608039a07d26d812fce31b69871a | [
"MIT"
] | 1,812 | 2021-05-09T13:49:58.000Z | 2022-01-15T19:27:17.000Z | Data Structures/Array/C++/Arrays - DS.cpp | abdzitter/Daily-Coding-DS-ALGO-Practice | 26ddbf7a3673608039a07d26d812fce31b69871a | [
"MIT"
] | 663 | 2021-05-09T16:57:58.000Z | 2022-03-27T14:15:07.000Z | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
/*
*
* Prosen Ghosh
* American International University - Bangladesh (AIUB)
*
*/
int main() {
int T,ar[1000];
cin >> T;
for(int i = 0;i < T; i++)cin >> ar[i];
for(i... | 17.363636 | 59 | 0.539267 | [
"vector"
] |
e203efb7b5b7d33ac9cc3cb28a3149f2a1cef2d9 | 3,286 | hpp | C++ | softlight/include/softlight/SL_WindowBufferXlib.hpp | Kim-Du-Yeon/SoftLight | 26c1c04be5a99167f2cda0c7a992cecdc8259968 | [
"MIT"
] | 27 | 2019-04-22T01:51:51.000Z | 2022-02-11T06:12:17.000Z | softlight/include/softlight/SL_WindowBufferXlib.hpp | Kim-Du-Yeon/SoftLight | 26c1c04be5a99167f2cda0c7a992cecdc8259968 | [
"MIT"
] | 1 | 2021-11-12T05:19:52.000Z | 2021-11-12T05:19:52.000Z | softlight/include/softlight/SL_WindowBufferXlib.hpp | Kim-Du-Yeon/SoftLight | 26c1c04be5a99167f2cda0c7a992cecdc8259968 | [
"MIT"
] | 2 | 2020-09-07T03:04:39.000Z | 2021-11-09T06:08:37.000Z |
#ifndef SL_WINDOW_BUFFER_XLIB_HPP
#define SL_WINDOW_BUFFER_XLIB_HPP
#include "softlight/SL_WindowBuffer.hpp"
// Should be defined by the build system
// OSX with XQuartz runs out of memory when attaching textures to shared
// memory segments.
#ifndef SL_ENABLE_XSHM
#define SL_ENABLE_XSHM 0
#endif /* SL_ENABLE_... | 23.640288 | 94 | 0.556908 | [
"render"
] |
e20dbd5cfd712eada49358d7c027f9dc59cc5e41 | 6,777 | hpp | C++ | include/idocp/cost/cost_function_component_base.hpp | z8674558/idocp | 946524db7ae4591b578be2409ca619961572e7be | [
"BSD-3-Clause"
] | 43 | 2020-10-13T03:43:45.000Z | 2021-09-23T05:29:48.000Z | include/idocp/cost/cost_function_component_base.hpp | z8674558/idocp | 946524db7ae4591b578be2409ca619961572e7be | [
"BSD-3-Clause"
] | 32 | 2020-10-21T09:40:16.000Z | 2021-10-24T00:00:04.000Z | include/idocp/cost/cost_function_component_base.hpp | z8674558/idocp | 946524db7ae4591b578be2409ca619961572e7be | [
"BSD-3-Clause"
] | 4 | 2020-10-08T05:47:16.000Z | 2021-10-15T12:15:26.000Z | #ifndef IDOCP_COST_FUNCTION_COMPONENT_BASE_HPP_
#define IDOCP_COST_FUNCTION_COMPONENT_BASE_HPP_
#include "Eigen/Core"
#include "idocp/robot/robot.hpp"
#include "idocp/cost/cost_function_data.hpp"
#include "idocp/ocp/split_solution.hpp"
#include "idocp/ocp/split_kkt_residual.hpp"
#include "idocp/ocp/split_kkt_matrix.h... | 34.576531 | 81 | 0.666224 | [
"object",
"model"
] |
e217492aa787b09539dda9650239fd3f383c0c07 | 18,838 | cpp | C++ | quakelib/src/QuakeLibMetadata.cpp | kwschultz/VirtualCalifornia | 1e6b0a70f00f953018e8bd5336f8f94c5dad04b9 | [
"MIT"
] | null | null | null | quakelib/src/QuakeLibMetadata.cpp | kwschultz/VirtualCalifornia | 1e6b0a70f00f953018e8bd5336f8f94c5dad04b9 | [
"MIT"
] | null | null | null | quakelib/src/QuakeLibMetadata.cpp | kwschultz/VirtualCalifornia | 1e6b0a70f00f953018e8bd5336f8f94c5dad04b9 | [
"MIT"
] | null | null | null | // Copyright (c) 2012 Eric Heien <emheien@ucdavis.edu>
//
// 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, mod... | 39.995754 | 191 | 0.740153 | [
"vector"
] |
e222da21bc5ea85adcb827017223983f9c9dd7e7 | 688 | hpp | C++ | Uebungsaufgaben/Beispielklausuren/labor2_loesung/graph.hpp | TEL21D/Informatik2 | d0a6b6b5a0fe5dd404dadfd50d25543d5c6d5075 | [
"MIT"
] | null | null | null | Uebungsaufgaben/Beispielklausuren/labor2_loesung/graph.hpp | TEL21D/Informatik2 | d0a6b6b5a0fe5dd404dadfd50d25543d5c6d5075 | [
"MIT"
] | null | null | null | Uebungsaufgaben/Beispielklausuren/labor2_loesung/graph.hpp | TEL21D/Informatik2 | d0a6b6b5a0fe5dd404dadfd50d25543d5c6d5075 | [
"MIT"
] | null | null | null | #ifndef GRAPH_H
#define GRAPH_H
#include <iostream>
#include <string>
#include <vector>
struct User {
std::string _username; // Name des Benutzers
std::string _town; // Wohnort des Benutzers
std::string _unicourse; // Studiengang des Benutzers
std::vector<User *> _friends;
User(std::string name, std::st... | 22.933333 | 116 | 0.668605 | [
"vector"
] |
e223380e588f043eddc7d8bc0c556973ff79155b | 5,971 | cpp | C++ | tests/tests-iter/test-move-assign.cpp | eepp/yactfr | 5cec5680d025d82a4f175ffc19c0704b32ef529f | [
"MIT"
] | 7 | 2016-08-26T14:20:06.000Z | 2022-02-03T21:17:25.000Z | tests/tests-iter/test-move-assign.cpp | eepp/yactfr | 5cec5680d025d82a4f175ffc19c0704b32ef529f | [
"MIT"
] | 2 | 2018-05-29T17:43:37.000Z | 2018-05-30T18:38:39.000Z | tests/tests-iter/test-move-assign.cpp | eepp/yactfr | 5cec5680d025d82a4f175ffc19c0704b32ef529f | [
"MIT"
] | null | null | null | /*
* Copyright (C) 2018-2022 Philippe Proulx <eepp.ca>
*
* This software may be modified and distributed under the terms
* of the MIT license. See the LICENSE file for details.
*/
#include <limits>
#include <cstring>
#include <sstream>
#include <iostream>
#include <vector>
#include <yactfr/yactfr.hpp>
#include ... | 17.770833 | 100 | 0.44197 | [
"vector"
] |
e22417b9080cb62a75ab82f3848bad2846d432ca | 13,383 | cpp | C++ | src/app/imgui_nvrhi.cpp | Kuranes/KickstartRT_demo | 6de7453ca42e46db180f8bead7ba23f9e8936b69 | [
"MIT"
] | 83 | 2021-07-19T13:55:33.000Z | 2022-03-29T16:00:57.000Z | src/app/imgui_nvrhi.cpp | CompileException/donut | bc400a8c2c9db9c3c5ed16190dc108e75722b503 | [
"MIT"
] | 2 | 2021-11-04T06:41:28.000Z | 2021-11-30T08:25:28.000Z | src/app/imgui_nvrhi.cpp | CompileException/donut | bc400a8c2c9db9c3c5ed16190dc108e75722b503 | [
"MIT"
] | 10 | 2021-07-19T15:03:58.000Z | 2022-01-10T07:15:35.000Z | /*
* Copyright (c) 2014-2021, NVIDIA CORPORATION. All rights reserved.
*
* 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,... | 32.963054 | 147 | 0.663304 | [
"render",
"object"
] |
e224c9381ab95d4aa0d987a22928df8ba4a14fb4 | 1,119 | cpp | C++ | ndcmd_img.cpp | nsdrozario/nd_cmd_paint | a35a222bd68f782b7cf0ee100afddc47d3212e28 | [
"MIT"
] | null | null | null | ndcmd_img.cpp | nsdrozario/nd_cmd_paint | a35a222bd68f782b7cf0ee100afddc47d3212e28 | [
"MIT"
] | null | null | null | ndcmd_img.cpp | nsdrozario/nd_cmd_paint | a35a222bd68f782b7cf0ee100afddc47d3212e28 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <fstream>
#include "headers/paint.h"
#include "headers/file.h"
nd_cmd_paint::image_data::image_data(int sx, int sy)
: size_x(sx), size_y(sy)
{
for (int y=0; y<sy; y++) {
this->data.push_back(std::vector<int>()); // default value
for (int x=0; x<sx;... | 25.431818 | 72 | 0.598749 | [
"vector"
] |
e22a5f8b80717bb4c4f5fc70f17ddba29013a56f | 4,549 | cpp | C++ | src/compiler/ir_optimizer.cpp | LangUMS/langums | 99487610e7c8feb07c7250eea7cf09ec2bee8037 | [
"MIT"
] | 24 | 2017-05-27T13:46:44.000Z | 2021-07-04T11:42:10.000Z | src/compiler/ir_optimizer.cpp | LangUMS/langums | 99487610e7c8feb07c7250eea7cf09ec2bee8037 | [
"MIT"
] | 6 | 2017-10-05T01:41:28.000Z | 2021-01-25T21:23:24.000Z | src/compiler/ir_optimizer.cpp | LangUMS/langums | 99487610e7c8feb07c7250eea7cf09ec2bee8037 | [
"MIT"
] | 3 | 2017-05-07T05:44:30.000Z | 2021-07-04T11:43:46.000Z | #include "ir_optimizer.h"
namespace LangUMS
{
std::vector<std::unique_ptr<IIRInstruction>> IROptimizer::Process(std::vector<std::unique_ptr<IIRInstruction>> instructions)
{
m_Instructions = std::move(instructions);
return std::move(m_Instructions);
}
bool IROptimizer::EliminateRedund... | 30.945578 | 128 | 0.459222 | [
"vector"
] |
e23766c80111a28d3f9720268314e45dcd942d4e | 2,154 | cpp | C++ | library/appl_library_std_mgr.cpp | fboucher9/appl | bb90398cf9985d4cc0a2a079c4d49d891108e6d1 | [
"MIT"
] | null | null | null | library/appl_library_std_mgr.cpp | fboucher9/appl | bb90398cf9985d4cc0a2a079c4d49d891108e6d1 | [
"MIT"
] | null | null | null | library/appl_library_std_mgr.cpp | fboucher9/appl | bb90398cf9985d4cc0a2a079c4d49d891108e6d1 | [
"MIT"
] | null | null | null | /* See LICENSE for license details */
/*
*/
#if defined APPL_OS_LINUX
#include <appl_status.h>
#include <appl_types.h>
#include <object/appl_object.h>
#include <library/appl_library_mgr.h>
#include <library/appl_library_std_mgr.h>
#include <library/appl_library_node.h>
#include <library/appl_library_std_node.... | 16.569231 | 52 | 0.618384 | [
"object"
] |
e23cdbbdfba94f1326f346eb77ac48bf3f922824 | 1,342 | hpp | C++ | sdk/core/perf/inc/azure/perf/random_stream.hpp | RickWinter/azure-sdk-for-cpp | b4fe751310f53669a941e00aa93072f2d10a4eba | [
"MIT"
] | 96 | 2020-03-19T07:49:39.000Z | 2022-03-20T14:22:41.000Z | sdk/core/perf/inc/azure/perf/random_stream.hpp | RickWinter/azure-sdk-for-cpp | b4fe751310f53669a941e00aa93072f2d10a4eba | [
"MIT"
] | 2,572 | 2020-03-18T22:54:53.000Z | 2022-03-31T22:09:59.000Z | sdk/core/perf/inc/azure/perf/random_stream.hpp | RickWinter/azure-sdk-for-cpp | b4fe751310f53669a941e00aa93072f2d10a4eba | [
"MIT"
] | 81 | 2020-03-19T09:42:00.000Z | 2022-03-24T05:11:05.000Z | // Copyright (c) Microsoft Corporation. All rights reserved.
// SPDX-License-Identifier: MIT
/**
* @file
* @brief A random stream of any specific size. Useful for test cases.
*
*/
#pragma once
#include <azure/core/io/body_stream.hpp>
#include <memory>
#include <random>
namespace Azure { namespace Perf {
/**... | 24.851852 | 97 | 0.660209 | [
"vector"
] |
e23e7b2a29f40648c5aa1edcb40b9785148c1e60 | 3,776 | cpp | C++ | src/asset/cubemap.cpp | chokomancarr/chokoengine2 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | [
"Apache-2.0"
] | null | null | null | src/asset/cubemap.cpp | chokomancarr/chokoengine2 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | [
"Apache-2.0"
] | null | null | null | src/asset/cubemap.cpp | chokomancarr/chokoengine2 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | [
"Apache-2.0"
] | null | null | null | #include "chokoengine.hpp"
#include "texture_internal.hpp"
#include "backend/chokoengine_backend.hpp"
#include "glsl/minVert.h"
#include "glsl/presum_ggx_cube.h"
CE_BEGIN_NAMESPACE
#define SAMPLES 1024
bool _CubeMap::initd;
Shader _CubeMap::ggxBlurShad;
TextureBuffer _CubeMap::noiseTex;
void _CubeMap::Init() {
(g... | 30.451613 | 115 | 0.65572 | [
"vector"
] |
f46c4706843f58c62fda99f1dc02b83005df3d4b | 6,224 | cpp | C++ | src/GameLogic/Game/TankClientGame.cpp | gameraccoon/tank-game | ec2ca0550269b8051c8742abdfad6ae8adc2a83a | [
"MIT"
] | null | null | null | src/GameLogic/Game/TankClientGame.cpp | gameraccoon/tank-game | ec2ca0550269b8051c8742abdfad6ae8adc2a83a | [
"MIT"
] | null | null | null | src/GameLogic/Game/TankClientGame.cpp | gameraccoon/tank-game | ec2ca0550269b8051c8742abdfad6ae8adc2a83a | [
"MIT"
] | null | null | null | #include "Base/precomp.h"
#include "GameLogic/Game/TankClientGame.h"
#include "Base/Types/TemplateHelpers.h"
#include "GameData/ComponentRegistration/ComponentFactoryRegistration.h"
#include "GameData/ComponentRegistration/ComponentJsonSerializerRegistration.h"
#include "GameData/ComponentRegistration/ComponentFact... | 47.151515 | 149 | 0.830977 | [
"transform"
] |
f46da8297bc6742f658687cb6863f8654affacf9 | 6,516 | cpp | C++ | src/edge/edge.cpp | Victoooooor/ECE-395-SeniorProj | 60a5a111401c0086a9eb801e1088f5e2a9a7331d | [
"MIT"
] | 2 | 2021-11-07T18:59:25.000Z | 2021-11-29T01:31:29.000Z | src/edge/edge.cpp | Victoooooor/Vectorize-Arch | 60a5a111401c0086a9eb801e1088f5e2a9a7331d | [
"MIT"
] | 1 | 2022-02-10T14:21:52.000Z | 2022-02-10T14:21:52.000Z | src/edge/edge.cpp | Victoooooor/ECE-395-SeniorProj | 60a5a111401c0086a9eb801e1088f5e2a9a7331d | [
"MIT"
] | null | null | null | #include <png++/png.hpp>
#include <iostream>
#include <queue>
#define L 50
using namespace std;
typedef pair<int, int> cord;
int main(int argc, char **argv) {
if (argc < 2) {
printf("incorrect params, expected: ./.exe <input> <output>\n");
exit(EXIT_FAILURE);
}
// Load image
png::ima... | 40.981132 | 108 | 0.26903 | [
"vector"
] |
f477452dab8b4b5f812a70b9d9b0e0aea04aae89 | 5,100 | cpp | C++ | cpp/concurrency/matrix_mul_openmp.cpp | dasfex/Algorithms | 21d6d32816c997bf5d4c2a99f61a79f8e97a653e | [
"Unlicense"
] | 1 | 2020-03-31T08:05:57.000Z | 2020-03-31T08:05:57.000Z | cpp/concurrency/matrix_mul_openmp.cpp | dasfex/Algorithms | 21d6d32816c997bf5d4c2a99f61a79f8e97a653e | [
"Unlicense"
] | 2 | 2021-11-17T16:36:18.000Z | 2021-12-18T11:03:03.000Z | cpp/concurrency/matrix_mul_openmp.cpp | dasfex/practice | 21d6d32816c997bf5d4c2a99f61a79f8e97a653e | [
"Unlicense"
] | 1 | 2020-12-27T11:24:54.000Z | 2020-12-27T11:24:54.000Z | #include <cstring>
#include <chrono>
#include <stdexcept>
#include <string>
#include <iostream>
#include <vector>
#define VERIFY(condition, message) \
if (!(condition)) { \
throw std::runtime_error(std::string("File: ") + \
std::string(__FILE__) + \
st... | 28.651685 | 116 | 0.559412 | [
"vector"
] |
f47f32fed94ab5b6667a05504c236d53371e20c1 | 58,187 | cpp | C++ | source/memory/brmemoryhandle.cpp | Olde-Skuul/burgerlib | 80848a4dfa17c5c05095ecea14a9bd87f86dfb9d | [
"Zlib"
] | 115 | 2015-01-18T17:29:30.000Z | 2022-01-30T04:31:48.000Z | source/memory/brmemoryhandle.cpp | Olde-Skuul/burgerlib | 80848a4dfa17c5c05095ecea14a9bd87f86dfb9d | [
"Zlib"
] | 9 | 2015-01-22T04:53:38.000Z | 2015-01-31T13:52:40.000Z | source/memory/brmemoryhandle.cpp | Olde-Skuul/burgerlib | 80848a4dfa17c5c05095ecea14a9bd87f86dfb9d | [
"Zlib"
] | 9 | 2015-01-23T20:06:46.000Z | 2020-05-20T16:06:00.000Z | /***************************************
Handle based memory manager
Copyright (c) 1995-2017 by Rebecca Ann Heineman <becky@burgerbecky.com>
It is released under an MIT Open Source license. Please see LICENSE for
license details. Yes, you can use it in a commercial title without paying
anything, just give me a ... | 30.80307 | 101 | 0.66453 | [
"object"
] |
f4937ad473335b8988e5d3536201899134fbff4e | 25,512 | hxx | C++ | main/sfx2/inc/sfx2/itemconnect.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/sfx2/inc/sfx2/itemconnect.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/sfx2/inc/sfx2/itemconnect.hxx | 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... | 43.094595 | 104 | 0.639817 | [
"object"
] |
f496c758453a176c1c9d245331345b8dd5bc34a8 | 4,467 | cpp | C++ | emulator/src/devices/machine/i8214.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | 1 | 2022-01-15T21:38:38.000Z | 2022-01-15T21:38:38.000Z | emulator/src/devices/machine/i8214.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | null | null | null | emulator/src/devices/machine/i8214.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | null | null | null | // license:BSD-3-Clause
// copyright-holders:Curt Coder
/**********************************************************************
Intel 8214/3214 Priority Interrupt Control Unit
**********************************************************************/
#include "emu.h"
#include "i8214.h"
//#define VERBOSE 1
#include... | 19.941964 | 107 | 0.427132 | [
"vector"
] |
f49903486a0ed6e23358915bd02a7554b5a8e630 | 3,627 | cpp | C++ | test/test_logging_console_output_handler.cpp | jdlangs/rcutils | 10dca5bdb9f822ebb86f65eb6ba5120a9c60da27 | [
"Apache-2.0"
] | 40 | 2017-06-16T18:28:32.000Z | 2022-02-28T22:10:32.000Z | test/test_logging_console_output_handler.cpp | jdlangs/rcutils | 10dca5bdb9f822ebb86f65eb6ba5120a9c60da27 | [
"Apache-2.0"
] | 263 | 2017-04-20T18:33:04.000Z | 2022-03-28T18:17:39.000Z | test/test_logging_console_output_handler.cpp | jdlangs/rcutils | 10dca5bdb9f822ebb86f65eb6ba5120a9c60da27 | [
"Apache-2.0"
] | 82 | 2017-04-21T16:38:55.000Z | 2022-03-28T05:31:45.000Z | // Copyright 2020 Open Source Robotics Foundation, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by appli... | 37.010204 | 99 | 0.74166 | [
"vector"
] |
f49ddb246784f69ff86fb4d40a3c847426dcccc6 | 4,671 | cpp | C++ | MonoNative/mscorlib/System/IO/mscorlib_System_IO_DriveInfo.cpp | brunolauze/MonoNative | 959fb52c2c1ffe87476ab0d6e4fcce0ad9ce1e66 | [
"BSD-2-Clause"
] | 7 | 2015-03-10T03:36:16.000Z | 2021-11-05T01:16:58.000Z | MonoNative/mscorlib/System/IO/mscorlib_System_IO_DriveInfo.cpp | brunolauze/MonoNative | 959fb52c2c1ffe87476ab0d6e4fcce0ad9ce1e66 | [
"BSD-2-Clause"
] | 1 | 2020-06-23T10:02:33.000Z | 2020-06-24T02:05:47.000Z | MonoNative/mscorlib/System/IO/mscorlib_System_IO_DriveInfo.cpp | brunolauze/MonoNative | 959fb52c2c1ffe87476ab0d6e4fcce0ad9ce1e66 | [
"BSD-2-Clause"
] | null | null | null | #include <mscorlib/System/IO/mscorlib_System_IO_DriveInfo.h>
#include <mscorlib/System/IO/mscorlib_System_IO_DirectoryInfo.h>
#include <mscorlib/System/mscorlib_System_Type.h>
namespace mscorlib
{
namespace System
{
namespace IO
{
//Public Methods
std::vector<mscorlib::System::IO::DriveInfo*> DriveInfo:... | 38.603306 | 163 | 0.71034 | [
"vector"
] |
f4a1ceaf59bea2e6c8f627ec9959897ce561f59e | 11,215 | cpp | C++ | RBVREnhanced/Hooking.cpp | InvoxiPlayGames/RBVREnhanced | 2b65bcad0c15f5c00ce323a600f01f6741307da3 | [
"MIT"
] | 1 | 2022-03-09T16:59:39.000Z | 2022-03-09T16:59:39.000Z | RBVREnhanced/Hooking.cpp | InvoxiPlayGames/RBVREnhanced | 2b65bcad0c15f5c00ce323a600f01f6741307da3 | [
"MIT"
] | null | null | null | RBVREnhanced/Hooking.cpp | InvoxiPlayGames/RBVREnhanced | 2b65bcad0c15f5c00ce323a600f01f6741307da3 | [
"MIT"
] | null | null | null | /*
Original source: https://github.com/khalladay/hooking-by-example
MIT License
Copyright (c) 2020 Kyle Halladay
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 r... | 34.507692 | 119 | 0.68025 | [
"vector"
] |
f4aaaea12d514feedaab22c61f18f7d57d797394 | 3,819 | hpp | C++ | tools/Vitis-AI-Library/mnistclassification/include/vitis/ai/mnistclassification.hpp | bluetiger9/Vitis-AI | a7728733bbcfc292ff3afa46b9c8b03e94b740b3 | [
"Apache-2.0"
] | 848 | 2019-12-03T00:16:17.000Z | 2022-03-31T22:53:17.000Z | tools/Vitis-AI-Library/mnistclassification/include/vitis/ai/mnistclassification.hpp | wangyifan778/Vitis-AI | f61061eef7550d98bf02a171604c9a9f283a7c47 | [
"Apache-2.0"
] | 656 | 2019-12-03T00:48:46.000Z | 2022-03-31T18:41:54.000Z | tools/Vitis-AI-Library/mnistclassification/include/vitis/ai/mnistclassification.hpp | wangyifan778/Vitis-AI | f61061eef7550d98bf02a171604c9a9f283a7c47 | [
"Apache-2.0"
] | 506 | 2019-12-03T00:46:26.000Z | 2022-03-30T10:34:56.000Z | /*
* Copyright 2019 Xilinx Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to ... | 27.673913 | 93 | 0.700969 | [
"vector",
"model"
] |
f4b1c86746202615534fd78ece06ceef28221b02 | 5,342 | cpp | C++ | Sources/CEigenBridge/eigen_s_rat.cpp | taketo1024/swm-eigen | 952ecdb73a2739641e75909c8d9e724e32b2ed0f | [
"MIT"
] | 6 | 2021-09-19T07:55:41.000Z | 2021-11-10T00:43:47.000Z | Sources/CEigenBridge/eigen_s_rat.cpp | taketo1024/swm-eigen | 952ecdb73a2739641e75909c8d9e724e32b2ed0f | [
"MIT"
] | null | null | null | Sources/CEigenBridge/eigen_s_rat.cpp | taketo1024/swm-eigen | 952ecdb73a2739641e75909c8d9e724e32b2ed0f | [
"MIT"
] | null | null | null | //
// File.cpp
//
//
// Created by Taketo Sano on 2021/06/10.
//
#import "eigen_s_rat.h"
#import "types/Rational.hpp"
#import <iostream>
#import <Eigen/Eigen>
using namespace std;
using namespace Eigen;
using R = RationalNum;
using Mat = SparseMatrix<R>;
void *eigen_s_rat_init(int_t rows, int_t cols) {
Mat... | 25.079812 | 87 | 0.569637 | [
"vector"
] |
f4b379a13dc7a7f42b49f8bdc3d552f7a8285422 | 2,697 | cpp | C++ | C++/Algorithms/Arrays/RotateArray.cpp | joao-neves95/Exercises_Challenges_Courses | 02b6e25d9a270395bbf6dc8111c2419bba4f3edc | [
"MIT"
] | null | null | null | C++/Algorithms/Arrays/RotateArray.cpp | joao-neves95/Exercises_Challenges_Courses | 02b6e25d9a270395bbf6dc8111c2419bba4f3edc | [
"MIT"
] | 4 | 2018-11-10T01:05:14.000Z | 2021-06-25T15:16:28.000Z | C++/Algorithms/Arrays/RotateArray.cpp | joao-neves95/Exercises_Challenges_Courses | 02b6e25d9a270395bbf6dc8111c2419bba4f3edc | [
"MIT"
] | null | null | null | /**
* @file RotateArray.cpp
* @author João Neves (https://github.com/joao-neves95)
* @brief
Given an array, rotate the array to the right by k steps, where k is non-negative.
E.g:
Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
- rotate 1 steps to the right: [7,... | 26.441176 | 85 | 0.522803 | [
"vector"
] |
f4b3a14899e8427680e23c930e8aef69430f45c7 | 19,100 | cpp | C++ | lib/debug/host/HostDebugger.cpp | alexbatashev/pi_reproduce | 7129111ff80b9d76e4dfad26f1f2b67ef3826e52 | [
"Apache-2.0"
] | null | null | null | lib/debug/host/HostDebugger.cpp | alexbatashev/pi_reproduce | 7129111ff80b9d76e4dfad26f1f2b67ef3826e52 | [
"Apache-2.0"
] | 4 | 2021-07-05T12:14:37.000Z | 2021-07-29T18:39:42.000Z | lib/debug/host/HostDebugger.cpp | alexbatashev/pi_reproduce | 7129111ff80b9d76e4dfad26f1f2b67ef3826e52 | [
"Apache-2.0"
] | null | null | null | #include "HostDebugger.hpp"
#include <Acceptor.h>
#include <Plugins/Process/gdb-remote/GDBRemoteCommunicationServerLLGS.h>
#include <lldb/Core/Module.h>
#include <lldb/Core/PluginManager.h>
#include <lldb/Host/ConnectionFileDescriptor.h>
#include <lldb/Host/MainLoop.h>
#include <lldb/Host/common/NativeProcessProtocol.... | 28.678679 | 119 | 0.677644 | [
"object",
"vector",
"transform"
] |
f4b44663d38bacf9e423d6fbf2bd206e4769feac | 4,403 | cpp | C++ | source/plum/platform/glfw/tilemap.cpp | Bananattack/Plum | 60ae0b07c0ef25dfa4bda6e81fe646ace6042664 | [
"BSD-3-Clause"
] | 5 | 2015-02-10T03:50:28.000Z | 2017-08-23T08:49:49.000Z | source/plum/platform/glfw/tilemap.cpp | Bananattack/Plum | 60ae0b07c0ef25dfa4bda6e81fe646ace6042664 | [
"BSD-3-Clause"
] | null | null | null | source/plum/platform/glfw/tilemap.cpp | Bananattack/Plum | 60ae0b07c0ef25dfa4bda6e81fe646ace6042664 | [
"BSD-3-Clause"
] | 1 | 2019-10-05T08:54:56.000Z | 2019-10-05T08:54:56.000Z | #include "engine.h"
#include "../../core/image.h"
#include "../../core/sheet.h"
#include "../../core/screen.h"
#include "../../core/tilemap.h"
namespace plum
{
class Tilemap::Impl
{
public:
Impl(int width, int height)
: width(width), height(height), vertices(new ... | 38.622807 | 139 | 0.482625 | [
"transform"
] |
f4b8c9d98f6d2e1b4d9e5945d016fcd83257444a | 2,770 | hpp | C++ | Ref/CLEMOps/CLEMOpsComponentImpl.hpp | brhs17/fprime | 647eb40bfa68df774401fe12cb6171c53c27f846 | [
"Apache-2.0"
] | null | null | null | Ref/CLEMOps/CLEMOpsComponentImpl.hpp | brhs17/fprime | 647eb40bfa68df774401fe12cb6171c53c27f846 | [
"Apache-2.0"
] | null | null | null | Ref/CLEMOps/CLEMOpsComponentImpl.hpp | brhs17/fprime | 647eb40bfa68df774401fe12cb6171c53c27f846 | [
"Apache-2.0"
] | null | null | null | // ======================================================================
// \title CLEMOpsImpl.hpp
// \author bhs
// \brief hpp file for CLEMOps component implementation class
//
// \copyright
// Copyright 2009-2015, by the California Institute of Technology.
// ALL RIGHTS RESERVED. United States Government Sponso... | 30.43956 | 79 | 0.517329 | [
"object"
] |
f4be94eb9e9c536beb6397be07e1f90a6f569464 | 5,488 | hpp | C++ | include/El/number_theory/factor/PollardRho.hpp | pjt1988/Elemental | 71d3e2b98829594e9f52980a8b1ef7c1e99c724b | [
"Apache-2.0"
] | 473 | 2015-01-11T03:22:11.000Z | 2022-03-31T05:28:39.000Z | include/El/number_theory/factor/PollardRho.hpp | pjt1988/Elemental | 71d3e2b98829594e9f52980a8b1ef7c1e99c724b | [
"Apache-2.0"
] | 205 | 2015-01-10T20:33:45.000Z | 2021-07-25T14:53:25.000Z | include/El/number_theory/factor/PollardRho.hpp | pjt1988/Elemental | 71d3e2b98829594e9f52980a8b1ef7c1e99c724b | [
"Apache-2.0"
] | 109 | 2015-02-16T14:06:42.000Z | 2022-03-23T21:34:26.000Z | /*
Copyright (c) 2009-2016, Jack Poulson
All rights reserved.
This file is part of Elemental and is under the BSD 2-Clause License,
which can be found in the LICENSE file in the root directory, or at
http://opensource.org/licenses/BSD-2-Clause
*/
#ifndef EL_NUMBER_THEORY_FACTOR_POLLARD_RHO_HPP
#define... | 25.64486 | 79 | 0.474672 | [
"vector"
] |
f4c0ce94af42d1cf97d5a622333a423ca479531f | 105,677 | cpp | C++ | Plugins/BLUI/Intermediate/Build/Win64/UE4Editor/Inc/Blu/Blu.generated.cpp | crimsonstrife/velorum-defunct | 1a6e1eab9057293da2aa045eff021d069df54c5e | [
"CC0-1.0"
] | null | null | null | Plugins/BLUI/Intermediate/Build/Win64/UE4Editor/Inc/Blu/Blu.generated.cpp | crimsonstrife/velorum-defunct | 1a6e1eab9057293da2aa045eff021d069df54c5e | [
"CC0-1.0"
] | null | null | null | Plugins/BLUI/Intermediate/Build/Win64/UE4Editor/Inc/Blu/Blu.generated.cpp | crimsonstrife/velorum-defunct | 1a6e1eab9057293da2aa045eff021d069df54c5e | [
"CC0-1.0"
] | null | null | null | // Copyright 1998-2016 Epic Games, Inc. All Rights Reserved.
/*===========================================================================
Boilerplate C++ definitions for a single module.
This is automatically generated by UnrealHeaderTool.
DO NOT modify this manually! Edit the corresponding .h files instead!
======... | 68.399353 | 501 | 0.80906 | [
"object"
] |
f4db0eaf31f974aa28fa737f720318908c0a31cc | 925 | cpp | C++ | Brio/src/Brio/Renderer/Texture.cpp | Ckyre/brio | 77a41a2a9d16c20542b60b2425e44525d3f4eef8 | [
"Apache-2.0"
] | null | null | null | Brio/src/Brio/Renderer/Texture.cpp | Ckyre/brio | 77a41a2a9d16c20542b60b2425e44525d3f4eef8 | [
"Apache-2.0"
] | null | null | null | Brio/src/Brio/Renderer/Texture.cpp | Ckyre/brio | 77a41a2a9d16c20542b60b2425e44525d3f4eef8 | [
"Apache-2.0"
] | null | null | null | #include "brpch.h"
#include "Texture.h"
#include "Renderer.h"
#include "Platform/OpenGL/OpenGLTexture.h"
namespace Brio
{
Ref<Texture2D> Texture2D::Create(const std::string& path)
{
switch (Renderer::GetAPI())
{
case RendererAPI::API::None: BR_CORE_ASSERT(false, "No graphics API selected"); return nullptr;... | 28.90625 | 116 | 0.72973 | [
"vector"
] |
f4e08e35c9c471d7d470ef43858f1ae648adc292 | 864 | hpp | C++ | include/aikido/robot/InverseKinematics.hpp | personalrobotics/r3 | 1303e3f3ef99a0c2249abc7415d19113f0026565 | [
"BSD-3-Clause"
] | null | null | null | include/aikido/robot/InverseKinematics.hpp | personalrobotics/r3 | 1303e3f3ef99a0c2249abc7415d19113f0026565 | [
"BSD-3-Clause"
] | null | null | null | include/aikido/robot/InverseKinematics.hpp | personalrobotics/r3 | 1303e3f3ef99a0c2249abc7415d19113f0026565 | [
"BSD-3-Clause"
] | null | null | null | #ifndef AIKIDO_ROBOT_IK_INVERSEKINEMATICS_HPP_
#define AIKIDO_ROBOT_IK_INVERSEKINEMATICS_HPP_
namespace aikido {
namespace robot {
/// Interface for IK solvers used with the Robot class.
class InverseKinematics
{
public:
/// Returns a set of IK solutions for the given pose. Note that *at most*
/// \c maxSolutions... | 33.230769 | 80 | 0.756944 | [
"vector"
] |
f4e29a5da25e203aaddd065763ed8cead0c1ace1 | 537 | hh | C++ | userFiles/simu/io/opti/functions/OptiGeneration.hh | mharding01/augmented-neuromuscular-RT-running | 7e1ef00d3fdf9cfa9d59fc4f3a6a0e6dd792a834 | [
"MIT"
] | null | null | null | userFiles/simu/io/opti/functions/OptiGeneration.hh | mharding01/augmented-neuromuscular-RT-running | 7e1ef00d3fdf9cfa9d59fc4f3a6a0e6dd792a834 | [
"MIT"
] | null | null | null | userFiles/simu/io/opti/functions/OptiGeneration.hh | mharding01/augmented-neuromuscular-RT-running | 7e1ef00d3fdf9cfa9d59fc4f3a6a0e6dd792a834 | [
"MIT"
] | null | null | null | /*!
* ''author Nicolas Van der Noot
* ''file OptiResults.hh
* ''brief OptiResults
*/
#ifndef _OPTI_GENERATION_HH_
#define _OPTI_GENERATION_HH_
#include "OptiInputs.hh"
#include <vector>
/*! ''brief Inputs of the optimization: results generated after an optimization
*/
class OptiGeneration: public OptiInputs
{
... | 17.9 | 79 | 0.726257 | [
"vector"
] |
f4ec611124c9d47a1825b5ba03976ea69f795d61 | 1,284 | hpp | C++ | inc/optimization.hpp | samcoppini/xrfc | 34055b3f8673dac17f9b59de90d2eb17163f25f1 | [
"BSL-1.0"
] | null | null | null | inc/optimization.hpp | samcoppini/xrfc | 34055b3f8673dac17f9b59de90d2eb17163f25f1 | [
"BSL-1.0"
] | null | null | null | inc/optimization.hpp | samcoppini/xrfc | 34055b3f8673dac17f9b59de90d2eb17163f25f1 | [
"BSL-1.0"
] | null | null | null | #pragma once
#include "xrf-chunk.hpp"
namespace xrf {
/**
* Performs chunk-level optimizations on the provided list of chunks. This
* looks at each chunk individually and tries to optimize it as best as it can,
* by performing optimizations like eliminating unnecessary swap operations, or
* setting a known jump ... | 32.923077 | 79 | 0.725857 | [
"vector"
] |
f4f824405024cd0708e7a07ad025147bb167d41e | 56,465 | cpp | C++ | src/LifeCycle.cpp | RemiMattheyDoret/SimBit | ed0e64c0abb97c6c889bc0adeec1277cbc6cbe43 | [
"MIT"
] | 11 | 2017-06-06T23:02:48.000Z | 2021-08-17T20:13:05.000Z | src/LifeCycle.cpp | RemiMattheyDoret/SimBit | ed0e64c0abb97c6c889bc0adeec1277cbc6cbe43 | [
"MIT"
] | 1 | 2017-06-06T23:08:05.000Z | 2017-06-07T09:28:08.000Z | src/LifeCycle.cpp | RemiMattheyDoret/SimBit | ed0e64c0abb97c6c889bc0adeec1277cbc6cbe43 | [
"MIT"
] | null | null | null | /*
Author: Remi Matthey-Doret
MIT License
Copyright (c) 2017 Remi Matthey-Doret
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 limit... | 40.622302 | 222 | 0.550642 | [
"vector",
"model"
] |
76013e28ff5622e9da208ea1976c2b8a37605d9f | 3,853 | cpp | C++ | esphome/components/inkbird_ibsth1_mini/inkbird_ibsth1_mini.cpp | OttoWinter/esphomeyaml | 6a85259e4d6d1b0a0f819688b8e555efcb99ecb0 | [
"MIT"
] | 249 | 2018-04-07T12:04:11.000Z | 2019-01-25T01:11:34.000Z | esphome/components/inkbird_ibsth1_mini/inkbird_ibsth1_mini.cpp | OttoWinter/esphomeyaml | 6a85259e4d6d1b0a0f819688b8e555efcb99ecb0 | [
"MIT"
] | 243 | 2018-04-11T16:37:11.000Z | 2019-01-25T16:50:37.000Z | esphome/components/inkbird_ibsth1_mini/inkbird_ibsth1_mini.cpp | OttoWinter/esphomeyaml | 6a85259e4d6d1b0a0f819688b8e555efcb99ecb0 | [
"MIT"
] | 40 | 2018-04-10T05:50:14.000Z | 2019-01-25T15:20:36.000Z | #include "inkbird_ibsth1_mini.h"
#include "esphome/core/log.h"
#ifdef USE_ESP32
namespace esphome {
namespace inkbird_ibsth1_mini {
static const char *const TAG = "inkbird_ibsth1_mini";
void InkbirdIbstH1Mini::dump_config() {
ESP_LOGCONFIG(TAG, "Inkbird IBS TH1 MINI");
LOG_SENSOR(" ", "Temperature", this->temp... | 34.711712 | 102 | 0.697379 | [
"vector"
] |
7610cd32c59edad5589c39a8407ddfd3fc3adfd4 | 7,237 | cpp | C++ | controller/src/rpiMgr.cpp | rayray2002/LightDance-RPi | 266d6709f2ff0ee70da307dc6e7ab09679a207fe | [
"MIT"
] | null | null | null | controller/src/rpiMgr.cpp | rayray2002/LightDance-RPi | 266d6709f2ff0ee70da307dc6e7ab09679a207fe | [
"MIT"
] | null | null | null | controller/src/rpiMgr.cpp | rayray2002/LightDance-RPi | 266d6709f2ff0ee70da307dc6e7ab09679a207fe | [
"MIT"
] | null | null | null | #include "rpiMgr.h"
#include "OFrgba_to_rgb.hpp"
RPiMgr::RPiMgr(const string& dancerName) : _dancerName(dancerName) {}
bool RPiMgr::setDancer() {
string path = "../data/dancers/" + _dancerName + ".json";
ifstream infile(path.c_str());
if (!infile) {
cout << "Cannot open file: " << path << endl;
... | 27.412879 | 109 | 0.577311 | [
"vector"
] |
7615a175349bc242d7190634949a11ad6b3decfa | 3,671 | cpp | C++ | src/User Code/Tank.cpp | anunez97/fergilnad-game-engine | 75528633d32aed41223e0f52d8d7715073d9210a | [
"MIT"
] | null | null | null | src/User Code/Tank.cpp | anunez97/fergilnad-game-engine | 75528633d32aed41223e0f52d8d7715073d9210a | [
"MIT"
] | null | null | null | src/User Code/Tank.cpp | anunez97/fergilnad-game-engine | 75528633d32aed41223e0f52d8d7715073d9210a | [
"MIT"
] | null | null | null | // Tank
#include "Tank.h"
#include "ModelManager.h"
#include "TextureManager.h"
#include "ShaderManager.h"
#include "SceneManager.h"
#include "Scene.h"
#include "BulletFactory.h"
#include "SceneTest.h"
Tank::Tank()
:speed(1.0f), rotAngle(0.05f), turretOffset(7.0f), turretend(0, 2.0f, 15.0f)
{
Vect col... | 26.601449 | 204 | 0.676655 | [
"render"
] |
761d49b83c385f86fafdc1e5c5090278683a714f | 7,654 | cpp | C++ | CM2005 Object Oriented Programming/Midterm/Merkelrex-TradingBot/OrderBook.cpp | LevDoesCode/UoL | 312b2d1096af4925c94b81d656e5d326dbad939e | [
"MIT"
] | null | null | null | CM2005 Object Oriented Programming/Midterm/Merkelrex-TradingBot/OrderBook.cpp | LevDoesCode/UoL | 312b2d1096af4925c94b81d656e5d326dbad939e | [
"MIT"
] | null | null | null | CM2005 Object Oriented Programming/Midterm/Merkelrex-TradingBot/OrderBook.cpp | LevDoesCode/UoL | 312b2d1096af4925c94b81d656e5d326dbad939e | [
"MIT"
] | null | null | null | #include "OrderBook.h"
#include "CSVReader.h"
#include <map>
#include <algorithm>
#include <iostream>
/** construct, reading a csv data file */
OrderBook::OrderBook(std::string filename)
{
orders = CSVReader::readCSV(filename);
std::map<std::string, bool> prodMap;
for (OrderBookEntry &e : orders)
{
... | 33.423581 | 112 | 0.491116 | [
"vector"
] |
761ee00c374a10389ef9d0d21f32113e611f62e3 | 359 | cpp | C++ | CodeForces/Complete/500-599/523A-RotateFlipAndZoom.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 36 | 2019-12-27T08:23:08.000Z | 2022-01-24T20:35:47.000Z | CodeForces/Complete/500-599/523A-RotateFlipAndZoom.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 10 | 2019-11-13T02:55:18.000Z | 2021-10-13T23:28:09.000Z | CodeForces/Complete/500-599/523A-RotateFlipAndZoom.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 53 | 2020-08-15T11:08:40.000Z | 2021-10-09T15:51:38.000Z | #include <cstdio>
#include <iostream>
#include <vector>
int main(){
int w, h; scanf("%d %d\n", &w, &h);
std::vector<std::string> s(h);
for(int p = 0; p < h; p++){getline(std::cin, s[p]);}
for(int p = 0; p < 2 * w; p++){
for(int q = 0; q < 2 * h; q++){std::cout << s[q/2][p/2];}
std::cou... | 21.117647 | 65 | 0.462396 | [
"vector"
] |
7623aa6b3077534c5f531b86e3887d0501b38421 | 17,079 | cpp | C++ | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/internal/view/InputConnectionWrapper.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 7 | 2017-07-13T10:34:54.000Z | 2021-04-16T05:40:35.000Z | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/internal/view/InputConnectionWrapper.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | null | null | null | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/internal/view/InputConnectionWrapper.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 9 | 2017-07-13T12:33:20.000Z | 2021-06-19T02:46:48.000Z | //=========================================================================
// Copyright (C) 2012 The Elastos Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// ... | 26.47907 | 127 | 0.631243 | [
"object"
] |
7623c8ec9ed31d9e96f78ae27c9eb3130125d8a3 | 3,407 | cpp | C++ | src/demo/main.cpp | N4G170/sdl_gui | a3541d372a7884d0375df360f9244682a98a0de3 | [
"MIT"
] | null | null | null | src/demo/main.cpp | N4G170/sdl_gui | a3541d372a7884d0375df360f9244682a98a0de3 | [
"MIT"
] | null | null | null | src/demo/main.cpp | N4G170/sdl_gui | a3541d372a7884d0375df360f9244682a98a0de3 | [
"MIT"
] | null | null | null | #include <iostream>
#include "SDL.h"
#include "sdl_init.hpp"
#include "sdl_gui_demo.hpp"
#include <chrono>
int main(int argc, char* argv[])
{
SDL_Window* window{nullptr};
SDL_Renderer* renderer{nullptr};
//init SDL subsystems
SDLInitConfig sdl_config{};//load default values
bool init_result = Init... | 29.37069 | 165 | 0.560611 | [
"render"
] |
7629d58be54a4ad1acc3423e8e09579ecee4b5a4 | 1,413 | cpp | C++ | Algorithms/Easy/590.n-ary-tree-postorder-traversal.cpp | jtcheng/leetcode | db58973894757789d060301b589735b5985fe102 | [
"MIT"
] | null | null | null | Algorithms/Easy/590.n-ary-tree-postorder-traversal.cpp | jtcheng/leetcode | db58973894757789d060301b589735b5985fe102 | [
"MIT"
] | null | null | null | Algorithms/Easy/590.n-ary-tree-postorder-traversal.cpp | jtcheng/leetcode | db58973894757789d060301b589735b5985fe102 | [
"MIT"
] | null | null | null | /*
* @lc app=leetcode id=590 lang=cpp
*
* [590] N-ary Tree Postorder Traversal
*
* https://leetcode.com/problems/n-ary-tree-postorder-traversal/description/
*
* algorithms
* Easy (67.16%)
* Likes: 275
* Dislikes: 37
* Total Accepted: 37.4K
* Total Submissions: 55.5K
* Testcase Example: '{"$id":"1","... | 19.901408 | 225 | 0.553432 | [
"vector"
] |
762fd10e34c01cad30dcd8b0205915dd6e99e92e | 6,110 | cpp | C++ | src/analysis/processing/qgsalgorithmshortestpathlayertopoint.cpp | dyna-mis/Hilabeling | cb7d5d4be29624a20c8a367162dbc6fd779b2b52 | [
"MIT"
] | null | null | null | src/analysis/processing/qgsalgorithmshortestpathlayertopoint.cpp | dyna-mis/Hilabeling | cb7d5d4be29624a20c8a367162dbc6fd779b2b52 | [
"MIT"
] | null | null | null | src/analysis/processing/qgsalgorithmshortestpathlayertopoint.cpp | dyna-mis/Hilabeling | cb7d5d4be29624a20c8a367162dbc6fd779b2b52 | [
"MIT"
] | 1 | 2021-12-25T08:40:30.000Z | 2021-12-25T08:40:30.000Z | /***************************************************************************
qgsalgorithmshortestpathlayertopoint.cpp
---------------------
begin : July 2018
copyright : (C) 2018 by Alexander Bruy
email : alexander do... | 38.427673 | 193 | 0.634534 | [
"vector"
] |
7635f8f66e241cb465ecb59f668a760b734da714 | 10,548 | cpp | C++ | src/single_net/PreRoute.cpp | limbo018/dr-cu | 7ea9d4f019dd3fd75676c69395df3bfe88958f9f | [
"Unlicense"
] | null | null | null | src/single_net/PreRoute.cpp | limbo018/dr-cu | 7ea9d4f019dd3fd75676c69395df3bfe88958f9f | [
"Unlicense"
] | null | null | null | src/single_net/PreRoute.cpp | limbo018/dr-cu | 7ea9d4f019dd3fd75676c69395df3bfe88958f9f | [
"Unlicense"
] | 1 | 2020-04-13T18:44:39.000Z | 2020-04-13T18:44:39.000Z | #include "PreRoute.h"
db::RouteStatus PreRoute::run(int numPitchForGuideExpand) {
// expand guides uniformally
auto& guides = localNet.routeGuides;
for (int i = 0; i < guides.size(); ++i) {
int expand = localNet.dbNet.routeGuideVios[i] ? numPitchForGuideExpand : db::setting.defaultGuideExpand;
... | 44.885106 | 119 | 0.558589 | [
"vector"
] |
764bd883880f0e454ef179fadb41edab81926b60 | 596 | cpp | C++ | tools/ruleTree/List.cpp | riyadhariwal1/Gaming-Engine | 96cbebe52979d822828585911f8c1a67a639dc83 | [
"MIT"
] | null | null | null | tools/ruleTree/List.cpp | riyadhariwal1/Gaming-Engine | 96cbebe52979d822828585911f8c1a67a639dc83 | [
"MIT"
] | null | null | null | tools/ruleTree/List.cpp | riyadhariwal1/Gaming-Engine | 96cbebe52979d822828585911f8c1a67a639dc83 | [
"MIT"
] | null | null | null | #include "include/List.h"
List:: List(){
}
List::List (string value){
this -> value = value;
}
void List :: execute(State& state){
//TODO: get the list from game state
list = state.getStateList(value);
//TODO: Interpreter for configuration.Rounds.upfrom(1)
}
void List :: accept(AstVisitor& visitor, ... | 17.028571 | 67 | 0.651007 | [
"vector"
] |
764cea74de97244e94dcab5356cb61a0cc59304e | 1,119 | cpp | C++ | src/solver.cpp | Aldrog/math-modelling | 97ee1855368a0789f269da6aa758df0f2e88a37f | [
"MIT"
] | null | null | null | src/solver.cpp | Aldrog/math-modelling | 97ee1855368a0789f269da6aa758df0f2e88a37f | [
"MIT"
] | null | null | null | src/solver.cpp | Aldrog/math-modelling | 97ee1855368a0789f269da6aa758df0f2e88a37f | [
"MIT"
] | null | null | null | /*
* Copyright © 2017 Andrew Penkrat
*
* Distributed under the terms of MIT License.
*
* You should have received a copy of the MIT License along with the application.
* If not, see <http://opensource.org/licenses/MIT>.
*/
#include "solver.h"
#include <QElapsedTimer>
#include <QThread>
#include <QDebug>
Solver... | 31.083333 | 113 | 0.685433 | [
"model"
] |
7652f28c641a8e7d97d479efad3ef3458326f2d1 | 1,027 | hpp | C++ | third_party/boost/simd/function/split_low.hpp | SylvainCorlay/pythran | 908ec070d837baf77d828d01c3e35e2f4bfa2bfa | [
"BSD-3-Clause"
] | 6 | 2018-02-25T22:23:33.000Z | 2021-01-15T15:13:12.000Z | third_party/boost/simd/function/split_low.hpp | SylvainCorlay/pythran | 908ec070d837baf77d828d01c3e35e2f4bfa2bfa | [
"BSD-3-Clause"
] | null | null | null | third_party/boost/simd/function/split_low.hpp | SylvainCorlay/pythran | 908ec070d837baf77d828d01c3e35e2f4bfa2bfa | [
"BSD-3-Clause"
] | 7 | 2017-12-12T12:36:31.000Z | 2020-02-10T14:27:07.000Z | //==================================================================================================
/**
Copyright 2016 NumScale SAS
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
**/
//====================================... | 29.342857 | 100 | 0.610516 | [
"object"
] |
76628becc2d73d426b486f54dc296c6fec281056 | 5,794 | cpp | C++ | TestIrrlicht/main.cpp | jbvovau/test-irrlicht | 826ab8be97c4d7a013278992e042d96bb2e252fa | [
"MIT"
] | null | null | null | TestIrrlicht/main.cpp | jbvovau/test-irrlicht | 826ab8be97c4d7a013278992e042d96bb2e252fa | [
"MIT"
] | null | null | null | TestIrrlicht/main.cpp | jbvovau/test-irrlicht | 826ab8be97c4d7a013278992e042d96bb2e252fa | [
"MIT"
] | 1 | 2018-06-11T14:57:27.000Z | 2018-06-11T14:57:27.000Z |
#ifdef _IRR_WINDOWS_
#pragma comment(lib, "Irrlicht.lib")
#pragma comment(linker, "/subsystem:windows /ENTRY:mainCRTStartup")
#endif
#include <irrlicht.h>
#include "prout.h"
#include "event.h"
using namespace irr;
using namespace core;
using namespace scene;
using namespace video;
using namespace io;
using namespa... | 30.983957 | 313 | 0.719537 | [
"object"
] |
7663f0432e17c1331fa0067c7005075f38e90644 | 25,067 | cpp | C++ | openbabel-2.4.1/src/formats/mol2format.cpp | sxhexe/reaction-route-search | f7694c84ca1def4a133ade3e1e2e09705cd28312 | [
"MIT"
] | 1 | 2017-09-16T07:36:29.000Z | 2017-09-16T07:36:29.000Z | openbabel-2.4.1/src/formats/mol2format.cpp | sxhexe/reaction-route-search | f7694c84ca1def4a133ade3e1e2e09705cd28312 | [
"MIT"
] | null | null | null | openbabel-2.4.1/src/formats/mol2format.cpp | sxhexe/reaction-route-search | f7694c84ca1def4a133ade3e1e2e09705cd28312 | [
"MIT"
] | null | null | null | /**********************************************************************
Copyright (C) 1998-2001 by OpenEye Scientific Software, Inc.
Some portions Copyright (C) 2001-2007 by Geoffrey R. Hutchison
Some portions Copyright (C) 2004 by Chris Morley
This program is free software; you can redistribute it and/or modify
it un... | 34.244536 | 114 | 0.5372 | [
"vector"
] |
7667a6458c1c1b0604c1d8804af4c4f0c8987ed5 | 1,077 | cpp | C++ | SimpleEngine/SimpleEngine/SimpleEngine.cpp | Akara4ok/-__- | b6f76ae2d0e180429eb2c64911327056aa1c8357 | [
"MIT"
] | null | null | null | SimpleEngine/SimpleEngine/SimpleEngine.cpp | Akara4ok/-__- | b6f76ae2d0e180429eb2c64911327056aa1c8357 | [
"MIT"
] | null | null | null | SimpleEngine/SimpleEngine/SimpleEngine.cpp | Akara4ok/-__- | b6f76ae2d0e180429eb2c64911327056aa1c8357 | [
"MIT"
] | null | null | null | #include <iostream>
#include <ctime>
#include "BMPWriter.h"
#include "Scene.h"
#include "LightSource.h"
#include "Box.h"
int main() {
int start = clock();
int end;
Camera camera(0.08, 0.09, 0.16, 1080, 1920);
Ray player(Vector3(0, 1, 0), Vector3(0, -1, 0));
//Ray player(Vector3(3, 3, 4), Vector3(-3, -3, -4));
Li... | 29.108108 | 91 | 0.612813 | [
"object",
"vector"
] |
766dc416d24a4ef3eb44d33369b93bde7961c10f | 2,327 | cpp | C++ | problemsets/Live Archive/Central Europe - 2007/billboard.cpp | juarezpaulino/coderemite | a4649d3f3a89d234457032d14a6646b3af339ac1 | [
"Apache-2.0"
] | null | null | null | problemsets/Live Archive/Central Europe - 2007/billboard.cpp | juarezpaulino/coderemite | a4649d3f3a89d234457032d14a6646b3af339ac1 | [
"Apache-2.0"
] | null | null | null | problemsets/Live Archive/Central Europe - 2007/billboard.cpp | juarezpaulino/coderemite | a4649d3f3a89d234457032d14a6646b3af339ac1 | [
"Apache-2.0"
] | null | null | null | /**
*
* Author: Juarez Paulino(coderemite)
* Email: juarez.paulino@gmail.com
*
*/
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define FOR(i,m,n... | 27.05814 | 77 | 0.525999 | [
"vector"
] |
7673110d89094433ae9bc0ce8f77479f23cf9f86 | 64 | cpp | C++ | spotify_stream/src/web/model/artist.cpp | Yanick-Salzmann/carpi | 29f5e1bf1eb6243e45690f040e4df8e7c228e897 | [
"Apache-2.0"
] | 2 | 2020-06-07T16:47:20.000Z | 2021-03-20T10:41:34.000Z | spotify_stream/src/web/model/artist.cpp | Yanick-Salzmann/carpi | 29f5e1bf1eb6243e45690f040e4df8e7c228e897 | [
"Apache-2.0"
] | null | null | null | spotify_stream/src/web/model/artist.cpp | Yanick-Salzmann/carpi | 29f5e1bf1eb6243e45690f040e4df8e7c228e897 | [
"Apache-2.0"
] | null | null | null | #include "artist.hpp"
namespace carpi::spotify::web::model {
} | 12.8 | 38 | 0.703125 | [
"model"
] |
7674910a99dd97af84d27664c99ae1bd3ff329cf | 785 | cpp | C++ | archive/4/un.cpp | Aleshkev/algoritmika | fc95b0c0f318d9eb4ef1fef4cc3c6e85d2417189 | [
"MIT"
] | 2 | 2019-05-04T09:37:09.000Z | 2019-05-22T18:07:28.000Z | archive/4/un.cpp | Aleshkev/algoritmika | fc95b0c0f318d9eb4ef1fef4cc3c6e85d2417189 | [
"MIT"
] | null | null | null | archive/4/un.cpp | Aleshkev/algoritmika | fc95b0c0f318d9eb4ef1fef4cc3c6e85d2417189 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
const size_t MAX_M = 256;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
uint32_t n, q;
cin >> n >> q;
const size_t Q = ceil(sqrt(n)) + 1;
vector<int32_t> A(n);
vector<vector<int32_t>> S(MAX_M, vector<int32_t>(Q + 1, 1));
fo... | 18.255814 | 79 | 0.453503 | [
"vector"
] |
7674f22e3bee19db7494267a3af9a36a4e775d97 | 2,964 | hpp | C++ | src/Factory/Simulation/EXIT/EXIT.hpp | WilliamMajor/aff3ct | 4e71ab99f33a040ec06336d3e1d50bd2c0d6a579 | [
"MIT"
] | 1 | 2022-02-17T08:47:47.000Z | 2022-02-17T08:47:47.000Z | src/Factory/Simulation/EXIT/EXIT.hpp | WilliamMajor/aff3ct | 4e71ab99f33a040ec06336d3e1d50bd2c0d6a579 | [
"MIT"
] | null | null | null | src/Factory/Simulation/EXIT/EXIT.hpp | WilliamMajor/aff3ct | 4e71ab99f33a040ec06336d3e1d50bd2c0d6a579 | [
"MIT"
] | 1 | 2022-02-15T23:32:39.000Z | 2022-02-15T23:32:39.000Z | #if !defined(AFF3CT_8BIT_PREC) && !defined(AFF3CT_16BIT_PREC)
#ifndef FACTORY_SIMULATION_EXIT_HPP_
#define FACTORY_SIMULATION_EXIT_HPP_
#include <vector>
#include <string>
#include <map>
#include "Tools/Arguments/Argument_tools.hpp"
#include "Tools/auto_cloned_unique_ptr.hpp"
#include "Factory/Module/Source/Source.h... | 31.870968 | 113 | 0.689609 | [
"vector"
] |
768d9d7bca822e8ca09e9ff1c2eec794f5be6d7b | 2,323 | hh | C++ | src/mvn.hh | ScottishCovidResponse/BEEPmbp | 784f96dc6415710e7d969717f1a08434c7b33c10 | [
"BSD-2-Clause"
] | null | null | null | src/mvn.hh | ScottishCovidResponse/BEEPmbp | 784f96dc6415710e7d969717f1a08434c7b33c10 | [
"BSD-2-Clause"
] | 13 | 2020-07-13T20:03:24.000Z | 2021-04-11T12:24:15.000Z | src/mvn.hh | ScottishCovidResponse/BEEPmbp | 784f96dc6415710e7d969717f1a08434c7b33c10 | [
"BSD-2-Clause"
] | 2 | 2020-09-02T09:50:00.000Z | 2022-03-07T02:29:39.000Z | #ifndef BEEPMBP__MVN_HH
#define BEEPMBP__MVN_HH
#include "struct.hh"
class MVN // Multivariate normal
{
public:
string name; // The name of the multivariate normal
unsigned int ntr, nac, nbo; // Keeps track of acceptance of propos... | 49.425532 | 132 | 0.662936 | [
"vector",
"model"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.