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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8633bd0b683be688cd6e306869a339be8a521d34 | 2,269 | cpp | C++ | tile.cpp | hardhat/letssplitup | c2ccd216fd2c90e95590536fe2a9ef688efc650b | [
"BSD-3-Clause"
] | 1 | 2021-05-14T22:09:29.000Z | 2021-05-14T22:09:29.000Z | tile.cpp | hardhat/letssplitup | c2ccd216fd2c90e95590536fe2a9ef688efc650b | [
"BSD-3-Clause"
] | 1 | 2020-05-09T03:26:15.000Z | 2020-05-09T14:51:08.000Z | tile.cpp | hardhat/letssplitup | c2ccd216fd2c90e95590536fe2a9ef688efc650b | [
"BSD-3-Clause"
] | null | null | null | #include <stdio.h>
#include "tile.h"
#include <SDL.h>
extern "C" {
#include <SDL_image.h>
}
#include <map>
#include "main.h"
#include "sprite.h"
struct Texture {
int w,h;
SDL_Texture *texture;
};
typedef std::map<std::string,int> TileNameMap;
typedef std::map<int,Texture *> TileTextureMap;
static TileNameMap ti... | 24.397849 | 175 | 0.702953 | hardhat |
8637bda3aa071b594aa91beaec8a2d30d0238041 | 6,814 | cpp | C++ | src/libs/gapi/Texture.cpp | JKot-Coder/OpenDemo | 8b9554914f5bab08df47e032486ca668a560c97c | [
"BSD-3-Clause"
] | null | null | null | src/libs/gapi/Texture.cpp | JKot-Coder/OpenDemo | 8b9554914f5bab08df47e032486ca668a560c97c | [
"BSD-3-Clause"
] | null | null | null | src/libs/gapi/Texture.cpp | JKot-Coder/OpenDemo | 8b9554914f5bab08df47e032486ca668a560c97c | [
"BSD-3-Clause"
] | null | null | null | #pragma once
#include "Texture.hpp"
#include "gapi/GpuResourceViews.hpp"
#include "gapi/MemoryAllocation.hpp"
#include "render/DeviceContext.hpp"
#include "common/Math.hpp"
#include "common/OnScopeExit.hpp"
namespace RR
{
namespace GAPI
{
namespace
{
GpuResourceFormat getViewFor... | 44.246753 | 233 | 0.620634 | JKot-Coder |
86390538891c8d7e02f42b6cbb2475461672dd92 | 2,177 | hpp | C++ | core/src/cogs/math/range_to_bits.hpp | cogmine/cogs | ef1c369a36a4f811704e0ced0493c3a6f8eca821 | [
"MIT"
] | 5 | 2019-02-08T15:59:14.000Z | 2022-01-22T19:12:33.000Z | core/src/cogs/math/range_to_bits.hpp | cogmine/cogs | ef1c369a36a4f811704e0ced0493c3a6f8eca821 | [
"MIT"
] | 1 | 2019-12-03T03:11:34.000Z | 2019-12-03T03:11:34.000Z | core/src/cogs/math/range_to_bits.hpp | cogmine/cogs | ef1c369a36a4f811704e0ced0493c3a6f8eca821 | [
"MIT"
] | null | null | null | //
// Copyright (C) 2000-2020 - Colen M. Garoutte-Carson <colen at cogmine.com>, Cog Mine LLC
//
// Status: Good
#ifndef COGS_HEADER_MATH_RANGE_TO_BITS
#define COGS_HEADER_MATH_RANGE_TO_BITS
#include "cogs/math/bytes_to_int.hpp"
#include "cogs/mem/int_parts.hpp"
namespace cogs {
/// @ingroup ConstMath
/// @bri... | 24.188889 | 134 | 0.738631 | cogmine |
863e5e9929eca946b17d0d05c3d5667da7be0ac7 | 407 | cpp | C++ | main.cpp | TheOpenDevProject/Community-Game | e23dd6a10e4fbe61d0bdd684d26ed3ad06514af6 | [
"MIT"
] | 3 | 2016-12-09T07:31:00.000Z | 2016-12-09T22:43:09.000Z | main.cpp | TheOpenDevProject/Community-Game | e23dd6a10e4fbe61d0bdd684d26ed3ad06514af6 | [
"MIT"
] | null | null | null | main.cpp | TheOpenDevProject/Community-Game | e23dd6a10e4fbe61d0bdd684d26ed3ad06514af6 | [
"MIT"
] | null | null | null | #include <QCoreApplication>
#include "gamewindow.h"
#include "testscene.h"
int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
//Maybe we pass this window to something, not sure if we need an extra layer yet.
std::unique_ptr<TestScene> testingScene(new TestScene);
GameWindow window;
... | 25.4375 | 85 | 0.700246 | TheOpenDevProject |
863fc4a2a1468281f94041e309f4cfa90d88bf62 | 573 | cpp | C++ | Uri-Online-Judge/cpp/1091 - Division of Nlogonia.cpp | ThiagoInocencio/Competitive-Programming-Solutions | efcabdd48d8c103ca619fff53db50aef0ea873d4 | [
"MIT"
] | 1 | 2020-06-07T22:08:42.000Z | 2020-06-07T22:08:42.000Z | Uri-Online-Judge/cpp/1091 - Division of Nlogonia.cpp | ThiagoInocencio/Competitive-Programming-Solutions | efcabdd48d8c103ca619fff53db50aef0ea873d4 | [
"MIT"
] | null | null | null | Uri-Online-Judge/cpp/1091 - Division of Nlogonia.cpp | ThiagoInocencio/Competitive-Programming-Solutions | efcabdd48d8c103ca619fff53db50aef0ea873d4 | [
"MIT"
] | null | null | null | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int K, N, M, X, Y, i;
while(cin >> K, K != 0) {
cin >> N >> M;
for(i = 0; i < K; i++) {
cin >> X >> Y;
if(X > N && Y > M)
printf("NE\n");
else if(X > N && Y < M)
... | 17.363636 | 35 | 0.324607 | ThiagoInocencio |
8640a9fe08df688c39223f7f43bbfbba7a3102ca | 2,297 | hpp | C++ | unused/outputStreamBoost.hpp | flexibity-team/boost-tools | a6c67eacf7374136f9903680308334fc3408ba91 | [
"MIT"
] | null | null | null | unused/outputStreamBoost.hpp | flexibity-team/boost-tools | a6c67eacf7374136f9903680308334fc3408ba91 | [
"MIT"
] | null | null | null | unused/outputStreamBoost.hpp | flexibity-team/boost-tools | a6c67eacf7374136f9903680308334fc3408ba91 | [
"MIT"
] | 2 | 2019-12-26T13:54:29.000Z | 2020-10-31T10:19:13.000Z | /*
* outputStreamBoost.hpp
*
* Created on: Jul 30, 2015
* Author: romeo
*/
#ifndef INCLUDE_FLEXIBITY_UNUSED_OUTPUTSTREAMBOOST_HPP_
#define INCLUDE_FLEXIBITY_UNUSED_OUTPUTSTREAMBOOST_HPP_
#include <flexibity/jsonrpc/tests/outputStream.hpp>
#include "flexibity/jsonrpc/jsonRpcBoost.hpp"
#include <memory>
nam... | 21.268519 | 80 | 0.651284 | flexibity-team |
8649b420886fee702d48dd0ee8ed2a17e2b22346 | 369 | hpp | C++ | hiro/reference/widget/horizontal-scroller.hpp | mp-lee/higan | c38a771f2272c3ee10fcb99f031e982989c08c60 | [
"Intel",
"ISC"
] | 38 | 2018-04-05T05:00:05.000Z | 2022-02-06T00:02:02.000Z | hiro/reference/widget/horizontal-scroller.hpp | ameer-bauer/higan-097 | a4a28968173ead8251cfa7cd6b5bf963ee68308f | [
"Info-ZIP"
] | 2 | 2015-10-06T14:59:48.000Z | 2022-01-27T08:57:57.000Z | hiro/reference/widget/horizontal-scroller.hpp | ameer-bauer/higan-097 | a4a28968173ead8251cfa7cd6b5bf963ee68308f | [
"Info-ZIP"
] | 8 | 2018-04-16T22:37:46.000Z | 2021-02-10T07:37:03.000Z | namespace phoenix {
struct pHorizontalScroller : public pWidget {
HorizontalScroller& horizontalScroller;
void setLength(unsigned length);
void setPosition(unsigned position);
pHorizontalScroller(HorizontalScroller& horizontalScroller) : pWidget(horizontalScroller), horizontalScroller(horizontalScroller) {}
... | 24.6 | 134 | 0.794038 | mp-lee |
864b11550741cf37faec2ae7ef2d3e888399fd29 | 3,545 | cpp | C++ | Eudora71/Imapdll/src/MyTypes.cpp | dusong7/eudora-win | 850a6619e6b0d5abc770bca8eb5f3b9001b7ccd2 | [
"BSD-3-Clause-Clear"
] | 10 | 2018-05-23T10:43:48.000Z | 2021-12-02T17:59:48.000Z | Windows/Eudora71/Imapdll/src/MyTypes.cpp | officialrafsan/EUDORA | bf43221f5663ec2338aaf90710a89d1490b92ed2 | [
"MIT"
] | 1 | 2019-03-19T03:56:36.000Z | 2021-05-26T18:36:03.000Z | Windows/Eudora71/Imapdll/src/MyTypes.cpp | officialrafsan/EUDORA | bf43221f5663ec2338aaf90710a89d1490b92ed2 | [
"MIT"
] | 11 | 2018-05-23T10:43:53.000Z | 2021-12-27T15:42:58.000Z | // MyTypes.cpp - Implementations of the utility class and structures for IMAP/
//
#include "stdafx.h"
#include "MyTypes.h"
#include "DebugNewHelpers.h"
// Internals!!
//
//=============== CPtrUidList will be replaced by CUidMap ==========================/
CMsgMap::~CMsgMap()
{
RemoveAll ();
}
// RemoveAll... | 15.548246 | 91 | 0.616079 | dusong7 |
8654a8a2d8b7052d45937dac4c4985208a84bb87 | 3,921 | hpp | C++ | include/Expression.hpp | fuchstraumer/CraftingInterpreters | c8787afe11bc963733dff8c61e4f53daaf7c5fc9 | [
"MIT"
] | null | null | null | include/Expression.hpp | fuchstraumer/CraftingInterpreters | c8787afe11bc963733dff8c61e4f53daaf7c5fc9 | [
"MIT"
] | null | null | null | include/Expression.hpp | fuchstraumer/CraftingInterpreters | c8787afe11bc963733dff8c61e4f53daaf7c5fc9 | [
"MIT"
] | null | null | null | #pragma once
#ifndef LOX_EXPRESSION_HPP
#define LOX_EXPRESSION_HPP
#include "Utility.hpp"
#include "Token.hpp"
#include <cstdint>
#include <limits>
#include <string>
#include <variant>
#include <concepts>
/*
Initial grammar:
expression -> literal | unary | binary | grouping ;
literal -> NUMBER | STRING | "true" | "f... | 25.796053 | 87 | 0.643458 | fuchstraumer |
8656f17ce795efeec922d44e3a82b4f96878b390 | 6,677 | cpp | C++ | workspace/PsstTest/src/Test.cpp | PeterSommerlad/workshopworkspace | 5e5eb9c42280a4aba27ee196d3003fd54a5e3607 | [
"MIT"
] | 2 | 2021-08-28T11:43:58.000Z | 2021-09-07T08:10:05.000Z | workspace/PsstTest/src/Test.cpp | PeterSommerlad/workshopworkspace | 5e5eb9c42280a4aba27ee196d3003fd54a5e3607 | [
"MIT"
] | null | null | null | workspace/PsstTest/src/Test.cpp | PeterSommerlad/workshopworkspace | 5e5eb9c42280a4aba27ee196d3003fd54a5e3607 | [
"MIT"
] | null | null | null | #include "psst.h"
#include "cute.h"
#include "ide_listener.h"
#include "xml_listener.h"
#include "cute_runner.h"
#include <string>
#include <stdexcept>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <utility>
#include <cstddef>
using namespace Psst;
struct Int: strong<int,Int>,ops<Int,Cmp,I... | 30.35 | 133 | 0.713045 | PeterSommerlad |
866045ba1fd59818cba0e6184d80fb3e638578f0 | 1,779 | hpp | C++ | PhysicsTestbeds/Physics2dCore/Collision/PrimitiveGeometry2d.hpp | jodavis42/ZeroPhysicsTestbed | e84a3f6faf16b7a4242dc049121b5338e80039f8 | [
"MIT"
] | null | null | null | PhysicsTestbeds/Physics2dCore/Collision/PrimitiveGeometry2d.hpp | jodavis42/ZeroPhysicsTestbed | e84a3f6faf16b7a4242dc049121b5338e80039f8 | [
"MIT"
] | null | null | null | PhysicsTestbeds/Physics2dCore/Collision/PrimitiveGeometry2d.hpp | jodavis42/ZeroPhysicsTestbed | e84a3f6faf16b7a4242dc049121b5338e80039f8 | [
"MIT"
] | null | null | null | #pragma once
#include "Physics2dCore/Physics2dCoreStandard.hpp"
#include "Collision/IntersectionInterval2d.hpp"
#include "Collision/IntersectionTypes2d.hpp"
namespace Physics2d
{
class Mesh2d;
class Manifold2d;
//-------------------------------------------------------------------PrimitiveGeometry2d
class Primitive... | 49.416667 | 205 | 0.775155 | jodavis42 |
8667f55edbd0a21f7e79ce19f3aae3f16f90ed73 | 13,406 | cpp | C++ | src/cpp/initialiser.cpp | mikhailiuk/Deep-Learning-Applied-To-Seismic-Data | 3c3a17b0db670fac71026717bb96277f22717d6f | [
"MIT"
] | 12 | 2018-03-19T21:56:52.000Z | 2022-03-09T00:31:53.000Z | src/cpp/initialiser.cpp | mikhailiuk/Deep-Learning-Applied-To-Seismic-Data | 3c3a17b0db670fac71026717bb96277f22717d6f | [
"MIT"
] | null | null | null | src/cpp/initialiser.cpp | mikhailiuk/Deep-Learning-Applied-To-Seismic-Data | 3c3a17b0db670fac71026717bb96277f22717d6f | [
"MIT"
] | 6 | 2018-01-13T07:07:19.000Z | 2020-04-03T03:21:06.000Z | // Author: Aliaksei Mikhailiuk, 2017.
#include "../headers/Initialiser.h"
int Initialiser::initialise(NeuralNetwork *&neuralNetwork,TrainingAlgorithm *Alg){
Config cfg;
ParamsInit parameters;
// Open config file, check for errors
try{
cfg.readFile("./config... | 41.504644 | 109 | 0.594137 | mikhailiuk |
866d4fca95d8819facaee161f2788d02a643df54 | 2,456 | cpp | C++ | src/event_loop.cpp | logikoisto/Skunk | 0856853495a792a12576a3e7167950d6e0d34efe | [
"MIT"
] | 3 | 2021-05-07T02:44:35.000Z | 2021-05-09T03:53:37.000Z | src/event_loop.cpp | logikoisto/Skunk | 0856853495a792a12576a3e7167950d6e0d34efe | [
"MIT"
] | null | null | null | src/event_loop.cpp | logikoisto/Skunk | 0856853495a792a12576a3e7167950d6e0d34efe | [
"MIT"
] | null | null | null | #include "event_loop.h"
#include <fcntl.h>
#include <memory>
#include "channel.h"
#include "poller.h"
#include "util/condition.h"
#include "util/mutex.h"
namespace zoo {
namespace skunk {
class Channel;
const int64_t kPollTimeMs = 1000;
EventLoop::EventLoop(bool is_main_loop)
: thread_(std::bind(&EventLoop::Loop... | 24.316832 | 74 | 0.645358 | logikoisto |
866d60dfcdc4e753b9077fd962ff4e74c7b79e43 | 1,439 | hpp | C++ | pomdog/experimental/skeletal2d/blendtrees/animation_graph.hpp | mogemimi/pomdog | 6dc6244d018f70d42e61c6118535cf94a9ee0618 | [
"MIT"
] | 163 | 2015-03-16T08:42:32.000Z | 2022-01-11T21:40:22.000Z | pomdog/experimental/skeletal2d/blendtrees/animation_graph.hpp | mogemimi/pomdog | 6dc6244d018f70d42e61c6118535cf94a9ee0618 | [
"MIT"
] | 17 | 2015-04-12T20:57:50.000Z | 2020-10-10T10:51:45.000Z | pomdog/experimental/skeletal2d/blendtrees/animation_graph.hpp | mogemimi/pomdog | 6dc6244d018f70d42e61c6118535cf94a9ee0618 | [
"MIT"
] | 21 | 2015-04-12T20:45:11.000Z | 2022-01-14T20:50:16.000Z | // Copyright mogemimi. Distributed under the MIT license.
#pragma once
#include "pomdog/basic/conditional_compilation.hpp"
#include "pomdog/experimental/skeletal2d/blendtrees/animation_blend_input.hpp"
#include "pomdog/experimental/skeletal2d/blendtrees/animation_node.hpp"
#include "pomdog/utility/assert.hpp"
POMDOG... | 29.367347 | 114 | 0.705351 | mogemimi |
8675804a54f9a72ff3938f1b25eb9b33489663af | 9,281 | cc | C++ | ithwrapper/ith/cli/main.cc | wareya/chiitrans | 7a392a304e6315cb4ecf836804512bb972090e8b | [
"Apache-2.0"
] | 71 | 2015-01-06T03:06:25.000Z | 2022-03-02T17:47:28.000Z | ithwrapper/ith/cli/main.cc | holemcross/chiitrans | c5e9aba5f555b1f81792d1dd4864b7efeb12f823 | [
"Apache-2.0"
] | 7 | 2015-01-14T15:08:41.000Z | 2018-11-20T18:18:15.000Z | ithwrapper/ith/cli/main.cc | holemcross/chiitrans | c5e9aba5f555b1f81792d1dd4864b7efeb12f823 | [
"Apache-2.0"
] | 35 | 2015-05-24T02:16:17.000Z | 2022-03-23T18:52:56.000Z | // main.cc
// 8/24/2013 jichi
// Branch: ITH_DLL/main.cpp, rev 128
// 8/24/2013 TODO: Clean up this file
#ifdef _MSC_VER
# pragma warning (disable:4100) // C4100: unreference formal parameter
# pragma warning (disable:4733) // C4733: Inline asm assigning to 'FS:0' : handler not registered as safe handler
#endif //... | 27.297059 | 115 | 0.655964 | wareya |
8677a60aa3dc6bc75db709b630b6bb682d84f647 | 28,240 | cpp | C++ | src/connect/postgres/postgres_avro_utils.cpp | eikeschumann971/kspp | e9665f0d7fb9c976c232393428d2d3e616db7eb5 | [
"BSL-1.0"
] | 103 | 2017-01-13T11:27:52.000Z | 2022-01-22T08:30:41.000Z | src/connect/postgres/postgres_avro_utils.cpp | eikeschumann971/kspp | e9665f0d7fb9c976c232393428d2d3e616db7eb5 | [
"BSL-1.0"
] | 26 | 2017-02-16T13:26:24.000Z | 2022-03-07T18:05:58.000Z | src/connect/postgres/postgres_avro_utils.cpp | eikeschumann971/kspp | e9665f0d7fb9c976c232393428d2d3e616db7eb5 | [
"BSL-1.0"
] | 24 | 2017-05-09T03:44:28.000Z | 2022-02-04T02:40:18.000Z | #include <kspp/connect/postgres/postgres_avro_utils.h>
#include <algorithm>
#include <string>
#include <glog/logging.h>
#include <avro/Specific.hh>
#include <avro/Encoder.hh>
#include <avro/Decoder.hh>
#include <avro/Compiler.hh>
#include <avro/Schema.hh>
#include <avro/AvroSerialize.hh>
#include <boost/algor... | 38.737997 | 157 | 0.542918 | eikeschumann971 |
86822be5cba9b80d875a6e361f9f5c813c9a1d79 | 6,106 | cpp | C++ | src/apps/mplayerc/PPageFileInfoClip.cpp | chinajeffery/MPC-BE--1.2.3 | 2229fde5535f565ba4a496a7f73267bd2c1ad338 | [
"MIT"
] | null | null | null | src/apps/mplayerc/PPageFileInfoClip.cpp | chinajeffery/MPC-BE--1.2.3 | 2229fde5535f565ba4a496a7f73267bd2c1ad338 | [
"MIT"
] | 1 | 2019-11-14T04:18:32.000Z | 2019-11-14T04:18:32.000Z | src/apps/mplayerc/PPageFileInfoClip.cpp | chinajeffery/MPC-BE--1.2.3 | 2229fde5535f565ba4a496a7f73267bd2c1ad338 | [
"MIT"
] | null | null | null | /*
* $Id: PPageFileInfoClip.cpp 2794 2013-05-27 01:40:05Z aleksoid $
*
* (C) 2003-2006 Gabest
* (C) 2006-2013 see Authors.txt
*
* This file is part of MPC-BE.
*
* MPC-BE 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 So... | 25.3361 | 117 | 0.679659 | chinajeffery |
86868f8fde23e03143f1b0b8b22bda835cc70e37 | 23,018 | hpp | C++ | diff.hpp | WindowsNT/mt | 9b29630aff17d33c7adb0adef21e1657b84f6b15 | [
"MIT"
] | 19 | 2019-04-11T14:51:18.000Z | 2022-03-05T13:25:24.000Z | diff.hpp | WindowsNT/mt | 9b29630aff17d33c7adb0adef21e1657b84f6b15 | [
"MIT"
] | 1 | 2018-12-14T13:42:46.000Z | 2018-12-15T09:42:21.000Z | diff.hpp | WindowsNT/mt | 9b29630aff17d33c7adb0adef21e1657b84f6b15 | [
"MIT"
] | 15 | 2019-05-05T20:20:47.000Z | 2022-03-05T13:25:27.000Z | // Diff Library
// Chourdakis Michael
#include <winsock2.h>
#include <windows.h>
#include <wininet.h>
#include <process.h>
#include <commctrl.h>
#include <stdio.h>
#include <shellapi.h>
#include <string>
#include <memory>
#include <vector>
#include <tchar.h>
#include <msrdc.h>
#include <comdef.h>
#include <atlbase.h>
... | 21.43203 | 148 | 0.596881 | WindowsNT |
868878341f16e8471bce3ea9efa7c5293af18512 | 2,058 | cpp | C++ | controller_manager/test/test_components/test_sensor.cpp | ckenwood/ros2_control | 7f879d7fed6905d7d59acf792d24d021d30ec8ba | [
"Apache-2.0"
] | null | null | null | controller_manager/test/test_components/test_sensor.cpp | ckenwood/ros2_control | 7f879d7fed6905d7d59acf792d24d021d30ec8ba | [
"Apache-2.0"
] | null | null | null | controller_manager/test/test_components/test_sensor.cpp | ckenwood/ros2_control | 7f879d7fed6905d7d59acf792d24d021d30ec8ba | [
"Apache-2.0"
] | null | null | null | // Copyright 2020 ros2_control Development Team
//
// 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 la... | 28.191781 | 90 | 0.74587 | ckenwood |
869704f5940f2c079bccbdffc9dcc44a23ae2423 | 4,875 | cpp | C++ | Project1/Main.cpp | TheTastyGravy/Double-Linked-List | 2b34bd750dd39a3e901bb232b17d9b7e8c89f93b | [
"MIT"
] | null | null | null | Project1/Main.cpp | TheTastyGravy/Double-Linked-List | 2b34bd750dd39a3e901bb232b17d9b7e8c89f93b | [
"MIT"
] | null | null | null | Project1/Main.cpp | TheTastyGravy/Double-Linked-List | 2b34bd750dd39a3e901bb232b17d9b7e8c89f93b | [
"MIT"
] | null | null | null | #include "raylib.h"
#include "DLList.h"
#include "ButtonClass.h"
#include "TextboxClass.h"
// A more general purpose function. PosX is the center, not left side
void drawTextNew(std::string text, int posX, int posY, int fontSize = 15, Color color = BLACK);
// Draw the lables and values of the current and adjasent nod... | 27.38764 | 95 | 0.669538 | TheTastyGravy |
86989cf38d7075b97ace64e9b4d62e5dd10547d4 | 8,363 | cpp | C++ | source/plugin/after_effects/win/ui.cpp | GregBakker/adobe-cc-codec-foundation | 302805206994c45675b77e4a8b137bdd487ae080 | [
"BSD-2-Clause"
] | 1 | 2019-09-07T12:50:20.000Z | 2019-09-07T12:50:20.000Z | source/plugin/after_effects/win/ui.cpp | codec-foundation/adobe-cc | 302805206994c45675b77e4a8b137bdd487ae080 | [
"BSD-2-Clause"
] | 10 | 2019-10-10T00:49:03.000Z | 2020-07-10T10:42:46.000Z | source/plugin/after_effects/win/ui.cpp | codec-foundation/adobe-cc | 302805206994c45675b77e4a8b137bdd487ae080 | [
"BSD-2-Clause"
] | 1 | 2019-09-04T17:01:45.000Z | 2019-09-04T17:01:45.000Z | #include "../ui.h"
#include <stdint.h>
#include <vector>
#include <Windows.h>
#include "codec_registration.hpp"
// dialog comtrols
enum : int32_t {
OUT_noUI = -1,
OUT_OK = IDOK,
OUT_Cancel = IDCANCEL,
OUT_SubTypes_Menu = 3,
OUT_SubTypes_Label = 4,
OUT_Quality_Menu = 5,
OUT_Qual... | 38.362385 | 140 | 0.478895 | GregBakker |
869dad075b438fe3daeae7b77aaa6419d1060268 | 2,114 | hpp | C++ | query_optimizer/LogicalToPhysicalMapper.hpp | Hacker0912/quickstep-datalog | 1de22e7ab787b5efa619861a167a097ff6a4f549 | [
"Apache-2.0"
] | 82 | 2016-04-18T03:59:06.000Z | 2019-02-04T11:46:08.000Z | query_optimizer/LogicalToPhysicalMapper.hpp | Hacker0912/quickstep-datalog | 1de22e7ab787b5efa619861a167a097ff6a4f549 | [
"Apache-2.0"
] | 265 | 2016-04-19T17:52:43.000Z | 2018-10-11T17:55:08.000Z | query_optimizer/LogicalToPhysicalMapper.hpp | Hacker0912/quickstep-datalog | 1de22e7ab787b5efa619861a167a097ff6a4f549 | [
"Apache-2.0"
] | 68 | 2016-04-18T05:00:34.000Z | 2018-10-30T12:41:02.000Z | /**
* 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... | 30.637681 | 75 | 0.747871 | Hacker0912 |
86a4c62482bd3440ff9342598c267d0afe4baf07 | 36,082 | cpp | C++ | source/LibFgBase/src/FgCmdMeshops.cpp | MikhailGorobets/FaceGenBaseLibrary | 3ea688f9e3811943adb18e23e7bb2addc5f688a5 | [
"MIT"
] | null | null | null | source/LibFgBase/src/FgCmdMeshops.cpp | MikhailGorobets/FaceGenBaseLibrary | 3ea688f9e3811943adb18e23e7bb2addc5f688a5 | [
"MIT"
] | null | null | null | source/LibFgBase/src/FgCmdMeshops.cpp | MikhailGorobets/FaceGenBaseLibrary | 3ea688f9e3811943adb18e23e7bb2addc5f688a5 | [
"MIT"
] | 1 | 2020-05-27T17:23:50.000Z | 2020-05-27T17:23:50.000Z | //
// Coypright (c) 2020 Singular Inversions Inc. (facegen.com)
// Use, modification and distribution is subject to the MIT License,
// see accompanying file LICENSE.txt or facegen.com/base_library_license.txt
//
#include "stdafx.h"
#include "FgCommand.hpp"
#include "FgSyntax.hpp"
#include "Fg3dMeshIo.hpp"
... | 35.51378 | 128 | 0.539438 | MikhailGorobets |
86a8b695a80adb549baeea0066c73d6c83c73651 | 11,899 | cpp | C++ | code/src/Core/Math/Matrix.cpp | Arzana/Plutonium | 5a17c93e5072ac291b96347a4df196e1609fabe2 | [
"MIT"
] | 4 | 2019-03-21T16:02:03.000Z | 2020-04-09T08:53:29.000Z | code/src/Core/Math/Matrix.cpp | Arzana/Plutonium | 5a17c93e5072ac291b96347a4df196e1609fabe2 | [
"MIT"
] | 24 | 2018-04-06T08:25:17.000Z | 2020-10-19T11:01:09.000Z | code/src/Core/Math/Matrix.cpp | Arzana/Plutonium | 5a17c93e5072ac291b96347a4df196e1609fabe2 | [
"MIT"
] | null | null | null | #include "Core\Math\Matrix.h"
inline float det33(float a, float b, float c, float d, float e, float f, float g, float h, float i)
{
return a * e * i + b * f * g + c * d * h - c * e * g - b * d * i - a * f * h;
}
Pu::Matrix Pu::Matrix::CreateFrom3x3(const Matrix3 & matrix, Vector3 translation)
{
return Matrix(
mat... | 33.900285 | 136 | 0.604336 | Arzana |
86aecf99aebdb82c77a9d3e0a7f7cccb94bc0d27 | 831 | cpp | C++ | src/PyZPK/zk_proof_systems/ppzksnark/r1cs_gg_ppzksnark/run_r1cs_gg_ppzksnark.cpp | gargarchit/PyZPK | 682c20efc6ae5d7bf705f9fcbcbf003d9e382412 | [
"Apache-2.0"
] | 4 | 2020-05-21T13:55:33.000Z | 2020-08-17T00:59:29.000Z | src/PyZPK/zk_proof_systems/ppzksnark/r1cs_gg_ppzksnark/run_r1cs_gg_ppzksnark.cpp | gargarchit/PyZPK | 682c20efc6ae5d7bf705f9fcbcbf003d9e382412 | [
"Apache-2.0"
] | 1 | 2020-07-21T07:37:59.000Z | 2020-07-21T07:39:14.000Z | src/PyZPK/zk_proof_systems/ppzksnark/r1cs_gg_ppzksnark/run_r1cs_gg_ppzksnark.cpp | gargarchit/PyZPK | 682c20efc6ae5d7bf705f9fcbcbf003d9e382412 | [
"Apache-2.0"
] | null | null | null | #include <pybind11/pybind11.h>
#include <pybind11/stl.h>
#include <pybind11/stl_bind.h>
#include <libsnark/common/default_types/r1cs_gg_ppzksnark_pp.hpp>
#include <libsnark/zk_proof_systems/ppzksnark/r1cs_gg_ppzksnark/examples/run_r1cs_gg_ppzksnark.hpp>
namespace py = pybind11;
using namespace libsnark;
using namespace... | 39.571429 | 115 | 0.78941 | gargarchit |
86b392ea56b62ae052a3e7750b6054c5690e36cd | 10,612 | hpp | C++ | include/GlobalNamespace/WaypointData.hpp | RedBrumbler/BeatSaber-Quest-Codegen | 73dda50b5a3e51f10d86b766dcaa24b0c6226e25 | [
"Unlicense"
] | null | null | null | include/GlobalNamespace/WaypointData.hpp | RedBrumbler/BeatSaber-Quest-Codegen | 73dda50b5a3e51f10d86b766dcaa24b0c6226e25 | [
"Unlicense"
] | null | null | null | include/GlobalNamespace/WaypointData.hpp | RedBrumbler/BeatSaber-Quest-Codegen | 73dda50b5a3e51f10d86b766dcaa24b0c6226e25 | [
"Unlicense"
] | null | null | null | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "beatsaber-hook/shared/utils/typedefs.h"
#include "beatsaber-hook/shared/utils/byref.hpp"
// Including type: BeatmapObjectData
#include ... | 53.326633 | 202 | 0.74199 | RedBrumbler |
86b507e1b770148c9724552ec70a16a269e859a1 | 15,471 | cpp | C++ | SpatialGDK/Source/SpatialGDK/Private/LoadBalancing/LayeredLBStrategy.cpp | cyberbibby/UnrealGDK | 9502a1ba11d21b3cb64978ba7ea178c63371cdd0 | [
"MIT"
] | null | null | null | SpatialGDK/Source/SpatialGDK/Private/LoadBalancing/LayeredLBStrategy.cpp | cyberbibby/UnrealGDK | 9502a1ba11d21b3cb64978ba7ea178c63371cdd0 | [
"MIT"
] | null | null | null | SpatialGDK/Source/SpatialGDK/Private/LoadBalancing/LayeredLBStrategy.cpp | cyberbibby/UnrealGDK | 9502a1ba11d21b3cb64978ba7ea178c63371cdd0 | [
"MIT"
] | null | null | null | // Copyright (c) Improbable Worlds Ltd, All Rights Reserved
#include "LoadBalancing/LayeredLBStrategy.h"
#include "EngineClasses/SpatialNetDriver.h"
#include "EngineClasses/SpatialWorldSettings.h"
#include "LoadBalancing/GridBasedLBStrategy.h"
#include "Schema/ActorGroupMember.h"
#include "Utils/LayerInfo.h"
#include... | 33.487013 | 134 | 0.772348 | cyberbibby |
86bfb1f48e1281c8f0419c41566e0bbb4a7e6b19 | 1,660 | cpp | C++ | LeetCodeCPP/_1177. Can Make Palindrome from Substring/main.cpp | 18600130137/leetcode | fd2dc72c0b85da50269732f0fcf91326c4787d3a | [
"Apache-2.0"
] | 1 | 2019-03-29T03:33:56.000Z | 2019-03-29T03:33:56.000Z | LeetCodeCPP/_1177. Can Make Palindrome from Substring/main.cpp | 18600130137/leetcode | fd2dc72c0b85da50269732f0fcf91326c4787d3a | [
"Apache-2.0"
] | null | null | null | LeetCodeCPP/_1177. Can Make Palindrome from Substring/main.cpp | 18600130137/leetcode | fd2dc72c0b85da50269732f0fcf91326c4787d3a | [
"Apache-2.0"
] | null | null | null | //
// main.cpp
// _1177. Can Make Palindrome from Substring
//
// Created by admin on 2019/9/5.
// Copyright © 2019年 liu. All rights reserved.
//
#include <iostream>
#include <bitset>
#include <vector>
using namespace std;
class Solution {
public:
vector<bool> canMakePaliQueries1(string s, vector<vector<... | 25.151515 | 78 | 0.496988 | 18600130137 |
86c44bd72de8914c743ad3106ff5cc9d4a4d7a83 | 8,390 | hpp | C++ | src/polynomials/include/boost_polynomials.hpp | dkavolis/polynomials | 10abe0ca8bdd3ae7dafc1ecd04142b42e3213af0 | [
"MIT"
] | null | null | null | src/polynomials/include/boost_polynomials.hpp | dkavolis/polynomials | 10abe0ca8bdd3ae7dafc1ecd04142b42e3213af0 | [
"MIT"
] | null | null | null | src/polynomials/include/boost_polynomials.hpp | dkavolis/polynomials | 10abe0ca8bdd3ae7dafc1ecd04142b42e3213af0 | [
"MIT"
] | null | null | null | /**
* Copyright (c) 2022 <Daumantas Kavolis>
*
* 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... | 36.960352 | 100 | 0.695948 | dkavolis |
86c5310383f15976dd3059284daa756cf30d7cc0 | 3,919 | hpp | C++ | odeint/border/element_border.hpp | hmito/hmLib | 0f2515ba9c99c06d02e2fa633eeae73bcd793983 | [
"MIT"
] | null | null | null | odeint/border/element_border.hpp | hmito/hmLib | 0f2515ba9c99c06d02e2fa633eeae73bcd793983 | [
"MIT"
] | null | null | null | odeint/border/element_border.hpp | hmito/hmLib | 0f2515ba9c99c06d02e2fa633eeae73bcd793983 | [
"MIT"
] | 1 | 2015-09-22T03:32:11.000Z | 2015-09-22T03:32:11.000Z | #ifndef HMLIB_ODEINT_BORDER_ELEMENTBORDER_INC
#define HMLIB_ODEINT_BORDER_ELEMENTBORDER_INC 100
#
#include <functional>
#include <boost/range.hpp>
namespace hmLib {
namespace odeint {
template<typename value_type>
struct lower_border {
public:
lower_border() = default;
lower_border(size_t pos_, value_type ... | 26.842466 | 95 | 0.609339 | hmito |
86c6206360f2ecc6fd716d82985a42d8bf85b37a | 1,176 | cpp | C++ | cpp/441-450/Number of Boomerangs.cpp | KaiyuWei/leetcode | fd61f5df60cfc7086f7e85774704bacacb4aaa5c | [
"MIT"
] | 150 | 2015-04-04T06:53:49.000Z | 2022-03-21T13:32:08.000Z | cpp/441-450/Number of Boomerangs.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 1 | 2015-04-13T15:15:40.000Z | 2015-04-21T20:23:16.000Z | cpp/441-450/Number of Boomerangs.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 64 | 2015-06-30T08:00:07.000Z | 2022-01-01T16:44:14.000Z | class Solution {
public:
int numberOfBoomerangs(vector<pair<int, int>>& points) {
int res = 0;
// iterate over all the points
for (int i = 0; i < points.size(); ++i) {
unordered_map<long, int> group;
// iterate over all points other than points[i]
f... | 28.682927 | 77 | 0.406463 | KaiyuWei |
86c721c5736573b18c65b31aeff87d68007eefab | 1,397 | cpp | C++ | ComplitaionLinux/OC_stage2.cpp | Picrik/GameDevC- | ddc46b60605da490e9bfaf838ef7ef3ee0757eb1 | [
"MIT"
] | null | null | null | ComplitaionLinux/OC_stage2.cpp | Picrik/GameDevC- | ddc46b60605da490e9bfaf838ef7ef3ee0757eb1 | [
"MIT"
] | null | null | null | ComplitaionLinux/OC_stage2.cpp | Picrik/GameDevC- | ddc46b60605da490e9bfaf838ef7ef3ee0757eb1 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int ajouteDeux(int nombreRecu)
{
int valeur(nombreRecu +2);
return valeur;
}
void direBonjour()
{
cout << "dire bonjour" << endl;
}
int main()
{
int a(4), b(5);
cout << "a vaut : " << a << " et be vaut :" << b << endl;
cout << "affectaton" << endl;
... | 18.878378 | 91 | 0.518969 | Picrik |
f866f21894d93c951f0a51d201a1c9291bb5afbf | 88 | cpp | C++ | engine/source/PADO/PADO_Component.cpp | Goldenbough44/PADO | a0fac1bb1cb61bafd27e11ac7046ef6ec49160d6 | [
"MIT"
] | 1 | 2021-08-13T04:39:53.000Z | 2021-08-13T04:39:53.000Z | engine/source/PADO/PADO_Component.cpp | Goldenbough44/PADO | a0fac1bb1cb61bafd27e11ac7046ef6ec49160d6 | [
"MIT"
] | 2 | 2021-08-13T04:49:02.000Z | 2022-03-25T19:20:56.000Z | engine/source/PADO/PADO_Component.cpp | Goldenbough44/PADO | a0fac1bb1cb61bafd27e11ac7046ef6ec49160d6 | [
"MIT"
] | null | null | null | //
// (c) 2019 Highwater Games Co. All Rights Reserved.
//
#include "PADO_Component.h"
| 14.666667 | 52 | 0.681818 | Goldenbough44 |
f8698d0b28282e76ad0465d9a04f96f3150c0baa | 1,861 | cpp | C++ | src/bin/exrmaketiled/Image.cpp | remia/openexr | 566087f13259f4429d55125d1001b2696ac2bfc3 | [
"BSD-3-Clause"
] | 587 | 2015-01-04T09:56:19.000Z | 2019-11-21T13:23:33.000Z | third_party/openexr-672c77d7c923402f549371e08b39ece4552cbb85/src/bin/exrmaketiled/Image.cpp | Vertexwahn/FlatlandRT | 37d09fde38b25eff5f802200b43628efbd1e3198 | [
"Apache-2.0"
] | 360 | 2015-01-04T10:55:17.000Z | 2019-11-21T16:37:22.000Z | third_party/openexr-672c77d7c923402f549371e08b39ece4552cbb85/src/bin/exrmaketiled/Image.cpp | Vertexwahn/FlatlandRT | 37d09fde38b25eff5f802200b43628efbd1e3198 | [
"Apache-2.0"
] | 297 | 2015-01-11T12:06:42.000Z | 2019-11-19T21:59:57.000Z | //
// SPDX-License-Identifier: BSD-3-Clause
// Copyright (c) Contributors to the OpenEXR Project.
//
//----------------------------------------------------------------------------
//
// Classes for storing OpenEXR images in memory.
//
//----------------------------------------------------------------------------
#inc... | 20.910112 | 78 | 0.559377 | remia |
f86f7649896ed418d789bcfd4687a381c569e846 | 24,608 | cpp | C++ | src/EvtGenModels/EvtISGW2.cpp | qdcampagna/BTODSTARLNUNP_EVTGEN_Model | 9623a0ffe2625450a1228a80d6baae74ed6c0965 | [
"CC0-1.0"
] | null | null | null | src/EvtGenModels/EvtISGW2.cpp | qdcampagna/BTODSTARLNUNP_EVTGEN_Model | 9623a0ffe2625450a1228a80d6baae74ed6c0965 | [
"CC0-1.0"
] | null | null | null | src/EvtGenModels/EvtISGW2.cpp | qdcampagna/BTODSTARLNUNP_EVTGEN_Model | 9623a0ffe2625450a1228a80d6baae74ed6c0965 | [
"CC0-1.0"
] | null | null | null |
/***********************************************************************
* Copyright 1998-2020 CERN for the benefit of the EvtGen authors *
* *
* This file is part of EvtGen. *
* ... | 33.480272 | 81 | 0.42474 | qdcampagna |
f8754b22c2c9ad302c1dae607a9a6d960f7b98e4 | 4,812 | hpp | C++ | src/image_processing/grid.hpp | Gusgo99/Fourier_drawing | 24048863ae9faabcf5db928e09cdc258f5017b2c | [
"MIT"
] | null | null | null | src/image_processing/grid.hpp | Gusgo99/Fourier_drawing | 24048863ae9faabcf5db928e09cdc258f5017b2c | [
"MIT"
] | null | null | null | src/image_processing/grid.hpp | Gusgo99/Fourier_drawing | 24048863ae9faabcf5db928e09cdc258f5017b2c | [
"MIT"
] | null | null | null | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
MIT License
Copyright (c) 2020 Gustavo Pacola Gonçalves
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to d... | 35.382353 | 110 | 0.718204 | Gusgo99 |
f8761ee0cd720565e27b13990b4641d03efd4515 | 4,014 | hpp | C++ | include/Hord/IO/PropTypeIterator.hpp | komiga/hord | 32be8ffb11bd74959c5cd5254e36d87f224b6f60 | [
"MIT"
] | null | null | null | include/Hord/IO/PropTypeIterator.hpp | komiga/hord | 32be8ffb11bd74959c5cd5254e36d87f224b6f60 | [
"MIT"
] | null | null | null | include/Hord/IO/PropTypeIterator.hpp | komiga/hord | 32be8ffb11bd74959c5cd5254e36d87f224b6f60 | [
"MIT"
] | null | null | null | /**
@copyright MIT license; see @ref index or the accompanying LICENSE file.
@file
@brief PropType iterator.
@ingroup prop
*/
#pragma once
#include <Hord/config.hpp>
#include <Hord/utility.hpp>
#include <Hord/IO/Defs.hpp>
#include <duct/utility.hpp>
#include <type_traits>
namespace Hord {
namespace IO {
// Forwa... | 17.376623 | 72 | 0.673144 | komiga |
f878e48779a25bfad72d49a2b0b3ac46baafd08e | 4,404 | hpp | C++ | SDK/ARKSurvivalEvolved_IsFlying_DK_classes.hpp | 2bite/ARK-SDK | c38ca9925309516b2093ad8c3a70ed9489e1d573 | [
"MIT"
] | 10 | 2020-02-17T19:08:46.000Z | 2021-07-31T11:07:19.000Z | SDK/ARKSurvivalEvolved_IsFlying_DK_classes.hpp | 2bite/ARK-SDK | c38ca9925309516b2093ad8c3a70ed9489e1d573 | [
"MIT"
] | 9 | 2020-02-17T18:15:41.000Z | 2021-06-06T19:17:34.000Z | SDK/ARKSurvivalEvolved_IsFlying_DK_classes.hpp | 2bite/ARK-SDK | c38ca9925309516b2093ad8c3a70ed9489e1d573 | [
"MIT"
] | 3 | 2020-07-22T17:42:07.000Z | 2021-06-19T17:16:13.000Z | #pragma once
// ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_IsFlying_DK_structs.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Classes
//-------------------------------------------------------------... | 72.196721 | 192 | 0.576067 | 2bite |
f87a8571bd3a0a6c949b9ea1bd0da477907e674b | 894 | hpp | C++ | engine/src/TransitionManager.hpp | skryabiin/core | 13bcdd0c9f3ebcc4954b9ee05ea95db0f77e16f7 | [
"MIT"
] | null | null | null | engine/src/TransitionManager.hpp | skryabiin/core | 13bcdd0c9f3ebcc4954b9ee05ea95db0f77e16f7 | [
"MIT"
] | null | null | null | engine/src/TransitionManager.hpp | skryabiin/core | 13bcdd0c9f3ebcc4954b9ee05ea95db0f77e16f7 | [
"MIT"
] | null | null | null | #ifndef CORE_TRANSITION_MANAGER_HPP
#define CORE_TRANSITION_MANAGER_HPP
#include "Templates.hpp"
#include "RuntimeContext.hpp"
#include "LuaState.hpp"
#include "Transition.hpp"
namespace core {
class TransitionManager : public initializable<TransitionManager, void, void, void, void>, public singleton<Transition... | 19.021277 | 225 | 0.760626 | skryabiin |
f87c02bce0df83d52dde121d9a4cbdd6f4fce4ff | 1,230 | cpp | C++ | 72_edit-distance.cpp | yzhhome/leetcode_cpp | 69404b039848e9e43ace80c43243f04b037a1fa1 | [
"MIT"
] | null | null | null | 72_edit-distance.cpp | yzhhome/leetcode_cpp | 69404b039848e9e43ace80c43243f04b037a1fa1 | [
"MIT"
] | null | null | null | 72_edit-distance.cpp | yzhhome/leetcode_cpp | 69404b039848e9e43ace80c43243f04b037a1fa1 | [
"MIT"
] | null | null | null | /*
72. 编辑距离
https://leetcode-cn.com/problems/edit-distance/
*/
#include <iostream>
#include <vector>
using namespace std;
// 最小编辑距离动态规划解法
int minDistance(string word1, string word2) {
int l1 = word1.size();
int l2 = word2.size();
// dp初始化为全0的l1 * l2容器
vector<vector<int>> dp(l1 + 1, vector<in... | 24.6 | 86 | 0.437398 | yzhhome |
f87c59038dbdc3525019a60281da59ac0cc4b014 | 3,176 | hh | C++ | commands/function-cmd.hh | lukas-ke/faint-graphics-editor | 33eb9e6a3f2216fb2cf6ef9709a14f3d20b78fbf | [
"Apache-2.0"
] | 10 | 2016-12-28T22:06:31.000Z | 2021-05-24T13:42:30.000Z | commands/function-cmd.hh | lukas-ke/faint-graphics-editor | 33eb9e6a3f2216fb2cf6ef9709a14f3d20b78fbf | [
"Apache-2.0"
] | 4 | 2015-10-09T23:55:10.000Z | 2020-04-04T08:09:22.000Z | commands/function-cmd.hh | lukas-ke/faint-graphics-editor | 33eb9e6a3f2216fb2cf6ef9709a14f3d20b78fbf | [
"Apache-2.0"
] | null | null | null | // -*- coding: us-ascii-unix -*-
// Copyright 2012 Lukas Kemmer
//
// 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 a... | 29.407407 | 79 | 0.707179 | lukas-ke |
f885832ffdb632c4dec78a43ac799bfe3ebd64e1 | 502 | cpp | C++ | GameDevelop/Source/Physics/Physics2D.cpp | Andapeng/GameEngineDevelop | c868dc453ca8e4191ff5180eb90aafbf71112f68 | [
"MIT"
] | null | null | null | GameDevelop/Source/Physics/Physics2D.cpp | Andapeng/GameEngineDevelop | c868dc453ca8e4191ff5180eb90aafbf71112f68 | [
"MIT"
] | null | null | null | GameDevelop/Source/Physics/Physics2D.cpp | Andapeng/GameEngineDevelop | c868dc453ca8e4191ff5180eb90aafbf71112f68 | [
"MIT"
] | null | null | null | #include "Physics2D.h"
int CheckCollision(int One_x1, int One_y1, int One_x2, int One_y2, int Two_x1, int Two_y1, int Two_x2, int Two_y2)
{
bool xIsCollide = (One_x1 < Two_x1) && (One_x2 > Two_x2);
bool yIsCollide = (One_y1 < Two_y1) && (One_y2 > Two_y2);
return xIsCollide && yIsCollide;
}
int CheckCollision(Coll... | 33.466667 | 135 | 0.739044 | Andapeng |
f887c3054c69e0ff42cbd0abdd24dc783099b433 | 782 | cpp | C++ | code/test8/2.cpp | Bc-Gg/Algorithms | 0c35fd4e002ff4b0ad6ebb243df3df278e366595 | [
"MIT"
] | 8 | 2022-03-13T10:25:33.000Z | 2022-03-30T08:26:00.000Z | code/test8/2.cpp | Bc-Gg/Algorithms | 0c35fd4e002ff4b0ad6ebb243df3df278e366595 | [
"MIT"
] | null | null | null | code/test8/2.cpp | Bc-Gg/Algorithms | 0c35fd4e002ff4b0ad6ebb243df3df278e366595 | [
"MIT"
] | 2 | 2022-03-20T12:09:52.000Z | 2022-03-21T03:43:01.000Z | # include<iostream>
# include<algorithm>
using namespace std;
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
const int N =105;
int vis[N][N], g[N][N];
int col, row;
void dfs(int i , int j){
if(i <= col && j <= row && i >0 && j>0)
vis[i][j] = 1;
for(int k = 0 ;k < 4 ;k++){
if(!vis[i+dx[k]]... | 21.722222 | 57 | 0.378517 | Bc-Gg |
f8893dd9392e81ec9f2ed81473be878268a30ab5 | 2,747 | hpp | C++ | include/chemfiles/selections/parser.hpp | sguionni/chemfiles | 99486730d4849656308516c6f7ed60b74fd575bc | [
"BSD-3-Clause"
] | null | null | null | include/chemfiles/selections/parser.hpp | sguionni/chemfiles | 99486730d4849656308516c6f7ed60b74fd575bc | [
"BSD-3-Clause"
] | null | null | null | include/chemfiles/selections/parser.hpp | sguionni/chemfiles | 99486730d4849656308516c6f7ed60b74fd575bc | [
"BSD-3-Clause"
] | null | null | null | // Chemfiles, a modern library for chemistry file reading and writing
// Copyright (C) Guillaume Fraux and contributors -- BSD license
#ifndef CHEMFILES_SELECTION_PARSER_HPP
#define CHEMFILES_SELECTION_PARSER_HPP
#include <string>
#include <vector>
#include <cassert>
#include "chemfiles/selections/lexer.hpp"
#includ... | 26.413462 | 79 | 0.643611 | sguionni |
f88c9d57f3830dad0466c233cdb3b6db27f0215e | 2,770 | hpp | C++ | Server/includes/Systems/BonusSystem.hpp | KillianG/R-Type | e3fd801ae58fcea49ac75c400ec0a2837cb0da2e | [
"MIT"
] | 1 | 2019-08-14T12:31:50.000Z | 2019-08-14T12:31:50.000Z | Server/includes/Systems/BonusSystem.hpp | KillianG/R-Type | e3fd801ae58fcea49ac75c400ec0a2837cb0da2e | [
"MIT"
] | null | null | null | Server/includes/Systems/BonusSystem.hpp | KillianG/R-Type | e3fd801ae58fcea49ac75c400ec0a2837cb0da2e | [
"MIT"
] | null | null | null | /*
** EPITECH PROJECT, 2018
** Epitech scolarship project (4 years remaining)
** File description:
** Made on 2018/11 by ebernard
*/
#pragma once
#include "../../../libs/ECS/Manager.hpp"
#include "../../../libs/EventManager/EventManager.hpp"
#include "GameComponents.hpp"
#include "GameEvents.hpp"
class BonusSys... | 36.447368 | 104 | 0.60361 | KillianG |
f88cf1e0093ec3289eaf3254e290d4a1dfafab9a | 793 | inl | C++ | rGWB/csmassert.inl | mfernba/rGWB | 346de75519b1752c1ac9bea8ad7e5526096506ca | [
"MIT"
] | 10 | 2017-11-23T14:14:04.000Z | 2022-03-14T20:22:30.000Z | rGWB/csmassert.inl | mfernba/rGWB | 346de75519b1752c1ac9bea8ad7e5526096506ca | [
"MIT"
] | null | null | null | rGWB/csmassert.inl | mfernba/rGWB | 346de75519b1752c1ac9bea8ad7e5526096506ca | [
"MIT"
] | 1 | 2020-11-30T14:35:09.000Z | 2020-11-30T14:35:09.000Z | //
// sm4dblist.h
// solidmodeling4
//
// Created by Manuel Fernandez on 1/2/15.
// Copyright (c) 2015 manueru. All rights reserved.
//
// An implementation of Martti Mäntylä Geometric Workbench
//
// Assertion management module.
//
#ifdef RGWB_STANDALONE_DISTRIBUTABLE
#undef assert
#include "csm... | 30.5 | 119 | 0.751576 | mfernba |
f88de24b9c5196b7686062cea0cea3c0bda05f90 | 2,526 | cpp | C++ | test/DigraphDot.cpp | cestlascorpion/Scorpion | c7175a0279f8d1eba2be7ba1758ddcd8fec25073 | [
"MIT"
] | null | null | null | test/DigraphDot.cpp | cestlascorpion/Scorpion | c7175a0279f8d1eba2be7ba1758ddcd8fec25073 | [
"MIT"
] | null | null | null | test/DigraphDot.cpp | cestlascorpion/Scorpion | c7175a0279f8d1eba2be7ba1758ddcd8fec25073 | [
"MIT"
] | null | null | null | #include "DigraphDot.h"
using namespace std;
using namespace Scorpion;
struct MySQLNode {
void operator()(DotNode *node) {
node->_label = "mysql\n" + node->_name;
node->_attr["shape"] = "ellipse";
node->_attr["style"] = "solid";
node->_attr["fontsize"] = "14";
}
};
struct Redi... | 30.804878 | 80 | 0.529691 | cestlascorpion |
f8925dee374fa25dc2b24c2f168137a77b03016b | 4,235 | cpp | C++ | common/type_system/state.cpp | doctashay/jak-project | bc0d2b0105518dd260144719cb6ac1f97e5624ad | [
"0BSD"
] | null | null | null | common/type_system/state.cpp | doctashay/jak-project | bc0d2b0105518dd260144719cb6ac1f97e5624ad | [
"0BSD"
] | 6 | 2021-02-08T06:11:47.000Z | 2022-03-14T06:02:18.000Z | common/type_system/state.cpp | doctashay/jak-project | bc0d2b0105518dd260144719cb6ac1f97e5624ad | [
"0BSD"
] | null | null | null | #include "state.h"
#include "common/type_system/TypeSystem.h"
/*!
* Convert a (state <blah> ...) to the function required to go. Must be state.
*/
TypeSpec state_to_go_function(const TypeSpec& state_type, const TypeSpec& return_type) {
assert(state_type.base_type() == "state");
std::vector<TypeSpec> arg_types;
... | 31.604478 | 99 | 0.638489 | doctashay |
f892fe7fe9e41c7f902a7e9cd70f3c0619dc0dd1 | 1,241 | cpp | C++ | LeetCode/Problems/Algorithms/#236_LowestCommonAncestorOfABinaryTree_sol3_common_path_from_root_with_parents_and_levels_O(N)_time_O(N)_extra_space_32ms_21.1MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | 1 | 2022-01-26T14:50:07.000Z | 2022-01-26T14:50:07.000Z | LeetCode/Problems/Algorithms/#236_LowestCommonAncestorOfABinaryTree_sol3_common_path_from_root_with_parents_and_levels_O(N)_time_O(N)_extra_space_32ms_21.1MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | LeetCode/Problems/Algorithms/#236_LowestCommonAncestorOfABinaryTree_sol3_common_path_from_root_with_parents_and_levels_O(N)_time_O(N)_extra_space_32ms_21.1MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
private:
void dfs(TreeNode* node, unordered_map<TreeNode*, TreeNode*>& parent, unordered_map... | 26.404255 | 113 | 0.448832 | Tudor67 |
f894c96f2088b599a7581d9c09e1c48a88bdcad6 | 2,987 | cpp | C++ | src/pcapng/sorter_pcapng.cpp | nprint/pcapML | a9be4f2b98053e105d042507aa0821a67ce2dd4d | [
"Apache-2.0"
] | 18 | 2021-06-02T21:05:43.000Z | 2022-03-12T15:21:14.000Z | src/pcapng/sorter_pcapng.cpp | nprint/pcapML | a9be4f2b98053e105d042507aa0821a67ce2dd4d | [
"Apache-2.0"
] | 3 | 2021-06-02T18:07:06.000Z | 2021-06-02T18:12:30.000Z | src/pcapng/sorter_pcapng.cpp | nprint/pcapml | 6a2189500caa51065a1b3387954ad08ebbfe5e3a | [
"Apache-2.0"
] | 1 | 2021-06-03T12:46:02.000Z | 2021-06-03T12:46:02.000Z | /*
* Copyright 2020 nPrint
* 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 https://www.apache.org/licenses/LICENSE-2.0
*/
#include "sorter_pcapng.hpp"
bool Sorter::process_block(Block *b... | 23.706349 | 78 | 0.58152 | nprint |
f89830920ae7a452a7d2543989319b027212a580 | 590 | cpp | C++ | system/Dragon.cpp | arulagrawal/cos214_project | 1ea65ac7e46b97107c0ec2a75359514bc6c98c15 | [
"BSD-2-Clause"
] | null | null | null | system/Dragon.cpp | arulagrawal/cos214_project | 1ea65ac7e46b97107c0ec2a75359514bc6c98c15 | [
"BSD-2-Clause"
] | null | null | null | system/Dragon.cpp | arulagrawal/cos214_project | 1ea65ac7e46b97107c0ec2a75359514bc6c98c15 | [
"BSD-2-Clause"
] | null | null | null | #include "Dragon.h"
///The dragon spacecraft can move in all its normal directions and can clone itself.
Dragon::Dragon(string cargo[], int cargoSize) : Spacecraft(cargo, cargoSize)
{
}
void Dragon::boost()
{
stage->boost();
}
void Dragon::slow()
{
stage->slow();
}
void Dragon::left()
{
stage->left();
}
... | 15.945946 | 84 | 0.654237 | arulagrawal |
f8987424e3a72587ecd8396faafcee56ab68ffa0 | 739 | cpp | C++ | Before Summer 2017/SummerTrain Archieve/COWCAR.cpp | mohamedGamalAbuGalala/Practice | 2a5fa3bdaf995d0c304f04231e1a69e6960f72c8 | [
"MIT"
] | 1 | 2019-12-19T06:51:20.000Z | 2019-12-19T06:51:20.000Z | Before Summer 2017/SummerTrain Archieve/COWCAR.cpp | mohamedGamalAbuGalala/Practice | 2a5fa3bdaf995d0c304f04231e1a69e6960f72c8 | [
"MIT"
] | null | null | null | Before Summer 2017/SummerTrain Archieve/COWCAR.cpp | mohamedGamalAbuGalala/Practice | 2a5fa3bdaf995d0c304f04231e1a69e6960f72c8 | [
"MIT"
] | null | null | null | //============================================================================
// Name : COWCAR.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <io... | 24.633333 | 78 | 0.399188 | mohamedGamalAbuGalala |
f8996596c88869df11abb3a72578a83a1979a2d9 | 601 | cpp | C++ | tests/replay/minimal_packed.cpp | alexbatashev/pi_reproduce | 7129111ff80b9d76e4dfad26f1f2b67ef3826e52 | [
"Apache-2.0"
] | null | null | null | tests/replay/minimal_packed.cpp | alexbatashev/pi_reproduce | 7129111ff80b9d76e4dfad26f1f2b67ef3826e52 | [
"Apache-2.0"
] | 4 | 2021-07-05T12:14:37.000Z | 2021-07-29T18:39:42.000Z | tests/replay/minimal_packed.cpp | alexbatashev/pi_reproduce | 7129111ff80b9d76e4dfad26f1f2b67ef3826e52 | [
"Apache-2.0"
] | null | null | null | // REQUIRES: linux
// RUN: echo "1" > %t.txt
// RUN: %clangxx %s --std=c++17 -o %t.exe
// RUN: %dpcpp_trace record --override -o %t_trace %t.exe -- %t.txt
// RUN: rm %t.txt
// RUN: %dpcpp_trace pack %t_trace
// RUN: %dpcpp_trace replay %t_trace
#include <cstdlib>
#include <fstream>
#include <filesystem>
namespace fs ... | 19.387097 | 67 | 0.62396 | alexbatashev |
f89d1b3b2cd7a12f8303d3d78823af4c73182a9c | 2,643 | cpp | C++ | Love Babber OnGoing Placement/Binary Trees/Construct Tree from Inorder & Preorder.cpp | work-mohit/Placement-Practice | 396e61f7980991b2d6392589f26f917981c135ab | [
"MIT"
] | null | null | null | Love Babber OnGoing Placement/Binary Trees/Construct Tree from Inorder & Preorder.cpp | work-mohit/Placement-Practice | 396e61f7980991b2d6392589f26f917981c135ab | [
"MIT"
] | null | null | null | Love Babber OnGoing Placement/Binary Trees/Construct Tree from Inorder & Preorder.cpp | work-mohit/Placement-Practice | 396e61f7980991b2d6392589f26f917981c135ab | [
"MIT"
] | null | null | null | class Solution{
public:
int findPosition(int in[] , int n, int ele){
for(int i = 0 ; i < n; i++){
if(ele == in[i]){
return i;
}
}
return -1;
}
Node* solve(int in[],int pre[], int n, int &index, int inorderStart, int ino... | 26.168317 | 106 | 0.491109 | work-mohit |
f89eeea439b1f3db71fab797a27d3a9cbaf39406 | 1,591 | cpp | C++ | src/sdm/utils/value_function/action_selection/registry.cpp | SDMStudio/sdms | 43a86973081ffd86c091aed69b332f0087f59361 | [
"MIT"
] | null | null | null | src/sdm/utils/value_function/action_selection/registry.cpp | SDMStudio/sdms | 43a86973081ffd86c091aed69b332f0087f59361 | [
"MIT"
] | null | null | null | src/sdm/utils/value_function/action_selection/registry.cpp | SDMStudio/sdms | 43a86973081ffd86c091aed69b332f0087f59361 | [
"MIT"
] | null | null | null | #include <sdm/macros.hpp>
#include <sdm/utils/value_function/action_selection/registry.hpp>
#include <sdm/utils/value_function/action_selection.hpp>
SDMS_REGISTRY(action_selection)
SDMS_REGISTER("Exhaustive", ExhaustiveActionSelection)
SDMS_REGISTER("MaxplanSerial", ActionSelectionMaxplanSerial)
SDMS_REGISTER("Maxplan... | 37 | 134 | 0.648649 | SDMStudio |
f89f8f663be1499b577dbf2c1723dd7d0575f515 | 2,961 | cpp | C++ | test/modulo_256-bit.cpp | kimwalisch/primesum | c73b8afba311413454a25d45482efaea025ae3a0 | [
"BSD-2-Clause"
] | 31 | 2016-05-16T10:43:48.000Z | 2021-12-31T23:20:46.000Z | test/modulo_256-bit.cpp | kimwalisch/primesum | c73b8afba311413454a25d45482efaea025ae3a0 | [
"BSD-2-Clause"
] | 2 | 2016-06-07T08:41:55.000Z | 2017-11-17T13:22:20.000Z | test/modulo_256-bit.cpp | kimwalisch/primesum | c73b8afba311413454a25d45482efaea025ae3a0 | [
"BSD-2-Clause"
] | 2 | 2019-10-31T02:11:39.000Z | 2021-06-29T16:37:56.000Z | #include <iostream>
#include <random>
#include <limits>
#include <int256_t.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace primesum;
using namespace std;
typedef boost::multiprecision::int256_t boost_int256_t;
int main(int argc, char** argv)
{
random_device rd;
mt19937 gen(rd());
unifor... | 25.747826 | 84 | 0.376224 | kimwalisch |
f8a0352f4587c4da4d218326156beffdeb413691 | 5,260 | cpp | C++ | src/appleseed/renderer/modeling/environmentshader/backgroundenvironmentshader.cpp | KarthikRIyer/appleseed | d66189620e06bc1be8122ad6e22c6e15514ebb49 | [
"MIT"
] | 1 | 2019-03-18T09:23:10.000Z | 2019-03-18T09:23:10.000Z | src/appleseed/renderer/modeling/environmentshader/backgroundenvironmentshader.cpp | anikket786/appleseed | e44f2ed2c867014c30195f067a91d0280c404c70 | [
"MIT"
] | null | null | null | src/appleseed/renderer/modeling/environmentshader/backgroundenvironmentshader.cpp | anikket786/appleseed | e44f2ed2c867014c30195f067a91d0280c404c70 | [
"MIT"
] | null | null | null |
//
// This source file is part of appleseed.
// Visit https://appleseedhq.net/ for additional information and resources.
//
// This software is released under the MIT license.
//
// Copyright (c) 2016-2018 Francois Beaune, The appleseedhq Organization
//
// Permission is hereby granted, free of charge, to any person o... | 29.886364 | 80 | 0.626426 | KarthikRIyer |
f8a41d8f035097a9f8e4ecb31f96d6bc51b1d12b | 2,494 | cpp | C++ | examples/custom.cpp | vlazzarini/aurora | 4990d81a6873beace4a39d6584cc77afbda82cf4 | [
"BSD-3-Clause"
] | 11 | 2021-11-26T16:23:40.000Z | 2022-01-19T21:36:35.000Z | examples/custom.cpp | vlazzarini/aurora | 4990d81a6873beace4a39d6584cc77afbda82cf4 | [
"BSD-3-Clause"
] | null | null | null | examples/custom.cpp | vlazzarini/aurora | 4990d81a6873beace4a39d6584cc77afbda82cf4 | [
"BSD-3-Clause"
] | null | null | null | // custom.cpp:
// Custom bandlimited waveform generation example
//
// (c) V Lazzarini, 2021
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
// 1. Redistributions of source code must retain the above copyright notice... | 45.345455 | 80 | 0.689254 | vlazzarini |
f8a79faaad893b5c41a06af5149f8af12cd8c9f9 | 17,240 | cpp | C++ | IntelShaderAnalyzer.cpp | GameTechDev/IntelShaderAnalyzer | 2fcb0c3e2a4d025fd89d8f417646dda015473738 | [
"MIT"
] | 117 | 2019-03-19T19:28:21.000Z | 2022-01-11T20:27:17.000Z | IntelShaderAnalyzer.cpp | GameTechDev/IntelShaderAnalyzer | 2fcb0c3e2a4d025fd89d8f417646dda015473738 | [
"MIT"
] | 2 | 2019-06-30T04:42:33.000Z | 2021-11-15T17:40:43.000Z | IntelShaderAnalyzer.cpp | GameTechDev/IntelShaderAnalyzer | 2fcb0c3e2a4d025fd89d8f417646dda015473738 | [
"MIT"
] | 6 | 2019-03-20T10:14:11.000Z | 2021-08-06T10:58:42.000Z | ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2019, 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 dea... | 29.672978 | 136 | 0.533237 | GameTechDev |
f8a8c0029fffaa93ef561ceb3dd3fb9d7e6cf9d7 | 5,677 | hpp | C++ | include/edlib/Basis/Basis1DZ2.hpp | cecri/ExactDiagonalization | a168ed2f60149b1c3e5bd9ae46a5d169aea76773 | [
"MIT"
] | null | null | null | include/edlib/Basis/Basis1DZ2.hpp | cecri/ExactDiagonalization | a168ed2f60149b1c3e5bd9ae46a5d169aea76773 | [
"MIT"
] | null | null | null | include/edlib/Basis/Basis1DZ2.hpp | cecri/ExactDiagonalization | a168ed2f60149b1c3e5bd9ae46a5d169aea76773 | [
"MIT"
] | null | null | null | #pragma once
#include <cassert>
#include <cmath>
#include <map>
#include <vector>
#include <tbb/tbb.h>
#include "AbstractBasis1D.hpp"
#include "BasisJz.hpp"
namespace edlib
{
template<typename UINT> class Basis1DZ2 final : public AbstractBasis1D<UINT>
{
public:
struct RepData
{
int rot;
int... | 26.652582 | 97 | 0.463977 | cecri |
f8aaffce8bea5ce66539b668dc72363536e71556 | 1,594 | cpp | C++ | src/page.windows.cpp | Curve/lime | 91f1132fc550f70627918547f87c687f437ff12a | [
"MIT"
] | 3 | 2021-10-17T17:16:37.000Z | 2022-03-09T07:12:20.000Z | src/page.windows.cpp | Curve/lime | 91f1132fc550f70627918547f87c687f437ff12a | [
"MIT"
] | 12 | 2021-11-09T07:19:34.000Z | 2022-02-28T07:25:15.000Z | src/page.windows.cpp | Curve/lime | 91f1132fc550f70627918547f87c687f437ff12a | [
"MIT"
] | null | null | null | #include "page.hpp"
#include <Windows.h>
namespace lime
{
page::page() : m_prot(0) {}
page::page(const page &) = default;
std::vector<page> page::get_pages()
{
std::vector<page> rtn;
void *address = nullptr;
MEMORY_BASIC_INFORMATION info;
while (VirtualQuery(address, ... | 25.709677 | 117 | 0.557716 | Curve |
f8b0a0e35c8190edaabcf3575968bee4af8ca573 | 1,074 | cpp | C++ | meshlib/builder/ConeBuilder.cpp | seanchas116/meshlib | f2b48717667adaff9d70f0e927d1bdd44633beed | [
"MIT"
] | 1 | 2021-02-05T09:59:10.000Z | 2021-02-05T09:59:10.000Z | meshlib/builder/ConeBuilder.cpp | seanchas116/meshlib | f2b48717667adaff9d70f0e927d1bdd44633beed | [
"MIT"
] | null | null | null | meshlib/builder/ConeBuilder.cpp | seanchas116/meshlib | f2b48717667adaff9d70f0e927d1bdd44633beed | [
"MIT"
] | null | null | null | #include "ConeBuilder.hpp"
#include <QtGlobal>
using namespace glm;
namespace meshlib {
Mesh ConeBuilder::build() const {
Mesh mesh;
std::vector<UVPointHandle> uvPoints;
float angleStep = float(M_PI) * 2 / segmentCount;
for (int i = 0; i < segmentCount; ++i) {
float angle = angleStep * i;
... | 25.571429 | 83 | 0.608007 | seanchas116 |
f8b2351a62d6130b2c441d7472fd2e8c9e8c6fb5 | 711 | cpp | C++ | public/plagiarism_plugin/input/24/24/24 24 5113100011--Bounce.cpp | laurensiusadi/elearning-pweb | c72ae1fc414895919ef71ae370686353d9086bce | [
"MIT"
] | null | null | null | public/plagiarism_plugin/input/24/24/24 24 5113100011--Bounce.cpp | laurensiusadi/elearning-pweb | c72ae1fc414895919ef71ae370686353d9086bce | [
"MIT"
] | null | null | null | public/plagiarism_plugin/input/24/24/24 24 5113100011--Bounce.cpp | laurensiusadi/elearning-pweb | c72ae1fc414895919ef71ae370686353d9086bce | [
"MIT"
] | null | null | null | #include <wx/wx.h>
#include "Bounce.h"
Bounce::Bounce(float x, float y)
{
this->x = x;
this->y = y;
radius = 30;
speedX = 20;
speedY = 20;
}
void Bounce::HitWall(int x1, int y1, int x2, int y2)
{
if ((x - radius) < x1 || (x + radius) > x2)
{
speedX = -speedX;
}
if ((y - radius) < y1 || (y + radius) > y2)
... | 15.12766 | 52 | 0.576653 | laurensiusadi |
f8b7af427fa13d2ec2c44abbafe2532e7ff7c41e | 3,633 | cpp | C++ | 12_dynamic_2/12_distinct_subseq.cpp | ShyamNandanKumar/coding-ninja2 | a43a21575342261e573f71f7d8eff0572f075a17 | [
"MIT"
] | 11 | 2021-01-02T10:07:17.000Z | 2022-03-16T00:18:06.000Z | 12_dynamic_2/12_distinct_subseq.cpp | meyash/cp_master | 316bf47db2a5b40891edd73cff834517993c3d2a | [
"MIT"
] | null | null | null | 12_dynamic_2/12_distinct_subseq.cpp | meyash/cp_master | 316bf47db2a5b40891edd73cff834517993c3d2a | [
"MIT"
] | 5 | 2021-05-19T11:17:18.000Z | 2021-09-16T06:23:31.000Z | /*
Given a string, count the number of distinct subsequences of it ( including empty subsequence ). For the uninformed, A subsequence of a string is a new string which is formed from the original string by deleting some of the characters without disturbing the relative positions of the remaining characters.
For example... | 28.606299 | 305 | 0.576658 | ShyamNandanKumar |
f8b9cb291b22295c778536309e5bfb19a57df14b | 987 | cpp | C++ | Code/Lib/sfmTargetedPedestrian.cpp | johnduffymsc/PHAS0100Assignment2 | d6dfe3dc102c14f441c1d6f334f0efd178728bd9 | [
"BSD-3-Clause"
] | null | null | null | Code/Lib/sfmTargetedPedestrian.cpp | johnduffymsc/PHAS0100Assignment2 | d6dfe3dc102c14f441c1d6f334f0efd178728bd9 | [
"BSD-3-Clause"
] | null | null | null | Code/Lib/sfmTargetedPedestrian.cpp | johnduffymsc/PHAS0100Assignment2 | d6dfe3dc102c14f441c1d6f334f0efd178728bd9 | [
"BSD-3-Clause"
] | 3 | 2021-02-12T14:27:32.000Z | 2021-04-04T00:09:33.000Z | /*=============================================================================
PHAS0100ASSIGNMENT2: PHAS0100 Assignment 2 Social Force Model
Copyright (c) University College London (UCL). All rights reserved.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABI... | 27.416667 | 119 | 0.646403 | johnduffymsc |
f8c1d37137f68f9c05fb5a4d8efc8ea52dc0f6fa | 26,155 | cpp | C++ | webcl/dxtcompressor/common/src/oclUtils.cpp | wolfviking0/webcl-translator | af173ef4617b310fd27c325bdd4a947728459302 | [
"MIT"
] | 19 | 2015-03-05T19:28:54.000Z | 2021-05-18T12:16:24.000Z | webcl/dxtcompressor/common/src/oclUtils.cpp | wolfviking0/webcl-translator | af173ef4617b310fd27c325bdd4a947728459302 | [
"MIT"
] | null | null | null | webcl/dxtcompressor/common/src/oclUtils.cpp | wolfviking0/webcl-translator | af173ef4617b310fd27c325bdd4a947728459302 | [
"MIT"
] | 5 | 2015-10-16T07:01:11.000Z | 2020-05-27T06:12:50.000Z | /*
* Copyright 1993-2009 NVIDIA Corporation. All rights reserved.
*
* NVIDIA Corporation and its licensors retain all intellectual property and
* proprietary rights in and to this software and related documentation.
* Any use, reproduction, disclosure, or distribution of this software
* and related documentat... | 42.253635 | 152 | 0.640145 | wolfviking0 |
f8c4b39e8ea1e07dc84794fb7d54c7ecd8c5e7af | 1,819 | cpp | C++ | rawtotxt.cpp | DBFritz/ParticleDetections | cd05979c58b79c27259479e948c445867a7a838f | [
"MIT"
] | 1 | 2018-04-05T02:26:57.000Z | 2018-04-05T02:26:57.000Z | rawtotxt.cpp | DBFritz/ParticleDetections | cd05979c58b79c27259479e948c445867a7a838f | [
"MIT"
] | null | null | null | rawtotxt.cpp | DBFritz/ParticleDetections | cd05979c58b79c27259479e948c445867a7a838f | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include "rawImages.hpp"
#include "rawFilters.hpp"
int main(int argc, char *argv[])
{
using namespace std;
using namespace raw;
const int width=2592, height=1944;
rawPhoto_t photo(width,height);
switch (argc)
{
case 1:
for(int f=1; ;f+... | 28.873016 | 94 | 0.446949 | DBFritz |
f8c7316af82616a715047f22194c1e749a6e03b9 | 17,614 | cpp | C++ | frontend/module.cpp | llpm/SpatialC | 618d86fe948a7839fe4903a77da08941e169ae2e | [
"Apache-2.0"
] | null | null | null | frontend/module.cpp | llpm/SpatialC | 618d86fe948a7839fe4903a77da08941e169ae2e | [
"Apache-2.0"
] | null | null | null | frontend/module.cpp | llpm/SpatialC | 618d86fe948a7839fe4903a77da08941e169ae2e | [
"Apache-2.0"
] | null | null | null | #include "module.hpp"
#include <frontend/exception.hpp>
#include <frontend/event.hpp>
#include <frontend/expression.hpp>
#include <libraries/core/logic_intr.hpp>
#include <libraries/core/comm_intr.hpp>
#include <analysis/constant.hpp>
#include <llvm/IR/Constants.h>
#include <boost/format.hpp>
using namespace std;
... | 33.614504 | 91 | 0.543034 | llpm |
f8c78784fe41f2e7386b8476ea8e45ebf1e900a6 | 2,383 | cpp | C++ | GLWrapper/Math/Vector2D.cpp | filipkunc/GLGraphics | fb696948034832e1fbc60b7c6095560a79952875 | [
"MIT"
] | 6 | 2015-12-29T11:24:29.000Z | 2021-07-17T06:00:30.000Z | GLWrapper/Math/Vector2D.cpp | filipkunc/GLGraphics | fb696948034832e1fbc60b7c6095560a79952875 | [
"MIT"
] | null | null | null | GLWrapper/Math/Vector2D.cpp | filipkunc/GLGraphics | fb696948034832e1fbc60b7c6095560a79952875 | [
"MIT"
] | 1 | 2021-05-27T07:35:57.000Z | 2021-05-27T07:35:57.000Z | //
// Vector2D.cpp
// OpenGLEditor
//
// Created by Filip Kunc on 6/21/09.
// For license see LICENSE.TXT
//
#include "stdafx.h"
#include "MathDeclaration.h"
Vector2D::Vector2D()
{
x = 0.0f;
y = 0.0f;
}
Vector2D::Vector2D(const float * v)
{
x = v[0];
y = v[1];
}
Vector2D::Vector2D(const Vector2D & v)
{
... | 14.619632 | 58 | 0.612253 | filipkunc |
f8c79a238516f9ff6d9b814403e9a0e3747fee9e | 58,225 | cpp | C++ | vpr7_x2p/vpr/SRC/fpga_x2p/base/module_manager_utils.cpp | srtemp/OpenFPGA | dd3d5fb7da881ef71717ce049eee09ec9b91849a | [
"MIT"
] | null | null | null | vpr7_x2p/vpr/SRC/fpga_x2p/base/module_manager_utils.cpp | srtemp/OpenFPGA | dd3d5fb7da881ef71717ce049eee09ec9b91849a | [
"MIT"
] | null | null | null | vpr7_x2p/vpr/SRC/fpga_x2p/base/module_manager_utils.cpp | srtemp/OpenFPGA | dd3d5fb7da881ef71717ce049eee09ec9b91849a | [
"MIT"
] | null | null | null | /******************************************************************************
* This files includes most utilized functions
* for data structures for module management.
******************************************************************************/
#include <map>
#include <algorithm>
#include "util.h"
#include ... | 50.454939 | 193 | 0.597905 | srtemp |
f8c8a319edeff07cbe3f650e5df4c96c7ecde59f | 1,770 | cpp | C++ | modules/svg/src/SkSVGLinearGradient.cpp | NearTox/Skia | 8b7e0616161fff86ecbd8938b90600d72b8d5c1d | [
"BSD-3-Clause"
] | null | null | null | modules/svg/src/SkSVGLinearGradient.cpp | NearTox/Skia | 8b7e0616161fff86ecbd8938b90600d72b8d5c1d | [
"BSD-3-Clause"
] | null | null | null | modules/svg/src/SkSVGLinearGradient.cpp | NearTox/Skia | 8b7e0616161fff86ecbd8938b90600d72b8d5c1d | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright 2016 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "include/effects/SkGradientShader.h"
#include "modules/svg/include/SkSVGLinearGradient.h"
#include "modules/svg/include/SkSVGRenderContext.h"
#include "modules/svg/in... | 44.25 | 94 | 0.731638 | NearTox |
f8cb56029f4da872149a26ba87fb3a9c35c4575b | 156 | cc | C++ | cake_test1.cc | maaku33/jnp-zadanie4 | c8faf6734b00f9fd367e0f2eeb33559fc26dc81c | [
"MIT"
] | null | null | null | cake_test1.cc | maaku33/jnp-zadanie4 | c8faf6734b00f9fd367e0f2eeb33559fc26dc81c | [
"MIT"
] | null | null | null | cake_test1.cc | maaku33/jnp-zadanie4 | c8faf6734b00f9fd367e0f2eeb33559fc26dc81c | [
"MIT"
] | null | null | null | #include "cake.h"
#include <iostream>
int main() {
CheeseCake<int, 10, 15> cheeseCake1(4);
CreamCake<int, 12, 12, double> creamCake(3, 25.9);
}
| 17.333333 | 54 | 0.628205 | maaku33 |
f8cbc90a691b72a235ad926f6a774ec7d4c69928 | 1,220 | cpp | C++ | src/gameworld/gameworld/obj/otherobj/scenearea.cpp | mage-game/metagame-xm-server | 193b67389262803fe0eae742800b1e878b5b3087 | [
"MIT"
] | 3 | 2021-12-16T13:57:28.000Z | 2022-03-26T07:50:08.000Z | src/gameworld/gameworld/obj/otherobj/scenearea.cpp | mage-game/metagame-xm-server | 193b67389262803fe0eae742800b1e878b5b3087 | [
"MIT"
] | null | null | null | src/gameworld/gameworld/obj/otherobj/scenearea.cpp | mage-game/metagame-xm-server | 193b67389262803fe0eae742800b1e878b5b3087 | [
"MIT"
] | 1 | 2022-03-26T07:50:11.000Z | 2022-03-26T07:50:11.000Z | #include "scenearea.h"
#include "scene/scene.h"
#include "obj/character/role.h"
#include "other/event/eventhandler.hpp"
#include "config/logicconfigmanager.hpp"
#include "scene/activityshadow/activityshadow.hpp"
#include "protocal/msgactivity.hpp"
SceneArea::SceneArea():Obj(OBJ_TYPE_SCENEAREA), m_range(4), m_aoi_h... | 17.183099 | 98 | 0.681148 | mage-game |
f8cbf7dd019d48150a023d6da8da9a86b7e7037f | 293 | cpp | C++ | CPP/HelloCpp2/chapter_44/struct.cpp | hrntsm/study-language | 922578a5321d70c26b935e6052f400125e15649c | [
"MIT"
] | 1 | 2022-02-06T10:50:42.000Z | 2022-02-06T10:50:42.000Z | CPP/HelloCpp2/chapter_44/struct.cpp | hrntsm/study-language | 922578a5321d70c26b935e6052f400125e15649c | [
"MIT"
] | null | null | null | CPP/HelloCpp2/chapter_44/struct.cpp | hrntsm/study-language | 922578a5321d70c26b935e6052f400125e15649c | [
"MIT"
] | null | null | null | #include <iostream>
using std::cout;
struct Kitty
{
explicit Kitty(char *str)
{
this->str = str;
}
char *getStr()
{
return str;
}
private:
char *str;
};
int main()
{
Kitty obj("Kitty on your lap\n");
cout << obj.getStr();
return 0;
}
| 11.72 | 37 | 0.515358 | hrntsm |
f8d60b5407e1ab45b93d23e92851ed944bc95c6a | 7,291 | cpp | C++ | hacks/c_chams.cpp | Rebirator/GLadiators.technology-v2-Rifk7 | 7692ad3fce3f6e0638e7c8924f4bb972a2632d0f | [
"MIT"
] | 4 | 2020-08-13T11:11:31.000Z | 2021-09-24T16:55:42.000Z | hacks/c_chams.cpp | Rebirator/GLadiators.technology-v2-Rifk7 | 7692ad3fce3f6e0638e7c8924f4bb972a2632d0f | [
"MIT"
] | null | null | null | hacks/c_chams.cpp | Rebirator/GLadiators.technology-v2-Rifk7 | 7692ad3fce3f6e0638e7c8924f4bb972a2632d0f | [
"MIT"
] | 6 | 2020-07-15T17:00:14.000Z | 2022-03-25T07:45:13.000Z | #include "c_chams.h"
#include "../security/string_obfuscation.h"
#include "../sdk/c_material_system.h"
#include "../sdk/c_render_view.h"
#include "../menu/framework/macros.h"
#include "../utils/c_config.h"
#include "../sdk/c_client_entity_list.h"
#include "c_animation_system.h"
#include "../utils/math.h"
#include "../s... | 27.205224 | 115 | 0.702647 | Rebirator |
f8d7f6f1c57c208c2252bde3cd88d05785d01dc0 | 13,888 | cpp | C++ | bin/windows/cpp/obj/src/flash/display/LoaderInfo.cpp | DrSkipper/twogames | 916e8af6cd45cf85fbca4a6ea8ee12e24dd6689b | [
"MIT"
] | null | null | null | bin/windows/cpp/obj/src/flash/display/LoaderInfo.cpp | DrSkipper/twogames | 916e8af6cd45cf85fbca4a6ea8ee12e24dd6689b | [
"MIT"
] | null | null | null | bin/windows/cpp/obj/src/flash/display/LoaderInfo.cpp | DrSkipper/twogames | 916e8af6cd45cf85fbca4a6ea8ee12e24dd6689b | [
"MIT"
] | null | null | null | #include <hxcpp.h>
#ifndef INCLUDED_flash_display_DisplayObject
#include <flash/display/DisplayObject.h>
#endif
#ifndef INCLUDED_flash_display_DisplayObjectContainer
#include <flash/display/DisplayObjectContainer.h>
#endif
#ifndef INCLUDED_flash_display_IBitmapDrawable
#include <flash/display/IBitmapDrawable.h>
#endif... | 33.22488 | 187 | 0.744312 | DrSkipper |
f8d8a1a2ae392039352bbe1a39ee224a7757d9dd | 1,516 | cc | C++ | lib/asan/lit_tests/stack-use-after-return.cc | tylerfox/compiler-rt | 940db39932e702fbc6ced148ff16263562862f5a | [
"MIT"
] | null | null | null | lib/asan/lit_tests/stack-use-after-return.cc | tylerfox/compiler-rt | 940db39932e702fbc6ced148ff16263562862f5a | [
"MIT"
] | null | null | null | lib/asan/lit_tests/stack-use-after-return.cc | tylerfox/compiler-rt | 940db39932e702fbc6ced148ff16263562862f5a | [
"MIT"
] | null | null | null | // XFAIL: *
// RUN: %clangxx_asan -fsanitize=use-after-return -m64 -O0 %s -o %t && \
// RUN: %t 2>&1 | %symbolize | FileCheck %s
// RUN: %clangxx_asan -fsanitize=use-after-return -m64 -O1 %s -o %t && \
// RUN: %t 2>&1 | %symbolize | FileCheck %s
// RUN: %clangxx_asan -fsanitize=use-after-return -m64 -O2 %s -o %t &&... | 32.956522 | 72 | 0.587731 | tylerfox |
f8d8c41e067c94c324edc6afb8a5bbae757d4546 | 890 | cpp | C++ | codeforces/A - Equality/Accepted.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | 1 | 2022-02-11T16:55:36.000Z | 2022-02-11T16:55:36.000Z | codeforces/A - Equality/Accepted.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | codeforces/A - Equality/Accepted.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | /****************************************************************************************
* @author: kzvd4729 created: Sep/06/2018 21:38
* solution_verdict: Accepted language: GNU C++14
* run... | 38.695652 | 111 | 0.373034 | kzvd4729 |
f8dbe8186ab42f40b2659c9a1085957e609a5161 | 384 | hpp | C++ | phylanx/plugins/dist_keras_support/dist_keras_support.hpp | NanmiaoWu/phylanx | 295b5f82cc39925a0d53e77ba3b6d02a65204535 | [
"BSL-1.0"
] | 83 | 2017-08-27T15:09:13.000Z | 2022-01-18T17:03:41.000Z | phylanx/plugins/dist_keras_support/dist_keras_support.hpp | NanmiaoWu/phylanx | 295b5f82cc39925a0d53e77ba3b6d02a65204535 | [
"BSL-1.0"
] | 808 | 2017-08-27T15:35:01.000Z | 2021-12-14T17:30:50.000Z | phylanx/plugins/dist_keras_support/dist_keras_support.hpp | NanmiaoWu/phylanx | 295b5f82cc39925a0d53e77ba3b6d02a65204535 | [
"BSL-1.0"
] | 55 | 2017-08-27T15:09:22.000Z | 2022-03-25T12:07:34.000Z | // Copyright (c) 2020 Hartmut Kaiser
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#if !defined(PHYLANX_PLUGINS_DIST_KERAS_SUPPORT_JUN_25_2020)
#define PHYLANX_PLUGINS_DIST_KERAS_SUPPORT_JUN_25_2020
#inclu... | 32 | 80 | 0.807292 | NanmiaoWu |
f8df6b8663a88c1d78558888700220fdfad5405d | 712 | cpp | C++ | math/montmort_number_mod/sol/correct.cpp | tko919/library-checker-problems | 007a3ef79d1a1824e68545ab326d1523d9c05262 | [
"Apache-2.0"
] | 290 | 2019-06-06T22:20:36.000Z | 2022-03-27T12:45:04.000Z | math/montmort_number_mod/sol/correct.cpp | tko919/library-checker-problems | 007a3ef79d1a1824e68545ab326d1523d9c05262 | [
"Apache-2.0"
] | 536 | 2019-06-06T18:25:36.000Z | 2022-03-29T11:46:36.000Z | math/montmort_number_mod/sol/correct.cpp | tko919/library-checker-problems | 007a3ef79d1a1824e68545ab326d1523d9c05262 | [
"Apache-2.0"
] | 82 | 2019-06-06T18:17:55.000Z | 2022-03-21T07:40:31.000Z | #include <assert.h>
#include <stdint.h>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
// number of permutations with p_i != i
template<typename T>
struct Montmort{
using ll = long long;
vector<T> dp;
Montmort(int n,int mod):dp(n+1,0){
for(int k=2;k<=n;k++){
dp[k]=(ll... | 17.365854 | 54 | 0.558989 | tko919 |
25c91f04e321be66d4bfecee0cf70e261ef8d4a2 | 35,656 | cpp | C++ | WRK-V1.2/TOOLS/TOOLSX/atlmfc/src/mfc/olesvr2.cpp | intj-t/openvmsft | 0d17fbce8607ab2b880be976c2e86d8cfc3e83bb | [
"Intel"
] | null | null | null | WRK-V1.2/TOOLS/TOOLSX/atlmfc/src/mfc/olesvr2.cpp | intj-t/openvmsft | 0d17fbce8607ab2b880be976c2e86d8cfc3e83bb | [
"Intel"
] | null | null | null | WRK-V1.2/TOOLS/TOOLSX/atlmfc/src/mfc/olesvr2.cpp | intj-t/openvmsft | 0d17fbce8607ab2b880be976c2e86d8cfc3e83bb | [
"Intel"
] | null | null | null | // This is a part of the Microsoft Foundation Classes C++ library.
// Copyright (C) Microsoft Corporation
// All rights reserved.
//
// This source code is only intended as a supplement to the
// Microsoft Foundation Classes Reference and related
// electronic documentation provided with the library.
// See these sourc... | 24.709633 | 86 | 0.727704 | intj-t |
25dc384092633652732e3f72e87a55219981ed10 | 1,664 | cc | C++ | src/leveldb/util/hash_test.cc | yinchengtsinghua/BitCoinCppChinese | 76f64ad8cee5b6c5671b3629f39e7ae4ef84be0a | [
"MIT"
] | 13 | 2019-01-23T04:36:05.000Z | 2022-02-21T11:20:25.000Z | src/leveldb/util/hash_test.cc | yinchengtsinghua/BitCoinCppChinese | 76f64ad8cee5b6c5671b3629f39e7ae4ef84be0a | [
"MIT"
] | null | null | null | src/leveldb/util/hash_test.cc | yinchengtsinghua/BitCoinCppChinese | 76f64ad8cee5b6c5671b3629f39e7ae4ef84be0a | [
"MIT"
] | 3 | 2019-01-24T07:48:15.000Z | 2021-06-11T13:34:44.000Z |
//此源码被清华学神尹成大魔王专业翻译分析并修改
//尹成QQ77025077
//尹成微信18510341407
//尹成所在QQ群721929980
//尹成邮箱 yinc13@mails.tsinghua.edu.cn
//尹成毕业于清华大学,微软区块链领域全球最有价值专家
//https://mvp.microsoft.com/zh-cn/PublicProfile/4033620
//版权所有（c）2011 LevelDB作者。版权所有。
//此源代码的使用受可以
//在许可证文件中找到。有关参与者的名称，请参阅作者文件。
#include "util/hash.h"
#include "util/testharnes... | 26.412698 | 76 | 0.673077 | yinchengtsinghua |
25e011f1d71e5331ac58d00912a4c8e9bc7528cc | 925 | cpp | C++ | LeetCodeCPP/335. Self Crossing/main.cpp | 18600130137/leetcode | fd2dc72c0b85da50269732f0fcf91326c4787d3a | [
"Apache-2.0"
] | 1 | 2019-03-29T03:33:56.000Z | 2019-03-29T03:33:56.000Z | LeetCodeCPP/335. Self Crossing/main.cpp | 18600130137/leetcode | fd2dc72c0b85da50269732f0fcf91326c4787d3a | [
"Apache-2.0"
] | null | null | null | LeetCodeCPP/335. Self Crossing/main.cpp | 18600130137/leetcode | fd2dc72c0b85da50269732f0fcf91326c4787d3a | [
"Apache-2.0"
] | null | null | null | //
// main.cpp
// 335. Self Crossing
//
// Created by admin on 2019/8/14.
// Copyright © 2019年 liu. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
bool isSelfCrossing(vector<int>& x) {
int m=x.size();
if(m<4){
return fals... | 22.560976 | 113 | 0.467027 | 18600130137 |
25e03d19de061ef015ec92b1441873c45a49cc7f | 1,479 | cpp | C++ | examples/basic/main.cpp | igagis/stdjson | 2db77b24d0ee941086e9871333127e058034dd7a | [
"MIT"
] | 1 | 2021-06-17T13:39:50.000Z | 2021-06-17T13:39:50.000Z | examples/basic/main.cpp | igagis/stdjson | 2db77b24d0ee941086e9871333127e058034dd7a | [
"MIT"
] | null | null | null | examples/basic/main.cpp | igagis/stdjson | 2db77b24d0ee941086e9871333127e058034dd7a | [
"MIT"
] | 1 | 2020-12-15T01:48:43.000Z | 2020-12-15T01:48:43.000Z | #include <iostream>
#include <cassert>
#include <jsondom/dom.hpp>
#include <utki/debug.hpp>
const char* json = R"qwertyuiop(
{
"key1": "value1",
"key2": "value2"
}
)qwertyuiop";
int main(int c, const char** v){
// parse the JSON to DOM
auto dom = jsondom::read(json);
// check that root node is a JSON obje... | 26.890909 | 79 | 0.650439 | igagis |
25e4f3a861ed66ad20a050f325957b3c46e85b4e | 201 | hpp | C++ | src/reyes/config.hpp | cwbaker/sweet_render | 259830adba09fabe4de2eef3537f4a95828965d3 | [
"MIT"
] | null | null | null | src/reyes/config.hpp | cwbaker/sweet_render | 259830adba09fabe4de2eef3537f4a95828965d3 | [
"MIT"
] | null | null | null | src/reyes/config.hpp | cwbaker/sweet_render | 259830adba09fabe4de2eef3537f4a95828965d3 | [
"MIT"
] | null | null | null | #pragma once
#if defined(BUILD_VARIANT_DEBUG)
#define REYES_ASSERT_ENABLED
#elif defined(BUILD_VARIANT_RELEASE)
#define REYES_ASSERT_ENABLED
#elif defined(BUILD_VARIANT_SHIPPING)
#endif
| 16.75 | 38 | 0.79602 | cwbaker |
25e5dd1051ef29602a493e302b7ccbaf82b04d5f | 1,991 | cpp | C++ | LibSrc/Common/Bits.cpp | mice777/ProfiMail-Symbian- | 97cd5bf1abc65c7decdf8d49f0ac155064683b4b | [
"Apache-2.0"
] | null | null | null | LibSrc/Common/Bits.cpp | mice777/ProfiMail-Symbian- | 97cd5bf1abc65c7decdf8d49f0ac155064683b4b | [
"Apache-2.0"
] | null | null | null | LibSrc/Common/Bits.cpp | mice777/ProfiMail-Symbian- | 97cd5bf1abc65c7decdf8d49f0ac155064683b4b | [
"Apache-2.0"
] | null | null | null | // Multi-platform mobile library
// (c) Lonely Cat Games
//----------------------------
#include <Rules.h>
//----------------------------
dword FindHighestBit(dword mask){
int base = 0;
if(mask&0xffff0000){
base = 16;
mask >>= 16;
}
if(mask&0xff00){
base += 8;
mask >>= 8;
}
... | 22.122222 | 86 | 0.459568 | mice777 |
25e7c9da2160ce3f53d1865fdffb1e2998c7fe93 | 3,187 | cpp | C++ | cpu.cpp | aydanh/HasGB | 05a5f005c03f59b1f47ae4f7af43eedc2beba224 | [
"MIT"
] | null | null | null | cpu.cpp | aydanh/HasGB | 05a5f005c03f59b1f47ae4f7af43eedc2beba224 | [
"MIT"
] | null | null | null | cpu.cpp | aydanh/HasGB | 05a5f005c03f59b1f47ae4f7af43eedc2beba224 | [
"MIT"
] | null | null | null | #include "cpu.h"
#define A r.rAF.hl.h
#define F r.rAF.hl.l
#define B r.rBC.hl.h
#define C r.rBC.hl.l
#define D r.rDE.hl.h
#define E r.rDE.hl.l
#define H r.rHL.hl.h
#define L r.rHL.hl.l
#define AF r.rAF.w
#define BC r.rBC.w
#define DE r.rDE.w
#define HL r.rHL.w
#define PC r.rPC.w
#define SP r.rSP.w
CP... | 26.338843 | 211 | 0.553185 | aydanh |
25f290cffa3c7835bf46b47b9ec301f84409ea6f | 665 | cpp | C++ | bin/barftest/sem/TypeIdentifier.cpp | vdods/barf | 5c943ddbd6a0a7624645158b0c85994431dde269 | [
"Apache-2.0"
] | 1 | 2021-01-16T00:55:45.000Z | 2021-01-16T00:55:45.000Z | bin/barftest/sem/TypeIdentifier.cpp | vdods/barf | 5c943ddbd6a0a7624645158b0c85994431dde269 | [
"Apache-2.0"
] | null | null | null | bin/barftest/sem/TypeIdentifier.cpp | vdods/barf | 5c943ddbd6a0a7624645158b0c85994431dde269 | [
"Apache-2.0"
] | null | null | null | // 2016.09.18 - Victor Dods
#include "barftest/sem/TypeIdentifier.hpp"
#include "barftest/sem/Identifier.hpp"
namespace barftest {
namespace sem {
bool TypeIdentifier::equals (Base const &other_) const
{
TypeIdentifier const &other = dynamic_cast<TypeIdentifier const &>(other_);
return are_equal(this->m_id,... | 21.451613 | 79 | 0.67218 | vdods |
25f516b83d82464ebef4a7e6668c6eb99d8f7dc9 | 3,563 | cpp | C++ | programs/chapter_04/underHoodpsc.cpp | epernia/arm_book | ffdd17618c2c7372cef338fc743f517bf6f0f42b | [
"BSD-3-Clause"
] | 2 | 2021-05-03T17:21:37.000Z | 2021-06-08T08:32:07.000Z | programs/chapter_04/underHoodpsc.cpp | epernia/arm_book | ffdd17618c2c7372cef338fc743f517bf6f0f42b | [
"BSD-3-Clause"
] | null | null | null | programs/chapter_04/underHoodpsc.cpp | epernia/arm_book | ffdd17618c2c7372cef338fc743f517bf6f0f42b | [
"BSD-3-Clause"
] | 2 | 2020-10-14T19:06:24.000Z | 2021-06-08T08:32:09.000Z |
#define NUMBER_OF_BITS 12 // En este caso son 12 bits, porque así está el ejemplo.
DigitalOut startOfConversion(LED1); // Se prende solamente al principio una vez para indicar que empieza.
DigitalOut stepOfConversion(LED2); // Se prende cada vez que se completa uno de los doce pasos.
DigitalOut endOfConversion(LED... | 41.917647 | 110 | 0.751333 | epernia |
25f5f28d0b63b7b9bc00d513dfc4dfb5248ac12d | 525 | hpp | C++ | test/test_prefix.hpp | Oberon00/apollo | 831f4e505afaa04ea827e99f4ced247bb0f0e476 | [
"BSD-2-Clause"
] | 25 | 2016-01-04T23:07:06.000Z | 2022-03-03T11:24:55.000Z | test/test_prefix.hpp | Oberon00/apollo | 831f4e505afaa04ea827e99f4ced247bb0f0e476 | [
"BSD-2-Clause"
] | 2 | 2018-05-21T18:15:49.000Z | 2018-05-21T18:47:05.000Z | test/test_prefix.hpp | Oberon00/apollo | 831f4e505afaa04ea827e99f4ced247bb0f0e476 | [
"BSD-2-Clause"
] | 6 | 2019-12-05T04:05:06.000Z | 2022-03-03T11:24:38.000Z | // Part of the apollo library -- Copyright (c) Christian Neumüller 2015
// This file is subject to the terms of the BSD 2-Clause License.
// See LICENSE.txt or http://opensource.org/licenses/BSD-2-Clause
#ifdef APOLLO_TEST_PREFIX_HPP_INCLUDED
# error Test prefix may only be included once.
#endif
#define APOLLO_TEST... | 30.882353 | 71 | 0.790476 | Oberon00 |
25fa3fb51b15ebc92610d417bb9dbf9e1640aaba | 3,329 | cpp | C++ | select_serv.cpp | MatrixWood/sometestsnippet | 5ab058d6110233c948f2db44b1ba8e70fec04ab9 | [
"MIT"
] | null | null | null | select_serv.cpp | MatrixWood/sometestsnippet | 5ab058d6110233c948f2db44b1ba8e70fec04ab9 | [
"MIT"
] | null | null | null | select_serv.cpp | MatrixWood/sometestsnippet | 5ab058d6110233c948f2db44b1ba8e70fec04ab9 | [
"MIT"
] | null | null | null | #include <sys/types.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <iostream>
#include <string.h>
#include <sys/time.h>
#include <vector>
#include <errno.h>
#define INVALID_FD -1
int main(int argc, char* argv[]) {
int listenfd = socket(AF_INET, SOCK_STREAM, 0);
if (listenfd == ... | 31.40566 | 109 | 0.47672 | MatrixWood |
d301b004ffea4ee8214e970feb3fbd1ce3683bae | 1,635 | hpp | C++ | include/editor/display_options/display_options.hpp | riscygeek/AntSimulator | b35d1b0e0a3601ec326eb2839fb7551672d036af | [
"MIT"
] | null | null | null | include/editor/display_options/display_options.hpp | riscygeek/AntSimulator | b35d1b0e0a3601ec326eb2839fb7551672d036af | [
"MIT"
] | null | null | null | include/editor/display_options/display_options.hpp | riscygeek/AntSimulator | b35d1b0e0a3601ec326eb2839fb7551672d036af | [
"MIT"
] | null | null | null | #pragma once
#include "editor/GUI/named_container.hpp"
#include "editor/GUI/utils.hpp"
#include "editor/control_state.hpp"
#include "editor/GUI/toggle.hpp"
struct DisplayOption : public GUI::NamedContainer
{
ControlState& control_state;
bool draw_ants = false;
bool draw_markers = false;
bool draw_... | 29.727273 | 89 | 0.586544 | riscygeek |
d301e6531e3c9000aa66250cc619740a079a55c2 | 356 | cpp | C++ | Chapter8/L8.5.cpp | flics04/XXXASYBT_CppBase | 0086df68497197f40286889b18f2d8c28eb833bb | [
"MIT"
] | 1 | 2022-02-13T02:22:39.000Z | 2022-02-13T02:22:39.000Z | Chapter8/L8.5.cpp | flics04/XXXASYBT_CppBase | 0086df68497197f40286889b18f2d8c28eb833bb | [
"MIT"
] | null | null | null | Chapter8/L8.5.cpp | flics04/XXXASYBT_CppBase | 0086df68497197f40286889b18f2d8c28eb833bb | [
"MIT"
] | null | null | null | #include <cstdio>
using namespace std;
int main() {
int a[5], i, *pa = a; // 定义整形数组和指针，*pa = a可以在下一行
for (i = 0; i < 5; i++) // 可写成pa + i和&a[i]
scanf("%d", a + i);
for (i = 0; i < 5; i++) // 指针访问数组，可写成*(pa + i)或pa[i]或a[i]
printf("a[%d] = %d... | 27.384615 | 77 | 0.382022 | flics04 |
d302692f9f7a16c33b078ce962cf6a1a59165796 | 1,388 | hpp | C++ | public/anton/type_list.hpp | kociap/atl | a7dc9b35c14453040db82dbbeca3c305bb25c66e | [
"MIT"
] | null | null | null | public/anton/type_list.hpp | kociap/atl | a7dc9b35c14453040db82dbbeca3c305bb25c66e | [
"MIT"
] | null | null | null | public/anton/type_list.hpp | kociap/atl | a7dc9b35c14453040db82dbbeca3c305bb25c66e | [
"MIT"
] | 1 | 2020-12-15T13:51:38.000Z | 2020-12-15T13:51:38.000Z | #pragma once
#include <anton/detail/tuple.hpp>
#include <anton/type_traits/base.hpp>
namespace anton {
template<typename... Ts>
struct Type_List {
public:
using type = Type_List<Ts...>;
};
template<typename... Types>
struct Tuple_Size<Type_List<Types...>>: Integral_Constant<u64, sizeo... | 31.545455 | 95 | 0.622478 | kociap |
d303b1fc0b6fd4cfd2b48426175b5f4749debda1 | 1,822 | cpp | C++ | DjinnTest/math/math.cpp | grandmaster789/Djinn | cfec71b99be399f76b22200a8afa84875cfb0888 | [
"MIT"
] | 2 | 2019-01-15T14:55:40.000Z | 2021-05-07T05:24:32.000Z | DjinnTest/math/math.cpp | grandmaster789/Djinn | cfec71b99be399f76b22200a8afa84875cfb0888 | [
"MIT"
] | null | null | null | DjinnTest/math/math.cpp | grandmaster789/Djinn | cfec71b99be399f76b22200a8afa84875cfb0888 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "CppUnitTest.h"
#include "math/math.h"
using namespace Microsoft::VisualStudio::CppUnitTestFramework;
using namespace djinn::math;
/*
constexpr auto max(const T& v0, const U& v1);
constexpr auto max(const T& v0, const Ts&... vs);
constexpr auto min(const T& v0, const U& v1);
constexp... | 26.028571 | 101 | 0.607025 | grandmaster789 |
d309f2aa51cb5dd0d78751bf02ca2cc0d280002c | 4,043 | hpp | C++ | includes/stream.hpp | otofoto/polpp | 3fb768f5a4d7c430b1c210b4508cf6ed787ce935 | [
"BSL-1.0",
"BSD-3-Clause"
] | 1 | 2021-11-02T22:52:25.000Z | 2021-11-02T22:52:25.000Z | includes/stream.hpp | otofoto/polepp | 3fb768f5a4d7c430b1c210b4508cf6ed787ce935 | [
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | includes/stream.hpp | otofoto/polepp | 3fb768f5a4d7c430b1c210b4508cf6ed787ce935 | [
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | // POLEPP - Portable C++ library to access OLE Storage
// Copyright (C) 2004-2006 Jorge Lodos Vigil
// Copyright (C) 2004 Israel Fernandez Cabrera
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// * Redi... | 44.922222 | 131 | 0.722483 | otofoto |
d309ffb61ccef7a6c4640a19dd85e75e5993a217 | 1,954 | cpp | C++ | tests/utility/test_random.cpp | Kriston-SCT/ospcommon | 7a0b4fa47156a4cc7781652c4ed58f188dddefa6 | [
"Apache-2.0"
] | null | null | null | tests/utility/test_random.cpp | Kriston-SCT/ospcommon | 7a0b4fa47156a4cc7781652c4ed58f188dddefa6 | [
"Apache-2.0"
] | null | null | null | tests/utility/test_random.cpp | Kriston-SCT/ospcommon | 7a0b4fa47156a4cc7781652c4ed58f188dddefa6 | [
"Apache-2.0"
] | null | null | null | // ======================================================================== //
// Copyright 2009-2019 Intel Corporation //
// //
// Licensed under the Apache License, Version 2.0 (the "License"); //
// y... | 44.409091 | 78 | 0.467758 | Kriston-SCT |
d30c7f03f1e7f734cf56de15f852d0273ee0a4c7 | 479 | cpp | C++ | 374. Guess Number Higher or Lower.cpp | zhugejunwei/LeetCode | d3eeaaf2655740c924bcd39fcbcd088cd7b320ce | [
"MIT"
] | 2 | 2016-08-30T00:15:15.000Z | 2016-08-30T00:15:35.000Z | 374. Guess Number Higher or Lower.cpp | zhugejunwei/LeetCode | d3eeaaf2655740c924bcd39fcbcd088cd7b320ce | [
"MIT"
] | null | null | null | 374. Guess Number Higher or Lower.cpp | zhugejunwei/LeetCode | d3eeaaf2655740c924bcd39fcbcd088cd7b320ce | [
"MIT"
] | null | null | null | // Forward declaration of guess API.
// @param num, your guess
// @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
int guess(int num);
class Solution {
public:
int guessNumber(int n) {
int myNum = (1+n) >> 1;
int step = myNum;
int t = 0;
do {
... | 23.95 | 81 | 0.498956 | zhugejunwei |
d31ba9cddad028a12b4fc21a064360cd60deabb2 | 17,043 | cpp | C++ | drishti/gilights.cpp | shouhengli/drishti | 46558d12adcc1d365b7e2125d28190e3be2181c3 | [
"MIT"
] | 118 | 2016-11-01T06:01:44.000Z | 2022-03-30T05:20:19.000Z | drishti/gilights.cpp | shouhengli/drishti | 46558d12adcc1d365b7e2125d28190e3be2181c3 | [
"MIT"
] | 56 | 2016-09-30T09:29:36.000Z | 2022-03-31T17:15:32.000Z | drishti/gilights.cpp | shouhengli/drishti | 46558d12adcc1d365b7e2125d28190e3be2181c3 | [
"MIT"
] | 28 | 2016-07-31T23:48:51.000Z | 2021-05-25T05:32:47.000Z | #include "global.h"
#include "gilights.h"
#include "staticfunctions.h"
#include "propertyeditor.h"
#include <QFileDialog>
int GiLights::count() { return m_giLights.count(); }
GiLights::GiLights()
{
m_sameForAll = true;
m_giLights.clear();
}
GiLights::~GiLights()
{
clear();
}
void
GiLights::clear()
{
for(in... | 22.047865 | 78 | 0.592443 | shouhengli |
d3227fa87936f97e998c32b583451672842c9ce3 | 13,861 | cpp | C++ | tests/typelist_basic.cpp | surrealwaffle/yymp | 662def34a298bf2992bf429e26bc35605906897b | [
"BSL-1.0"
] | 1 | 2020-04-02T12:37:58.000Z | 2020-04-02T12:37:58.000Z | tests/typelist_basic.cpp | surrealwaffle/yymp | 662def34a298bf2992bf429e26bc35605906897b | [
"BSL-1.0"
] | null | null | null | tests/typelist_basic.cpp | surrealwaffle/yymp | 662def34a298bf2992bf429e26bc35605906897b | [
"BSL-1.0"
] | 1 | 2018-11-22T10:36:37.000Z | 2018-11-22T10:36:37.000Z | // SPDX-License-Identifier: BSL-1.0
#include <cstdint>
#include <concepts>
#include <optional>
#include <type_traits>
#include <yymp/typelist.hpp>
using namespace yymp;
using ::std::same_as;
using ::std::index_sequence;
struct custom;
template< class... > struct Template;
template<typename T>
concept has_nested_t... | 29.366525 | 92 | 0.697136 | surrealwaffle |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.