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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
56b91d45dbdfd02fd487741b65335e63a472c14f | 6,037 | cpp | C++ | src/services/pcn-loadbalancer-dsr/src/Lbdsr.cpp | mbertrone/polycube | b35a6aa13273c000237d53c5f1bf286f12e4b9bd | [
"ECL-2.0",
"Apache-2.0"
] | 1 | 2020-07-16T04:49:29.000Z | 2020-07-16T04:49:29.000Z | src/services/pcn-loadbalancer-dsr/src/Lbdsr.cpp | mbertrone/polycube | b35a6aa13273c000237d53c5f1bf286f12e4b9bd | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | src/services/pcn-loadbalancer-dsr/src/Lbdsr.cpp | mbertrone/polycube | b35a6aa13273c000237d53c5f1bf286f12e4b9bd | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | /*
* Copyright 2018 The Polycube Authors
*
* 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 agree... | 24.051793 | 80 | 0.668213 | mbertrone |
56b965b3e243736ab572f99f4a6f770de1b24a7d | 2,621 | hpp | C++ | src/Utils.hpp | emathew1/MPI_3DCompact | 1945eabdc240e8754c9ea356ba954683dee0149f | [
"MIT"
] | 2 | 2021-01-14T21:13:53.000Z | 2022-01-16T23:03:43.000Z | src/Utils.hpp | emathew1/MPI_3DCompact | 1945eabdc240e8754c9ea356ba954683dee0149f | [
"MIT"
] | null | null | null | src/Utils.hpp | emathew1/MPI_3DCompact | 1945eabdc240e8754c9ea356ba954683dee0149f | [
"MIT"
] | 3 | 2018-11-17T21:24:57.000Z | 2020-08-02T03:19:42.000Z | #ifndef _UTILSH_
#define _UTILSH_
#include <math.h>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include "Macros.hpp"
#include "Domain.hpp"
using namespace std;
//Tri/Pentadiagonal Matrix solver stuff
void solveTri(double a[], double b[], double c[], double d[], double x[], double *w... | 45.982456 | 147 | 0.723006 | emathew1 |
56bcf75af97891a80509ea44c28888c31bd72877 | 478 | cpp | C++ | Source/sample_hello_sbwin.cpp | kumaashi/SBWIN | 6ae3e58ea4751a5878a5adf9820ce6bf473aa3bd | [
"MIT"
] | 1 | 2021-04-25T20:19:17.000Z | 2021-04-25T20:19:17.000Z | Source/sample_hello_sbwin.cpp | kumaashi/SBWIN | 6ae3e58ea4751a5878a5adf9820ce6bf473aa3bd | [
"MIT"
] | null | null | null | Source/sample_hello_sbwin.cpp | kumaashi/SBWIN | 6ae3e58ea4751a5878a5adf9820ce6bf473aa3bd | [
"MIT"
] | null | null | null | #include "sbwin.h"
void
update_audio(sb::Audio & audio)
{
//nothing to do.
}
void
update_frame(sb::Image &img, sb::Keys & keys)
{
static int frame_count = 0;
printf("frame_count=%d\n", frame_count);
for (int y = 0 ; y < img.GetHeight(); y++) {
for (int x = 0 ; x < img.GetWidth(); x++) {
img.SetPixel(x, y, r... | 15.933333 | 46 | 0.606695 | kumaashi |
56c1a0f42fbcb004e493529e4e1479200dc6c8f1 | 844 | cpp | C++ | terry2018/xray.cpp | malorubiuz/tutorato_olimpiadi2021 | 86736147af5f47da5cc3276bd9a894977bdee073 | [
"Unlicense"
] | null | null | null | terry2018/xray.cpp | malorubiuz/tutorato_olimpiadi2021 | 86736147af5f47da5cc3276bd9a894977bdee073 | [
"Unlicense"
] | null | null | null | terry2018/xray.cpp | malorubiuz/tutorato_olimpiadi2021 | 86736147af5f47da5cc3276bd9a894977bdee073 | [
"Unlicense"
] | null | null | null | #include <algorithm>
#include <iostream>
#include <vector>
int solve_rec (int* first, int* last)
{
if (first == last) {
return 0;
} else {
auto min_pos = std::min_element (first, last);
int min_value = *min_pos;
int answer = 0;
for (auto it = first; it != last; ++it)
*it -= min_value;
... | 19.627907 | 70 | 0.541469 | malorubiuz |
08c9540fbc38e50898539e8873c9aeae98198338 | 45 | cpp | C++ | core/src/task/Task.cpp | ExaBerries/spruce | 85845244f7d6cd5a662f0dbc9b4079a1230d9a4b | [
"MIT"
] | null | null | null | core/src/task/Task.cpp | ExaBerries/spruce | 85845244f7d6cd5a662f0dbc9b4079a1230d9a4b | [
"MIT"
] | null | null | null | core/src/task/Task.cpp | ExaBerries/spruce | 85845244f7d6cd5a662f0dbc9b4079a1230d9a4b | [
"MIT"
] | null | null | null | #include <task/Task.h>
namespace spruce {
}
| 9 | 22 | 0.688889 | ExaBerries |
08c9be17ceee46d1a0b88002d414947c77a36cce | 1,785 | cpp | C++ | 1053.cpp | AIpynux/PAT | 5f93ddf4ef15b42264fe1c312863a4444efe13b2 | [
"MIT"
] | 2 | 2017-04-26T09:22:24.000Z | 2017-04-26T09:22:27.000Z | 1053.cpp | hgneer/PAT | 8a8cda9fe28108142de8c0d8b9b9105f27754621 | [
"MIT"
] | null | null | null | 1053.cpp | hgneer/PAT | 8a8cda9fe28108142de8c0d8b9b9105f27754621 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
const int MAX = 10014;
using namespace std;
int number,nonleaf,neededweight;
struct{
int weight;
vector<int> child;
}node[MAX];
int num = 0;
vector<int> track[MAX];
vector<int> nowtrack;
... | 9.807692 | 58 | 0.565266 | AIpynux |
08d61c9e134ec447900bd85725337c86ba660fc7 | 1,099 | cpp | C++ | LGP3378_by_hand.cpp | Origami404/OI_Code | 9638ec6fa409dc8e243eaef9aa287c20c332bbe5 | [
"MIT"
] | null | null | null | LGP3378_by_hand.cpp | Origami404/OI_Code | 9638ec6fa409dc8e243eaef9aa287c20c332bbe5 | [
"MIT"
] | null | null | null | LGP3378_by_hand.cpp | Origami404/OI_Code | 9638ec6fa409dc8e243eaef9aa287c20c332bbe5 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <algorithm>
#define MAXN 1000000 + 7
using namespace std;
int tree[MAXN];
int last = 1;
inline int top(){
return tree[1];
}
inline void push(int v){
tree[last] = v;
int now = last++;
while (now != 1){
if (tree[now] < tree[now>>1])
swap(tree[now], tree[now>>1]);
... | 21.54902 | 67 | 0.478617 | Origami404 |
08d8e322318f16485ff8500852f75c7f17763edd | 10,886 | cpp | C++ | VulkanDrv/VulkanSwapChain.cpp | stijn-volckaert/UT99VulkanDrv | 37d0751ce6474ca62465895579529eebc0c4a2dc | [
"Apache-2.0"
] | 50 | 2020-12-02T17:41:17.000Z | 2022-03-18T05:08:21.000Z | VulkanDrv/VulkanSwapChain.cpp | stijn-volckaert/UT99VulkanDrv | 37d0751ce6474ca62465895579529eebc0c4a2dc | [
"Apache-2.0"
] | 11 | 2021-07-14T13:41:12.000Z | 2021-09-30T10:32:58.000Z | VulkanDrv/VulkanSwapChain.cpp | stijn-volckaert/UT99VulkanDrv | 37d0751ce6474ca62465895579529eebc0c4a2dc | [
"Apache-2.0"
] | 4 | 2021-07-20T20:22:36.000Z | 2022-01-06T15:30:26.000Z |
#include "Precomp.h"
#include "VulkanSwapChain.h"
#include "VulkanObjects.h"
VulkanSwapChain::VulkanSwapChain(VulkanDevice *device, bool vsync) : vsync(vsync), device(device)
{
}
VulkanSwapChain::~VulkanSwapChain()
{
releaseResources();
}
uint32_t VulkanSwapChain::acquireImage(int width, int height, VulkanSemaphor... | 33.495385 | 187 | 0.779441 | stijn-volckaert |
08d926e920d9d0a6234811c439f3826aeafe89b0 | 1,759 | cpp | C++ | runtime/memory/List.cpp | rschleitzer/scaly | 7537cdf44f7a63ad1a560975017ee1c897c73787 | [
"MIT"
] | null | null | null | runtime/memory/List.cpp | rschleitzer/scaly | 7537cdf44f7a63ad1a560975017ee1c897c73787 | [
"MIT"
] | null | null | null | runtime/memory/List.cpp | rschleitzer/scaly | 7537cdf44f7a63ad1a560975017ee1c897c73787 | [
"MIT"
] | null | null | null | namespace scaly::containers {
using namespace scaly::memory;
template<class T> struct List;
template<class T> struct Node : Object {
T element;
Node<T>* next;
};
template<class T> struct ListIterator {
Node<T>* current;
static ListIterator<T> create(Node<T>* head) {
return ListIterator { .c... | 22.551282 | 53 | 0.494599 | rschleitzer |
08da68949e8d13424a2d7559651fc2d00d2276c0 | 215 | cpp | C++ | sourcefile/9-4.cpp | soh9646/soh9646.github.io | f820ce25d8945b7d23a18c52c1904b75e9e5b9ef | [
"MIT"
] | null | null | null | sourcefile/9-4.cpp | soh9646/soh9646.github.io | f820ce25d8945b7d23a18c52c1904b75e9e5b9ef | [
"MIT"
] | null | null | null | sourcefile/9-4.cpp | soh9646/soh9646.github.io | f820ce25d8945b7d23a18c52c1904b75e9e5b9ef | [
"MIT"
] | null | null | null | #include <stdio.h>
main()
{
int i = 3, j = 5;
int *ip, *jp;
ip = &i;
jp = &j;
*ip += 5;
*jp = *ip - *jp;
jp = ip;
*ip *= *jp;
printf("i = %d, j = %d\n", i, j);
printf("*ip = %d, *jp = %d \n", *ip, *jp);
}
| 14.333333 | 43 | 0.390698 | soh9646 |
08ddeea6215cf5de51ff2e5a022f897aeeb3b330 | 11,156 | cpp | C++ | external/parallelstl/test/std/algorithms/alg.sorting/alg.heap.operations/is_heap.pass.cpp | ZabalaMariano/PISA | 344063799847e89f2f4bd7d75d606ccb95620d30 | [
"Apache-2.0"
] | null | null | null | external/parallelstl/test/std/algorithms/alg.sorting/alg.heap.operations/is_heap.pass.cpp | ZabalaMariano/PISA | 344063799847e89f2f4bd7d75d606ccb95620d30 | [
"Apache-2.0"
] | null | null | null | external/parallelstl/test/std/algorithms/alg.sorting/alg.heap.operations/is_heap.pass.cpp | ZabalaMariano/PISA | 344063799847e89f2f4bd7d75d606ccb95620d30 | [
"Apache-2.0"
] | 1 | 2021-02-27T11:46:50.000Z | 2021-02-27T11:46:50.000Z | // -*- C++ -*-
//===-- is_heap.pass.cpp --------------------------------------------------===//
//
// Copyright (C) 2017-2019 Intel Corporation
//
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
// This file incorporates work covered by the following copyright and permission
// notice:
//
// Part of the L... | 42.418251 | 125 | 0.689763 | ZabalaMariano |
08efeb15085130129f385fe3cd4ae2bba94c50bf | 6,259 | cpp | C++ | Source/Api/Vulkan/GraphicsPipeline.cpp | Filippo-BSW/AdHoc | 2559fa6f563283af24ae1da26b4b9164c8206503 | [
"MIT"
] | null | null | null | Source/Api/Vulkan/GraphicsPipeline.cpp | Filippo-BSW/AdHoc | 2559fa6f563283af24ae1da26b4b9164c8206503 | [
"MIT"
] | null | null | null | Source/Api/Vulkan/GraphicsPipeline.cpp | Filippo-BSW/AdHoc | 2559fa6f563283af24ae1da26b4b9164c8206503 | [
"MIT"
] | null | null | null | // *********************************************************************************
// MIT License
//
// Copyright (c) 2021 Filippo-BSW
//
// 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 ... | 40.908497 | 156 | 0.623902 | Filippo-BSW |
08f2e5fb27c22bf625cabd3e2153aa8d003b96a1 | 1,252 | hpp | C++ | slope/slope/collision/gjk.hpp | muleax/slope | 254138703163705b57332fc7490dd2eea0082b57 | [
"MIT"
] | 6 | 2022-02-05T23:28:12.000Z | 2022-02-24T11:08:04.000Z | slope/slope/collision/gjk.hpp | muleax/slope | 254138703163705b57332fc7490dd2eea0082b57 | [
"MIT"
] | null | null | null | slope/slope/collision/gjk.hpp | muleax/slope | 254138703163705b57332fc7490dd2eea0082b57 | [
"MIT"
] | null | null | null | #pragma once
#include "slope/collision/shape/collision_shape.hpp"
#include "slope/core/array.hpp"
#include "slope/core/config_holder.hpp"
#include <optional>
namespace slope {
struct GJKConfig {
uint32_t max_iteration_count = 30;
};
struct GJKStats {
uint64_t total_fail_count = 0;
uint64_t cum_test_count... | 26.083333 | 90 | 0.650958 | muleax |
08f49fd0df6c37ed23c162543d6ddc56d252fe7d | 498 | cpp | C++ | cifrario_di_cesare/main.cpp | APf0x/not-payed-job | 5124d73b7e0370a9445d62573ae4d42070bf3765 | [
"MIT"
] | null | null | null | cifrario_di_cesare/main.cpp | APf0x/not-payed-job | 5124d73b7e0370a9445d62573ae4d42070bf3765 | [
"MIT"
] | null | null | null | cifrario_di_cesare/main.cpp | APf0x/not-payed-job | 5124d73b7e0370a9445d62573ae4d42070bf3765 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string.h>
#include "conversione.h"
using namespace std;
typedef struct{
string cesare;
}ces;
int conversione(ces *ok, int x){
for(int i = 0; i<ok->cesare.length(); i++){
if(ok->cesare[i] == 'z'){
ok->cesare[i] = ok->cesare[i]-23+x;
}else{
o... | 19.153846 | 47 | 0.522088 | APf0x |
08f69584089d0e8414ab5979c0af8ba1d681a491 | 524 | hpp | C++ | engine/src/ui/Rectangle.hpp | Birdy2014/Birdy3d | 96421f262ab6ba7448cae8381063aab32ac830fe | [
"MIT"
] | 1 | 2021-11-01T20:22:41.000Z | 2021-11-01T20:22:41.000Z | engine/src/ui/Rectangle.hpp | Birdy2014/Birdy3d | 96421f262ab6ba7448cae8381063aab32ac830fe | [
"MIT"
] | 1 | 2021-11-02T12:45:20.000Z | 2021-11-02T12:45:20.000Z | engine/src/ui/Rectangle.hpp | Birdy2014/Birdy3d | 96421f262ab6ba7448cae8381063aab32ac830fe | [
"MIT"
] | 1 | 2021-11-02T12:28:58.000Z | 2021-11-02T12:28:58.000Z | #pragma once
#include "ui/Shape.hpp"
#include <glad/glad.h>
#include <glm/glm.hpp>
namespace Birdy3d::ui {
class Rectangle : public Shape {
public:
Rectangle(UIVector pos, UIVector size, utils::Color::Name color = utils::Color::Name::WHITE, Type type = FILLED, Placement placement = Placement::TOP_LEF... | 23.818182 | 164 | 0.64313 | Birdy2014 |
08fe6d0bcd99ad07f582c4aeb2474d71e104904e | 396 | cpp | C++ | 0000/60/61a.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | 1 | 2020-07-03T15:55:52.000Z | 2020-07-03T15:55:52.000Z | 0000/60/61a.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | null | null | null | 0000/60/61a.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | 3 | 2020-10-01T14:55:28.000Z | 2021-07-11T11:33:58.000Z | #include <iostream>
#include <string>
void answer(const std::string& v)
{
std::cout << v << '\n';
}
std::string& solve(std::string& n1, const std::string& n2)
{
const size_t n = n1.length();
for (size_t i = 0; i < n; ++i)
n1[i] = '0' + (n1[i] ^ n2[i]);
answer(n1);
}
int main()
{
std::str... | 14.142857 | 58 | 0.507576 | actium |
08ff297e057053b8974a1031bbcb4ed1e53efc6a | 132 | cpp | C++ | Source/MasterServer/User.cpp | igorsegallafa/UrhoMMO | fd389d9722f32b0dc90dff746138213471503820 | [
"MIT"
] | 8 | 2020-02-06T13:14:13.000Z | 2020-11-03T06:26:04.000Z | Source/LoginServer/User.cpp | igorsegallafa/UrhoMMO | fd389d9722f32b0dc90dff746138213471503820 | [
"MIT"
] | null | null | null | Source/LoginServer/User.cpp | igorsegallafa/UrhoMMO | fd389d9722f32b0dc90dff746138213471503820 | [
"MIT"
] | 6 | 2019-06-19T00:24:16.000Z | 2020-12-08T05:03:59.000Z | #include "PrecompiledHeader.h"
#include "User.h"
User::User( Context* context ) :
Core::User( context )
{
}
User::~User()
{
} | 11 | 32 | 0.621212 | igorsegallafa |
1c0a7ad03453d0dfc5c12a328b38e8a64feb6ec5 | 6,778 | cpp | C++ | i2p1/src/final2_2_TA.cpp | stevenokm/i2p-nthu-math | b2e409b818e3326b6d9b239344382b569ccc67ac | [
"MIT"
] | null | null | null | i2p1/src/final2_2_TA.cpp | stevenokm/i2p-nthu-math | b2e409b818e3326b6d9b239344382b569ccc67ac | [
"MIT"
] | 7 | 2021-12-30T08:51:25.000Z | 2022-01-19T02:26:49.000Z | i2p1/src/final2_2_TA.cpp | stevenokm/i2p-nthu-math | b2e409b818e3326b6d9b239344382b569ccc67ac | [
"MIT"
] | 17 | 2021-09-23T07:54:26.000Z | 2022-01-11T11:58:48.000Z | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef struct Point_t
{
double x;
double y;
} Point;
typedef struct Triangle_t
{
Point p[3];
} Triangle;
typedef struct Circle_t
{
Point p[2];
} Circle;
typedef struct Rectangle_t
{
Point p[2];
} Rect... | 22.976271 | 78 | 0.560932 | stevenokm |
1c0cfb1454833f4fba72b3994d473fefd53ad100 | 2,287 | cpp | C++ | Project2D/Spring.cpp | geronimoj/PhysicsTutorial | f31ebda015e43850bd3d5a02f79ab5f4596fbfda | [
"MIT"
] | null | null | null | Project2D/Spring.cpp | geronimoj/PhysicsTutorial | f31ebda015e43850bd3d5a02f79ab5f4596fbfda | [
"MIT"
] | null | null | null | Project2D/Spring.cpp | geronimoj/PhysicsTutorial | f31ebda015e43850bd3d5a02f79ab5f4596fbfda | [
"MIT"
] | null | null | null | #include <Gizmos.h>
#include "Spring.h"
Spring::Spring(Rigidbody* body1, Rigidbody* body2, float restLength, glm::vec4 colour, float springCoefficient, float damping, glm::vec2 body1Contact, glm::vec2 body2Contact)
: PhysicsObject(ShapeType::SPRING, 0, 0, 0, 0), m_body1(body1), m_body2(body2), m_contact1(body1Contac... | 43.980769 | 226 | 0.732401 | geronimoj |
1c1322af4d983f655c5084b60f2d806046b39677 | 1,832 | cpp | C++ | gpu/api/api_object_helper.cpp | aconstlink/snakeoil | 3c6e02655e1134f8422f01073090efdde80fc109 | [
"MIT"
] | 1 | 2017-08-11T19:12:24.000Z | 2017-08-11T19:12:24.000Z | gpu/api/api_object_helper.cpp | aconstlink/snakeoil | 3c6e02655e1134f8422f01073090efdde80fc109 | [
"MIT"
] | 11 | 2018-07-07T20:09:44.000Z | 2020-02-16T22:45:09.000Z | gpu/api/api_object_helper.cpp | aconstlink/snakeoil | 3c6e02655e1134f8422f01073090efdde80fc109 | [
"MIT"
] | null | null | null | //------------------------------------------------------------
// snakeoil (c) Alexis Constantin Link
// Distributed under the MIT license
//------------------------------------------------------------
#include "api_object_helper.h"
#include "../object.h"
using namespace so_gpu ;
//***********************************... | 39.826087 | 109 | 0.449236 | aconstlink |
1c15896b3023d2f49416f059dfbb5dc364167393 | 3,065 | hpp | C++ | include/FakeInput/types.hpp | perara-libs/FakeInput | 13d7b260634c33ced95d9e3b37780705e4036ab5 | [
"MIT"
] | 40 | 2016-11-18T06:14:47.000Z | 2022-03-16T14:36:21.000Z | include/FakeInput/types.hpp | perara-libs/FakeInput | 13d7b260634c33ced95d9e3b37780705e4036ab5 | [
"MIT"
] | null | null | null | include/FakeInput/types.hpp | perara-libs/FakeInput | 13d7b260634c33ced95d9e3b37780705e4036ab5 | [
"MIT"
] | 9 | 2017-01-23T01:49:41.000Z | 2020-11-05T13:09:56.000Z | /**
* This file is part of the FakeInput library (https://github.com/uiii/FakeInput)
*
* Copyright (C) 2011 by Richard Jedlicka <uiii.dev@gmail.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* ... | 28.119266 | 81 | 0.644698 | perara-libs |
1c1944d306176565a3549cbebe2d388c7b02fbde | 272 | cpp | C++ | Lesson - 10/1.cpp | Futsy/Codility | 96b12dfe5d422a45d9decf9e9721b6cc0d0db6a9 | [
"MIT"
] | null | null | null | Lesson - 10/1.cpp | Futsy/Codility | 96b12dfe5d422a45d9decf9e9721b6cc0d0db6a9 | [
"MIT"
] | null | null | null | Lesson - 10/1.cpp | Futsy/Codility | 96b12dfe5d422a45d9decf9e9721b6cc0d0db6a9 | [
"MIT"
] | null | null | null | #include <cmath>
int factors(int number) {
int result = 0;
long i = 1;
while (i * i < number) {
if (number % i == 0) {
result += 2;
}
i++;
}
if (i * i == number)
result++;
return result;
}
int solution(int N) {
return factors(N);
} | 14.315789 | 27 | 0.496324 | Futsy |
1c1d0594c71dad8648b82009237c5c1afa4cf677 | 2,102 | hh | C++ | neb/inc/com/centreon/engine/configuration/applier/serviceescalation.hh | centreon-lab/centreon-broker | b412470204eedc01422bbfd00bcc306dfb3d2ef5 | [
"Apache-2.0"
] | 40 | 2015-03-10T07:55:39.000Z | 2021-06-11T10:13:56.000Z | neb/inc/com/centreon/engine/configuration/applier/serviceescalation.hh | centreon-lab/centreon-broker | b412470204eedc01422bbfd00bcc306dfb3d2ef5 | [
"Apache-2.0"
] | 297 | 2015-04-30T10:02:04.000Z | 2022-03-09T13:31:54.000Z | neb/inc/com/centreon/engine/configuration/applier/serviceescalation.hh | centreon-lab/centreon-broker | b412470204eedc01422bbfd00bcc306dfb3d2ef5 | [
"Apache-2.0"
] | 29 | 2015-08-03T10:04:15.000Z | 2021-11-25T12:21:00.000Z | /*
** Copyright 2011-2013,2017 Centreon
**
** This file is part of Centreon Engine.
**
** Centreon Engine is free software: you can redistribute it and/or
** modify it under the terms of the GNU General Public License version 2
** as published by the Free Software Foundation.
**
** Centreon Engine is distributed in the... | 32.338462 | 72 | 0.745005 | centreon-lab |
1c20325be52d37193130e2dcb8c740160f886c98 | 1,720 | cpp | C++ | experiment/MPI_Gang.cpp | browngrg/caledonia | 79c3bfc3fb40383719b1c2b39f1b485e7e8bdd94 | [
"BSD-3-Clause"
] | null | null | null | experiment/MPI_Gang.cpp | browngrg/caledonia | 79c3bfc3fb40383719b1c2b39f1b485e7e8bdd94 | [
"BSD-3-Clause"
] | null | null | null | experiment/MPI_Gang.cpp | browngrg/caledonia | 79c3bfc3fb40383719b1c2b39f1b485e7e8bdd94 | [
"BSD-3-Clause"
] | null | null | null |
#include"MPI_Gang.hpp"
#include<iostream>
void test1(const MPI_Struct& pool)
{
MPI_Gang mp;
mp.init(5,pool); // split processes into 5 gangs
if(mp.pool.iproc==0) std::cout << "init successful" << std::endl;
int ival = 0;
for(int i=0; i<5; i++) ival += i*mp.gang.nproc; // 10*mp.nproc_gang == ... | 28.196721 | 127 | 0.590698 | browngrg |
1c21277266234c33dfbcc406b6770b34709d2939 | 575 | hpp | C++ | include/MemeEngine/LuaScript.hpp | Gurman8r/CppSandbox | a0f1cf0ade69ecaba4d167c0611a620914155e53 | [
"MIT"
] | null | null | null | include/MemeEngine/LuaScript.hpp | Gurman8r/CppSandbox | a0f1cf0ade69ecaba4d167c0611a620914155e53 | [
"MIT"
] | null | null | null | include/MemeEngine/LuaScript.hpp | Gurman8r/CppSandbox | a0f1cf0ade69ecaba4d167c0611a620914155e53 | [
"MIT"
] | null | null | null | #ifndef _ML_LUA_SCRIPT_HPP_
#define _ML_LUA_SCRIPT_HPP_
#include <MemeEngine/Export.hpp>
#include <MemeCore/File.hpp>
namespace ml
{
/* * * * * * * * * * * * * * * * * * * * */
class ML_ENGINE_API LuaScript final
: public ITrackable
, public IDisposable
, public IReadable
{
public:
LuaScript();
LuaScri... | 16.911765 | 54 | 0.617391 | Gurman8r |
1c2bc95acd64faea4d30587acbbaa2c428e7c2d4 | 2,383 | cpp | C++ | src/tw_collectable.cpp | traveling-will-gba/traveling-will | 2042379207f99e4e15614cd692cf814210a36c98 | [
"MIT"
] | 1 | 2018-12-04T20:15:49.000Z | 2018-12-04T20:15:49.000Z | src/tw_collectable.cpp | traveling-will-gba/traveling-will | 2042379207f99e4e15614cd692cf814210a36c98 | [
"MIT"
] | 40 | 2016-04-30T13:41:05.000Z | 2016-07-11T22:06:31.000Z | src/tw_collectable.cpp | traveling-will-gba/traveling-will | 2042379207f99e4e15614cd692cf814210a36c98 | [
"MIT"
] | 4 | 2016-10-26T19:56:16.000Z | 2017-04-07T20:45:26.000Z | #include "tw_collectable.h"
#include "tw_platform.h"
TWCollectable::TWCollectable(){
}
TWCollectable::TWCollectable(std::string current_level, double ch){
m_sprite_speed = 1/170.0;
m_sprite_counter = 0;
m_start = -1;
m_height = m_width = 30;
m_y = 480 - ch;
m_texture = resources::get_texture... | 27.709302 | 126 | 0.684012 | traveling-will-gba |
1c3ee6862fe23a582f0ca0cffef7f77a0e34fc30 | 7,572 | cc | C++ | examples/Reduction.cc | edoars/latticetester | 980179abe2da78b8a13d2b912d2215b97509c528 | [
"Apache-2.0"
] | null | null | null | examples/Reduction.cc | edoars/latticetester | 980179abe2da78b8a13d2b912d2215b97509c528 | [
"Apache-2.0"
] | 2 | 2018-07-27T15:41:06.000Z | 2019-06-05T17:41:14.000Z | examples/Reduction.cc | edoars/latticetester | 980179abe2da78b8a13d2b912d2215b97509c528 | [
"Apache-2.0"
] | 1 | 2021-03-24T01:11:53.000Z | 2021-03-24T01:11:53.000Z | /**
* This is an example to the usage of the reducer class to perform reduction
* of lattices. This serves as a comparison between the different reduction
* methods when used before searching for the shortest vector. The output is
* formated to include the number of clock ticks spent on each algorithm as well
* as... | 38.050251 | 117 | 0.609746 | edoars |
1c4169f0d6f41f532a767932ca7142f08f56d8cb | 1,856 | cpp | C++ | module_01/ex06/main.cpp | laisarena/CPP_piscine | 47831fa443116d2b37e1081a3eddf8ca40fc954f | [
"MIT"
] | null | null | null | module_01/ex06/main.cpp | laisarena/CPP_piscine | 47831fa443116d2b37e1081a3eddf8ca40fc954f | [
"MIT"
] | null | null | null | module_01/ex06/main.cpp | laisarena/CPP_piscine | 47831fa443116d2b37e1081a3eddf8ca40fc954f | [
"MIT"
] | null | null | null | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main.cpp :+: :+: :+: ... | 29.935484 | 80 | 0.373922 | laisarena |
1c4979f06f10886907780d4b2f69ea2897dfbb0f | 3,481 | cpp | C++ | main.cpp | cleak/VoxelPerf | 02dad67747b113a3cd38cae6a2c307f877cab068 | [
"MIT"
] | 42 | 2017-07-30T17:50:16.000Z | 2022-03-27T09:27:04.000Z | main.cpp | cleak/VoxelPerf | 02dad67747b113a3cd38cae6a2c307f877cab068 | [
"MIT"
] | 1 | 2019-03-13T07:09:44.000Z | 2019-03-15T07:02:23.000Z | main.cpp | cleak/VoxelPerf | 02dad67747b113a3cd38cae6a2c307f877cab068 | [
"MIT"
] | 3 | 2018-05-10T20:38:29.000Z | 2020-06-21T21:12:39.000Z | #include <GL/glew.h>
#include <GLFW/glfw3.h>
#include <functional>
#include <stdlib.h>
#include <stdio.h>
#include <fstream>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <glm/glm.hpp>
#include "PerfFramework.h"
#include "PerfTimer.h"
#include "Voxels.h"
// Technique... | 23.05298 | 147 | 0.623671 | cleak |
1c4c1dd5f8a1af43cc2d96be32fc29d4512a17bb | 1,125 | cpp | C++ | src/mesh/Mesh.cpp | Ryp/reaper | da7b3aa4a69b95ced2496214e5cea4eb7823593a | [
"MIT"
] | 10 | 2018-08-16T05:32:46.000Z | 2022-02-04T09:55:54.000Z | src/mesh/Mesh.cpp | Ryp/reaper | da7b3aa4a69b95ced2496214e5cea4eb7823593a | [
"MIT"
] | null | null | null | src/mesh/Mesh.cpp | Ryp/reaper | da7b3aa4a69b95ced2496214e5cea4eb7823593a | [
"MIT"
] | 1 | 2019-05-13T17:56:35.000Z | 2019-05-13T17:56:35.000Z | ////////////////////////////////////////////////////////////////////////////////
/// Reaper
///
/// Copyright (c) 2015-2021 Thibault Schueller
/// This file is distributed under the MIT License
////////////////////////////////////////////////////////////////////////////////
#include "Mesh.h"
namespace
{
u32 getTriang... | 27.439024 | 80 | 0.517333 | Ryp |
1c581bc5cf930ce98ba8802c702af8a9043e4498 | 1,150 | cpp | C++ | graph2.cpp | Sdccoding/Data-Structure_Algorithms_Coding | 169ac55ae0a916e49276658c7fbe362ef78b5484 | [
"MIT"
] | null | null | null | graph2.cpp | Sdccoding/Data-Structure_Algorithms_Coding | 169ac55ae0a916e49276658c7fbe362ef78b5484 | [
"MIT"
] | null | null | null | graph2.cpp | Sdccoding/Data-Structure_Algorithms_Coding | 169ac55ae0a916e49276658c7fbe362ef78b5484 | [
"MIT"
] | null | null | null | //Finding cycle in undirected graph.
//Maintain a parent
//if vis[i]==0 ,answer will be what is returned from next step
//else check if the pre checked node is not the parent
#define pb push_back
bool find_cycle(vector<vector<int>> &graph,int s,vector<int> &visited,int par)
{
visited[s] = 1;
for (int i = ... | 21.698113 | 78 | 0.43913 | Sdccoding |
1c5beecd843134cbeb3e9304b58472d39cf36abd | 517 | cpp | C++ | KFPlugin/KFWorker/KFWorkerPlugin.cpp | 282951387/KFrame | 5d6e953f7cc312321c36632715259394ca67144c | [
"Apache-2.0"
] | 1 | 2021-04-26T09:31:32.000Z | 2021-04-26T09:31:32.000Z | KFPlugin/KFWorker/KFWorkerPlugin.cpp | 282951387/KFrame | 5d6e953f7cc312321c36632715259394ca67144c | [
"Apache-2.0"
] | null | null | null | KFPlugin/KFWorker/KFWorkerPlugin.cpp | 282951387/KFrame | 5d6e953f7cc312321c36632715259394ca67144c | [
"Apache-2.0"
] | null | null | null | #include "KFWorkerPlugin.hpp"
#include "KFWorkerModule.hpp"
//////////////////////////////////////////////////////////////////////////
namespace KFrame
{
void KFWorkerPlugin::Install()
{
__REGISTER_MODULE__( KFWorker );
}
void KFWorkerPlugin::UnInstall()
{
__UN_MODULE__( KFWorker ... | 23.5 | 74 | 0.5706 | 282951387 |
1c600f3152de73496b9f0adc2f6e407f3d97d57b | 905 | cpp | C++ | src/1000/1275.cpp17.cpp | upple/BOJ | e6dbf9fd17fa2b458c6a781d803123b14c18e6f1 | [
"MIT"
] | 8 | 2018-04-12T15:54:09.000Z | 2020-06-05T07:41:15.000Z | src/1000/1275.cpp17.cpp | upple/BOJ | e6dbf9fd17fa2b458c6a781d803123b14c18e6f1 | [
"MIT"
] | null | null | null | src/1000/1275.cpp17.cpp | upple/BOJ | e6dbf9fd17fa2b458c6a781d803123b14c18e6f1 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define MAX 100000
using namespace std;
typedef long long ll;
ll tree[MAX*4];
int n, q, s;
long long init(int p)
{
if(p>=s) return tree[p];
return tree[p]=init(p<<1)+init((p<<1)+1);
}
void update(int p, long long x)
{
p+=s;
x-=tree[p];
while(p)
{
tree[p]+=x;
... | 17.075472 | 69 | 0.469613 | upple |
1c60b3ba15367cb58c61891c937792762ad9d766 | 497 | cpp | C++ | Final_Fantasy_Mystery_World/Final_Fantasy_Mystery_World/c1CutSceneAddAudio.cpp | polarpathgames/Polar-Path | cf0eed03bbd6478c4fdd1eb074f48a2ceb78e0d6 | [
"MIT"
] | 9 | 2019-03-05T07:26:04.000Z | 2019-10-09T15:57:45.000Z | Final_Fantasy_Mystery_World/Final_Fantasy_Mystery_World/c1CutSceneAddAudio.cpp | polarpathgames/Polar-Path | cf0eed03bbd6478c4fdd1eb074f48a2ceb78e0d6 | [
"MIT"
] | 114 | 2019-03-10T09:35:12.000Z | 2019-06-10T21:39:12.000Z | Final_Fantasy_Mystery_World/Final_Fantasy_Mystery_World/c1CutSceneAddAudio.cpp | polarpathgames/Polar-Path | cf0eed03bbd6478c4fdd1eb074f48a2ceb78e0d6 | [
"MIT"
] | 3 | 2019-02-25T16:12:40.000Z | 2019-11-19T20:48:06.000Z | #include "App.h"
#include "m1CutScene.h"
#include "c1CutSceneAddAudio.h"
#include "m1Audio.h"
#include "p2Log.h"
c1CutSceneAddAudio::c1CutSceneAddAudio(uint start, uint duration, std::string name, std::string path) : c1CutsceneAction(start, duration)
{
names = name;
paths = path;
fx = App->audio->LoadFx(paths.c_str... | 20.708333 | 137 | 0.710262 | polarpathgames |
1c64d9122f3fb8db40009dd8092e9db25ba02955 | 1,983 | cpp | C++ | DSA Crack Sheet/solutions/M-Coloring Problem.cpp | Akshad7829/DataStructures-Algorithms | 439822c6a374672d1734e2389d3fce581a35007d | [
"MIT"
] | 5 | 2021-08-10T18:47:49.000Z | 2021-08-21T15:42:58.000Z | DSA Crack Sheet/solutions/M-Coloring Problem.cpp | Akshad7829/DataStructures-Algorithms | 439822c6a374672d1734e2389d3fce581a35007d | [
"MIT"
] | 2 | 2022-02-25T13:36:46.000Z | 2022-02-25T14:06:44.000Z | DSA Crack Sheet/solutions/M-Coloring Problem.cpp | Akshad7829/DataStructures-Algorithms | 439822c6a374672d1734e2389d3fce581a35007d | [
"MIT"
] | 1 | 2022-01-23T22:00:48.000Z | 2022-01-23T22:00:48.000Z | /*
M-Coloring Problem
==================
Given an undirected graph and an integer M. The task is to determine if the graph can be colored with at most M colors such that no two adjacent vertices of the graph are colored with the same color. Here coloring of a graph means the assignment of colors to all vertices. Print... | 26.44 | 334 | 0.635905 | Akshad7829 |
1c69beee23013f1a83185fc18c7ae7c9b9c6af59 | 2,360 | cpp | C++ | src/shadiray/RayReciever.cpp | algisb/shadiray | eb0d782c726ccf5d718c9abcde0fe2bc6fe54b0a | [
"MIT"
] | null | null | null | src/shadiray/RayReciever.cpp | algisb/shadiray | eb0d782c726ccf5d718c9abcde0fe2bc6fe54b0a | [
"MIT"
] | null | null | null | src/shadiray/RayReciever.cpp | algisb/shadiray | eb0d782c726ccf5d718c9abcde0fe2bc6fe54b0a | [
"MIT"
] | null | null | null | #include "RayReciever.h"
using namespace shad;
std::vector<RayReciever*> RayReciever::s_rayRecievers = std::vector<RayReciever*>();
RayReciever::RayReciever()
{
m_mesh = NULL;
m_numTriangles = 0;
m_triangles = NULL;
m_tTriangles = NULL;
m_transform = NULL;
s_rayRecievers.push_back(this); //als... | 33.239437 | 128 | 0.59322 | algisb |
cc5eaba5690fe3ec0a15f524a9593daff12da1b8 | 2,779 | cpp | C++ | Devices/wheels.cpp | partouf/GoPiGoCPP | b0605953cf5f810d7452b2a0d0592cd6715403d7 | [
"MIT"
] | 1 | 2016-03-08T13:30:39.000Z | 2016-03-08T13:30:39.000Z | Devices/wheels.cpp | partouf/GoPiGoCPP | b0605953cf5f810d7452b2a0d0592cd6715403d7 | [
"MIT"
] | null | null | null | Devices/wheels.cpp | partouf/GoPiGoCPP | b0605953cf5f810d7452b2a0d0592cd6715403d7 | [
"MIT"
] | null | null | null |
#include "wheels.h"
GoPiGo::Wheels::Wheels(IBoard * AConnection) : ConnectedDevice(AConnection)
{
}
bool GoPiGo::Wheels::Forward()
{
Transaction Lock(this->Connection);
return this->Connection->WriteBlock(fwd_cmd, 0, 0, 0);
}
bool GoPiGo::Wheels::Backward()
{
Transaction Lock(this->Connection);
return... | 21.542636 | 75 | 0.719323 | partouf |
cc61393cc66b1773327261e5b943987dbdd8e2c3 | 359 | cpp | C++ | source/Input.cpp | reworks/3DS_eBook_Reader | 9067a040168e25ac8413e420b93e07577f743274 | [
"MIT"
] | 20 | 2016-05-09T12:40:18.000Z | 2018-09-20T00:09:59.000Z | source/Input.cpp | DomRe/3DS_eBook_Reader | 9067a040168e25ac8413e420b93e07577f743274 | [
"MIT"
] | 8 | 2018-01-21T08:26:04.000Z | 2018-06-10T14:08:22.000Z | source/Input.cpp | reworks/3DS_eBook_Reader | 9067a040168e25ac8413e420b93e07577f743274 | [
"MIT"
] | 3 | 2016-07-15T15:36:42.000Z | 2016-07-22T01:21:32.000Z | // Input.cpp
// Input manager
#include "Input.hpp"
Input::Input()
:m_kDown(0), m_running(true)
{
}
void Input::checkForEvents()
{
hidScanInput();
m_kDown = hidKeysDown();
hidTouchRead(&m_touch);
}
u16 Input::getPosX() const
{
return m_touch.px;
}
u16 Input::getPosY() const
{
return m_touch.py;
}
u32 Input::... | 11.21875 | 29 | 0.679666 | reworks |
cc641995d5c0dfbe12092de45df7c21220970750 | 888 | hpp | C++ | libs/range/test/test_function/true_predicate.hpp | zyiacas/boost-doc-zh | 689e5a3a0a4dbead1a960f7b039e3decda54aa2c | [
"BSL-1.0"
] | 198 | 2015-01-13T05:47:18.000Z | 2022-03-09T04:46:46.000Z | libs/range/test/test_function/true_predicate.hpp | sdfict/boost-doc-zh | 689e5a3a0a4dbead1a960f7b039e3decda54aa2c | [
"BSL-1.0"
] | 9 | 2015-01-28T16:33:19.000Z | 2020-04-12T23:03:28.000Z | libs/range/test/test_function/true_predicate.hpp | sdfict/boost-doc-zh | 689e5a3a0a4dbead1a960f7b039e3decda54aa2c | [
"BSL-1.0"
] | 139 | 2015-01-15T20:09:31.000Z | 2022-01-31T15:21:16.000Z | // Boost.Range library
//
// Copyright Neil Groves 2010. Use, modification and
// distribution is subject to the Boost Software License, Version
// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
//
// For more information, see http://www.boost.org/libs/ran... | 29.6 | 95 | 0.665541 | zyiacas |
cc66e4b02f449ebf8c59b1217c6e557dde37096c | 863 | cpp | C++ | src/BounceBall.cpp | projectivemotion/sdlgame1 | 9e126b6ef096605008dfc5db8e9264b68582b38a | [
"MIT"
] | null | null | null | src/BounceBall.cpp | projectivemotion/sdlgame1 | 9e126b6ef096605008dfc5db8e9264b68582b38a | [
"MIT"
] | null | null | null | src/BounceBall.cpp | projectivemotion/sdlgame1 | 9e126b6ef096605008dfc5db8e9264b68582b38a | [
"MIT"
] | null | null | null | /*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: BounceBall.cpp
* Author: eye
*
* Created on September 25, 2019, 2:32 AM
*/
#include "BounceBall.h"
#include "app/... | 18.361702 | 80 | 0.632677 | projectivemotion |
cc6b2f1f742c2684b91d4cb5028486dff8f8d401 | 5,594 | cpp | C++ | src/esp32/src/quack_webserver.cpp | Hyodar/quack | 598527946ad2ec5046007cc29c92c6d1454e4ebc | [
"MIT"
] | 6 | 2020-04-06T19:46:37.000Z | 2022-02-20T23:42:21.000Z | src/esp32/src/quack_webserver.cpp | Hyodar/quack | 598527946ad2ec5046007cc29c92c6d1454e4ebc | [
"MIT"
] | null | null | null | src/esp32/src/quack_webserver.cpp | Hyodar/quack | 598527946ad2ec5046007cc29c92c6d1454e4ebc | [
"MIT"
] | null | null | null |
#include "quack_webserver.h"
#ifdef WEBSERVER_ENABLED
#include <Arduino.h>
#include <SPIFFS.h>
#include <FS.h>
#include <ESPmDNS.h>
#include <WiFi.h>
#include "web_files.h"
#include "web_info.h"
#include <quack_utils.h>
#include "quack_parser.h"
#include "quack_event_launcher.h"
const char* MAGIC = "4027432687"... | 26.894231 | 113 | 0.530747 | Hyodar |
cc6dd09ba562e1eadf4ac5e0bcfe29faef139a7a | 21,132 | cpp | C++ | src/ADC121C021.cpp | RAKWireless/RAK-MQx-Library | a1a850748ae06a23c8bf35ccb0bca7125baaa866 | [
"MIT"
] | null | null | null | src/ADC121C021.cpp | RAKWireless/RAK-MQx-Library | a1a850748ae06a23c8bf35ccb0bca7125baaa866 | [
"MIT"
] | null | null | null | src/ADC121C021.cpp | RAKWireless/RAK-MQx-Library | a1a850748ae06a23c8bf35ccb0bca7125baaa866 | [
"MIT"
] | 1 | 2021-11-05T04:11:24.000Z | 2021-11-05T04:11:24.000Z | /**
* @file ADC121C021.h
* @author rakwireless.com
* @brief This code is designed to config ADC121C021 ADC device and handle the data get from MQ-X Sensors
* @version 1.0
* @date 2021-05-18
*
* @copyright Copyright (c) 2021
*
*/
#include "ADC121C021.h"
#include <Wire.h>
/**
* @brief Init the ADC121C021 dev... | 27.732283 | 125 | 0.67703 | RAKWireless |
cc6e646b4b4eb1df6ce2620ce554064e4cbe2ab8 | 575 | cpp | C++ | 1450.在既定时间做作业的学生人数/busyStudent.cpp | YichengZhong/Top-Interview-Questions | 124828d321f482a0eaa30012b3706267487bfd24 | [
"MIT"
] | 1 | 2019-10-21T14:40:39.000Z | 2019-10-21T14:40:39.000Z | 5412.在既定时间做作业的学生人数/busyStudent.cpp | YichengZhong/Top-Interview-Questions | 124828d321f482a0eaa30012b3706267487bfd24 | [
"MIT"
] | null | null | null | 5412.在既定时间做作业的学生人数/busyStudent.cpp | YichengZhong/Top-Interview-Questions | 124828d321f482a0eaa30012b3706267487bfd24 | [
"MIT"
] | 1 | 2020-11-04T07:33:34.000Z | 2020-11-04T07:33:34.000Z | class Solution {
public:
int busyStudent(vector<int>& startTime, vector<int>& endTime, int queryTime) {
multimap<int, int>m_end_start;
int int_out = 0;
for (int i = 0; i < startTime.size(); ++i)
{
m_end_start.insert(make_pair(startTime[i], endTime[i]));
}
... | 25 | 82 | 0.504348 | YichengZhong |
cc7009bcf6f7cc46402f476acadbf04c76387416 | 809 | hpp | C++ | sources/vggrab/storage.hpp | SimonsRoad/seq2map | cc8cd20842b3c6db01f73d2e6ecf543189e56891 | [
"BSD-3-Clause"
] | null | null | null | sources/vggrab/storage.hpp | SimonsRoad/seq2map | cc8cd20842b3c6db01f73d2e6ecf543189e56891 | [
"BSD-3-Clause"
] | null | null | null | sources/vggrab/storage.hpp | SimonsRoad/seq2map | cc8cd20842b3c6db01f73d2e6ecf543189e56891 | [
"BSD-3-Clause"
] | 1 | 2018-11-01T13:11:39.000Z | 2018-11-01T13:11:39.000Z | #ifndef STORAGE_HPP
#define STORAGE_HPP
#include <seq2map/common.hpp>
using namespace seq2map;
class VOStorage
{
public:
VOStorage(const Path& root = "", size_t numCams = 0);
bool Create(const Path& root, size_t numCams);
bool Load(const Path& root);
bool AddFrame(const std::string& filename, const ... | 23.114286 | 83 | 0.71199 | SimonsRoad |
cc7bdf5a5abc1451fc12df95be329f5b09746b2f | 234 | cpp | C++ | phase4/test_stuffs/alarm_oop/Led.cpp | Sibernetika-Teknologi-Industri/ventilator_mumu | 0c7c875d212adc1b914a8a9081e140ac2d42435c | [
"Apache-2.0"
] | null | null | null | phase4/test_stuffs/alarm_oop/Led.cpp | Sibernetika-Teknologi-Industri/ventilator_mumu | 0c7c875d212adc1b914a8a9081e140ac2d42435c | [
"Apache-2.0"
] | null | null | null | phase4/test_stuffs/alarm_oop/Led.cpp | Sibernetika-Teknologi-Industri/ventilator_mumu | 0c7c875d212adc1b914a8a9081e140ac2d42435c | [
"Apache-2.0"
] | null | null | null | #include "Led.h"
Led::Led(byte pin){
this->pin = pin;
init();
}
void Led::init(){
pinMode(pin, OUTPUT);
off();
}
void Led::on() {
digitalWrite(pin, HIGH);
}
void Led::off() {
digitalWrite(pin, LOW);
}
| 12.315789 | 27 | 0.529915 | Sibernetika-Teknologi-Industri |
cc816f00a2386e46597d95f721bf8ca028861b68 | 10,570 | cpp | C++ | Source/Graphics/XelaObject.cpp | XelaSpirit/Xela-Graphics | 599017eee80f2bdba3ad65e387e5338b653793c2 | [
"MIT"
] | null | null | null | Source/Graphics/XelaObject.cpp | XelaSpirit/Xela-Graphics | 599017eee80f2bdba3ad65e387e5338b653793c2 | [
"MIT"
] | null | null | null | Source/Graphics/XelaObject.cpp | XelaSpirit/Xela-Graphics | 599017eee80f2bdba3ad65e387e5338b653793c2 | [
"MIT"
] | null | null | null | //Libs
#include "GL/glew.h"
//Xela Graphics
#include "XelaObject.h"
XelaObject *XelaObject::genObject() {
XelaObject *o = new XelaObject();
//Generate array/buffers for this object
glGenVertexArrays(1, &o->VAO);
glGenBuffers(1, &o->VBO);
glGenBuffers(1, &o->EBO);
return o;
}
static void xelaGenObjectResData(... | 31.179941 | 145 | 0.624976 | XelaSpirit |
cc86615fa2ce661c1d99dc90b17e037fd8e1bb93 | 18,969 | cpp | C++ | export/windows/cpp/obj/src/openfl/_legacy/display/MovieClip.cpp | TinyPlanetStudios/Project-Crash-Land | 365f196be4212602d32251566f26b53fb70693f6 | [
"MIT"
] | null | null | null | export/windows/cpp/obj/src/openfl/_legacy/display/MovieClip.cpp | TinyPlanetStudios/Project-Crash-Land | 365f196be4212602d32251566f26b53fb70693f6 | [
"MIT"
] | null | null | null | export/windows/cpp/obj/src/openfl/_legacy/display/MovieClip.cpp | TinyPlanetStudios/Project-Crash-Land | 365f196be4212602d32251566f26b53fb70693f6 | [
"MIT"
] | null | null | null | // Generated by Haxe 3.3.0
#include <hxcpp.h>
#ifndef INCLUDED_openfl__legacy_display_DisplayObject
#include <openfl/_legacy/display/DisplayObject.h>
#endif
#ifndef INCLUDED_openfl__legacy_display_DisplayObjectContainer
#include <openfl/_legacy/display/DisplayObjectContainer.h>
#endif
#ifndef INCLUDED_openfl__legacy_d... | 45.272076 | 207 | 0.729822 | TinyPlanetStudios |
cc9060933f873b0d54764fc319ccc918d52b506b | 9,815 | cpp | C++ | src/networking/impl/BasePushConnection.cpp | X9Developers/xsn-wallet | 7b5aaf6de15928c8cf5b86a844e56710c301df1f | [
"MIT"
] | 1 | 2018-08-20T11:15:45.000Z | 2018-08-20T11:15:45.000Z | src/networking/impl/BasePushConnection.cpp | X9Developers/xsn-wallet | 7b5aaf6de15928c8cf5b86a844e56710c301df1f | [
"MIT"
] | null | null | null | src/networking/impl/BasePushConnection.cpp | X9Developers/xsn-wallet | 7b5aaf6de15928c8cf5b86a844e56710c301df1f | [
"MIT"
] | 3 | 2018-08-30T08:35:43.000Z | 2019-03-29T15:36:26.000Z | #include "BasePushConnection.hpp"
#include <QDebug>
#include <QTimer>
#include <QSslSocket>
#define WARNING qCWarning(_logCategory)
#define DEBUG qCDebug(_logCategory)
BasePushConnection::BasePushConnection(
const CiphrNetworkSettings::PushServerSettings &settings,
QSharedPointer<FrameLengthCodec> co... | 29.21131 | 129 | 0.680693 | X9Developers |
cc96f19b94176b3ac231fde4e89d5095a07d445d | 8,267 | cpp | C++ | source/attributedvertexclouds-polygons/PolygonTriangles.cpp | cginternals/attributedvertexclouds | 5173948c6b381528738d128803dc2b22ac555a0f | [
"MIT"
] | 3 | 2017-07-23T21:31:54.000Z | 2018-11-25T02:53:58.000Z | source/attributedvertexclouds-polygons/PolygonTriangles.cpp | cginternals/attributedvertexclouds | 5173948c6b381528738d128803dc2b22ac555a0f | [
"MIT"
] | 1 | 2017-08-04T12:03:24.000Z | 2018-02-17T16:44:17.000Z | source/attributedvertexclouds-polygons/PolygonTriangles.cpp | cginternals/attributedvertexclouds | 5173948c6b381528738d128803dc2b22ac555a0f | [
"MIT"
] | 1 | 2019-12-13T17:53:14.000Z | 2019-12-13T17:53:14.000Z |
#include "PolygonTriangles.h"
#include <glbinding/gl/gl.h>
#include "common.h"
using namespace gl;
PolygonTriangles::PolygonTriangles()
: PolygonImplementation("Triangles")
, m_vertices(0)
, m_vao(0)
, m_vertexShader(0)
, m_fragmentShader(0)
{
}
PolygonTriangles::~PolygonTriangles()
{
glDeleteBuffers(1, &m_ve... | 33.469636 | 141 | 0.670376 | cginternals |
cca4a00ff9ee8c21b0ea16891266c7edd76f9794 | 1,401 | cc | C++ | src/graph/bellman_ford.cc | kyomukyomupurin/competitive_programming | 4c59bcfe8b6704cbf3084b6a31782845e8799cec | [
"CC0-1.0"
] | 1 | 2020-10-05T13:42:29.000Z | 2020-10-05T13:42:29.000Z | src/graph/bellman_ford.cc | kyomukyomupurin/competitive_programming | 4c59bcfe8b6704cbf3084b6a31782845e8799cec | [
"CC0-1.0"
] | 1 | 2021-10-02T07:15:09.000Z | 2021-10-02T07:15:09.000Z | src/graph/bellman_ford.cc | kyomukyomupurin/competitive_programming | 4c59bcfe8b6704cbf3084b6a31782845e8799cec | [
"CC0-1.0"
] | 1 | 2021-10-02T07:10:40.000Z | 2021-10-02T07:10:40.000Z | // Bellman Ford algorithm
// verified by
// https://onlinejudge.u-aizu.ac.jp/courses_/library/5/GRL/1/GRL_1_B
#include <cassert>
#include <limits>
#include <vector>
#include "./graph.cc"
// snippet-begin
template <class T>
std::vector<T> bellmanford(const graph<T>& g, int s) {
assert(0 <= s && s <... | 23.745763 | 73 | 0.509636 | kyomukyomupurin |
cca72e74f8977e47711a93b6600605cfb67aa008 | 2,274 | cc | C++ | arcane/src/arcane/utils/DataVector1D.cc | JeromeDuboisPro/framework | d88925495e3787fdaf640c29728dcac385160188 | [
"Apache-2.0"
] | null | null | null | arcane/src/arcane/utils/DataVector1D.cc | JeromeDuboisPro/framework | d88925495e3787fdaf640c29728dcac385160188 | [
"Apache-2.0"
] | null | null | null | arcane/src/arcane/utils/DataVector1D.cc | JeromeDuboisPro/framework | d88925495e3787fdaf640c29728dcac385160188 | [
"Apache-2.0"
] | null | null | null | // -*- tab-width: 2; indent-tabs-mode: nil; coding: utf-8-with-signature -*-
//-----------------------------------------------------------------------------
// Copyright 2000-2021 CEA (www.cea.fr) IFPEN (www.ifpenergiesnouvelles.com)
// See the top-level COPYRIGHT file for details.
// SPDX-License-Identifier: Apache-2... | 34.454545 | 79 | 0.25066 | JeromeDuboisPro |
ccaa6a7f7b4984b824ac9f5d8702e7bc7ed6b075 | 2,246 | cpp | C++ | Projects/RainDrops/RainDrops/RainDrops/RainDrop.cpp | kaushal135/NetworkingAstroids | 903aa4cbff58f2626f93e7054c27797aa6e591dc | [
"MIT"
] | null | null | null | Projects/RainDrops/RainDrops/RainDrops/RainDrop.cpp | kaushal135/NetworkingAstroids | 903aa4cbff58f2626f93e7054c27797aa6e591dc | [
"MIT"
] | null | null | null | Projects/RainDrops/RainDrops/RainDrops/RainDrop.cpp | kaushal135/NetworkingAstroids | 903aa4cbff58f2626f93e7054c27797aa6e591dc | [
"MIT"
] | null | null | null | #include "GameCore.h"
#include "RainDrop.h"
#include "PrefabAsset.h"
#include "Transform.h"
IMPLEMENT_DYNAMIC_CLASS(RainDrop)
void RainDrop::initialize()
{
Sprite::initialize();
if (NetworkServer::Instance().isServer())
{
speed.x = (maxSpeed.x - minSpeed.x) * Random.Random();
s... | 23.893617 | 92 | 0.629118 | kaushal135 |
ccacc838284b30f294ed48022c0a9ea8600ed22c | 335 | hpp | C++ | include/image/Histrogram.hpp | tobiasbu/raytracer | bc1db0c6aea504b2dc59520fe6245d523fb11ffa | [
"MIT"
] | 3 | 2018-04-13T05:40:11.000Z | 2022-01-03T14:43:17.000Z | include/image/Histrogram.hpp | tobiasbu/raytracer | bc1db0c6aea504b2dc59520fe6245d523fb11ffa | [
"MIT"
] | 2 | 2017-08-23T19:57:02.000Z | 2018-03-06T12:47:40.000Z | include/image/Histrogram.hpp | tobiasbu/raytracer | bc1db0c6aea504b2dc59520fe6245d523fb11ffa | [
"MIT"
] | null | null | null |
#include "image.h"
class Histrogram
{
private:
Image * image = nullptr;
unsigned char maxr;
unsigned char maxg;
unsigned char maxb;
unsigned char maxa;
float freqsums[5];
// frequencies
float value[256];
float r[256];
float g[256];
float b[256];
float a[256];
public:
Histrogram(Image * img);
void ... | 11.964286 | 25 | 0.677612 | tobiasbu |
ccb0752f6842d4ec565d1c9dec3d7da3973c67db | 1,314 | cpp | C++ | labs/6_lab.cpp | harshtix/CS-161-All | a251070e6b19992416ebafb25ee380680fea2c71 | [
"MIT"
] | null | null | null | labs/6_lab.cpp | harshtix/CS-161-All | a251070e6b19992416ebafb25ee380680fea2c71 | [
"MIT"
] | null | null | null | labs/6_lab.cpp | harshtix/CS-161-All | a251070e6b19992416ebafb25ee380680fea2c71 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
using namespace std;
void get_string(string *);
void set_replace_string(string &,string *);
int get_search_replace(string &, string &);
int main(){
string letter;
get_string(&letter);
string replica;
set_replace_string(replica,&letter);
get_search_replace(replica,... | 20.857143 | 65 | 0.560122 | harshtix |
ccb3fe231dcb8733060209d7f10f78cddb05f6b3 | 3,669 | hpp | C++ | D3/Vec3.hpp | Sudoka/D3 | 40c43bfc8bc619a344796c69a720be752e660eac | [
"CC-BY-3.0"
] | 1 | 2018-06-21T04:04:45.000Z | 2018-06-21T04:04:45.000Z | D3/Vec3.hpp | Sudoka/D3 | 40c43bfc8bc619a344796c69a720be752e660eac | [
"CC-BY-3.0"
] | null | null | null | D3/Vec3.hpp | Sudoka/D3 | 40c43bfc8bc619a344796c69a720be752e660eac | [
"CC-BY-3.0"
] | null | null | null | //
// Vec3.hpp
//
//
// Created by Srđan Rašić on 8/12/12.
// Copyright (c) 2012 Srđan Rašić. All rights reserved.
//
#ifndef _Vec3_hpp
#define _Vec3_hpp
#include "Mat3.hpp"
#include <cmath>
namespace d3 {
#pragma mark Interface
class Vec3 {
public:
union {
struct { float x, y, ... | 22.78882 | 70 | 0.4568 | Sudoka |
ccb51269588588a6efb9142eee529a65c4b0f427 | 2,687 | cc | C++ | omnetpy/bindings/bind_cevent.cc | ranarashadmahmood/OMNETPY | 13ab49106a3ac700aa633a8eb37acdad5e3157ab | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 31 | 2020-06-23T13:53:47.000Z | 2022-03-28T08:09:00.000Z | omnetpy/bindings/bind_cevent.cc | ranarashadmahmood/OMNETPY | 13ab49106a3ac700aa633a8eb37acdad5e3157ab | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 8 | 2020-11-01T21:35:47.000Z | 2021-08-29T11:40:50.000Z | omnetpy/bindings/bind_cevent.cc | ranarashadmahmood/OMNETPY | 13ab49106a3ac700aa633a8eb37acdad5e3157ab | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 8 | 2021-03-22T15:32:22.000Z | 2022-02-02T14:57:56.000Z | #include <pybind11/pybind11.h>
#include <omnetpp.h>
#include <omnetpp/cevent.h>
void bind_cEvent(pybind11::module &m)
{
pybind11::class_<omnetpp::cEvent> py_cEvent(
m,
"_cEvent",
R"docstring(
Represents an event in the discrete event simulator.
When events are scheduled, ... | 33.5875 | 89 | 0.651284 | ranarashadmahmood |
ccb542fe40043d42afb6592136d65a32a1e04055 | 4,436 | hpp | C++ | include/impls/history.hpp | KusStar/- | 8a7117e5d7b4f0dc9a4d34e12076f301f8bb37ec | [
"MIT"
] | null | null | null | include/impls/history.hpp | KusStar/- | 8a7117e5d7b4f0dc9a4d34e12076f301f8bb37ec | [
"MIT"
] | null | null | null | include/impls/history.hpp | KusStar/- | 8a7117e5d7b4f0dc9a4d34e12076f301f8bb37ec | [
"MIT"
] | null | null | null | #pragma once
#ifndef __HISTORY_H
#define __HISTORY_H
#include "basic.hpp"
namespace wei {
namespace impls {
inline void history(const Poems& poems) {
Brush brush;
Reader reader;
auto items = reader.get_all();
cout << '\n'
<< detail::title... | 33.862595 | 79 | 0.270063 | KusStar |
ccb5ae6e2835afad7ca717335523dd15f3cf3857 | 3,170 | cpp | C++ | tests/intersperse.cpp | boaz001/pipes | d3fb8f855fdf5f11a278e1e91a86768fb052beb0 | [
"MIT"
] | 643 | 2019-08-13T06:28:27.000Z | 2022-03-17T07:02:03.000Z | tests/intersperse.cpp | boaz001/pipes | d3fb8f855fdf5f11a278e1e91a86768fb052beb0 | [
"MIT"
] | 59 | 2019-08-14T13:25:39.000Z | 2021-11-03T15:33:44.000Z | tests/intersperse.cpp | boaz001/pipes | d3fb8f855fdf5f11a278e1e91a86768fb052beb0 | [
"MIT"
] | 81 | 2019-08-13T19:50:15.000Z | 2022-03-01T21:53:33.000Z | #include "catch.hpp"
#include "pipes/pipes.hpp"
#include <algorithm>
#include <string>
#include <vector>
TEST_CASE("intersperse inserts a delimiter between the consecutive elements coming its way")
{
auto const input = std::string{"abcdef"};
auto const expected = std::string{"a,b,c,d,e,f"};
auto resu... | 27.327586 | 92 | 0.595584 | boaz001 |
ccb6279854f1fc5f3a4fd19276ae5b9ab74fdba4 | 482 | cpp | C++ | testing/utilities.cpp | uofuseismo/mflib | 14695f62082d28d4cc5603bb6edcaf1efe9dd980 | [
"MIT"
] | 5 | 2019-12-06T21:14:17.000Z | 2021-09-21T03:36:58.000Z | testing/utilities.cpp | uofuseismo/mflib | 14695f62082d28d4cc5603bb6edcaf1efe9dd980 | [
"MIT"
] | 5 | 2019-11-27T19:06:06.000Z | 2020-04-24T19:07:44.000Z | testing/utilities.cpp | uofuseismo/mflib | 14695f62082d28d4cc5603bb6edcaf1efe9dd980 | [
"MIT"
] | 2 | 2021-09-09T11:15:50.000Z | 2021-12-04T00:50:53.000Z | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <random>
#include <numeric>
#include "utilities.hpp"
std::vector<double> generateUniformRandomNumbers(
const int n, const double lower, const double upper)
{
std::random_device dev;
std::mt19937 rng(dev());
std::uniform_... | 20.956522 | 56 | 0.661826 | uofuseismo |
ccb6a1c197ca9e1527b5403213d7291c5a915ab1 | 790 | cpp | C++ | examples/simple.cpp | calebzulawski/hippo | aacf7f51accf29ae0680da3f8409c0a861d14524 | [
"Apache-2.0"
] | 35 | 2019-04-29T19:19:42.000Z | 2021-09-18T23:12:17.000Z | examples/simple.cpp | calebzulawski/hippo | aacf7f51accf29ae0680da3f8409c0a861d14524 | [
"Apache-2.0"
] | 21 | 2019-04-01T17:25:35.000Z | 2019-10-14T21:03:12.000Z | examples/simple.cpp | calebzulawski/hippo | aacf7f51accf29ae0680da3f8409c0a861d14524 | [
"Apache-2.0"
] | 2 | 2019-07-09T18:33:31.000Z | 2019-10-14T15:54:08.000Z | #include "hippo/hippo.h"
#include "hippo/std/map.h"
#include <iostream>
struct Foo {
int a;
int b;
};
struct Bar {
std::map<int, Foo> foos;
};
// Make Foo printable
HIPPO_CLASS_BEGIN(Foo)
HIPPO_MEMBER(a)
HIPPO_MEMBER(b)
HIPPO_CLASS_END()
// Make Bar printable
HIPPO_CLASS_BEGIN(Bar)
HIPPO_MEMBER(foos)
HIPPO_CL... | 18.809524 | 57 | 0.664557 | calebzulawski |
ccb7606f6f50d109ece59ee09a99d9dddb598f69 | 4,017 | cpp | C++ | benchmark/tools/range_generator.cpp | izvolov/thrust | 399e12eed54131d731c4c5ef40512b17107bca56 | [
"BSL-1.0"
] | 85 | 2015-11-25T14:05:42.000Z | 2021-11-15T11:47:19.000Z | benchmark/tools/range_generator.cpp | izvolov/burst | 399e12eed54131d731c4c5ef40512b17107bca56 | [
"BSL-1.0"
] | 147 | 2015-01-11T08:36:53.000Z | 2021-11-04T09:03:36.000Z | benchmark/tools/range_generator.cpp | izvolov/thrust | 399e12eed54131d731c4c5ef40512b17107bca56 | [
"BSL-1.0"
] | 6 | 2016-06-02T17:28:26.000Z | 2020-04-05T11:16:16.000Z | #include <utility/io/generate_many.hpp>
#include <utility/io/generate_many_sorted.hpp>
#include <burst/iterator/binary_ostream_iterator.hpp>
#include <boost/program_options.hpp>
#include <chrono>
#include <cstddef>
#include <cstdint>
#include <exception>
#include <functional>
#include <iostream>
#include <limits>
#i... | 30.9 | 108 | 0.552651 | izvolov |
ccb8790c3ebb079716de9936cf0b05502d143a8d | 1,601 | hpp | C++ | algo/math/mod.hpp | digitcrusher/algorytmy | 6cb12520ee615881985993d286dddcf28523c350 | [
"FSFAP"
] | 1 | 2021-09-24T11:10:39.000Z | 2021-09-24T11:10:39.000Z | algo/math/mod.hpp | digitcrusher/algorytmy | 6cb12520ee615881985993d286dddcf28523c350 | [
"FSFAP"
] | 1 | 2021-06-20T09:21:33.000Z | 2021-06-20T09:21:33.000Z | algo/math/mod.hpp | digitcrusher/algorytmy | 6cb12520ee615881985993d286dddcf28523c350 | [
"FSFAP"
] | null | null | null | /*
* Arytmetyka modularna - digitcrusher/algorytmy
*
* Copyright (c) 2021 Karol Łacina aka digitcrusher
*
* Copying and distribution of this software, with or without modification,
* are permitted in any medium without royalty provided the copyright
* notice and this notice are preserved. This software is offere... | 19.765432 | 78 | 0.60837 | digitcrusher |
ccc73ef758f256e11ce59269eb0358ff5f45a164 | 3,958 | hpp | C++ | third_party/fuzzing-headers/include/fuzzing/datasource/datasource.hpp | practicalswift/vfuzz | 148d94ece38ed9dc88e7c8c960b5b1cf7f36402b | [
"MIT"
] | 182 | 2020-03-08T14:50:34.000Z | 2021-07-19T17:11:39.000Z | third_party/fuzzing-headers/include/fuzzing/datasource/datasource.hpp | practicalswift/vfuzz | 148d94ece38ed9dc88e7c8c960b5b1cf7f36402b | [
"MIT"
] | 2 | 2020-07-13T18:47:41.000Z | 2020-07-13T18:48:00.000Z | third_party/fuzzing-headers/include/fuzzing/datasource/datasource.hpp | practicalswift/vfuzz | 148d94ece38ed9dc88e7c8c960b5b1cf7f36402b | [
"MIT"
] | 35 | 2020-03-08T14:59:26.000Z | 2021-01-31T01:40:21.000Z | #pragma once
#include <fuzzing/exception.hpp>
#include <fuzzing/types.hpp>
#include <cstddef>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
namespace fuzzing {
namespace datasource {
class Base
{
protected:
virtual std::vector<uint8_t> get(const size_t min,... | 24.134146 | 104 | 0.607125 | practicalswift |
ccc795ec4d767db379c9fb3aa921eccf3e9ca64a | 1,161 | cpp | C++ | src/All2DEngine/All2D/All2D_Sprites/SpriteManager.cpp | ldornbusch/All2D_Base | c790293b3030de97f65d62f6617222c42d18fa6a | [
"Apache-2.0"
] | null | null | null | src/All2DEngine/All2D/All2D_Sprites/SpriteManager.cpp | ldornbusch/All2D_Base | c790293b3030de97f65d62f6617222c42d18fa6a | [
"Apache-2.0"
] | null | null | null | src/All2DEngine/All2D/All2D_Sprites/SpriteManager.cpp | ldornbusch/All2D_Base | c790293b3030de97f65d62f6617222c42d18fa6a | [
"Apache-2.0"
] | null | null | null | // BlitManager.cpp: Implementierung der Klasse BlitManager.
//
//////////////////////////////////////////////////////////////////////
#include "SpriteManager.h"
#include "../All2D_System.h"
#include <algorithm>
//////////////////////////////////////////////////////////////////////
// Konstruktion/Destruktion
... | 23.693878 | 85 | 0.540913 | ldornbusch |
ccc952258b267bba54344dd4a77693d22cfe6f58 | 55,821 | cc | C++ | alignment_computation.cc | Thomas1205/RegAligner | 2c410c124e844c60af9bd7019ef1a78199893f46 | [
"IBM-pibs"
] | 2 | 2016-02-29T07:31:13.000Z | 2017-02-23T19:02:46.000Z | alignment_computation.cc | Thomas1205/RegAligner | 2c410c124e844c60af9bd7019ef1a78199893f46 | [
"IBM-pibs"
] | null | null | null | alignment_computation.cc | Thomas1205/RegAligner | 2c410c124e844c60af9bd7019ef1a78199893f46 | [
"IBM-pibs"
] | null | null | null | /*** written by Thomas Schoenemann, initially as a private person, October 2009 ***
*** refined at Lund University, Sweden, January 2010 - March 2011 ***
*** and at the University of Düsseldorf, January 2012 - May 2012
*** and since as a private person ***/
#include "alignment_computation.hh"
#include "hmm_forward_... | 32.64386 | 151 | 0.594382 | Thomas1205 |
ef9bd3328802aed6f7211f8150ac177c100e7a36 | 7,158 | cpp | C++ | tests/quoting_engine.cpp | yyun/gamma-ray | f06971caac75c1669981b3ebb7166413ab0921fc | [
"ISC"
] | 150 | 2020-12-28T23:56:42.000Z | 2022-03-21T13:22:40.000Z | tests/quoting_engine.cpp | yyun/gamma-ray | f06971caac75c1669981b3ebb7166413ab0921fc | [
"ISC"
] | 6 | 2020-12-29T13:08:10.000Z | 2022-02-06T20:25:25.000Z | tests/quoting_engine.cpp | yyun/gamma-ray | f06971caac75c1669981b3ebb7166413ab0921fc | [
"ISC"
] | 49 | 2020-12-29T11:49:34.000Z | 2022-03-22T08:35:54.000Z | #include "doctest.h"
#include <vector>
#include "json.hpp"
#include "quoting_engine.h"
#include "fair_value.h"
#include "market_filtration.h"
#include "quoting_parameters.h"
#include "quoting_strategies.h"
#include "skew.h"
#include "bitmex_gateway.h"
#include "models.h"
using json = nlohmann::json;
class TestMarketF... | 24.768166 | 135 | 0.654373 | yyun |
ef9da793b46a0f683a8620938cce54cbd2a96694 | 883 | hpp | C++ | jitast/AstScalar.hpp | cjang/chai | 7faba752cc4491d1b30590abef21edc4efffa0f6 | [
"Unlicense"
] | 11 | 2015-06-12T19:54:14.000Z | 2021-11-26T10:45:18.000Z | jitast/AstScalar.hpp | cjang/chai | 7faba752cc4491d1b30590abef21edc4efffa0f6 | [
"Unlicense"
] | null | null | null | jitast/AstScalar.hpp | cjang/chai | 7faba752cc4491d1b30590abef21edc4efffa0f6 | [
"Unlicense"
] | null | null | null | // Copyright 2012 Chris Jang (fastkor@gmail.com) under The Artistic License 2.0
#ifndef _CHAI_AST_SCALAR_HPP_
#define _CHAI_AST_SCALAR_HPP_
#include <stdint.h>
#include "BaseAst.hpp"
namespace chai_internal {
////////////////////////////////////////
// scalar_u32, scalar_i32
// scalar_f32, scalar_f64
class AstSca... | 21.02381 | 79 | 0.698754 | cjang |
efa7499e2776950f53afa85da3422ff1b0ab4792 | 514 | cpp | C++ | Source/Api/Searcher/RandomSearcher.cpp | Fillo7/KTT | a0c252efb75a8366450e2df589f0ae641f015312 | [
"MIT"
] | 32 | 2017-09-12T23:52:52.000Z | 2020-12-09T07:13:24.000Z | Source/Api/Searcher/RandomSearcher.cpp | Fillo7/KTT | a0c252efb75a8366450e2df589f0ae641f015312 | [
"MIT"
] | 23 | 2017-05-11T14:38:45.000Z | 2021-02-03T13:45:14.000Z | Source/Api/Searcher/RandomSearcher.cpp | Fillo7/KTT | a0c252efb75a8366450e2df589f0ae641f015312 | [
"MIT"
] | 5 | 2017-11-06T12:40:05.000Z | 2020-06-16T13:11:24.000Z | #include <Api/Searcher/RandomSearcher.h>
namespace ktt
{
RandomSearcher::RandomSearcher() :
Searcher()
{}
void RandomSearcher::OnInitialize()
{
m_CurrentConfiguration = GetRandomConfiguration();
}
bool RandomSearcher::CalculateNextConfiguration([[maybe_unused]] const KernelResult& previousResult)
{
m_Cu... | 19.037037 | 100 | 0.772374 | Fillo7 |
efa7d8ab2e3d27b3e980e6de246c310ed2363167 | 1,151 | hpp | C++ | src/peerboot/istore.hpp | catenocrypt/peerboot-cpp | 2520cd6cf391d5554c0d072fc5d31414e161836a | [
"MIT"
] | 7 | 2019-11-06T09:01:08.000Z | 2022-01-24T00:08:18.000Z | src/peerboot/istore.hpp | catenocrypt/peerboot-cpp | 2520cd6cf391d5554c0d072fc5d31414e161836a | [
"MIT"
] | null | null | null | src/peerboot/istore.hpp | catenocrypt/peerboot-cpp | 2520cd6cf391d5554c0d072fc5d31414e161836a | [
"MIT"
] | 1 | 2021-01-16T17:52:24.000Z | 2021-01-16T17:52:24.000Z | #pragma once
#include "../include/peerboot.hpp"
#include <vector>
namespace pebo
{
/**
* Interface for Store, storing peer info
*/
class IStore
{
public:
/**
* Describes a stored peer
*/
struct PeerInfo
{
public:
pebo::service_t se... | 26.767442 | 157 | 0.582971 | catenocrypt |
efa949094b5bcaa4f4f069e37147c0aa1a53127a | 3,649 | hpp | C++ | Source/Jobrocket/Worker.hpp | jacobmilligan/JobRocket | 8f6a505c6e4e8fe0f13720dd93d8248ca0572b22 | [
"MIT"
] | 1 | 2020-09-18T16:51:57.000Z | 2020-09-18T16:51:57.000Z | Source/Jobrocket/Worker.hpp | jacobmilligan/JobRocket | 8f6a505c6e4e8fe0f13720dd93d8248ca0572b22 | [
"MIT"
] | null | null | null | Source/Jobrocket/Worker.hpp | jacobmilligan/JobRocket | 8f6a505c6e4e8fe0f13720dd93d8248ca0572b22 | [
"MIT"
] | null | null | null | //
// Worker.hpp
// Jobrocket
//
// --------------------------------------------------------------
//
// Created by
// Jacob Milligan on 11/12/2017
// Copyright (c) 2016 Jacob Milligan. All rights reserved.
//
#pragma once
#include "Jobrocket/Detail/FixedWorkStealingQueue.hpp"
#include "Jobrocket/Detail/RNG.hpp... | 26.064286 | 98 | 0.615237 | jacobmilligan |
efbb52c2d84b71d3b60d163e2b198cd9206ea35b | 745 | hpp | C++ | PiecesSrc/Helper.hpp | BRAVIKEN/IA_MiniChess_TP | ab3fb6bd521f708b3710a19263e4042c900a9880 | [
"MIT"
] | null | null | null | PiecesSrc/Helper.hpp | BRAVIKEN/IA_MiniChess_TP | ab3fb6bd521f708b3710a19263e4042c900a9880 | [
"MIT"
] | null | null | null | PiecesSrc/Helper.hpp | BRAVIKEN/IA_MiniChess_TP | ab3fb6bd521f708b3710a19263e4042c900a9880 | [
"MIT"
] | null | null | null | #ifndef HELPER_HPP
#define HELPER_HPP
#include <vector>
#include "../mymc.hpp"
#include "AllPieces.hpp"
#define WHITE 0
#define BLACK 1
class Helper {
public:
//Return 0 for White, 1 for Black or -1 for empty.
static int getColor(int x, int y, chess_board_t const& board);
/**
* Verify if color are... | 22.575758 | 92 | 0.70604 | BRAVIKEN |
efbe60dd516bd0f792d5ff244081514ed55529b1 | 5,781 | cpp | C++ | Src/Server/SceneOne.cpp | StavrosBizelis/NetworkDistributedDeferredShading | 07c03ce9b13bb5adb164cd4321b2bba284e49b4d | [
"MIT"
] | null | null | null | Src/Server/SceneOne.cpp | StavrosBizelis/NetworkDistributedDeferredShading | 07c03ce9b13bb5adb164cd4321b2bba284e49b4d | [
"MIT"
] | null | null | null | Src/Server/SceneOne.cpp | StavrosBizelis/NetworkDistributedDeferredShading | 07c03ce9b13bb5adb164cd4321b2bba284e49b4d | [
"MIT"
] | null | null | null | #include "Server/SceneOne.h"
SceneOne::SceneOne(Network::ServerControl& a_serverCtrl, AGraphicsEngine* a_graphics, const std::vector<std::shared_ptr<asio::ip::tcp::socket> >& a_clients, SceneControl::CameraSceneNode* a_camera, const unsigned int& a_numberOfLight)
: IServerSceneController(a_serverCtrl, a_graphics, a... | 32.477528 | 234 | 0.715274 | StavrosBizelis |
efc2eaa542cf7de7ed917dd15779f3d3e0d902a9 | 1,748 | cpp | C++ | Blue-Flame-Engine/Sandbox/Sandbox/Main.cpp | 21423236/Blue-Flame-Engine | cf26fbdb94d1338f04e57ba88f0bbfc8b77c969b | [
"MIT"
] | 1 | 2021-07-02T12:40:44.000Z | 2021-07-02T12:40:44.000Z | Blue-Flame-Engine/Sandbox/Sandbox/Main.cpp | 21423236/Blue-Flame-Engine | cf26fbdb94d1338f04e57ba88f0bbfc8b77c969b | [
"MIT"
] | null | null | null | Blue-Flame-Engine/Sandbox/Sandbox/Main.cpp | 21423236/Blue-Flame-Engine | cf26fbdb94d1338f04e57ba88f0bbfc8b77c969b | [
"MIT"
] | null | null | null | #include <BF/BlueFlame.h>
//#include <BF/Engine.h>
//#include <BF/Application/Window.h>
//#include <BF/Application/SceneManager.h>
//#include <BF/Platform/API/Vulkan/VKContext.h>
#include "_2DScene.h"
//#include "_3DScene.h"
//#include "_3DScene2.h"
//#include "InputTests.h"
//#include <windows.h>
//#include <string>... | 23.306667 | 191 | 0.688215 | 21423236 |
efc88be0cf46cde4eaebdafe7a9d373b739c11d0 | 5,246 | cpp | C++ | matrix/src/utils/Logger.cpp | Jarlene/Matrix | 7b2e07a46f8d0477243d49c76db575280096e247 | [
"Apache-2.0"
] | 2 | 2017-07-22T05:20:57.000Z | 2018-07-08T08:48:33.000Z | matrix/src/utils/Logger.cpp | Jarlene/Matrix | 7b2e07a46f8d0477243d49c76db575280096e247 | [
"Apache-2.0"
] | null | null | null | matrix/src/utils/Logger.cpp | Jarlene/Matrix | 7b2e07a46f8d0477243d49c76db575280096e247 | [
"Apache-2.0"
] | null | null | null | //
// Created by Jarlene on 2017/7/24.
//
#include "matrix/include/utils/Logger.h"
namespace matrix {
Logger::Logger(LogLevel level) {
this->level = level;
this->file = nullptr;
isKill = true;
}
Logger::Logger(std::string filename, LogLevel level) {
this->level = level;
... | 24.980952 | 88 | 0.506672 | Jarlene |
efc9ee1788b281495c002a83f7bbee5a5f4d350e | 11,396 | cpp | C++ | src/cluster.cpp | viniciusferrao/cloysterhpc | a7b51ce2e2110e21f2720a40d5b6a2c521158937 | [
"Apache-2.0"
] | 4 | 2021-10-10T22:38:54.000Z | 2022-03-03T01:13:44.000Z | src/cluster.cpp | viniciusferrao/cloysterhpc | a7b51ce2e2110e21f2720a40d5b6a2c521158937 | [
"Apache-2.0"
] | null | null | null | src/cluster.cpp | viniciusferrao/cloysterhpc | a7b51ce2e2110e21f2720a40d5b6a2c521158937 | [
"Apache-2.0"
] | 1 | 2021-10-30T20:29:27.000Z | 2021-10-30T20:29:27.000Z | /* This file contains just placeholder implementations for future reference.
* Everything here must be (re)factored.
*/
#ifdef __JETBRAINS_IDE__
#define _DEBUG_
#endif
#include "cluster.h"
#include "functions.h"
#include "headnode.h"
#include "services/xcat.h"
#include "services/log.h"
#include <iostream>
#include... | 34.11976 | 106 | 0.597403 | viniciusferrao |
efd1ce001b8793442b90b3c931181db52dd2ced1 | 1,271 | hpp | C++ | core/src/include/SimpleIterant.hpp | athelaf/nextsimdg | 557e45db6af2cc07d00b3228c2d46f87567fe755 | [
"Apache-2.0"
] | null | null | null | core/src/include/SimpleIterant.hpp | athelaf/nextsimdg | 557e45db6af2cc07d00b3228c2d46f87567fe755 | [
"Apache-2.0"
] | null | null | null | core/src/include/SimpleIterant.hpp | athelaf/nextsimdg | 557e45db6af2cc07d00b3228c2d46f87567fe755 | [
"Apache-2.0"
] | null | null | null | /*!
* @file SimpleIterant.hpp
* @date 12 Aug 2021
* @author Tim Spain <timothy.spain@nersc.no>
*/
#ifndef SRC_INCLUDE_SIMPLEITERANT_HPP
#define SRC_INCLUDE_SIMPLEITERANT_HPP
#include "Iterator.hpp"
namespace Nextsim {
//! A simple implementation of the Iterator::Iterant class.
class SimpleIterant : public Itera... | 29.55814 | 79 | 0.718332 | athelaf |
efd2e538a5591b740de6310eeee159167f8981cd | 522 | cpp | C++ | src/ofxWebsockets.cpp | sebleedelisle/PixelPhones | e654d1213bbb2a8cbd3ae3da05705f121adfc230 | [
"Unlicense"
] | 3 | 2015-11-17T03:54:21.000Z | 2021-08-20T14:19:34.000Z | src/ofxWebsockets.cpp | sebleedelisle/PixelPhones | e654d1213bbb2a8cbd3ae3da05705f121adfc230 | [
"Unlicense"
] | null | null | null | src/ofxWebsockets.cpp | sebleedelisle/PixelPhones | e654d1213bbb2a8cbd3ae3da05705f121adfc230 | [
"Unlicense"
] | 1 | 2021-08-20T14:19:35.000Z | 2021-08-20T14:19:35.000Z | #include "ofxWebsockets.h"
#include "ofMain.h"
ofxWebSocket::ofxWebSocket() {
}
ofxWebSocket::~ofxWebSocket() {
thread->join();
}
void ofxWebSocket::setup(string host, int port) {
worker.setup(host, port);
}
void ofxWebSocket::start() {
thread = new Poco::Thread();
thread->start(worker);
}
void ofxWebSocket::... | 16.83871 | 64 | 0.685824 | sebleedelisle |
efd2ef0c98ee66e5226dd7ee948873c866386713 | 28,146 | cc | C++ | ev/external/googleapis/home/ubuntu/saaras-io/falcon/build/external/googleapis/google/firestore/v1beta1/firestore.grpc.pb.cc | sergiorr/yastack | 17cdc12a52ea5869f429aa8ec421c3d1d25b32e7 | [
"Apache-2.0"
] | 91 | 2018-11-24T05:33:58.000Z | 2022-03-16T05:58:05.000Z | ev/external/googleapis/home/ubuntu/saaras-io/falcon/build/external/googleapis/google/firestore/v1beta1/firestore.grpc.pb.cc | sergiorr/yastack | 17cdc12a52ea5869f429aa8ec421c3d1d25b32e7 | [
"Apache-2.0"
] | 11 | 2019-06-02T23:50:17.000Z | 2022-02-04T23:58:56.000Z | ev/external/googleapis/home/ubuntu/saaras-io/falcon/build/external/googleapis/google/firestore/v1beta1/firestore.grpc.pb.cc | sergiorr/yastack | 17cdc12a52ea5869f429aa8ec421c3d1d25b32e7 | [
"Apache-2.0"
] | 18 | 2018-11-24T10:35:29.000Z | 2021-04-22T07:22:10.000Z | // Generated by the gRPC C++ plugin.
// If you make any local change, they will be lost.
// source: google/firestore/v1beta1/firestore.proto
#include "google/firestore/v1beta1/firestore.pb.h"
#include "google/firestore/v1beta1/firestore.grpc.pb.h"
#include <grpcpp/impl/codegen/async_stream.h>
#include <grpcpp/impl/co... | 74.263852 | 276 | 0.76057 | sergiorr |
efda8c9baa41d2f2968028d31ce812db276c8a77 | 1,485 | hpp | C++ | SimpleDB/src/core/utils/thread_share.hpp | caivao/SimpleDB | ff90245c5ffc96ea84cf046596d690866c1c8cb6 | [
"MIT"
] | 1 | 2021-01-05T17:01:31.000Z | 2021-01-05T17:01:31.000Z | SimpleDB/src/core/utils/thread_share.hpp | caivao/SimpleDB | ff90245c5ffc96ea84cf046596d690866c1c8cb6 | [
"MIT"
] | null | null | null | SimpleDB/src/core/utils/thread_share.hpp | caivao/SimpleDB | ff90245c5ffc96ea84cf046596d690866c1c8cb6 | [
"MIT"
] | null | null | null | //
// thread_share.hpp
// SimpleDB
//
// Created by lifeng on 2019/6/13.
// Copyright © 2019 feng. All rights reserved.
//
#ifndef thread_share_hpp
#define thread_share_hpp
#include <pthread.h>
namespace SDB {
/// 同线程下不同方法（函数）间数据共享
template <typename T>
class ThreadShare {
public:
Th... | 22.164179 | 79 | 0.474074 | caivao |
efe00012678c8dbcfc906bda2346eed07c8e57b4 | 609 | hh | C++ | examples/physics/FullCMS/Geant4/include/MyDetectorMessenger.hh | Geant-RnD/geant | ffff95e23547531f3254ada2857c062a31f33e8f | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | examples/physics/FullCMS/Geant4/include/MyDetectorMessenger.hh | Geant-RnD/geant | ffff95e23547531f3254ada2857c062a31f33e8f | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | examples/physics/FullCMS/Geant4/include/MyDetectorMessenger.hh | Geant-RnD/geant | ffff95e23547531f3254ada2857c062a31f33e8f | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null |
#ifndef MyDetectorMessenger_h
#define MyDetectorMessenger_h 1
#include "globals.hh"
#include "G4UImessenger.hh"
class MyDetectorConstruction;
class G4UIdirectory;
class G4UIcmdWithADoubleAndUnit;
class G4UIcmdWithAString;
class MyDetectorMessenger: public G4UImessenger {
public:
MyDetectorMessenger( MyDetectorC... | 19.645161 | 49 | 0.784893 | Geant-RnD |
eff3e0825c5fd4b2925c4f7b89a5b32cc78d2cf5 | 682 | cpp | C++ | SchoolItemManagement/Notice.cpp | mm477706421/SchoolItemManagement | 0fabaedc5d2512aa2818bebe567007db222c6a05 | [
"BSD-2-Clause"
] | null | null | null | SchoolItemManagement/Notice.cpp | mm477706421/SchoolItemManagement | 0fabaedc5d2512aa2818bebe567007db222c6a05 | [
"BSD-2-Clause"
] | null | null | null | SchoolItemManagement/Notice.cpp | mm477706421/SchoolItemManagement | 0fabaedc5d2512aa2818bebe567007db222c6a05 | [
"BSD-2-Clause"
] | null | null | null | #include "Notice.h"
#include<iostream>
Item Notice::getItem()
{
return this->item;
}
void Notice::setItem(Item it)
{
this->item = it;
}
bool Notice::setPrice(double p)
{
if (p > 0) {
this->price = p;
return true;
}
else
{
return false;
}
}
double Notice::getPrice()
{
retur... | 12.62963 | 52 | 0.57478 | mm477706421 |
eff9f29703d5f13e1914d22146f87fee0ea8d3fc | 136 | cpp | C++ | main.cpp | LeifMessinger/LScript | c720d0fedde59e1728ae20afa67e8e698a2bf918 | [
"Apache-2.0"
] | null | null | null | main.cpp | LeifMessinger/LScript | c720d0fedde59e1728ae20afa67e8e698a2bf918 | [
"Apache-2.0"
] | 1 | 2021-05-09T23:57:48.000Z | 2021-05-09T23:57:48.000Z | main.cpp | LeifMessinger/LScript | c720d0fedde59e1728ae20afa67e8e698a2bf918 | [
"Apache-2.0"
] | null | null | null | #include<iostream>
#include"LInterpereter.h"
int main(){ //Pipe in a .l file
L::Instance instance(std::cin); //Yup, it's that simple
}
| 22.666667 | 56 | 0.691176 | LeifMessinger |
effeff416389a6aea5bd1eb17e3d631a19dbbf8a | 669 | cpp | C++ | src/Engine/ResourceCursorSystem.cpp | Terryhata6/Mengine | dfe36fdc84d7398fbbbd199feffc46c6f157f1d4 | [
"MIT"
] | 39 | 2016-04-21T03:25:26.000Z | 2022-01-19T14:16:38.000Z | src/Engine/ResourceCursorSystem.cpp | Terryhata6/Mengine | dfe36fdc84d7398fbbbd199feffc46c6f157f1d4 | [
"MIT"
] | 23 | 2016-06-28T13:03:17.000Z | 2022-02-02T10:11:54.000Z | src/Engine/ResourceCursorSystem.cpp | Terryhata6/Mengine | dfe36fdc84d7398fbbbd199feffc46c6f157f1d4 | [
"MIT"
] | 14 | 2016-06-22T20:45:37.000Z | 2021-07-05T12:25:19.000Z | #include "ResourceCursorSystem.h"
#include "Kernel/Logger.h"
namespace Mengine
{
//////////////////////////////////////////////////////////////////////////
ResourceCursorSystem::ResourceCursorSystem()
{
}
//////////////////////////////////////////////////////////////////////////
Res... | 31.857143 | 79 | 0.342302 | Terryhata6 |
5608106db55d98bd0ced48eee1a7ba5e634852ef | 1,759 | hpp | C++ | luabind/detail/class_registry.hpp | nitrocaster/luabind-deboostified | 72cc6e5e9da61d8ba0cd6835937a827c2cbad652 | [
"BSL-1.0"
] | 3 | 2015-11-23T08:19:40.000Z | 2020-11-03T01:52:37.000Z | luabind/detail/class_registry.hpp | nitrocaster/luabind-deboostified | 72cc6e5e9da61d8ba0cd6835937a827c2cbad652 | [
"BSL-1.0"
] | 4 | 2020-10-18T23:11:14.000Z | 2021-01-01T20:54:49.000Z | luabind/detail/class_registry.hpp | nitrocaster/luabind-deboostified | 72cc6e5e9da61d8ba0cd6835937a827c2cbad652 | [
"BSL-1.0"
] | 1 | 2020-12-28T18:47:11.000Z | 2020-12-28T18:47:11.000Z | // Boost Software License http://www.boost.org/LICENSE_1_0.txt
// Copyright (c) 2003 The Luabind Authors
#pragma once
#include <map>
#include <luabind/config.hpp>
#include <luabind/open.hpp>
#include <luabind/typeid.hpp>
namespace luabind::detail
{
class class_rep;
extern char class_registry_tag;
stru... | 29.316667 | 69 | 0.66913 | nitrocaster |
560ac4f5da8ac712e317bcdf7e651716d0ca554c | 4,092 | cpp | C++ | src/binary_search_tree.cpp | Algorithms-and-Data-Structures-2022/binary-search-tree-assignment-ilyaskalimullinn | 58304b7453bebf1d38836873d3c61ad756689773 | [
"MIT"
] | null | null | null | src/binary_search_tree.cpp | Algorithms-and-Data-Structures-2022/binary-search-tree-assignment-ilyaskalimullinn | 58304b7453bebf1d38836873d3c61ad756689773 | [
"MIT"
] | null | null | null | src/binary_search_tree.cpp | Algorithms-and-Data-Structures-2022/binary-search-tree-assignment-ilyaskalimullinn | 58304b7453bebf1d38836873d3c61ad756689773 | [
"MIT"
] | null | null | null | #include "assignment/binary_search_tree.hpp"
namespace assignment {
BinarySearchTree::~BinarySearchTree() {
BinarySearchTree::Clear();
}
void BinarySearchTree::Insert(int key, int value) {
if (root_ == nullptr) {
root_ = new Node(key, value);
return;
}
insert(key, value, root_);
}... | 24.502994 | 82 | 0.579912 | Algorithms-and-Data-Structures-2022 |
561045eb5cbba1ce0ad144d20021863f795d0608 | 401 | cpp | C++ | test/2020/Day25PuzzleTests.cpp | MarkRDavison/AdventOfCode | 640ae6de76709367be8dfeb86b9f1f7d21908946 | [
"MIT"
] | null | null | null | test/2020/Day25PuzzleTests.cpp | MarkRDavison/AdventOfCode | 640ae6de76709367be8dfeb86b9f1f7d21908946 | [
"MIT"
] | null | null | null | test/2020/Day25PuzzleTests.cpp | MarkRDavison/AdventOfCode | 640ae6de76709367be8dfeb86b9f1f7d21908946 | [
"MIT"
] | null | null | null | #include <catch/catch.hpp>
#include <2020/Day25Puzzle.hpp>
namespace TwentyTwenty {
TEST_CASE("Day 25 Part 1 Example work", "[2020][Day25]") {
const std::vector<std::string> input = {
"5764801", "17807724"
};
Day25Puzzle puzzle{};
puzzle.setVerbose(true);
puzzle.setInputLines(input);
... | 20.05 | 59 | 0.653367 | MarkRDavison |
5615d83f45bdc0fcbc0e581d79c999166dd9aeb0 | 470 | cpp | C++ | src/QtAutonomy/Lore/Lore.cpp | Vladimir-Lin/QtAutonomy | 9a5978644d4db9a953b228ffdab6fb9323cd2901 | [
"MIT"
] | null | null | null | src/QtAutonomy/Lore/Lore.cpp | Vladimir-Lin/QtAutonomy | 9a5978644d4db9a953b228ffdab6fb9323cd2901 | [
"MIT"
] | null | null | null | src/QtAutonomy/Lore/Lore.cpp | Vladimir-Lin/QtAutonomy | 9a5978644d4db9a953b228ffdab6fb9323cd2901 | [
"MIT"
] | null | null | null | #include <qtautonomy.h>
N::Lore:: Lore ( void )
: Object ( 0 , Types::None )
{
}
N::Lore:: Lore (const Lore & lore)
{
ME = lore ;
}
N::Lore:: Lore (Lore & lore)
{
ME = lore ;
}
N::Lore:: Lore (const Object & object)
: Object (object )
{
}
N::Lore::~Lore (void)
{
}
... | 14.242424 | 49 | 0.480851 | Vladimir-Lin |
56179eda918c5e4435fe592c0622a4f39972b143 | 1,815 | hpp | C++ | CPP/src/lib/base/baseClasses.hpp | ilyagru/movsea | 77a6f27d364b5bfeb1262c0fe69fd32ae8cbd4dd | [
"MIT"
] | 2 | 2018-01-05T09:30:52.000Z | 2020-07-12T21:35:27.000Z | CPP/src/lib/base/baseClasses.hpp | ilyagru/movsea | 77a6f27d364b5bfeb1262c0fe69fd32ae8cbd4dd | [
"MIT"
] | null | null | null | CPP/src/lib/base/baseClasses.hpp | ilyagru/movsea | 77a6f27d364b5bfeb1262c0fe69fd32ae8cbd4dd | [
"MIT"
] | 3 | 2018-06-03T03:50:47.000Z | 2021-12-14T17:20:56.000Z | /*
* baseClasses.hpp
*
* Created on: Feb 10, 2017
* Author: victor
*/
#ifndef LIB_BASECLASSES_HPP_
#define LIB_BASECLASSES_HPP_
#include <vector>
#include <string>
#include <array>
#include <string>
#include <sstream>
#include <iostream>
#include "Constants.hpp"
typedef std::array<unsigned int,FrameSizeX... | 23.571429 | 63 | 0.749311 | ilyagru |
5619f3d7b75e501840fab479b02304604d042830 | 731 | cpp | C++ | LeetCode/ThousandOne/0074-search_2D_matrix.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0074-search_2D_matrix.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0074-search_2D_matrix.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | #include "leetcode.hpp"
/* 74. 搜索二维矩阵
编写一个高效的算法来判断 m x n 矩阵中，是否存在一个目标值。
该矩阵具有如下特性：
每行中的整数从左到右按升序排列。
每行的第一个整数大于前一行的最后一个整数。
示例 1:
输入:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
输出: true
示例 2:
输入:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
输... | 13.792453 | 53 | 0.538988 | Ginkgo-Biloba |
561a4bf8e679fc8ab2c5a2bda6cc004e4746bcc4 | 6,196 | cpp | C++ | shaders/src/FCurve.cpp | caron/sitoa | 52a0a4b35f51bccb6223a8206d04b40edc80071c | [
"Apache-2.0"
] | 34 | 2018-02-01T16:13:48.000Z | 2021-07-16T07:37:47.000Z | shaders/src/FCurve.cpp | 625002974/sitoa | 46b7de8e3cf2e2c4cbc6bc391f11181cbac1a589 | [
"Apache-2.0"
] | 72 | 2018-02-16T17:30:41.000Z | 2021-11-22T11:41:45.000Z | shaders/src/FCurve.cpp | 625002974/sitoa | 46b7de8e3cf2e2c4cbc6bc391f11181cbac1a589 | [
"Apache-2.0"
] | 15 | 2018-02-15T15:36:58.000Z | 2021-04-14T03:54:25.000Z | /************************************************************************************************************************************
Copyright 2017 Autodesk, Inc. 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 ... | 29.504762 | 134 | 0.595707 | caron |
561e07881c5832e67752c4c8eb9793418d62b7c1 | 4,548 | cc | C++ | src/pipeline.cc | zakerinasab/gfr | 306aec76c5601172b1bc4c143d5b36f7af6c4348 | [
"Apache-2.0"
] | 44 | 2020-09-11T15:43:24.000Z | 2022-03-26T07:39:57.000Z | src/pipeline.cc | zakerinasab/gfr | 306aec76c5601172b1bc4c143d5b36f7af6c4348 | [
"Apache-2.0"
] | 5 | 2020-09-25T18:06:00.000Z | 2022-01-18T21:39:22.000Z | src/pipeline.cc | zakerinasab/gfr | 306aec76c5601172b1bc4c143d5b36f7af6c4348 | [
"Apache-2.0"
] | 4 | 2020-09-25T17:20:57.000Z | 2021-04-11T18:56:30.000Z | /*
Copyright 2018 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 in writing, software
... | 35.255814 | 100 | 0.64292 | zakerinasab |
5622395cb7da8d9f30269a76effbd24963c7c64f | 4,773 | hxx | C++ | src/tutorials/c++/applications/denoise.hxx | burcin/opengm | a1b21eecb93c6c5a7b11ab312d26b1c98c55ff41 | [
"MIT"
] | 318 | 2015-01-07T15:22:02.000Z | 2022-01-22T10:10:29.000Z | src/tutorials/c++/applications/denoise.hxx | burcin/opengm | a1b21eecb93c6c5a7b11ab312d26b1c98c55ff41 | [
"MIT"
] | 89 | 2015-03-24T14:33:01.000Z | 2020-07-10T13:59:13.000Z | src/tutorials/c++/applications/denoise.hxx | burcin/opengm | a1b21eecb93c6c5a7b11ab312d26b1c98c55ff41 | [
"MIT"
] | 119 | 2015-01-13T08:35:03.000Z | 2022-03-01T01:49:08.000Z | #ifndef DENOISE_HXX
#define DENOISE_HXX
#include <vector>
#include <map>
#include <opengm/operations/adder.hxx>
#include <opengm/graphicalmodel/graphicalmodel.hxx>
#include <opengm/opengm.hxx>
#include <opengm/functions/truncated_squared_difference.hxx>
template<class VALUE_TYPE,class PARAM_TYPE>
class Denoise{
... | 31.82 | 110 | 0.67819 | burcin |
56251b8d5bf2cde77500e2975f6aeed49fba390e | 29,784 | cpp | C++ | tests/unit/legacy/test_pixie16app.cpp | xiallc/pixie_sdk | a6cf38b0a0d73a55955f4f906f789ee16eb848d4 | [
"Apache-2.0"
] | 2 | 2021-04-14T13:58:50.000Z | 2021-08-09T19:42:25.000Z | tests/unit/legacy/test_pixie16app.cpp | xiallc/pixie_sdk | a6cf38b0a0d73a55955f4f906f789ee16eb848d4 | [
"Apache-2.0"
] | 1 | 2021-08-31T10:32:07.000Z | 2021-09-03T15:03:00.000Z | tests/unit/legacy/test_pixie16app.cpp | xiallc/pixie_sdk | a6cf38b0a0d73a55955f4f906f789ee16eb848d4 | [
"Apache-2.0"
] | 1 | 2022-03-25T12:32:52.000Z | 2022-03-25T12:32:52.000Z | /* SPDX-License-Identifier: Apache-2.0 */
/*
* Copyright 2021 XIA LLC, All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICE... | 61.283951 | 123 | 0.433689 | xiallc |
56291e3882820af7582429cba48b6d807e3c9843 | 2,936 | cpp | C++ | src/outdatedCompiler.cpp | Our4514/SolidityCheck | e71e33cfb0d1942002fdd0e75a42ae1909cb6a2d | [
"MIT"
] | null | null | null | src/outdatedCompiler.cpp | Our4514/SolidityCheck | e71e33cfb0d1942002fdd0e75a42ae1909cb6a2d | [
"MIT"
] | null | null | null | src/outdatedCompiler.cpp | Our4514/SolidityCheck | e71e33cfb0d1942002fdd0e75a42ae1909cb6a2d | [
"MIT"
] | null | null | null | //
// Created by xiaofeng on 2020/6/6.
//
#include "outdatedCompiler.h"
#include <iostream>
outdatedCompiler::outdatedCompiler(const string _report_name, const vector<string> _content) {
report_name = _report_name;
content = _content;
OCName = "Outdated Compiler Version";
OtherOperation = "Using an ou... | 27.961905 | 94 | 0.578338 | Our4514 |
562eb07aa4c3d6f1413ceda9ef396dc391b8ffb5 | 2,599 | cpp | C++ | gs/src/v20191118/model/StartPublishStreamRequest.cpp | suluner/tencentcloud-sdk-cpp | a56c73cc3f488c4d1e10755704107bb15c5e000d | [
"Apache-2.0"
] | null | null | null | gs/src/v20191118/model/StartPublishStreamRequest.cpp | suluner/tencentcloud-sdk-cpp | a56c73cc3f488c4d1e10755704107bb15c5e000d | [
"Apache-2.0"
] | null | null | null | gs/src/v20191118/model/StartPublishStreamRequest.cpp | suluner/tencentcloud-sdk-cpp | a56c73cc3f488c4d1e10755704107bb15c5e000d | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
... | 27.357895 | 95 | 0.734129 | suluner |
562fb38df791926175ee474fd083530bcb6ff071 | 26,890 | hpp | C++ | engine/src/fonts/imguifontawesome.hpp | Volian0/dbe | 68cb496c86c3caa7a9d8d7ca098d3e5fc981605a | [
"Apache-2.0"
] | 14 | 2020-07-05T03:26:12.000Z | 2021-04-04T09:05:33.000Z | engine/src/fonts/imguifontawesome.hpp | Volian0/dbe | 68cb496c86c3caa7a9d8d7ca098d3e5fc981605a | [
"Apache-2.0"
] | 5 | 2018-11-14T20:50:23.000Z | 2018-11-14T20:57:55.000Z | engine/src/fonts/imguifontawesome.hpp | Volian0/dbe | 68cb496c86c3caa7a9d8d7ca098d3e5fc981605a | [
"Apache-2.0"
] | 3 | 2021-01-20T08:33:50.000Z | 2021-01-24T07:11:55.000Z | // Generated by https://github.com/juliettef/IconFontCppHeaders script GenerateIconFontCppHeaders.py for language C++11
// from https://raw.githubusercontent.com/ForkAwesome/Fork-Awesome/master/src/icons/icons.yml
// for use with https://github.com/ForkAwesome/Fork-Awesome/blob/master/fonts/forkawesome-webfont.ttf
#pra... | 37.399166 | 119 | 0.812495 | Volian0 |
563a80f833bc8fad7b8798cf165725f1f604c288 | 1,306 | hpp | C++ | include/broked/socket.hpp | darrnshn/conga | dbae5a93f130d38defa900d41aca2606e4a7527d | [
"MIT"
] | 1 | 2019-03-01T17:22:51.000Z | 2019-03-01T17:22:51.000Z | include/broked/socket.hpp | darrnshn/conga | dbae5a93f130d38defa900d41aca2606e4a7527d | [
"MIT"
] | null | null | null | include/broked/socket.hpp | darrnshn/conga | dbae5a93f130d38defa900d41aca2606e4a7527d | [
"MIT"
] | null | null | null | #pragma once
#include "message.hpp"
#include "transport.hpp"
#include <zmq.hpp>
namespace bd
{
/*! \p socket is the main interface between a client and a broked server.
* It allows a client to send events to the server, which are then handled by
* other clients.
*/
class socket
{
public:
/*! Sends an event t... | 21.409836 | 78 | 0.665391 | darrnshn |
563ce7b415e7410848391e5fa0fce122b9da673c | 577 | hpp | C++ | graph/dfs.hpp | arekolek/MaxIST | 6a8b49152cfbf34c1c2728f64b1457a23824fe0d | [
"MIT"
] | null | null | null | graph/dfs.hpp | arekolek/MaxIST | 6a8b49152cfbf34c1c2728f64b1457a23824fe0d | [
"MIT"
] | null | null | null | graph/dfs.hpp | arekolek/MaxIST | 6a8b49152cfbf34c1c2728f64b1457a23824fe0d | [
"MIT"
] | null | null | null | // (C) 2014 Arek Olek
#pragma once
#include <vector>
#include <boost/graph/adjacency_list.hpp>
template <class Graph, class Tree>
void visit(Graph const & G, unsigned v, std::vector<bool>& discovered, Tree& T) {
discovered[v] = true;
for(auto w : range(adjacent_vertices(v, G))) {
if(!discovered[w]) {
... | 21.37037 | 81 | 0.649913 | arekolek |
563e56048f53805d2201ede8c2998475d1744f46 | 6,701 | cpp | C++ | src/13.blinn_phong_lighting/blinn_phong_lighting.cpp | daozhangXDZ/OpenGLES_Examples | 9266842fbd0ae899446b6ccda9cd63eeeaf1451f | [
"MIT"
] | 248 | 2019-06-04T16:46:24.000Z | 2022-02-13T11:21:14.000Z | src/13.blinn_phong_lighting/blinn_phong_lighting.cpp | daozhangXDZ/OpenGLES_Examples | 9266842fbd0ae899446b6ccda9cd63eeeaf1451f | [
"MIT"
] | null | null | null | src/13.blinn_phong_lighting/blinn_phong_lighting.cpp | daozhangXDZ/OpenGLES_Examples | 9266842fbd0ae899446b6ccda9cd63eeeaf1451f | [
"MIT"
] | 40 | 2019-07-18T09:59:22.000Z | 2021-09-17T13:00:05.000Z | #include <examplebase.h>
#include <mesh.h>
#include <material.h>
using namespace es;
class Example final : public ExampleBase
{
public:
std::vector<std::shared_ptr<Mesh>> cubes;
std::shared_ptr<Material> cubeMat;
Example()
{
title = "blinn phong lighting";
settings.vsync = true;
defaultClearColor = glm::ve... | 36.418478 | 108 | 0.577824 | daozhangXDZ |
564045965af71c5bd9e71124462995f03c941f03 | 1,499 | hpp | C++ | Source/OptionParser/Parser.hpp | chaos0x8/cpp-common | 6255ee90852ce6cee8637ad96a77ef203c33ead3 | [
"MIT"
] | null | null | null | Source/OptionParser/Parser.hpp | chaos0x8/cpp-common | 6255ee90852ce6cee8637ad96a77ef203c33ead3 | [
"MIT"
] | null | null | null | Source/OptionParser/Parser.hpp | chaos0x8/cpp-common | 6255ee90852ce6cee8637ad96a77ef203c33ead3 | [
"MIT"
] | null | null | null | #pragma once
#include "Option.hpp"
#include <memory>
#include <string>
#include <vector>
namespace Common::OptionParser {
struct Parser {
using size_type = size_t;
using value_type = std::string;
using iterator = std::vector<value_type>::const_iterator;
using const_iterator = std::vector<value_type>... | 26.767857 | 78 | 0.651101 | chaos0x8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.