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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
120f92fbd6e6148a94489ab825db9d127d0201de | 4,442 | cpp | C++ | il/linearAlgebra/sparse/factorization/_test/GmresIlu0_test.cpp | insideloop/InsideLoop | 5385e908d85697e32fa065b45f608df84d3177a3 | [
"Apache-2.0"
] | 19 | 2016-12-08T14:16:28.000Z | 2017-08-18T01:26:52.000Z | il/linearAlgebra/sparse/factorization/_test/GmresIlu0_test.cpp | insideloop/InsideLoop | 5385e908d85697e32fa065b45f608df84d3177a3 | [
"Apache-2.0"
] | 1 | 2017-03-10T17:28:33.000Z | 2017-03-14T11:08:32.000Z | il/linearAlgebra/sparse/factorization/_test/GmresIlu0_test.cpp | insideloop/InsideLoop | 5385e908d85697e32fa065b45f608df84d3177a3 | [
"Apache-2.0"
] | null | null | null | //==============================================================================
//
// Copyright 2018 The InsideLoop Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the Lic... | 34.434109 | 82 | 0.614138 | insideloop |
121749d2c82b0f5b0b9c4ba3617cab366f8ac80f | 508 | hh | C++ | src/ast/libast.hh | MrMaDGaME/Tiger | f31f73cd386b3ccb3e02abe7b23a3de09d70bd0f | [
"MIT"
] | null | null | null | src/ast/libast.hh | MrMaDGaME/Tiger | f31f73cd386b3ccb3e02abe7b23a3de09d70bd0f | [
"MIT"
] | null | null | null | src/ast/libast.hh | MrMaDGaME/Tiger | f31f73cd386b3ccb3e02abe7b23a3de09d70bd0f | [
"MIT"
] | null | null | null | /**
** \file ast/libast.hh
** \brief Public ast interface declaration.
*/
#pragma once
#include <iosfwd>
#include <misc/xalloc.hh>
#include <ast/fwd.hh>
/// Ast management.
namespace ast
{
extern const misc::xalloc<bool> escapes_display;
extern const misc::xalloc<bool> bindings_display;
/// Output \a a o... | 18.814815 | 64 | 0.669291 | MrMaDGaME |
12188eb2afe7493bd41962771dec33b3dcc941d8 | 503 | hpp | C++ | include/datatransfer/boost_message_handler.hpp | thomash505/libdatatransfer | b51ff4f5b612a0a290e49b84fee846707bd8cd91 | [
"MIT"
] | null | null | null | include/datatransfer/boost_message_handler.hpp | thomash505/libdatatransfer | b51ff4f5b612a0a290e49b84fee846707bd8cd91 | [
"MIT"
] | null | null | null | include/datatransfer/boost_message_handler.hpp | thomash505/libdatatransfer | b51ff4f5b612a0a290e49b84fee846707bd8cd91 | [
"MIT"
] | null | null | null | #ifndef DATATRANSFER_BOOST_MESSAGE_HANDLER_HPP
#define DATATRANSFER_BOOST_MESSAGE_HANDLER_HPP
#include <boost/signals2/signal.hpp>
#include "message_handler_base.hpp"
namespace datatransfer {
template<typename DataType>
struct boost_message_handler : message_handler_base
{
boost::signals2::signal<void(DataType&)... | 21.869565 | 60 | 0.7833 | thomash505 |
1219157d441b88841c38df9827aa8ce4d0fd77f8 | 9,362 | cpp | C++ | tests/ocltst/module/dx/OCLDX11Common.cpp | jpsamaroo/ROCm-OpenCL-Runtime | 875c1f8b4741a7285757a9bc7e98405bc202785a | [
"MIT"
] | 7 | 2022-03-23T07:04:20.000Z | 2022-03-30T02:44:42.000Z | tests/ocltst/module/dx/OCLDX11Common.cpp | jpsamaroo/ROCm-OpenCL-Runtime | 875c1f8b4741a7285757a9bc7e98405bc202785a | [
"MIT"
] | null | null | null | tests/ocltst/module/dx/OCLDX11Common.cpp | jpsamaroo/ROCm-OpenCL-Runtime | 875c1f8b4741a7285757a9bc7e98405bc202785a | [
"MIT"
] | null | null | null | /* Copyright (c) 2010-present Advanced Micro Devices, Inc.
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, me... | 39.50211 | 81 | 0.633839 | jpsamaroo |
121cf3e9edba51677b77380e4b6070ca364b65bd | 27,212 | cc | C++ | inet/src/inet/linklayer/bmac/BMac.cc | ntanetani/quisp | 003f85746266d2eb62c66883e5b965b654672c70 | [
"BSD-3-Clause"
] | null | null | null | inet/src/inet/linklayer/bmac/BMac.cc | ntanetani/quisp | 003f85746266d2eb62c66883e5b965b654672c70 | [
"BSD-3-Clause"
] | null | null | null | inet/src/inet/linklayer/bmac/BMac.cc | ntanetani/quisp | 003f85746266d2eb62c66883e5b965b654672c70 | [
"BSD-3-Clause"
] | 1 | 2021-07-02T13:32:40.000Z | 2021-07-02T13:32:40.000Z | //
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will... | 37.95258 | 139 | 0.568536 | ntanetani |
122d66563b70b5173537da85409b1df66587c4f6 | 2,467 | cpp | C++ | example/spaceship/framework/GFrameHandler.cpp | pjkui/behaviac_2.0.7 | db4bec559c184c4af125005bf07bc0b25e2c6e66 | [
"BSD-3-Clause"
] | 2 | 2021-06-06T07:54:45.000Z | 2021-09-08T03:36:40.000Z | example/spaceship/framework/GFrameHandler.cpp | pjkui/behaviac_2.0.7 | db4bec559c184c4af125005bf07bc0b25e2c6e66 | [
"BSD-3-Clause"
] | null | null | null | example/spaceship/framework/GFrameHandler.cpp | pjkui/behaviac_2.0.7 | db4bec559c184c4af125005bf07bc0b25e2c6e66 | [
"BSD-3-Clause"
] | 2 | 2016-03-17T11:19:16.000Z | 2020-03-16T16:17:56.000Z | /////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Tencent is pleased to support the open source community by making behaviac available.
//
// Copyright (C) 2015 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clau... | 24.186275 | 113 | 0.603972 | pjkui |
123242782ed036b98e59f6e40de2d2879c64acf4 | 3,087 | cpp | C++ | Sandbox/src/TestLayer.cpp | morlyno/Shark | 27afc267d76e0b69128606479c061685ba8576f8 | [
"Apache-2.0"
] | 1 | 2021-01-12T18:50:14.000Z | 2021-01-12T18:50:14.000Z | Sandbox/src/TestLayer.cpp | morlyno/Shark | 27afc267d76e0b69128606479c061685ba8576f8 | [
"Apache-2.0"
] | null | null | null | Sandbox/src/TestLayer.cpp | morlyno/Shark | 27afc267d76e0b69128606479c061685ba8576f8 | [
"Apache-2.0"
] | null | null | null | #include "TestLayer.h"
TestLayer::TestLayer(const std::string& name)
:
Layer(name),
m_CameraController(1280.0f / 720.0f, true)
{
}
void TestLayer::OnAttach()
{
m_Shaders = Shark::Shaders::Create("assets/Shaders/TestShader.hlsl");
m_TextureShaders = Shark::Shaders::Create("assets/Shaders/TextureShader.hlsl");
m_... | 36.317647 | 164 | 0.71461 | morlyno |
1233400ee6efdd6e6b61acf4a8a73e491e1f9196 | 1,522 | cpp | C++ | 15/advent15.cpp | ComicSansMS/AdventOfCode2017 | 238460dd82dae182d78b8460578b7f615cf99fd0 | [
"Unlicense"
] | null | null | null | 15/advent15.cpp | ComicSansMS/AdventOfCode2017 | 238460dd82dae182d78b8460578b7f615cf99fd0 | [
"Unlicense"
] | null | null | null | 15/advent15.cpp | ComicSansMS/AdventOfCode2017 | 238460dd82dae182d78b8460578b7f615cf99fd0 | [
"Unlicense"
] | null | null | null | #include <dueling_generators.hpp>
#include <algorithm>
#include <fstream>
#include <iostream>
#include <numeric>
#include <optional>
#include <sstream>
#include <string>
std::optional<std::string> readInput(char const* filename)
{
std::ifstream fin(filename);
if(!fin) {
std::cerr << "Unable to open i... | 21.43662 | 96 | 0.585414 | ComicSansMS |
72f083ede5d4b5ddabe3c8a4aa8a1ef468ebf94e | 772 | cc | C++ | 5_Programmieraufgabe/exercise.cc | MikeHu13/CPP_Kurs | 13dda926da0cebd79f52f7141db1913fe7c56637 | [
"MIT"
] | null | null | null | 5_Programmieraufgabe/exercise.cc | MikeHu13/CPP_Kurs | 13dda926da0cebd79f52f7141db1913fe7c56637 | [
"MIT"
] | null | null | null | 5_Programmieraufgabe/exercise.cc | MikeHu13/CPP_Kurs | 13dda926da0cebd79f52f7141db1913fe7c56637 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
#include "exercise.h"
using std::cout;
using std::endl;
using std::cin;
using std::vector;
using std::fill;
using std::sort;
// Aufgabe 2
vector<double> max_row_values(Matrix &matrix)
{
vector<double> max_values (matrix.size(),0);
for (size_t i = 0; ... | 18.829268 | 54 | 0.546632 | MikeHu13 |
72f19259f20542d67f1680872364b517d0403610 | 1,655 | cpp | C++ | src/Query.cpp | kiot-innovations/mDNSResolver | 3fbc89d32f7849fb20a20b71b082142ce80734a9 | [
"MIT"
] | 26 | 2017-02-10T23:48:34.000Z | 2022-03-05T13:56:17.000Z | src/Query.cpp | kiot-innovations/mDNSResolver | 3fbc89d32f7849fb20a20b71b082142ce80734a9 | [
"MIT"
] | 8 | 2017-11-02T20:23:32.000Z | 2022-01-01T10:10:02.000Z | src/Query.cpp | kiot-innovations/mDNSResolver | 3fbc89d32f7849fb20a20b71b082142ce80734a9 | [
"MIT"
] | 19 | 2017-02-28T12:37:18.000Z | 2021-08-28T15:44:47.000Z | #include "Query.h"
namespace mDNSResolver {
Query::Query(const char* name) {
this->name = name;
}
Query::~Query() {}
// If we pass in a UDP proxy, we can dynamically allocate the
// memory without fee of fragmentation, and don't risk losing
// the reference if this object disappears
void Query::sen... | 25.859375 | 76 | 0.598187 | kiot-innovations |
72f2323bcc41c5396d1d742d114d2f82c786d9e2 | 2,988 | cpp | C++ | sword_2_offer/23_LevelTraversalBinTree.cpp | thewangcj/CodingInterview | f5ee3074e527295f6911a5439bb8ac5fc0ed56ea | [
"MIT"
] | 1 | 2018-01-13T06:01:49.000Z | 2018-01-13T06:01:49.000Z | sword_2_offer/23_LevelTraversalBinTree.cpp | thewangcj/CodingInterview | f5ee3074e527295f6911a5439bb8ac5fc0ed56ea | [
"MIT"
] | null | null | null | sword_2_offer/23_LevelTraversalBinTree.cpp | thewangcj/CodingInterview | f5ee3074e527295f6911a5439bb8ac5fc0ed56ea | [
"MIT"
] | null | null | null | // 不分行从上往下打印二叉树
// 题目：从上往下打印出二叉树的每个结点，同一层的结点按照从左到右的顺序打印。
#include "./utils/BinaryTree.h"
#include <iostream>
#include <deque>
void LevelTraversalBInTree(BinaryTreeNode* tree) {
if(!tree)
return;
deque<BinaryTreeNode*> bin_tree_deque;
bin_tree_deque.push_back(tree);
while(bin_tree_deque.size()) {
BinaryTreeNode... | 21.496403 | 69 | 0.640897 | thewangcj |
72f58e4d4aa213bd50b730fe72f02dbfa353a4a6 | 8,292 | cpp | C++ | engine/src/qlcinputprofile.cpp | pixeldoc2000/qlcplus | 21b2921360c249f3f8aae707bb35b6db5e619b43 | [
"Apache-2.0"
] | null | null | null | engine/src/qlcinputprofile.cpp | pixeldoc2000/qlcplus | 21b2921360c249f3f8aae707bb35b6db5e619b43 | [
"Apache-2.0"
] | null | null | null | engine/src/qlcinputprofile.cpp | pixeldoc2000/qlcplus | 21b2921360c249f3f8aae707bb35b6db5e619b43 | [
"Apache-2.0"
] | null | null | null | /*
Q Light Controller
qlcinputprofile.cpp
Copyright (c) Heikki Junnila
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.txt
Unless re... | 24.605341 | 82 | 0.562711 | pixeldoc2000 |
72f6a803229432db80f5297e63c0cf5eecf5f7f4 | 1,754 | cpp | C++ | Recursion 1/All Indices of Number.cpp | ramamutalik/Data_structures_Algorithms | 6cdead5b67a0bcc70cb0d3b07c1a92bbffa34b1d | [
"MIT"
] | null | null | null | Recursion 1/All Indices of Number.cpp | ramamutalik/Data_structures_Algorithms | 6cdead5b67a0bcc70cb0d3b07c1a92bbffa34b1d | [
"MIT"
] | null | null | null | Recursion 1/All Indices of Number.cpp | ramamutalik/Data_structures_Algorithms | 6cdead5b67a0bcc70cb0d3b07c1a92bbffa34b1d | [
"MIT"
] | null | null | null | /*********
Given an array of length N and an integer x, you need to find all the indexes where x is present in the input array. Save all the indexes in an array (in increasing order).
Do this recursively. Indexing in the array starts from 0.
Input Format :
Line 1 : An Integer N i.e. size of array
Line 2 : N integers wh... | 19.488889 | 172 | 0.570696 | ramamutalik |
72f7ad07f91ca7324d215cbd00ddfad1d9f14047 | 963 | h++ | C++ | deps/wheels/include/wheels/expand.h++ | picanumber/named-operator | 71910f8af4c55260629e6bd423981aa27c0ed2e5 | [
"Apache-2.0"
] | 1 | 2015-10-22T09:01:04.000Z | 2015-10-22T09:01:04.000Z | deps/wheels/include/wheels/expand.h++ | picanumber/named-operator | 71910f8af4c55260629e6bd423981aa27c0ed2e5 | [
"Apache-2.0"
] | null | null | null | deps/wheels/include/wheels/expand.h++ | picanumber/named-operator | 71910f8af4c55260629e6bd423981aa27c0ed2e5 | [
"Apache-2.0"
] | null | null | null | // Wheels - various C++ utilities
//
// Written in 2012 by Martinho Fernandes <martinho.fernandes@gmail.com>
//
// To the extent possible under law, the author(s) have dedicated all copyright and related
// and neighboring rights to this software to the public domain worldwide. This software is
// distributed wit... | 32.1 | 97 | 0.696781 | picanumber |
f40135e47c5c828bce4aada1a1e0d5e823d48aed | 857 | cpp | C++ | question_solution/first_time/1018.cpp | xiaoland/CaiojSolution | a12c505235d70b414071ea894fa72cddbcfabc6d | [
"Apache-2.0"
] | 1 | 2020-09-24T13:35:45.000Z | 2020-09-24T13:35:45.000Z | question_solution/first_time/1018.cpp | xiaoland/CaiojSolution | a12c505235d70b414071ea894fa72cddbcfabc6d | [
"Apache-2.0"
] | null | null | null | question_solution/first_time/1018.cpp | xiaoland/CaiojSolution | a12c505235d70b414071ea894fa72cddbcfabc6d | [
"Apache-2.0"
] | null | null | null | #include <cstdio>
using namespace std;
int get_greatest_common_number(int a, int b) {
int leave_number, last_leave_number;
leave_number = a%b;
for(int i = 0; i >= 0; i++) {
if (leave_number == 0) {
return last_leave_number;
}
last_leave_number = leave_number;
... | 21.974359 | 65 | 0.53909 | xiaoland |
f40a518f588c19c3051abd8973f38e807589c018 | 9,299 | cpp | C++ | CppStrangeIoC/framework/injector/injector.cpp | AndreySkyFoxSidorov/CppStrangeIoC | cae0953ec4a1fce838d7c138153d4279d3fb2c4b | [
"Apache-2.0"
] | 2 | 2018-06-06T11:26:48.000Z | 2019-04-11T14:05:42.000Z | CppStrangeIoC/framework/injector/injector.cpp | AndreySkyFoxSidorov/CppStrangeIoC | cae0953ec4a1fce838d7c138153d4279d3fb2c4b | [
"Apache-2.0"
] | null | null | null | CppStrangeIoC/framework/injector/injector.cpp | AndreySkyFoxSidorov/CppStrangeIoC | cae0953ec4a1fce838d7c138153d4279d3fb2c4b | [
"Apache-2.0"
] | 2 | 2018-06-06T11:26:49.000Z | 2021-07-26T03:43:16.000Z |
#include "Injector.h"
using namespace strange::extensions::injector::api;
using namespace strange::extensions::reflector::api;
namespace strange
{
namespace extensions
{
namespace injector
{
namespace impl
{
Injector::Injector()
{
InjectorFactory tempVar();
setfactory(&tempVar);
}
IInjectorFactory* Injector... | 31.629252 | 230 | 0.738789 | AndreySkyFoxSidorov |
f40d12922e845241dd96f21ac2e8cb41c463ddbe | 1,206 | hpp | C++ | graph/graph_utils.hpp | Tsumiman/rds-serial | a7b2104c919a314cba96247000ce0e3defffece2 | [
"Apache-2.0"
] | null | null | null | graph/graph_utils.hpp | Tsumiman/rds-serial | a7b2104c919a314cba96247000ce0e3defffece2 | [
"Apache-2.0"
] | null | null | null | graph/graph_utils.hpp | Tsumiman/rds-serial | a7b2104c919a314cba96247000ce0e3defffece2 | [
"Apache-2.0"
] | null | null | null | #ifndef __GRAPH_UTILS_HPP__
#define __GRAPH_UTILS_HPP__
#include <iostream>
#include <sstream>
#include <string>
#include "graph.h"
template <typename T> T* from_dimacs(std::istream& source) {
std::string line, _;
int V, E, U;
T* result = nullptr;
while (std::getline(source, line)) {
std::istringstream lin... | 25.125 | 102 | 0.58126 | Tsumiman |
f40daddfba994d78ec6231b1878e329560334fae | 911 | inl | C++ | src/osgui/gtk3/osmenu.inl | rochus-keller/nappgui_src | 394875dfc11c9c73cd7995d56f77dcd4629d70b5 | [
"MIT"
] | 133 | 2021-09-09T17:53:54.000Z | 2022-03-24T17:17:35.000Z | src/osgui/gtk3/osmenu.inl | rochus-keller/nappgui_src | 394875dfc11c9c73cd7995d56f77dcd4629d70b5 | [
"MIT"
] | 9 | 2021-09-09T21:20:49.000Z | 2022-03-22T00:07:56.000Z | src/osgui/gtk3/osmenu.inl | rochus-keller/nappgui_src | 394875dfc11c9c73cd7995d56f77dcd4629d70b5 | [
"MIT"
] | 10 | 2021-11-25T00:15:32.000Z | 2022-01-18T13:46:32.000Z | /*
* NAppGUI Cross-platform C SDK
* 2015-2022 Francisco Garcia Collado
* MIT Licence
* https://nappgui.com/en/legal/license.html
*
* File: osmenu.inl
*
*/
/* Operating System native menu */
#include "osgui_gtk.ixx"
__EXTERN_C
//HMENU _osmenu_hmenu(OSMenu *menu);
//
GtkWidget *_osmenu_widget(OSMenu *menu);
... | 23.358974 | 118 | 0.755214 | rochus-keller |
f40e8c914623235e0917d21564f4d84355ed0186 | 2,148 | cpp | C++ | atcoder/abc001/C/main.cpp | Johniel/contests | b692eff913c20e2c1eb4ff0ce3cd4c57900594e0 | [
"Unlicense"
] | null | null | null | atcoder/abc001/C/main.cpp | Johniel/contests | b692eff913c20e2c1eb4ff0ce3cd4c57900594e0 | [
"Unlicense"
] | 19 | 2016-05-04T02:46:31.000Z | 2021-11-27T06:18:33.000Z | atcoder/abc001/C/main.cpp | Johniel/contests | b692eff913c20e2c1eb4ff0ce3cd4c57900594e0 | [
"Unlicense"
] | null | null | null | // atcoder/abc001/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template<typename... | 28.263158 | 144 | 0.560521 | Johniel |
f411514dd3f6dd7f4a49999fde14dc34c7484ec3 | 470 | cpp | C++ | Competitive Programing/LargestSumsubarray.cpp | Ritvikjain/DataStructures-And-Algorithms | 27f2d48343aeb91c67376ae2fee429ca92dbd353 | [
"MIT"
] | null | null | null | Competitive Programing/LargestSumsubarray.cpp | Ritvikjain/DataStructures-And-Algorithms | 27f2d48343aeb91c67376ae2fee429ca92dbd353 | [
"MIT"
] | null | null | null | Competitive Programing/LargestSumsubarray.cpp | Ritvikjain/DataStructures-And-Algorithms | 27f2d48343aeb91c67376ae2fee429ca92dbd353 | [
"MIT"
] | null | null | null | #include<iostream>
#include<climits>
using namespace std;
typedef long long ll;
ll kadaneAlgo(int arr[],int n){
ll current_sum = 0;
ll best_sum = INT_MIN;
for(int i=0;i<n;i++)
{
current_sum = current_sum + arr[i];
if(best_sum < current_sum)
best_sum = current_sum;
if(current_sum < 0)
current_sum = 0;
}... | 15.666667 | 37 | 0.63617 | Ritvikjain |
f41204a443398134f6b6f3aaf09c07281cbe9108 | 1,190 | cpp | C++ | src/mathematics/sequence-manipulation/number-theoretic-transform.cpp | Nisiyama-Suzune/LMR | 16325b9efcb71240111ac12ea55c0cb45b0c5834 | [
"MIT"
] | 48 | 2018-08-15T11:58:28.000Z | 2022-02-08T23:38:29.000Z | src/mathematics/sequence-manipulation/number-theoretic-transform.cpp | Nisiyama-Suzune/LMR | 16325b9efcb71240111ac12ea55c0cb45b0c5834 | [
"MIT"
] | null | null | null | src/mathematics/sequence-manipulation/number-theoretic-transform.cpp | Nisiyama-Suzune/LMR | 16325b9efcb71240111ac12ea55c0cb45b0c5834 | [
"MIT"
] | 8 | 2019-07-18T10:27:50.000Z | 2021-06-08T13:03:47.000Z | template <int MAXN = 1000000, int LOGN = 20>
struct ntt {
int MOD[3] = {1045430273, 1051721729, 1053818881}, PRT[3] = {3, 6, 7};
int exp[LOGN][MAXN][2];
void init (int n, int mod = 998244353, int prt = 3) {
for (int i = 2, cnt = 0; i <= n; i <<= 1, ++cnt) {
exp[cnt][0][0] = exp[cnt][0][1] = 1; exp[cnt][1][0] = ... | 49.583333 | 87 | 0.429412 | Nisiyama-Suzune |
f412b3c420bf205490e3fb4a41af8b87a10c681d | 4,923 | cpp | C++ | src/qt/qtbase/src/gui/kernel/qplatformnativeinterface.cpp | chihlee/phantomjs | 644e0b3a6c9c16bcc6f7ce2c24274bf7d764f53c | [
"BSD-3-Clause"
] | null | null | null | src/qt/qtbase/src/gui/kernel/qplatformnativeinterface.cpp | chihlee/phantomjs | 644e0b3a6c9c16bcc6f7ce2c24274bf7d764f53c | [
"BSD-3-Clause"
] | null | null | null | src/qt/qtbase/src/gui/kernel/qplatformnativeinterface.cpp | chihlee/phantomjs | 644e0b3a6c9c16bcc6f7ce2c24274bf7d764f53c | [
"BSD-3-Clause"
] | null | null | null | /****************************************************************************
**
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL21$
** Commercial License Usage
** Licensee... | 30.388889 | 155 | 0.74548 | chihlee |
f4137ac2d82cc0ae8dddd212fde6f2d1dbec758c | 3,982 | hpp | C++ | 03_Main/binarytreeval.hpp | JuanPab3/Molecular-mutations-analysis | a4a8b9d16bc9cd5f4bb22ef6d708b1eddc2190fd | [
"MIT"
] | null | null | null | 03_Main/binarytreeval.hpp | JuanPab3/Molecular-mutations-analysis | a4a8b9d16bc9cd5f4bb22ef6d708b1eddc2190fd | [
"MIT"
] | null | null | null | 03_Main/binarytreeval.hpp | JuanPab3/Molecular-mutations-analysis | a4a8b9d16bc9cd5f4bb22ef6d708b1eddc2190fd | [
"MIT"
] | null | null | null | #ifndef _BINARYTREE_HPP
#define _BINARYTREE_HPP
#include <stdexcept>
#include <iostream>
#include <vector>
struct BSTNode {
float key;
std::vector<std::string> value;
BSTNode *left;
BSTNode *right;
BSTNode *parent;
};
class BST {
private:
int sz = 0;
BSTNode *root;
void insert_node(BSTNode* &n... | 23.423529 | 101 | 0.574083 | JuanPab3 |
f41a24b629571a7712d21d88153678596ec45d49 | 2,535 | cpp | C++ | src/SettingsDialog.cpp | tudoroancea/cube-timer | 377ba5247ff1c041eaa044a9b0281ca0f168ecc8 | [
"MIT"
] | 1 | 2021-05-06T17:08:55.000Z | 2021-05-06T17:08:55.000Z | src/SettingsDialog.cpp | tudoroancea/cube-timer | 377ba5247ff1c041eaa044a9b0281ca0f168ecc8 | [
"MIT"
] | null | null | null | src/SettingsDialog.cpp | tudoroancea/cube-timer | 377ba5247ff1c041eaa044a9b0281ca0f168ecc8 | [
"MIT"
] | null | null | null | //
// Created by Tudor Oancea on 12/05/2021.
// Copyright (c) 2021 Tudor Oancea.. All rights reserved.
// Licensed under the MIT licence (see details at https://github.com/tudoroancea/cube-timer/blob/develop/LICENSE)
//
#include "SettingsDialog.hpp"
#include <QBoxLayout>
#include <QCheckBox>
#include <QGuiApplication... | 42.966102 | 167 | 0.625247 | tudoroancea |
f41ecc1efa083bba1d0f88d6d9b255741525a2a1 | 1,415 | hpp | C++ | lib/gltf/GLTFNode.hpp | caandewiel/PVK-Engine | 41bc2bbfbe5d579710ee141fb5e6c60c1e900177 | [
"MIT"
] | null | null | null | lib/gltf/GLTFNode.hpp | caandewiel/PVK-Engine | 41bc2bbfbe5d579710ee141fb5e6c60c1e900177 | [
"MIT"
] | null | null | null | lib/gltf/GLTFNode.hpp | caandewiel/PVK-Engine | 41bc2bbfbe5d579710ee141fb5e6c60c1e900177 | [
"MIT"
] | null | null | null | //
// PvkGLTFNode.hpp
// PVK
//
// Created by Christian aan de Wiel on 10/01/2021.
//
#ifndef PvkGLTFNode_hpp
#define PvkGLTFNode_hpp
#include <glm/glm.hpp>
#include <map>
#include <vector>
#include <vulkan/vulkan.hpp>
#include "../buffer/buffer.hpp"
#include "../mesh/mesh.hpp"
#include "../util/util.hpp"
#inclu... | 22.109375 | 67 | 0.643816 | caandewiel |
f42092887973f67e0ba54ba6dd762bfe61bee486 | 874 | cpp | C++ | Cpp/549_binary_tree_longest_consecutive_sequence_III/solution.cpp | zszyellow/leetcode | 2ef6be04c3008068f8116bf28d70586e613a48c2 | [
"MIT"
] | 1 | 2015-12-19T23:05:35.000Z | 2015-12-19T23:05:35.000Z | Cpp/549_binary_tree_longest_consecutive_sequence_III/solution.cpp | zszyellow/leetcode | 2ef6be04c3008068f8116bf28d70586e613a48c2 | [
"MIT"
] | null | null | null | Cpp/549_binary_tree_longest_consecutive_sequence_III/solution.cpp | zszyellow/leetcode | 2ef6be04c3008068f8116bf28d70586e613a48c2 | [
"MIT"
] | null | null | null | /**
* 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 {
public:
int longestConsecutive(TreeNode* root) {
int res = 0;
dfs(root, root, res);
return re... | 25.705882 | 66 | 0.556064 | zszyellow |
f422539c2a03b005e0a05c9b83759d6546c6edc2 | 329 | cpp | C++ | include/pola/graphic/BlendFunc.cpp | lij0511/pandora | 5988618f29d2f1ba418ef54a02e227903c1e7108 | [
"Apache-2.0"
] | null | null | null | include/pola/graphic/BlendFunc.cpp | lij0511/pandora | 5988618f29d2f1ba418ef54a02e227903c1e7108 | [
"Apache-2.0"
] | null | null | null | include/pola/graphic/BlendFunc.cpp | lij0511/pandora | 5988618f29d2f1ba418ef54a02e227903c1e7108 | [
"Apache-2.0"
] | null | null | null | /*
* BlendFunc.cpp
*
* Created on: 2016年11月11日
* Author: lijing
*/
#include "BlendFunc.h"
namespace pola {
namespace graphic {
BlendFunc::BlendFunc() {
// TODO Auto-generated constructor stub
}
BlendFunc::~BlendFunc() {
// TODO Auto-generated destructor stub
}
} /* namespace graphic */
} /* namespace... | 13.708333 | 40 | 0.662614 | lij0511 |
f423e2f0a528fb57db440b6786c64cf083498531 | 7,225 | cpp | C++ | libsnark/zk_proof_systems/ppzksnark/membership/MembershipTest.cpp | matteocam/libsnark-lego | 180c80783dfb40c90b56bbd8d94a3a2e4964706a | [
"MIT"
] | null | null | null | libsnark/zk_proof_systems/ppzksnark/membership/MembershipTest.cpp | matteocam/libsnark-lego | 180c80783dfb40c90b56bbd8d94a3a2e4964706a | [
"MIT"
] | null | null | null | libsnark/zk_proof_systems/ppzksnark/membership/MembershipTest.cpp | matteocam/libsnark-lego | 180c80783dfb40c90b56bbd8d94a3a2e4964706a | [
"MIT"
] | null | null | null | #include <iostream>
#include <openssl/rsa.h>
#include <openssl/bn.h>
#include <openssl/sha.h>
#include <flint/fmpz.h>
#include <vector>
#include <map>
#include <math.h>
#include <time.h>
#include <string.h>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <cstdio>
#inc... | 35.591133 | 267 | 0.666159 | matteocam |
f427db245ba599cad2823bd68c92f1ac270442c1 | 2,559 | hpp | C++ | include/codegen/include/UnityEngine/TestRunner/NUnitExtensions/Runner/WorkItemFactory.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 1 | 2021-11-12T09:29:31.000Z | 2021-11-12T09:29:31.000Z | include/codegen/include/UnityEngine/TestRunner/NUnitExtensions/Runner/WorkItemFactory.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | null | null | null | include/codegen/include/UnityEngine/TestRunner/NUnitExtensions/Runner/WorkItemFactory.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 2 | 2021-10-03T02:14:20.000Z | 2021-11-12T09:29:36.000Z | // Autogenerated from CppHeaderCreator on 7/27/2020 3:10:35 PM
// Created by Sc2ad
// =========================================================================
#pragma once
#pragma pack(push, 8)
// Begin includes
#include "utils/typedefs.h"
// Including type: System.Object
#include "System/Object.hpp"
#include "utils/i... | 50.176471 | 224 | 0.762016 | Futuremappermydud |
f429ac2d476939c30f003e00a264e2d8b59795cc | 358 | cpp | C++ | 2.1. Variables and Types/main.cpp | joaovmalheiros/Exercicios-Para-Revisao-Cplusplus | b9d523f863fd112b2b7fe72142a7128d5d95badc | [
"MIT"
] | null | null | null | 2.1. Variables and Types/main.cpp | joaovmalheiros/Exercicios-Para-Revisao-Cplusplus | b9d523f863fd112b2b7fe72142a7128d5d95badc | [
"MIT"
] | null | null | null | 2.1. Variables and Types/main.cpp | joaovmalheiros/Exercicios-Para-Revisao-Cplusplus | b9d523f863fd112b2b7fe72142a7128d5d95badc | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
//Initialization of variables
int main()
{
int a = 5; //initial value: 5
int b(3); //initial value: 3
int c{2}; //initial value: 2
int result; //initial value undetermined
a = a + b;
result = a - c;... | 17.9 | 56 | 0.5 | joaovmalheiros |
f43075441806493ecab4f76eafa9d1dd9608d97b | 2,062 | ipp | C++ | include/External/stlib/packages/numerical/optimization/staticDimension/FunctionWithQuadraticPenalty.ipp | bxl295/m4extreme | 2a4a20ebb5b4e971698f7c981de140d31a5e550c | [
"BSD-3-Clause"
] | null | null | null | include/External/stlib/packages/numerical/optimization/staticDimension/FunctionWithQuadraticPenalty.ipp | bxl295/m4extreme | 2a4a20ebb5b4e971698f7c981de140d31a5e550c | [
"BSD-3-Clause"
] | null | null | null | include/External/stlib/packages/numerical/optimization/staticDimension/FunctionWithQuadraticPenalty.ipp | bxl295/m4extreme | 2a4a20ebb5b4e971698f7c981de140d31a5e550c | [
"BSD-3-Clause"
] | null | null | null | // -*- C++ -*-
#if !defined(__FunctionWithQuadraticPenalty_ipp__)
#error This file is an implementation detail of the class FunctionWithQuadraticPenalty.
#endif
namespace numerical {
//
// Constructors
//
template<std::size_t N, class F, class C, typename T, typename P>
inline
FunctionWithQuadraticPen... | 30.323529 | 88 | 0.686712 | bxl295 |
f433438188eb733120cb4bf86addf073ebdc8fde | 1,249 | cc | C++ | test/layout/object.cc | RobertWeber1/cli | 5cb67325610be41014403e9342dddbe942511c2b | [
"MIT"
] | null | null | null | test/layout/object.cc | RobertWeber1/cli | 5cb67325610be41014403e9342dddbe942511c2b | [
"MIT"
] | null | null | null | test/layout/object.cc | RobertWeber1/cli | 5cb67325610be41014403e9342dddbe942511c2b | [
"MIT"
] | null | null | null | #include "catch.h"
#include <cli/layout/object.h>
#include <cli/layout/size_hint.h>
using namespace cli::layout;
using o1 = Object<WidthHint<1,10,2>, HeightHint<3,30,3>>;
using o2 = Object<WidthHint<2,20,2>, HeightHint<2,20,3>>;
using o3 = Object<WidthHint<3,30,2>, HeightHint<1,10,3>>;
TEST_CASE("AddHints")
{
REQ... | 36.735294 | 79 | 0.666934 | RobertWeber1 |
f434bd22f0059fdb6cdd42107b1885496d16e7a3 | 824 | cpp | C++ | Plugins/IKPluginSandbox/Source/IKPluginSandbox/Private/AnimGraphNode_ParticleIK.cpp | monguri/IKSandbox | fc7df643acc1f6d6955b53c30f310e5f3906244c | [
"MIT"
] | 1 | 2021-05-11T07:17:23.000Z | 2021-05-11T07:17:23.000Z | Plugins/IKPluginSandbox/Source/IKPluginSandbox/Private/AnimGraphNode_ParticleIK.cpp | monguri/IKSandbox | fc7df643acc1f6d6955b53c30f310e5f3906244c | [
"MIT"
] | null | null | null | Plugins/IKPluginSandbox/Source/IKPluginSandbox/Private/AnimGraphNode_ParticleIK.cpp | monguri/IKSandbox | fc7df643acc1f6d6955b53c30f310e5f3906244c | [
"MIT"
] | 1 | 2022-01-05T10:24:40.000Z | 2022-01-05T10:24:40.000Z | // Fill out your copyright notice in the Description page of Project Settings.
#include "AnimGraphNode_ParticleIK.h"
/////////////////////////////////////////////////////
// UAnimGraphNode_LookAt
#define LOCTEXT_NAMESPACE "AnimGraph_ParticleIK"
UAnimGraphNode_ParticleIK::UAnimGraphNode_ParticleIK(const FObjectInit... | 25.75 | 110 | 0.765777 | monguri |
f437dbc8fafaff316d5b11d1e5ace74c13c63929 | 2,017 | cpp | C++ | src/misc.cpp | Angluca/GSAdapter | 350faa6362852b8ca48611c09008e3e334a2de33 | [
"MIT"
] | null | null | null | src/misc.cpp | Angluca/GSAdapter | 350faa6362852b8ca48611c09008e3e334a2de33 | [
"MIT"
] | null | null | null | src/misc.cpp | Angluca/GSAdapter | 350faa6362852b8ca48611c09008e3e334a2de33 | [
"MIT"
] | null | null | null | #include "misc.h"
#include "md5.h"
#include <stdio.h>
#include <string.h>
void GetMD5(char *md5buf, char *data, int datasize)
{
struct MD5Context md5c;
char *s = data;
unsigned char ss[16];
char tmp[3]={'\0'};
int i;
MD5Init( &md5c );
MD5Update( &md5c, (unsigned char*)s, datasize);
MD5Final( ss, &md5c );
fo... | 24.597561 | 105 | 0.657412 | Angluca |
f4387185e4c683e6e0fa8364ebf84d8f56d232ee | 3,509 | cpp | C++ | dotNetInstallerLib/InstallUILevel.cpp | mariusbancila/dotnetinstaller | 36567509faef246ce95af6d567c945ff0bb90a22 | [
"MIT"
] | 62 | 2015-01-14T14:41:52.000Z | 2018-01-03T19:07:06.000Z | dotNetInstallerLib/InstallUILevel.cpp | mariusbancila/dotnetinstaller | 36567509faef246ce95af6d567c945ff0bb90a22 | [
"MIT"
] | 37 | 2015-01-14T19:43:48.000Z | 2018-01-03T00:21:44.000Z | dotNetInstallerLib/InstallUILevel.cpp | mariusbancila/dotnetinstaller | 36567509faef246ce95af6d567c945ff0bb90a22 | [
"MIT"
] | 30 | 2018-02-05T19:04:22.000Z | 2022-01-21T10:43:41.000Z | #include "stdafx.h"
#include "InstallUILevel.h"
shared_any<InstallUILevelSetting *, close_delete> InstallUILevelSetting::Instance;
InstallUILevelSetting::InstallUILevelSetting()
: m_ConfigLevel(InstallUILevelNotSet)
, m_RuntimeLevel(InstallUILevelNotSet)
{
}
void InstallUILevelSetting::SetConfigLevel(In... | 23.550336 | 104 | 0.655457 | mariusbancila |
f4390954df7b2c2a463b081532a5c34f951434db | 37,728 | cpp | C++ | runProgram.cpp | magnusolavhelland/CSD-software | f3e4fe497485acef0668e1bba47fe85bdbba1f73 | [
"MIT"
] | null | null | null | runProgram.cpp | magnusolavhelland/CSD-software | f3e4fe497485acef0668e1bba47fe85bdbba1f73 | [
"MIT"
] | null | null | null | runProgram.cpp | magnusolavhelland/CSD-software | f3e4fe497485acef0668e1bba47fe85bdbba1f73 | [
"MIT"
] | 1 | 2018-03-04T20:16:53.000Z | 2018-03-04T20:16:53.000Z | #include <string>
#include <list>
#include <vector>
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cmath>
#include <sys/time.h>
#include <ctime>
#include <omp.h>
#include "queryValidation.h"
#include "preprocessing.h"
#include "fileIO.h"
#include "subsampling2.h"
#include "correlation.h"
#include ... | 27.823009 | 295 | 0.603875 | magnusolavhelland |
f44205d2869dd40cee907afb348da1a764fa6485 | 1,399 | cpp | C++ | ui/CxDrawShapes/TimerGenPage.cpp | johnzcdGitHub/SuperCxHMI | e897b7bdf30cfe3bfeb5b8738e10c7205ebcd665 | [
"MIT"
] | 118 | 2015-05-19T09:19:01.000Z | 2022-02-24T15:18:51.000Z | ui/CxDrawShapes/TimerGenPage.cpp | PythonYanshenguan/SuperCxHMI | 19f681583fca56c528b51b5821fe842c80bcae24 | [
"MIT"
] | 1 | 2016-10-24T02:48:03.000Z | 2020-04-20T01:53:31.000Z | ui/CxDrawShapes/TimerGenPage.cpp | PythonYanshenguan/SuperCxHMI | 19f681583fca56c528b51b5821fe842c80bcae24 | [
"MIT"
] | 98 | 2015-02-11T07:16:47.000Z | 2022-02-24T02:15:27.000Z | // TimerGenPage.cpp : Implementation of CTimerGenPage
#include "stdafx.h"
#include "CxDrawShapes.h"
#include "TimerGenPage.h"
/////////////////////////////////////////////////////////////////////////////
// CTimerGenPage
LRESULT CTimerGenPage::OnInitDialog(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)
{
m... | 20.275362 | 97 | 0.688349 | johnzcdGitHub |
f445d4b5a1d802e7dcc548853cc0ca8517d39d60 | 10,605 | cpp | C++ | test/src/WinControls/StaticDialog/RunDlg/RunDlg.cpp | theoremprover/cpp-parser | 543cd50acc9e08aadf278b9c970d4db6c332887a | [
"BSD-3-Clause"
] | 18 | 2018-05-10T18:50:06.000Z | 2022-01-11T17:11:34.000Z | test/src/WinControls/StaticDialog/RunDlg/RunDlg.cpp | theoremprover/cpp-parser | 543cd50acc9e08aadf278b9c970d4db6c332887a | [
"BSD-3-Clause"
] | 24 | 2018-06-14T17:54:17.000Z | 2022-03-11T23:21:29.000Z | test/src/WinControls/StaticDialog/RunDlg/RunDlg.cpp | theoremprover/cpp-parser | 543cd50acc9e08aadf278b9c970d4db6c332887a | [
"BSD-3-Clause"
] | 4 | 2019-04-02T16:04:34.000Z | 2022-01-10T11:44:43.000Z | //this file is part of notepad++
//Copyright (C)2003 Don HO ( donho@altern.org )
//
//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 the License, or (at your option) a... | 29.705882 | 138 | 0.620556 | theoremprover |
f4471b736fd230c662cdf0154d88b56654116b91 | 3,022 | cpp | C++ | CtrlLib/FrameSplitter.cpp | koz4k/soccer | 7bceea654b50c5c0e18effd38e79249bd295e0a4 | [
"MIT"
] | 1 | 2018-09-28T17:04:11.000Z | 2018-09-28T17:04:11.000Z | CtrlLib/FrameSplitter.cpp | koz4k/soccer | 7bceea654b50c5c0e18effd38e79249bd295e0a4 | [
"MIT"
] | 1 | 2021-04-06T21:57:39.000Z | 2021-04-06T21:57:39.000Z | CtrlLib/FrameSplitter.cpp | koz4k/soccer | 7bceea654b50c5c0e18effd38e79249bd295e0a4 | [
"MIT"
] | 3 | 2017-08-26T12:06:05.000Z | 2019-11-22T16:57:47.000Z | #include "CtrlLib.h"
namespace Upp {
void SplitterFrame::FrameAdd(Ctrl& parent)
{
parent.Add(*this);
}
void SplitterFrame::FrameRemove()
{
this->Ctrl::Remove();
}
void SplitterFrame::FrameAddSize(Size& sz)
{
if (IsShown()) (type == LEFT || type == RIGHT ? sz.cx : sz.cy) += size;
}
int SplitterFrame::BoundSize(... | 19.623377 | 97 | 0.644275 | koz4k |
f447b367e9c0ccec1688d3f0966fa372c310860e | 69 | cpp | C++ | OJ/hackerearth/h_13_bricks_game.cpp | ONGOING-Z/DataStructure | 9099393d1c7dfabc3e2939586ea6d1d254631eb2 | [
"MIT"
] | null | null | null | OJ/hackerearth/h_13_bricks_game.cpp | ONGOING-Z/DataStructure | 9099393d1c7dfabc3e2939586ea6d1d254631eb2 | [
"MIT"
] | 2 | 2021-10-31T10:05:45.000Z | 2022-02-12T15:17:53.000Z | OJ/hackerearth/h_13_bricks_game.cpp | ONGOING-Z/DataStructure | 9099393d1c7dfabc3e2939586ea6d1d254631eb2 | [
"MIT"
] | null | null | null | // h_13_bricks_game
#include <cstdio>
int main(){
return 0;
} | 13.8 | 20 | 0.623188 | ONGOING-Z |
f4494fdb953bc2385d0daaf2dadb0e351f1e09f4 | 576 | cpp | C++ | all/native/styles/PointStyle.cpp | JianYT/mobile-sdk | 1835603e6cb7994222fea681928dc90055816628 | [
"BSD-3-Clause"
] | 155 | 2016-10-20T08:39:13.000Z | 2022-02-27T14:08:32.000Z | all/native/styles/PointStyle.cpp | JianYT/mobile-sdk | 1835603e6cb7994222fea681928dc90055816628 | [
"BSD-3-Clause"
] | 448 | 2016-10-20T12:33:06.000Z | 2022-03-22T14:42:58.000Z | all/native/styles/PointStyle.cpp | JianYT/mobile-sdk | 1835603e6cb7994222fea681928dc90055816628 | [
"BSD-3-Clause"
] | 64 | 2016-12-05T16:04:31.000Z | 2022-02-07T09:36:22.000Z | #include "PointStyle.h"
namespace carto {
PointStyle::PointStyle(const Color& color, const std::shared_ptr<Bitmap>& bitmap, float clickSize, float size) :
Style(color),
_bitmap(bitmap),
_clickSize(clickSize),
_size(size)
{
}
PointStyle::~PointStyle() {
}
... | 19.862069 | 116 | 0.578125 | JianYT |
f44a384b01f2728f8ca07f1cb6bfd74122dea67f | 5,010 | cpp | C++ | gpugi/control/scriptprocessing.cpp | Wumpf/gpugi | 55fb5d9cf12b34b22e1df0d54c64c1c6e74d8e58 | [
"MIT"
] | 14 | 2015-06-22T06:36:27.000Z | 2020-07-23T20:56:44.000Z | gpugi/control/scriptprocessing.cpp | Wumpf/gpugi | 55fb5d9cf12b34b22e1df0d54c64c1c6e74d8e58 | [
"MIT"
] | 2 | 2015-02-20T14:21:53.000Z | 2015-02-20T14:22:02.000Z | gpugi/control/scriptprocessing.cpp | Wumpf/gpugi | 55fb5d9cf12b34b22e1df0d54c64c1c6e74d8e58 | [
"MIT"
] | 4 | 2016-04-30T13:53:46.000Z | 2021-12-20T14:52:57.000Z | #include "scriptprocessing.hpp"
#include "globalconfig.hpp"
#include "../utilities/logger.hpp"
#include <fstream>
#include <thread>
#include <iostream>
ScriptProcessing::ScriptProcessing() :
m_scriptWaitSeconds(0.0f),
m_scriptWaitIterations(0),
m_consoleWindowThreadRunning(false)
{
}
void ScriptProcessing::RunScr... | 27.527473 | 139 | 0.721357 | Wumpf |
f44ac97a2cd2c614ea10ab0a4ce2435591d9b4a8 | 2,808 | cpp | C++ | DirectX11_Starter_2015/DirectX11_Starter/Button.cpp | QRayarch/ShootyBally | c98d2cdccbc34a346f59d1cedfc4dbd1571e0a46 | [
"MIT"
] | 1 | 2016-03-14T01:58:26.000Z | 2016-03-14T01:58:26.000Z | DirectX11_Starter_2015/DirectX11_Starter/Button.cpp | QRayarch/ShootyBally | c98d2cdccbc34a346f59d1cedfc4dbd1571e0a46 | [
"MIT"
] | null | null | null | DirectX11_Starter_2015/DirectX11_Starter/Button.cpp | QRayarch/ShootyBally | c98d2cdccbc34a346f59d1cedfc4dbd1571e0a46 | [
"MIT"
] | null | null | null | #include "Button.h"
#include "Input.h"
#include "Transform.h"
#include "Entity.h"
Button::Button()
{
Component::Component();
clicked = nullptr;
isHover = false;
currentTime = 0;
currentState = nullptr;
wantedState = nullptr;
}
Button::~Button()
{
}
void Button::ParentSet()
{
element = GetEntity()->GetCompon... | 23.4 | 85 | 0.688034 | QRayarch |
f44b32f0e98f8ec7c6eb88152cfb570378b507e5 | 1,162 | cpp | C++ | wbsModels/Standardized Precipitation Evapotranspiration Index/auxiliary.cpp | RNCan/WeatherBasedSimulationFramework | 19df207d11b1dddf414d78e52bece77f31d45df8 | [
"MIT"
] | 6 | 2017-05-26T21:19:41.000Z | 2021-09-03T14:17:29.000Z | wbsModels/Standardized Precipitation Evapotranspiration Index/auxiliary.cpp | RNCan/WeatherBasedSimulationFramework | 19df207d11b1dddf414d78e52bece77f31d45df8 | [
"MIT"
] | 5 | 2016-02-18T12:39:58.000Z | 2016-03-13T12:57:45.000Z | wbsModels/Standardized Precipitation Evapotranspiration Index/auxiliary.cpp | RNCan/WeatherBasedSimulationFramework | 19df207d11b1dddf414d78e52bece77f31d45df8 | [
"MIT"
] | 1 | 2019-06-16T02:49:20.000Z | 2019-06-16T02:49:20.000Z | // A bunch of auxiliary functions for computing L-moments,
// probability distribution functions, etc.
#include <math.h>
// factorial()
// compute the factorial of an integer
long int factorial(int anInteger)
{
if (anInteger <= 1)
return(1);
else
anInteger = anInteger * factorial(anInteger - 1);
return(anInteg... | 20.75 | 80 | 0.61704 | RNCan |
f44e4daf45d0f7f67c1587b882aed702b21c176c | 125 | cpp | C++ | crates/libclang-wrapper/tests/type_aliases_and_typedefs.cpp | valarx/libclang-wrapper | 1fec2d743835146b43daf4b69c522a637c41a185 | [
"MIT"
] | null | null | null | crates/libclang-wrapper/tests/type_aliases_and_typedefs.cpp | valarx/libclang-wrapper | 1fec2d743835146b43daf4b69c522a637c41a185 | [
"MIT"
] | 1 | 2020-04-30T07:38:48.000Z | 2020-04-30T07:38:48.000Z | crates/libclang-wrapper/tests/type_aliases_and_typedefs.cpp | valarx/cpp-analyzer | 1fec2d743835146b43daf4b69c522a637c41a185 | [
"MIT"
] | null | null | null | #include <cstdint>
struct M{};
using my_integer = std::int32_t;
typedef M TM;
using my_m = M;
using alias_alias = my_m;
| 10.416667 | 32 | 0.688 | valarx |
f4562ad43902a73ce11a2d94c629cf1b160d2ff0 | 4,693 | cpp | C++ | src/barrier.cpp | gerzin/parallel-cellular-automata | dcaf220fa89e8348486aa17d46a864d6ee64e46d | [
"MIT"
] | null | null | null | src/barrier.cpp | gerzin/parallel-cellular-automata | dcaf220fa89e8348486aa17d46a864d6ee64e46d | [
"MIT"
] | null | null | null | src/barrier.cpp | gerzin/parallel-cellular-automata | dcaf220fa89e8348486aa17d46a864d6ee64e46d | [
"MIT"
] | null | null | null | /**
* @file barrier.cpp
* @author Gerardo Zinno (gerardozinno1@gmail.com)
* @brief Implementation of the barrier defined in barrier.hpp
* @version 0.1
* @date 2021-12-22
*
* @copyright Copyright (c) 2021
*
*/
#include <barrier.hpp>
#include <iostream>
#include <stdexcept>
ca::Barrier::Barrier(unsigned n) : m(... | 24.316062 | 104 | 0.479864 | gerzin |
f45b96cf7cf01b169052c9de56b2151119ec0239 | 1,754 | cpp | C++ | ACM-ICPC/1398.cpp | KimBoWoon/ACM-ICPC | 146c36999488af9234d73f7b4b0c10d78486604f | [
"MIT"
] | null | null | null | ACM-ICPC/1398.cpp | KimBoWoon/ACM-ICPC | 146c36999488af9234d73f7b4b0c10d78486604f | [
"MIT"
] | null | null | null | ACM-ICPC/1398.cpp | KimBoWoon/ACM-ICPC | 146c36999488af9234d73f7b4b0c10d78486604f | [
"MIT"
] | null | null | null | #include <cstdio>
#include <climits>
#include <algorithm>
using namespace std;
long long cost;
int dp[101];
void setup() {
int m[] = { 1, 10, 25 };
dp[0] = 0;
for (int i = 1; i <= 99; i++) {
dp[i] = INT_MAX;
for (int j = 0; j < 3; j++) {
if (i - m[j] >= 0) {
dp[i] = min(dp[i], dp[i... | 15.660714 | 51 | 0.398518 | KimBoWoon |
f462a05289ee8089ad09ea48b032b34e246fb064 | 1,121 | cpp | C++ | src/main/cpp/commands/turret/AlignTurretToGoal.cpp | frc2053/Robot2022 | 37dc6ef0bef30d87a4fb93387e00f9c1f452db50 | [
"BSD-3-Clause"
] | null | null | null | src/main/cpp/commands/turret/AlignTurretToGoal.cpp | frc2053/Robot2022 | 37dc6ef0bef30d87a4fb93387e00f9c1f452db50 | [
"BSD-3-Clause"
] | null | null | null | src/main/cpp/commands/turret/AlignTurretToGoal.cpp | frc2053/Robot2022 | 37dc6ef0bef30d87a4fb93387e00f9c1f452db50 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) FIRST and other WPILib contributors.
// Open Source Software; you can modify and/or share it under the terms of
// the WPILib BSD license file in the root directory of this project.
#include "commands/turret/AlignTurretToGoal.h"
// NOTE: Consider using this command inline, rather than writing a subc... | 37.366667 | 114 | 0.777877 | frc2053 |
f464f9914f43434d2880cf757b833f632321b1fe | 423 | cpp | C++ | src/apple-division.cpp | SurajWarrier/cses-problem-set | 6248468f526caef10b2d56d8d6ec71059799d60e | [
"MIT"
] | null | null | null | src/apple-division.cpp | SurajWarrier/cses-problem-set | 6248468f526caef10b2d56d8d6ec71059799d60e | [
"MIT"
] | null | null | null | src/apple-division.cpp | SurajWarrier/cses-problem-set | 6248468f526caef10b2d56d8d6ec71059799d60e | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
lli findMin(lli *p, lli cs, lli sum, lli i) {
if(i==0)
return abs((sum-cs)-cs);
return min(findMin(p,cs+p[i],sum,i-1),findMin(p,cs,sum,i-1));
}
int main() {
lli n;
cin >> n;
lli *p=new lli[n];
lli sum=0;
for(int i=0;i<n;i++) {
cin >> ... | 16.269231 | 62 | 0.55792 | SurajWarrier |
f4661e8434f8d7a27cc127c8b94dfb9e76aefe0b | 335 | cpp | C++ | src/refection/type.cpp | yanghuan/Reflection_C_plus_plus | e58766e0ac2301f9499558c7a6969169220206dd | [
"Apache-2.0"
] | 4 | 2018-02-19T06:06:17.000Z | 2021-03-10T17:28:05.000Z | src/refection/type.cpp | sy-yanghuan/Reflection_C_plus_plus | e58766e0ac2301f9499558c7a6969169220206dd | [
"Apache-2.0"
] | null | null | null | src/refection/type.cpp | sy-yanghuan/Reflection_C_plus_plus | e58766e0ac2301f9499558c7a6969169220206dd | [
"Apache-2.0"
] | 5 | 2017-03-14T09:10:45.000Z | 2021-05-27T03:52:06.000Z | /*
* type.cpp
*
* Created on: 2012-9-26
* Author: yanghuan
*/
#include "type.hpp"
#include "method_wrap.hpp"
#include "register.hpp"
namespace refection {
REFECTION_CLASS_IMPLEMENT_BEGIN(Object)
REFECTION_CLASS_IMPLEMENT_END()
#if 0
REFECTION_CLASS_REGISTER_GLOBAL((refection), Object)
#endif
} // names... | 15.227273 | 52 | 0.734328 | yanghuan |
f46655f7ac73b69b61d5173fc1eb0fbf55f1e8e2 | 6,363 | cpp | C++ | cocos2dx_playground/Classes/ui_practice_RootScene.cpp | R2Road/cocos2dx_playground | 6e6f349b5c9fc702558fe8720ba9253a8ba00164 | [
"Apache-2.0"
] | 9 | 2020-06-11T17:09:44.000Z | 2021-12-25T00:34:33.000Z | cocos2dx_playground/Classes/ui_practice_RootScene.cpp | R2Road/cocos2dx_playground | 6e6f349b5c9fc702558fe8720ba9253a8ba00164 | [
"Apache-2.0"
] | 9 | 2019-12-21T15:01:01.000Z | 2020-12-05T15:42:43.000Z | cocos2dx_playground/Classes/ui_practice_RootScene.cpp | R2Road/cocos2dx_playground | 6e6f349b5c9fc702558fe8720ba9253a8ba00164 | [
"Apache-2.0"
] | 1 | 2020-09-07T01:32:16.000Z | 2020-09-07T01:32:16.000Z | #include "ui_practice_RootScene.h"
#include <new>
#include <numeric>
#include "2d/CCLabel.h"
#include "2d/CCLayer.h"
#include "base/CCDirector.h"
#include "base/CCEventListenerKeyboard.h"
#include "base/CCEventDispatcher.h"
#include "cpg_SStream.h"
#include "cpg_StringTable.h"
#include "PlayGroundScene.h"
#include... | 30.014151 | 126 | 0.683011 | R2Road |
f4678ead6aa584d23f59d960554c5ee21e5bd447 | 10,209 | hpp | C++ | include/NP-Engine/Math/PolygonUtility.hpp | naphipps/NP-Engine | 0cac8b2d5e76c839b96f2061bf57434bdc37915e | [
"MIT"
] | null | null | null | include/NP-Engine/Math/PolygonUtility.hpp | naphipps/NP-Engine | 0cac8b2d5e76c839b96f2061bf57434bdc37915e | [
"MIT"
] | null | null | null | include/NP-Engine/Math/PolygonUtility.hpp | naphipps/NP-Engine | 0cac8b2d5e76c839b96f2061bf57434bdc37915e | [
"MIT"
] | null | null | null | //
// PolygonUtility.hpp
// Project Space
//
// Created by Nathan Phipps on 1/13/19.
// Copyright © 2019 Nathan Phipps. All rights reserved.
//
#ifndef PolygonUtility_hpp
#define PolygonUtility_hpp
#include <limits>
#include <cmath>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
#inclu... | 38.965649 | 117 | 0.687335 | naphipps |
c2e7135914f2ed50debff1711bf37e93793902d2 | 3,618 | cpp | C++ | tools/dds-dbg.cpp | prwhite/philibs | 3cb65bd0dae105026839a3e88d9cebafb72c2616 | [
"Zlib"
] | 5 | 2015-05-12T14:48:03.000Z | 2021-07-14T13:18:16.000Z | tools/dds-dbg.cpp | prwhite/philibs | 3cb65bd0dae105026839a3e88d9cebafb72c2616 | [
"Zlib"
] | null | null | null | tools/dds-dbg.cpp | prwhite/philibs | 3cb65bd0dae105026839a3e88d9cebafb72c2616 | [
"Zlib"
] | 1 | 2021-04-18T07:32:43.000Z | 2021-04-18T07:32:43.000Z | /////////////////////////////////////////////////////////////////////
//
//
//
/////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////
#include "imgdds.h"
#include <string>
#include <cstring>
#include <unistd.h>
#include <cstdio>
#in... | 27.203008 | 106 | 0.525705 | prwhite |
c2ec880f3d2a7dd1a874da6f9614b33e7d331d60 | 17,730 | cc | C++ | src/image/worker.cc | kofuk/pixel-terrain | f39e2a0120aab5a11311f57cfd1ab46efa65fddd | [
"MIT"
] | 2 | 2020-10-16T08:46:45.000Z | 2020-11-04T02:19:19.000Z | src/image/worker.cc | kofuk/minecraft-image-generator | ef2f7deb2daac7f7c2cfb468ef39e0cdc8b33db7 | [
"MIT"
] | null | null | null | src/image/worker.cc | kofuk/minecraft-image-generator | ef2f7deb2daac7f7c2cfb468ef39e0cdc8b33db7 | [
"MIT"
] | null | null | null | // SPDX-License-Identifier: MIT
/* Read whole mca files, and construct intermidiate representation of those,
then decide pixel color and generate PNG image.. */
#include <cstdint>
#include <filesystem>
#include <memory>
#include <string>
#include "graphics/color.hh"
#include "graphics/constants.hh"
#include "grap... | 42.826087 | 80 | 0.448449 | kofuk |
c2edfbfc47c28dc9c5c9d3d278acd9c2c26c6357 | 1,701 | hpp | C++ | plugins/community/repos/Bogaudio/src/Mix4.hpp | x42/VeeSeeVSTRack | 0f5576f92e026ac1480e1477e55084911eca4052 | [
"Zlib",
"BSD-3-Clause"
] | null | null | null | plugins/community/repos/Bogaudio/src/Mix4.hpp | x42/VeeSeeVSTRack | 0f5576f92e026ac1480e1477e55084911eca4052 | [
"Zlib",
"BSD-3-Clause"
] | null | null | null | plugins/community/repos/Bogaudio/src/Mix4.hpp | x42/VeeSeeVSTRack | 0f5576f92e026ac1480e1477e55084911eca4052 | [
"Zlib",
"BSD-3-Clause"
] | null | null | null | #pragma once
#include "bogaudio.hpp"
#include "mixer.hpp"
#include "dsp/signal.hpp"
using namespace bogaudio::dsp;
extern Model* modelMix4;
namespace bogaudio {
struct Mix4 : Module {
enum ParamsIds {
LEVEL1_PARAM,
PAN1_PARAM,
MUTE1_PARAM,
LEVEL2_PARAM,
PAN2_PARAM,
MUTE2_PARAM,
LEVEL3_PARAM,
PAN3_... | 20.25 | 133 | 0.748383 | x42 |
c2f0167a1bf75b01c5f8e8199028ce4e7a1b5719 | 462 | hpp | C++ | SilentCompiler/include/SCompiler.hpp | EdwinRybarczyk/SilentProgrammingLanguage | 1454ca10d87e5d39b0d4d4c35b1dce27c0e04138 | [
"Apache-2.0"
] | 1 | 2018-07-19T08:36:31.000Z | 2018-07-19T08:36:31.000Z | SilentCompiler/include/SCompiler.hpp | EdwinRybarczyk/SilentProgrammingLanguage | 1454ca10d87e5d39b0d4d4c35b1dce27c0e04138 | [
"Apache-2.0"
] | null | null | null | SilentCompiler/include/SCompiler.hpp | EdwinRybarczyk/SilentProgrammingLanguage | 1454ca10d87e5d39b0d4d4c35b1dce27c0e04138 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include <iostream>
#include <vector>
namespace Silent
{
class SilentCompiler
{
private:
std::string source;
std::vector<char*> inFiles;
char* outPath;
std::string output;
public:
SilentCompiler();
void Compile(std::vector<char*> in... | 21 | 64 | 0.595238 | EdwinRybarczyk |
c2f0da8ea5e97078d2f574aaa55d413c4bdd0e40 | 847 | cpp | C++ | MORE CODING PLATFORMS/SPOJ/max_num.cpp | Autoratch/CodeChef | 6937e6b442e19df90a65f772939db9ab1a07a1b3 | [
"Apache-2.0"
] | null | null | null | MORE CODING PLATFORMS/SPOJ/max_num.cpp | Autoratch/CodeChef | 6937e6b442e19df90a65f772939db9ab1a07a1b3 | [
"Apache-2.0"
] | null | null | null | MORE CODING PLATFORMS/SPOJ/max_num.cpp | Autoratch/CodeChef | 6937e6b442e19df90a65f772939db9ab1a07a1b3 | [
"Apache-2.0"
] | null | null | null | // https://www.spoj.com/problems/MAX_NUM/
#include <bits/stdc++.h>
using namespace std;
int t,k;
string s,ans;
deque<pair<int,int> > q;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> t;
while(t--)
{
cin >> s >> k;
for(int i = 0;i <= k;i++)
{
int x ... | 22.289474 | 64 | 0.428571 | Autoratch |
c2fcb4a11640d512a9bf37b454663eb3546095b9 | 2,562 | hpp | C++ | include/fiction/utils/debug/layout_printer.hpp | ElderDelp/fiction | f16bf67bbfd94e5a3d5b6b5cd9cbce5275e44ce8 | [
"MIT"
] | null | null | null | include/fiction/utils/debug/layout_printer.hpp | ElderDelp/fiction | f16bf67bbfd94e5a3d5b6b5cd9cbce5275e44ce8 | [
"MIT"
] | null | null | null | include/fiction/utils/debug/layout_printer.hpp | ElderDelp/fiction | f16bf67bbfd94e5a3d5b6b5cd9cbce5275e44ce8 | [
"MIT"
] | null | null | null | //
// Created by marcel on 15.09.21.
//
#ifndef FICTION_LAYOUT_PRINTER_HPP
#define FICTION_LAYOUT_PRINTER_HPP
#include <fmt/format.h>
#include <iostream>
namespace fiction::debug
{
template <typename Lyt>
void print_node_to_tile_assignments(const Lyt& lyt)
{
std::cout << std::endl << "---- NODE TO TILE ----" <... | 33.272727 | 117 | 0.419204 | ElderDelp |
6c05851a3e940625d664ff0e336020959c7a0ef6 | 2,716 | cpp | C++ | cc/Strategy2/Field.cpp | PEQUI-VSSS/VSSS-EMC | 0c2b61e308f754ca91df52e46ba48828168223df | [
"MIT"
] | 9 | 2017-07-18T12:37:09.000Z | 2018-05-01T14:41:48.000Z | cc/Strategy2/Field.cpp | PEQUI-MEC/VSSS-EMC | 0c2b61e308f754ca91df52e46ba48828168223df | [
"MIT"
] | 31 | 2018-07-31T13:10:01.000Z | 2022-03-26T16:00:25.000Z | cc/Strategy2/Field.cpp | PEQUI-MEC/VSSS-EMC | 0c2b61e308f754ca91df52e46ba48828168223df | [
"MIT"
] | 2 | 2017-10-01T16:09:20.000Z | 2018-05-01T17:39:59.000Z | #include "Field.h"
using namespace field;
// Função que será chamada pela estratégia para saber a localização dos agentes
bool field::at_location(const Geometry::Point &position, const Location location) {
switch (location) {
case Location::OurField:
return position.x < center::point.x;
case Location::TheirFi... | 43.111111 | 117 | 0.675626 | PEQUI-VSSS |
6c06b193651b10b2190c78fe6634afa19d096616 | 2,699 | hpp | C++ | kernel.hpp | m-gul/GPU-BSW | 272cb356b7cf6038e873eb67d78c413ebeda5c12 | [
"BSD-3-Clause-LBNL"
] | 5 | 2020-09-22T03:27:58.000Z | 2021-08-28T02:57:14.000Z | kernel.hpp | m-gul/GPU-BSW | 272cb356b7cf6038e873eb67d78c413ebeda5c12 | [
"BSD-3-Clause-LBNL"
] | 11 | 2020-07-08T19:23:52.000Z | 2021-09-26T22:40:53.000Z | kernel.hpp | m-gul/GPU-BSW | 272cb356b7cf6038e873eb67d78c413ebeda5c12 | [
"BSD-3-Clause-LBNL"
] | 3 | 2020-07-08T17:01:53.000Z | 2021-02-23T08:45:08.000Z | #ifndef KERNEL_HPP
#define KERNEL_HPP
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <sys/time.h>
#define NUM_OF_AA 21
#define ENCOD_MAT_SIZE 91
#define SCORE_MAT_SIZE 576
namespace gpu_bsw{
__device__ short
warpReduceMax_with_index(short val, short& myIndex, short& myIndex2, unsigned lengthSeqB);
... | 43.532258 | 167 | 0.759911 | m-gul |
6c0953d80c330d66d00126e5998fa106a926a3f7 | 1,957 | cpp | C++ | DGEngine.core/src/Parser/ParseShader.cpp | dgcor/Columns | 328c7a72a6feefeb863fe17593583c71c47f6182 | [
"Zlib"
] | 4 | 2021-02-06T01:13:20.000Z | 2021-04-19T12:41:43.000Z | DGEngine.core/src/Parser/ParseShader.cpp | dgengin/Columns | 328c7a72a6feefeb863fe17593583c71c47f6182 | [
"Zlib"
] | null | null | null | DGEngine.core/src/Parser/ParseShader.cpp | dgengin/Columns | 328c7a72a6feefeb863fe17593583c71c47f6182 | [
"Zlib"
] | 1 | 2021-01-02T20:29:28.000Z | 2021-01-02T20:29:28.000Z | #include "ParseShader.h"
#include "FileUtils.h"
#include "Game.h"
#include "Utils/ParseUtils.h"
#include "Utils/Utils.h"
namespace Parser
{
using namespace rapidjson;
using namespace std::literals;
void parseShader(Game& game, const Value& elem)
{
if (isValidString(elem, "id") == false)
{
return;
}
aut... | 23.865854 | 92 | 0.637711 | dgcor |
6c0a92a46fa36a21d82ab5950c1f4b52cb8cc0f3 | 346 | cpp | C++ | Development/Plugin/Lua/wehelper/luaopen_wehelper.cpp | yefq/YDWE | cb0fd16a931a38d3faa8fe55da1c31b90f1a92a7 | [
"Apache-2.0"
] | 1 | 2019-06-25T14:05:28.000Z | 2019-06-25T14:05:28.000Z | Development/Plugin/Lua/wehelper/luaopen_wehelper.cpp | yefq/YDWE | cb0fd16a931a38d3faa8fe55da1c31b90f1a92a7 | [
"Apache-2.0"
] | null | null | null | Development/Plugin/Lua/wehelper/luaopen_wehelper.cpp | yefq/YDWE | cb0fd16a931a38d3faa8fe55da1c31b90f1a92a7 | [
"Apache-2.0"
] | null | null | null | #include <lua.hpp>
#include "YDWELogger.h"
#include "YDWEHook.h"
namespace NYDWE
{
logging::logger* lg;
}
extern "C"
#if defined(_WIN32)
__declspec(dllexport)
#endif
int luaopen_wehelper(lua_State* L) {
NYDWE::lg = logging::get(L);
NYDWE::InstallHooks();
LOGGING_INFO(NYDWE::lg) << "YDWE startup co... | 17.3 | 54 | 0.66763 | yefq |
6c0e4c354ee18bcf4ebddd702e860b7de59c4153 | 605 | hpp | C++ | test/src/Algorithm/Rotate.hpp | changjurhee/CppML | 6d4cc6d0dd2fa3055823f191dc7fe953e4966fc5 | [
"MIT"
] | 48 | 2019-05-14T10:07:08.000Z | 2021-04-08T08:26:20.000Z | test/src/Algorithm/Rotate.hpp | changjurhee/CppML | 6d4cc6d0dd2fa3055823f191dc7fe953e4966fc5 | [
"MIT"
] | null | null | null | test/src/Algorithm/Rotate.hpp | changjurhee/CppML | 6d4cc6d0dd2fa3055823f191dc7fe953e4966fc5 | [
"MIT"
] | 4 | 2019-11-18T15:35:32.000Z | 2021-12-02T05:23:04.000Z | #include "CppML/CppML.hpp"
namespace RotateTest {
template <typename... Ts> struct List {};
void run() {
{
using T =
ml::f<ml::Rotate<1, 3, 4, ml::F<List>>, int, char, bool, double, float>;
static_assert(std::is_same<T, List<int, double, char, bool, float>>::value,
"Rotate with a no... | 30.25 | 80 | 0.575207 | changjurhee |
6c0f0830c1d178990e3ebb6f1d1eb4db8c95b866 | 5,105 | cc | C++ | test/test_vector.cc | pilab-sigma/pml | c0380bd659824e493c4502585fda12c8d3f4b2e0 | [
"MIT"
] | null | null | null | test/test_vector.cc | pilab-sigma/pml | c0380bd659824e493c4502585fda12c8d3f4b2e0 | [
"MIT"
] | 3 | 2017-03-19T11:14:54.000Z | 2017-03-19T11:17:46.000Z | test/test_vector.cc | pilab-sigma/pml | c0380bd659824e493c4502585fda12c8d3f4b2e0 | [
"MIT"
] | null | null | null | #include <cassert>
#include "pml_vector.hpp"
using namespace pml;
std::string test_dir = "/tmp/";
void test_vector(){
std::cout << "test_vector...\n";
// Constructor 1
Vector v1(5, 3);
assert(v1.size() == 5);
assert(all(v1 == 3));
assert(!v1.empty());
// Constructor 2
double d[4] = {1, 2, 3, 4};
... | 21.909871 | 73 | 0.554358 | pilab-sigma |
6c100a38bacbb7b7ed1f394ddd627002742ac0d7 | 1,926 | cpp | C++ | src/Renderer/Vulkan/Framebuffer.cpp | obscurelyme/SDLVulkanRenderer | 0036a982c486a2816df963250bde24e5fa6ec4d7 | [
"MIT"
] | null | null | null | src/Renderer/Vulkan/Framebuffer.cpp | obscurelyme/SDLVulkanRenderer | 0036a982c486a2816df963250bde24e5fa6ec4d7 | [
"MIT"
] | null | null | null | src/Renderer/Vulkan/Framebuffer.cpp | obscurelyme/SDLVulkanRenderer | 0036a982c486a2816df963250bde24e5fa6ec4d7 | [
"MIT"
] | null | null | null | #include "Renderer/Vulkan/Framebuffer.hpp"
#include <SDL2/SDL.h>
#include <array>
#include "Renderer/Vulkan/LogicalDevice.hpp"
#include "Renderer/Vulkan/RenderPass.hpp"
#include "Renderer/Vulkan/Swapchain.hpp"
std::vector<VkFramebuffer> CoffeeMaker::Renderer::Vulkan::Framebuffer::framebuffers{};
void CoffeeMaker::... | 35.666667 | 108 | 0.755971 | obscurelyme |
6c109cabf21ee075f2682f9a52c53f6475cad7df | 789 | cpp | C++ | code/Application/Controllers/PlayerStatsController.cpp | cowdingus/BusinessSim | 24facebd7ac948f0ac65722c10ebb50878342e93 | [
"MIT"
] | 2 | 2021-01-26T09:52:32.000Z | 2021-08-25T06:26:53.000Z | code/Application/Controllers/PlayerStatsController.cpp | cowdingus/BusinessSim | 24facebd7ac948f0ac65722c10ebb50878342e93 | [
"MIT"
] | null | null | null | code/Application/Controllers/PlayerStatsController.cpp | cowdingus/BusinessSim | 24facebd7ac948f0ac65722c10ebb50878342e93 | [
"MIT"
] | null | null | null | #include "Application/Controllers/PlayerStatsController.hpp"
#include "Application/UserInterface/UserInterface.hpp"
#include "Application/UserInterface/UIComponentNames.hpp"
#include "Application/PlayerStats.hpp"
#include <fmt/format.h>
PlayerStatsController::PlayerStatsController(PlayerStats& playerStats, UserInterf... | 32.875 | 100 | 0.809886 | cowdingus |
6c1484c4a6377d3ad85e6cedeadfa7ab0a0c4ee5 | 2,081 | cpp | C++ | youngman/hello-my-friends/1/main.cpp | seirion/code | 3b8bf79764107255185061cec33decbc2235d03a | [
"Apache-2.0"
] | 13 | 2015-06-07T09:26:26.000Z | 2019-05-01T13:23:38.000Z | youngman/hello-my-friends/1/main.cpp | seirion/code | 3b8bf79764107255185061cec33decbc2235d03a | [
"Apache-2.0"
] | null | null | null | youngman/hello-my-friends/1/main.cpp | seirion/code | 3b8bf79764107255185061cec33decbc2235d03a | [
"Apache-2.0"
] | 4 | 2016-03-05T06:21:05.000Z | 2017-02-17T15:34:18.000Z | #include <iostream>
#include <cstdio>
#include <fstream>
#include <cstring>
#include <queue>
#include <map>
#include <set>
using namespace std;
const long long MAX = 9876543210LL;
int row, col, k;
int in[2002][2002];
long long best = MAX;
long long org[2002][2002]; // org
long long v[2002][2002]; // contains a broken... | 30.15942 | 91 | 0.41999 | seirion |
6c1a062fb0b2121903ae7b105027abc33281d04e | 357 | cpp | C++ | Project1/chess_class/chess_bishop.cpp | ZUHXS/Cradle-of-Felicity | bf934071143e57811ed8fe46fba7c54c5e5250fa | [
"MIT"
] | 1 | 2018-06-15T16:37:58.000Z | 2018-06-15T16:37:58.000Z | Project1/chess_class/chess_bishop.cpp | ZUHXS/Cradle-of-Grief | bf934071143e57811ed8fe46fba7c54c5e5250fa | [
"MIT"
] | null | null | null | Project1/chess_class/chess_bishop.cpp | ZUHXS/Cradle-of-Grief | bf934071143e57811ed8fe46fba7c54c5e5250fa | [
"MIT"
] | null | null | null | #include "chess_Bishop.h"
ChessBishop::ChessBishop(int init_cor_x, int init_cor_y, int team, int id,string const &path, bool gamma) : Chess(init_cor_x, init_cor_y, id, team, path, gamma)
{
}
ChessBishop::~ChessBishop()
{
}
void ChessBishop::show(Shader &input_shader)
{
if (check_death())
{
return;
}
this... | 15.521739 | 161 | 0.711485 | ZUHXS |
6c209f424d907be18e31d59b100d5d42631c552f | 2,764 | hpp | C++ | src/gfx-pbr/Gpu/VoxelGI.hpp | murataka/two | f6f9835de844a38687e11f649ff97c3fb4146bbe | [
"Zlib"
] | 578 | 2019-05-04T09:09:42.000Z | 2022-03-27T23:02:21.000Z | src/gfx-pbr/Gpu/VoxelGI.hpp | murataka/two | f6f9835de844a38687e11f649ff97c3fb4146bbe | [
"Zlib"
] | 14 | 2019-05-11T14:34:56.000Z | 2021-02-02T07:06:46.000Z | src/gfx-pbr/Gpu/VoxelGI.hpp | murataka/two | f6f9835de844a38687e11f649ff97c3fb4146bbe | [
"Zlib"
] | 42 | 2019-05-11T16:04:19.000Z | 2022-01-24T02:21:43.000Z |
#pragma once
#ifndef TWO_MODULES
#include <math/Vec.hpp>
#include <gfx/Renderer.h>
#endif
#include <gfx-pbr/Forward.h>
#include <gfx-pbr/VoxelGI.h>
namespace two
{
export_ template <>
struct GpuState<GIProbe>
{
void init(uint16_t array_size = 1U)
{
u_transform = bgfx::createUniform("u_gi_probe_transform... | 31.05618 | 103 | 0.719247 | murataka |
6c25550164a62df753cb24ed2be8943add71397d | 654 | cpp | C++ | test/exceptions.cpp | jfalcou/tts | 5b8326aa8706feb2a03d56d2b0a5ef0e1aa47b40 | [
"MIT"
] | 12 | 2020-11-12T17:15:44.000Z | 2022-03-15T12:59:17.000Z | test/exceptions.cpp | jfalcou/tts | 5b8326aa8706feb2a03d56d2b0a5ef0e1aa47b40 | [
"MIT"
] | 14 | 2019-09-28T14:04:18.000Z | 2021-12-11T20:08:31.000Z | test/exceptions.cpp | jfalcou/tts | 5b8326aa8706feb2a03d56d2b0a5ef0e1aa47b40 | [
"MIT"
] | null | null | null | //==================================================================================================
/**
TTS - Tiny Test System
Copyright : TTS Contributors & Maintainers
SPDX-License-Identifier: MIT
**/
//==================================================================================================
#define T... | 25.153846 | 100 | 0.484709 | jfalcou |
6c2595561965c361f9efb2e536493c9b8e9eb9b1 | 4,241 | cpp | C++ | aws-cpp-sdk-license-manager/source/model/LicenseConversionTask.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-02-12T08:09:30.000Z | 2022-02-12T08:09:30.000Z | aws-cpp-sdk-license-manager/source/model/LicenseConversionTask.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2021-10-14T16:57:00.000Z | 2021-10-18T10:47:24.000Z | aws-cpp-sdk-license-manager/source/model/LicenseConversionTask.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2021-12-30T04:25:33.000Z | 2021-12-30T04:25:33.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/license-manager/model/LicenseConversionTask.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespa... | 23.825843 | 119 | 0.763263 | perfectrecall |
6c26264b047c00fadeb08e5b544307ee11e63e3e | 11,437 | cpp | C++ | src/compiler/variableprocessor.cpp | RugessNome/libscript | e27b1dfeb5cd9eb7e59a6d16e182758a56fc0e4f | [
"MIT"
] | null | null | null | src/compiler/variableprocessor.cpp | RugessNome/libscript | e27b1dfeb5cd9eb7e59a6d16e182758a56fc0e4f | [
"MIT"
] | 4 | 2018-10-13T12:12:11.000Z | 2018-10-30T20:21:01.000Z | src/compiler/variableprocessor.cpp | RugessNome/libscript | e27b1dfeb5cd9eb7e59a6d16e182758a56fc0e4f | [
"MIT"
] | null | null | null | // Copyright (C) 2018 Vincent Chambrin
// This file is part of the libscript library
// For conditions of distribution and use, see copyright notice in LICENSE
#include "script/compiler/variableprocessor.h"
#include "script/compiler/diagnostichelper.h"
#include "script/compiler/compilererrors.h"
#include "script/arr... | 28.169951 | 145 | 0.713212 | RugessNome |
6c27324d17fdef79c4db45dbcb472ff0d8f5509c | 17,657 | cpp | C++ | util/hlsltoy/src/hlsltoy.cpp | valentingalea/shaderbox_p | 4d18b45cac9c9ef75de85697fae497c966e9f76f | [
"MIT"
] | 62 | 2015-04-02T22:27:45.000Z | 2022-03-20T05:17:29.000Z | util/hlsltoy/src/hlsltoy.cpp | valentingalea/shaderbox_p | 4d18b45cac9c9ef75de85697fae497c966e9f76f | [
"MIT"
] | 1 | 2015-09-26T15:51:51.000Z | 2015-09-26T21:20:21.000Z | util/hlsltoy/src/hlsltoy.cpp | valentingalea/shaderbox_p | 4d18b45cac9c9ef75de85697fae497c966e9f76f | [
"MIT"
] | 9 | 2015-12-09T15:53:19.000Z | 2022-01-19T09:44:05.000Z | // from http://the-witness.net/news/2012/11/scopeexit-in-c11/
template <typename F>
struct ScopeExit {
ScopeExit(F f) : f(f) {}
~ScopeExit() { f(); }
F f;
};
template <typename F>
ScopeExit<F> MakeScopeExit(F f) {
return ScopeExit<F>(f);
};
#define STRING_JOIN2(arg1, arg2) DO_STRING_JOIN2(arg1, arg2)
#define DO_STR... | 33.890595 | 186 | 0.750071 | valentingalea |
6c390e260fc8bfc9510a331fe21d844c6cc03bcd | 28,708 | cc | C++ | smbios.cc | karlredgate/dossier | 34600f383a7e9cfceca8e836c36fae972cc7c095 | [
"MIT"
] | 3 | 2015-08-17T12:33:31.000Z | 2016-01-12T16:31:12.000Z | smbios.cc | karlredgate/dossier | 34600f383a7e9cfceca8e836c36fae972cc7c095 | [
"MIT"
] | null | null | null | smbios.cc | karlredgate/dossier | 34600f383a7e9cfceca8e836c36fae972cc7c095 | [
"MIT"
] | null | null | null |
/*
* Copyright (c) 2012 Karl N. Redgate
*
* 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, p... | 24.267117 | 117 | 0.588512 | karlredgate |
6c3a96181db824376b205776796253910dc27377 | 4,628 | cpp | C++ | container/tst_ringbuffer.cpp | v1ne/v1util | 8c70d7b7517b90d62f3adf3a64df213e45818fbe | [
"BSD-2-Clause"
] | null | null | null | container/tst_ringbuffer.cpp | v1ne/v1util | 8c70d7b7517b90d62f3adf3a64df213e45818fbe | [
"BSD-2-Clause"
] | null | null | null | container/tst_ringbuffer.cpp | v1ne/v1util | 8c70d7b7517b90d62f3adf3a64df213e45818fbe | [
"BSD-2-Clause"
] | null | null | null | #include "ringbuffer.hpp"
#include "array_view.hpp"
#include "doctest/doctest.h"
namespace v1util { namespace container { namespace test {
const auto sSomeInts = {5, 23, 42};
TEST_CASE("ringIterator-otherOps") {
auto view = make_array_view(sSomeInts);
auto iRing = RingIterator(view.begin(), view.end());
// ... | 23.612245 | 57 | 0.562014 | v1ne |
6c3dfefb16f90adb27f930a34efe657d8e1668f2 | 3,938 | cc | C++ | http2/headers/headers_test.cc | chronos-tachyon/libhttp2 | f2c9c028e5083c1e1ce0b2d830e9347bac43f17b | [
"MIT"
] | 1 | 2017-05-18T08:23:20.000Z | 2017-05-18T08:23:20.000Z | http2/headers/headers_test.cc | chronos-tachyon/libhttp2 | f2c9c028e5083c1e1ce0b2d830e9347bac43f17b | [
"MIT"
] | null | null | null | http2/headers/headers_test.cc | chronos-tachyon/libhttp2 | f2c9c028e5083c1e1ce0b2d830e9347bac43f17b | [
"MIT"
] | null | null | null | #include "http2/headers/headers.h"
#include "gtest/gtest.h"
using http2::headers::Header;
using http2::headers::Headers;
TEST(Header, EQ) {
Header a = {"foo", "bar"};
Header b = {"foo", "bar"};
EXPECT_EQ(a, b);
Header c = {"foo", "baz"};
EXPECT_NE(a, c);
Header d = {"baz", "bar"};
EXPECT_NE(a, d);
}
T... | 27.347222 | 70 | 0.672423 | chronos-tachyon |
6c4ce2346057acacb908924380a9ef2d90445463 | 2,586 | cc | C++ | net/instaweb/rewriter/decode_rewritten_urls_filter.cc | dimitrilongo/mod_pagespeed | d0d3bc51aa4feddf010b7085872c64cc46b5aae0 | [
"Apache-2.0"
] | 2 | 2019-11-02T07:54:17.000Z | 2020-04-16T09:26:51.000Z | net/instaweb/rewriter/decode_rewritten_urls_filter.cc | dimitrilongo/mod_pagespeed | d0d3bc51aa4feddf010b7085872c64cc46b5aae0 | [
"Apache-2.0"
] | 12 | 2017-03-14T18:26:11.000Z | 2021-10-01T15:33:50.000Z | net/instaweb/rewriter/decode_rewritten_urls_filter.cc | dimitrilongo/mod_pagespeed | d0d3bc51aa4feddf010b7085872c64cc46b5aae0 | [
"Apache-2.0"
] | 1 | 2020-04-16T09:28:30.000Z | 2020-04-16T09:28:30.000Z | /*
* Copyright 2013 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to... | 37.478261 | 78 | 0.70263 | dimitrilongo |
6c4d5c7e67456da90268e5d075e25b0df0c07541 | 1,328 | hpp | C++ | src/umpire/DeviceAllocator.hpp | agcapps/Umpire | ecea50674437a3cac09fab53e5b842979158b44b | [
"MIT-0",
"MIT"
] | null | null | null | src/umpire/DeviceAllocator.hpp | agcapps/Umpire | ecea50674437a3cac09fab53e5b842979158b44b | [
"MIT-0",
"MIT"
] | null | null | null | src/umpire/DeviceAllocator.hpp | agcapps/Umpire | ecea50674437a3cac09fab53e5b842979158b44b | [
"MIT-0",
"MIT"
] | null | null | null | //////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2016-20, Lawrence Livermore National Security, LLC and Umpire
// project contributors. See the COPYRIGHT file for details.
//
// SPDX-License-Identifier: (MIT)
////////////////////////////////////////////////////////////////... | 22.133333 | 79 | 0.623494 | agcapps |
6c5454448174cf85bbe63d929c37cf52aaac8d36 | 1,506 | hpp | C++ | include/codegen/include/Zenject/ToChoices.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 1 | 2021-11-12T09:29:31.000Z | 2021-11-12T09:29:31.000Z | include/codegen/include/Zenject/ToChoices.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | null | null | null | include/codegen/include/Zenject/ToChoices.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 2 | 2021-10-03T02:14:20.000Z | 2021-11-12T09:29:36.000Z | // Autogenerated from CppHeaderCreator on 7/27/2020 3:10:42 PM
// Created by Sc2ad
// =========================================================================
#pragma once
#pragma pack(push, 8)
// Begin includes
// Including type: System.Enum
#include "System/Enum.hpp"
#include "utils/il2cpp-utils.hpp"
// Completed in... | 38.615385 | 76 | 0.694555 | Futuremappermydud |
6c59fa2638e23735e89ae98ca41d9de01539a8e3 | 904 | cpp | C++ | CWin/CWin/control/push_button_control.cpp | benbraide/CWin | 0441b48a71fef0dbddabf61033d7286669772c1e | [
"MIT"
] | null | null | null | CWin/CWin/control/push_button_control.cpp | benbraide/CWin | 0441b48a71fef0dbddabf61033d7286669772c1e | [
"MIT"
] | null | null | null | CWin/CWin/control/push_button_control.cpp | benbraide/CWin | 0441b48a71fef0dbddabf61033d7286669772c1e | [
"MIT"
] | null | null | null | #include "push_button_control.h"
cwin::control::push_button::push_button(tree &parent)
: push_button(parent, static_cast<std::size_t>(-1)){}
cwin::control::push_button::push_button(tree &parent, std::size_t index)
: button(parent, index){}
cwin::control::push_button::~push_button() = default;
DWORD cwin::control:... | 28.25 | 73 | 0.77323 | benbraide |
6c606879b43e6cc5a61ae3bf3dc1b65d48954f08 | 5,130 | hpp | C++ | kit/KitHelper.hpp | CaptainVal/online | a5de33496ccd27ca6d11a245c69f70fd28457092 | [
"BSD-2-Clause"
] | 1 | 2021-07-25T06:22:35.000Z | 2021-07-25T06:22:35.000Z | kit/KitHelper.hpp | CaptainVal/online | a5de33496ccd27ca6d11a245c69f70fd28457092 | [
"BSD-2-Clause"
] | null | null | null | kit/KitHelper.hpp | CaptainVal/online | a5de33496ccd27ca6d11a245c69f70fd28457092 | [
"BSD-2-Clause"
] | null | null | null | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4; fill-column: 100 -*- */
/*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#pragma once... | 34.2 | 121 | 0.517739 | CaptainVal |
6c60f95d8af65a019bba4ac8a3b5df75e209c0d3 | 85 | cpp | C++ | gen/Protobuf3BaseVisitor.cpp | thinkcn/proto2json | 3b36843bdd0b959b1b8fcfd44564790b2d1e8bcc | [
"BSD-2-Clause"
] | 2 | 2020-11-12T08:35:00.000Z | 2022-01-08T12:58:01.000Z | gen/Protobuf3BaseVisitor.cpp | thinkcn/proto2json | 3b36843bdd0b959b1b8fcfd44564790b2d1e8bcc | [
"BSD-2-Clause"
] | null | null | null | gen/Protobuf3BaseVisitor.cpp | thinkcn/proto2json | 3b36843bdd0b959b1b8fcfd44564790b2d1e8bcc | [
"BSD-2-Clause"
] | 1 | 2022-01-08T13:12:54.000Z | 2022-01-08T13:12:54.000Z |
// Generated from Protobuf3.g4 by ANTLR 4.7.1
#include "Protobuf3BaseVisitor.h"
| 10.625 | 45 | 0.729412 | thinkcn |
4846fe96b20d75d48dc4b84c3f236eb7f7ff20a6 | 1,081 | cpp | C++ | hello.cpp | ankiiitraj/questionsSolved | 8452b120935a9c3d808b45f27dcdc05700d902fc | [
"MIT"
] | null | null | null | hello.cpp | ankiiitraj/questionsSolved | 8452b120935a9c3d808b45f27dcdc05700d902fc | [
"MIT"
] | 1 | 2020-02-24T19:45:57.000Z | 2020-02-24T19:45:57.000Z | hello.cpp | ankiiitraj/questionsSolved | 8452b120935a9c3d808b45f27dcdc05700d902fc | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
struct point{
int x, y;
};
int main(){
#ifndef ONLINE_JUDGE
freopen("ip.txt", "r", stdin);
freopen("op.txt", "w", stdout);
#endif
// int a = 1;
// char c = 'a';
// char cc = '';
// float decimal = 7.6;
// type name = "Ujwal"; 'U', 'j', 'w', 'a', 'l'
// in... | 9.827273 | 48 | 0.382054 | ankiiitraj |
48516aa6cc15bee1f48b10f2bbac7181e2099b16 | 939 | cpp | C++ | cppp/src/4-expression/9-11-12.cpp | ahxxm/cpp-exercise | abbe530770d49843ceaf706fb55b91ef100b1162 | [
"WTFPL"
] | 2 | 2016-12-06T00:49:35.000Z | 2017-01-15T07:00:24.000Z | cppp/src/4-expression/9-11-12.cpp | ahxxm/cpp-exercise | abbe530770d49843ceaf706fb55b91ef100b1162 | [
"WTFPL"
] | 5 | 2016-05-02T13:52:52.000Z | 2016-09-28T07:57:09.000Z | cppp/src/4-expression/9-11-12.cpp | ahxxm/cpp-exercise | abbe530770d49843ceaf706fb55b91ef100b1162 | [
"WTFPL"
] | null | null | null | #include <iostream>
int main(void) {
// 9: explain this if
// if: FIRST, `cp` in if means `cp != false`, where false will be 0.
// if cp==0, then `if` will check if `*cp!=0`.
// In this case, cp is not 0, `*cp` won't be evaluated.
const char *cp = "Hello World";
if (cp) {
std::cout << "cp does not eq... | 22.357143 | 82 | 0.503727 | ahxxm |
4854887b45d0204a2e6b27fe7c0c6782cc982cd5 | 1,138 | cc | C++ | src/parser/operations/find-symbols.cc | rimio/cbasic | 1ab520ba5ecca94ce57ce31e73304ade1b44ec66 | [
"MIT"
] | 2 | 2015-01-28T09:01:51.000Z | 2015-02-09T11:17:45.000Z | src/parser/operations/find-symbols.cc | rimio/cbasic | 1ab520ba5ecca94ce57ce31e73304ade1b44ec66 | [
"MIT"
] | 9 | 2015-01-27T17:48:53.000Z | 2015-02-09T22:15:24.000Z | src/parser/operations/find-symbols.cc | rimio/cbasic | 1ab520ba5ecca94ce57ce31e73304ade1b44ec66 | [
"MIT"
] | 1 | 2020-04-09T10:33:44.000Z | 2020-04-09T10:33:44.000Z | #include "find-symbols.h"
#include "symbols/symbol-table.h"
#include "parser/nodes/parser-node.h"
#include "parser/nodes/statement-nodes.h"
ParserNode *find_symbols (ParserNode *node, struct TreeWalkContext *context)
{
// Check statements
if (node->getNodeType () == PT_STATEMENT)
{
StatementNode *st = (StatementN... | 29.947368 | 122 | 0.65993 | rimio |
48560f0183ada1d8505cdb73d4c739c28352aae2 | 562 | cpp | C++ | Gui/models/PPMSettingsModel.cpp | igui/OppositeRenderer | 2442741792b3f0f426025c2015002694fab692eb | [
"MIT"
] | 9 | 2016-06-25T15:52:05.000Z | 2020-01-15T17:31:49.000Z | Gui/models/PPMSettingsModel.cpp | igui/OppositeRenderer | 2442741792b3f0f426025c2015002694fab692eb | [
"MIT"
] | null | null | null | Gui/models/PPMSettingsModel.cpp | igui/OppositeRenderer | 2442741792b3f0f426025c2015002694fab692eb | [
"MIT"
] | 2 | 2018-10-17T18:33:37.000Z | 2022-03-14T20:17:30.000Z | /*
* Copyright (c) 2013 Opposite Renderer
* For the full copyright and license information, please view the LICENSE.txt
* file that was distributed with this source code.
*/
#include "PPMSettingsModel.hxx"
PPMSettingsModel::PPMSettingsModel(void)
: m_PPMInitialRadius(0.0f)
{
}
PPMSettingsModel::~PPMSettingsM... | 20.071429 | 78 | 0.761566 | igui |
48630ca7a1249304141939aca3cf3f5affc75331 | 1,745 | cpp | C++ | abserv/abserv/MailBox.cpp | pablokawan/ABx | 064d6df265c48c667ce81b0a83f84e5e22a7ff53 | [
"MIT"
] | null | null | null | abserv/abserv/MailBox.cpp | pablokawan/ABx | 064d6df265c48c667ce81b0a83f84e5e22a7ff53 | [
"MIT"
] | null | null | null | abserv/abserv/MailBox.cpp | pablokawan/ABx | 064d6df265c48c667ce81b0a83f84e5e22a7ff53 | [
"MIT"
] | null | null | null | /**
* Copyright 2017-2020 Stefan Ascher
*
* 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, pub... | 31.160714 | 85 | 0.718625 | pablokawan |
4864689add883f5e34e6d3eee0854c61560b1636 | 2,583 | hpp | C++ | physics/apsides.hpp | net-lisias-ksp/Principia | 9292ea1fc2e4b4f0ce7a717e2f507168519f5f8a | [
"MIT"
] | 2 | 2016-02-14T21:18:48.000Z | 2017-02-11T23:23:20.000Z | physics/apsides.hpp | net-lisias-ksp/Principia | 9292ea1fc2e4b4f0ce7a717e2f507168519f5f8a | [
"MIT"
] | 1 | 2015-07-27T21:27:46.000Z | 2015-07-27T21:27:46.000Z | physics/apsides.hpp | pleroy/Principia | 64c4c6c124f4744381b6489e39e6b53e2a440ce9 | [
"MIT"
] | null | null | null | #pragma once
#include <functional>
#include "absl/status/status.h"
#include "base/constant_function.hpp"
#include "physics/discrete_trajectory.hpp"
#include "physics/trajectory.hpp"
namespace principia {
namespace physics {
namespace internal_apsides {
using base::ConstantFunction;
using base::Identically;
using ge... | 39.136364 | 79 | 0.668215 | net-lisias-ksp |
48654069c3bc72c5b6a80b56ea81bbdfe04006de | 1,416 | hpp | C++ | src/interactivity/win32/consoleKeyInfo.hpp | Ghosty141/Terminal | c1220435bea5790ea3596b30568f724b74ce5dda | [
"MIT"
] | 34,359 | 2019-05-06T21:04:42.000Z | 2019-05-14T22:06:43.000Z | src/interactivity/win32/consoleKeyInfo.hpp | Ghosty141/Terminal | c1220435bea5790ea3596b30568f724b74ce5dda | [
"MIT"
] | 356 | 2019-05-06T21:03:35.000Z | 2019-05-14T21:38:47.000Z | src/interactivity/win32/consoleKeyInfo.hpp | Ghosty141/Terminal | c1220435bea5790ea3596b30568f724b74ce5dda | [
"MIT"
] | 3,164 | 2019-05-06T21:06:01.000Z | 2019-05-14T20:25:52.000Z | /*++
Copyright (c) Microsoft Corporation
Licensed under the MIT license.
Module Name:
- consoleKeyInfo.hpp
Abstract:
- This module represents a queue of stored WM_KEYDOWN messages
that we will match up with the WM_CHARs that arrive later in the window message queue
after being posted by TranslateMessage... | 44.25 | 124 | 0.78178 | Ghosty141 |
486b62fa78c87850ac4e55b20326ef9c71b4afd1 | 9,193 | cpp | C++ | Modules/src/OTS_Button/OTS_Button.cpp | jax-b/ModulerKTNE | a2b8da606372c84e0c6ff2eabb126e02ed966db2 | [
"MIT"
] | null | null | null | Modules/src/OTS_Button/OTS_Button.cpp | jax-b/ModulerKTNE | a2b8da606372c84e0c6ff2eabb126e02ed966db2 | [
"MIT"
] | null | null | null | Modules/src/OTS_Button/OTS_Button.cpp | jax-b/ModulerKTNE | a2b8da606372c84e0c6ff2eabb126e02ed966db2 | [
"MIT"
] | null | null | null | #include "OTS_Button.h"
//#define DEBUG_MODE true
OTS_Button::OTS_Button()
{
const char realModID[] = "bttn";
for (uint8_t i = 0; i < 4; i++)
{
modID[i] = realModID[i];
}
}
void OTS_Button::clearModule()
{
OTS_Button::_pixels->setPixelColor(1, 0);
OTS_Button::_pixels->setPixelColor(0,... | 31.375427 | 240 | 0.602632 | jax-b |
487181eb70369d73526ac95d2ab773831cb7aafe | 921 | hpp | C++ | src/eepp/helper/haikuttf/hkglyph.hpp | dogtwelve/eepp | dd672ff0e108ae1e08449ca918dc144018fb4ba4 | [
"MIT"
] | null | null | null | src/eepp/helper/haikuttf/hkglyph.hpp | dogtwelve/eepp | dd672ff0e108ae1e08449ca918dc144018fb4ba4 | [
"MIT"
] | null | null | null | src/eepp/helper/haikuttf/hkglyph.hpp | dogtwelve/eepp | dd672ff0e108ae1e08449ca918dc144018fb4ba4 | [
"MIT"
] | null | null | null | #ifndef HAIKUTTF_HKGLYPH_HPP
#define HAIKUTTF_HKGLYPH_HPP
#include "hkbase.hpp"
namespace HaikuTTF {
class hkGlyph {
public:
hkGlyph();
~hkGlyph();
int Stored() const;
void Stored( int stored );
FT_UInt Index() const;
void Index( FT_UInt index );
FT_Bitmap * Pixmap();
void Pixmap( const FT... | 15.098361 | 42 | 0.621064 | dogtwelve |
487693c9f4b781bf8099e580839e50cd796a24a1 | 1,158 | cpp | C++ | Source/Main.cpp | ShannonHG/CHIP-8-Emulator | 37a69e031d276c3ec0d170c34bcaac0450a91d7e | [
"MIT"
] | 6 | 2021-03-11T13:35:45.000Z | 2022-01-25T06:40:44.000Z | Source/Main.cpp | ShannonHG/CHIP-8-Emulator | 37a69e031d276c3ec0d170c34bcaac0450a91d7e | [
"MIT"
] | null | null | null | Source/Main.cpp | ShannonHG/CHIP-8-Emulator | 37a69e031d276c3ec0d170c34bcaac0450a91d7e | [
"MIT"
] | null | null | null | #include <iostream>
#include <chrono>
#include <SDL.h>
#include "Memory.hpp"
#include "Display.hpp"
#include "Keypad.hpp"
#include "CPU.hpp"
using namespace std::chrono;
static const int SCREEN_WIDTH = 640;
static const int SCREEN_HEIGHT = 320;
static const int ROM_PATH_INDEX = 1;
static const int INSTRUCTIONS_PER_SE... | 23.16 | 109 | 0.695164 | ShannonHG |
487b9071e2360530e6762e6e29d30c3fce63e959 | 1,068 | hpp | C++ | labs/6/Practice_05 - Foosball Tournament Workshop/FoosballTournament/Tournament.hpp | triffon/oop-2019-20 | db199631d59ddefdcc0c8eb3d689de0095618f92 | [
"MIT"
] | 19 | 2020-02-21T16:46:50.000Z | 2022-01-26T19:59:49.000Z | labs/6/Practice_05 - Foosball Tournament Workshop/FoosballTournament/Tournament.hpp | triffon/oop-2019-20 | db199631d59ddefdcc0c8eb3d689de0095618f92 | [
"MIT"
] | 1 | 2020-03-14T08:09:45.000Z | 2020-03-14T08:09:45.000Z | labs/6/Practice_05 - Foosball Tournament Workshop/FoosballTournament/Tournament.hpp | triffon/oop-2019-20 | db199631d59ddefdcc0c8eb3d689de0095618f92 | [
"MIT"
] | 11 | 2020-02-23T12:29:58.000Z | 2021-04-11T08:30:12.000Z | #pragma once
#include <iostream>
#include "Team.hpp"
class Tournament
{
public:
void registerTeam(Team team);
void begin();
public:
Tournament(size_t capacity = DefaultCapacity);
Tournament(const Tournament& other);
Tournament& operator=(const Tournament& other);
~Tournament();
private:
void del();
void copy(... | 26.04878 | 73 | 0.770599 | triffon |
487f467d15f119b470cba02e79d1cac431dd265d | 1,358 | cpp | C++ | Group3_FinalProject/HUD.cpp | BrandonLittell/PinballGL | d2678f0e916cdb8b8a234243feeda03a196e5bc8 | [
"MIT"
] | 1 | 2016-12-17T12:28:42.000Z | 2016-12-17T12:28:42.000Z | Group3_FinalProject/HUD.cpp | BrandonLittell/PinballGL | d2678f0e916cdb8b8a234243feeda03a196e5bc8 | [
"MIT"
] | null | null | null | Group3_FinalProject/HUD.cpp | BrandonLittell/PinballGL | d2678f0e916cdb8b8a234243feeda03a196e5bc8 | [
"MIT"
] | null | null | null |
#include "HUD.h"
HUD::HUD( HDC& ahDC, HGLRC& ahRC ) : textWriter( ahDC, ahRC )
{
titleString = "PINBALL";
scoreString = "SCORE:";
ballString = "BALLS: ";
int numVerts = 4;
vec2* bgVerts = new vec2[numVerts];
bgVerts[0] = vec2(0.0, 0.0);
bgVerts[1] = vec2(0.0, WINDOW_HEIGHT);
bgVerts[2] = vec2(WINDOW_WIDTH/... | 28.291667 | 101 | 0.67673 | BrandonLittell |
48820723fe7b757c6bfc85fa41e30d4550eac147 | 1,827 | hpp | C++ | include/System/Memory/Allocator.hpp | TheIllusionistMirage/iridescent | 68bc3b310298ab764cdd5772c5bc95be0ad5e768 | [
"Zlib"
] | 1 | 2018-04-22T06:08:42.000Z | 2018-04-22T06:08:42.000Z | include/System/Memory/Allocator.hpp | TheIllusionistMirage/iridescent | 68bc3b310298ab764cdd5772c5bc95be0ad5e768 | [
"Zlib"
] | null | null | null | include/System/Memory/Allocator.hpp | TheIllusionistMirage/iridescent | 68bc3b310298ab764cdd5772c5bc95be0ad5e768 | [
"Zlib"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////
// Allocator
///////////////////////////////////////////////////////////////////////////
#ifndef ALLOCATOR_HPP
#define ALLOCATOR_HPP
#include "System/Log.hpp"
#include "System/Memory/Pool.hpp"
namespace Iridescent
{
namespace System
{
name... | 20.52809 | 99 | 0.530378 | TheIllusionistMirage |
4882f5761a655e4a6484a5d357d37795a6232a71 | 22,858 | cpp | C++ | Src/VC/bcgcbpro/BCGPVisualManagerVS2008.cpp | iclosure/smartsoft | 62eaed49efd8306642b928ef4f2d96e36aca6527 | [
"MIT"
] | null | null | null | Src/VC/bcgcbpro/BCGPVisualManagerVS2008.cpp | iclosure/smartsoft | 62eaed49efd8306642b928ef4f2d96e36aca6527 | [
"MIT"
] | null | null | null | Src/VC/bcgcbpro/BCGPVisualManagerVS2008.cpp | iclosure/smartsoft | 62eaed49efd8306642b928ef4f2d96e36aca6527 | [
"MIT"
] | 1 | 2020-05-11T05:36:49.000Z | 2020-05-11T05:36:49.000Z | //*******************************************************************************
// COPYRIGHT NOTES
// ---------------
// This is a part of BCGControlBar Library Professional Edition
// Copyright (C) 1998-2012 BCGSoft Ltd.
// All rights reserved.
//
// This source code can be used, distributed or modified
// only unde... | 29.647211 | 132 | 0.671187 | iclosure |
4890b084a0b89e483b569fd16a7f698231df29fe | 98,344 | cpp | C++ | test/examples/lf_queue_examples.cpp | giucamp/density | b6a9653b36ec0c37c26f879574295a56e6345a7b | [
"BSL-1.0"
] | 18 | 2016-05-24T11:46:43.000Z | 2020-11-03T17:11:27.000Z | test/examples/lf_queue_examples.cpp | giucamp/density | b6a9653b36ec0c37c26f879574295a56e6345a7b | [
"BSL-1.0"
] | 13 | 2017-11-04T17:41:30.000Z | 2018-09-05T11:32:22.000Z | test/examples/lf_queue_examples.cpp | giucamp/density | b6a9653b36ec0c37c26f879574295a56e6345a7b | [
"BSL-1.0"
] | 1 | 2018-09-27T21:00:20.000Z | 2018-09-27T21:00:20.000Z |
// Copyright Giuseppe Campana (giu.campana@gmail.com) 2016-2018.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include "../test_framework/density_test_common.h"
//
#include "test_framework/pro... | 34.591629 | 121 | 0.609605 | giucamp |
4890c03201e90f2cc8030fd19c10e2fbc386f7fa | 153 | cpp | C++ | src/value.cpp | davidtwilcox/cloxplus | 6ba76a6a9bf2e0b7a6cb437a0e45fae1e87907c8 | [
"MIT"
] | null | null | null | src/value.cpp | davidtwilcox/cloxplus | 6ba76a6a9bf2e0b7a6cb437a0e45fae1e87907c8 | [
"MIT"
] | null | null | null | src/value.cpp | davidtwilcox/cloxplus | 6ba76a6a9bf2e0b7a6cb437a0e45fae1e87907c8 | [
"MIT"
] | null | null | null | #include "value.h"
#include <fmt/core.h>
namespace cloxplus {
void printValue(Value value)
{
std::cout << fmt::format("{}", value) << std::endl;
}
}
| 13.909091 | 53 | 0.633987 | davidtwilcox |
489608522cc9f1ab700c71c599402a9d953612de | 516 | cpp | C++ | HZ13_device/Source/create_HZ13_device.cpp | dekieras/EPIC_HZ_model | 12788eb25eb2147f8c0c30e2ae0a7661d8266333 | [
"MIT"
] | null | null | null | HZ13_device/Source/create_HZ13_device.cpp | dekieras/EPIC_HZ_model | 12788eb25eb2147f8c0c30e2ae0a7661d8266333 | [
"MIT"
] | null | null | null | HZ13_device/Source/create_HZ13_device.cpp | dekieras/EPIC_HZ_model | 12788eb25eb2147f8c0c30e2ae0a7661d8266333 | [
"MIT"
] | null | null | null | #include "EPICLib/Output_tee_globals.h"
#include "HZ13_v5_device.h"
// for use in non-dynamically loaded models
Device_base * create_concrete_device()
{
return new VisSearch_device("HZ13 device", Normal_out);
}
Device_base * create_HZ13_device()
{
return new VisSearch_device("HZ13 device", Normal_out);
}
// the c... | 19.846154 | 56 | 0.746124 | dekieras |
4899722193e6155aa21735b2f4e7a344fef3e1b3 | 1,055 | hpp | C++ | graph_tree/shortest_path_tree_dijkstra.hpp | hotman78/cpplib | c2f85c8741cdd0b731a5aa828b28b38c70c8d699 | [
"CC0-1.0"
] | null | null | null | graph_tree/shortest_path_tree_dijkstra.hpp | hotman78/cpplib | c2f85c8741cdd0b731a5aa828b28b38c70c8d699 | [
"CC0-1.0"
] | null | null | null | graph_tree/shortest_path_tree_dijkstra.hpp | hotman78/cpplib | c2f85c8741cdd0b731a5aa828b28b38c70c8d699 | [
"CC0-1.0"
] | null | null | null | #pragma once
#include<vector>
#include"graph_template.hpp"
#pragma once
#include<vector>
#include<queue>
#include<functional>
#include<tuple>
#include<limits>
#include"graph_template.hpp"
/**
* @brief 最短経路木 O((E+V)logE)
*/
template<typename T,typename F=std::less<T>>
std::vector<int> shortest_path_tree_dijkstra(co... | 25.119048 | 128 | 0.554502 | hotman78 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.