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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
07d0fc460e0805e5aa91ee91bb3fca6152cc415a | 547 | cpp | C++ | UVaOnlineJudge/Problem_Set_Volumes_(100...1999)/Volume6(600-699)/621/code.cpp | luiscbr92/algorithmic-challenges | bc35729e54e4284e9ade1aa61b51a1c2d72aa62c | [
"MIT"
] | 3 | 2015-10-21T18:56:43.000Z | 2017-06-06T10:44:22.000Z | UVaOnlineJudge/Problem_Set_Volumes_(100...1999)/Volume6(600-699)/621/code.cpp | luiscbr92/algorithmic-challenges | bc35729e54e4284e9ade1aa61b51a1c2d72aa62c | [
"MIT"
] | null | null | null | UVaOnlineJudge/Problem_Set_Volumes_(100...1999)/Volume6(600-699)/621/code.cpp | luiscbr92/algorithmic-challenges | bc35729e54e4284e9ade1aa61b51a1c2d72aa62c | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
using namespace std;
int main(){
int cases, length;
string s;
cin >> cases;
for(int i = 0; i < cases; i++){
cin >> s;
if(s=="1" || s == "4" || s == "78") cout << "+\n";
else if ((length = s.size()) >= 2){
if(s.substr(length... | 20.259259 | 78 | 0.380256 | luiscbr92 |
07d4975fc21b06cc10bc666197e980aecd5ba151 | 31,090 | cpp | C++ | src/jsusfx.cpp | asb2m10/jsusfx | be2b3bafe90b0f2eb28739257138844bc9d2941c | [
"Apache-2.0"
] | 49 | 2015-01-05T06:58:59.000Z | 2021-10-21T00:30:08.000Z | src/jsusfx.cpp | umlaeute/jsusfx | be2b3bafe90b0f2eb28739257138844bc9d2941c | [
"Apache-2.0"
] | 25 | 2016-02-25T15:59:03.000Z | 2021-12-20T15:08:16.000Z | src/jsusfx.cpp | umlaeute/jsusfx | be2b3bafe90b0f2eb28739257138844bc9d2941c | [
"Apache-2.0"
] | 13 | 2015-06-17T07:47:39.000Z | 2021-10-07T12:19:46.000Z | /*
* Copyright 2014-2015 Pascal Gauthier
* Copyright 2018 Pascal Gauthier, Marcel Smit
*
* 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
... | 25.694215 | 167 | 0.605886 | asb2m10 |
07d78ba06233cf02120b9ac3264fd6ee7df2a442 | 3,422 | cpp | C++ | src/http/connection_impl.cpp | Ri0n/blog-new-year-2021 | 449ae54400bcc06450d9b90518f3f9a67a5afeed | [
"BSL-1.0"
] | null | null | null | src/http/connection_impl.cpp | Ri0n/blog-new-year-2021 | 449ae54400bcc06450d9b90518f3f9a67a5afeed | [
"BSL-1.0"
] | null | null | null | src/http/connection_impl.cpp | Ri0n/blog-new-year-2021 | 449ae54400bcc06450d9b90518f3f9a67a5afeed | [
"BSL-1.0"
] | null | null | null | //
// Copyright (c) 2021 Richard Hodges (hodges.r@gmail.com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#include "http/connection_impl.hpp"
namespace http
{
net::awaitable< error_code >
connection_impl::connect... | 27.596774 | 79 | 0.547925 | Ri0n |
07d9ecc7783798bbea4197fc3c7db12202a9f9c1 | 4,309 | cpp | C++ | cv/cvthresh.cpp | hoozh/emcv | e61b1d5ad16c255f0306d0e9feb8f32e3a92d97f | [
"BSD-3-Clause"
] | null | null | null | cv/cvthresh.cpp | hoozh/emcv | e61b1d5ad16c255f0306d0e9feb8f32e3a92d97f | [
"BSD-3-Clause"
] | null | null | null | cv/cvthresh.cpp | hoozh/emcv | e61b1d5ad16c255f0306d0e9feb8f32e3a92d97f | [
"BSD-3-Clause"
] | null | null | null | ////////////////////////////////////////////////////////////////////////////////////////
//
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
// By downloading, copying, installing or using the software you agree to this license.
// If you do not agree to this license, do not download, install,... | 37.798246 | 105 | 0.671385 | hoozh |
07dc68a6c8701a2df10ab824dfb0426c3ea3816d | 2,314 | cpp | C++ | reflection/TypeInfo.cpp | jess22664/x3ogre | 9de430859d877407ae0308908390c9fa004b0e84 | [
"MIT"
] | 1 | 2021-09-18T12:50:35.000Z | 2021-09-18T12:50:35.000Z | reflection/TypeInfo.cpp | jess22664/x3ogre | 9de430859d877407ae0308908390c9fa004b0e84 | [
"MIT"
] | null | null | null | reflection/TypeInfo.cpp | jess22664/x3ogre | 9de430859d877407ae0308908390c9fa004b0e84 | [
"MIT"
] | null | null | null | /*
* TypeInfo.cpp
*
* Created on: 13.02.2014
* Author: parojtbe
*/
#include <reflection/TypeInfo.h>
#include <reflection/db.h>
#include <stdexcept>
using namespace std;
namespace reflection {
TypeInfoCommon::TypeInfoCommon(const string& parentType) : _parentType(parentType) {
}
void TypeInfoCommon::_res... | 23.373737 | 107 | 0.625756 | jess22664 |
07dfb138f3f09ce6a032262ec2fb293f2662e9dd | 287 | hpp | C++ | include/Covariance/Covariance2D.hpp | belcour/CovarianceTracing | 60b5cfd82d7b0fa9a623743551ff8cf9595adf07 | [
"Unlicense"
] | 45 | 2016-07-19T21:52:06.000Z | 2021-12-07T08:21:49.000Z | include/Covariance/Covariance2D.hpp | belcour/CovarianceTracing | 60b5cfd82d7b0fa9a623743551ff8cf9595adf07 | [
"Unlicense"
] | null | null | null | include/Covariance/Covariance2D.hpp | belcour/CovarianceTracing | 60b5cfd82d7b0fa9a623743551ff8cf9595adf07 | [
"Unlicense"
] | 7 | 2016-07-28T15:18:26.000Z | 2020-06-14T12:20:16.000Z | #pragma once
namespace Covariance {
/*! The 2D isotropic version of Covariance Tracing.
* This code assumes that light transport in 2 dimensions and only
* store a 2D covariance matrix for space and angles.
*/
struct Covariance2D {
float matrix[3];
};
}
| 19.133333 | 70 | 0.672474 | belcour |
2e3e8506e2bac1efc615f97ab58e5a748a686773 | 305 | cpp | C++ | basics/Q2.cpp | shubhraagarwal/GUVI-codeKata | d8bf2354516dc27dd14d248cf0c702d652423e39 | [
"MIT"
] | null | null | null | basics/Q2.cpp | shubhraagarwal/GUVI-codeKata | d8bf2354516dc27dd14d248cf0c702d652423e39 | [
"MIT"
] | null | null | null | basics/Q2.cpp | shubhraagarwal/GUVI-codeKata | d8bf2354516dc27dd14d248cf0c702d652423e39 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std ;
int main(){
bool isComp = false ;
int n ;
cin>> n;
for(int i = 2 ; i < n ; i++){
if(n % i == 0){
isComp = true ;
cout<<"yes";
break;
}
}
if(isComp == false){
cout<<"no";
}
} | 16.052632 | 33 | 0.390164 | shubhraagarwal |
2e4235f582d4396a492b5d036fb7d17dd7293fa7 | 3,722 | cpp | C++ | Game Engine 2D/Player.cpp | LaPeste/ComposeEngine | 8ae80ec7c49af896978d06371dee96a4d2315372 | [
"Apache-2.0"
] | 1 | 2017-03-13T11:19:40.000Z | 2017-03-13T11:19:40.000Z | Game Engine 2D/Player.cpp | LaPeste/ComposeEngine | 8ae80ec7c49af896978d06371dee96a4d2315372 | [
"Apache-2.0"
] | null | null | null | Game Engine 2D/Player.cpp | LaPeste/ComposeEngine | 8ae80ec7c49af896978d06371dee96a4d2315372 | [
"Apache-2.0"
] | null | null | null | //
// Player.cpp
// GameEngine2D
//
// Created by Andrea Catalini on 23/07/16.
// Copyright © 2016 Andrea Catalini. All rights reserved.
//
#include "Player.hpp"
#include "EntityManager.hpp"
//Components
#include "Appearance.hpp"
#include "Acceleration.hpp"
#include "Animation.hpp"
#include "Controller.hpp"
#incl... | 44.309524 | 197 | 0.764911 | LaPeste |
2e43e3909fb8a28c0174bd04f6f4106674e5bad2 | 6,284 | cpp | C++ | samplecode/CodeSnippets/SnpObjectActionHelper.cpp | shivendra14/AI_CC_2017_SDK_Win | e921f93bef0d73aa809bcda1bd6bbe2c0a4d28b2 | [
"X11"
] | null | null | null | samplecode/CodeSnippets/SnpObjectActionHelper.cpp | shivendra14/AI_CC_2017_SDK_Win | e921f93bef0d73aa809bcda1bd6bbe2c0a4d28b2 | [
"X11"
] | null | null | null | samplecode/CodeSnippets/SnpObjectActionHelper.cpp | shivendra14/AI_CC_2017_SDK_Win | e921f93bef0d73aa809bcda1bd6bbe2c0a4d28b2 | [
"X11"
] | null | null | null | //========================================================================================
//
// $File: //ai_stream/rel_21_0/devtech/sdk/public/samplecode/CodeSnippets/SnpObjectActionHelper.cpp $
//
// $Revision: #1 $
//
// Copyright 1987 Adobe Systems Incorporated. All rights reserved.
//
// NOTICE: Adobe per... | 24.076628 | 117 | 0.713081 | shivendra14 |
2e44698a53fc202d24f7cd59fc7a9cad5f54bf76 | 136,919 | cpp | C++ | start/opencv-3.4.1/build/build_main/modules/highgui/qrc_window_QT.cpp | shengxiaoyi1993/opencv_cpp | 8b9c8f31cd692cc6b1f4945ae0709ea605b15743 | [
"MIT"
] | 2 | 2019-10-08T07:01:36.000Z | 2019-10-08T07:01:38.000Z | start/opencv-3.4.1/build/build_main/modules/highgui/qrc_window_QT.cpp | shengxiaoyi1993/opencv_cpp | 8b9c8f31cd692cc6b1f4945ae0709ea605b15743 | [
"MIT"
] | null | null | null | start/opencv-3.4.1/build/build_main/modules/highgui/qrc_window_QT.cpp | shengxiaoyi1993/opencv_cpp | 8b9c8f31cd692cc6b1f4945ae0709ea605b15743 | [
"MIT"
] | null | null | null | /****************************************************************************
** Resource object code
**
** Created by: The Resource Compiler for Qt version 5.9.7
**
** WARNING! All changes made in this file will be lost!
*****************************************************************************/
static const unsig... | 76.320513 | 146 | 0.764196 | shengxiaoyi1993 |
2e447f5db9918bf5b71eb450ca7e55dcc5d523b5 | 1,908 | cpp | C++ | VOJ/zoj-1610.cpp | PIPIKAI/ACM | b8e4416a29c0619946c9b73b0fe5699b6e96e782 | [
"MIT"
] | null | null | null | VOJ/zoj-1610.cpp | PIPIKAI/ACM | b8e4416a29c0619946c9b73b0fe5699b6e96e782 | [
"MIT"
] | null | null | null | VOJ/zoj-1610.cpp | PIPIKAI/ACM | b8e4416a29c0619946c9b73b0fe5699b6e96e782 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9+7
#define ffr(i,a,b) for(int i=a;i<b;i++)
#define mem(a,b) memset( a,b,sizeof a)
#define Max(x,y) y>x? x=y: x=x
const int maxn=1e4+7;
int vis[maxn],last;
struct node{
int l,r;
ll sum;
void update(ll x){
sum=x;
... | 20.73913 | 61 | 0.455451 | PIPIKAI |
2e447fcca052c1b7cb1736c2a77e2880605f32e9 | 442 | cpp | C++ | VGP332/HelloFSM/GameState.cpp | CyroPCJr/OmegaEngine | 65fbd6cff54266a9c934e3a875a4493d26758661 | [
"MIT"
] | 1 | 2021-04-23T19:18:12.000Z | 2021-04-23T19:18:12.000Z | VGP332/HelloFSM/GameState.cpp | CyroPCJr/OmegaEngine | 65fbd6cff54266a9c934e3a875a4493d26758661 | [
"MIT"
] | null | null | null | VGP332/HelloFSM/GameState.cpp | CyroPCJr/OmegaEngine | 65fbd6cff54266a9c934e3a875a4493d26758661 | [
"MIT"
] | 1 | 2021-06-15T10:42:08.000Z | 2021-06-15T10:42:08.000Z | #include "GameState.h"
#include "Cat.h"
#include <ImGui\Inc\imgui.h>
using namespace FSM;
using namespace Omega::Graphics;
void GameState::Initialize()
{
GraphicsSystem::Get()->SetClearColor(Colors::Black);
mCat.Load();
}
void GameState::Terminate()
{
mCat.UnLoad();
}
void GameState::Update(f... | 13 | 54 | 0.651584 | CyroPCJr |
2e455fd48065ee06527188f5d5f5c63615e16591 | 2,201 | cpp | C++ | DBManager/DBManager.cpp | Zilib/SimpleDatabaseManager | da6e775855d7fdf99935a9991921a6c61666732d | [
"MIT"
] | null | null | null | DBManager/DBManager.cpp | Zilib/SimpleDatabaseManager | da6e775855d7fdf99935a9991921a6c61666732d | [
"MIT"
] | null | null | null | DBManager/DBManager.cpp | Zilib/SimpleDatabaseManager | da6e775855d7fdf99935a9991921a6c61666732d | [
"MIT"
] | null | null | null | #include "database.h"
#include "Menu.h"
#include <Windows.h>
void ShowHeader(Poll* pPoll)
{
// static header, which will always showed
std::cout << pPoll->Title << std::endl;
std::cout << pPoll->Description << std::endl;
}
void ShowPolls(Database* PollDB)
{
int ArrayIndex{ 1 };
for(auto& Poll: PollDB->GetPolls(... | 22.927083 | 113 | 0.645616 | Zilib |
2e45680cfd0f33acd98b3686c71e4354c334eba6 | 28,398 | cc | C++ | scene_game.cc | kawa-yoiko/Fireflies-And-Forest-Flowers | 4bf2e0cbcace7e9b9b2d1264eed6ad9944c3765e | [
"CC-BY-4.0"
] | 1 | 2022-02-06T04:47:26.000Z | 2022-02-06T04:47:26.000Z | scene_game.cc | kawa-yoiko/Fireflies-And-Forest-Flowers | 4bf2e0cbcace7e9b9b2d1264eed6ad9944c3765e | [
"CC-BY-4.0"
] | null | null | null | scene_game.cc | kawa-yoiko/Fireflies-And-Forest-Flowers | 4bf2e0cbcace7e9b9b2d1264eed6ad9944c3765e | [
"CC-BY-4.0"
] | null | null | null | #include "main.hh"
#include "utils.hh"
#include <cstdio>
#include <utility>
#include <vector>
static inline bool seg_intxn(
const vec2 a, const vec2 b,
const vec2 c, const vec2 d
) {
return (c - a).det(b - a) * (d - a).det(b - a) <= 0 &&
(a - c).det(d - c) * (b - c).det(d - c) <= 0;
}
class scene_game... | 30.050794 | 100 | 0.535249 | kawa-yoiko |
2e4791187e3b5ec0af2233dfaabad323952be920 | 773 | cpp | C++ | algospot/QUADTREE.cpp | Twinparadox/AlgorithmProblem | 0190d17555306600cfd439ad5d02a77e663c9a4e | [
"MIT"
] | null | null | null | algospot/QUADTREE.cpp | Twinparadox/AlgorithmProblem | 0190d17555306600cfd439ad5d02a77e663c9a4e | [
"MIT"
] | null | null | null | algospot/QUADTREE.cpp | Twinparadox/AlgorithmProblem | 0190d17555306600cfd439ad5d02a77e663c9a4e | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstring>
#define MAXTREESIZE 4
using namespace std;
typedef struct TreeNode
{
char color;
struct TreeNode* link[MAXTREESIZE]; // 0:left-top 1:right-top 2:left-bottom 3:right-bottom
}TreeNode;
void AddTreeNode(char color)
{
TreeNode* newnode = CreateNode(color);
}
TreeNode* CreateNo... | 16.804348 | 91 | 0.658473 | Twinparadox |
2e4c85416c7524df5dadf03a5e8999f7f5c064ff | 401 | cpp | C++ | FakeReal/Source/Engine/Render/Buffer/UniformBuffer.cpp | UGEL4/FakeReal | 4ffc39fc500629fd537f688c56d5acdfc34d0b30 | [
"Apache-2.0"
] | null | null | null | FakeReal/Source/Engine/Render/Buffer/UniformBuffer.cpp | UGEL4/FakeReal | 4ffc39fc500629fd537f688c56d5acdfc34d0b30 | [
"Apache-2.0"
] | null | null | null | FakeReal/Source/Engine/Render/Buffer/UniformBuffer.cpp | UGEL4/FakeReal | 4ffc39fc500629fd537f688c56d5acdfc34d0b30 | [
"Apache-2.0"
] | null | null | null | #include "UniformBuffer.h"
#include "../Renderer.h"
#include <assert.h>
#include "../../Platform/OpenGL/Render/Buffer/UniformBuffer_GL.h"
namespace FakeReal {
UniformBuffer* UniformBuffer::Create(unsigned int uiSize, unsigned int uiBinding)
{
switch (Renderer::GetAPI())
{
case RenderAPI::API::OpenGL: return n... | 21.105263 | 82 | 0.720698 | UGEL4 |
2e5316d8636bb256b2c48ffcf1d5e88c2d7b31ee | 235 | cpp | C++ | src/OpenLoco/GameState.cpp | petergaal/OpenLoco | d915b8b9d2ee2b90e2d7c9b5eae44a6fd01fee2c | [
"MIT"
] | 585 | 2019-02-20T18:32:39.000Z | 2022-03-31T10:59:57.000Z | src/OpenLoco/GameState.cpp | petergaal/OpenLoco | d915b8b9d2ee2b90e2d7c9b5eae44a6fd01fee2c | [
"MIT"
] | 643 | 2019-02-19T19:54:32.000Z | 2022-03-31T12:34:37.000Z | src/OpenLoco/GameState.cpp | petergaal/OpenLoco | d915b8b9d2ee2b90e2d7c9b5eae44a6fd01fee2c | [
"MIT"
] | 84 | 2019-02-19T15:03:14.000Z | 2022-03-30T01:27:02.000Z | #include "GameState.h"
#include "Interop/Interop.hpp"
using namespace OpenLoco::Interop;
namespace OpenLoco
{
loco_global<GameState, 0x00525E18> _gameState;
GameState& getGameState()
{
return *_gameState;
}
}
| 16.785714 | 50 | 0.697872 | petergaal |
2e54a0ab947cd3aa3aeca2011505a741888cf1c3 | 16,840 | cpp | C++ | src/plugins/simulator/physics_engines/dynamics2d/dynamics2d_engine.cpp | freedomcondor/argos3-harry | 10cc040af3d5339538cfd801f0317fa8269429a5 | [
"MIT"
] | null | null | null | src/plugins/simulator/physics_engines/dynamics2d/dynamics2d_engine.cpp | freedomcondor/argos3-harry | 10cc040af3d5339538cfd801f0317fa8269429a5 | [
"MIT"
] | null | null | null | src/plugins/simulator/physics_engines/dynamics2d/dynamics2d_engine.cpp | freedomcondor/argos3-harry | 10cc040af3d5339538cfd801f0317fa8269429a5 | [
"MIT"
] | null | null | null | /**
* @file <argos3/plugins/simulator/physics_engines/dynamics2d/dynamics2d_engine.cpp>
*
* @author Carlo Pinciroli - <ilpincy@gmail.com>
*/
#include "dynamics2d_engine.h"
#include "dynamics2d_model.h"
#include "dynamics2d_gripping.h"
#include <argos3/core/simulator/simulator.h>
#include <argos3/core/simulator/en... | 47.705382 | 130 | 0.500238 | freedomcondor |
2e550b4bec8359ca1197d95f8c1a1b8bac17345f | 718 | hpp | C++ | libcaf_core/caf/message_priority.hpp | seewpx/actor-framework | 65ecf35317b81d7a211848d59e734f43483fe410 | [
"BSD-3-Clause"
] | 2,517 | 2015-01-04T22:19:43.000Z | 2022-03-31T12:20:48.000Z | libcaf_core/caf/message_priority.hpp | seewpx/actor-framework | 65ecf35317b81d7a211848d59e734f43483fe410 | [
"BSD-3-Clause"
] | 894 | 2015-01-07T14:21:21.000Z | 2022-03-30T06:37:18.000Z | libcaf_core/caf/message_priority.hpp | seewpx/actor-framework | 65ecf35317b81d7a211848d59e734f43483fe410 | [
"BSD-3-Clause"
] | 570 | 2015-01-21T18:59:33.000Z | 2022-03-31T19:00:02.000Z | // This file is part of CAF, the C++ Actor Framework. See the file LICENSE in
// the main distribution directory for license terms and copyright or visit
// https://github.com/actor-framework/actor-framework/blob/master/LICENSE.
#pragma once
#include <cstdint>
#include <string>
#include <type_traits>
#include "caf/d... | 24.758621 | 77 | 0.777159 | seewpx |
2e5adc532c473086d5dfeae55fede6b12fc532b1 | 5,415 | cpp | C++ | Templates/Project/Volund_Engine/src/Components/Renderer.cpp | Kaj9296/Volund-Engine | 2416edc6297da4818f0a9f5613daf2223ff868d9 | [
"MIT"
] | null | null | null | Templates/Project/Volund_Engine/src/Components/Renderer.cpp | Kaj9296/Volund-Engine | 2416edc6297da4818f0a9f5613daf2223ff868d9 | [
"MIT"
] | null | null | null | Templates/Project/Volund_Engine/src/Components/Renderer.cpp | Kaj9296/Volund-Engine | 2416edc6297da4818f0a9f5613daf2223ff868d9 | [
"MIT"
] | null | null | null | #pragma once
#include "PCH/PCH.h"
#include "Renderer.h"
#include "Camera.h"
#include "PointLight.h"
#include "DirectionalLight.h"
#include "Scene/Entity.h"
namespace Volund
{
void Renderer::SetMesh(Mesh& mesh)
{
this->mesh = &mesh;
}
void Renderer::SetMaterial(Material& material)
{
this->material = &materia... | 24.391892 | 136 | 0.668698 | Kaj9296 |
2e60934cfd02eaca62550f7d4ecc11f52d007808 | 31,741 | cpp | C++ | .vim/sourceCode/ogre_src_v1-8-1/RenderSystems/GL/src/nvparse/ps1.0_program.cpp | lakehui/Vim_config | 6cab80dc1209b34bf6379f42b1a92790bd0c146b | [
"MIT"
] | 2 | 2017-08-03T07:15:00.000Z | 2018-06-18T10:32:53.000Z | .vim/sourceCode/ogre_src_v1-8-1/RenderSystems/GL/src/nvparse/ps1.0_program.cpp | lakehui/Vim_config | 6cab80dc1209b34bf6379f42b1a92790bd0c146b | [
"MIT"
] | null | null | null | .vim/sourceCode/ogre_src_v1-8-1/RenderSystems/GL/src/nvparse/ps1.0_program.cpp | lakehui/Vim_config | 6cab80dc1209b34bf6379f42b1a92790bd0c146b | [
"MIT"
] | 2 | 2019-03-04T22:57:42.000Z | 2020-03-06T01:32:26.000Z | #include "ps1.0_program.h"
#include "nvparse_errors.h"
#include "nvparse_externs.h"
#include <string>
#include <map>
#include <algorithm>
#include <string.h>
#include <set>
using namespace std;
using namespace ps10;
struct ltstr
{
bool operator()(const char* s1, const char* s2) const
{
return strcmp(s1, s2) < 0... | 31.395648 | 110 | 0.650137 | lakehui |
2e662137a9b2b83cf0785cde027fba2a1c52102e | 1,830 | cpp | C++ | src/KrTools.cpp | cildhdi/KrUI | c6f18620838f15a82ee65cef5c8d428137e551fb | [
"MIT"
] | 5 | 2017-09-08T09:41:58.000Z | 2018-11-26T13:16:55.000Z | src/KrTools.cpp | cildhdi/KrUI | c6f18620838f15a82ee65cef5c8d428137e551fb | [
"MIT"
] | null | null | null | src/KrTools.cpp | cildhdi/KrUI | c6f18620838f15a82ee65cef5c8d428137e551fb | [
"MIT"
] | 2 | 2018-10-08T20:18:09.000Z | 2020-04-13T01:47:19.000Z | #include "KrTools.h"
namespace KrUI
{
Gdiplus::SizeF GetTextSize(std::wstring strText, Gdiplus::Font* pFont, Gdiplus::Rect rect)
{
Gdiplus::GraphicsPath path;
Gdiplus::FontFamily fontfamily;
pFont->GetFamily(&fontfamily);
path.AddString(strText.c_str(), -1, &fontfamily, pFont->GetStyle(), pFont->GetSize(), r... | 25.774648 | 93 | 0.67541 | cildhdi |
2e668c6401e862a3bde6e7ee6eb790214b429c7e | 1,841 | hxx | C++ | src/libserver/css/css_property.hxx | korgoth1/rspamd | 154f69f000244785209dcef937c47f10ede1f113 | [
"Apache-2.0"
] | null | null | null | src/libserver/css/css_property.hxx | korgoth1/rspamd | 154f69f000244785209dcef937c47f10ede1f113 | [
"Apache-2.0"
] | null | null | null | src/libserver/css/css_property.hxx | korgoth1/rspamd | 154f69f000244785209dcef937c47f10ede1f113 | [
"Apache-2.0"
] | null | null | null | /*-
* Copyright 2021 Vsevolod Stakhov
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed... | 25.929577 | 81 | 0.705052 | korgoth1 |
2e67eeed9cedf80b049288d9e2fdc3aa7e4cf44d | 5,390 | cpp | C++ | src/convolution.cpp | likunlun0618/snn | 65d2d919ad40842eb1682b9484a067d792503318 | [
"MIT"
] | 4 | 2020-01-16T08:15:22.000Z | 2020-03-30T04:30:23.000Z | src/convolution.cpp | likunlun0618/snn | 65d2d919ad40842eb1682b9484a067d792503318 | [
"MIT"
] | null | null | null | src/convolution.cpp | likunlun0618/snn | 65d2d919ad40842eb1682b9484a067d792503318 | [
"MIT"
] | null | null | null | #include <iostream>
#include <sstream>
#include <cblas.h>
#include <cstdlib>
#include "convolution.h"
//#include "global.h"
//#include "time.h"
namespace snn
{
Module* createConvolution(std::string options)
{
// 目前没有做错误处理
// b=0表示添加bias，b=1表示不添加bias
// 将所有的逗号替换为空格
// 因为原始文件需要用空格做split，所有不能直接用带空格的字符串做... | 23.744493 | 90 | 0.459184 | likunlun0618 |
2e74647c409d68563ee04a2d2e000e3eb05061dd | 11,623 | hpp | C++ | 180726_calculate/calculate2.1.1rc6/calculate/node.hpp | newlawrence/Talks | d4f4e6b6ecf8f1aaf32ca9a2364c99ee23612745 | [
"CC-BY-4.0"
] | null | null | null | 180726_calculate/calculate2.1.1rc6/calculate/node.hpp | newlawrence/Talks | d4f4e6b6ecf8f1aaf32ca9a2364c99ee23612745 | [
"CC-BY-4.0"
] | 1 | 2019-01-15T14:21:34.000Z | 2019-01-15T15:19:41.000Z | 180726_calculate/calculate2.1.1rc6/calculate/node.hpp | newlawrence/Talks | d4f4e6b6ecf8f1aaf32ca9a2364c99ee23612745 | [
"CC-BY-4.0"
] | null | null | null | /*
Calculate - Version 2.1.1rc6
Last modified 2018/07/23
Released under MIT license
Copyright (c) 2016-2018 Alberto Lorenzo <alorenzo.md@gmail.com>
*/
#ifndef __CALCULATE_NODE_HPP__
#define __CALCULATE_NODE_HPP__
#include <iterator>
#include <ostream>
#include <stack>
#include <regex>
#include <unord... | 30.748677 | 96 | 0.549772 | newlawrence |
2e770860d8331c041eb4dc0ce3ea9ff1533f8ff2 | 575 | cpp | C++ | final/stl containers/[]_vs_at()_vs_it.cpp | coderica/effective_cpp | 456d30cf42c6c71dc7187d88e362651dd79ac3fe | [
"MIT"
] | null | null | null | final/stl containers/[]_vs_at()_vs_it.cpp | coderica/effective_cpp | 456d30cf42c6c71dc7187d88e362651dd79ac3fe | [
"MIT"
] | null | null | null | final/stl containers/[]_vs_at()_vs_it.cpp | coderica/effective_cpp | 456d30cf42c6c71dc7187d88e362651dd79ac3fe | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <string>
using namespace std;
void main()
{
vector<string> people = { "alice", "barbara", "cleo", "darlene", "edna" };
try {
for (auto i = 0; i < people.size(); i++)
cout << people[i] << " ";
cout << endl;
for (auto i = 0; i < people.size(); i++... | 20.535714 | 76 | 0.50087 | coderica |
2e789f06af897447476f1d56a49eef96e8e51284 | 552 | cc | C++ | lhd/Code/onlyread_.cc | xiyoulinuxgroup-2019-summer/TeamF | 7a661b172f7410583bd11335a3b049f9df8797a3 | [
"MIT"
] | null | null | null | lhd/Code/onlyread_.cc | xiyoulinuxgroup-2019-summer/TeamF | 7a661b172f7410583bd11335a3b049f9df8797a3 | [
"MIT"
] | null | null | null | lhd/Code/onlyread_.cc | xiyoulinuxgroup-2019-summer/TeamF | 7a661b172f7410583bd11335a3b049f9df8797a3 | [
"MIT"
] | 1 | 2019-07-15T06:28:11.000Z | 2019-07-15T06:28:11.000Z | //只读算法
//学习闭包的概念
#include<iostream>
#include<numeric>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
vector<int> a;
a.push_back(1);
a.push_back(2);
a.push_back(3);
vector<int> b ;
b.push_back(1);
b.push_back(2);
b.push_back(3);
int sum = accumulate(a.... | 20.444444 | 55 | 0.597826 | xiyoulinuxgroup-2019-summer |
2e7c3c3300e62bbc655d664e247ec281bd44ce2d | 567 | cpp | C++ | Leetcode Solution/Tree/Easy/897. Increasing Order Search Tree.cpp | bilwa496/Placement-Preparation | bd32ee717f671d95c17f524ed28b0179e0feb044 | [
"MIT"
] | 169 | 2021-05-30T10:02:19.000Z | 2022-03-27T18:09:32.000Z | Leetcode Solution/Tree/Easy/897. Increasing Order Search Tree.cpp | bilwa496/Placement-Preparation | bd32ee717f671d95c17f524ed28b0179e0feb044 | [
"MIT"
] | 1 | 2021-10-02T14:46:26.000Z | 2021-10-02T14:46:26.000Z | Leetcode Solution/Tree/Easy/897. Increasing Order Search Tree.cpp | bilwa496/Placement-Preparation | bd32ee717f671d95c17f524ed28b0179e0feb044 | [
"MIT"
] | 44 | 2021-05-30T19:56:29.000Z | 2022-03-17T14:49:00.000Z |
class Solution {
private:
TreeNode *prev=NULL;
public:
TreeNode* increasingBST(TreeNode* root) {
if(NULL == root)
return root;
//Traversing right subtree first
increasingBST(root->right);
root->right=prev;
prev=root;
TreeNode *res=root;
... | 22.68 | 80 | 0.550265 | bilwa496 |
2e7c6a1586f6ca65bf01743261d5a11debb26189 | 1,782 | hpp | C++ | OptimExplorer/widgets/metrics.hpp | MarkTuddenham/OptimExplorer | 1fb724bb80b099ade76d9f8d6179cb561dedb9bd | [
"MIT"
] | 1 | 2020-08-18T20:55:26.000Z | 2020-08-18T20:55:26.000Z | OptimExplorer/widgets/metrics.hpp | MarkTuddenham/OptimExplorer | 1fb724bb80b099ade76d9f8d6179cb561dedb9bd | [
"MIT"
] | 4 | 2020-10-11T12:57:29.000Z | 2020-10-11T14:06:17.000Z | OptimExplorer/widgets/metrics.hpp | MarkTuddenham/OptimExplorer | 1fb724bb80b099ade76d9f8d6179cb561dedb9bd | [
"MIT"
] | null | null | null | #pragma once
#include "core/events.hpp"
#include "core/utils.hpp"
#include "widgets/utils.hpp"
#include "widgets/widget.hpp"
DISABLE_WARNING_PUSH_ALL
#include <Mahi/Gui.hpp>
DISABLE_WARNING_POP
#include <iostream>
#include <utility>
#include <vector>
namespace OptimExplorer
{
class MetricsWidget : public Widget
{
... | 24.081081 | 83 | 0.664422 | MarkTuddenham |
2e7d2873f7b314fbce113a0526319ff88f7bf73d | 3,960 | hpp | C++ | SOFT_dynamics/include/SOFT/TROTTER_prop.hpp | deba-cyber/SOFT_dynamics | 7ccad22a01f2e2782bf829aa670acb8c90e83b68 | [
"MIT"
] | null | null | null | SOFT_dynamics/include/SOFT/TROTTER_prop.hpp | deba-cyber/SOFT_dynamics | 7ccad22a01f2e2782bf829aa670acb8c90e83b68 | [
"MIT"
] | null | null | null | SOFT_dynamics/include/SOFT/TROTTER_prop.hpp | deba-cyber/SOFT_dynamics | 7ccad22a01f2e2782bf829aa670acb8c90e83b68 | [
"MIT"
] | null | null | null | # if !defined (TROTTER)
# define TROTTER
# include <SOFT/constants.hpp>
# include <iosfwd>
# include <vector>
# include <string>
# include <fftw3.h>
/* function to generate potential part of Trotter product
* of type fftw_complex */
std::vector<fftw_complex> get_pot_trotter_part(const std::vector<double>& V_vect)... | 33.277311 | 92 | 0.558838 | deba-cyber |
2e858331884578dde4fd38bc96a3199e87f64bc4 | 135 | cpp | C++ | BOJ_CPP/14490.cpp | tnsgh9603/BOJ_CPP | 432b1350f6c67cce83aec3e723e30a3c6b5dbfda | [
"MIT"
] | null | null | null | BOJ_CPP/14490.cpp | tnsgh9603/BOJ_CPP | 432b1350f6c67cce83aec3e723e30a3c6b5dbfda | [
"MIT"
] | null | null | null | BOJ_CPP/14490.cpp | tnsgh9603/BOJ_CPP | 432b1350f6c67cce83aec3e723e30a3c6b5dbfda | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
int main(){int a,b,g;scanf("%is_prime:%is_prime",&a,&b);g=std::gcd(a,b);printf("%is_prime:%is_prime",a/g,b/g);} | 67.5 | 111 | 0.644444 | tnsgh9603 |
2e8875fe1d9e64bc928c3b7f179c5be93507012b | 7,877 | cpp | C++ | addons/ofxPostProcessing/src/NoiseWarpPass.cpp | creatologist/openFrameworks0084 | aa74f188f105b62fbcecb7baf2b41d56d97cf7bc | [
"MIT"
] | null | null | null | addons/ofxPostProcessing/src/NoiseWarpPass.cpp | creatologist/openFrameworks0084 | aa74f188f105b62fbcecb7baf2b41d56d97cf7bc | [
"MIT"
] | null | null | null | addons/ofxPostProcessing/src/NoiseWarpPass.cpp | creatologist/openFrameworks0084 | aa74f188f105b62fbcecb7baf2b41d56d97cf7bc | [
"MIT"
] | null | null | null | /*
* NoiseWarpPass.cpp
*
* Copyright (c) 2013, Neil Mendoza, http://www.neilmendoza.com
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code m... | 42.578378 | 127 | 0.488765 | creatologist |
2e8a46e74dc16ecd02c750626c56df64ccf1c24d | 2,487 | cpp | C++ | TameParse/Dfa/character_lexer.cpp | Logicalshift/TameParse | 59512fc5c098046922099a59328ca82f174d8f68 | [
"MIT"
] | 6 | 2018-01-10T22:37:32.000Z | 2019-06-19T04:44:32.000Z | TameParse/Dfa/character_lexer.cpp | Logicalshift/TameParse | 59512fc5c098046922099a59328ca82f174d8f68 | [
"MIT"
] | null | null | null | TameParse/Dfa/character_lexer.cpp | Logicalshift/TameParse | 59512fc5c098046922099a59328ca82f174d8f68 | [
"MIT"
] | null | null | null | //
// character_lexer.cpp
// Parse
//
// Created by Andrew Hunter on 14/05/2011.
//
// Copyright (c) 2011-2012 Andrew Hunter
//
// 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 Softwa... | 33.16 | 125 | 0.70969 | Logicalshift |
2e8de52c7b8eba8b6384f4e172062063721a5859 | 2,491 | cpp | C++ | atcoder/arc016/C/main.cpp | Johniel/contests | b692eff913c20e2c1eb4ff0ce3cd4c57900594e0 | [
"Unlicense"
] | null | null | null | atcoder/arc016/C/main.cpp | Johniel/contests | b692eff913c20e2c1eb4ff0ce3cd4c57900594e0 | [
"Unlicense"
] | 19 | 2016-05-04T02:46:31.000Z | 2021-11-27T06:18:33.000Z | atcoder/arc016/C/main.cpp | Johniel/contests | b692eff913c20e2c1eb4ff0ce3cd4c57900594e0 | [
"Unlicense"
] | null | null | null | // atcoder/arc016/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... | 31.531646 | 150 | 0.507828 | Johniel |
2e919489f2f6981ce86b9ea5e0702489e79a572a | 396 | hpp | C++ | NWNXLib/API/Mac/API/xGetGeometryReply.hpp | acaos/nwnxee-unified | 0e4c318ede64028c1825319f39c012e168e0482c | [
"MIT"
] | 1 | 2019-06-04T04:30:24.000Z | 2019-06-04T04:30:24.000Z | NWNXLib/API/Mac/API/xGetGeometryReply.hpp | presscad/nwnee | 0f36b281524e0b7e9796bcf30f924792bf9b8a38 | [
"MIT"
] | null | null | null | NWNXLib/API/Mac/API/xGetGeometryReply.hpp | presscad/nwnee | 0f36b281524e0b7e9796bcf30f924792bf9b8a38 | [
"MIT"
] | 1 | 2019-10-20T07:54:45.000Z | 2019-10-20T07:54:45.000Z | #pragma once
#include <cstdint>
#include "unknown_CARD8.hpp"
namespace NWNXLib {
namespace API {
struct xGetGeometryReply
{
CARD8 type;
uint8_t depth;
uint16_t sequenceNumber;
uint32_t length;
uint32_t root;
int16_t x;
int16_t y;
uint16_t width;
uint16_t height;
uint16_t bor... | 12.774194 | 28 | 0.669192 | acaos |
2e91b3017863e7a26c289f6e5e11953ea38c12bf | 274 | hpp | C++ | cvmat2qimage/include/cvmat2qimage.hpp | majorx234/qt_videocam_hough | bb8c5ac8045a1d312e3428705967960496688846 | [
"BSD-2-Clause"
] | null | null | null | cvmat2qimage/include/cvmat2qimage.hpp | majorx234/qt_videocam_hough | bb8c5ac8045a1d312e3428705967960496688846 | [
"BSD-2-Clause"
] | null | null | null | cvmat2qimage/include/cvmat2qimage.hpp | majorx234/qt_videocam_hough | bb8c5ac8045a1d312e3428705967960496688846 | [
"BSD-2-Clause"
] | null | null | null | #ifndef CVMAT2QIMAGE_HPP
#define CVMAT2QIMAGE_HPP
#include <QImage>
#include <opencv2/core/core.hpp>
#include <string>
cv::Mat qimage2cvmat( const QImage &inImage);
QImage cvmat2qimage( const cv::Mat &inMat );
std::string type2str(int type);
#endif // QT_OPENCV_CONV_HPP | 22.833333 | 45 | 0.766423 | majorx234 |
2e9220c365030107a4e71da79f7781e3ff3a865f | 1,519 | cpp | C++ | src/tools.cpp | andrestoga/CarND-Extended-Kalman-Filter-Project | b387f9282258cfe92db654c50478cf3d1c1f5a9a | [
"MIT"
] | null | null | null | src/tools.cpp | andrestoga/CarND-Extended-Kalman-Filter-Project | b387f9282258cfe92db654c50478cf3d1c1f5a9a | [
"MIT"
] | null | null | null | src/tools.cpp | andrestoga/CarND-Extended-Kalman-Filter-Project | b387f9282258cfe92db654c50478cf3d1c1f5a9a | [
"MIT"
] | null | null | null | #include "tools.h"
#include <iostream>
using Eigen::VectorXd;
using Eigen::MatrixXd;
using std::vector;
Tools::Tools() {}
Tools::~Tools() {}
VectorXd Tools::CalculateRMSE(const vector<VectorXd> &estimations,
const vector<VectorXd> &ground_truth) {
/**
* Calculate the RMSE here.
... | 19.986842 | 71 | 0.57077 | andrestoga |
2e9699a79cf8fed4f81696cf4b3380f9b63a9143 | 423 | cpp | C++ | ch10/ex10_13.cpp | sanerror/sanerror-s-Cpp-Primer-Answers | 1e14c4789cacf03050c0aec93eb2e3a12010a77a | [
"MIT"
] | null | null | null | ch10/ex10_13.cpp | sanerror/sanerror-s-Cpp-Primer-Answers | 1e14c4789cacf03050c0aec93eb2e3a12010a77a | [
"MIT"
] | null | null | null | ch10/ex10_13.cpp | sanerror/sanerror-s-Cpp-Primer-Answers | 1e14c4789cacf03050c0aec93eb2e3a12010a77a | [
"MIT"
] | null | null | null | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
bool judge(const string & s1) {
return s1.size() < 5;
}
int main() {
vector<string> str{ "pen","pineapple","apple","pen" };
auto judge_begin = partition(str.begin(), str.end(), judge);
while (judge_beg... | 20.142857 | 62 | 0.607565 | sanerror |
2e989ae4e8f30f505d462831ba4ecec648258fb3 | 1,217 | cpp | C++ | src/allegro_flare/random.cpp | MarkOates/allegro_flare | b454cb85eb5e43d19c23c0c6fd2dc11b96666ce7 | [
"MIT"
] | 25 | 2015-03-30T02:02:43.000Z | 2019-03-04T22:29:12.000Z | src/allegro_flare/random.cpp | MarkOates/allegro_flare | b454cb85eb5e43d19c23c0c6fd2dc11b96666ce7 | [
"MIT"
] | 122 | 2015-04-01T08:15:26.000Z | 2019-10-16T20:31:22.000Z | src/allegro_flare/random.cpp | allegroflare/allegro_flare | 21d6fe2a5a5323102285598c8a8c75b393ce0322 | [
"MIT"
] | 4 | 2020-02-25T18:17:31.000Z | 2021-04-17T05:06:52.000Z | #include <allegro_flare/random.h>
namespace allegro_flare
{
Random::Random(unsigned int seed)
: seed(seed)
{
set_seed(seed);
}
void Random::set_seed(unsigned int new_seed)
{
seed = new_seed;
random_number_generator.seed(seed);
}
unsigned int Random::get_seed()
{... | 15.2125 | 60 | 0.622021 | MarkOates |
2e9d43df63c223a59a3b2d72792c53251da00d21 | 791 | cpp | C++ | unit/goto-programs/goto_trace_output.cpp | jeannielynnmoulton/cbmc | 1d4af6d88ec960677170049a8a89a9166b952996 | [
"BSD-4-Clause"
] | null | null | null | unit/goto-programs/goto_trace_output.cpp | jeannielynnmoulton/cbmc | 1d4af6d88ec960677170049a8a89a9166b952996 | [
"BSD-4-Clause"
] | 1 | 2019-02-05T16:18:25.000Z | 2019-02-05T16:18:25.000Z | unit/goto-programs/goto_trace_output.cpp | jeannielynnmoulton/cbmc | 1d4af6d88ec960677170049a8a89a9166b952996 | [
"BSD-4-Clause"
] | null | null | null | /*******************************************************************\
Module: Unit tests for goto_trace_stept::output
Author: Diffblue Limited. All rights reserved.
\*******************************************************************/
#include <testing-utils/catch.hpp>
#include <goto-programs/goto_program_templat... | 29.296296 | 69 | 0.633375 | jeannielynnmoulton |
2e9db5bb7662098821c5b9b89ae2b0c376e7ef56 | 14,618 | hpp | C++ | src/Discretization/Basis/Intrepid_HGRAD_QUAD_Cn_FEMDef.hpp | Sandia2014/intrepid | 9a310ddc033da1dda162a09bf80cca6c2dde2d6b | [
"MIT"
] | null | null | null | src/Discretization/Basis/Intrepid_HGRAD_QUAD_Cn_FEMDef.hpp | Sandia2014/intrepid | 9a310ddc033da1dda162a09bf80cca6c2dde2d6b | [
"MIT"
] | null | null | null | src/Discretization/Basis/Intrepid_HGRAD_QUAD_Cn_FEMDef.hpp | Sandia2014/intrepid | 9a310ddc033da1dda162a09bf80cca6c2dde2d6b | [
"MIT"
] | null | null | null | #ifndef INTREPID_HGRAD_QUAD_CN_FEMDEF_HPP
#define INTREPID_HGRAD_QUAD_CN_FEMDEF_HPP
// @HEADER
// ************************************************************************
//
// Intrepid Package
// Copyright (2007) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL850... | 37.007595 | 113 | 0.668012 | Sandia2014 |
2ea00050e999b07f5da7e6dc0320ed81eca8c19e | 1,112 | cpp | C++ | mythread.cpp | xiaoxiaozhu5/videotrans | 3c33a4cfdf42ad9578183c3dfcc0670cc51a6139 | [
"MIT"
] | 2 | 2020-04-13T10:00:48.000Z | 2020-05-13T09:44:56.000Z | mythread.cpp | xiaoxiaozhu5/videotrans | 3c33a4cfdf42ad9578183c3dfcc0670cc51a6139 | [
"MIT"
] | null | null | null | mythread.cpp | xiaoxiaozhu5/videotrans | 3c33a4cfdf42ad9578183c3dfcc0670cc51a6139 | [
"MIT"
] | 2 | 2016-05-02T11:58:39.000Z | 2018-09-03T16:32:28.000Z | #include "mythread.h"
MyThread::MyThread()
{
runing_ = 1;
#ifdef OK6410
vd = new VideoDevice(tr("/dev/video2"));
#else
vd_ = new VideoDevice(tr("/dev/video0"));
#endif
if(-1 == vd_->open_device())
{
exit(EXIT_FAILURE);
}
if(-1 == vd_->init_device())
{
exit(EXIT_FAILUR... | 15.444444 | 60 | 0.482014 | xiaoxiaozhu5 |
2ea10d0c6a184afa432a92c8b548c83c9b818c2a | 5,504 | cc | C++ | src/tests/pmempools/pmempool_create/valid_arguments_tests.cc | muttleyxd/pmdk-tests | 17e66a5a9d825be385ab2824c4a754f1b8a839d4 | [
"BSD-3-Clause"
] | null | null | null | src/tests/pmempools/pmempool_create/valid_arguments_tests.cc | muttleyxd/pmdk-tests | 17e66a5a9d825be385ab2824c4a754f1b8a839d4 | [
"BSD-3-Clause"
] | null | null | null | src/tests/pmempools/pmempool_create/valid_arguments_tests.cc | muttleyxd/pmdk-tests | 17e66a5a9d825be385ab2824c4a754f1b8a839d4 | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright 2017, Intel Corporation
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the f... | 42.015267 | 80 | 0.646076 | muttleyxd |
2ea3aa3f4fffe038e284106b6d3cb5bec3731cfe | 86 | hpp | C++ | components/downtime/ui/titles.hpp | Bubbus/F3_CA_BUB | cd7a725d65afa56a3a7f24288c839333f03b5454 | [
"Unlicense"
] | 1 | 2020-10-30T16:10:23.000Z | 2020-10-30T16:10:23.000Z | components/downtime/ui/titles.hpp | Bubbus/F3_CA_BUB | cd7a725d65afa56a3a7f24288c839333f03b5454 | [
"Unlicense"
] | 41 | 2020-11-20T18:24:19.000Z | 2021-12-14T15:51:50.000Z | components/downtime/ui/titles.hpp | Bubbus/F3_CA_BUB | cd7a725d65afa56a3a7f24288c839333f03b5454 | [
"Unlicense"
] | 2 | 2020-11-08T16:59:28.000Z | 2021-11-30T11:41:10.000Z |
#include "unconsciousTitle.hpp"
#include "deadTitle.hpp"
#include "respawnTitle.hpp"
| 17.2 | 31 | 0.77907 | Bubbus |
2ea52adfcbea312af45334ea2f71e021d3df8fbd | 1,110 | cc | C++ | src/util/file_system.cc | FlyAlCode/PLBGHashing | 289d0a66c9091602abedf2860c2b3ae9d763fed0 | [
"MIT"
] | 1 | 2021-02-13T01:45:20.000Z | 2021-02-13T01:45:20.000Z | src/util/file_system.cc | FlyAlCode/PLBGHashing | 289d0a66c9091602abedf2860c2b3ae9d763fed0 | [
"MIT"
] | null | null | null | src/util/file_system.cc | FlyAlCode/PLBGHashing | 289d0a66c9091602abedf2860c2b3ae9d763fed0 | [
"MIT"
] | null | null | null | #include "file_system.h"
#include <iostream>
#include <fstream>
#include <string.h> //包含strcmp的头文件,也可用: #include <ctring>
#include <dirent.h>
#include <algorithm>
void getFileNames(const std::string path, std::vector<std::string>& filenames, const std::string &suffix){
DIR *pDir;
struct dirent* ptr; ... | 35.806452 | 110 | 0.438739 | FlyAlCode |
2ea71c71965f6741fb29367feec2678da8eae6ba | 16,072 | cpp | C++ | src/number.cpp | Ixhel/Algebra | a42a9a2d48237ab00febddbffc4a35b7e7e5fee8 | [
"MIT"
] | null | null | null | src/number.cpp | Ixhel/Algebra | a42a9a2d48237ab00febddbffc4a35b7e7e5fee8 | [
"MIT"
] | null | null | null | src/number.cpp | Ixhel/Algebra | a42a9a2d48237ab00febddbffc4a35b7e7e5fee8 | [
"MIT"
] | null | null | null | /*
SymbolicC++ : An object oriented computer algebra system written in C++
Copyright (C) 2008 Yorick Hardy and Willi-Hans Steeb
This library 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; ei... | 29.653137 | 75 | 0.655799 | Ixhel |
2ead27899aae79778df001bee634beaa251bb99e | 1,576 | cpp | C++ | source/V2E/C_plant.cpp | CleoBeldia/CalmWood-CPP | c8b6b15593f9ba371390e3c426310941297138cb | [
"Apache-2.0"
] | 2 | 2020-10-11T20:10:30.000Z | 2021-01-18T21:29:25.000Z | source/V2E/C_plant.cpp | CleoBeldia/CalmWood-CPP | c8b6b15593f9ba371390e3c426310941297138cb | [
"Apache-2.0"
] | null | null | null | source/V2E/C_plant.cpp | CleoBeldia/CalmWood-CPP | c8b6b15593f9ba371390e3c426310941297138cb | [
"Apache-2.0"
] | 1 | 2020-10-21T09:20:36.000Z | 2020-10-21T09:20:36.000Z | /*
* Copyright 2020 Axel Polin, univ_apolin@protonmail.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 required by... | 18.987952 | 84 | 0.641497 | CleoBeldia |
2eae9c5fffd6c6f40f4fe2413bc3cbe2b19060e1 | 5,577 | cpp | C++ | Tests/dspBufferTest.cpp | ngwese/madronalib | 4e9221532bb250f0c034cc9091b4be1fb4f5a572 | [
"MIT"
] | null | null | null | Tests/dspBufferTest.cpp | ngwese/madronalib | 4e9221532bb250f0c034cc9091b4be1fb4f5a572 | [
"MIT"
] | null | null | null | Tests/dspBufferTest.cpp | ngwese/madronalib | 4e9221532bb250f0c034cc9091b4be1fb4f5a572 | [
"MIT"
] | null | null | null | //
// dspBufferTest.cpp
// madronalib
//
#include <chrono>
using namespace std::chrono;
#include <thread>
#include "MLDSPBuffer.h"
#include "catch.hpp"
#include "mldsp.h"
using namespace ml;
namespace dspBufferTest
{
TEST_CASE("madronalib/core/dspbuffer", "[dspbuffer]")
{
std::cout << "\nDSPBUFFER\n";
// bu... | 22.950617 | 76 | 0.638874 | ngwese |
2eb7f267c876c3813c6cb42be19f3691815fe0e6 | 37,685 | cpp | C++ | mysqlparser/base/unit-tests/string_utilities_test.cpp | aasthakm/qapla | f98ca92adbca75fee28587e540b8c851809c7a62 | [
"BSD-4-Clause"
] | 4 | 2020-12-13T15:02:40.000Z | 2021-07-16T06:23:38.000Z | mysqlparser/base/unit-tests/string_utilities_test.cpp | aasthakm/qapla | f98ca92adbca75fee28587e540b8c851809c7a62 | [
"BSD-4-Clause"
] | null | null | null | mysqlparser/base/unit-tests/string_utilities_test.cpp | aasthakm/qapla | f98ca92adbca75fee28587e540b8c851809c7a62 | [
"BSD-4-Clause"
] | null | null | null | /*
* Copyright (c) 2011, 2015, Oracle and/or its affiliates. All rights reserved.
*
* 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; version 2 of the
* License.
*
* This program is dist... | 38.770576 | 379 | 0.657105 | aasthakm |
e4831c658db1347b687e50b3143b0efaba2d5b43 | 4,623 | cpp | C++ | tests/boss/test_rpc.cpp | 3nprob/clboss | 0435b6c074347ce82e490a5988534054e9d7348d | [
"MIT"
] | null | null | null | tests/boss/test_rpc.cpp | 3nprob/clboss | 0435b6c074347ce82e490a5988534054e9d7348d | [
"MIT"
] | null | null | null | tests/boss/test_rpc.cpp | 3nprob/clboss | 0435b6c074347ce82e490a5988534054e9d7348d | [
"MIT"
] | null | null | null | #undef NDEBUG
#include"Boss/Mod/Rpc.hpp"
#include"Boss/Shutdown.hpp"
#include"Ev/Io.hpp"
#include"Ev/concurrent.hpp"
#include"Ev/start.hpp"
#include"Ev/yield.hpp"
#include"Jsmn/Object.hpp"
#include"Json/Out.hpp"
#include"Net/Fd.hpp"
#include"S/Bus.hpp"
#include<assert.h>
#include<cstdint>
#include<fcntl.h>
#include<sys... | 23.707692 | 70 | 0.594636 | 3nprob |
e4839ba7ebd51b4d8bb191fa34ab317446643bea | 12,605 | cpp | C++ | minesweeper/Board.cpp | elipwns/Data-Structures | 6c9d6da1254aefd31dfed5edad5987a70c4423a9 | [
"MIT"
] | null | null | null | minesweeper/Board.cpp | elipwns/Data-Structures | 6c9d6da1254aefd31dfed5edad5987a70c4423a9 | [
"MIT"
] | null | null | null | minesweeper/Board.cpp | elipwns/Data-Structures | 6c9d6da1254aefd31dfed5edad5987a70c4423a9 | [
"MIT"
] | null | null | null | #include "board.h"
#include "Node.h"
#include "LinkedList.h"
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
#include <stdlib.h>
#include <time.h>
/**********************************************************************
* Purpose: Board no arg Ctor
*
* Entry:
*
* Exit: defaults the done flag to f... | 25.464646 | 77 | 0.485442 | elipwns |
e483fc40b0f003010d558d9b203c73e3f3e9435b | 973 | cc | C++ | src/leetcode/leetcode204_count_primes.cc | zhaozigu/algs-multi-langs | 65ef5fc6df6236064a5c81e5bb7e99c4bae044a7 | [
"CNRI-Python"
] | null | null | null | src/leetcode/leetcode204_count_primes.cc | zhaozigu/algs-multi-langs | 65ef5fc6df6236064a5c81e5bb7e99c4bae044a7 | [
"CNRI-Python"
] | null | null | null | src/leetcode/leetcode204_count_primes.cc | zhaozigu/algs-multi-langs | 65ef5fc6df6236064a5c81e5bb7e99c4bae044a7 | [
"CNRI-Python"
] | null | null | null | // https://leetcode-cn.com/problems/count-primes/
#include <vector>
using namespace std;
class Solution
{
public:
int countPrimes(int n)
{
// 0ms 秘诀
// if (n == 10000)
// return 1229;
// if (n == 499979)
// return 41537;
// if (n == 999983)
// return 78497;
// if (n == 1500000... | 17.690909 | 49 | 0.564234 | zhaozigu |
e4844cfa4f75fff58facfe7c11088de866535a88 | 3,110 | hpp | C++ | modules/scene_manager/include/map_msgs/srv/save_map__rosidl_typesupport_connext_cpp.hpp | Omnirobotic/godot | d50b5d047bbf6c68fc458c1ad097321ca627185d | [
"CC-BY-3.0",
"Apache-2.0",
"MIT"
] | null | null | null | modules/scene_manager/include/map_msgs/srv/save_map__rosidl_typesupport_connext_cpp.hpp | Omnirobotic/godot | d50b5d047bbf6c68fc458c1ad097321ca627185d | [
"CC-BY-3.0",
"Apache-2.0",
"MIT"
] | 3 | 2019-11-14T12:20:06.000Z | 2020-08-07T13:51:10.000Z | modules/scene_manager/include/map_msgs/srv/save_map__rosidl_typesupport_connext_cpp.hpp | Omnirobotic/godot | d50b5d047bbf6c68fc458c1ad097321ca627185d | [
"CC-BY-3.0",
"Apache-2.0",
"MIT"
] | null | null | null | // generated from
// rosidl_typesupport_connext_cpp/resource/srv__rosidl_typesupport_connext_cpp.hpp.em
// generated code does not contain a copyright notice
#ifndef MAP_MSGS__SRV__SAVE_MAP__ROSIDL_TYPESUPPORT_CONNEXT_CPP_HPP_
#define MAP_MSGS__SRV__SAVE_MAP__ROSIDL_TYPESUPPORT_CONNEXT_CPP_HPP_
#include <rmw/types.h>... | 25.491803 | 110 | 0.83537 | Omnirobotic |
e48749019a377c8ad9980398a2ae66700a95920a | 6,610 | cpp | C++ | source/parallel_free_suitor.cpp | alanmazankiewicz/Cpp_Suitor_and_Local_Dominant_Matching | 2fba808998cc58bd6c1a792b7c8d835e487bf3f5 | [
"MIT"
] | null | null | null | source/parallel_free_suitor.cpp | alanmazankiewicz/Cpp_Suitor_and_Local_Dominant_Matching | 2fba808998cc58bd6c1a792b7c8d835e487bf3f5 | [
"MIT"
] | null | null | null | source/parallel_free_suitor.cpp | alanmazankiewicz/Cpp_Suitor_and_Local_Dominant_Matching | 2fba808998cc58bd6c1a792b7c8d835e487bf3f5 | [
"MIT"
] | null | null | null | #include "implementation/parallel_free_suitor.hpp"
ParallelLocklessSuitor::ParallelLocklessSuitor(Input edgeLst) : G(edgeLst.second, edgeLst.first),
suitor(std::make_unique<std::atomic<EdgeIterator>[]>(G.numNodes()))
{
for (auto iter = suitor.get(); i... | 31.47619 | 176 | 0.506505 | alanmazankiewicz |
e487edc57ca47f265618b70b409b2af3da2845ea | 643 | hpp | C++ | libs/parsejson/include/sge/parse/json/get_return_type.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 2 | 2016-01-27T13:18:14.000Z | 2018-05-11T01:11:32.000Z | libs/parsejson/include/sge/parse/json/get_return_type.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | null | null | null | libs/parsejson/include/sge/parse/json/get_return_type.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 3 | 2018-05-11T01:11:34.000Z | 2021-04-24T19:47:45.000Z | // Copyright Carl Philipp Reh 2006 - 2019.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef SGE_PARSE_JSON_GET_RETURN_TYPE_HPP_INCLUDED
#define SGE_PARSE_JSON_GET_RETURN_TYPE_HPP_INCL... | 27.956522 | 95 | 0.760498 | cpreh |
e487f596b569c234a2294b45d1e9eb5b738888b4 | 1,062 | cc | C++ | algo/searching/search_matrix.cc | liuheng/recipes | 6f3759ab4e4fa64d9fd83a60ee6b6846510d910b | [
"MIT"
] | null | null | null | algo/searching/search_matrix.cc | liuheng/recipes | 6f3759ab4e4fa64d9fd83a60ee6b6846510d910b | [
"MIT"
] | null | null | null | algo/searching/search_matrix.cc | liuheng/recipes | 6f3759ab4e4fa64d9fd83a60ee6b6846510d910b | [
"MIT"
] | null | null | null | #include <cstdio>
#include <cassert>
#include <vector>
using namespace std;
bool binarySearch(vector<vector<int> > &matrix, int begin, int end, int target) {
int M = matrix.size();
int N = matrix[0].size();
if (begin == end) {
return false;
} else {
int mid = begin + (end - begin) / 2;... | 24.697674 | 81 | 0.531073 | liuheng |
e48b9cb53e6ea2dbb31824c28d09eed3dd26b213 | 3,645 | cpp | C++ | main.cpp | HadesD/GoogleSearchCPP | f065e4c25d6192e1707566b4d03da337afe1041a | [
"MIT"
] | null | null | null | main.cpp | HadesD/GoogleSearchCPP | f065e4c25d6192e1707566b4d03da337afe1041a | [
"MIT"
] | null | null | null | main.cpp | HadesD/GoogleSearchCPP | f065e4c25d6192e1707566b4d03da337afe1041a | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <iostream>
#include <string>
#include <regex>
#include <curl/curl.h>
// using namespace std;
std::string url = "http://www.google.com.vn/search?q=";
std::string query;
std::string data;
bool input();
std::string encode_query(std::string &q);
size_t writeCallback(char* buf, size_t size, si... | 21.315789 | 116 | 0.561317 | HadesD |
e491087200cacb15f13418bd088d298feac0ab03 | 2,611 | cpp | C++ | TG/bookcodes/ch3/uva11922.cpp | Anyrainel/aoapc-code | e787a01380698fb9236d933462052f97b20e6132 | [
"Apache-2.0"
] | 3 | 2017-08-15T06:00:01.000Z | 2018-12-10T09:05:53.000Z | TG/bookcodes/ch3/uva11922.cpp | Anyrainel/aoapc-related-code | e787a01380698fb9236d933462052f97b20e6132 | [
"Apache-2.0"
] | null | null | null | TG/bookcodes/ch3/uva11922.cpp | Anyrainel/aoapc-related-code | e787a01380698fb9236d933462052f97b20e6132 | [
"Apache-2.0"
] | 2 | 2017-09-16T18:46:27.000Z | 2018-05-22T05:42:03.000Z | // UVa11922 Permutation Transformer
// Rujia Liu
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
struct Node {
Node *ch[2];
int s;
int flip;
int v;
int cmp(int k) const {
int d = k - ch[0]->s;
if(d == 1) return -1;
return d <= 0 ? 0 : 1;
}
void maintain() {
s = ... | 18.784173 | 62 | 0.499809 | Anyrainel |
e491c6d21f80df9721ed2efce20317a514c9b3e2 | 6,639 | cpp | C++ | src/plugins/temperature/temperature_sensor_hal.cpp | fourkbomb/sensor-plugins | 6f86a79e4b4e35cf85dede63686401408b9b6ff7 | [
"Apache-2.0"
] | null | null | null | src/plugins/temperature/temperature_sensor_hal.cpp | fourkbomb/sensor-plugins | 6f86a79e4b4e35cf85dede63686401408b9b6ff7 | [
"Apache-2.0"
] | null | null | null | src/plugins/temperature/temperature_sensor_hal.cpp | fourkbomb/sensor-plugins | 6f86a79e4b4e35cf85dede63686401408b9b6ff7 | [
"Apache-2.0"
] | null | null | null | /*
* temperature_sensor_hal
*
* Copyright (c) 2014 Samsung Electronics Co., Ltd.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* ... | 25.933594 | 118 | 0.749812 | fourkbomb |
e4942b3a1d7612af3a500a2a2ab8bd2993208287 | 1,134 | cpp | C++ | Test1/codes/choiking10.cpp | koohanmo/JudgeForTA | a894042448c761c333af74c529d99e2e84e2922f | [
"MIT"
] | 1 | 2017-05-23T06:57:51.000Z | 2017-05-23T06:57:51.000Z | Test1/codes/choiking10.cpp | koohanmo/JudgeForTA | a894042448c761c333af74c529d99e2e84e2922f | [
"MIT"
] | null | null | null | Test1/codes/choiking10.cpp | koohanmo/JudgeForTA | a894042448c761c333af74c529d99e2e84e2922f | [
"MIT"
] | null | null | null | #include <cstdio>
#include <algorithm>
#include <vector>
#include <bitset>
#include <map>
using std::vector;
long long count_num(vector<int>& d, int depth, int idx, long long val, long long limit) {
if (idx == d.size() || val > limit) return 0;
long long ret = 0;
for (int i = idx; i < d.size(); i++) {
if... | 27.658537 | 90 | 0.502646 | koohanmo |
e49626e1247bf52cd5bbbe5ed53a3feebda2b654 | 178 | cpp | C++ | examples/valid.cpp | dtrugman/Kuvasz | 3391832f017cb4946c6d135bb9382a0d446eadc1 | [
"Apache-2.0"
] | 2 | 2017-05-20T20:59:36.000Z | 2021-01-15T11:01:53.000Z | examples/valid.cpp | dtrugman/Bulldog | 3391832f017cb4946c6d135bb9382a0d446eadc1 | [
"Apache-2.0"
] | null | null | null | examples/valid.cpp | dtrugman/Bulldog | 3391832f017cb4946c6d135bb9382a0d446eadc1 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <unistd.h>
using namespace std;
int main(int argc, char ** argv)
{
while(true)
{
cout << "HI" << endl;
sleep(1000);
}
} | 13.692308 | 32 | 0.539326 | dtrugman |
e49b967061c29c9f18ae55eccce5d82fefedbbce | 852 | cpp | C++ | stone-game/stone-game.cpp | Ananyaas/LeetCodeDaily | e134e20ac02f26dc40881c376656d3294be0df2c | [
"MIT"
] | 2 | 2022-01-02T19:15:00.000Z | 2022-01-05T21:12:24.000Z | stone-game/stone-game.cpp | Ananyaas/LeetCodeDaily | e134e20ac02f26dc40881c376656d3294be0df2c | [
"MIT"
] | null | null | null | stone-game/stone-game.cpp | Ananyaas/LeetCodeDaily | e134e20ac02f26dc40881c376656d3294be0df2c | [
"MIT"
] | 1 | 2022-03-11T17:11:07.000Z | 2022-03-11T17:11:07.000Z | class Solution {
public:
int helper(vector<int>& piles,int left,int right,vector<vector<int>>&dp){
if(left>=right)
return 0;
if(dp[left][right]!=-1)
return dp[left][right];
int choosel=piles[left]+min(helper(piles,left+2,right,dp),helper(piles,left,right-1,dp));
... | 34.08 | 98 | 0.561033 | Ananyaas |
e4a4e4efe1409bfc1aaf282a67b7a3b0b915f0cf | 2,439 | hpp | C++ | armadillo_matrix/include/armadillo_bits/op_stddev_meat.hpp | Lauradejong92/wire-grad | 0bfd3fb42df363f43eb89f35c2f0769fb805f6cd | [
"BSD-2-Clause"
] | 1 | 2022-02-02T15:47:24.000Z | 2022-02-02T15:47:24.000Z | armadillo_matrix/include/armadillo_bits/op_stddev_meat.hpp | Lauradejong92/wire-grad | 0bfd3fb42df363f43eb89f35c2f0769fb805f6cd | [
"BSD-2-Clause"
] | null | null | null | armadillo_matrix/include/armadillo_bits/op_stddev_meat.hpp | Lauradejong92/wire-grad | 0bfd3fb42df363f43eb89f35c2f0769fb805f6cd | [
"BSD-2-Clause"
] | 2 | 2019-02-28T17:36:19.000Z | 2021-01-24T14:04:18.000Z | // Copyright (C) 2009-2011 NICTA (www.nicta.com.au)
// Copyright (C) 2009-2011 Conrad Sanderson
//
// This file is part of the Armadillo C++ library.
// It is provided without any warranty of fitness
// for any purpose. You can redistribute this file
// and/or modify it under the terms of the GNU
// Lesser General Pub... | 28.360465 | 103 | 0.647396 | Lauradejong92 |
e4b6ffe887a483f59e891ac7502eba6aaa2aa732 | 293 | cpp | C++ | Source/UnitTest++/CurrentTest.cpp | rorydriscoll/RayTracer | 772b5d47c0d181c6fe49728aabc8e0a949f285e1 | [
"CC0-1.0"
] | 124 | 2018-06-28T16:09:09.000Z | 2022-02-23T16:20:26.000Z | Source/UnitTest++/CurrentTest.cpp | rorydriscoll/RayTracer | 772b5d47c0d181c6fe49728aabc8e0a949f285e1 | [
"CC0-1.0"
] | null | null | null | Source/UnitTest++/CurrentTest.cpp | rorydriscoll/RayTracer | 772b5d47c0d181c6fe49728aabc8e0a949f285e1 | [
"CC0-1.0"
] | 9 | 2018-06-28T17:10:42.000Z | 2021-08-09T08:42:41.000Z | #include "CurrentTest.h"
namespace UnitTest {
TestResults*& CurrentTest::Results()
{
static TestResults* testResults = nullptr;
return testResults;
}
const TestDetails*& CurrentTest::Details()
{
static const TestDetails* testDetails = nullptr;
return testDetails;
}
}
| 16.277778 | 50 | 0.709898 | rorydriscoll |
e4b7fd1f6fa7af8c113a3f3c7393b1746d53ae76 | 642 | cpp | C++ | IL2CPP/Il2CppOutputProject/IL2CPP/libil2cpp/os/c-api/Console.cpp | dngoins/AutographTheWorld-MR | 24e567c8030b73a6942e25b36b7370667c649b90 | [
"MIT"
] | 16 | 2018-10-13T12:29:06.000Z | 2022-02-25T14:56:47.000Z | IL2CPP/Il2CppOutputProject/IL2CPP/libil2cpp/os/c-api/Console.cpp | dngoins/AutographTheWorld-MR | 24e567c8030b73a6942e25b36b7370667c649b90 | [
"MIT"
] | 3 | 2018-12-27T22:46:43.000Z | 2019-03-19T12:28:37.000Z | IL2CPP/Il2CppOutputProject/IL2CPP/libil2cpp/os/c-api/Console.cpp | dngoins/AutographTheWorld-MR | 24e567c8030b73a6942e25b36b7370667c649b90 | [
"MIT"
] | 4 | 2019-05-02T02:13:54.000Z | 2021-12-16T16:03:26.000Z | #include "os/Console.h"
#include "os/c-api/Console-c-api.h"
extern "C"
{
int32_t UnityPalConsoleInternalKeyAvailable(int32_t ms_timeout)
{
return il2cpp::os::Console::InternalKeyAvailable(ms_timeout);
}
int32_t UnityPalConsoleSetBreak(int32_t wantBreak)
{
return il2cpp::os::Console::SetBreak(wantBreak);
}
in... | 24.692308 | 122 | 0.76947 | dngoins |
e4becb7165e263070ca7bd23c010492b2ee0ee94 | 5,454 | cpp | C++ | gui/geometries/planegeometry.cpp | goossens/ObjectTalk | ca1d4f558b5ad2459b376102744d52c6283ec108 | [
"MIT"
] | 6 | 2021-11-12T15:03:53.000Z | 2022-01-28T18:30:33.000Z | gui/geometries/planegeometry.cpp | goossens/ObjectTalk | ca1d4f558b5ad2459b376102744d52c6283ec108 | [
"MIT"
] | null | null | null | gui/geometries/planegeometry.cpp | goossens/ObjectTalk | ca1d4f558b5ad2459b376102744d52c6283ec108 | [
"MIT"
] | null | null | null | // ObjectTalk Scripting Language
// Copyright (c) 1993-2022 Johan A. Goossens. All rights reserved.
//
// This work is licensed under the terms of the MIT license.
// For a copy, see <https://opensource.org/licenses/MIT>.
//
// Include files
//
#include "ot/function.h"
#include "planegeometry.h"
//
// OtPlaneGeom... | 20.125461 | 100 | 0.676568 | goossens |
e4bfd44b8e0a2313318512d4fe9f02c69cf9f115 | 5,831 | cc | C++ | test/object_characterization/characterization_test.cc | ilMartoo/LiDAR-based_anomaly_detector | a5364992f906fe1eec8106bebdfa1fa99932e89e | [
"MIT"
] | null | null | null | test/object_characterization/characterization_test.cc | ilMartoo/LiDAR-based_anomaly_detector | a5364992f906fe1eec8106bebdfa1fa99932e89e | [
"MIT"
] | null | null | null | test/object_characterization/characterization_test.cc | ilMartoo/LiDAR-based_anomaly_detector | a5364992f906fe1eec8106bebdfa1fa99932e89e | [
"MIT"
] | null | null | null | /**
* @file anomaly_test.cc
* @author Martín Suárez (martin.suarez.garcia@rai.usc.es)
* @date 10/05/2022
*
* Test para el módulo de la CLI
*
*/
#include "catch.hpp"
#include "catch_utils.hh"
#include <vector>
#include "object_characterization/ObjectCharacterizer.hh"
#include "object_characterization/Character... | 29.00995 | 105 | 0.483965 | ilMartoo |
e4c48c9b8b689587fddff718e33b4f96d1e854f9 | 1,059 | cpp | C++ | examples/chapter.13.16.cpp | Chen-Carl/GUI | 13aa8337f2afe3b6d0d4d18b5c8eb1cf3a47cdd7 | [
"BSL-1.0"
] | 1 | 2021-04-23T13:19:28.000Z | 2021-04-23T13:19:28.000Z | examples/chapter.13.16.cpp | Chen-Carl/GUI | 13aa8337f2afe3b6d0d4d18b5c8eb1cf3a47cdd7 | [
"BSL-1.0"
] | null | null | null | examples/chapter.13.16.cpp | Chen-Carl/GUI | 13aa8337f2afe3b6d0d4d18b5c8eb1cf3a47cdd7 | [
"BSL-1.0"
] | 2 | 2021-05-08T15:09:18.000Z | 2021-06-03T09:49:24.000Z |
//
// This is example code from Chapter 13.16 "Mark" of
// "Programming -- Principles and Practice Using C++" by Bjarne Stroustrup
//
#include "Simple_window.h" // get access to our window library
#include "Graph.h" // get access to our graphics library facilities
//----------------------------------------... | 26.475 | 80 | 0.517469 | Chen-Carl |
e4c6b4f752dca4e75b366776c7f135c6faeac5dc | 1,806 | hh | C++ | aku/SpeakerConfig.hh | phsmit/AaltoASR | 33cb58b288cc01bcdff0d6709a296d0dfcc7f74a | [
"BSD-3-Clause"
] | 78 | 2015-01-07T14:33:47.000Z | 2022-03-15T09:01:30.000Z | aku/SpeakerConfig.hh | phsmit/AaltoASR | 33cb58b288cc01bcdff0d6709a296d0dfcc7f74a | [
"BSD-3-Clause"
] | 4 | 2015-05-19T13:00:34.000Z | 2016-07-26T12:29:32.000Z | aku/SpeakerConfig.hh | phsmit/AaltoASR | 33cb58b288cc01bcdff0d6709a296d0dfcc7f74a | [
"BSD-3-Clause"
] | 32 | 2015-01-16T08:16:24.000Z | 2021-04-02T21:26:22.000Z | #ifndef SPEAKERCONFIG_HH
#define SPEAKERCONFIG_HH
#include <vector>
#include <set>
#include <map>
#include <string>
#include "FeatureGenerator.hh"
#include "ModelModules.hh"
namespace aku {
/** A class for handling speaker and utterance adaptations.
* Speaker ID is the primary method for changing feature configur... | 28.666667 | 80 | 0.75969 | phsmit |
e4c6e8053bfc3e536a01e404ce2240b5e48e5224 | 1,504 | cpp | C++ | leetcode-problems/medium-33-search-in-rotated-array.cpp | formatkaka/dsalgo | a7c7386c5c161e23bc94456f93cadd0f91f102fa | [
"Unlicense"
] | null | null | null | leetcode-problems/medium-33-search-in-rotated-array.cpp | formatkaka/dsalgo | a7c7386c5c161e23bc94456f93cadd0f91f102fa | [
"Unlicense"
] | null | null | null | leetcode-problems/medium-33-search-in-rotated-array.cpp | formatkaka/dsalgo | a7c7386c5c161e23bc94456f93cadd0f91f102fa | [
"Unlicense"
] | null | null | null | //
// Created by Siddhant on 2019-11-07.
//
#include "iostream"
#include "vector"
#include "string"
#include "algorithm"
using namespace std;
int findCenter(vector<int> &nums) {
if (nums[0] < nums[nums.size() - 1]) {
return 0;
}
if (nums.size() == 1) {
return 0;
}
int start = 0... | 16.898876 | 76 | 0.489362 | formatkaka |
e4c7746f4bf9e345624c3ea94d88532d7d0a1efb | 6,339 | cpp | C++ | HelperFunctions/getVkPipelineRasterizationConservativeStateCreateInfoEXT.cpp | dkaip/jvulkan-natives-Linux-x86_64 | ea7932f74e828953c712feea11e0b01751f9dc9b | [
"Apache-2.0"
] | null | null | null | HelperFunctions/getVkPipelineRasterizationConservativeStateCreateInfoEXT.cpp | dkaip/jvulkan-natives-Linux-x86_64 | ea7932f74e828953c712feea11e0b01751f9dc9b | [
"Apache-2.0"
] | null | null | null | HelperFunctions/getVkPipelineRasterizationConservativeStateCreateInfoEXT.cpp | dkaip/jvulkan-natives-Linux-x86_64 | ea7932f74e828953c712feea11e0b01751f9dc9b | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2019-2020 Douglas Kaip
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed t... | 40.634615 | 204 | 0.630541 | dkaip |
e4c7d64f2fd3906b184ad77fe2cc07f3ea1ddb24 | 12,101 | cpp | C++ | file-commander-core/src/cfilesystemobject.cpp | JnMartens/file-commander | ee3418225dc26e411d21c4eb88a40a3859971e18 | [
"Apache-2.0"
] | null | null | null | file-commander-core/src/cfilesystemobject.cpp | JnMartens/file-commander | ee3418225dc26e411d21c4eb88a40a3859971e18 | [
"Apache-2.0"
] | null | null | null | file-commander-core/src/cfilesystemobject.cpp | JnMartens/file-commander | ee3418225dc26e411d21c4eb88a40a3859971e18 | [
"Apache-2.0"
] | null | null | null | #include "cfilesystemobject.h"
#include "filesystemhelperfunctions.h"
#include "windows/windowsutils.h"
#include "assert/advanced_assert.h"
#include "lang/type_traits_fast.hpp"
#include "hash/fasthash.h"
#ifdef CFILESYSTEMOBJECT_TEST
#define QFileInfo QFileInfo_Test
#define QDir QDir_Test
#endif
DISABLE... | 26.479212 | 169 | 0.705975 | JnMartens |
e4c973a4f2ac749c66a5292198a2b7ee3e1a9a20 | 1,082 | cpp | C++ | source/UnitTest1/StubDataManager.cpp | Tronso/test_recording | 3b581f557830526e3f0e51f40df04a5be24b7e62 | [
"Apache-2.0"
] | null | null | null | source/UnitTest1/StubDataManager.cpp | Tronso/test_recording | 3b581f557830526e3f0e51f40df04a5be24b7e62 | [
"Apache-2.0"
] | null | null | null | source/UnitTest1/StubDataManager.cpp | Tronso/test_recording | 3b581f557830526e3f0e51f40df04a5be24b7e62 | [
"Apache-2.0"
] | null | null | null | #include "stdafx.h"
#include "StubDataManager.h"
#include "Situation.h"
#include "Transition.h"
#include <memory>
#include "CppUnitTest.h"
#include "SituationGraph.h"
using std::make_shared;
using namespace Microsoft::VisualStudio::CppUnitTestFramework;
StubDataManager::StubDataManager() : inputs() {
}
StubDataMan... | 22.081633 | 107 | 0.774492 | Tronso |
e4ccd51eeff9fd39234011dfc6533d0c35cb3f3c | 948 | cpp | C++ | Introductions/Quadratic/quadratic.cpp | csulb-cecs282-2015sp/lectures | f7a88c52b85472f4e871ed439bfe65ee784f4aa9 | [
"MIT"
] | 11 | 2015-01-20T05:57:50.000Z | 2021-05-03T10:47:36.000Z | Introductions/Quadratic/quadratic.cpp | csulb-cecs282-2015sp/lectures | f7a88c52b85472f4e871ed439bfe65ee784f4aa9 | [
"MIT"
] | null | null | null | Introductions/Quadratic/quadratic.cpp | csulb-cecs282-2015sp/lectures | f7a88c52b85472f4e871ed439bfe65ee784f4aa9 | [
"MIT"
] | 26 | 2015-01-20T04:38:39.000Z | 2017-01-11T00:49:57.000Z | #include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
cout << "This program will find the real solutions to a general quadratic "
"equation of the form ax^2 + bx + c = 0" << endl;
cout << "\nEnter a, b, and c:" << endl;
double a, b, c;
cin >> a >> b >> c;
double discriminan... | 29.625 | 78 | 0.548523 | csulb-cecs282-2015sp |
e4d19a84d9d54af5d4c746d15fbbee51a953ac5b | 9,854 | cpp | C++ | tests/demo/src/cpu_conv_bias_relu_pattern.cpp | wuxun-zhang/mkl-dnn | 00a239ad2c932b967234ffb528069800ffcc0334 | [
"Apache-2.0"
] | null | null | null | tests/demo/src/cpu_conv_bias_relu_pattern.cpp | wuxun-zhang/mkl-dnn | 00a239ad2c932b967234ffb528069800ffcc0334 | [
"Apache-2.0"
] | null | null | null | tests/demo/src/cpu_conv_bias_relu_pattern.cpp | wuxun-zhang/mkl-dnn | 00a239ad2c932b967234ffb528069800ffcc0334 | [
"Apache-2.0"
] | null | null | null | /*******************************************************************************
* Copyright 2020-2022 Intel Corporation
*
* 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.apa... | 44.995434 | 125 | 0.64177 | wuxun-zhang |
e4d68f2a64ee23cc1e0872e66256c4296e3763b9 | 4,825 | cpp | C++ | source/FAST/Algorithms/CoherentPointDrift/Affine.cpp | andreped/FAST | 361819190ea0ae5a2f068e7bd808a1c70af5a171 | [
"BSD-2-Clause"
] | null | null | null | source/FAST/Algorithms/CoherentPointDrift/Affine.cpp | andreped/FAST | 361819190ea0ae5a2f068e7bd808a1c70af5a171 | [
"BSD-2-Clause"
] | null | null | null | source/FAST/Algorithms/CoherentPointDrift/Affine.cpp | andreped/FAST | 361819190ea0ae5a2f068e7bd808a1c70af5a171 | [
"BSD-2-Clause"
] | null | null | null | #include "CoherentPointDrift.hpp"
#include "Affine.hpp"
#include <limits>
#include <iostream>
namespace fast {
CoherentPointDriftAffine::CoherentPointDriftAffine() {
mScale = 1.0;
mTransformationType = TransformationType::AFFINE;
}
void CoherentPointDriftAffine::initializeVarianceAndMore... | 45.093458 | 115 | 0.606218 | andreped |
e4d8a4b4ae522fb1e9d698f91e4c41dc01fcbb26 | 2,137 | cpp | C++ | tc 160+/TheEquation.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 3 | 2015-05-25T06:24:37.000Z | 2016-09-10T07:58:00.000Z | tc 160+/TheEquation.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | null | null | null | tc 160+/TheEquation.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 TheEquation {
public:
int leastSum(int X, int Y, int P) {
for (int sum=2; sum<=2*P; ++sum) {
for (int a=1; a<sum; ++a... | 37.491228 | 309 | 0.568086 | ibudiselic |
e4d95ee0ae960e5ddb81f748cace7a7a48447a93 | 4,147 | cpp | C++ | note_to_midi.cpp | jkhollandjr/music_generation | 6338b2b05d2e739caa55eead041e6eef328a52ca | [
"MIT"
] | null | null | null | note_to_midi.cpp | jkhollandjr/music_generation | 6338b2b05d2e739caa55eead041e6eef328a52ca | [
"MIT"
] | null | null | null | note_to_midi.cpp | jkhollandjr/music_generation | 6338b2b05d2e739caa55eead041e6eef328a52ca | [
"MIT"
] | null | null | null | // note_to_midi.cpp
//
// Writes a midifile using the notes.txt file and the functions from the Midifile library.
//
// NOTE: This code has been adapted from an example provided by the Midifile library
//The original code described how to create a track from arrays of integers corresponding to
//the rythm and midi not... | 36.377193 | 103 | 0.645768 | jkhollandjr |
e4db07f6f4cbb77264713f5e3e7f28ea0f20aefd | 9,326 | hpp | C++ | include/ghex/transport_layer/ucx/context.hpp | tehrengruber/GHEX | f164bb625aaa106f77d31d45fce05c4711b066f0 | [
"BSD-3-Clause"
] | null | null | null | include/ghex/transport_layer/ucx/context.hpp | tehrengruber/GHEX | f164bb625aaa106f77d31d45fce05c4711b066f0 | [
"BSD-3-Clause"
] | null | null | null | include/ghex/transport_layer/ucx/context.hpp | tehrengruber/GHEX | f164bb625aaa106f77d31d45fce05c4711b066f0 | [
"BSD-3-Clause"
] | null | null | null | /*
* GridTools
*
* Copyright (c) 2014-2020, ETH Zurich
* All rights reserved.
*
* Please, refer to the LICENSE file in the root directory.
* SPDX-License-Identifier: BSD-3-Clause
*
*/
#ifndef INCLUDED_GHEX_TL_UCX_CONTEXT_HPP
#define INCLUDED_GHEX_TL_UCX_CONTEXT_HPP
#include "../context.hpp"
#include "./commun... | 45.715686 | 142 | 0.493245 | tehrengruber |
e4dfcdb408a6511563513d8d2fc5c5bd91d7594a | 153 | cpp | C++ | VC2010Samples/MFC/Visual C++ 2008 Feature Pack/DrawClient/DrawClientHandlers/DrawCliSearchHandler.cpp | alonmm/VCSamples | 6aff0b4902f5027164d593540fcaa6601a0407c3 | [
"MIT"
] | 300 | 2019-05-09T05:32:33.000Z | 2022-03-31T20:23:24.000Z | VC2010Samples/MFC/Visual C++ 2008 Feature Pack/DrawClient/DrawClientHandlers/DrawCliSearchHandler.cpp | JaydenChou/VCSamples | 9e1d4475555b76a17a3568369867f1d7b6cc6126 | [
"MIT"
] | 9 | 2016-09-19T18:44:26.000Z | 2018-10-26T10:20:05.000Z | VC2010Samples/MFC/Visual C++ 2008 Feature Pack/DrawClient/DrawClientHandlers/DrawCliSearchHandler.cpp | JaydenChou/VCSamples | 9e1d4475555b76a17a3568369867f1d7b6cc6126 | [
"MIT"
] | 633 | 2019-05-08T07:34:12.000Z | 2022-03-30T04:38:28.000Z | // DrawCliSearchHandler.cpp : Implementation of CDrawCliSearchHandler
#include "stdafx.h"
#include "DrawCliSearchHandler.h"
// CDrawCliSearchHandler
| 17 | 69 | 0.803922 | alonmm |
e4eaf8b336af747dc1cce9408bb55237f8768dc3 | 2,322 | cpp | C++ | code-cpp/nloop-math-inc.cpp | att-circ-contrl/NeuroLoop | 7847fcaa6237c406fbad879b10352618504613c9 | [
"CC-BY-4.0"
] | 1 | 2021-01-22T05:40:23.000Z | 2021-01-22T05:40:23.000Z | code-cpp/nloop-math-inc.cpp | att-circ-contrl/NeuroLoop | 7847fcaa6237c406fbad879b10352618504613c9 | [
"CC-BY-4.0"
] | null | null | null | code-cpp/nloop-math-inc.cpp | att-circ-contrl/NeuroLoop | 7847fcaa6237c406fbad879b10352618504613c9 | [
"CC-BY-4.0"
] | null | null | null | // Attention Circuits Control Laboratory - NeuroLoop project
// Miscellaneous math routines.
// Written by Christopher Thomas.
// Copyright (c) 2020 by Vanderbilt University. This work is licensed under
// the Creative Commons Attribution 4.0 International License.
// NOTE - Because this implements template code, it ... | 32.704225 | 78 | 0.736003 | att-circ-contrl |
e4eb1e58974ce0866109916f3ef05b2547491e0b | 3,631 | cpp | C++ | src/saiga/vision/ceres/CeresBASmooth.cpp | muetimueti/saiga | 32b54a8fc7b1251368e07e7d31c15ac90cee3b32 | [
"MIT"
] | null | null | null | src/saiga/vision/ceres/CeresBASmooth.cpp | muetimueti/saiga | 32b54a8fc7b1251368e07e7d31c15ac90cee3b32 | [
"MIT"
] | null | null | null | src/saiga/vision/ceres/CeresBASmooth.cpp | muetimueti/saiga | 32b54a8fc7b1251368e07e7d31c15ac90cee3b32 | [
"MIT"
] | null | null | null | /**
* Copyright (c) 2017 Darius Rückert
* Licensed under the MIT License.
* See LICENSE file for more information.
*/
#include "CeresBASmooth.h"
#include "saiga/core/time/timer.h"
#include "saiga/vision/ceres/CeresHelper.h"
#include "saiga/vision/ceres/CeresKernel_BARS_Intr4.h"
#include "saiga/vision/ceres/Ceres... | 28.590551 | 108 | 0.658772 | muetimueti |
e4f04f56cb5c8bb13e36f54701754da0ad28a75d | 614 | tpp | C++ | src/memory/alloc_sthread_next_fit_part_none.tpp | clearlycloudy/concurrent | 243246f3244cfaf7ffcbfc042c69980d96f988e4 | [
"MIT"
] | 9 | 2019-05-14T01:07:08.000Z | 2020-11-12T01:46:11.000Z | src/memory/alloc_sthread_next_fit_part_none.tpp | clearlycloudy/concurrent | 243246f3244cfaf7ffcbfc042c69980d96f988e4 | [
"MIT"
] | null | null | null | src/memory/alloc_sthread_next_fit_part_none.tpp | clearlycloudy/concurrent | 243246f3244cfaf7ffcbfc042c69980d96f988e4 | [
"MIT"
] | null | null | null | #include <new>
template< class T, class... Args >
T * alloc_sthread_next_fit_part_none_impl::newing( void * p, Args&&... args ){
if( nullptr == p ){
if( !allocating( &p, sizeof(T) ) ){
//allocation failed
std::bad_alloc bad_alloc;
throw bad_alloc;
return nullptr;
}
}
return static_cas... | 26.695652 | 100 | 0.620521 | clearlycloudy |
e4f5510e0668e5d718938faad6dbba6e00a2a493 | 65 | cpp | C++ | msbuild-maven-plugin/src/test/resources/unit/source-listing/project2/project2.cpp | sunnymoon/msbuild-maven-plugin | 86fa207675d5d51f864c3e636c2a10b1d6c2afd5 | [
"Apache-2.0"
] | 3 | 2015-03-26T16:06:32.000Z | 2017-12-08T19:31:38.000Z | msbuild-maven-plugin/src/test/resources/unit/source-listing/project2/project2.cpp | sunnymoon/msbuild-maven-plugin | 86fa207675d5d51f864c3e636c2a10b1d6c2afd5 | [
"Apache-2.0"
] | 6 | 2015-09-07T06:45:15.000Z | 2021-06-30T08:16:13.000Z | msbuild-maven-plugin/src/test/resources/unit/source-listing/project2/project2.cpp | sunnymoon/msbuild-maven-plugin | 86fa207675d5d51f864c3e636c2a10b1d6c2afd5 | [
"Apache-2.0"
] | 2 | 2015-09-07T07:02:38.000Z | 2019-09-25T21:20:26.000Z | #include "project2.h"
int project2_method1()
{
return 0;
}
| 8.125 | 22 | 0.646154 | sunnymoon |
e4f70561dfe99acf0c70d16cd3cd2c00c24c6d94 | 15,703 | cpp | C++ | src/fdm/auto/fdm_Autopilot.cpp | marek-cel/mscsim-cc0 | 348f659eae61fd998df8bf2fa81090596548d06d | [
"CC0-1.0"
] | 4 | 2020-03-03T08:10:59.000Z | 2021-09-04T08:02:17.000Z | src/fdm/auto/fdm_Autopilot.cpp | marek-cel/mscsim-cc0 | 348f659eae61fd998df8bf2fa81090596548d06d | [
"CC0-1.0"
] | null | null | null | src/fdm/auto/fdm_Autopilot.cpp | marek-cel/mscsim-cc0 | 348f659eae61fd998df8bf2fa81090596548d06d | [
"CC0-1.0"
] | null | null | null | /****************************************************************************//*
* Copyright (C) 2021 Marek M. Cel
*
* Creative Commons Legal Code
*
* CC0 1.0 Universal
*
* CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
* LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE... | 42.099196 | 107 | 0.6202 | marek-cel |
e4f86b1723ea317e9b76ca740687d0924cd369ff | 1,435 | hpp | C++ | include/ash/fsm/DynamicComponentProvider.hpp | CorundumGames/AshPlusPlus | d346cf9029798e710fee4d8e3d5f305c90d04caa | [
"MIT"
] | 2 | 2016-12-17T23:19:06.000Z | 2017-07-19T14:44:57.000Z | include/ash/fsm/DynamicComponentProvider.hpp | CorundumGames/AshPlusPlus | d346cf9029798e710fee4d8e3d5f305c90d04caa | [
"MIT"
] | null | null | null | include/ash/fsm/DynamicComponentProvider.hpp | CorundumGames/AshPlusPlus | d346cf9029798e710fee4d8e3d5f305c90d04caa | [
"MIT"
] | null | null | null | #ifndef DYNAMICCOMPONENTPROVIDER_HPP
#define DYNAMICCOMPONENTPROVIDER_HPP
#include <functional>
#include "ash/fsm/IComponentProvider.hpp"
using std::function;
namespace ash {
namespace fsm {
/**
* This component provider calls a function to get the component instance. The function must return a single component
... | 26.090909 | 118 | 0.632056 | CorundumGames |
e4fe87fe85ad1b1ee8f39ef4649ce09822f437fd | 2,508 | cpp | C++ | trikScriptRunner/src/trikVariablesServer.cpp | thetoropov/trikRuntime | f236e441875ff4ab999803252f26075e089ae04c | [
"Apache-2.0"
] | null | null | null | trikScriptRunner/src/trikVariablesServer.cpp | thetoropov/trikRuntime | f236e441875ff4ab999803252f26075e089ae04c | [
"Apache-2.0"
] | null | null | null | trikScriptRunner/src/trikVariablesServer.cpp | thetoropov/trikRuntime | f236e441875ff4ab999803252f26075e089ae04c | [
"Apache-2.0"
] | null | null | null | /* Copyright 2018 Anastasiia Kornilova, CyberTech Labs Ltd.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by a... | 33.44 | 97 | 0.743222 | thetoropov |
90004e8a92fba5a459375e80590161f80ef06eb2 | 6,481 | hpp | C++ | include/tile_grid.hpp | zerebubuth/osmium-history-splitter | 9e2445440fc26a29d9ceeb1833937d910b28ff9c | [
"BSL-1.0"
] | null | null | null | include/tile_grid.hpp | zerebubuth/osmium-history-splitter | 9e2445440fc26a29d9ceeb1833937d910b28ff9c | [
"BSL-1.0"
] | null | null | null | include/tile_grid.hpp | zerebubuth/osmium-history-splitter | 9e2445440fc26a29d9ceeb1833937d910b28ff9c | [
"BSL-1.0"
] | null | null | null | #ifndef OSMIUM_HISTORY_SPLITTER_TILE_GRID_HPP
#define OSMIUM_HISTORY_SPLITTER_TILE_GRID_HPP
/*
This file is part of the Osmium History Splitter
Copyright 2015 Matt Amos <zerebubuth@gmail.com>.
Boost Software License - Version 1.0 - August 17th, 2003
Permission is hereby granted, free of charge, to any person or or... | 29.459091 | 116 | 0.69156 | zerebubuth |
07e57da13a7e38a2d6726256469f26f9da43e480 | 6,484 | hpp | C++ | include/VROSC/UserProfileDataModel.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/VROSC/UserProfileDataModel.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/VROSC/UserProfileDataModel.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | 1 | 2022-03-30T21:07:35.000Z | 2022-03-30T21:07:35.000Z | // 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: VROSC.BaseDataModel
#include "VROSC... | 42.940397 | 157 | 0.704812 | v0idp |
07e60c98d31fb4840a4cd99c762a74178cab115d | 715 | cpp | C++ | 0000/10/11a.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | 1 | 2020-07-03T15:55:52.000Z | 2020-07-03T15:55:52.000Z | 0000/10/11a.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | null | null | null | 0000/10/11a.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | 3 | 2020-10-01T14:55:28.000Z | 2021-07-11T11:33:58.000Z | #include <iostream>
#include <vector>
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& v)
{
for (T& a : v)
input >> a;
return input;
}
void answer(unsigned v)
{
std::cout << v << '\n';
}
void solve(std::vector<unsigned>& b, unsigned d)
{
const size_t n = b... | 14.3 | 65 | 0.47972 | actium |
07f052996f4c016b69bd7c19e72bd286f6c73143 | 945 | cpp | C++ | .LHP/He10/T.Hung/1160/1160/1160.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | .LHP/He10/T.Hung/1160/1160/1160.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | .LHP/He10/T.Hung/1160/1160/1160.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | // AC UVa
#include "pch.h"
#include <iostream>
#include <algorithm>
#define maxN 100002
#define maxM 10000000001
#define root first
#define rank second
#define fin -1
typedef int maxn;
typedef long long maxm;
typedef std::pair <maxn, maxn> info_t;
info_t info[maxN];
maxm res;
void Init() {
res = 0;
for (maxn i =... | 13.695652 | 51 | 0.554497 | sxweetlollipop2912 |
07f05685c2e0b0de37a0a77ffddfc75c3aaeb12d | 2,877 | hpp | C++ | modules/core/adjacent/include/nt2/core/functions/expr/adjfun.hpp | psiha/nt2 | 5e829807f6b57b339ca1be918a6b60a2507c54d0 | [
"BSL-1.0"
] | 34 | 2017-05-19T18:10:17.000Z | 2022-01-04T02:18:13.000Z | modules/core/adjacent/include/nt2/core/functions/expr/adjfun.hpp | psiha/nt2 | 5e829807f6b57b339ca1be918a6b60a2507c54d0 | [
"BSL-1.0"
] | null | null | null | modules/core/adjacent/include/nt2/core/functions/expr/adjfun.hpp | psiha/nt2 | 5e829807f6b57b339ca1be918a6b60a2507c54d0 | [
"BSL-1.0"
] | 7 | 2017-12-02T12:59:17.000Z | 2021-07-31T12:46:14.000Z | //==============================================================================
// Copyright 2003 - 2012 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2012 LRI UMR 8623 CNRS/Univ Paris Sud XI
// Copyright 2011 - 2012 MetaScale SAS
//
// Distributed under the Boost... | 40.521127 | 80 | 0.423705 | psiha |
07f2bf2d0d9337d16ebe4be5060ea980ee525b14 | 5,616 | cpp | C++ | tests/src/map/map_tests_observers.cpp | matboivin/ft_containers | 9653552ba3b8eaf215ea37315942c00aeafbf352 | [
"WTFPL"
] | null | null | null | tests/src/map/map_tests_observers.cpp | matboivin/ft_containers | 9653552ba3b8eaf215ea37315942c00aeafbf352 | [
"WTFPL"
] | null | null | null | tests/src/map/map_tests_observers.cpp | matboivin/ft_containers | 9653552ba3b8eaf215ea37315942c00aeafbf352 | [
"WTFPL"
] | null | null | null | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* map_tests_observers.cpp :+: :+: :+: ... | 29.714286 | 80 | 0.552172 | matboivin |
07f455643b86280405bd8ad44d5413901f820d16 | 690 | cpp | C++ | Source/Contrib/Libctiny/printf.cpp | Skight/wndspy | b89cc2df88ca3e58b26be491814008aaf6f11122 | [
"Apache-2.0"
] | 24 | 2017-03-16T05:32:44.000Z | 2021-12-11T13:49:07.000Z | Source/Contrib/Libctiny/printf.cpp | zhen-e-liu/wndspy | b89cc2df88ca3e58b26be491814008aaf6f11122 | [
"Apache-2.0"
] | null | null | null | Source/Contrib/Libctiny/printf.cpp | zhen-e-liu/wndspy | b89cc2df88ca3e58b26be491814008aaf6f11122 | [
"Apache-2.0"
] | 13 | 2017-03-16T05:26:12.000Z | 2021-07-04T16:24:42.000Z | //==========================================
// LIBCTINY - Matt Pietrek 2001
// MSDN Magazine, January 2001
//==========================================
#include <windows.h>
#include <stdio.h>
#include <stdarg.h>
// Force the linker to include USER32.LIB
#pragma comment(linker, "/defaultlib:user32.lib")
extern "C" in... | 23.793103 | 66 | 0.566667 | Skight |
07f506ae8a9eb021c51c373cda86f5a3eba4fde8 | 4,569 | hpp | C++ | SamSrc/sam/VertexConstraintChecker.hpp | dirkcgrunwald/SAM | 0478925c506ad38fd405954cc4415a3e96e77d90 | [
"MIT"
] | 6 | 2019-08-16T07:13:17.000Z | 2021-06-08T21:15:52.000Z | SamSrc/sam/VertexConstraintChecker.hpp | dirkcgrunwald/SAM | 0478925c506ad38fd405954cc4415a3e96e77d90 | [
"MIT"
] | 1 | 2020-05-30T20:35:18.000Z | 2020-05-30T20:35:18.000Z | SamSrc/sam/VertexConstraintChecker.hpp | dirkcgrunwald/SAM | 0478925c506ad38fd405954cc4415a3e96e77d90 | [
"MIT"
] | 3 | 2020-02-17T18:38:14.000Z | 2021-03-28T02:47:57.000Z | #ifndef SAM_VERTEX_CONSTRAINT_CHECKER_HPP
#define SAM_VERTEX_CONSTRAINT_CHECKER_HPP
#include <sam/FeatureMap.hpp>
#include <sam/Util.hpp>
#include <sam/EdgeDescription.hpp>
namespace sam {
class VertexConstraintCheckerException : public std::runtime_error {
public:
VertexConstraintCheckerException(char const * mes... | 33.844444 | 80 | 0.664697 | dirkcgrunwald |
07f5430a6b96954a950a8e9861a1f1ed527049e4 | 2,532 | hpp | C++ | src/spinlock_put.hpp | degarashi/revenant | 9e671320a5c8790f6bdd1b14934f81c37819f7b3 | [
"MIT"
] | null | null | null | src/spinlock_put.hpp | degarashi/revenant | 9e671320a5c8790f6bdd1b14934f81c37819f7b3 | [
"MIT"
] | null | null | null | src/spinlock_put.hpp | degarashi/revenant | 9e671320a5c8790f6bdd1b14934f81c37819f7b3 | [
"MIT"
] | null | null | null | #pragma once
#include "spinlock_detail.hpp"
namespace rev {
//! 一時的なロック解除機能を備えたSpinLock
/*! あるスレッドがロック中でも一旦アンロックし、別のスレッドがロックできるようにする */
template <class T>
class SpinLockPut {
private:
struct InnerP {
SpinLockPut& _s;
bool _bLocked;
InnerP(InnerP&& p) noexcept:
_s(p._s),
_bLocked(p._bLoc... | 21.827586 | 81 | 0.592022 | degarashi |
07f6de5e46ad8c3c22e62e40f55d61ff9f523441 | 5,589 | cpp | C++ | UE4Cleaner/UE4Cleaner.cpp | Vaei/ue4cleaner | ee49f2f6e71f19f2449963c60ecc750b44df70b6 | [
"MIT"
] | 6 | 2019-03-01T20:47:13.000Z | 2021-05-28T12:37:10.000Z | UE4Cleaner/UE4Cleaner.cpp | Vaei/ue4cleaner | ee49f2f6e71f19f2449963c60ecc750b44df70b6 | [
"MIT"
] | null | null | null | UE4Cleaner/UE4Cleaner.cpp | Vaei/ue4cleaner | ee49f2f6e71f19f2449963c60ecc750b44df70b6 | [
"MIT"
] | 1 | 2021-02-18T08:32:55.000Z | 2021-02-18T08:32:55.000Z | // Copyright (c) 2019 Jared Taylor / Vaei. All Rights Reserved.
// UE4Cleaner.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include "pch.h"
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <windows.h>
#include <filesystem>
using namespac... | 25.289593 | 153 | 0.658078 | Vaei |
07fa8bf96c8e7a17d0afc8adf538f6421f13d545 | 1,933 | cpp | C++ | AdenitaCoreSE/source/ADNMixins.cpp | edellano/Adenita-SAMSON-Edition-Win- | 6df8d21572ef40fe3fc49165dfaa1d4318352a69 | [
"BSD-3-Clause"
] | 2 | 2020-09-07T20:48:43.000Z | 2021-09-03T05:49:59.000Z | AdenitaCoreSE/source/ADNMixins.cpp | edellano/Adenita-SAMSON-Edition-Linux | a7e267e5dd37e0073f4d1e3e603c5fb1c69a350a | [
"BSD-3-Clause"
] | 6 | 2020-04-05T18:39:28.000Z | 2022-01-11T14:28:55.000Z | AdenitaCoreSE/source/ADNMixins.cpp | edellano/Adenita-SAMSON-Edition-Linux | a7e267e5dd37e0073f4d1e3e603c5fb1c69a350a | [
"BSD-3-Clause"
] | 2 | 2021-07-13T12:58:13.000Z | 2022-01-11T13:52:00.000Z | #include "ADNMixins.hpp"
Nameable::Nameable(const Nameable & other)
{
*this = other;
}
Nameable & Nameable::operator=(const Nameable & other)
{
if (&other == this) {
return *this;
}
SetName(other.GetName());
return *this;
}
void Nameable::SetName(std::string name)
{
name_ = name;
}
std::string Nam... | 14.318519 | 66 | 0.65701 | edellano |
5804ce8b05c4fe8086a3c4f7d09e5810ef183624 | 2,271 | cpp | C++ | 201512/3.cpp | qzylalala/CSP | 8bd474b0cb70b90c41e3fb87452724c5a2bc14fa | [
"Apache-2.0"
] | 23 | 2021-03-01T07:07:48.000Z | 2022-03-19T12:49:14.000Z | 201512/3.cpp | qzylalala/CSP | 8bd474b0cb70b90c41e3fb87452724c5a2bc14fa | [
"Apache-2.0"
] | null | null | null | 201512/3.cpp | qzylalala/CSP | 8bd474b0cb70b90c41e3fb87452724c5a2bc14fa | [
"Apache-2.0"
] | 2 | 2021-08-30T09:35:17.000Z | 2021-09-10T12:26:13.000Z | #include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#define x first
#define y second
using namespace std;
typedef pair<int, int> pii;
const int N = 110;
bool visited[N][N];
char g[N][N];
int st[N][N];
int m, n, q;
// st 0 : '.' 1 : '-' 2 : '|' 3 : '+'
void op0(int x1, int y1, int ... | 22.048544 | 78 | 0.359313 | qzylalala |
5805aa0d94e61eb592d413180b2403d51b90a449 | 3,085 | hpp | C++ | external/boost_1_60_0/qsboost/preprocessor/repetition/enum_shifted_binary_params.hpp | wouterboomsma/quickstep | a33447562eca1350c626883f21c68125bd9f776c | [
"MIT"
] | 1 | 2019-06-27T17:54:13.000Z | 2019-06-27T17:54:13.000Z | external/boost_1_60_0/qsboost/preprocessor/repetition/enum_shifted_binary_params.hpp | wouterboomsma/quickstep | a33447562eca1350c626883f21c68125bd9f776c | [
"MIT"
] | null | null | null | external/boost_1_60_0/qsboost/preprocessor/repetition/enum_shifted_binary_params.hpp | wouterboomsma/quickstep | a33447562eca1350c626883f21c68125bd9f776c | [
"MIT"
] | null | null | null | # /* **************************************************************************
# * *
# * (C) Copyright Paul Mensonides 2005. *
# * Distributed under the Boost Software License, Version 1.0. (See *
... | 59.326923 | 175 | 0.688817 | wouterboomsma |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.