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 109 | 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 48.5k ⌀ | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
9e8c703ae1d7d8bcea11268ca5310dfacee4ce95 | 5,557 | cc | C++ | sentinel-core/param/param_flow_slot_test.cc | windrunner123/sentinel-cpp | 7957e692466db0b7b83b7218602757113e9f2d22 | [
"Apache-2.0"
] | 121 | 2019-02-22T06:50:31.000Z | 2022-01-22T23:23:42.000Z | sentinel-core/param/param_flow_slot_test.cc | windrunner123/sentinel-cpp | 7957e692466db0b7b83b7218602757113e9f2d22 | [
"Apache-2.0"
] | 24 | 2019-05-07T08:58:38.000Z | 2022-01-26T02:36:06.000Z | sentinel-core/param/param_flow_slot_test.cc | windrunner123/sentinel-cpp | 7957e692466db0b7b83b7218602757113e9f2d22 | [
"Apache-2.0"
] | 36 | 2019-03-19T09:46:08.000Z | 2021-11-24T13:20:56.000Z | #include <iostream>
#include <memory>
#include <string>
#include "gmock/gmock.h"
#include "gtest/gtest.h"
#include "sentinel-core/test/mock/statistic/node/mock.h"
#include "sentinel-core/common/string_resource_wrapper.h"
#include "sentinel-core/param/param_flow_rule_constants.h"
#include "sentinel-core/param/param_f... | 37.046667 | 78 | 0.694799 | windrunner123 |
9e8e932f9499023181266c4a013edff4dfdf28d0 | 6,762 | cpp | C++ | STRIPSp.cpp | alexandresoaresilva/STRIPS_prg | ada84083a8b4f96036261669092bcf3cb4539e73 | [
"MIT"
] | null | null | null | STRIPSp.cpp | alexandresoaresilva/STRIPS_prg | ada84083a8b4f96036261669092bcf3cb4539e73 | [
"MIT"
] | null | null | null | STRIPSp.cpp | alexandresoaresilva/STRIPS_prg | ada84083a8b4f96036261669092bcf3cb4539e73 | [
"MIT"
] | null | null | null | /*
* STRIPSp.cpp
*
* Created on: Jan 10, 2018
* Author: alexa
*/
#include "STRIPSp.h"
STRIPSp::STRIPSp() : STRIPS_tokenizer(), it_is_a_STRIPS_planner(0) {
cout << endl;
cout << "STRIPSp (recognizer) class\n";
cout << ">>>>>>>>>>>>>>>>>>>>>>\n";
STRIPS_tokenizer::print_Vector_of_strg();
it_is_a... | 30.876712 | 143 | 0.608104 | alexandresoaresilva |
9e8f825752174abf6cd0bdb9372978ddd55d4553 | 1,046 | cpp | C++ | Engine_Networking/source/NetworkBuffer.cpp | subr3v/s-engine | d77b9ccd0fff3982a303f14ce809691a570f61a3 | [
"MIT"
] | 2 | 2016-04-01T21:10:33.000Z | 2018-02-26T19:36:56.000Z | Engine_Networking/source/NetworkBuffer.cpp | subr3v/s-engine | d77b9ccd0fff3982a303f14ce809691a570f61a3 | [
"MIT"
] | 1 | 2017-04-05T01:33:08.000Z | 2017-04-05T01:33:08.000Z | Engine_Networking/source/NetworkBuffer.cpp | subr3v/s-engine | d77b9ccd0fff3982a303f14ce809691a570f61a3 | [
"MIT"
] | null | null | null | #include "NetworkBuffer.h"
#include <cassert>
FNetworkBuffer::FNetworkBuffer(u32 BufferSize) : BufferPosition(0)
{
BufferData.Resize(BufferSize);
}
FNetworkBuffer::~FNetworkBuffer()
{
}
void FNetworkBuffer::CopyData(void* Data, u32 BytesCount)
{
if (GetSpaceLeft() < BytesCount)
{
assert(false);
return;
}
... | 17.433333 | 76 | 0.755258 | subr3v |
9e8f85d4b9cb0db03ca88f48a9f304d3b0843d59 | 1,839 | cpp | C++ | acm-icpc/2015 ACM Amman Collegiate Programming Contest/D.cpp | ErickJoestar/competitive-programming | 76afb766dbc18e16315559c863fbff19a955a569 | [
"MIT"
] | 1 | 2020-04-23T00:35:38.000Z | 2020-04-23T00:35:38.000Z | acm-icpc/2015 ACM Amman Collegiate Programming Contest/D.cpp | ErickJoestar/competitive-programming | 76afb766dbc18e16315559c863fbff19a955a569 | [
"MIT"
] | null | null | null | acm-icpc/2015 ACM Amman Collegiate Programming Contest/D.cpp | ErickJoestar/competitive-programming | 76afb766dbc18e16315559c863fbff19a955a569 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define ENDL '\n'
#define deb(u) cout << #u " : " << (u) << ENDL;
#define deba(alias, u) cout << alias << ": " << (u) << ENDL;
#define debp(u, v) cout << u << " : " << v << ENDL;
#define pb push_back
#define F first
#define S second
#define lli long long
#define pii pair<int, int>
#define pll p... | 18.029412 | 60 | 0.439913 | ErickJoestar |
9e90e8989f7e7f4be169d5ec169c984200677a20 | 3,943 | cpp | C++ | src/tile.cpp | lucasfo/robot-environment | 82141ae06620ab493ff4bc2de366b8149b4fff05 | [
"MIT"
] | null | null | null | src/tile.cpp | lucasfo/robot-environment | 82141ae06620ab493ff4bc2de366b8149b4fff05 | [
"MIT"
] | null | null | null | src/tile.cpp | lucasfo/robot-environment | 82141ae06620ab493ff4bc2de366b8149b4fff05 | [
"MIT"
] | null | null | null | #include <tile.h>
Tile::Tile() {
this->_value = TL_NONE;
this->_color = TLC_WHITE;
this->_flags = 0;
this->_agent = NULL;
this->_pheromone = 0;
}
bool Tile::valid() const {
return (this->_flags & TLF_VALID) > 0;
}
void Tile::valid (const bool valid) {
if (valid) {
this->_flags |= ... | 16.99569 | 62 | 0.519909 | lucasfo |
9e932a666b0f3b2dbae8890324e6071f0240fa8b | 631 | cpp | C++ | LeetCode/ThousandOne/0343-integer_break.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0343-integer_break.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0343-integer_break.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | #include "leetcode.hpp"
/* 343. 整数拆分
给定一个正整数 n，将其拆分为至少两个正整数的和，并使这些整数的乘积最大化。
返回你可以获得的最大乘积。
示例 1:
输入: 2
输出: 1
解释: 2 = 1 + 1, 1 × 1 = 1。
示例 2:
输入: 10
输出: 36
解释: 10 = 3 + 3 + 4, 3 × 3 × 4 = 36。
说明: 你可以假设 n 不小于 2 且不大于 58。
*/
// https://leetcode-cn.com/problems/integer-break/solution/343-zheng-shu-chai-fen-tan-xin-by-... | 13.145833 | 97 | 0.554675 | Ginkgo-Biloba |
9e9348c185e94e60c4592f4a77830b3069ad729e | 8,108 | cpp | C++ | src/sql/RecorderFile.cpp | anthonioez/RecorderBlackBerry10 | 978bfff4a874dbc6a2af0daebce2694855705daa | [
"Apache-2.0"
] | null | null | null | src/sql/RecorderFile.cpp | anthonioez/RecorderBlackBerry10 | 978bfff4a874dbc6a2af0daebce2694855705daa | [
"Apache-2.0"
] | null | null | null | src/sql/RecorderFile.cpp | anthonioez/RecorderBlackBerry10 | 978bfff4a874dbc6a2af0daebce2694855705daa | [
"Apache-2.0"
] | null | null | null | #include "Recorder.hpp"
#include "RecorderFile.hpp"
#include "utils.hpp"
RecorderFile::RecorderFile(SqlDataAccess *sda)
{
table = "files";
id = 0;
folder = 0;
title = "";
desc = "";
size = 0;
duration = 0;
size = 0;
flags = 0;
stamp = 0;
status = 0;
this->sda = sda;
}
bool RecorderFile::... | 20.683673 | 140 | 0.628885 | anthonioez |
9e9451f0b7c9b6321defeb996ee36a3fcdefbef0 | 1,159 | hpp | C++ | src/gameengine.hpp | zerozez/qt-chess | 4a066195f656cb57e83f49beeaa9e244796b18d3 | [
"Apache-2.0"
] | 5 | 2018-05-09T05:09:50.000Z | 2021-07-30T06:48:21.000Z | src/gameengine.hpp | zerozez/qt-chess | 4a066195f656cb57e83f49beeaa9e244796b18d3 | [
"Apache-2.0"
] | null | null | null | src/gameengine.hpp | zerozez/qt-chess | 4a066195f656cb57e83f49beeaa9e244796b18d3 | [
"Apache-2.0"
] | 5 | 2017-11-29T23:49:25.000Z | 2021-06-10T15:13:07.000Z | #ifndef GAMEENGINE_HPP
#define GAMEENGINE_HPP
#include <QAbstractListModel>
#include <QHash>
#include <QMap>
#include <QObject>
#include <QPair>
#include <QQmlListProperty>
#include <QSharedPointer>
/**
* @brief The GameEngine class
*
* Main game engine. Control figures position,
* status of the game an... | 21.462963 | 66 | 0.709232 | zerozez |
9e94d2ca221e4db7d7ed1e2dbf25eedb71052f0f | 579 | cpp | C++ | main/src/jumpnrun/system/JumpnRunScreen_TaskList.cpp | wonderhorn/mkfj | 18d2dd290811662d87abefe2fe2e338ba9caf8a5 | [
"MIT"
] | null | null | null | main/src/jumpnrun/system/JumpnRunScreen_TaskList.cpp | wonderhorn/mkfj | 18d2dd290811662d87abefe2fe2e338ba9caf8a5 | [
"MIT"
] | null | null | null | main/src/jumpnrun/system/JumpnRunScreen_TaskList.cpp | wonderhorn/mkfj | 18d2dd290811662d87abefe2fe2e338ba9caf8a5 | [
"MIT"
] | null | null | null | #include"jumpnrun/system/JumpnRunScreen.h"
#include<fstream>
using namespace jnr;
using namespace gfw;
bool JumpnRunScreen::dumpTaskListToFile(const std::string& file_name)
{
std::ofstream ofs(file_name, std::ios::binary);
$P.mutex_tasklist.lock();
ofs.write(this->tl.Buffer(), tl.BUF_SIZE);
$P.mutex_tasklist.unlo... | 26.318182 | 71 | 0.747841 | wonderhorn |
9e96e88d19cdc951c890865649da421ca530b756 | 6,538 | hh | C++ | src/lunasa/common/GenericSequentialDataBundle.hh | faodel/faodel | ef2bd8ff335433e695eb561d7ecd44f233e58bf0 | [
"MIT"
] | 2 | 2019-01-25T21:21:07.000Z | 2021-04-29T17:24:00.000Z | src/lunasa/common/GenericSequentialDataBundle.hh | faodel/faodel | ef2bd8ff335433e695eb561d7ecd44f233e58bf0 | [
"MIT"
] | 8 | 2018-10-09T14:35:30.000Z | 2020-09-30T20:09:42.000Z | src/lunasa/common/GenericSequentialDataBundle.hh | faodel/faodel | ef2bd8ff335433e695eb561d7ecd44f233e58bf0 | [
"MIT"
] | 2 | 2019-04-23T19:01:36.000Z | 2021-05-11T07:44:55.000Z | // Copyright 2021 National Technology & Engineering Solutions of Sandia, LLC
// (NTESS). Under the terms of Contract DE-NA0003525 with NTESS, the U.S.
// Government retains certain rights in this software.
#ifndef FAODEL_GENERICSEQUENTIALBUNDLE_HH
#define FAODEL_GENERICSEQUENTIALBUNDLE_HH
#include <cstdint>
#include ... | 38.233918 | 138 | 0.714439 | faodel |
9e98fb2a7bdc65a79183cac9b2461d4f2d70ec09 | 1,284 | cpp | C++ | solution328.cpp | white-shark/leetcode-cpp | ba1389d3083ee2a2bb0a232672ee316afc125b58 | [
"MIT"
] | 31 | 2016-08-18T16:30:59.000Z | 2022-02-15T11:21:39.000Z | solution328.cpp | runguanner/Leetcode | ba1389d3083ee2a2bb0a232672ee316afc125b58 | [
"MIT"
] | null | null | null | solution328.cpp | runguanner/Leetcode | ba1389d3083ee2a2bb0a232672ee316afc125b58 | [
"MIT"
] | 22 | 2017-07-17T07:30:00.000Z | 2022-01-24T08:37:15.000Z | /**
* Odd Even Linked List
*
* cpselvis(cpselvis@gmail.com)
* September 9th, 2016
*/
#include<iostream>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* oddEvenList(ListNode* head) {
if (head == NULL)
{
... | 20.380952 | 73 | 0.556075 | white-shark |
9e9a3e2b38069d84c337912e00255a6c972e7b40 | 10,846 | cpp | C++ | exe/fs123p7/exportd_cc_rules.cpp | DEShawResearch/fs123 | 27bee72752fedc54ab493e49c6da96eeb2c6ab6a | [
"BSD-3-Clause"
] | 22 | 2019-04-10T18:05:35.000Z | 2021-12-30T12:26:39.000Z | exe/fs123p7/exportd_cc_rules.cpp | DEShawResearch/fs123 | 27bee72752fedc54ab493e49c6da96eeb2c6ab6a | [
"BSD-3-Clause"
] | 13 | 2019-04-09T00:19:29.000Z | 2021-11-04T15:57:13.000Z | exe/fs123p7/exportd_cc_rules.cpp | DEShawResearch/fs123 | 27bee72752fedc54ab493e49c6da96eeb2c6ab6a | [
"BSD-3-Clause"
] | 4 | 2019-04-07T16:33:44.000Z | 2020-07-02T02:58:51.000Z | #include "exportd_cc_rules.hpp"
#include <core123/json.hpp>
#include <core123/fdstream.hpp>
#include <core123/unused.hpp>
#include <core123/autoclosers.hpp>
#include <core123/sew.hpp>
#include <core123/scoped_nanotimer.hpp>
#include <core123/diag.hpp>
#include <core123/pathutils.hpp>
#include <core123/stats.hpp>
using... | 40.621723 | 141 | 0.626775 | DEShawResearch |
9e9a450b4c778fd56f50398af5d0c6099e31f48f | 3,961 | inl | C++ | src/include/cjm/numerics/numerics_configuration.inl | cpsusie/cjm-numerics | 9719f4aa7ed0fa157f4705e3f20f069e28a5755f | [
"MIT"
] | 2 | 2021-04-18T07:35:56.000Z | 2021-04-23T07:37:58.000Z | src/include/cjm/numerics/numerics_configuration.inl | cpsusie/Int128 | 9719f4aa7ed0fa157f4705e3f20f069e28a5755f | [
"MIT"
] | 29 | 2020-12-18T00:50:36.000Z | 2021-03-22T21:35:18.000Z | src/include/cjm/numerics/numerics_configuration.inl | cpsusie/cjm-numerics | 9719f4aa7ed0fa157f4705e3f20f069e28a5755f | [
"MIT"
] | null | null | null | // Copyright © 2020-2021 CJM Screws, LLC
// Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"),
// to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, dis... | 36.33945 | 150 | 0.757889 | cpsusie |
9e9b95bc9d5a9dc4ce9b643caa788df0a5975373 | 79,021 | cpp | C++ | src/GUST-Graphics/Renderer.cpp | ReeCocho/GUST-Engine-3 | f75ce52f8384a2e6cd7c788286c174ee7bde96f1 | [
"MIT"
] | 1 | 2018-01-01T23:24:03.000Z | 2018-01-01T23:24:03.000Z | src/GUST-Graphics/Renderer.cpp | ReeCocho/GUST-Engine-3 | f75ce52f8384a2e6cd7c788286c174ee7bde96f1 | [
"MIT"
] | null | null | null | src/GUST-Graphics/Renderer.cpp | ReeCocho/GUST-Engine-3 | f75ce52f8384a2e6cd7c788286c174ee7bde96f1 | [
"MIT"
] | null | null | null | #include <FileIO.hpp>
#include <iostream>
#include "Renderer.hpp"
namespace gust
{
void Renderer::startup
(
Graphics* graphics,
ResourceAllocator<Mesh>* meshAllocator,
ResourceAllocator<Texture>* textureAllocator,
size_t threadCount
)
{
m_graphics = graphics;
m_threadPool = std::make_unique<ThreadPool>... | 37.700859 | 178 | 0.758583 | ReeCocho |
9e9be1fdb4251a53e47d673e826f4a8c369831ce | 8,093 | hpp | C++ | solver/include/decpomdp/discrete/DiscreteSpaces.hpp | laurimi/multiagent-prediction-reward | b89fa52f78bb49447fc0049a7314a87b2b3e903e | [
"MIT"
] | 9 | 2020-10-24T06:14:08.000Z | 2021-07-13T13:08:30.000Z | solver/include/decpomdp/discrete/DiscreteSpaces.hpp | laurimi/multiagent-prediction-reward | b89fa52f78bb49447fc0049a7314a87b2b3e903e | [
"MIT"
] | null | null | null | solver/include/decpomdp/discrete/DiscreteSpaces.hpp | laurimi/multiagent-prediction-reward | b89fa52f78bb49447fc0049a7314a87b2b3e903e | [
"MIT"
] | null | null | null | #ifndef DISCRETESPACES_HPP
#define DISCRETESPACES_HPP
#include <algorithm>
#include <iterator>
#include <map>
#include <vector>
#include "DiscreteElements.hpp"
#include "utilities/IndexSpace.hpp"
namespace npgi {
template <typename Index, typename Element>
class DiscreteSpace {
friend class const_iterator;
public:... | 29.753676 | 80 | 0.666625 | laurimi |
9e9cacd9464b864e979f045e027525b7eb822418 | 1,406 | hpp | C++ | doc/quickbook/oglplus/quickref/enums/debug_output_type_class.hpp | Extrunder/oglplus | c7c8266a1571d0b4c8b02d9c8ca6a7b6a6f51791 | [
"BSL-1.0"
] | null | null | null | doc/quickbook/oglplus/quickref/enums/debug_output_type_class.hpp | Extrunder/oglplus | c7c8266a1571d0b4c8b02d9c8ca6a7b6a6f51791 | [
"BSL-1.0"
] | null | null | null | doc/quickbook/oglplus/quickref/enums/debug_output_type_class.hpp | Extrunder/oglplus | c7c8266a1571d0b4c8b02d9c8ca6a7b6a6f51791 | [
"BSL-1.0"
] | null | null | null | // File doc/quickbook/oglplus/quickref/enums/debug_output_type_class.hpp
//
// Automatically generated file, DO NOT modify manually.
// Edit the source 'source/enums/oglplus/debug_output_type.txt'
// or the 'source/enums/make_enum.py' script instead.
//
// Copyright 2010-2015 Matus Chochlik.
// Distributed under ... | 27.038462 | 73 | 0.785917 | Extrunder |
9ea4cd0486a2d626afa0db6014ba24bc441d8581 | 7,735 | hpp | C++ | moe/optimal_learning/cpp/gpp_optimizer_parameters.hpp | mikepsinn/MOE | fdc2e1318d37c89c54a7b7902c12f8f164f517e8 | [
"Apache-2.0"
] | null | null | null | moe/optimal_learning/cpp/gpp_optimizer_parameters.hpp | mikepsinn/MOE | fdc2e1318d37c89c54a7b7902c12f8f164f517e8 | [
"Apache-2.0"
] | null | null | null | moe/optimal_learning/cpp/gpp_optimizer_parameters.hpp | mikepsinn/MOE | fdc2e1318d37c89c54a7b7902c12f8f164f517e8 | [
"Apache-2.0"
] | null | null | null | /*!
\file gpp_optimizer_parameters.hpp
\rst
This file specifies OptimizerParameters structs (e.g., GradientDescent, Newton) for holding values that control the behavior
of the optimizers in gpp_optimization.hpp. For example, max step sizes, number of iterations, step size control, etc. are all
specified thro... | 43.948864 | 187 | 0.753458 | mikepsinn |
9eab80dc32e305daacccee883c69fccb3f7a130d | 1,124 | cpp | C++ | BookCode/chapters/07lazzariniBOOKexamples/dft_main.cpp | mike-normal13/Audio_programming_book_code | 3d318787d379f232a4edc113b6f7190201084674 | [
"MIT"
] | 9 | 2018-10-03T19:57:47.000Z | 2022-01-08T14:37:24.000Z | BookCode/chapters/07lazzariniBOOKexamples/dft_main.cpp | mike-normal13/Audio_programming_book_code | 3d318787d379f232a4edc113b6f7190201084674 | [
"MIT"
] | null | null | null | BookCode/chapters/07lazzariniBOOKexamples/dft_main.cpp | mike-normal13/Audio_programming_book_code | 3d318787d379f232a4edc113b6f7190201084674 | [
"MIT"
] | 8 | 2017-11-20T07:52:01.000Z | 2022-03-29T02:59:10.000Z | /////////////////////////////////////////////
// Spectral processing examples
//
// (c) V Lazzarini, 2005
//
//
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <spec.h>
#include <sndfile.h>
/** simple DFT demonstration program
dft filename
*/
int
main(int argc, char *argv[]){
... | 20.436364 | 59 | 0.524911 | mike-normal13 |
9ead773f7de5063aed94fa6c04e6db6eb2edf912 | 13,604 | cc | C++ | Engine/Source/3rdParty/AssetImporter/AssimpMesh.cc | rodrigobmg/YumeEngine | 67c525c84616a5167b5bae45f36641e90227c281 | [
"MIT"
] | 129 | 2016-05-05T23:34:44.000Z | 2022-03-07T20:17:18.000Z | Engine/Source/3rdParty/AssetImporter/AssimpMesh.cc | rodrigobmg/YumeEngine | 67c525c84616a5167b5bae45f36641e90227c281 | [
"MIT"
] | 1 | 2017-05-07T16:09:41.000Z | 2017-05-08T15:35:50.000Z | Engine/Source/3rdParty/AssetImporter/AssimpMesh.cc | rodrigobmg/YumeEngine | 67c525c84616a5167b5bae45f36641e90227c281 | [
"MIT"
] | 20 | 2016-02-24T20:40:08.000Z | 2022-02-04T23:48:18.000Z | //----------------------------------------------------------------------------
//Yume Engine
//Copyright (C) 2015 arkenthera
//This program is free software; you can redistribute it and/or modify
//it under the terms of the GNU General Public License as published by
//the Free Software Foundation; either version 2 of ... | 26.211946 | 99 | 0.666716 | rodrigobmg |
9eae3e6261d2baac4f93b0b82eaa0da45f562bd5 | 4,330 | cpp | C++ | polympc/tests/solvers/sqp/sqp_test.cpp | alexandreguerradeoliveira/rocket_gnc | 164e96daca01d9edbc45bfaac0f6b55fe7324f24 | [
"MIT"
] | null | null | null | polympc/tests/solvers/sqp/sqp_test.cpp | alexandreguerradeoliveira/rocket_gnc | 164e96daca01d9edbc45bfaac0f6b55fe7324f24 | [
"MIT"
] | null | null | null | polympc/tests/solvers/sqp/sqp_test.cpp | alexandreguerradeoliveira/rocket_gnc | 164e96daca01d9edbc45bfaac0f6b55fe7324f24 | [
"MIT"
] | null | null | null | #include "gtest/gtest.h"
#define SOLVER_DEBUG
#include "solvers/sqp.hpp"
using namespace sqp;
namespace sqp_test {
template <typename _Scalar, int _VAR_SIZE, int _NUM_EQ=0, int _NUM_INEQ=0>
struct ProblemBase {
enum {
VAR_SIZE = _VAR_SIZE,
NUM_EQ = _NUM_EQ,
NUM_INEQ = _NUM_INEQ,
};
... | 26.084337 | 134 | 0.575982 | alexandreguerradeoliveira |
9eb225ce0a7db6ee80034681222495a287a968f2 | 2,319 | cpp | C++ | software/tests/sensor/fusion/fusion.cpp | jbarry510/slonav | acebb8481e5623c3548258fe0e92a983618032a3 | [
"MIT"
] | null | null | null | software/tests/sensor/fusion/fusion.cpp | jbarry510/slonav | acebb8481e5623c3548258fe0e92a983618032a3 | [
"MIT"
] | null | null | null | software/tests/sensor/fusion/fusion.cpp | jbarry510/slonav | acebb8481e5623c3548258fe0e92a983618032a3 | [
"MIT"
] | 1 | 2020-11-29T17:22:09.000Z | 2020-11-29T17:22:09.000Z | /* @file fusion.h
* This file contains the implementation of a Kalman filter for the SLONav system
*/
//------------------------------------------------------------------------------
#include "fusion.h"
//------------------------------------------------------------------------------
Fusion::Fusion()
{
// Process... | 36.234375 | 96 | 0.511859 | jbarry510 |
9eb3fd407460f5e8884e50993bda3a44101c4f9c | 10,078 | cpp | C++ | qflow/wavefunctions/pywavefunction.cpp | johanere/qflow | 5453cd5c3230ad7f082adf9ec1aea63ab0a4312a | [
"MIT"
] | 5 | 2019-07-24T21:46:24.000Z | 2021-06-11T18:18:24.000Z | qflow/wavefunctions/pywavefunction.cpp | johanere/qflow | 5453cd5c3230ad7f082adf9ec1aea63ab0a4312a | [
"MIT"
] | 22 | 2019-02-19T10:49:26.000Z | 2019-07-18T09:42:13.000Z | qflow/wavefunctions/pywavefunction.cpp | bsamseth/FYS4411 | 72b879e7978364498c48fc855b5df676c205f211 | [
"MIT"
] | 2 | 2020-11-04T15:17:24.000Z | 2021-11-03T16:37:38.000Z | #include "dnn.hpp"
#include "fixedwavefunction.hpp"
#include "hardspherewavefunction.hpp"
#include "inputsorter.hpp"
#include "jastrowmcmillian.hpp"
#include "jastroworion.hpp"
#include "jastrowpade.hpp"
#include "rbmsymmetricwavefunction.hpp"
#include "rbmwavefunction.hpp"
#include "simplegaussian.hpp"
#include "wavef... | 35.237762 | 116 | 0.630581 | johanere |
9eb89a71ac366f3422f0c95b8eebac51ccf311bb | 332 | cpp | C++ | bin/barftest/sem/ErrorDummy.cpp | vdods/barf | 5c943ddbd6a0a7624645158b0c85994431dde269 | [
"Apache-2.0"
] | 1 | 2021-01-16T00:55:45.000Z | 2021-01-16T00:55:45.000Z | bin/barftest/sem/ErrorDummy.cpp | vdods/barf | 5c943ddbd6a0a7624645158b0c85994431dde269 | [
"Apache-2.0"
] | null | null | null | bin/barftest/sem/ErrorDummy.cpp | vdods/barf | 5c943ddbd6a0a7624645158b0c85994431dde269 | [
"Apache-2.0"
] | null | null | null | // 2018.08.30 - Victor Dods
#include "barftest/sem/ErrorDummy.hpp"
namespace barftest {
namespace sem {
ErrorDummy *ErrorDummy::cloned () const
{
return new ErrorDummy(firange());
}
void ErrorDummy::print (Log &out) const
{
out << "ErrorDummy(" << firange() << ')';
}
} // end namespace sem
} // end namespa... | 16.6 | 45 | 0.662651 | vdods |
9ec01dad1bdf440560f80869b2a0153d1d543228 | 525 | hpp | C++ | libboost-system/include/boost/cerrno.hpp | build2-packaging/boost | 203d505dd3ba04ea50785bc8b247a295db5fc718 | [
"BSL-1.0"
] | 4 | 2021-02-23T11:24:33.000Z | 2021-09-11T20:10:46.000Z | libboost-system/include/boost/cerrno.hpp | build2-packaging/boost | 203d505dd3ba04ea50785bc8b247a295db5fc718 | [
"BSL-1.0"
] | null | null | null | libboost-system/include/boost/cerrno.hpp | build2-packaging/boost | 203d505dd3ba04ea50785bc8b247a295db5fc718 | [
"BSL-1.0"
] | null | null | null | // Boost cerrno.hpp header -------------------------------------------------//
// Copyright Beman Dawes 2005.
// Use, modification, and distribution is subject to the Boost Software
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
// See librar... | 32.8125 | 80 | 0.689524 | build2-packaging |
9ec20311eb0c8b01bd03e99d08534c3b08f58391 | 992 | cpp | C++ | tests/tests-iter-pos/test-bool.cpp | eepp/yactfr | 5cec5680d025d82a4f175ffc19c0704b32ef529f | [
"MIT"
] | 7 | 2016-08-26T14:20:06.000Z | 2022-02-03T21:17:25.000Z | tests/tests-iter-pos/test-bool.cpp | eepp/yactfr | 5cec5680d025d82a4f175ffc19c0704b32ef529f | [
"MIT"
] | 2 | 2018-05-29T17:43:37.000Z | 2018-05-30T18:38:39.000Z | tests/tests-iter-pos/test-bool.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 <iterator>
#include <vector>
#include <yactfr/ya... | 22.545455 | 93 | 0.623992 | eepp |
9ec74801ccc0bf3691b922607dea77d3a155dac3 | 1,099 | cpp | C++ | Training/day1/Defeat the Enemy.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | 2 | 2018-02-24T06:45:56.000Z | 2018-05-29T04:47:39.000Z | Training/day1/Defeat the Enemy.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | null | null | null | Training/day1/Defeat the Enemy.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | 2 | 2018-06-28T09:53:27.000Z | 2022-03-23T13:29:57.000Z | #include <bits/stdc++.h>
using namespace std;
#define db(x) cout<<(x)<<endl
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ms(x,y) memset(x,y,sizeof x)
typedef long long LL;
const LL mod=1e9+7,inf=0x3f3f3f3f,maxn=112345;
struct node{
int a,b;
}a[maxn],b[maxn];
int t,n,m,ans,f,p,s;
inline bool cmp(no... | 18.948276 | 60 | 0.530482 | QAQrz |
9ec84656beece08bbfda60dd0ca5d9ec47269b8a | 596 | cpp | C++ | solutions/230.kth-smallest-element-in-a-bst.259865536.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | 78 | 2020-10-22T11:31:53.000Z | 2022-02-22T13:27:49.000Z | solutions/230.kth-smallest-element-in-a-bst.259865536.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | null | null | null | solutions/230.kth-smallest-element-in-a-bst.259865536.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | 26 | 2020-10-23T15:10:44.000Z | 2021-11-07T16:13:50.000Z | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
int ans;
public:
int kthSmallest(TreeNode *root, int k) {
search(root, k);
return ans;
}
... | 17.529412 | 60 | 0.565436 | satu0king |
19b3f12276fa0708fec5b809876f899038e0c9e5 | 2,477 | cpp | C++ | data-structure-and-algorithm/03-brute-force-search/ABC128-c-bit.cpp | tetsuzawa/algorithm | 556c229c6df8787a118498eab3848b53fb57ebd0 | [
"MIT"
] | null | null | null | data-structure-and-algorithm/03-brute-force-search/ABC128-c-bit.cpp | tetsuzawa/algorithm | 556c229c6df8787a118498eab3848b53fb57ebd0 | [
"MIT"
] | null | null | null | data-structure-and-algorithm/03-brute-force-search/ABC128-c-bit.cpp | tetsuzawa/algorithm | 556c229c6df8787a118498eab3848b53fb57ebd0 | [
"MIT"
] | null | null | null | // N switches, M bulbs,
// 5 switches
// bulb[1] 1, 2, 5: odd =>
// 5 2 1
// (off, off, on)
// (off, on, off)
// (on, off, off)
// (on, on, on)
// bulb[2] 2, 3: even =>
// 2 1
// (on, on)
// (off, off)
// 5, 4, 3, 2, 1 | res
// ------------------
// 0 ... | 23.149533 | 87 | 0.377069 | tetsuzawa |
19b8090357bfc50064555a63ea81e10929699981 | 2,481 | cc | C++ | clion/C++ClassObjImpl.cc | zuut/cppstarter | 78dd5a1f52a1272ad26b57c9b5c06a095f340c99 | [
"Apache-2.0"
] | null | null | null | clion/C++ClassObjImpl.cc | zuut/cppstarter | 78dd5a1f52a1272ad26b57c9b5c06a095f340c99 | [
"Apache-2.0"
] | null | null | null | clion/C++ClassObjImpl.cc | zuut/cppstarter | 78dd5a1f52a1272ad26b57c9b5c06a095f340c99 | [
"Apache-2.0"
] | null | null | null | #parse("C++TemplateVariables.template")
#[[#define]]# ${API_EXTERN}
#[[#include]]# "${Header_Filename}"
#[[#include]]# <string>
#[[#include]]# <iostream>
#[[#include]]# <boost/core/demangle.hpp>
${NAMESPACES_OPEN}
// this just holds the class fields in a struct to isolate
// clients from changes to the class... | 23.855769 | 92 | 0.500605 | zuut |
19bd7b5f0699eb5a77d2ef903fb41590a83c769c | 861 | cpp | C++ | Stack/Previous_Greater_Element.cpp | utkarshkanswal/Data-Strucrure-and-Algorithm | 5db39daf1403d270dacef06261fbfa62902e05ed | [
"MIT"
] | 1 | 2021-11-02T09:33:55.000Z | 2021-11-02T09:33:55.000Z | Stack/Previous_Greater_Element.cpp | utkarshkanswal/Data-Strucrure-and-Algorithm | 5db39daf1403d270dacef06261fbfa62902e05ed | [
"MIT"
] | null | null | null | Stack/Previous_Greater_Element.cpp | utkarshkanswal/Data-Strucrure-and-Algorithm | 5db39daf1403d270dacef06261fbfa62902e05ed | [
"MIT"
] | null | null | null | /* Name: Utkarsh Kumar
Institution: NIT Meghalaya
*/
#include <bits/stdc++.h>
#define mod (1000000007)
#define lli long long int
#define pf push_front
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
//Time Complexity: O(n)
void print_previous_greater(vect... | 22.657895 | 57 | 0.554007 | utkarshkanswal |
19be9d8df571498b388bf7965be33ab3bfd6103c | 2,070 | cpp | C++ | Rev/cpp/revMesh.cpp | YIMonge/Rev | db3b71a27659a2652bdd50069a881702b3ae059e | [
"MIT"
] | null | null | null | Rev/cpp/revMesh.cpp | YIMonge/Rev | db3b71a27659a2652bdd50069a881702b3ae059e | [
"MIT"
] | null | null | null | Rev/cpp/revMesh.cpp | YIMonge/Rev | db3b71a27659a2652bdd50069a881702b3ae059e | [
"MIT"
] | null | null | null | #include "revMesh.h"
void revMesh::CreateVertexBufferData()
{
uint32 vertexCount = static_cast<uint32>(vertices.size());
vertexData.clear();
vertexData.reserve(GetSizeOfBytes() / sizeof(f32) * vertexCount);
for (uint32 i = 0; i < vertexCount; ++i) {
vertexData.push_back(vertices[i].x);
vertexData.push_back(... | 29.15493 | 66 | 0.69372 | YIMonge |
19c0339d0f72e0573d1a052f3830133f48641eee | 6,013 | cpp | C++ | DX12/00 - DX12 Starter/DX12Helper.cpp | vixorien/ggp-advanced-demos | af803c22f14d63dfcf5d329c7f5adba827f455b8 | [
"MIT"
] | 1 | 2021-12-19T14:13:38.000Z | 2021-12-19T14:13:38.000Z | DX12/00 - DX12 Starter/DX12Helper.cpp | vixorien/ggp-advanced-demos | af803c22f14d63dfcf5d329c7f5adba827f455b8 | [
"MIT"
] | null | null | null | DX12/00 - DX12 Starter/DX12Helper.cpp | vixorien/ggp-advanced-demos | af803c22f14d63dfcf5d329c7f5adba827f455b8 | [
"MIT"
] | 1 | 2021-12-15T22:47:26.000Z | 2021-12-15T22:47:26.000Z | #include "DX12Helper.h"
// Singleton requirement
DX12Helper* DX12Helper::instance;
// --------------------------------------------------------
// Destructor doesn't have much to do since we're using
// ComPtrs for all DX12 objects
// --------------------------------------------------------
DX12Helper::~DX12Helper() ... | 37.117284 | 130 | 0.693996 | vixorien |
19c5fac220898779df3b1836432fae310f62740d | 665 | cpp | C++ | mio/mio_notify.cpp | cheneyfan/MTRpc | 459684e44db866fb067311ae8dbfaf66f35bed15 | [
"BSD-3-Clause"
] | 2 | 2021-05-12T14:13:21.000Z | 2022-03-14T09:11:14.000Z | mio/mio_notify.cpp | cheneyfan/MTRpc | 459684e44db866fb067311ae8dbfaf66f35bed15 | [
"BSD-3-Clause"
] | null | null | null | mio/mio_notify.cpp | cheneyfan/MTRpc | 459684e44db866fb067311ae8dbfaf66f35bed15 | [
"BSD-3-Clause"
] | null | null | null | #include "tcpsocket.h"
#include "mio_notify.h"
#include "mio_poller.h"
#ifdef __x86_64__
#include <sys/eventfd.h>
#elif __i386__
#include <unistd.h>
#endif
namespace mtrpc{
EventNotify::EventNotify():
IOEvent(),
handerNotify(NULL)
{
#ifdef __x86_64__
_fd = eventfd(0, EFD_CLOEXEC|EFD_NONBLOCK);
#... | 14.777778 | 47 | 0.654135 | cheneyfan |
19d463d0ae9635593abb5038ca58bb1a9908deea | 2,750 | cpp | C++ | src/simpcl/src/filters/icp.cpp | senceryazici/point-cloud-filters | d5e4e599b493cc2af1517000c012d7936d46cf0f | [
"MIT"
] | 17 | 2020-01-08T14:35:05.000Z | 2021-12-09T12:30:07.000Z | src/simpcl/src/filters/icp.cpp | senceryazici/point-cloud-filters | d5e4e599b493cc2af1517000c012d7936d46cf0f | [
"MIT"
] | 2 | 2020-01-31T16:31:48.000Z | 2022-03-09T12:49:53.000Z | src/simpcl/src/filters/icp.cpp | senceryazici/point-cloud-filters | d5e4e599b493cc2af1517000c012d7936d46cf0f | [
"MIT"
] | 7 | 2020-01-08T21:28:58.000Z | 2021-12-03T06:00:05.000Z | // Iterative Closest Point Algorithm
// Import dependencies
#include <ros/ros.h>
#include <string>
#include <iostream>
#include <pcl_ros/point_cloud.h>
#include <pcl/point_types.h>
#include <pcl/point_cloud.h>
#include <pcl_conversions/pcl_conversions.h>
#include <sensor_msgs/PointCloud2.h>
#include <pcl/registration/... | 34.810127 | 105 | 0.725455 | senceryazici |
19d6188ce0007ecc8f1942f00ecd592da9f3088e | 231 | cpp | C++ | src/Main.cpp | Midiman/Midori | b97ba1d4dac7e6af9e9b0785747ab9a797caa5c9 | [
"MIT"
] | null | null | null | src/Main.cpp | Midiman/Midori | b97ba1d4dac7e6af9e9b0785747ab9a797caa5c9 | [
"MIT"
] | null | null | null | src/Main.cpp | Midiman/Midori | b97ba1d4dac7e6af9e9b0785747ab9a797caa5c9 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <GL/glew.h>
#include <GLFW/glfw3.h>
#include "Game.h"
int main(int argc, char* argv[])
{
Game game(argc, argv);
if( game.Init() ) {
game.Run();
game.End();
}
return 0;
}
| 11.55 | 32 | 0.606061 | Midiman |
19da471518b95cfe6d46127bc063ea58c06fdb94 | 1,412 | cpp | C++ | examples/src/ExamplesMain.cpp | eleventigerssc/LabSound | 0438183d86836abcb16a69dcb8317e9d8cdb0c2d | [
"BSD-2-Clause"
] | null | null | null | examples/src/ExamplesMain.cpp | eleventigerssc/LabSound | 0438183d86836abcb16a69dcb8317e9d8cdb0c2d | [
"BSD-2-Clause"
] | null | null | null | examples/src/ExamplesMain.cpp | eleventigerssc/LabSound | 0438183d86836abcb16a69dcb8317e9d8cdb0c2d | [
"BSD-2-Clause"
] | 1 | 2019-05-03T12:46:14.000Z | 2019-05-03T12:46:14.000Z | // License: BSD 2 Clause
// Copyright (C) 2015+, The LabSound Authors. All rights reserved.
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include "ExampleBaseApp.h"
#include "Simple.h"
#include "ConnectDisconnect.h"
#include "OfflineRender.h"
#include "ConvolutionReverb.h"
#include "MicrophoneDalek.h"
#inc... | 27.153846 | 132 | 0.815864 | eleventigerssc |
19dae989b20eb2778219bc19d70718f774749780 | 16,385 | cpp | C++ | core/src/ceps_interpreter_nodeset.cpp | cepsdev/ceps | badd1ac7582034f9b4f000ee93828bd584cf858b | [
"MIT"
] | 3 | 2018-09-11T11:40:24.000Z | 2021-07-02T10:24:36.000Z | core/src/ceps_interpreter_nodeset.cpp | cepsdev/ceps | badd1ac7582034f9b4f000ee93828bd584cf858b | [
"MIT"
] | null | null | null | core/src/ceps_interpreter_nodeset.cpp | cepsdev/ceps | badd1ac7582034f9b4f000ee93828bd584cf858b | [
"MIT"
] | null | null | null | /*
Copyright 2021 Tomas Prerovsky (cepsdev@hotmail.com).
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 la... | 43.577128 | 216 | 0.584925 | cepsdev |
19ddadeea0af90a56452a997d843c64a791f48c3 | 2,872 | cpp | C++ | sdk/physx/2.8.3/TrainingPrograms/Programs/Shared_Source/PerfRenderer.cpp | daher-alfawares/xr.desktop | 218a7cff7a9be5865cf786d7cad31da6072f7348 | [
"Apache-2.0"
] | 1 | 2018-09-20T10:01:30.000Z | 2018-09-20T10:01:30.000Z | sdk/physx/2.8.3/TrainingPrograms/Programs/Shared_Source/PerfRenderer.cpp | daher-alfawares/xr.desktop | 218a7cff7a9be5865cf786d7cad31da6072f7348 | [
"Apache-2.0"
] | null | null | null | sdk/physx/2.8.3/TrainingPrograms/Programs/Shared_Source/PerfRenderer.cpp | daher-alfawares/xr.desktop | 218a7cff7a9be5865cf786d7cad31da6072f7348 | [
"Apache-2.0"
] | null | null | null |
#include <stdio.h>
#include "PerfRenderer.h"
#include "GLFontRenderer.h"
#include "Timing.h"
PerfRenderer::PerfRenderer()
{
m_profilerOn = false;
lastTime=getCurrentTime();
for(int i=0;i<FPS_AVG_FRAMES;i++)
fpsTimes[i]=0.0f;
fpsIndex=0;
}
void PerfRenderer::toggleEnable()
{
m_profilerOn = !m_profilerOn;
}
... | 24.758621 | 137 | 0.671309 | daher-alfawares |
19e4b638c109a9a1e175cf8bf5a368d11f3f0842 | 2,964 | cpp | C++ | src/components/src/core/health/HealthComponentTest.cpp | walter-strazak/chimarrao | b4c9f9d726eb5e46d61b33e10b7579cc5512cd09 | [
"MIT"
] | 6 | 2021-04-20T10:32:29.000Z | 2021-06-05T11:48:56.000Z | src/components/src/core/health/HealthComponentTest.cpp | walter-strazak/chimarrao | b4c9f9d726eb5e46d61b33e10b7579cc5512cd09 | [
"MIT"
] | 1 | 2021-05-18T21:00:12.000Z | 2021-06-02T07:59:03.000Z | src/components/src/core/health/HealthComponentTest.cpp | walter-strazak/chimarrao | b4c9f9d726eb5e46d61b33e10b7579cc5512cd09 | [
"MIT"
] | 3 | 2020-09-12T08:54:04.000Z | 2021-04-17T11:16:36.000Z | #include "HealthComponent.h"
#include "gtest/gtest.h"
#include "RendererPoolMock.h"
#include "ComponentOwner.h"
using namespace ::testing;
using namespace components::core;
class HealthComponentTest : public Test
{
public:
void deadAction(int& actionVariableInit)
{
actionVariableInit = deadValue;
... | 31.531915 | 107 | 0.779015 | walter-strazak |
19e5a38ea5995ee39c3d36d81b9e0d95e73ab255 | 10,746 | cpp | C++ | inference-engine/tests/unit/vpu/middleend_tests/edges_tests/data_to_shape_edge.cpp | evgenytalanin-intel/openvino | c3aa866a3318fe9fa8c7ebd3bd333b075bb1cc36 | [
"Apache-2.0"
] | null | null | null | inference-engine/tests/unit/vpu/middleend_tests/edges_tests/data_to_shape_edge.cpp | evgenytalanin-intel/openvino | c3aa866a3318fe9fa8c7ebd3bd333b075bb1cc36 | [
"Apache-2.0"
] | 1 | 2021-09-09T08:43:57.000Z | 2021-09-10T12:39:16.000Z | inference-engine/tests/unit/vpu/middleend_tests/edges_tests/data_to_shape_edge.cpp | evgenytalanin-intel/openvino | c3aa866a3318fe9fa8c7ebd3bd333b075bb1cc36 | [
"Apache-2.0"
] | null | null | null | // Copyright (C) 2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include "graph_transformer_tests.hpp"
namespace vpu {
namespace ie = InferenceEngine;
class DataToShapeEdgeProcessingTests : public GraphTransformerTest {
protected:
void SetUp() override {
ASSERT_NO_FATAL_FAILURE(GraphTr... | 38.106383 | 126 | 0.675321 | evgenytalanin-intel |
19ea980a077156abfb6275e44e77ac8b96d7b983 | 2,600 | cpp | C++ | source/QtCore/QIODeviceSlots.cpp | kenny1818/qt4xhb | f62f40d8b17acb93761014317b52da9f919707d0 | [
"MIT"
] | 1 | 2021-03-07T10:44:03.000Z | 2021-03-07T10:44:03.000Z | source/QtCore/QIODeviceSlots.cpp | kenny1818/qt4xhb | f62f40d8b17acb93761014317b52da9f919707d0 | [
"MIT"
] | null | null | null | source/QtCore/QIODeviceSlots.cpp | kenny1818/qt4xhb | f62f40d8b17acb93761014317b52da9f919707d0 | [
"MIT"
] | 2 | 2020-07-19T03:28:08.000Z | 2021-03-05T18:07:20.000Z | /*
Qt4xHb - Bindings libraries for Harbour/xHarbour and Qt Framework 4
Copyright (C) 2021 Marcos Antonio Gambeta <marcosgambeta AT outlook DOT com>
*/
/*
DO NOT EDIT THIS FILE - the content was created using a source code generator
*/
#include "QIODeviceSlots.h"
QIODeviceSlots::QIODeviceSlots(... | 23.423423 | 92 | 0.647308 | kenny1818 |
19f337fba6a62dab6ab5658b96d6cfe1f1120842 | 1,939 | cpp | C++ | azureeyemodule/app/streaming/resolution.cpp | hogaku/azure-percept-advanced-development | 90177b9f1ec96dee1e7c436af5471007c4092655 | [
"MIT"
] | 52 | 2021-03-02T14:28:37.000Z | 2022-02-07T20:27:52.000Z | azureeyemodule/app/streaming/resolution.cpp | hogaku/azure-percept-advanced-development | 90177b9f1ec96dee1e7c436af5471007c4092655 | [
"MIT"
] | 29 | 2021-03-03T09:36:33.000Z | 2022-03-12T00:59:10.000Z | azureeyemodule/app/streaming/resolution.cpp | hogaku/azure-percept-advanced-development | 90177b9f1ec96dee1e7c436af5471007c4092655 | [
"MIT"
] | 30 | 2021-03-02T14:09:14.000Z | 2022-03-11T05:58:54.000Z | // Copyright (c) Microsoft Corporation.
// Licensed under the MIT license.
// Local includes
#include "resolution.hpp"
#include "../util/helper.hpp"
// Standard library includes
#include <assert.h>
#include <string>
namespace rtsp {
std::string resolution_to_string(const Resolution &resolution)
{
switch (resolu... | 22.034091 | 94 | 0.587416 | hogaku |
19f5c1a2ef2578a7e5bcbbf9cf64dae46919e3cc | 2,746 | cpp | C++ | Projects/Editor/Source/GUI/Controls/CCollapsibleButton.cpp | tsukoyumi/skylicht-engine | 3b88d9718e87e552152633ef60e3f889869b71de | [
"MIT"
] | 310 | 2019-11-25T04:14:11.000Z | 2022-03-31T23:39:19.000Z | Projects/Editor/Source/GUI/Controls/CCollapsibleButton.cpp | tsukoyumi/skylicht-engine | 3b88d9718e87e552152633ef60e3f889869b71de | [
"MIT"
] | 79 | 2019-11-17T07:51:02.000Z | 2022-03-22T08:49:41.000Z | Projects/Editor/Source/GUI/Controls/CCollapsibleButton.cpp | tsukoyumi/skylicht-engine | 3b88d9718e87e552152633ef60e3f889869b71de | [
"MIT"
] | 24 | 2020-05-10T09:37:55.000Z | 2022-03-05T13:19:31.000Z | /*
!@
MIT License
Copyright (c) 2020 Skylicht Technology CO., LTD
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files
(the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify... | 27.737374 | 141 | 0.710488 | tsukoyumi |
19f682e19646697e513452148ece0f9d501d073d | 2,096 | hh | C++ | tamer/channel.hh | kohler/tamer | 0953029ad7fc5c3fd58869227976c359674c670f | [
"BSD-3-Clause"
] | 23 | 2015-04-11T06:41:04.000Z | 2021-11-06T21:34:14.000Z | tamer/channel.hh | kohler/tamer | 0953029ad7fc5c3fd58869227976c359674c670f | [
"BSD-3-Clause"
] | 2 | 2015-04-15T07:00:31.000Z | 2016-08-16T13:46:22.000Z | tamer/channel.hh | kohler/tamer | 0953029ad7fc5c3fd58869227976c359674c670f | [
"BSD-3-Clause"
] | 5 | 2015-08-18T19:24:07.000Z | 2021-04-18T04:35:35.000Z | // -*- mode: c++ -*-
#ifndef TAMER_CHANNEL_HH
#define TAMER_CHANNEL_HH 1
#include <deque>
#include <tamer/event.hh>
namespace tamer {
template <typename T>
class channel {
public:
typedef typename std::deque<T>::size_type size_type;
inline channel();
inline size_type size() const;
inline bool empty... | 21.387755 | 69 | 0.627863 | kohler |
19f69715dae02406f503fc38cacd9936a9baa8bf | 5,132 | hpp | C++ | components/scream/src/share/field/field_repository.hpp | AaronDonahue/scream | a1e1cc67ac6db87ce6525315a5548d0e7b0f5e97 | [
"zlib-acknowledgement",
"FTL",
"RSA-MD"
] | null | null | null | components/scream/src/share/field/field_repository.hpp | AaronDonahue/scream | a1e1cc67ac6db87ce6525315a5548d0e7b0f5e97 | [
"zlib-acknowledgement",
"FTL",
"RSA-MD"
] | 3 | 2019-04-25T18:18:33.000Z | 2019-05-07T16:43:36.000Z | components/scream/src/share/field/field_repository.hpp | AaronDonahue/scream | a1e1cc67ac6db87ce6525315a5548d0e7b0f5e97 | [
"zlib-acknowledgement",
"FTL",
"RSA-MD"
] | null | null | null | #ifndef SCREAM_FIELD_REPOSITORY_HPP
#define SCREAM_FIELD_REPOSITORY_HPP
#include "share/scream_types.hpp"
#include "share/scream_assert.hpp"
#include "share/field/field.hpp"
#include <map>
namespace scream
{
/*
* A database for all the persistent fields needed in an atm time step
* We template a field reposi... | 35.393103 | 160 | 0.73032 | AaronDonahue |
19ff01b95e0216119e2fe31f0d5d01dad501fbd4 | 56,887 | cpp | C++ | src/6502.cpp | allender/emulator | 8310afee84b74cff7d91ecd78f7976264a8df900 | [
"MIT"
] | 53 | 2017-01-19T08:08:40.000Z | 2022-01-26T03:01:24.000Z | src/6502.cpp | allender/emulator | 8310afee84b74cff7d91ecd78f7976264a8df900 | [
"MIT"
] | 15 | 2017-03-10T22:55:53.000Z | 2021-04-14T13:29:38.000Z | src/6502.cpp | allender/emulator | 8310afee84b74cff7d91ecd78f7976264a8df900 | [
"MIT"
] | 1 | 2019-07-09T07:19:53.000Z | 2019-07-09T07:19:53.000Z | /*
MIT License
Copyright (c) 2016-2017 Mark Allender
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, pu... | 38.411209 | 103 | 0.660362 | allender |
19ff8c6859b641606da055df0a33de4288195525 | 8,549 | cpp | C++ | iiwa_controllers/impedance_controller/src/impedance_controller.cpp | ICube-RDH/iiwa_ros2 | 7a8c11eff77b37209dbb17d426447641f863059d | [
"Apache-2.0"
] | 4 | 2022-03-18T21:09:05.000Z | 2022-03-31T13:40:12.000Z | iiwa_controllers/impedance_controller/src/impedance_controller.cpp | ICube-RDH/iiwa_ros2 | 7a8c11eff77b37209dbb17d426447641f863059d | [
"Apache-2.0"
] | 1 | 2022-03-31T15:27:27.000Z | 2022-03-31T15:27:27.000Z | iiwa_controllers/impedance_controller/src/impedance_controller.cpp | ICube-RDH/iiwa_ros2 | 7a8c11eff77b37209dbb17d426447641f863059d | [
"Apache-2.0"
] | 2 | 2022-03-21T08:28:07.000Z | 2022-03-25T08:32:08.000Z | // Copyright 2022, ICube Laboratory, University of Strasbourg
//
// 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... | 36.378723 | 131 | 0.731431 | ICube-RDH |
c2093913bbdee353f2fb6fd87ce095ba69be9dec | 54 | cpp | C++ | IslandMUD/src/NPC/npc_neutral.cpp | JimViebke/MUD | b3786d0b165e31c28d6d7dd6de7b13c9d3df6d5a | [
"MIT"
] | 12 | 2015-05-01T00:16:42.000Z | 2021-07-16T11:06:04.000Z | IslandMUD/src/NPC/npc_neutral.cpp | JimViebke/MUD | b3786d0b165e31c28d6d7dd6de7b13c9d3df6d5a | [
"MIT"
] | 37 | 2015-04-30T19:09:58.000Z | 2018-07-23T23:39:54.000Z | IslandMUD/src/NPC/npc_neutral.cpp | JimViebke/MUD | b3786d0b165e31c28d6d7dd6de7b13c9d3df6d5a | [
"MIT"
] | 3 | 2016-07-15T19:45:09.000Z | 2020-04-01T04:32:18.000Z | /* Jim Viebke
Jun 3 2015 */
#include "npc_neutral.h"
| 10.8 | 24 | 0.666667 | JimViebke |
c2152f5e48d0d6adb692f9db5480d045751e7abf | 452 | cpp | C++ | src/skipList_demo.cpp | Park-ma/Learn-Algorithms | b9f6c1c663a3d1c29d913e7a90f3031075c2b7b9 | [
"MIT"
] | 1 | 2021-01-12T14:27:33.000Z | 2021-01-12T14:27:33.000Z | src/skipList_demo.cpp | Park-ma/Learn-Algorithms | b9f6c1c663a3d1c29d913e7a90f3031075c2b7b9 | [
"MIT"
] | null | null | null | src/skipList_demo.cpp | Park-ma/Learn-Algorithms | b9f6c1c663a3d1c29d913e7a90f3031075c2b7b9 | [
"MIT"
] | null | null | null | #include <iostream>
#include "SkipList.h"
#include "shuffle.h"
int main(){
learn_al::skipList<int> list;
int num[100];
for(int i=0;i<100;i++){
num[i] = i;
}
learn_al::shuffle(num,0,100);
for(int i=0;i<100;i++){
list.insert(num[i]);
}
for (int i = 0; i < 50; ++i) {
... | 19.652174 | 43 | 0.524336 | Park-ma |
c2158382b45a2bc7ca368d7a98b88b8ebeb8ab6b | 2,708 | cpp | C++ | src/RESTAPI_default_configuration.cpp | shimmy568/wlan-cloud-ucentralgw | 806e24e1e666c31175c059373440ae029d9fff67 | [
"BSD-3-Clause"
] | null | null | null | src/RESTAPI_default_configuration.cpp | shimmy568/wlan-cloud-ucentralgw | 806e24e1e666c31175c059373440ae029d9fff67 | [
"BSD-3-Clause"
] | null | null | null | src/RESTAPI_default_configuration.cpp | shimmy568/wlan-cloud-ucentralgw | 806e24e1e666c31175c059373440ae029d9fff67 | [
"BSD-3-Clause"
] | null | null | null | //
// License type: BSD 3-Clause License
// License copy: https://github.com/Telecominfraproject/wlan-cloud-ucentralgw/blob/master/LICENSE
//
// Created by Stephane Bourque on 2021-03-04.
// Arilia Wireless Inc.
//
#include "Poco/JSON/Parser.h"
#include "RESTAPI_default_configuration.h"
#include "uStorageService.h"
... | 31.126437 | 129 | 0.610414 | shimmy568 |
c2278bb277570559b0056fa6555a911984892c2a | 2,465 | cpp | C++ | software/sender.cpp | mirounga/darwin | 36c6c8883fdf9df90ef74c4d51f2e7fa8319ced6 | [
"MIT"
] | 14 | 2019-07-24T13:20:49.000Z | 2022-03-24T02:28:31.000Z | software/sender.cpp | mirounga/darwin | 36c6c8883fdf9df90ef74c4d51f2e7fa8319ced6 | [
"MIT"
] | null | null | null | software/sender.cpp | mirounga/darwin | 36c6c8883fdf9df90ef74c4d51f2e7fa8319ced6 | [
"MIT"
] | 12 | 2018-11-08T04:18:03.000Z | 2021-09-16T06:58:38.000Z | #include "graph.h"
tbb::reader_writer_lock fpga_writer_lock;
seeder_input reference_sender_body::operator()(seeder_input input)
{
auto &reads = get<0>(input);
size_t token = get<1>(input);
size_t word_size = WORD_SIZE;
size_t max_char_to_send = MAX_CHAR_TO_SEND;
size_t num_bytes_to_send = 0;
//fpga_writer_l... | 25.153061 | 104 | 0.714807 | mirounga |
c230e5068f0649c7c6003815746441deb04249e3 | 896 | cpp | C++ | soj/2049.cpp | huangshenno1/project_euler | 8a3c91fd11bcb6a6a830e963b1d5aed3f5ff787d | [
"MIT"
] | null | null | null | soj/2049.cpp | huangshenno1/project_euler | 8a3c91fd11bcb6a6a830e963b1d5aed3f5ff787d | [
"MIT"
] | null | null | null | soj/2049.cpp | huangshenno1/project_euler | 8a3c91fd11bcb6a6a830e963b1d5aed3f5ff787d | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <string.h>
char index_string[1000010];
int main()
{
long long index[256];
int exist_index[256];
char str[1010];
long long s;
int t,n,i;
scanf("%d",&t);
getchar();
while (t--)
{
memset(index,0,sizeof(index));
gets(index_string);
fo... | 20.837209 | 54 | 0.399554 | huangshenno1 |
ea4a45cc15eb7b57972a6db213617aed31918c98 | 3,118 | hpp | C++ | compose.hpp | geotz/compose | 6a3761ef56570c910c9e6984b42a034af8fba36a | [
"MIT"
] | null | null | null | compose.hpp | geotz/compose | 6a3761ef56570c910c9e6984b42a034af8fba36a | [
"MIT"
] | null | null | null | compose.hpp | geotz/compose | 6a3761ef56570c910c9e6984b42a034af8fba36a | [
"MIT"
] | null | null | null | // MIT License
// Copyright (c) 2017 George Tzoumas
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, ... | 34.644444 | 113 | 0.683772 | geotz |
ea4b921325ecadd54018b8aafdcb42d94ff2ff1e | 2,339 | cpp | C++ | modules/task_3/tashirev_i_monte_carlo/tashirev_i_monte_carlo.cpp | stasyurin/pp_2021_spring_informatics | dd9136c28cca4c538c5ecc82512fd78ad1fa7bd3 | [
"BSD-3-Clause"
] | null | null | null | modules/task_3/tashirev_i_monte_carlo/tashirev_i_monte_carlo.cpp | stasyurin/pp_2021_spring_informatics | dd9136c28cca4c538c5ecc82512fd78ad1fa7bd3 | [
"BSD-3-Clause"
] | null | null | null | modules/task_3/tashirev_i_monte_carlo/tashirev_i_monte_carlo.cpp | stasyurin/pp_2021_spring_informatics | dd9136c28cca4c538c5ecc82512fd78ad1fa7bd3 | [
"BSD-3-Clause"
] | 1 | 2021-12-02T22:38:53.000Z | 2021-12-02T22:38:53.000Z | // Copyright 2021 Tashirev Ivan
#include <tbb/tbb.h>
#include <functional>
#include <ctime>
#include <random>
#include <string>
#include <algorithm>
#include <vector>
#include "../../../modules/task_3/tashirev_i_monte_carlo/tashirev_i_monte_carlo.h"
double seqMonteCarlo(double(*f)(const std::vector<double>&),
... | 32.041096 | 82 | 0.495083 | stasyurin |
ea4ccb643ee6e90550f62ea1ea60d2f80e8a1a8b | 652 | hpp | C++ | src/parser_worker.hpp | skiptirengu/anitomy-js | 80376cca490c15ce6950f216b2616be6108f1aa8 | [
"MIT"
] | 19 | 2017-06-06T01:42:33.000Z | 2022-01-17T02:58:27.000Z | src/parser_worker.hpp | skiptirengu/anitomy-js | 80376cca490c15ce6950f216b2616be6108f1aa8 | [
"MIT"
] | 4 | 2018-05-16T04:33:36.000Z | 2020-10-03T18:07:37.000Z | src/parser_worker.hpp | skiptirengu/anitomy-js | 80376cca490c15ce6950f216b2616be6108f1aa8 | [
"MIT"
] | 4 | 2017-01-23T00:10:09.000Z | 2020-04-30T08:46:07.000Z | #pragma once
#include "file_parser.hpp"
#include <napi.h>
namespace anitomy_js {
using Napi::Promise;
class ParserWorker : public Napi::AsyncWorker {
public:
ParserWorker(const Napi::Env &env, const Napi::Value &input, const Napi::Value &options)
: AsyncWorker(env, "anitomy_js::ParserWorker"), _parser(env, ... | 21.733333 | 90 | 0.70092 | skiptirengu |
ea5d3d61545d03e1829ccd37865378b74613a075 | 2,183 | hpp | C++ | cppsrc/board.hpp | gateship1/RushHour | 84fce27c7d19037e81eebf8858a89dfb848349ae | [
"Apache-2.0"
] | null | null | null | cppsrc/board.hpp | gateship1/RushHour | 84fce27c7d19037e81eebf8858a89dfb848349ae | [
"Apache-2.0"
] | null | null | null | cppsrc/board.hpp | gateship1/RushHour | 84fce27c7d19037e81eebf8858a89dfb848349ae | [
"Apache-2.0"
] | null | null | null | #ifndef BOARD_HEADER_FILE
#define BOARD_HEADER_FILE
#include <algorithm> // find_if, min
#include <iostream>
#include <map> // map
#include <cmath> // cos, sin
#include <sstream> // stringstream
#include <vector>
#include "vehicle.hpp"
// player vehicle is a global variable and is 'x'
const char player_vehicle_id = ... | 34.650794 | 90 | 0.677966 | gateship1 |
ea6907f8667343d4cae1d47ea6ab4e1eb38cedc6 | 5,500 | cc | C++ | src/stream/audio/alsa/alsa_capture_stream.cc | screencloud/screenbox-rockchip--rkmedia | d8b09604ab8eb89b9615236ba41a6b049bd0af5c | [
"BSD-3-Clause"
] | null | null | null | src/stream/audio/alsa/alsa_capture_stream.cc | screencloud/screenbox-rockchip--rkmedia | d8b09604ab8eb89b9615236ba41a6b049bd0af5c | [
"BSD-3-Clause"
] | null | null | null | src/stream/audio/alsa/alsa_capture_stream.cc | screencloud/screenbox-rockchip--rkmedia | d8b09604ab8eb89b9615236ba41a6b049bd0af5c | [
"BSD-3-Clause"
] | null | null | null | // Copyright 2019 Fuzhou Rockchip Electronics Co., Ltd. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "stream.h"
#include <assert.h>
#include <errno.h>
#include "alsa_utils.h"
#include "media_type.h"
#include "utils.h"
#include "... | 28.947368 | 80 | 0.686182 | screencloud |
ea690d8d07c492c1629c062a0a69f8314d2a67e0 | 909 | cpp | C++ | Bonepick/engine/utility/Random.cpp | dodgelafnitz/Bonepick | 1a12193e5d0cf5d4061d0d3cbd1529a206ed38f4 | [
"MIT"
] | 3 | 2018-10-09T02:08:57.000Z | 2020-08-12T20:26:29.000Z | Bonepick/engine/utility/Random.cpp | dodgelafnitz/Bonepick | 1a12193e5d0cf5d4061d0d3cbd1529a206ed38f4 | [
"MIT"
] | 1 | 2018-09-30T02:42:39.000Z | 2018-09-30T02:42:39.000Z | Bonepick/engine/utility/Random.cpp | dodgelafnitz/Bonepick | 1a12193e5d0cf5d4061d0d3cbd1529a206ed38f4 | [
"MIT"
] | null | null | null | #include "utility/Random.h"
#include <cstdlib>
#include <ctime>
namespace
{
unsigned storedSeed = 0;
}
//##############################################################################
void InitializeRandom(void)
{
InitializeRandom(unsigned(std::time(nullptr)));
}
//##############################################... | 21.642857 | 80 | 0.40374 | dodgelafnitz |
ea6f2a5d306034ca798e1ab578acf6cf776a5180 | 13,143 | cpp | C++ | test/test_cases2.cpp | Arghnews/wordsearch_solver | cf25db64ca3d1facd9191aad075654f124f0d580 | [
"MIT"
] | null | null | null | test/test_cases2.cpp | Arghnews/wordsearch_solver | cf25db64ca3d1facd9191aad075654f124f0d580 | [
"MIT"
] | null | null | null | test/test_cases2.cpp | Arghnews/wordsearch_solver | cf25db64ca3d1facd9191aad075654f124f0d580 | [
"MIT"
] | null | null | null | #include "test_cases.hpp"
#include "wordsearch_solver/wordsearch_solver.hpp"
#include <catch2/catch.hpp>
#include <fmt/format.h>
#include <range/v3/action/sort.hpp>
#include <range/v3/action/unique.hpp>
#include <range/v3/view/map.hpp>
#include <algorithm>
#include <filesystem>
#include <fstream>
#include <iostream>... | 27.96383 | 80 | 0.592254 | Arghnews |
ea728ba356cb47a80116e72dfcad0cb201ad67e5 | 3,804 | cpp | C++ | core/datastructures/geometrydata.cpp | hmsgit/campvis | d97de6a86323866d6a8f81d2a641e3e0443a6b39 | [
"ECL-2.0",
"Apache-2.0"
] | 5 | 2018-06-19T06:20:01.000Z | 2021-07-31T05:54:25.000Z | core/datastructures/geometrydata.cpp | hmsgit/campvis | d97de6a86323866d6a8f81d2a641e3e0443a6b39 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | core/datastructures/geometrydata.cpp | hmsgit/campvis | d97de6a86323866d6a8f81d2a641e3e0443a6b39 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | // ================================================================================================
//
// This file is part of the CAMPVis Software Framework.
//
// If not explicitly stated otherwise: Copyright (C) 2012-2015, all rights reserved,
// Christian Schulte zu Berge <christian.szb@in.tum.de>
// ... | 32.237288 | 100 | 0.595952 | hmsgit |
ea7e3fe1c95282a02611146ab0ff2d1d23084a9b | 25,604 | cpp | C++ | src/AnimTimeline/qframeselector.cpp | hiergaut/AnimTimeline | 1998ba097628106607888c4f0871173fe6f281a1 | [
"Apache-2.0"
] | 14 | 2019-09-29T14:27:53.000Z | 2021-11-14T11:58:01.000Z | src/AnimTimeline/qframeselector.cpp | hiergaut/AnimTimeline | 1998ba097628106607888c4f0871173fe6f281a1 | [
"Apache-2.0"
] | null | null | null | src/AnimTimeline/qframeselector.cpp | hiergaut/AnimTimeline | 1998ba097628106607888c4f0871173fe6f281a1 | [
"Apache-2.0"
] | 5 | 2019-02-16T18:57:02.000Z | 2021-08-24T00:14:46.000Z | //#include <AnimTimeline/animtimeline.h>
#include "FormAnimTimeline.h"
//#include <AnimTimeline/qframeselector.h>
#include "qframeselector.h"
#include <QDebug>
#include <QPainter>
#include <QTimer>
#include <QWheelEvent>
#include <QtGlobal>
QFrameSelector::QFrameSelector(QWidget* parent)
: QFrame(parent)
{
wi... | 26.260513 | 106 | 0.544798 | hiergaut |
ea7ef91e43c7ad49d69ea19df26f6d58aa1b27e7 | 320 | cpp | C++ | etc/dp/e/main.cpp | wotsushi/competitive-programming | 17ec8fd5e1c23aee626aee70b1c0da8d7f8b8c86 | [
"MIT"
] | 3 | 2019-06-25T06:17:38.000Z | 2019-07-13T15:18:51.000Z | etc/dp/e/main.cpp | wotsushi/competitive-programming | 17ec8fd5e1c23aee626aee70b1c0da8d7f8b8c86 | [
"MIT"
] | null | null | null | etc/dp/e/main.cpp | wotsushi/competitive-programming | 17ec8fd5e1c23aee626aee70b1c0da8d7f8b8c86 | [
"MIT"
] | null | null | null | #include "template.hpp"
int main() {
ll(N, W);
vll(w, v, N);
ll V = 0;
each(v_i, v) { V += v_i; }
vi dp(V + 1, INF);
dp[0] = 0;
rep(i, N) {
rrepi(j, v[i], V) { chmin(dp[j], dp[j - v[i]] + w[i]); }
}
ll ans;
rrepi(i, V) {
if (dp[i] <= W) {
ans = i;
break;
}
}
out(ans);
}
| 14.545455 | 60 | 0.39375 | wotsushi |
ea82bf3e4bb249a5a22a064af19e62a15d4f2315 | 786 | cpp | C++ | src/fixie_lib/scissor_state.cpp | vonture/fixie | 7fa1a6787ae26ee141a906fe39fb85c2e3cf4dfc | [
"MIT"
] | 7 | 2015-01-09T22:08:17.000Z | 2021-10-12T10:32:58.000Z | src/fixie_lib/scissor_state.cpp | vonture/fixie | 7fa1a6787ae26ee141a906fe39fb85c2e3cf4dfc | [
"MIT"
] | 1 | 2015-08-19T07:51:53.000Z | 2015-08-19T07:51:53.000Z | src/fixie_lib/scissor_state.cpp | vonture/fixie | 7fa1a6787ae26ee141a906fe39fb85c2e3cf4dfc | [
"MIT"
] | 5 | 2015-08-20T07:10:23.000Z | 2022-03-24T07:09:10.000Z | #include "fixie_lib/scissor_state.hpp"
#include "fixie/fixie_gl_es.h"
namespace fixie
{
scissor_state::scissor_state()
: _scissor_test_enabled()
, _scissor()
{
}
GLboolean& scissor_state::scissor_test_enabled()
{
return _scissor_test_enabled;
}
const GLboolean& sc... | 19.170732 | 64 | 0.62341 | vonture |
ea84a60365ee50a2b2c4dac3f1daee10fe1e80e3 | 1,073 | cpp | C++ | runtime/test/strconv_test.cpp | cpp-openapi/runtime | 18fe7995b810617e8176f84e1bfe1138414e5e1c | [
"Apache-2.0"
] | null | null | null | runtime/test/strconv_test.cpp | cpp-openapi/runtime | 18fe7995b810617e8176f84e1bfe1138414e5e1c | [
"Apache-2.0"
] | null | null | null | runtime/test/strconv_test.cpp | cpp-openapi/runtime | 18fe7995b810617e8176f84e1bfe1138414e5e1c | [
"Apache-2.0"
] | null | null | null | #include "gtest/gtest.h"
#include "openapi/runtime/strconv.h"
#include "openapi/runtime/string.h"
TEST(StrConv_test, basic) {
#ifdef OPENAPI_UTF16_STRINGS
// std::mbstate_t state = std::mbstate_t();
// std::size_t size;
// const char * buf = "";
// ::mbsrtowcs_s(&size, nullptr, 0 /*dst ... | 34.612903 | 78 | 0.579683 | cpp-openapi |
ea8cdd0c242453cf65d1d3697f8544cd3e07477f | 588 | cpp | C++ | Blaze/libraries.cpp | Star-Athenaeum/Blaze | 73f26316e4146596aeb82f77d054cf4e472a2d3d | [
"MIT"
] | 1 | 2021-09-29T21:54:54.000Z | 2021-09-29T21:54:54.000Z | Blaze/libraries.cpp | Star-Athenaeum/Blaze | 73f26316e4146596aeb82f77d054cf4e472a2d3d | [
"MIT"
] | 44 | 2020-04-17T14:39:36.000Z | 2020-10-14T04:15:48.000Z | Blaze/libraries.cpp | Stryxus/Blaze | 73f26316e4146596aeb82f77d054cf4e472a2d3d | [
"MIT"
] | 1 | 2020-09-30T22:56:48.000Z | 2020-09-30T22:56:48.000Z | #include "pch.hpp"
#include "libraries.hpp"
map<string, HMODULE> modules;
void load_libraries(vector<string> library_names)
{
for (string name : library_names)
{
HMODULE m = LoadLibrary(string_to_wstring_copy(name).c_str());
if (m == NULL) Logger::log_last_error();
else modules.emplace(name, m);
}
}
HMODUL... | 20.275862 | 64 | 0.727891 | Star-Athenaeum |
ea92a1e17b927a42fa4c3f85a4bf6b4c7f722b71 | 13,160 | cpp | C++ | AppleIntelWifiAdapter/IWLCtxtInfo.cpp | AppleIntelWifi/adapter | 49698895ab94563de1cff4e9cd6b0c62ca933bc1 | [
"BSD-3-Clause"
] | 584 | 2020-02-21T23:49:49.000Z | 2022-03-10T01:49:41.000Z | AppleIntelWifiAdapter/IWLCtxtInfo.cpp | AppleIntelWifi/adapter | 49698895ab94563de1cff4e9cd6b0c62ca933bc1 | [
"BSD-3-Clause"
] | 76 | 2020-02-21T22:48:05.000Z | 2020-09-24T09:08:36.000Z | AppleIntelWifiAdapter/IWLCtxtInfo.cpp | AppleIntelWifi/adapter | 49698895ab94563de1cff4e9cd6b0c62ca933bc1 | [
"BSD-3-Clause"
] | 64 | 2020-02-23T05:25:44.000Z | 2022-02-28T19:48:59.000Z | //
// IWLCtxtInfo.cpp
// AppleIntelWifiAdapter
//
// Created by 钟先耀 on 2020/2/9.
// Copyright © 2020 IntelWifi for MacOS authors. All rights reserved.
//
#include "IWLCtxtInfo.hpp"
static void *iwl_pcie_ctxt_info_dma_alloc_coherent(IWLTransport *trans,
size_t siz... | 32.9 | 79 | 0.681991 | AppleIntelWifi |
ea93c088163c57819b7349170eab9d1ae2c6842d | 1,808 | cpp | C++ | libgputk/gputkInit.cpp | xlmentx/Parallel-Computing | 0785f18afaabd5daf2efd89607f643845a07b3c0 | [
"MIT"
] | null | null | null | libgputk/gputkInit.cpp | xlmentx/Parallel-Computing | 0785f18afaabd5daf2efd89607f643845a07b3c0 | [
"MIT"
] | null | null | null | libgputk/gputkInit.cpp | xlmentx/Parallel-Computing | 0785f18afaabd5daf2efd89607f643845a07b3c0 | [
"MIT"
] | null | null | null |
#include "gputk.h"
#define MB (1 << 20)
#ifndef GPUTK_DEFAULT_HEAP_SIZE
#define GPUTK_DEFAULT_HEAP_SIZE (1024 * MB)
#endif /* GPUTK_DEFAULT_HEAP_SIZE */
static bool _initializedQ = gpuTKFalse;
#ifndef GPUTK_USE_WINDOWS
//__attribute__((__constructor__))
#endif /* GPUTK_USE_WINDOWS */
void gpuTK_init(int *
#ifdef GP... | 20.781609 | 71 | 0.679204 | xlmentx |
ea98b93a2f0f147d7fb42ce52316638ba5487bfa | 2,553 | cpp | C++ | 126_findLadders.cpp | imxiaobo/leetcode-solutions | a59c4c9fa424787771c8faca7ba444cae4ed6a4e | [
"MIT"
] | null | null | null | 126_findLadders.cpp | imxiaobo/leetcode-solutions | a59c4c9fa424787771c8faca7ba444cae4ed6a4e | [
"MIT"
] | null | null | null | 126_findLadders.cpp | imxiaobo/leetcode-solutions | a59c4c9fa424787771c8faca7ba444cae4ed6a4e | [
"MIT"
] | null | null | null | class Solution {
public:
vector<vector<string>> findLadders(string beginWord, string endWord,
unordered_set<string> &wordList) {
if (beginWord == endWord)
return {{endWord}};
unordered_map<string, vector<string>> graph;
vector<vector<string>> paths;
unorder... | 31.134146 | 79 | 0.57736 | imxiaobo |
ea9984b575b3db09626312274a2bd661cd42ba53 | 3,977 | cpp | C++ | src/notifycontroller_mobike_supported.cpp | OpenIKEv2/libopenikev2_impl | 3c620ca479b20814fe42325cffcfd1d18dbf041c | [
"Apache-2.0"
] | 3 | 2017-03-03T17:05:37.000Z | 2020-06-16T04:50:40.000Z | src/notifycontroller_mobike_supported.cpp | OpenIKEv2/libopenikev2_impl | 3c620ca479b20814fe42325cffcfd1d18dbf041c | [
"Apache-2.0"
] | 11 | 2017-02-27T09:31:17.000Z | 2020-03-20T16:31:05.000Z | src/notifycontroller_mobike_supported.cpp | OpenIKEv2/libopenikev2_impl | 3c620ca479b20814fe42325cffcfd1d18dbf041c | [
"Apache-2.0"
] | null | null | null | /***************************************************************************
* Copyright (C) 2005 by *
* Alejandro Perez Mendez alex@um.es *
* Pedro J. Fernandez Ruiz pedroj@um.es *
* ... | 47.915663 | 157 | 0.605733 | OpenIKEv2 |
eaac335138b04a7ce94ca33f15cf70799ca4394c | 1,211 | cpp | C++ | trunk/day30/solution.cpp | itsjacob/90pp | eca71e624d28d216feb06d615e587fc6792c36b6 | [
"MIT"
] | null | null | null | trunk/day30/solution.cpp | itsjacob/90pp | eca71e624d28d216feb06d615e587fc6792c36b6 | [
"MIT"
] | null | null | null | trunk/day30/solution.cpp | itsjacob/90pp | eca71e624d28d216feb06d615e587fc6792c36b6 | [
"MIT"
] | null | null | null | class Solution
{
public:
bool possibleBipartition(int n, vector<vector<int>> &dislikes)
{
// create the graph with adjancenty list
std::vector<std::vector<int>> adjList(n + 1);
for (auto const &dislike : dislikes) {
adjList[dislike[0]].push_back(dislike[1]);
// undirected graph so update bot... | 28.833333 | 96 | 0.599505 | itsjacob |
eab3217675395f3932b525f1d67e3e2b3e19c4ec | 1,001 | cpp | C++ | include/hydro/compiler/Line.cpp | hydraate/hydro | 42037a8278dcfdca68fb5cceaf6988da861f0eff | [
"Apache-2.0"
] | null | null | null | include/hydro/compiler/Line.cpp | hydraate/hydro | 42037a8278dcfdca68fb5cceaf6988da861f0eff | [
"Apache-2.0"
] | null | null | null | include/hydro/compiler/Line.cpp | hydraate/hydro | 42037a8278dcfdca68fb5cceaf6988da861f0eff | [
"Apache-2.0"
] | null | null | null | //
// __ __ __
// / / / /__ __ ____/ /_____ ____
// / /_/ // / / // __ // ___// __ \
// / __ // /_/ // /_/ // / / /_/ /
// /_/ /_/ \__, / \__,_//_/ \____/
// /____/
//
// ... | 14.3 | 142 | 0.455544 | hydraate |
eab4a65f9ef2c05abd1a40d81e5581d2bc5b8ce7 | 4,283 | cpp | C++ | source/Driver/SFML/PlatformSFML.cpp | tunip3/Super-Haxagon | 7d1f9c665263e2ea8110bbad5d473f882aa0a441 | [
"MIT"
] | null | null | null | source/Driver/SFML/PlatformSFML.cpp | tunip3/Super-Haxagon | 7d1f9c665263e2ea8110bbad5d473f882aa0a441 | [
"MIT"
] | null | null | null | source/Driver/SFML/PlatformSFML.cpp | tunip3/Super-Haxagon | 7d1f9c665263e2ea8110bbad5d473f882aa0a441 | [
"MIT"
] | null | null | null | #include "../../../include/Driver/SFML/PlatformSFML.hpp"
#include "../../../include/Core/Structs.hpp"
#include "../../../include/Driver/SFML/AudioSFML.hpp"
#include "../../../include/Driver/SFML/FontSFML.hpp"
#include "../../../include/Driver/SFML/PlayerSoundSFML.hpp"
#include <array>
#include <string>
namespace Sup... | 29.335616 | 112 | 0.666589 | tunip3 |
eabd41e72d247194ce39be33fc415ae575750ac7 | 11,209 | cpp | C++ | gui/graphs/plot.cpp | den-makarov/electronshik | 8065842ab0e190b51e8a8745ff984b34fb8da82a | [
"BSD-3-Clause"
] | null | null | null | gui/graphs/plot.cpp | den-makarov/electronshik | 8065842ab0e190b51e8a8745ff984b34fb8da82a | [
"BSD-3-Clause"
] | null | null | null | gui/graphs/plot.cpp | den-makarov/electronshik | 8065842ab0e190b51e8a8745ff984b34fb8da82a | [
"BSD-3-Clause"
] | null | null | null | #include <cmath>
#include <QPainter>
#include <QPen>
#include "plot.h"
#include "logger.h"
#include "mathutils.h"
namespace PowerLab {
namespace Gui {
Plot::Plot(int width, int height)
: m_width(width)
, m_height(height)
{
}
int Plot::getWidth() const {
return m_width;
}
void Plot::setWidth(int width) {
m... | 26.561611 | 107 | 0.644661 | den-makarov |
eabeecac12f20344a7ba86bb561b081029f5e667 | 335 | cpp | C++ | cf/r461div2A.cpp | meng-jack/competitive-programming | f2b4fcec1023e8f827f806dcaa0a2b76117b6c7f | [
"MIT"
] | 1 | 2021-11-23T16:44:07.000Z | 2021-11-23T16:44:07.000Z | cf/r461div2A.cpp | meng-jack/competitive-programming | f2b4fcec1023e8f827f806dcaa0a2b76117b6c7f | [
"MIT"
] | 3 | 2021-11-10T19:32:00.000Z | 2021-11-21T17:24:49.000Z | cf/r461div2A.cpp | meng-jack/competitive-programming | f2b4fcec1023e8f827f806dcaa0a2b76117b6c7f | [
"MIT"
] | 1 | 2021-11-10T19:24:22.000Z | 2021-11-10T19:24:22.000Z | #include <bits/stdc++.h>
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
int main() {
SPEED
int x, y;
cin >> x >> y;
if (y > x + 1 || y == 0 || y == 1 && x > 0) {
cout << "NO";
return 0;
}
((y - 1) - x) % 2 == 0 ? cout << "YES" : c... | 17.631579 | 56 | 0.435821 | meng-jack |
eac83414030e0dd7883aad5501f4dc445e5056db | 186 | cpp | C++ | light.cpp | atomiccheese/raytracer | ad80fe64992275e54db2a86f1c963e5038e6dc87 | [
"MIT"
] | null | null | null | light.cpp | atomiccheese/raytracer | ad80fe64992275e54db2a86f1c963e5038e6dc87 | [
"MIT"
] | null | null | null | light.cpp | atomiccheese/raytracer | ad80fe64992275e54db2a86f1c963e5038e6dc87 | [
"MIT"
] | null | null | null | #include "light.hpp"
Light::Light(const color& c) : col(c) {
}
color Light::getColor(const vec3& incoming) const {
return col;
}
bool Light::isInfinitelyFarAway() {
return false;
}
| 14.307692 | 51 | 0.688172 | atomiccheese |
eacbe965f36a895928b9b7b6491a72e83245bcab | 3,421 | cpp | C++ | Arafat/27. Offset Arrays.cpp | AhmedMostafa7474/Codingame-Solutions | da696a095c143c5d216bc06f6689ad1c0e25d0e0 | [
"MIT"
] | 1 | 2022-03-16T08:56:31.000Z | 2022-03-16T08:56:31.000Z | Arafat/27. Offset Arrays.cpp | AhmedMostafa7474/Codingame-Solutions | da696a095c143c5d216bc06f6689ad1c0e25d0e0 | [
"MIT"
] | 2 | 2022-03-17T11:27:14.000Z | 2022-03-18T07:41:00.000Z | Arafat/27. Offset Arrays.cpp | AhmedMostafa7474/Codingame-Solutions | da696a095c143c5d216bc06f6689ad1c0e25d0e0 | [
"MIT"
] | 6 | 2022-03-13T19:56:11.000Z | 2022-03-17T12:08:22.000Z | //https://www.codingame.com/ide/puzzle/offset-arrays
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<char,string>mp;
map<pair<string,string>,string> mp2;
/*
3
A[-1..1] = 1 2 3
B[3..7] = 3 4 5 6 7
C[-2..1] = 1 2 3 4
A[0]
--
1
X[0..3] = 1 3 3 7
X[X[2]]
*/
string solve(string str)
... | 21.515723 | 82 | 0.366559 | AhmedMostafa7474 |
eacc408bcd5ca9f6967fd3555a9393047ef77d55 | 3,820 | cc | C++ | src/comm/udp.cc | Phantomape/paxos | d88ab88fa5b6c7d74b508580729c4dea4de6f180 | [
"MIT"
] | null | null | null | src/comm/udp.cc | Phantomape/paxos | d88ab88fa5b6c7d74b508580729c4dea4de6f180 | [
"MIT"
] | 5 | 2018-05-30T03:09:10.000Z | 2018-06-02T22:56:05.000Z | src/comm/udp.cc | Phantomape/paxos | d88ab88fa5b6c7d74b508580729c4dea4de6f180 | [
"MIT"
] | null | null | null | #include "default_network.h"
#include "udp.h"
#include <arpa/inet.h>
#include <cstring>
#include <poll.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <unistd.h>
namespace paxos {
UdpRecv::UdpRecv(DefaultNetwork* default_network)
: default_network(default_network), socket_file_descriptor_(-1), is_ende... | 22.080925 | 121 | 0.596335 | Phantomape |
eaccfca629e57e7db41810ce8dfcc7b73c5d3a5a | 5,747 | cpp | C++ | ProjectEuler+/euler-0268.cpp | sarvekash/HackerRank_Solutions | 8f48e5b1a6e792a85a10d8c328cd1f5341fb16a8 | [
"Apache-2.0"
] | null | null | null | ProjectEuler+/euler-0268.cpp | sarvekash/HackerRank_Solutions | 8f48e5b1a6e792a85a10d8c328cd1f5341fb16a8 | [
"Apache-2.0"
] | null | null | null | ProjectEuler+/euler-0268.cpp | sarvekash/HackerRank_Solutions | 8f48e5b1a6e792a85a10d8c328cd1f5341fb16a8 | [
"Apache-2.0"
] | 1 | 2021-05-28T11:14:34.000Z | 2021-05-28T11:14:34.000Z | // ////////////////////////////////////////////////////////
// # Title
// Counting numbers with at least four distinct prime factors less than 100
//
// # URL
// https://projecteuler.net/problem=268
// http://euler.stephan-brumme.com/268/
//
// # Problem
// It can be verified that there are 23 positive integers less th... | 36.605096 | 159 | 0.623108 | sarvekash |
ead1556f3a93d6c8baac6993f5ae967a8582b208 | 962 | cpp | C++ | example.cpp | DoctorBazooka/cpp-itertools | 0db1276065b456bf571186074a9d19b8d3920f9f | [
"MIT"
] | null | null | null | example.cpp | DoctorBazooka/cpp-itertools | 0db1276065b456bf571186074a9d19b8d3920f9f | [
"MIT"
] | null | null | null | example.cpp | DoctorBazooka/cpp-itertools | 0db1276065b456bf571186074a9d19b8d3920f9f | [
"MIT"
] | null | null | null | #include "cpp-itertools.hpp"
#include <iostream>
#include <vector>
#include <cppcoro/generator.hpp>
int main()
{
std::vector<int> example{2, 4, 6, 8, 10, 12};
std::vector<std::string> example2{"Man", "Woman", "Person", "Camera", "TV"};
std::cout << "\nExample:\n";
for (auto& x : example) {
s... | 26 | 80 | 0.503119 | DoctorBazooka |
ead4bd8b691194d0f34cac008f8fae9c30fdc578 | 1,524 | cpp | C++ | 099-recover-binary-search-tree/recover-binary-search-tree.cpp | nagestx/MyLeetCode | ef2a98b48485a0cebc442bbbbdb2690ba51484e1 | [
"MIT"
] | 3 | 2018-12-15T14:07:12.000Z | 2020-07-19T23:18:09.000Z | 099-recover-binary-search-tree/recover-binary-search-tree.cpp | yangyangu/MyLeetCode | ef2a98b48485a0cebc442bbbbdb2690ba51484e1 | [
"MIT"
] | null | null | null | 099-recover-binary-search-tree/recover-binary-search-tree.cpp | yangyangu/MyLeetCode | ef2a98b48485a0cebc442bbbbdb2690ba51484e1 | [
"MIT"
] | null | null | null | // Two elements of a binary search tree (BST) are swapped by mistake.
//
// Recover the tree without changing its structure.
//
// Example 1:
//
//
// Input: [1,3,null,null,2]
//
// 1
// /
// 3
// \
// 2
//
// Output: [3,1,null,null,2]
//
// 3
// /
// 1
// \
// 2
//
//
// Example 2:... | 16.212766 | 70 | 0.44685 | nagestx |
eada45dd9efdabc1437dc5e345565308f9cde2d2 | 1,224 | cpp | C++ | .LHP/.Lop10/.O.L.P/.T.Van/Colp6/code/DSEQ/DSEQ.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | .LHP/.Lop10/.O.L.P/.T.Van/Colp6/code/DSEQ/DSEQ.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | .LHP/.Lop10/.O.L.P/.T.Van/Colp6/code/DSEQ/DSEQ.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdio>
#include <algorithm>
#define maxN 100002
#define maxA 1000000001
#define minA -1000000001
#define maxR 1000000000000001
#define minR -1000000000000001
typedef long maxn;
typedef long long maxa;
maxn n;
maxa a[maxN], mn[maxN], mx[maxN], mnv[maxN], mxv[maxN], res;
void Prepare()... | 17.73913 | 112 | 0.5 | sxweetlollipop2912 |
eadd738e6c5b36fb633ad178d353bd277241590d | 167 | hpp | C++ | BlasterFirmware/modules/readback_memory.hpp | MasterQ32/LPCBlaster | 1490a6f0b7963e7acc47902d9ea2b1abd1ac4563 | [
"Zlib"
] | null | null | null | BlasterFirmware/modules/readback_memory.hpp | MasterQ32/LPCBlaster | 1490a6f0b7963e7acc47902d9ea2b1abd1ac4563 | [
"Zlib"
] | null | null | null | BlasterFirmware/modules/readback_memory.hpp | MasterQ32/LPCBlaster | 1490a6f0b7963e7acc47902d9ea2b1abd1ac4563 | [
"Zlib"
] | null | null | null | #ifndef READBACK_MEMORY_HPP
#define READBACK_MEMORY_HPP
#include "sysctrl.hpp"
namespace readback_memory
{
sysctrl::state begin();
}
#endif // READBACK_MEMORY_HPP
| 13.916667 | 29 | 0.790419 | MasterQ32 |
eadea9ec046a64c8ade4360f496de39ea9afce16 | 1,409 | cpp | C++ | POJ/3624.cpp | Superdanby/YEE | 49a6349dc5644579246623b480777afbf8031fcd | [
"MIT"
] | 1 | 2019-09-07T15:56:05.000Z | 2019-09-07T15:56:05.000Z | POJ/3624.cpp | Superdanby/YEE | 49a6349dc5644579246623b480777afbf8031fcd | [
"MIT"
] | null | null | null | POJ/3624.cpp | Superdanby/YEE | 49a6349dc5644579246623b480777afbf8031fcd | [
"MIT"
] | null | null | null | /*
#include <iostream>
using namespace std;
#define quan 3402
#define totw 12880
int dp[quan+1][totw+1]={};
int weight[quan+1];
int charm[quan+1];
int main()
{
int limq, limw;
cin>>limq>>limw;
for(int x=1; x<=limq; x++)
{
cin>>weight[x]>>charm[x];
}
for(int x=1; x<=limq; x++)
cou... | 19.30137 | 72 | 0.450674 | Superdanby |
eae3110bbc3e5d622f76fd9cdba14db8df9d0c2c | 302 | cpp | C++ | contest/AtCoder/abc169/B.cpp | not522/Competitive-Programming | be4a7d25caf5acbb70783b12899474a56c34dedb | [
"Unlicense"
] | 7 | 2018-04-14T14:55:51.000Z | 2022-01-31T10:49:49.000Z | contest/AtCoder/abc169/B.cpp | not522/Competitive-Programming | be4a7d25caf5acbb70783b12899474a56c34dedb | [
"Unlicense"
] | 5 | 2018-04-14T14:28:49.000Z | 2019-05-11T02:22:10.000Z | contest/AtCoder/abc169/B.cpp | not522/Competitive-Programming | be4a7d25caf5acbb70783b12899474a56c34dedb | [
"Unlicense"
] | null | null | null | #include "vector.hpp"
int main() {
int n(in);
Vector<int64_t> a(n, in);
int64_t res = 1;
for (auto i : a) {
if (2e18 / res < i) {
res = 2e18;
} else {
res *= i;
}
}
if (res <= 1000000000000000000) {
cout << res << endl;
} else {
cout << -1 << endl;
}
}
| 15.1 | 35 | 0.460265 | not522 |
eae64aee4a0dfa55cbc4eaf5a00f73703596f9a8 | 2,492 | cc | C++ | Code/0335-self-crossing.cc | SMartQi/Leetcode | 9e35c65a48ba1ecd5436bbe07dd65f993588766b | [
"MIT"
] | 2 | 2019-12-06T14:08:57.000Z | 2020-01-15T15:25:32.000Z | Code/0335-self-crossing.cc | SMartQi/Leetcode | 9e35c65a48ba1ecd5436bbe07dd65f993588766b | [
"MIT"
] | 1 | 2020-01-15T16:29:16.000Z | 2020-01-26T12:40:13.000Z | Code/0335-self-crossing.cc | SMartQi/Leetcode | 9e35c65a48ba1ecd5436bbe07dd65f993588766b | [
"MIT"
] | null | null | null | class Solution {
public:
bool isSelfCrossing(vector<int>& x) {
if (x.size() <= 3) return false;
unordered_map<int, set<pair<int, int>>> mx;
unordered_map<int, set<pair<int, int>>> my;
int currentx = 0;
int currenty = 0;
int direction = 0;
for (int i = 0; i < x... | 55.377778 | 153 | 0.457063 | SMartQi |
eae8144668e4aa21b3f1b114566d3ddccaf35f36 | 22,894 | cpp | C++ | source/dvp/VisionCam/CSVisionCam.cpp | emrainey/DVP | 1e9649c69d00fb9840876f7608660b6580b15cfa | [
"Apache-2.0"
] | 2 | 2015-09-22T16:50:30.000Z | 2017-03-23T22:49:33.000Z | source/dvp/VisionCam/CSVisionCam.cpp | emrainey/DVP | 1e9649c69d00fb9840876f7608660b6580b15cfa | [
"Apache-2.0"
] | null | null | null | source/dvp/VisionCam/CSVisionCam.cpp | emrainey/DVP | 1e9649c69d00fb9840876f7608660b6580b15cfa | [
"Apache-2.0"
] | null | null | null |
#include <CSVisionCam.h>
#if defined(ANDROID) && (defined(ICS) || defined(JELLYBEAN))
#ifdef KEY_ZOOM
#undef KEY_ZOOM
#endif
#include <camera/CameraParameters.h>
const char PIXEL_FORMAT_YUV420SP[] = "yuv420sp";
const char PIXEL_FORMAT_YUV422I[] = "yuv422i-yuyv";
const char KEY_SATURATION[] = "saturation";
const... | 26.902468 | 136 | 0.611601 | emrainey |
eaea10784731ca247eea129f7d3f49235614b448 | 10,832 | hpp | C++ | sugarless.hpp | ChanTsune/sugarless | 9960bf238ab1dc608ed06e26cdafdb552e1d561e | [
"MIT"
] | null | null | null | sugarless.hpp | ChanTsune/sugarless | 9960bf238ab1dc608ed06e26cdafdb552e1d561e | [
"MIT"
] | null | null | null | sugarless.hpp | ChanTsune/sugarless | 9960bf238ab1dc608ed06e26cdafdb552e1d561e | [
"MIT"
] | null | null | null | #pragma once
#ifndef SUGARLESS_HPP
#define SUGARLESS_HPP
#include <map>
#include <string>
#include <vector>
#include <ostream>
namespace sugarless
{
const static std::string empty_str("");
const static std::string short_token("-");
const static std::string connect_token("=");
const static std::string long_token("--... | 30.512676 | 181 | 0.562131 | ChanTsune |
eaf4b6169d2dc71d1d86c82080725b2009322b3b | 9,094 | cc | C++ | http2/adapter/callback_visitor.cc | HsingYun/quiche | dc872748c9f7c24adc439eb1ce51e687bc78d502 | [
"BSD-3-Clause"
] | null | null | null | http2/adapter/callback_visitor.cc | HsingYun/quiche | dc872748c9f7c24adc439eb1ce51e687bc78d502 | [
"BSD-3-Clause"
] | null | null | null | http2/adapter/callback_visitor.cc | HsingYun/quiche | dc872748c9f7c24adc439eb1ce51e687bc78d502 | [
"BSD-3-Clause"
] | null | null | null | #include "http2/adapter/callback_visitor.h"
#include "http2/adapter/nghttp2_util.h"
#include "third_party/nghttp2/src/lib/includes/nghttp2/nghttp2.h"
#include "common/quiche_endian.h"
// This visitor implementation needs visibility into the
// nghttp2_session_callbacks type. There's no public header, so we'll redefin... | 42.101852 | 80 | 0.703101 | HsingYun |
eaf4e3dd00b32b751684047362945290f55e3767 | 1,881 | cpp | C++ | src/editor/tile_selector.cpp | nadult/FreeFT | f0f63951632d06dd4f6d24ca76b03f38b995cd78 | [
"Unlicense"
] | 118 | 2015-01-26T12:49:58.000Z | 2022-03-19T00:02:01.000Z | src/editor/tile_selector.cpp | nadult/FreeFT | f0f63951632d06dd4f6d24ca76b03f38b995cd78 | [
"Unlicense"
] | 6 | 2015-03-29T14:59:40.000Z | 2020-08-14T22:04:48.000Z | src/editor/tile_selector.cpp | nadult/FreeFT | f0f63951632d06dd4f6d24ca76b03f38b995cd78 | [
"Unlicense"
] | 14 | 2015-01-18T13:55:13.000Z | 2021-11-30T06:56:58.000Z | // Copyright (C) Krzysztof Jakubowski <nadult@fastmail.fm>
// This file is part of FreeFT. See license.txt for details.
#include "gfx/drawing.h"
#include "editor/tile_selector.h"
using game::Tile;
namespace ui {
TileSelector::TileSelector(IRect rect) :Window(rect, WindowStyle::gui_dark),
m_tile_list(rect.width()... | 26.492958 | 101 | 0.671983 | nadult |
eaf7888539d534b03852aa67044dff2de81c8392 | 680 | cpp | C++ | 01-Recover/LT0283.cpp | odeinjul/Solution_New | 12593def5ae867e8193847184792b7fbe00aeff0 | [
"MIT"
] | null | null | null | 01-Recover/LT0283.cpp | odeinjul/Solution_New | 12593def5ae867e8193847184792b7fbe00aeff0 | [
"MIT"
] | null | null | null | 01-Recover/LT0283.cpp | odeinjul/Solution_New | 12593def5ae867e8193847184792b7fbe00aeff0 | [
"MIT"
] | null | null | null | class Solution {
public:
void moveZeroes(vector<int>& nums) {
for(int i=nums.size()-1; i > 0; i--){
while(nums[i] != 0 && nums[i-1] == 0){
int a=nums[i];
nums[i-1] = a;
nums[i] = 0;
if(i < nums.size()-1)
i++;
... | 24.285714 | 50 | 0.376471 | odeinjul |
46ae29501587636ff96eda36aafa072f014c3879 | 4,560 | cpp | C++ | ch7/sensor/ch7_msgfltr_cpp/src/selfilter.cpp | homalozoa/ros2_for_beginners_code | 0515621d9cb53cc0c0e2380cf9a52e68ce975e76 | [
"Apache-2.0"
] | null | null | null | ch7/sensor/ch7_msgfltr_cpp/src/selfilter.cpp | homalozoa/ros2_for_beginners_code | 0515621d9cb53cc0c0e2380cf9a52e68ce975e76 | [
"Apache-2.0"
] | null | null | null | ch7/sensor/ch7_msgfltr_cpp/src/selfilter.cpp | homalozoa/ros2_for_beginners_code | 0515621d9cb53cc0c0e2380cf9a52e68ce975e76 | [
"Apache-2.0"
] | null | null | null | // Copyright (c) 2022 Homalozoa
//
// 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 i... | 35.625 | 93 | 0.736623 | homalozoa |
46ba99f86edc0385b589a1f79c91c77e5d64bc62 | 9,319 | cpp | C++ | src/extern/inventor/lib/database/src/sb/projectors/SbCylinderPlaneProjector.cpp | OpenXIP/xip-libraries | 9f0fef66038b20ff0c81c089d7dd0038e3126e40 | [
"Apache-2.0"
] | 2 | 2020-05-21T07:06:07.000Z | 2021-06-28T02:14:34.000Z | src/extern/inventor/lib/database/src/sb/projectors/SbCylinderPlaneProjector.cpp | OpenXIP/xip-libraries | 9f0fef66038b20ff0c81c089d7dd0038e3126e40 | [
"Apache-2.0"
] | null | null | null | src/extern/inventor/lib/database/src/sb/projectors/SbCylinderPlaneProjector.cpp | OpenXIP/xip-libraries | 9f0fef66038b20ff0c81c089d7dd0038e3126e40 | [
"Apache-2.0"
] | 6 | 2016-03-21T19:53:18.000Z | 2021-06-08T18:06:03.000Z | /*
*
* Copyright (C) 2000 Silicon Graphics, Inc. All Rights Reserved.
*
* This library 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 opti... | 29.678344 | 77 | 0.654577 | OpenXIP |
46c76b6eedfed9174c71e25aa43e4f37fef0fa21 | 11,955 | cpp | C++ | src/sources/BuiltinSubroutines.cpp | pointbazaar/dracovm-compiler | 47eaf0bd049b205cc17fefcb7448a088b55d7d83 | [
"MIT"
] | 5 | 2019-11-30T23:42:03.000Z | 2020-08-12T07:47:00.000Z | src/sources/BuiltinSubroutines.cpp | pointbazaar/dracovm-compiler | 47eaf0bd049b205cc17fefcb7448a088b55d7d83 | [
"MIT"
] | 4 | 2019-10-17T22:18:46.000Z | 2020-01-02T18:32:19.000Z | src/sources/BuiltinSubroutines.cpp | pointbazaar/dracovm-compiler | 47eaf0bd049b205cc17fefcb7448a088b55d7d83 | [
"MIT"
] | null | null | null | #include <map>
#include <iostream>
#include <vector>
#include <numeric>
#include <iterator>
#include <sstream>
#include "BuiltinSubroutines.hpp"
#include "AssemblyCodeGen.hpp"
#include "VMInstr.hpp"
using namespace std;
//https://www.informatik.htw-dresden.de/~beck/ASM/syscall_list.html
//eax values (syscall num... | 24.90625 | 102 | 0.630197 | pointbazaar |
46cfdade48ef91f8149033f6657c4de6a9a31d48 | 1,244 | cpp | C++ | tests/unittests/HttpsExceptionUnitTest.cpp | commshare/easyhttpcpp | 757ec75679c1cbc5f04c81a30133f4bcd3e780f4 | [
"MIT"
] | 147 | 2017-10-05T01:42:02.000Z | 2022-01-21T08:15:05.000Z | tests/unittests/HttpsExceptionUnitTest.cpp | commshare/easyhttpcpp | 757ec75679c1cbc5f04c81a30133f4bcd3e780f4 | [
"MIT"
] | 20 | 2018-05-17T01:55:16.000Z | 2021-04-20T07:27:00.000Z | tests/unittests/HttpsExceptionUnitTest.cpp | commshare/easyhttpcpp | 757ec75679c1cbc5f04c81a30133f4bcd3e780f4 | [
"MIT"
] | 32 | 2018-05-05T13:04:34.000Z | 2022-03-25T16:57:11.000Z | /*
* Copyright 2017 Sony Corporation
*/
#include "gtest/gtest.h"
#include "easyhttpcpp/HttpException.h"
#include "ExceptionTestUtil.h"
namespace easyhttpcpp {
namespace test {
using easyhttpcpp::common::CoreException;
static const unsigned int HttpIllegalArgumentExceptedtedCode = 100700;
static const unsigned in... | 41.466667 | 127 | 0.860129 | commshare |
46daa6f4bf5fd5e1023e5c1d69bdba58845a9ddb | 5,750 | cpp | C++ | src/config_parser.cpp | corvette-berkeley/precimonious | 5ac56e145379bc059d686af10c62c3750224edd3 | [
"BSD-3-Clause"
] | 22 | 2015-08-13T12:57:50.000Z | 2021-12-29T13:02:07.000Z | src/config_parser.cpp | huiguoo/precimonious | 5bc4c7fb522859cddb58743c9a14fab69b3ed8f6 | [
"BSD-3-Clause"
] | 2 | 2018-05-19T15:09:24.000Z | 2021-11-23T00:54:21.000Z | src/config_parser.cpp | huiguoo/precimonious | 5bc4c7fb522859cddb58743c9a14fab69b3ed8f6 | [
"BSD-3-Clause"
] | 13 | 2015-10-16T11:06:37.000Z | 2022-03-28T07:54:26.000Z | #include "config_parser.hpp"
#include "vjson/json.h"
#include "vjson/block_allocator.h"
#include <llvm/Support/CommandLine.h>
#include <llvm/Support/raw_ostream.h>
#include <map>
#include <utility>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
using namespace llvm;
void parse_array(c... | 27.644231 | 87 | 0.623478 | corvette-berkeley |
46dcce3972d5abc524f646628c2e30b8ae1f1452 | 4,302 | cpp | C++ | TicTacToe/src/UI/BoardDisplay.cpp | mitos-drg/VoiceTicTacToe | 8d0a26d00f6185c5743a00373c6a50d7322b8db1 | [
"BSD-2-Clause"
] | null | null | null | TicTacToe/src/UI/BoardDisplay.cpp | mitos-drg/VoiceTicTacToe | 8d0a26d00f6185c5743a00373c6a50d7322b8db1 | [
"BSD-2-Clause"
] | null | null | null | TicTacToe/src/UI/BoardDisplay.cpp | mitos-drg/VoiceTicTacToe | 8d0a26d00f6185c5743a00373c6a50d7322b8db1 | [
"BSD-2-Clause"
] | null | null | null | #include "BoardDisplay.h"
#include <SFML/Graphics/RenderWindow.hpp>
#include "Application/GameStack.h"
#include "Application/GlobalResources.h"
BoardDisplay::BoardDisplay(int posx, int posy, int sizex, int sizey, TTTBoard* board)
: m_positions(), m_rect(posx, posy, sizex, sizey), m_board(board)
{
m_boardColor = { ... | 33.348837 | 101 | 0.658298 | mitos-drg |
46de28fe832564296f08b7b82df4191ebf12496f | 282 | cpp | C++ | epikjjh/baekjoon/2133.cpp | 15ers/Solve_Naively | 23ee4a3aedbedb65b9040594b8c9c6d9cff77090 | [
"MIT"
] | 3 | 2019-05-19T13:44:39.000Z | 2019-07-03T11:15:20.000Z | epikjjh/baekjoon/2133.cpp | 15ers/Solve_Naively | 23ee4a3aedbedb65b9040594b8c9c6d9cff77090 | [
"MIT"
] | 7 | 2019-05-06T02:37:26.000Z | 2019-06-29T07:28:02.000Z | epikjjh/baekjoon/2133.cpp | 15ers/Solve_Naively | 23ee4a3aedbedb65b9040594b8c9c6d9cff77090 | [
"MIT"
] | 1 | 2019-07-28T06:24:54.000Z | 2019-07-28T06:24:54.000Z | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0),cin.tie(0);
int n;
cin >> n;
vector<int> dp(n+1);
dp[0] = 1;
for(int i=2;i<=n;i+=2){
dp[i] = dp[i-2]*3;
for(int j=4;j<=i;j+=2) dp[i] += dp[i-j]*2;
}
cout << dp[n] << endl;
return 0;
} | 15.666667 | 44 | 0.528369 | 15ers |
46e10895fdf12679cd4fdda7311083690c5fb36a | 117 | cxx | C++ | TestPrograms/test_x86_avx2.cxx | bobsayshilol/cryptopp | fc1e98e70d425bc8fd3780c237a43f2facfc1460 | [
"BSL-1.0"
] | null | null | null | TestPrograms/test_x86_avx2.cxx | bobsayshilol/cryptopp | fc1e98e70d425bc8fd3780c237a43f2facfc1460 | [
"BSL-1.0"
] | null | null | null | TestPrograms/test_x86_avx2.cxx | bobsayshilol/cryptopp | fc1e98e70d425bc8fd3780c237a43f2facfc1460 | [
"BSL-1.0"
] | null | null | null | #include <immintrin.h>
int main(int argc, char* argv[])
{
__m256i x;
x=_mm256_add_epi64 (x,x);
return 0;
}
| 14.625 | 33 | 0.623932 | bobsayshilol |
46ea1e10e03fac29295ff9a71db16c8bf0e91e51 | 3,001 | cpp | C++ | tests/test_barriers.cpp | 648trindade/adaptive | 3cf234ae66167df6ce2b068c4b92765fe47ba148 | [
"MIT"
] | 1 | 2020-05-06T20:22:58.000Z | 2020-05-06T20:22:58.000Z | tests/test_barriers.cpp | 648trindade/adaptive | 3cf234ae66167df6ce2b068c4b92765fe47ba148 | [
"MIT"
] | 5 | 2020-04-20T02:06:09.000Z | 2020-05-12T00:26:38.000Z | tests/test_barriers.cpp | 648trindade/adaptive | 3cf234ae66167df6ce2b068c4b92765fe47ba148 | [
"MIT"
] | null | null | null | #define CATCH_CONFIG_MAIN // This tells Catch to provide a main() - only do this in one cpp file
#define CATCH_CONFIG_CONSOLE_WIDTH 120
#include "../adaptive/adaptive.hpp"
#include "Catch2/catch.hpp"
#include <chrono>
#include <thread>
using namespace adapt;
void barrier_loop(AtomicBarrier &barrier, size_t iters) {
... | 36.156627 | 112 | 0.691103 | 648trindade |
46ee746c5cb8e0a91ea5284fcd798ea21e085964 | 2,734 | cpp | C++ | bin/libs/systemc-2.3.1/examples/sysc/risc_cpu/paging.cpp | buaawj/Research | 23bf0d0df67f80b7a860f9d2dc3f30b60554c26d | [
"OML"
] | 9 | 2019-07-15T10:05:29.000Z | 2022-03-14T12:55:19.000Z | bin/libs/systemc-2.3.1/examples/sysc/risc_cpu/paging.cpp | buaawj/Research | 23bf0d0df67f80b7a860f9d2dc3f30b60554c26d | [
"OML"
] | 2 | 2019-11-30T23:27:47.000Z | 2021-11-02T12:01:05.000Z | systemc-2.3.1/examples/sysc/risc_cpu/paging.cpp | tianzhuqiao/bsmedit | 3e443ed6db7b44b3b0da0e4bc024b65dcfe8e7a4 | [
"MIT"
] | null | null | null | /*****************************************************************************
The following code is derived, directly or indirectly, from the SystemC
source code Copyright (c) 1996-2014 by all Contributors.
All Rights reserved.
The contents of this file are subject to the restrictions and limitations
set f... | 31.068182 | 79 | 0.539503 | buaawj |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.