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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
65ef1b7788fdb9915b2b22718e100afcb738eff3 | 1,812 | cpp | C++ | src/technique/main.cpp | ref2401/cg | 4654377f94fe54945c33156911ca25e807c96236 | [
"MIT"
] | 2 | 2019-04-02T14:19:01.000Z | 2021-05-27T13:42:20.000Z | src/technique/main.cpp | ref2401/cg | 4654377f94fe54945c33156911ca25e807c96236 | [
"MIT"
] | 4 | 2016-11-05T14:17:14.000Z | 2017-03-30T15:03:37.000Z | src/technique/main.cpp | ref2401/cg | 4654377f94fe54945c33156911ca25e807c96236 | [
"MIT"
] | null | null | null | #include <memory>
#include <sstream>
#include <utility>
#include <windows.h>
#include "cg/base/base.h"
#include "cg/base/math.h"
#include "cg/sys/app.h"
#include "technique/deferred_lighting/deferred_lighting.h"
#include "technique/fur_simulation/fur_simulation_opengl.h"
#include "technique/parallax_occlusion_... | 30.711864 | 99 | 0.6766 | ref2401 |
65f84ea98358c166790090ef82943551625efb91 | 1,457 | cpp | C++ | src/pizza_delivery.cpp | ltowarek/pizza-delivery | 674d2e8fb671abc466c9a6a16e2fd79a6205cf20 | [
"MIT"
] | null | null | null | src/pizza_delivery.cpp | ltowarek/pizza-delivery | 674d2e8fb671abc466c9a6a16e2fd79a6205cf20 | [
"MIT"
] | null | null | null | src/pizza_delivery.cpp | ltowarek/pizza-delivery | 674d2e8fb671abc466c9a6a16e2fd79a6205cf20 | [
"MIT"
] | null | null | null | #include "pizza_delivery.h"
int pizzadelivery::PizzaDelivery::TotalDeliveryCost(const int size_x,
const int size_y,
const std::vector<int> &grid) const {
auto output = int{0};
for (int y = 0; y < size_y; ++y) {... | 34.690476 | 89 | 0.444749 | ltowarek |
5a0204add9076f9a0f4e4aa29fb039ed9ca099d8 | 2,157 | cpp | C++ | src/dHRU_interface_to_R.cpp | petrmaca/dHRUM | 5ef85f199ed5a926035d01fec264303bbbef27ac | [
"MIT"
] | null | null | null | src/dHRU_interface_to_R.cpp | petrmaca/dHRUM | 5ef85f199ed5a926035d01fec264303bbbef27ac | [
"MIT"
] | 6 | 2021-08-19T07:31:05.000Z | 2021-09-16T19:32:53.000Z | src/dHRU_interface_to_R.cpp | petrmaca/dHRUM | 5ef85f199ed5a926035d01fec264303bbbef27ac | [
"MIT"
] | null | null | null | #include <Rcpp.h>
#include "dHRUM.h"
//' Initialization of dHRU pointer to a dHRUM
//'
//' Creates pointer instance of dHRUM for the catchment.
//' initializes a dimension of dHRUM controled by the number of single Hru, areas of all single Hrus,
//' and ID's of all single Hrus.
//'
//' @param dimdHru a single \code{nu... | 41.480769 | 113 | 0.675012 | petrmaca |
5a02c1cdb8d55c7f08d701b6d0869ada1e2ecec8 | 784 | cpp | C++ | src/Strategy.cpp | maxvu/bjsim4 | 944811eafdbe6a088d9190e92f6108c28ba7b972 | [
"MIT"
] | null | null | null | src/Strategy.cpp | maxvu/bjsim4 | 944811eafdbe6a088d9190e92f6108c28ba7b972 | [
"MIT"
] | null | null | null | src/Strategy.cpp | maxvu/bjsim4 | 944811eafdbe6a088d9190e92f6108c28ba7b972 | [
"MIT"
] | null | null | null | #include "Strategy.hpp"
#include "Seat.hpp"
#include "Hand.hpp"
#include <string>
namespace bjsim4 {
double DealerStrategy::decideInsurance (
const Seat & seat
) {
return 0.0;
}
double DealerStrategy::decideBet (
const Seat & seat
) {
return 0.0;
}
double DealerStrategy::decideSidebet (
const S... | 17.818182 | 49 | 0.645408 | maxvu |
5a06b3b2e6a811a4af51a46ee206619fc49c21c1 | 21,235 | hpp | C++ | src/Ystring/Utf/Utf16WChars.hpp | wvffle/Ystring | a1ee9da1e433a2e74e432da6834638d547265126 | [
"BSD-2-Clause"
] | null | null | null | src/Ystring/Utf/Utf16WChars.hpp | wvffle/Ystring | a1ee9da1e433a2e74e432da6834638d547265126 | [
"BSD-2-Clause"
] | 1 | 2021-02-28T12:46:55.000Z | 2021-03-03T20:58:14.000Z | src/Ystring/Utf/Utf16WChars.hpp | wvffle/Ystring | a1ee9da1e433a2e74e432da6834638d547265126 | [
"BSD-2-Clause"
] | 1 | 2021-02-28T13:02:43.000Z | 2021-02-28T13:02:43.000Z | //****************************************************************************
// Copyright © 2015 Jan Erik Breimo. All rights reserved.
// Created by Jan Erik Breimo on 2015-07-30
//
// This file is distributed under the Simplified BSD License.
// License text is included with the source distribution.
//**************... | 60.498575 | 78 | 0.652837 | wvffle |
5a0a154003aa0708028043afe8b398252241bc52 | 4,034 | cpp | C++ | src/ped-hi-main.cpp | yp/Heu-MCHC | 30c4a5e189c7ab67d82357d2c8a98833a556345a | [
"BSD-3-Clause"
] | 1 | 2020-06-30T04:39:34.000Z | 2020-06-30T04:39:34.000Z | src/ped-hi-main.cpp | yp/Heu-MCHC | 30c4a5e189c7ab67d82357d2c8a98833a556345a | [
"BSD-3-Clause"
] | null | null | null | src/ped-hi-main.cpp | yp/Heu-MCHC | 30c4a5e189c7ab67d82357d2c8a98833a556345a | [
"BSD-3-Clause"
] | null | null | null | /**
*
*
* Heu-MCHC
*
* A fast and accurate heuristic algorithm for the haplotype inference
* problem on pedigree data with recombinations and mutations
*
* Copyright (C) 2009,2010,2011 Yuri PIROLA
*
* Distributed under the terms of the GNU General Public License (GPL)
*
*
* T... | 28.20979 | 98 | 0.658651 | yp |
5a0af5da6763ec46d135ba38bdeefe44148cd1b6 | 59,121 | cpp | C++ | morph.cpp | 1Hyena/atomorph | bea16cbf810d153072d3c2d7632341e6ead3632e | [
"MIT"
] | 2 | 2019-11-26T04:46:27.000Z | 2020-12-24T06:04:31.000Z | morph.cpp | 1Hyena/atomorph | bea16cbf810d153072d3c2d7632341e6ead3632e | [
"MIT"
] | 1 | 2018-08-20T23:35:21.000Z | 2018-08-21T07:50:55.000Z | morph.cpp | 1Hyena/atomorph | bea16cbf810d153072d3c2d7632341e6ead3632e | [
"MIT"
] | null | null | null | /*
* See Copyright Notice in atomorph.h
*/
#include "atomorph.h"
namespace am {
morph::morph() {
std::default_random_engine e(0);
e1 = e;
}
morph::~morph() {
clear();
}
void morph::clear() {
while (!frames.empty()) {
frame f = frames.begin()->second;
while (!f.blobs.empty()... | 37.560991 | 132 | 0.457266 | 1Hyena |
5a0e557795694871014b66568bf27061727b462e | 1,981 | cpp | C++ | mr.Sadman/Classes/GameAct/Objects/Physical/Explosion.cpp | 1pkg/dump | 0ee579cb6a97ae64d5367cc624b2407d7d4b1c7b | [
"MIT"
] | null | null | null | mr.Sadman/Classes/GameAct/Objects/Physical/Explosion.cpp | 1pkg/dump | 0ee579cb6a97ae64d5367cc624b2407d7d4b1c7b | [
"MIT"
] | 3 | 2020-12-11T10:01:27.000Z | 2022-02-13T22:12:05.000Z | mr.Sadman/Classes/GameAct/Objects/Tech/Explosion.cpp | 1pkg/dump | 0ee579cb6a97ae64d5367cc624b2407d7d4b1c7b | [
"MIT"
] | null | null | null | #include "Explosion.hpp"
#include "Game/Levels/Chunk.hpp"
namespace Objects
{
namespace Tech
{
Explosion::Explosion()
: Stream( Direction::Empty )
{
}
void
Explosion::initialize()
{
Stream::initialize();
_particle->setStartColor( cocos2d::Color4F::RED );
_particle->setEndColor( cocos2d::Col... | 22.770115 | 99 | 0.639071 | 1pkg |
5a0f4c35866219242e694614390440b7b6d7b308 | 97 | cpp | C++ | src/helloworld_cli/lib.cpp | qrealka/OTUS_CPP | 900f793c2cc148932213b0f12fc54834254f2b33 | [
"BSL-1.0"
] | 1 | 2022-02-24T15:21:23.000Z | 2022-02-24T15:21:23.000Z | src/helloworld_cli/lib.cpp | qrealka/OTUS_CPP | 900f793c2cc148932213b0f12fc54834254f2b33 | [
"BSL-1.0"
] | null | null | null | src/helloworld_cli/lib.cpp | qrealka/OTUS_CPP | 900f793c2cc148932213b0f12fc54834254f2b33 | [
"BSL-1.0"
] | null | null | null | #include "lib.h"
#include "version.h"
unsigned version()
{
return PROJECT_VERSION_PATCH;
}
| 10.777778 | 33 | 0.701031 | qrealka |
5a131bdaca85bb9c307ae23f1cc9a27c5adc7973 | 2,228 | cpp | C++ | src/lua/functions/core/libs/result_functions.cpp | Waclaw-I/BagnoOTS | dbeb04322698ecdb795eba196872815b36ca134f | [
"MIT"
] | null | null | null | src/lua/functions/core/libs/result_functions.cpp | Waclaw-I/BagnoOTS | dbeb04322698ecdb795eba196872815b36ca134f | [
"MIT"
] | null | null | null | src/lua/functions/core/libs/result_functions.cpp | Waclaw-I/BagnoOTS | dbeb04322698ecdb795eba196872815b36ca134f | [
"MIT"
] | null | null | null | /**
* Canary - A free and open-source MMORPG server emulator
* Copyright (C) 2021 OpenTibiaBR <opentibiabr@outlook.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 o... | 28.935065 | 81 | 0.72711 | Waclaw-I |
5a13282259899c9df6f4b6007e53d2d08adae39a | 1,629 | hpp | C++ | cppcache/src/EvictionThread.hpp | austxcodemonkey/geode-native | a816ac99cbbac557629686cb2542fdc74d464338 | [
"Apache-2.0"
] | null | null | null | cppcache/src/EvictionThread.hpp | austxcodemonkey/geode-native | a816ac99cbbac557629686cb2542fdc74d464338 | [
"Apache-2.0"
] | 1 | 2021-02-23T12:27:00.000Z | 2021-02-23T12:27:00.000Z | cppcache/src/EvictionThread.hpp | isabella232/geode-native | 0d9a99d5e0632de62df17921950cf3f6640efb33 | [
"Apache-2.0"
] | null | null | null | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... | 26.274194 | 75 | 0.750153 | austxcodemonkey |
5a1667fe6fe1ae6f5aeb07f962d0fbd12e26b77e | 857 | cpp | C++ | GameEngine/GameEngine/src/graphics/filter/FilterArray.cpp | SamCooksley/GameEngine | 3c32eba545428c8aa3227abcb815d8d799ab92d9 | [
"Apache-2.0"
] | null | null | null | GameEngine/GameEngine/src/graphics/filter/FilterArray.cpp | SamCooksley/GameEngine | 3c32eba545428c8aa3227abcb815d8d799ab92d9 | [
"Apache-2.0"
] | null | null | null | GameEngine/GameEngine/src/graphics/filter/FilterArray.cpp | SamCooksley/GameEngine | 3c32eba545428c8aa3227abcb815d8d799ab92d9 | [
"Apache-2.0"
] | null | null | null | #include "stdafx.h"
#include "FilterArray.h"
#include "..\Graphics.h"
namespace engine {
namespace graphics {
FilterArray::FilterArray(const std::shared_ptr<Shader> & _shader) :
Material(_shader),
m_srcUnit(0)
{
setTexture<Texture2DArray>("src", nullptr);
getTextureUnit("src", &m_srcUnit);
}
... | 20.902439 | 71 | 0.64294 | SamCooksley |
5a200bd60c68ec8dff80dfa1e7b369dd0000ed43 | 366 | cpp | C++ | Problem Set Volumes/Volume 1/146 - ID Codes.cpp | Md-Shamim-Ahmmed/UVA-Online-Judge-Problems-Solution | 2334edb153a134aebb883b57d8b4faf0cb859331 | [
"MIT"
] | null | null | null | Problem Set Volumes/Volume 1/146 - ID Codes.cpp | Md-Shamim-Ahmmed/UVA-Online-Judge-Problems-Solution | 2334edb153a134aebb883b57d8b4faf0cb859331 | [
"MIT"
] | null | null | null | Problem Set Volumes/Volume 1/146 - ID Codes.cpp | Md-Shamim-Ahmmed/UVA-Online-Judge-Problems-Solution | 2334edb153a134aebb883b57d8b4faf0cb859331 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
#include <iomanip>
#include <algorithm>
using namespace std;
bool ans (string& s) {
if(next_permutation(s.begin(), s.end()))
return true;
else
return false;
}
int main()
{
string str;
while (cin >> str && str !="#") {
if (ans(str))
cout << str << endl;
else
co... | 14.076923 | 41 | 0.601093 | Md-Shamim-Ahmmed |
5a23cca0ad1422c9a5b3c3516c6af534eab25b4c | 488 | cpp | C++ | cpp14faqs/code/c++14/plus.cpp | ancientscience/ancientscience.github.io | 2c8e3c6a8017164fd86fabaaa3343257cea54405 | [
"MIT"
] | null | null | null | cpp14faqs/code/c++14/plus.cpp | ancientscience/ancientscience.github.io | 2c8e3c6a8017164fd86fabaaa3343257cea54405 | [
"MIT"
] | null | null | null | cpp14faqs/code/c++14/plus.cpp | ancientscience/ancientscience.github.io | 2c8e3c6a8017164fd86fabaaa3343257cea54405 | [
"MIT"
] | null | null | null | #include <algorithm>
#include <iostream>
#include <iterator>
#include <ostream>
#include <set>
#include <string>
#include <vector>
int main()
{
std::vector<const char *> v {"3", "2", "1"};
std::set<std::string, std::greater<>> s {"a", "aaa", "aa"};
std::vector<std::string> dest;
std::transform(v.be... | 19.52 | 63 | 0.557377 | ancientscience |
5a23d113720bf4bb11f6658ad9a1c9beab7269f0 | 7,784 | cpp | C++ | apps/BlockDef/blockObDot.cpp | assignonward/aosuite | 243771d237970fe1175aaabc7d8d22f691076b6b | [
"MIT"
] | null | null | null | apps/BlockDef/blockObDot.cpp | assignonward/aosuite | 243771d237970fe1175aaabc7d8d22f691076b6b | [
"MIT"
] | null | null | null | apps/BlockDef/blockObDot.cpp | assignonward/aosuite | 243771d237970fe1175aaabc7d8d22f691076b6b | [
"MIT"
] | 1 | 2018-08-11T20:39:07.000Z | 2018-08-11T20:39:07.000Z | /* MIT License
*
* Copyright (c) 2021 Assign Onward
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modif... | 40.123711 | 125 | 0.609198 | assignonward |
5a25f2ebed44139167fd87cf14474d33f873a798 | 1,571 | cpp | C++ | src/rt/api_input.cpp | Thecontrarian/Rosebud | 29f57a4acace2b75c00d83099e678582257cc72e | [
"MIT"
] | null | null | null | src/rt/api_input.cpp | Thecontrarian/Rosebud | 29f57a4acace2b75c00d83099e678582257cc72e | [
"MIT"
] | 1 | 2016-12-27T02:32:55.000Z | 2016-12-27T02:38:41.000Z | src/rt/api_input.cpp | Thecontrarian/Rosebud | 29f57a4acace2b75c00d83099e678582257cc72e | [
"MIT"
] | null | null | null | #include "rose.h"
rose_api_error rose_rt_base::mouse(int16_t* x, int16_t* y) {
int16_t* pointer = (int16_t*) pointer_positions.begin;
*x = pointer[20];
*y = pointer[21];
return ROSE_API_ERR_NONE;
}
rose_api_error rose_rt_base::btn(uint8_t idx, bool* res) {
*res = rose_get_bit(btn_states.begin, idx... | 30.803922 | 68 | 0.705283 | Thecontrarian |
5a262eb94b2591e0cafb718ae825727767c2bdf0 | 1,963 | cpp | C++ | test/vector/multi_indexer.cpp | BryanFlynt/xstd | 4c11f614b828a93e20cb35903c179cfd52fef47e | [
"Apache-2.0"
] | null | null | null | test/vector/multi_indexer.cpp | BryanFlynt/xstd | 4c11f614b828a93e20cb35903c179cfd52fef47e | [
"Apache-2.0"
] | null | null | null | test/vector/multi_indexer.cpp | BryanFlynt/xstd | 4c11f614b828a93e20cb35903c179cfd52fef47e | [
"Apache-2.0"
] | null | null | null | /**
* \file multi_indexer.cpp
* \author Bryan Flynt
* \date Jan 18, 2021
* \copyright Copyright (C) 2021 Bryan Flynt - All Rights Reserved
*/
#include "catch.hpp"
#include "xstd/detail/vector/multi_indexer.hpp"
#include <iostream>
TEST_CASE("MultiIndexer", "[default]") {
using namespace xst... | 19.058252 | 67 | 0.537952 | BryanFlynt |
5a264934b35655724a893142fe948447957b98b2 | 1,807 | cpp | C++ | src/cage/controller.cpp | pancpp/cage | 3a4eb5e3b6d40e6dee8e61bf984c83bf336e5999 | [
"BSL-1.0"
] | null | null | null | src/cage/controller.cpp | pancpp/cage | 3a4eb5e3b6d40e6dee8e61bf984c83bf336e5999 | [
"BSL-1.0"
] | null | null | null | src/cage/controller.cpp | pancpp/cage | 3a4eb5e3b6d40e6dee8e61bf984c83bf336e5999 | [
"BSL-1.0"
] | null | null | null | /**
* COPYRIGHT (C) 2020 Leyuan Pan ALL RIGHTS RESERVED.
*
* @brief HTTP and WEBSOCKET controller.
* @author Leyuan Pan
* @date Oct 04, 2020
*/
#include "cage/controller.hpp"
namespace cage {
void Controller::RegisterRouter(RouterPtr p_router) {
router_vec_.push_back(std::move(p_router));
}
Controller::HttpV... | 24.418919 | 76 | 0.6342 | pancpp |
5a2977a9c42ccbdb70e1ca35f439046c475c7952 | 2,120 | hpp | C++ | src/detail/ReadConfig.hpp | epicbrownie/Epic | c54159616b899bb24c6d59325d582e73f2803ab6 | [
"MIT"
] | null | null | null | src/detail/ReadConfig.hpp | epicbrownie/Epic | c54159616b899bb24c6d59325d582e73f2803ab6 | [
"MIT"
] | 29 | 2016-08-01T14:50:12.000Z | 2017-12-17T20:28:27.000Z | src/detail/ReadConfig.hpp | epicbrownie/Epic | c54159616b899bb24c6d59325d582e73f2803ab6 | [
"MIT"
] | null | null | null | //////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2016 Ronnie Brohn (EpicBrownie)
//
// Distributed under The MIT License (MIT).
// (See accompanying file License.txt or copy at
// https://opensource.org/licens... | 28.648649 | 90 | 0.546698 | epicbrownie |
5a2d74cd33cf865f27bbb51c260d8d8bb2bb349a | 7,103 | cpp | C++ | ivb-3-14/Korotkov-D.A/lab.02.11.cpp | bykovskyy/2014 | 474c6eb940978d4f323ef4dc2eac8e0360f19612 | [
"BSD-2-Clause"
] | null | null | null | ivb-3-14/Korotkov-D.A/lab.02.11.cpp | bykovskyy/2014 | 474c6eb940978d4f323ef4dc2eac8e0360f19612 | [
"BSD-2-Clause"
] | null | null | null | ivb-3-14/Korotkov-D.A/lab.02.11.cpp | bykovskyy/2014 | 474c6eb940978d4f323ef4dc2eac8e0360f19612 | [
"BSD-2-Clause"
] | null | null | null | /**Коротков Даниил*/
/**Задание 11*/
#pragma warning(disable : 4996)
#include <cstdio>
#include <cstdlib>
#include <cstring>
static double **
__loadMatrix(
const char * const szFileName,
int * piRows,
int * piCols);
static void
__destroyMatrix(double **pMatrix, int rows, int cols);
static int
__exception... | 27.214559 | 79 | 0.420245 | bykovskyy |
5a2dc1041fea245f0df2fa5b0fa35a25b2e397f3 | 1,121 | cpp | C++ | DataStructure/CS/4_1_vector.cpp | Leon-Francis/NCEPU-CS-COURSES | 65a186c9f5dc88fef4eb3fd7a550500c0d27b38c | [
"Apache-2.0"
] | 1 | 2021-03-31T03:04:52.000Z | 2021-03-31T03:04:52.000Z | DataStructure/CS/4_1_vector.cpp | Leon-Francis/NCEPU-CS-COURSES | 65a186c9f5dc88fef4eb3fd7a550500c0d27b38c | [
"Apache-2.0"
] | null | null | null | DataStructure/CS/4_1_vector.cpp | Leon-Francis/NCEPU-CS-COURSES | 65a186c9f5dc88fef4eb3fd7a550500c0d27b38c | [
"Apache-2.0"
] | 1 | 2021-09-03T13:33:51.000Z | 2021-09-03T13:33:51.000Z | #include<iostream>
#include<vector>
using namespace std;
int main()
{
int numberA,numberB;
cin>>numberA>>numberB;
int number=numberA+numberB;
vector <vector<int>> a;
a.resize(number,vector<int>(3));
for(int i=0;i<numberA;i++){
for(int j=0;j<3;j++){
cin>>a[i][j];
}
... | 20.759259 | 46 | 0.4157 | Leon-Francis |
5a2fc9ce78df9f238aadae0cd56fb31fc97b0daa | 2,023 | hpp | C++ | Engine/Code/Engine/Math/IntVec2.hpp | sam830917/TenNenDemon | a5f60007b73cccc6af8675c7f3dec597008dfdb4 | [
"MIT"
] | null | null | null | Engine/Code/Engine/Math/IntVec2.hpp | sam830917/TenNenDemon | a5f60007b73cccc6af8675c7f3dec597008dfdb4 | [
"MIT"
] | null | null | null | Engine/Code/Engine/Math/IntVec2.hpp | sam830917/TenNenDemon | a5f60007b73cccc6af8675c7f3dec597008dfdb4 | [
"MIT"
] | null | null | null | #pragma once
struct IntVec2
{
public:
int x = 0;
int y = 0;
static const IntVec2 ZERO;
static const IntVec2 ONE;
public:
// Construction/Destruction
~IntVec2() = default;
IntVec2() = default;
IntVec2( const IntVec2& copyFrom );
explicit IntVec2( int initialX, int initialY );
// Accessors (const methods)
... | 38.903846 | 96 | 0.67474 | sam830917 |
5a31ac6c558ce7d433cac63a29a1f0f05a16ca29 | 764 | hpp | C++ | src/threshold.hpp | minijackson/INF4710-TP3 | 7285ee279e65e0d76a752d0f1be936ca79638473 | [
"MIT"
] | null | null | null | src/threshold.hpp | minijackson/INF4710-TP3 | 7285ee279e65e0d76a752d0f1be936ca79638473 | [
"MIT"
] | null | null | null | src/threshold.hpp | minijackson/INF4710-TP3 | 7285ee279e65e0d76a752d0f1be936ca79638473 | [
"MIT"
] | null | null | null | #pragma once
#include "cl_mat.hpp"
#include <opencv2/opencv.hpp>
enum LightnessComponent { intensity, value, lightness, luma, luma_rounded };
cv::Mat_<uint8_t> threshold(cv::Mat_<cv::Vec4b> const& input,
uint8_t limit,
LightnessComponent component = intensity)... | 36.380952 | 82 | 0.633508 | minijackson |
5a31bad41c7e164b66c9bf4f99d81b3af3ae510a | 600 | cpp | C++ | 1000/70/1076c.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | 1 | 2020-07-03T15:55:52.000Z | 2020-07-03T15:55:52.000Z | 1000/70/1076c.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | null | null | null | 1000/70/1076c.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | 3 | 2020-10-01T14:55:28.000Z | 2021-07-11T11:33:58.000Z | #include <iostream>
#include <cmath>
void no_answer()
{
std::cout << "N" << '\n';
}
void answer(double x, double y)
{
std::cout << "Y" << std::fixed << ' ' << x << ' ' << y << '\n';
}
void solve(unsigned d)
{
if (d == 0)
return answer(0, 0);
if (d < 4)
return no_answer();
const... | 12.244898 | 67 | 0.456667 | actium |
5a32685be23db614797fdf5f5022934b5b331cb2 | 5,360 | cpp | C++ | src/PyZPK/utils/utils.cpp | gargarchit/PyZPK | 682c20efc6ae5d7bf705f9fcbcbf003d9e382412 | [
"Apache-2.0"
] | 4 | 2020-05-21T13:55:33.000Z | 2020-08-17T00:59:29.000Z | src/PyZPK/utils/utils.cpp | gargarchit/PyZPK | 682c20efc6ae5d7bf705f9fcbcbf003d9e382412 | [
"Apache-2.0"
] | 1 | 2020-07-21T07:37:59.000Z | 2020-07-21T07:39:14.000Z | src/PyZPK/utils/utils.cpp | gargarchit/PyZPK | 682c20efc6ae5d7bf705f9fcbcbf003d9e382412 | [
"Apache-2.0"
] | null | null | null | #include <pybind11/pybind11.h>
#include <pybind11/stl.h>
#include <pybind11/stl_bind.h>
#include <pybind11/cast.h>
#include <pybind11/complex.h>
#include <pybind11/operators.h>
#include <vector>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <limits>
#include <random>
#include <cstddef>
#include <iostr... | 39.124088 | 92 | 0.619216 | gargarchit |
5a36a2cc3636f45f26988d6e74b65fe2a3eabefd | 715 | cpp | C++ | 31-40/031 Next Permutation/NextPermutation.cpp | tiandaochouqin1/leetcode | 9dcfc1aafd4dcf2e2a7cb0fa84677b59d7d34430 | [
"Apache-2.0"
] | 1 | 2021-04-17T17:32:56.000Z | 2021-04-17T17:32:56.000Z | 31-40/031 Next Permutation/NextPermutation.cpp | tiandaochouqin1/leetcode | 9dcfc1aafd4dcf2e2a7cb0fa84677b59d7d34430 | [
"Apache-2.0"
] | null | null | null | 31-40/031 Next Permutation/NextPermutation.cpp | tiandaochouqin1/leetcode | 9dcfc1aafd4dcf2e2a7cb0fa84677b59d7d34430 | [
"Apache-2.0"
] | null | null | null | #include <vector>
#include <iostream>
using namespace std;
class Solution{
public:
vector<int> nextPermutaion(vector<int>& vec)
{
vector<int>::iterator v1=prev(vec.end()),v2=vec.end()-1;
int tmp;
for(;(v1-1)!=vec.begin()&&*(v1-1)>*v1;--v1) ;
if(!(v1-1==vec.begin()&&*(v1-1)>*v1))/... | 22.34375 | 65 | 0.471329 | tiandaochouqin1 |
5a3814ccb3c24edacb36caf75c8b2da5978dc2d0 | 2,593 | cpp | C++ | src/sample/main.cpp | WilstonOreo/omnicalib | 5dcea24eb68fab19860e37c272f32288cd3fce71 | [
"MIT"
] | 4 | 2017-04-14T14:15:02.000Z | 2018-12-09T17:18:27.000Z | src/sample/main.cpp | cr8tr/omnicalib | 5dcea24eb68fab19860e37c272f32288cd3fce71 | [
"MIT"
] | null | null | null | src/sample/main.cpp | cr8tr/omnicalib | 5dcea24eb68fab19860e37c272f32288cd3fce71 | [
"MIT"
] | 2 | 2019-12-05T07:36:31.000Z | 2021-07-21T09:58:34.000Z | /* Copyright (c) 2014-2016 "OmniCalibration" by cr8tr
* Calibration Format for Omnidome (http://omnido.me).
* Created by Michael Winkelmann aka Wilston Oreo (@WilstonOreo)
*
* This file is part of Omnidome.
*
* Simplified BSD license
* Copyright (c) 2016
* Redistribution and use in source and binary forms, with... | 36.521127 | 82 | 0.742383 | WilstonOreo |
5a386f5740ac989ce7a9e93af127a3c1bf608355 | 2,298 | cpp | C++ | stacker_cpp/window_title_screen.cpp | MrCrazyID/Stacker | d232fe21f4a1d1c75905c66fed319a394f2a2ffe | [
"MIT"
] | 1 | 2019-04-05T08:24:40.000Z | 2019-04-05T08:24:40.000Z | stacker_cpp/window_title_screen.cpp | idelsink/stacker | d232fe21f4a1d1c75905c66fed319a394f2a2ffe | [
"MIT"
] | null | null | null | stacker_cpp/window_title_screen.cpp | idelsink/stacker | d232fe21f4a1d1c75905c66fed319a394f2a2ffe | [
"MIT"
] | null | null | null | /**
* @file window_title_screen.cpp
* @author Ingmar Delsink
* @date 2 may 2014
* @brief File containing the GUI of the Title screen of Stacker.
* In this file evertyhing of the title screen of Stacker in relation with the GUI
* can be found.
*/
#include "window_title_screen.h"
#include "ui_window_title_screen.... | 33.794118 | 145 | 0.64752 | MrCrazyID |
5a3f18e2602df263cdfef44befc7f0774e5ea772 | 1,875 | cpp | C++ | cpp/Letter Combinations of a Phone Number.cpp | vishnureddys/leetcode | dcec596bab8fbf99cdaab7d4ba09865e34f7a0aa | [
"MIT"
] | null | null | null | cpp/Letter Combinations of a Phone Number.cpp | vishnureddys/leetcode | dcec596bab8fbf99cdaab7d4ba09865e34f7a0aa | [
"MIT"
] | null | null | null | cpp/Letter Combinations of a Phone Number.cpp | vishnureddys/leetcode | dcec596bab8fbf99cdaab7d4ba09865e34f7a0aa | [
"MIT"
] | null | null | null | /*
17. Letter Combinations of a Phone Number
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any ... | 28.409091 | 157 | 0.4832 | vishnureddys |
5a413f063cfd76c67eb3130bbbcdf06993fe542f | 234 | hpp | C++ | gb++/src/Input/Input.hpp | dfrias100/gb-plus-plus | e5c48f18ab24315f1a5c70789cd3c1cae9428baf | [
"MIT"
] | null | null | null | gb++/src/Input/Input.hpp | dfrias100/gb-plus-plus | e5c48f18ab24315f1a5c70789cd3c1cae9428baf | [
"MIT"
] | null | null | null | gb++/src/Input/Input.hpp | dfrias100/gb-plus-plus | e5c48f18ab24315f1a5c70789cd3c1cae9428baf | [
"MIT"
] | null | null | null | #ifndef INPUT_HPP
#define INPUT_HPP
#include "../Window/Window.hpp"
#include "../Memory/Memory.hpp"
struct InputHandler {
Window* EmuWindow;
Memory* EmulatorCore;
sf::Event* EventVar;
bool GetInput();
};
#endif // !INPUT_HPP
| 13.764706 | 31 | 0.709402 | dfrias100 |
5a42b33f0e78c19f29a0874c7d3176bc5c072f76 | 7,047 | cpp | C++ | src/caffe/sparse_blob.cpp | alemagnani/caffe | 9dfd7e44a452800566260d8b6f9bc27a29a34d76 | [
"BSD-2-Clause"
] | 2 | 2015-12-02T09:51:57.000Z | 2016-05-03T09:34:30.000Z | src/caffe/sparse_blob.cpp | alemagnani/caffe | 9dfd7e44a452800566260d8b6f9bc27a29a34d76 | [
"BSD-2-Clause"
] | null | null | null | src/caffe/sparse_blob.cpp | alemagnani/caffe | 9dfd7e44a452800566260d8b6f9bc27a29a34d76 | [
"BSD-2-Clause"
] | null | null | null | #include <vector>
#include "caffe/blob.hpp"
#include "caffe/common.hpp"
#include "caffe/sparse_blob.hpp"
#include "caffe/syncedmem.hpp"
#include "caffe/util/math_functions.hpp"
namespace caffe {
template<typename Dtype>
void SparseBlob<Dtype>::Reshape(const vector<int>& shape, const int nnz) {
CHECK_EQ(shape.size(... | 25.440433 | 79 | 0.677877 | alemagnani |
5a47cdc6fcaa6cc1dce8b7a0f191b31647ade007 | 4,115 | cpp | C++ | code/server/tests/single_channel_server_test.cpp | doleron/raspberry-as-gige-camera | ac73b09f126870684e8417da4be6ebb44822a322 | [
"MIT"
] | 20 | 2021-08-29T17:54:48.000Z | 2022-03-06T07:17:10.000Z | code/server/tests/single_channel_server_test.cpp | doleron/raspberry-as-gige-camera | ac73b09f126870684e8417da4be6ebb44822a322 | [
"MIT"
] | null | null | null | code/server/tests/single_channel_server_test.cpp | doleron/raspberry-as-gige-camera | ac73b09f126870684e8417da4be6ebb44822a322 | [
"MIT"
] | 2 | 2021-11-28T09:51:30.000Z | 2022-02-05T08:40:16.000Z |
#include "gtest/gtest.h"
#include "rpiasgige/single_channel_server.hpp"
static const int TEST_DATA_SIZE = 3 * 1280 * 1024;
class Single_Channel_ServerTest : public ::testing::Test
{
};
/**
* This class aims to expose the protected methods in order we can test them.
**/
class Single_Channel_Server_Wrapper : publi... | 27.804054 | 125 | 0.685055 | doleron |
5a4e842176ad36aa5adff6864bfe30a36008d7cc | 895 | cpp | C++ | DynamicProgramming/0279-Perfect-Squares/memorySearch-150ms.cpp | FeiZhao0531/PlayLeetCode | ed23477fd6086d5139bda3d93feeabc09b06854d | [
"MIT"
] | 5 | 2019-05-11T18:33:32.000Z | 2019-12-13T09:13:02.000Z | DynamicProgramming/0279-Perfect-Squares/memorySearch-150ms.cpp | FeiZhao0531/PlayLeetCode | ed23477fd6086d5139bda3d93feeabc09b06854d | [
"MIT"
] | null | null | null | DynamicProgramming/0279-Perfect-Squares/memorySearch-150ms.cpp | FeiZhao0531/PlayLeetCode | ed23477fd6086d5139bda3d93feeabc09b06854d | [
"MIT"
] | null | null | null | /// Source : https://leetcode.com/problems/perfect-squares/description/
/// Author : Fei
/// Time : Jul-18-2019
#include <iostream>
#include <vector>
#include <cassert>
using namespace std;
/// Memory Search
/// Time Complexity: O(n)
/// Space Complexity: O(n)
class Solution {
public:
int numSquares(int n) {
... | 19.042553 | 81 | 0.532961 | FeiZhao0531 |
990000fc46691106c4cd6a2cba4d1a74f4cac8d9 | 2,282 | hpp | C++ | boost/assign/v2/ref/wrapper/framework.hpp | rogard/assign_v2 | 8735f57177dbee57514b4e80c498dd4b89f845e5 | [
"BSL-1.0"
] | null | null | null | boost/assign/v2/ref/wrapper/framework.hpp | rogard/assign_v2 | 8735f57177dbee57514b4e80c498dd4b89f845e5 | [
"BSL-1.0"
] | null | null | null | boost/assign/v2/ref/wrapper/framework.hpp | rogard/assign_v2 | 8735f57177dbee57514b4e80c498dd4b89f845e5 | [
"BSL-1.0"
] | null | null | null | //////////////////////////////////////////////////////////////////////////////
// Boost.Assign v2 //
// //
// Copyright (C) 2003-2004 Thorsten Ottosen //
// ... | 25.640449 | 78 | 0.599912 | rogard |
9901e5d075ebf8df1d7cc599e4fc85142c48f3a8 | 5,207 | cpp | C++ | src/Graphics/Sprite.cpp | UltimaBGD/Ngine | f672c52ca391b32fd0f808166c8728cf4597a077 | [
"Apache-2.0"
] | null | null | null | src/Graphics/Sprite.cpp | UltimaBGD/Ngine | f672c52ca391b32fd0f808166c8728cf4597a077 | [
"Apache-2.0"
] | null | null | null | src/Graphics/Sprite.cpp | UltimaBGD/Ngine | f672c52ca391b32fd0f808166c8728cf4597a077 | [
"Apache-2.0"
] | null | null | null | /**********************************************************************************************
*
* Ngine - A (mainly) 2D game engine.
*
* Copyright (C) 2019 NerdThings
*
* LICENSE: Apache License 2.0
* View: https://github.com/NerdThings/Ngine/blob/master/LICENSE
*
*********************************************... | 30.450292 | 190 | 0.507586 | UltimaBGD |
99044b017e71ead8e60459362316c9c1e16d6c3a | 471 | cpp | C++ | Leetcode/997.cpp | prameetu/CP_codes | 41f8cfc188d2e08a8091bc5134247d05ba8a78f5 | [
"MIT"
] | null | null | null | Leetcode/997.cpp | prameetu/CP_codes | 41f8cfc188d2e08a8091bc5134247d05ba8a78f5 | [
"MIT"
] | null | null | null | Leetcode/997.cpp | prameetu/CP_codes | 41f8cfc188d2e08a8091bc5134247d05ba8a78f5 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
class Solution {
public:
int findJudge(int n, vector<vector<int>>& trust) {
int judge(-1);
map <int,int> mp;
vector <int> v(n+1,0);
for(auto x:trust)
{
v[x[0]]++;
mp[x[1]]++;
}
... | 16.241379 | 54 | 0.373673 | prameetu |
99128280a791d59bfafbcd69bff76e377b5476df | 1,011 | cpp | C++ | src/User/Command/Channel/PART.cpp | hallainea/ft_irc | 389ff7c1c93e72739e373c74b69ec826535216e4 | [
"Apache-2.0"
] | 6 | 2021-12-10T18:35:26.000Z | 2022-03-23T21:46:14.000Z | src/User/Command/Channel/PART.cpp | Assxios/ft_irc | 389ff7c1c93e72739e373c74b69ec826535216e4 | [
"Apache-2.0"
] | null | null | null | src/User/Command/Channel/PART.cpp | Assxios/ft_irc | 389ff7c1c93e72739e373c74b69ec826535216e4 | [
"Apache-2.0"
] | 3 | 2021-12-19T18:11:13.000Z | 2022-02-02T13:29:31.000Z | #include "../Command.hpp"
#include "../../../Utils/Utils.hpp"
#include "../../../Server/Server.hpp"
#include "../../User.hpp"
void PART(irc::Command *command)
{
if (command->getParameters().size() == 0)
{
command->reply(461, "PART");
return;
}
std::vector<std::string> channels = irc::split(command->getParamete... | 28.083333 | 126 | 0.613254 | hallainea |
991adeea4419452a5a0fbf4a501e4388d985348d | 871 | hpp | C++ | cpp-projects/tous-les-prenoms-app/widgets/list_names_m.hpp | FlorianLance/TousLesPrenoms | 57e2b6b39efac924e10066f97f9a718bd069f9d6 | [
"MIT"
] | null | null | null | cpp-projects/tous-les-prenoms-app/widgets/list_names_m.hpp | FlorianLance/TousLesPrenoms | 57e2b6b39efac924e10066f97f9a718bd069f9d6 | [
"MIT"
] | null | null | null | cpp-projects/tous-les-prenoms-app/widgets/list_names_m.hpp | FlorianLance/TousLesPrenoms | 57e2b6b39efac924e10066f97f9a718bd069f9d6 | [
"MIT"
] | null | null | null |
#pragma once
// Qt
#include <QAbstractListModel>
#include <QSortFilterProxyModel>
// local
#include "data/data.hpp"
#include "data/settings.hpp"
namespace tool::ui {
enum class Mode {
Filtered,Saved,Removed
};
class ListNamesM : public QAbstractListModel{
Q_OBJECT
public:
ListNamesM(Mode mode);
int r... | 18.145833 | 102 | 0.699196 | FlorianLance |
991e0568a4c06ddf4755672ecd465e6485733a51 | 643 | cpp | C++ | p1478.cpp | joe1166/noi | be2e9fcd8306ff4f20a4306e219656346a396013 | [
"Apache-2.0"
] | null | null | null | p1478.cpp | joe1166/noi | be2e9fcd8306ff4f20a4306e219656346a396013 | [
"Apache-2.0"
] | null | null | null | p1478.cpp | joe1166/noi | be2e9fcd8306ff4f20a4306e219656346a396013 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n, s;
int a, b, c;
vector<int> z;
int counta = 0;
int main(int argc, char const *argv[])
{
cin >> n >> s;
int x[n], y[n];
cin >> a >> b;
c = a + b;
for (int i = 0; i < n; i++)
{
cin >> x[i] >> y[i];
... | 14.953488 | 38 | 0.390358 | joe1166 |
991f111953f6188c3c052b7beba8115a7724d60b | 2,235 | cpp | C++ | Homeworks/homework009.cpp | JcsnP/My-Playground | 683600bd32ee7050bbe2cfca8eaf96eb1cdf039c | [
"Unlicense"
] | 2 | 2020-12-31T09:30:57.000Z | 2021-03-15T05:04:18.000Z | Homeworks/homework009.cpp | JcsnP/My-Playground | 683600bd32ee7050bbe2cfca8eaf96eb1cdf039c | [
"Unlicense"
] | null | null | null | Homeworks/homework009.cpp | JcsnP/My-Playground | 683600bd32ee7050bbe2cfca8eaf96eb1cdf039c | [
"Unlicense"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
typedef long int ll;
void input();
void deposit();
void withdraw();
void show();
struct Account{
long long int accountID;
int accountType;
ll money = 0;
ll limit = 0;
};
struct Person{
int personID;
char firstName[100];
char lastName[100];
struct Account account... | 24.293478 | 77 | 0.612081 | JcsnP |
992501051e97fd41becd60a3a251b5de6cddf8eb | 2,602 | hpp | C++ | src/RandomizedCollection.hpp | znso4/LeetCodeAnswers | 232f5b2c4a66b461d336e80998e2ce4ac069f467 | [
"Apache-2.0"
] | 1 | 2020-08-24T15:47:18.000Z | 2020-08-24T15:47:18.000Z | src/RandomizedCollection.hpp | znso4/LeetCodeAnswers | 232f5b2c4a66b461d336e80998e2ce4ac069f467 | [
"Apache-2.0"
] | null | null | null | src/RandomizedCollection.hpp | znso4/LeetCodeAnswers | 232f5b2c4a66b461d336e80998e2ce4ac069f467 | [
"Apache-2.0"
] | null | null | null | #include "pch.h"
#pragma once
using std::cout;
using std::endl;
template<typename ValueType = int, typename IndexType = size_t>
class RandomizedCollection {
std::vector<ValueType> values;
std::unordered_map<ValueType, std::unordered_set<IndexType>> indices;
std::mt19937 rIndex;
public:
/** Initialize ... | 31.349398 | 123 | 0.532283 | znso4 |
9925b4f8c0a423bf76a0ac93e97560159e81bb32 | 19,060 | cc | C++ | minisat/core/Solver.cc | mmaroti/minisat-stripped | b596823164759f401faa30244b97051e80d15816 | [
"MIT"
] | null | null | null | minisat/core/Solver.cc | mmaroti/minisat-stripped | b596823164759f401faa30244b97051e80d15816 | [
"MIT"
] | null | null | null | minisat/core/Solver.cc | mmaroti/minisat-stripped | b596823164759f401faa30244b97051e80d15816 | [
"MIT"
] | null | null | null | /***************************************************************************************[Solver.cc]
Copyright (c) 2003-2006, Niklas Een, Niklas Sorensson
Copyright (c) 2007-2010, Niklas Sorensson
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
associated documentation ... | 32.195946 | 121 | 0.580063 | mmaroti |
992897b2e656c0a418b851fb3d29a3a461ad74bb | 4,914 | hpp | C++ | include/convolution.hpp | infinitesnow/InceptionCL | e3d3a6218e551d42dfcead4f121cec294d50d85c | [
"Unlicense"
] | 2 | 2017-10-05T13:13:41.000Z | 2019-05-15T19:20:49.000Z | include/convolution.hpp | infinitesnow/InceptionCL | e3d3a6218e551d42dfcead4f121cec294d50d85c | [
"Unlicense"
] | null | null | null | include/convolution.hpp | infinitesnow/InceptionCL | e3d3a6218e551d42dfcead4f121cec294d50d85c | [
"Unlicense"
] | null | null | null | #ifndef CONVOLUTION_H
#define CONVOLUTION_H
#include <misc.hpp>
class filter{
public:
filter();
filter(Volume weights_volume, short stride, float bias) :
weights_volume{weights_volume}, stride{stride}, bias{bias} {
size = weights_volume.get_range().get(0);
depth = weights_volume.get_ran... | 31.5 | 104 | 0.640822 | infinitesnow |
992d3966629c3cc6f6a9d52228310ab79f85956c | 15,237 | cpp | C++ | source/SimplexNoise.cpp | nhaflinger/Vesuvius | 93db82977dae0080a7705fe2532258be54500860 | [
"MIT"
] | null | null | null | source/SimplexNoise.cpp | nhaflinger/Vesuvius | 93db82977dae0080a7705fe2532258be54500860 | [
"MIT"
] | null | null | null | source/SimplexNoise.cpp | nhaflinger/Vesuvius | 93db82977dae0080a7705fe2532258be54500860 | [
"MIT"
] | null | null | null | //
// SimplexNoise.cpp
//
// code attribution: Stefan Gustavson (from original Perlin noise by Ken Perlin)
//
#include "SimplexNoise.h"
#include <iostream>
using namespace Utilities;
unsigned char perm2[] = { 151,160,137,91,90,15,
131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21... | 36.021277 | 108 | 0.571504 | nhaflinger |
992f537c9e4a8a4c1852c34cd3cac384f0b205fa | 33,733 | hpp | C++ | src/video/defaultfont.hpp | yocto-8/yocto-8 | 4911a82f399776731d3030234c731c15593f1910 | [
"MIT"
] | 22 | 2021-06-20T21:23:29.000Z | 2022-03-26T01:46:10.000Z | src/video/defaultfont.hpp | yocto-8/yocto-8 | 4911a82f399776731d3030234c731c15593f1910 | [
"MIT"
] | 2 | 2021-09-06T12:08:32.000Z | 2021-09-06T12:23:55.000Z | src/video/defaultfont.hpp | yocto-8/yocto-8 | 4911a82f399776731d3030234c731c15593f1910 | [
"MIT"
] | 1 | 2021-11-26T08:34:59.000Z | 2021-11-26T08:34:59.000Z | #pragma once
// generated with scripts/generate_font_array.py
#include <array>
#include <cstdint>
namespace video
{
static constexpr std::array<std::uint8_t, 2048> pico8_builtin_font = {
// glyph 0
0b00000000,
0b00000000,
0b00000000,
0b00000000,
0b00000000,
0b00000000,
0b00000000,
0b00000000,
// ... | 13.100194 | 70 | 0.672872 | yocto-8 |
9933502f0f7fc49e49778412dc563fe0d8b63df3 | 112 | hh | C++ | viewer/window.hh | jpanikulam/experiments | be36319a89f8baee54d7fa7618b885edb7025478 | [
"MIT"
] | 1 | 2019-04-14T11:40:28.000Z | 2019-04-14T11:40:28.000Z | viewer/window.hh | IJDykeman/experiments-1 | 22badf166b2ea441e953939463f751020b8c251b | [
"MIT"
] | 5 | 2018-04-18T13:54:29.000Z | 2019-08-22T20:04:17.000Z | viewer/window.hh | IJDykeman/experiments-1 | 22badf166b2ea441e953939463f751020b8c251b | [
"MIT"
] | 1 | 2018-12-24T03:45:47.000Z | 2018-12-24T03:45:47.000Z | #pragma once
#include "viewer/window_2d.hh"
#include "viewer/window_3d.hh"
#include "viewer/window_manager.hh"
| 18.666667 | 35 | 0.776786 | jpanikulam |
99347ce92b704738640cf9d469aa7960fe4a0206 | 179 | hpp | C++ | src/source/math/group_c/inverse_table_c.hpp | mvpwizard/DLA | 5ead2574e61e619ca3a93f1e771e3988fc144928 | [
"MIT"
] | 1 | 2019-03-24T12:07:46.000Z | 2019-03-24T12:07:46.000Z | src/source/math/group_c/inverse_table_c.hpp | nepitdev/DLA | 5ead2574e61e619ca3a93f1e771e3988fc144928 | [
"MIT"
] | 10 | 2019-03-06T20:27:39.000Z | 2019-11-27T08:28:12.000Z | src/source/math/group_c/inverse_table_c.hpp | openepit/DLA | 5ead2574e61e619ca3a93f1e771e3988fc144928 | [
"MIT"
] | null | null | null | #pragma once
#include <cstdint>
namespace dla
{
class inverse_table_c
{
private:
inverse_table_c() {}
public:
static const uint16_t L[];
};
} | 12.785714 | 34 | 0.581006 | mvpwizard |
9937d9d160e68e30228e1073a8082f3dc446ce0e | 328 | hh | C++ | payload/game/ui/SectionId.hh | stblr/mkw-sp | 0505b427ace12cd8258776930e4f2576d38a7b1f | [
"MIT"
] | 24 | 2022-01-31T00:35:29.000Z | 2022-03-20T17:03:04.000Z | payload/game/ui/SectionId.hh | stblr/mkw-sp | 0505b427ace12cd8258776930e4f2576d38a7b1f | [
"MIT"
] | 135 | 2022-01-31T09:24:26.000Z | 2022-03-31T19:49:07.000Z | payload/game/ui/SectionId.hh | stblr/mkw-sp | 0505b427ace12cd8258776930e4f2576d38a7b1f | [
"MIT"
] | 13 | 2022-01-31T04:10:22.000Z | 2022-03-26T10:06:41.000Z | #pragma once
namespace UI {
enum class SectionId {
TimeAttack = 0x1f,
GhostReplay = 0x34,
TitleFromMenu = 0x41,
TitleFromOptions = 0x43,
MiiSelectCreate = 0x45,
MiiSelectChange = 0x46,
ChangeCourse = 0x4a,
ChangeGhostData = 0x4d,
Channel = 0x7a,
Max = 0x95,
};
} // names... | 13.12 | 28 | 0.631098 | stblr |
993842e17248f74f51012f74af006d613e9d884c | 288 | hpp | C++ | include/spmdfy/Pass/Passes/PrintCFGPass.hpp | schwarzschild-radius/spmdfy | 9b5543e3446347277f15b9fe2aee3c7f8311bc78 | [
"MIT"
] | 6 | 2019-07-26T12:37:32.000Z | 2021-03-13T06:18:07.000Z | include/spmdfy/Pass/Passes/PrintCFGPass.hpp | schwarzschild-radius/spmdfy | 9b5543e3446347277f15b9fe2aee3c7f8311bc78 | [
"MIT"
] | 6 | 2019-06-19T06:04:01.000Z | 2019-08-23T11:12:31.000Z | include/spmdfy/Pass/Passes/PrintCFGPass.hpp | schwarzschild-radius/spmdfy | 9b5543e3446347277f15b9fe2aee3c7f8311bc78 | [
"MIT"
] | 1 | 2020-05-28T06:43:12.000Z | 2020-05-28T06:43:12.000Z | #ifndef PRINT_CFG_PASS_HPP
#define PRINT_CFG_PASS_HPP
#include <spmdfy/Pass/PassHandler.hpp>
namespace spmdfy {
namespace pass {
bool print_cfg_pass(SpmdTUTy&, clang::ASTContext&, Workspace&);
PASS(print_cfg_pass, print_cfg_pass_t);
} // namespace pass
} // namespace spmdfy
#endif | 16.941176 | 63 | 0.777778 | schwarzschild-radius |
993cb04616cf0637d4347b9ddc8378b59c7c5652 | 5,358 | cpp | C++ | Source/Beezer/Dialogs/InputAlert.cpp | Teknomancer/beezer | 37dc9029aff5bd42bd38d01c7059ccbea4bb95a7 | [
"BSD-3-Clause"
] | 3 | 2020-08-20T18:57:52.000Z | 2021-12-13T03:11:19.000Z | Source/Beezer/Dialogs/InputAlert.cpp | Teknomancer/beezer | 37dc9029aff5bd42bd38d01c7059ccbea4bb95a7 | [
"BSD-3-Clause"
] | 22 | 2020-02-24T21:40:44.000Z | 2021-04-18T15:07:15.000Z | Source/Beezer/Dialogs/InputAlert.cpp | Teknomancer/beezer | 37dc9029aff5bd42bd38d01c7059ccbea4bb95a7 | [
"BSD-3-Clause"
] | null | null | null | // SPDX-License-Identifier: BSD-3-Clause
// Copyright (c) 2002 Ramshankar (aka Teknomancer).
// Copyright (c) 2011 Chris Roberts.
// All rights reserved.
#include "InputAlert.h"
#include "UIConstants.h"
#include <Button.h>
#include <TextControl.h>
#include <Layout.h>
#include <GroupLayout.h>
#include <cassert>
stat... | 31.892857 | 121 | 0.650056 | Teknomancer |
993e81847162937bbdeb31644b7db843a87d977e | 1,692 | cpp | C++ | gameboy/test/src/bit_set_reset_test.cpp | ffdd270/study_emu | 985ce70e260a3a7dd5e238376a2303017f3355d9 | [
"MIT"
] | 9 | 2020-05-22T09:42:42.000Z | 2022-01-06T00:51:15.000Z | gameboy/test/src/bit_set_reset_test.cpp | ffdd270/study_emu | 985ce70e260a3a7dd5e238376a2303017f3355d9 | [
"MIT"
] | 1 | 2021-04-18T06:56:03.000Z | 2021-04-18T06:56:03.000Z | gameboy/test/src/bit_set_reset_test.cpp | ffdd270/study_emu | 985ce70e260a3a7dd5e238376a2303017f3355d9 | [
"MIT"
] | 3 | 2020-05-17T15:31:14.000Z | 2022-01-06T12:18:03.000Z | #include <catch.hpp>
#include "GameboyCPU.h"
#include "util.h"
TEST_CASE( "BIT SET RESET TEST", "[BIT SET RESET TEST]" )
{
std::shared_ptr<GameboyCPU> ptr_cpu = GameboyCPU::Create();
GameboyCPU & cpu = *(ptr_cpu);;
cpu.TestReset();
SECTION("BIT B, R")
{
SECTION("BIT 0~7, A")
{
callSetRegister8(cpu, Regi... | 23.830986 | 86 | 0.625296 | ffdd270 |
994769ae6dcf1e3635b8561c4511a6fa202374c0 | 2,501 | cpp | C++ | JotaZ80/instructions/exchange.cpp | jotacoder/JotaMasterSystem | 96985770969ec5971da2999513679fdb43cd01b7 | [
"MIT"
] | 1 | 2018-05-12T11:58:22.000Z | 2018-05-12T11:58:22.000Z | JotaZ80/instructions/exchange.cpp | jotacoder/JotaMasterSystem | 96985770969ec5971da2999513679fdb43cd01b7 | [
"MIT"
] | null | null | null | JotaZ80/instructions/exchange.cpp | jotacoder/JotaMasterSystem | 96985770969ec5971da2999513679fdb43cd01b7 | [
"MIT"
] | 3 | 2017-10-13T02:41:20.000Z | 2019-02-07T20:21:26.000Z | /** JotaMasterSystem: A Master System Emulator
* Copyright (c) Juan José Chica <jotacoder@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
* in the Software without restriction, including with... | 26.606383 | 80 | 0.703319 | jotacoder |
99483076009e5bb0f85eaedcbee7e59638d8be20 | 6,420 | cpp | C++ | src/optick_capi.cpp | Honeybunch/optick | 98679acad976fba57f4d4231cabd4800d4e1caa5 | [
"MIT"
] | 2 | 2020-07-21T13:22:30.000Z | 2020-07-21T21:14:42.000Z | src/optick_capi.cpp | Honeybunch/optick | 98679acad976fba57f4d4231cabd4800d4e1caa5 | [
"MIT"
] | null | null | null | src/optick_capi.cpp | Honeybunch/optick | 98679acad976fba57f4d4231cabd4800d4e1caa5 | [
"MIT"
] | null | null | null | // The MIT License(MIT)
//
// Copyright(c) 2019 Vadim Slyusarev
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files(the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to ... | 36.067416 | 208 | 0.773209 | Honeybunch |
99538e566fe1bec1349450f3606ea07efc08ed62 | 289 | hpp | C++ | include/display.hpp | ImanolFotia/Gameboy-Emulator | 09f0a7a2a487b749f231d0f90f7128ba2940ff26 | [
"MIT"
] | 1 | 2020-10-01T00:22:19.000Z | 2020-10-01T00:22:19.000Z | include/display.hpp | ImanolFotia/Gameboy-Emulator | 09f0a7a2a487b749f231d0f90f7128ba2940ff26 | [
"MIT"
] | null | null | null | include/display.hpp | ImanolFotia/Gameboy-Emulator | 09f0a7a2a487b749f231d0f90f7128ba2940ff26 | [
"MIT"
] | null | null | null | #pragma once
#include "types.hpp"
#define TILE_SIZE 8
#define NUM_TILES 32
#define MAX_PIXELS 256
#define LCDC_TILE_DATA_TABLE_BEGIN 0x8000
#define LCDC_TILE_DATA_TABLE_END 0x8FFF
#define NO_LCDC_TILE_DATA_TABLE_BEGIN 0x8800
#define NO_LCDC_TILE_DATA_TABLE_END 0x97FF
class display {}; | 20.642857 | 44 | 0.84083 | ImanolFotia |
995ae1e5bd6f10f45f0788991011936c8e01578a | 1,164 | cpp | C++ | core/ilwisobjects/domain/domainhelper.cpp | ridoo/IlwisCore | 9d9837507d804a4643545a03fd40d9b4d0eaee45 | [
"Apache-2.0"
] | null | null | null | core/ilwisobjects/domain/domainhelper.cpp | ridoo/IlwisCore | 9d9837507d804a4643545a03fd40d9b4d0eaee45 | [
"Apache-2.0"
] | null | null | null | core/ilwisobjects/domain/domainhelper.cpp | ridoo/IlwisCore | 9d9837507d804a4643545a03fd40d9b4d0eaee45 | [
"Apache-2.0"
] | null | null | null | #include "kernel.h"
#include "ilwisdata.h"
#include "range.h"
#include "domain.h"
#include "itemrange.h"
#include "domainitem.h"
#include "itemdomain.h"
#include "identifieritem.h"
#include "thematicitem.h"
#include "numericdomain.h"
#include "numericrange.h"
#include "juliantime.h"
#include "domainhelper.h"
using nam... | 24.25 | 102 | 0.713058 | ridoo |
99652bc4c2065d1c715ebe2f2dd84432a4d7d23d | 2,385 | hpp | C++ | include/codegen/include/GlobalNamespace/HTTPLeaderboardsModel_--c.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 1 | 2021-11-12T09:29:31.000Z | 2021-11-12T09:29:31.000Z | include/codegen/include/GlobalNamespace/HTTPLeaderboardsModel_--c.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | null | null | null | include/codegen/include/GlobalNamespace/HTTPLeaderboardsModel_--c.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 2 | 2021-10-03T02:14:20.000Z | 2021-11-12T09:29:36.000Z | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
#pragma pack(push, 8)
// Begin includes
#include "extern/beatsaber-hook/shared/utils/typedefs.h"
// Including type: HTTPLeaderboardsModel
#include "GlobalNamespace/HTTPLea... | 45 | 113 | 0.72956 | Futuremappermydud |
9965341215d1a466617d5fa49a1f9cc9cd8e75e7 | 562 | cpp | C++ | implementation/others/qsort.cpp | Layomiiety/Algorithmic-thinking | fc280717db051a26d19a583f3206402215d05c0a | [
"CC0-1.0"
] | null | null | null | implementation/others/qsort.cpp | Layomiiety/Algorithmic-thinking | fc280717db051a26d19a583f3206402215d05c0a | [
"CC0-1.0"
] | null | null | null | implementation/others/qsort.cpp | Layomiiety/Algorithmic-thinking | fc280717db051a26d19a583f3206402215d05c0a | [
"CC0-1.0"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define arr array
int n,l,r,a[100010];
void qsort(int l,int r){
int mid=a[(l+r)/2];
int i=l,j=r;
do{
while(a[i]<mid) i++;
while(a[j]>mid) j--;
if (i<=j) {
swap(a[i],a[j]);
i++;
j--;
... | 20.071429 | 45 | 0.435943 | Layomiiety |
9968a54a493b177695afd96d9d729a7db67ccc5b | 282 | cpp | C++ | test/common.cpp | andrew-murray/cpp-metrics | 9d126227b825c561fab5db79b01f267bd0ea9412 | [
"Apache-2.0"
] | 1 | 2018-07-31T00:49:23.000Z | 2018-07-31T00:49:23.000Z | test/common.cpp | andrew-murray/cpp-metrics | 9d126227b825c561fab5db79b01f267bd0ea9412 | [
"Apache-2.0"
] | null | null | null | test/common.cpp | andrew-murray/cpp-metrics | 9d126227b825c561fab5db79b01f267bd0ea9412 | [
"Apache-2.0"
] | null | null | null | #include "common.hpp"
namespace mock {
static std::atomic<int> g_time;
mock::clock::time_point clock::now() {
return time_point(duration((int)g_time));
}
void clock::set_time(const int& val) {
g_time = val;
}
int clock::time(){
return (int)g_time;
}
} | 15.666667 | 47 | 0.62766 | andrew-murray |
99752e42c7d604d633fc229f0237347974c4984e | 47 | hpp | C++ | src/boost_math_tools_polynomial_gcd.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 10 | 2018-03-17T00:58:42.000Z | 2021-07-06T02:48:49.000Z | src/boost_math_tools_polynomial_gcd.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 2 | 2021-03-26T15:17:35.000Z | 2021-05-20T23:55:08.000Z | src/boost_math_tools_polynomial_gcd.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 4 | 2019-05-28T21:06:37.000Z | 2021-07-06T03:06:52.000Z | #include <boost/math/tools/polynomial_gcd.hpp>
| 23.5 | 46 | 0.808511 | miathedev |
9979e4f09cf7b3e90e287d719b6b3af7ec937e9f | 24,053 | cpp | C++ | Source/RobCoG/Utilities/HandInformationParser.cpp | yukilikespie/RobCoG_FleX-4.16 | a6d1e8c0abb8ac1e36c5967cb886de8c154b2948 | [
"BSD-3-Clause"
] | null | null | null | Source/RobCoG/Utilities/HandInformationParser.cpp | yukilikespie/RobCoG_FleX-4.16 | a6d1e8c0abb8ac1e36c5967cb886de8c154b2948 | [
"BSD-3-Clause"
] | null | null | null | Source/RobCoG/Utilities/HandInformationParser.cpp | yukilikespie/RobCoG_FleX-4.16 | a6d1e8c0abb8ac1e36c5967cb886de8c154b2948 | [
"BSD-3-Clause"
] | null | null | null | // Copyright 2017, Institute for Artificial Intelligence - University of Bremen
#include "HandInformationParser.h"
#include "Paths.h"
#include "ConfigCacheIni.h"
HandInformationParser::HandInformationParser()
{
ConfigFileHandler = MakeShareable(new FConfigCacheIni(EConfigCacheType::DiskBacked));
}
HandInformationPa... | 94.32549 | 216 | 0.85374 | yukilikespie |
997b1c96d92b354ce0da6b7010c16a170937ab6d | 1,664 | cpp | C++ | Arrays Questions/20 Array questions.cpp | Benson1198/CPP | b12494becadc9431303cfdb51c5134dc68c679c3 | [
"MIT"
] | null | null | null | Arrays Questions/20 Array questions.cpp | Benson1198/CPP | b12494becadc9431303cfdb51c5134dc68c679c3 | [
"MIT"
] | null | null | null | Arrays Questions/20 Array questions.cpp | Benson1198/CPP | b12494becadc9431303cfdb51c5134dc68c679c3 | [
"MIT"
] | 1 | 2020-10-06T09:17:33.000Z | 2020-10-06T09:17:33.000Z | // How do you find the missing number in a given integer array of 1 to 100? (solution)
// How do you find the duplicate number on a given integer array? (solution)
// How do you find the largest and smallest number in an unsorted integer array? (solution)
// How do you find all pairs of an integer array whose sum is... | 42.666667 | 145 | 0.748798 | Benson1198 |
997d423ab9efb82afaaae0ef779bebfb4cdbd0ae | 547 | cpp | C++ | Mathematical Algorithms/Extended Euclidean Algorithm.cpp | praharshjain/Algorithms | ea63a2654453f129076ee7d0041f6af3046e4dfc | [
"MIT"
] | null | null | null | Mathematical Algorithms/Extended Euclidean Algorithm.cpp | praharshjain/Algorithms | ea63a2654453f129076ee7d0041f6af3046e4dfc | [
"MIT"
] | null | null | null | Mathematical Algorithms/Extended Euclidean Algorithm.cpp | praharshjain/Algorithms | ea63a2654453f129076ee7d0041f6af3046e4dfc | [
"MIT"
] | 2 | 2020-11-28T05:59:16.000Z | 2021-03-26T14:10:58.000Z | #include <iostream>
using namespace std;
//Extended Euclidean Algorithm
long long gcdExtended(long long a, long long b, long long *x, long long *y)
{
// Base Case
if (a == 0)
{
*x = 0;
*y = 1;
return b;
}
long long x1, y1, gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - ... | 23.782609 | 86 | 0.453382 | praharshjain |
5f58e49027b4e2d3bd8514243b9c1f0865b6ea63 | 1,080 | cpp | C++ | src/auto.cpp | Discobots-1104A/2021-2022-branch-sample | 0941e1e52d4d129fe0c91c8fe376589e03289e00 | [
"MIT"
] | 1 | 2021-09-25T23:51:15.000Z | 2021-09-25T23:51:15.000Z | src/auto.cpp | Discobots-1104A/2021-2022-branch-sample | 0941e1e52d4d129fe0c91c8fe376589e03289e00 | [
"MIT"
] | 4 | 2021-11-13T23:49:49.000Z | 2022-01-22T21:26:28.000Z | src/auto.cpp | Discobots-1104A/2021-2022-kidney-failure | 0941e1e52d4d129fe0c91c8fe376589e03289e00 | [
"MIT"
] | null | null | null | //* auto code
//* headers
#include "autos/autonomous.h"
#include "gui/guiGlobals.h"
#include "main.h"
namespace Autonomous {
e_autonomousSelection autonomousSelection = e_autonomousSelection::E_NONE;
int autonomousSelectionConfirmation = 0;
} // namespace Autonomous
//* auto callback
void autonomous() {
GUI::auton... | 30 | 80 | 0.734259 | Discobots-1104A |
5f58f6319f9f91408aff850f04a7c1d7b4791231 | 320 | cc | C++ | uvpp/src/check.cc | Qard/river.js | 62cebbfa61cef96d241487e8c35d46211d0a68b8 | [
"MIT"
] | 3 | 2018-04-06T08:58:55.000Z | 2018-04-15T20:48:43.000Z | uvpp/src/check.cc | Qard/river.js | 62cebbfa61cef96d241487e8c35d46211d0a68b8 | [
"MIT"
] | 6 | 2018-04-13T04:50:08.000Z | 2018-04-13T05:06:22.000Z | uvpp/src/check.cc | Qard/river.js | 62cebbfa61cef96d241487e8c35d46211d0a68b8 | [
"MIT"
] | null | null | null | #include "check.hh"
Check::Check(uv_loop_t* loop) {
uv_check_init(loop, this);
}
Check::~Check() {
if (!this->is_closing()) {
this->close([](uv_handle_t* handle){});
}
}
int Check::start(uv_check_cb callback) {
return uv_check_start(this, callback);
}
int Check::stop() {
return uv_check_stop(this);
}
| 16 | 43 | 0.653125 | Qard |
5f5a15fcbeb04302fd820478cdb9cac9f4d5b45f | 320 | cpp | C++ | competitive_programming/programming_contests/uri/our_days_are_never_coming_back.cpp | LeandroTk/Algorithms | 569ed68eba3eeff902f8078992099c28ce4d7cd6 | [
"MIT"
] | 205 | 2018-12-01T17:49:49.000Z | 2021-12-22T07:02:27.000Z | competitive_programming/programming_contests/uri/our_days_are_never_coming_back.cpp | LeandroTk/Algorithms | 569ed68eba3eeff902f8078992099c28ce4d7cd6 | [
"MIT"
] | 2 | 2020-01-01T16:34:29.000Z | 2020-04-26T19:11:13.000Z | competitive_programming/programming_contests/uri/our_days_are_never_coming_back.cpp | LeandroTk/Algorithms | 569ed68eba3eeff902f8078992099c28ce4d7cd6 | [
"MIT"
] | 50 | 2018-11-28T20:51:36.000Z | 2021-11-29T04:08:25.000Z | // https://www.urionlinejudge.com.br/judge/en/problems/view/1864
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string text = "LIFE IS NOT A PROBLEM TO BE SOLVED";
string final = "";
for (int i = 0; i < n; i++) final += text[i];
cout << final << endl;
return 0;
} | 15.238095 | 64 | 0.621875 | LeandroTk |
5f6274eec54512c22e45e3814eb428855068dbd3 | 2,392 | hpp | C++ | include/Agate/Util/ModelData.hpp | dfnzhc/CGT | eab79c203c8ce24bfa738c593bd2665bed387d63 | [
"MIT"
] | null | null | null | include/Agate/Util/ModelData.hpp | dfnzhc/CGT | eab79c203c8ce24bfa738c593bd2665bed387d63 | [
"MIT"
] | null | null | null | include/Agate/Util/ModelData.hpp | dfnzhc/CGT | eab79c203c8ce24bfa738c593bd2665bed387d63 | [
"MIT"
] | null | null | null | //
// Created by 秋鱼 on 2022/4/28.
//
#pragma once
#include <Agate/Shader/Matrix.h>
#include <Agate/Shader/CudaBufferView.hpp>
#include <optix_types.h>
#include <Agate/Shader/Material.hpp>
#include "AABB.hpp"
#include "Camera.hpp"
namespace Agate {
struct MeshData
{
std::string name;
Matrix4x4 transform;
... | 27.813953 | 100 | 0.701087 | dfnzhc |
5f666bcdf274820fb1d811c3a886823e9d2d224c | 1,082 | cpp | C++ | Binary Trees/height-of-binary-tree.cpp | ComputerScientist-01/100-Days-Of-DSA | 28942615a88c12382ca0b1580f5da393f957d584 | [
"MIT"
] | 4 | 2021-06-22T15:24:54.000Z | 2021-08-05T02:53:34.000Z | Binary Trees/height-of-binary-tree.cpp | AdityaPrakash-26/100-Days-Of-DSA | 821a26b128db3f9b555d87fab6d89d76fae22119 | [
"MIT"
] | null | null | null | Binary Trees/height-of-binary-tree.cpp | AdityaPrakash-26/100-Days-Of-DSA | 821a26b128db3f9b555d87fab6d89d76fae22119 | [
"MIT"
] | 1 | 2021-07-11T09:42:03.000Z | 2021-07-11T09:42:03.000Z | #include "bits/stdc++.h"
using namespace std;
struct Node
{
int data;
struct Node *left;
struct Node *right;
Node(int val)
{
data = val;
left = NULL;
right = NULL;
}
};
int sumNodes(Node *root)
{
if (root == NULL)
{
return 0;
}
return sumNodes(... | 17.737705 | 75 | 0.547135 | ComputerScientist-01 |
5f66afb90590009dceed6d48193a54849256c70b | 7,461 | hpp | C++ | zeccup/zeccup/military/woodland/fuel.hpp | LISTINGS09/ZECCUP | e0ad1fae580dde6e5d90903b1295fecc41684f63 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 3 | 2016-08-29T09:23:49.000Z | 2019-06-13T20:29:28.000Z | zeccup/zeccup/military/woodland/fuel.hpp | LISTINGS09/ZECCUP | e0ad1fae580dde6e5d90903b1295fecc41684f63 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | null | null | null | zeccup/zeccup/military/woodland/fuel.hpp | LISTINGS09/ZECCUP | e0ad1fae580dde6e5d90903b1295fecc41684f63 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | null | null | null | class FuelLarge
{
name = $STR_ZECCUP_FuelLarge;
};
class FuelMedium
{
name = $STR_ZECCUP_FuelMedium;
// EAST
class FuelDump_CUP_O_RU {
name = $STR_ZECCUP_MilitaryWoodland_FuelMedium_FuelDump_CUP_O_RU; // Credit: 2600K
icon = "\ca\data\flag_rus_co.paa";
side = 8;
class O... | 86.755814 | 129 | 0.615869 | LISTINGS09 |
5f67e6b8df33f644ed36fb18f42f8f54488ad3db | 1,033 | cpp | C++ | Engine/Lang/AST/Nodes/ASTNodeScope.cpp | GabyForceQ/PolluxEngine | 2dbc84ed1d434f1b6d794f775f315758f0e8cc49 | [
"BSD-3-Clause"
] | 3 | 2020-05-19T20:24:28.000Z | 2020-09-27T11:28:42.000Z | Engine/Lang/AST/Nodes/ASTNodeScope.cpp | GabyForceQ/PolluxEngine | 2dbc84ed1d434f1b6d794f775f315758f0e8cc49 | [
"BSD-3-Clause"
] | 31 | 2020-05-27T11:01:27.000Z | 2020-08-08T15:53:23.000Z | Engine/Lang/AST/Nodes/ASTNodeScope.cpp | GabyForceQ/PolluxEngine | 2dbc84ed1d434f1b6d794f775f315758f0e8cc49 | [
"BSD-3-Clause"
] | null | null | null | /*****************************************************************************************************************************
* Copyright 2020 Gabriel Gheorghe. All rights reserved.
* This code is licensed under the BSD 3-Clause "New" or "Revised" License
* License url: https://github.com/GabyForceQ/PolluxEngine/bl... | 30.382353 | 127 | 0.56728 | GabyForceQ |
5f681577402a52968a8b8c4c300a738780f0a272 | 10,717 | cpp | C++ | media_softlet/agnostic/common/codec/hal/codechal_oca_debug.cpp | LhGu/media-driver | e73c1d9a6cb8ff0c619766174cf618863520bf46 | [
"Intel",
"BSD-3-Clause",
"MIT"
] | null | null | null | media_softlet/agnostic/common/codec/hal/codechal_oca_debug.cpp | LhGu/media-driver | e73c1d9a6cb8ff0c619766174cf618863520bf46 | [
"Intel",
"BSD-3-Clause",
"MIT"
] | null | null | null | media_softlet/agnostic/common/codec/hal/codechal_oca_debug.cpp | LhGu/media-driver | e73c1d9a6cb8ff0c619766174cf618863520bf46 | [
"Intel",
"BSD-3-Clause",
"MIT"
] | null | null | null | /*
* Copyright (c) 2022, Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publis... | 49.615741 | 183 | 0.678082 | LhGu |
5f69d4ccb72cd1bb147e4f1b64a009f97aa89104 | 4,707 | cpp | C++ | firmware/examples/RGBLED-Draw/RGBStrip.cpp | brunolewin/virtual-shields-spark | fc5c8fa9cc3a1135229db707b566b0da5f345f0d | [
"MIT"
] | 98 | 2015-05-01T16:57:54.000Z | 2021-02-22T17:19:11.000Z | firmware/examples/RGBLED-Draw/RGBStrip.cpp | brunolewin/virtual-shields-spark | fc5c8fa9cc3a1135229db707b566b0da5f345f0d | [
"MIT"
] | 30 | 2015-05-18T09:58:39.000Z | 2018-09-13T17:42:23.000Z | firmware/examples/RGBLED-Draw/RGBStrip.cpp | brunolewin/virtual-shields-spark | fc5c8fa9cc3a1135229db707b566b0da5f345f0d | [
"MIT"
] | 64 | 2015-04-30T22:56:14.000Z | 2021-04-18T08:43:15.000Z | /*
Copyright(c) Microsoft Open Technologies, Inc. All rights reserved.
The MIT License(MIT)
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including witho... | 23.30198 | 81 | 0.616741 | brunolewin |
5f6c278429834b5710f6b20bb4c11eaff3e9453b | 5,425 | cpp | C++ | book/Convertor/src/TagTest.cpp | SergeyStrukov/CCore-3-xx | 820507e78f8aa35ca05761e00e060c8f64c59af5 | [
"BSL-1.0"
] | 8 | 2017-12-21T07:00:16.000Z | 2020-04-02T09:05:55.000Z | book/Convertor/src/TagTest.cpp | SergeyStrukov/CCore-3-xx | 820507e78f8aa35ca05761e00e060c8f64c59af5 | [
"BSL-1.0"
] | null | null | null | book/Convertor/src/TagTest.cpp | SergeyStrukov/CCore-3-xx | 820507e78f8aa35ca05761e00e060c8f64c59af5 | [
"BSL-1.0"
] | 1 | 2020-03-30T09:54:18.000Z | 2020-03-30T09:54:18.000Z | /* TagTest.cpp */
//----------------------------------------------------------------------------------------
//
// Project: Book Convertor 1.00
//
// License: Boost Software License - Version 1.0 - August 17th, 2003
//
// see http://www.boost.org/LICENSE_1_0.txt or the local copy
//
// Copyright (c) 2018 ... | 15.544413 | 90 | 0.627097 | SergeyStrukov |
5f6fe22fb0174d8e6dc13e32c7f883b09dac7155 | 3,352 | cpp | C++ | powerberry-dsp/src/adc/adc_dummy.cpp | Steckdoose4711/powerberry | 15c722ff66f0db5c00ddfb71ccc2c75d69b78d39 | [
"MIT"
] | null | null | null | powerberry-dsp/src/adc/adc_dummy.cpp | Steckdoose4711/powerberry | 15c722ff66f0db5c00ddfb71ccc2c75d69b78d39 | [
"MIT"
] | 20 | 2022-03-11T19:44:31.000Z | 2022-03-21T19:13:46.000Z | powerberry-dsp/src/adc/adc_dummy.cpp | Steckdoose4711/powerberry | 15c722ff66f0db5c00ddfb71ccc2c75d69b78d39 | [
"MIT"
] | null | null | null | /**
* @file adc_dummy.h
* @author Florian Atzenhofer
* @date 30.20.2021
* @brief Module to generate ADC Dummy Values [Implementation]
*
* This module generates an ideal sinewave and returns it's values
*/
#include "adc_dummy.h"
#include <math.h>
#include <iostream>
#include <stdlib.h>
static size_t nr_samp... | 32.543689 | 111 | 0.680788 | Steckdoose4711 |
5f703b06ecacf331251ed1c38548bd2eeb9d1322 | 2,126 | cpp | C++ | src/http_router.cpp | jonathonl/IPSuite | 76dfd7913388851c6714645252b2caa3c5596dcc | [
"MIT"
] | 1 | 2016-03-01T15:23:13.000Z | 2016-03-01T15:23:13.000Z | src/http_router.cpp | jonathonl/IPSuite | 76dfd7913388851c6714645252b2caa3c5596dcc | [
"MIT"
] | null | null | null | src/http_router.cpp | jonathonl/IPSuite | 76dfd7913388851c6714645252b2caa3c5596dcc | [
"MIT"
] | null | null | null |
#include "http_router.hpp"
#include "uniform_resource_identifier.hpp"
namespace manifold
{
namespace http
{
//----------------------------------------------------------------//
void router::register_handler(const std::regex& expression, const std::function<void(server::request&& req, server::response&& r... | 32.707692 | 201 | 0.464722 | jonathonl |
5f7e1fb5223265351033218ccb30a01db993c27b | 4,286 | cpp | C++ | srcAmiga/rsi/sphere.cpp | privatosan/RayStorm | 17e27259a8a1d6b2fcfa16886c6e4cdd81be8cfa | [
"MIT"
] | 2 | 2016-04-03T23:57:54.000Z | 2019-12-05T17:50:37.000Z | srcAmiga/rsi/sphere.cpp | privatosan/RayStorm | 17e27259a8a1d6b2fcfa16886c6e4cdd81be8cfa | [
"MIT"
] | null | null | null | srcAmiga/rsi/sphere.cpp | privatosan/RayStorm | 17e27259a8a1d6b2fcfa16886c6e4cdd81be8cfa | [
"MIT"
] | 2 | 2015-06-20T19:22:47.000Z | 2021-11-15T15:22:14.000Z | /***************
* MODUL: sphere
* NAME: sphere.cpp
* DESCRIPTION: Functions for sphere object class
* AUTHORS: Andreas Heumann, Mike Hesser
* HISTORY:
* DATE NAME COMMENT
* 11.02.95 ah initial release
* 13.03.95 ah added Update()
* 27.08.95 ah added animation... | 20.216981 | 87 | 0.570929 | privatosan |
5f8035b8a8b69fa7695f29d65a0bb23752b64a6c | 4,342 | cpp | C++ | svn_cvs_maps.cpp | BRL-CAD/repowork | d5180d99f1086614301cf4c3db44a2b2dd57ebb3 | [
"CC0-1.0"
] | null | null | null | svn_cvs_maps.cpp | BRL-CAD/repowork | d5180d99f1086614301cf4c3db44a2b2dd57ebb3 | [
"CC0-1.0"
] | null | null | null | svn_cvs_maps.cpp | BRL-CAD/repowork | d5180d99f1086614301cf4c3db44a2b2dd57ebb3 | [
"CC0-1.0"
] | null | null | null | /* S V N _ C V S _ M A P S . C P P
* BRL-CAD
*
* Published in 2020 by the United States Government.
* This work is in the public domain.
*
*/
/** @file svn_cvs_maps.cpp
*
* Utility functions
*
*/
#include <iostream>
#include <sstream>
#include <locale>
#include "repowork.h"
int
git_map_svn_comm... | 28.379085 | 138 | 0.582681 | BRL-CAD |
5f90a5d0bae7347086c89d5224405696f3c08cc5 | 1,890 | cpp | C++ | OOP/3-Examen2-EditorDeTexto_MFC/cascaronMFC_Clases.cpp | NestorJavier/Programacion_avanzada-Visual- | 1ccb8d41988d860689a6f8ef74bdd53da62c5214 | [
"MIT"
] | null | null | null | OOP/3-Examen2-EditorDeTexto_MFC/cascaronMFC_Clases.cpp | NestorJavier/Programacion_avanzada-Visual- | 1ccb8d41988d860689a6f8ef74bdd53da62c5214 | [
"MIT"
] | null | null | null | OOP/3-Examen2-EditorDeTexto_MFC/cascaronMFC_Clases.cpp | NestorJavier/Programacion_avanzada-Visual- | 1ccb8d41988d860689a6f8ef74bdd53da62c5214 | [
"MIT"
] | null | null | null | #include <afxwin.h>
int x = 88, y = 100, iEsp_x = 8;//La variable iEsp_x es el espacio que existe entre caracteres
RECT rWrk;
BOOL band = FALSE;
class CCascaron_Frame: public CFrameWnd
{
afx_msg void OnPaint();
afx_msg void OnLButtonDown(UINT, CPoint);
afx_msg void OnChar(UINT);
void Txt();
DECLARE_MESSAGE_... | 15.75 | 95 | 0.609524 | NestorJavier |
5f9771aec9cd438c59166fed0605f56a15800597 | 345 | cpp | C++ | Part1/Chapter4/L4-10.cpp | flics04/SSQCbook-Base-Luogu | c7ddbcfec58d6cc8f6396309daa8b511b6c8673d | [
"MIT"
] | null | null | null | Part1/Chapter4/L4-10.cpp | flics04/SSQCbook-Base-Luogu | c7ddbcfec58d6cc8f6396309daa8b511b6c8673d | [
"MIT"
] | null | null | null | Part1/Chapter4/L4-10.cpp | flics04/SSQCbook-Base-Luogu | c7ddbcfec58d6cc8f6396309daa8b511b6c8673d | [
"MIT"
] | null | null | null | #include <cstdio>
using namespace std;
int main() {
int k, coin = 0, day = 0;
scanf("%d", &k);
for (int i = 1; ; i++)
for (int j = 1; j <= i; j++) {
coin += i;
day++;
if (day == k) {
printf("%d\n", coin);
return 0;
}
... | 18.157895 | 38 | 0.33913 | flics04 |
5f9a5e72814144fcef9c26ddd06b1cfcae133bba | 323 | hpp | C++ | src/reir/exec/parser.hpp | large-scale-oltp-team/reir | 427db5f24e15f22cd2a4f4a716caf9392dae1d9b | [
"Apache-2.0"
] | 1 | 2020-03-04T10:57:14.000Z | 2020-03-04T10:57:14.000Z | src/reir/exec/parser.hpp | large-scale-oltp-team/reir | 427db5f24e15f22cd2a4f4a716caf9392dae1d9b | [
"Apache-2.0"
] | 3 | 2018-11-02T07:47:26.000Z | 2018-11-05T09:06:54.000Z | src/reir/exec/parser.hpp | large-scale-oltp-team/reir | 427db5f24e15f22cd2a4f4a716caf9392dae1d9b | [
"Apache-2.0"
] | null | null | null | #ifndef REIR_PARSER_HPP_
#define REIR_PARSER_HPP_
#include <cstdint>
#include <functional>
#include "ast_node.hpp"
namespace reir {
namespace node {
struct Statement;
}
class TokenStream;
void parse(const std::string& code, const std::function<void(node::Node*)>& fun);
} // namespace reir
#endif // REIR_PARSER_HP... | 17.944444 | 81 | 0.749226 | large-scale-oltp-team |
5f9e203d596e6853e6b15ab8f96df7e442eb99d4 | 672 | cpp | C++ | Maximum Erasure Value.cpp | chaitanyks/fuzzy-disco | bc52f779c68da3f259f116cc1f41c464db290fbf | [
"MIT"
] | 1 | 2021-12-12T05:55:44.000Z | 2021-12-12T05:55:44.000Z | Maximum Erasure Value.cpp | chaitanyks/fuzzy-disco | bc52f779c68da3f259f116cc1f41c464db290fbf | [
"MIT"
] | null | null | null | Maximum Erasure Value.cpp | chaitanyks/fuzzy-disco | bc52f779c68da3f259f116cc1f41c464db290fbf | [
"MIT"
] | null | null | null | // https://leetcode.com/problems/maximum-erasure-value/submissions/
// 1695. Maximum Erasure Value
class Solution {
public:
int maximumUniqueSubarray(vector<int>& nums) {
map<int,int> mp;
int n = nums.size();
int sum = 0;
int ans = 0;
int start = 0;
for(int ... | 22.4 | 67 | 0.397321 | chaitanyks |
5fa649938d8a96a259e807b92ad86adcff9d724a | 5,333 | hpp | C++ | OcularCore/include/Graphics/Mesh/MeshLoaders/OBJ/ResourceLoader_OBJ.hpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 8 | 2017-01-27T01:06:06.000Z | 2020-11-05T20:23:19.000Z | OcularCore/include/Graphics/Mesh/MeshLoaders/OBJ/ResourceLoader_OBJ.hpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 39 | 2016-06-03T02:00:36.000Z | 2017-03-19T17:47:39.000Z | OcularCore/include/Graphics/Mesh/MeshLoaders/OBJ/ResourceLoader_OBJ.hpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 4 | 2019-05-22T09:13:36.000Z | 2020-12-01T03:17:45.000Z | /**
* Copyright 2014-2017 Steven T Sell (ssell@vertexfragment.com)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless requir... | 37.556338 | 151 | 0.558785 | ssell |
5fa9dc24e222d9159975121ff0818a93c7e5bc50 | 1,125 | hpp | C++ | SW/_Tests/main.hpp | DF4IAH/DL0WH_BiTuner_Firmware | 1b5600dde4d955d3d7a422a4d98bc9bbbd231e82 | [
"MIT"
] | 3 | 2019-06-17T05:50:05.000Z | 2022-01-24T09:55:12.000Z | SW/_Tests/main.hpp | DF4IAH/DL0WH_BiTuner | 1b5600dde4d955d3d7a422a4d98bc9bbbd231e82 | [
"MIT"
] | null | null | null | SW/_Tests/main.hpp | DF4IAH/DL0WH_BiTuner | 1b5600dde4d955d3d7a422a4d98bc9bbbd231e82 | [
"MIT"
] | null | null | null | #ifndef _MAIN_H
#define _MAIN_H
#include <stdint.h>
#ifndef true
# define true 1U
#endif
#ifndef false
# define false 0U
#endif
typedef enum RtosMsgDefaultCmds_ENUM {
MsgDefault__InitDo = 0x01U,
MsgDefault__InitDone,
MsgDefault__SetVar01_IOs ... | 21.634615 | 91 | 0.695111 | DF4IAH |
5fabbb09a718e911e854122360fbce0469cb0ed0 | 33,407 | cpp | C++ | Engine2D/BattleEngine.cpp | MarkusPfundstein/OpenGL-2D-RPG-Engine-iPhone | b9643e6a6243952f8e17f216a860e58b197e2247 | [
"Unlicense"
] | 2 | 2015-11-05T21:25:18.000Z | 2016-02-15T08:55:44.000Z | Engine2D/BattleEngine.cpp | MarkusPfundstein/OpenGL-2D-RPG-Engine-iPhone | b9643e6a6243952f8e17f216a860e58b197e2247 | [
"Unlicense"
] | null | null | null | Engine2D/BattleEngine.cpp | MarkusPfundstein/OpenGL-2D-RPG-Engine-iPhone | b9643e6a6243952f8e17f216a860e58b197e2247 | [
"Unlicense"
] | null | null | null | //
// BattleEngine.cpp
// Engine2D
//
// Created by Markus Pfundstein on 10/15/11.
// Copyright 2011 The Saints. All rights reserved.
//
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
#include "BattleEngine.h"
#include "Gui.h"
#include "Texture2D.h"
#include "AnimatedSprite.h"
#inclu... | 33.847011 | 375 | 0.510612 | MarkusPfundstein |
5fb4518236edb66bdd16f90fec2d3393598043ee | 478 | cpp | C++ | src/test/BFCombinationFinderTest.cpp | simophin/game-matcher-qt | 706c94010216fb0d7d76e2428e5e907b4dd78372 | [
"MIT"
] | null | null | null | src/test/BFCombinationFinderTest.cpp | simophin/game-matcher-qt | 706c94010216fb0d7d76e2428e5e907b4dd78372 | [
"MIT"
] | null | null | null | src/test/BFCombinationFinderTest.cpp | simophin/game-matcher-qt | 706c94010216fb0d7d76e2428e5e907b4dd78372 | [
"MIT"
] | null | null | null | //
// Created by Fanchao Liu on 21/08/20.
//
#include <catch2/catch.hpp>
#include "BFCombinationFinder.h"
#include "MockGameStats.h"
TEST_CASE("BFCombinationFinder") {
SECTION("Should match levels when other factors are the same") {
MockGameStats gameStats;
gameStats.scorer = [] (auto) { return... | 21.727273 | 68 | 0.619247 | simophin |
5fbb97b02e314224a87840d1cf8f08d6f9f449aa | 374 | hpp | C++ | src/host/color.hpp | danieldeankon/hypertrace | d58a6ea28af45b875c477df4065667e9b4b88a49 | [
"MIT"
] | null | null | null | src/host/color.hpp | danieldeankon/hypertrace | d58a6ea28af45b875c477df4065667e9b4b88a49 | [
"MIT"
] | null | null | null | src/host/color.hpp | danieldeankon/hypertrace | d58a6ea28af45b875c477df4065667e9b4b88a49 | [
"MIT"
] | null | null | null | #pragma once
#include <cstdint>
#include <vec.hpp>
typedef vec<float, 3> color3;
color3 make_color(color3 c, float g=2.2f) {
return c.map([g](float x) { return pow(x, g); });
}
color3 make_color(uint32_t c, float g=2.2f) {
return make_color(color3(
float((c>>16)&0xFF)/0xFF,
float((c>>8)&0xF... | 18.7 | 53 | 0.593583 | danieldeankon |
5fc843213af2742100beb146f604981d09286c99 | 1,165 | cpp | C++ | SurfaceReconstruction/SurfaceReconstruction/SurfaceExtraction/SphereNodeStatesChecker.cpp | pavelsevecek/TSR | ca411dedf178e5830f0536e361136f1e16751bc8 | [
"BSD-3-Clause"
] | 102 | 2017-10-17T10:10:59.000Z | 2022-01-19T02:10:29.000Z | SurfaceReconstruction/SurfaceReconstruction/SurfaceExtraction/SphereNodeStatesChecker.cpp | pavelsevecek/TSR | ca411dedf178e5830f0536e361136f1e16751bc8 | [
"BSD-3-Clause"
] | 2 | 2019-12-21T11:59:15.000Z | 2020-09-08T11:38:36.000Z | SurfaceReconstruction/SurfaceReconstruction/SurfaceExtraction/SphereNodeStatesChecker.cpp | pavelsevecek/TSR | ca411dedf178e5830f0536e361136f1e16751bc8 | [
"BSD-3-Clause"
] | 27 | 2017-10-18T09:37:34.000Z | 2022-03-22T01:30:51.000Z | /*
* Copyright (C) 2018 by Author: Aroudj, Samir
* TU Darmstadt - Graphics, Capture and Massively Parallel Computing
* All rights reserved.
*
* This software may be modified and distributed under the terms
* of the BSD 3-Clause license. See the License.txt file for details.
*/
#include "SurfaceReconstruction/Sc... | 32.361111 | 125 | 0.791416 | pavelsevecek |
5fd283b66092e8ab33abbf0f4a12fc042c948d11 | 4,665 | cpp | C++ | OpenGLExample_02/OpenGLExample_02/main.cpp | SnowyLake/OpenGL_Learn | ae389cb45992eb90595482e0b4eca41b967e63b3 | [
"MIT"
] | 4 | 2020-11-27T14:20:28.000Z | 2022-03-12T03:11:04.000Z | OpenGLExample_02/OpenGLExample_02/main.cpp | SnowyLake/OpenGL_Learn | ae389cb45992eb90595482e0b4eca41b967e63b3 | [
"MIT"
] | null | null | null | OpenGLExample_02/OpenGLExample_02/main.cpp | SnowyLake/OpenGL_Learn | ae389cb45992eb90595482e0b4eca41b967e63b3 | [
"MIT"
] | null | null | null | #include<glad/glad.h>
#include<GLFW/glfw3.h>
#include<iostream>
void FramebufferSizeCallback(GLFWwindow* window, int width, int height);
void ProcessInput(GLFWwindow* window);
//setting
const unsigned int SCR_WIDTH = 800;
const unsigned int SCR_HEIGHT = 600;
const char* vertexShaderSource = "#version 33... | 28.975155 | 116 | 0.707824 | SnowyLake |
5fd526fd32219d99e9086898fbe31d55fccdc997 | 2,394 | cpp | C++ | tc 160+/CakeDivision.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 3 | 2015-05-25T06:24:37.000Z | 2016-09-10T07:58:00.000Z | tc 160+/CakeDivision.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | null | null | null | tc 160+/CakeDivision.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 5 | 2015-05-25T06:24:40.000Z | 2021-08-19T19:22:29.000Z | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <cstring>
using namespace std;
class CakeDivision {
public:
double ratio(double length, double width, int pieces) {
if (pieces == 1)
return max(length, wi... | 39.245902 | 315 | 0.588972 | ibudiselic |
5fd5df8c3f9cce24b755a315de654f46d627b079 | 8,497 | cc | C++ | src/solvers/test/test_MGCoarseMeshPreconditioner.cc | baklanovp/libdetran | 820efab9d03ae425ccefb9520bdb6c086fdbf939 | [
"MIT"
] | 4 | 2015-03-07T16:20:23.000Z | 2020-02-10T13:40:16.000Z | src/solvers/test/test_MGCoarseMeshPreconditioner.cc | baklanovp/libdetran | 820efab9d03ae425ccefb9520bdb6c086fdbf939 | [
"MIT"
] | 3 | 2018-02-27T21:24:22.000Z | 2020-12-16T00:56:44.000Z | src/solvers/test/test_MGCoarseMeshPreconditioner.cc | baklanovp/libdetran | 820efab9d03ae425ccefb9520bdb6c086fdbf939 | [
"MIT"
] | 9 | 2015-03-07T16:20:26.000Z | 2022-01-29T00:14:23.000Z | //----------------------------------*-C++-*-----------------------------------//
/**
* @file test_MGCoarseMeshPreconditioner.cc
* @brief Test of MGCoarseMeshPreconditioner
* @note Copyright(C) 2012-2013 Jeremy Roberts
*/
//----------------------------------------------------------------------------//
// LIST ... | 30.024735 | 80 | 0.573497 | baklanovp |
5fd68c3e900a0c4d8b6c1d5bb5b5cb9d03e0a8cc | 2,797 | cpp | C++ | src/VM/SrcFile.cpp | cstanze/blossom | 2be90c6f16897a2acc1c40dad933a973e1ef2f57 | [
"MIT"
] | 3 | 2021-08-16T22:22:02.000Z | 2021-11-15T02:39:38.000Z | src/VM/SrcFile.cpp | cstanze/blossom | 2be90c6f16897a2acc1c40dad933a973e1ef2f57 | [
"MIT"
] | 1 | 2021-09-27T19:22:37.000Z | 2022-03-29T12:41:24.000Z | src/VM/SrcFile.cpp | cstanze/blossom | 2be90c6f16897a2acc1c40dad933a973e1ef2f57 | [
"MIT"
] | null | null | null | #include "VM/SrcFile.hpp"
#include "Common/FS.hpp"
#include <cstdarg>
static size_t src_id() {
static size_t sid = 0;
return sid++;
}
namespace blossom {
SrcFile::SrcFile(const std::string &dir, const std::string &path,
const bool is_main)
: m_id(src_id()), m_dir(dir), m_path(path), m_is_ma... | 24.321739 | 77 | 0.600286 | cstanze |
5fdd44a50eb725cb9e0e8dfcd55cf16818fb2420 | 1,632 | cpp | C++ | code_blocks/check-rshillma/main.cpp | NewYaroslav/xtechnical_analysis | f81431cc5b36a9f3a4c561e0502e84310a3e0b2a | [
"MIT"
] | 12 | 2020-01-20T14:22:18.000Z | 2022-01-26T04:41:36.000Z | code_blocks/check-rshillma/main.cpp | NewYaroslav/xtechnical_analysis | f81431cc5b36a9f3a4c561e0502e84310a3e0b2a | [
"MIT"
] | 1 | 2020-05-23T07:35:03.000Z | 2020-05-23T07:35:03.000Z | code_blocks/check-rshillma/main.cpp | NewYaroslav/xtechnical_analysis | f81431cc5b36a9f3a4c561e0502e84310a3e0b2a | [
"MIT"
] | 9 | 2019-11-02T19:01:55.000Z | 2021-07-08T21:51:44.000Z | #include <iostream>
#include "xtechnical_indicators.hpp"
#include <array>
int main() {
std::cout << "Hello world!" << std::endl;
std::array<double, 20> test_data = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
xtechnical_indicators::RSHILLMA<double, xtechnical_indicators::SMA<double>, xtechnical_in... | 28.631579 | 143 | 0.517157 | NewYaroslav |
5fe830a02f7555bbe8f394a1bb29c65f03e1d68e | 4,595 | cpp | C++ | lab5.cpp | Jaymeet2003/CS-141 | f9b1d6023cfdc0582f403b536e693924d2ebcd36 | [
"BSD-3-Clause"
] | null | null | null | lab5.cpp | Jaymeet2003/CS-141 | f9b1d6023cfdc0582f403b536e693924d2ebcd36 | [
"BSD-3-Clause"
] | null | null | null | lab5.cpp | Jaymeet2003/CS-141 | f9b1d6023cfdc0582f403b536e693924d2ebcd36 | [
"BSD-3-Clause"
] | null | null | null | /*
Author:Jaymeet Patel
UIN: 656971609
System: Windows VSCode
Course: CS 141 Lab 5
*/
#include <iostream>
using namespace std;
// Display the board using an array and length N of the array
void displayBoard(char arr[], int N){
// HINT: use a loop to iterate through the array
// N IS IMPORTANT
//... | 16.648551 | 102 | 0.54951 | Jaymeet2003 |
5ff3632019c0c03cbfcc51f40f86d7fef71a5e97 | 1,023 | cpp | C++ | src/templates.cpp | zrzw/learn-cpp | ca3f8af734ad585fb836b571e02765226ba9428d | [
"Unlicense"
] | null | null | null | src/templates.cpp | zrzw/learn-cpp | ca3f8af734ad585fb836b571e02765226ba9428d | [
"Unlicense"
] | null | null | null | src/templates.cpp | zrzw/learn-cpp | ca3f8af734ad585fb836b571e02765226ba9428d | [
"Unlicense"
] | null | null | null | #include <iostream>
#include <stdexcept>
template <typename T>
class Stack{
public:
explicit Stack(std::initializer_list<T> il)
: sz{il.size()}
{
elem = new T[sz];
stack_ptr = sz-1;
size_t i=0;
for(auto& a: il){
elem[i++] = a;
}
}
~Stack() { d... | 21.3125 | 55 | 0.488759 | zrzw |
5ff46d34ef45bda092dec4e3c003288f9310a734 | 792 | cpp | C++ | leetcode/linked_list/merge_sorted_list.cpp | codingpotato/algorithm-cpp | 793dc9e141000f48ea19c77ef0047923a7667358 | [
"MIT"
] | null | null | null | leetcode/linked_list/merge_sorted_list.cpp | codingpotato/algorithm-cpp | 793dc9e141000f48ea19c77ef0047923a7667358 | [
"MIT"
] | null | null | null | leetcode/linked_list/merge_sorted_list.cpp | codingpotato/algorithm-cpp | 793dc9e141000f48ea19c77ef0047923a7667358 | [
"MIT"
] | null | null | null | #include <doctest/doctest.h>
#include "list.h"
#include "verify.h"
// 21. Merge Two Sorted Lists
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode dummy;
auto current = &dummy;
while (l1 && l2) {
if (l1->val <= l2->val) {
current->next = l1;
c... | 20.307692 | 55 | 0.545455 | codingpotato |
5ff73cb480bfc3269a2764df67e006225e5b9d8c | 236,523 | cc | C++ | src/protos/Docflow/DocflowV3.pb.cc | ltitbe/diadocsdk-cpp | 2f375a8ee6660a02ebf1b7917995e016dace96ef | [
"MIT"
] | 7 | 2016-05-31T17:37:54.000Z | 2022-01-17T14:28:18.000Z | src/protos/Docflow/DocflowV3.pb.cc | ltitbe/diadocsdk-cpp | 2f375a8ee6660a02ebf1b7917995e016dace96ef | [
"MIT"
] | 22 | 2017-02-07T09:34:02.000Z | 2021-09-06T08:08:34.000Z | src/protos/Docflow/DocflowV3.pb.cc | ltitbe/diadocsdk-cpp | 2f375a8ee6660a02ebf1b7917995e016dace96ef | [
"MIT"
] | 23 | 2016-06-07T06:11:47.000Z | 2020-10-06T13:00:21.000Z | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: Docflow/DocflowV3.proto
#define INTERNAL_SUPPRESS_PROTOBUF_FIELD_DEPRECATION
#include "Docflow/DocflowV3.pb.h"
#include <algorithm>
#include <google/protobuf/stubs/common.h>
#include <google/protobuf/stubs/once.h>
#include <google/protobuf/io/cod... | 37.271194 | 175 | 0.697133 | ltitbe |
5ffa024c40a0443955509fdc2a5e14238e3c0ee8 | 1,005 | cpp | C++ | Cxx-Primer/Solutions/ch08/ex8_08.cpp | memcpy0/CxxPrimer-Solutions | 423dc687054490f7897782908edc86871e2d6a7a | [
"Apache-2.0"
] | null | null | null | Cxx-Primer/Solutions/ch08/ex8_08.cpp | memcpy0/CxxPrimer-Solutions | 423dc687054490f7897782908edc86871e2d6a7a | [
"Apache-2.0"
] | null | null | null | Cxx-Primer/Solutions/ch08/ex8_08.cpp | memcpy0/CxxPrimer-Solutions | 423dc687054490f7897782908edc86871e2d6a7a | [
"Apache-2.0"
] | 1 | 2021-11-10T09:20:33.000Z | 2021-11-10T09:20:33.000Z | /* ex8_08.cpp
** Exercise 8.8
**
** Created by memcpy on 2021/10/16.
** @Brief Revise the program from the previous exercise to append its output to its given file.
** Run the program on the same output file at least twice to ensure that the data are preserved
** @See ex8_07.cpp
** @Run give a par... | 28.714286 | 104 | 0.624876 | memcpy0 |
2700cfc3a1ebf02756c294cba71fa8a057d4de9f | 317 | cpp | C++ | graphics.cpp | travmygit/fffrenderer | a7d713bc43745838fbfc6c2015439deac37ef14c | [
"MIT"
] | null | null | null | graphics.cpp | travmygit/fffrenderer | a7d713bc43745838fbfc6c2015439deac37ef14c | [
"MIT"
] | null | null | null | graphics.cpp | travmygit/fffrenderer | a7d713bc43745838fbfc6c2015439deac37ef14c | [
"MIT"
] | 1 | 2022-03-18T04:12:24.000Z | 2022-03-18T04:12:24.000Z | #include "graphics.h"
fff::Color fff::Color::White = fff::Color(255, 255, 255, 255);
fff::Color fff::Color::Black = fff::Color(0, 0, 0, 255);
fff::Color fff::Color::Red = fff::Color(255, 0, 0, 255);
fff::Color fff::Color::Green = fff::Color(0, 255, 0, 255);
fff::Color fff::Color::Blue = fff::Color(0, 0, 255, 255); | 39.625 | 62 | 0.630915 | travmygit |
dfeea373ab0e9302c1724cef0515ccd53e9ff5bb | 9,507 | cpp | C++ | Engine/Output/Graphics/Animation/TexturedAnimation/TexturedAnimation.cpp | gregory-vovchok/YEngine | e28552e52588bd90db01dd53e5fc817d0a26d146 | [
"BSD-2-Clause"
] | null | null | null | Engine/Output/Graphics/Animation/TexturedAnimation/TexturedAnimation.cpp | gregory-vovchok/YEngine | e28552e52588bd90db01dd53e5fc817d0a26d146 | [
"BSD-2-Clause"
] | null | null | null | Engine/Output/Graphics/Animation/TexturedAnimation/TexturedAnimation.cpp | gregory-vovchok/YEngine | e28552e52588bd90db01dd53e5fc817d0a26d146 | [
"BSD-2-Clause"
] | 1 | 2020-12-04T08:57:03.000Z | 2020-12-04T08:57:03.000Z | #include "TexturedAnimation.h"
#include <Engine/Output/File/File.h>
#include <Engine/Core/AssetLibrary/AssetLibrary.h>
#ifdef SendMessage
#undef SendMessage
#endif
StringANSI TexturedAnimation::texturedAnimationsSuffix = "t-anim";
StringANSI TexturedAnimation::texturedAnimationsDir = "/animations/t-animations/";
... | 22.058005 | 148 | 0.729357 | gregory-vovchok |
dff3116746428a60242bf1f1e0dc5327f48f3ec0 | 1,820 | cpp | C++ | week_06/01_particlesDrag/src/ofApp.cpp | bschorr/OFAnimation_Spring2015 | 869ededa36bf0bd432129e5a551db5d19d1f5d35 | [
"MIT"
] | 37 | 2015-01-28T13:20:19.000Z | 2021-04-02T02:50:35.000Z | week_06/01_particlesDrag/src/ofApp.cpp | bschorr/OFAnimation_Spring2015 | 869ededa36bf0bd432129e5a551db5d19d1f5d35 | [
"MIT"
] | null | null | null | week_06/01_particlesDrag/src/ofApp.cpp | bschorr/OFAnimation_Spring2015 | 869ededa36bf0bd432129e5a551db5d19d1f5d35 | [
"MIT"
] | 13 | 2015-02-06T23:16:22.000Z | 2018-02-03T14:44:06.000Z | #include "ofApp.h"
//--------------------------------------------------------------
void ofApp::setup(){
ofBackground(255);
gravity.set(0, 0.2);
color.set(0, 100, 255);
}
//--------------------------------------------------------------
void ofApp::update(){
for (int i = 0; i < particleList.s... | 22.469136 | 64 | 0.347253 | bschorr |
dff4c7070acd57b351fa184f13db9a0a837f26f1 | 638 | cpp | C++ | leetcode/binary-tree/257.(Recur)binary-tree-paths.cpp | saurabhraj042/dsaPrep | 0973a03bc565a2850003c7e48d99b97ff83b1d01 | [
"MIT"
] | 23 | 2021-10-30T04:11:52.000Z | 2021-11-27T09:16:18.000Z | leetcode/binary-tree/257.(Recur)binary-tree-paths.cpp | Pawanupadhyay10/placement-prep | 0449fa7cbc56e7933e6b090936ab7c15ca5f290f | [
"MIT"
] | null | null | null | leetcode/binary-tree/257.(Recur)binary-tree-paths.cpp | Pawanupadhyay10/placement-prep | 0449fa7cbc56e7933e6b090936ab7c15ca5f290f | [
"MIT"
] | 4 | 2021-10-30T03:26:05.000Z | 2021-11-14T12:15:04.000Z | // saurabhraj042
//https://leetcode.com/problems/binary-tree-paths/
class Solution {
public:
void trav(TreeNode* n,vector<string> &a,string s){
// whenever we reach the leaf node we push it in our ans
if(!n->left && !n->right){
a.push_back(s);
return;
}
if(n... | 25.52 | 74 | 0.548589 | saurabhraj042 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.