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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0990339c64ebefc901f893046071560a5b582f30 | 3,909 | cpp | C++ | LeetCode/C++/559. Maximum Depth of N-ary Tree.cpp | shreejitverma/GeeksforGeeks | d7bcb166369fffa9a031a258e925b6aff8d44e6c | [
"MIT"
] | 2 | 2022-02-18T05:14:28.000Z | 2022-03-08T07:00:08.000Z | LeetCode/C++/559. Maximum Depth of N-ary Tree.cpp | shivaniverma1/Competitive-Programming-1 | d7bcb166369fffa9a031a258e925b6aff8d44e6c | [
"MIT"
] | 6 | 2022-01-13T04:31:04.000Z | 2022-03-12T01:06:16.000Z | LeetCode/C++/559. Maximum Depth of N-ary Tree.cpp | shivaniverma1/Competitive-Programming-1 | d7bcb166369fffa9a031a258e925b6aff8d44e6c | [
"MIT"
] | 2 | 2022-02-14T19:53:53.000Z | 2022-02-18T05:14:30.000Z | /**
Given a n-ary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
For example, given a 3-ary tree:
We should return its max depth, which is 3.
Note:
The depth of the tree is at most 1000.
The total number of nodes is a... | 23.407186 | 116 | 0.61627 | shreejitverma |
0995fe279f06b8839dcfdc735d9afb8c2abeb8d0 | 301 | cpp | C++ | codes/c++/69.cpp | YuanweiZHANG/Leetcode | 14a083528431bc65ada8f8265a5ef9d0fae40ecd | [
"MIT"
] | null | null | null | codes/c++/69.cpp | YuanweiZHANG/Leetcode | 14a083528431bc65ada8f8265a5ef9d0fae40ecd | [
"MIT"
] | null | null | null | codes/c++/69.cpp | YuanweiZHANG/Leetcode | 14a083528431bc65ada8f8265a5ef9d0fae40ecd | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
/**
* 2020-04-10
* Veronica
*/
class Solution {
public:
int mySqrt(int x) {
long long i = 1;
while (i*i <= x) {
i++;
}
return i - 1;
}
};
int main() {
Solution solution;
int x = 2147395600;
cout << solution.mySqrt(x) << endl;
return 0;
}
| 10.75 | 36 | 0.578073 | YuanweiZHANG |
0996383b2b88759b58df9b577ec4ef20be894605 | 883 | hpp | C++ | src/Core/Scenes/NetplayCharacterSelect.hpp | Gegel85/SoFGV | 695fc83791a01c777f7b94576bb687237b2c21ac | [
"MIT"
] | null | null | null | src/Core/Scenes/NetplayCharacterSelect.hpp | Gegel85/SoFGV | 695fc83791a01c777f7b94576bb687237b2c21ac | [
"MIT"
] | null | null | null | src/Core/Scenes/NetplayCharacterSelect.hpp | Gegel85/SoFGV | 695fc83791a01c777f7b94576bb687237b2c21ac | [
"MIT"
] | 1 | 2022-02-19T02:38:40.000Z | 2022-02-19T02:38:40.000Z | //
// Created by Gegel85 on 07/02/2022.
//
#ifndef BATTLE_NETPLAYCHARACTERSELECT_HPP
#define BATTLE_NETPLAYCHARACTERSELECT_HPP
#include "CharacterSelect.hpp"
#include "NetplayScene.hpp"
namespace SpiralOfFate
{
class NetplayCharacterSelect : public CharacterSelect, public NetplayScene {
private:
#pragma pack(push... | 19.195652 | 77 | 0.746319 | Gegel85 |
09980aeac67f7a1a8528444b824a41170a25512d | 584 | cpp | C++ | source/Animation.cpp | GoldenBunny/Millibox | 34fcd59bd1e5c1a97c1058032aefba0b11d8e48a | [
"MIT"
] | 1 | 2017-12-15T01:14:06.000Z | 2017-12-15T01:14:06.000Z | source/Animation.cpp | GoldenBunny/Millibox | 34fcd59bd1e5c1a97c1058032aefba0b11d8e48a | [
"MIT"
] | null | null | null | source/Animation.cpp | GoldenBunny/Millibox | 34fcd59bd1e5c1a97c1058032aefba0b11d8e48a | [
"MIT"
] | null | null | null | #include"Animation.h"
AnimationID animationGetID() {
static AnimationID id = 0;
return id++;
}
Animation::Animation() {
id_ = animationGetID();
}
Animation::~Animation() {
}
void Animation::update() {
}
void Animation::render() {
}
void Animation::setFrame(Frame& frame) {
currentFrame_ = &frame;
}
Frame& An... | 16.222222 | 60 | 0.703767 | GoldenBunny |
0999d0168753ba7c55d45a97979d1868f368ffaa | 426 | hxx | C++ | inc/html5xx.d/Th.hxx | astrorigin/html5xx | cbaaeb232597a713630df7425752051036cf0cb2 | [
"MIT"
] | null | null | null | inc/html5xx.d/Th.hxx | astrorigin/html5xx | cbaaeb232597a713630df7425752051036cf0cb2 | [
"MIT"
] | null | null | null | inc/html5xx.d/Th.hxx | astrorigin/html5xx | cbaaeb232597a713630df7425752051036cf0cb2 | [
"MIT"
] | null | null | null | /*
*
*/
#ifndef _HTML5XX_TH_HXX_
#define _HTML5XX_TH_HXX_
#include "Element.hxx"
#include "LineElement.hxx"
using namespace std;
namespace html
{
class Th: public Element
{
public:
Th():
Element(InlineBlock, "th")
{}
Th( const string& text ):
Element(InlineBlock, "th")
{
put(new LineElement... | 11.513514 | 34 | 0.643192 | astrorigin |
099ac66307ebad5646ad1a6c96e5befc8730a2d5 | 904 | cpp | C++ | 55_Jump_Game.cpp | AvadheshChamola/LeetCode | b0edabfa798c4e204b015f4c367bfc5acfbd8277 | [
"MIT"
] | null | null | null | 55_Jump_Game.cpp | AvadheshChamola/LeetCode | b0edabfa798c4e204b015f4c367bfc5acfbd8277 | [
"MIT"
] | null | null | null | 55_Jump_Game.cpp | AvadheshChamola/LeetCode | b0edabfa798c4e204b015f4c367bfc5acfbd8277 | [
"MIT"
] | null | null | null | /*
55. Jump Game
Medium
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
Return true if you can reach the last index, or false otherwise.
Example 1:
Input: nums = [2,3,1,1,4]
Output: t... | 21.52381 | 177 | 0.651549 | AvadheshChamola |
099ca926ae8826321fdccd4b02250d97515e334d | 2,045 | cpp | C++ | backtracking/leetcode_backtracking/palindrome_permutation_2.cpp | Hadleyhzy/data_structure_and_algorithm | 0e610ba78dcb216323d9434a0f182756780ce5c0 | [
"MIT"
] | 1 | 2020-10-12T19:18:19.000Z | 2020-10-12T19:18:19.000Z | backtracking/leetcode_backtracking/palindrome_permutation_2.cpp | Hadleyhzy/data_structure_and_algorithm | 0e610ba78dcb216323d9434a0f182756780ce5c0 | [
"MIT"
] | null | null | null | backtracking/leetcode_backtracking/palindrome_permutation_2.cpp | Hadleyhzy/data_structure_and_algorithm | 0e610ba78dcb216323d9434a0f182756780ce5c0 | [
"MIT"
] | 1 | 2020-10-12T19:18:04.000Z | 2020-10-12T19:18:04.000Z | //
// palindrome_permutation_2.cpp
// leetcode_backtracking
//
// Created by Hadley on 24.08.20.
// Copyright © 2020 Hadley. All rights reserved.
//
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <stack>
#include <cstring>
#include ... | 24.638554 | 81 | 0.476284 | Hadleyhzy |
09a171be83c094ec30e3aedd37d69703e5f1102c | 4,202 | hpp | C++ | src/logistic_sim/include/OnlineDCOPTaskPlanner.hpp | Astuxx/RMAPD | 4d1c5f5d2e1ffa56094bbe79f818a536d0a48d52 | [
"Apache-2.0"
] | 2 | 2021-11-14T13:55:42.000Z | 2022-03-30T03:22:40.000Z | src/logistic_sim/include/OnlineDCOPTaskPlanner.hpp | Astuxx/RMAPD | 4d1c5f5d2e1ffa56094bbe79f818a536d0a48d52 | [
"Apache-2.0"
] | 5 | 2020-05-13T17:09:36.000Z | 2020-06-11T17:02:21.000Z | src/logistic_sim/include/OnlineDCOPTaskPlanner.hpp | antonellocontini/LogisticAgent | 5686bdd76462b6a0144d29295d449b29b76a8966 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "OnlineTaskPlanner.hpp"
#include "logistic_sim/ChangeEdge.h"
namespace onlinedcoptaskplanner
{
struct edge_modification_plan
{
uint from;
uint to;
uint timestep;
int type; //1 == removal, 0 == addition
const static int REMOVAL = 1;
const static int ADDITION = 0;
};
class OnlineDCOP... | 45.673913 | 161 | 0.672061 | Astuxx |
09a1c55dc56ad71a07481fd15512f7bc4c82f07c | 246 | cpp | C++ | GroupLab04/source/RegEmp.cpp | PAPADOXIE/OOP | 01f06243d404bf18a003b84cff177f498e057252 | [
"MIT"
] | null | null | null | GroupLab04/source/RegEmp.cpp | PAPADOXIE/OOP | 01f06243d404bf18a003b84cff177f498e057252 | [
"MIT"
] | null | null | null | GroupLab04/source/RegEmp.cpp | PAPADOXIE/OOP | 01f06243d404bf18a003b84cff177f498e057252 | [
"MIT"
] | null | null | null | #include "../include/RegEmp.h"
RegEmp::RegEmp(std::string fName, std::string sName, int salary, int addHours) :
Employee(fName, sName, salary)
{
this->addHours = addHours;
}
int RegEmp::calcSal()
{
return (addHours * 100) + salary;
}
| 17.571429 | 81 | 0.666667 | PAPADOXIE |
09a4a4443b0c7a13047d459f5642b11aa145f8f6 | 1,654 | hpp | C++ | include/axl.gl/gfx/texture/Texture.hpp | Defalt8/axl.gl | 0028bcad1a86b048831e5fd61a436663fd38a763 | [
"MIT"
] | 6 | 2020-11-20T08:29:33.000Z | 2021-12-13T14:41:52.000Z | include/axl.gl/gfx/texture/Texture.hpp | Defalt8/axl.gl | 0028bcad1a86b048831e5fd61a436663fd38a763 | [
"MIT"
] | null | null | null | include/axl.gl/gfx/texture/Texture.hpp | Defalt8/axl.gl | 0028bcad1a86b048831e5fd61a436663fd38a763 | [
"MIT"
] | null | null | null | #pragma once
#include "../../lib.hpp"
#include "../../ContextObject.hpp"
#include <axl.glfl/gl.hpp>
#include <axl.math/vec/Vec2i.hpp>
namespace axl {
namespace gl {
namespace gfx {
class AXLGLCXXAPI Texture : public ContextObject
{
public:
enum class Type { TT_1D = 1, TT_2D = 2, TT_3D = 3 };
public:
Texture(ax... | 36.755556 | 115 | 0.697703 | Defalt8 |
09a4c0c0325b8991137daf61041a995f1da1ae41 | 3,118 | hpp | C++ | src/cg.hpp | spinicist/riesling | fa98ef1380345aa47d57ba91c970f37fe8fc5405 | [
"MIT"
] | 14 | 2021-02-08T21:28:37.000Z | 2022-03-16T08:08:50.000Z | src/cg.hpp | spinicist/riesling | fa98ef1380345aa47d57ba91c970f37fe8fc5405 | [
"MIT"
] | 29 | 2021-02-19T11:59:33.000Z | 2022-02-24T20:45:57.000Z | src/cg.hpp | spinicist/riesling | fa98ef1380345aa47d57ba91c970f37fe8fc5405 | [
"MIT"
] | 3 | 2021-07-29T14:54:25.000Z | 2022-01-14T10:59:05.000Z | #pragma once
#include "log.h"
#include "tensorOps.h"
#include "threads.h"
#include "types.h"
/* Conjugate gradients as described in K. P. Pruessmann, M. Weiger, M. B. Scheidegger, and P.
* Boesiger, ‘SENSE: Sensitivity encoding for fast MRI’, Magnetic Resonance in Medicine, vol. 42,
* no. 5, pp. 952–962, 1999.
*/
... | 30.568627 | 97 | 0.603592 | spinicist |
09a705bb22d5d6b4b1e90882b1afa8d4d9e82d83 | 5,797 | cpp | C++ | dbms/src/Storages/DeltaMerge/ColumnFile/ColumnFile_V2.cpp | solotzg/tiflash | 66f45c76692e941bc845c01349ea89de0f2cc210 | [
"Apache-2.0"
] | 85 | 2022-03-25T09:03:16.000Z | 2022-03-25T09:45:03.000Z | dbms/src/Storages/DeltaMerge/ColumnFile/ColumnFile_V2.cpp | solotzg/tiflash | 66f45c76692e941bc845c01349ea89de0f2cc210 | [
"Apache-2.0"
] | 7 | 2022-03-25T08:59:10.000Z | 2022-03-25T09:40:13.000Z | dbms/src/Storages/DeltaMerge/ColumnFile/ColumnFile_V2.cpp | solotzg/tiflash | 66f45c76692e941bc845c01349ea89de0f2cc210 | [
"Apache-2.0"
] | 11 | 2022-03-25T09:15:36.000Z | 2022-03-25T09:45:07.000Z | // Copyright 2022 PingCAP, 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 applicable law or agreed to i... | 31.677596 | 112 | 0.661549 | solotzg |
09a8f94ff7fc25dae5fb4875da7d70ec2e24222c | 7,666 | cpp | C++ | shared-code/kICMP.cpp | MythicMadTesla/Pumpkin | 6e7e413ca364d79673e523c09767c18e7cff1bec | [
"MIT"
] | 6 | 2017-01-23T18:18:03.000Z | 2022-01-31T06:07:02.000Z | shared-code/kICMP.cpp | hacker/T42 | 025f8c9b1a478eed9dcb9e0ac13b9e26e955860a | [
"MIT"
] | null | null | null | shared-code/kICMP.cpp | hacker/T42 | 025f8c9b1a478eed9dcb9e0ac13b9e26e955860a | [
"MIT"
] | 3 | 2016-10-24T03:32:35.000Z | 2022-03-13T21:00:38.000Z | #include "../stdafx.h"
#include "kICMP.h"
CICMP::_mechanismus CICMP::m_mechanismus = CICMP::_icmpUndetermined;
BOOL CICMPDll::Initialize()
{
if(m_hICMP!=INVALID_HANDLE_VALUE || m_hICMPDLL)
Deinitialize();
m_hICMPDLL = ::LoadLibraryEx("ICMP",NULL,0);
if(!m_hICMPDLL)
return FALSE;
*(FARPROC*)&m_icmp... | 25.553333 | 76 | 0.67845 | MythicMadTesla |
09aa022aa668f3b3c590df2a4d7f0013c725b9c5 | 584 | cpp | C++ | Labs/Lab10/Apoio/NaoInicializado.cpp | JudsonSS/ProgComp | 6435c3e31a4b0715805feaf890223838161d11f0 | [
"MIT"
] | 11 | 2021-03-04T03:58:09.000Z | 2022-02-27T16:32:41.000Z | Labs/Lab10/Apoio/NaoInicializado.cpp | JudsonSS/ProgComp | 6435c3e31a4b0715805feaf890223838161d11f0 | [
"MIT"
] | null | null | null | Labs/Lab10/Apoio/NaoInicializado.cpp | JudsonSS/ProgComp | 6435c3e31a4b0715805feaf890223838161d11f0 | [
"MIT"
] | 7 | 2021-03-02T22:34:33.000Z | 2022-03-06T21:18:15.000Z | #include <iostream>
using namespace std;
int main()
{
int v[3]; // cria vetor de 3 elementos
cout << "Conteudo da posicao 0: " << v[0] << endl;
cout << "Conteudo da posicao 1: " << v[1] << endl;
cout << "Conteudo da posicao 2: " << v[2] << endl << endl;
v[0] = 0; v[1] = 0; v[2] = 0;
cout << "Conteudo da p... | 26.545455 | 59 | 0.532534 | JudsonSS |
09ac28c4ba8f62d1ccbf68ad5d6c2f9e6a895343 | 529 | cpp | C++ | Chapter-6-Functions/Review Questions and Exercises/Algorithm Workbench/35.cpp | jesushilarioh/C-Plus-Plus | bbff921460ac4267af48558f040c7d82ccf42d5e | [
"MIT"
] | 3 | 2019-10-28T01:12:46.000Z | 2021-10-16T09:16:31.000Z | Chapter-6-Functions/Review Questions and Exercises/Algorithm Workbench/35.cpp | jesushilarioh/C-Plus-Plus | bbff921460ac4267af48558f040c7d82ccf42d5e | [
"MIT"
] | null | null | null | Chapter-6-Functions/Review Questions and Exercises/Algorithm Workbench/35.cpp | jesushilarioh/C-Plus-Plus | bbff921460ac4267af48558f040c7d82ccf42d5e | [
"MIT"
] | 4 | 2020-04-10T17:22:17.000Z | 2021-11-04T14:34:00.000Z | /********************************************************************
*
* 35. Write a function named timesTen that accepts an argument.
* When the function is called, it should display the
* product of its argument multiplied times 10.
*
* Jesus Hilario Hernandez
* December 3, 2018
*
*************... | 21.16 | 69 | 0.476371 | jesushilarioh |
09b31ed6ee356e2285dfc520f19bfa01b8098bc9 | 1,996 | hh | C++ | modules/StarClassLibrary/StFastCircleFitter.hh | jdbrice/PicoToFemtoDst_SL16cMTD | 37865817043e9805fa299768eaba19491fc39dac | [
"MIT"
] | 2 | 2018-12-24T19:37:00.000Z | 2022-02-28T06:57:20.000Z | modules/StarClassLibrary/StFastCircleFitter.hh | jdbrice/PicoToFemtoDst_SL16cMTD | 37865817043e9805fa299768eaba19491fc39dac | [
"MIT"
] | null | null | null | modules/StarClassLibrary/StFastCircleFitter.hh | jdbrice/PicoToFemtoDst_SL16cMTD | 37865817043e9805fa299768eaba19491fc39dac | [
"MIT"
] | null | null | null | /***************************************************************************
*
* $Id: StFastCircleFitter.hh,v 1.1 1999/12/21 16:28:50 ullrich Exp $
*
* Author: Thomas Ullrich, Dec 1999
***************************************************************************
*
* Description:
*
* Fast fitting routine using a ... | 29.791045 | 76 | 0.553607 | jdbrice |
09bb578416867c3e8b94ff4658b03785186c763a | 11,683 | cpp | C++ | qabstractitemview_c.cpp | mariuszmaximus/qt5pas-aarch64-linux-gnu | c60bbcfa5b0d7c4fe18bb21e5f2f424a5b658c1b | [
"Apache-2.0"
] | null | null | null | qabstractitemview_c.cpp | mariuszmaximus/qt5pas-aarch64-linux-gnu | c60bbcfa5b0d7c4fe18bb21e5f2f424a5b658c1b | [
"Apache-2.0"
] | null | null | null | qabstractitemview_c.cpp | mariuszmaximus/qt5pas-aarch64-linux-gnu | c60bbcfa5b0d7c4fe18bb21e5f2f424a5b658c1b | [
"Apache-2.0"
] | null | null | null | //******************************************************************************
// Copyright (c) 2005-2013 by Jan Van hijfte
//
// See the included file COPYING.TXT for details about the copyright.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the i... | 33.096317 | 120 | 0.805101 | mariuszmaximus |
09bc74e75d2e88ee7843b1feb07cae7849671ddd | 52,675 | cpp | C++ | src/Client/ClientDialog.cpp | 565353780/filter-socket | 4da4c1d6bf5065ffdf8e1d3e79faf97582c77d87 | [
"MIT"
] | null | null | null | src/Client/ClientDialog.cpp | 565353780/filter-socket | 4da4c1d6bf5065ffdf8e1d3e79faf97582c77d87 | [
"MIT"
] | null | null | null | src/Client/ClientDialog.cpp | 565353780/filter-socket | 4da4c1d6bf5065ffdf8e1d3e79faf97582c77d87 | [
"MIT"
] | null | null | null | #include "ClientDialog.h"
ClientDialog::ClientDialog(QWidget *parent) :
QDialog(parent),
ui(new Ui::ClientDialog)
{
ui->setupUi(this);
this->setWindowFlags(Qt::WindowMinimizeButtonHint|Qt::WindowMaximizeButtonHint | Qt::WindowCloseButtonHint);
this->setWindowTitle(tr("ClientDialog"));
... | 31.982392 | 219 | 0.589919 | 565353780 |
09c0367b4e8144139b5fd63ac1ed0628c1ba92f9 | 6,348 | cpp | C++ | src/tdmms_stamper/tdmms_autostamp/tdmms_autostamp_autofocus_action/src/tdmms_autostamp_autofocus_action_node.cpp | tdmms/tdmms | 1bd779bb3d6fe6451cdc08dcd5b15a1bcbd03b35 | [
"BSD-3-Clause"
] | 16 | 2018-04-28T07:34:04.000Z | 2022-01-27T02:46:43.000Z | src/tdmms_stamper/tdmms_autostamp/tdmms_autostamp_autofocus_action/src/tdmms_autostamp_autofocus_action_node.cpp | tdmms/tdmms | 1bd779bb3d6fe6451cdc08dcd5b15a1bcbd03b35 | [
"BSD-3-Clause"
] | 1 | 2018-10-16T08:41:55.000Z | 2018-10-16T08:44:33.000Z | src/tdmms_stamper/tdmms_autostamp/tdmms_autostamp_autofocus_action/src/tdmms_autostamp_autofocus_action_node.cpp | tdmms/tdmms | 1bd779bb3d6fe6451cdc08dcd5b15a1bcbd03b35 | [
"BSD-3-Clause"
] | 2 | 2018-04-17T14:03:15.000Z | 2020-05-12T04:59:43.000Z | // Copyright 2016 by S. Masubuchi
#include <ros/ros.h>
#include <std_msgs/Empty.h>
#include <std_srvs/Empty.h>
#include <std_msgs/UInt8.h>
#include <std_msgs/UInt32.h>
#include <geometry_msgs/Pose.h>
#include <geometry_msgs/Point.h>
#include <stamper_sample_z/velocity.h>
#include <actionlib/server/simple_action_server... | 35.071823 | 80 | 0.68305 | tdmms |
09c28f0640091347929ccc8fccfbd7ca14b099aa | 348 | cc | C++ | kattis/differentdistances.cc | Ashindustry007/competitive-programming | 2eabd3975c029d235abb7854569593d334acae2f | [
"WTFPL"
] | 506 | 2018-08-22T10:30:38.000Z | 2022-03-31T10:01:49.000Z | kattis/differentdistances.cc | Ashindustry007/competitive-programming | 2eabd3975c029d235abb7854569593d334acae2f | [
"WTFPL"
] | 13 | 2019-08-07T18:31:18.000Z | 2020-12-15T21:54:41.000Z | kattis/differentdistances.cc | Ashindustry007/competitive-programming | 2eabd3975c029d235abb7854569593d334acae2f | [
"WTFPL"
] | 234 | 2018-08-06T17:11:41.000Z | 2022-03-26T10:56:42.000Z | // https://open.kattis.com/problems/differentdistances
#include <cmath>
#include <iostream>
using namespace std;
int main() {
while (true) {
double x1, y1, x2, y2, p;
cin >> x1;
if (!x1) break;
cin >> y1 >> x2 >> y2 >> p;
cout << pow(pow(abs(x1 - x2), p) + pow(abs(y1 - y2),... | 23.2 | 80 | 0.511494 | Ashindustry007 |
09c2b3110d8ce308cb3ca7fe4978f7641a7739ea | 10,460 | cc | C++ | src/CCA/Components/MPM/Materials/ConstitutiveModel/SoilModels/BBMPoint.cc | abagusetty/Uintah | fa1bf819664fa6f09c5a7cd076870a40816d35c9 | [
"MIT"
] | 3 | 2020-06-10T08:21:31.000Z | 2020-06-23T18:33:16.000Z | src/CCA/Components/MPM/Materials/ConstitutiveModel/SoilModels/BBMPoint.cc | abagusetty/Uintah | fa1bf819664fa6f09c5a7cd076870a40816d35c9 | [
"MIT"
] | null | null | null | src/CCA/Components/MPM/Materials/ConstitutiveModel/SoilModels/BBMPoint.cc | abagusetty/Uintah | fa1bf819664fa6f09c5a7cd076870a40816d35c9 | [
"MIT"
] | 2 | 2019-12-30T05:48:30.000Z | 2020-02-12T16:24:16.000Z | #include "stdafx.h"
#include "BBMPoint.h"
using namespace std;
BBMPoint::BBMPoint(void)
{
for (int i=0; i<6; i++)
{
stress [i]=0;
strain [i]=0;
plastic_strain[i]=0;
MicroStress [i]=0;
MicroStrain [i]=0;
MicroPlasticStrain[i]=0;
}
strain[6]=0;
MicroStrain[6]=0;
for (int i=0; i<3; i++)
{
state[i]=... | 23.665158 | 189 | 0.651243 | abagusetty |
09c40a0da56e263d435b697215defbfe149f7112 | 20,188 | cpp | C++ | main/BLEPKAPService.cpp | jaylogue/ble-pkap | 00e4ff06da5e60fe69c908a9fa2e3d09eba70666 | [
"Apache-2.0"
] | 1 | 2021-08-07T03:42:41.000Z | 2021-08-07T03:42:41.000Z | main/BLEPKAPService.cpp | jaylogue/ble-pkap | 00e4ff06da5e60fe69c908a9fa2e3d09eba70666 | [
"Apache-2.0"
] | null | null | null | main/BLEPKAPService.cpp | jaylogue/ble-pkap | 00e4ff06da5e60fe69c908a9fa2e3d09eba70666 | [
"Apache-2.0"
] | null | null | null | /**
* Copyright (c) 2020 Jay Logue
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unles... | 37.876173 | 151 | 0.649346 | jaylogue |
09c645719ac0202fd7df492ccab960fc05253e96 | 1,988 | cpp | C++ | mp2p_icp/src/Parameters.cpp | MOLAorg/mp2_icp | e53a5f5f2cc6b86a095d1cba6f07f03c13a72abb | [
"BSD-3-Clause"
] | 82 | 2019-06-09T15:33:07.000Z | 2022-03-22T11:04:09.000Z | mp2p_icp/src/Parameters.cpp | MOLAorg/mp2_icp | e53a5f5f2cc6b86a095d1cba6f07f03c13a72abb | [
"BSD-3-Clause"
] | null | null | null | mp2p_icp/src/Parameters.cpp | MOLAorg/mp2_icp | e53a5f5f2cc6b86a095d1cba6f07f03c13a72abb | [
"BSD-3-Clause"
] | 19 | 2019-06-19T10:05:08.000Z | 2021-07-28T08:37:34.000Z | /* -------------------------------------------------------------------------
* A repertory of multi primitive-to-primitive (MP2P) ICP algorithms in C++
* Copyright (C) 2018-2021 Jose Luis Blanco, University of Almeria
* See LICENSE for license information.
* --------------------------------------------------------... | 33.133333 | 80 | 0.65996 | MOLAorg |
09c9bd9b13d66629443dce80ac037aa34a8fb77e | 6,256 | cpp | C++ | src/joystick_js.cpp | chmutoff/esp-tank | ecb2a14317112e54001ff232a836e915b6ef2a6c | [
"MIT"
] | null | null | null | src/joystick_js.cpp | chmutoff/esp-tank | ecb2a14317112e54001ff232a836e915b6ef2a6c | [
"MIT"
] | null | null | null | src/joystick_js.cpp | chmutoff/esp-tank | ecb2a14317112e54001ff232a836e915b6ef2a6c | [
"MIT"
] | null | null | null | #include <pgmspace.h>
static const char JOYSTICK_HTML[] PROGMEM = R"(/*
* Name : joy.js
* @author : Roberto D'Amico (Bobboteck)
* Last modified : 09.06.2020
* Revision : 2.0.0
*
* Modification History:
* Date Version Modified By Description
* 2021-12-21 2.0.0 Roberto... | 122.666667 | 3,415 | 0.683824 | chmutoff |
09cb458642a2dafb2b0629b730e9dbdc3aaf7a17 | 1,915 | cc | C++ | src/lhco.cc | cbpark/CLHCO | 4f6f73dc7a3a4dc25bfc7d7be9d34d5dd59fb9f0 | [
"BSD-3-Clause"
] | null | null | null | src/lhco.cc | cbpark/CLHCO | 4f6f73dc7a3a4dc25bfc7d7be9d34d5dd59fb9f0 | [
"BSD-3-Clause"
] | null | null | null | src/lhco.cc | cbpark/CLHCO | 4f6f73dc7a3a4dc25bfc7d7be9d34d5dd59fb9f0 | [
"BSD-3-Clause"
] | null | null | null | /* Copyright (c) 2015, 2017, Chan Beom Park <cbpark@gmail.com> */
#include "lhco.h"
#include <cmath>
#include <vector>
#include "kinematics.h"
namespace lhco {
template <typename T>
int numOfParticles(const Pt &pt, const Eta &eta, const std::vector<T> &ps) {
int count = 0;
for (const auto &p : ps) {
i... | 28.161765 | 76 | 0.643342 | cbpark |
09cd1788e5cc2e597e58e3029bcf0543c0ed3020 | 13,402 | inl | C++ | src/render/scene.inl | hyungman/SpRay | 96380740dd88e6fbc21c0fdbf232cff357b1235d | [
"Apache-2.0"
] | 7 | 2018-10-22T17:13:36.000Z | 2020-04-17T08:28:55.000Z | src/render/scene.inl | hyungman/SpRay | 96380740dd88e6fbc21c0fdbf232cff357b1235d | [
"Apache-2.0"
] | null | null | null | src/render/scene.inl | hyungman/SpRay | 96380740dd88e6fbc21c0fdbf232cff357b1235d | [
"Apache-2.0"
] | 1 | 2018-11-01T14:53:22.000Z | 2018-11-01T14:53:22.000Z | // ========================================================================== //
// Copyright (c) 2017-2018 The University of Texas at Austin. //
// All rights reserved. //
// ... | 31.909524 | 80 | 0.606178 | hyungman |
09cefacaaff50b19ea6302aef7394d6cc3d027aa | 1,292 | hh | C++ | centreon-engine/modules/external_commands/inc/com/centreon/engine/modules/external_commands/utils.hh | centreon/centreon-collect | e63fc4d888a120d588a93169e7d36b360616bdee | [
"Unlicense"
] | 8 | 2020-07-26T09:12:02.000Z | 2022-03-30T17:24:29.000Z | centreon-engine/modules/external_commands/inc/com/centreon/engine/modules/external_commands/utils.hh | centreon/centreon-collect | e63fc4d888a120d588a93169e7d36b360616bdee | [
"Unlicense"
] | 47 | 2020-06-18T12:11:37.000Z | 2022-03-16T10:28:56.000Z | centreon-engine/modules/external_commands/inc/com/centreon/engine/modules/external_commands/utils.hh | centreon/centreon-collect | e63fc4d888a120d588a93169e7d36b360616bdee | [
"Unlicense"
] | 5 | 2020-06-29T14:22:02.000Z | 2022-03-17T10:34:10.000Z | /*
** Copyright 2011-2013 Merethis
**
** This file is part of Centreon Engine.
**
** Centreon Engine is free software: you can redistribute it and/or
** modify it under the terms of the GNU General Public License version 2
** as published by the Free Software Foundation.
**
** Centreon Engine is distributed in the hope... | 30.761905 | 79 | 0.722136 | centreon |
09cf4e3a0576dd4edb07f010f9d1b7f31102d3b8 | 41,198 | cpp | C++ | src/core/ChSpmatrix.cpp | scpeters/chrono | a7cefda35d8a445963297cbe2dbb3cdfb4397f16 | [
"BSD-3-Clause"
] | 1 | 2020-02-16T16:52:08.000Z | 2020-02-16T16:52:08.000Z | src/core/ChSpmatrix.cpp | Milad-Rakhsha/Project-Chrono | 6ab7abcd532cfb3c5e3876478fdd49c7ab783f63 | [
"BSD-3-Clause"
] | null | null | null | src/core/ChSpmatrix.cpp | Milad-Rakhsha/Project-Chrono | 6ab7abcd532cfb3c5e3876478fdd49c7ab783f63 | [
"BSD-3-Clause"
] | null | null | null | //
// PROJECT CHRONO - http://projectchrono.org
//
// Copyright (c) 2010-2011 Alessandro Tasora
// Copyright (c) 2013 Project Chrono
// All rights reserved.
//
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file at the top level of the distribution
// and at http://pr... | 22.636264 | 137 | 0.620224 | scpeters |
09daa83999e0ab186cc26ed886845e78c830da83 | 343 | cpp | C++ | physics/BtShape.cpp | quyse/inanity | a39225c5a41f879abe5aa492bb22b500dbe77433 | [
"MIT"
] | 26 | 2015-04-22T05:25:25.000Z | 2020-11-15T11:07:56.000Z | physics/BtShape.cpp | quyse/inanity | a39225c5a41f879abe5aa492bb22b500dbe77433 | [
"MIT"
] | 2 | 2015-01-05T10:41:27.000Z | 2015-01-06T20:46:11.000Z | physics/BtShape.cpp | quyse/inanity | a39225c5a41f879abe5aa492bb22b500dbe77433 | [
"MIT"
] | 5 | 2016-08-02T11:13:57.000Z | 2018-10-26T11:19:27.000Z | #include "BtShape.hpp"
#include "BtWorld.hpp"
BEGIN_INANITY_PHYSICS
BtShape::BtShape(ptr<BtWorld> world, btCollisionShape* collisionShape)
: Shape(world), collisionShape(collisionShape) {}
BtShape::~BtShape()
{
delete collisionShape;
}
btCollisionShape* BtShape::GetInternalObject() const
{
return collisionShape;
... | 17.15 | 70 | 0.787172 | quyse |
09dc143f3404817db2adedf40e177200f03b42c9 | 658 | cpp | C++ | Engine/Modules/Font/Common/IFontFace.cpp | LineGames/Leggiero | 8fe13d86454a08ba8a3a8cebe1ce92343090c1be | [
"MIT"
] | 22 | 2021-04-19T03:01:44.000Z | 2021-12-03T11:14:10.000Z | Engine/Modules/Font/Common/IFontFace.cpp | LineGames/Leggiero | 8fe13d86454a08ba8a3a8cebe1ce92343090c1be | [
"MIT"
] | null | null | null | Engine/Modules/Font/Common/IFontFace.cpp | LineGames/Leggiero | 8fe13d86454a08ba8a3a8cebe1ce92343090c1be | [
"MIT"
] | 3 | 2021-04-20T05:06:40.000Z | 2021-07-31T01:25:53.000Z | ////////////////////////////////////////////////////////////////////////////////
// Common/IFontFace.cpp (Leggiero/Modules - Font)
//
// Abstract Font Face Basic Implementation
////////////////////////////////////////////////////////////////////////////////
// My Header
#include "IFontFace.h"
// Leggiero.Font
#inclu... | 24.37037 | 92 | 0.351064 | LineGames |
09de52ce3031cad839f2e6371a1659d78f4f4673 | 489 | hpp | C++ | aw-internal/shared/misc/misc.hpp | fengjixuchui/aniware-internal | d0e63940b6c37c1d8393d0e9cffd87fcfa680a50 | [
"MIT"
] | null | null | null | aw-internal/shared/misc/misc.hpp | fengjixuchui/aniware-internal | d0e63940b6c37c1d8393d0e9cffd87fcfa680a50 | [
"MIT"
] | null | null | null | aw-internal/shared/misc/misc.hpp | fengjixuchui/aniware-internal | d0e63940b6c37c1d8393d0e9cffd87fcfa680a50 | [
"MIT"
] | null | null | null | #pragma once
namespace misc
{
template< typename t, size_t s >
std::array<t, s> create_filled_array( const t& fill )
{
auto arr = std::array<t, s>{};
arr.fill( fill );
return arr;
}
template< typename t, size_t s >
std::vector<t> create_filled_vector( const t& fill )
{
auto vec = std::vector<t>( s );
... | 21.26087 | 54 | 0.642127 | fengjixuchui |
09df9723e53e1a24433f5b53e07938041882814c | 2,135 | cc | C++ | zoltan/apfZoltanMesh.cc | cwsmith/core | 840fbf6ec49a63aeaa3945f11ddb224f6055ac9f | [
"BSD-3-Clause"
] | 138 | 2015-01-05T15:50:20.000Z | 2022-02-25T01:09:58.000Z | zoltan/apfZoltanMesh.cc | cwsmith/core | 840fbf6ec49a63aeaa3945f11ddb224f6055ac9f | [
"BSD-3-Clause"
] | 337 | 2015-08-07T18:24:58.000Z | 2022-03-31T14:39:03.000Z | zoltan/apfZoltanMesh.cc | cwsmith/core | 840fbf6ec49a63aeaa3945f11ddb224f6055ac9f | [
"BSD-3-Clause"
] | 70 | 2015-01-17T00:58:41.000Z | 2022-02-13T04:58:20.000Z | /*
* Copyright (C) 2014 Scientific Computation Research Center
*
* This work is open source software, licensed under the terms of the
* BSD license as described in the LICENSE file in the top-level directory.
*/
#include "apfZoltanMesh.h"
#include "apfZoltanCallbacks.h"
#include "apfZoltan.h"
#include <PCU.h>
#in... | 22.473684 | 78 | 0.668384 | cwsmith |
09e26e13382eb2ad119d96f744038e52d06e414d | 405 | cpp | C++ | tema1/5_4.cpp | AntonC9018/FP | 9480fab57c262d1647d49eec6f06d3b7be557bb2 | [
"MIT"
] | 1 | 2020-11-02T17:54:27.000Z | 2020-11-02T17:54:27.000Z | tema1/5_4.cpp | AntonC9018/FP | 9480fab57c262d1647d49eec6f06d3b7be557bb2 | [
"MIT"
] | null | null | null | tema1/5_4.cpp | AntonC9018/FP | 9480fab57c262d1647d49eec6f06d3b7be557bb2 | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <math.h>
int main()
{
printf("Introduceti un caracter: ");
char ch;
scanf("%c", &ch);
if (ch <= 'Z' && ch >= 'A') {
printf("%c este o litera majuscula", ch);
} else if (ch <= 'z' && ch >= 'a') {
printf("%c este o litera minuscula", ch);
} else if (c... | 21.315789 | 49 | 0.466667 | AntonC9018 |
09e3e35941a480fda96f7ce8e959b1490fee8c8f | 1,363 | cpp | C++ | algo-tourist/Templates-Teo/Bicsi/berlekamp_massey.cpp | Nicu-Ducal/Competitive-Programming | c84126a4cb701b0764664db490b7e594495c8592 | [
"MIT"
] | null | null | null | algo-tourist/Templates-Teo/Bicsi/berlekamp_massey.cpp | Nicu-Ducal/Competitive-Programming | c84126a4cb701b0764664db490b7e594495c8592 | [
"MIT"
] | null | null | null | algo-tourist/Templates-Teo/Bicsi/berlekamp_massey.cpp | Nicu-Ducal/Competitive-Programming | c84126a4cb701b0764664db490b7e594495c8592 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
const int kMod = 1e9 + 7;
struct ModInt {
long long n;
ModInt(long long n = 0) : n(n % kMod) {}
ModInt operator+(const ModInt& oth) { return n + oth.n; }
ModInt operator-(const ModInt& oth) { return n - oth.n; }
ModInt operator*(const ModInt& oth) ... | 23.5 | 63 | 0.440939 | Nicu-Ducal |
09e9cc83ed78047ccf3786c46d8878c7243b98b8 | 12,162 | cpp | C++ | Source/Net/NetAddress.cpp | antmuse/AntEngine | 2bbb57b17a880850c0631f28546e77382aa8ed95 | [
"MIT"
] | 4 | 2021-07-26T01:48:56.000Z | 2021-12-11T09:19:00.000Z | Source/Net/NetAddress.cpp | antmuse/AntEngine | 2bbb57b17a880850c0631f28546e77382aa8ed95 | [
"MIT"
] | null | null | null | Source/Net/NetAddress.cpp | antmuse/AntEngine | 2bbb57b17a880850c0631f28546e77382aa8ed95 | [
"MIT"
] | 2 | 2021-08-31T13:49:58.000Z | 2022-01-04T05:58:09.000Z | /***************************************************************************************************
* MIT License
*
* Copyright (c) 2021 antmuse@live.cn/antmuse@qq.com
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the... | 27.958621 | 108 | 0.553938 | antmuse |
09ea2db98bbe498e910f00466b9e4dbe4a8397f7 | 4,230 | cpp | C++ | Src/VC/bcgcbpro/BCGPStaticGaugeImpl.cpp | iclosure/smartsoft | 62eaed49efd8306642b928ef4f2d96e36aca6527 | [
"MIT"
] | null | null | null | Src/VC/bcgcbpro/BCGPStaticGaugeImpl.cpp | iclosure/smartsoft | 62eaed49efd8306642b928ef4f2d96e36aca6527 | [
"MIT"
] | null | null | null | Src/VC/bcgcbpro/BCGPStaticGaugeImpl.cpp | iclosure/smartsoft | 62eaed49efd8306642b928ef4f2d96e36aca6527 | [
"MIT"
] | 1 | 2020-05-11T05:36:49.000Z | 2020-05-11T05:36:49.000Z | //*******************************************************************************
// COPYRIGHT NOTES
// ---------------
// This is a part of the BCGControlBar Library
// Copyright (C) 1998-2012 BCGSoft Ltd.
// All rights reserved.
//
// This source code can be used, distributed or modified
// only under terms and condi... | 25.329341 | 100 | 0.520567 | iclosure |
09eb7ea30cbf59a6eb696c77f2d09f7d3c44c12a | 2,297 | cpp | C++ | src/tbdmud_server.cpp | charleslucas/tbdmud | 58023c9af23dd69e6de93bb5295dc9047a7b3998 | [
"MIT"
] | null | null | null | src/tbdmud_server.cpp | charleslucas/tbdmud | 58023c9af23dd69e6de93bb5295dc9047a7b3998 | [
"MIT"
] | null | null | null | src/tbdmud_server.cpp | charleslucas/tbdmud | 58023c9af23dd69e6de93bb5295dc9047a7b3998 | [
"MIT"
] | null | null | null | #include <iostream>
#include <boost/asio.hpp>
#include <boost/bind/bind.hpp>
#include <boost/algorithm/string.hpp>
#include <optional>
#include <queue>
#include <unordered_set>
#include <events.h>
#include <entities.h>
#include <session.h>
#include <world.h>
#include <tbdmud_server.h>
// Call the tick function of the ... | 42.537037 | 178 | 0.679147 | charleslucas |
09ecb487e1831adec8bfb3925ca00f20b7d77c95 | 20,459 | hpp | C++ | 2d/extra/MeshR2.hpp | danston/gbc | 0cb1ae062919b053edc1558bdf41757460703eca | [
"MIT"
] | 16 | 2016-12-06T10:35:46.000Z | 2022-01-19T01:20:56.000Z | 2d/extra/MeshR2.hpp | danston/sbc | e53deb997bc6c119bfacd6da6a234f64068efc1e | [
"MIT"
] | 1 | 2020-02-11T10:45:30.000Z | 2021-03-12T11:08:03.000Z | 2d/extra/MeshR2.hpp | danston/sbc | e53deb997bc6c119bfacd6da6a234f64068efc1e | [
"MIT"
] | 3 | 2018-05-10T14:34:35.000Z | 2021-12-20T10:01:21.000Z | // Copyright Dmitry Anisimov danston@ymail.com (c) 2016-2017.
// README:
/*
Implementation of the triangle/quad mesh in R2.
This class depends on:
1. VertexExpressionsR2.hpp
2. VertexR2.hpp
3. TriangleCoordinatesR2.hpp
4. Face.hpp
5. Halfedge.hpp
6. MeanValueR2.hpp
*/
#ifndef GBC_ME... | 29.227143 | 125 | 0.446454 | danston |
09f020354d81d5d99721066d40c5df880ef27319 | 1,461 | cpp | C++ | apps/opencs/view/render/overlaymask.cpp | Bodillium/openmw | 5fdd264d0704e33b44b1ccf17ab4fb721f362e34 | [
"Unlicense"
] | null | null | null | apps/opencs/view/render/overlaymask.cpp | Bodillium/openmw | 5fdd264d0704e33b44b1ccf17ab4fb721f362e34 | [
"Unlicense"
] | null | null | null | apps/opencs/view/render/overlaymask.cpp | Bodillium/openmw | 5fdd264d0704e33b44b1ccf17ab4fb721f362e34 | [
"Unlicense"
] | null | null | null | #include "overlaymask.hpp"
#include <OgreOverlayManager.h>
#include <OgreOverlayContainer.h>
#include "textoverlay.hpp"
#include "../../model/world/cellcoordinates.hpp"
namespace CSVRender
{
// ideas from http://www.ogre3d.org/forums/viewtopic.php?f=5&t=44828#p486334
OverlayMask::OverlayMask(std::map<CSMWorld::Cell... | 27.566038 | 112 | 0.64271 | Bodillium |
09f1895a2e908ebf699795f107849bb2af0ac472 | 1,583 | cpp | C++ | solutions/combination_sum_2.cpp | kmykoh97/My-Leetcode | 0ffdea16c3025805873aafb6feffacaf3411a258 | [
"Apache-2.0"
] | null | null | null | solutions/combination_sum_2.cpp | kmykoh97/My-Leetcode | 0ffdea16c3025805873aafb6feffacaf3411a258 | [
"Apache-2.0"
] | null | null | null | solutions/combination_sum_2.cpp | kmykoh97/My-Leetcode | 0ffdea16c3025805873aafb6feffacaf3411a258 | [
"Apache-2.0"
] | null | null | null | // Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target.
// Each number in candidates may only be used once in the combination.
// Note: The solution set must not contain duplicate combinations.
// E... | 22.942029 | 171 | 0.569172 | kmykoh97 |
09f52a0992418ee119a6bf9ba0798c516fd1ecf4 | 2,106 | hpp | C++ | WinApiFramework/Framework/Mouse.hpp | TonSharp/OpenWAPI | d61a8f006ea866c399e68f338c2661e9ef624369 | [
"MS-PL"
] | 3 | 2021-09-17T07:54:28.000Z | 2021-09-18T08:28:33.000Z | WinApiFramework/Framework/Mouse.hpp | TonSharp/WAPITIS | d61a8f006ea866c399e68f338c2661e9ef624369 | [
"MS-PL"
] | 21 | 2021-09-19T18:13:55.000Z | 2021-12-14T10:28:53.000Z | WinApiFramework/Framework/Mouse.hpp | TonSharp/OpenWAPI | d61a8f006ea866c399e68f338c2661e9ef624369 | [
"MS-PL"
] | null | null | null | #pragma once
#include "Elements/Args.hpp"
class Mouse
{
private:
static float x, y;
static float dx, dy;
static bool cursorLock;
static Window* linkedWindow;
public:
static void LockCursor()
{
cursorLock = true;
if (linkedWindow != nullptr)
SetCapture(linkedWindow->Get());
}
static void UnlockCurso... | 16.453125 | 81 | 0.671415 | TonSharp |
09f7f7081953fcbbf81323b057c90420492039c3 | 284 | cpp | C++ | URI_1013.cpp | UmamaZakir/URI-Online-Judge.-begginer | b0a6d60b48b64790a0a502bbbcbc5c604b09826b | [
"MIT"
] | 1 | 2021-07-11T17:00:52.000Z | 2021-07-11T17:00:52.000Z | URI_1013.cpp | UmamaZakir/URI-Online-Judge.-begginer | b0a6d60b48b64790a0a502bbbcbc5c604b09826b | [
"MIT"
] | null | null | null | URI_1013.cpp | UmamaZakir/URI-Online-Judge.-begginer | b0a6d60b48b64790a0a502bbbcbc5c604b09826b | [
"MIT"
] | null | null | null |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long a,b,c,mab,m;
cin>>a>>b>>c;
mab=(a+b+abs(a-b))/2;
m=(mab+c+abs(mab-c))/2;
cout<<m<<" eh o maior"<<"\n";
return 0;
}
| 16.705882 | 38 | 0.507042 | UmamaZakir |
09f8dcb967908e96d6d9ebaa23391b332c95004b | 4,260 | cpp | C++ | usb_492/USB_Device.cpp | dl8dtl/tek492 | 4303c6db2a4fe19c5a0129b831354ff6f04a1a6e | [
"Beerware"
] | 1 | 2021-03-24T08:33:45.000Z | 2021-03-24T08:33:45.000Z | usb_492/USB_Device.cpp | dl8dtl/tek492 | 4303c6db2a4fe19c5a0129b831354ff6f04a1a6e | [
"Beerware"
] | null | null | null | usb_492/USB_Device.cpp | dl8dtl/tek492 | 4303c6db2a4fe19c5a0129b831354ff6f04a1a6e | [
"Beerware"
] | 1 | 2021-03-24T08:33:46.000Z | 2021-03-24T08:33:46.000Z | /*
* This is mostly taken from circuitben's original software which
* is believed to be public domain.
*
* http://www.circuitben.net/node/4
*/
/*
* As this application uses Qt, any redistribution is bound to the
* terms of either the GNU Lesser General Public License v. 3 ("LGPL"),
* or to any commercial Qt li... | 22.539683 | 139 | 0.595305 | dl8dtl |
09f987f5d6bee75ded3745752a6f3152b9159537 | 3,449 | cpp | C++ | letstry/server.cpp | MarcusM94/Vehicles-in-IoT-Environments | 5f885ff826a57b5c6ca4a67582e7ea11e4f15116 | [
"MIT"
] | null | null | null | letstry/server.cpp | MarcusM94/Vehicles-in-IoT-Environments | 5f885ff826a57b5c6ca4a67582e7ea11e4f15116 | [
"MIT"
] | null | null | null | letstry/server.cpp | MarcusM94/Vehicles-in-IoT-Environments | 5f885ff826a57b5c6ca4a67582e7ea11e4f15116 | [
"MIT"
] | null | null | null | #include <qsocket.h>
#include <qserversocket.h>
#include <qapplication.h>
#include <qvbox.h>
#include <qtextview.h>
#include <qlabel.h>
#include <qpushbutton.h>
#include <qtextstream.h>
#include <stdlib.h>
/*
The ClientSocket class provides a socket that is connected with a client.
For every client that connects... | 22.396104 | 79 | 0.578718 | MarcusM94 |
09fa7616aa1893ca65ff3824866958759b8b8ea1 | 808 | cpp | C++ | test/tests/sorting_searching/find_duplicates.cpp | TusharChugh/algorithms-practice | 15c4ee9e9b9d4c94ff8b9f087d5d4eca16bd40c1 | [
"MIT"
] | 4 | 2018-09-27T01:29:21.000Z | 2020-02-13T11:33:10.000Z | test/tests/sorting_searching/find_duplicates.cpp | TusharChugh/algorithms-practice | 15c4ee9e9b9d4c94ff8b9f087d5d4eca16bd40c1 | [
"MIT"
] | 1 | 2018-07-05T17:43:02.000Z | 2018-07-05T17:43:02.000Z | test/tests/sorting_searching/find_duplicates.cpp | TusharChugh/algorithms-practice | 15c4ee9e9b9d4c94ff8b9f087d5d4eca16bd40c1 | [
"MIT"
] | 3 | 2018-05-18T17:48:36.000Z | 2019-08-09T17:11:43.000Z | #include <gtest/gtest.h>
#include "include/sorting_searching/find_duplicates.h"
TEST(FIND_DUPLICATES, THREE_DUPS_TENTOTAL) {
std::vector<int> input = {1, 5, 3, 2, 4, 3, 6, 3, 10, 11};
std::unordered_set<int> expected_output = {3};
ASSERT_EQ(expected_output, algorithm::find_duplicates(input));
}
TEST(FIND_... | 33.666667 | 66 | 0.689356 | TusharChugh |
09fbd4a43d5bf687eb79687d7d84cc59a3f6f59e | 1,272 | cpp | C++ | LeetCode/ThousandOne/0398-random_pick_idx.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0398-random_pick_idx.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0398-random_pick_idx.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | #include "leetcode.hpp"
/* 398. 随机数索引
给定一个可能含有重复元素的整数数组，要求随机输出给定的数字的索引。
您可以假设给定的数字一定存在于数组中。
注意：
数组大小可能非常大。 使用太多额外空间的解决方案将不会通过测试。
示例:
int[] nums = new int[] {1,2,3,3,3};
Solution solution = new Solution(nums);
// pick(3) 应该返回索引 2,3 或者 4。每个索引的返回概率应该相等。
solution.pick(3);
// pick(1) 应该返回 0。因为只有nums[0]等于1。
solution.pick... | 19.569231 | 82 | 0.618711 | Ginkgo-Biloba |
09fce38d9c18c01bc4635768b612f3174af49d3a | 2,104 | cpp | C++ | android/android_23/frameworks/base/libs/ui/InputManager.cpp | yakuizhao/intel-vaapi-driver | b2bb0383352694941826543a171b557efac2219b | [
"MIT"
] | 1 | 2021-03-05T06:48:29.000Z | 2021-03-05T06:48:29.000Z | frameworks/base/libs/ui/InputManager.cpp | CPU-Code/android_bottom | 76db08af7719d88d8ee3e51ed310ffe14f14e522 | [
"Apache-2.0"
] | null | null | null | frameworks/base/libs/ui/InputManager.cpp | CPU-Code/android_bottom | 76db08af7719d88d8ee3e51ed310ffe14f14e522 | [
"Apache-2.0"
] | null | null | null | //
// Copyright 2010 The Android Open Source Project
//
// The input manager.
//
#define LOG_TAG "InputManager"
//#define LOG_NDEBUG 0
#include <cutils/log.h>
#include <ui/InputManager.h>
#include <ui/InputReader.h>
#include <ui/InputDispatcher.h>
namespace android {
InputManager::InputManager(
const sp<Eve... | 25.047619 | 89 | 0.693916 | yakuizhao |
09fea9f394c2d3866284a0bdc1dfaede6e760f59 | 17,934 | cpp | C++ | enduser/speech/tts/msttsdrv/engine/mainnorm.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | enduser/speech/tts/msttsdrv/engine/mainnorm.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | enduser/speech/tts/msttsdrv/engine/mainnorm.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | /*******************************************************************************
* MainNorm.cpp *
*--------------*
* Description:
*
*-------------------------------------------------------------------------------
* Created By: AH Date: 01/18/2000
* Copyright (C) 2000 Microsoft Corporation
* All ... | 35.512871 | 117 | 0.484443 | npocmaka |
6702b32cf7c4725d68afc34f7283d8d9aaee55ec | 1,120 | cpp | C++ | cpp/021-030/Substring with Concatenation of All Words.cpp | KaiyuWei/leetcode | fd61f5df60cfc7086f7e85774704bacacb4aaa5c | [
"MIT"
] | 150 | 2015-04-04T06:53:49.000Z | 2022-03-21T13:32:08.000Z | cpp/021-030/Substring with Concatenation of All Words.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 1 | 2015-04-13T15:15:40.000Z | 2015-04-21T20:23:16.000Z | cpp/021-030/Substring with Concatenation of All Words.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 64 | 2015-06-30T08:00:07.000Z | 2022-01-01T16:44:14.000Z | class Solution {
public:
vector<int> findSubstring(string s, vector<string>& words) {
vector<int> res;
unordered_map<string, int> dict;
int len = words[0].size();
int n = s.length(), m = words.size();
for (const string& word : words) {
dict[word]++;
}
... | 30.27027 | 64 | 0.365179 | KaiyuWei |
6703f667d66470d39ed449a681aa7e3a6c55d286 | 2,735 | cpp | C++ | source/material/material.cpp | suVrik/path_tracer | 9c1a75914e67e75ed4169468c4db87b4498c27f0 | [
"MIT"
] | null | null | null | source/material/material.cpp | suVrik/path_tracer | 9c1a75914e67e75ed4169468c4db87b4498c27f0 | [
"MIT"
] | null | null | null | source/material/material.cpp | suVrik/path_tracer | 9c1a75914e67e75ed4169468c4db87b4498c27f0 | [
"MIT"
] | null | null | null | #include "material.h"
#include <algorithm>
#include <cassert>
double fresnel_dielectric(double incident_cos_theta, double incident_ior, double transmitted_ior) {
assert(incident_cos_theta >= -1.0 && incident_cos_theta != 0.0 && incident_cos_theta <= 1.0);
assert(incident_ior >= 1.0);
assert(transmitted_io... | 33.353659 | 105 | 0.683364 | suVrik |
6704244610a42407538ca11d794881364db27ae0 | 10,909 | cpp | C++ | .References/src/github.com/elucideye/drishti_real-time_eye_tracking/src/lib/drishti/eye/ut/test-EyeModelEstimator.cpp | roscopecoltran/SniperKit-Core | 4600dffe1cddff438b948b6c22f586d052971e04 | [
"MIT"
] | null | null | null | .References/src/github.com/elucideye/drishti_real-time_eye_tracking/src/lib/drishti/eye/ut/test-EyeModelEstimator.cpp | roscopecoltran/SniperKit-Core | 4600dffe1cddff438b948b6c22f586d052971e04 | [
"MIT"
] | null | null | null | .References/src/github.com/elucideye/drishti_real-time_eye_tracking/src/lib/drishti/eye/ut/test-EyeModelEstimator.cpp | roscopecoltran/SniperKit-Core | 4600dffe1cddff438b948b6c22f586d052971e04 | [
"MIT"
] | null | null | null | /*!
@file test-EyeModelEstimator.cpp
@author David Hirvonen
@brief Google fixture with various subtests for the drishti public SDK.
\copyright Copyright 2014-2016 Elucideye, Inc. All rights reserved.
\license{This project is released under the 3 Clause BSD License.}
*/
#include "drishti/eye/EyeModelEsti... | 26.223558 | 135 | 0.610047 | roscopecoltran |
67072c23a0bcecfef584808eed187fac7af289cc | 4,328 | cpp | C++ | pi/android/jni/Nanaka.cpp | mathall/nanaka | 0304f444702318a83d221645d4e5f3622082c456 | [
"BSD-2-Clause"
] | 2 | 2017-03-31T19:01:22.000Z | 2017-05-18T08:14:37.000Z | pi/android/jni/Nanaka.cpp | mathall/nanaka | 0304f444702318a83d221645d4e5f3622082c456 | [
"BSD-2-Clause"
] | null | null | null | pi/android/jni/Nanaka.cpp | mathall/nanaka | 0304f444702318a83d221645d4e5f3622082c456 | [
"BSD-2-Clause"
] | null | null | null | /*
* Copyright (c) 2013, Mathias Hällman. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of condi... | 30.695035 | 79 | 0.778651 | mathall |
670d0e8dfe56410f6d933e6e63abd22aa511ed0d | 2,397 | cpp | C++ | opentera-webrtc-native-client/OpenteraWebrtcNativeClient/python/src/Sources/AudioSourcePython.cpp | introlab/opentera-webrtc-teleop | ecb671635832d6d66e0f2f0a7e90b0877ce7c338 | [
"Apache-2.0"
] | 1 | 2020-11-21T21:11:43.000Z | 2020-11-21T21:11:43.000Z | opentera-webrtc-native-client/OpenteraWebrtcNativeClient/python/src/Sources/AudioSourcePython.cpp | introlab/opentera-webrtc-teleop | ecb671635832d6d66e0f2f0a7e90b0877ce7c338 | [
"Apache-2.0"
] | 18 | 2020-09-30T13:36:55.000Z | 2021-03-11T23:06:01.000Z | opentera-webrtc-native-client/OpenteraWebrtcNativeClient/python/src/Sources/AudioSourcePython.cpp | introlab/opentera-webrtc-teleop | ecb671635832d6d66e0f2f0a7e90b0877ce7c338 | [
"Apache-2.0"
] | null | null | null | #include <OpenteraWebrtcNativeClientPython/Sources/AudioSourcePython.h>
#include <OpenteraWebrtcNativeClient/Sources/AudioSource.h>
#include <pybind11/numpy.h>
using namespace opentera;
using namespace std;
namespace py = pybind11;
template <class T>
void sendFrame(const shared_ptr<AudioSource>& self, py::array_t<T... | 40.627119 | 128 | 0.588235 | introlab |
670d29e702689c1cb56d67a1c307eedc1fef3fac | 633 | cpp | C++ | Engine/Managers/AIManager.cpp | gaspardpetit/INF740-GameEngine | 075b6563204fb3d1cf7531599f30dd296c2c9239 | [
"Apache-2.0"
] | null | null | null | Engine/Managers/AIManager.cpp | gaspardpetit/INF740-GameEngine | 075b6563204fb3d1cf7531599f30dd296c2c9239 | [
"Apache-2.0"
] | null | null | null | Engine/Managers/AIManager.cpp | gaspardpetit/INF740-GameEngine | 075b6563204fb3d1cf7531599f30dd296c2c9239 | [
"Apache-2.0"
] | 1 | 2015-09-25T22:24:16.000Z | 2015-09-25T22:24:16.000Z | #include "Precompiled.h"
#include "Core/Components/IIAInterface.h"
#include "AIManager.h"
#include <algorithm>
#include <assert.h>
namespace engine {
void AIManager::createComponent( IAIInterface *iAIInstance )
{
_aiInstances.emplace_back(iAIInstance);
}
void AIManager::removeComponent( IAIInterface *iAIInstance )... | 19.78125 | 80 | 0.725118 | gaspardpetit |
670ddaac3a9c6b12e785c6ea295b3dfa5e53422f | 3,834 | cc | C++ | aimsalgo/src/AimsSphereDistribution/AimsSphereDistribution.cc | brainvisa/aims-free | 5852c1164292cadefc97cecace022d14ab362dc4 | [
"CECILL-B"
] | 4 | 2019-07-09T05:34:10.000Z | 2020-10-16T00:03:15.000Z | aimsalgo/src/AimsSphereDistribution/AimsSphereDistribution.cc | brainvisa/aims-free | 5852c1164292cadefc97cecace022d14ab362dc4 | [
"CECILL-B"
] | 72 | 2018-10-31T14:52:50.000Z | 2022-03-04T11:22:51.000Z | aimsalgo/src/AimsSphereDistribution/AimsSphereDistribution.cc | brainvisa/aims-free | 5852c1164292cadefc97cecace022d14ab362dc4 | [
"CECILL-B"
] | null | null | null | /* This software and supporting documentation are distributed by
* Institut Federatif de Recherche 49
* CEA/NeuroSpin, Batiment 145,
* 91191 Gif-sur-Yvette cedex
* France
*
* This software is governed by the CeCILL-B license under
* French law and abiding by the rules of distribution of free soft... | 30.919355 | 78 | 0.620762 | brainvisa |
670e3dd684597fd50a4e4df332f58f3f8d241dbb | 15,911 | cpp | C++ | test/kernel/manager_test.cpp | correaa/metall | f58728a5e963a6e77b68c1853d3d1ba1fe6a58b4 | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
] | null | null | null | test/kernel/manager_test.cpp | correaa/metall | f58728a5e963a6e77b68c1853d3d1ba1fe6a58b4 | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
] | null | null | null | test/kernel/manager_test.cpp | correaa/metall | f58728a5e963a6e77b68c1853d3d1ba1fe6a58b4 | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
] | null | null | null | // Copyright 2019 Lawrence Livermore National Security, LLC and other Metall Project Developers.
// See the top-level COPYRIGHT file for details.
//
// SPDX-License-Identifier: (Apache-2.0 OR MIT)
#include "gtest/gtest.h"
#include <unordered_set>
#include <boost/container/scoped_allocator.hpp>
#include <boost/interp... | 32.208502 | 127 | 0.663629 | correaa |
e2546d1c24a7e3e0e7d20e6501afb07c0543a152 | 3,579 | cpp | C++ | Project/Engine/Source/DataStream.cpp | lcomstive/Graphics-Assessment | bc52f41b31646ca5d2bb20669704db83c4f77361 | [
"MIT-0"
] | null | null | null | Project/Engine/Source/DataStream.cpp | lcomstive/Graphics-Assessment | bc52f41b31646ca5d2bb20669704db83c4f77361 | [
"MIT-0"
] | null | null | null | Project/Engine/Source/DataStream.cpp | lcomstive/Graphics-Assessment | bc52f41b31646ca5d2bb20669704db83c4f77361 | [
"MIT-0"
] | 1 | 2022-03-23T00:28:52.000Z | 2022-03-23T00:28:52.000Z | #include <string>
#include <iostream>
#include <Engine/Utilities.hpp>
#include <Engine/DataStream.hpp>
using namespace std;
using namespace Engine;
const size_t DataStream::s_InitialStreamSize = 4096; // 4KB
DataStream::DataStream(size_t initialSize) : m_Writing(true), m_Index(0), m_Length(initialSize), m_Data(new u... | 28.404762 | 139 | 0.721989 | lcomstive |
e254d652972fcb8ffc163d8f4280b136d95665bf | 3,092 | cpp | C++ | source/sampler.cpp | DGX2000/CLI-Tuner | 7cdf15531bf5e2dd144ff138b21617630d974a10 | [
"MIT"
] | null | null | null | source/sampler.cpp | DGX2000/CLI-Tuner | 7cdf15531bf5e2dd144ff138b21617630d974a10 | [
"MIT"
] | null | null | null | source/sampler.cpp | DGX2000/CLI-Tuner | 7cdf15531bf5e2dd144ff138b21617630d974a10 | [
"MIT"
] | null | null | null | #include "sampler.h"
#include "audioutil.h"
Sampler::Sampler(sf::Time time)
{
setProcessingInterval(time);
}
bool Sampler::onProcessSamples(const sf::Int16 *samples, std::size_t sampleCount)
{
trackVolume(samples, sampleCount);
if(areThereSamplesToFilter())
{
filterSample(samples, sampleCoun... | 23.968992 | 123 | 0.673027 | DGX2000 |
e2562132e2fbd63024458027b4867bb1a3a1e1d9 | 155 | cpp | C++ | tests/main.cpp | Marsevil/encrypt-me | 94bd9aa7b8fcb61192f21b9a99f593d9ff01ee01 | [
"MIT"
] | 3 | 2020-11-21T23:20:01.000Z | 2021-12-25T22:26:51.000Z | tests/main.cpp | Marsevil/encrypt-me | 94bd9aa7b8fcb61192f21b9a99f593d9ff01ee01 | [
"MIT"
] | 6 | 2020-11-22T01:25:40.000Z | 2021-05-11T13:04:21.000Z | tests/main.cpp | Marsevil/encrypt-me | 94bd9aa7b8fcb61192f21b9a99f593d9ff01ee01 | [
"MIT"
] | 1 | 2021-05-16T15:19:42.000Z | 2021-05-16T15:19:42.000Z | //
// Created by marsevil on 10/01/2021.
//
#include "TestController.hpp"
int main() {
testApplyFunctionEncrypt();
testApplyFunctionDecrypt();
}
| 14.090909 | 37 | 0.683871 | Marsevil |
e25854af1f5a7eb696b6e89f9a6a291a5e61d380 | 534 | cpp | C++ | thirdparty/simdjson/src/arm64/stage2.cpp | liftchampion/nativejson-benchmark | 6d575ffa4359a5c4230f74b07d994602a8016fb5 | [
"MIT"
] | 1 | 2021-11-17T21:39:49.000Z | 2021-11-17T21:39:49.000Z | src/arm64/stage2.cpp | lemire/simdjson_cxxopts_tools | 91016c31bdba68fa5920e8d0012a2ded9d7347b6 | [
"Apache-2.0"
] | 1 | 2020-05-29T09:28:02.000Z | 2020-05-29T09:28:02.000Z | src/arm64/stage2.cpp | lemire/simdjson_cxxopts_tools | 91016c31bdba68fa5920e8d0012a2ded9d7347b6 | [
"Apache-2.0"
] | 1 | 2020-05-28T13:57:15.000Z | 2020-05-28T13:57:15.000Z | #ifndef SIMDJSON_ARM64_STAGE2_H
#define SIMDJSON_ARM64_STAGE2_H
#include "simdjson.h"
#include "arm64/implementation.h"
#include "arm64/stringparsing.h"
#include "arm64/numberparsing.h"
namespace simdjson {
namespace arm64 {
#include "generic/stage2/logger.h"
#include "generic/stage2/atomparsing.h"
#include "generic... | 24.272727 | 55 | 0.801498 | liftchampion |
e258a109b98683a831560e12d3a0e01a8997bf1d | 8,280 | cpp | C++ | src/editor/node-editor.cpp | Delaunay/puzzle | 48c70977c0f73167adb30d674ae9ff5b30794582 | [
"BSD-3-Clause"
] | null | null | null | src/editor/node-editor.cpp | Delaunay/puzzle | 48c70977c0f73167adb30d674ae9ff5b30794582 | [
"BSD-3-Clause"
] | 12 | 2020-08-17T23:40:37.000Z | 2020-08-30T14:25:39.000Z | src/editor/node-editor.cpp | Delaunay/puzzle | 48c70977c0f73167adb30d674ae9ff5b30794582 | [
"BSD-3-Clause"
] | null | null | null | #include "node-editor.h"
void draw_bezier(ImDrawList* draw_list, ImVec2 p1, ImVec2 p2, ImU32 color){
if (p1.x > p2.x) {
std::swap(p1, p2);
}
auto offset = ImVec2((p2.x - p1.x + 1) / 2.f , 0);
auto y_offset = sgn(p2.y - p1.y) * (p2.y - p1.y) / 2.f;
if (p2.y - p1.y > p2.x - p1.x){
o... | 27.785235 | 105 | 0.546618 | Delaunay |
e25ab94ca0dce9a8770721ca2d3151c46d74493f | 555 | inl | C++ | Src/AGZUtils/Math/SwizzleVec2.inl | AirGuanZ/Utils | 6ededbd838697682430a2c0746bfd3b36ff14a5b | [
"MIT"
] | 10 | 2018-10-30T14:19:57.000Z | 2021-12-06T07:46:59.000Z | Src/AGZUtils/Math/SwizzleVec2.inl | AirGuanZ/Utils | 6ededbd838697682430a2c0746bfd3b36ff14a5b | [
"MIT"
] | null | null | null | Src/AGZUtils/Math/SwizzleVec2.inl | AirGuanZ/Utils | 6ededbd838697682430a2c0746bfd3b36ff14a5b | [
"MIT"
] | 3 | 2019-04-24T13:42:02.000Z | 2021-06-28T08:17:28.000Z | #define SWIZZLE2(A, B) _SWIZZLE2(A, B)
#define SWIZZLE3(A, B, C) _SWIZZLE3(A, B, C)
#define SWIZZLE4(A, B, C, D) _SWIZZLE4(A, B, C, D)
#define _SWIZZLE2(A, B) Vec2<T> A##B() const { return Vec2<T>(A, B); }
#define _SWIZZLE3(A, B, C) Vec3<T> A##B##C() const { return Vec3<T>(A, B, C); }
#define _SWIZZL... | 27.75 | 88 | 0.618018 | AirGuanZ |
e25af265b0a86a613701620396130a8b2f54dea7 | 6,579 | cpp | C++ | LIA_RAL_3.0/LIA_SpkDet/EigenVoice/src/EigenVoice.cpp | ibillxia/VoicePrintReco | 20bf32f183abcd483fe1da451b4c75cf995b5f26 | [
"MIT"
] | 83 | 2015-01-18T01:20:37.000Z | 2022-03-02T20:15:27.000Z | LIA_RAL_3.0/LIA_SpkDet/EigenVoice/src/EigenVoice.cpp | Dystopiaz/VoicePrintReco | 20bf32f183abcd483fe1da451b4c75cf995b5f26 | [
"MIT"
] | 4 | 2016-03-03T08:43:00.000Z | 2019-03-08T06:20:56.000Z | LIA_RAL_3.0/LIA_SpkDet/EigenVoice/src/EigenVoice.cpp | Dystopiaz/VoicePrintReco | 20bf32f183abcd483fe1da451b4c75cf995b5f26 | [
"MIT"
] | 59 | 2015-02-02T03:07:37.000Z | 2021-11-22T12:05:42.000Z | /*
This file is part of LIA_RAL which is a set of software based on ALIZE
toolkit for speaker recognition. ALIZE toolkit is required to use LIA_RAL.
LIA_RAL project is a development project was initiated by the computer
science laboratory of Avignon / France (Laboratoire Informatique d'Avignon -
LIA) [http://lia.univ-... | 38.25 | 157 | 0.738714 | ibillxia |
e26042f9449b0823eb335f28e928b306f14eff0e | 729 | cpp | C++ | Sources/Internal/Concurrency/SyncBarrier.cpp | stinvi/dava.engine | 2b396ca49cdf10cdc98ad8a9ffcf7768a05e285e | [
"BSD-3-Clause"
] | 26 | 2018-09-03T08:48:22.000Z | 2022-02-14T05:14:50.000Z | Sources/Internal/Concurrency/SyncBarrier.cpp | ANHELL-blitz/dava.engine | ed83624326f000866e29166c7f4cccfed1bb41d4 | [
"BSD-3-Clause"
] | null | null | null | Sources/Internal/Concurrency/SyncBarrier.cpp | ANHELL-blitz/dava.engine | ed83624326f000866e29166c7f4cccfed1bb41d4 | [
"BSD-3-Clause"
] | 45 | 2018-05-11T06:47:17.000Z | 2022-02-03T11:30:55.000Z | #include "Concurrency/SyncBarrier.h"
#include "Concurrency/UniqueLock.h"
#include "Debug/DVAssert.h"
namespace DAVA
{
SyncBarrier::SyncBarrier(size_t threadCount)
: threadCount(threadCount)
{
DVASSERT(threadCount > 0);
}
void SyncBarrier::Wait()
{
UniqueLock<Mutex> lock(mutex);
int curGeneration = gen... | 19.702703 | 73 | 0.640604 | stinvi |
e263fe91ac589101548d684bb3d377352e6c30d8 | 322 | cpp | C++ | C++/functions.cpp | tonmarcondes/UNIVESP | a66a623d4811e8f3f9e2999f09e38a4470035ae2 | [
"MIT"
] | null | null | null | C++/functions.cpp | tonmarcondes/UNIVESP | a66a623d4811e8f3f9e2999f09e38a4470035ae2 | [
"MIT"
] | null | null | null | C++/functions.cpp | tonmarcondes/UNIVESP | a66a623d4811e8f3f9e2999f09e38a4470035ae2 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int sum(int n1, int n2){
return (n1 + n2);
}
int sub(int n1, int n2){
return (n1 - n2);
}
int mult(int n1, int n2){
return (n1 * n2);
}
int divi(int n1, int n2){
return (n1 / n2);
}
int main(){
int a = 5, b = 3;... | 15.333333 | 29 | 0.47205 | tonmarcondes |
e265b2420512b8600bc2c47fea6ea6a321c2b56c | 218 | hpp | C++ | src/so_dll_file_execute/SharedLibrary.hpp | hahn-will/simple-cpp-unit | bf77c066ac881dfceffb5f1cbd3ab92e63b9229f | [
"MIT"
] | null | null | null | src/so_dll_file_execute/SharedLibrary.hpp | hahn-will/simple-cpp-unit | bf77c066ac881dfceffb5f1cbd3ab92e63b9229f | [
"MIT"
] | null | null | null | src/so_dll_file_execute/SharedLibrary.hpp | hahn-will/simple-cpp-unit | bf77c066ac881dfceffb5f1cbd3ab92e63b9229f | [
"MIT"
] | null | null | null | #ifndef SHARED_LIBRARY_HPP__
#define SHARED_LIBRARY_HPP__
class SharedLibrary {
public:
SharedLibrary(const char *);
~SharedLibrary();
void Execute(const char *);
private:
void *handle;
};
#endif
| 15.571429 | 32 | 0.701835 | hahn-will |
e26b229dcf12e3eb516c74d6cf19463a496c5808 | 5,979 | cpp | C++ | test/info/iterators/iterator_impl/dereference.cpp | arkantos493/MPICXX | ffbaeaaa3c7248e2087c3716ec71e0612aafe689 | [
"MIT"
] | 1 | 2020-10-20T06:53:05.000Z | 2020-10-20T06:53:05.000Z | test/info/iterators/iterator_impl/dereference.cpp | arkantos493/MPICXX | ffbaeaaa3c7248e2087c3716ec71e0612aafe689 | [
"MIT"
] | null | null | null | test/info/iterators/iterator_impl/dereference.cpp | arkantos493/MPICXX | ffbaeaaa3c7248e2087c3716ec71e0612aafe689 | [
"MIT"
] | 1 | 2020-08-13T17:46:40.000Z | 2020-08-13T17:46:40.000Z | /**
* @file
* @author Marcel Breyer
* @date 2020-08-04
* @copyright This file is distributed under the MIT License.
*
* @brief Test cases for the dereference operations of the @ref mpicxx::info::iterator and @ref mpicxx::info::const_iterator class.
* @details Testsuite: *InfoIteratorImplTest*
* | test case name... | 43.326087 | 169 | 0.61231 | arkantos493 |
e26d0eff4ad1ffcf518e272e05423dd74d565745 | 1,012 | hpp | C++ | src/core/output_interface.hpp | tp-ntouran/mocc | 77d386cdf341b1a860599ff7c6e4017d46e0b102 | [
"Apache-2.0"
] | 11 | 2016-03-31T17:46:15.000Z | 2022-02-14T01:07:56.000Z | src/core/output_interface.hpp | tp-ntouran/mocc | 77d386cdf341b1a860599ff7c6e4017d46e0b102 | [
"Apache-2.0"
] | 3 | 2016-04-04T16:40:47.000Z | 2019-10-16T22:22:54.000Z | src/core/output_interface.hpp | tp-ntouran/mocc | 77d386cdf341b1a860599ff7c6e4017d46e0b102 | [
"Apache-2.0"
] | 3 | 2019-10-16T22:20:15.000Z | 2019-11-28T11:59:03.000Z | /*
Copyright 2016 Mitchell Young
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 ... | 28.914286 | 75 | 0.720356 | tp-ntouran |
e26d4bfce6693225c9758ea419633ba421ff0859 | 5,492 | cpp | C++ | FLTK_utils/FLTK_test/UtilSources/DrawUtils/gltest.cpp | robgrzel/offshore | 5698524aad809ce075104b7d6954a729ef9d1bcd | [
"MIT"
] | null | null | null | FLTK_utils/FLTK_test/UtilSources/DrawUtils/gltest.cpp | robgrzel/offshore | 5698524aad809ce075104b7d6954a729ef9d1bcd | [
"MIT"
] | null | null | null | FLTK_utils/FLTK_test/UtilSources/DrawUtils/gltest.cpp | robgrzel/offshore | 5698524aad809ce075104b7d6954a729ef9d1bcd | [
"MIT"
] | null | null | null | #include "gltest.h"
//cube
const GLfloat l = 30.0f;
const GLfloat d = -l / sqrtf( 3.f * l * l );
GLfloat cube[8 * 10] = {
-l, l, l, 0.0, 1.0, 1.0, 1.0, -d, d, d * 0,//0
l, l, l, 1.0, 1.0, 1.0, 1.0, d, d, d * 0,//1
l, l, -l, 1.0, 1.0, 0.0, 1.0, d, d, -d * 0,//2
-l, l... | 27.59799 | 113 | 0.563911 | robgrzel |
e27125c6ff564461d081589d3a3f736b0a5f4a14 | 6,271 | cpp | C++ | MARS geofencing/Library/PackageCache/com.unity.mars-ar-foundation-providers@1.3.1/NativePlugin~/Source/TrackingProvider.cpp | bsides44/MARSGeofencing | 23f1ff88ac8be3db558f43d68813528a587225bf | [
"Apache-2.0"
] | null | null | null | MARS geofencing/Library/PackageCache/com.unity.mars-ar-foundation-providers@1.3.1/NativePlugin~/Source/TrackingProvider.cpp | bsides44/MARSGeofencing | 23f1ff88ac8be3db558f43d68813528a587225bf | [
"Apache-2.0"
] | null | null | null | MARS geofencing/Library/PackageCache/com.unity.mars-ar-foundation-providers@1.3.1/NativePlugin~/Source/TrackingProvider.cpp | bsides44/MARSGeofencing | 23f1ff88ac8be3db558f43d68813528a587225bf | [
"Apache-2.0"
] | null | null | null | #include "TrackingProvider.h"
#include "ProviderContext.h"
#include "XR/UnitySubsystemTypes.h"
static UnityXRPose sPose;
UnitySubsystemErrorCode MARSTrackingProvider::Initialize()
{
return kUnitySubsystemErrorCodeSuccess;
}
UnitySubsystemErrorCode MARSTrackingProvider::Start()
{
m_Ctx.input->InputSubsystem_... | 39.19375 | 218 | 0.768617 | bsides44 |
e2739528d88ee6067282136995ab2d38cc70c3c7 | 7,508 | cpp | C++ | ork.core/src/reflect_parser.cpp | tweakoz/micro_ork | 66f69d5866ca30dc6066c2dacdb7bbc5b8aa73e7 | [
"MIT"
] | null | null | null | ork.core/src/reflect_parser.cpp | tweakoz/micro_ork | 66f69d5866ca30dc6066c2dacdb7bbc5b8aa73e7 | [
"MIT"
] | null | null | null | ork.core/src/reflect_parser.cpp | tweakoz/micro_ork | 66f69d5866ca30dc6066c2dacdb7bbc5b8aa73e7 | [
"MIT"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
// MicroOrk (Orkid)
// Copyright 1996-2013, Michael T. Mayers
// Provided under the MIT License (see LICENSE.txt)
///////////////////////////////////////////////////////////////////////////////
#include <ork/reflect.h>
#include <rapidjson/... | 31.813559 | 107 | 0.420751 | tweakoz |
e27bcbb19af91529576fdd0421f79b906c2dd3b6 | 245 | cpp | C++ | test/linqcppTestFixture.cpp | baguapro/linqcpp | 8caa1f6c57f87e618eab8d01a95e348013c1ac7d | [
"MIT"
] | null | null | null | test/linqcppTestFixture.cpp | baguapro/linqcpp | 8caa1f6c57f87e618eab8d01a95e348013c1ac7d | [
"MIT"
] | null | null | null | test/linqcppTestFixture.cpp | baguapro/linqcpp | 8caa1f6c57f87e618eab8d01a95e348013c1ac7d | [
"MIT"
] | null | null | null | #include "linqcppTestFixture.h"
namespace linqcpp_test_fixture
{
bool operator==(const LinqTest::person &lhs, const LinqTest::person &rhs)
{
return (lhs.first_name_ == rhs.first_name_ &&
lhs.last_name_ == rhs.last_name_);
}
}
| 18.846154 | 73 | 0.697959 | baguapro |
e286e78e83b7d023bae8c2b9436450acf6f5b303 | 35 | cc | C++ | src/search/per_state_information.cc | nitinkaveriappa/downward | 5c9a1b5111d667bb96f94da61ca2a45b1b70bb83 | [
"MIT"
] | 5 | 2020-08-24T07:29:59.000Z | 2020-08-30T14:22:47.000Z | src/search/per_state_information.cc | nitinkaveriappa/downward | 5c9a1b5111d667bb96f94da61ca2a45b1b70bb83 | [
"MIT"
] | 9 | 2020-09-03T18:58:53.000Z | 2020-10-14T11:42:12.000Z | src/search/per_state_information.cc | nitinkaveriappa/downward | 5c9a1b5111d667bb96f94da61ca2a45b1b70bb83 | [
"MIT"
] | 4 | 2018-01-16T00:00:22.000Z | 2019-11-01T23:35:01.000Z | #include "per_state_information.h"
| 17.5 | 34 | 0.828571 | nitinkaveriappa |
e28ce1928781247e12aa0ddc482cfcb689a258d5 | 2,240 | cpp | C++ | software/src/master/src/kernel/Vca_VInterfaceMember.cpp | c-kuhlman/vision | 46b25f7c0da703c059acc8f0a2eac1d5badf9f6d | [
"BSD-3-Clause"
] | 30 | 2016-10-07T15:23:35.000Z | 2020-03-25T20:01:30.000Z | src/kernel/Vca_VInterfaceMember.cpp | MichaelJCaruso/vision-software-src-master | 12b1b4f12a7531fe6e3cbb6861b40ac8e1985b92 | [
"BSD-3-Clause"
] | 30 | 2016-10-31T19:48:08.000Z | 2021-04-28T01:31:53.000Z | software/src/master/src/kernel/Vca_VInterfaceMember.cpp | c-kuhlman/vision | 46b25f7c0da703c059acc8f0a2eac1d5badf9f6d | [
"BSD-3-Clause"
] | 15 | 2016-10-07T16:44:13.000Z | 2021-06-21T18:47:55.000Z | /***** Vca_VInterfaceMember Implementation *****/
/************************
************************
***** Interfaces *****
************************
************************/
/********************
***** System *****
********************/
#include "Vk.h"
/******************
***** Self *****
*********... | 24.888889 | 90 | 0.394196 | c-kuhlman |
e291c15f5df610b2b23c7757327f6df6314093c6 | 3,723 | cpp | C++ | qt-creator-opensource-src-4.6.1/src/plugins/qmlprofiler/tests/qmlprofilerconfigwidget_test.cpp | kevinlq/Qt-Creator-Opensource-Study | b8cadff1f33f25a5d4ef33ed93f661b788b1ba0f | [
"MIT"
] | 5 | 2018-12-22T14:49:13.000Z | 2022-01-13T07:21:46.000Z | qt-creator-opensource-src-4.6.1/src/plugins/qmlprofiler/tests/qmlprofilerconfigwidget_test.cpp | kevinlq/Qt-Creator-Opensource-Study | b8cadff1f33f25a5d4ef33ed93f661b788b1ba0f | [
"MIT"
] | null | null | null | qt-creator-opensource-src-4.6.1/src/plugins/qmlprofiler/tests/qmlprofilerconfigwidget_test.cpp | kevinlq/Qt-Creator-Opensource-Study | b8cadff1f33f25a5d4ef33ed93f661b788b1ba0f | [
"MIT"
] | 8 | 2018-07-17T03:55:48.000Z | 2021-12-22T06:37:53.000Z | /****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of Qt Creator.
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance w... | 38.381443 | 77 | 0.711254 | kevinlq |
e295cac5ef1d5c4df2a2c6046444e13df364d221 | 6,686 | cxx | C++ | Examples/TrackerConfiguration/igstkPolarisTrackerConfiguration.cxx | ipa/IGSTK | d31f77b04aa72469e18e8a989ed8316bad39ed7a | [
"BSD-3-Clause"
] | 5 | 2016-02-12T18:55:20.000Z | 2022-02-05T09:23:07.000Z | Examples/TrackerConfiguration/igstkPolarisTrackerConfiguration.cxx | ipa/IGSTK | d31f77b04aa72469e18e8a989ed8316bad39ed7a | [
"BSD-3-Clause"
] | 1 | 2018-01-26T10:39:31.000Z | 2018-01-26T10:39:31.000Z | Examples/TrackerConfiguration/igstkPolarisTrackerConfiguration.cxx | ipa/IGSTK | d31f77b04aa72469e18e8a989ed8316bad39ed7a | [
"BSD-3-Clause"
] | 4 | 2017-09-24T01:19:32.000Z | 2021-06-20T18:02:42.000Z | /*=========================================================================
Program: Image Guided Surgery Software Toolkit
Module: igstkPolarisTrackerConfiguration.cxx
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) ISC Insight Software Consortium. All rights reserved.
See IG... | 27.068826 | 80 | 0.67918 | ipa |
e29c17244aa2d5558191758b3e6850e35433a2fd | 797 | cpp | C++ | test/utils/wasm_engine.cpp | herobank110/fizzy | b58d6e6f7e6c26a07600f10d267695b00cf49470 | [
"Apache-2.0"
] | 1 | 2022-03-19T05:59:46.000Z | 2022-03-19T05:59:46.000Z | test/utils/wasm_engine.cpp | herobank110/fizzy | b58d6e6f7e6c26a07600f10d267695b00cf49470 | [
"Apache-2.0"
] | null | null | null | test/utils/wasm_engine.cpp | herobank110/fizzy | b58d6e6f7e6c26a07600f10d267695b00cf49470 | [
"Apache-2.0"
] | null | null | null | // Fizzy: A fast WebAssembly interpreter
// Copyright 2020 The Fizzy Authors.
// SPDX-License-Identifier: Apache-2.0
#include "wasm_engine.hpp"
#include <stdexcept>
#include <string>
namespace fizzy::test
{
WasmEngine::~WasmEngine() noexcept = default;
void validate_function_signature(std::string_view signature)
{
... | 33.208333 | 83 | 0.697616 | herobank110 |
e2a2aa320af300ebca72a89177a3191d39d5f67b | 529 | cpp | C++ | biweekly/70/solution_4_1.cpp | Cuda-Chen/leetcode_contests | 8bd10c5d4ed6d2c5fdcb382545ca2a9ff2ebf2a4 | [
"MIT"
] | null | null | null | biweekly/70/solution_4_1.cpp | Cuda-Chen/leetcode_contests | 8bd10c5d4ed6d2c5fdcb382545ca2a9ff2ebf2a4 | [
"MIT"
] | null | null | null | biweekly/70/solution_4_1.cpp | Cuda-Chen/leetcode_contests | 8bd10c5d4ed6d2c5fdcb382545ca2a9ff2ebf2a4 | [
"MIT"
] | null | null | null | // https://leetcode.com/problems/number-of-ways-to-divide-a-long-corridor/discuss/1709725/JavaC%2B%2BPython-Two-Solutions-with-Explanation
// combination
class Solution {
public:
int numberOfWays(string s) {
long ans = 1, j = 0, k = 0, mod = 1e9 + 7;
for(int i = 0; i < s.size(); i++) {
... | 29.388889 | 138 | 0.451796 | Cuda-Chen |
e2a650d576f92bb53e312764dd95f29a464338bf | 12,479 | cc | C++ | main/src/PolygonTriangularization/poly_triang.cc | marcomanno/ploygon_triangulation | c98b99e3f9598252ffc27eb202939f0183ac872b | [
"Apache-2.0"
] | null | null | null | main/src/PolygonTriangularization/poly_triang.cc | marcomanno/ploygon_triangulation | c98b99e3f9598252ffc27eb202939f0183ac872b | [
"Apache-2.0"
] | null | null | null | main/src/PolygonTriangularization/poly_triang.cc | marcomanno/ploygon_triangulation | c98b99e3f9598252ffc27eb202939f0183ac872b | [
"Apache-2.0"
] | null | null | null | #include "poly_triang.hh"
#include "Geo/area.hh"
#include "Geo/entity.hh"
#include "Geo/plane_fitting.hh"
#include "Geo/linear_system.hh"
#include "Geo/point_in_polygon.hh"
#include "Geo/tolerance.hh"
#include "Utils/circular.hh"
#include "Utils/statistics.hh"
#include <Utils/error_handling.hh>
#include <nume... | 30.36253 | 110 | 0.551006 | marcomanno |
e2aa237e30f08292db1a198cd79e25426fb72683 | 4,686 | hpp | C++ | Matrix.hpp | 7Mersenne/NNplusplus | 6387a73fcfe1a77ad703799272664f3a5d4cb0ff | [
"MIT"
] | 266 | 2016-08-26T04:43:42.000Z | 2022-03-31T17:54:29.000Z | Matrix.hpp | 7Mersenne/NNplusplus | 6387a73fcfe1a77ad703799272664f3a5d4cb0ff | [
"MIT"
] | 2 | 2016-08-29T14:23:31.000Z | 2022-01-07T13:50:41.000Z | Matrix.hpp | stagadish/NNplusplus | 12d1916d7e5fc0f15226f2472e96f0e9754ec02b | [
"MIT"
] | 40 | 2016-08-26T23:26:40.000Z | 2020-07-17T07:31:14.000Z | //
// Matrix.hpp
// Neural Net
//
// A matrix object, which includes basic operations such as
// matrix transpose and dot product.
//
// Created by Gil Dekel on 8/19/16.
// Last edited by Gil Dekel on 8/30/16.
//
#ifndef MATRIX_HPP_
#define MATRIX_HPP_
#include <iostream>
#include <utility> // std::swa... | 27.727811 | 67 | 0.580026 | 7Mersenne |
e2ab32a047a7ae5f821192bce53efc7594f8a447 | 5,471 | cxx | C++ | src/dgate/dicomlib/safemem.cxx | theorose49/conquest-dicom-server | aba35e1da51d7bb288ecde0f31d6963f47b8252c | [
"Apache-2.0"
] | null | null | null | src/dgate/dicomlib/safemem.cxx | theorose49/conquest-dicom-server | aba35e1da51d7bb288ecde0f31d6963f47b8252c | [
"Apache-2.0"
] | 6 | 2021-06-09T19:39:27.000Z | 2021-09-30T16:41:40.000Z | radiomicsfeatureextractionpipeline/conquest/src/dgate/dicomlib/safemem.cxx | Maastro-CDS-Imaging-Group/SQLite4Radiomics | e3a7afc181eec0fe04c18da00edc3772064e6758 | [
"Apache-2.0"
] | null | null | null | /*
20010720 ljz Changed 'printf' to 'fprintf(stderr,...)'
*/
/****************************************************************************
Copyright (C) 1995, University of California, Davis
THIS SOFTWARE IS MADE AVAILABLE, AS IS, AND THE UNIVERSITY
OF CALIFORNIA DOES NOT MAKE ANY WAR... | 20.262963 | 77 | 0.595504 | theorose49 |
e2abd3e067035ea7c9ffd7dd2a3b4bafac9ff8a2 | 3,465 | hpp | C++ | Sources/DSPHeaders/include/DSPHeaders/SampleBuffer.hpp | bradhowes/AUv3Support | 828258715de2144914ef08434a9db78ca62b5484 | [
"MIT"
] | 1 | 2022-03-15T04:54:16.000Z | 2022-03-15T04:54:16.000Z | Sources/DSPHeaders/include/DSPHeaders/SampleBuffer.hpp | bradhowes/AUv3Support | 828258715de2144914ef08434a9db78ca62b5484 | [
"MIT"
] | null | null | null | Sources/DSPHeaders/include/DSPHeaders/SampleBuffer.hpp | bradhowes/AUv3Support | 828258715de2144914ef08434a9db78ca62b5484 | [
"MIT"
] | null | null | null | // Copyright © 2021 Brad Howes. All rights reserved.
#pragma once
#import <string>
#import <os/log.h>
#import <AudioToolbox/AudioToolbox.h>
#import <AudioUnit/AudioUnit.h>
#import <AVFoundation/AVFoundation.h>
#import "DSPHeaders/BufferFacet.hpp"
namespace DSPHeaders {
/**
Maintains a buffer of PCM samples which... | 31.788991 | 119 | 0.730447 | bradhowes |
e2aca06de8555cd58a112d73ed2213edb5ebaaa5 | 495 | cc | C++ | test/sdk/crypto/hash-test.cc | iot-dsa-v2/sdk-dslink-cpp | d7734fba02237bd11bc887058f4d9573aac598d8 | [
"Apache-2.0"
] | 1 | 2018-02-09T21:20:31.000Z | 2018-02-09T21:20:31.000Z | test/sdk/crypto/hash-test.cc | iot-dsa-v2/sdk-dslink-cpp | d7734fba02237bd11bc887058f4d9573aac598d8 | [
"Apache-2.0"
] | 7 | 2017-11-20T22:22:12.000Z | 2018-03-21T13:00:06.000Z | test/sdk/crypto/hash-test.cc | iot-dsa-v2/sdk-dslink-cpp | d7734fba02237bd11bc887058f4d9573aac598d8 | [
"Apache-2.0"
] | null | null | null | #include "dsa/crypto.h"
#include <gtest/gtest.h>
using namespace dsa;
TEST(HashTest, update__digest_base64CallTwice) {
ECDH ecdh;
std::vector<uint8_t> public_key = ecdh.get_public_key();
Hash hash;
hash.update(public_key);
hash.digest_base64();
EXPECT_THROW(
{
try {
hash.digest_b... | 19.8 | 58 | 0.610101 | iot-dsa-v2 |
e2add83da5f3ee4ff9a541f3af4de11074dd6d8c | 1,931 | cpp | C++ | files/source/mischacks.cpp | Luminyx1/NewerSMBU | 66c719b0afab0c5db5e26b8114d3fc02c15c7300 | [
"MIT"
] | 7 | 2021-05-22T21:59:42.000Z | 2022-01-03T16:33:03.000Z | files/source/mischacks.cpp | Luminyx1/NewerSMBU | 66c719b0afab0c5db5e26b8114d3fc02c15c7300 | [
"MIT"
] | null | null | null | files/source/mischacks.cpp | Luminyx1/NewerSMBU | 66c719b0afab0c5db5e26b8114d3fc02c15c7300 | [
"MIT"
] | 2 | 2021-05-24T03:38:18.000Z | 2021-08-12T01:25:36.000Z |
#include "game.h"
#include "neweru.h"
#include "zlib.h"
void *allocZlib(void *opaque, uInt items, uInt size) {
return ((sead::Heap *)opaque)->tryAlloc(items * size, 2);
}
void freeZlib(void *opaque, void *address) {
((sead::Heap *)opaque)->free(address);
}
int decompZlib(Byte *outPtr, u32 outSize, Byte *inPtr, u3... | 25.746667 | 86 | 0.695495 | Luminyx1 |
e2af83b20b9544095709d083018acc3f1af13b0d | 3,410 | cpp | C++ | src/main.cpp | huckor/BER_TLV | e7ccc1981368ac5f1f5bdcd6fa6f04e5c6ff049f | [
"MIT"
] | 2 | 2017-03-15T18:05:18.000Z | 2021-05-14T05:16:46.000Z | src/main.cpp | huckor/BER_TLV | e7ccc1981368ac5f1f5bdcd6fa6f04e5c6ff049f | [
"MIT"
] | 1 | 2017-03-15T18:37:26.000Z | 2017-03-20T14:19:08.000Z | src/main.cpp | huckor/BER_TLV | e7ccc1981368ac5f1f5bdcd6fa6f04e5c6ff049f | [
"MIT"
] | null | null | null | #include <iostream>
#include "BerTlv.h"
#include "Conv.h"
#include "Global.h"
#include <sys/time.h>
//Add to vector starting byte of 2 bytes long tags
std::vector<std::string> GetTwoBytesTags()
{
std::vector<std::string> Return;
Return.push_back("9F");
Return.push_back("5F");
Return.push_back("BF"... | 31.574074 | 633 | 0.695894 | huckor |
e2afc92603892aba5b80fe3a791e2afd512a9104 | 3,089 | hpp | C++ | tuple/apply.hpp | 5cript/mpl14 | 4c6da6b8bce1f57b0df8c4ef456fe03a61982cad | [
"MIT"
] | null | null | null | tuple/apply.hpp | 5cript/mpl14 | 4c6da6b8bce1f57b0df8c4ef456fe03a61982cad | [
"MIT"
] | null | null | null | tuple/apply.hpp | 5cript/mpl14 | 4c6da6b8bce1f57b0df8c4ef456fe03a61982cad | [
"MIT"
] | null | null | null | #ifndef MPLEX_TUPLE_APPLY_HPP_INCLUDED
#define MPLEX_TUPLE_APPLY_HPP_INCLUDED
#include <utility>
#include "back.hpp"
#include "front.hpp"
#include "pop_back.hpp"
#include "pop_front.hpp"
// Can be used to apply tuples as parameters to variadic templates.
namespace mplex
{
/** @param Tuple A tuple.... | 34.322222 | 119 | 0.64066 | 5cript |
e2b1178d9fbb9ce857eee8691e0037a80e2efced | 10,800 | cxx | C++ | libdnnf/src/cnf2dnnf.cxx | miquelramirez/t1 | 6696db1d1e12f93811dc17b8d921a19a75b549b5 | [
"Apache-2.0"
] | null | null | null | libdnnf/src/cnf2dnnf.cxx | miquelramirez/t1 | 6696db1d1e12f93811dc17b8d921a19a75b549b5 | [
"Apache-2.0"
] | null | null | null | libdnnf/src/cnf2dnnf.cxx | miquelramirez/t1 | 6696db1d1e12f93811dc17b8d921a19a75b549b5 | [
"Apache-2.0"
] | null | null | null | #include <fstream>
#include <fcntl.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <signal.h>
#include <sys/time.h>
#include <unistd.h>
#include <unistd.h>
#include <errno.h>
#include <cstdio>
#include <cctype>
#include <iostream>
#include <libdnnf/cnf2dnnf.hxx>
#include <libdnnf/string_o... | 25.116279 | 103 | 0.615556 | miquelramirez |
e2b4da49f111abc7c299c97f5772b5396271244e | 1,914 | cpp | C++ | src/day2.cpp | ajpocus/advent-of-code-2020 | 1252a723c82efd37ce19a174843db04b81d2eae7 | [
"CC-BY-4.0"
] | 1 | 2021-04-10T05:49:05.000Z | 2021-04-10T05:49:05.000Z | src/day2.cpp | ajpocus/advent-of-code-2020 | 1252a723c82efd37ce19a174843db04b81d2eae7 | [
"CC-BY-4.0"
] | null | null | null | src/day2.cpp | ajpocus/advent-of-code-2020 | 1252a723c82efd37ce19a174843db04b81d2eae7 | [
"CC-BY-4.0"
] | null | null | null | #include <iostream>
#include <fstream>
#include <vector>
#include <regex>
using namespace std;
regex parser_regex("(\\d+)-(\\d+) (\\w): (\\w+)");
int count_passwords(vector<string> input) {
int cnt = 0;
for (string line: input) {
smatch matches;
regex_match(line, matches, parser_regex);
int lower_bo... | 23.341463 | 142 | 0.640543 | ajpocus |
e2bbd2131fa29795e20dfc5fb57d095031751bc7 | 15,341 | cpp | C++ | material_io.cpp | 2-tuple/Engine | 5bae92a379caafa93db912802a3790305c8b85d3 | [
"MIT"
] | 1 | 2019-06-20T21:44:19.000Z | 2019-06-20T21:44:19.000Z | material_io.cpp | 2-tuple/Engine | 5bae92a379caafa93db912802a3790305c8b85d3 | [
"MIT"
] | null | null | null | material_io.cpp | 2-tuple/Engine | 5bae92a379caafa93db912802a3790305c8b85d3 | [
"MIT"
] | null | null | null | #include "material_io.h"
#include "file_io.h"
#include "shader_def.h"
#include "stack_alloc.h"
#include "shader_def.h"
#include "profile.h"
#include <stdio.h>
#include <string.h>
int32_t
GetLine(char** Line, int* LineLength, char* CharArray, int ArraySize, int* CharCounter)
{
*Line = &CharArray[*CharCounter];... | 28.728464 | 100 | 0.57656 | 2-tuple |
e2be1b56d969615e5fe024dd6b2aa53d3114230b | 558 | cpp | C++ | EJERCICIOS/EJERCICIO C++/ejercicio34-nombre completo.cpp | dianaM182/cpp | 45b0e688b00f5a6f4483aba13904b5d760806726 | [
"MIT"
] | null | null | null | EJERCICIOS/EJERCICIO C++/ejercicio34-nombre completo.cpp | dianaM182/cpp | 45b0e688b00f5a6f4483aba13904b5d760806726 | [
"MIT"
] | null | null | null | EJERCICIOS/EJERCICIO C++/ejercicio34-nombre completo.cpp | dianaM182/cpp | 45b0e688b00f5a6f4483aba13904b5d760806726 | [
"MIT"
] | null | null | null | #include <iostream>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
string nombrecompleto(string nombre, string apellido){
return nombre+apellido;
}
int main(int argc, char** argv) {
string primernombre=" ";
string primerapellido... | 25.363636 | 101 | 0.697133 | dianaM182 |
e2c182ae395608e688e292327d96856a359889c5 | 10,803 | cpp | C++ | enduser/zone_internetgames/src/client/shell/test/stress/stresscore.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | enduser/zone_internetgames/src/client/shell/test/stress/stresscore.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | enduser/zone_internetgames/src/client/shell/test/stress/stresscore.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | // StressCore.cpp : Implementation of CStressCore
#include "stdafx.h"
#include "StressCore.h"
#include "ZoneEvent.h"
#include "KeyName.h"
#include "ZoneUtil.h"
#include "zeeverm.h"
//#include "zProxy.h"
inline DECLARE_MAYBE_FUNCTION(HRESULT, GetVersionPack, (char *a, ZeeVerPack *b), (a, b), zeeverm, E_NOTIMPL... | 28.428947 | 275 | 0.613811 | npocmaka |
e2ca2e50fa5d2828ef6489287119592c8664b1fa | 2,395 | cpp | C++ | src/game/projectile/laser.cpp | runouw/Starfox-School-Project | 5645f76ecf4f642080c08b594531ab3072879827 | [
"Apache-2.0"
] | 1 | 2017-06-30T00:28:31.000Z | 2017-06-30T00:28:31.000Z | src/game/projectile/laser.cpp | runouw/Starfox-School-Project | 5645f76ecf4f642080c08b594531ab3072879827 | [
"Apache-2.0"
] | null | null | null | src/game/projectile/laser.cpp | runouw/Starfox-School-Project | 5645f76ecf4f642080c08b594531ab3072879827 | [
"Apache-2.0"
] | null | null | null | #include "projectiles.h"
#include <rtools\ai\model.h>
#include <rtools\ai\mesh.h>
#include <rtools\ai\material.h>
#include <rtools\utils.h>
#include <game\models\arwing.h>
#include <rtools\post\deferred.h>
#include <game\engine.h>
#include <game\particle\particlebank.h>
#include <game\models\model_laser.h>
#incl... | 24.438776 | 117 | 0.643424 | runouw |
e2d03f3e5dcf16aa945914d7f012edbe0cbf058e | 1,980 | hpp | C++ | src/data/vData.hpp | danielnavarrogomez/Anaquin | 563dbeb25aff15a55e4309432a967812cbfa0c98 | [
"BSD-3-Clause"
] | null | null | null | src/data/vData.hpp | danielnavarrogomez/Anaquin | 563dbeb25aff15a55e4309432a967812cbfa0c98 | [
"BSD-3-Clause"
] | null | null | null | src/data/vData.hpp | danielnavarrogomez/Anaquin | 563dbeb25aff15a55e4309432a967812cbfa0c98 | [
"BSD-3-Clause"
] | null | null | null | #ifndef VCF_DATA_HPP
#define VCF_DATA_HPP
#include "tools/tools.hpp"
//#include "data/standard.hpp"
#include "parsers/parser_vcf.hpp"
namespace Anaquin
{
typedef long VarKey;
struct VDataData
{
std::map<Base, Variant> b2v;
std::map<Variation, std::set<Variant>> m2v;
};
struct... | 22.758621 | 85 | 0.441919 | danielnavarrogomez |
e2d31184b32e7dcc330be0791565123b136d6ff7 | 6,243 | cpp | C++ | src/libraries/regionModels/regionCoupling/derivedFvPatchFields/filmPyrolysisTemperatureCoupled/filmPyrolysisTemperatureCoupledFvPatchScalarField.cpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | src/libraries/regionModels/regionCoupling/derivedFvPatchFields/filmPyrolysisTemperatureCoupled/filmPyrolysisTemperatureCoupledFvPatchScalarField.cpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | src/libraries/regionModels/regionCoupling/derivedFvPatchFields/filmPyrolysisTemperatureCoupled/filmPyrolysisTemperatureCoupledFvPatchScalarField.cpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | /*---------------------------------------------------------------------------*\
Copyright (C) 2011 OpenFOAM Foundation
-------------------------------------------------------------------------------
License
This file is part of CAELUS.
CAELUS is free software: you can redistribute it and/or modify it
under... | 28.637615 | 79 | 0.669069 | MrAwesomeRocks |
e2d4c1d5afa55aa534cd6fae29f6636e2c70e85b | 38,149 | cxx | C++ | osprey/common/com/dwarf_DST_dump.cxx | sharugupta/OpenUH | daddd76858a53035f5d713f648d13373c22506e8 | [
"BSD-2-Clause"
] | null | null | null | osprey/common/com/dwarf_DST_dump.cxx | sharugupta/OpenUH | daddd76858a53035f5d713f648d13373c22506e8 | [
"BSD-2-Clause"
] | null | null | null | osprey/common/com/dwarf_DST_dump.cxx | sharugupta/OpenUH | daddd76858a53035f5d713f648d13373c22506e8 | [
"BSD-2-Clause"
] | null | null | null | /*
* Copyright 2003, 2004, 2005, 2006 PathScale, Inc. All Rights Reserved.
*/
/*
Copyright (C) 2000, 2001 Silicon Graphics, Inc. All Rights Reserved.
This program is free software; you can redistribute it and/or modify it
under the terms of version 2 of the GNU General Public License as
published by the ... | 28.112749 | 97 | 0.705576 | sharugupta |
e2d7fb49e17edc6fad629d3b02ce7490643c93cb | 1,486 | hpp | C++ | sample/sample_mandelbrot.hpp | matazure/mtensor | 4289284b201cb09ed1dfc49f44d6738751affd63 | [
"MIT"
] | 82 | 2020-04-11T09:33:36.000Z | 2022-03-23T03:47:25.000Z | sample/sample_mandelbrot.hpp | Lexxos/mtensor | feb120923dad3fb4ae3b31dd09931622a63c3d06 | [
"MIT"
] | 28 | 2017-04-26T17:12:35.000Z | 2019-04-08T04:05:24.000Z | sample/sample_mandelbrot.hpp | Lexxos/mtensor | feb120923dad3fb4ae3b31dd09931622a63c3d06 | [
"MIT"
] | 22 | 2017-01-10T14:57:29.000Z | 2019-12-17T08:55:59.000Z | #pragma once
#include <mtensor.hpp>
#include <stdexcept>
#include "image_helper.hpp"
#include "sample_mandelbrot.hpp"
using namespace matazure;
struct mandelbrot_functor {
mandelbrot_functor(pointi<2> shape) : shape(shape) {}
//曼德勃罗算子， MATAZURE_GENERAL可以同时支持host和device
MATAZURE_GENERAL point<byte, 3> op... | 33.022222 | 98 | 0.558546 | matazure |
e2d9ec25a61c54b250a6387ac7cdbc990b216574 | 686 | cpp | C++ | SGE/src/SGE/Renderer/VertexArray.cpp | Stealthhyy/SGE | e56560a93a4d7c9aac2a525240be6d4d9ba3d4e7 | [
"Apache-2.0"
] | 1 | 2021-04-25T05:45:28.000Z | 2021-04-25T05:45:28.000Z | SGE/src/SGE/Renderer/VertexArray.cpp | Stealthhyy/SGE | e56560a93a4d7c9aac2a525240be6d4d9ba3d4e7 | [
"Apache-2.0"
] | null | null | null | SGE/src/SGE/Renderer/VertexArray.cpp | Stealthhyy/SGE | e56560a93a4d7c9aac2a525240be6d4d9ba3d4e7 | [
"Apache-2.0"
] | null | null | null | #include "sgepch.h"
#include "VertexArray.h"
#include "Renderer.h"
#include "Platform/OpenGL/OpenGLVertexArray.h"
#include "Platform/Vulkan/VulkanVertexArray.h"
namespace SGE
{
void VertexArray::Bind() const
{
}
void VertexArray::Unbind() const
{
}
Ref<VertexArray> VertexArray::Create()
{
switch (Rende... | 20.176471 | 109 | 0.72449 | Stealthhyy |
e2db55816a899a40fd12c78107ea2853a7e87a1e | 822 | cpp | C++ | 1258.cpp | gabrielld06/Exercicios-URI | 5a8146a0246cd133fac340b9d11dc60d88b8a94b | [
"MIT"
] | null | null | null | 1258.cpp | gabrielld06/Exercicios-URI | 5a8146a0246cd133fac340b9d11dc60d88b8a94b | [
"MIT"
] | null | null | null | 1258.cpp | gabrielld06/Exercicios-URI | 5a8146a0246cd133fac340b9d11dc60d88b8a94b | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
class camiseta {
public:
string name, cor;
char tam;
camiseta(string n, string c, char t) {
this->name = n;
this->cor = c;
this->tam = t;
}
bool operator <(const camiseta& x) {
if(cor != x.cor)
return cor < x.cor;
if(tam != x.tam)
return tam > x... | 15.222222 | 61 | 0.542579 | gabrielld06 |
e2de50bb8eb4e0031749dc7d69c773c226fb62e5 | 3,859 | cpp | C++ | src/aten/src/ATen/native/npu/ReplicationPad2dKernelNpu.cpp | Ascend/pytorch | 39849cf72dafe8d2fb68bd1679d8fd54ad60fcfc | [
"BSD-3-Clause"
] | 1 | 2021-12-02T03:07:35.000Z | 2021-12-02T03:07:35.000Z | src/aten/src/ATen/native/npu/ReplicationPad2dKernelNpu.cpp | Ascend/pytorch | 39849cf72dafe8d2fb68bd1679d8fd54ad60fcfc | [
"BSD-3-Clause"
] | 1 | 2021-11-12T07:23:03.000Z | 2021-11-12T08:28:13.000Z | src/aten/src/ATen/native/npu/ReplicationPad2dKernelNpu.cpp | Ascend/pytorch | 39849cf72dafe8d2fb68bd1679d8fd54ad60fcfc | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) 2020, Huawei Technologies.All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://opensource.org/licenses/BSD-3-Clause
//
// Unless required by appli... | 35.081818 | 107 | 0.743716 | Ascend |
e2e22341f47b237ac66f05e31e0b9460ffd37c2f | 6,905 | cpp | C++ | src/ui/Display.cpp | mcmatrix/cnc3018-offline-controller | 604e63a1f39e0742ba4f8c7e4cf2bad8d5b67e47 | [
"MIT"
] | 14 | 2021-09-10T18:33:43.000Z | 2022-02-12T12:00:20.000Z | src/ui/Display.cpp | mcmatrix/cnc3018-offline-controller | 604e63a1f39e0742ba4f8c7e4cf2bad8d5b67e47 | [
"MIT"
] | 7 | 2021-10-02T13:00:01.000Z | 2022-03-31T10:15:04.000Z | src/ui/Display.cpp | mcmatrix/cnc3018-offline-controller | 604e63a1f39e0742ba4f8c7e4cf2bad8d5b67e47 | [
"MIT"
] | 4 | 2021-09-15T11:56:24.000Z | 2022-02-14T12:11:30.000Z | #include "Display.h"
#include <Arduino.h>
#include "Screen.h"
#include "../devices/GrblDevice.h"
Display * Display::inst = nullptr;
uint16_t Display::buttStates;
Display* Display::getDisplay() { return inst; }
void Display::setScreen(Screen *screen) {
if(cScreen != nullptr) cScreen->onHide();... | 31.674312 | 124 | 0.515858 | mcmatrix |