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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7f8e4e0e8954673b24c3f893b649639cc0eb75e2 | 664 | cpp | C++ | Codeforces/1060B.cpp | anubhawbhalotia/Competitive-Programming | 32d7003abf9af4999b3dfa78fe1df9022ebbf50b | [
"MIT"
] | null | null | null | Codeforces/1060B.cpp | anubhawbhalotia/Competitive-Programming | 32d7003abf9af4999b3dfa78fe1df9022ebbf50b | [
"MIT"
] | null | null | null | Codeforces/1060B.cpp | anubhawbhalotia/Competitive-Programming | 32d7003abf9af4999b3dfa78fe1df9022ebbf50b | [
"MIT"
] | 1 | 2020-05-20T18:36:31.000Z | 2020-05-20T18:36:31.000Z | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n;
scanf("%lld",&n);
long long t=n;
long long d=0;
long long ten=1;
long long s=0;
long long nine=0;
if(n<9)
{
cout<<n<<endl;
return 0;
}
long long tmp;
while(t!=0)
{
tmp=t%10;
if(tmp==9)
nine++;
d++;
t=t/10;
ten=ten*10;
... | 10.375 | 28 | 0.52259 | anubhawbhalotia |
7f8f99a980314ef6e4f5f05b74f03b45d42f02a4 | 2,899 | cpp | C++ | src/base/dictionary.cpp | lii-enac/djnn-cpp | f27c5ba3186186ee22c93ae91c16063556e929b6 | [
"BSD-2-Clause"
] | 4 | 2018-09-11T14:27:57.000Z | 2019-12-16T21:06:26.000Z | src/base/dictionary.cpp | lii-enac/djnn-cpp | f27c5ba3186186ee22c93ae91c16063556e929b6 | [
"BSD-2-Clause"
] | null | null | null | src/base/dictionary.cpp | lii-enac/djnn-cpp | f27c5ba3186186ee22c93ae91c16063556e929b6 | [
"BSD-2-Clause"
] | 2 | 2018-06-11T14:15:30.000Z | 2019-01-09T12:23:35.000Z | /*
* djnn v2
*
* The copyright holders for the contents of this file are:
* Ecole Nationale de l'Aviation Civile, France (2019)
* See file "license.terms" for the rights and conditions
* defined by copyright holders.
*
*
* Contributors:
* Mathieu Magnaudet <mathieu.magnaudet@enac.fr>
*
*/
#i... | 23.007937 | 68 | 0.602277 | lii-enac |
7f99bd67d5afc919329163bc9ee0aec29c771b2d | 881 | cpp | C++ | benchmark/fenwick/micro/build.cpp | pacman616/hybrid-fenwick-tree | 84e7cc8aa84b87937b98d85f3c2ed1998c0d79af | [
"MIT"
] | 4 | 2019-01-10T17:55:43.000Z | 2019-11-26T09:33:38.000Z | benchmark/fenwick/micro/build.cpp | pacman616/hybrid-fenwick-tree | 84e7cc8aa84b87937b98d85f3c2ed1998c0d79af | [
"MIT"
] | null | null | null | benchmark/fenwick/micro/build.cpp | pacman616/hybrid-fenwick-tree | 84e7cc8aa84b87937b98d85f3c2ed1998c0d79af | [
"MIT"
] | null | null | null | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <random>
#include <string>
#include <sys/stat.h>
#include "../microbench.h"
int main(int argc, char **argv) {
using namespace std;
using namespace hft::fenwick;
if (argc < 2) {
cerr << "Not enough parameters: <dir> <size... | 25.171429 | 59 | 0.604994 | pacman616 |
7f9b5886f30afbdda7c340e5b9ce42c27d6a3ca0 | 2,576 | cpp | C++ | p418m/word_typing.cpp | l33tdaima/l33tdaima | 0a7a9573dc6b79e22dcb54357493ebaaf5e0aa90 | [
"MIT"
] | 1 | 2020-02-20T12:04:46.000Z | 2020-02-20T12:04:46.000Z | p418m/word_typing.cpp | l33tdaima/l33tdaima | 0a7a9573dc6b79e22dcb54357493ebaaf5e0aa90 | [
"MIT"
] | null | null | null | p418m/word_typing.cpp | l33tdaima/l33tdaima | 0a7a9573dc6b79e22dcb54357493ebaaf5e0aa90 | [
"MIT"
] | null | null | null | // g++ -std=c++11 *.cpp -o test && ./test && rm test
#include <vector>
#include <string>
#include <iostream>
using namespace std;
class Solution {
public:
int wordsTypingBrutal(vector<string>& sentence, int rows, int cols) {
if (rows == 0 || cols == 0) { return 0; }
vector<int> sz;
for (a... | 26.020202 | 95 | 0.385093 | l33tdaima |
7f9f5a63b919b94972be75d845678977c9a17c0b | 2,170 | cpp | C++ | BinaryTrees/NodeDepths.cpp | tdkhan/algo-expert | f14c0a86acd2b77f9744c2d7d936759f31375a83 | [
"MIT"
] | null | null | null | BinaryTrees/NodeDepths.cpp | tdkhan/algo-expert | f14c0a86acd2b77f9744c2d7d936759f31375a83 | [
"MIT"
] | null | null | null | BinaryTrees/NodeDepths.cpp | tdkhan/algo-expert | f14c0a86acd2b77f9744c2d7d936759f31375a83 | [
"MIT"
] | null | null | null | /* ####################################################################################################
The distance between a node in a Binary Tree and the tree's root is called the node's depth.
Write a function that takes in a Binary Tree and returns the sum of its nodes' depths.
Each BinaryTree node has an integ... | 21.067961 | 104 | 0.582949 | tdkhan |
7fa8ee3ebcd6009478878e68033a2a0bfac92754 | 2,075 | hpp | C++ | include/algorithms/rbca.hpp | Felix-Droop/static_task_scheduling | 084b7d53caeff9ac3593aa7e3d2c5206afd234d0 | [
"MIT"
] | null | null | null | include/algorithms/rbca.hpp | Felix-Droop/static_task_scheduling | 084b7d53caeff9ac3593aa7e3d2c5206afd234d0 | [
"MIT"
] | null | null | null | include/algorithms/rbca.hpp | Felix-Droop/static_task_scheduling | 084b7d53caeff9ac3593aa7e3d2c5206afd234d0 | [
"MIT"
] | null | null | null | #pragma once
#include <algorithm>
#include <vector>
#include <algorithms/common_clustering_based.hpp>
#include <cluster/cluster.hpp>
#include <io/command_line_arguments.hpp>
#include <io/issue_warning.hpp>
#include <schedule/schedule.hpp>
#include <workflow/task.hpp>
#include <workflow/workflow.hpp>
namespace algori... | 27.302632 | 85 | 0.681928 | Felix-Droop |
7faf7680036ada2b885426f54eb88f904bf88932 | 271 | cpp | C++ | Challenge-2021-10/10_bitwise_and_of_numbers_range.cpp | qiufengyu/LetsCode | 196fae0bf5c78ee20d05798a9439596e702fdb24 | [
"MIT"
] | null | null | null | Challenge-2021-10/10_bitwise_and_of_numbers_range.cpp | qiufengyu/LetsCode | 196fae0bf5c78ee20d05798a9439596e702fdb24 | [
"MIT"
] | null | null | null | Challenge-2021-10/10_bitwise_and_of_numbers_range.cpp | qiufengyu/LetsCode | 196fae0bf5c78ee20d05798a9439596e702fdb24 | [
"MIT"
] | null | null | null | #include "../header.h"
class Solution {
public:
int rangeBitwiseAnd(int left, int right) {
int round = 0;
while (left != right) {
++round;
left >>= 1;
right >>= 1;
}
return (left << round);
}
}; | 19.357143 | 46 | 0.442804 | qiufengyu |
7fb6e978192764939de409bbaa8b849685b4de92 | 3,276 | cpp | C++ | 3rd/DBoW2/util/ConvertORBVocabrary.cpp | billamiable/openvslam | 0b6379a477e6bfc18e7f96d752704bb4edd35201 | [
"Apache-2.0",
"BSD-2-Clause",
"MIT"
] | null | null | null | 3rd/DBoW2/util/ConvertORBVocabrary.cpp | billamiable/openvslam | 0b6379a477e6bfc18e7f96d752704bb4edd35201 | [
"Apache-2.0",
"BSD-2-Clause",
"MIT"
] | null | null | null | 3rd/DBoW2/util/ConvertORBVocabrary.cpp | billamiable/openvslam | 0b6379a477e6bfc18e7f96d752704bb4edd35201 | [
"Apache-2.0",
"BSD-2-Clause",
"MIT"
] | null | null | null | #include <chrono>
#include <memory>
#include "DBoW2/FORB.h"
#include "DBoW2/TemplatedVocabulary.h"
typedef DBoW2::TemplatedVocabulary<DBoW2::FORB::TDescriptor, DBoW2::FORB> ORBVocabulary;
class Timer {
public:
Timer() {
start_ = std::chrono::system_clock::now();
}
virtual ~Timer() = default;
double getM... | 27.529412 | 93 | 0.625458 | billamiable |
7fb7b692a1f9e57eaa6df6281dc0945c1f241432 | 1,035 | cpp | C++ | Algorithmic Toolbox/Included Problems/fib_and_canSum.cpp | hovmikayelyan/Data_Structures_and_Algorithms | abfd3c63f8bce200c2379c44e755e53611f26ac7 | [
"MIT"
] | null | null | null | Algorithmic Toolbox/Included Problems/fib_and_canSum.cpp | hovmikayelyan/Data_Structures_and_Algorithms | abfd3c63f8bce200c2379c44e755e53611f26ac7 | [
"MIT"
] | null | null | null | Algorithmic Toolbox/Included Problems/fib_and_canSum.cpp | hovmikayelyan/Data_Structures_and_Algorithms | abfd3c63f8bce200c2379c44e755e53611f26ac7 | [
"MIT"
] | null | null | null | #include <iostream>
#include <map>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
long long fib(int n, map<int, long long> &memo)
{
if (memo.find(n) != memo.end())
{
return memo[n];
}
if (n <= 2)
{
return 1;
}
memo[n] = fib(n - 1, memo) + fib(n... | 18.157895 | 75 | 0.52657 | hovmikayelyan |
7fbb94e8a993810f28ba6d401020a394824a6d28 | 15,450 | cpp | C++ | src/io/ElementFileWriter.cpp | spraetor/amdis2 | 53c45c81a65752a8fafbb54f9ae6724a86639dcd | [
"MIT"
] | 2 | 2018-07-04T16:44:04.000Z | 2021-01-03T07:26:27.000Z | src/io/ElementFileWriter.cpp | spraetor/amdis2 | 53c45c81a65752a8fafbb54f9ae6724a86639dcd | [
"MIT"
] | null | null | null | src/io/ElementFileWriter.cpp | spraetor/amdis2 | 53c45c81a65752a8fafbb54f9ae6724a86639dcd | [
"MIT"
] | null | null | null | #include "io/ElementFileWriter.hpp"
#include <boost/iostreams/filtering_stream.hpp>
#include <boost/iostreams/device/file_descriptor.hpp>
#include <boost/filesystem/operations.hpp>
#include <boost/filesystem/convenience.hpp>
#include "BasisFunction.hpp"
#include "Initfile.hpp"
#include "Traverse.hpp"
#include "AdaptI... | 32.733051 | 181 | 0.509191 | spraetor |
7fbf4c994fc6e5f793c29ba94c189bba4c76f889 | 13,501 | cpp | C++ | hw3_2/src/Shrink.cpp | kinstaky/CourseDataAnalysis | 9f44f5816ca55b2419df2aa4251fa4107bd9f3fc | [
"MIT"
] | null | null | null | hw3_2/src/Shrink.cpp | kinstaky/CourseDataAnalysis | 9f44f5816ca55b2419df2aa4251fa4107bd9f3fc | [
"MIT"
] | null | null | null | hw3_2/src/Shrink.cpp | kinstaky/CourseDataAnalysis | 9f44f5816ca55b2419df2aa4251fa4107bd9f3fc | [
"MIT"
] | null | null | null | #include "Shrink.h"
using std::multimap;
using std::pair;
using std::vector;
using std::make_pair;
DSSDShrink::DSSDShrink(TTree *it, TTree *st, TTree *rt) {
ipt = it;
stree = st;
rtree = rt;
dssdNum = 0;
}
DSSDShrink::~DSSDShrink() {
}
int DSSDShrink::AddDSSD(const char *nn, int xs, int ys, i... | 31.544393 | 139 | 0.542997 | kinstaky |
7fccf0863d0cbbc33b1b7e07d871225d9c9ebab6 | 2,021 | cpp | C++ | export.cpp | joabda/PasswordGenerator | a436ef2fd4bc58c1ef63597257f7a53128f86920 | [
"MIT"
] | 1 | 2020-01-26T15:36:05.000Z | 2020-01-26T15:36:05.000Z | export.cpp | joabda/PasswordGenerator | a436ef2fd4bc58c1ef63597257f7a53128f86920 | [
"MIT"
] | null | null | null | export.cpp | joabda/PasswordGenerator | a436ef2fd4bc58c1ef63597257f7a53128f86920 | [
"MIT"
] | null | null | null | #include "export.h"
Export::Export()
{
availableMethods_.push_back("TXT");
availableMethods_.push_back("PDF");
}
void Export::PDF(const QVector<QPair<QString, QString>>& password) const
{
QString html =
"<div align=left>"
"Generator<br>"
"<a href=\"https://github.com/joabda/PasswordGener... | 28.871429 | 132 | 0.629886 | joabda |
7fdbd0c311600d78695e740e0178484bda6b3000 | 104 | cpp | C++ | Vengine/src/Components/Camera.cpp | henrikstorck/Vengine | b6b0449b7c09ca5357d240e16bb577b65a71d712 | [
"MIT"
] | null | null | null | Vengine/src/Components/Camera.cpp | henrikstorck/Vengine | b6b0449b7c09ca5357d240e16bb577b65a71d712 | [
"MIT"
] | null | null | null | Vengine/src/Components/Camera.cpp | henrikstorck/Vengine | b6b0449b7c09ca5357d240e16bb577b65a71d712 | [
"MIT"
] | null | null | null | #include "Vengine/Camera.h"
namespace vengine
{
Camera::Camera()
{
}
Camera::~Camera()
{
}
} | 6.5 | 27 | 0.586538 | henrikstorck |
8f1ead1b527312c498981a165816b4b7352c015f | 644 | hpp | C++ | include/hx711/lazy_value.hpp | ricardocosme/hx711 | 629639b392e4e27eb773c09920f223c4f879d497 | [
"MIT"
] | 1 | 2021-02-09T06:54:50.000Z | 2021-02-09T06:54:50.000Z | include/hx711/lazy_value.hpp | ricardocosme/hx711 | 629639b392e4e27eb773c09920f223c4f879d497 | [
"MIT"
] | null | null | null | include/hx711/lazy_value.hpp | ricardocosme/hx711 | 629639b392e4e27eb773c09920f223c4f879d497 | [
"MIT"
] | null | null | null | #pragma once
#include <stdint.h>
namespace hx711 {
/** Represents a future value
If there isn't any value yet the method done() returns false and
true otherwise. If done() == true then the value can be obtained
through value().
*/
class lazy_value {
int32_t _value{INT32_MAX};
public:
using valu... | 20.125 | 68 | 0.638199 | ricardocosme |
8f23731999aefc8bfe8448a58abdd540b3d88748 | 129 | cc | C++ | Pods/gRPC-C++/src/cpp/client/create_channel.cc | MrsTrier/RememberArt | 90314d1f05a1d63b9885ebb17d37bab5134a24f3 | [
"MIT"
] | null | null | null | Pods/gRPC-C++/src/cpp/client/create_channel.cc | MrsTrier/RememberArt | 90314d1f05a1d63b9885ebb17d37bab5134a24f3 | [
"MIT"
] | null | null | null | Pods/gRPC-C++/src/cpp/client/create_channel.cc | MrsTrier/RememberArt | 90314d1f05a1d63b9885ebb17d37bab5134a24f3 | [
"MIT"
] | null | null | null | version https://git-lfs.github.com/spec/v1
oid sha256:bfd3895c1a74952f8d24965acb98b6fbf78b80fbe4e3305d7cf8f1b4c297e228
size 3189
| 32.25 | 75 | 0.883721 | MrsTrier |
8f273a64034bfbad5715bc044f41e510f8df0846 | 2,164 | hpp | C++ | include/std.idialogeximpl.hpp | wilsonsouza/stdx.frame.x86 | c9e0cc4c748f161367531990e5795a700f40e5ec | [
"Apache-2.0"
] | null | null | null | include/std.idialogeximpl.hpp | wilsonsouza/stdx.frame.x86 | c9e0cc4c748f161367531990e5795a700f40e5ec | [
"Apache-2.0"
] | null | null | null | include/std.idialogeximpl.hpp | wilsonsouza/stdx.frame.x86 | c9e0cc4c748f161367531990e5795a700f40e5ec | [
"Apache-2.0"
] | null | null | null | //-----------------------------------------------------------------------------------------------//
// dedaluslib.lib for Windows
//
// Created by Wilson.Souza 2012, 2013
// For Libbs Farma
//
// Dedalus Prime
// (c) 2012, 2013
//----------------------------------------------------------------------------------... | 39.345455 | 100 | 0.553142 | wilsonsouza |
8f2a98a843cda621b2209e22a3731168ffa0ea1f | 2,280 | cpp | C++ | homework/Fedotova/02/prime_numbers.cpp | nkotelevskii/msu_cpp_spring_2018 | b5d84447f9b8c7f3615b421c51cf4192f1b90342 | [
"MIT"
] | 12 | 2018-02-20T15:25:12.000Z | 2022-02-15T03:31:55.000Z | homework/Fedotova/02/prime_numbers.cpp | nkotelevskii/msu_cpp_spring_2018 | b5d84447f9b8c7f3615b421c51cf4192f1b90342 | [
"MIT"
] | 1 | 2018-02-26T12:40:47.000Z | 2018-02-26T12:40:47.000Z | homework/Fedotova/02/prime_numbers.cpp | nkotelevskii/msu_cpp_spring_2018 | b5d84447f9b8c7f3615b421c51cf4192f1b90342 | [
"MIT"
] | 33 | 2018-02-20T15:25:11.000Z | 2019-02-13T22:33:36.000Z | #include <iostream>
#include "numbers.dat"
#include <vector>
#define MAX 100000
// Data - массив
// Size - размер массива
std::vector<unsigned> prime_bin;
unsigned bs = 8 * sizeof(unsigned);
void erat_bin() {
prime_bin.resize(MAX / bs + 2, ~0);
prime_bin[0] &= ~(1 + (1 << 1));
for (unsigned j = 4; j < MA... | 24.516129 | 58 | 0.404386 | nkotelevskii |
8f2cff1c649f0c65c4a198edd508c5e6a8119b1b | 11,086 | cpp | C++ | 3rdparty/nana/source/gui/detail/bedrock_pi.cpp | Greentwip/windy | 4eb8174f952c5b600ff004827a5c85dbfb013091 | [
"MIT"
] | 1 | 2017-07-13T21:11:55.000Z | 2017-07-13T21:11:55.000Z | 3rdparty/nana/source/gui/detail/bedrock_pi.cpp | Greentwip/Windy | 4eb8174f952c5b600ff004827a5c85dbfb013091 | [
"MIT"
] | null | null | null | 3rdparty/nana/source/gui/detail/bedrock_pi.cpp | Greentwip/Windy | 4eb8174f952c5b600ff004827a5c85dbfb013091 | [
"MIT"
] | null | null | null | /*
* A Bedrock Platform-Independent Implementation
* Nana C++ Library(http://www.nanapro.org)
* Copyright(C) 2003-2015 Jinhao(cnjinhao@hotmail.com)
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*
* @file: nana/g... | 25.252847 | 120 | 0.64613 | Greentwip |
8f3adef7194d4dad86efc3a8bc5be3c27f90bca9 | 3,547 | cpp | C++ | day20/solution.cpp | jgreitemann/aoc21 | 0a88c13a7d71f7a17697785b1875ff19965132b7 | [
"Unlicense"
] | null | null | null | day20/solution.cpp | jgreitemann/aoc21 | 0a88c13a7d71f7a17697785b1875ff19965132b7 | [
"Unlicense"
] | null | null | null | day20/solution.cpp | jgreitemann/aoc21 | 0a88c13a7d71f7a17697785b1875ff19965132b7 | [
"Unlicense"
] | 1 | 2021-12-02T19:57:28.000Z | 2021-12-02T19:57:28.000Z | #include "solution.h"
namespace Day20 {
auto parse_kernel(std::istream &stream) -> std::string {
std::string kernel;
std::getline(stream, kernel);
stream.ignore();
return kernel;
}
auto resize_extents(AoC::Dyn2DExtents extents, std::ptrdiff_t by) -> AoC::Dyn2DExtents {
return AoC::Dyn2DExte... | 38.139785 | 97 | 0.635749 | jgreitemann |
8f3ed8dce703809ecf22f418adf18469ff8d75bd | 13,485 | cc | C++ | src/gb/image/image_view_test.cc | jpursey/game-bits | 2daefa2cef5601939dbea50a755b8470e38656ae | [
"MIT"
] | 1 | 2020-07-11T17:03:19.000Z | 2020-07-11T17:03:19.000Z | src/gb/image/image_view_test.cc | jpursey/gbits | 4dfedd1297ca368ad1d80a03308fc4da0241f948 | [
"MIT"
] | 2 | 2021-12-10T13:38:51.000Z | 2022-02-22T16:02:24.000Z | src/gb/image/image_view_test.cc | jpursey/game-bits | 2daefa2cef5601939dbea50a755b8470e38656ae | [
"MIT"
] | null | null | null | // Copyright (c) 2020 John Pursey
//
// Use of this source code is governed by an MIT-style License that can be found
// in the LICENSE file or at https://opensource.org/licenses/MIT.
#include "gb/image/image_view.h"
#include "gmock/gmock.h"
#include "gtest/gtest.h"
namespace gb {
namespace {
using ::testing::Each;... | 39.086957 | 80 | 0.655692 | jpursey |
8f46124272faded17c96f032af421cdd01505e7c | 992 | cpp | C++ | CodeForces/Sereja and Dima.cpp | abdelrahman0123/Problem-Solving | 9d40ed9adb6e6d519dc53f676b6dd44ca15ee70b | [
"MIT"
] | null | null | null | CodeForces/Sereja and Dima.cpp | abdelrahman0123/Problem-Solving | 9d40ed9adb6e6d519dc53f676b6dd44ca15ee70b | [
"MIT"
] | null | null | null | CodeForces/Sereja and Dima.cpp | abdelrahman0123/Problem-Solving | 9d40ed9adb6e6d519dc53f676b6dd44ca15ee70b | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define cin(v) for (int i = 0; i < v.size(); i++) cin >> v[i];
#define cout(v) for (auto i : v) cout << i << endl;
typedef long long ll;
... | 18.036364 | 68 | 0.472782 | abdelrahman0123 |
8f4adedf8aefccb930cb7d4ea931122e26ad79da | 3,165 | cpp | C++ | Projects/16 Shunting Yard/source/main.cpp | Yonas-A/CS-003A | e3c1da7d9c6f8b3e5695741156fcfa22ec6390f0 | [
"MIT"
] | null | null | null | Projects/16 Shunting Yard/source/main.cpp | Yonas-A/CS-003A | e3c1da7d9c6f8b3e5695741156fcfa22ec6390f0 | [
"MIT"
] | null | null | null | Projects/16 Shunting Yard/source/main.cpp | Yonas-A/CS-003A | e3c1da7d9c6f8b3e5695741156fcfa22ec6390f0 | [
"MIT"
] | null | null | null |
#include <iomanip>
#include <iostream>
#include "../../!includes/Queue/queue.h"
#include "../../!includes/Shunting_Yard/shunting_yard.h"
#include "../../!includes/Token/function.h"
#include "../../!includes/Token/left_paren.h"
#include "../../!includes/Token/number.h"
#include "../../!includes/Token/operator.h"
#incl... | 27.763158 | 57 | 0.523539 | Yonas-A |
8f538b895c2074df4828efca31c027a390a56c7c | 24,594 | cpp | C++ | moai/src/moaicore/MOAILuaObject.cpp | jjimenezg93/ai-pathfinding | e32ae8be30d3df21c7e64be987134049b585f1e6 | [
"MIT"
] | null | null | null | moai/src/moaicore/MOAILuaObject.cpp | jjimenezg93/ai-pathfinding | e32ae8be30d3df21c7e64be987134049b585f1e6 | [
"MIT"
] | null | null | null | moai/src/moaicore/MOAILuaObject.cpp | jjimenezg93/ai-pathfinding | e32ae8be30d3df21c7e64be987134049b585f1e6 | [
"MIT"
] | null | null | null | // Copyright (c) 2010-2011 Zipline Games, Inc. All Rights Reserved.
// http://getmoai.com
#include "pch.h"
#include <moaicore/MOAISerializer.h>
//================================================================//
// MOAILuaLocal
//================================================================//
//----------------... | 25.888421 | 146 | 0.55237 | jjimenezg93 |
8f5ef105043718978188f5195a82acc52941c421 | 852 | cpp | C++ | Tests/UnitTests/Exceptions/Exception_Equals0Tests.cpp | SapphireSuite/Logger | c922f1b0899274cc586df66b18572da55f4a3e2a | [
"MIT"
] | null | null | null | Tests/UnitTests/Exceptions/Exception_Equals0Tests.cpp | SapphireSuite/Logger | c922f1b0899274cc586df66b18572da55f4a3e2a | [
"MIT"
] | 1 | 2022-02-08T18:52:56.000Z | 2022-02-08T18:52:56.000Z | Tests/UnitTests/Exceptions/Exception_Equals0Tests.cpp | SapphireSuite/Logger | c922f1b0899274cc586df66b18572da55f4a3e2a | [
"MIT"
] | null | null | null | // Copyright (c) 2022 Sapphire development team. All Rights Reserved.
#include <gtest/gtest.h>
#include <SA/Collections/Debug>
namespace Sa::UT::Exc_Eq
{
TEST(Exception, Equals0_Success)
{
EXPECT_NO_THROW(SA_ASSERT(Equals0, SA/UnitTests/Exception, 0));
}
TEST(Exception, Equals0_Failure)
{
EXPECT_THROW(SA_A... | 23.666667 | 102 | 0.747653 | SapphireSuite |
8f6006f8a40bd5afb7f415d83f2554201319ce74 | 386 | cpp | C++ | AudioSynthesis/AudioNodes/outputnode.cpp | eliasrm87/AudioSynthesisQt | feb05c74d85494300d0fca868a37015042ec74c8 | [
"Unlicense"
] | 1 | 2021-09-03T11:06:45.000Z | 2021-09-03T11:06:45.000Z | AudioSynthesis/AudioNodes/outputnode.cpp | eliasrm87/AudioSynthesisQt | feb05c74d85494300d0fca868a37015042ec74c8 | [
"Unlicense"
] | null | null | null | AudioSynthesis/AudioNodes/outputnode.cpp | eliasrm87/AudioSynthesisQt | feb05c74d85494300d0fca868a37015042ec74c8 | [
"Unlicense"
] | 2 | 2021-09-03T11:06:53.000Z | 2021-09-03T11:07:25.000Z | #include "outputnode.h"
#include <QDebug>
OutputNode::OutputNode(QPoint position, QGraphicsItem * parent) :
Node("Output", position, 1, 0, parent)
{
init();
}
OutputNode::OutputNode(QJsonObject obj, QGraphicsItem *parent) :
Node(obj, 1, 0, parent)
{
init();
}
OutputNode::~OutputNode()
{
}
void Out... | 14.846154 | 65 | 0.660622 | eliasrm87 |
8f6094c07a572b1cc7388b65e4e15611ad47a5f8 | 462 | hpp | C++ | include/img_filters/realsense_filters.hpp | JeremyBYU/img-filter | b95fa9c739ce49455aa4bf70eee7f3fe45c87c07 | [
"MIT"
] | null | null | null | include/img_filters/realsense_filters.hpp | JeremyBYU/img-filter | b95fa9c739ce49455aa4bf70eee7f3fe45c87c07 | [
"MIT"
] | null | null | null | include/img_filters/realsense_filters.hpp | JeremyBYU/img-filter | b95fa9c739ce49455aa4bf70eee7f3fe45c87c07 | [
"MIT"
] | null | null | null | // Copy from RealSense Filters Code
// License: Apache 2.0 - See: https://raw.githubusercontent.com/IntelRealSense/librealsense/master/LICENSE
//
#ifndef IMGFILTERS_RSFILTERS
#define IMGFILTERS_RSFILTERS
#define _USE_MATH_DEFINES
#include "img_filters/rs/spatial_filter.hpp"
#include "img_filters/rs/disparity_transform... | 22 | 106 | 0.790043 | JeremyBYU |
8f63faefee34255c0d990d21bec12117b108e70c | 1,401 | hh | C++ | include/ignition/gazebo/components/PoseCmd.hh | mrushyendra/ign-gazebo | 2f7f33d4fa34657badec81558d5953fe7643769f | [
"ECL-2.0",
"Apache-2.0"
] | 198 | 2020-04-15T16:56:09.000Z | 2022-03-27T12:31:08.000Z | include/ignition/gazebo/components/PoseCmd.hh | mrushyendra/ign-gazebo | 2f7f33d4fa34657badec81558d5953fe7643769f | [
"ECL-2.0",
"Apache-2.0"
] | 1,220 | 2020-04-15T18:10:29.000Z | 2022-03-31T22:37:06.000Z | include/ignition/gazebo/components/PoseCmd.hh | mrushyendra/ign-gazebo | 2f7f33d4fa34657badec81558d5953fe7643769f | [
"ECL-2.0",
"Apache-2.0"
] | 134 | 2020-04-15T16:59:57.000Z | 2022-03-26T08:51:31.000Z | /*
* Copyright (C) 2019 Open Source Robotics Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by appl... | 30.456522 | 75 | 0.771592 | mrushyendra |
8f648315d9881ddb90a551c2cddd9a467cd6cb1e | 1,586 | cpp | C++ | Server/Server/src/core/item/login/login_request.cpp | vahmoh26/Messenger | 3413b2eedbb5ed867928c2dfe17ad2c118712f6e | [
"MIT"
] | null | null | null | Server/Server/src/core/item/login/login_request.cpp | vahmoh26/Messenger | 3413b2eedbb5ed867928c2dfe17ad2c118712f6e | [
"MIT"
] | null | null | null | Server/Server/src/core/item/login/login_request.cpp | vahmoh26/Messenger | 3413b2eedbb5ed867928c2dfe17ad2c118712f6e | [
"MIT"
] | null | null | null | #include "login_request.h"
#include <sstream>
#include <boost/iostreams/stream.hpp>
#include <boost/archive/text_iarchive.hpp>
#include <boost/archive/text_oarchive.hpp>
namespace server::core
{
using namespace boost;
login_request::login_request()
{
_type = type::login;
}
login_request::login_request(const... | 22.027778 | 113 | 0.736444 | vahmoh26 |
8f65d935888de0bde6690743cfca1caabe7bb251 | 1,205 | cpp | C++ | c++/lab3/main.cpp | CodingHelpers/ValerySolomatin | 2b38e78073b52f370ea1c132b5f3fc93b407bfa6 | [
"MIT"
] | null | null | null | c++/lab3/main.cpp | CodingHelpers/ValerySolomatin | 2b38e78073b52f370ea1c132b5f3fc93b407bfa6 | [
"MIT"
] | null | null | null | c++/lab3/main.cpp | CodingHelpers/ValerySolomatin | 2b38e78073b52f370ea1c132b5f3fc93b407bfa6 | [
"MIT"
] | null | null | null | #include "stack.hpp"
#include "queue.hpp"
#include "list.hpp"
using namespace std;
int main() {
Queue q;
Stack s;
// Проверяем работу очереди.
// Первыми должны выйти элементы, которые вошли первыми.
for(int i = 1; i <= 5; i++) {
q.push(i);
cout << i << " -> Queue.push: " << q << e... | 22.735849 | 66 | 0.501245 | CodingHelpers |
8f66decfb377c753b85ae9480fea3e512f15a1d7 | 11,990 | cpp | C++ | src/tutorial/illumination/fragmentattenuation.cpp | ranjak/opengl-tutorial | fff192b9966c9e14d77b4becb9c205ea21a02069 | [
"MIT"
] | 2 | 2018-08-24T00:09:03.000Z | 2019-08-25T23:03:11.000Z | src/tutorial/illumination/fragmentattenuation.cpp | ranjak/opengl-tutorial | fff192b9966c9e14d77b4becb9c205ea21a02069 | [
"MIT"
] | null | null | null | src/tutorial/illumination/fragmentattenuation.cpp | ranjak/opengl-tutorial | fff192b9966c9e14d77b4becb9c205ea21a02069 | [
"MIT"
] | 3 | 2016-12-02T17:22:14.000Z | 2018-05-08T11:34:56.000Z | #include "fragmentattenuation.hpp"
#include "shader.hpp"
#include "transform.hpp"
#include "framework/MousePole.h"
#include <glutil/MatrixStack.h>
#include <glm/mat4x4.hpp>
#include <glm/mat3x3.hpp>
#include <glm/vec4.hpp>
#include <glm/vec3.hpp>
#include <glm/gtc/quaternion.hpp>
#include <glm/gtc/type_ptr.hpp>
#includ... | 35.05848 | 147 | 0.727773 | ranjak |
8f6861999178a5e8589cb9f7ceede95f1a252320 | 489 | hpp | C++ | Client/Client/Jukebox.hpp | EPIKorial/rtype | 12692efb3a577c9737c3fb41bf0ca082f82cb7a5 | [
"MIT"
] | null | null | null | Client/Client/Jukebox.hpp | EPIKorial/rtype | 12692efb3a577c9737c3fb41bf0ca082f82cb7a5 | [
"MIT"
] | null | null | null | Client/Client/Jukebox.hpp | EPIKorial/rtype | 12692efb3a577c9737c3fb41bf0ca082f82cb7a5 | [
"MIT"
] | null | null | null | #pragma once
#ifndef JUKEBOX_HPP_
# define JUKEBOX_HPP_
# include <map>
# include <string>
# include <SFML/Audio.hpp>
class Jukebox
{
static std::map<std::string, sf::SoundBuffer> buffers;
static std::map<std::string, sf::Sound> sounds;
static std::map<std::string, bool> ready;
public:
static void add(const std... | 22.227273 | 71 | 0.709611 | EPIKorial |
8f68eb1c1c3ba4c3139ba40e999afab1ea87e669 | 8,639 | cpp | C++ | code/shared/NvidiaGPUService.cpp | tak2004/RadonFrameworkExample | 4fffa7641b5491099387516db5cb0e4180ed186a | [
"Apache-2.0"
] | null | null | null | code/shared/NvidiaGPUService.cpp | tak2004/RadonFrameworkExample | 4fffa7641b5491099387516db5cb0e4180ed186a | [
"Apache-2.0"
] | null | null | null | code/shared/NvidiaGPUService.cpp | tak2004/RadonFrameworkExample | 4fffa7641b5491099387516db5cb0e4180ed186a | [
"Apache-2.0"
] | null | null | null | #include "RadonFramework/precompiled.hpp"
#include "RadonFramework/Collections/BitArray.hpp"
#include "NvidiaGPUService.hpp"
#include "nvapi.h"
namespace RadonFramework { namespace System { namespace Diagnostics { namespace Profiling {
class NvidiaGPUService::GPUInfo
{
public:
RF_Collect::Array<RF_Type::Float32>... | 36.761702 | 132 | 0.656094 | tak2004 |
8f6d08b1756cb67a05b020bec6ee7cf5a9a88ef8 | 360 | cpp | C++ | Miscellaneous/Random.cpp | SoloGameDevGitHub/AIEngine | c5cbef6373d11b8d9fe00c3d9ba0169c8b444943 | [
"MIT"
] | 1 | 2020-08-11T22:31:57.000Z | 2020-08-11T22:31:57.000Z | Miscellaneous/Random.cpp | SoloGameDevGitHub/AIEngine | c5cbef6373d11b8d9fe00c3d9ba0169c8b444943 | [
"MIT"
] | 3 | 2020-08-03T18:49:50.000Z | 2022-02-08T14:17:37.000Z | Miscellaneous/Random.cpp | SoloGameDevGitHub/AIEngine | c5cbef6373d11b8d9fe00c3d9ba0169c8b444943 | [
"MIT"
] | 3 | 2020-11-16T14:45:55.000Z | 2022-02-17T08:30:13.000Z | #include "Random.h"
void random::initRandomSeed()
{
unsigned int seed = static_cast<unsigned int>(time(NULL));
srand(seed);
}
double random::range(double min, double max)
{
double randomValue = ((double) std::rand()) / (double) RAND_MAX;
double difference = max - min;
double result = randomValue *... | 22.5 | 68 | 0.669444 | SoloGameDevGitHub |
8f6f7233419a08efc7c67d4b41d87aba869644cd | 2,868 | cpp | C++ | src/JobsManager/unused/job_matcher.cpp | pointnity/Scheduler-of-Pointnity-N.1.1.0 | 8824bfb95d80d638ff466535747430bae15c212d | [
"MIT"
] | 1 | 2019-08-15T10:04:31.000Z | 2019-08-15T10:04:31.000Z | src/JobsManager/unused/job_matcher.cpp | pointnity/Scheduler-V0.1- | 8824bfb95d80d638ff466535747430bae15c212d | [
"MIT"
] | null | null | null | src/JobsManager/unused/job_matcher.cpp | pointnity/Scheduler-V0.1- | 8824bfb95d80d638ff466535747430bae15c212d | [
"MIT"
] | null | null | null | #include <log4cplus/logger.h>
#include <log4cplus/loggingmacros.h>
#include <gflags/gflags.h>
#include "common/clynn/timer.h"
#include "common/clynn/rpc.h"
#include "common/classad/classad_complement.h"
#include "JobsManager/job_matcher.h"
#include "proxy/ResourceScheduler/gen-cpp/ResourceScheduler.h"
DECLARE_string(r... | 33.348837 | 127 | 0.639121 | pointnity |
8f74563855ae15451edd92bc545151d97a0c0ae1 | 8,858 | cpp | C++ | Documents/RacimoAire/RacimoAire3/moc_racimo3.cpp | JoseSalamancaCoy/RACIMO_AIRE | 628d6ff184a30af0efd25bff675b0006500d4ba2 | [
"MIT"
] | null | null | null | Documents/RacimoAire/RacimoAire3/moc_racimo3.cpp | JoseSalamancaCoy/RACIMO_AIRE | 628d6ff184a30af0efd25bff675b0006500d4ba2 | [
"MIT"
] | null | null | null | Documents/RacimoAire/RacimoAire3/moc_racimo3.cpp | JoseSalamancaCoy/RACIMO_AIRE | 628d6ff184a30af0efd25bff675b0006500d4ba2 | [
"MIT"
] | null | null | null | /****************************************************************************
** Meta object code from reading C++ file 'racimo3.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.7.1)
**
** WARNING! All changes made in this file will be lost!
*************************************************************... | 39.022026 | 165 | 0.604651 | JoseSalamancaCoy |
8f746fae2937fa209c32bf0d27ad1205417ab037 | 1,594 | cpp | C++ | src/vk/utils.cpp | K1llByte/kazan | 8023d23b305ee8d3ef47c3bbfa0baae1a2685689 | [
"Apache-2.0"
] | null | null | null | src/vk/utils.cpp | K1llByte/kazan | 8023d23b305ee8d3ef47c3bbfa0baae1a2685689 | [
"Apache-2.0"
] | 1 | 2021-12-28T23:50:46.000Z | 2021-12-28T23:50:46.000Z | src/vk/utils.cpp | K1llByte/kazan | 8023d23b305ee8d3ef47c3bbfa0baae1a2685689 | [
"Apache-2.0"
] | null | null | null | #include "vk/utils.hpp"
#include "vk/device.hpp"
namespace kzn::vk
{
VkSemaphore create_semaphore(Device& device)
{
VkSemaphoreCreateInfo semaphore_info{};
semaphore_info.sType = VK_STRUCTURE_TYPE_SEMAPHORE_CREATE_INFO;
VkSemaphore new_semaphore;
auto result = vkCreateSemaphore... | 27.964912 | 102 | 0.626725 | K1llByte |
8f75d25e7dd0c1ea0ed6bf378981fd961009693e | 828 | cpp | C++ | Curso/comandos do cmd.cpp | vandodiniz/CursoC-- | ba979bae23292a59941437dee478f51e7e357abb | [
"MIT"
] | 1 | 2022-03-07T21:40:38.000Z | 2022-03-07T21:40:38.000Z | Curso/comandos do cmd.cpp | vandodiniz/CursoC-- | ba979bae23292a59941437dee478f51e7e357abb | [
"MIT"
] | null | null | null | Curso/comandos do cmd.cpp | vandodiniz/CursoC-- | ba979bae23292a59941437dee478f51e7e357abb | [
"MIT"
] | null | null | null | COMANDOS PRA COMPILAR EM C++ NO PROMPT
cd "caminho" //vai pro caminho inserido
//ex: cd C:\Users\vando\OneDrive\Documentos\UFMG\C++\AULA 21 - FUNÇÃO MAIN\src
cd .. //retrocede um caminho
dir //mostra as pastas e arquivos do caminho atual
cls ... | 46 | 120 | 0.570048 | vandodiniz |
8f78044abf8de91fc595ef2afa177aeef2eebc9f | 7,743 | cpp | C++ | packet-sniffer/PacketSniffer.cpp | vine77/cumotive | 7577cc70377ba789223661a3e5cbda9baf46f862 | [
"MIT"
] | null | null | null | packet-sniffer/PacketSniffer.cpp | vine77/cumotive | 7577cc70377ba789223661a3e5cbda9baf46f862 | [
"MIT"
] | null | null | null | packet-sniffer/PacketSniffer.cpp | vine77/cumotive | 7577cc70377ba789223661a3e5cbda9baf46f862 | [
"MIT"
] | null | null | null | // PacketSniffer.cpp : Defines the class behaviors for the application.
//
#include "stdafx.h"
#include "SnifferEvent.h"
#include "PacketSniffer.h"
#include "MainFrm.h"
#include "PacketSnifferDoc.h"
#include "PacketSnifferView.h"
#include ".\packetsniffer.h"
#include "ConfigDialog.h"
#ifdef _DEBUG
#def... | 36.182243 | 87 | 0.755134 | vine77 |
8f85e35a589d20a9ce210d745663d3b45505c57e | 545 | cpp | C++ | acmicpc.net/10164.cpp | kbu1564/SimpleAlgorithm | 7e5b0d2fe19461417d88de0addd2235da55787d3 | [
"MIT"
] | 4 | 2016-04-15T07:54:39.000Z | 2021-01-11T09:02:16.000Z | acmicpc.net/10164.cpp | kbu1564/SimpleAlgorithm | 7e5b0d2fe19461417d88de0addd2235da55787d3 | [
"MIT"
] | null | null | null | acmicpc.net/10164.cpp | kbu1564/SimpleAlgorithm | 7e5b0d2fe19461417d88de0addd2235da55787d3 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
long long DP[16][16];
int main() {
int N, M, K; cin >> N >> M >> K;
int x = (K-1) % M;
int y = (K-1) / M;
if (K == 0) {
x = M;
y = N;
}
for (int i = 0; i <= y; i++) {
for (int j = 0; j <= x; j++) {
DP[i][j] = (i-1 < 0? 0: DP[i-1][j]) + (j-1 < 0? 0: DP[i][j-1]);
... | 20.961538 | 66 | 0.379817 | kbu1564 |
8f885c190f68b201264fc861933cde90d4e25e94 | 11,268 | cpp | C++ | src/packets/prank.cpp | MikePfunk28/https-github.com-Daizee-spitfireiii | 0556c4ec1ce22c058f0c466173c27d97ff0d0a71 | [
"MIT"
] | 6 | 2015-05-23T12:54:45.000Z | 2020-05-31T23:10:01.000Z | src/packets/prank.cpp | MikePfunk28/https-github.com-Daizee-spitfireiii | 0556c4ec1ce22c058f0c466173c27d97ff0d0a71 | [
"MIT"
] | 2 | 2017-01-22T19:08:50.000Z | 2021-05-28T12:04:00.000Z | src/packets/prank.cpp | MikePfunk28/https-github.com-Daizee-spitfireiii | 0556c4ec1ce22c058f0c466173c27d97ff0d0a71 | [
"MIT"
] | 9 | 2015-05-23T12:46:22.000Z | 2021-07-06T19:16:20.000Z | //
// prank.cpp
// Project Spitfire
//
// Copyright (c) 2014 Daizee (rensiadz at gmail dot com)
//
// This file is part of Spitfire.
//
// 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 wit... | 28.382872 | 110 | 0.639333 | MikePfunk28 |
8f8e510a0d8d5ac8798c85ff83fb6b9585910a40 | 863 | cpp | C++ | Source/private/Objects/SpriteButton.cpp | DmitryFrolov/SDLGame | e03f060d7b51feb33692d9f9763423e0319e9c80 | [
"MIT"
] | 2 | 2019-10-23T11:44:18.000Z | 2021-03-13T08:04:34.000Z | Source/private/Objects/SpriteButton.cpp | DmitryFrolov/SDLGame | e03f060d7b51feb33692d9f9763423e0319e9c80 | [
"MIT"
] | null | null | null | Source/private/Objects/SpriteButton.cpp | DmitryFrolov/SDLGame | e03f060d7b51feb33692d9f9763423e0319e9c80 | [
"MIT"
] | 1 | 2019-04-14T18:43:36.000Z | 2019-04-14T18:43:36.000Z | #include <Objects/SpriteButton.h>
std::shared_ptr<SpriteButton>
SpriteButton::create(const std::string &imgPath, EventHandler &handler,
Button::OnButtonClickCallback callback) {
return std::make_shared<SpriteButton>(imgPath, handler, callback);
}
SpriteButton::SpriteButton(const std::string &... | 34.52 | 106 | 0.704519 | DmitryFrolov |
8f900811d31ab065a77e222bc130dc149ac74fcb | 955 | cpp | C++ | wcics/judge/executors/clang/clang_executor.cpp | CS-Center/CS-Center | 3cd09f29d214406e6618fc67b9faf59a18f3f11b | [
"MIT"
] | null | null | null | wcics/judge/executors/clang/clang_executor.cpp | CS-Center/CS-Center | 3cd09f29d214406e6618fc67b9faf59a18f3f11b | [
"MIT"
] | 6 | 2019-12-06T18:06:28.000Z | 2021-12-01T20:19:05.000Z | wcics/judge/executors/clang/clang_executor.cpp | CS-Center/CS-Center | 3cd09f29d214406e6618fc67b9faf59a18f3f11b | [
"MIT"
] | null | null | null | #include "clang_executor.hpp"
#if defined C_ENABLED && defined CLANG_ENABLED
const char* ClangExecutor::get_ext() { return "c"; }
const char* ClangExecutor::get_compiler() { return CLANG_PATH; }
const char* ClangExecutor::get_compiler_name() { return "clang"; }
int ClangExecutor::make_compiler_args()... | 25.810811 | 87 | 0.658639 | CS-Center |
8f965e62f2eb493ab2f19428dcd4d8bfc8b7a72c | 2,737 | cpp | C++ | week 2/Number_of_occurrence.cpp | arpit456jain/gfg-11-Weeks-Workshop-on-DSA-in-CPP | ed7fd8bc0a581f54ba3a3588dd01013776c4ece6 | [
"MIT"
] | 6 | 2021-08-06T14:36:41.000Z | 2022-03-22T11:22:07.000Z | week 2/Number_of_occurrence.cpp | arpit456jain/11-Weeks-Workshop-on-DSA-in-CPP | ed7fd8bc0a581f54ba3a3588dd01013776c4ece6 | [
"MIT"
] | 1 | 2021-08-09T05:09:48.000Z | 2021-08-09T05:09:48.000Z | week 2/Number_of_occurrence.cpp | arpit456jain/11-Weeks-Workshop-on-DSA-in-CPP | ed7fd8bc0a581f54ba3a3588dd01013776c4ece6 | [
"MIT"
] | 1 | 2021-08-09T14:25:17.000Z | 2021-08-09T14:25:17.000Z | /*
Given a sorted array Arr of size N and a number X, you need to find the number of occurrences of X in Arr.
Example 1:
Input:
N = 7, X = 2
Arr[] = {1, 1, 2, 2, 2, 2, 3}
Output: 4
Explanation: 2 occurs 4 times in the
given array.
1
7 2
1 1 2 2 2 2 3
*/
#include<bits/stdc++.h>
using namespace std;
// } Driver Co... | 24.008772 | 107 | 0.48776 | arpit456jain |
8f9747adf0a759d99d541d2dacc76b046eb403e0 | 875 | cpp | C++ | codes/Chapter-04/ObjectPointer.cpp | muyuuuu/Cpp-Notes | a514559eb4258304768167ea26de1e54f4a792d4 | [
"MIT"
] | 1 | 2022-03-25T06:07:27.000Z | 2022-03-25T06:07:27.000Z | codes/Chapter-04/ObjectPointer.cpp | muyuuuu/Cpp-Notes | a514559eb4258304768167ea26de1e54f4a792d4 | [
"MIT"
] | null | null | null | codes/Chapter-04/ObjectPointer.cpp | muyuuuu/Cpp-Notes | a514559eb4258304768167ea26de1e54f4a792d4 | [
"MIT"
] | 1 | 2021-09-24T07:28:17.000Z | 2021-09-24T07:28:17.000Z | #include <iostream>
using std::cout;
using std::endl;
class Circle
{
private:
double radius = 1.3;
public:
Circle();
Circle(double r);
double getArea();
};
Circle::Circle(){
}
Circle::Circle(double r){
radius = r;
}
double Circle::getArea(){
return (3.14 * radius * radius);
}
int main(){
... | 16.203704 | 60 | 0.502857 | muyuuuu |
8fa09154622068224cfd680eae903ba61808dcb3 | 4,843 | cpp | C++ | src/xray/sound/sources/ogg_source_cooker.cpp | ixray-team/ixray-2.0 | 85c3a544175842323fc82f42efd96c66f0fc5abb | [
"Linux-OpenIB"
] | 3 | 2021-10-30T09:36:14.000Z | 2022-03-26T17:00:06.000Z | src/xray/sound/sources/ogg_source_cooker.cpp | acidicMercury8/ixray-2.0 | 85c3a544175842323fc82f42efd96c66f0fc5abb | [
"Linux-OpenIB"
] | null | null | null | src/xray/sound/sources/ogg_source_cooker.cpp | acidicMercury8/ixray-2.0 | 85c3a544175842323fc82f42efd96c66f0fc5abb | [
"Linux-OpenIB"
] | 1 | 2022-03-26T17:00:08.000Z | 2022-03-26T17:00:08.000Z | ////////////////////////////////////////////////////////////////////////////
// Created : 23.04.2010
// Author : Andrew Kolomiets
// Copyright (C) GSC Game World - 2010
////////////////////////////////////////////////////////////////////////////
#include "pch.h"
#include "ogg_source_cooker.h"
#include "ogg_u... | 34.841727 | 133 | 0.691926 | ixray-team |
8fa13d4ecb9bf91d2530cd2bd58984c019b2dac8 | 2,593 | cpp | C++ | array3d.cpp | ArnoGranier/cppCNN | 9573e01eb71a8fdbb6a62812ef02ce0641055277 | [
"MIT"
] | 8 | 2020-01-23T08:26:22.000Z | 2022-02-22T22:50:17.000Z | array3d.cpp | ArnoGranier/cppCNN | 9573e01eb71a8fdbb6a62812ef02ce0641055277 | [
"MIT"
] | 1 | 2021-04-11T02:03:48.000Z | 2021-04-11T02:05:15.000Z | array3d.cpp | ArnoGranier/cppCNN | 9573e01eb71a8fdbb6a62812ef02ce0641055277 | [
"MIT"
] | null | null | null | #include "array3d.hpp"
namespace cppcnn{
Array3d::Array3d(uint rows, uint cols, uint h)
{
height=rows;
width=cols;
depth=h;
}
void Array3d::fill_with_zeros(){
uint size = height * width * depth;
values.reserve(size);
for (uint it=0;it<size;it++){
values.push_back(0);
};
}
void ... | 25.174757 | 79 | 0.564597 | ArnoGranier |
8fa1dcf1eb613d5896bc945214bea34411fdb420 | 8,947 | cpp | C++ | SillyTech3D/src/GUI/editor_gui.cpp | mlavik1/SillyTech-Temporary | 82b26f428d6f6a270adb162dbc47815c1d2baf95 | [
"MIT"
] | null | null | null | SillyTech3D/src/GUI/editor_gui.cpp | mlavik1/SillyTech-Temporary | 82b26f428d6f6a270adb162dbc47815c1d2baf95 | [
"MIT"
] | null | null | null | SillyTech3D/src/GUI/editor_gui.cpp | mlavik1/SillyTech-Temporary | 82b26f428d6f6a270adb162dbc47815c1d2baf95 | [
"MIT"
] | null | null | null | #include "editor_gui.h"
#include "input_manager.h"
#include "graphics_feature.h"
#include "viewport.h"
#include "script_helper.h"
#include "mesh_render_manager.h"
#include "physics_component.h"
#include "component.h"
#include "actor_manager.h"
#include "lua_script_manager.h"
#include "camera_component.h"
#include "tim... | 33.635338 | 171 | 0.747848 | mlavik1 |
8faa579bfe3f2f0b563a3ec88467b8e40da40d77 | 1,326 | cpp | C++ | Bangladesh Match Celebration Contest - 1/c.cpp | anirudha-ani/NSU-Problem-Solver | 2f6312fe5823c0352358f5db654dd0e1a619ce75 | [
"Apache-2.0"
] | null | null | null | Bangladesh Match Celebration Contest - 1/c.cpp | anirudha-ani/NSU-Problem-Solver | 2f6312fe5823c0352358f5db654dd0e1a619ce75 | [
"Apache-2.0"
] | null | null | null | Bangladesh Match Celebration Contest - 1/c.cpp | anirudha-ani/NSU-Problem-Solver | 2f6312fe5823c0352358f5db654dd0e1a619ce75 | [
"Apache-2.0"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a , b;
long long int power_two[34];
power_two[0] = 1;
for(int i = 1 ; i < 34 ; i++)
{
power_two[i] = power_two[i-1] * 2 ;
//cout << power_two[i] << endl;
}
long long int counter ;
int i = ... | 25.5 | 64 | 0.373303 | anirudha-ani |
263695923ae964db1a42082c4583cf67a8922586 | 2,414 | cpp | C++ | PG/internal/graphics/SFMLScene.cpp | mcdreamer/PG | a047615d9eae7f2229a203a262f239106cf7f39c | [
"MIT"
] | 2 | 2018-01-14T17:47:22.000Z | 2021-11-15T10:34:24.000Z | PG/internal/graphics/SFMLScene.cpp | mcdreamer/PG | a047615d9eae7f2229a203a262f239106cf7f39c | [
"MIT"
] | 23 | 2017-07-31T19:43:00.000Z | 2018-11-11T18:51:28.000Z | PG/internal/graphics/SFMLScene.cpp | mcdreamer/PG | a047615d9eae7f2229a203a262f239106cf7f39c | [
"MIT"
] | null | null | null | #include "PG/internal/graphics/SFMLScene.h"
#include "PG/app/AppHostServices.h"
#include "PG/graphics/NodeCreator.h"
#include "PG/animation/AnimationUpdater.h"
#include "PG/ui/UI.h"
namespace PG {
//--------------------------------------------------------
ScenePtr SceneCreator::createScene(SceneControllerPtr& control... | 24.632653 | 68 | 0.553438 | mcdreamer |
2639d6451976d200ed8e7fd0695eeec981d93a4d | 2,766 | cpp | C++ | test/test.cpp | divinity76/phpcpp | c971e440a6e51233a0cd8c678b647bdc218070c3 | [
"Unlicense"
] | 2 | 2019-03-10T04:41:10.000Z | 2019-05-26T04:05:19.000Z | test/test.cpp | divinity76/phpcpp | c971e440a6e51233a0cd8c678b647bdc218070c3 | [
"Unlicense"
] | 9 | 2019-05-26T15:12:18.000Z | 2020-10-09T20:43:50.000Z | test/test.cpp | divinity76/phpcpp | c971e440a6e51233a0cd8c678b647bdc218070c3 | [
"Unlicense"
] | 1 | 2019-03-10T04:41:15.000Z | 2019-03-10T04:41:15.000Z | #include <stdio.h>
#include <stdexcept>
#include <iostream>
#include <unistd.h>
namespace php
{
#ifdef __linux__
// execute a sysem() command and return the output as string
#include <stdio.h>
#include <stdexcept>
#include <iostream>
#include <unistd.h>
std::string shell_exec(const std::string &cmd, int &retur... | 35.461538 | 137 | 0.59436 | divinity76 |
263b4ed03e47f6020a698e3b89fa81328b1b3392 | 7,511 | hpp | C++ | include/oddlib/anim.hpp | mouzedrift/alive | 7c297a39c60e930933c0a93ea373226907f8b1c7 | [
"MIT"
] | 131 | 2015-03-21T14:10:21.000Z | 2021-01-19T03:54:04.000Z | include/oddlib/anim.hpp | mouzedrift/alive | 7c297a39c60e930933c0a93ea373226907f8b1c7 | [
"MIT"
] | 51 | 2015-04-06T17:24:45.000Z | 2018-02-03T14:36:37.000Z | include/oddlib/anim.hpp | mouzedrift/alive | 7c297a39c60e930933c0a93ea373226907f8b1c7 | [
"MIT"
] | 17 | 2015-10-07T10:20:47.000Z | 2021-08-02T04:14:11.000Z | #pragma once
#include <vector>
#include <memory>
#include <set>
#include <map>
#include "SDL.h"
#include "sdl_raii.hpp"
#include <string>
#include "types.hpp"
namespace Oddlib
{
class LvlArchive;
class IStream;
/*
* Typical animation file structure :
* ResHeader
* Offset to table of AnimSets
... | 30.53252 | 152 | 0.593929 | mouzedrift |
263e497c7fdc7dc6984dda46ce8303976059671c | 397 | cc | C++ | sample_addon/7_factory_wrap/node_0.12/addon.cc | Cereceres/SVD- | bac3b8cce5b958aaccc1081ec60ecc5c81b3b2f9 | [
"MIT"
] | 24 | 2018-11-20T14:45:57.000Z | 2021-12-30T13:38:42.000Z | sample_addon/7_factory_wrap/node_0.12/addon.cc | Cereceres/SVD | bac3b8cce5b958aaccc1081ec60ecc5c81b3b2f9 | [
"MIT"
] | null | null | null | sample_addon/7_factory_wrap/node_0.12/addon.cc | Cereceres/SVD | bac3b8cce5b958aaccc1081ec60ecc5c81b3b2f9 | [
"MIT"
] | 11 | 2018-11-29T00:09:14.000Z | 2021-11-23T08:13:17.000Z | #include <node.h>
#include "myobject.h"
using namespace v8;
void CreateObject(const FunctionCallbackInfo<Value>& args) {
Isolate* isolate = Isolate::GetCurrent();
HandleScope scope(isolate);
MyObject::NewInstance(args);
}
void InitAll(Handle<Object> exports, Handle<Object> module) {
MyObject::Init();
NODE... | 20.894737 | 61 | 0.740554 | Cereceres |
2641c6d901ba961a25848a5cb174393075b761cd | 4,651 | cpp | C++ | src/model/AdminMatchingData.cpp | testillano/h2agent | 637896e57dd27feebbbd69b5422178bf6ce9c69d | [
"MIT"
] | 15 | 2021-06-21T17:01:08.000Z | 2022-03-07T09:57:01.000Z | src/model/AdminMatchingData.cpp | testillano/h2agent | 637896e57dd27feebbbd69b5422178bf6ce9c69d | [
"MIT"
] | 11 | 2021-06-14T00:03:21.000Z | 2022-03-31T20:52:39.000Z | src/model/AdminMatchingData.cpp | testillano/h2agent | 637896e57dd27feebbbd69b5422178bf6ce9c69d | [
"MIT"
] | null | null | null | /*
___________________________________________
| _ ___ _ |
| | | |__ \ | | |
| | |__ ) |__ _ __ _ ___ _ __ | |_ |
| | '_ \ / // _` |/ _` |/ _ \ '_ \| __| | HTTP/2 AGENT FOR MOCK TESTING
| | | | |/ /| (_| | (_| | __/ | | | |_ | Version 0.... | 33.702899 | 121 | 0.638142 | testillano |
2644a456308ca30206b04f20b7d45c9f574ec542 | 8,495 | cc | C++ | src/orbit/RFCavities/wrap_Frequency_Cav.cc | LeoRya/py-orbit | 340b14b6fd041ed8ec2cc25b0821b85742aabe0c | [
"MIT"
] | 17 | 2018-02-09T23:39:06.000Z | 2022-03-04T16:27:04.000Z | src/orbit/RFCavities/wrap_Frequency_Cav.cc | LeoRya/py-orbit | 340b14b6fd041ed8ec2cc25b0821b85742aabe0c | [
"MIT"
] | 22 | 2017-05-31T19:40:14.000Z | 2021-09-24T22:07:47.000Z | src/orbit/RFCavities/wrap_Frequency_Cav.cc | LeoRya/py-orbit | 340b14b6fd041ed8ec2cc25b0821b85742aabe0c | [
"MIT"
] | 37 | 2016-12-08T19:39:35.000Z | 2022-02-11T19:59:34.000Z | #include "orbit_mpi.hh"
#include "pyORBIT_Object.hh"
#include "wrap_Frequency_Cav.hh"
#include "wrap_bunch.hh"
#include <iostream>
#include "Frequency_Cav.hh"
using namespace OrbitUtils;
namespace wrap_rfcavities
{
#ifdef __cplusplus
extern "C"
{
#endif
//---------------------------------------------------------... | 30.448029 | 130 | 0.610594 | LeoRya |
264f9424412c435f79d87ec22db24c2c5ccaef71 | 955 | cpp | C++ | nudg++/trunk/Src/Codes2D/Filter2D.cpp | Notargets/nodal-dg | 1866dbdfeeff34b7586e70d308dbfe42a2b59844 | [
"MIT"
] | 93 | 2015-01-26T17:48:24.000Z | 2022-03-16T10:26:07.000Z | nudg++/trunk/Src/Codes2D/Filter2D.cpp | Notargets/nodal-dg | 1866dbdfeeff34b7586e70d308dbfe42a2b59844 | [
"MIT"
] | 4 | 2016-01-27T02:45:40.000Z | 2021-11-26T11:50:08.000Z | nudg++/trunk/Src/Codes2D/Filter2D.cpp | Notargets/nodal-dg | 1866dbdfeeff34b7586e70d308dbfe42a2b59844 | [
"MIT"
] | 80 | 2015-04-03T18:44:50.000Z | 2022-03-30T19:25:22.000Z | // Filter2D.m
// function [F] = Filter2D(Norder,Nc,sp)
// 2007/07/07
//---------------------------------------------------------
#include "NDGLib_headers.h"
#include "NDG2D.h"
//---------------------------------------------------------
DMat& NDG2D::Filter2D(int Norder, int Nc, double sp)
//----------------------------... | 28.088235 | 89 | 0.475393 | Notargets |
2650ec660c8aabb28e33e9bb96ee2502a05d166f | 1,057 | cpp | C++ | c++/ransom_note.cpp | SongZhao/leetcode | 4a2b4f554e91f6a2167b336f8a69b80fa9f3f920 | [
"Apache-2.0"
] | null | null | null | c++/ransom_note.cpp | SongZhao/leetcode | 4a2b4f554e91f6a2167b336f8a69b80fa9f3f920 | [
"Apache-2.0"
] | null | null | null | c++/ransom_note.cpp | SongZhao/leetcode | 4a2b4f554e91f6a2167b336f8a69b80fa9f3f920 | [
"Apache-2.0"
] | null | null | null | /*
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false.
Each letter in the magazine string can only be used once in your ransom note.
Note:
... | 24.022727 | 230 | 0.607379 | SongZhao |
265361a26fe1f4f04d6cee5f26ebd9aae03f85e4 | 2,241 | cpp | C++ | LStgEngine/move/LPathNodes.cpp | darknesswind/LiteSTG | ec24641948369e6ee1a3bdcc0d6b78515f1a0374 | [
"MIT"
] | 2 | 2015-09-11T08:17:20.000Z | 2018-03-13T07:21:15.000Z | LStgEngine/move/LPathNodes.cpp | darknesswind/LiteSTG | ec24641948369e6ee1a3bdcc0d6b78515f1a0374 | [
"MIT"
] | null | null | null | LStgEngine/move/LPathNodes.cpp | darknesswind/LiteSTG | ec24641948369e6ee1a3bdcc0d6b78515f1a0374 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "LPathNodes.h"
LPathNodes::LPathNodes()
: m_id(0)
{
}
LPathNodes::~LPathNodes()
{
clear();
}
LPathNode* LPathNodes::AddEmptyNode(uint frames)
{
LPathNode* pNode = new LPathNode(frames);
m_nodes.push_back(pNode);
return pNode;
}
LLinePathNode* LPathNodes::AddLineNode(const Vector2... | 20.559633 | 95 | 0.636323 | darknesswind |
2653bbcb717dbbe08a07a58def0ed4c459589def | 451 | hpp | C++ | SourceCode/DataStructure/n-ary-tree.hpp | CainHsu/ProgramStudy-leetcode | 23653e8927902aed64ba13a23a1d6c983b7ea5d5 | [
"Apache-2.0"
] | 1 | 2019-12-08T06:21:57.000Z | 2019-12-08T06:21:57.000Z | SourceCode/DataStructure/n-ary-tree.hpp | CainHsu/ProgramStudy-leetcode | 23653e8927902aed64ba13a23a1d6c983b7ea5d5 | [
"Apache-2.0"
] | null | null | null | SourceCode/DataStructure/n-ary-tree.hpp | CainHsu/ProgramStudy-leetcode | 23653e8927902aed64ba13a23a1d6c983b7ea5d5 | [
"Apache-2.0"
] | null | null | null | //
// Created by xuche on 2020/8/17.
//
#ifndef PROGRAMSTUDY_LEETCODE_N_ARY_TREE_HPP
#define PROGRAMSTUDY_LEETCODE_N_ARY_TREE_HPP
#include <vector>
using namespace std;
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, ve... | 15.033333 | 45 | 0.649667 | CainHsu |
265b8ba44717fefc9c6da90bab7ea6f4e4a3cd47 | 4,261 | cpp | C++ | Source/CrossSectionProfileDefinition.cpp | atanub/CivilRoadDesignUtilArx | e863ddb47aa2639cdee4f8550c724370380962d4 | [
"MIT"
] | 6 | 2019-03-17T09:52:25.000Z | 2021-08-21T03:21:22.000Z | Source/CrossSectionProfileDefinition.cpp | atanub/CivilRoadDesignUtilArx | e863ddb47aa2639cdee4f8550c724370380962d4 | [
"MIT"
] | null | null | null | Source/CrossSectionProfileDefinition.cpp | atanub/CivilRoadDesignUtilArx | e863ddb47aa2639cdee4f8550c724370380962d4 | [
"MIT"
] | 4 | 2019-10-26T16:35:44.000Z | 2021-09-04T03:10:18.000Z | //PLineDataExtractor.CPP
//
#include "StdAfx.h"
#include <Math.h>
#include "CrossSectionProfileDefinition.h"
#include "DrawUtil.h"
#include "Util.h"
#include "DbObjectEx.h"
#include "EntitySelector.h"
//
//CCrossSectionProfileDefinition
////////////////////////////////////////////////////////////////////////////////... | 27.314103 | 152 | 0.691152 | atanub |
2670716a28826a9de4251d455f25ff578e184fe0 | 1,234 | hpp | C++ | lib/visfd/alloc2d.hpp | jewettaij/visfd | 0c4fcdf9215b76e9cc9f3d2d9def5e50ebe86a93 | [
"MIT"
] | 7 | 2019-06-26T04:32:53.000Z | 2022-03-30T07:12:40.000Z | lib/visfd/alloc2d.hpp | jewettaij/visfd | 0c4fcdf9215b76e9cc9f3d2d9def5e50ebe86a93 | [
"MIT"
] | 14 | 2019-03-02T00:41:53.000Z | 2022-03-18T04:20:12.000Z | lib/visfd/alloc2d.hpp | jewettaij/visfd | 0c4fcdf9215b76e9cc9f3d2d9def5e50ebe86a93 | [
"MIT"
] | 1 | 2022-02-16T13:50:42.000Z | 2022-02-16T13:50:42.000Z | /// @file alloc2d.hpp
/// @brief functions that allocate and deallocate 2D arrays
/// @author Andrew Jewett
/// @date 2021-7-13
#ifndef _ALLOC2D_HPP
#define _ALLOC2D_HPP
namespace visfd {
/// @brief A function for allocating C-style 2-dimensional arrays of data
/// (contiguous in memory, in r... | 22.851852 | 76 | 0.636143 | jewettaij |
2674fa25bc9921315d7ae4b58680d3929f3940df | 2,344 | cpp | C++ | src/engine/unit/engine_Vehicle.cpp | psettle/madmax | 74870137ae8c7c8664c5e128c1ecfedc7532041b | [
"MIT"
] | null | null | null | src/engine/unit/engine_Vehicle.cpp | psettle/madmax | 74870137ae8c7c8664c5e128c1ecfedc7532041b | [
"MIT"
] | null | null | null | src/engine/unit/engine_Vehicle.cpp | psettle/madmax | 74870137ae8c7c8664c5e128c1ecfedc7532041b | [
"MIT"
] | null | null | null | /**
* Vehicle unit base class
*/
#include "engine_Vehicle.hpp"
namespace engine {
static double kImpulseCoeff = 0.5;
static double kMinImpulse = 30.0;
void Vehicle::Thrust(Vector const& target, double power) {
double distance = Vector::Distance(position(), target);
if (std::abs(distance) <= kEpsi... | 26.636364 | 94 | 0.614334 | psettle |
26808d4a74cae66868e79ecd764d417295268fdd | 3,338 | cpp | C++ | tc 160+/Distincter.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 3 | 2015-05-25T06:24:37.000Z | 2016-09-10T07:58:00.000Z | tc 160+/Distincter.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | null | null | null | tc 160+/Distincter.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 5 | 2015-05-25T06:24:40.000Z | 2021-08-19T19:22:29.000Z | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int best[50][51][1200];
vector<int> a;
int n;
inline int mymin(int a, int b) {
return a<b ? a:b;
}
inline int myabs(int x) {
return x<0 ? -x:x;... | 43.921053 | 317 | 0.565608 | ibudiselic |
268c1f3db572f8229d5ecf6a077dee24278017ba | 1,494 | hpp | C++ | original_fixed/src/config.hpp | four-spins/dissertation | 6a61b6d5b133c8839b7aa740784472c2beb5912e | [
"MIT"
] | null | null | null | original_fixed/src/config.hpp | four-spins/dissertation | 6a61b6d5b133c8839b7aa740784472c2beb5912e | [
"MIT"
] | null | null | null | original_fixed/src/config.hpp | four-spins/dissertation | 6a61b6d5b133c8839b7aa740784472c2beb5912e | [
"MIT"
] | null | null | null | /******************************************************************************
*
* @file: config.hpp
*
* @date: 03/01/2013 04:32:52 PM (CET)
*
* @author: Marco Müller <muelma@gmail.com>
*
******************************************************************************/
# ifndef CONFIG_HPP
# define CONFIG_HPP
... | 36.439024 | 94 | 0.624498 | four-spins |
268e654e4b18c147dcf3b00480980d5300b3d12b | 1,401 | cpp | C++ | GFG/DSA BASIC/2 - Arrays/who_has_the_majority.cpp | IamBikramPurkait/My-CP-Journey | bbb7fc533b8bcf79367e3f38f4a04de075b43d64 | [
"MIT"
] | 1 | 2021-04-24T03:39:50.000Z | 2021-04-24T03:39:50.000Z | GFG/DSA BASIC/2 - Arrays/who_has_the_majority.cpp | IamBikramPurkait/My-CP-Journey | bbb7fc533b8bcf79367e3f38f4a04de075b43d64 | [
"MIT"
] | null | null | null | GFG/DSA BASIC/2 - Arrays/who_has_the_majority.cpp | IamBikramPurkait/My-CP-Journey | bbb7fc533b8bcf79367e3f38f4a04de075b43d64 | [
"MIT"
] | null | null | null | // { Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution
{
public:
// Function to find element with more appearances between two elements in an
// array.
int majorityWins(int arr[], int n, int ... | 24.155172 | 80 | 0.48965 | IamBikramPurkait |
268fc46c2e3c0113ec1eef01eb016b20d6e268b9 | 46,777 | cpp | C++ | contrib/groff/src/preproc/refer/label.cpp | ivadasz/DragonFlyBSD | 460227f342554313be3c7728ff679dd4a556cce9 | [
"BSD-3-Clause"
] | 3 | 2017-03-06T14:12:57.000Z | 2019-11-23T09:35:10.000Z | contrib/groff/src/preproc/refer/label.cpp | jorisgio/DragonFlyBSD | d37cc9027d161f3e36bf2667d32f41f87606b2ac | [
"BSD-3-Clause"
] | null | null | null | contrib/groff/src/preproc/refer/label.cpp | jorisgio/DragonFlyBSD | d37cc9027d161f3e36bf2667d32f41f87606b2ac | [
"BSD-3-Clause"
] | null | null | null | #ifndef lint
static const char yysccsid[] = "@(#)yaccpar 1.9 (Berkeley) 02/21/93";
#endif
#include <stdlib.h>
#include <string.h>
#define YYBYACC 1
#define YYMAJOR 1
#define YYMINOR 9
#define YYPATCH 20081224
#define YYEMPTY (-1)
#define yyclearin (yychar = YYEMPTY)
#define yyerrok (yyerrflag = 0)... | 27.515882 | 104 | 0.541249 | ivadasz |
269cf5425a9f4b6c3f7e4f7897da1390f9092e06 | 2,108 | cpp | C++ | test/float.cpp | PragmaTwice/protopuf | c48b7377afdca76c6a7582cc8097c81e0941d110 | [
"Apache-2.0"
] | 59 | 2020-10-22T15:57:36.000Z | 2022-03-28T13:42:10.000Z | test/float.cpp | PragmaTwice/protopuf | c48b7377afdca76c6a7582cc8097c81e0941d110 | [
"Apache-2.0"
] | 15 | 2020-10-24T12:52:25.000Z | 2021-06-24T04:53:15.000Z | test/float.cpp | PragmaTwice/protopuf | c48b7377afdca76c6a7582cc8097c81e0941d110 | [
"Apache-2.0"
] | 7 | 2020-11-09T03:24:11.000Z | 2022-03-28T13:42:29.000Z | // Copyright 2020-2021 PragmaTwice
//
// 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... | 31 | 77 | 0.64611 | PragmaTwice |
269f7513e3b61cb4fe44387b493047b6df599363 | 1,805 | cxx | C++ | cmake-3.15.2/Source/cmTargetLinkDirectoriesCommand.cxx | GavinMilbank/Engine | aa005334bd6640c78d97106a19ec3b1022cc9a62 | [
"BSD-3-Clause"
] | null | null | null | cmake-3.15.2/Source/cmTargetLinkDirectoriesCommand.cxx | GavinMilbank/Engine | aa005334bd6640c78d97106a19ec3b1022cc9a62 | [
"BSD-3-Clause"
] | null | null | null | cmake-3.15.2/Source/cmTargetLinkDirectoriesCommand.cxx | GavinMilbank/Engine | aa005334bd6640c78d97106a19ec3b1022cc9a62 | [
"BSD-3-Clause"
] | null | null | null | /* Distributed under the OSI-approved BSD 3-Clause License. See accompanying
file Copyright.txt or https://cmake.org/licensing for details. */
#include "cmTargetLinkDirectoriesCommand.h"
#include <sstream>
#include "cmAlgorithms.h"
#include "cmGeneratorExpression.h"
#include "cmListFileCache.h"
#include "cmMakef... | 29.112903 | 77 | 0.730194 | GavinMilbank |
269f87f9d40931a43912d5cc4d6c7cf133af21dd | 241 | cpp | C++ | Rigel/legacy/rggraphics/source/rg_texture.cpp | soyemi/ProjRigel | 9de5ca1ef4098a62d0c878d52112b1e8495daa86 | [
"BSD-3-Clause"
] | 3 | 2017-09-19T14:45:56.000Z | 2017-09-26T14:02:29.000Z | Rigel/legacy/rggraphics/source/rg_texture.cpp | soyemi/ProjRigel | 9de5ca1ef4098a62d0c878d52112b1e8495daa86 | [
"BSD-3-Clause"
] | null | null | null | Rigel/legacy/rggraphics/source/rg_texture.cpp | soyemi/ProjRigel | 9de5ca1ef4098a62d0c878d52112b1e8495daa86 | [
"BSD-3-Clause"
] | null | null | null | #include "rggraphics.h"
#include "rg_texture.h"
void rg::RgTexture::Release()
{
}
void rg::RgTexture::SetRawData(void * data, unsigned int length)
{
}
void rg::RgTexture::SetData(RgRenderContext * renderctx, void * data, size_t size)
{
}
| 16.066667 | 82 | 0.713693 | soyemi |
26a54167c4fd9b56a03204a4c57b833945f8d6c4 | 686 | cpp | C++ | src/planner/operator/logical_aggregate.cpp | mweisgut/duckdb | 4cff1d7957ce895dd9984a87aa20aef67f5986e6 | [
"MIT"
] | 1 | 2019-08-01T08:21:33.000Z | 2019-08-01T08:21:33.000Z | src/planner/operator/logical_aggregate.cpp | mweisgut/duckdb | 4cff1d7957ce895dd9984a87aa20aef67f5986e6 | [
"MIT"
] | null | null | null | src/planner/operator/logical_aggregate.cpp | mweisgut/duckdb | 4cff1d7957ce895dd9984a87aa20aef67f5986e6 | [
"MIT"
] | 1 | 2019-09-06T09:58:14.000Z | 2019-09-06T09:58:14.000Z | #include "planner/operator/logical_aggregate.hpp"
using namespace duckdb;
using namespace std;
void LogicalAggregate::ResolveTypes() {
for (auto &expr : groups) {
types.push_back(expr->return_type);
}
// get the chunk types from the projection list
for (auto &expr : expressions) {
types.push_back(expr->return... | 21.4375 | 51 | 0.644315 | mweisgut |
26a5ef93c97e75136becdcdf68a033227d7ed0cd | 3,839 | cpp | C++ | client_project/build/jsb-default/frameworks/cocos2d-x/cocos/renderer/renderer/InputAssembler.cpp | pertgame/battleframe | ffba8a7b4f7f45f1eed2c56060d9a2205fb1fdc9 | [
"MIT"
] | 1 | 2020-10-28T15:19:15.000Z | 2020-10-28T15:19:15.000Z | client_project/build/jsb-default/frameworks/cocos2d-x/cocos/renderer/renderer/InputAssembler.cpp | pertgame/battleframe | ffba8a7b4f7f45f1eed2c56060d9a2205fb1fdc9 | [
"MIT"
] | null | null | null | client_project/build/jsb-default/frameworks/cocos2d-x/cocos/renderer/renderer/InputAssembler.cpp | pertgame/battleframe | ffba8a7b4f7f45f1eed2c56060d9a2205fb1fdc9 | [
"MIT"
] | 1 | 2020-10-28T15:19:40.000Z | 2020-10-28T15:19:40.000Z | /****************************************************************************
Copyright (c) 2018 Xiamen Yaji Software Co., Ltd.
http://www.cocos2d-x.org
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 t... | 26.475862 | 78 | 0.685074 | pertgame |
26a784a1907a0e495c90df84c267c2b7e1f04c1f | 227 | cpp | C++ | lib/soci/src/core/rowid.cpp | viichain/vii-core | 2e5b794fb71e1385a2b5bc96920b5a69d4d8560f | [
"Apache-2.0",
"BSD-2-Clause",
"MIT",
"ECL-2.0",
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | lib/soci/src/core/rowid.cpp | viichain/vii-core | 2e5b794fb71e1385a2b5bc96920b5a69d4d8560f | [
"Apache-2.0",
"BSD-2-Clause",
"MIT",
"ECL-2.0",
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | lib/soci/src/core/rowid.cpp | viichain/vii-core | 2e5b794fb71e1385a2b5bc96920b5a69d4d8560f | [
"Apache-2.0",
"BSD-2-Clause",
"MIT",
"ECL-2.0",
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null |
#define SOCI_SOURCE
#include "rowid.h"
#include "session.h"
using namespace soci;
using namespace soci::details;
rowid::rowid(session & s)
{
backEnd_ = s.make_rowid_backend();
}
rowid::~rowid()
{
delete backEnd_;
}
| 12.611111 | 38 | 0.69163 | viichain |
26aac0bd61685b25cc2dfceb48334980cf0bed25 | 715 | cpp | C++ | Math/Matrices/Determinant.cpp | PauliusGasiukevicius/Algorithms-and-Data-Structures | 11d8e47f8db6a744e4e50065e8fe0c44ca4f0ea2 | [
"MIT"
] | 2 | 2017-11-23T09:36:10.000Z | 2018-08-01T12:10:45.000Z | Math/Matrices/Determinant.cpp | PauliusGasiukevicius/Algorithms-and-Data-Structures | 11d8e47f8db6a744e4e50065e8fe0c44ca4f0ea2 | [
"MIT"
] | null | null | null | Math/Matrices/Determinant.cpp | PauliusGasiukevicius/Algorithms-and-Data-Structures | 11d8e47f8db6a744e4e50065e8fe0c44ca4f0ea2 | [
"MIT"
] | 2 | 2018-08-01T12:11:15.000Z | 2018-12-21T07:43:09.000Z | const ld EPS = 1e-9;
const ld INF = 1e18;
ld Determinant(vector<vector<ld>>&a)
{
int n = a.size();
ld det = 1;
for (int i=0; i<n; ++i) {
int k = i;
for (int j=i+1; j<n; ++j)
if (abs (a[j][i]) > abs (a[k][i]))
k = j;
if (abs (a[k][i]) < EPS) {
... | 23.064516 | 49 | 0.321678 | PauliusGasiukevicius |
26b2da614ac632d12b39c009aecd121993cd26c2 | 964 | cpp | C++ | qt/LogWidget.cpp | ma16/monte | 44cc21f23491eb4c5fad1d6926a1a79a6e0d1ed6 | [
"BSD-2-Clause"
] | null | null | null | qt/LogWidget.cpp | ma16/monte | 44cc21f23491eb4c5fad1d6926a1a79a6e0d1ed6 | [
"BSD-2-Clause"
] | null | null | null | qt/LogWidget.cpp | ma16/monte | 44cc21f23491eb4c5fad1d6926a1a79a6e0d1ed6 | [
"BSD-2-Clause"
] | null | null | null | // BSD 2-Clause License, see github.com/ma16/monte
#include "LogWidget.h"
#include <cassert>
#include <ctime>
void LogWidget::init()
{
this->ui = new Ui::LogWidget ;
this->ui->setupUi(this) ;
this->ui->text->setReadOnly(true) ;
this->connect(this->ui->clear,&QPushButton::clicked,
this->ui->text, ... | 22.418605 | 67 | 0.624481 | ma16 |
26b318281d148314420bf349f41c04fa3a6434d2 | 4,131 | hpp | C++ | lumino/Graphics/src/RHI/Backend/OpenGL/GLTextures.hpp | lriki/Lumino | 1a80430f4a83dbdfbe965b3d5b16064991b3edb0 | [
"MIT"
] | 30 | 2016-01-24T05:35:45.000Z | 2020-03-03T09:54:27.000Z | lumino/Graphics/src/RHI/Backend/OpenGL/GLTextures.hpp | lriki/Lumino | 1a80430f4a83dbdfbe965b3d5b16064991b3edb0 | [
"MIT"
] | 35 | 2016-04-18T06:14:08.000Z | 2020-02-09T15:51:58.000Z | lumino/Graphics/src/RHI/Backend/OpenGL/GLTextures.hpp | lriki/Lumino | 1a80430f4a83dbdfbe965b3d5b16064991b3edb0 | [
"MIT"
] | 5 | 2016-04-03T02:52:05.000Z | 2018-01-02T16:53:06.000Z | #pragma once
#include "Common.hpp"
#include "../GraphicsDeviceContext.hpp"
namespace ln {
namespace detail {
class OpenGLDevice;
class GLTextureBase : public RHIResource {
public:
GLTextureBase();
virtual ~GLTextureBase() = default;
virtual GLuint id() const = 0;
virtual bool mipmap() const = 0;
... | 35.921739 | 161 | 0.728395 | lriki |
56574ee19fd03570ac4ce909ebe637e2cc4c52f7 | 839 | cpp | C++ | Solutions-to-Books/C++Primer/Chapter09/9.50.cpp | Horizon-Blue/playground | 4bd42bfcec60b8e89e127f4784c99f6ba669d359 | [
"MIT"
] | 2 | 2016-08-31T19:13:24.000Z | 2017-02-18T18:48:31.000Z | Solutions-to-Books/C++Primer/Chapter09/9.50.cpp | Horizon-Blue/playground | 4bd42bfcec60b8e89e127f4784c99f6ba669d359 | [
"MIT"
] | 1 | 2018-12-10T16:32:26.000Z | 2018-12-27T19:50:48.000Z | Solutions-to-Books/C++Primer/Chapter09/9.50.cpp | Horizon-Blue/playground | 4bd42bfcec60b8e89e127f4784c99f6ba669d359 | [
"MIT"
] | null | null | null | // Exercise 9.50
// Write a program to process a vector<string>
// whose elements represent ingegral values. Produce
// the sum of all the elements in the vector.
// Change the program so that is sumes of strings
// that represent floating-point values.
// Xiaoyan Wang 7/14/2016
#include <string>
#include <iostream>
#i... | 24.676471 | 66 | 0.662694 | Horizon-Blue |
5658213097018f957967398fa746371c6c026398 | 1,247 | hpp | C++ | impl/jamtemplate/common/logging/console.hpp | runvs/1hgj_352 | ee7bbab20729427ce9e5f861101a75f6b3f699d3 | [
"CC0-1.0"
] | 6 | 2021-09-05T08:31:36.000Z | 2021-12-09T21:14:37.000Z | impl/jamtemplate/common/logging/console.hpp | runvs/1hgj_352 | ee7bbab20729427ce9e5f861101a75f6b3f699d3 | [
"CC0-1.0"
] | 30 | 2021-05-19T15:33:03.000Z | 2022-03-30T19:26:37.000Z | impl/jamtemplate/common/logging/console.hpp | runvs/1hgj_352 | ee7bbab20729427ce9e5f861101a75f6b3f699d3 | [
"CC0-1.0"
] | 3 | 2021-05-23T16:06:01.000Z | 2021-10-01T01:17:08.000Z | #ifndef GUARD_JAMTEMPLATE_CONSOLE_HPP
#define GUARD_JAMTEMPLATE_CONSOLE_HPP
#include "game_object.hpp"
#include "imgui.h"
#include "log_entry.hpp"
#include "logger_interface.hpp"
#include <memory>
#include <string>
#include <vector>
namespace jt {
class Console : public jt::GameObject {
public:
Console(jt::Logge... | 25.979167 | 60 | 0.722534 | runvs |
565b556ce6b6b732ea4f394eb64601e6b0cd6d89 | 557 | cpp | C++ | src/GameState.cpp | Throows/TicTacToe | 14a58533743fe1b34f244980390c80f6bfee54e1 | [
"Apache-2.0"
] | null | null | null | src/GameState.cpp | Throows/TicTacToe | 14a58533743fe1b34f244980390c80f6bfee54e1 | [
"Apache-2.0"
] | null | null | null | src/GameState.cpp | Throows/TicTacToe | 14a58533743fe1b34f244980390c80f6bfee54e1 | [
"Apache-2.0"
] | null | null | null | #include "GameState.h"
GameState::GameState(sf::RenderWindow* window, std::stack<GameState*>* states)
: window(window), quit(false)
{
this->states = states;
}
GameState::~GameState()
{
}
const bool& GameState::getQuit() const
{
return this->quit;
}
void GameState::endState()
{
this->quit = true;
}
void GameSt... | 19.206897 | 92 | 0.709156 | Throows |
565c919044441705259ed4b21086da541879e294 | 3,472 | cpp | C++ | src/file_container/tests/test_libaeon_file_container/test_file_container.cpp | aeon-engine/libaeon | e42b39e621dcd0a0fba05e1c166fc688288fb69b | [
"BSD-2-Clause"
] | 7 | 2017-02-19T16:22:16.000Z | 2021-03-02T05:47:39.000Z | src/file_container/tests/test_libaeon_file_container/test_file_container.cpp | aeon-engine/libaeon | e42b39e621dcd0a0fba05e1c166fc688288fb69b | [
"BSD-2-Clause"
] | 61 | 2017-05-29T06:11:17.000Z | 2021-03-28T21:51:44.000Z | src/file_container/tests/test_libaeon_file_container/test_file_container.cpp | aeon-engine/libaeon | e42b39e621dcd0a0fba05e1c166fc688288fb69b | [
"BSD-2-Clause"
] | 2 | 2017-05-28T17:17:40.000Z | 2017-07-14T21:45:16.000Z | // Distributed under the BSD 2-Clause License - Copyright 2012-2021 Robin Degen
#include <aeon/file_container/container.h>
#include <aeon/streams/stream_writer.h>
#include <aeon/streams/stream_reader.h>
#include <aeon/streams/dynamic_stream.h>
#include <aeon/streams/devices/memory_view_device.h>
#include <gtest/gtest.... | 36.93617 | 112 | 0.660714 | aeon-engine |
5660b3d405d03da6c33df0d243f3a1f77d152893 | 2,730 | cpp | C++ | Dynamic Programming/CSES Problem Set [ Dynamic Programming ]/Edit Distance.cpp | Edith-3000/Algorithmic-Implementations | 7ff8cd615fd453a346b4e851606d47c26f05a084 | [
"MIT"
] | 8 | 2021-02-13T17:07:27.000Z | 2021-08-20T08:20:40.000Z | Dynamic Programming/CSES Problem Set [ Dynamic Programming ]/Edit Distance.cpp | Edith-3000/Algorithmic-Implementations | 7ff8cd615fd453a346b4e851606d47c26f05a084 | [
"MIT"
] | null | null | null | Dynamic Programming/CSES Problem Set [ Dynamic Programming ]/Edit Distance.cpp | Edith-3000/Algorithmic-Implementations | 7ff8cd615fd453a346b4e851606d47c26f05a084 | [
"MIT"
] | 5 | 2021-02-17T18:12:20.000Z | 2021-10-10T17:49:34.000Z | // Problem: Edit Distance
// Contest: CSES - CSES Problem Set
// URL: https://cses.fi/problemset/task/1639
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// Parsed on: 03-02-2021 15:59:27 IST (UTC+05:30)
// Author: Kapil Choudhary
// ********************************************************************
// कर्मण्येवाधिका... | 27.575758 | 105 | 0.581685 | Edith-3000 |
5660d91648632ec06f54fc24e457796716981cdc | 9,304 | hpp | C++ | src/pico_tree/pico_tree/internal/box.hpp | Jaybro/pico_tree | c6f7fb798b60452add7d0e940c4a7737cd72a992 | [
"MIT"
] | 23 | 2020-07-19T23:03:01.000Z | 2022-03-07T15:06:26.000Z | src/pico_tree/pico_tree/internal/box.hpp | Jaybro/pico_tree | c6f7fb798b60452add7d0e940c4a7737cd72a992 | [
"MIT"
] | 1 | 2021-01-26T16:53:16.000Z | 2021-01-26T23:20:54.000Z | src/pico_tree/pico_tree/internal/box.hpp | Jaybro/pico_tree | c6f7fb798b60452add7d0e940c4a7737cd72a992 | [
"MIT"
] | 4 | 2021-03-04T14:03:28.000Z | 2021-05-27T05:36:40.000Z | #pragma once
#include <array>
#include "pico_tree/core.hpp"
namespace pico_tree {
namespace internal {
//! \brief BoxTraits exposes metadata for each of the different box types.
//! \see Box
//! \see BoxMap
template <typename Box_>
struct BoxTraits;
//! \brief BoxBase exposes various box utilities.
//! \details C... | 35.376426 | 80 | 0.68218 | Jaybro |
5662f0fefb4b5edfa03cb2bd15c9805db0992fd4 | 2,676 | inl | C++ | Library/Sources/Stroika/Foundation/Containers/Factory/DenseDataHyperRectangle_Factory.inl | SophistSolutions/Stroika | f4e5d84767903a054fba0a6b9c7c4bd1aaefd105 | [
"MIT"
] | 28 | 2015-09-22T21:43:32.000Z | 2022-02-28T01:35:01.000Z | Library/Sources/Stroika/Foundation/Containers/Factory/DenseDataHyperRectangle_Factory.inl | SophistSolutions/Stroika | f4e5d84767903a054fba0a6b9c7c4bd1aaefd105 | [
"MIT"
] | 98 | 2015-01-22T03:21:27.000Z | 2022-03-02T01:47:00.000Z | Library/Sources/Stroika/Foundation/Containers/Factory/DenseDataHyperRectangle_Factory.inl | SophistSolutions/Stroika | f4e5d84767903a054fba0a6b9c7c4bd1aaefd105 | [
"MIT"
] | 4 | 2019-02-21T16:45:25.000Z | 2022-02-18T13:40:04.000Z | /*
* Copyright(c) Sophist Solutions, Inc. 1990-2021. All rights reserved
*/
/*
********************************************************************************
***************************** Implementation Details ***************************
************************************************************************... | 43.16129 | 136 | 0.590807 | SophistSolutions |
566917b63d3ba90c6e8e084707dae4f0a8053262 | 1,358 | cpp | C++ | MyOpenGL/MyOpenGL/Engine/Texture/Texture2D.cpp | wangluo2028/MyOpenGL | 10020aa308f3edbb96c485236e560b778b881900 | [
"MIT"
] | null | null | null | MyOpenGL/MyOpenGL/Engine/Texture/Texture2D.cpp | wangluo2028/MyOpenGL | 10020aa308f3edbb96c485236e560b778b881900 | [
"MIT"
] | null | null | null | MyOpenGL/MyOpenGL/Engine/Texture/Texture2D.cpp | wangluo2028/MyOpenGL | 10020aa308f3edbb96c485236e560b778b881900 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "Texture2D.h"
#include "stb_image.h"
UTexture2D::UTexture2D()
{
TextureData = NULL;
TextureID = 0;
ImgWidth = ImgHeight = 0;
ImgChannels = 0;
}
UTexture2D::~UTexture2D()
{
}
unsigned char* UTexture2D::LoadFromFile(const std::string &FilePath)
{
stbi_set_flip_vertically_on_load(tr... | 20.268657 | 106 | 0.755523 | wangluo2028 |
5670f139391f341522cccbd63a06ac5139e04f84 | 1,003 | cpp | C++ | src/benchmarks/main.cpp | xnetsystems/dtz | 7e2e1ec7750f8092185c33e08debe3233e8b173b | [
"BSL-1.0"
] | null | null | null | src/benchmarks/main.cpp | xnetsystems/dtz | 7e2e1ec7750f8092185c33e08debe3233e8b173b | [
"BSL-1.0"
] | null | null | null | src/benchmarks/main.cpp | xnetsystems/dtz | 7e2e1ec7750f8092185c33e08debe3233e8b173b | [
"BSL-1.0"
] | 1 | 2020-11-06T05:48:26.000Z | 2020-11-06T05:48:26.000Z | #include <benchmark/benchmark.h>
#include <dtz/chrono.hpp>
#include <cstdlib>
#include <fmt/format.h>
static void dtz_format_to_memory_buffer(benchmark::State& state)
{
int value = 33;
fmt::basic_memory_buffer<char, 32> buffer;
for (auto _ : state) {
buffer.clear();
fmt::format_to(buffer, "{}", value);
... | 23.325581 | 71 | 0.705882 | xnetsystems |
567215e632ad3b28dfd49c5c43073032be2069bc | 423 | hpp | C++ | include/legacy_api/lapack/utils.hpp | thijssteel/tlapack | 0749324fdecfc80c089d58d8d43500b66a20df70 | [
"BSD-3-Clause"
] | null | null | null | include/legacy_api/lapack/utils.hpp | thijssteel/tlapack | 0749324fdecfc80c089d58d8d43500b66a20df70 | [
"BSD-3-Clause"
] | null | null | null | include/legacy_api/lapack/utils.hpp | thijssteel/tlapack | 0749324fdecfc80c089d58d8d43500b66a20df70 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) 2021-2022, University of Colorado Denver. All rights reserved.
//
// This file is part of <T>LAPACK.
// <T>LAPACK is free software: you can redistribute it and/or modify it under
// the terms of the BSD 3-Clause license. See the accompanying LICENSE file.
#ifndef __TLAPACK_LEGACY_UTILS_HH__
#define __... | 32.538462 | 79 | 0.777778 | thijssteel |
568405e02f2e8342df41fe4b08189ccbcdc3bde4 | 2,892 | hpp | C++ | common/logger/stdout_logger.hpp | ngruenwald/fundus | 5ccdfe44b5c4ea933abb34ffc4fd02b3da9bd5a9 | [
"MIT"
] | null | null | null | common/logger/stdout_logger.hpp | ngruenwald/fundus | 5ccdfe44b5c4ea933abb34ffc4fd02b3da9bd5a9 | [
"MIT"
] | null | null | null | common/logger/stdout_logger.hpp | ngruenwald/fundus | 5ccdfe44b5c4ea933abb34ffc4fd02b3da9bd5a9 | [
"MIT"
] | null | null | null | #pragma once
#include <sstream>
#include <common/logger/logger_tools.hpp>
#ifdef HAVE_FMTLIB
#include <fmt/format.h>
#endif
namespace cmn {
namespace log {
extern int MIN_LEVEL; // YOU need to define this in your code!
#define TRACE_(...) _OUTPUT(LVL_TRACE, "TRACE", __VA_ARGS__)
#define DEBUG_(...) _OUTPUT(LVL_D... | 45.904762 | 80 | 0.330221 | ngruenwald |
568935f7c1c39b478e131c47397a7f6f7abd3d93 | 16,478 | cpp | C++ | CloakEngine/WorldStreamer.cpp | Bizzarrus/CloakEngine | 0890eaada76b91be89702d2a6ec2dcf9b2901fb9 | [
"BSD-2-Clause"
] | null | null | null | CloakEngine/WorldStreamer.cpp | Bizzarrus/CloakEngine | 0890eaada76b91be89702d2a6ec2dcf9b2901fb9 | [
"BSD-2-Clause"
] | null | null | null | CloakEngine/WorldStreamer.cpp | Bizzarrus/CloakEngine | 0890eaada76b91be89702d2a6ec2dcf9b2901fb9 | [
"BSD-2-Clause"
] | null | null | null | #include "stdafx.h"
#include "Engine/WorldStreamer.h"
#include "CloakEngine/Helper/SyncSection.h"
#include "CloakEngine/Global/Game.h"
#include "CloakEngine/Global/Math.h"
#include "CloakEngine/Global/Task.h"
#include "CloakEngine/Files/Scene.h"
#include "Implementation/Global/Memory.h"
#include <atomic>
... | 32.824701 | 166 | 0.56269 | Bizzarrus |
568a5885911ccd38139759a19e49d0cb6293af60 | 1,368 | hpp | C++ | include/Factory.hpp | dmorle/LIBCAA | 49c6344bc38d445ad793857ec62635abb08dada4 | [
"MIT"
] | null | null | null | include/Factory.hpp | dmorle/LIBCAA | 49c6344bc38d445ad793857ec62635abb08dada4 | [
"MIT"
] | null | null | null | include/Factory.hpp | dmorle/LIBCAA | 49c6344bc38d445ad793857ec62635abb08dada4 | [
"MIT"
] | null | null | null | #ifndef FACTORY_H
#define FACTORY_H
#include <random>
#include "Vector.hpp"
#include "Matrix.hpp"
namespace LIBCAA {
class Factory
{
public:
Tensor *noInit(int rank, int *dimensions);
Matrix *noInit(int m, int n);
Vector *noInit(int len);
Tensor *usrInit(int rank, int *dimensions);
Matrix *usrInit(int... | 25.811321 | 78 | 0.689327 | dmorle |
568ffbdcef0ef6f69094cb235d14e9695b078aff | 2,704 | cpp | C++ | src/JPEGENC.cpp | bitbank2/JPEGENC | 08317cc22d8b0efcba439f4c23aec8588fac33d7 | [
"Apache-2.0"
] | 28 | 2021-08-02T12:31:05.000Z | 2022-03-17T01:38:25.000Z | src/JPEGENC.cpp | bitbank2/JPEGENC | 08317cc22d8b0efcba439f4c23aec8588fac33d7 | [
"Apache-2.0"
] | 2 | 2021-08-23T09:17:50.000Z | 2021-09-09T16:46:48.000Z | src/JPEGENC.cpp | bitbank2/JPEGENC | 08317cc22d8b0efcba439f4c23aec8588fac33d7 | [
"Apache-2.0"
] | 2 | 2021-08-03T13:03:14.000Z | 2021-08-10T15:15:59.000Z | //
// JPEG Encoder
//
// written by Larry Bank
// bitbank@pobox.com
// Arduino port started 7/22/2021
// Original JPEG code written 20+ years ago :)
// The goal of this code is to encode JPEG images on embedded systems
//
// Copyright 2021 BitBank Software, Inc. All Rights Reserved.
// Licensed under the Apache License... | 31.811765 | 187 | 0.6875 | bitbank2 |
56907e1400719892d83267774818356d2ed6f0a1 | 2,572 | cpp | C++ | problems/src/2015/problem_20.cpp | voivoid/advent-of-code | efc02f558ad7718d02dfc205fadeba6b857ce4ae | [
"MIT"
] | 6 | 2019-03-01T14:15:38.000Z | 2021-12-10T21:39:23.000Z | problems/src/2015/problem_20.cpp | voivoid/advent-of-code | efc02f558ad7718d02dfc205fadeba6b857ce4ae | [
"MIT"
] | 3 | 2018-10-22T09:42:26.000Z | 2018-10-22T11:45:06.000Z | problems/src/2015/problem_20.cpp | voivoid/advent-of-code | efc02f558ad7718d02dfc205fadeba6b857ce4ae | [
"MIT"
] | null | null | null | #include "AoC/2015/problem_20.h"
#include "AoC/problems_map.h"
#include "range/v3/numeric/accumulate.hpp"
#include "range/v3/view/filter.hpp"
#include "range/v3/view/iota.hpp"
#include "boost/numeric/conversion/cast.hpp"
#include <vector>
#include <cassert>
#include <cmath>
#include <istream>
namespace
{
std::ve... | 22.365217 | 133 | 0.652411 | voivoid |
5693417c80caaf5103fc812bdced62b7d2cec6ea | 1,053 | cpp | C++ | xr3/src/TweenVar.cpp | zyndor/xrhodes | 15017c2ba6499b19e1dd327608ffb44dbaba7a4e | [
"BSD-2-Clause"
] | 7 | 2018-11-13T09:44:56.000Z | 2022-01-12T02:22:41.000Z | xr3/src/TweenVar.cpp | zyndor/xrhodes | 15017c2ba6499b19e1dd327608ffb44dbaba7a4e | [
"BSD-2-Clause"
] | 2 | 2018-10-30T08:19:02.000Z | 2018-12-31T18:48:13.000Z | xr3/src/TweenVar.cpp | zyndor/xrhodes | 15017c2ba6499b19e1dd327608ffb44dbaba7a4e | [
"BSD-2-Clause"
] | null | null | null | //
// XRhodes
//
// copyright (c) Gyorgy Straub. All rights reserved.
//
// License: https://github.com/zyndor/xrhodes#License-bsd-2-clause
//
//==============================================================================
#include "xr/TweenVar.hpp"
XR_WARNINGS_IGNORE_DEPRECATION
namespace xr
{
void TweenVarCore::O... | 19.867925 | 80 | 0.636277 | zyndor |
56977432090f434453157e3fa5af9876aab67620 | 5,289 | cpp | C++ | test/utils/str_utils_test.cpp | tdekeyser/doomU | e2a9922b56d31415f153d317e506312329ee3777 | [
"MIT"
] | 1 | 2018-11-30T13:22:23.000Z | 2018-11-30T13:22:23.000Z | test/utils/str_utils_test.cpp | tdekeyser/doomU | e2a9922b56d31415f153d317e506312329ee3777 | [
"MIT"
] | null | null | null | test/utils/str_utils_test.cpp | tdekeyser/doomU | e2a9922b56d31415f153d317e506312329ee3777 | [
"MIT"
] | null | null | null | #include "../Catch/catch.hpp"
#include "../../src/utils/str_utils.c"
#include <cstring>
TEST_CASE("length") {
SECTION("calculates the length of an array") {
REQUIRE(length("hello there!") == 12);
}
SECTION("empty string returns zero") {
REQUIRE(length("") == 0);
}
}
TEST_CASE("co... | 23.299559 | 82 | 0.572698 | tdekeyser |
569780cbf0e54647e0ca138bc80cb7026f70fd08 | 1,035 | hpp | C++ | PolyEngine/Editor/Src/Controllers/Impl/EngineController.hpp | PiotrMoscicki/PolyEngine | 573c453e9d1ae0a351ad14410595ff844e3b4620 | [
"MIT"
] | 65 | 2017-04-04T20:33:44.000Z | 2019-12-02T23:06:58.000Z | PolyEngine/Editor/Src/Controllers/Impl/EngineController.hpp | PiotrMoscicki/PolyEngine | 573c453e9d1ae0a351ad14410595ff844e3b4620 | [
"MIT"
] | 46 | 2017-04-21T12:26:38.000Z | 2019-12-15T05:31:47.000Z | PolyEngine/Editor/Src/Controllers/Impl/EngineController.hpp | PiotrMoscicki/PolyEngine | 573c453e9d1ae0a351ad14410595ff844e3b4620 | [
"MIT"
] | 51 | 2017-04-12T10:53:32.000Z | 2019-11-20T13:05:54.000Z | #pragma once
// qt
#include <QtCore/qtimer.h>
// interface
#include <Controllers/IEngineController.hpp>
#include <Configs/ProjectConfig.hpp>
//------------------------------------------------------------------------------
namespace PolyEditor
{
class IEditor;
}
//--------------------------------------------------... | 23.522727 | 86 | 0.628986 | PiotrMoscicki |
569a6d2e9b75fc71da2225b95f737b471f6c1bc0 | 16,325 | cpp | C++ | src/v4l2_camera.cpp | bensewell/ros2_v4l2_camera | 269573bdf74c256b0d61e49cfd630c76b6a83b05 | [
"Apache-2.0"
] | 1 | 2022-03-13T02:07:13.000Z | 2022-03-13T02:07:13.000Z | src/v4l2_camera.cpp | hageroboten/ros2_v4l2_camera | 269573bdf74c256b0d61e49cfd630c76b6a83b05 | [
"Apache-2.0"
] | null | null | null | src/v4l2_camera.cpp | hageroboten/ros2_v4l2_camera | 269573bdf74c256b0d61e49cfd630c76b6a83b05 | [
"Apache-2.0"
] | 1 | 2021-12-07T10:25:57.000Z | 2021-12-07T10:25:57.000Z | // Copyright 2019 Bold Hearts
//
// 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 in ... | 34.08142 | 100 | 0.638101 | bensewell |
56a586d7f018bc22d8ed3ad3d501ff2f06983f64 | 18,133 | cc | C++ | global/signal_handler.cc | liucxer/ceph-msg | 2e5c18c0c72253b283bfd3d0576033c0b515ce55 | [
"Apache-2.0"
] | null | null | null | global/signal_handler.cc | liucxer/ceph-msg | 2e5c18c0c72253b283bfd3d0576033c0b515ce55 | [
"Apache-2.0"
] | null | null | null | global/signal_handler.cc | liucxer/ceph-msg | 2e5c18c0c72253b283bfd3d0576033c0b515ce55 | [
"Apache-2.0"
] | null | null | null | // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2011 New Dream Network
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License ... | 27.226727 | 102 | 0.637291 | liucxer |
56a8aeefdd2b54db83463d8e521f23b1ee8cfc8e | 1,342 | cpp | C++ | app_modules/00_base_module/src/application.cpp | LucaRitz/learn_with_tello | f7fc45e7a9e9a2903638ec8367c9b355a4f1afc9 | [
"Apache-2.0"
] | null | null | null | app_modules/00_base_module/src/application.cpp | LucaRitz/learn_with_tello | f7fc45e7a9e9a2903638ec8367c9b355a4f1afc9 | [
"Apache-2.0"
] | null | null | null | app_modules/00_base_module/src/application.cpp | LucaRitz/learn_with_tello | f7fc45e7a9e9a2903638ec8367c9b355a4f1afc9 | [
"Apache-2.0"
] | null | null | null | #include "application.hpp"
#include <tello/logger/logger_interface.hpp>
#include <tello/connection/tello_network.hpp>
#include <common/base_settings.hpp>
using tello::LoggerSettings;
using tello::LoggerInterface;
using tello::TelloNetwork;
using tello::Tello;
Application::Application() :
_baseSettings(std::make_... | 25.320755 | 100 | 0.731744 | LucaRitz |
56a95c0f9a21c29dc7179d368a1f49d2c97bfd54 | 5,446 | cpp | C++ | src/Utilities/profiling.cpp | SPC-Some-Polish-Coders/PopHead | 2bce21b1a6b3d16a2ccecf0d15faeebf6a486c81 | [
"MIT"
] | 117 | 2019-03-18T20:09:54.000Z | 2022-03-27T22:40:52.000Z | src/Utilities/profiling.cpp | SPC-Some-Polish-Coders/PopHead | 2bce21b1a6b3d16a2ccecf0d15faeebf6a486c81 | [
"MIT"
] | 443 | 2019-04-07T19:59:56.000Z | 2020-05-23T12:25:28.000Z | src/Utilities/profiling.cpp | SPC-Some-Polish-Coders/PopHead | 2bce21b1a6b3d16a2ccecf0d15faeebf6a486c81 | [
"MIT"
] | 19 | 2019-03-20T19:57:34.000Z | 2020-11-21T15:35:02.000Z | #include "pch.hpp"
#include "Utilities/threadId.hpp"
extern bool debugWindowOpen;
namespace ph {
using clock = std::chrono::steady_clock;
ProfilingResult::id MainProfilingManager::ThreadProfilingManager::commitResultStart(std::string&& name, std::vector<std::pair<std::string, std::string>>&& args)
{
auto& result =... | 24.642534 | 160 | 0.674624 | SPC-Some-Polish-Coders |
56afdc4ef926c8b378c759e22acb64871785ea95 | 511 | cpp | C++ | 24prime1.cpp | Ankitahazra-1906/cpp | 31412ffc844cbafb6dd8a64e031676b48acadfe2 | [
"MIT"
] | 2 | 2021-11-11T19:18:16.000Z | 2021-11-13T11:23:03.000Z | 24prime1.cpp | Ankitahazra-1906/cp | 24ab374184e440c17b467967995b2f6324baa2a6 | [
"MIT"
] | null | null | null | 24prime1.cpp | Ankitahazra-1906/cp | 24ab374184e440c17b467967995b2f6324baa2a6 | [
"MIT"
] | null | null | null | //To check whether the number is prime or not
#include<iostream>
using namespace std;
int main(){
int n,i;
bool prime=true;
cout<<"Enter a positive integer: ";
cin>>n;
if(n==0 || n==1){
prime=false;
}
else{
for(i=2;i<=n/2;i++){
if(n%i==0){
... | 19.653846 | 46 | 0.434442 | Ankitahazra-1906 |
56b27289ba43564b6b35ec134902c5761a8e1209 | 817 | cpp | C++ | tool/src/nfcheck.cpp | sajjadium/BotGrabber | ce10ff472253b68c75815afe9c723cf5bc91e365 | [
"MIT"
] | 5 | 2020-04-06T07:07:29.000Z | 2020-04-16T02:31:06.000Z | tool/src/nfcheck.cpp | sajjadium/botnet-detection | ce10ff472253b68c75815afe9c723cf5bc91e365 | [
"MIT"
] | null | null | null | tool/src/nfcheck.cpp | sajjadium/botnet-detection | ce10ff472253b68c75815afe9c723cf5bc91e365 | [
"MIT"
] | 1 | 2020-04-06T15:43:34.000Z | 2020-04-06T15:43:34.000Z | #include <utility/netflow.h>
#include <utility/common.h>
#include <stdio.h>
#include <stdlib.h>
using namespace utility;
using namespace std;
int main(int argc, char *argv[]) {
char *bin = new char[NETFLOW_BINARY_SIZE];
while (true) {
if (fread(bin, 1, NETFLOW_BINARY_SIZE, stdin) != NETFLOW_BINARY_SIZE)
bre... | 19.926829 | 71 | 0.663403 | sajjadium |
56b535d2e0fc5a94d83929a758d5532102d102b0 | 544 | hpp | C++ | include/cqlsvrkit/types/option.hpp | SiLeader/Cassandra-C-Server-Kit | 243eef73b343d31b6ab43f182c0eb66a7b49f740 | [
"Apache-2.0"
] | null | null | null | include/cqlsvrkit/types/option.hpp | SiLeader/Cassandra-C-Server-Kit | 243eef73b343d31b6ab43f182c0eb66a7b49f740 | [
"Apache-2.0"
] | null | null | null | include/cqlsvrkit/types/option.hpp | SiLeader/Cassandra-C-Server-Kit | 243eef73b343d31b6ab43f182c0eb66a7b49f740 | [
"Apache-2.0"
] | null | null | null | //
// Created by cerussite on 2/16/20.
//
#pragma once
#include <cstdint>
#include <vector>
#include "../detail/convert.hpp"
#include "common.hpp"
namespace cqlsvrkit {
class Option {
private:
std::int16_t id_;
std::vector<byte> free_style_data_;
public:
Option(std::int16_t id, std::vector<byte> data)
... | 18.133333 | 56 | 0.680147 | SiLeader |
56b69d0efdca023547d9dfffbedc0bc4ce4fa264 | 4,161 | cpp | C++ | src/Module/Decoder/LDPC/BP/Flooding/LSPA/Decoder_LDPC_BP_flooding_log_sum_product.cpp | codechecker123/aff3ct | 030af3e990027fa803fb2c68f974c9ec0ee79b5d | [
"MIT"
] | null | null | null | src/Module/Decoder/LDPC/BP/Flooding/LSPA/Decoder_LDPC_BP_flooding_log_sum_product.cpp | codechecker123/aff3ct | 030af3e990027fa803fb2c68f974c9ec0ee79b5d | [
"MIT"
] | null | null | null | src/Module/Decoder/LDPC/BP/Flooding/LSPA/Decoder_LDPC_BP_flooding_log_sum_product.cpp | codechecker123/aff3ct | 030af3e990027fa803fb2c68f974c9ec0ee79b5d | [
"MIT"
] | null | null | null | #include <typeinfo>
#include <limits>
#include "Tools/Exception/exception.hpp"
#include "Tools/Math/utils.h"
#include "Decoder_LDPC_BP_flooding_log_sum_product.hpp"
using namespace aff3ct;
using namespace aff3ct::module;
template <typename B, typename R>
Decoder_LDPC_BP_flooding_log_sum_product<B,R>
::Decoder_LDPC_... | 35.262712 | 120 | 0.62509 | codechecker123 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.