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 108 | 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 67k ⌀ | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2acc8f0b59ee05dd822e63465b79e6daa6a48a67 | 6,856 | cpp | C++ | main.cpp | deepomicslab/SpecHap | 194ded31c6b3fdfada593bd248082bf1945530b9 | [
"MIT"
] | 7 | 2021-02-17T09:24:39.000Z | 2021-12-23T07:47:38.000Z | main.cpp | deepomicslab/SpecHap | 194ded31c6b3fdfada593bd248082bf1945530b9 | [
"MIT"
] | 3 | 2021-04-30T19:36:57.000Z | 2022-03-24T02:32:17.000Z | main.cpp | deepomicslab/SpecHap | 194ded31c6b3fdfada593bd248082bf1945530b9 | [
"MIT"
] | 3 | 2021-09-06T07:20:06.000Z | 2021-11-24T05:21:19.000Z | #include <iostream>
#include "phaser.h"
#include "results.h"
#include "type.h"
bool HYBRID = false;
bool NEW_FORMAT = false;
bool KEEP_PS = false;
int WINDOW_SIZE = 200;
int WINDOW_OVERLAP = 60;
int BASE_OFFSET = 33;
int MAX_BARCODE_SPANNING = 60000;
int MAX_HIC_INSERTION= 40000000;
int RECURSIVE_LIMIT = 15;
int OPE... | 40.809524 | 192 | 0.553384 | deepomicslab |
2acdb257016405c6b7cea49c82cc62ea4fa18a86 | 6,326 | cpp | C++ | Lab02_03c.cpp | xinyizou/school-projects | 10adc544faf45446ef99d8e1a74acbe16c88c7b5 | [
"MIT"
] | 1 | 2020-01-21T00:46:48.000Z | 2020-01-21T00:46:48.000Z | Lab02_03c.cpp | xinyizou/school-projects | 10adc544faf45446ef99d8e1a74acbe16c88c7b5 | [
"MIT"
] | null | null | null | Lab02_03c.cpp | xinyizou/school-projects | 10adc544faf45446ef99d8e1a74acbe16c88c7b5 | [
"MIT"
] | null | null | null | //
// Student name: Xinyi Zou
// Student number: 20765197
//
// SYDE 121 Lab: Lab Assignment #1 Exercise #3
// Filename: lab02_03c
//
// I hereby declare that this code, submitted for credit for the course
// SYDE121, is a product of my own efforts. This coded solution has
// not been plagiarized from other so... | 37.654762 | 188 | 0.659026 | xinyizou |
2ad5e71ed708caeab1e5aa79f61f9bf9fd376894 | 1,802 | hpp | C++ | misc/bit_operation.hpp | hly1204/library | b62c47a8f20623c1f1edd892b980714e8587f40e | [
"Unlicense"
] | 7 | 2021-07-20T15:25:00.000Z | 2022-03-13T11:58:25.000Z | misc/bit_operation.hpp | hly1204/library | b62c47a8f20623c1f1edd892b980714e8587f40e | [
"Unlicense"
] | 10 | 2021-03-11T16:08:22.000Z | 2022-03-13T08:40:36.000Z | misc/bit_operation.hpp | hly1204/library | b62c47a8f20623c1f1edd892b980714e8587f40e | [
"Unlicense"
] | null | null | null | #ifndef BIT_OPERATION_HEADER_HPP
#define BIT_OPERATION_HEADER_HPP
/**
* @brief bit operations
*
*/
#include <cassert>
#include <cstdint>
#include "deBruijn_sequence.hpp"
namespace lib {
/**
* @brief 在二进制最高的 1 后面填充满 1
* @param x
* @return std::uint32_t
*/
std::uint32_t fill_one_after_msb(... | 18.57732 | 82 | 0.546615 | hly1204 |
2ad5fbbb2684206d87b47e0f76ddc9b0da67b001 | 2,845 | cpp | C++ | godgame2/Sphere.cpp | magnificus/godgame | cafb36830263d95516eb014f432319cabf50bda7 | [
"Unlicense"
] | 5 | 2017-10-31T17:36:13.000Z | 2021-11-05T21:01:04.000Z | godgame2/Sphere.cpp | magnificus/godgame | cafb36830263d95516eb014f432319cabf50bda7 | [
"Unlicense"
] | null | null | null | godgame2/Sphere.cpp | magnificus/godgame | cafb36830263d95516eb014f432319cabf50bda7 | [
"Unlicense"
] | null | null | null | #include "Sphere.h"
#include "math.h"
#include <map>
#include <array>
struct Triangle
{
unsigned int vertex[3];
};
using TriangleList = std::vector<Triangle>;
using VertexList = std::vector<glm::vec3>;
using NormalList = std::vector<glm::vec3>;
#define Index unsigned int
namespace icosahedron
{
co... | 23.708333 | 59 | 0.599297 | magnificus |
2adb800c632a7ae555e16819d86333554fafdb11 | 5,691 | cpp | C++ | PostLib/GMeshImport.cpp | chunkeey/FEBioStudio | f342d4ac2bc3581db792373c4265454109af92b3 | [
"MIT"
] | 27 | 2020-06-25T06:34:52.000Z | 2022-03-11T08:58:57.000Z | PostLib/GMeshImport.cpp | chunkeey/FEBioStudio | f342d4ac2bc3581db792373c4265454109af92b3 | [
"MIT"
] | 42 | 2020-06-15T18:40:57.000Z | 2022-03-24T05:38:54.000Z | PostLib/GMeshImport.cpp | chunkeey/FEBioStudio | f342d4ac2bc3581db792373c4265454109af92b3 | [
"MIT"
] | 12 | 2020-06-27T13:58:57.000Z | 2022-03-24T05:39:10.000Z | /*This file is part of the FEBio Studio source code and is licensed under the MIT license
listed below.
See Copyright-FEBio-Studio.txt for details.
Copyright (c) 2020 University of Utah, The Trustees of Columbia University in
the City of New York, and others.
Permission is hereby granted, free of charge, to any per... | 25.070485 | 99 | 0.628712 | chunkeey |
2adca25a6559cdf343d960f039d6d2b4feb0ddfa | 4,219 | cpp | C++ | SDK/PUBG_SoundOptionWidget_functions.cpp | realrespecter/PUBG-FULL-SDK | 5e2b0f103c74c95d2329c4c9dfbfab48aa0da737 | [
"MIT"
] | 7 | 2019-03-06T11:04:52.000Z | 2019-07-10T20:00:51.000Z | SDK/PUBG_SoundOptionWidget_functions.cpp | realrespecter/PUBG-FULL-SDK | 5e2b0f103c74c95d2329c4c9dfbfab48aa0da737 | [
"MIT"
] | null | null | null | SDK/PUBG_SoundOptionWidget_functions.cpp | realrespecter/PUBG-FULL-SDK | 5e2b0f103c74c95d2329c4c9dfbfab48aa0da737 | [
"MIT"
] | 10 | 2019-03-06T11:53:46.000Z | 2021-02-18T14:01:11.000Z | // PUBG FULL SDK - Generated By Respecter (5.3.4.11 [06/03/2019]) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "PUBG_SoundOptionWidget_parameters.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Functions
//------------------------------------------... | 24.672515 | 134 | 0.726475 | realrespecter |
2ae8821c883a13bc5a2b3fae0f8a9d88ca472eea | 808 | hh | C++ | include/muensterTPCRunAction.hh | l-althueser/MuensterTPC-Simulation | 7a086ab330cd5905f3c78c324936cdc36951e9bd | [
"BSD-2-Clause"
] | null | null | null | include/muensterTPCRunAction.hh | l-althueser/MuensterTPC-Simulation | 7a086ab330cd5905f3c78c324936cdc36951e9bd | [
"BSD-2-Clause"
] | 2 | 2017-01-24T21:18:46.000Z | 2017-01-27T13:24:48.000Z | include/muensterTPCRunAction.hh | l-althueser/MuensterTPC-Simulation | 7a086ab330cd5905f3c78c324936cdc36951e9bd | [
"BSD-2-Clause"
] | 4 | 2017-04-28T12:18:58.000Z | 2019-04-10T21:15:00.000Z | /******************************************************************
* muensterTPCsim
*
* Simulations of the Muenster TPC
*
* @author Lutz Althüser
* @date 2015-04-14
*
* @update 2015-11-02 - added comments
*
* @comment
******************************************************************/
#ifndef __muenster... | 21.837838 | 70 | 0.65099 | l-althueser |
2aeaf60025deb5b258232b5f76df3ed43b233b3d | 5,403 | cpp | C++ | 2_Package/imu/dev_bmp085.cpp | HANDS-FREE/OpenRE | fbd4cfa7a12bb43679db23422e79da69aaef1fce | [
"BSD-2-Clause"
] | 56 | 2016-08-13T11:26:51.000Z | 2022-02-17T08:45:40.000Z | 2_Package/imu/dev_bmp085.cpp | HANDS-FREE/OpenRE | fbd4cfa7a12bb43679db23422e79da69aaef1fce | [
"BSD-2-Clause"
] | 3 | 2017-03-04T11:55:26.000Z | 2018-05-03T08:34:52.000Z | 2_Package/imu/dev_bmp085.cpp | HANDS-FREE/OpenRE | fbd4cfa7a12bb43679db23422e79da69aaef1fce | [
"BSD-2-Clause"
] | 51 | 2016-08-15T14:00:44.000Z | 2022-02-17T08:45:41.000Z | /***********************************************************************************************************************
* Copyright (c) Hands Free Team. All rights reserved.
* Contact: QQ Exchange Group -- 521037187
*
* LICENSING TERMS:
* The Hands Free is licensed generally under a permissive 3-clause BSD licen... | 29.850829 | 121 | 0.446604 | HANDS-FREE |
2af1887a721bdeb858258afbb3e4d04e60fb56d6 | 2,977 | cpp | C++ | TDEngine2/source/core/CConfigFileEngineCoreBuilder.cpp | bnoazx005/TDEngine2 | 93ebfecf8af791ff5ecd4f57525a6935e34cd05c | [
"Apache-2.0"
] | 1 | 2019-07-15T01:14:15.000Z | 2019-07-15T01:14:15.000Z | TDEngine2/source/core/CConfigFileEngineCoreBuilder.cpp | bnoazx005/TDEngine2 | 93ebfecf8af791ff5ecd4f57525a6935e34cd05c | [
"Apache-2.0"
] | 76 | 2018-10-27T16:59:36.000Z | 2022-03-30T17:40:39.000Z | TDEngine2/source/core/CConfigFileEngineCoreBuilder.cpp | bnoazx005/TDEngine2 | 93ebfecf8af791ff5ecd4f57525a6935e34cd05c | [
"Apache-2.0"
] | 1 | 2019-07-29T02:02:08.000Z | 2019-07-29T02:02:08.000Z | #include "../../include/core/CConfigFileEngineCoreBuilder.h"
#include "../../include/core/IFileSystem.h"
#include "../../include/platform/CConfigFileReader.h"
#include <memory>
#include <thread>
#include <functional>
namespace TDEngine2
{
CConfigFileEngineCoreBuilder::CConfigFileEngineCoreBuilder() :
CBaseEngineCo... | 32.358696 | 175 | 0.762177 | bnoazx005 |
2af323f0acf239b7f37307f9ff8a65783bd92f7a | 710 | cpp | C++ | Codechef/VisitTheCities.cpp | MartinAparicioPons/Competitive-Programming | 58151df0ed08a5e4e605abefdd69fef1ecc10fa0 | [
"Apache-2.0"
] | 1 | 2019-09-29T03:58:35.000Z | 2019-09-29T03:58:35.000Z | Codechef/VisitTheCities.cpp | MartinAparicioPons/Competitive-Programming | 58151df0ed08a5e4e605abefdd69fef1ecc10fa0 | [
"Apache-2.0"
] | null | null | null | Codechef/VisitTheCities.cpp | MartinAparicioPons/Competitive-Programming | 58151df0ed08a5e4e605abefdd69fef1ecc10fa0 | [
"Apache-2.0"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 10010;
int n, P, Pi;
vector<int> E[MAXN];
bool vis[MAXN];
void dfs(int u, int p){
if(vis[u]) return;
vis[u] = true;
if(p > P){
P = p;
Pi = u;
}
for(int i = 0; i < E[u].size(); i++){
dfs(E[u][i], p + 1);
}
}
int main(){
ios_base::sync_with_... | 14.2 | 38 | 0.476056 | MartinAparicioPons |
2af50f0fe6ae885ca83997d8da58c9840370afa1 | 3,521 | hpp | C++ | src/simple_graph/algorithm/bellman_ford.hpp | sfod/simple-graph | b07ac266296f44238ee02f7cc1042f079f4eac9d | [
"MIT"
] | 1 | 2016-01-25T09:54:38.000Z | 2016-01-25T09:54:38.000Z | src/simple_graph/algorithm/bellman_ford.hpp | sfod/simple-graph | b07ac266296f44238ee02f7cc1042f079f4eac9d | [
"MIT"
] | 1 | 2019-04-08T10:40:00.000Z | 2019-04-08T10:40:00.000Z | src/simple_graph/algorithm/bellman_ford.hpp | sfod/simple-graph | b07ac266296f44238ee02f7cc1042f079f4eac9d | [
"MIT"
] | null | null | null | #pragma once
#include <algorithm>
#include <cassert>
#include <set>
#include <vector>
#include "simple_graph/graph.hpp"
namespace simple_graph {
template<typename W>
bool check_distance(const W &d, const W &w)
{
return !((d > 0) && (w > 0) && (std::numeric_limits<W>::max() - d < w));
}
template<bool Dir, typena... | 32.302752 | 98 | 0.545016 | sfod |
2af686437eda8ab8178fd1a9174f42768e3f51d5 | 4,200 | cc | C++ | testing/gsgts_test.cc | shgalus/shg | 0318d0126cf12c3236183447d130969c468a02fa | [
"MIT"
] | 9 | 2015-05-21T04:14:50.000Z | 2021-05-31T17:15:15.000Z | testing/gsgts_test.cc | shgalus/shg | 0318d0126cf12c3236183447d130969c468a02fa | [
"MIT"
] | 1 | 2015-05-21T05:31:04.000Z | 2015-05-21T05:31:04.000Z | testing/gsgts_test.cc | shgalus/shg | 0318d0126cf12c3236183447d130969c468a02fa | [
"MIT"
] | 2 | 2015-05-21T04:14:44.000Z | 2020-08-18T12:35:22.000Z | #include <shg/gsgts.h>
#include <shg/mzt.h>
#include <shg/utils.h>
#include "testing.h"
namespace SHG::Testing {
BOOST_AUTO_TEST_SUITE(gsgts_test)
BOOST_AUTO_TEST_CASE(basic_test) {
const std::vector<double> result1{
-0.1853455, -0.1532896, -0.1108232, -0.2036469, -0.1754326,
-0.1098344, -0.... | 48.275862 | 70 | 0.584524 | shgalus |
2af7a6ae39d191373e3196cf3e77ea0da3ed2cd8 | 3,925 | cpp | C++ | kernels/gact-raw/gact.cpp | YC-Vertex/GeneSAK | 10fcd2fc3d9c3df1f391dc277b8d5840abf3034c | [
"MIT"
] | 4 | 2021-09-13T14:41:06.000Z | 2021-12-25T03:31:56.000Z | kernels/gact-raw/gact.cpp | YC-Vertex/GeneSAK | 10fcd2fc3d9c3df1f391dc277b8d5840abf3034c | [
"MIT"
] | null | null | null | kernels/gact-raw/gact.cpp | YC-Vertex/GeneSAK | 10fcd2fc3d9c3df1f391dc277b8d5840abf3034c | [
"MIT"
] | 1 | 2021-09-16T06:56:41.000Z | 2021-09-16T06:56:41.000Z | #include <string>
#include "gact.h"
inline int64_t max(int64_t a, int64_t b) {
return a > b ? a : b;
}
inline void setDefaultParams(AlignTask *task) {
task->params["TILE_SIZE"] = 128;
task->params["OVERLAP_SIZE"] = 32;
}
AlignTileRet alignTile(std::string ref, std::string qry, bool first, int maxTBLen) ... | 26.52027 | 84 | 0.421656 | YC-Vertex |
2afdf7b06a66366ec7c1cbf55fb56779ea03d8f0 | 9,465 | cpp | C++ | pure_pursuit_core/test/GeometryTest.cpp | Idate96/se2_navigation | 0fabe002742add5e4d716776b13704aa9c1aa339 | [
"BSD-3-Clause"
] | 216 | 2020-04-14T22:32:45.000Z | 2022-03-30T17:56:12.000Z | pure_pursuit_core/test/GeometryTest.cpp | Idate96/se2_navigation | 0fabe002742add5e4d716776b13704aa9c1aa339 | [
"BSD-3-Clause"
] | 5 | 2020-09-23T08:41:38.000Z | 2021-11-11T09:58:00.000Z | pure_pursuit_core/test/GeometryTest.cpp | Idate96/se2_navigation | 0fabe002742add5e4d716776b13704aa9c1aa339 | [
"BSD-3-Clause"
] | 56 | 2020-04-29T00:26:20.000Z | 2022-03-30T17:27:55.000Z | /*
* GeometryTest.cpp
*
* Created on: Mar 19, 2020
* Author: jelavice
*/
#include <gtest/gtest.h>
// Math
#include <cmath>
#include "test_helpers.hpp"
#include "pure_pursuit_core/math.hpp"
namespace ppt = pure_pursuit_test;
namespace pp = pure_pursuit;
using SolutionCase = pp::Intersection::SolutionCase;
... | 36.686047 | 127 | 0.709773 | Idate96 |
63021073c1c0f32186c24ec364ce2c943ccf648c | 1,712 | cpp | C++ | src/web/tests/test_libaeon_web/test_url_encoding.cpp | aeon-engine/libaeon | e42b39e621dcd0a0fba05e1c166fc688288fb69b | [
"BSD-2-Clause"
] | 7 | 2017-02-19T16:22:16.000Z | 2021-03-02T05:47:39.000Z | src/web/tests/test_libaeon_web/test_url_encoding.cpp | aeon-engine/libaeon | e42b39e621dcd0a0fba05e1c166fc688288fb69b | [
"BSD-2-Clause"
] | 61 | 2017-05-29T06:11:17.000Z | 2021-03-28T21:51:44.000Z | src/web/tests/test_libaeon_web/test_url_encoding.cpp | aeon-engine/libaeon | e42b39e621dcd0a0fba05e1c166fc688288fb69b | [
"BSD-2-Clause"
] | 2 | 2017-05-28T17:17:40.000Z | 2017-07-14T21:45:16.000Z | // Distributed under the BSD 2-Clause License - Copyright 2012-2021 Robin Degen
#include <aeon/web/http/url_encoding.h>
#include <aeon/web/http/validators.h>
#include <gtest/gtest.h>
#include <random>
using namespace aeon;
TEST(test_url_encoding, encode_regular_string)
{
const std::u8string test_str = u8"ThisIsA... | 25.939394 | 79 | 0.638435 | aeon-engine |
6304a393a27ce668de2d43bd5d1b5530919ee665 | 326 | hpp | C++ | DoremiEngine/AI/Include/Interface/SubModule/AStarSubModule.hpp | meraz/doremi | 452d08ebd10db50d9563c1cf97699571889ab18f | [
"MIT"
] | 1 | 2020-03-23T15:42:05.000Z | 2020-03-23T15:42:05.000Z | DoremiEngine/AI/Include/Interface/SubModule/AStarSubModule.hpp | Meraz/ssp15 | 452d08ebd10db50d9563c1cf97699571889ab18f | [
"MIT"
] | null | null | null | DoremiEngine/AI/Include/Interface/SubModule/AStarSubModule.hpp | Meraz/ssp15 | 452d08ebd10db50d9563c1cf97699571889ab18f | [
"MIT"
] | 1 | 2020-03-23T15:42:06.000Z | 2020-03-23T15:42:06.000Z | #pragma once
namespace DoremiEngine
{
namespace AI
{
/**
TODOKO docs
*/
class MapGrid;
class AStarSubModule
{
public:
virtual void GetPath(int p_startPos, const MapGrid& p_map) = 0;
virtual MapGrid* BuildMapGrid() = 0;
};
... | 18.111111 | 75 | 0.506135 | meraz |
630642a798f5254c0a521c6019c0031bcdbc86d9 | 5,515 | cpp | C++ | src/ui/Style.cpp | CedricGuillemet/gemoni | 76ca371d509791dd9d560d3f9f701f96e209ca5e | [
"MIT"
] | null | null | null | src/ui/Style.cpp | CedricGuillemet/gemoni | 76ca371d509791dd9d560d3f9f701f96e209ca5e | [
"MIT"
] | null | null | null | src/ui/Style.cpp | CedricGuillemet/gemoni | 76ca371d509791dd9d560d3f9f701f96e209ca5e | [
"MIT"
] | null | null | null | #include "imgui.h"
#include "IconsFontAwesome5.h"
void SetStyle()
{
ImGuiStyle& st = ImGui::GetStyle();
st.FrameBorderSize = 1.0f;
st.FramePadding = ImVec2(4.0f, 2.0f);
st.ItemSpacing = ImVec2(8.0f, 2.0f);
st.WindowBorderSize = 1.0f;
st.TabBorderSize = 1.0f;
st.WindowRounding = 1.0f;
st... | 51.542056 | 117 | 0.688123 | CedricGuillemet |
deb89d9db31f248c546602d7996ccbd4f783a53d | 269 | cpp | C++ | examples/algos/subset-xor-maximization/example-1.cpp | parth-07/dragon | 2e771d698398303c8ae6d603d28bc3acfa116181 | [
"MIT"
] | 1 | 2021-02-24T17:51:32.000Z | 2021-02-24T17:51:32.000Z | examples/algos/subset-xor-maximization/example-1.cpp | parth-07/dragon | 2e771d698398303c8ae6d603d28bc3acfa116181 | [
"MIT"
] | 1 | 2021-02-24T17:57:04.000Z | 2021-05-17T11:09:40.000Z | examples/algos/subset-xor-maximization/example-1.cpp | parth-07/ds-and-algos | 2e771d698398303c8ae6d603d28bc3acfa116181 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include "dragon/algos/subset-xor-maximization.hpp"
int main() {
std::vector<int> v{48, 32, 31};
std::cout<<dragon::maximum_subset_xor_value(v)<<"\n";
std::cout<<dragon::maximum_subset_xor_value(v.begin(), v.end())<<"\n";
}
| 26.9 | 72 | 0.680297 | parth-07 |
dec07522838bb529579d678c2d24200377ab029c | 604 | cpp | C++ | example/asyncdeamon.cpp | apppur/canna | bdcce4f16be56da40445fec79959b6bc90003573 | [
"MIT"
] | null | null | null | example/asyncdeamon.cpp | apppur/canna | bdcce4f16be56da40445fec79959b6bc90003573 | [
"MIT"
] | null | null | null | example/asyncdeamon.cpp | apppur/canna | bdcce4f16be56da40445fec79959b6bc90003573 | [
"MIT"
] | null | null | null | #include <thread>
#include <functional>
#include <stdio.h>
#include <memory>
#include "asyncclient.h"
#include "asyncserver.h"
int main(int argc, char** argv)
{
asyncclient async1;
asyncclient async2;
asyncclient async3;
asyncserver server;
std::thread t1(std::bind(&asyncclient::start, &async1));... | 20.133333 | 60 | 0.642384 | apppur |
dec2f325f34c51e9af008d0a401b695be3e82249 | 442 | cpp | C++ | algorithms/cpp/deleteNodeInALinkedList/test.cpp | mzlogin/LeetCode | b0ccb0f84eafe60ff355e4ab81bde2f39c043035 | [
"MIT"
] | 2 | 2017-03-27T17:20:28.000Z | 2018-06-07T15:15:54.000Z | algorithms/cpp/deleteNodeInALinkedList/test.cpp | mzlogin/LeetCode | b0ccb0f84eafe60ff355e4ab81bde2f39c043035 | [
"MIT"
] | 2 | 2015-12-13T02:58:29.000Z | 2016-09-15T00:00:22.000Z | algorithms/cpp/deleteNodeInALinkedList/test.cpp | mzlogin/LeetCode | b0ccb0f84eafe60ff355e4ab81bde2f39c043035 | [
"MIT"
] | null | null | null | #include "../catch.h"
#include "../mylist.h"
#include "solution.h"
TEST_CASE("Delete Node In a Linked List", "deleteNodeInALinkedList") {
Solution sln;
const int len = 4;
int nums[len] = {1,2,3,4};
ListNode* root = createList(nums, len);
ListNode* p = root->next->next;
sln.deleteNode(p);
C... | 24.555556 | 70 | 0.615385 | mzlogin |
dec60f7023fc0c5f3a3f7e986d258647535c871b | 499 | cc | C++ | leetcode/src/balaced_binary_tree.cc | plusplus7/solutions | 31233c13ee2bd0da6a907a24adbaf5b49ebf843c | [
"CC0-1.0"
] | 5 | 2016-04-29T07:14:23.000Z | 2020-01-07T04:56:11.000Z | leetcode/src/balaced_binary_tree.cc | plusplus7/solutions | 31233c13ee2bd0da6a907a24adbaf5b49ebf843c | [
"CC0-1.0"
] | null | null | null | leetcode/src/balaced_binary_tree.cc | plusplus7/solutions | 31233c13ee2bd0da6a907a24adbaf5b49ebf843c | [
"CC0-1.0"
] | 1 | 2016-04-29T07:14:32.000Z | 2016-04-29T07:14:32.000Z | #include <iostream>
using namespace std;
class Solution {
public:
int dfs(TreeNode *node) {
if (node == NULL)
return 0;
return max(dfs(node->left, dep+1), dfs(node->right, dep+1))+1;
}
bool isBalanced(TreeNode *root) {
if (root == NULL)
return true;
if... | 26.263158 | 85 | 0.537074 | plusplus7 |
decdd07a00f33af05ff4c749316d9b1956486241 | 2,237 | cpp | C++ | tests/common_test/tests/mask_tests/circle_mask_tests.cpp | JulianBiancardi/Wolfenstein-Taller1 | 28e72ce8438264919586785aa09ce9b0a5de222b | [
"MIT"
] | 1 | 2021-04-23T19:57:40.000Z | 2021-04-23T19:57:40.000Z | tests/common_test/tests/mask_tests/circle_mask_tests.cpp | JulianBiancardi/Wolfenstein-Taller1 | 28e72ce8438264919586785aa09ce9b0a5de222b | [
"MIT"
] | null | null | null | tests/common_test/tests/mask_tests/circle_mask_tests.cpp | JulianBiancardi/Wolfenstein-Taller1 | 28e72ce8438264919586785aa09ce9b0a5de222b | [
"MIT"
] | null | null | null | #include "circle_mask_tests.h"
#include "../../main/collisions/circle_mask.h"
#include "../../main/utils/point.h"
#include "../tests_setup.h"
int static creation_test();
int static center_test();
int static interior_test();
int static border_test();
int static exterior_test();
void circle_mask_tests() {
begin_test... | 21.103774 | 78 | 0.640143 | JulianBiancardi |
dece96829fe573ed8b4ad39e4772d59a7b19567a | 1,179 | hpp | C++ | FFmpegServer/FFmpegYAGuiDroidCapture_PacketQueue/include/Buffer/BufferData.hpp | aalekhm/OpenFF | 9df23a21727f29a871f7239ccf15e3100ae9780e | [
"MIT"
] | null | null | null | FFmpegServer/FFmpegYAGuiDroidCapture_PacketQueue/include/Buffer/BufferData.hpp | aalekhm/OpenFF | 9df23a21727f29a871f7239ccf15e3100ae9780e | [
"MIT"
] | null | null | null | FFmpegServer/FFmpegYAGuiDroidCapture_PacketQueue/include/Buffer/BufferData.hpp | aalekhm/OpenFF | 9df23a21727f29a871f7239ccf15e3100ae9780e | [
"MIT"
] | null | null | null | #pragma once
#include "Common/Defines.h"
#include "Common/RandomAccessFile.h"
class BufferData
{
public:
BufferData()
: m_iBufferSize(-1)
, m_pBuffer(nullptr)
{ }
BufferData(size_t iBufferSize)
{
setSize(iBufferSize);
}
void operator=(BufferData& pBufferData)
{
cleanup();
setSize(pBuffer... | 17.338235 | 88 | 0.65564 | aalekhm |
ded00ab6f7ed575fdcb08faaef40996cf6db9fbf | 7,069 | cpp | C++ | libs/dev/Math/MathEngineTest/Matrix_Constructor.cpp | Norseman055/immaterial-engine | 6aca0fad64f5b2b9fe6eb351528a79a39dc94625 | [
"MIT"
] | null | null | null | libs/dev/Math/MathEngineTest/Matrix_Constructor.cpp | Norseman055/immaterial-engine | 6aca0fad64f5b2b9fe6eb351528a79a39dc94625 | [
"MIT"
] | null | null | null | libs/dev/Math/MathEngineTest/Matrix_Constructor.cpp | Norseman055/immaterial-engine | 6aca0fad64f5b2b9fe6eb351528a79a39dc94625 | [
"MIT"
] | null | null | null | //---------------------------------------------------------------------------
// HEADER FILES:
//---------------------------------------------------------------------------
#include "UnitTest.h"
#include "MathEngine.h"
#define eq Util::isEqual
#define MATH_TOLERANCE 0.0001f
//----------------------------------------... | 26.776515 | 77 | 0.530485 | Norseman055 |
ded12ff193fedcafbc3acfc7a1a1a355ddaec06d | 1,170 | cpp | C++ | nodes/DataLoggerNode/DataLoggerProcess.cpp | dgitz/eROS | 0ff4b5dda5f3d445784d43745597bb5c31d1997c | [
"MIT"
] | 2 | 2016-11-28T13:01:12.000Z | 2021-03-26T22:02:02.000Z | nodes/DataLoggerNode/DataLoggerProcess.cpp | dgitz/eROS | 0ff4b5dda5f3d445784d43745597bb5c31d1997c | [
"MIT"
] | 46 | 2016-10-24T13:34:48.000Z | 2019-11-14T23:47:22.000Z | nodes/DataLoggerNode/DataLoggerProcess.cpp | dgitz/eros | 0ff4b5dda5f3d445784d43745597bb5c31d1997c | [
"MIT"
] | 2 | 2021-07-20T10:11:45.000Z | 2021-08-10T11:31:41.000Z | #include <eros/DataLogger/DataLoggerProcess.h>
using namespace eros;
using namespace eros_nodes;
DataLoggerProcess::DataLoggerProcess()
: log_directory(""),
log_directory_available(false),
logfile_duration(-1.0),
logging_enabled(false),
snapshot_mode(true) {
}
DataLoggerProcess::~DataLogger... | 33.428571 | 100 | 0.761538 | dgitz |
ded73d86410b8acca4b20373f5b8e439c0127133 | 841 | cc | C++ | libconfluo/src/compression/confluo_encoder.cc | Mu-L/confluo | e9b8621e99f56b1adf5675c4296c006d89e6e582 | [
"Apache-2.0"
] | 1,398 | 2018-12-05T19:13:15.000Z | 2022-03-29T08:26:03.000Z | libconfluo/src/compression/confluo_encoder.cc | Mu-L/confluo | e9b8621e99f56b1adf5675c4296c006d89e6e582 | [
"Apache-2.0"
] | 53 | 2018-10-21T03:28:25.000Z | 2021-03-16T03:50:54.000Z | libconfluo/src/compression/confluo_encoder.cc | Mu-L/confluo | e9b8621e99f56b1adf5675c4296c006d89e6e582 | [
"Apache-2.0"
] | 208 | 2018-10-28T03:05:46.000Z | 2022-02-06T06:16:37.000Z | #include "compression/confluo_encoder.h"
namespace confluo {
namespace compression {
unique_byte_array confluo_encoder::encode(void *ptr, size_t size, uint8_t encoding) {
switch (encoding) {
case encoding_type::D_UNENCODED: {
return unique_byte_array(reinterpret_cast<uint8_t *>(ptr), size, no_op_delete);
... | 29 | 85 | 0.6956 | Mu-L |
ded97349fac892fd74f4c924f410dd860981d4da | 19,721 | inl | C++ | ivp/havana/havok/hk_math/vector_fpu/vector_fpu.inl | DannyParker0001/Kisak-Strike | 99ed85927336fe3aff2efd9b9382b2b32eb1d05d | [
"Unlicense"
] | 252 | 2020-12-16T15:34:43.000Z | 2022-03-31T23:21:37.000Z | ivp/havana/havok/hk_math/vector_fpu/vector_fpu.inl | DannyParker0001/Kisak-Strike | 99ed85927336fe3aff2efd9b9382b2b32eb1d05d | [
"Unlicense"
] | 23 | 2020-12-20T18:02:54.000Z | 2022-03-28T16:58:32.000Z | ivp/havana/havok/hk_math/vector_fpu/vector_fpu.inl | DannyParker0001/Kisak-Strike | 99ed85927336fe3aff2efd9b9382b2b32eb1d05d | [
"Unlicense"
] | 42 | 2020-12-19T04:32:33.000Z | 2022-03-30T06:00:28.000Z |
inline void hk_VecFPU::fpu_add_multiple_row(hk_real *target_adress,hk_real *source_adress,hk_real factor,int size,hk_bool adress_aligned) {
if(adress_aligned==HK_FALSE) {
//we have to calculate the block size and shift adresses to lower aligned adresses
long result_adress = long(source_adress) & hk_VecFPU_ME... | 32.923205 | 146 | 0.66092 | DannyParker0001 |
dedc9bea22e4d12bc1c587ec698d2444e590a3be | 4,793 | cpp | C++ | SimSpark/rcssserver3d/plugin/soccer/gamestateperceptor/gamestateperceptor.cpp | IllyasvielEin/Robocup3dInstaller | 12e91d9372dd08a92feebf98e916c98bc2242ff4 | [
"MIT"
] | null | null | null | SimSpark/rcssserver3d/plugin/soccer/gamestateperceptor/gamestateperceptor.cpp | IllyasvielEin/Robocup3dInstaller | 12e91d9372dd08a92feebf98e916c98bc2242ff4 | [
"MIT"
] | null | null | null | SimSpark/rcssserver3d/plugin/soccer/gamestateperceptor/gamestateperceptor.cpp | IllyasvielEin/Robocup3dInstaller | 12e91d9372dd08a92feebf98e916c98bc2242ff4 | [
"MIT"
] | null | null | null | /* -*- mode: c++; c-basic-offset: 4; indent-tabs-mode: nil -*-
this file is part of rcssserver3D
Fri May 9 2003
Copyright (C) 2002,2003 Koblenz University
Copyright (C) 2003 RoboCup Soccer Server 3D Maintenance Group
$Id$
This program is free software; you can redistribute it and/or modify
it und... | 28.194118 | 84 | 0.685583 | IllyasvielEin |
dedd51ee810c8f039746f6cede22295f7057ad54 | 2,838 | cc | C++ | content/browser/renderer_host/pepper/browser_ppapi_host_impl.cc | junmin-zhu/chromium-rivertrail | eb1a57aca71fe68d96e48af8998dcfbe45171ee1 | [
"BSD-3-Clause"
] | 5 | 2018-03-10T13:08:42.000Z | 2021-07-26T15:02:11.000Z | content/browser/renderer_host/pepper/browser_ppapi_host_impl.cc | quisquous/chromium | b25660e05cddc9d0c3053b3514f07037acc69a10 | [
"BSD-3-Clause"
] | 1 | 2015-07-21T08:02:01.000Z | 2015-07-21T08:02:01.000Z | content/browser/renderer_host/pepper/browser_ppapi_host_impl.cc | jianglong0156/chromium.src | d496dfeebb0f282468827654c2b3769b3378c087 | [
"BSD-3-Clause"
] | 6 | 2016-11-14T10:13:35.000Z | 2021-01-23T15:29:53.000Z | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/browser/renderer_host/pepper/browser_ppapi_host_impl.h"
#include "content/public/browser/browser_thread.h"
#include "content/public... | 32.25 | 77 | 0.744891 | junmin-zhu |
dee02e61c6026421062ff37899f6387291f3d3c8 | 325 | cpp | C++ | mutations_aliens/main.cpp | aymeebonvarlet/projet_mutation_aliens | a1885d77d9ef197395c7f9545d96105fdac47018 | [
"Apache-2.0"
] | null | null | null | mutations_aliens/main.cpp | aymeebonvarlet/projet_mutation_aliens | a1885d77d9ef197395c7f9545d96105fdac47018 | [
"Apache-2.0"
] | null | null | null | mutations_aliens/main.cpp | aymeebonvarlet/projet_mutation_aliens | a1885d77d9ef197395c7f9545d96105fdac47018 | [
"Apache-2.0"
] | null | null | null | #include "mainwindow.h"
#include "qstd.h"
using namespace qstd;
#include <QApplication>
#include "evolutionnary_process.h"
int main(int argc, char *argv[])
{
Evolutionnary_process evo;
evo.init();
cout<<evo.toString()<<endl;
QApplication a(argc, argv);
MainWindow w;
w.show();
return a.exec(... | 19.117647 | 34 | 0.664615 | aymeebonvarlet |
dee0c4a6231b74e6f1b2d9129bdf422fd8e12380 | 616 | cpp | C++ | 08_pass-by-reference/src/main.cpp | JuliusDiestra/cpp-sandbox | 6fa3bcb2a284e58136168e1952a8a54621232621 | [
"MIT"
] | null | null | null | 08_pass-by-reference/src/main.cpp | JuliusDiestra/cpp-sandbox | 6fa3bcb2a284e58136168e1952a8a54621232621 | [
"MIT"
] | null | null | null | 08_pass-by-reference/src/main.cpp | JuliusDiestra/cpp-sandbox | 6fa3bcb2a284e58136168e1952a8a54621232621 | [
"MIT"
] | null | null | null | #include "vehicle.hpp"
#include "controller.hpp"
int main(int argc, char *argv[]) {
// Create vehicle object
Vehicle vehicle;
vehicle.SetVelocity(20);
vehicle.SetAcceleration(30);
std::cout << "### Vehicle Object ###" << std::endl;
std::cout << "velocity:" << vehicle.GetVelocity() << std::endl... | 32.421053 | 75 | 0.625 | JuliusDiestra |
dee0f6e51b0bf08f7f3b1b3f4ce0dede9913d9f2 | 2,898 | cpp | C++ | Source/Extensions/PGUI/PGUI.Screen.cpp | wipe2238/foc | 87f083e4d12178244953857ee89da488b31d0a9b | [
"MIT"
] | 2 | 2018-12-14T23:06:21.000Z | 2021-07-29T03:10:38.000Z | Source/Extensions/PGUI/PGUI.Screen.cpp | wipe2238/foc | 87f083e4d12178244953857ee89da488b31d0a9b | [
"MIT"
] | 1 | 2020-08-25T10:38:00.000Z | 2020-08-25T10:38:00.000Z | Source/Extensions/PGUI/PGUI.Screen.cpp | wipe2238/foc | 87f083e4d12178244953857ee89da488b31d0a9b | [
"MIT"
] | null | null | null | #include <App.h>
#include <Defines.Public.h>
#include <GameOptions.h>
#include <Ini.h>
#include "PGUI.Core.h"
#include "PGUI.Screen.h"
PGUI::Screen::Screen( PGUI::Core* gui, uint width /* = 0 */, uint height /* = 0 */, int left /* = 0 */, int top /* = 0 */ ) : PGUI::Element( gui, width, height, left, top ),
// public... | 22.640625 | 173 | 0.515528 | wipe2238 |
dee106f0ef1f044ea3ecd0fcbb3d197955f98a5f | 668 | cpp | C++ | problems/lazyloading/submissions/accepted/lel.cpp | stoman/CompetitiveProgramming | 0000b64369b50e31c6f48939e837bdf6cece8ce4 | [
"MIT"
] | 2 | 2020-12-22T13:21:25.000Z | 2021-12-12T22:26:26.000Z | problems/lazyloading/submissions/accepted/lel.cpp | stoman/CompetitiveProgramming | 0000b64369b50e31c6f48939e837bdf6cece8ce4 | [
"MIT"
] | null | null | null | problems/lazyloading/submissions/accepted/lel.cpp | stoman/CompetitiveProgramming | 0000b64369b50e31c6f48939e837bdf6cece8ce4 | [
"MIT"
] | null | null | null | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#define MAXN 105
using namespace std;
int t, n, ans, lo, hi, maxim, how;
int w[MAXN];
int main( ) {
scanf( "%d", &t );
for ( int T = 0; T < t; ++T ) {
scanf( "%d", &n );
for ( int i = 1; i <= n; ++i ) {
scanf( "%d", &w[i] )... | 11.133333 | 39 | 0.42515 | stoman |
dee18f7be43af0742ef1a141d1cc2b540d142fa3 | 9,745 | hh | C++ | nodecursor.hh | cp-profiler/cp-profiler-deprecated- | ec163bde5c3a5bd9cc428b8fa8fd6ef713e0247a | [
"MIT-feh"
] | 1 | 2021-05-06T04:41:37.000Z | 2021-05-06T04:41:37.000Z | nodecursor.hh | cp-profiler/cp-profiler-deprecated- | ec163bde5c3a5bd9cc428b8fa8fd6ef713e0247a | [
"MIT-feh"
] | null | null | null | nodecursor.hh | cp-profiler/cp-profiler-deprecated- | ec163bde5c3a5bd9cc428b8fa8fd6ef713e0247a | [
"MIT-feh"
] | 1 | 2021-05-06T04:41:39.000Z | 2021-05-06T04:41:39.000Z | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 2006
*
* Last modified:
* $Date$ by $Author$
* $Revision$
*
* This file is part of Gecode, the generic constraint
* development environment:
... | 28.328488 | 80 | 0.677783 | cp-profiler |
dee63efa3f0c22e5bb79cef4e943cfc3e049ed24 | 2,316 | hpp | C++ | src/Modules/ModuleBuilder.hpp | pawel-jarosz/nastya-lisp | 813a58523b741e00c8c27980fe658b546e9ff38c | [
"MIT"
] | 1 | 2021-03-12T13:39:17.000Z | 2021-03-12T13:39:17.000Z | src/Modules/ModuleBuilder.hpp | pawel-jarosz/nastya-lisp | 813a58523b741e00c8c27980fe658b546e9ff38c | [
"MIT"
] | null | null | null | src/Modules/ModuleBuilder.hpp | pawel-jarosz/nastya-lisp | 813a58523b741e00c8c27980fe658b546e9ff38c | [
"MIT"
] | null | null | null | //
// Created by caedus on 30.01.2021.
//
#pragma once
#include "Modules/Module.hpp"
#include "Runtime/Interface/IEvaluatorFactory.hpp"
#include "Modules/Interface/IModuleBuilder.hpp"
#include <algorithm>
namespace nastya::modules {
template<typename EvaluatorFactory, typename... OtherFactories>
class ModuleBuilde... | 33.085714 | 89 | 0.756045 | pawel-jarosz |
dee7db73453cfe5478fcf165793c973eaba126fc | 2,150 | cpp | C++ | src/DescentGame/src/Main.cpp | poseidn/KungFoo | 35fa33bd5a9abb40ecf485db2fc038ca52c48a2d | [
"CC-BY-3.0",
"CC0-1.0",
"CC-BY-4.0"
] | 7 | 2016-01-28T14:28:10.000Z | 2021-09-03T17:33:37.000Z | src/DescentGame/src/Main.cpp | poseidn/KungFoo | 35fa33bd5a9abb40ecf485db2fc038ca52c48a2d | [
"CC-BY-3.0",
"CC0-1.0",
"CC-BY-4.0"
] | 1 | 2016-03-19T11:34:36.000Z | 2016-03-24T21:35:06.000Z | src/DescentGame/src/Main.cpp | poseidn/KungFoo | 35fa33bd5a9abb40ecf485db2fc038ca52c48a2d | [
"CC-BY-3.0",
"CC0-1.0",
"CC-BY-4.0"
] | 3 | 2016-03-10T14:23:40.000Z | 2019-03-17T16:21:21.000Z | /*
Copyright (C) 2016 Thomas Hauth. All Rights Reserved.
* Written by Thomas Hauth (Thomas.Hauth@web.de)
This file is part of Kung Foo Barracuda.
Kung Foo Barracuda 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... | 26.54321 | 100 | 0.751628 | poseidn |
dee83e605a1f575e4a2d710a5a6cb28e33523456 | 5,810 | cpp | C++ | patch/specific/drawbars.cpp | Tonyx97/TombMP | 7eb2d265df2fe7312b7ed07dd5943736340b921c | [
"MIT"
] | 3 | 2021-10-10T11:12:03.000Z | 2021-11-04T16:46:57.000Z | patch/specific/drawbars.cpp | Tonyx97/TombMP | 7eb2d265df2fe7312b7ed07dd5943736340b921c | [
"MIT"
] | null | null | null | patch/specific/drawbars.cpp | Tonyx97/TombMP | 7eb2d265df2fe7312b7ed07dd5943736340b921c | [
"MIT"
] | null | null | null | #include "standard.h"
#include "directx.h"
#include "global.h"
#include "hwrender.h"
#include "output.h"
#include <main.h>
#include <game/inventry.h>
#include <3dsystem/hwinsert.h>
#define HealthBarX 8
#define HealthBarY 6
#define HealthBarW 100
#define AirBarX (game_setup.dump_width-110)
#define AirBarY 6
#define A... | 30.904255 | 89 | 0.58537 | Tonyx97 |
dee9518ffeb35a2f6dc7b3f566346a6fd6e6d3fd | 22,804 | cpp | C++ | src/slib/db/sqlite.cpp | emarc99/SLib | 4e492d6c550f845fd1b3f40bf10183097eb0e53c | [
"MIT"
] | 146 | 2017-03-21T07:50:43.000Z | 2022-03-19T03:32:22.000Z | src/slib/db/sqlite.cpp | Crasader/SLib | 4e492d6c550f845fd1b3f40bf10183097eb0e53c | [
"MIT"
] | 50 | 2017-03-22T04:08:15.000Z | 2019-10-21T16:55:48.000Z | src/slib/db/sqlite.cpp | Crasader/SLib | 4e492d6c550f845fd1b3f40bf10183097eb0e53c | [
"MIT"
] | 55 | 2017-03-21T07:52:58.000Z | 2021-12-27T13:02:08.000Z | /*
* Copyright (c) 2008-2019 SLIBIO <https://github.com/SLIBIO>
*
* 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
* ... | 28.433915 | 157 | 0.620944 | emarc99 |
deeb50bf2737a13113f6383e8c965541b118890b | 7,337 | hpp | C++ | Extensions/Gameplay/IndexedHalfEdgeMesh.hpp | jodavis42/ZeroPhysicsTestbed | e84a3f6faf16b7a4242dc049121b5338e80039f8 | [
"MIT"
] | 1 | 2022-03-26T21:08:19.000Z | 2022-03-26T21:08:19.000Z | Extensions/Gameplay/IndexedHalfEdgeMesh.hpp | jodavis42/ZeroPhysicsTestbed | e84a3f6faf16b7a4242dc049121b5338e80039f8 | [
"MIT"
] | null | null | null | Extensions/Gameplay/IndexedHalfEdgeMesh.hpp | jodavis42/ZeroPhysicsTestbed | e84a3f6faf16b7a4242dc049121b5338e80039f8 | [
"MIT"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
///
/// Authors: Joshua Davis
/// Copyright 2017, DigiPen Institute of Technology
///
///////////////////////////////////////////////////////////////////////////////
#pragma once
namespace Zero
{
template <typename ArrayTyp... | 29.704453 | 119 | 0.654355 | jodavis42 |
deeff73bf44115b9aa19e662852a661458027b77 | 221 | cpp | C++ | C++/170923/170923/Item_4_Heal.cpp | ChoiChangYong/Game_Programing | 6c290e31eaac526b0dbdfc59731e6479126e95bc | [
"MIT"
] | null | null | null | C++/170923/170923/Item_4_Heal.cpp | ChoiChangYong/Game_Programing | 6c290e31eaac526b0dbdfc59731e6479126e95bc | [
"MIT"
] | null | null | null | C++/170923/170923/Item_4_Heal.cpp | ChoiChangYong/Game_Programing | 6c290e31eaac526b0dbdfc59731e6479126e95bc | [
"MIT"
] | 1 | 2020-04-27T12:41:20.000Z | 2020-04-27T12:41:20.000Z | #include "Item_4_Heal.h"
#include "Game.h"
#include <iostream>
using namespace std;
void Item_4_Heal::onCheck(Game* pGame)
{
pGame->Use_Item_4_Heal();
}
Item_4_Heal::Item_4_Heal()
{
}
Item_4_Heal::~Item_4_Heal()
{
}
| 11.631579 | 38 | 0.714932 | ChoiChangYong |
def119c406c8eaa5a601880b39120d51f9266eec | 2,917 | cpp | C++ | bitsafe/window_effective.cpp | codereba/bittrace | 6826559565aaafc9412d20427d21b73e23febcfe | [
"Unlicense"
] | 10 | 2018-11-09T01:08:15.000Z | 2020-06-21T05:39:54.000Z | bitsafe/window_effective.cpp | codereba/bittrace | 6826559565aaafc9412d20427d21b73e23febcfe | [
"Unlicense"
] | null | null | null | bitsafe/window_effective.cpp | codereba/bittrace | 6826559565aaafc9412d20427d21b73e23febcfe | [
"Unlicense"
] | 4 | 2018-11-09T03:29:52.000Z | 2021-07-23T03:30:03.000Z | /*
*
* Copyright 2010 JiJie Shi(weixin:AIChangeLife)
*
* This file is part of bittrace.
*
* bittrace is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at ... | 21.768657 | 147 | 0.629071 | codereba |
def25db62073c18ceca30494b8ac3956e4a26189 | 1,169 | cpp | C++ | Old Code/SM64FM/src/main.cpp | sonich2401/SM64_Save_File_Converter | bd6876d66cbc3177b634540c7a2241e0ae8c759c | [
"MIT-0"
] | 6 | 2020-07-27T19:07:37.000Z | 2021-08-29T19:16:07.000Z | Old Code/SM64FM/src/main.cpp | sonich2401/SM64_Save_File_Converter | bd6876d66cbc3177b634540c7a2241e0ae8c759c | [
"MIT-0"
] | 2 | 2021-06-09T05:49:41.000Z | 2022-01-30T04:06:40.000Z | Old Code/SM64FM/src/main.cpp | sonich2401/SM64_Save_File_Converter | bd6876d66cbc3177b634540c7a2241e0ae8c759c | [
"MIT-0"
] | null | null | null | #include <stdlib.h>
#include <stdio.h>
#include <typedefs.h>
#include "menu/option_decode.h"
#include "util/load_file/load_bin.h"
#include "EEPROM/EEPROM.h"
#include "menu/menu_choice.h"
#include "util/os/linux/escape_codes.h"
void exit_program(option_struct * options);
int main(int argc, cstring argv[]){
opt... | 25.977778 | 117 | 0.663815 | sonich2401 |
def94d20ef029a33c8313959adb0651a463e3480 | 4,645 | cpp | C++ | Desktop/FOSSA-GroundStationControlPanel/FOSSASatTracker/SGP4_experiments/main.cpp | FOSSASystems/FOSSA-GroundStationControlPanel | af83a09619239abe9fca09e073ab41c68bfd4822 | [
"MIT"
] | 2 | 2021-11-07T16:26:46.000Z | 2022-03-20T10:14:41.000Z | Desktop/FOSSA-GroundStationControlPanel/FOSSASatTracker/SGP4_experiments/main.cpp | FOSSASystems/FOSSA-GroundStationControlPanel | af83a09619239abe9fca09e073ab41c68bfd4822 | [
"MIT"
] | 18 | 2020-08-28T13:38:36.000Z | 2020-09-30T11:08:42.000Z | Desktop/FOSSA-GroundStationControlPanel/FOSSASatTracker/SGP4_experiments/main.cpp | FOSSASystems/FOSSA-GroundStationControlPanel | af83a09619239abe9fca09e073ab41c68bfd4822 | [
"MIT"
] | 2 | 2020-07-29T21:19:28.000Z | 2021-08-16T03:58:14.000Z | #include "sgp4io.h"
#include "sgp4unit.h"
#include <GeographicLib/Geocentric.hpp>
#include <iostream>
int main()
{
/*
INPUT is e.g.
2019
12
6
1
1
1
2020
12
6
1
1
1
*/
char fossasatTLELineA[70] = "1 44829U 19084F 20183.10006475 .00039774 00000-0 23016-3 0 9991";
char fossasatTLEL... | 27.323529 | 117 | 0.56254 | FOSSASystems |
defaa02a4762d4b70cc4f0fb2249bf63a7fccfca | 757 | cpp | C++ | alpaca/portfolio.cpp | aidanjalili/alpaca-trade-api-cpp | 0914de8ba46cea4c289ef362539d77b2bee74807 | [
"MIT"
] | 43 | 2020-04-07T03:28:22.000Z | 2022-03-30T21:34:16.000Z | alpaca/portfolio.cpp | aidanjalili/alpaca-trade-api-cpp | 0914de8ba46cea4c289ef362539d77b2bee74807 | [
"MIT"
] | 5 | 2020-04-29T03:45:36.000Z | 2021-03-31T00:59:43.000Z | alpaca/portfolio.cpp | aidanjalili/alpaca-trade-api-cpp | 0914de8ba46cea4c289ef362539d77b2bee74807 | [
"MIT"
] | 18 | 2020-04-27T18:35:18.000Z | 2022-02-05T17:13:38.000Z | #include "alpaca/portfolio.h"
#include "alpaca/json.h"
#include "rapidjson/document.h"
namespace alpaca {
Status PortfolioHistory::fromJSON(const std::string& json) {
rapidjson::Document d;
if (d.Parse(json.c_str()).HasParseError()) {
return Status(1, "Received parse error when deserializing portfolio JSON");... | 28.037037 | 81 | 0.738441 | aidanjalili |
defb2c5f63928f233ffce6f66bbca5071e7175b0 | 395 | cc | C++ | C++/algorithms/iterative_bsearch.cc | Pejo-306/mystdlib | 89d94bfb2fb590775f6d6f689eea6dbf89afd849 | [
"MIT"
] | null | null | null | C++/algorithms/iterative_bsearch.cc | Pejo-306/mystdlib | 89d94bfb2fb590775f6d6f689eea6dbf89afd849 | [
"MIT"
] | null | null | null | C++/algorithms/iterative_bsearch.cc | Pejo-306/mystdlib | 89d94bfb2fb590775f6d6f689eea6dbf89afd849 | [
"MIT"
] | null | null | null | using namespace std;
int bsearch(int *arr, int size, int value)
{
int left = 0, right = size - 1, middle;
while (left <= right) {
middle = (left + right) / 2;
if (arr[middle] == value)
return middle;
else if (arr[middle] < value)
left = middle + 1;
else
... | 21.944444 | 43 | 0.498734 | Pejo-306 |
deff9e0ef99374df542a6693b5dcc62e077471c5 | 6,456 | cpp | C++ | src/IB/IBLagrangianForceStrategySet.cpp | MSV-Project/IBAMR | 3cf614c31bb3c94e2620f165ba967cba719c45ea | [
"BSD-3-Clause"
] | 2 | 2017-12-06T06:16:36.000Z | 2021-03-13T12:28:08.000Z | src/IB/IBLagrangianForceStrategySet.cpp | MSV-Project/IBAMR | 3cf614c31bb3c94e2620f165ba967cba719c45ea | [
"BSD-3-Clause"
] | null | null | null | src/IB/IBLagrangianForceStrategySet.cpp | MSV-Project/IBAMR | 3cf614c31bb3c94e2620f165ba967cba719c45ea | [
"BSD-3-Clause"
] | null | null | null | // Filename: IBLagrangianForceStrategySet.cpp
// Created on 04 April 2007 by Boyce Griffith
//
// Copyright (c) 2002-2013, Boyce Griffith
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// ... | 37.103448 | 139 | 0.670074 | MSV-Project |
72007729164461efc492cbee49cf51da6b5c9677 | 2,935 | cpp | C++ | example/sql/test_multithread.cpp | zizzzw/fflib | ba9b465347b650d86c34876fbfae48bc31194d97 | [
"MIT"
] | 1 | 2022-02-08T07:28:07.000Z | 2022-02-08T07:28:07.000Z | example/sql/test_multithread.cpp | zizzzw/fflib | ba9b465347b650d86c34876fbfae48bc31194d97 | [
"MIT"
] | null | null | null | example/sql/test_multithread.cpp | zizzzw/fflib | ba9b465347b650d86c34876fbfae48bc31194d97 | [
"MIT"
] | 2 | 2022-01-06T02:16:09.000Z | 2022-01-19T12:49:54.000Z | /***********************************************
The MIT License (MIT)
Copyright (c) 2012 Athrun Arthur <athrunarthur@gmail.com>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without ... | 37.151899 | 79 | 0.612947 | zizzzw |
7200cb8c29aa54b386846e16aac4f09b5848effa | 9,142 | cpp | C++ | Code/Core/CoreTest/Tests/TestSmallBlockAllocator.cpp | qq573011406/FASTBuild_UnrealEngine | 29c49672f82173a903cb32f0e4656e2fd07ebef2 | [
"MIT"
] | 30 | 2020-07-15T06:16:55.000Z | 2022-02-10T21:37:52.000Z | Code/Core/CoreTest/Tests/TestSmallBlockAllocator.cpp | qq573011406/FASTBuild_UnrealEngine | 29c49672f82173a903cb32f0e4656e2fd07ebef2 | [
"MIT"
] | 1 | 2020-11-23T13:35:00.000Z | 2020-11-23T13:35:00.000Z | Code/Core/CoreTest/Tests/TestSmallBlockAllocator.cpp | qq573011406/FASTBuild_UnrealEngine | 29c49672f82173a903cb32f0e4656e2fd07ebef2 | [
"MIT"
] | 12 | 2020-09-16T17:39:34.000Z | 2021-08-17T11:32:37.000Z | // TestSmallBlockAllocator.cpp
//------------------------------------------------------------------------------
// Includes
//------------------------------------------------------------------------------
#include "TestFramework/UnitTest.h"
#include "Core/Containers/Array.h"
#include "Core/Math/Random.h"
#include "Co... | 35.710938 | 198 | 0.556005 | qq573011406 |
72028a958d4a35056f23ad403159ba57ac3b6bbc | 1,639 | h++ | C++ | include/wheels/adl/swap.h++ | dendisuhubdy/wheels | a49e790dbc277335907b393ebaddea947ae14d0e | [
"CC0-1.0"
] | null | null | null | include/wheels/adl/swap.h++ | dendisuhubdy/wheels | a49e790dbc277335907b393ebaddea947ae14d0e | [
"CC0-1.0"
] | null | null | null | include/wheels/adl/swap.h++ | dendisuhubdy/wheels | a49e790dbc277335907b393ebaddea947ae14d0e | [
"CC0-1.0"
] | 1 | 2019-11-16T18:30:53.000Z | 2019-11-16T18:30:53.000Z | // Wheels - various C++ utilities
//
// Written in 2013 by Martinho Fernandes <martinho.fernandes@gmail.com>
//
// To the extent possible under law, the author(s) have dedicated all copyright and related
// and neighboring rights to this software to the public domain worldwide. This software is
// distributed without a... | 38.116279 | 101 | 0.626602 | dendisuhubdy |
72029ac0401188223aa3ccc577020843e1245dd9 | 3,722 | cc | C++ | src/connectivity/wlan/drivers/testing/lib/sim-env/sim-env.cc | opensource-assist/fuschia | 66646c55b3d0b36aae90a4b6706b87f1a6261935 | [
"BSD-3-Clause"
] | null | null | null | src/connectivity/wlan/drivers/testing/lib/sim-env/sim-env.cc | opensource-assist/fuschia | 66646c55b3d0b36aae90a4b6706b87f1a6261935 | [
"BSD-3-Clause"
] | null | null | null | src/connectivity/wlan/drivers/testing/lib/sim-env/sim-env.cc | opensource-assist/fuschia | 66646c55b3d0b36aae90a4b6706b87f1a6261935 | [
"BSD-3-Clause"
] | null | null | null | // Copyright 2019 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "sim-env.h"
#include <zircon/assert.h>
namespace wlan::simulation {
uint64_t Environment::event_count_ = 0;
void Environment::Run() {
while ... | 29.539683 | 97 | 0.622783 | opensource-assist |
7202f264bd57851ca7f5b279dd6700bd6f5d9dd6 | 556 | cc | C++ | examples/toy/andor.cc | paulhjkelly/taskgraph-metaprogramming | 54c4e2806a97bec555a90784ab4cf0880660bf89 | [
"BSD-3-Clause"
] | 5 | 2020-04-11T21:30:19.000Z | 2021-12-04T16:16:09.000Z | examples/toy/andor.cc | paulhjkelly/taskgraph-metaprogramming | 54c4e2806a97bec555a90784ab4cf0880660bf89 | [
"BSD-3-Clause"
] | null | null | null | examples/toy/andor.cc | paulhjkelly/taskgraph-metaprogramming | 54c4e2806a97bec555a90784ab4cf0880660bf89 | [
"BSD-3-Clause"
] | null | null | null | #include <TaskGraph>
using namespace tg;
typedef TaskGraph<void,int> andor_TaskGraph;
int main( int argc, char *argv[] ) {
andor_TaskGraph T;
taskgraph( andor_TaskGraph, T, tuple1(a) ) {
tVar(int, b);
b = ((a < 12) + (a > 42));
b = ((a > 6) - (a < 9));
b = ((a < 12) * (a > 42));
b = ((a > 6) ... | 22.24 | 46 | 0.393885 | paulhjkelly |
7208b1a74f7a044ea3b92c8d2697cdd2dffbc33f | 437 | hpp | C++ | include/imgui.hpp | richard-vock/graphene | 1a721894a9972c8865a1ad0861d500cef8436932 | [
"Unlicense"
] | null | null | null | include/imgui.hpp | richard-vock/graphene | 1a721894a9972c8865a1ad0861d500cef8436932 | [
"Unlicense"
] | null | null | null | include/imgui.hpp | richard-vock/graphene | 1a721894a9972c8865a1ad0861d500cef8436932 | [
"Unlicense"
] | null | null | null | #pragma once
#include <string>
#include <imgui.h>
#include "common.hpp"
#include "events.hpp"
struct GLFWwindow;
namespace graphene::imgui {
IMGUI_IMPL_API bool init_application(GLFWwindow* window, const std::string& font_path, float font_size, std::shared_ptr<event_manager> events);
IMGUI_IMPL_API void shutdown_a... | 20.809524 | 143 | 0.78032 | richard-vock |
7209c4bdc94f639f48deccad6ab5e8cd5451ec5e | 4,139 | cpp | C++ | libdclalgo/tests/AzimuthEvaluationTests.cpp | OlegZhavoronkov/tnk_certification | 9ef3544f3fd27073b78e38bba26af76e79f55a78 | [
"Unlicense"
] | null | null | null | libdclalgo/tests/AzimuthEvaluationTests.cpp | OlegZhavoronkov/tnk_certification | 9ef3544f3fd27073b78e38bba26af76e79f55a78 | [
"Unlicense"
] | null | null | null | libdclalgo/tests/AzimuthEvaluationTests.cpp | OlegZhavoronkov/tnk_certification | 9ef3544f3fd27073b78e38bba26af76e79f55a78 | [
"Unlicense"
] | null | null | null | #include "AzimuthEvaluation.h"
#include "PolarDecomposition.h"
#include "LibraryParameters.h"
#include <opencv2/core.hpp>
#include <gtest/gtest.h>
#include <limits>
#include <vector>
class AzimuthEvaluationTests : public ::testing::Test {
public:
AzimuthEvaluationTests();
cv::Mat genRandomMat(double min, double... | 30.433824 | 93 | 0.636144 | OlegZhavoronkov |
7209c78d917330a56ef4ad047da24049bab203e5 | 7,107 | cc | C++ | virtual-machine/instructions.cc | AlexGustafsson/mjavac | 6efbf8d77ba67760cff5ab87a3e858de769ac33e | [
"Unlicense"
] | null | null | null | virtual-machine/instructions.cc | AlexGustafsson/mjavac | 6efbf8d77ba67760cff5ab87a3e858de769ac33e | [
"Unlicense"
] | null | null | null | virtual-machine/instructions.cc | AlexGustafsson/mjavac | 6efbf8d77ba67760cff5ab87a3e858de769ac33e | [
"Unlicense"
] | 1 | 2021-08-19T02:56:28.000Z | 2021-08-19T02:56:28.000Z | #include <iostream>
#include <list>
#include <tuple>
#include "instructions.hpp"
using namespace mjavac::vm;
Instruction_iload::Instruction_iload(std::string identifier)
: identifier(identifier) {
}
void Instruction_iload::perform(State *state) const {
state->stack.push(state->variables[this->identifier]);
... | 25.024648 | 106 | 0.686647 | AlexGustafsson |
720bb2895a6c02e62838eab7e95643be1aa134eb | 6,035 | cc | C++ | apis/ocpdiag/ocpdiag/core/results/internal/logging_test.cc | opencomputeproject/ocp-diag-core | 37b83ff6f69684b435364000d26cd913eb6ff5f3 | [
"Apache-2.0"
] | 10 | 2021-11-09T20:20:56.000Z | 2022-03-25T11:59:14.000Z | apis/ocpdiag/ocpdiag/core/results/internal/logging_test.cc | opencomputeproject/ocp-diag-core | 37b83ff6f69684b435364000d26cd913eb6ff5f3 | [
"Apache-2.0"
] | 2 | 2022-02-10T21:27:33.000Z | 2022-03-23T22:08:30.000Z | apis/ocpdiag/ocpdiag/core/results/internal/logging_test.cc | opencomputeproject/ocp-diag-core | 37b83ff6f69684b435364000d26cd913eb6ff5f3 | [
"Apache-2.0"
] | 1 | 2021-11-24T04:46:00.000Z | 2021-11-24T04:46:00.000Z | // Copyright 2021 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in ... | 31.432292 | 89 | 0.708699 | opencomputeproject |
720c50dc8d59b9d1cfb7c087510ca8fb74d2d718 | 7,580 | cpp | C++ | level1/p11_linkedList/linkedList.cpp | shui12jiao/c2021 | 0a21392fe0c35cbebc04335d43e134410e17d89c | [
"MIT"
] | null | null | null | level1/p11_linkedList/linkedList.cpp | shui12jiao/c2021 | 0a21392fe0c35cbebc04335d43e134410e17d89c | [
"MIT"
] | null | null | null | level1/p11_linkedList/linkedList.cpp | shui12jiao/c2021 | 0a21392fe0c35cbebc04335d43e134410e17d89c | [
"MIT"
] | null | null | null | #include <sstream>
#include "illegalParameter.h"
#include "linearList.h"
#include "linkedNode.h"
template <typename T>
class linkedList : public linearList<T> { //链表
public:
linkedList();
linkedList(const linkedList<T>&);
~linkedList();
bool empty() const { return listSize == 0; }
int size() ... | 26.784452 | 107 | 0.581003 | shui12jiao |
720e527a45f234e6add1ca37bbf847a70b75d5fc | 1,617 | cpp | C++ | src/lib/Mutex.cpp | romoadri21/boi | deef8e7148b50fbb36886ba4ff491a6c0e18ad67 | [
"BSD-3-Clause"
] | null | null | null | src/lib/Mutex.cpp | romoadri21/boi | deef8e7148b50fbb36886ba4ff491a6c0e18ad67 | [
"BSD-3-Clause"
] | null | null | null | src/lib/Mutex.cpp | romoadri21/boi | deef8e7148b50fbb36886ba4ff491a6c0e18ad67 | [
"BSD-3-Clause"
] | null | null | null | /* Copyright (c) 2010, Piet Hein Schouten. All rights reserved.
* This code is licensed under a BSD-style license that can be
* found in the LICENSE file. The license can also be found at:
* http://www.boi-project.org/license
*/
#include <QMutex>
#include <QWaitCondition>
#include "ThreadLockData.h"
#include "Mute... | 18.586207 | 65 | 0.520717 | romoadri21 |
72116306bdcb5a850237fd09e64692faddd4be31 | 299 | cpp | C++ | code/hackerrank/left rotation.cpp | Codernob/problem-solving-codes | c852bae4e31887bd442d70af921348c8f1d246bf | [
"MIT"
] | null | null | null | code/hackerrank/left rotation.cpp | Codernob/problem-solving-codes | c852bae4e31887bd442d70af921348c8f1d246bf | [
"MIT"
] | null | null | null | code/hackerrank/left rotation.cpp | Codernob/problem-solving-codes | c852bae4e31887bd442d70af921348c8f1d246bf | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
void lr(int a[],int n) {
int temp=a[0];
for(int i=0;i<n-1;i++) a[i]=a[i+1];
a[n-1]=temp;
}
int main() {
int n,d;
cin>>n/*>>d*/;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
/*for(int i=1;i<=d;i++)*/ lr(a,n);
for(int i=0;i<n;i++) cout<<a[i]<<" ";
return 0;
} | 18.6875 | 38 | 0.521739 | Codernob |
72127937d14cdbfedbe5d1c95ae94d20942522bf | 664 | hpp | C++ | include/simple_math/vec.hpp | signekatt/simple_math | aa17f449330a2dd38a10222074c1139fdbdeeb75 | [
"MIT"
] | null | null | null | include/simple_math/vec.hpp | signekatt/simple_math | aa17f449330a2dd38a10222074c1139fdbdeeb75 | [
"MIT"
] | null | null | null | include/simple_math/vec.hpp | signekatt/simple_math | aa17f449330a2dd38a10222074c1139fdbdeeb75 | [
"MIT"
] | null | null | null | // Copyright(c) 2019-present, Anton Lilja.
// Distributed under the MIT License (http://opensource.org/licenses/MIT)
#pragma once
#include "vec2.hpp"
#include "vec3.hpp"
#include "vec4.hpp"
namespace sm {
// Other op funcs
template <typename V>
inline V inverse(const V& v) {
return v.inverse();
... | 21.419355 | 73 | 0.626506 | signekatt |
721c2de3ada7099eceea094e17c91fb0912c52f8 | 4,875 | cpp | C++ | modules/dasClangBind/src/dasClangBind.func_3.cpp | profelis/daScript | eea57f39dec4dd6168ee64c8ae5139cbcf2937bc | [
"BSD-3-Clause"
] | 421 | 2019-08-15T15:40:04.000Z | 2022-03-29T06:59:06.000Z | modules/dasClangBind/src/dasClangBind.func_3.cpp | profelis/daScript | eea57f39dec4dd6168ee64c8ae5139cbcf2937bc | [
"BSD-3-Clause"
] | 55 | 2019-08-17T13:50:53.000Z | 2022-03-25T17:58:38.000Z | modules/dasClangBind/src/dasClangBind.func_3.cpp | profelis/daScript | eea57f39dec4dd6168ee64c8ae5139cbcf2937bc | [
"BSD-3-Clause"
] | 58 | 2019-08-22T17:04:13.000Z | 2022-03-25T17:43:28.000Z | // this file is generated via daScript automatic C++ binder
// all user modifications will be lost after this file is re-generated
#include "daScript/misc/platform.h"
#include "daScript/ast/ast.h"
#include "daScript/ast/ast_interop.h"
#include "daScript/ast/ast_handle.h"
#include "daScript/ast/ast_typefactory_bind.h"
... | 87.053571 | 284 | 0.791179 | profelis |
721f63b1042c4020bc953e493fbecf874d6fdb7c | 3,585 | cpp | C++ | test/unit_tests/02_lock_acquire_release/test.cpp | stephenneuendorffer/mlir-aie | c95e5f4996f5490759705de63820adcf373444e6 | [
"Apache-2.0"
] | 67 | 2021-08-29T04:47:56.000Z | 2022-03-29T05:38:32.000Z | test/unit_tests/02_lock_acquire_release/test.cpp | pssrawat/mlir-aie | b3f29a6344b70c6730d7ce0485b7bda54f3277dc | [
"Apache-2.0"
] | 45 | 2021-09-02T21:35:59.000Z | 2022-03-18T10:07:25.000Z | test/unit_tests/02_lock_acquire_release/test.cpp | hanchenye/mlir-aie | 8027f07c8d58afc11c25aab743fbcb901dac2ae6 | [
"Apache-2.0"
] | 26 | 2021-08-29T17:38:33.000Z | 2022-03-29T23:25:05.000Z | //===- test.cpp -------------------------------------------------*- C++ -*-===//
//
// This file is licensed under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
// (c) Copyright 2020 Xilinx Inc.
//... | 30.12605 | 100 | 0.530544 | stephenneuendorffer |
7220274c2f0659c42f463ff7829710cef92ef67a | 2,359 | cpp | C++ | ojcpp/leetcode/000/001_e_twosum.cpp | softarts/oj | 2f51f360a7a6c49e865461755aec2f3a7e721b9e | [
"Apache-2.0"
] | 3 | 2019-05-04T03:26:02.000Z | 2019-08-29T01:20:44.000Z | ojcpp/leetcode/000/001_e_twosum.cpp | softarts/oj | 2f51f360a7a6c49e865461755aec2f3a7e721b9e | [
"Apache-2.0"
] | null | null | null | ojcpp/leetcode/000/001_e_twosum.cpp | softarts/oj | 2f51f360a7a6c49e865461755aec2f3a7e721b9e | [
"Apache-2.0"
] | null | null | null | /*
https://leetcode.com/problems/two-sum/
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
思路
在one pass中，每个element-target=value,看看value是否已存在于hash map中
*/
#include <codech/codech_def.h>
using namespace CODECH;
using namespace std;
/*
vector<int> twoSum(vector<int>... | 21.445455 | 69 | 0.492158 | softarts |
72212be3fd2dd2fadb93b6595d42cb3cfec9fad0 | 5,065 | cpp | C++ | util/qtColorScheme.cpp | Kitware/qtextensions | 0ff5b486f08435c8cdfbc9f05d2f104f63b16aed | [
"BSD-3-Clause"
] | 19 | 2015-12-17T14:48:11.000Z | 2021-11-26T13:43:40.000Z | util/qtColorScheme.cpp | Kitware/qtextensions | 0ff5b486f08435c8cdfbc9f05d2f104f63b16aed | [
"BSD-3-Clause"
] | 26 | 2015-11-16T21:34:23.000Z | 2021-01-29T13:41:21.000Z | util/qtColorScheme.cpp | Kitware/qtextensions | 0ff5b486f08435c8cdfbc9f05d2f104f63b16aed | [
"BSD-3-Clause"
] | 13 | 2015-11-10T02:44:47.000Z | 2020-11-16T06:07:21.000Z | // This file is part of qtExtensions, and is distributed under the
// OSI-approved BSD 3-Clause License. See top-level LICENSE file or
// https://github.com/Kitware/qtExtensions/blob/master/LICENSE for details.
#include "qtColorScheme.h"
#include <QSettings>
#define ARGS(x) QPalette::x, #x
//-----------------------... | 41.516393 | 79 | 0.603356 | Kitware |
722310472f4f466485792343c31670010863c197 | 11,228 | hpp | C++ | tcob/include/tcob/core/Automation.hpp | TobiasBohnen/tcob | 53092b3c8e657f1ff5e48ce961659edf7cb1cb05 | [
"MIT"
] | 2 | 2021-08-18T19:14:35.000Z | 2021-12-01T14:14:49.000Z | tcob/include/tcob/core/Automation.hpp | TobiasBohnen/tcob | 53092b3c8e657f1ff5e48ce961659edf7cb1cb05 | [
"MIT"
] | null | null | null | tcob/include/tcob/core/Automation.hpp | TobiasBohnen/tcob | 53092b3c8e657f1ff5e48ce961659edf7cb1cb05 | [
"MIT"
] | null | null | null | // Copyright (c) 2021 Tobias Bohnen
//
// This software is released under the MIT License.
// https://opensource.org/licenses/MIT
#pragma once
#include <tcob/tcob_config.hpp>
#include <concepts>
#include <queue>
#include <vector>
#include <tcob/core/Random.hpp>
#include <tcob/core/Signal.hpp>
#include <tcob/core/Upd... | 24.408696 | 125 | 0.546491 | TobiasBohnen |
722453a47a24987fd1452538469992a1e5025906 | 1,288 | cpp | C++ | ewk/unittest/utc_blink_ewk_context_proxy_uri_set_func.cpp | Jabawack/chromium-efl | 6d3a3accc8afba0aa0eff6461eb5c83138172e6e | [
"BSD-3-Clause"
] | 9 | 2015-04-09T20:22:08.000Z | 2021-03-17T08:34:56.000Z | ewk/unittest/utc_blink_ewk_context_proxy_uri_set_func.cpp | Jabawack/chromium-efl | 6d3a3accc8afba0aa0eff6461eb5c83138172e6e | [
"BSD-3-Clause"
] | 2 | 2015-02-04T13:41:12.000Z | 2015-05-25T14:00:40.000Z | ewk/unittest/utc_blink_ewk_context_proxy_uri_set_func.cpp | isabella232/chromium-efl | db2d09aba6498fb09bbea1f8440d071c4b0fde78 | [
"BSD-3-Clause"
] | 14 | 2015-02-12T16:20:47.000Z | 2022-01-20T10:36:26.000Z | // Copyright 2014 Samsung Electronics. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "utc_blink_ewk_base.h"
class utc_blink_ewk_context_proxy_uri_set : public utc_blink_ewk_base
{
protected:
static const char*const url;
};
cons... | 30.666667 | 82 | 0.776398 | Jabawack |
7228c338c7a4d565cdda960c9153395a6e053ef3 | 4,554 | cpp | C++ | DHT_U.cpp | bert386/esp32-pellet-hmi | 17e389632defb51dbc42cb2eef968fdc74a39477 | [
"Apache-2.0"
] | 1 | 2021-03-03T05:35:43.000Z | 2021-03-03T05:35:43.000Z | DHT_U.cpp | bert386/esp32-pellet-hmi | 17e389632defb51dbc42cb2eef968fdc74a39477 | [
"Apache-2.0"
] | null | null | null | DHT_U.cpp | bert386/esp32-pellet-hmi | 17e389632defb51dbc42cb2eef968fdc74a39477 | [
"Apache-2.0"
] | null | null | null |
#include "DHT_U.h"
DHT_Unified::DHT_Unified(uint8_t pin, uint8_t type, uint8_t count, int32_t tempSensorId, int32_t humiditySensorId):
_dht(pin, type, count),
_type(type),
_temp(this, tempSensorId),
_humidity(this, humiditySensorId)
{}
void DHT_Unified::begin() {
_dht.begin();
}
void DHT_Unified::setName(... | 28.4625 | 115 | 0.63307 | bert386 |
7229d3675fd07fda77dd0738036f04243218b3cb | 1,625 | cpp | C++ | concept_tests/drivers/freertos_driver.cpp | jedrzejboczar/ubik-micromouse | 6470368de0c3207fc278bcfa604d1fdd74aaeb8f | [
"MIT"
] | 3 | 2019-10-30T07:37:47.000Z | 2021-01-21T11:50:20.000Z | concept_tests/drivers/freertos_driver.cpp | jedrzejboczar/ubik-micromouse | 6470368de0c3207fc278bcfa604d1fdd74aaeb8f | [
"MIT"
] | null | null | null | concept_tests/drivers/freertos_driver.cpp | jedrzejboczar/ubik-micromouse | 6470368de0c3207fc278bcfa604d1fdd74aaeb8f | [
"MIT"
] | null | null | null | #include "freertos_driver.h"
// void FreeRTOSDriverTask::task() {
// run();
// }
FreeRTOSDriverTask::FreeRTOSDriverTask(
const char * name, int priority, int stack_depth,
size_t request_queue_length, TickType_t timeout):
FreeRTOSTask(name, priority, stack_depth),
request_queue_length(requ... | 31.25 | 95 | 0.729231 | jedrzejboczar |
722e215ab9d583c68b4b931841d7e1501fc8ff49 | 1,453 | cpp | C++ | algorithms/KthSmallestElementinaBST/tree.cpp | PikachuPikachuHAHA/leetcode-2 | 4cf8d30509f4b994b1845765807380eeffb95c73 | [
"MIT"
] | 93 | 2016-04-27T23:25:27.000Z | 2021-07-13T20:32:25.000Z | algorithms/KthSmallestElementinaBST/tree.cpp | shangan/leetcode | db05338f8057ad440cb5dd6cfe0151aafb7a8d56 | [
"MIT"
] | null | null | null | algorithms/KthSmallestElementinaBST/tree.cpp | shangan/leetcode | db05338f8057ad440cb5dd6cfe0151aafb7a8d56 | [
"MIT"
] | 43 | 2016-05-31T15:46:50.000Z | 2021-04-09T04:07:39.000Z | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(nullptr), right(nullptr){}
};
class Solution {
public:
int kthSmallest(TreeNode *root, int k) {
int result... | 19.90411 | 78 | 0.644184 | PikachuPikachuHAHA |
7236a5e16e768f9e870eab43fe93378f499bac48 | 985 | cpp | C++ | System/GroundMissionControl.cpp | MatthewGotte/214_project_Derived | 48a74a10bc4fd5b01d11d1f89a7203a5b070b9bd | [
"MIT"
] | null | null | null | System/GroundMissionControl.cpp | MatthewGotte/214_project_Derived | 48a74a10bc4fd5b01d11d1f89a7203a5b070b9bd | [
"MIT"
] | null | null | null | System/GroundMissionControl.cpp | MatthewGotte/214_project_Derived | 48a74a10bc4fd5b01d11d1f89a7203a5b070b9bd | [
"MIT"
] | null | null | null | #include "GroundMissionControl.h"
#include "Satellite.h"
GroundMissionControl::GroundMissionControl() {
}
void GroundMissionControl::attach(Satellite* addSatellite) {
this->satelliteList.push_back(addSatellite);
}
void GroundMissionControl::detach(Satellite* removeSatellite) {
vector<Sate... | 24.625 | 84 | 0.603046 | MatthewGotte |
723825c6ae045d3688616d4d86c65a960f8057ce | 4,609 | cpp | C++ | test/graphic/sphere_transparent_test.cpp | mpinto70/raytracing | 5e3a46257b74a3df1b91fb066d7763b50273bf83 | [
"MIT"
] | null | null | null | test/graphic/sphere_transparent_test.cpp | mpinto70/raytracing | 5e3a46257b74a3df1b91fb066d7763b50273bf83 | [
"MIT"
] | null | null | null | test/graphic/sphere_transparent_test.cpp | mpinto70/raytracing | 5e3a46257b74a3df1b91fb066d7763b50273bf83 | [
"MIT"
] | null | null | null | #include "graphic/sphere_transparent.h"
#include <gtest/gtest.h>
namespace graphic {
using geometry::vec3d;
TEST(sphere_transparent, creation) {
constexpr vec3d C1{ 7, 8, 9 };
constexpr dim_t R1 = 5.0f;
const sphere_transparent S1{ C1, R1, 1.458, 0.1, 0.2, 0.3 };
constexpr vec3d C2{ -2, 3, 10 };
... | 34.395522 | 85 | 0.635713 | mpinto70 |
5cfb300c5618be540e9dab1268bc36675010d39a | 2,624 | cpp | C++ | homomorphic_evaluation/ntl-11.3.2/src/Poly3TimeTest.cpp | dklee0501/PLDI_20_242_artifact_publication | f2b73df9165c76e8b521d8ebd639d68321e3862b | [
"MIT"
] | 160 | 2016-05-11T09:45:56.000Z | 2022-03-06T09:32:19.000Z | homomorphic_evaluation/ntl-11.3.2/src/Poly3TimeTest.cpp | dklee0501/Lobster | f2b73df9165c76e8b521d8ebd639d68321e3862b | [
"MIT"
] | 57 | 2016-12-26T07:02:12.000Z | 2022-03-06T16:34:31.000Z | homomorphic_evaluation/ntl-11.3.2/src/Poly3TimeTest.cpp | dklee0501/Lobster | f2b73df9165c76e8b521d8ebd639d68321e3862b | [
"MIT"
] | 67 | 2016-10-10T17:56:22.000Z | 2022-03-15T22:56:39.000Z |
#include <NTL/ZZ_pX.h>
#include <cstdio>
NTL_CLIENT
double clean_data(double *t)
{
double x, y, z;
long i, ix, iy, n;
x = t[0]; ix = 0;
y = t[0]; iy = 0;
for (i = 1; i < 5; i++) {
if (t[i] < x) {
x = t[i];
ix = i;
}
if (t[i] > y) {
y = t[i];
iy... | 15.255814 | 62 | 0.470655 | dklee0501 |
5cfd9b6935f140e9eca09aeef566fb9c6424ab7f | 1,120 | cpp | C++ | examples/week01/numbers/sizeof.cpp | DaveParillo/cisc187-docker | 872c0dba7d79d2e5c7c0269a8b75045c6f2bc229 | [
"MIT"
] | null | null | null | examples/week01/numbers/sizeof.cpp | DaveParillo/cisc187-docker | 872c0dba7d79d2e5c7c0269a8b75045c6f2bc229 | [
"MIT"
] | null | null | null | examples/week01/numbers/sizeof.cpp | DaveParillo/cisc187-docker | 872c0dba7d79d2e5c7c0269a8b75045c6f2bc229 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
int main() {
char c = 'a';
std::cout << "size of char: " << sizeof(c) << '\n'
<< "size of int: " << sizeof(int) << '\n'
<< "size of double: " << sizeof(double) << '\n'
<< "size of pointer: " << sizeof(&c) << std::endl;
double foo[... | 46.666667 | 178 | 0.473214 | DaveParillo |
5cfeffcb3608cdbcd3725189563c08e85ff27ae1 | 9,461 | cpp | C++ | src/test-apps/weave-connection-tunnel.cpp | aiw-google/openweave-core | 5dfb14b21d0898ef95bb62ff564cadfeea4b4702 | [
"Apache-2.0"
] | 1 | 2021-08-10T12:08:31.000Z | 2021-08-10T12:08:31.000Z | src/test-apps/weave-connection-tunnel.cpp | aiw-google/openweave-core | 5dfb14b21d0898ef95bb62ff564cadfeea4b4702 | [
"Apache-2.0"
] | null | null | null | src/test-apps/weave-connection-tunnel.cpp | aiw-google/openweave-core | 5dfb14b21d0898ef95bb62ff564cadfeea4b4702 | [
"Apache-2.0"
] | 1 | 2020-06-15T01:50:59.000Z | 2020-06-15T01:50:59.000Z | /*
*
* Copyright (c) 2016-2017 Nest Labs, Inc.
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE... | 29.381988 | 138 | 0.659233 | aiw-google |
cf03086f029e45cfbb3b2a27e454049c615950a8 | 2,462 | cpp | C++ | Dory/Sensores.cpp | project-neon/Dory | 7a84ee5556b681f1b4d2a03db14f170734dd74ed | [
"MIT"
] | 1 | 2021-11-08T20:17:21.000Z | 2021-11-08T20:17:21.000Z | Dory/Sensores.cpp | project-neon/Dory | 7a84ee5556b681f1b4d2a03db14f170734dd74ed | [
"MIT"
] | null | null | null | Dory/Sensores.cpp | project-neon/Dory | 7a84ee5556b681f1b4d2a03db14f170734dd74ed | [
"MIT"
] | 1 | 2021-11-08T19:57:53.000Z | 2021-11-08T19:57:53.000Z | #include <VL53L0X.h>
#include "Sensores.h"
#include "_config.h"
#include <Wire.h>
VL53L0X Sensores::sensor1;
VL53L0X Sensores::sensor2;
void Sensores::init(){
Wire.begin();
pinMode(Xshut_1, OUTPUT);
pinMode(Xshut_2, OUTPUT);
digitalWrite(Xshut_1, LOW);
digitalWrite(Xshut_2, LOW);
delay(10)... | 26.191489 | 88 | 0.655971 | project-neon |
cf0e92dadd83905c9a73be9189544e26aab87294 | 30,067 | cpp | C++ | Source/Interface/Resources/FontResource.cpp | Noxagonal/Vulkan2DRenderer | 5110a2422dfbf0bf5cfb1d3e13c5b97d5b80243e | [
"MIT"
] | 90 | 2020-06-20T15:00:31.000Z | 2022-03-22T21:03:45.000Z | Source/Interface/Resources/FontResource.cpp | Niko40/Vulkan2DRenderer | 5110a2422dfbf0bf5cfb1d3e13c5b97d5b80243e | [
"MIT"
] | 39 | 2019-11-04T01:40:14.000Z | 2020-03-09T15:57:00.000Z | Source/Interface/Resources/FontResource.cpp | Niko40/Vulkan2DRenderer | 5110a2422dfbf0bf5cfb1d3e13c5b97d5b80243e | [
"MIT"
] | 4 | 2020-12-02T22:39:33.000Z | 2021-12-27T07:55:12.000Z |
#include "Core/SourceCommon.h"
#include "System/ThreadPrivateResources.h"
#include "Interface/InstanceImpl.h"
#include "Interface/Resources/ResourceManager.h"
#include "Interface/Resources/ResourceManagerImpl.h"
#include "Interface/Resources/FontResource.h"
#include "Interface/Resources/FontResourceImpl.h"
#inclu... | 32.364909 | 177 | 0.683241 | Noxagonal |
cf1375d321ab6dff3ca69728686c391b0bb9f4a4 | 827 | cpp | C++ | UVa 10585 - Center of symmetry/sample/10585 - Center of symmetry.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2020-11-24T03:17:21.000Z | 2020-11-24T03:17:21.000Z | UVa 10585 - Center of symmetry/sample/10585 - Center of symmetry.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | null | null | null | UVa 10585 - Center of symmetry/sample/10585 - Center of symmetry.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2021-04-11T16:22:31.000Z | 2021-04-11T16:22:31.000Z | #include <stdio.h>
#include <map>
using namespace std;
long long x[10000], y[10000], avex, avey, n;
void solve() {
if(avex%n || avey%n) {
puts("no");
return;
}
avex /= n, avey /= n;
map<long long, int> r;
int i;
for(i = 0; i < n; i++)
r[x[i]*100000000+y[i]] = 1;
long ... | 20.675 | 45 | 0.385732 | tadvi |
cf1485d6b4456ed43ad3558b0191dc7ba14f6957 | 162 | cpp | C++ | src/utils/Application.cpp | mgeorgoulopoulos/gencut | e9751c0d04816311d5460d14a88eaa1fcbe6f40d | [
"MIT"
] | null | null | null | src/utils/Application.cpp | mgeorgoulopoulos/gencut | e9751c0d04816311d5460d14a88eaa1fcbe6f40d | [
"MIT"
] | null | null | null | src/utils/Application.cpp | mgeorgoulopoulos/gencut | e9751c0d04816311d5460d14a88eaa1fcbe6f40d | [
"MIT"
] | null | null | null | #include "Application.h"
#include "GenomeModel.h"
void Application::execute() {
GenomeModel model;
model.load(arguments.genomeModelFilename, geneRegistry);
} | 18 | 57 | 0.771605 | mgeorgoulopoulos |
cf16edca209b988b8b8becbb6e49ecf128e1f2b8 | 5,119 | cxx | C++ | src/curl/Request.cxx | CM4all/libcommon | fba0eae725b0e7a6cf93ff0be231d90e2c0aa04e | [
"BSD-2-Clause"
] | 13 | 2017-06-30T15:38:21.000Z | 2022-03-11T06:49:17.000Z | src/curl/Request.cxx | CM4all/libcommon | fba0eae725b0e7a6cf93ff0be231d90e2c0aa04e | [
"BSD-2-Clause"
] | 2 | 2017-10-29T18:28:28.000Z | 2020-08-20T00:43:21.000Z | src/curl/Request.cxx | CM4all/libcommon | fba0eae725b0e7a6cf93ff0be231d90e2c0aa04e | [
"BSD-2-Clause"
] | 6 | 2017-10-29T11:38:13.000Z | 2021-10-12T00:36:38.000Z | /*
* Copyright 2008-2021 Max Kellermann <max.kellermann@gmail.com>
*
* 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 co... | 20.808943 | 78 | 0.714202 | CM4all |
cf197e0fc95906c485da135c45136ca4783a1cd7 | 3,272 | cpp | C++ | src/script/scriptlistingdialog.cpp | nilsding/IrrerrC | 0ff273e96c7a2f731ae23e17c9d58b872db14ebc | [
"BSD-2-Clause"
] | 1 | 2016-06-14T14:21:27.000Z | 2016-06-14T14:21:27.000Z | src/script/scriptlistingdialog.cpp | nilsding/IrrerrC | 0ff273e96c7a2f731ae23e17c9d58b872db14ebc | [
"BSD-2-Clause"
] | null | null | null | src/script/scriptlistingdialog.cpp | nilsding/IrrerrC | 0ff273e96c7a2f731ae23e17c9d58b872db14ebc | [
"BSD-2-Clause"
] | null | null | null | #include "scriptlistingdialog.h"
#include "ui_scriptlistingdialog.h"
ScriptListingDialog::ScriptListingDialog(QWidget *parent) :
QDialog(parent),
_ui(new Ui::ScriptListingDialog),
_scriptDirModel(new QFileSystemModel), _currentScript(0)
{
_scriptDir = QFileInfo(_SETTINGS.fileName()).absolutePath() + "/... | 32.72 | 112 | 0.654951 | nilsding |
cf19d1a9499b20b8b71a2f80ec54d258e801780e | 3,505 | cpp | C++ | src/wbdl/wbdl.cpp | DAlexis/wb-display-lib | 67317051282d69904774d10553c33ed6c2dedb56 | [
"MIT"
] | null | null | null | src/wbdl/wbdl.cpp | DAlexis/wb-display-lib | 67317051282d69904774d10553c33ed6c2dedb56 | [
"MIT"
] | null | null | null | src/wbdl/wbdl.cpp | DAlexis/wb-display-lib | 67317051282d69904774d10553c33ed6c2dedb56 | [
"MIT"
] | null | null | null | #include "wbdl.hpp"
#include <algorithm>
using namespace wbdl;
//////////////////////////
// FrameBuffer
void FrameBuffer::clearDirty()
{
dirtyX0 = 0;
dirtyY0 = 0;
dirtyX1 = 0;
dirtyY1 = 0;
}
bool FrameBuffer::isDirty()
{
return dirtyX0 != dirtyX1;
}
unsigned int FrameBuffer::bufferSize()
{
return width * ... | 17.26601 | 75 | 0.580884 | DAlexis |
cf224860179885ffaa17a8ab974eef5da9fd7ae7 | 1,625 | hpp | C++ | third_party/boost/simd/detail/dispatch/property_of.hpp | SylvainCorlay/pythran | 908ec070d837baf77d828d01c3e35e2f4bfa2bfa | [
"BSD-3-Clause"
] | 6 | 2018-02-25T22:23:33.000Z | 2021-01-15T15:13:12.000Z | third_party/boost/simd/detail/dispatch/property_of.hpp | SylvainCorlay/pythran | 908ec070d837baf77d828d01c3e35e2f4bfa2bfa | [
"BSD-3-Clause"
] | null | null | null | third_party/boost/simd/detail/dispatch/property_of.hpp | SylvainCorlay/pythran | 908ec070d837baf77d828d01c3e35e2f4bfa2bfa | [
"BSD-3-Clause"
] | 7 | 2017-12-12T12:36:31.000Z | 2020-02-10T14:27:07.000Z | //==================================================================================================
/*!
@file
Defines the property_of meta-function
@copyright 2016 NumScale SAS
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_... | 30.092593 | 100 | 0.651077 | SylvainCorlay |
cf23785fa10c5955c4187c84d5583a29b1301d3d | 577 | cpp | C++ | demos/glyph_paint/side_pane.cpp | RyanDraves/CPPurses | 19cbdae2d18e702144659187ec989c486c714a0f | [
"MIT"
] | null | null | null | demos/glyph_paint/side_pane.cpp | RyanDraves/CPPurses | 19cbdae2d18e702144659187ec989c486c714a0f | [
"MIT"
] | null | null | null | demos/glyph_paint/side_pane.cpp | RyanDraves/CPPurses | 19cbdae2d18e702144659187ec989c486c714a0f | [
"MIT"
] | null | null | null | #include "side_pane.hpp"
#include <cppurses/painter/color.hpp>
#include <cppurses/painter/glyph.hpp>
#include <cppurses/widget/widgets/text_display.hpp>
using namespace cppurses;
namespace demos {
namespace glyph_paint {
Side_pane::Side_pane() {
this->width_policy.fixed(16);
space1.wallpaper = L'─';
sp... | 22.192308 | 51 | 0.734835 | RyanDraves |
cf240458e3e47526197c6cf80111a9ad1882045f | 17,299 | hpp | C++ | bluetoe/attribute_handle.hpp | TorstenRobitzki/bluetoe | 0f04ccefa4e9ba6a89bf4dfaa0dd62b8e3a46043 | [
"MIT"
] | 138 | 2015-04-11T12:07:19.000Z | 2022-02-11T13:22:36.000Z | bluetoe/attribute_handle.hpp | TorstenRobitzki/bluetoe | 0f04ccefa4e9ba6a89bf4dfaa0dd62b8e3a46043 | [
"MIT"
] | 60 | 2015-08-29T12:32:56.000Z | 2022-03-25T07:20:21.000Z | bluetoe/attribute_handle.hpp | TorstenRobitzki/bluetoe | 0f04ccefa4e9ba6a89bf4dfaa0dd62b8e3a46043 | [
"MIT"
] | 34 | 2015-07-08T22:06:25.000Z | 2021-12-15T13:17:42.000Z | #ifndef BLUETOE_ATTRIBUTE_HANDLE_HPP
#define BLUETOE_ATTRIBUTE_HANDLE_HPP
#include <bluetoe/meta_types.hpp>
#include <bluetoe/meta_tools.hpp>
#include <cstdint>
#include <cstdlib>
#include <cassert>
#include <algorithm>
namespace bluetoe {
namespace details {
struct attribute_handle_meta_type {};
... | 45.643799 | 163 | 0.637493 | TorstenRobitzki |
cf25e5c06c8f4264e5dd840483da443534068a07 | 1,402 | cpp | C++ | earth_enterprise/src/third_party/sgl/v0_8_6/src/SkScan.cpp | ezeeyahoo/earthenterprise | b6cac9e6228946f2f17d1edb75e118aeb3e8e8c9 | [
"Apache-2.0"
] | 2,661 | 2017-03-20T22:12:50.000Z | 2022-03-30T09:43:19.000Z | earth_enterprise/src/third_party/sgl/v0_8_6/src/SkScan.cpp | ezeeyahoo/earthenterprise | b6cac9e6228946f2f17d1edb75e118aeb3e8e8c9 | [
"Apache-2.0"
] | 1,531 | 2017-03-24T17:20:32.000Z | 2022-03-16T18:11:14.000Z | earth_enterprise/src/third_party/sgl/v0_8_6/src/SkScan.cpp | ezeeyahoo/earthenterprise | b6cac9e6228946f2f17d1edb75e118aeb3e8e8c9 | [
"Apache-2.0"
] | 990 | 2017-03-24T11:54:28.000Z | 2022-03-22T11:51:47.000Z | /* libs/graphics/sgl/SkScan.cpp
**
** Copyright 2006, Google Inc.
**
** Licensed under the Apache License, Version 2.0 (the "License");
** you may not use this file except in compliance with the License.
** You may obtain a copy of the License at
**
** http://www.apache.org/licenses/LICENSE-2.0
**
** Unless req... | 28.04 | 85 | 0.621969 | ezeeyahoo |
cf26279b7f8fdff66c5b19b3d7b123f0c179dccd | 739 | cpp | C++ | algorithms/implementation/AppendAndDelete.cpp | HannoFlohr/hackerrank | 9644c78ce05a6b1bc5d8f542966781d53e5366e3 | [
"MIT"
] | null | null | null | algorithms/implementation/AppendAndDelete.cpp | HannoFlohr/hackerrank | 9644c78ce05a6b1bc5d8f542966781d53e5366e3 | [
"MIT"
] | null | null | null | algorithms/implementation/AppendAndDelete.cpp | HannoFlohr/hackerrank | 9644c78ce05a6b1bc5d8f542966781d53e5366e3 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
string appendAndDelete(string s, string t, int k) {
if(s==t) return "Yes";
int i=0;
while(s[i]==t[i]) i++;
if( ( s.length()+t.length()-2*i ) > k )
return "No";
else if( (s.length()+t.length()-2*i) % 2 == k%2 )
return "Yes";
else ... | 17.595238 | 56 | 0.515562 | HannoFlohr |
cf2697dcaaf5af85590c4600fd4bfac32c9c4d7e | 549 | cpp | C++ | leetcode/easy/Add_Digits.cpp | HoussemBousmaha/Competitive-Programming | c4530fc01d8933bdfefec7fb6d31cd648e760334 | [
"MIT"
] | 6 | 2022-03-02T23:08:00.000Z | 2022-03-07T07:26:48.000Z | leetcode/easy/Add_Digits.cpp | HoussemBousmaha/Competitive-Programming | c4530fc01d8933bdfefec7fb6d31cd648e760334 | [
"MIT"
] | null | null | null | leetcode/easy/Add_Digits.cpp | HoussemBousmaha/Competitive-Programming | c4530fc01d8933bdfefec7fb6d31cd648e760334 | [
"MIT"
] | null | null | null | class Solution
{
public:
// int add_digits(int n) {
// int ans = 0;
// int k;
// while (n != 0) {
// k = n % 10;
// ans += k;
// n /= 10;
// }
// return ans;
// }
int addDigits(int n)
{
... | 18.931034 | 42 | 0.256831 | HoussemBousmaha |
cf293d85b523041d2dfca0b8c7c7fa252e3fac76 | 469 | cpp | C++ | no3.cpp | bigdaddyjeff/JeffreyCSC102 | dbdcbc50634b23ce7973c71329f4fdd2d3964927 | [
"MIT"
] | null | null | null | no3.cpp | bigdaddyjeff/JeffreyCSC102 | dbdcbc50634b23ce7973c71329f4fdd2d3964927 | [
"MIT"
] | null | null | null | no3.cpp | bigdaddyjeff/JeffreyCSC102 | dbdcbc50634b23ce7973c71329f4fdd2d3964927 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main()
{
int var = 789;
int *ptr2;
int **ptr1;
ptr2 = &var;
ptr1 = &ptr2;
cout << "The value of var = "<< var << endl;
cout << "Content value of single pointer ptr2 = " << *ptr2 << endl;
cout << "address value of single pointer ptr2 = " << ptr2 << e... | 27.588235 | 71 | 0.58209 | bigdaddyjeff |
cf2a28aa2539b4286c59835f605a6abdd6eda519 | 18,747 | cpp | C++ | IP/IMap.cpp | bharat-varma/Software-Engineering | 36cdff296010e1076fb440707bfb2424110308ca | [
"Apache-2.0"
] | null | null | null | IP/IMap.cpp | bharat-varma/Software-Engineering | 36cdff296010e1076fb440707bfb2424110308ca | [
"Apache-2.0"
] | 3 | 2017-12-09T03:16:32.000Z | 2017-12-15T04:22:08.000Z | IP/IMap.cpp | bharat-varma/Software-Engineering | 36cdff296010e1076fb440707bfb2424110308ca | [
"Apache-2.0"
] | 1 | 2017-09-19T00:28:47.000Z | 2017-09-19T00:28:47.000Z | #include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <stack>
#include <cmath>
using namespace std;
class IntMap {
public:
static const long serialVersionUID = 1L;
static const int FREE_KEY = 0;
static const int NO_VALUE = 0;
/** Keys and values */
vector<in... | 22.081272 | 134 | 0.53886 | bharat-varma |
cf2eed74523c5d43661f04cba155aa1d24e3eba1 | 45,612 | cpp | C++ | stlsoft/samples/whereis/whereis.cpp | masscry/dmc | c7638f7c524a65bc2af0876c76621d8a11da42bb | [
"BSL-1.0"
] | 86 | 2018-05-24T12:03:44.000Z | 2022-03-13T03:01:25.000Z | stlsoft/samples/whereis/whereis.cpp | masscry/dmc | c7638f7c524a65bc2af0876c76621d8a11da42bb | [
"BSL-1.0"
] | 1 | 2019-05-30T01:38:40.000Z | 2019-10-26T07:15:01.000Z | stlsoft/samples/whereis/whereis.cpp | masscry/dmc | c7638f7c524a65bc2af0876c76621d8a11da42bb | [
"BSL-1.0"
] | 14 | 2018-07-16T08:29:12.000Z | 2021-08-23T06:21:30.000Z | /* /////////////////////////////////////////////////////////////////////////////
* File: whereis.cpp
*
* Purpose: Implementation file for the Synesis Software whereis utility
*
* Created: 19th January 1996
* Updated: 16th August 2004
*
* Author: Matthew Wilson, Synesis Software P... | 31.829728 | 215 | 0.562001 | masscry |
cf33b92f91390297175f9db1e773eeda011fd2dc | 1,461 | cpp | C++ | Progs/Ch05/Referst.cpp | singhnir/C-Plus-Plus-Robert-Lafore | 7ce3c92d15958e157484fc989632b879360103aa | [
"MIT"
] | 4 | 2021-02-24T06:53:51.000Z | 2022-02-18T11:15:19.000Z | Progs/Ch05/Referst.cpp | singhnir/C-Plus-Plus-Robert-Lafore | 7ce3c92d15958e157484fc989632b879360103aa | [
"MIT"
] | null | null | null | Progs/Ch05/Referst.cpp | singhnir/C-Plus-Plus-Robert-Lafore | 7ce3c92d15958e157484fc989632b879360103aa | [
"MIT"
] | 4 | 2021-02-24T07:05:43.000Z | 2022-03-09T17:45:32.000Z | // referst.cpp
// demonstrates passing structure by reference
#include <iostream>
using namespace std;
////////////////////////////////////////////////////////////////
struct Distance //English distance
{
int feet;
float inches;
};
////////////////////////////////////////////... | 31.085106 | 65 | 0.450376 | singhnir |
cf3b5ad84e6ad780c89f9600ea72d405d86631b9 | 738 | cpp | C++ | src/QtGadgets/Validators/nRegExpValidator.cpp | Vladimir-Lin/QtGadgets | 5fcea23ca95d85088d68fa64996e16281549ec3c | [
"MIT"
] | null | null | null | src/QtGadgets/Validators/nRegExpValidator.cpp | Vladimir-Lin/QtGadgets | 5fcea23ca95d85088d68fa64996e16281549ec3c | [
"MIT"
] | null | null | null | src/QtGadgets/Validators/nRegExpValidator.cpp | Vladimir-Lin/QtGadgets | 5fcea23ca95d85088d68fa64996e16281549ec3c | [
"MIT"
] | null | null | null | #include <qtgadgets.h>
N::RegExpValidator:: RegExpValidator ( QObject * parent )
: QRegExpValidator ( parent )
, Validator ( parent )
{
}
N::RegExpValidator::~RegExpValidator (void)
{
}
int N::RegExpValidator::Type(void) const
{
return 1102 ;
}
voi... | 19.945946 | 78 | 0.658537 | Vladimir-Lin |
cf3d9a79062dafd4f1fe432932c9b68a30ce0998 | 1,097 | cpp | C++ | c++/primer_plus_s_pratt/ch_9/pr_ex4/sales.cpp | dinimar/Projects | 7606c23c4e55d6f0c03692b4a1d2bb5b42f10992 | [
"MIT"
] | null | null | null | c++/primer_plus_s_pratt/ch_9/pr_ex4/sales.cpp | dinimar/Projects | 7606c23c4e55d6f0c03692b4a1d2bb5b42f10992 | [
"MIT"
] | null | null | null | c++/primer_plus_s_pratt/ch_9/pr_ex4/sales.cpp | dinimar/Projects | 7606c23c4e55d6f0c03692b4a1d2bb5b42f10992 | [
"MIT"
] | null | null | null | #ifndef SALES_H
#define SALES_H
#include "sales.h"
#endif
#include <iostream>
using namespace std;
namespace SALES
{
void setSales(Sales &s, const double ar[], int n)
{
int count = 0;
double max, min, ave = ar[0];
for(int i=0;i<n and i<QUARTERS;++i)
{
s.sales[i] = ar[i];
count++;
if(max < ar[i])... | 15.671429 | 50 | 0.52051 | dinimar |
cf3dac6ef0e6d5ca630943ed95d601a3080002e5 | 2,746 | cpp | C++ | src/Kepler3rdLaw.cpp | wstern1234/CPP-Projects | e8712171355b7a833f8a63ce0ffa49dcca10b053 | [
"MIT"
] | null | null | null | src/Kepler3rdLaw.cpp | wstern1234/CPP-Projects | e8712171355b7a833f8a63ce0ffa49dcca10b053 | [
"MIT"
] | null | null | null | src/Kepler3rdLaw.cpp | wstern1234/CPP-Projects | e8712171355b7a833f8a63ce0ffa49dcca10b053 | [
"MIT"
] | null | null | null | // Identification comments code block
// Wills Stern
// Kepler's 3rd Law
// Editor(s) used: VS Code
// Compiler(s) used: g++
#include <iostream>
using std::cout;
using std::cin;
#include <string>
using std::string;
using std::endl;
#include <cctype> // for toupper
#include <cstdlib> // for atof
#include <cmath> //... | 22.145161 | 75 | 0.550255 | wstern1234 |
cf3e39d26b98da0c54f6d62a7faae7c489feb69d | 17,443 | hpp | C++ | tests/unit/coherence/util/CircularArrayListTest.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-01T21:38:30.000Z | 2021-11-03T01:35:11.000Z | tests/unit/coherence/util/CircularArrayListTest.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 1 | 2020-07-24T17:29:22.000Z | 2020-07-24T18:29:04.000Z | tests/unit/coherence/util/CircularArrayListTest.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-10T18:40:58.000Z | 2022-02-18T01:23:40.000Z | /*
* Copyright (c) 2000, 2020, Oracle and/or its affiliates.
*
* Licensed under the Universal Permissive License v 1.0 as shown at
* http://oss.oracle.com/licenses/upl.
*/
#include "cxxtest/TestSuite.h"
#include "coherence/lang.ns"
#include "coherence/util/CircularArrayList.hpp"
#include "private/coherence/util/l... | 32.301852 | 98 | 0.480193 | chpatel3 |
cf54a1975be0c92f61cc83bc42ca252674bcfe2f | 18,260 | cpp | C++ | src/SystemConfigurator/CSPs/DiagnosticLogCSP.cpp | mehrdad-shokri/iot-core-azure-dm-client | 09c203f158c5f66a5bd2e508a7d50ac2e1372b89 | [
"MIT"
] | 52 | 2017-05-02T09:43:39.000Z | 2021-11-11T18:32:46.000Z | src/SystemConfigurator/CSPs/DiagnosticLogCSP.cpp | mehrdad-shokri/iot-core-azure-dm-client | 09c203f158c5f66a5bd2e508a7d50ac2e1372b89 | [
"MIT"
] | 161 | 2017-04-07T19:04:26.000Z | 2020-09-21T12:42:22.000Z | src/SystemConfigurator/CSPs/DiagnosticLogCSP.cpp | mehrdad-shokri/iot-core-azure-dm-client | 09c203f158c5f66a5bd2e508a7d50ac2e1372b89 | [
"MIT"
] | 67 | 2017-03-31T00:33:02.000Z | 2021-03-06T00:34:33.000Z | /*
Copyright 2017 Microsoft
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, publish, distribute, sublicense... | 41.033708 | 196 | 0.648028 | mehrdad-shokri |
cf54ff4ccd37abfe5c66d8b83cbe74fcf6f7a80b | 24,755 | cpp | C++ | src/test_infNaN_iamax.cpp | tlapack/testBLAS | dd63ade035880783cd55a8032c13a6d8e85dc490 | [
"BSD-3-Clause"
] | null | null | null | src/test_infNaN_iamax.cpp | tlapack/testBLAS | dd63ade035880783cd55a8032c13a6d8e85dc490 | [
"BSD-3-Clause"
] | null | null | null | src/test_infNaN_iamax.cpp | tlapack/testBLAS | dd63ade035880783cd55a8032c13a6d8e85dc490 | [
"BSD-3-Clause"
] | 1 | 2021-06-28T21:13:49.000Z | 2021-06-28T21:13:49.000Z | /// @file test_infNaN_iamax.cpp
/// @brief Test cases for iamax with NaNs, Infs and the overflow threshold (OV).
//
// Copyright (c) 2021, University of Colorado Denver. All rights reserved.
//
// This file is part of testBLAS.
// testBLAS is free software: you can redistribute it and/or modify it under
// the terms of... | 32.317232 | 103 | 0.428277 | tlapack |
cf572f7d6c43f4e28dbc736337834fbc72e648fd | 5,679 | cpp | C++ | src/visitors/interp_visitor.cpp | ut-amrl/pips | 1f553dc850f8c27a460f020d91b35c8a18c479bb | [
"MIT"
] | null | null | null | src/visitors/interp_visitor.cpp | ut-amrl/pips | 1f553dc850f8c27a460f020d91b35c8a18c479bb | [
"MIT"
] | null | null | null | src/visitors/interp_visitor.cpp | ut-amrl/pips | 1f553dc850f8c27a460f020d91b35c8a18c479bb | [
"MIT"
] | null | null | null | #include "interp_visitor.hpp"
#include <eigen3/Eigen/Core> // Vector2f
#include <iostream> // cout, endl
#include <memory> // make_shared
#include <stdexcept> // invalid_argument
#include <string> // string
#include "ast/library_functions.hpp"
using Eigen::Vector2f;
using ... | 30.368984 | 78 | 0.61296 | ut-amrl |
cf587e787585f40839ca0cc1592ee6b659a8b0d8 | 6,200 | cpp | C++ | pnwtl/optionscontrols.cpp | Adept-Space/pn | d722f408cf3c3b8d0b8028846c0199969b6a103c | [
"BSD-3-Clause"
] | null | null | null | pnwtl/optionscontrols.cpp | Adept-Space/pn | d722f408cf3c3b8d0b8028846c0199969b6a103c | [
"BSD-3-Clause"
] | null | null | null | pnwtl/optionscontrols.cpp | Adept-Space/pn | d722f408cf3c3b8d0b8028846c0199969b6a103c | [
"BSD-3-Clause"
] | null | null | null | /**
* @file optionscontrols.cpp
* @brief Controls for options dialogs (and the like).
* @author Simon Steele
* @note Copyright (c) 2002-2011 Simon Steele - http://untidy.net/
*
* Programmer's Notepad 2 : The license file (license.[txt|html]) describes
* the conditions under which this source may be modified / d... | 22.463768 | 144 | 0.647742 | Adept-Space |
cf614dcba15e8f5442b2aedba5196ab8203bf185 | 2,744 | cpp | C++ | cpp/tests/tdmaMsgProcessor_UT.cpp | MinesJA/meshNetwork | 5ffada57c13049cb00c2996fe239cdff6edf6f17 | [
"NASA-1.3"
] | 133 | 2017-06-24T02:44:28.000Z | 2022-03-25T05:17:00.000Z | cpp/tests/tdmaMsgProcessor_UT.cpp | MinesJA/meshNetwork | 5ffada57c13049cb00c2996fe239cdff6edf6f17 | [
"NASA-1.3"
] | null | null | null | cpp/tests/tdmaMsgProcessor_UT.cpp | MinesJA/meshNetwork | 5ffada57c13049cb00c2996fe239cdff6edf6f17 | [
"NASA-1.3"
] | 33 | 2017-06-19T03:24:40.000Z | 2022-02-03T20:13:12.000Z | #include "tests/tdmaMsgProcessor_UT.hpp"
#include "comm/tdmaCmds.hpp"
#include "comm/tdmaComm.hpp"
#include "comm/cmdHeader.hpp"
#include "comm/commands.hpp"
#include "node/nodeParams.hpp"
#include "node/nodeState.hpp"
#include <gtest/gtest.h>
#include <cmath>
#include <unistd.h>
using std::vector;
namespace {
}
na... | 33.876543 | 134 | 0.673105 | MinesJA |
cf6521d38e5984acfd1d3a5a8a35309c09d30c38 | 1,545 | cc | C++ | Codeforces/BubbleCup/Problem H/H.cc | VastoLorde95/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | 170 | 2017-07-25T14:47:29.000Z | 2022-01-26T19:16:31.000Z | Codeforces/BubbleCup/Problem H/H.cc | navodit15/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | null | null | null | Codeforces/BubbleCup/Problem H/H.cc | navodit15/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | 55 | 2017-07-28T06:17:33.000Z | 2021-10-31T03:06:22.000Z | #include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <stack>
#define sd(x) scanf("%d",&x)
#define sd2(x,y) scanf("%d%d",&x,&y)
#define sd3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define fi f... | 21.458333 | 79 | 0.551456 | VastoLorde95 |