hexsha stringlengths 40 40 | size int64 7 1.05M | ext stringclasses 13
values | lang stringclasses 1
value | max_stars_repo_path stringlengths 4 269 | max_stars_repo_name stringlengths 5 108 | max_stars_repo_head_hexsha stringlengths 40 40 | max_stars_repo_licenses listlengths 1 9 | max_stars_count int64 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 4 269 | max_issues_repo_name stringlengths 5 116 | max_issues_repo_head_hexsha stringlengths 40 40 | max_issues_repo_licenses listlengths 1 9 | max_issues_count int64 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 4 269 | max_forks_repo_name stringlengths 5 116 | max_forks_repo_head_hexsha stringlengths 40 40 | max_forks_repo_licenses listlengths 1 9 | max_forks_count int64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 7 1.05M | avg_line_length float64 1.21 330k | max_line_length int64 6 990k | alphanum_fraction float64 0.01 0.99 | author_id stringlengths 2 40 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d2524a730ed575f4317f425ea7d902dada5e6103 | 4,739 | cpp | C++ | src/framework/fastapi/BaseHttpRequestParams.cpp | AronProgram/pccl | d9f1c5ee3ed81d3195fab0765bb58cce1c97a91a | [
"MIT"
] | 3 | 2020-11-02T01:12:36.000Z | 2021-03-12T08:44:57.000Z | src/framework/fastapi/BaseHttpRequestParams.cpp | AronProgram/pccl | d9f1c5ee3ed81d3195fab0765bb58cce1c97a91a | [
"MIT"
] | null | null | null | src/framework/fastapi/BaseHttpRequestParams.cpp | AronProgram/pccl | d9f1c5ee3ed81d3195fab0765bb58cce1c97a91a | [
"MIT"
] | 1 | 2021-03-12T08:44:30.000Z | 2021-03-12T08:44:30.000Z | /**
* pccl is pleased to support the open source community by making Tars available.
*
* Copyright (C) 2016THL A29 Limited, a Tencent company. All rights reserved.
*
* Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
* in compliance with the License. You may obtain a copy... | 18.226923 | 106 | 0.683689 | AronProgram |
d256c83666ad4cee9089b186ee1de5b9456c9586 | 545 | cpp | C++ | src/unity/lib/annotation/class_registrations.cpp | LeeCenY/turicreate | fb2f3bf313e831ceb42a2e10aacda6e472ea8d93 | [
"BSD-3-Clause"
] | null | null | null | src/unity/lib/annotation/class_registrations.cpp | LeeCenY/turicreate | fb2f3bf313e831ceb42a2e10aacda6e472ea8d93 | [
"BSD-3-Clause"
] | 2 | 2022-01-13T04:03:55.000Z | 2022-03-12T01:02:31.000Z | src/unity/lib/annotation/class_registrations.cpp | ZeroInfinite/turicreate | dd210c2563930881abd51fd69cb73007955b33fd | [
"BSD-3-Clause"
] | null | null | null | #include <unity/lib/annotation/class_registrations.hpp>
#include <unity/lib/annotation/annotation_base.hpp>
#include <unity/lib/annotation/image_classification.hpp>
namespace turi {
namespace annotate {
BEGIN_CLASS_REGISTRATION
REGISTER_CLASS(ImageClassification)
REGISTER_CLASS(annotation_global)
END_CLASS_REGISTRAT... | 27.25 | 65 | 0.822018 | LeeCenY |
d257626bef78f94d4cd9fbcdbdf1ed92003ef3b1 | 587 | cpp | C++ | CSES-Problemset/sorting and searching/ferris_wheel.cpp | rranjan14/cp-solutions | 9614508efbed1e4ee8b970b5eed535d782a5783f | [
"MIT"
] | null | null | null | CSES-Problemset/sorting and searching/ferris_wheel.cpp | rranjan14/cp-solutions | 9614508efbed1e4ee8b970b5eed535d782a5783f | [
"MIT"
] | null | null | null | CSES-Problemset/sorting and searching/ferris_wheel.cpp | rranjan14/cp-solutions | 9614508efbed1e4ee8b970b5eed535d782a5783f | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
#define vlli vector<long long int>
typedef long long int lli;
using namespace std;
int main()
{
lli n, x, count = 0;
cin >> n >> x;
vlli p(n, 0);
for (int i = 0; i < n; i++)
{
cin >> p[i];
}
sort(p.begin(), p.end());
lli ... | 17.264706 | 34 | 0.383305 | rranjan14 |
d2576a85dc4d3b7319eb53f12d375a804d4fd722 | 539 | cpp | C++ | Grade_10/Second_Semester/max_sum_from_pairs.cpp | MagicWinnie/SESC_IT | 934ac49a177bfa5d02fc3234d31c929aad3c60c2 | [
"MIT"
] | 2 | 2020-10-10T10:21:49.000Z | 2021-05-28T18:10:42.000Z | Grade_10/Second_Semester/max_sum_from_pairs.cpp | MagicWinnie/SESC_IT | 934ac49a177bfa5d02fc3234d31c929aad3c60c2 | [
"MIT"
] | null | null | null | Grade_10/Second_Semester/max_sum_from_pairs.cpp | MagicWinnie/SESC_IT | 934ac49a177bfa5d02fc3234d31c929aad3c60c2 | [
"MIT"
] | null | null | null | // You get N pairs, from which you have to choose one number so the sum is max and does not divide by 3.
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
int n;
int s = 0, mr = 1000000;
cin >> n;
for (int i = 0; i < n; i++)
{
int a, b;
cin... | 20.730769 | 104 | 0.45269 | MagicWinnie |
d259aa34186e6601ee8e659cfc1d36c1f77b120b | 1,466 | cpp | C++ | Striver SDE Sheet/Day - 4 (Hashing)/2 Sum.cpp | HariAcidReign/Striver-SDE-Solutions | 80757b212abe479f3975b890398a8d877ebfd41e | [
"MIT"
] | 25 | 2021-08-17T04:04:41.000Z | 2022-03-16T07:43:30.000Z | Striver SDE Sheet/Day - 4 (Hashing)/2 Sum.cpp | hashwanthalla/Striver-Sheets-Resources | 80757b212abe479f3975b890398a8d877ebfd41e | [
"MIT"
] | null | null | null | Striver SDE Sheet/Day - 4 (Hashing)/2 Sum.cpp | hashwanthalla/Striver-Sheets-Resources | 80757b212abe479f3975b890398a8d877ebfd41e | [
"MIT"
] | 8 | 2021-08-18T02:02:23.000Z | 2022-02-11T06:05:07.000Z | class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<pair<int, int>> x;
int n = nums.size();
for(int i = 0; i < n; i++)
{
x.push_back(make_pair(nums[i], i));
}
sort(x.begin(), x.end());
int l = 0;
int r = n-1;... | 25.719298 | 60 | 0.411323 | HariAcidReign |
d259c7036112467ec25aa92d8d95aeb523336782 | 6,860 | cpp | C++ | Projects/krkr2_on_VC/kirikiri2/src/tools/win32/krdevui/SignUnit.cpp | CATION-M/X-moe | 2bac3bb45ff21e50921aac8422f2e00839f546e5 | [
"MIT"
] | 2 | 2020-02-25T15:18:53.000Z | 2020-08-24T13:30:34.000Z | Projects/kirikiri2-master/kirikiri2/src/tools/win32/krdevui/SignUnit.cpp | CATION-M/X-moe | 2bac3bb45ff21e50921aac8422f2e00839f546e5 | [
"MIT"
] | null | null | null | Projects/kirikiri2-master/kirikiri2/src/tools/win32/krdevui/SignUnit.cpp | CATION-M/X-moe | 2bac3bb45ff21e50921aac8422f2e00839f546e5 | [
"MIT"
] | 1 | 2019-11-25T05:29:30.000Z | 2019-11-25T05:29:30.000Z | //---------------------------------------------------------------------------
#include <vcl.h>
#pragma hdrstop
#include "SignUnit.h"
#include "RandomizeFormUnit.h"
#define _MSC_VER
#include <tomcrypt.h>
#undef _MSC_VER
#include <string.h>
#define HASH_INIT sha256_init
#define HASH_PROCESS sha256_process
#defin... | 23.655172 | 93 | 0.612391 | CATION-M |
d25ddeb78e454ca73e78262ab53bf8a639e8a617 | 319 | cpp | C++ | lista_ex1.cpp/exercicio10.cpp | robinson-1985/exercicios_fatec | d234389bed31652849130b614448074ade444bce | [
"MIT"
] | null | null | null | lista_ex1.cpp/exercicio10.cpp | robinson-1985/exercicios_fatec | d234389bed31652849130b614448074ade444bce | [
"MIT"
] | null | null | null | lista_ex1.cpp/exercicio10.cpp | robinson-1985/exercicios_fatec | d234389bed31652849130b614448074ade444bce | [
"MIT"
] | null | null | null | /* 10. Faça um programa que calcule e mostre a área de um círculo. Sabe-se que:
Área = π * R^2 */
#include <stdio.h>
int main(){
float area, raio;
printf("\nDigite o raio: ");
scanf("%f", &raio);
area = 3.1415 * raio * raio;
printf("\nA área é: %4.3f \n",area);
getchar();
return 0;
} | 18.764706 | 79 | 0.557994 | robinson-1985 |
d2603441ad6264eca71e2a001fd2adbb7d2acd0e | 2,077 | hpp | C++ | include/orwell/game/Robot.hpp | orwell-int/server-game | d3c410ff734a6f32de0303b25d816ae392df8a18 | [
"BSD-3-Clause"
] | null | null | null | include/orwell/game/Robot.hpp | orwell-int/server-game | d3c410ff734a6f32de0303b25d816ae392df8a18 | [
"BSD-3-Clause"
] | 39 | 2015-02-01T15:24:59.000Z | 2020-11-16T13:58:11.000Z | include/orwell/game/Robot.hpp | orwell-int/server-game | d3c410ff734a6f32de0303b25d816ae392df8a18 | [
"BSD-3-Clause"
] | 2 | 2015-03-14T13:05:25.000Z | 2015-07-05T07:11:23.000Z | /// This class stores the information about a robot that is connected to the server
#pragma once
#include <string>
#include <memory>
#include <zmq.hpp>
#include "orwell/com/Socket.hpp"
namespace orwell
{
namespace support
{
class ISystemProxy;
} // namespace support
namespace game
{
class Player;
class Item;
cla... | 22.095745 | 102 | 0.738084 | orwell-int |
d2624a5b4bf7c04fe2e2e07abffde2795eaea4de | 12,518 | cpp | C++ | src/graph_page_file_io.cpp | mattvchandler/graph3 | f045b24a2657f4ad5628c8376cb7a54f1f1daf8e | [
"MIT"
] | null | null | null | src/graph_page_file_io.cpp | mattvchandler/graph3 | f045b24a2657f4ad5628c8376cb7a54f1f1daf8e | [
"MIT"
] | 1 | 2015-07-07T22:30:20.000Z | 2015-07-09T17:27:14.000Z | src/graph_page_file_io.cpp | mattvchandler/graph3 | f045b24a2657f4ad5628c8376cb7a54f1f1daf8e | [
"MIT"
] | null | null | null | // graph_page_file_io.cpp
// read and write graphs to disk
// Copyright 2018 Matthew Chandler
// 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... | 41.866221 | 130 | 0.653219 | mattvchandler |
d920fbc87885ef55ac10520762b3c6e8c90f6d5f | 677 | cpp | C++ | tests/StdStats_test.cpp | syntaxonly/algs4-cpp | 3ca6336b77e72e0186dfa6ce23585f3bb34fc213 | [
"BSL-1.0"
] | null | null | null | tests/StdStats_test.cpp | syntaxonly/algs4-cpp | 3ca6336b77e72e0186dfa6ce23585f3bb34fc213 | [
"BSL-1.0"
] | null | null | null | tests/StdStats_test.cpp | syntaxonly/algs4-cpp | 3ca6336b77e72e0186dfa6ce23585f3bb34fc213 | [
"BSL-1.0"
] | null | null | null | #include "algs4/StdStats.h"
#include "algs4/StdArrayIO.h"
#include "algs4/StdOut.h"
// run by: StdStats_test < algs4-data/tinyDouble1D.txt
int main() {
using namespace algs4;
auto a = StdArrayIO::readDouble1D();
StdOut::printf(" min %10.3f\n", StdStats::min(a));
StdOut::printf(" mean %10.... | 30.772727 | 64 | 0.601182 | syntaxonly |
d920fde93a62ef3c5d1860c6f0ffc4da19d16c32 | 3,780 | cpp | C++ | lock_hardware/qt_jiemian/lock.cpp | LinuxDigger/smart_lock | 014b31dc54b86bc416b2f440ce2e4a2491089906 | [
"MIT"
] | 12 | 2021-01-11T11:17:07.000Z | 2022-03-02T05:08:54.000Z | lock_hardware/qt_jiemian/lock.cpp | LinuxDigger/smart_lock | 014b31dc54b86bc416b2f440ce2e4a2491089906 | [
"MIT"
] | null | null | null | lock_hardware/qt_jiemian/lock.cpp | LinuxDigger/smart_lock | 014b31dc54b86bc416b2f440ce2e4a2491089906 | [
"MIT"
] | 4 | 2021-02-03T08:23:36.000Z | 2022-03-01T15:44:05.000Z |
#include <stdint.h>
#include <stdio.h>
#include <iostream>
#include <unistd.h>
#include <curl/curl.h>
#include <thread>
#include "lock.h"
#include "database.h"
#include "model/user.h"
#include "model/log.h"
#include "model/password.h"
#include "model/permission.h"
#include "communication.h"
#include "network.h"
#in... | 26.808511 | 83 | 0.602116 | LinuxDigger |
d9271ff3a55c2cc8314a2a759a71a8b8d67791f1 | 2,835 | cpp | C++ | functions.cpp | DivyanshuSaxena/Buffered-File-Manager | 93c9741f532e1e7b55a9f4dbc68762bd53be21a8 | [
"MIT"
] | null | null | null | functions.cpp | DivyanshuSaxena/Buffered-File-Manager | 93c9741f532e1e7b55a9f4dbc68762bd53be21a8 | [
"MIT"
] | null | null | null | functions.cpp | DivyanshuSaxena/Buffered-File-Manager | 93c9741f532e1e7b55a9f4dbc68762bd53be21a8 | [
"MIT"
] | null | null | null | #include <climits>
#include <vector>
#include <cstring>
#include "functions.h"
bool debugprint=false;
bool binarySearchPage(int searchInt, int startPageNum, int lastPageNum, int firstPageNum, int endPageNum, FileHandler fh, int * finPage, int * pageOffset){
bool found=false;
char *data;
int foundPage = -1;
while(... | 26.745283 | 155 | 0.611287 | DivyanshuSaxena |
d92bd52ce341dd8409f3f8c42aeaaf82560c412c | 640 | cpp | C++ | code/exploration_42-FUNCTION_OBJECTS/03-using_functors/main.cpp | ordinary-developer/exploring_cpp_11_2_ed_r_lischner | 468de9c64ae54db45c4de748436947d5849c4582 | [
"MIT"
] | 1 | 2017-05-04T08:23:46.000Z | 2017-05-04T08:23:46.000Z | code/exploration_42-FUNCTION_OBJECTS/03-using_functors/main.cpp | ordinary-developer/exploring_cpp_11_2_ed_r_lischner | 468de9c64ae54db45c4de748436947d5849c4582 | [
"MIT"
] | null | null | null | code/exploration_42-FUNCTION_OBJECTS/03-using_functors/main.cpp | ordinary-developer/exploring_cpp_11_2_ed_r_lischner | 468de9c64ae54db45c4de748436947d5849c4582 | [
"MIT"
] | null | null | null | #include "sequence.hpp"
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
int main() {
int size{};
std::cout << "How many integers to you want? ";
std::cin >> size;
int first{};
std::cout << "What it the first integer? ";
std::cin >> first;
int step{};
std... | 22.068966 | 70 | 0.576563 | ordinary-developer |
d930af876868d492f56a1963ef217fc172aec195 | 5,970 | cc | C++ | examples/mnist/train_mnist.cc | ruyimarone/dynet | 67bace3fb1d79327ada53b248e497c894819760d | [
"Apache-2.0"
] | 3,307 | 2016-10-08T15:51:28.000Z | 2022-03-30T04:40:44.000Z | examples/mnist/train_mnist.cc | ruyimarone/dynet | 67bace3fb1d79327ada53b248e497c894819760d | [
"Apache-2.0"
] | 1,348 | 2016-10-08T14:36:55.000Z | 2022-03-26T15:19:27.000Z | examples/mnist/train_mnist.cc | ruyimarone/dynet | 67bace3fb1d79327ada53b248e497c894819760d | [
"Apache-2.0"
] | 741 | 2016-10-09T04:44:30.000Z | 2022-03-29T22:29:02.000Z | /**
* Train a multilayer perceptron to classify mnist digits
*
* This provide an example of usage of the mlp.h model
*/
#include "mlp.h"
#include "dynet/io.h"
#include "getpid.h"
#include "cl-args.h"
#include "data-io.h"
using namespace std;
using namespace dynet;
int main(int argc, char** argv) {
// Fetch dyne... | 34.310345 | 114 | 0.578392 | ruyimarone |
d933db0d014d82faf2211754bc4538aa50e6b432 | 7,231 | cpp | C++ | BreaksPPU/PPUSim/regs.cpp | ogamespec/breaknes | b053afb6924ca661f71a129766e8945f64f6ec7b | [
"CC0-1.0"
] | null | null | null | BreaksPPU/PPUSim/regs.cpp | ogamespec/breaknes | b053afb6924ca661f71a129766e8945f64f6ec7b | [
"CC0-1.0"
] | null | null | null | BreaksPPU/PPUSim/regs.cpp | ogamespec/breaknes | b053afb6924ca661f71a129766e8945f64f6ec7b | [
"CC0-1.0"
] | null | null | null | // Control Registers
#include "pch.h"
using namespace BaseLogic;
namespace PPUSim
{
ControlRegs::ControlRegs(PPU* parent)
{
ppu = parent;
}
ControlRegs::~ControlRegs()
{
}
void ControlRegs::sim()
{
sim_RegularRegOps();
sim_W56RegOps();
sim_FirstSecond_SCCX_Write();
sim_RegFFs();
if (ppu->rev ... | 22.045732 | 95 | 0.620661 | ogamespec |
d9351319abdb18af2bc0c496f50fbcf9278e44bf | 1,250 | cpp | C++ | 7FA4/1.5/Q1.5.5.3.cpp | XenonWZH/involution | 189f6ce2bbfe3a7c5d536bbd769f353e4c06e7c6 | [
"MIT"
] | null | null | null | 7FA4/1.5/Q1.5.5.3.cpp | XenonWZH/involution | 189f6ce2bbfe3a7c5d536bbd769f353e4c06e7c6 | [
"MIT"
] | null | null | null | 7FA4/1.5/Q1.5.5.3.cpp | XenonWZH/involution | 189f6ce2bbfe3a7c5d536bbd769f353e4c06e7c6 | [
"MIT"
] | null | null | null | // Q1.5.5.3. 多项式加减乘
// WzhDnwzWzh
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
int f1[1001], f2[1001], ans[1000001], n1, n2, n_ans;
memset(f1, 0, sizeof(f1));
memset(f2, 0, sizeof(f2));
memset(ans, 0, sizeof(ans));
cin >> n1 >> n2;
for (int i = 0; i <= n1; i++)
... | 23.584906 | 56 | 0.4296 | XenonWZH |
d93524fffa69a5379fc477ee31791afee29a3ff3 | 1,216 | hpp | C++ | Utils/IO/ZmqUtilities.hpp | shbang91/PnC | 880cbbcf96a48a93a0ab646634781e4f112a71f6 | [
"MIT"
] | 1 | 2020-05-04T22:36:54.000Z | 2020-05-04T22:36:54.000Z | Utils/IO/ZmqUtilities.hpp | shbang91/PnC | 880cbbcf96a48a93a0ab646634781e4f112a71f6 | [
"MIT"
] | null | null | null | Utils/IO/ZmqUtilities.hpp | shbang91/PnC | 880cbbcf96a48a93a0ab646634781e4f112a71f6 | [
"MIT"
] | null | null | null | #pragma once
#include <zmq.hpp> // https://github.com/zeromq/cppzmq
namespace myUtils {
static std::string StringRecv(zmq::socket_t& socket) {
zmq::message_t message;
socket.recv(&message);
return std::string(static_cast<char*>(message.data()), message.size());
}
// Convert string to 0MQ string and se... | 28.27907 | 77 | 0.613487 | shbang91 |
d936408bbb026df5fe13f3e595aa7cbcbeb820fb | 172 | cpp | C++ | cpp/ql/src/Likely Bugs/Likely Typos/ShortCircuitBitMask.cpp | vadi2/codeql | a806a4f08696d241ab295a286999251b56a6860c | [
"MIT"
] | 4,036 | 2020-04-29T00:09:57.000Z | 2022-03-31T14:16:38.000Z | cpp/ql/src/Likely Bugs/Likely Typos/ShortCircuitBitMask.cpp | vadi2/codeql | a806a4f08696d241ab295a286999251b56a6860c | [
"MIT"
] | 2,970 | 2020-04-28T17:24:18.000Z | 2022-03-31T22:40:46.000Z | cpp/ql/src/Likely Bugs/Likely Typos/ShortCircuitBitMask.cpp | ScriptBox99/github-codeql | 2ecf0d3264db8fb4904b2056964da469372a235c | [
"MIT"
] | 794 | 2020-04-29T00:28:25.000Z | 2022-03-30T08:21:46.000Z |
unsigned int new_mask = old_mask || 0x0100; //wrong, || logical operator just returns 1 or 0
unsigned int new_mask = old_mask | 0x0100; //right, | is a bit-mask operator
| 34.4 | 92 | 0.72093 | vadi2 |
d938202b9dd190c708538419786d7e89c49df397 | 408 | hpp | C++ | libs/core/math/include/bksge/core/math/fwd/transform3_fwd.hpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 4 | 2018-06-10T13:35:32.000Z | 2021-06-03T14:27:41.000Z | libs/core/math/include/bksge/core/math/fwd/transform3_fwd.hpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 566 | 2017-01-31T05:36:09.000Z | 2022-02-09T05:04:37.000Z | libs/core/math/include/bksge/core/math/fwd/transform3_fwd.hpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 1 | 2018-07-05T04:40:53.000Z | 2018-07-05T04:40:53.000Z | /**
* @file transform3_fwd.hpp
*
* @brief Transform3 の前方宣言
*
* @author myoukaku
*/
#ifndef BKSGE_CORE_MATH_FWD_TRANSFORM3_FWD_HPP
#define BKSGE_CORE_MATH_FWD_TRANSFORM3_FWD_HPP
namespace bksge
{
namespace math
{
template <typename T>
class Transform3;
} // namespace math
using math::T... | 14.571429 | 49 | 0.713235 | myoukaku |
d938e853764c02451212522187e630c3f405de86 | 5,042 | hpp | C++ | ql/termstructures/yield/compositezeroyieldstructure.hpp | zhengyuzhang1/QuantLib | 65867ab7c44419b69e40e553b41230744b83cff9 | [
"BSD-3-Clause"
] | 2 | 2021-12-12T01:27:45.000Z | 2022-01-25T17:44:12.000Z | ql/termstructures/yield/compositezeroyieldstructure.hpp | zhengyuzhang1/QuantLib | 65867ab7c44419b69e40e553b41230744b83cff9 | [
"BSD-3-Clause"
] | 17 | 2020-11-23T06:35:50.000Z | 2022-03-28T19:00:09.000Z | ql/termstructures/yield/compositezeroyieldstructure.hpp | zhengyuzhang1/QuantLib | 65867ab7c44419b69e40e553b41230744b83cff9 | [
"BSD-3-Clause"
] | 5 | 2020-06-04T15:19:22.000Z | 2020-06-18T08:24:37.000Z | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2000, 2001, 2002, 2003 RiskMap srl
Copyright (C) 2007, 2008 StatPro Italia srl
Copyright (C) 2017 Francois Botha
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and d... | 35.758865 | 98 | 0.664816 | zhengyuzhang1 |
d93d8cc76201b80a01213aeff9226f6660ae530f | 1,502 | cpp | C++ | UVa 10706 Number sequence/sample/sol.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2020-11-24T03:17:21.000Z | 2020-11-24T03:17:21.000Z | UVa 10706 Number sequence/sample/sol.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | null | null | null | UVa 10706 Number sequence/sample/sol.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2021-04-11T16:22:31.000Z | 2021-04-11T16:22:31.000Z | #include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <cstdio>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
using namespace std;
#define MAXN 100000
int t , n;
long long num[MAXN];//保存某一个值的总数
//打表初始化
void init()
{
long long i , j , k , tmp;... | 20.575342 | 69 | 0.393475 | tadvi |
d93d8e9c9fc4d497c5458a69578e22148aadd130 | 31 | hpp | C++ | src/boost_vmd_array.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 10 | 2018-03-17T00:58:42.000Z | 2021-07-06T02:48:49.000Z | src/boost_vmd_array.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 2 | 2021-03-26T15:17:35.000Z | 2021-05-20T23:55:08.000Z | src/boost_vmd_array.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 4 | 2019-05-28T21:06:37.000Z | 2021-07-06T03:06:52.000Z | #include <boost/vmd/array.hpp>
| 15.5 | 30 | 0.741935 | miathedev |
d93da3ce769ea2a0b6bdebad8430307a6c9669c2 | 3,071 | cpp | C++ | opticalFlowApp1/src/ofApp.cpp | aa-debdeb/openFrameworks | c535eaa4a386879ef5db551357b29135b60520a0 | [
"MIT"
] | 1 | 2020-05-26T09:23:30.000Z | 2020-05-26T09:23:30.000Z | opticalFlowApp1/src/ofApp.cpp | aadebdeb/openFrameworks | c535eaa4a386879ef5db551357b29135b60520a0 | [
"MIT"
] | null | null | null | opticalFlowApp1/src/ofApp.cpp | aadebdeb/openFrameworks | c535eaa4a386879ef5db551357b29135b60520a0 | [
"MIT"
] | 2 | 2018-12-18T09:12:55.000Z | 2021-05-26T04:27:37.000Z | #include "ofApp.h"
using namespace ofxCv;
using namespace cv;
//--------------------------------------------------------------
void ofApp::setup(){
ofSetFrameRate(60);
camera.setup(320, 240);
gui.setup();
gui.add(fbPyrScale.set("fbPyrScale", .5, 0, .99));
gui.add(fbLevels.set("fbLevels",... | 26.474138 | 94 | 0.447086 | aa-debdeb |
d93e003a4bb8ed164783dd456ca23830c1031ad2 | 4,698 | cc | C++ | Library/Utilities/fftw++-2.05/tests/tconv.cc | stevend12/SolutioCpp | 6fa8a12207cd1e7e806a8ef5de93dc137c33856e | [
"Apache-2.0"
] | 9 | 2017-06-27T14:04:46.000Z | 2022-02-17T17:38:03.000Z | Library/Utilities/fftw++-2.05/tests/tconv.cc | stevend12/SolutioCpp | 6fa8a12207cd1e7e806a8ef5de93dc137c33856e | [
"Apache-2.0"
] | null | null | null | Library/Utilities/fftw++-2.05/tests/tconv.cc | stevend12/SolutioCpp | 6fa8a12207cd1e7e806a8ef5de93dc137c33856e | [
"Apache-2.0"
] | 3 | 2017-06-23T20:10:44.000Z | 2021-01-13T10:09:46.000Z | #include "convolution.h"
#include "explicit.h"
#include "direct.h"
#include "utils.h"
#include "Array.h"
using namespace std;
using namespace utils;
using namespace fftwpp;
// Number of iterations.
unsigned int N0=10000000;
unsigned int N=0;
unsigned int m=12;
unsigned int M=1;
unsigned int B=1;
bool Direct=false,... | 21.354545 | 78 | 0.517667 | stevend12 |
d93ed803e721aab4f40055ae181432c234521c06 | 1,558 | cpp | C++ | boards/ip/hls/color_convert/color_convert.cpp | Kiminje/PYNQ | 9c011e4eb24398ceb9dc24edf10b4fd8cbf5062c | [
"BSD-3-Clause"
] | 1,537 | 2016-09-26T22:51:50.000Z | 2022-03-31T13:33:54.000Z | boards/ip/hls/color_convert/color_convert.cpp | louisliuwei/PYNQ | 80b08caa8fbd316a521fcbead2c4772fe736f22d | [
"BSD-3-Clause"
] | 414 | 2016-10-03T21:12:10.000Z | 2022-03-21T14:55:02.000Z | boards/ip/hls/color_convert/color_convert.cpp | louisliuwei/PYNQ | 80b08caa8fbd316a521fcbead2c4772fe736f22d | [
"BSD-3-Clause"
] | 826 | 2016-09-23T22:29:43.000Z | 2022-03-29T11:02:09.000Z | #include <ap_fixed.h>
#include <ap_int.h>
typedef ap_uint<8> pixel_type;
typedef ap_int<8> pixel_type_s;
typedef ap_ufixed<8,0, AP_RND, AP_SAT> comp_type;
typedef ap_fixed<10,2, AP_RND, AP_SAT> coeff_type;
struct video_stream {
struct {
pixel_type_s p1;
pixel_type_s p2;
pixel_type_s p3;
} data;
ap_uint<1> us... | 28.327273 | 76 | 0.725931 | Kiminje |
d93f12f5799f74fddc5cea504535c8da95092caf | 712 | cpp | C++ | TimeTableGenerator/src/Colors.cpp | Electrux/CCPP-Code | 3c5e5b866cf050c11bced9651b112eb31dd2465d | [
"BSD-3-Clause"
] | 6 | 2019-08-29T23:31:17.000Z | 2021-11-14T20:35:47.000Z | TimeTableGenerator/src/Colors.cpp | Electrux/CCPP-Code | 3c5e5b866cf050c11bced9651b112eb31dd2465d | [
"BSD-3-Clause"
] | null | null | null | TimeTableGenerator/src/Colors.cpp | Electrux/CCPP-Code | 3c5e5b866cf050c11bced9651b112eb31dd2465d | [
"BSD-3-Clause"
] | 1 | 2019-09-01T12:22:58.000Z | 2019-09-01T12:22:58.000Z | #include <string>
#include <map>
#include "../include/Colors.hpp"
int SubstituteColors( std::string & str )
{
int len = 0;
std::string var;
for( std::string::iterator it = str.begin(); it != str.end(); ) {
if( * it == '{' && it + 1 != str.end() ) {
it = str.erase( it );
if( * it == '{' ) {
len++;
... | 18.25641 | 70 | 0.464888 | Electrux |
d949945e1d6bfbef9602f86e463bd04c8c5c2734 | 1,416 | cpp | C++ | tdutils/td/utils/port/detail/ThreadIdGuard.cpp | takpare/-T | 6c706f45e7a73c936b9f2f267785092c8a73348f | [
"BSL-1.0"
] | 1 | 2022-02-04T01:49:51.000Z | 2022-02-04T01:49:51.000Z | tdutils/td/utils/port/detail/ThreadIdGuard.cpp | shafiahmed/td | 19ef0361f9e4bf7e45e117f2fd12307629298d5e | [
"BSL-1.0"
] | null | null | null | tdutils/td/utils/port/detail/ThreadIdGuard.cpp | shafiahmed/td | 19ef0361f9e4bf7e45e117f2fd12307629298d5e | [
"BSL-1.0"
] | null | null | null | //
// Copyright Aliaksei Levin (levlam@telegram.org), Arseny Smirnov (arseny30@gmail.com) 2014-2018
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#include "td/utils/port/detail/ThreadIdGuard.h"
#include "td... | 26.716981 | 96 | 0.695621 | takpare |
d95082633a8c1fb7f7b5069eac4c295a311dc0c9 | 29 | cpp | C++ | tutorials/learncpp.com#1.0#1/arrays__strings__pointers__and_references/references/source10.cpp | officialrafsan/CppDroid | 5fb2cc7750fea53b1ea6ff47b5094da6e95e9224 | [
"MIT"
] | null | null | null | tutorials/learncpp.com#1.0#1/arrays__strings__pointers__and_references/references/source10.cpp | officialrafsan/CppDroid | 5fb2cc7750fea53b1ea6ff47b5094da6e95e9224 | [
"MIT"
] | null | null | null | tutorials/learncpp.com#1.0#1/arrays__strings__pointers__and_references/references/source10.cpp | officialrafsan/CppDroid | 5fb2cc7750fea53b1ea6ff47b5094da6e95e9224 | [
"MIT"
] | null | null | null | sOther.sSomething.nValue = 5; | 29 | 29 | 0.793103 | officialrafsan |
d951492eb5b7308620f090ddc66b4b3d40280e35 | 293 | hpp | C++ | WinSensor/Source/HRESULT_Support.hpp | SekiShuhei/ARWorkspace | 917089e29f5ea41336ffea4cd6f545bffb1f1c16 | [
"Apache-2.0"
] | null | null | null | WinSensor/Source/HRESULT_Support.hpp | SekiShuhei/ARWorkspace | 917089e29f5ea41336ffea4cd6f545bffb1f1c16 | [
"Apache-2.0"
] | 5 | 2020-04-17T10:08:29.000Z | 2020-04-26T07:17:18.000Z | WinSensor/Source/HRESULT_Support.hpp | SekiShuhei/ARWorkspace | 917089e29f5ea41336ffea4cd6f545bffb1f1c16 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "SensorManagerDefine.hpp"
namespace WinSensor {
class HRESULT_Support
{
public:
inline bool IsError() const
{
return FAILED(this->result);
}
inline HRESULT GetResult() const
{
return this->result;
}
protected:
HRESULT result = S_OK;
};
} | 13.952381 | 35 | 0.668942 | SekiShuhei |
d9534321c02648b59665b03a32e04b2229ab4343 | 2,955 | hpp | C++ | bbdata/prbs.hpp | kb3gtn/kb3gtn_sdr | 384c2ea7c778cd0ddbf355a705a19cbf08725d4e | [
"MIT"
] | null | null | null | bbdata/prbs.hpp | kb3gtn/kb3gtn_sdr | 384c2ea7c778cd0ddbf355a705a19cbf08725d4e | [
"MIT"
] | null | null | null | bbdata/prbs.hpp | kb3gtn/kb3gtn_sdr | 384c2ea7c778cd0ddbf355a705a19cbf08725d4e | [
"MIT"
] | null | null | null | #pragma once
#include <iostream>
#include <vector>
#include <cstdint>
#include <cmath>
// PRBS patterns
enum prbs_pattern_t {
USER = 0,
ALL_ZEROS = 1,
ALL_ONES = 2,
ALT_ONE_ZERO = 3,
ITU_PN9 = 4,
ITU_PN11 = 5,
ITU_PN15 = 6,
ITU_PN23 = 7
};
// utility methods
int popcount64(uint64_t x);
uint8_t flipbit... | 29.257426 | 92 | 0.679188 | kb3gtn |
d9537b7a24ec7b4dbd1d631dd0d30ca6a7139118 | 1,163 | hpp | C++ | ares/sfc/coprocessor/competition/competition.hpp | CasualPokePlayer/ares | 58690cd5fc7bb6566c22935c5b80504a158cca29 | [
"BSD-3-Clause"
] | 153 | 2020-07-25T17:55:29.000Z | 2021-10-01T23:45:01.000Z | ares/sfc/coprocessor/competition/competition.hpp | CasualPokePlayer/ares | 58690cd5fc7bb6566c22935c5b80504a158cca29 | [
"BSD-3-Clause"
] | 245 | 2021-10-08T09:14:46.000Z | 2022-03-31T08:53:13.000Z | ares/sfc/coprocessor/competition/competition.hpp | CasualPokePlayer/ares | 58690cd5fc7bb6566c22935c5b80504a158cca29 | [
"BSD-3-Clause"
] | 44 | 2020-07-25T08:51:55.000Z | 2021-09-25T16:09:01.000Z | //HLE of the NEC uPD78P214GC processor found on SNES-EVENT PCBs, used by:
//* Campus Challenge '92
//* PowerFest '94
//The NEC uPD78214 family are 8-bit microprocessors containing:
//* UART/CSI serial interface
//* ALU (MUL, DIV, BCD)
//* interrupts (12 internal; 7 external; 2 priority levels)
//* 16384 x 8-bit ROM
//... | 23.734694 | 77 | 0.698194 | CasualPokePlayer |
d953a2cc6db36ee829db0d1e0b7f9d9fd9adaaa3 | 307 | hpp | C++ | libs/libwarhammerengine/model.hpp | julienlopez/QWarhammerSimulator | bd6f5b657dab36da0abdf14747434a1c9e9eaf20 | [
"MIT"
] | null | null | null | libs/libwarhammerengine/model.hpp | julienlopez/QWarhammerSimulator | bd6f5b657dab36da0abdf14747434a1c9e9eaf20 | [
"MIT"
] | 6 | 2021-01-07T07:38:46.000Z | 2021-07-13T16:43:35.000Z | libs/libwarhammerengine/model.hpp | julienlopez/QWarhammerSimulator | bd6f5b657dab36da0abdf14747434a1c9e9eaf20 | [
"MIT"
] | null | null | null | #pragma once
#include "characteristics.hpp"
#include "point.hpp"
#include <string>
namespace QWarhammerSimulator::LibWarhammerEngine
{
struct Model
{
std::string name;
LibGeometry::Point base_size;
Characteristics characteristics;
};
} // namespace QWarhammerSimulator::LibWarhammerEngine
| 15.35 | 54 | 0.762215 | julienlopez |
d9564bc29a2194995a78829e4d6319abb350a4c7 | 133 | cpp | C++ | contest/AtCoder/abc002/C.cpp | not522/Competitive-Programming | be4a7d25caf5acbb70783b12899474a56c34dedb | [
"Unlicense"
] | 7 | 2018-04-14T14:55:51.000Z | 2022-01-31T10:49:49.000Z | contest/AtCoder/abc002/C.cpp | not522/Competitive-Programming | be4a7d25caf5acbb70783b12899474a56c34dedb | [
"Unlicense"
] | 5 | 2018-04-14T14:28:49.000Z | 2019-05-11T02:22:10.000Z | contest/AtCoder/abc002/C.cpp | not522/Competitive-Programming | be4a7d25caf5acbb70783b12899474a56c34dedb | [
"Unlicense"
] | null | null | null | #include "geometry/segment.hpp"
int main() {
Point a(in), b(in), c(in);
cout << (Segment(b - a, c - a)).area().abs() << endl;
}
| 19 | 55 | 0.541353 | not522 |
d957ce783bc07533b3b1a826a0fdd55463ac8b8a | 2,678 | hpp | C++ | gazebo_ros2_control_bolt/include/gazebo_ros2_control_bolt/gazebo_bolt_ros2_control_plugin.hpp | stack-of-tasks/ros2_control_bolt | 0be202ffffc7b22118db38d77a8d52e572dc4d13 | [
"Apache-2.0"
] | 5 | 2022-01-10T14:26:12.000Z | 2022-02-01T12:36:55.000Z | gazebo_ros2_control_bolt/include/gazebo_ros2_control_bolt/gazebo_bolt_ros2_control_plugin.hpp | stack-of-tasks/ros2_control_bolt | 0be202ffffc7b22118db38d77a8d52e572dc4d13 | [
"Apache-2.0"
] | 3 | 2022-01-15T14:44:45.000Z | 2022-02-01T05:54:13.000Z | gazebo_ros2_control_bolt/include/gazebo_ros2_control_bolt/gazebo_bolt_ros2_control_plugin.hpp | stack-of-tasks/ros2_control_bolt | 0be202ffffc7b22118db38d77a8d52e572dc4d13 | [
"Apache-2.0"
] | 3 | 2022-01-10T13:05:20.000Z | 2022-01-14T17:51:05.000Z | // Copyright (c) 2013, Open Source Robotics Foundation. All rights reserved.
// Copyright (c) 2013, The Johns Hopkins 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:
//
// * Redist... | 39.382353 | 91 | 0.775205 | stack-of-tasks |
d95c47b8c9dd490dbb4a6ad37778a670d2cbf32c | 2,658 | hxx | C++ | include/prevc/pipeline/AST/new.hxx | arazeiros/prevc | 378f045f57b2e1c9460ac1699951291ac055c078 | [
"MIT"
] | 3 | 2018-10-30T20:33:45.000Z | 2019-03-06T11:46:31.000Z | include/prevc/pipeline/AST/new.hxx | arazeiros/prevc | 378f045f57b2e1c9460ac1699951291ac055c078 | [
"MIT"
] | null | null | null | include/prevc/pipeline/AST/new.hxx | arazeiros/prevc | 378f045f57b2e1c9460ac1699951291ac055c078 | [
"MIT"
] | null | null | null |
#ifndef PREVC_PIPELINE_AST_NEW_HXX
#define PREVC_PIPELINE_AST_NEW_HXX
#include <prevc/pipeline/AST/expression.hxx>
#include <prevc/pipeline/AST/type.hxx>
namespace prevc
{
namespace pipeline
{
namespace AST
{
/**
* \brief Represent an new-expression in the AST.
... | 34.519481 | 101 | 0.501129 | arazeiros |
d95f42fba2d8cfeff48263ce830de7bf6ac7aa37 | 1,950 | cpp | C++ | LuoguCodes/P1589.cpp | Anguei/OI-Codes | 0ef271e9af0619d4c236e314cd6d8708d356536a | [
"MIT"
] | null | null | null | LuoguCodes/P1589.cpp | Anguei/OI-Codes | 0ef271e9af0619d4c236e314cd6d8708d356536a | [
"MIT"
] | null | null | null | LuoguCodes/P1589.cpp | Anguei/OI-Codes | 0ef271e9af0619d4c236e314cd6d8708d356536a | [
"MIT"
] | null | null | null | // luogu-judger-enable-o2
#include <cmath>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <numeric>
#include <iomanip>
#include <iostream>
#include <algorithm>
#define fn "cover"
#define ll long long
#de... | 23.214286 | 78 | 0.53641 | Anguei |
d95fba4907c6ef046313f0e4bd0590d7a209c6a7 | 5,061 | cpp | C++ | WordleSover/WordleSover/Database.cpp | Squirrelbear/Wordle-Solver | 496ee95ec377d0e300212fbcd96939a6eac26cb6 | [
"MIT"
] | null | null | null | WordleSover/WordleSover/Database.cpp | Squirrelbear/Wordle-Solver | 496ee95ec377d0e300212fbcd96939a6eac26cb6 | [
"MIT"
] | null | null | null | WordleSover/WordleSover/Database.cpp | Squirrelbear/Wordle-Solver | 496ee95ec377d0e300212fbcd96939a6eac26cb6 | [
"MIT"
] | null | null | null | #include "Database.h"
#include <fstream>
#include <iostream>
#include <string>
#include <algorithm>
Database::Database()
{
reset();
}
void Database::filterByRule(const std::string& rule)
{
_rules.push_back(rule);
_data.erase(std::remove_if(_data.begin(), _data.end(), [&](std::string& word) {
return !wordFitsRule... | 24.449275 | 105 | 0.60818 | Squirrelbear |
d962d332e62b4c66c27eba4760ff582262a1156f | 2,927 | hpp | C++ | src/dbg/stream_cont.hpp | yxtj/Daiger | d98edea4618223f6a8f89482c88be783dfaf9983 | [
"MIT"
] | null | null | null | src/dbg/stream_cont.hpp | yxtj/Daiger | d98edea4618223f6a8f89482c88be783dfaf9983 | [
"MIT"
] | null | null | null | src/dbg/stream_cont.hpp | yxtj/Daiger | d98edea4618223f6a8f89482c88be783dfaf9983 | [
"MIT"
] | null | null | null | #pragma once
#include <ostream>
#include <utility>
#include <vector>
#include <initializer_list>
//#include <array>
#include <map>
#include <list>
#include <deque>
#include <set>
#include <unordered_map>
#include <unordered_set>
//#include "../my_type_traits/is_associated_container.h"
template <class T1, class T2>
inl... | 23.796748 | 94 | 0.563717 | yxtj |
d9661b5f5ede8062fd17df72765419140b3ebbc0 | 2,202 | cpp | C++ | src/cpp/game_logic/player.cpp | Tomius/pyromaze | 7100f0ef6972b62829b2ad2dd7e7e88af697a5c2 | [
"MIT"
] | null | null | null | src/cpp/game_logic/player.cpp | Tomius/pyromaze | 7100f0ef6972b62829b2ad2dd7e7e88af697a5c2 | [
"MIT"
] | null | null | null | src/cpp/game_logic/player.cpp | Tomius/pyromaze | 7100f0ef6972b62829b2ad2dd7e7e88af697a5c2 | [
"MIT"
] | null | null | null | // Copyright (c) Tamas Csala
#include <lodepng.h>
#include <Silice3D/core/scene.hpp>
#include <Silice3D/core/game_engine.hpp>
#include <Silice3D/debug/debug_texture.hpp>
#include "game_logic/player.hpp"
#include "game_logic/dynamite.hpp"
#include "./main_scene.hpp"
void ShowYouDiedScreen(Silice3D::ShaderManager* sha... | 34.40625 | 103 | 0.676658 | Tomius |
d96732645902f8c2cbaa0abc10efe0b3f3bc1ebb | 15,394 | cpp | C++ | ThunderFocus-firmware/src/focuser/AccelStepper.cpp | marcocipriani01/OpenFocuser | 48192db1e010e87de53f55385457cf5c32e779d4 | [
"Apache-2.0"
] | 1 | 2019-11-11T15:40:00.000Z | 2019-11-11T15:40:00.000Z | ThunderFocus-firmware/src/focuser/AccelStepper.cpp | marcocipriani01/OpenFocuser | 48192db1e010e87de53f55385457cf5c32e779d4 | [
"Apache-2.0"
] | null | null | null | ThunderFocus-firmware/src/focuser/AccelStepper.cpp | marcocipriani01/OpenFocuser | 48192db1e010e87de53f55385457cf5c32e779d4 | [
"Apache-2.0"
] | null | null | null | #include "AccelStepper.h"
#if FOCUSER_DRIVER != DISABLED
#pragma region Constructor
#if ACCELSTEPPER_UNIPOLAR_STEPPER == true
AccelStepper::AccelStepper(uint8_t in1, uint8_t in2, uint8_t in3, uint8_t in4) {
_currentPos = 0;
_targetPos = 0;
_speed = 0.0;
_maxSpeed = 1.0;
_acceleration = 1.0;
_st... | 27.149912 | 127 | 0.63986 | marcocipriani01 |
d968102ef2460c0da9aec5537bef83992504ca7b | 4,524 | cpp | C++ | src/IECore/ExclusionFrameList.cpp | gcodebackups/cortex-vfx | 72fa6c6eb3327fce4faf01361c8fcc2e1e892672 | [
"BSD-3-Clause"
] | 5 | 2016-07-26T06:09:28.000Z | 2022-03-07T03:58:51.000Z | src/IECore/ExclusionFrameList.cpp | turbosun/cortex | 4bdc01a692652cd562f3bfa85f3dae99d07c0b15 | [
"BSD-3-Clause"
] | null | null | null | src/IECore/ExclusionFrameList.cpp | turbosun/cortex | 4bdc01a692652cd562f3bfa85f3dae99d07c0b15 | [
"BSD-3-Clause"
] | 3 | 2015-03-25T18:45:24.000Z | 2020-02-15T15:37:18.000Z | //////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2009, Image Engine Design Inc. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Re... | 29.187097 | 168 | 0.696065 | gcodebackups |
d96d715f7c71b42cec7744b065b3934ed2215a4d | 380 | cpp | C++ | Dataset/Leetcode/train/35/229.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/35/229.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/35/229.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | class Solution {
public:
int XXX(vector<int>& nums, int target)
{
if(target - nums.back() > 0) return nums.size();
if(target - nums[0] <= 0) return 0;
for(int i = 0; i < nums.size() -1; i++)
{
if((target-nums[i])*(nums[i+1]-target) == 0)
return i;
else if( (target > nums[i] && nums[i+1] > ta... | 22.352941 | 77 | 0.526316 | kkcookies99 |
d96db87e22f59ed963625bee6b3581e9e22025a1 | 4,098 | cpp | C++ | src/mc.cpp | byrnedj/lsm-sim | ec45d2eb784357ee4c917cb3d4e3a10430886dae | [
"ISC"
] | 13 | 2017-02-05T09:41:57.000Z | 2022-02-13T14:38:28.000Z | src/mc.cpp | byrnedj/lsm-sim | ec45d2eb784357ee4c917cb3d4e3a10430886dae | [
"ISC"
] | 13 | 2016-03-17T17:43:58.000Z | 2017-01-11T09:21:45.000Z | src/mc.cpp | utah-scs/lsm-sim | 730e339cb4d5a719407643c8bb45a6c3dde1bfb8 | [
"0BSD"
] | 7 | 2017-01-03T18:11:08.000Z | 2021-03-09T12:30:12.000Z | #include <iostream>
#include <cinttypes>
#include <cstring>
#include <utility>
#include <stdio.h>
#include "mc.h"
static const int MAX_NUMBER_OF_SLAB_CLASSES = 64;
static const size_t POWER_SMALLEST = 1;
static const size_t POWER_LARGEST = 256;
static const size_t CHUNK_ALIGN_BYTES = 8;
static const size_t chunk_size ... | 32.267717 | 80 | 0.641532 | byrnedj |
d9703f9c892af53cc55607571e8afe489bccd9a1 | 5,780 | cpp | C++ | src/TCPConnectionServer.cpp | sempr-tk/sempr-gui | ba96dca6945122a157f61fec9e41f4aa6060e3b2 | [
"BSD-3-Clause"
] | null | null | null | src/TCPConnectionServer.cpp | sempr-tk/sempr-gui | ba96dca6945122a157f61fec9e41f4aa6060e3b2 | [
"BSD-3-Clause"
] | null | null | null | src/TCPConnectionServer.cpp | sempr-tk/sempr-gui | ba96dca6945122a157f61fec9e41f4aa6060e3b2 | [
"BSD-3-Clause"
] | null | null | null | #include "TCPConnectionServer.hpp"
#include "ECDataZMQ.hpp"
#include "LogDataZMQ.hpp"
#include "TCPConnectionRequest.hpp"
#include <cereal/archives/json.hpp>
#include <iostream>
namespace sempr { namespace gui {
TCPConnectionServer::TCPConnectionServer(
DirectConnection::Ptr con,
const std::string& p... | 30.421053 | 93 | 0.614706 | sempr-tk |
d972647f4338bfa856858b5b3e679081ebac4d84 | 1,359 | cpp | C++ | Lib/Source/Core/FocusListener.cpp | bluejamesbond/Aurora-SDK | bdd82dfaad10b068efb687690a27b65cae21155d | [
"Apache-2.0"
] | null | null | null | Lib/Source/Core/FocusListener.cpp | bluejamesbond/Aurora-SDK | bdd82dfaad10b068efb687690a27b65cae21155d | [
"Apache-2.0"
] | null | null | null | Lib/Source/Core/FocusListener.cpp | bluejamesbond/Aurora-SDK | bdd82dfaad10b068efb687690a27b65cae21155d | [
"Apache-2.0"
] | null | null | null | #include "../../../include/Core/ExtLibs.h"
#include "../../../include/Core/FocusListener.h"
#include "../../../Include/Core/Component.h"
using namespace A2D;
FocusListener::FocusListener() :
FocusListener("DefaultFocusListener")
{}
FocusListener::FocusListener(string xString) :
aName(xString), AbstractListener(A2D_L... | 17.881579 | 54 | 0.695364 | bluejamesbond |
d974bda0d23cdc3228d59dfe7ec6a65218961464 | 897 | cpp | C++ | source/PyMaterialX/PyMaterialXGenOsl/PyOslShaderGenerator.cpp | willmuto-lucasfilm/MaterialX | 589dbcb5ef292b5e5b64f30aa3fea442a8498ef6 | [
"BSD-3-Clause"
] | 973 | 2017-07-06T02:29:09.000Z | 2022-02-28T18:49:10.000Z | source/PyMaterialX/PyMaterialXGenOsl/PyOslShaderGenerator.cpp | willmuto-lucasfilm/MaterialX | 589dbcb5ef292b5e5b64f30aa3fea442a8498ef6 | [
"BSD-3-Clause"
] | 1,002 | 2018-01-09T10:33:07.000Z | 2022-03-31T18:35:04.000Z | source/PyMaterialX/PyMaterialXGenOsl/PyOslShaderGenerator.cpp | willmuto-lucasfilm/MaterialX | 589dbcb5ef292b5e5b64f30aa3fea442a8498ef6 | [
"BSD-3-Clause"
] | 305 | 2017-07-11T19:05:41.000Z | 2022-02-14T12:25:43.000Z | //
// TM & (c) 2017 Lucasfilm Entertainment Company Ltd. and Lucasfilm Ltd.
// All rights reserved. See LICENSE.txt for license.
//
#include <PyMaterialX/PyMaterialX.h>
#include <MaterialXGenOsl/OslShaderGenerator.h>
#include <MaterialXGenShader/GenContext.h>
#include <MaterialXGenShader/Shader.h>
#include <string>... | 30.931034 | 113 | 0.7068 | willmuto-lucasfilm |
d976110842f865a736a2a0eab9d0d87e184b93b4 | 6,199 | cpp | C++ | c++/UnitTest/codeCropping.cpp | sonsongithub/CoreAR | 7e4be7969bcff106b32a3f2451e8742b49a1fc02 | [
"BSD-3-Clause"
] | 45 | 2015-01-13T15:16:23.000Z | 2021-08-09T06:44:47.000Z | c++/UnitTest/codeCropping.cpp | sonsongithub/CoreAR | 7e4be7969bcff106b32a3f2451e8742b49a1fc02 | [
"BSD-3-Clause"
] | null | null | null | c++/UnitTest/codeCropping.cpp | sonsongithub/CoreAR | 7e4be7969bcff106b32a3f2451e8742b49a1fc02 | [
"BSD-3-Clause"
] | 14 | 2015-03-04T06:42:00.000Z | 2021-08-09T06:44:48.000Z | /*
* Core AR
* codeCropping.cpp
*
* Copyright (c) Yuichi YOSHIDA, 11/07/23.
* All rights reserved.
*
* BSD License
*
* 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 ret... | 32.119171 | 120 | 0.704952 | sonsongithub |
d97716c7906995a33c5fcfb3954329533f61c951 | 9,609 | cpp | C++ | lume/src/lume/grob.cpp | sreiter/lume | a321cbc35376684b711a8c54cd88eea7ce786d05 | [
"BSD-2-Clause"
] | 6 | 2018-09-11T12:05:55.000Z | 2021-11-27T11:56:33.000Z | lume/src/lume/grob.cpp | sreiter/lume | a321cbc35376684b711a8c54cd88eea7ce786d05 | [
"BSD-2-Clause"
] | 2 | 2019-10-06T21:05:15.000Z | 2019-10-08T09:09:30.000Z | lume/src/lume/grob.cpp | sreiter/lume | a321cbc35376684b711a8c54cd88eea7ce786d05 | [
"BSD-2-Clause"
] | 2 | 2018-12-25T00:57:17.000Z | 2019-10-06T21:05:39.000Z | // This file is part of lume, a C++ library for lightweight unstructured meshes
//
// Copyright (C) 2018, 2019 Sebastian Reiter
// Copyright (C) 2018 G-CSC, Goethe University Frankfurt
// Author: Sebastian Reiter <s.b.reiter@gmail.com>
// All rights reserved.
//
// Redistribution and use in source and binary forms, wit... | 28.014577 | 112 | 0.714018 | sreiter |
d97808de077bc4a6e83f133391500728b8e77233 | 20,741 | cpp | C++ | binding/WebAssembly/applications/wFormats/wFormats.cpp | Fabrice-Praxinos/ULIS | 232ad5c0804da1202d8231fda67ff4aea70f57ef | [
"RSA-MD"
] | 30 | 2020-09-16T17:39:36.000Z | 2022-02-17T08:32:53.000Z | binding/WebAssembly/applications/wFormats/wFormats.cpp | Fabrice-Praxinos/ULIS | 232ad5c0804da1202d8231fda67ff4aea70f57ef | [
"RSA-MD"
] | 7 | 2020-11-23T14:37:15.000Z | 2022-01-17T11:35:32.000Z | binding/WebAssembly/applications/wFormats/wFormats.cpp | Fabrice-Praxinos/ULIS | 232ad5c0804da1202d8231fda67ff4aea70f57ef | [
"RSA-MD"
] | 5 | 2020-09-17T00:39:14.000Z | 2021-08-30T16:14:07.000Z | // IDDN FR.001.250001.004.S.X.2019.000.00000
/**
*
* ULIS
*__________________
*
* @file wFormats.cpp
* @author Clement Berthaud
* @brief Formats application for wasm ULIS.
* @copyright Copyright 2018-2021 Praxinos, Inc. All Rights Reserved.
* @license Please refer to LICENSE.md
*/
#includ... | 104.752525 | 114 | 0.336532 | Fabrice-Praxinos |
d9789d0a31fc1d2e9e4a5cd52ba560ce2d9f95eb | 5,610 | hpp | C++ | include/antlr/BaseAST.hpp | zstars/booledeusto | fdc110a9add4a5946fabc2055a533593932a2003 | [
"BSD-3-Clause"
] | 6 | 2018-06-11T18:50:20.000Z | 2021-09-07T23:55:01.000Z | include/antlr/BaseAST.hpp | zstars/booledeusto | fdc110a9add4a5946fabc2055a533593932a2003 | [
"BSD-3-Clause"
] | null | null | null | include/antlr/BaseAST.hpp | zstars/booledeusto | fdc110a9add4a5946fabc2055a533593932a2003 | [
"BSD-3-Clause"
] | 2 | 2021-03-16T16:12:32.000Z | 2022-01-15T01:34:40.000Z | #ifndef INC_BaseAST_hpp__
#define INC_BaseAST_hpp__
/*
* <b>SOFTWARE RIGHTS</b>
* <p>
* ANTLR 2.7.1 MageLang Insitute, 1999, 2000, 2001
* <p>
* We reserve no legal rights to the ANTLR--it is fully in the
* public domain. An individual or company may do whatever
* they wish with source code distributed... | 30.48913 | 80 | 0.695544 | zstars |
d978ce34b2efaee9bf4b740929bdddf506aa29b3 | 7,366 | inl | C++ | volume/Unified2/src/Task/ElasticVolumeMesh/Distributed/DistributedElasticVolumeMeshCommon.inl | llmontoryxd/mipt_diploma | 7d7d65cd619fe983736773f95ebb50b470adbed2 | [
"MIT"
] | null | null | null | volume/Unified2/src/Task/ElasticVolumeMesh/Distributed/DistributedElasticVolumeMeshCommon.inl | llmontoryxd/mipt_diploma | 7d7d65cd619fe983736773f95ebb50b470adbed2 | [
"MIT"
] | null | null | null | volume/Unified2/src/Task/ElasticVolumeMesh/Distributed/DistributedElasticVolumeMeshCommon.inl | llmontoryxd/mipt_diploma | 7d7d65cd619fe983736773f95ebb50b470adbed2 | [
"MIT"
] | null | null | null | template<typename Space, typename FunctionSpace>
typename Space::IndexType
DistributedElasticVolumeMeshCommon<Space, FunctionSpace>::GetSyncDataSize(IndexType dstDomainIndex) const
{
return syncDataSizes[dstDomainIndex];
}
template<typename Space, typename FunctionSpace>
void DistributedElasticVolumeMeshCommon<Sp... | 39.816216 | 146 | 0.771518 | llmontoryxd |
d97aa82743ee3cd0b534a9895eb818613dd5fa36 | 6,003 | cpp | C++ | src/Core/Canvas.cpp | dgi09/2DGameEngine | 18eff334f2ebf469d780688b2bfee6af760a699d | [
"BSD-2-Clause"
] | 1 | 2017-03-13T22:07:35.000Z | 2017-03-13T22:07:35.000Z | src/Core/Canvas.cpp | dgi09/2DGameEngine | 18eff334f2ebf469d780688b2bfee6af760a699d | [
"BSD-2-Clause"
] | null | null | null | src/Core/Canvas.cpp | dgi09/2DGameEngine | 18eff334f2ebf469d780688b2bfee6af760a699d | [
"BSD-2-Clause"
] | null | null | null | #include "Canvas.h"
using namespace DirectX;
Canvas::Canvas(HWND handle, UINT width, UINT height)
{
this->width = width;
this->height = height;
DXGI_SWAP_CHAIN_DESC desc;
ZeroMemory(&desc,sizeof(DXGI_SWAP_CHAIN_DESC));
desc.BufferCount = 2;
desc.BufferUsage = DXGI_USAGE_RENDER_TARGET_OUTPUT;
desc.BufferDesc.... | 26.213974 | 137 | 0.775112 | dgi09 |
d97ba6d598c6bf6fb2e084606a3c1214fe97f695 | 2,838 | hpp | C++ | flightgoggles_ros_bridge/src/CameraModel/FisheyeModel.hpp | aau-cns/flightgoggles | 7e194480b3852bd4ac34467222ffbbbaf9355b77 | [
"BSD-2-Clause"
] | null | null | null | flightgoggles_ros_bridge/src/CameraModel/FisheyeModel.hpp | aau-cns/flightgoggles | 7e194480b3852bd4ac34467222ffbbbaf9355b77 | [
"BSD-2-Clause"
] | null | null | null | flightgoggles_ros_bridge/src/CameraModel/FisheyeModel.hpp | aau-cns/flightgoggles | 7e194480b3852bd4ac34467222ffbbbaf9355b77 | [
"BSD-2-Clause"
] | null | null | null | /// Copyright (C) 2020 Martin Scheiber, Control of Networked Systems,
/// University of Klagenfurt, Austria.
///
/// All rights reserved.
///
/// This software is licensed under the terms of the BSD-2-Clause-License with
/// no commercial use allowed, the full terms of which are made available in the
/// LICENSE file. ... | 34.192771 | 118 | 0.621917 | aau-cns |
d9836b41c0950cae567dcab6e0db991ba636ef68 | 424 | cpp | C++ | 1301-1400/1337-The K Weakest Rows in a Matrix/1337-The K Weakest Rows in a Matrix.cpp | jiadaizhao/LeetCode | 4ddea0a532fe7c5d053ffbd6870174ec99fc2d60 | [
"MIT"
] | 49 | 2018-05-05T02:53:10.000Z | 2022-03-30T12:08:09.000Z | 1301-1400/1337-The K Weakest Rows in a Matrix/1337-The K Weakest Rows in a Matrix.cpp | jolly-fellow/LeetCode | ab20b3ec137ed05fad1edda1c30db04ab355486f | [
"MIT"
] | 11 | 2017-12-15T22:31:44.000Z | 2020-10-02T12:42:49.000Z | 1301-1400/1337-The K Weakest Rows in a Matrix/1337-The K Weakest Rows in a Matrix.cpp | jolly-fellow/LeetCode | ab20b3ec137ed05fad1edda1c30db04ab355486f | [
"MIT"
] | 28 | 2017-12-05T10:56:51.000Z | 2022-01-26T18:18:27.000Z | class Solution {
public:
vector<int> kWeakestRows(vector<vector<int>>& mat, int k) {
set<pair<int, int>> table;
for (int i = 0; i < mat.size(); ++i) {
table.insert({accumulate(mat[i].begin(), mat[i].end(), 0), i});
}
vector<int> result;
for (auto it = table.begin(... | 28.266667 | 75 | 0.492925 | jiadaizhao |
d984496f46e4cafced078fdb6651e0e63ca97677 | 8,190 | cpp | C++ | OpenSees/SRC/reliability/analysis/telm/NonStatFirstPassageAnalyzer.cpp | kuanshi/ductile-fracture | ccb350564df54f5c5ec3a079100effe261b46650 | [
"MIT"
] | null | null | null | OpenSees/SRC/reliability/analysis/telm/NonStatFirstPassageAnalyzer.cpp | kuanshi/ductile-fracture | ccb350564df54f5c5ec3a079100effe261b46650 | [
"MIT"
] | null | null | null | OpenSees/SRC/reliability/analysis/telm/NonStatFirstPassageAnalyzer.cpp | kuanshi/ductile-fracture | ccb350564df54f5c5ec3a079100effe261b46650 | [
"MIT"
] | 1 | 2020-08-06T21:12:16.000Z | 2020-08-06T21:12:16.000Z | // $Revision: 1.1 $
// $Date: 2008-02-29 19:43:53 $
// $Source: /usr/local/cvs/OpenSees/SRC/reliability/analysis/telm/NonStatFirstPassageAnalyzer.cpp,v $
#include <NonStatFirstPassageAnalyzer.h>
NonStatFirstPassageAnalyzer::NonStatFirstPassageAnalyzer(ReliabilityDomain* passedReliabilityDomain,
FindDesignPoint... | 32.891566 | 101 | 0.626496 | kuanshi |
d98ce65fda9867a9f10ab86e3e15f0b90d25ada8 | 7,171 | cpp | C++ | video.cpp | jwatte/viewtune | 3433ed1793c8a2209a615700e8574e509ab38a0e | [
"MIT"
] | null | null | null | video.cpp | jwatte/viewtune | 3433ed1793c8a2209a615700e8574e509ab38a0e | [
"MIT"
] | null | null | null | video.cpp | jwatte/viewtune | 3433ed1793c8a2209a615700e8574e509ab38a0e | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "video.h"
#include "riffs.h"
#include <vector>
#include <stdio.h>
extern "C" {
#pragma warning(disable: 4244)
#pragma warning(disable: 4996)
#include <libavformat/avformat.h>
#include <libavcodec/avcodec.h>
#include <libavutil/mem.h>
#include <libavutil/buffer.h>
#include <l... | 30.004184 | 110 | 0.550132 | jwatte |
d98e9cd474e56764b7c8516ffff317532617f137 | 974 | cpp | C++ | ZenUnitLibraryTests/EqualizersAndRandoms/TestRunResultEqualizerAndRandomTests.cpp | NeilJustice/ZenUnit | 6ddbe157e4652ac76aa074a70f9f83e34ee779df | [
"MIT"
] | 2 | 2018-04-21T06:38:53.000Z | 2018-08-31T00:56:21.000Z | ZenUnitLibraryTests/EqualizersAndRandoms/TestRunResultEqualizerAndRandomTests.cpp | NeilJustice/ZenUnitAndZenMock | bbcb4221d063fa04e4ef3a98143e0f123e3af8d5 | [
"MIT"
] | 1 | 2021-03-03T07:19:16.000Z | 2021-03-28T21:46:32.000Z | ZenUnitLibraryTests/EqualizersAndRandoms/TestRunResultEqualizerAndRandomTests.cpp | NeilJustice/ZenUnitAndZenMock | bbcb4221d063fa04e4ef3a98143e0f123e3af8d5 | [
"MIT"
] | null | null | null | #include "pch.h"
#include "ZenUnitTestUtils/EqualizersAndRandoms/TestRunResultEqualizerAndRandom.h"
namespace ZenUnit
{
TESTS(TestRunResultEqualizerAndRandomTests)
AFACT(ZenUnitEqualizer_ThrowsIfAnyFieldNotEqual)
EVIDENCE
TEST(ZenUnitEqualizer_ThrowsIfAnyFieldNotEqual)
{
ZENUNIT_EQUALI... | 46.380952 | 147 | 0.824435 | NeilJustice |
d99218e47bd6535383e54e5ac49519f1fd2626ae | 1,350 | hpp | C++ | deployment/configenv/xml_jlibpt/ConfigEnvFactory.hpp | davidarcher/HPCC-Platform | fa817ab9ea7d8154ac08bc780ce9ce673f3e51e3 | [
"Apache-2.0"
] | 286 | 2015-01-03T12:45:17.000Z | 2022-03-25T18:12:57.000Z | deployment/configenv/xml_jlibpt/ConfigEnvFactory.hpp | davidarcher/HPCC-Platform | fa817ab9ea7d8154ac08bc780ce9ce673f3e51e3 | [
"Apache-2.0"
] | 9,034 | 2015-01-02T08:49:19.000Z | 2022-03-31T20:34:44.000Z | deployment/configenv/xml_jlibpt/ConfigEnvFactory.hpp | cloLN/HPCC-Platform | 42ffb763a1cdcf611d3900831973d0a68e722bbe | [
"Apache-2.0"
] | 208 | 2015-01-02T03:27:28.000Z | 2022-02-11T05:54:52.000Z | /*##############################################################################
HPCC SYSTEMS software Copyright (C) 2018 HPCC Systems®.
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... | 29.347826 | 90 | 0.66963 | davidarcher |
d99220c4343da522edb4e2580575a7cc271d3adc | 2,400 | cpp | C++ | game/source/src/Projectile_creator.cpp | mateusgondim/Demos | 6aa5da3a6c0e960d10811c9e71e9a0a746e8d6ab | [
"MIT"
] | 5 | 2019-02-12T07:23:55.000Z | 2020-06-22T15:03:36.000Z | game/source/src/Projectile_creator.cpp | mateusgondim/Demos | 6aa5da3a6c0e960d10811c9e71e9a0a746e8d6ab | [
"MIT"
] | null | null | null | game/source/src/Projectile_creator.cpp | mateusgondim/Demos | 6aa5da3a6c0e960d10811c9e71e9a0a746e8d6ab | [
"MIT"
] | 2 | 2019-06-17T05:04:21.000Z | 2020-04-22T09:05:57.000Z | #include "Projectile_creator.hpp"
#include "Creator.hpp"
#include "Game_object.hpp"
#include "Projectile.hpp"
#include "vec2.hpp"
#include "vec3.hpp"
#include "AABB_2d.hpp"
#include "Animator_controller.hpp"
#include "Animator_state.hpp"
#include "Sprite_atlas.hpp"
#include "Sprite_atlas_manager.hpp"
#include "strin... | 33.333333 | 112 | 0.7375 | mateusgondim |
d99259c7aed9cf5a3cab45f52f29942bb24d3f0d | 987 | hpp | C++ | library/ATF/GUILD_BATTLE__CGuildBattleRewardItem.hpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | library/ATF/GUILD_BATTLE__CGuildBattleRewardItem.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | library/ATF/GUILD_BATTLE__CGuildBattleRewardItem.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 44 | 2017-12-19T08:02:59.000Z | 2022-02-24T23:15:01.000Z | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
#include <CPlayer.hpp>
#include <_base_fld.hpp>
START_ATF_NAMESPACE
namespace GUILD_BATTLE
{
#pragma pack(push, 8)
struct CGuildBattleRewardItem... | 30.84375 | 122 | 0.628166 | lemkova |
d993329a5cea357b30f8b41f680a090dc4745805 | 2,078 | hpp | C++ | nes_py/nes/include/mappers/mapper_NROM.hpp | lucasschoenhold/nes-py | 7de04f48e928cf96ba0976ee61def5958aaa759d | [
"MIT"
] | 128 | 2018-07-22T03:31:42.000Z | 2022-03-28T13:17:04.000Z | nes_py/nes/include/mappers/mapper_NROM.hpp | lucasschoenhold/nes-py | 7de04f48e928cf96ba0976ee61def5958aaa759d | [
"MIT"
] | 35 | 2018-07-20T16:37:23.000Z | 2022-02-04T00:37:23.000Z | nes_py/nes/include/mappers/mapper_NROM.hpp | lucasschoenhold/nes-py | 7de04f48e928cf96ba0976ee61def5958aaa759d | [
"MIT"
] | 31 | 2019-02-19T10:56:22.000Z | 2022-01-15T19:32:52.000Z | // Program: nes-py
// File: mapper_NROM.hpp
// Description: An implementation of the NROM mapper
//
// Copyright (c) 2019 Christian Kauten. All rights reserved.
//
#ifndef MAPPERNROM_HPP
#define MAPPERNROM_HPP
#include <vector>
#include "common.hpp"
#include "mapper.hpp"
namespace NES {
class Mapp... | 27.706667 | 71 | 0.637151 | lucasschoenhold |
d997ee70695ea7a074225cf474de6e0e77787952 | 8,297 | cpp | C++ | wbsModels/Climatic/VaporPressureDeficit.cpp | RNCan/WeatherBasedSimulationFramework | 19df207d11b1dddf414d78e52bece77f31d45df8 | [
"MIT"
] | 6 | 2017-05-26T21:19:41.000Z | 2021-09-03T14:17:29.000Z | wbsModels/Climatic/VaporPressureDeficit.cpp | RNCan/WeatherBasedSimulationFramework | 19df207d11b1dddf414d78e52bece77f31d45df8 | [
"MIT"
] | 5 | 2016-02-18T12:39:58.000Z | 2016-03-13T12:57:45.000Z | wbsModels/Climatic/VaporPressureDeficit.cpp | RNCan/WeatherBasedSimulationFramework | 19df207d11b1dddf414d78e52bece77f31d45df8 | [
"MIT"
] | 1 | 2019-06-16T02:49:20.000Z | 2019-06-16T02:49:20.000Z | //**********************************************************************
// 11/09/2018 1.1.1 Rémi Saint-Amant Bug correction in units. return VPD in [hPa]
// 20/09/2016 1.1.0 Rémi Saint-Amant Change Tair and Trng by Tmin and Tmax
// 21/01/2016 1.0.0 Rémi Saint-Amant Using Weather-based simulation framework (W... | 25.45092 | 91 | 0.60082 | RNCan |
d99e0fc329d535d7938e7ddc4049be67845d0a17 | 18,085 | hpp | C++ | inc/state/thrdcmdpool.hpp | nicoboss/vuda | 9e0e254dd6a37d418292e1e949fdf33262f008e9 | [
"MIT"
] | 422 | 2018-10-08T04:58:20.000Z | 2022-03-23T10:31:25.000Z | inc/state/thrdcmdpool.hpp | nicoboss/vuda | 9e0e254dd6a37d418292e1e949fdf33262f008e9 | [
"MIT"
] | 18 | 2018-10-10T20:45:43.000Z | 2021-11-28T08:36:37.000Z | inc/state/thrdcmdpool.hpp | nicoboss/vuda | 9e0e254dd6a37d418292e1e949fdf33262f008e9 | [
"MIT"
] | 24 | 2018-10-08T11:11:49.000Z | 2022-02-18T01:07:42.000Z | #pragma once
namespace vuda
{
namespace detail
{
class thrdcmdpool
{
//friend class logical_device;
public:
/*
For each thread that sets/uses the device a single command pool is created
- this pool ha... | 44.32598 | 308 | 0.509594 | nicoboss |
d99e19814707922f174edf275686564c9d081b8c | 1,018 | cpp | C++ | source/Ch18/orai_anyag/vector004.cpp | Vada200/UDProg-Introduction | c424b2676d6e5bfc4d53d61c5d0deded566c1c84 | [
"CC0-1.0"
] | null | null | null | source/Ch18/orai_anyag/vector004.cpp | Vada200/UDProg-Introduction | c424b2676d6e5bfc4d53d61c5d0deded566c1c84 | [
"CC0-1.0"
] | null | null | null | source/Ch18/orai_anyag/vector004.cpp | Vada200/UDProg-Introduction | c424b2676d6e5bfc4d53d61c5d0deded566c1c84 | [
"CC0-1.0"
] | null | null | null | #include "std_lib_facilities.h"
class My_vector { //priv
long unsigned int sz; //size / előjel nélküli long típusú int
double* elem; //elem pointer
public:
My_vector(int s) : sz(s), elem{new double[s]} // int s értéke bemásolódik sz-be, elem néven lefoglalódik a memóriában a double vector
{
for (int... | 26.102564 | 135 | 0.59725 | Vada200 |
d99f0d5667be22679b3b23559b79eb489b5cb6ac | 601 | cpp | C++ | Challenges/Personal/InvertMostSign.cpp | zakhars/Education | 4d791f6b4559a90ee383039aaeb15c7041138b12 | [
"MIT"
] | null | null | null | Challenges/Personal/InvertMostSign.cpp | zakhars/Education | 4d791f6b4559a90ee383039aaeb15c7041138b12 | [
"MIT"
] | null | null | null | Challenges/Personal/InvertMostSign.cpp | zakhars/Education | 4d791f6b4559a90ee383039aaeb15c7041138b12 | [
"MIT"
] | null | null | null | #pragma once
#include <iostream>
#include <bitset>
unsigned short InvertMostSign(unsigned short val)
{
int mostSignBit = -1;
for(int i = 15; i >= 0; i--)
{
if (val & (1 << i))
{
mostSignBit = i;
break;
}
}
if (mostSignBit != -1)
{
return (... | 20.033333 | 142 | 0.530782 | zakhars |
d99fef68f614e65d9c3aac7d31a0f9669620d909 | 34,228 | cxx | C++ | Code/bmEditor.cxx | NIRALUser/BatchMake | 1afeb15fa5bd18be6e4a56f4349eb6368a91441e | [
"Unlicense"
] | null | null | null | Code/bmEditor.cxx | NIRALUser/BatchMake | 1afeb15fa5bd18be6e4a56f4349eb6368a91441e | [
"Unlicense"
] | null | null | null | Code/bmEditor.cxx | NIRALUser/BatchMake | 1afeb15fa5bd18be6e4a56f4349eb6368a91441e | [
"Unlicense"
] | null | null | null | /*=========================================================================
Program: BatchMake
Module: bmEditor.cxx
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) 2005 Insight Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for de... | 28.690696 | 98 | 0.549959 | NIRALUser |
d263de79c1bc78cf6370bf66123136b8155de065 | 124,838 | cpp | C++ | 403_407_408_411_Ray_Tracer/src/ui.cpp | amritphuyal/Computer-Graphics-074-BEX | ee77526a6e2ce53d696b802650917f5a0438af14 | [
"MIT"
] | 5 | 2020-03-06T10:01:28.000Z | 2020-05-06T07:57:20.000Z | 403_407_408_411_Ray_Tracer/src/ui.cpp | amritphuyal/Computer-Graphics-074-BEX | ee77526a6e2ce53d696b802650917f5a0438af14 | [
"MIT"
] | 1 | 2020-03-06T02:51:50.000Z | 2020-03-06T04:33:30.000Z | 403_407_408_411_Ray_Tracer/src/ui.cpp | amritphuyal/Computer-Graphics-074-BEX | ee77526a6e2ce53d696b802650917f5a0438af14 | [
"MIT"
] | 29 | 2020-03-05T15:15:24.000Z | 2021-07-21T07:05:00.000Z | #define OS_LINUX_CPP
#define HANDMADE_MATH_IMPLEMENTATION
#include <stdio.h>
#include <cstdlib>
#include "imgui.h"
#include "imgui_impl_glfw.h"
#include "imgui_impl_opengl3.h"
#include <glad/glad.h>
#include <GLFW/glfw3.h>
#include "common.h"
#include <cassert>
#include <cmath>
#define STB_IMAGE_IMPLEMENTATION
#inclu... | 30.552619 | 150 | 0.594915 | amritphuyal |
d2640a83c636f758bbe9ccc9ed886d422597621f | 1,696 | cpp | C++ | lib/AST/Pattern.cpp | mattapet/dusk-lang | 928b027429a3fd38cece78a89a9619406dcdd9f0 | [
"MIT"
] | 1 | 2022-03-30T22:01:44.000Z | 2022-03-30T22:01:44.000Z | lib/AST/Pattern.cpp | mattapet/dusk-lang | 928b027429a3fd38cece78a89a9619406dcdd9f0 | [
"MIT"
] | null | null | null | lib/AST/Pattern.cpp | mattapet/dusk-lang | 928b027429a3fd38cece78a89a9619406dcdd9f0 | [
"MIT"
] | null | null | null | //===--- Stmt.cpp ---------------------------------------------------------===//
//
// dusk-lang
// This source file is part of a dusk-lang project, which is a semestral
// assignement for BI-PJP course at Czech Technical University in Prague.
// The software is provided "AS IS", WITHOUT... | 36.085106 | 80 | 0.570755 | mattapet |
d2691261365a587d79634ba5899d220f2bce2c39 | 2,137 | hpp | C++ | kits/daisy/src/input/input_manager_mobile_io.hpp | HebiRobotics/hebi-cpp-examples | db01c9b957b3c97885d452d8b72f9919ba6c48c4 | [
"Apache-2.0"
] | 7 | 2018-03-31T06:52:08.000Z | 2022-02-24T21:27:09.000Z | kits/daisy/src/input/input_manager_mobile_io.hpp | HebiRobotics/hebi-cpp-examples | db01c9b957b3c97885d452d8b72f9919ba6c48c4 | [
"Apache-2.0"
] | 34 | 2018-06-03T17:28:08.000Z | 2021-05-29T01:15:25.000Z | kits/daisy/src/input/input_manager_mobile_io.hpp | HebiRobotics/hebi-cpp-examples | db01c9b957b3c97885d452d8b72f9919ba6c48c4 | [
"Apache-2.0"
] | 9 | 2018-02-08T22:50:58.000Z | 2021-03-30T08:07:35.000Z | #pragma once
#include "input_manager.hpp"
#include <Eigen/Dense>
#include "group.hpp"
#include <memory>
#include <atomic>
namespace hebi {
namespace input {
// If the I/O board/app is not found, command vectors return 0, and button
// um toggle/quit states are unchanged by 'update'. Class is not
// re-entrant.
class... | 27.753247 | 80 | 0.722976 | HebiRobotics |
d26a26e5401be4c03c63188513625929e32a9b38 | 1,179 | cpp | C++ | problem 1-50/45. Jump Game II.cpp | just-essential/LeetCode-Cpp | 3ec49434d257defd28bfe4784ecd0ff2f9077a31 | [
"MIT"
] | null | null | null | problem 1-50/45. Jump Game II.cpp | just-essential/LeetCode-Cpp | 3ec49434d257defd28bfe4784ecd0ff2f9077a31 | [
"MIT"
] | null | null | null | problem 1-50/45. Jump Game II.cpp | just-essential/LeetCode-Cpp | 3ec49434d257defd28bfe4784ecd0ff2f9077a31 | [
"MIT"
] | null | null | null | /*
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Your goal is to reach the last index in the minimum number of jumps.
Example:
Input: [2,3,1,1,4]
Output: 2
Explanation: The minimu... | 27.418605 | 102 | 0.516539 | just-essential |
d26f4fe365543d2d29c31dea739648798b35349a | 7,479 | cpp | C++ | mitsuba-af602c6fd98a/src/emitters/directional.cpp | NTForked-ML/pbrs | 0b405d92c12d257e2581366542762c9f0c3facce | [
"MIT"
] | 139 | 2017-04-21T00:22:34.000Z | 2022-02-16T20:33:10.000Z | mitsuba-af602c6fd98a/src/emitters/directional.cpp | NTForked-ML/pbrs | 0b405d92c12d257e2581366542762c9f0c3facce | [
"MIT"
] | 11 | 2017-08-15T18:22:59.000Z | 2019-07-01T05:44:41.000Z | mitsuba-af602c6fd98a/src/emitters/directional.cpp | NTForked-ML/pbrs | 0b405d92c12d257e2581366542762c9f0c3facce | [
"MIT"
] | 30 | 2017-07-21T03:56:45.000Z | 2022-03-11T06:55:34.000Z | /*
This file is part of Mitsuba, a physically based rendering system.
Copyright (c) 2007-2014 by Wenzel Jakob and others.
Mitsuba is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License Version 3
as published by the Free Software Foundation.
... | 31.825532 | 105 | 0.701163 | NTForked-ML |
d26fc404c5320d9b99581cede8b739187ab0c1a2 | 13,233 | cpp | C++ | project/TinyCADxxx/XMLReader.cpp | lakeweb/ECAD | 9089253afd39adecd88f4a33056f91b646207e00 | [
"MIT"
] | null | null | null | project/TinyCADxxx/XMLReader.cpp | lakeweb/ECAD | 9089253afd39adecd88f4a33056f91b646207e00 | [
"MIT"
] | null | null | null | project/TinyCADxxx/XMLReader.cpp | lakeweb/ECAD | 9089253afd39adecd88f4a33056f91b646207e00 | [
"MIT"
] | 2 | 2019-06-21T16:17:49.000Z | 2020-07-04T13:41:01.000Z | /*
TinyCAD program for schematic capture
Copyright 1994-2004 Matt Pyne.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later v... | 20.580093 | 233 | 0.650722 | lakeweb |
d26fd18e9b47cbcea57806cecceac714dc2d1da4 | 611 | cpp | C++ | programming/dataStructure_Algorithm/exercises/bigProblems/pairToUnorderedSet.cpp | ljyang100/dataScience | ad2b243673c570c18d83ab1a0cd1bb4694c17eac | [
"MIT"
] | 2 | 2020-12-10T02:05:29.000Z | 2021-05-30T15:23:56.000Z | programming/dataStructure_Algorithm/exercises/bigProblems/pairToUnorderedSet.cpp | ljyang100/dataScience | ad2b243673c570c18d83ab1a0cd1bb4694c17eac | [
"MIT"
] | null | null | null | programming/dataStructure_Algorithm/exercises/bigProblems/pairToUnorderedSet.cpp | ljyang100/dataScience | ad2b243673c570c18d83ab1a0cd1bb4694c17eac | [
"MIT"
] | 1 | 2020-04-21T11:18:18.000Z | 2020-04-21T11:18:18.000Z | #include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <functional>
int main()
{
//**** Note ****
//**** Important. Although in standard we cannot insert pair to unordered_set, we can do so for std::multiset. See example in find K pairs of smallest sum.
std::unordered_... | 33.944444 | 157 | 0.729951 | ljyang100 |
d2708f9c33f6d973a94fea6a9d89f61d8dd5ee9d | 6,256 | cpp | C++ | BLAXED/AnimatedClanTag.cpp | prismatical/BX-CSGO | 24b2cadefdc40cb8d3fca0aab08ec54241518958 | [
"MIT"
] | 19 | 2018-03-04T08:04:29.000Z | 2022-01-27T11:28:36.000Z | BLAXED/AnimatedClanTag.cpp | prismatical/BX-CSGO | 24b2cadefdc40cb8d3fca0aab08ec54241518958 | [
"MIT"
] | 1 | 2019-12-27T15:43:41.000Z | 2020-05-18T19:16:42.000Z | BLAXED/AnimatedClanTag.cpp | prismatical/BX-CSGO | 24b2cadefdc40cb8d3fca0aab08ec54241518958 | [
"MIT"
] | 9 | 2019-03-30T22:39:25.000Z | 2021-08-13T19:27:27.000Z | #include "SDK.h"
#include "Global.h"
#include "Configs.h"
#include "AnimatedClanTag.h"
AnimatedClanTag *animatedClanTag = new AnimatedClanTag();
void AnimatedClanTag::Tick()
{
char tag[64];
int i = 0;
float serverTime = (float)I::pEngineClient->GetServerTick() * (I::pGlobals->interval_per_tick * 2);
std::vector<... | 28.56621 | 100 | 0.594789 | prismatical |
d272d3b49b83fda00b6a1747a2dcc867b30e6cf7 | 1,236 | cpp | C++ | Material/CPP_Primer_Plus_Book/Ch.04/Ch.04 - Exercise 05 - Struct/main.cpp | hpaucar/OOP-C-plus-plus-repo | e1fedd376029996a53d70d452b7738d9c43173c0 | [
"MIT"
] | 4 | 2020-12-26T03:17:45.000Z | 2022-01-11T05:54:40.000Z | Material/CPP_Primer_Plus_Book/Ch.04/Ch.04 - Exercise 05 - Struct/main.cpp | hpaucar/OOP-C-plus-plus-repo | e1fedd376029996a53d70d452b7738d9c43173c0 | [
"MIT"
] | null | null | null | Material/CPP_Primer_Plus_Book/Ch.04/Ch.04 - Exercise 05 - Struct/main.cpp | hpaucar/OOP-C-plus-plus-repo | e1fedd376029996a53d70d452b7738d9c43173c0 | [
"MIT"
] | null | null | null | //*******************************
//
// C++ Template Program
//
//*******************************
//*******************************
//
// Standard Header
//
//*******************************
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
//**************************... | 16.931507 | 59 | 0.420712 | hpaucar |
d27d87335727fd36e542dbf7f30cf40b8906ad9f | 166 | cpp | C++ | Tests/TestProjects/VS2010/C++/PreprocessorTest/App/main.cpp | veganaize/make-it-so | e1f8a0c6c372891dfda3a807e80f3797efdc4a99 | [
"MIT"
] | null | null | null | Tests/TestProjects/VS2010/C++/PreprocessorTest/App/main.cpp | veganaize/make-it-so | e1f8a0c6c372891dfda3a807e80f3797efdc4a99 | [
"MIT"
] | null | null | null | Tests/TestProjects/VS2010/C++/PreprocessorTest/App/main.cpp | veganaize/make-it-so | e1f8a0c6c372891dfda3a807e80f3797efdc4a99 | [
"MIT"
] | null | null | null | #include <stdio.h>
int main(int argc, char** argv)
{
#ifdef HELLO
printf("Hello, ");
#endif
#ifdef WORLD
printf("World!");
#endif
return 0;
} | 11.857143 | 32 | 0.566265 | veganaize |
d27da382912347321c74faa00cd6f18fe88202cb | 1,535 | cpp | C++ | source/Window/Window-NOTHREAD.cpp | hadryansalles/ray-tracing-from-the-ground-up | 4ca02fca2cdd458767b4ab3df15b6cd20cb1f413 | [
"MIT"
] | 5 | 2021-09-24T12:22:08.000Z | 2022-03-23T06:54:02.000Z | source/Window/Window-NOTHREAD.cpp | hadryans/ray-tracing-from-the-ground-up | 4ca02fca2cdd458767b4ab3df15b6cd20cb1f413 | [
"MIT"
] | null | null | null | source/Window/Window-NOTHREAD.cpp | hadryans/ray-tracing-from-the-ground-up | 4ca02fca2cdd458767b4ab3df15b6cd20cb1f413 | [
"MIT"
] | 5 | 2021-08-14T22:26:11.000Z | 2022-03-04T09:13:39.000Z | #include "Window-NOTHREAD.hpp"
Window_NOTHREAD::Window_NOTHREAD(int width, int height):
Window(width, height) {
}
Window_NOTHREAD::~Window_NOTHREAD(){
pixels.clear();
}
void Window_NOTHREAD::init(){
window = SDL_CreateWindow("RTX", SDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED,
w, h,SDL_WINDOW_SHOWN... | 29.519231 | 99 | 0.628664 | hadryansalles |
d27ec49488abf5a728f5c969472c52354f951ed8 | 42,534 | cpp | C++ | arangod/Cluster/HeartbeatThread.cpp | Deckhandfirststar01/arangodb | a8c079252f9c7127ef6860f5ad46ec38055669ce | [
"BSL-1.0",
"Zlib",
"Apache-2.0"
] | null | null | null | arangod/Cluster/HeartbeatThread.cpp | Deckhandfirststar01/arangodb | a8c079252f9c7127ef6860f5ad46ec38055669ce | [
"BSL-1.0",
"Zlib",
"Apache-2.0"
] | null | null | null | arangod/Cluster/HeartbeatThread.cpp | Deckhandfirststar01/arangodb | a8c079252f9c7127ef6860f5ad46ec38055669ce | [
"BSL-1.0",
"Zlib",
"Apache-2.0"
] | null | null | null | ////////////////////////////////////////////////////////////////////////////////
/// DISCLAIMER
///
/// Copyright 2014-2016 ArangoDB GmbH, Cologne, Germany
/// Copyright 2004-2014 triAGENS GmbH, Cologne, Germany
///
/// Licensed under the Apache License, Version 2.0 (the "License");
/// you may not use this file except... | 36.478559 | 114 | 0.585955 | Deckhandfirststar01 |
d289229d760e61ac3f7cbffbf1b29e019bbdeeb5 | 2,819 | cpp | C++ | WebKit/Source/WebKit/qt/declarative/experimental/plugin.cpp | JavaScriptTesting/LJS | 9818dbdb421036569fff93124ac2385d45d01c3a | [
"Apache-2.0"
] | 1 | 2019-06-18T06:52:54.000Z | 2019-06-18T06:52:54.000Z | WebKit/Source/WebKit/qt/declarative/experimental/plugin.cpp | JavaScriptTesting/LJS | 9818dbdb421036569fff93124ac2385d45d01c3a | [
"Apache-2.0"
] | null | null | null | WebKit/Source/WebKit/qt/declarative/experimental/plugin.cpp | JavaScriptTesting/LJS | 9818dbdb421036569fff93124ac2385d45d01c3a | [
"Apache-2.0"
] | null | null | null | /*
Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies)
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) an... | 44.746032 | 165 | 0.766939 | JavaScriptTesting |
d28ac01b7d27882b602ea102e972bd4dd6f7c232 | 2,626 | cpp | C++ | OpenSees/SRC/reliability/analysis/telm/rancombi.cpp | kuanshi/ductile-fracture | ccb350564df54f5c5ec3a079100effe261b46650 | [
"MIT"
] | null | null | null | OpenSees/SRC/reliability/analysis/telm/rancombi.cpp | kuanshi/ductile-fracture | ccb350564df54f5c5ec3a079100effe261b46650 | [
"MIT"
] | null | null | null | OpenSees/SRC/reliability/analysis/telm/rancombi.cpp | kuanshi/ductile-fracture | ccb350564df54f5c5ec3a079100effe261b46650 | [
"MIT"
] | 1 | 2020-08-06T21:12:16.000Z | 2020-08-06T21:12:16.000Z | /************************ RANCOMBI.CPP ****************** AgF 2001-10-18 *
* *
* This file defines a template class for combining two different *
* random number generators. A combination of two random number *
* generators is gen... | 38.617647 | 82 | 0.54722 | kuanshi |
d28adf99ddc3e918658c5df1e127a050c3fff611 | 5,523 | cpp | C++ | cdn/src/v20180606/model/MaxAgeRule.cpp | suluner/tencentcloud-sdk-cpp | a56c73cc3f488c4d1e10755704107bb15c5e000d | [
"Apache-2.0"
] | 43 | 2019-08-14T08:14:12.000Z | 2022-03-30T12:35:09.000Z | cdn/src/v20180606/model/MaxAgeRule.cpp | suluner/tencentcloud-sdk-cpp | a56c73cc3f488c4d1e10755704107bb15c5e000d | [
"Apache-2.0"
] | 12 | 2019-07-15T10:44:59.000Z | 2021-11-02T12:35:00.000Z | cdn/src/v20180606/model/MaxAgeRule.cpp | suluner/tencentcloud-sdk-cpp | a56c73cc3f488c4d1e10755704107bb15c5e000d | [
"Apache-2.0"
] | 28 | 2019-07-12T09:06:22.000Z | 2022-03-30T08:04:18.000Z | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. 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
... | 29.068421 | 141 | 0.68948 | suluner |
d28b3547eb0e4d66d90ddbaf151154ec854349e9 | 364 | cpp | C++ | experimental/Pomdog.Experimental/Rendering/Commands/PrimitiveCommand.cpp | ValtoForks/pomdog | 73798ae5f4a4c3b9b1e1e96239187c4b842c93b2 | [
"MIT"
] | null | null | null | experimental/Pomdog.Experimental/Rendering/Commands/PrimitiveCommand.cpp | ValtoForks/pomdog | 73798ae5f4a4c3b9b1e1e96239187c4b842c93b2 | [
"MIT"
] | null | null | null | experimental/Pomdog.Experimental/Rendering/Commands/PrimitiveCommand.cpp | ValtoForks/pomdog | 73798ae5f4a4c3b9b1e1e96239187c4b842c93b2 | [
"MIT"
] | null | null | null | // Copyright (c) 2013-2018 mogemimi. Distributed under the MIT license.
#include "PrimitiveCommand.hpp"
#include <typeinfo>
namespace Pomdog {
namespace Rendering {
std::type_index PrimitiveCommand::GetType() const noexcept
{
static const std::type_index index = typeid(PrimitiveCommand);
return index;
}
} /... | 21.411765 | 71 | 0.75 | ValtoForks |
d28e0ed0eec37b8be772216052d755a22ef7a7cc | 362 | cpp | C++ | Series Patterns/seriespattern16.cpp | Starkl7/CPlusPlus-PatternHouse | cf53feac9857d0d87981909e0e8daeda26cb02f4 | [
"MIT"
] | 4 | 2021-09-21T03:43:26.000Z | 2022-01-07T03:07:56.000Z | Series Patterns/seriespattern16.cpp | Starkl7/CPlusPlus-PatternHouse | cf53feac9857d0d87981909e0e8daeda26cb02f4 | [
"MIT"
] | 916 | 2021-09-01T15:40:24.000Z | 2022-01-10T17:57:59.000Z | Series Patterns/seriespattern16.cpp | Starkl7/CPlusPlus-PatternHouse | cf53feac9857d0d87981909e0e8daeda26cb02f4 | [
"MIT"
] | 20 | 2021-09-30T18:13:58.000Z | 2022-01-06T09:55:36.000Z | #include<iostream>
using namespace std;
int main()
{
long d,n,a1;
float an;
cout<<"Enter first term ";
cin>>a1;
cout<<"Enter difference ";
cin>>d;
cout<<"Enter number of terms";
cin>>n;
cout<<"Harmonic progression : ";
for(int y=1;y<=n;y++)
{
an=a1+(y-1)*d;
co... | 18.1 | 36 | 0.5 | Starkl7 |
d28fa679fa7114dee2fa1eaf6219907dbacbf930 | 4,151 | cpp | C++ | SyP2.cpp | AnimaxNeil/Data-structure | dd7675907bd17325e4629c1529835f0a4452fdcd | [
"MIT"
] | null | null | null | SyP2.cpp | AnimaxNeil/Data-structure | dd7675907bd17325e4629c1529835f0a4452fdcd | [
"MIT"
] | null | null | null | SyP2.cpp | AnimaxNeil/Data-structure | dd7675907bd17325e4629c1529835f0a4452fdcd | [
"MIT"
] | null | null | null | // WAP using templates to sort a list of elements. Give user the option to perform sorting using Insertion sort, Bubble sort or Selection sort.
#include <iostream>
using namespace std;
template <typename T>
class List
{
T *arr;
int capacity;
void adjust_capacity()
{
if (size == c... | 21.396907 | 144 | 0.349313 | AnimaxNeil |
d293773d2f738dab2cb0533707f1492835adb06f | 1,455 | hpp | C++ | client_essential/OpusEnc.hpp | zhang-ray/easy-voice-call | 9393a75f89d2f75c9d18d886abd38ffa5d9c5138 | [
"MIT"
] | 33 | 2018-10-11T05:30:37.000Z | 2022-02-10T12:51:47.000Z | client_essential/OpusEnc.hpp | zhang-ray/easy-voice-call | 9393a75f89d2f75c9d18d886abd38ffa5d9c5138 | [
"MIT"
] | 16 | 2018-10-15T06:52:41.000Z | 2020-11-06T02:53:21.000Z | client_essential/OpusEnc.hpp | zhang-ray/easy-voice-call | 9393a75f89d2f75c9d18d886abd38ffa5d9c5138 | [
"MIT"
] | 2 | 2019-09-14T18:07:57.000Z | 2020-04-29T09:38:02.000Z | #pragma once
#include "AudioEncoder.hpp"
#include "Singleton.hpp"
#include <cstring>
#include <set>
#if defined(WIN32) || defined(ANDROID)
#include <opus.h>
#else
#include <opus/opus.h>
#endif
#include "AudioCommon.hpp"
#define MAX_PACKET_SIZE (3*1276)
// libopus 1.2.1
// it seems like Opus' API is very easy to us... | 25.526316 | 107 | 0.618557 | zhang-ray |
d293cc2934ff4a15a8f17a225ca290285e373a23 | 2,035 | hpp | C++ | utils/reset_mv_camera.hpp | gcusms/WolfVision | f802df73918b7dadafa41bbbe7381a1df79ef07e | [
"MIT"
] | 24 | 2021-07-12T02:24:51.000Z | 2022-03-25T19:59:15.000Z | utils/reset_mv_camera.hpp | gcusms/WolfVision | f802df73918b7dadafa41bbbe7381a1df79ef07e | [
"MIT"
] | 16 | 2021-07-10T07:07:51.000Z | 2021-12-06T11:36:07.000Z | utils/reset_mv_camera.hpp | gcusms/WolfVision | f802df73918b7dadafa41bbbe7381a1df79ef07e | [
"MIT"
] | 38 | 2021-07-09T14:49:17.000Z | 2022-03-27T09:40:59.000Z | #pragma once
#include <algorithm>
#include <stdexcept>
#include <string>
#include <vector>
#include <fcntl.h>
#include <linux/usbdevice_fs.h>
#include <sys/ioctl.h>
#include <unistd.h>
#include <fmt/color.h>
namespace utils {
inline bool resetMVCamera() {
static const auto identifier_green = fmt::format(fg(fmt::... | 31.307692 | 115 | 0.588206 | gcusms |
d296c22e2245559cb256b471fe1ce8c0b34acc23 | 1,669 | cpp | C++ | AK/Tests/TestURL.cpp | JamiKettunen/serenity | 232da5cc188496f570ef55276a897f1095509c87 | [
"BSD-2-Clause"
] | 3 | 2020-05-01T02:39:03.000Z | 2021-11-26T08:34:54.000Z | AK/Tests/TestURL.cpp | JamiKettunen/serenity | 232da5cc188496f570ef55276a897f1095509c87 | [
"BSD-2-Clause"
] | null | null | null | AK/Tests/TestURL.cpp | JamiKettunen/serenity | 232da5cc188496f570ef55276a897f1095509c87 | [
"BSD-2-Clause"
] | 1 | 2021-06-02T18:02:51.000Z | 2021-06-02T18:02:51.000Z | #include <AK/TestSuite.h>
#include <AK/URL.h>
TEST_CASE(construct)
{
EXPECT_EQ(URL().is_valid(), false);
}
TEST_CASE(basic)
{
{
URL url("http://www.serenityos.org/index.html");
EXPECT_EQ(url.is_valid(), true);
EXPECT_EQ(url.protocol(), "http");
EXPECT_EQ(url.port(), 80);
... | 32.72549 | 97 | 0.633913 | JamiKettunen |
d296e06a9d38b3cdb7a2091a22a2f9ece557d9cb | 14,397 | cpp | C++ | src/slib/ui/select_view.cpp | emarc99/SLib | 4e492d6c550f845fd1b3f40bf10183097eb0e53c | [
"MIT"
] | 146 | 2017-03-21T07:50:43.000Z | 2022-03-19T03:32:22.000Z | src/slib/ui/select_view.cpp | Crasader/SLib | 4e492d6c550f845fd1b3f40bf10183097eb0e53c | [
"MIT"
] | 50 | 2017-03-22T04:08:15.000Z | 2019-10-21T16:55:48.000Z | src/slib/ui/select_view.cpp | Crasader/SLib | 4e492d6c550f845fd1b3f40bf10183097eb0e53c | [
"MIT"
] | 55 | 2017-03-21T07:52:58.000Z | 2021-12-27T13:02:08.000Z | /*
* Copyright (c) 2008-2019 SLIBIO <https://github.com/SLIBIO>
*
* 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
* ... | 23.563011 | 116 | 0.669653 | emarc99 |
d2982e07d7b4f94175a88cd15e3e008f6b74117d | 1,259 | cpp | C++ | answers/hackerrank/other3.cpp | FeiZhan/Algo-Collection | 708c4a38112e0b381864809788b9e44ac5ae4d05 | [
"MIT"
] | 3 | 2015-09-04T21:32:31.000Z | 2020-12-06T00:37:32.000Z | answers/hackerrank/other3.cpp | FeiZhan/Algo-Collection | 708c4a38112e0b381864809788b9e44ac5ae4d05 | [
"MIT"
] | null | null | null | answers/hackerrank/other3.cpp | FeiZhan/Algo-Collection | 708c4a38112e0b381864809788b9e44ac5ae4d05 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
#include <map>
using namespace std;
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
long long quantile = 0;
long long pair_num = 0;
cin >> quantile >> pair_num;
// a map with <value, count>
map<long long, long long> num... | 32.282051 | 96 | 0.583002 | FeiZhan |
d29992c0d04925508ac0b1c0b63726e35bf1a70e | 440 | cpp | C++ | CppPrimer/CppPrimer-Exercises/CppPrimer-Ch02/Exercise2.27.cpp | alaxion/Learning | 4b12b1603419252103cd933fdbfc4b2faffb6d00 | [
"MIT"
] | null | null | null | CppPrimer/CppPrimer-Exercises/CppPrimer-Ch02/Exercise2.27.cpp | alaxion/Learning | 4b12b1603419252103cd933fdbfc4b2faffb6d00 | [
"MIT"
] | null | null | null | CppPrimer/CppPrimer-Exercises/CppPrimer-Ch02/Exercise2.27.cpp | alaxion/Learning | 4b12b1603419252103cd933fdbfc4b2faffb6d00 | [
"MIT"
] | null | null | null | // Exercise2.27.cpp
// Ad
// Which of the following are legal?
#include <iostream>
int main()
{
int i = -1, &r = 0; // cannot refer to 0
int i2{0};
int *const p2 = &i2;
const int ii = -1, &rr = 0;
const int *const p3 = &i2;
const int *p1 = &i2;
const int &const r2; // n... | 20.952381 | 75 | 0.525 | alaxion |
d29d9a1cd915b0d7ac3a3b7a131942b318f774c6 | 1,737 | cc | C++ | hbase/src/model/DescribeRestoreSummaryRequest.cc | iamzken/aliyun-openapi-cpp-sdk | 3c991c9ca949b6003c8f498ce7a672ea88162bf1 | [
"Apache-2.0"
] | 89 | 2018-02-02T03:54:39.000Z | 2021-12-13T01:32:55.000Z | hbase/src/model/DescribeRestoreSummaryRequest.cc | iamzken/aliyun-openapi-cpp-sdk | 3c991c9ca949b6003c8f498ce7a672ea88162bf1 | [
"Apache-2.0"
] | 89 | 2018-03-14T07:44:54.000Z | 2021-11-26T07:43:25.000Z | hbase/src/model/DescribeRestoreSummaryRequest.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... | 27.571429 | 79 | 0.765112 | iamzken |
d29e6460b20f51183576e79baec21c29ef6fc0ec | 711 | cpp | C++ | Templates/Find kth root.cpp | Shefin-CSE16/Competitive-Programming | 7c792081ae1d4b7060893165de34ffe7b9b7caed | [
"MIT"
] | 5 | 2020-10-03T17:15:26.000Z | 2022-03-29T21:39:22.000Z | Templates/Find kth root.cpp | Shefin-CSE16/Competitive-Programming | 7c792081ae1d4b7060893165de34ffe7b9b7caed | [
"MIT"
] | null | null | null | Templates/Find kth root.cpp | Shefin-CSE16/Competitive-Programming | 7c792081ae1d4b7060893165de34ffe7b9b7caed | [
"MIT"
] | 1 | 2021-03-01T12:56:50.000Z | 2021-03-01T12:56:50.000Z | #define ll long long
vector <ll> graph[100009];
ll table[100009][20], sz[100009], MLOG, n; /// MLOG = log(n) + 1
void szdfs(ll u, ll p, ll lv)
{
sz[u] = 1;
table[u][0] = p;
for(ll i = 0; i < graph[u].size(); i++) {
ll nd = graph[u][i];
if(nd == p)
continue;
szdfs(nd... | 16.534884 | 66 | 0.372714 | Shefin-CSE16 |
d2a0ae84c7af012949c0f5b7b038854344b8f659 | 520 | hh | C++ | 2d/src/quad_march.hh | softwarecapital/chr1shr.voro | 122531fbe162ea9a94b7e96ee9d57d3957c337ca | [
"BSD-3-Clause-LBNL"
] | 43 | 2019-09-29T01:14:25.000Z | 2022-03-02T23:48:25.000Z | 2d/src/quad_march.hh | softwarecapital/chr1shr.voro | 122531fbe162ea9a94b7e96ee9d57d3957c337ca | [
"BSD-3-Clause-LBNL"
] | 15 | 2019-10-19T23:39:39.000Z | 2021-12-30T22:03:51.000Z | 2d/src/quad_march.hh | softwarecapital/chr1shr.voro | 122531fbe162ea9a94b7e96ee9d57d3957c337ca | [
"BSD-3-Clause-LBNL"
] | 23 | 2019-10-19T23:40:57.000Z | 2022-03-29T16:53:17.000Z | #ifndef QUAD_MARCH_HH
#define QUAD_MARCH_HH
#include "ctr_quad_2d.hh"
namespace voro {
template<int ca>
class quad_march {
public:
const int ma;
int s;
int ns;
int p;
quadtree* list[32];
quad_march(quadtree *q);
void step();
inline quadtree* cu() {
return list[p];
}
private:
inline quadtree*... | 15.757576 | 59 | 0.619231 | softwarecapital |
d2a17d603c73c40b20150d0b9961a53d0ae01394 | 3,272 | hpp | C++ | src/ui/Widget.hpp | nopdotcom/opentxs | 140428ba8f1bd4c09654ebf0a1c1725f396efa8b | [
"MIT"
] | null | null | null | src/ui/Widget.hpp | nopdotcom/opentxs | 140428ba8f1bd4c09654ebf0a1c1725f396efa8b | [
"MIT"
] | null | null | null | src/ui/Widget.hpp | nopdotcom/opentxs | 140428ba8f1bd4c09654ebf0a1c1725f396efa8b | [
"MIT"
] | null | null | null | // Copyright (c) 2018 The Open-Transactions developers
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.
#pragma once
#include "Internal.hpp"
#include "opentxs/netwo... | 28.955752 | 80 | 0.669927 | nopdotcom |
d2a2237addccd3dc3fb3f7540c6a37a0de865bb8 | 258 | cpp | C++ | exodus/libexodus/exodus/howto.cpp | BOBBYWY/exodusdb | cfe8a3452480af90071dd10cefeed58299eed4e7 | [
"MIT"
] | 4 | 2021-01-23T14:36:34.000Z | 2021-06-07T10:02:28.000Z | exodus/libexodus/exodus/howto.cpp | BOBBYWY/exodusdb | cfe8a3452480af90071dd10cefeed58299eed4e7 | [
"MIT"
] | 1 | 2019-08-04T19:15:56.000Z | 2019-08-04T19:15:56.000Z | exodus/libexodus/exodus/howto.cpp | BOBBYWY/exodusdb | cfe8a3452480af90071dd10cefeed58299eed4e7 | [
"MIT"
] | 1 | 2022-01-29T22:41:01.000Z | 2022-01-29T22:41:01.000Z |
#if defined(__CINT__)
/* CINT*/
#elif defined(__BORLANDC__)
/* ...Borland...*/
#elif defined(__WATCOMC__)
/* ...Watcom C/C++...*/
#elif defined(_MSC_VER)
/* ...Microsoft C/Visual C+++*/
#elif defined(__CYGWIN__)
/* ...cygwin... */
#else
/* ...... */
#endif
| 17.2 | 31 | 0.593023 | BOBBYWY |
d2a478b068e5ecbd5a9328127c98332ddf668aca | 2,896 | hpp | C++ | doc/mainpage.hpp | graphnode/CSFML-Merge | 096ae4bfce91a687a999ac4e89617da3b973f90b | [
"Zlib"
] | 257 | 2015-04-30T07:51:40.000Z | 2022-03-28T07:59:07.000Z | doc/mainpage.hpp | graphnode/CSFML-Merge | 096ae4bfce91a687a999ac4e89617da3b973f90b | [
"Zlib"
] | 76 | 2015-04-30T23:20:53.000Z | 2022-03-17T07:58:16.000Z | doc/mainpage.hpp | graphnode/CSFML-Merge | 096ae4bfce91a687a999ac4e89617da3b973f90b | [
"Zlib"
] | 144 | 2015-04-30T18:34:50.000Z | 2022-03-28T01:28:40.000Z | ////////////////////////////////////////////////////////////
/// \mainpage
///
/// \section welcome Welcome
/// Welcome to the official SFML documentation for C. Here you will find a detailed
/// view of all the SFML <a href="./globals_func.htm">functions</a>.<br/>
/// If you are looking for tutorials, you can visit th... | 30.808511 | 86 | 0.538329 | graphnode |
d2a5b1c85cc6414396454dd1b4efd88feb1fa317 | 6,403 | cpp | C++ | lib/libCFG/src/CapPattern.cpp | cyber-itl/citl-static-analysis | 32ef8e519dac1c6a49ff41d902a62df8f5a8e948 | [
"MIT"
] | 14 | 2021-05-03T16:03:22.000Z | 2022-02-14T23:42:39.000Z | lib/libCFG/src/CapPattern.cpp | cyber-itl/citl-static-analysis | 32ef8e519dac1c6a49ff41d902a62df8f5a8e948 | [
"MIT"
] | 1 | 2021-09-27T12:01:33.000Z | 2021-09-27T12:01:33.000Z | lib/libCFG/src/CapPattern.cpp | cyber-itl/citl-static-analysis | 32ef8e519dac1c6a49ff41d902a62df8f5a8e948 | [
"MIT"
] | null | null | null | #include <cstdint>
#include <vector>
#include <algorithm>
#include <utility>
#include "capstone/capstone.h"
#include "glog/logging.h"
#include "CapPattern.hpp"
OperPat::OperPat(op_type op_type) :
reg(0),
type(op_type) {};
OperPat::OperPat(op_type op_type, uint64_t reg) :
reg(reg),
type(op_type) {};
... | 26.568465 | 113 | 0.487896 | cyber-itl |
d2ac808e273e575f526c2af92b34a4dddeda5eca | 506 | cpp | C++ | SDLProjekt/Animator.cpp | TheKrzyko/SokobanSDL | dfc6e5cefcc84d069fcaad6908e9a1ba44444d29 | [
"MIT"
] | null | null | null | SDLProjekt/Animator.cpp | TheKrzyko/SokobanSDL | dfc6e5cefcc84d069fcaad6908e9a1ba44444d29 | [
"MIT"
] | null | null | null | SDLProjekt/Animator.cpp | TheKrzyko/SokobanSDL | dfc6e5cefcc84d069fcaad6908e9a1ba44444d29 | [
"MIT"
] | null | null | null | #include "Animator.h"
#include <string.h>
Animator::Animator()
{
}
Animator::~Animator()
{
}
void Animator::addState(String name, const FrameAnimation& anim)
{
animations[name] = new FrameAnimation(anim);
}
void Animator::setState(String name)
{
if (currentState == name)
return;
if(currentState != String(""))
... | 16.866667 | 64 | 0.717391 | TheKrzyko |
d2ad385eb241038abe711399b0fe8b436e6b1bdf | 13,775 | cpp | C++ | test/test_trial1.cpp | DaziyahS/ExperimentsSP22 | 22c8abef235a050aa6985cdad1e4db65ef86ea12 | [
"MIT"
] | null | null | null | test/test_trial1.cpp | DaziyahS/ExperimentsSP22 | 22c8abef235a050aa6985cdad1e4db65ef86ea12 | [
"MIT"
] | null | null | null | test/test_trial1.cpp | DaziyahS/ExperimentsSP22 | 22c8abef235a050aa6985cdad1e4db65ef86ea12 | [
"MIT"
] | null | null | null | #include <Mahi/Gui.hpp>
#include <Mahi/Util.hpp>
#include <Mahi/Util/Logging/Log.hpp>
#include <syntacts>
#include <random>
#include <iostream>
#include <fstream> // need to include inorder to save to csv
#include <chrono>
#include <string> // for manipulating file name
// local includes
#include <Chord.hpp>
#includ... | 41.242515 | 165 | 0.532341 | DaziyahS |
d2b888ee6ffeb89540abf52892fd5c48fb0a3b60 | 228 | hpp | C++ | scicpp/linalg.hpp | tvanderbruggen/SciCpp | 09408506c8d0b49ca5dadb8cd1f3cb4db41c8c46 | [
"MIT"
] | 2 | 2021-08-02T09:03:30.000Z | 2022-02-17T11:58:05.000Z | scicpp/linalg.hpp | tvanderbruggen/SciCpp | 09408506c8d0b49ca5dadb8cd1f3cb4db41c8c46 | [
"MIT"
] | null | null | null | scicpp/linalg.hpp | tvanderbruggen/SciCpp | 09408506c8d0b49ca5dadb8cd1f3cb4db41c8c46 | [
"MIT"
] | null | null | null | // SPDX-License-Identifier: MIT
// Copyright (c) 2019-2021 Thomas Vanderbruggen <th.vanderbruggen@gmail.com>
#ifndef SCICPP_LINALG_HEADER
#define SCICPP_LINALG_HEADER
#include "linalg/solve.hpp"
#endif // SCICPP_LINALG_HEADER | 25.333333 | 76 | 0.798246 | tvanderbruggen |