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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ec60514a391be86ed8fd2ea75cdf0ca775920944 | 1,141 | hpp | C++ | include/NP-Engine/Graphics/RHI/OpenGL/OpenGLRenderer.hpp | naphipps/NP-Engine | 0cac8b2d5e76c839b96f2061bf57434bdc37915e | [
"MIT"
] | null | null | null | include/NP-Engine/Graphics/RHI/OpenGL/OpenGLRenderer.hpp | naphipps/NP-Engine | 0cac8b2d5e76c839b96f2061bf57434bdc37915e | [
"MIT"
] | null | null | null | include/NP-Engine/Graphics/RHI/OpenGL/OpenGLRenderer.hpp | naphipps/NP-Engine | 0cac8b2d5e76c839b96f2061bf57434bdc37915e | [
"MIT"
] | null | null | null | //##===----------------------------------------------------------------------===##//
//
// Author: Nathan Phipps 11/7/21
//
//##===----------------------------------------------------------------------===##//
#ifndef NP_ENGINE_GRAPHICS_OPENGL_RENDERER_HPP
#define NP_ENGINE_GRAPHICS_OPENGL_RENDERER_HPP
#include "NP-E... | 24.276596 | 84 | 0.623138 | naphipps |
ec60a37c9f3d36a1fcf993564116b529c63b1f71 | 575 | hpp | C++ | src/gui/mainwindow.hpp | alex-x-o/Djiki | a684fc890ed867d4bb3deeedd4f327959dfbd68a | [
"MIT"
] | null | null | null | src/gui/mainwindow.hpp | alex-x-o/Djiki | a684fc890ed867d4bb3deeedd4f327959dfbd68a | [
"MIT"
] | null | null | null | src/gui/mainwindow.hpp | alex-x-o/Djiki | a684fc890ed867d4bb3deeedd4f327959dfbd68a | [
"MIT"
] | null | null | null | #ifndef MAINWINDOW_HPP
#define MAINWINDOW_HPP
#include <QMainWindow>
#include "graph/graphwindow.hpp"
#include "collection/collectionwindow.hpp"
QT_BEGIN_NAMESPACE
namespace Ui { class MainWindow; }
QT_END_NAMESPACE
class MainWindow : public QMainWindow
{
Q_OBJECT
public:
MainWindow(QWidget *parent = nullpt... | 18.548387 | 43 | 0.76 | alex-x-o |
ec60ba91544c57ac46ed1a13c43e2cb389392933 | 38,376 | cpp | C++ | src/mydll.cpp | juce/taksi | 154ce405d5c51429d66c5e160891afa60dd23044 | [
"BSD-3-Clause"
] | 2 | 2020-10-23T02:42:18.000Z | 2021-12-08T14:01:46.000Z | src/mydll.cpp | juce/taksi | 154ce405d5c51429d66c5e160891afa60dd23044 | [
"BSD-3-Clause"
] | null | null | null | src/mydll.cpp | juce/taksi | 154ce405d5c51429d66c5e160891afa60dd23044 | [
"BSD-3-Clause"
] | null | null | null | /* mydll */
/**************************************
* Visual indicators meaning: *
* GREEN: exclusive hooked mode *
* BLUE: system-wide hooked mode *
* RED: video recording mode *
**************************************/
using namespace std;
#include <windows.h>
#include <... | 28.553571 | 113 | 0.652022 | juce |
ec63c3b1c0ca84dc15655cd9314a48edda59881d | 734 | hpp | C++ | data/get.hpp | therocode/datapub | 8510911355707a570ad904d55700186eb3efa22c | [
"MIT"
] | 2 | 2016-10-20T08:32:36.000Z | 2016-10-21T11:48:00.000Z | data/get.hpp | therocode/datapub | 8510911355707a570ad904d55700186eb3efa22c | [
"MIT"
] | null | null | null | data/get.hpp | therocode/datapub | 8510911355707a570ad904d55700186eb3efa22c | [
"MIT"
] | null | null | null | #pragma once
#include "common.hpp"
#include <thero/optional.hpp>
template <typename DataTable>
auto& get(int32_t id, DataTable& table)
{
++table.meta.metrics[AccessType::RandomAccess];
if(!table.meta.sorted)
sort(table);
auto iter = table.ids.begin();
for(; iter != table.ids.end(); ++iter)
... | 25.310345 | 105 | 0.637602 | therocode |
ec6aff901cf9bd11c1b2b2b1839087c661833a3d | 4,186 | hpp | C++ | test/test_utility_output_stream.hpp | harsh-4/gil | 6da59cc3351e5657275d3a536e0b6e7a1b6ac738 | [
"BSL-1.0"
] | 153 | 2015-02-03T06:03:54.000Z | 2022-03-20T15:06:34.000Z | test/test_utility_output_stream.hpp | DevanshSGit/gil | 2b1e4665d15bc5c58d657879ac52890611c7d77e | [
"BSL-1.0"
] | 429 | 2015-03-22T09:49:04.000Z | 2022-03-28T08:32:08.000Z | test/test_utility_output_stream.hpp | DevanshSGit/gil | 2b1e4665d15bc5c58d657879ac52890611c7d77e | [
"BSL-1.0"
] | 215 | 2015-03-15T09:20:51.000Z | 2022-03-30T12:40:07.000Z | //
// Copyright 2019-2020 Mateusz Loskot <mateusz at loskot dot net>
//
// 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
//
#ifndef BOOST_GIL_TEST_TEST_UTILITY_HPP
#define BOOST_GIL_TEST_TEST_UTILITY_HPP
#include <b... | 31.238806 | 105 | 0.657907 | harsh-4 |
ec6dc1a73a0a3735a3a10cf1a2c3ef808365a0c1 | 5,127 | cpp | C++ | gamma_matrix.cpp | plabus/NCG2 | 124eff65de555bc14dd943711a3638a5465f4e35 | [
"MIT"
] | null | null | null | gamma_matrix.cpp | plabus/NCG2 | 124eff65de555bc14dd943711a3638a5465f4e35 | [
"MIT"
] | null | null | null | gamma_matrix.cpp | plabus/NCG2 | 124eff65de555bc14dd943711a3638a5465f4e35 | [
"MIT"
] | null | null | null | /**
NCG++
gamma_matrix.cpp
Purpose:
@author Peter Labus
@version 0.1
10.05.2017
*/
#include <iostream>
#include <vector>
#include <complex>
#include <algorithm>
#include <cassert>
#include <cmath>
#include "gamma_matrix.hpp"
GammaMatrix::GammaMatrix(const int size)
:
size_(size),
M_(size... | 21.542017 | 111 | 0.578701 | plabus |
ec70d81a7266c486c2a8ff788b0301275ca79fac | 268 | hpp | C++ | include/coco/combix/chars.hpp | agatan/coco | e19e74cf97d788b435351379296ea3ead901c576 | [
"BSL-1.0"
] | 1 | 2016-08-31T04:44:17.000Z | 2016-08-31T04:44:17.000Z | include/coco/combix/chars.hpp | agatan/coco | e19e74cf97d788b435351379296ea3ead901c576 | [
"BSL-1.0"
] | null | null | null | include/coco/combix/chars.hpp | agatan/coco | e19e74cf97d788b435351379296ea3ead901c576 | [
"BSL-1.0"
] | null | null | null | #ifndef COCO_COMBIX_CHARS_HPP_
#define COCO_COMBIX_CHARS_HPP_
#include <coco/combix/chars/parens.hpp>
#include <coco/combix/chars/alpha.hpp>
#include <coco/combix/chars/digit.hpp>
#include <coco/combix/chars/string.hpp>
#include <coco/combix/chars/space.hpp>
#endif
| 24.363636 | 39 | 0.794776 | agatan |
ec71d6ef9c00b103ab38a94c55c5f8d069c55a51 | 2,533 | cpp | C++ | 11987 Almost Union-Find.cpp | zihadboss/UVA-Solutions | 020fdcb09da79dc0a0411b04026ce3617c09cd27 | [
"Apache-2.0"
] | 86 | 2016-01-20T11:36:50.000Z | 2022-03-06T19:43:14.000Z | 11987 Almost Union-Find.cpp | Mehedishihab/UVA-Solutions | 474fe3d9d9ba574b97fd40ca5abb22ada95654a1 | [
"Apache-2.0"
] | null | null | null | 11987 Almost Union-Find.cpp | Mehedishihab/UVA-Solutions | 474fe3d9d9ba574b97fd40ca5abb22ada95654a1 | [
"Apache-2.0"
] | 113 | 2015-12-04T06:40:57.000Z | 2022-02-11T02:14:28.000Z | #include <iostream>
#include <set>
using namespace std;
// Will not access this, other than to print out in the beginning
set<int> baseSets[100005];
int sum[100005];
// Starts off with setAccess[i] = i
int setAccess[100005];
void MergeSets(int valueInA, int valueInB)
{
// Only handle if they are different
i... | 25.33 | 104 | 0.463087 | zihadboss |
ec757bbd799b87fab3efb2c2b39d06473b4ab731 | 1,274 | cpp | C++ | R Tree/source/RTreeNode.cpp | Kipsora/SJTU-DS2016 | cc414f54ac23e3796b229ee6c62148c782da27ca | [
"MIT"
] | null | null | null | R Tree/source/RTreeNode.cpp | Kipsora/SJTU-DS2016 | cc414f54ac23e3796b229ee6c62148c782da27ca | [
"MIT"
] | null | null | null | R Tree/source/RTreeNode.cpp | Kipsora/SJTU-DS2016 | cc414f54ac23e3796b229ee6c62148c782da27ca | [
"MIT"
] | null | null | null | #ifdef SJTU_RTREENODE_HPP
#ifndef SJTU_RTREENODE_CPP
#define SJTU_RTREENODE_CPP
template<class T, size_t M, size_t D>
RTreeNode<T, M, D>::RTreeNode() {
size = level = 0;
father = nullptr;
}
template<class T, size_t M, size_t D>
RTreeNode<T, M, D>::~RTreeNode() {
for (int i = 0; i < size; i++) {
if (level == 0)... | 20.222222 | 77 | 0.576138 | Kipsora |
3f43119ec9ec3e752b980e041773a76c4433d889 | 836 | cpp | C++ | Practicals Program/binarysearch.cpp | manasdeshpande/C-HSC-Boards-2021 | 74947753ae23d38329fca5d8550d7af2718cdf6c | [
"MIT"
] | null | null | null | Practicals Program/binarysearch.cpp | manasdeshpande/C-HSC-Boards-2021 | 74947753ae23d38329fca5d8550d7af2718cdf6c | [
"MIT"
] | null | null | null | Practicals Program/binarysearch.cpp | manasdeshpande/C-HSC-Boards-2021 | 74947753ae23d38329fca5d8550d7af2718cdf6c | [
"MIT"
] | null | null | null |
#include <iostream>
using namespace std;
int main(){
int a[10], N, F, L, mid, key, flag=0, i; // Initialization
cout << "Enter number of elements of an array:\t";
cin >> N;
cout << "Enter Elements of array in Ascending Order:\t";
for(i=0;i<N;i++)
{
cin>>a[i];
}
... | 21.435897 | 66 | 0.421053 | manasdeshpande |
3f53ce5dc8d390c7b391d1a61c9db093f0626c5b | 875 | cpp | C++ | src/cpp-test/message_parse_test.cpp | MayaPosch/NymphMQTT | 10707ba763606424ab2b81e310cb53a38fa66687 | [
"BSD-3-Clause"
] | 14 | 2019-11-15T18:19:35.000Z | 2022-02-03T12:09:14.000Z | src/cpp-test/message_parse_test.cpp | MayaPosch/NymphMQTT | 10707ba763606424ab2b81e310cb53a38fa66687 | [
"BSD-3-Clause"
] | null | null | null | src/cpp-test/message_parse_test.cpp | MayaPosch/NymphMQTT | 10707ba763606424ab2b81e310cb53a38fa66687 | [
"BSD-3-Clause"
] | 1 | 2020-03-20T22:45:14.000Z | 2020-03-20T22:45:14.000Z | /*
message_parse_test.cpp - Parse test for the NymphMQTT Message class.
Revision 0.
2019/05/09, Maya Posch
*/
#include "../cpp/message.h"
#include <string>
#include <iostream>
int main() {
// Create MQTT binary message, create NmqttMessage instance.
// Test message is a Publish command, with the string pa... | 22.435897 | 78 | 0.651429 | MayaPosch |
3f544cb7b97151dbfdd05768c2fac3dc1ce19ed5 | 3,575 | cpp | C++ | BurgerTime/BunBehaviour.cpp | TomStevens7533/Minigin | 3f96238621aa0729975fdf4727c12fd760f5b5e3 | [
"Apache-2.0"
] | 1 | 2022-03-29T09:53:12.000Z | 2022-03-29T09:53:12.000Z | BurgerTime/BunBehaviour.cpp | TomStevens7533/Minigin | 3f96238621aa0729975fdf4727c12fd760f5b5e3 | [
"Apache-2.0"
] | null | null | null | BurgerTime/BunBehaviour.cpp | TomStevens7533/Minigin | 3f96238621aa0729975fdf4727c12fd760f5b5e3 | [
"Apache-2.0"
] | null | null | null | #include "MiniginPCH.h"
#include "BunBehaviour.h"
#include "GameObject.h"
#include "BoxColliderComponent.h"
#include "Scene.h"
#include "DeltaTime.h"
#include "ServiceLocator.h"
#include "MathHelper.h"
#include "EventType.h"
#include "BurgerEvents.h"
#include "BaseComponent.h"
#include "EnemyBehaviourComponent.h"
void... | 28.830645 | 135 | 0.716364 | TomStevens7533 |
3f5733d2f53bd7a02b2b16cb1f0303af84cd6c7e | 264 | hpp | C++ | modules/functional/src/grouping/grouping.hpp | Masterchef365/pvcnn | db13331a46f672e74e7b5bde60e7bf30d445cd2d | [
"MIT"
] | 477 | 2019-12-10T01:03:43.000Z | 2022-03-28T14:10:08.000Z | modules/functional/src/grouping/grouping.hpp | chaomath/pvcnn | 8f07316611067e9a0e2df8b35e4a729a03e0806b | [
"MIT"
] | 57 | 2019-12-10T10:14:26.000Z | 2022-03-26T04:59:43.000Z | modules/functional/src/grouping/grouping.hpp | chaomath/pvcnn | 8f07316611067e9a0e2df8b35e4a729a03e0806b | [
"MIT"
] | 126 | 2019-12-10T07:59:50.000Z | 2022-03-12T07:21:19.000Z | #ifndef _GROUPING_HPP
#define _GROUPING_HPP
#include <torch/extension.h>
at::Tensor grouping_forward(at::Tensor features, at::Tensor indices);
at::Tensor grouping_backward(at::Tensor grad_y, at::Tensor indices,
const int n);
#endif
| 24 | 69 | 0.693182 | Masterchef365 |
3f5a47662d627055d5a638f5e3a6f88e836d08cb | 840 | cpp | C++ | app/src/main/cpp/lines_mask.cpp | azbyn/ocr-solver | 31f2827e7bdaf10c6eaa159d8740d5b41581b350 | [
"MIT"
] | 3 | 2019-10-12T18:49:39.000Z | 2021-04-28T17:23:40.000Z | app/src/main/cpp/lines_mask.cpp | azbyn/ocr-solver | 31f2827e7bdaf10c6eaa159d8740d5b41581b350 | [
"MIT"
] | null | null | null | app/src/main/cpp/lines_mask.cpp | azbyn/ocr-solver | 31f2827e7bdaf10c6eaa159d8740d5b41581b350 | [
"MIT"
] | null | null | null | #include "super_lines_removal.h"
#include "jni_utils.h"
#include <opencv2/imgproc.hpp>
JNIFUN(void, getLinesMask)(JNIEnv* env, jobject,
jlong resultAddr, jint thickness,
jlong midsAddr,
jint width, jint height) {
try {
auto& result = addrToMat(resultAddr);
auto* mids = Slin... | 31.111111 | 84 | 0.558333 | azbyn |
3f5ef4d300d23f1a6efbb68ff336d106d9a5219e | 2,160 | hpp | C++ | include/albot/MapProcessing/MapProcessing.hpp | FreezePhoenix/albot-cpp | 7d6526e771074d7e7c26a571d77fcfe3ed1c57cc | [
"MIT"
] | 2 | 2021-05-13T16:27:51.000Z | 2021-05-23T02:25:49.000Z | include/albot/MapProcessing/MapProcessing.hpp | FreezePhoenix/albot-cpp | 7d6526e771074d7e7c26a571d77fcfe3ed1c57cc | [
"MIT"
] | 6 | 2021-05-21T15:17:37.000Z | 2021-10-12T12:00:33.000Z | include/albot/MapProcessing/MapProcessing.hpp | FreezePhoenix/albot-cpp | 7d6526e771074d7e7c26a571d77fcfe3ed1c57cc | [
"MIT"
] | 2 | 2021-04-19T23:18:41.000Z | 2022-02-03T21:36:16.000Z | #pragma once
#ifndef ALBOT_MAPPROCESSING_HPP_
#define ALBOT_MAPPROCESSING_HPP_
#include <vector>
#include <math.h>
#include <nlohmann/json.hpp>
#include "TriangleManipulator/PointLocation.hpp"
namespace MapProcessing {
/**
* @brief A structure describing a line that is not bound to a specific axis.
*/
... | 32.238806 | 118 | 0.649537 | FreezePhoenix |
3f6062710fd0d305a9661d40943857f913dc388f | 1,142 | cpp | C++ | tests/integrity/reserve_publish.cpp | lukaszstolarczuk/pmemstream | 972f029d13858d783d80654d73168c5e8334eab6 | [
"BSD-3-Clause"
] | null | null | null | tests/integrity/reserve_publish.cpp | lukaszstolarczuk/pmemstream | 972f029d13858d783d80654d73168c5e8334eab6 | [
"BSD-3-Clause"
] | 123 | 2021-11-02T12:06:07.000Z | 2022-03-31T10:50:48.000Z | tests/integrity/reserve_publish.cpp | lukaszstolarczuk/pmemstream | 972f029d13858d783d80654d73168c5e8334eab6 | [
"BSD-3-Clause"
] | 5 | 2021-11-02T12:20:38.000Z | 2022-02-15T23:50:04.000Z | // SPDX-License-Identifier: BSD-3-Clause
/* Copyright 2021-2022, Intel Corporation */
/*
* reserve_publish.cpp -- pmemstream_reserve and pmemstream_publish integrity test.
* It checks if we reserve-publish approach properly writes data on pmem.
*/
#include <cstring>
#include <vector>
#include <rapidcheck.h>
#i... | 27.853659 | 92 | 0.695271 | lukaszstolarczuk |
3f61ed483670834d94f5da699fb0541f51c1d3ef | 821 | cpp | C++ | solved/c-e/counting-triangles/counting.cpp | abuasifkhan/pc-code | 77ce51d692acf6edcb9e47aeb7b7f06bf56e4e90 | [
"Unlicense"
] | 13 | 2015-09-30T19:18:04.000Z | 2021-06-26T21:11:30.000Z | solved/c-e/counting-triangles/counting.cpp | sbmaruf/pc-code | 77ce51d692acf6edcb9e47aeb7b7f06bf56e4e90 | [
"Unlicense"
] | null | null | null | solved/c-e/counting-triangles/counting.cpp | sbmaruf/pc-code | 77ce51d692acf6edcb9e47aeb7b7f06bf56e4e90 | [
"Unlicense"
] | 13 | 2015-01-04T09:49:54.000Z | 2021-06-03T13:18:44.000Z | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef unsigned long long u64;
typedef vector<int> IV;
typedef IV::iterator IVi;
int main()
{
int T;
scanf("%d", &T);
int ncase = 0;
while (T--) {
int N, n;
scanf("%d", &N);
IV ns;
for (int... | 18.244444 | 58 | 0.409257 | abuasifkhan |
3f64bfbe1b83eaa5be1bfac0748307a0ca3fa0ef | 772 | cpp | C++ | simpleExceptions/main.cpp | zlum/simple | b5eaf45ad814ec6a2236828ce2ae78b16193bfc1 | [
"MIT"
] | null | null | null | simpleExceptions/main.cpp | zlum/simple | b5eaf45ad814ec6a2236828ce2ae78b16193bfc1 | [
"MIT"
] | null | null | null | simpleExceptions/main.cpp | zlum/simple | b5eaf45ad814ec6a2236828ce2ae78b16193bfc1 | [
"MIT"
] | null | null | null | #include <cstdint>
#include <exception>
#include <iostream>
#include <string>
#include <memory>
using namespace std;
class C
{
public:
C() { throw runtime_error("C"); }
};
class B
{
public:
B()
{
cout << "Hello!" << endl;
}
~B()
{
cout << "Goodbye!" << endl;
}
};
class A... | 12.655738 | 65 | 0.48057 | zlum |
3f6b3adb27ad4584a6198cdccc6135e018f2c746 | 5,142 | cpp | C++ | xp/sandbox/record.cpp | vjacquet/praxis | a0558c1c4f569682792f317f9c94ff3167126fda | [
"MIT"
] | null | null | null | xp/sandbox/record.cpp | vjacquet/praxis | a0558c1c4f569682792f317f9c94ff3167126fda | [
"MIT"
] | null | null | null | xp/sandbox/record.cpp | vjacquet/praxis | a0558c1c4f569682792f317f9c94ff3167126fda | [
"MIT"
] | null | null | null | #include <cstdint>
#include <string>
#include <tuple>
#include <utility>
#include "../tests/testbench.h"
// investigate strongly typed field names and how they could be used as named parameters.
// check https://github.com/edouarda/brigand
namespace xp {
using std::string;
using std::wstring;
using std::size_t;
... | 28.566667 | 133 | 0.674251 | vjacquet |
3f72f9ff0ea0abeceb91cb0ba5cdc5c245ea4389 | 1,212 | cpp | C++ | cmdstan/stan/lib/stan_math/test/unit/math/rev/mat/fun/row_test.cpp | yizhang-cae/torsten | dc82080ca032325040844cbabe81c9a2b5e046f9 | [
"BSD-3-Clause"
] | null | null | null | cmdstan/stan/lib/stan_math/test/unit/math/rev/mat/fun/row_test.cpp | yizhang-cae/torsten | dc82080ca032325040844cbabe81c9a2b5e046f9 | [
"BSD-3-Clause"
] | null | null | null | cmdstan/stan/lib/stan_math/test/unit/math/rev/mat/fun/row_test.cpp | yizhang-cae/torsten | dc82080ca032325040844cbabe81c9a2b5e046f9 | [
"BSD-3-Clause"
] | null | null | null | #include <stan/math/rev/mat.hpp>
#include <gtest/gtest.h>
#include <test/unit/math/rev/mat/fun/util.hpp>
#include <test/unit/math/rev/mat/util.hpp>
TEST(AgradRevMatrix,row_v) {
using stan::math::row;
using stan::math::matrix_v;
using stan::math::vector_v;
matrix_v y(2,3);
y << 1, 2, 3, 4, 5, 6;
vector_v z... | 24.24 | 52 | 0.641914 | yizhang-cae |
3f736a658f966812a0795f290b414d0fe25cadee | 981 | cpp | C++ | y2018/filters/cannyEdgeDetectWindows.cpp | valkyrierobotics/vision2018 | aa82e936c5481b7cc43a46ff5f6e68702c2166c2 | [
"BSD-2-Clause"
] | 2 | 2016-08-06T06:21:02.000Z | 2017-01-10T05:45:13.000Z | y2018/filters/cannyEdgeDetectWindows.cpp | valkyrierobotics/vision2018 | aa82e936c5481b7cc43a46ff5f6e68702c2166c2 | [
"BSD-2-Clause"
] | 1 | 2017-04-15T20:54:59.000Z | 2017-04-15T20:54:59.000Z | y2018/filters/cannyEdgeDetectWindows.cpp | valkyrierobotics/vision2018 | aa82e936c5481b7cc43a46ff5f6e68702c2166c2 | [
"BSD-2-Clause"
] | 3 | 2016-07-30T06:19:55.000Z | 2017-02-07T01:55:05.000Z | #include "filters/cannyEdgeDetectWindows.hpp"
void cannyEdgeDetectWindows(cv::Mat &img, int &threshLow, int &threshHigh, int &apply, bool visible, const bool isStreaming)
{
if (visible)
{
cv::namedWindow("Canny Edge Detection Editor", cv::WINDOW_AUTOSIZE);
cv::createTrackbar("Apply Filter", "Canny Edge Detec... | 30.65625 | 124 | 0.681957 | valkyrierobotics |
3f777b7cf2437293f2f51dfa0cd9d1ed77e4aad6 | 380 | cpp | C++ | mc/util/op_queue.cpp | ShamylZakariya/MarchingCubes | 27f375d5d25df2246095d65c11127aac82a24211 | [
"MIT"
] | 2 | 2019-12-03T05:52:57.000Z | 2021-05-21T18:17:52.000Z | mc/util/op_queue.cpp | ShamylZakariya/MarchingCubes | 27f375d5d25df2246095d65c11127aac82a24211 | [
"MIT"
] | null | null | null | mc/util/op_queue.cpp | ShamylZakariya/MarchingCubes | 27f375d5d25df2246095d65c11127aac82a24211 | [
"MIT"
] | null | null | null | #include "op_queue.hpp"
namespace mc {
namespace util {
unowned_ptr<OperationQueue> MainThreadQueue()
{
static std::mutex _lock;
static std::unique_ptr<OperationQueue> _queue = nullptr;
std::lock_guard lock(_lock);
if (!_queue) {
_queue = std::make_unique<Operation... | 19 | 64 | 0.594737 | ShamylZakariya |
3f7f3fcc690341542085ce7683bc694629373d28 | 741 | cpp | C++ | C++ STL/Iterators & Templates/Templates.cpp | sohamnandi77/Cpp-Data-Structures-And-Algorithm | f29a14760964103a5b58cfff925cd8f7ed5aa6c1 | [
"MIT"
] | 2 | 2021-05-21T17:10:02.000Z | 2021-05-29T05:13:06.000Z | C++ STL/Iterators & Templates/Templates.cpp | sohamnandi77/Cpp-Data-Structures-And-Algorithm | f29a14760964103a5b58cfff925cd8f7ed5aa6c1 | [
"MIT"
] | null | null | null | C++ STL/Iterators & Templates/Templates.cpp | sohamnandi77/Cpp-Data-Structures-And-Algorithm | f29a14760964103a5b58cfff925cd8f7ed5aa6c1 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
template <typename T, typename V>
class Pair
{
T x;
V y;
public:
void setX(T x) { this->x = x; }
T getX() { return x; }
void setY(V y) { this->y = y; }
V getY() { return y; }
};
int main()
{
Pair<int, double> p1;
p1.setX(10);
p1.setY(20.55);
... | 18.073171 | 50 | 0.496626 | sohamnandi77 |
3f80f5cc189696fae6dd644587e134e2c6fb00b5 | 1,364 | cpp | C++ | LinkedList/reverse_each_k_node.cpp | Bhannasa/CP-DSA | 395dbdb6b5eb5896cc4182711ff086e1fb76ef7a | [
"MIT"
] | 22 | 2021-10-01T20:14:15.000Z | 2022-02-22T15:27:20.000Z | LinkedList/reverse_each_k_node.cpp | Bhannasa/CP-DSA | 395dbdb6b5eb5896cc4182711ff086e1fb76ef7a | [
"MIT"
] | 15 | 2021-10-01T20:24:55.000Z | 2021-10-31T05:55:14.000Z | LinkedList/reverse_each_k_node.cpp | Bhannasa/CP-DSA | 395dbdb6b5eb5896cc4182711ff086e1fb76ef7a | [
"MIT"
] | 76 | 2021-10-01T20:01:06.000Z | 2022-03-02T16:15:24.000Z | #include<bits/stdc++.h>
//#include<iostream>
using namespace std;
class node{
public:
int data;
node* next;
node(int val){
data=val;
next=NULL;
}
};
void insertAtTail(node* &head, int val){
node* n=new node(val);
if (head==NULL)
{
head=n;
return;
... | 16.047059 | 40 | 0.526393 | Bhannasa |
3f8255405202ed9b05f4c4d44ac5d2a62773ac8c | 3,245 | hpp | C++ | NumberWithUnits.hpp | yuvalmarmer/number-with-units-b | f2076b9215b6be9485fe74537544e3c8848892d0 | [
"MIT"
] | null | null | null | NumberWithUnits.hpp | yuvalmarmer/number-with-units-b | f2076b9215b6be9485fe74537544e3c8848892d0 | [
"MIT"
] | null | null | null | NumberWithUnits.hpp | yuvalmarmer/number-with-units-b | f2076b9215b6be9485fe74537544e3c8848892d0 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include <sstream>
#include <stdexcept>
#include <map>
#include <string>
#include <utility>
#include <list>
using namespace std;
namespace ariel{
static map<pair<string,string>, double> values_map;
static map<string, list<string>> chain_map;
class Node{
publi... | 34.521277 | 96 | 0.587365 | yuvalmarmer |
3f82a03094ad66145f5bbc1f9f3be76516ae4796 | 4,349 | cpp | C++ | source/poro/keyboard.cpp | gummikana/poro | 70162aca06ca5a1d4f92b8d01728e1764e4c6873 | [
"Zlib"
] | 3 | 2015-02-09T15:31:32.000Z | 2022-03-06T20:49:48.000Z | source/poro/keyboard.cpp | gummikana/poro | 70162aca06ca5a1d4f92b8d01728e1764e4c6873 | [
"Zlib"
] | null | null | null | source/poro/keyboard.cpp | gummikana/poro | 70162aca06ca5a1d4f92b8d01728e1764e4c6873 | [
"Zlib"
] | 2 | 2019-09-26T22:00:16.000Z | 2019-10-03T22:02:43.000Z | /***************************************************************************
*
* Copyright (c) 2010 Petri Purho, Dennis Belfrage
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable for any damages
* arising from the use of this software.
... | 25.582353 | 109 | 0.639227 | gummikana |
3f90535fcfdfde8233f6d8a12430b9d15005336e | 5,111 | cpp | C++ | exercise-3/vectorFunctions.cpp | DerHumm3l/oop-cpp | 767ca4e553bfc037aa1fac3f41fdf0baf56a3304 | [
"MIT"
] | null | null | null | exercise-3/vectorFunctions.cpp | DerHumm3l/oop-cpp | 767ca4e553bfc037aa1fac3f41fdf0baf56a3304 | [
"MIT"
] | null | null | null | exercise-3/vectorFunctions.cpp | DerHumm3l/oop-cpp | 767ca4e553bfc037aa1fac3f41fdf0baf56a3304 | [
"MIT"
] | null | null | null | #include <vector>
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
double max(const vector<double> &v)
{
double maxValue;
if (v.size() > 0)
{
maxValue = v[0];
for (double elem : v)
{
if (elem > maxValue)
{
maxValu... | 22.125541 | 84 | 0.548425 | DerHumm3l |
3f91563cb12104178b87c2f9c04d6f3207f9ced4 | 18,282 | cpp | C++ | external/mocap_optitrack/src/natnet/natnet_messages.cpp | robomechanics/quad-software | 89154df18e98162249f38301b669df27ee595220 | [
"MIT"
] | 20 | 2021-12-05T03:40:28.000Z | 2022-03-30T02:53:56.000Z | external/mocap_optitrack/src/natnet/natnet_messages.cpp | robomechanics/rml-spirit-firmware | 89154df18e98162249f38301b669df27ee595220 | [
"MIT"
] | 101 | 2020-09-02T00:36:25.000Z | 2021-12-04T23:40:32.000Z | external/mocap_optitrack/src/natnet/natnet_messages.cpp | robomechanics/spirit-software | b0a3d8defd3abe06406de6573212bab4a2eb769a | [
"MIT"
] | 2 | 2021-12-06T03:20:15.000Z | 2022-02-20T04:19:41.000Z | /*
* Copyright (c) 2018, Houston Mechatronics Inc., JD Yamokoski
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright noti... | 34.429379 | 144 | 0.666503 | robomechanics |
3f92adb544e57e3e4a27c6c9b104ce6c53ebcc73 | 1,175 | cc | C++ | src/platform/ceph_io_prio.cc | pengdu/bubblefs | 9b27e191a287b3a1d012adfd3bab6a30629a5f33 | [
"BSD-3-Clause"
] | 1 | 2021-01-11T14:19:51.000Z | 2021-01-11T14:19:51.000Z | src/platform/ceph_io_prio.cc | pengdu/bubblefs | 9b27e191a287b3a1d012adfd3bab6a30629a5f33 | [
"BSD-3-Clause"
] | null | null | null | src/platform/ceph_io_prio.cc | pengdu/bubblefs | 9b27e191a287b3a1d012adfd3bab6a30629a5f33 | [
"BSD-3-Clause"
] | null | null | null | /*
* Ceph - scalable distributed file system
*
* Copyright (C) 2012 Red Hat
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
// ceph/src/common/... | 23.979592 | 61 | 0.674894 | pengdu |
3f92f1630c2074c614f6ecf6423d26035dbbe935 | 1,556 | cpp | C++ | sdk/identity/azure-identity/samples/client_secret_credential.cpp | JinmingHu-MSFT/azure-sdk-for-cpp | 933486385a54a5a09a7444dbd823425f145ad75a | [
"MIT"
] | null | null | null | sdk/identity/azure-identity/samples/client_secret_credential.cpp | JinmingHu-MSFT/azure-sdk-for-cpp | 933486385a54a5a09a7444dbd823425f145ad75a | [
"MIT"
] | null | null | null | sdk/identity/azure-identity/samples/client_secret_credential.cpp | JinmingHu-MSFT/azure-sdk-for-cpp | 933486385a54a5a09a7444dbd823425f145ad75a | [
"MIT"
] | null | null | null | // Copyright (c) Microsoft Corporation. All rights reserved.
// SPDX-License-Identifier: MIT
#include <get_env.hpp>
#include <iostream>
#include <azure/identity/client_secret_credential.hpp>
#include <azure/service/client.hpp>
// The following environment variables must be set before running the sample.
// * AZURE... | 33.826087 | 92 | 0.72365 | JinmingHu-MSFT |
3f95823dc343e2f10bc802ae64a2a525a317cb74 | 2,258 | cpp | C++ | src/Shield.cpp | jacobussystems/IoTJackAC1 | c1ad8c13d984362c1bbf1232cbfc34e64fc039ac | [
"MIT"
] | null | null | null | src/Shield.cpp | jacobussystems/IoTJackAC1 | c1ad8c13d984362c1bbf1232cbfc34e64fc039ac | [
"MIT"
] | null | null | null | src/Shield.cpp | jacobussystems/IoTJackAC1 | c1ad8c13d984362c1bbf1232cbfc34e64fc039ac | [
"MIT"
] | null | null | null | /*
Shield.cpp
By Jim Davies
Jacobus Systems, Brighton & Hove, UK
http://www.jacobus.co.uk
Provided under the MIT license: https://github.com/jacobussystems/ArdJack/blob/master/LICENSE
Copyright (c) 2019 James Davies, Jacobus Systems, Brighton & Hove, UK
Permission is hereby granted, free of charge, to any per... | 25.088889 | 114 | 0.743578 | jacobussystems |
3f9a0ba7a9011667a5834aa66a49d595bb5120fa | 1,278 | hpp | C++ | Source/Hyper/include/Hyper/Ast/Declarations/VariableDeclaration.hpp | SkillerRaptor/HyperLang | c7bcabf90462247e388861b4255fe61e74c32fca | [
"MIT"
] | 13 | 2021-08-08T19:17:22.000Z | 2022-02-17T10:52:07.000Z | Source/Hyper/include/Hyper/Ast/Declarations/VariableDeclaration.hpp | SkillerRaptor/HyperLang | c7bcabf90462247e388861b4255fe61e74c32fca | [
"MIT"
] | null | null | null | Source/Hyper/include/Hyper/Ast/Declarations/VariableDeclaration.hpp | SkillerRaptor/HyperLang | c7bcabf90462247e388861b4255fe61e74c32fca | [
"MIT"
] | null | null | null | /*
* Copyright (c) 2020-2021, SkillerRaptor <skillerraptor@protonmail.com>
*
* SPDX-License-Identifier: MIT
*/
#pragma once
#include "Hyper/Ast/Declaration.hpp"
#include "Hyper/Ast/Forward.hpp"
#include "Hyper/Identifier.hpp"
#include "Hyper/SourceRange.hpp"
#include "Hyper/Type.hpp"
#include <string>
namespace... | 20.285714 | 72 | 0.732394 | SkillerRaptor |
3f9cb6fb739e28b48c2397db397a136be8e9fa6e | 860 | inl | C++ | mem/Group.inl | Andrewich/deadjustice | 48bea56598e79a1a10866ad41aa3517bf7d7c724 | [
"BSD-3-Clause"
] | 3 | 2019-04-20T10:16:36.000Z | 2021-03-21T19:51:38.000Z | mem/Group.inl | Andrewich/deadjustice | 48bea56598e79a1a10866ad41aa3517bf7d7c724 | [
"BSD-3-Clause"
] | null | null | null | mem/Group.inl | Andrewich/deadjustice | 48bea56598e79a1a10866ad41aa3517bf7d7c724 | [
"BSD-3-Clause"
] | 2 | 2020-04-18T20:04:24.000Z | 2021-09-19T05:07:41.000Z | #include <malloc.h>
#define mem_Group_create( PARAM, PARAM2 ) 0; (PARAM); (PARAM2)
#define mem_Group_release( PARAM ) (PARAM)
#define mem_Group_copy( PARAM ) (PARAM)
#define mem_Group_allocate( PARAM, BYTES ) malloc(BYTES); (PARAM)
#define mem_Group_free( PARAM, PTR, PARAM2 ) free(PTR); (PARAM); (PARAM2)
#define mem_Gr... | 40.952381 | 73 | 0.738372 | Andrewich |
3fa50c8b888ca487d7b0e8f39ff02d2034b36a5c | 2,591 | cpp | C++ | Visual Studio 2010/Projects/bjarneStroustrupC++PartII/bjarneStroustrupCFLTK/Chapter16Exercise5Def.cpp | Ziezi/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | 9 | 2018-10-24T15:16:47.000Z | 2021-12-14T13:53:50.000Z | Visual Studio 2010/Projects/bjarneStroustrupC++PartII/bjarneStroustrupCFLTK/Chapter16Exercise5Def.cpp | ChrisBKirov/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | null | null | null | Visual Studio 2010/Projects/bjarneStroustrupC++PartII/bjarneStroustrupCFLTK/Chapter16Exercise5Def.cpp | ChrisBKirov/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | 7 | 2018-10-29T15:30:37.000Z | 2021-01-18T15:15:09.000Z | /*
TITLE Drawing GUI Chapter16Exercise5Def.cpp
"Bjarne Stroustrup "Programming Principles and Practices Using C++""
COMMENT
Objective: Make a program that draws a shape of you choice and moves
it to a new point each time you click "Next". The new point
should be determined by a coordinate p... | 20.085271 | 87 | 0.651872 | Ziezi |
3fac288497ceb6bb0f966a745f0d8faf27ffa430 | 999 | cpp | C++ | vcl/shape/hierarchy_mesh/hierarchy_mesh_drawable/hierarchy_mesh_drawable_node/hierarchy_mesh_drawable_node.cpp | vogr/OceanGL | e894df3319243b8ee2102856785ab3a9930e0029 | [
"MIT"
] | null | null | null | vcl/shape/hierarchy_mesh/hierarchy_mesh_drawable/hierarchy_mesh_drawable_node/hierarchy_mesh_drawable_node.cpp | vogr/OceanGL | e894df3319243b8ee2102856785ab3a9930e0029 | [
"MIT"
] | null | null | null | vcl/shape/hierarchy_mesh/hierarchy_mesh_drawable/hierarchy_mesh_drawable_node/hierarchy_mesh_drawable_node.cpp | vogr/OceanGL | e894df3319243b8ee2102856785ab3a9930e0029 | [
"MIT"
] | null | null | null | #include "hierarchy_mesh_drawable_node.hpp"
namespace vcl {
hierarchy_mesh_drawable_node::hierarchy_mesh_drawable_node(mesh_drawable element_arg,
std::string name_arg,
std::string name_parent_arg,
... | 38.423077 | 130 | 0.562563 | vogr |
3fb0d990a75c37d55e83a3b338e80c460c593fe2 | 8,242 | hpp | C++ | include/tori/core/object_ptr.hpp | mocabe/Neco-lang-v2 | a30075802492fa5c2d1725a2ba0e3e06dde4ce13 | [
"MIT"
] | null | null | null | include/tori/core/object_ptr.hpp | mocabe/Neco-lang-v2 | a30075802492fa5c2d1725a2ba0e3e06dde4ce13 | [
"MIT"
] | 7 | 2019-02-11T13:50:25.000Z | 2019-10-28T15:39:18.000Z | include/tori/core/object_ptr.hpp | mocabe/tori | a30075802492fa5c2d1725a2ba0e3e06dde4ce13 | [
"MIT"
] | null | null | null | // Copyright (c) 2018-2019 mocabe(https://github.com/mocabe)
// This code is licensed under MIT license.
#pragma once
#if !defined(TORI_NO_LOCAL_INCLUDE)
# include "../config/config.hpp"
# include "object.hpp"
# include "object_ptr_storage.hpp"
#endif
namespace TORI_NS::detail {
namespace interface {
// -... | 24.241176 | 80 | 0.544892 | mocabe |
3fb824b70234da988dce09d243a969140398ce5c | 2,860 | hpp | C++ | src/NBT/Tag.hpp | Bradshaw/MinedMap | 5263538a29c9c6030ced078a509dff48f9c4451f | [
"BSD-2-Clause"
] | 31 | 2018-11-07T08:49:25.000Z | 2022-02-20T22:52:55.000Z | src/NBT/Tag.hpp | Bradshaw/MinedMap | 5263538a29c9c6030ced078a509dff48f9c4451f | [
"BSD-2-Clause"
] | 20 | 2018-11-07T08:50:32.000Z | 2022-02-14T07:59:01.000Z | src/NBT/Tag.hpp | Bradshaw/MinedMap | 5263538a29c9c6030ced078a509dff48f9c4451f | [
"BSD-2-Clause"
] | 6 | 2018-11-07T10:11:40.000Z | 2021-11-16T21:55:05.000Z | /*
Copyright (c) 2015, Matthias Schiffer <mschiffer@universe-factory.net>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright no... | 27.5 | 88 | 0.725874 | Bradshaw |
3fb9779a2f5d5e21f8dbd6131825bb9e03537e60 | 5,009 | hpp | C++ | mpng.hpp | MartinezTorres/uSnippets | 21fec6d2557bd1231ac795ef93bfdbc464938171 | [
"Apache-2.0"
] | 2 | 2017-04-03T19:57:24.000Z | 2018-06-24T10:32:44.000Z | mpng.hpp | MartinezTorres/uSnippets | 21fec6d2557bd1231ac795ef93bfdbc464938171 | [
"Apache-2.0"
] | null | null | null | mpng.hpp | MartinezTorres/uSnippets | 21fec6d2557bd1231ac795ef93bfdbc464938171 | [
"Apache-2.0"
] | 1 | 2018-06-24T10:32:48.000Z | 2018-06-24T10:32:48.000Z | ////////////////////////////////////////////////////////////////////////
// PNG coder with metadata support
//
// Manuel Martinez (manuel.martinez@kit.edu)
//
// license: LGPLv3
#include <uSnippets/object.hpp>
#include <fstream>
#include <opencv/cv.h>
#include <png.h>
namespace uSnippets {
class MPNG : public cv::Mat... | 37.661654 | 161 | 0.693951 | MartinezTorres |
3fc2c77bda5853894a809c9c3210361f74b3ce50 | 540 | cc | C++ | basic/std_function/09_template.cc | chanchann/littleMickle | f3a839d8ad55f483bbac4e4224dcd35234c5aa00 | [
"MIT"
] | 1 | 2021-03-16T02:13:12.000Z | 2021-03-16T02:13:12.000Z | basic/std_function/09_template.cc | chanchann/littleMickle | f3a839d8ad55f483bbac4e4224dcd35234c5aa00 | [
"MIT"
] | null | null | null | basic/std_function/09_template.cc | chanchann/littleMickle | f3a839d8ad55f483bbac4e4224dcd35234c5aa00 | [
"MIT"
] | null | null | null | /*
function与类模板和函数模板
*/
#include <iostream>
#include <functional>
using namespace std;
using namespace std::placeholders;
template<typename T>
struct Func {
static int Add(T a, T b){ return a + b; }
int Add2(T a, T b){ return a + b; }
};
template<typename T>
T Add(T a, T b) {
return a + b;
}
int main() ... | 18 | 69 | 0.596296 | chanchann |
3fc52de79b06293de53dbb866430f3e89204a4ae | 2,832 | cpp | C++ | src/material/diffuse_material.cpp | epicodic/diligent-graph | 64325a17498fa6b913bffadfc1a43108c81dd7b0 | [
"Apache-2.0"
] | 3 | 2020-08-25T07:54:43.000Z | 2021-01-14T20:05:06.000Z | src/material/diffuse_material.cpp | epicodic/diligent-graph | 64325a17498fa6b913bffadfc1a43108c81dd7b0 | [
"Apache-2.0"
] | null | null | null | src/material/diffuse_material.cpp | epicodic/diligent-graph | 64325a17498fa6b913bffadfc1a43108c81dd7b0 | [
"Apache-2.0"
] | null | null | null |
#include <dg/material/diffuse_material.hpp>
#include <dg/material/common_constants.hpp>
#include <DiligentCore/Graphics/GraphicsEngine/interface/PipelineState.h>
namespace dg {
struct DiffuseMaterial::MaterialVS
{
Color color;
};
static const char* g_diffuse_material_vs =
DG_COMMON_CONSTANTS_VS_CODE
R"===(
cbu... | 22.299213 | 116 | 0.701624 | epicodic |
3fc6f15c52a24c0420fe2a6378d9f32e7ab9044b | 785 | hpp | C++ | Programming Guide/Headers/Siv3D/Triangle3D.hpp | Reputeless/Siv3D-Reference | d58e92885241d11612007fb9187ce0289a7ee9cb | [
"MIT"
] | 38 | 2016-01-14T13:51:13.000Z | 2021-12-29T01:49:30.000Z | Programming Guide/Headers/Siv3D/Triangle3D.hpp | Reputeless/Siv3D-Reference | d58e92885241d11612007fb9187ce0289a7ee9cb | [
"MIT"
] | null | null | null | Programming Guide/Headers/Siv3D/Triangle3D.hpp | Reputeless/Siv3D-Reference | d58e92885241d11612007fb9187ce0289a7ee9cb | [
"MIT"
] | 16 | 2016-01-15T11:07:51.000Z | 2021-12-29T01:49:37.000Z | //-----------------------------------------------
//
// This file is part of the Siv3D Engine.
//
// Copyright (C) 2008-2016 Ryo Suzuki
//
// Licensed under the MIT License.
//
//-----------------------------------------------
# pragma once
# include "PointVector.hpp"
# include "DirectXMathUtility.hpp"
namespace s3d... | 19.625 | 69 | 0.551592 | Reputeless |
3fd40001f61733230d2b9a2c9596be475723d38d | 3,792 | cpp | C++ | VSDataReduction/s2opt.cpp | sfegan/ChiLA | 916bdd95348c2df2ecc736511d5f5b2bfb4a831e | [
"BSD-3-Clause"
] | 1 | 2018-04-17T14:03:36.000Z | 2018-04-17T14:03:36.000Z | VSDataReduction/s2opt.cpp | sfegan/ChiLA | 916bdd95348c2df2ecc736511d5f5b2bfb4a831e | [
"BSD-3-Clause"
] | null | null | null | VSDataReduction/s2opt.cpp | sfegan/ChiLA | 916bdd95348c2df2ecc736511d5f5b2bfb4a831e | [
"BSD-3-Clause"
] | null | null | null | /*! \file s2opt.cpp
Program to print out or compare options from stage2 file
\author Stephen Fegan \n
UCLA \n
sfegan@astro.ucla.edu \n
\version 1.0
\date 11/12/2007
$Id: s2opt.cpp,v 3.5 2007/12/04 18:05:04 sfegan Exp $
... | 27.280576 | 79 | 0.582542 | sfegan |
3fd5df3c2bddda0d5e9151737712118aa37470c7 | 226 | cpp | C++ | estl/test/algorithm_test.cpp | Eospp/Eospp | bc231908aaf34dfc2f790a259487253a4151be16 | [
"MIT"
] | 18 | 2022-01-21T18:19:37.000Z | 2022-03-15T05:26:32.000Z | estl/test/algorithm_test.cpp | Eospp/Eospp | bc231908aaf34dfc2f790a259487253a4151be16 | [
"MIT"
] | null | null | null | estl/test/algorithm_test.cpp | Eospp/Eospp | bc231908aaf34dfc2f790a259487253a4151be16 | [
"MIT"
] | 3 | 2022-01-22T14:24:04.000Z | 2022-02-23T10:19:11.000Z | #include <algorithm.hpp>
#include <gtest/gtest.h>
TEST(ALGORITHM_TEST,BASE_TEST){
EXPECT_EQ(estd::min(1,2),1);
EXPECT_EQ(estd::min(-1,2),-1);
EXPECT_EQ(estd::max(10,12),12);
EXPECT_EQ(estd::max(100,2),100);
} | 22.6 | 36 | 0.650442 | Eospp |
3fd9279f379e2150c3909f1041ebc8c7a23656d6 | 6,823 | cpp | C++ | plugins/gui/src/searchbar/searchbar.cpp | emsec/HAL | 608e801896e1b5254b28ce0f29d4d898b81b0f77 | [
"MIT"
] | 407 | 2019-04-26T10:45:52.000Z | 2022-03-31T15:52:30.000Z | plugins/gui/src/searchbar/searchbar.cpp | emsec/HAL | 608e801896e1b5254b28ce0f29d4d898b81b0f77 | [
"MIT"
] | 219 | 2019-04-29T16:42:01.000Z | 2022-03-11T22:57:41.000Z | plugins/gui/src/searchbar/searchbar.cpp | emsec/HAL | 608e801896e1b5254b28ce0f29d4d898b81b0f77 | [
"MIT"
] | 53 | 2019-05-02T21:23:35.000Z | 2022-03-11T19:46:05.000Z | #include "gui/searchbar/searchbar.h"
#include "gui/gui_utils/graphics.h"
#include "gui/label_button/label_button.h"
#include <QHBoxLayout>
#include <QIcon>
#include <QLabel>
#include <QLineEdit>
#include <QPixmap>
#include <QPushButton>
#include <QStyle>
#include <QToolButton>
namespace hal
{
Searchbar::Searchba... | 26.652344 | 176 | 0.654697 | emsec |
3fdfcf393d287cb04dcbe75aac8072cb1145ead3 | 2,515 | cpp | C++ | samples/Animations/src/AnimationsSample.cpp | Daivuk/onut | b02c5969b36897813de9c574a26d9437b67f189e | [
"MIT"
] | 50 | 2015-06-01T19:23:24.000Z | 2021-12-22T02:14:23.000Z | samples/Animations/src/AnimationsSample.cpp | Daivuk/onut | b02c5969b36897813de9c574a26d9437b67f189e | [
"MIT"
] | 109 | 2015-07-20T07:43:03.000Z | 2021-01-31T21:52:36.000Z | samples/Animations/src/AnimationsSample.cpp | Daivuk/onut | b02c5969b36897813de9c574a26d9437b67f189e | [
"MIT"
] | 9 | 2015-07-02T21:36:20.000Z | 2019-10-19T04:18:02.000Z | // Oak Nut include
#include <onut/Anim.h>
#include <onut/Renderer.h>
#include <onut/Settings.h>
#include <onut/Sound.h>
#include <onut/SpriteBatch.h>
#include <onut/Texture.h>
void initSettings()
{
oSettings->setGameName("Animations Sample");
}
OAnimFloat angleAnim1;
OAnimFloat angleAnim2;
OAnimVector2 bounceAnim... | 23.504673 | 98 | 0.616302 | Daivuk |
3fe10628ae81a86723f3ae37d3260614631b957a | 15,398 | cpp | C++ | NGene/src/_system/systems/CollisionSystem.cpp | osor-io/NGene | c28887f233d3485b9e95fa3882a0333e4180c655 | [
"MIT"
] | 2 | 2021-05-14T14:57:30.000Z | 2021-08-05T04:00:41.000Z | NGene/src/_system/systems/CollisionSystem.cpp | osor-io/NGene | c28887f233d3485b9e95fa3882a0333e4180c655 | [
"MIT"
] | null | null | null | NGene/src/_system/systems/CollisionSystem.cpp | osor-io/NGene | c28887f233d3485b9e95fa3882a0333e4180c655 | [
"MIT"
] | 2 | 2021-03-07T12:53:44.000Z | 2021-05-14T14:57:31.000Z | #include "CollisionSystem.h"
#include <../_component/components/CollisionComponent.h>
#include <../time/TimeManager.h>
#include "../physics/AABB.h"
#include "../math/Vector.h"
#define RECHECK_LIMIT 100
CollisionSystem::CollisionSystem() {}
CollisionSystem::~CollisionSystem() {}
void CollisionSystem::start_up() {
... | 37.556098 | 146 | 0.642486 | osor-io |
684608f22a9a2f4168ab100da04d13e41459a3a9 | 16,586 | cc | C++ | src/phy/FDChannelizer.cc | drexelwireless/dragonradio | 885abd68d56af709e7a53737352641908005c45b | [
"MIT"
] | 8 | 2020-12-05T20:30:54.000Z | 2022-01-22T13:32:14.000Z | src/phy/FDChannelizer.cc | drexelwireless/dragonradio | 885abd68d56af709e7a53737352641908005c45b | [
"MIT"
] | 3 | 2020-10-28T22:15:27.000Z | 2021-01-27T14:43:41.000Z | src/phy/FDChannelizer.cc | drexelwireless/dragonradio | 885abd68d56af709e7a53737352641908005c45b | [
"MIT"
] | null | null | null | // Copyright 2018-2020 Drexel University
// Author: Geoffrey Mainland <mainland@drexel.edu>
#include <math.h>
#include <functional>
#include <xsimd/xsimd.hpp>
#include <xsimd/stl/algorithms.hpp>
#include <pybind11/pybind11.h>
namespace py = pybind11;
#include "phy/FDChannelizer.hh"
#include "phy/PHY.hh"
using na... | 33.238477 | 111 | 0.520137 | drexelwireless |
684f7eb864a136b2aba1b9db39cb487b2de2e9c9 | 1,763 | cpp | C++ | Leet Code/Construct Binary Tree from Inorder and Postorder Traversal.cpp | Shubhrmcf07/Competitive-Coding-and-Interview-Problems | 7281ea3163c0cf6938a3af7b54a8a14f97c97c0e | [
"MIT"
] | 51 | 2020-02-24T11:14:00.000Z | 2022-03-24T09:32:18.000Z | Leet Code/Construct Binary Tree from Inorder and Postorder Traversal.cpp | Shubhrmcf07/Competitive-Coding-and-Interview-Problems | 7281ea3163c0cf6938a3af7b54a8a14f97c97c0e | [
"MIT"
] | 3 | 2020-10-02T08:16:09.000Z | 2021-04-17T16:32:38.000Z | Leet Code/Construct Binary Tree from Inorder and Postorder Traversal.cpp | Shubhrmcf07/Competitive-Coding-and-Interview-Problems | 7281ea3163c0cf6938a3af7b54a8a14f97c97c0e | [
"MIT"
] | 18 | 2020-04-24T15:33:36.000Z | 2022-03-24T09:32:20.000Z | /* Leet Code */
/* Title - Construct Binary Tree from Inorder and Postorder Traversal */
/* Created By - Akash Modak */
/* Date - 27/7/2020 */
// Given inorder and postorder traversal of a tree, construct the binary tree.
// Note:
// You may assume that duplicates do not exist in the tree.
// For example, ... | 29.383333 | 98 | 0.560976 | Shubhrmcf07 |
6850ea7eece683d81ad784d57c4276bc7c9acccb | 82 | cpp | C++ | usclientinterface.cpp | MagickPanda/UnchartedShui | 920cc213db9e81065fe08751a3b77b9062211fc3 | [
"MIT"
] | 2 | 2020-12-28T02:17:30.000Z | 2021-05-20T16:44:30.000Z | usclientinterface.cpp | MagickPanda/UnchartedShui | 920cc213db9e81065fe08751a3b77b9062211fc3 | [
"MIT"
] | null | null | null | usclientinterface.cpp | MagickPanda/UnchartedShui | 920cc213db9e81065fe08751a3b77b9062211fc3 | [
"MIT"
] | null | null | null | #include "usclientinterface.h"
UsClientInterface::UsClientInterface()
{
}
| 11.714286 | 39 | 0.719512 | MagickPanda |
68538653e49174b3ab3c1bbb656d57f1d7f11786 | 751 | cpp | C++ | external_libs/libzippp/main.cpp | kalsipp/xpanse | 540c4de6aabfad857ad5187875f5a223b54f8c3c | [
"MIT"
] | null | null | null | external_libs/libzippp/main.cpp | kalsipp/xpanse | 540c4de6aabfad857ad5187875f5a223b54f8c3c | [
"MIT"
] | null | null | null | external_libs/libzippp/main.cpp | kalsipp/xpanse | 540c4de6aabfad857ad5187875f5a223b54f8c3c | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <vector>
#include "libzippp.h"
using namespace libzippp;
int main(int argc, char **argv)
{
std::cout << "hello" << std::endl;
ZipArchive zf("archive.zip");
zf.open(ZipArchive::READ_ONLY);
std::vector<ZipEntry> entries = zf.getEntries();
std::vector<Z... | 22.757576 | 60 | 0.599201 | kalsipp |
68572d7229cec87efcb4de624b9995fbedc232e9 | 1,657 | cpp | C++ | src/PihaGPSReceiver.cpp | jbitoniau/Piha | 9f346066bf09a93abc5753b5dd996c7f598c9d38 | [
"MIT"
] | null | null | null | src/PihaGPSReceiver.cpp | jbitoniau/Piha | 9f346066bf09a93abc5753b5dd996c7f598c9d38 | [
"MIT"
] | null | null | null | src/PihaGPSReceiver.cpp | jbitoniau/Piha | 9f346066bf09a93abc5753b5dd996c7f598c9d38 | [
"MIT"
] | null | null | null | #include "PihaGPSReceiver.h"
#include <sstream>
namespace Piha
{
/*
GPSReceiver::Measure
*/
GPSReceiver::Measure::Measure()
: mLatitudeInDecDeg(0.0),
mLongitudeInDecDeg(0.0),
mAltitudeInM(0.0)
{
}
GPSReceiver::Measure::Measure( double latitudeInDecDeg, double longitudeInDecDeg, double altitudeInM )
: mLati... | 19.494118 | 156 | 0.718769 | jbitoniau |
685aa10c8010c6512af16e57b364e62d5ab5dbf3 | 359 | cpp | C++ | Tut 11 Break and Continue/Continue.cpp | anuragpathak0/C-Plus-Plus | 5e79e3c354b3544f385c77dfbc3fb0a9cef04f64 | [
"MIT"
] | null | null | null | Tut 11 Break and Continue/Continue.cpp | anuragpathak0/C-Plus-Plus | 5e79e3c354b3544f385c77dfbc3fb0a9cef04f64 | [
"MIT"
] | null | null | null | Tut 11 Break and Continue/Continue.cpp | anuragpathak0/C-Plus-Plus | 5e79e3c354b3544f385c77dfbc3fb0a9cef04f64 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main()
{
for(int i=1; i<=20; i++)
{
//if cout<<i<<endl; is written before continue state ment then our work is undone because continue statement is read after printing 10
if(i==10)
{
continue;
}
c... | 18.894737 | 143 | 0.520891 | anuragpathak0 |
6860e920bf026f8254ec74302a8f8ec51ad4bb99 | 17,875 | cpp | C++ | apps/router/tests/api/FullMatrixCacheDistanceMatrixEngineTest.cpp | Eaglegor/assfire-suite | 6c8140e848932b6ce22b6addd07a93abba652c01 | [
"MIT"
] | null | null | null | apps/router/tests/api/FullMatrixCacheDistanceMatrixEngineTest.cpp | Eaglegor/assfire-suite | 6c8140e848932b6ce22b6addd07a93abba652c01 | [
"MIT"
] | null | null | null | apps/router/tests/api/FullMatrixCacheDistanceMatrixEngineTest.cpp | Eaglegor/assfire-suite | 6c8140e848932b6ce22b6addd07a93abba652c01 | [
"MIT"
] | null | null | null | #include <gtest/gtest.h>
#include <assfire/router/api/distance_matrix_engines/FullMatrixCacheDistanceMatrixEngine.hpp>
#include "assfire/router/tests/MockRouteProviderEngine.hpp"
using namespace assfire;
using namespace assfire::router;
class FullMatrixCacheDistanceMatrixEngineTest : public ::testing::Test {
public:
... | 48.180593 | 203 | 0.763077 | Eaglegor |
68625e7fb016e37313dcfdca6ec7b3511852e768 | 1,949 | cpp | C++ | Graphs_Tarzan.cpp | Parthiv-657/DSA | 0923753218d934b728f6c44da0edb8af836bd1ab | [
"MIT"
] | null | null | null | Graphs_Tarzan.cpp | Parthiv-657/DSA | 0923753218d934b728f6c44da0edb8af836bd1ab | [
"MIT"
] | null | null | null | Graphs_Tarzan.cpp | Parthiv-657/DSA | 0923753218d934b728f6c44da0edb8af836bd1ab | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
int v = 9;
void Tarzan_DFS(vector<vector<int>>G, int *num, int *low, bool *vistd, int *parent, bool *tz, int u, int &pre){
num[u] = pre;
vistd[u] = 1;
low[u] = pre;
int ch = 0;
pre++;
for(int i=1; i<=v; i++){
if(G[u][i] != 0){
if(v... | 27.450704 | 111 | 0.373525 | Parthiv-657 |
6862bf12fd7680f76352ac46e5a5475a2a0bc2ff | 1,635 | cpp | C++ | src/app/hmi/CHMIGUIImageDesc.cpp | weratyr/EmFW | 77367ffc4061c529b43754d063053a8ccdd4d50c | [
"Apache-2.0"
] | 2 | 2019-03-08T23:20:03.000Z | 2020-09-18T01:28:23.000Z | src/app/hmi/CHMIGUIImageDesc.cpp | weratyr/EmFW | 77367ffc4061c529b43754d063053a8ccdd4d50c | [
"Apache-2.0"
] | null | null | null | src/app/hmi/CHMIGUIImageDesc.cpp | weratyr/EmFW | 77367ffc4061c529b43754d063053a8ccdd4d50c | [
"Apache-2.0"
] | null | null | null | /***************************************************************************
* openICM-application
***************************************************************************
* Copyright 2010 Joachim Wietzke and Manh Tien Tran
*
* Contact and informations:
* University of Applied Sciences Darmstadt, Germany
... | 34.0625 | 78 | 0.530275 | weratyr |
68630c9a9fd4b60893fbabb38d88bed9115254ad | 3,125 | cxx | C++ | STEER/ESD/AliESDMuonPad.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 52 | 2016-12-11T13:04:01.000Z | 2022-03-11T11:49:35.000Z | STEER/ESD/AliESDMuonPad.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 1,388 | 2016-11-01T10:27:36.000Z | 2022-03-30T15:26:09.000Z | STEER/ESD/AliESDMuonPad.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 275 | 2016-06-21T20:24:05.000Z | 2022-03-31T13:06:19.000Z | /**************************************************************************
* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors are ... | 32.552083 | 88 | 0.61184 | AllaMaevskaya |
68666e2e70301687012ca52a1814d71ffe720850 | 1,529 | cpp | C++ | Deck.cpp | Trustyn/BlackJack | 72f125e2c3e17d5182b91b0192cc4593917cada8 | [
"MIT"
] | null | null | null | Deck.cpp | Trustyn/BlackJack | 72f125e2c3e17d5182b91b0192cc4593917cada8 | [
"MIT"
] | null | null | null | Deck.cpp | Trustyn/BlackJack | 72f125e2c3e17d5182b91b0192cc4593917cada8 | [
"MIT"
] | null | null | null | #include "Deck.h"
/**************************************************************
* Purpose: Initialized array of cards to all 13 ranks for
* each of the 4 suits.
* Entry: None.
* Exit: Array of cards set equal to all 13 ranks for all
* 4 suits.
****************************************************... | 24.66129 | 65 | 0.448659 | Trustyn |
686a20806cd507d96d3b8cc4928b455cd674feb3 | 125 | hpp | C++ | Krakoa/Source/Maths/Point.hpp | KingKiller100/Krakatoa-Engine | ff07f7328d428c04e06b561b6afd315eea39865c | [
"Apache-2.0"
] | 1 | 2020-04-05T13:37:48.000Z | 2020-04-05T13:37:48.000Z | Krakoa/Source/Maths/Point.hpp | KingKiller100/Krakoa-Engine | 0f2a5a5109e256a384abe8dc21eacaa45c1de610 | [
"Apache-2.0"
] | null | null | null | Krakoa/Source/Maths/Point.hpp | KingKiller100/Krakoa-Engine | 0f2a5a5109e256a384abe8dc21eacaa45c1de610 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include <Maths/kMaths.hpp>
namespace maths
{
template<typename T>
using BasicPoint = kmaths::Vector2<T>;
} | 13.888889 | 39 | 0.728 | KingKiller100 |
68721e527f88ec1391ecbe09e23dce6cf86fe37b | 787 | cpp | C++ | Greedy Algorithm/cm4.cpp | AadityaJ/CodeMonk | bd719f6bd6f9792c98b538c1ef9948d2abf057d0 | [
"MIT"
] | null | null | null | Greedy Algorithm/cm4.cpp | AadityaJ/CodeMonk | bd719f6bd6f9792c98b538c1ef9948d2abf057d0 | [
"MIT"
] | null | null | null | Greedy Algorithm/cm4.cpp | AadityaJ/CodeMonk | bd719f6bd6f9792c98b538c1ef9948d2abf057d0 | [
"MIT"
] | null | null | null | //https://www.hackerearth.com/code-monk-greedy-technique/algorithm/little-jhool-and-his-addiction-2-4/description/
#include <stdio.h>
#include <algorithm>
using namespace std;
int main(int argc, char const *argv[])
{
int t;
scanf("%d",&t);
while(t--){
int n,k;
int v[1000001];
scanf("%d",&n);
scanf("%d",&k);
... | 24.59375 | 114 | 0.589581 | AadityaJ |
68769a86f4d63e8655f1b821f7d31064556d05c2 | 1,176 | hpp | C++ | include/store_handler.hpp | cristicbz/riakpp | 97eda4fd7ddcd767a673e4756015d2dee1ce82b7 | [
"Apache-2.0"
] | 2 | 2015-10-21T16:36:41.000Z | 2016-01-25T16:51:43.000Z | include/store_handler.hpp | reinfer/riakpp | 97eda4fd7ddcd767a673e4756015d2dee1ce82b7 | [
"Apache-2.0"
] | null | null | null | include/store_handler.hpp | reinfer/riakpp | 97eda4fd7ddcd767a673e4756015d2dee1ce82b7 | [
"Apache-2.0"
] | 1 | 2016-01-25T16:51:45.000Z | 2016-01-25T16:51:45.000Z | #ifndef RIAKPP_STORE_HANDLER_HPP_
#define RIAKPP_STORE_HANDLER_HPP_
#include <tuple>
#include <utility>
namespace riak {
template <typename ArgTuple>
class store_handler {
public:
enum from_args_t { from_args = 0 };
template <typename... Args>
store_handler(from_args_t, Args&&... args)
: extract_to_{st... | 25.021277 | 69 | 0.687075 | cristicbz |
6878ed0bc942d3a4b2993fe4b362a2447e76addf | 6,628 | cpp | C++ | OpenGL/test_stencilTesting.cpp | Khasehemwy/LearnOpenGL | 07648d64ea9cb3e2a451d43baccffc71592ab42d | [
"MIT"
] | null | null | null | OpenGL/test_stencilTesting.cpp | Khasehemwy/LearnOpenGL | 07648d64ea9cb3e2a451d43baccffc71592ab42d | [
"MIT"
] | null | null | null | OpenGL/test_stencilTesting.cpp | Khasehemwy/LearnOpenGL | 07648d64ea9cb3e2a451d43baccffc71592ab42d | [
"MIT"
] | null | null | null | #include"includes.h"
Camera camera;
float gl_deltaTime;
float fov = 45.0f;
unsigned int VAO, VBO, EBO;
float vertices[] = {
// positions // normals // texture coords
-0.5f, -0.5f, -0.5f, 0.0f, 0.0f, -1.0f, 0.0f, 0.0f,
0.5f, -0.5f, -0.5f, 0.0f, 0.0f, -1.0f, 1.0f, 0.0f,
0.5f, 0.5f, -0.... | 35.068783 | 118 | 0.617984 | Khasehemwy |
687b4fb769bc838dff9e5c3feb69358d04adb644 | 3,970 | cpp | C++ | volume_I/acm_1006.cpp | raidenluikang/acm.timus.ru | 9b7c99eb03959acff9dd96326eec642a2c31ed04 | [
"MIT"
] | null | null | null | volume_I/acm_1006.cpp | raidenluikang/acm.timus.ru | 9b7c99eb03959acff9dd96326eec642a2c31ed04 | [
"MIT"
] | null | null | null | volume_I/acm_1006.cpp | raidenluikang/acm.timus.ru | 9b7c99eb03959acff9dd96326eec642a2c31ed04 | [
"MIT"
] | null | null | null |
//acm.timus.ru 1006. Squares.
#include <stdio.h>
#include <string.h>
#define L_U 218 // left upper
#define L_D 192 // left down
#define R_U 191 // right upper
#define R_D 217 // right down
#define VER 179 // vertical
#define HOR 196 // horizontal
#define EMT 200
#define DOT 46
struct alignas(64) ... | 19.949749 | 125 | 0.517632 | raidenluikang |
689732386a48646f8af64a2db9c1abc4c542ce67 | 1,309 | cpp | C++ | tree.cpp | parstools/l-shared-ptr | b99049720031121bcd8430f71abe4240ee19f27b | [
"Apache-2.0"
] | null | null | null | tree.cpp | parstools/l-shared-ptr | b99049720031121bcd8430f71abe4240ee19f27b | [
"Apache-2.0"
] | null | null | null | tree.cpp | parstools/l-shared-ptr | b99049720031121bcd8430f71abe4240ee19f27b | [
"Apache-2.0"
] | null | null | null | //
// Created by andrzej on 10/13/21.
//
#include "tree.h"
#include <iostream>
using namespace std;
int Node::countId = 0;
Node::Node(Node* parent) {
id = countId;
countId++;
lweak_assign((Object**)&this->parent, (Object*)parent); //weak!
if (parent!=nullptr)
depth = parent->depth+1;
left... | 24.698113 | 115 | 0.62796 | parstools |
6899ca02c00b11d98d27956986e48f9a3d47dbf9 | 4,058 | cc | C++ | library/LayoutEmbedding/Harmonic.cc | jsb/LayoutEmbedding | 6ef02ed0043dfabce6d593486358d6ef15cbf3ba | [
"MIT"
] | 18 | 2021-02-18T15:35:25.000Z | 2022-03-01T07:20:37.000Z | library/LayoutEmbedding/Harmonic.cc | jsb/LayoutEmbedding | 6ef02ed0043dfabce6d593486358d6ef15cbf3ba | [
"MIT"
] | null | null | null | library/LayoutEmbedding/Harmonic.cc | jsb/LayoutEmbedding | 6ef02ed0043dfabce6d593486358d6ef15cbf3ba | [
"MIT"
] | 5 | 2021-02-17T14:52:42.000Z | 2021-10-05T09:51:25.000Z | #include "Harmonic.hh"
#include <LayoutEmbedding/Util/Assert.hh>
#include <Eigen/SparseLU>
namespace LayoutEmbedding
{
namespace
{
/// Angle at to-vertex between given and next halfedge
auto calc_sector_angle(
const pm::vertex_attribute<tg::pos3>& _pos,
const pm::halfedge_handle& _h)
{
const aut... | 28.780142 | 111 | 0.602021 | jsb |
689b4e1459e72746976914578d9a694df0f09aca | 59 | cpp | C++ | minunity/src/minunity/game_exception.cpp | DmitryDzz/keyzz | 85e63ea465116e0b7f37aa8633a6d6beeabd6779 | [
"MIT"
] | null | null | null | minunity/src/minunity/game_exception.cpp | DmitryDzz/keyzz | 85e63ea465116e0b7f37aa8633a6d6beeabd6779 | [
"MIT"
] | 6 | 2021-05-05T18:08:55.000Z | 2021-05-15T16:01:00.000Z | minunity/src/minunity/game_exception.cpp | DmitryDzz/keyzz | 85e63ea465116e0b7f37aa8633a6d6beeabd6779 | [
"MIT"
] | null | null | null | // Copyright 2020 DmitryDzz
#include "game_exception.hpp"
| 14.75 | 29 | 0.779661 | DmitryDzz |
689cd2291b129464ead0331ed499711d64e58fe3 | 705 | hpp | C++ | RType.Common/Headers/Components/Input.hpp | Mikyan0207/RType | ae3d0e4b3192577eccfb3ba55ac86bd7238e9451 | [
"MIT",
"Unlicense"
] | null | null | null | RType.Common/Headers/Components/Input.hpp | Mikyan0207/RType | ae3d0e4b3192577eccfb3ba55ac86bd7238e9451 | [
"MIT",
"Unlicense"
] | null | null | null | RType.Common/Headers/Components/Input.hpp | Mikyan0207/RType | ae3d0e4b3192577eccfb3ba55ac86bd7238e9451 | [
"MIT",
"Unlicense"
] | null | null | null | #pragma once
#include <unordered_map>
#include <Components/Component.hpp>
#include <Managers/Inputs.hpp>
#include <SFML/Graphics.hpp>
class RTYPECOMMON_API Input final : public Component
{
public:
static constexpr std::size_t Id = 0x0006;
public:
Input(const std::unordered_map<Inputs, sf::Keyboard::Key>& keys);
I... | 24.310345 | 66 | 0.72766 | Mikyan0207 |
68a7a52abec7f3543e3cbdcd783b336c81d6eac8 | 2,574 | cc | C++ | burger/net/tests/TcpClient_test.cc | BurgerGroup/Burger | b9159ea8855122a32091d40eb24439456f8879a9 | [
"MIT"
] | 30 | 2021-05-07T16:54:30.000Z | 2022-03-12T01:55:49.000Z | burger/net/tests/TcpClient_test.cc | chanchann/Burger | b9159ea8855122a32091d40eb24439456f8879a9 | [
"MIT"
] | 1 | 2021-07-27T16:27:14.000Z | 2021-07-27T16:27:14.000Z | burger/net/tests/TcpClient_test.cc | chanchann/Burger | b9159ea8855122a32091d40eb24439456f8879a9 | [
"MIT"
] | 9 | 2021-06-07T09:20:46.000Z | 2022-03-01T06:30:36.000Z |
#include <functional>
#include <string>
#include <unistd.h>
#include <memory>
#include "burger/net/Channel.h"
#include "burger/net/TcpClient.h"
#include "burger/net/InetAddress.h"
#include "burger/base/Util.h"
#include "burger/net/EventLoop.h"
using namespace burger;
using namespace burger::net;
/*
从键盘接收输入 -- 前台线程
... | 31.390244 | 101 | 0.601787 | BurgerGroup |
68ab8b2b3a67f289b88b1d6b1a14c82613155c22 | 798 | hpp | C++ | include/Common/Program.hpp | VisualGMQ/Chaos_Dungeon | 95f9b23934ee16573bf9289b9171958f750ffc93 | [
"MIT"
] | 2 | 2020-05-05T13:31:55.000Z | 2022-01-16T15:38:00.000Z | include/Common/Program.hpp | VisualGMQ/Chaos_Dungeon | 95f9b23934ee16573bf9289b9171958f750ffc93 | [
"MIT"
] | null | null | null | include/Common/Program.hpp | VisualGMQ/Chaos_Dungeon | 95f9b23934ee16573bf9289b9171958f750ffc93 | [
"MIT"
] | 1 | 2021-11-27T02:32:24.000Z | 2021-11-27T02:32:24.000Z | #ifndef PROGRAM_HPP
#define PROGRAM_HPP
#include "GL/glew.h"
#include "glm/glm.hpp"
#include "glm/gtc/type_ptr.hpp"
#include <string>
#include <fstream>
#include <iostream>
using namespace std;
enum class ShaderType{
VERTEX_SHADER,
FRAG_SHADER
};
class Program{
public:
static Program& GetInstance();
G... | 22.8 | 59 | 0.715539 | VisualGMQ |
68acbaffd16b849d2177f85a5ffb54411931a333 | 913 | cpp | C++ | L1-054/main.cpp | Heliovic/GPLT | 7e8745e589a6b6594d4db24a2030f3b0e6efe38b | [
"MIT"
] | 1 | 2019-03-14T05:35:16.000Z | 2019-03-14T05:35:16.000Z | L1-054/main.cpp | Heliovic/GPLT | 7e8745e589a6b6594d4db24a2030f3b0e6efe38b | [
"MIT"
] | null | null | null | L1-054/main.cpp | Heliovic/GPLT | 7e8745e589a6b6594d4db24a2030f3b0e6efe38b | [
"MIT"
] | null | null | null | #include <cstdio>
#define MAX_N 128
using namespace std;
bool orig[MAX_N][MAX_N] = {0};
bool trans[MAX_N][MAX_N] = {0};
int N;
char fil;
int main()
{
fil = getchar();
scanf("%d", &N);
for (int i = 0; i < N; i++)
{
getchar();
for (int j = 0; j < N; j++)
{
orig[i]... | 17.901961 | 53 | 0.373494 | Heliovic |
68b726226a2b3deeabc63526aca419dcae893ea0 | 1,650 | cpp | C++ | src/ci/Pane.cpp | kay54068/qtc-utilities | e75b2a7a8d8183de2ff1178f06fe79e36838ad17 | [
"MIT"
] | 8 | 2016-08-26T16:54:35.000Z | 2021-07-16T19:48:33.000Z | src/ci/Pane.cpp | kay54068/qtc-utilities | e75b2a7a8d8183de2ff1178f06fe79e36838ad17 | [
"MIT"
] | 1 | 2020-09-08T16:32:53.000Z | 2020-09-10T14:14:56.000Z | src/ci/Pane.cpp | kay54068/qtc-utilities | e75b2a7a8d8183de2ff1178f06fe79e36838ad17 | [
"MIT"
] | 4 | 2018-04-25T22:19:24.000Z | 2020-09-10T14:15:35.000Z | #include "Pane.h"
#include "Model.h"
namespace QtcUtilities {
namespace Internal {
namespace Ci {
Pane::Pane (QObject *parent)
: IOutputPane (parent), widget_ (new QTreeView), model_ (new Model (this)) {
widget_->setModel (model_);
widget_->setEditTriggers (QAbstractItemView::NoEdi... | 21.428571 | 84 | 0.553333 | kay54068 |
68b7acf2c995d1fb77da1232acb86a5e35d7702e | 1,851 | cpp | C++ | codes/HDU/hdu5348.cpp | JeraKrs/ACM | edcd61ec6764b8cd804bf1538dfde53d0ff572b5 | [
"Apache-2.0"
] | null | null | null | codes/HDU/hdu5348.cpp | JeraKrs/ACM | edcd61ec6764b8cd804bf1538dfde53d0ff572b5 | [
"Apache-2.0"
] | null | null | null | codes/HDU/hdu5348.cpp | JeraKrs/ACM | edcd61ec6764b8cd804bf1538dfde53d0ff572b5 | [
"Apache-2.0"
] | null | null | null | #pragma comment(linker, "/STACK:102400000,102400000")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 1e5 + 5;
typedef pair<int,int> pii;
int N, M, F[maxn * 3], D[maxn * 3], P[maxn * 3], Vis[maxn * 3];
vector<pii> G[maxn];
void init... | 16.526786 | 63 | 0.43382 | JeraKrs |
68b7ec3cbd55866544d9084ac4ff2d480f6f6f8d | 679 | hpp | C++ | src/version.hpp | vividos/ProgrammersGlasses | d54f4dce46aa1db1b2fb5db8f6b00366aaf23e02 | [
"MIT"
] | 1 | 2020-05-11T11:46:38.000Z | 2020-05-11T11:46:38.000Z | src/version.hpp | vividos/ProgrammersGlasses | d54f4dce46aa1db1b2fb5db8f6b00366aaf23e02 | [
"MIT"
] | null | null | null | src/version.hpp | vividos/ProgrammersGlasses | d54f4dce46aa1db1b2fb5db8f6b00366aaf23e02 | [
"MIT"
] | null | null | null | //
// Programmer's Glasses - a developer's file content viewer
// Copyright (c) 2020 Michael Fink
//
/// \file version.hpp
/// \brief version number
//
#pragma once
#define MAJOR_VERSION 0
#define MINOR_VERSION 1
#define RELEASE_NUMBER 0
#define BUILD_NUMBER 0
#define BUILD_YEAR 2020
#define STRINGIFY(s) STRINGIFY2(s... | 27.16 | 94 | 0.776141 | vividos |
68baeddf24e379609516c43a55f790949d146d9c | 5,597 | cpp | C++ | D-feistelfun/mitm.cpp | Compete-McGill/NP-Compete-2019 | 24f01d29b33098f5ce76557e3447e3012767c19e | [
"MIT"
] | 1 | 2019-10-04T16:55:03.000Z | 2019-10-04T16:55:03.000Z | d_3.cpp | Liresol/NP-Compete-2019 | 69ad074231db6b653261955e0a37e09588773312 | [
"MIT"
] | 1 | 2019-10-03T20:34:03.000Z | 2019-10-03T20:34:03.000Z | d_3.cpp | Liresol/NP-Compete-2019 | 69ad074231db6b653261955e0a37e09588773312 | [
"MIT"
] | 2 | 2019-10-02T15:21:07.000Z | 2020-04-27T20:08:07.000Z | /*
* REQUIRED READING: The precomputation answer
For those who really don't want to precompute, there is a solution to calculate the answer live, but the time saved
by avoiding precomputation is easily lost by having to solve and optimize the solution (remember the 1 second time limit)
This will be solved w... | 33.118343 | 126 | 0.644095 | Compete-McGill |
68bb8f81c774b82ff536a10850edcaacfcdcfa4b | 3,038 | cpp | C++ | Samples/WiFiDirect/cppwinrt/SocketReaderWriter.cpp | dujianxin/Windows-universal-samples | d4e95ff0ac408c5d4d980bb18d53fb2c6556a273 | [
"MIT"
] | 2,504 | 2019-05-07T06:56:42.000Z | 2022-03-31T19:37:59.000Z | Samples/WiFiDirect/cppwinrt/SocketReaderWriter.cpp | dujianxin/Windows-universal-samples | d4e95ff0ac408c5d4d980bb18d53fb2c6556a273 | [
"MIT"
] | 314 | 2019-05-08T16:56:30.000Z | 2022-03-21T07:13:45.000Z | Samples/WiFiDirect/cppwinrt/SocketReaderWriter.cpp | dujianxin/Windows-universal-samples | d4e95ff0ac408c5d4d980bb18d53fb2c6556a273 | [
"MIT"
] | 2,219 | 2019-05-07T00:47:26.000Z | 2022-03-30T21:12:31.000Z | //*********************************************************
//
// Copyright (c) Microsoft. All rights reserved.
// This code is licensed under the MIT License (MIT).
// THIS CODE IS PROVIDED *AS IS* WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING ANY
// IMPLIED WARRANTIES OF FITNESS FOR A PA... | 34.134831 | 110 | 0.591508 | dujianxin |
68bc4caeee6f4039793ee79e8893ce04c292647b | 420 | cpp | C++ | src/Text.cpp | drwalton/GLDemo | abc2c7960781018b4ab0d7843e5682ab3a238b90 | [
"MIT"
] | 3 | 2015-08-09T05:31:44.000Z | 2019-03-21T12:59:09.000Z | src/Text.cpp | drwalton/GLDemo | abc2c7960781018b4ab0d7843e5682ab3a238b90 | [
"MIT"
] | null | null | null | src/Text.cpp | drwalton/GLDemo | abc2c7960781018b4ab0d7843e5682ab3a238b90 | [
"MIT"
] | null | null | null | #include "Text.hpp"
#include <GL/freeglut.h>
namespace GLDemo
{
float Text::x = -0.9f;
float Text::y = 0.9f;
glm::vec4 Text::color = glm::vec4(.0f, .0f, .0f, 1.f);
void* Text::font = GLUT_BITMAP_HELVETICA_18;
void Text::render(const std::string& text)
{
glRasterPos2f(x, y);
glColor4f(color.x, color.y, colo... | 22.105263 | 79 | 0.671429 | drwalton |
68bdeaad1c6d2e0ebb65715fac79ee458b6b3ec1 | 12,712 | cpp | C++ | odm_meshing/src/OdmMeshing.cpp | geraldmwangi/OpenDroneMap | a4fb16e3f3d7d09b10dcd5ddd6991af4208d4cb3 | [
"BSD-3-Clause-Open-MPI",
"BSL-1.0",
"ImageMagick",
"BSD-1-Clause"
] | 1 | 2021-05-26T05:04:31.000Z | 2021-05-26T05:04:31.000Z | odm_meshing/src/OdmMeshing.cpp | geraldmwangi/OpenDroneMap | a4fb16e3f3d7d09b10dcd5ddd6991af4208d4cb3 | [
"BSD-3-Clause-Open-MPI",
"BSL-1.0",
"ImageMagick",
"BSD-1-Clause"
] | null | null | null | odm_meshing/src/OdmMeshing.cpp | geraldmwangi/OpenDroneMap | a4fb16e3f3d7d09b10dcd5ddd6991af4208d4cb3 | [
"BSD-3-Clause-Open-MPI",
"BSL-1.0",
"ImageMagick",
"BSD-1-Clause"
] | 1 | 2015-06-27T20:57:15.000Z | 2015-06-27T20:57:15.000Z | #include "OdmMeshing.hpp"
OdmMeshing::OdmMeshing() : log_(false)
{
meshCreator_ = pcl::Poisson<pcl::PointNormal>::Ptr(new pcl::Poisson<pcl::PointNormal>());
points_ = pcl::PointCloud<pcl::PointNormal>::Ptr(new pcl::PointCloud<pcl::PointNormal>());
mesh_ = pcl::PolygonMeshPtr(new pcl::PolygonMesh);
... | 35.116022 | 147 | 0.574654 | geraldmwangi |
68be295d4d6a29fa46fceac076b0f7f89fcd22a1 | 355 | hpp | C++ | src/behavior/singleagent/options/option_type.hpp | MarkieMark/fastrl | e4f0b9b60a7ecb6f13bbb79936ea82acb8adae0e | [
"Apache-2.0"
] | 4 | 2019-04-19T00:11:36.000Z | 2020-04-08T09:50:37.000Z | src/behavior/singleagent/options/option_type.hpp | MarkieMark/fastrl | e4f0b9b60a7ecb6f13bbb79936ea82acb8adae0e | [
"Apache-2.0"
] | null | null | null | src/behavior/singleagent/options/option_type.hpp | MarkieMark/fastrl | e4f0b9b60a7ecb6f13bbb79936ea82acb8adae0e | [
"Apache-2.0"
] | null | null | null | /*
* Mark Benjamin 04 March 2019.
* Copyright (c) 2019 Mark Benjamin
*/
#ifndef FASTRL_BEHAVIOR_SINGLEAGENT_OPTIONS_OPTION_TYPE_HPP
#define FASTRL_BEHAVIOR_SINGLEAGENT_OPTIONS_OPTION_TYPE_HPP
#include "../../../mdp/core/action/action_type.hpp"
class OptionType : public ActionType {
};
#endif //FASTRL_BEHAVIOR_S... | 22.1875 | 60 | 0.8 | MarkieMark |
68bf4075f5318099d30c3d9933918bcef02761ab | 4,857 | inl | C++ | ZeroLibraries/Common/Math/GenericVector.inl | jodavis42/ZeroPhysicsTestbed | e84a3f6faf16b7a4242dc049121b5338e80039f8 | [
"MIT"
] | 1 | 2022-03-26T21:08:19.000Z | 2022-03-26T21:08:19.000Z | ZeroLibraries/Common/Math/GenericVector.inl | jodavis42/ZeroPhysicsTestbed | e84a3f6faf16b7a4242dc049121b5338e80039f8 | [
"MIT"
] | null | null | null | ZeroLibraries/Common/Math/GenericVector.inl | jodavis42/ZeroPhysicsTestbed | e84a3f6faf16b7a4242dc049121b5338e80039f8 | [
"MIT"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
///
/// \file GenericVector.inl
/// Implementation of the GenericVector structure.
///
/// Authors: Joshua Davis
/// Copyright 2010-2012, DigiPen Institute of Technology
///
/////////////////////////////////////////////////////////////////... | 27.440678 | 120 | 0.690961 | jodavis42 |
68c2d92402d63b30de4c82658b5abffd8ae55745 | 472 | cpp | C++ | src/main/cpp/subsystems/ShooterSubsystemBase.cpp | 1828Boxerbots/NewRobotsInOneCode | be15f8008d964640c06e9a95ac540f9048bc5845 | [
"BSD-3-Clause"
] | null | null | null | src/main/cpp/subsystems/ShooterSubsystemBase.cpp | 1828Boxerbots/NewRobotsInOneCode | be15f8008d964640c06e9a95ac540f9048bc5845 | [
"BSD-3-Clause"
] | null | null | null | src/main/cpp/subsystems/ShooterSubsystemBase.cpp | 1828Boxerbots/NewRobotsInOneCode | be15f8008d964640c06e9a95ac540f9048bc5845 | [
"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 "subsystems/ShooterSubsystemBase.h"
ShooterSubsystemBase::ShooterSubsystemBase() = default;
// This method wi... | 29.5 | 74 | 0.773305 | 1828Boxerbots |
68c986985bd693d19a6aec8a95195fa04901625c | 1,436 | cpp | C++ | msvc/EuhatExpert/Expert/EuhatRightDlg.cpp | euhat/EuhatExpert | 3932238a0bd72a8f12b4ae6ced1ade6482228fe0 | [
"BSD-2-Clause"
] | null | null | null | msvc/EuhatExpert/Expert/EuhatRightDlg.cpp | euhat/EuhatExpert | 3932238a0bd72a8f12b4ae6ced1ade6482228fe0 | [
"BSD-2-Clause"
] | null | null | null | msvc/EuhatExpert/Expert/EuhatRightDlg.cpp | euhat/EuhatExpert | 3932238a0bd72a8f12b4ae6ced1ade6482228fe0 | [
"BSD-2-Clause"
] | null | null | null | #include "stdafx.h"
#include "Expert.h"
#include "ExpertDlg.h"
#include "EuhatRightDlg.h"
#include "afxdialogex.h"
#include <EuhatTabCtrl.h>
#include <EuhatPostDefMfc.h>
EuhatRightDlg::EuhatRightDlg(int idd, EuhatBase *euhatBase)
: MfcBasePage(idd, euhatBase)
{
}
EuhatRightDlg::~EuhatRightDlg()
{
}
void EuhatRigh... | 20.811594 | 114 | 0.741643 | euhat |
68ca45748e3db0afbc9c1615949dcd9effb571b8 | 4,136 | cpp | C++ | vsm/lib/util/text.cpp | kappazeta/cm-vsm | ecb7e6ab81e42785d13e2621cd7f4c19305b62cc | [
"Apache-2.0"
] | null | null | null | vsm/lib/util/text.cpp | kappazeta/cm-vsm | ecb7e6ab81e42785d13e2621cd7f4c19305b62cc | [
"Apache-2.0"
] | 5 | 2021-03-23T07:30:09.000Z | 2022-03-04T09:13:11.000Z | vsm/lib/util/text.cpp | kappazeta/cvat-vsm | 4c00fe5c5faaefbb0235ba80b32610ed297d2feb | [
"Apache-2.0"
] | 3 | 2021-03-11T12:45:03.000Z | 2021-03-11T12:54:34.000Z | // Utilities for operating with text
//
// Copyright 2020 KappaZeta Ltd.
//
// 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 ... | 39.018868 | 215 | 0.747582 | kappazeta |
68cf0c598c4fd87518065c8161794b785fb52dfe | 548 | cpp | C++ | UVa/11559.cpp | axelgio01/cp | 7a1c3490f913e4aea53e46bcfb5bb56c9b15605d | [
"MIT"
] | null | null | null | UVa/11559.cpp | axelgio01/cp | 7a1c3490f913e4aea53e46bcfb5bb56c9b15605d | [
"MIT"
] | null | null | null | UVa/11559.cpp | axelgio01/cp | 7a1c3490f913e4aea53e46bcfb5bb56c9b15605d | [
"MIT"
] | null | null | null | // https://onlinejudge.org/external/115/11559.pdf
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, b, h, w;
while (cin >> n >> b >> h >> w) {
int cost = INT_MAX;
for (int i = 0; i < h; ++i) {
int price, available; cin >> price;
for (... | 20.296296 | 49 | 0.518248 | axelgio01 |
68d3806ac1420f366b4dfb37aef4090f3fa913e4 | 7,453 | cc | C++ | src/args.cc | Preetam/couchnode | fffb892f2d28b96158711b71f41e85d6a1fe07ef | [
"Apache-2.0"
] | null | null | null | src/args.cc | Preetam/couchnode | fffb892f2d28b96158711b71f41e85d6a1fe07ef | [
"Apache-2.0"
] | null | null | null | src/args.cc | Preetam/couchnode | fffb892f2d28b96158711b71f41e85d6a1fe07ef | [
"Apache-2.0"
] | null | null | null | /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
#include "couchbase_impl.h"
#include <cstring>
#include <cstdio>
#include <cassert>
using namespace Couchnode;
using namespace std;
static bool get_string(const v8::Handle<v8::Value> &jv,
char **strp,
... | 21.540462 | 81 | 0.548906 | Preetam |
68e8110399ca4631458d22953031a7b0b79b9b46 | 477 | cpp | C++ | C++/Searching In C++/linearSearch.cpp | neontuts/code-snippets | cdc5d9e482a716015f3a43a4843d02521e1231f1 | [
"MIT"
] | null | null | null | C++/Searching In C++/linearSearch.cpp | neontuts/code-snippets | cdc5d9e482a716015f3a43a4843d02521e1231f1 | [
"MIT"
] | null | null | null | C++/Searching In C++/linearSearch.cpp | neontuts/code-snippets | cdc5d9e482a716015f3a43a4843d02521e1231f1 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int linearSearch(int arr[], int n, int key) {
for (int i=0; i<n; i++) {
if (arr[i] == key) {
return i;
}
}
return -1;
}
int main() {
int n, key;
cout<<"Enter the no of elements : ";
cin>>n;
int arr[n];
cout<<"Enter the elements one by one : ";
... | 14.454545 | 45 | 0.534591 | neontuts |
68ea92e754c317e76317fc8f7fb2d374d9654702 | 616 | cpp | C++ | Aulas Facul/DezPessoas.cpp | punkklan/Estudos_C | fbfa668a804aec406eb750451512ebd3b6b98a6a | [
"MIT"
] | null | null | null | Aulas Facul/DezPessoas.cpp | punkklan/Estudos_C | fbfa668a804aec406eb750451512ebd3b6b98a6a | [
"MIT"
] | null | null | null | Aulas Facul/DezPessoas.cpp | punkklan/Estudos_C | fbfa668a804aec406eb750451512ebd3b6b98a6a | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define TAM 3
typedef struct{
char nome[50];
char telefone[20]; //+xx xx xxxxx xxxx
} tipo_pessoa;
int main(){
tipo_pessoa lista[TAM];
for(int i=0; i<TAM; i++){
printf("Insira o nome da pessoa %d:\n", i+1);
gets(lista[i].nome);
fflush(stdin);
p... | 19.25 | 71 | 0.623377 | punkklan |
68f1973e38206e0f35f17deeb3be65c625f25fea | 2,436 | hpp | C++ | code/editors/xrWeatherEditor/property_collection_base.hpp | Rikoshet-234/xray-oxygen | eaac3fa4780639152684f3251b8b4452abb8e439 | [
"Apache-2.0"
] | 7 | 2018-03-27T12:36:07.000Z | 2020-06-26T11:31:52.000Z | code/editors/xrWeatherEditor/property_collection_base.hpp | Rikoshet-234/xray-oxygen | eaac3fa4780639152684f3251b8b4452abb8e439 | [
"Apache-2.0"
] | 2 | 2018-05-26T23:17:14.000Z | 2019-04-14T18:33:27.000Z | code/editors/xrWeatherEditor/property_collection_base.hpp | Rikoshet-234/xray-oxygen | eaac3fa4780639152684f3251b8b4452abb8e439 | [
"Apache-2.0"
] | 5 | 2020-10-18T11:55:26.000Z | 2022-03-28T07:21:35.000Z | ////////////////////////////////////////////////////////////////////////////
// Module : property_collection_base.hpp
// Created : 08.01.2008
// Modified : 08.01.2008
// Author : Dmitriy Iassenev
// Description : property collection base class
//////////////////////////////////////////////////////////////////////... | 30.074074 | 123 | 0.667488 | Rikoshet-234 |
68f3f2d9bb8d192621c74ef921378ea2e0937f3f | 27,001 | cc | C++ | xic/src/gtkxic/gtktedit.cc | wrcad/xictools | f46ba6d42801426739cc8b2940a809b74f1641e2 | [
"Apache-2.0"
] | 73 | 2017-10-26T12:40:24.000Z | 2022-03-02T16:59:43.000Z | xic/src/gtkxic/gtktedit.cc | chris-ayala/xictools | 4ea72c118679caed700dab3d49a8d36445acaec3 | [
"Apache-2.0"
] | 12 | 2017-11-01T10:18:22.000Z | 2022-03-20T19:35:36.000Z | xic/src/gtkxic/gtktedit.cc | chris-ayala/xictools | 4ea72c118679caed700dab3d49a8d36445acaec3 | [
"Apache-2.0"
] | 34 | 2017-10-06T17:04:21.000Z | 2022-02-18T16:22:03.000Z |
/*========================================================================*
* *
* Distributed by Whiteley Research Inc., Sunnyvale, California, USA *
* http://wrcad.com *
* Copyright (... | 33.963522 | 82 | 0.587089 | wrcad |
19022f35b45a28123de12af8470e88ac6a857647 | 2,581 | cpp | C++ | Number Theory/Discrete Root Faster.cpp | bazzyadb/all-code | cf3039641b5aa84b1c5b184a95d69bd4091974c9 | [
"MIT"
] | 1,639 | 2021-09-15T09:12:06.000Z | 2022-03-31T22:58:57.000Z | Number Theory/Discrete Root Faster.cpp | bazzyadb/all-code | cf3039641b5aa84b1c5b184a95d69bd4091974c9 | [
"MIT"
] | 16 | 2022-01-15T17:50:08.000Z | 2022-01-28T12:55:21.000Z | Number Theory/Discrete Root Faster.cpp | bazzyadb/all-code | cf3039641b5aa84b1c5b184a95d69bd4091974c9 | [
"MIT"
] | 444 | 2021-09-15T09:17:41.000Z | 2022-03-29T18:21:46.000Z | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll power(ll a, ll n, ll p) {
ll r = 1;
for (; n > 0; n >>= 1, a = a * a % p) if(n % 2 == 1) r = r * a % p;
return r;
}
int cnt(ll a, ll base,ll p) {
int ret = 0;
while (a != 1) {
a = power(a, base, p);
++ret;
}
retu... | 25.303922 | 93 | 0.420767 | bazzyadb |
1908584fb18acefa6a04eb225ad688e90ebcb2c7 | 558 | cpp | C++ | 15.cpp | s51517765/Competitive-programming-training | 798f6d6e09349858b0c619ad6d176d0533a87816 | [
"MIT"
] | null | null | null | 15.cpp | s51517765/Competitive-programming-training | 798f6d6e09349858b0c619ad6d176d0533a87816 | [
"MIT"
] | null | null | null | 15.cpp | s51517765/Competitive-programming-training | 798f6d6e09349858b0c619ad6d176d0533a87816 | [
"MIT"
] | null | null | null | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
// https://atcoder.jp/contests/abc063/tasks/abc063_b
// 200点
int main()
{
// i番目とj番目を比較するが、組み合わせだけ（順列ではない）を比較すればよいので、j<iとなる。
//また、iは0番は比較する相手がいないので1から
string s;
cin >> s;
for (int i = 1; i < s.length(... | 19.241379 | 55 | 0.446237 | s51517765 |
1914c6c0a7e40232b827b7416682bb48c8d80fa2 | 2,678 | cpp | C++ | src/AdventOfCode2021/Day08-SevenSegmentSearch/Day08-SevenSegmentSearch.cpp | dbartok/advent-of-code-cpp | c8c2df7a21980f8f3e42128f7bc5df8288f18490 | [
"MIT"
] | null | null | null | src/AdventOfCode2021/Day08-SevenSegmentSearch/Day08-SevenSegmentSearch.cpp | dbartok/advent-of-code-cpp | c8c2df7a21980f8f3e42128f7bc5df8288f18490 | [
"MIT"
] | null | null | null | src/AdventOfCode2021/Day08-SevenSegmentSearch/Day08-SevenSegmentSearch.cpp | dbartok/advent-of-code-cpp | c8c2df7a21980f8f3e42128f7bc5df8288f18490 | [
"MIT"
] | null | null | null | #include "Day08-SevenSegmentSearch.h"
#include "SignalDecoder.h"
#include <AdventOfCodeCommon/DisableLibraryWarningsMacros.h>
__BEGIN_LIBRARIES_DISABLE_WARNINGS
#include <boost/algorithm/string.hpp>
#include <numeric>
__END_LIBRARIES_DISABLE_WARNINGS
namespace AdventOfCode
{
namespace Year2021
{
namespace Day08
{
... | 33.898734 | 125 | 0.707991 | dbartok |
191a4599611b8415da540ec6d635ce2dc5982e8c | 5,771 | hpp | C++ | include/parse_files.hpp | dda119141/HevcConverterWrapper | bbf97f99f608fc17ac2f07b02d8e93a3f59a923d | [
"MIT"
] | null | null | null | include/parse_files.hpp | dda119141/HevcConverterWrapper | bbf97f99f608fc17ac2f07b02d8e93a3f59a923d | [
"MIT"
] | null | null | null | include/parse_files.hpp | dda119141/HevcConverterWrapper | bbf97f99f608fc17ac2f07b02d8e93a3f59a923d | [
"MIT"
] | null | null | null | #ifndef PARSE_VID_FILES
#define PARSE_VID_FILES
/*
* Maxime Moge dda119141@gmail.com 05.07.2021
*
*/
#include <iostream>
#include <future>
#include <string>
#include <experimental/filesystem>
#include <boost/process.hpp>
namespace hevc
{
std::string str_tolower(std::string s) {
std::transform(s.begin(... | 30.21466 | 115 | 0.551204 | dda119141 |
192044f33a01d937f60dbed8d126b120f3776249 | 1,570 | hpp | C++ | Source/System/Physics/Utility/RayCastUtility.hpp | arian153/Engine-5 | 34f85433bc0a74a7ebe7da350d3f3698de77226e | [
"MIT"
] | 2 | 2020-01-09T07:48:24.000Z | 2020-01-09T07:48:26.000Z | Source/System/Physics/Utility/RayCastUtility.hpp | arian153/Engine-5 | 34f85433bc0a74a7ebe7da350d3f3698de77226e | [
"MIT"
] | null | null | null | Source/System/Physics/Utility/RayCastUtility.hpp | arian153/Engine-5 | 34f85433bc0a74a7ebe7da350d3f3698de77226e | [
"MIT"
] | null | null | null | #pragma once
#include "../../Math/Algebra/Vector3.hpp"
#include "../../Math/Primitive/Others/Ray.hpp"
#include <vector>
namespace Engine5
{
class Primitive;
class PrimitiveHitData
{
public:
bool operator<(const PrimitiveHitData& rhs) const;
PrimitiveHitData& operator=(cons... | 28.545455 | 77 | 0.581529 | arian153 |
192142cba2eaf612f490ac7dafd3eb77bb424ee0 | 10,185 | cpp | C++ | server/Server/Player/GamePlayer.cpp | viticm/web-pap | 7c9b1f49d9ba8d8e40f8fddae829c2e414ccfeca | [
"BSD-3-Clause"
] | 3 | 2018-06-19T21:37:38.000Z | 2021-07-31T21:51:40.000Z | server/Server/Player/GamePlayer.cpp | viticm/web-pap | 7c9b1f49d9ba8d8e40f8fddae829c2e414ccfeca | [
"BSD-3-Clause"
] | null | null | null | server/Server/Player/GamePlayer.cpp | viticm/web-pap | 7c9b1f49d9ba8d8e40f8fddae829c2e414ccfeca | [
"BSD-3-Clause"
] | 13 | 2015-01-30T17:45:06.000Z | 2022-01-06T02:29:34.000Z | #include "stdafx.h"
#include "GamePlayer.h"
#include "PacketFactoryManager.h"
#include "PlayerPool.h"
#include "Obj_Human.h"
#include "SceneManager.h"
#include "GUIDManager.h"
#include "TimeManager.h"
#include "Log.h"
#include "WGRetUserData.h"
#include "ServerManager.h"
#include "GWNotifyUser.h"
#include "GWTeamLea... | 21.809422 | 131 | 0.620226 | viticm |
19269b31e98953f8bf513179ba127e4abf168fa1 | 210 | cpp | C++ | 2021.09.19-Homework1-Corrected/Problem4/Source.cpp | TrofimovaMarina/homework | 4c9a495b641eff8bf0e5a241237ffc7aa73cc65f | [
"Apache-2.0"
] | null | null | null | 2021.09.19-Homework1-Corrected/Problem4/Source.cpp | TrofimovaMarina/homework | 4c9a495b641eff8bf0e5a241237ffc7aa73cc65f | [
"Apache-2.0"
] | null | null | null | 2021.09.19-Homework1-Corrected/Problem4/Source.cpp | TrofimovaMarina/homework | 4c9a495b641eff8bf0e5a241237ffc7aa73cc65f | [
"Apache-2.0"
] | null | null | null | #include <iostream>
using namespace std;
int main(int argc, char* argv[])
{
int v = 0;
int t = 0;
const int L = 109;
cin >> v;
cin >> t;
cout << (L + v * t % L) % L << endl;
return EXIT_SUCCESS;
} | 12.352941 | 37 | 0.547619 | TrofimovaMarina |
1935be3c8aee0f7f163086c2d089b1e0c2f4b94f | 440 | hpp | C++ | NWNXLib/API/API/CSpell_Add.hpp | summonFox/unified | 47ab7d051fe52c26e2928b569e9fe7aec5aa8705 | [
"MIT"
] | 111 | 2018-01-16T18:49:19.000Z | 2022-03-13T12:33:54.000Z | NWNXLib/API/API/CSpell_Add.hpp | summonFox/unified | 47ab7d051fe52c26e2928b569e9fe7aec5aa8705 | [
"MIT"
] | 636 | 2018-01-17T10:05:31.000Z | 2022-03-28T20:06:03.000Z | NWNXLib/API/API/CSpell_Add.hpp | summonFox/unified | 47ab7d051fe52c26e2928b569e9fe7aec5aa8705 | [
"MIT"
] | 110 | 2018-01-16T19:05:54.000Z | 2022-03-28T03:44:16.000Z | #pragma once
#include "nwn_api.hpp"
#ifdef NWN_API_PROLOGUE
NWN_API_PROLOGUE(CSpell_Add)
#endif
typedef int BOOL;
struct CSpell_Add
{
uint32_t m_nSpellID;
BOOL m_bReadied;
BOOL m_bDomainSpell;
uint8_t m_nMetaType;
uint8_t m_nSpellSlot;
uint8_t m_nSpellLevel;
#ifdef NWN_CLASS_EXTENSION... | 12.222222 | 37 | 0.768182 | summonFox |
193a1460b646cc1bf7c74b8aa3632675b5182d2b | 23,079 | cpp | C++ | src/emitter/emitter.cpp | bfeip/Lain | 3df115167dbb0eb8147b225a24bb72b6c0920c64 | [
"MIT"
] | 5 | 2017-03-28T00:36:54.000Z | 2019-08-06T00:05:44.000Z | src/emitter/emitter.cpp | bfeip/Lain | 3df115167dbb0eb8147b225a24bb72b6c0920c64 | [
"MIT"
] | 4 | 2017-03-28T01:36:05.000Z | 2017-04-17T20:34:46.000Z | src/emitter/emitter.cpp | bfeip/Lain | 3df115167dbb0eb8147b225a24bb72b6c0920c64 | [
"MIT"
] | null | null | null | #include "emitter.hpp"
void Emitter::emitTop() {
// emit TypeDecls first
/* I'm not sure how LLVM goes about type decls and dependencies, so we
* may eventually end up doing all the declarations first and the
* definitions later. If I end up choosing to do that this is where
* I'll insert a emitDecls cal... | 32.188285 | 99 | 0.67204 | bfeip |
193bf11ed7e1e5c52f9b63ac1bf93287dd7fe875 | 452 | cc | C++ | BOJ/1681.cc | Yaminyam/Algorithm | fe49b37b4b310f03273864bcd193fe88139f1c01 | [
"MIT"
] | 1 | 2019-05-18T00:02:12.000Z | 2019-05-18T00:02:12.000Z | BOJ/1681.cc | siontama/Algorithm | bb419e0d4dd09682bd4542f90038b492ee232bd2 | [
"MIT"
] | null | null | null | BOJ/1681.cc | siontama/Algorithm | bb419e0d4dd09682bd4542f90038b492ee232bd2 | [
"MIT"
] | null | null | null | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
#include<string>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
const int INF = numeric_limits<int>::max();
int main()
{
int n, l;
cin >> n >> l;
int cnt = 0;
int i = 1;
while (cnt < n) {
int temp = i;
bool... | 13.69697 | 43 | 0.595133 | Yaminyam |
193e4079cbcb1b07cf30417ae9db578048585698 | 52 | cpp | C++ | examples/SPIRV-Tools/boo.cpp | Costallat/hunter | dc0d79cb37b30cad6d6472d7143fe27be67e26d5 | [
"BSD-2-Clause"
] | 440 | 2019-08-25T13:07:04.000Z | 2022-03-30T21:57:15.000Z | examples/SPIRV-Tools/boo.cpp | koinos/hunter | fc17bc391210bf139c55df7f947670c5dff59c57 | [
"BSD-2-Clause"
] | 401 | 2019-08-29T08:56:55.000Z | 2022-03-30T12:39:34.000Z | examples/SPIRV-Tools/boo.cpp | koinos/hunter | fc17bc391210bf139c55df7f947670c5dff59c57 | [
"BSD-2-Clause"
] | 162 | 2019-09-02T13:31:36.000Z | 2022-03-30T09:16:54.000Z | #include <spirv-tools/libspirv.hpp>
int main() {
}
| 10.4 | 35 | 0.673077 | Costallat |
194015535dfc3f704c4593f8d0641d60153eb6f3 | 1,662 | cpp | C++ | Playing With Strings/Solutions/red_maple/G/main.cpp | em3ly/axon_training | fe4a8cee81034f140650b6c21f723d339ea02c00 | [
"MIT"
] | null | null | null | Playing With Strings/Solutions/red_maple/G/main.cpp | em3ly/axon_training | fe4a8cee81034f140650b6c21f723d339ea02c00 | [
"MIT"
] | 5 | 2019-04-30T22:31:36.000Z | 2019-05-07T00:15:23.000Z | Playing With Strings/Solutions/red_maple/G/main.cpp | em3ly/axon_training | fe4a8cee81034f140650b6c21f723d339ea02c00 | [
"MIT"
] | 5 | 2019-05-01T05:08:43.000Z | 2019-05-07T18:13:18.000Z | /*
Date 05/28/2019
Brenda E Ramirez.
*/
#include <bits/stdc++.h>
#include <limits.h>
#include <algorithm>
#include <numeric>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define endl '\n'
usi... | 16.959184 | 81 | 0.501203 | em3ly |
19459049298f4661a6aa7f77eb5f7708f2a34048 | 10,410 | hpp | C++ | include/jbson/json_writer.hpp | chrismanning/jbson | 2e5ca71f3300d9d5d7e59e64f2d9ece32d96716f | [
"BSL-1.0"
] | 37 | 2015-02-02T16:39:00.000Z | 2022-01-25T15:45:08.000Z | include/jbson/json_writer.hpp | chrismanning/jbson | 2e5ca71f3300d9d5d7e59e64f2d9ece32d96716f | [
"BSL-1.0"
] | null | null | null | include/jbson/json_writer.hpp | chrismanning/jbson | 2e5ca71f3300d9d5d7e59e64f2d9ece32d96716f | [
"BSL-1.0"
] | 6 | 2015-06-22T11:40:22.000Z | 2022-01-25T15:45:12.000Z | // Copyright Christian Manning 2013.
// 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)
#ifndef JBSON_JSON_WRITER_HPP
#define JBSON_JSON_WRITER_HPP
#include <string>
#include <iterator>
#inclu... | 36.784452 | 120 | 0.626609 | chrismanning |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.