hexsha stringlengths 40 40 | size int64 19 11.4M | ext stringclasses 13
values | lang stringclasses 1
value | max_stars_repo_path stringlengths 3 270 | max_stars_repo_name stringlengths 5 110 | max_stars_repo_head_hexsha stringlengths 40 40 | max_stars_repo_licenses listlengths 1 9 | max_stars_count float64 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 3 270 | max_issues_repo_name stringlengths 5 116 | max_issues_repo_head_hexsha stringlengths 40 78 | max_issues_repo_licenses listlengths 1 9 | max_issues_count float64 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 3 270 | max_forks_repo_name stringlengths 5 116 | max_forks_repo_head_hexsha stringlengths 40 78 | max_forks_repo_licenses listlengths 1 9 | max_forks_count float64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 19 11.4M | avg_line_length float64 1.93 229k | max_line_length int64 12 688k | alphanum_fraction float64 0.07 0.99 | matches listlengths 1 10 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
6c867e751e40f380c966fc5a26db8ed465978b89 | 2,075 | cpp | C++ | test/seatalk/Test_seatalk_message_30.cpp | ShadowTeolog/marnav | 094dd06a2b9e52591bc9c3879ea4b5cf34a92192 | [
"BSD-4-Clause"
] | null | null | null | test/seatalk/Test_seatalk_message_30.cpp | ShadowTeolog/marnav | 094dd06a2b9e52591bc9c3879ea4b5cf34a92192 | [
"BSD-4-Clause"
] | 1 | 2021-11-10T14:40:21.000Z | 2021-11-10T14:40:21.000Z | test/seatalk/Test_seatalk_message_30.cpp | ShadowTeolog/marnav | 094dd06a2b9e52591bc9c3879ea4b5cf34a92192 | [
"BSD-4-Clause"
] | 1 | 2020-12-21T16:38:02.000Z | 2020-12-21T16:38:02.000Z | #include <gtest/gtest.h>
#include <marnav/seatalk/message_30.hpp>
namespace
{
using namespace marnav::seatalk;
class Test_seatalk_message_30 : public ::testing::Test
{
};
TEST_F(Test_seatalk_message_30, construction)
{
message_30 m;
}
TEST_F(Test_seatalk_message_30, parse_invalid_data_size)
{
EXPECT_ANY_THROW(me... | 22.074468 | 57 | 0.715663 | [
"vector"
] |
6c86c64b17ac9795a5f67da4b613d754e24de384 | 27,282 | cpp | C++ | 01_Develop/libXMFFmpeg/Source/libavformat/isom.cpp | mcodegeeks/OpenKODE-Framework | d4382d781da7f488a0e7667362a89e8e389468dd | [
"MIT"
] | 2 | 2017-08-03T07:15:00.000Z | 2018-06-18T10:32:53.000Z | 01_Develop/libXMFFmpeg/Source/libavformat/isom.cpp | mcodegeeks/OpenKODE-Framework | d4382d781da7f488a0e7667362a89e8e389468dd | [
"MIT"
] | null | null | null | 01_Develop/libXMFFmpeg/Source/libavformat/isom.cpp | mcodegeeks/OpenKODE-Framework | d4382d781da7f488a0e7667362a89e8e389468dd | [
"MIT"
] | 2 | 2019-03-04T22:57:42.000Z | 2020-03-06T01:32:26.000Z | /*
* ISO Media common code
* Copyright (c) 2001 Fabrice Bellard
* Copyright (c) 2002 Francois Revol <revol@free.fr>
* Copyright (c) 2006 Baptiste Coudurier <baptiste.coudurier@free.fr>
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of th... | 50.804469 | 137 | 0.533172 | [
"object"
] |
6c870737da6c1c3a0c4d7fa0298222f965276c3c | 17,632 | cpp | C++ | depends/work/build/i686-w64-mingw32/qt/5.9.7-f2560c1efa6/qtbase/tests/auto/corelib/itemmodels/qabstractproxymodel/tst_qabstractproxymodel.cpp | GrinCash/Grinc-core | 1377979453ba84082f70f9c128be38e57b65a909 | [
"MIT"
] | null | null | null | depends/work/build/i686-w64-mingw32/qt/5.9.7-f2560c1efa6/qtbase/tests/auto/corelib/itemmodels/qabstractproxymodel/tst_qabstractproxymodel.cpp | GrinCash/Grinc-core | 1377979453ba84082f70f9c128be38e57b65a909 | [
"MIT"
] | null | null | null | depends/work/build/i686-w64-mingw32/qt/5.9.7-f2560c1efa6/qtbase/tests/auto/corelib/itemmodels/qabstractproxymodel/tst_qabstractproxymodel.cpp | GrinCash/Grinc-core | 1377979453ba84082f70f9c128be38e57b65a909 | [
"MIT"
] | null | null | null | /****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:GPL-EXCEPT$
** Commercial License Usage
** Licensees holding valid comm... | 34.77712 | 133 | 0.707974 | [
"model"
] |
6c88e1b88b7818279cb32e10b92b68f16e0cc791 | 7,203 | cpp | C++ | source/gloperate-glfw/source/WindowEventDispatcher.cpp | apopiak/gloperate | b4194a1c3b2dc4ea1102a2c5ae3ff3b5540f31cd | [
"MIT"
] | null | null | null | source/gloperate-glfw/source/WindowEventDispatcher.cpp | apopiak/gloperate | b4194a1c3b2dc4ea1102a2c5ae3ff3b5540f31cd | [
"MIT"
] | null | null | null | source/gloperate-glfw/source/WindowEventDispatcher.cpp | apopiak/gloperate | b4194a1c3b2dc4ea1102a2c5ae3ff3b5540f31cd | [
"MIT"
] | null | null | null | #include <gloperate-glfw/WindowEventDispatcher.h>
#include <cassert>
#include <cmath>
#include <glbinding/gl/enum.h>
#include <GLFW/glfw3.h>
#include <gloperate-glfw/Window.h>
#include <gloperate-glfw/events.h>
namespace gloperate_glfw
{
WindowEventDispatcher::Timer::Timer()
: interval(0)
, singleShot(false)
{
... | 26.876866 | 111 | 0.721505 | [
"vector"
] |
6c898f2b86a108200c5b4df79c3c42169563f852 | 530 | cpp | C++ | math/spf_sieve.cpp | prince776/CodeBook | 874fc7f94011ad1d25a55bcd91fecd2a11eb5a9b | [
"CC0-1.0"
] | 17 | 2021-01-25T12:07:17.000Z | 2022-02-26T17:20:31.000Z | math/spf_sieve.cpp | NavneelSinghal/CodeBook | ff60ace9107dd19ef8ba81e175003f567d2a9070 | [
"CC0-1.0"
] | null | null | null | math/spf_sieve.cpp | NavneelSinghal/CodeBook | ff60ace9107dd19ef8ba81e175003f567d2a9070 | [
"CC0-1.0"
] | 4 | 2021-02-28T11:13:44.000Z | 2021-11-20T12:56:20.000Z | // memory - N + N/(log N)
template <int N = 1'000'000>
struct fast_sieve_spf {
vector<int> primes, spf;
fast_sieve_spf() {
spf.resize(N + 1);
for (int i = 2; i <= N; ++i) {
if (spf[i] == 0) spf[i] = i, primes.push_back(i);
int product, spfi = spf[i];
for (auto... | 26.5 | 61 | 0.430189 | [
"vector"
] |
6c8f7726a1b62535f2363c4d2ed59f6318c1179b | 2,973 | cpp | C++ | Uncategorized/chain.cpp | crackersamdjam/DMOJ-Solutions | 97992566595e2c7bf41b5da9217d8ef61bdd1d71 | [
"MIT"
] | null | null | null | Uncategorized/chain.cpp | crackersamdjam/DMOJ-Solutions | 97992566595e2c7bf41b5da9217d8ef61bdd1d71 | [
"MIT"
] | null | null | null | Uncategorized/chain.cpp | crackersamdjam/DMOJ-Solutions | 97992566595e2c7bf41b5da9217d8ef61bdd1d71 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define gc getchar_unlocked()
#define pc(x) putchar_unlocked(x)
template<typename T> void scan(T &x){x = 0;bool _=0;T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
template<typename T> void printn(T n){bool _=0;_=n<0... | 28.586538 | 175 | 0.36596 | [
"vector"
] |
6c9158f6ca6cbaba765151631cdcbea8698f963a | 2,669 | cpp | C++ | frameReceiver/src/FrameReceiverZMQRxThread.cpp | stfc-aeg/odin-data | 6c6353a11e0b813fc9db866ba610649dbbec95da | [
"Apache-2.0"
] | 7 | 2018-06-12T15:48:52.000Z | 2021-06-01T03:50:42.000Z | frameReceiver/src/FrameReceiverZMQRxThread.cpp | stfc-aeg/odin-data | 6c6353a11e0b813fc9db866ba610649dbbec95da | [
"Apache-2.0"
] | 211 | 2017-05-18T13:38:02.000Z | 2022-03-03T11:05:47.000Z | frameReceiver/src/FrameReceiverZMQRxThread.cpp | dls-controls/odin-data | ddbfb90d361d0b397fcfd30df4a749faaa8c84d6 | [
"Apache-2.0"
] | 8 | 2017-05-15T08:05:05.000Z | 2022-03-13T18:31:41.000Z | /*!
* FrameReceiverZMQRxThread.cpp
*
* Created on: Feb 4, 2015
* Author: Tim Nicholls, STFC Application Engineering Group
*/
#include "FrameReceiverZMQRxThread.h"
using namespace FrameReceiver;
FrameReceiverZMQRxThread::FrameReceiverZMQRxThread(FrameReceiverConfig& config,
... | 34.662338 | 134 | 0.70888 | [
"vector"
] |
6c937e3926ee5134e789ef700617c1912869400f | 63,607 | cpp | C++ | ScutSystem/LUA_Export/LuaScutSystem.cpp | ScutGame/Client-source | 7dd886bf128c857a957f5360fcc28bcd511bf654 | [
"MIT"
] | 23 | 2015-01-28T12:41:43.000Z | 2021-07-14T05:35:56.000Z | ScutSystem/LUA_Export/LuaScutSystem.cpp | HongXiao/Client-source | 7dd886bf128c857a957f5360fcc28bcd511bf654 | [
"MIT"
] | null | null | null | ScutSystem/LUA_Export/LuaScutSystem.cpp | HongXiao/Client-source | 7dd886bf128c857a957f5360fcc28bcd511bf654 | [
"MIT"
] | 35 | 2015-02-04T10:01:00.000Z | 2021-03-05T15:27:14.000Z | /*
** Lua binding: ScutSystem
** Generated automatically by tolua++-1.0.92 on 10/07/13 15:26:42.
*/
#ifndef __cplusplus
#include "stdlib.h"
#endif
#include "string.h"
#include "tolua++.h"
/* Exported function */
TOLUA_API int tolua_ScutSystem_open (lua_State* tolua_S);
#include"../md5.h"
#include".... | 32.222391 | 144 | 0.736303 | [
"object"
] |
6c950bbf4acd291d94a1e3f5ca14b9e582e224d4 | 26,900 | cpp | C++ | easy_manipulation_deployment/workcell_builder/workcell_builder/gui/new_scene.cpp | quasi-robotics/easy_manipulation_deployment | 21704ab8f9a9b5f89022990ff0d02c1765fd4be1 | [
"Apache-2.0"
] | 38 | 2020-07-10T02:40:01.000Z | 2022-01-16T16:06:43.000Z | easy_manipulation_deployment/workcell_builder/workcell_builder/gui/new_scene.cpp | quasi-robotics/easy_manipulation_deployment | 21704ab8f9a9b5f89022990ff0d02c1765fd4be1 | [
"Apache-2.0"
] | 11 | 2021-01-13T16:27:28.000Z | 2022-03-03T12:39:56.000Z | easy_manipulation_deployment/workcell_builder/workcell_builder/gui/new_scene.cpp | quasi-robotics/easy_manipulation_deployment | 21704ab8f9a9b5f89022990ff0d02c1765fd4be1 | [
"Apache-2.0"
] | 9 | 2021-01-08T07:40:06.000Z | 2022-02-02T00:31:07.000Z | // Copyright 2020 Advanced Remanufacturing and Technology Centre
// Copyright 2020 ROS-Industrial Consortium Asia Pacific Team
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// ht... | 36.351351 | 100 | 0.691561 | [
"object",
"vector"
] |
6cac270342e2b0862a4e1b777489a2d3c9b683c6 | 1,430 | hpp | C++ | src/ui/widgets/IgnoreUndoRedo.hpp | vimofthevine/UnderBudget | 5711be8e5da3cb7a78da007fe43cf1ce1b796493 | [
"Apache-2.0"
] | 2 | 2016-07-17T02:12:44.000Z | 2016-11-22T14:04:55.000Z | src/ui/widgets/IgnoreUndoRedo.hpp | vimofthevine/UnderBudget | 5711be8e5da3cb7a78da007fe43cf1ce1b796493 | [
"Apache-2.0"
] | null | null | null | src/ui/widgets/IgnoreUndoRedo.hpp | vimofthevine/UnderBudget | 5711be8e5da3cb7a78da007fe43cf1ce1b796493 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2013 Kyle Treubig
*
* 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... | 25.087719 | 75 | 0.727273 | [
"object"
] |
6cad2c4d03d145fed269d50d5528df81d2c231f2 | 11,589 | cc | C++ | src/rib/rib.cc | simula/flexran | 372a6e3398d839f4f87961217dbf6c5610464fbc | [
"Apache-2.0"
] | 2 | 2020-12-01T02:02:24.000Z | 2021-01-13T03:05:02.000Z | src/rib/rib.cc | simula/flexran | 372a6e3398d839f4f87961217dbf6c5610464fbc | [
"Apache-2.0"
] | null | null | null | src/rib/rib.cc | simula/flexran | 372a6e3398d839f4f87961217dbf6c5610464fbc | [
"Apache-2.0"
] | 2 | 2020-12-03T12:31:26.000Z | 2021-09-29T02:56:43.000Z | /*
* Copyright 2016-2018 FlexRAN Authors, Eurecom and The University of Edinburgh
* 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
*
* U... | 30.101299 | 111 | 0.673742 | [
"vector",
"transform"
] |
6cb563704dd7ae626c6049b8ace9b335ddf4f80e | 19,287 | cpp | C++ | Arcade Game Engine/engine/core.cpp | lidin/Arcade-Game-Engine | 135d7005cb024562800905aafee3273cb3586ab9 | [
"MIT"
] | 1 | 2017-02-18T00:12:06.000Z | 2017-02-18T00:12:06.000Z | Arcade Game Engine/engine/core.cpp | lidin/Arcade-Game-Engine | 135d7005cb024562800905aafee3273cb3586ab9 | [
"MIT"
] | 6 | 2017-04-05T00:28:04.000Z | 2017-05-28T22:24:03.000Z | Arcade Game Engine/engine/core.cpp | lidin/Arcade-Game-Engine | 135d7005cb024562800905aafee3273cb3586ab9 | [
"MIT"
] | 1 | 2018-02-22T05:41:34.000Z | 2018-02-22T05:41:34.000Z | //
// core.cpp
// Game Engine
//
#include "core.hpp"
#include <stack>
#include <queue>
#ifdef __APPLE__
# include <CoreFoundation/CoreFoundation.h>
#endif
// MARK: Helper functions
void _buildEntityPriorityQueue(Entity & root, vector<Entity*> & result)
{
int root_order = root.order();
long low = 0;
long high ... | 21.917045 | 79 | 0.610152 | [
"vector"
] |
6cc90dc850e84f8bd6a42938f1ffa48cc8ebd5f5 | 3,641 | cpp | C++ | UVa 12386 - Smallest Polygon/sample/12386 - Smallest Polygon.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2020-11-24T03:17:21.000Z | 2020-11-24T03:17:21.000Z | UVa 12386 - Smallest Polygon/sample/12386 - Smallest Polygon.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | null | null | null | UVa 12386 - Smallest Polygon/sample/12386 - Smallest Polygon.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2021-04-11T16:22:31.000Z | 2021-04-11T16:22:31.000Z | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <string.h>
#include <assert.h>
using namespace std;
#define eps 1e-9
struct Pt {
double x, y;
Pt(double a = 0, double b = 0):
x(a), y(b) {}
bool opera... | 22.337423 | 78 | 0.469651 | [
"vector"
] |
6cd42195e84afe6a24425a0acc0ee5fc88d89e36 | 880 | cpp | C++ | Ouroboros/Source/oMath/plane_v_plane_v_plane.cpp | igHunterKiller/ouroboros | 5e2cde7e6365341da297da10d8927b091ecf5559 | [
"MIT"
] | null | null | null | Ouroboros/Source/oMath/plane_v_plane_v_plane.cpp | igHunterKiller/ouroboros | 5e2cde7e6365341da297da10d8927b091ecf5559 | [
"MIT"
] | null | null | null | Ouroboros/Source/oMath/plane_v_plane_v_plane.cpp | igHunterKiller/ouroboros | 5e2cde7e6365341da297da10d8927b091ecf5559 | [
"MIT"
] | null | null | null | // Copyright (c) 2016 Antony Arciuolo. See License.txt regarding use.
#include <oMath/plane_v_plane_v_plane.h>
#include <oMath/equal.h>
namespace ouro {
bool plane_v_plane_v_plane(const float4& a, const float4& b, const float4& c, float3* out_intersection)
{
// Goldman, Ronald. Intersection of Three Planes. In A. G... | 27.5 | 109 | 0.665909 | [
"geometry"
] |
6cda34f171458934a59e03009b104dd8f3bb3c41 | 4,096 | cc | C++ | algo/array/four_sum.cc | liuheng/recipes | 6f3759ab4e4fa64d9fd83a60ee6b6846510d910b | [
"MIT"
] | null | null | null | algo/array/four_sum.cc | liuheng/recipes | 6f3759ab4e4fa64d9fd83a60ee6b6846510d910b | [
"MIT"
] | null | null | null | algo/array/four_sum.cc | liuheng/recipes | 6f3759ab4e4fa64d9fd83a60ee6b6846510d910b | [
"MIT"
] | null | null | null | #include <cstdio>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
vector<vector<int> > fourSum(vector<int> &num, int target) {
/*
vector<vector<int> > result;
unordered_multimap<int, pair<int, int> > M;
for (auto it1=begin(num); it1!=end(num); ++it1) {
for ... | 56.109589 | 1,904 | 0.627686 | [
"vector"
] |
6cdb261bd85c12c41b72ea1b3c244643aa6d3ccb | 1,516 | cpp | C++ | Source Code/Source/ReturnoftheGorm/HealthBox.cpp | creosB/Return-Of-the-Gorm | 09f413cf30ae5bd74dd8f8afccf3a2824a82eeb3 | [
"MIT"
] | null | null | null | Source Code/Source/ReturnoftheGorm/HealthBox.cpp | creosB/Return-Of-the-Gorm | 09f413cf30ae5bd74dd8f8afccf3a2824a82eeb3 | [
"MIT"
] | null | null | null | Source Code/Source/ReturnoftheGorm/HealthBox.cpp | creosB/Return-Of-the-Gorm | 09f413cf30ae5bd74dd8f8afccf3a2824a82eeb3 | [
"MIT"
] | null | null | null | // Fill out your copyright notice in the Description page of Project Settings.
#include "HealthBox.h"
#include "Components/StaticMeshComponent.h"
#include "ContraCharacter.h"
#include "Kismet/GameplayStatics.h"
// Sets default values
AHealthBox::AHealthBox()
{
// Set this actor to call Tick() every frame. You can... | 27.563636 | 114 | 0.766491 | [
"mesh"
] |
6cdf488660978a36c77e6e83daa925b97f7307c8 | 10,851 | cpp | C++ | 3rdparty/mygui/src/MyGUI_Message.cpp | Osumi-Akari/energytycoon | 25d18a0ee4a9f8833e678af297734602918a92e9 | [
"Unlicense"
] | null | null | null | 3rdparty/mygui/src/MyGUI_Message.cpp | Osumi-Akari/energytycoon | 25d18a0ee4a9f8833e678af297734602918a92e9 | [
"Unlicense"
] | null | null | null | 3rdparty/mygui/src/MyGUI_Message.cpp | Osumi-Akari/energytycoon | 25d18a0ee4a9f8833e678af297734602918a92e9 | [
"Unlicense"
] | null | null | null | /*!
@file
@author Albert Semenov
@date 01/2008
@module
*//*
This file is part of MyGUI.
MyGUI is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option... | 31.543605 | 217 | 0.714589 | [
"vector"
] |
6cece6520bca40860b998cb70a5434e46fe7ed70 | 1,357 | hpp | C++ | Animal.hpp | Athanasius2/CS3210-final | 78eaef5622187724d3e8f0e18ea22f7c6d6b770a | [
"MIT"
] | null | null | null | Animal.hpp | Athanasius2/CS3210-final | 78eaef5622187724d3e8f0e18ea22f7c6d6b770a | [
"MIT"
] | null | null | null | Animal.hpp | Athanasius2/CS3210-final | 78eaef5622187724d3e8f0e18ea22f7c6d6b770a | [
"MIT"
] | null | null | null | #ifndef ANIMAL_HPP
#define ANIMAL_HPP
#include "Actor.hpp"
#include "Environment.hpp"
#include <vector>
#include <map>
#include <memory>
#include <utility>
#include <algorithm>
namespace cppfinal
{
class Animal : public Actor
{
private:
std::vector<char> eats;
//TODO: move energy to actor
int energy;
... | 20.560606 | 140 | 0.665438 | [
"vector"
] |
6cf034946e4d461e4c595225855cb82d5050ccda | 6,329 | cpp | C++ | 0710747.cpp | Jackie890621/Interval-Tree | 00e3151e4c3ca69982660181bc04c796a0b02215 | [
"MIT"
] | null | null | null | 0710747.cpp | Jackie890621/Interval-Tree | 00e3151e4c3ca69982660181bc04c796a0b02215 | [
"MIT"
] | null | null | null | 0710747.cpp | Jackie890621/Interval-Tree | 00e3151e4c3ca69982660181bc04c796a0b02215 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include <climits>
#include <algorithm>
#include <time.h>
using namespace std;
vector<int> O;
vector<vector<int>> Overlap;
bool flag;
int min_area = INT_MAX;
vector<int> area_list;
vector<int> search_list;
struct Interval
{... | 21.600683 | 70 | 0.521883 | [
"vector"
] |
6cf3b33971352646216331a49cab42a4343cf778 | 7,560 | cpp | C++ | lib/Target/Sophon/BM188x/BM188xTargetTransformInfo.cpp | LiuLeif/onnc | 3f69e46172a9c33cc04541ff7fd78d5d7b6bdbba | [
"BSD-3-Clause"
] | 450 | 2018-08-03T08:17:03.000Z | 2022-03-17T17:21:06.000Z | lib/Target/Sophon/BM188x/BM188xTargetTransformInfo.cpp | ffk0716/onnc | 91e4955ade64b479db17aaeccacf4b7339fe44d2 | [
"BSD-3-Clause"
] | 104 | 2018-08-13T07:31:50.000Z | 2021-08-24T11:24:40.000Z | lib/Target/Sophon/BM188x/BM188xTargetTransformInfo.cpp | ffk0716/onnc | 91e4955ade64b479db17aaeccacf4b7339fe44d2 | [
"BSD-3-Clause"
] | 100 | 2018-08-12T04:27:39.000Z | 2022-03-11T04:17:42.000Z | //===---------------------------------------------------------------------===//
//
// The ONNC Project
//
// Copyright(c) 2018, The ONNC Team
//
// This file is part of the ONNC Project and is distributed under
// 3-clause BSD license (https://opensource.org/licenses/BSD-3-Clause)
//
// See ... | 29.76378 | 80 | 0.640079 | [
"vector"
] |
6cf4444621b688ea0ae13e9b4d219f1a539f9c85 | 13,466 | cc | C++ | lib/LoadStoreVerificationPass.cc | cojocar/llvm-iskip | c5c3e9119d9b2bc98a4a1f7c7e70407866e8d8c6 | [
"Apache-2.0"
] | 2 | 2017-09-05T18:29:39.000Z | 2019-01-24T08:49:08.000Z | lib/LoadStoreVerificationPass.cc | cojocar/llvm-iskip | c5c3e9119d9b2bc98a4a1f7c7e70407866e8d8c6 | [
"Apache-2.0"
] | null | null | null | lib/LoadStoreVerificationPass.cc | cojocar/llvm-iskip | c5c3e9119d9b2bc98a4a1f7c7e70407866e8d8c6 | [
"Apache-2.0"
] | null | null | null | // Copyright 2016 The Iskip Authors
//
// 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... | 28.409283 | 128 | 0.615922 | [
"object"
] |
6cf6b27000428eef5c2cee7225d50c161b345607 | 599 | cpp | C++ | DataStructure/Array/64_minimal_path_sum.cpp | xtstc131/mall0x_Leetcode | db528f2a78808d4123785c35218cce00906166dd | [
"MIT"
] | 1 | 2019-12-25T16:19:21.000Z | 2019-12-25T16:19:21.000Z | DataStructure/Array/64_minimal_path_sum.cpp | xtstc131/mall0x_Leetcode | db528f2a78808d4123785c35218cce00906166dd | [
"MIT"
] | null | null | null | DataStructure/Array/64_minimal_path_sum.cpp | xtstc131/mall0x_Leetcode | db528f2a78808d4123785c35218cce00906166dd | [
"MIT"
] | null | null | null | #include "header.hpp"
class Solution
{
public:
int minPathSum(vector<vector<int>> &grid)
{
int m = grid.size();
if (m == 0)
return 0;
int n = grid[0].size();
vector<int> memo(n, INT_MAX);
memo[0] = 0;
for (int i = 0; i < m; ++i)
for (int j ... | 23.96 | 69 | 0.347245 | [
"vector"
] |
9f05c14b09fbc6ca69ea20bafc7aa95335e7dcda | 1,913 | cpp | C++ | bin/snp_search/snp_search.cpp | LyonsLab/coge | 1d9a8e84a8572809ee3260ede44290e14de3bdd1 | [
"BSD-2-Clause"
] | 37 | 2015-02-24T18:58:30.000Z | 2021-03-07T21:22:18.000Z | bin/snp_search/snp_search.cpp | LyonsLab/coge | 1d9a8e84a8572809ee3260ede44290e14de3bdd1 | [
"BSD-2-Clause"
] | 12 | 2016-06-09T21:57:00.000Z | 2020-09-11T18:48:51.000Z | bin/snp_search/snp_search.cpp | LyonsLab/coge | 1d9a8e84a8572809ee3260ede44290e14de3bdd1 | [
"BSD-2-Clause"
] | 19 | 2016-03-26T08:15:17.000Z | 2021-04-12T05:03:29.000Z | #include <fstream>
#include <iostream>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
int nth_token(string& s, int n) {
int i = 0;
int total_commas = n - 1;
for (int num_commas=0,l=s.size(); i<l && num_commas<total_commas; i++) {
if (s[i] == ',')
num_commas++;
}
return i;
}
voi... | 20.569892 | 104 | 0.550444 | [
"vector"
] |
9f06b0d81ced193b852cb20761dfca4fb2bae1c0 | 15,416 | cpp | C++ | packages/Adapters/STKMesh/example/mesh_deformation.cpp | chiao45/DataTransferKit | 51923eb08ccd4c12c5a5ea5f136f5ccbbbeb6243 | [
"BSD-3-Clause"
] | 1 | 2020-07-26T03:50:31.000Z | 2020-07-26T03:50:31.000Z | packages/Adapters/STKMesh/example/mesh_deformation.cpp | chiao45/DataTransferKit | 51923eb08ccd4c12c5a5ea5f136f5ccbbbeb6243 | [
"BSD-3-Clause"
] | null | null | null | packages/Adapters/STKMesh/example/mesh_deformation.cpp | chiao45/DataTransferKit | 51923eb08ccd4c12c5a5ea5f136f5ccbbbeb6243 | [
"BSD-3-Clause"
] | 1 | 2018-07-09T18:39:38.000Z | 2018-07-09T18:39:38.000Z | //---------------------------------------------------------------------------//
/*
Copyright (c) 2012, Stuart R. Slattery
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
*: Redistributions o... | 38.158416 | 80 | 0.63499 | [
"mesh",
"vector",
"3d"
] |
9f09e0b5a3b7c45f997bf2c0a09fcee84e0732a4 | 1,215 | hh | C++ | L1Trigger/Phase2L1Taus/interface/L1NNTauProducer.hh | thesps/cmssw | ad5315934948ce96699b29cc1d5b03a59f99634f | [
"Apache-2.0"
] | null | null | null | L1Trigger/Phase2L1Taus/interface/L1NNTauProducer.hh | thesps/cmssw | ad5315934948ce96699b29cc1d5b03a59f99634f | [
"Apache-2.0"
] | null | null | null | L1Trigger/Phase2L1Taus/interface/L1NNTauProducer.hh | thesps/cmssw | ad5315934948ce96699b29cc1d5b03a59f99634f | [
"Apache-2.0"
] | null | null | null | #ifndef L1TRIGGER_PHASE2L1TAU_L1NNTAU_H
#define L1TRIGGER_PHASE2L1TAU_L1NNTAU_H
#include <iostream>
#include <vector>
#include <TLorentzVector.h>
#include "FWCore/Framework/interface/Frameworkfwd.h"
#include "FWCore/Framework/interface/stream/EDProducer.h"
#include "FWCore/Framework/interface/Event.h"
#include "FWCo... | 28.928571 | 126 | 0.790947 | [
"vector"
] |
9f0f803c82709779da414f6f6a79ae69114fe84e | 2,265 | cpp | C++ | geode/openmesh/decimate.cpp | otherlab/geode | 18ccf114f02ca733a92b223541161f0405f12535 | [
"BSD-3-Clause"
] | 75 | 2015-02-08T22:04:31.000Z | 2022-02-26T14:31:43.000Z | geode/openmesh/decimate.cpp | bantamtools/geode | d906f1230b14953b68af63aeec2f7b0418d5fdfd | [
"BSD-3-Clause"
] | 15 | 2015-01-08T15:11:38.000Z | 2021-09-05T13:27:22.000Z | geode/openmesh/decimate.cpp | bantamtools/geode | d906f1230b14953b68af63aeec2f7b0418d5fdfd | [
"BSD-3-Clause"
] | 22 | 2015-03-11T16:43:13.000Z | 2021-02-15T09:37:51.000Z | #include <geode/config.h>
#ifdef GEODE_OPENMESH
#include <geode/openmesh/decimate.h>
#include <OpenMesh/Tools/Decimater/ModQuadricT.hh>
#include <OpenMesh/Tools/Decimater/ModNormalFlippingT.hh>
#include <OpenMesh/Tools/Decimater/ModBaseT.hh>
#include <geode/geometry/Triangle3d.h>
#include <geode/python/wrap.h>
namespac... | 29.415584 | 119 | 0.769978 | [
"mesh",
"geometry",
"vector"
] |
2f64d8a909a159ed112066bacd3c0d94840d8a4b | 9,649 | cc | C++ | tools/festvox/src/vc/src/sub/anasyn_sub.cc | jantunez14/merlin | 66d602919aa8d3ca20b77d4515b8214b5b1be508 | [
"Apache-2.0"
] | 4 | 2015-05-14T20:44:23.000Z | 2019-02-22T21:05:52.000Z | festvox/src/vc/src/sub/anasyn_sub.cc | zeehio/festival_suite | 9f555b42f0ba7432a52ba1c8f26cf7482950e38b | [
"BSD-3-Clause"
] | 3 | 2020-06-05T18:09:02.000Z | 2021-06-10T20:06:02.000Z | festvox/src/vc/src/sub/anasyn_sub.cc | zeehio/festival_suite | 9f555b42f0ba7432a52ba1c8f26cf7482950e38b | [
"BSD-3-Clause"
] | null | null | null | /*********************************************************************/
/* */
/* Nagoya Institute of Technology, Aichi, Japan, */
/* Nara Institute of Science and Technology, Nara, Japan */
/* ... | 31.636066 | 82 | 0.510312 | [
"vector"
] |
2f6b79ea7558b4548782342fca84b94511c521ca | 8,646 | cpp | C++ | Source/Engine/Renderer/Scene/Scene.cpp | yuvanw/ViceEngine | 7259b53483b3d5a516182c9ded42a3c5219ba66f | [
"MIT"
] | null | null | null | Source/Engine/Renderer/Scene/Scene.cpp | yuvanw/ViceEngine | 7259b53483b3d5a516182c9ded42a3c5219ba66f | [
"MIT"
] | null | null | null | Source/Engine/Renderer/Scene/Scene.cpp | yuvanw/ViceEngine | 7259b53483b3d5a516182c9ded42a3c5219ba66f | [
"MIT"
] | null | null | null | #include "Scene.h"
#include "SceneFile.h"
FScene::FScene(const FStringId& InSceneFileName)
{
// Parse .scn file.
FSceneFile SceneFile(InSceneFileName);
// Create skybox if one was specified.
if (SceneFile.bHasSkybox)
{
const ANSICHAR* SkyboxName = SceneFile.Skybox.Name.GetString().GetData();
FCubemap Cubemap... | 30.336842 | 133 | 0.784872 | [
"model",
"transform"
] |
2f6ea168f3280e84eddfd091c76f7d249a88c496 | 3,062 | cpp | C++ | src/common.cpp | kamdiedrich/clpeak | 8edab23fbc867adbada21378d65774c670c2aaf9 | [
"Unlicense"
] | null | null | null | src/common.cpp | kamdiedrich/clpeak | 8edab23fbc867adbada21378d65774c670c2aaf9 | [
"Unlicense"
] | null | null | null | src/common.cpp | kamdiedrich/clpeak | 8edab23fbc867adbada21378d65774c670c2aaf9 | [
"Unlicense"
] | null | null | null | #include <common.h>
#include <math.h>
#include <iostream>
#include <string>
using namespace std;
device_info_t getDeviceInfo(cl::Device &d)
{
device_info_t devInfo;
devInfo.deviceName = d.getInfo<CL_DEVICE_NAME>();
devInfo.driverVersion = d.getInfo<CL_DRIVER_VERSION>();
devInfo.numCUs = (uint)d.getInfo<CL_D... | 24.894309 | 106 | 0.679621 | [
"vector"
] |
2f735e90418c98539bd4ada4da1e17e8bac1e008 | 3,291 | cpp | C++ | TG/bookcodes/ch5/uva11865.cpp | Anyrainel/aoapc-code | e787a01380698fb9236d933462052f97b20e6132 | [
"Apache-2.0"
] | 3 | 2017-08-15T06:00:01.000Z | 2018-12-10T09:05:53.000Z | TG/bookcodes/ch5/uva11865.cpp | Anyrainel/aoapc-related-code | e787a01380698fb9236d933462052f97b20e6132 | [
"Apache-2.0"
] | null | null | null | TG/bookcodes/ch5/uva11865.cpp | Anyrainel/aoapc-related-code | e787a01380698fb9236d933462052f97b20e6132 | [
"Apache-2.0"
] | 2 | 2017-09-16T18:46:27.000Z | 2018-05-22T05:42:03.000Z | // UVa11865 Stream My Contest
// Rujia Liu
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int INF = 1000000000;
const int maxn = 100 + 10;
// 固定根的最小树型图，邻接矩阵写法
struct MDST {
int n;
int w[maxn][maxn]; // 边权
int vis[maxn]; // 访问标记，仅用来判断无解
int ans; ... | 23.013986 | 82 | 0.476147 | [
"vector"
] |
2f7f94d6705ffd39629a44e46645b23f787ebcfe | 12,639 | cc | C++ | src/EvenDataTree.cc | hunyadix/SplitClusterMerger | 9fa853c97ee8e5e1ec1850384578c92d6dfbebdd | [
"MIT"
] | null | null | null | src/EvenDataTree.cc | hunyadix/SplitClusterMerger | 9fa853c97ee8e5e1ec1850384578c92d6dfbebdd | [
"MIT"
] | null | null | null | src/EvenDataTree.cc | hunyadix/SplitClusterMerger | 9fa853c97ee8e5e1ec1850384578c92d6dfbebdd | [
"MIT"
] | null | null | null | #include "../interface/EventDataTree.h"
// Normal event tree
void EventDataTree::defineEventTreeBranches(TTree*& eventTree, EventData& eventField)
{
eventTree -> Branch("event", &eventField, eventField.list.c_str());
}
void EventDataTree::setEventTreeDataFields(TTree*& eventTree, EventData& eventField)
{
eventTree... | 85.398649 | 168 | 0.749031 | [
"vector"
] |
2f7fbc40079e3430f56971926f6a8d1e0466a820 | 14,705 | cpp | C++ | deps/perceptualdiff-master/metric.cpp | julescmay/LuxCore | 3a6233f37afaf064300f52854715c0ab9ca2103e | [
"Apache-2.0"
] | 826 | 2017-12-12T15:38:16.000Z | 2022-03-28T07:12:40.000Z | deps/perceptualdiff-master/metric.cpp | julescmay/LuxCore | 3a6233f37afaf064300f52854715c0ab9ca2103e | [
"Apache-2.0"
] | 531 | 2017-12-03T17:21:06.000Z | 2022-03-20T19:22:11.000Z | deps/perceptualdiff-master/metric.cpp | julescmay/LuxCore | 3a6233f37afaf064300f52854715c0ab9ca2103e | [
"Apache-2.0"
] | 133 | 2017-12-13T18:46:10.000Z | 2022-03-27T16:21:00.000Z | /*
Metric
Copyright (C) 2006-2011 Yangli Hector Yee
Copyright (C) 2011-2016 Steven Myint, Jeff Terrace
This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free Software
Foundation; either version 2 of the License, or (at your opt... | 30.382231 | 79 | 0.484869 | [
"vector"
] |
2f87c5022278b9b7881c7b3c8c7190c9f35e127a | 3,754 | cpp | C++ | cpp-7/sketches.cpp | Evg503/Stepik | f84cddfd311b067bf34c3ef3df69956c51e25096 | [
"MIT"
] | null | null | null | cpp-7/sketches.cpp | Evg503/Stepik | f84cddfd311b067bf34c3ef3df69956c51e25096 | [
"MIT"
] | null | null | null | cpp-7/sketches.cpp | Evg503/Stepik | f84cddfd311b067bf34c3ef3df69956c51e25096 | [
"MIT"
] | null | null | null | #include <iostream>
/*
struct Number {};
struct BigInt : Number
{
BigInt(int x);
};
struct String
{
explicit String(char const * s);
explicit operator char const *() const;
};
void a()
{
int a = 3.5;
double b = 7;
BigInt c = 100500;
String d = static_cast<String>("Stepik");
Number * e = &c;
BigInt * f = static_... | 15.137097 | 70 | 0.531433 | [
"vector"
] |
2f8cd9c574ae57d9bc549853b40e27e26c1c1c9b | 10,372 | cpp | C++ | main.cpp | aljpetri/DynamicMinimizer | 31f9c79293abdc6483ce3c47dc8e3b41706b7f7c | [
"MIT"
] | null | null | null | main.cpp | aljpetri/DynamicMinimizer | 31f9c79293abdc6483ce3c47dc8e3b41706b7f7c | [
"MIT"
] | null | null | null | main.cpp | aljpetri/DynamicMinimizer | 31f9c79293abdc6483ce3c47dc8e3b41706b7f7c | [
"MIT"
] | null | null | null | ////////////////////////////////////////////////////////////////////////////////
// get_kmer_minimizers.h
// get kmer minimizer header file.
//
// holding the get kmer_minimizer method which is a basic building block of the algorithm
//
////////////////////////////////////////////////////////////////////////////////... | 36.521127 | 252 | 0.705361 | [
"vector"
] |
2f8d3ce49e15073358b280ef8695be013ee7c232 | 1,871 | cpp | C++ | alignment/PrintTupleCountTable.cpp | mchaisso/blasr | 044b97e6e581a936d93e8226b25ac44aebf3c9da | [
"BSD-3-Clause"
] | 17 | 2015-05-05T12:41:15.000Z | 2021-03-24T05:50:58.000Z | alignment/PrintTupleCountTable.cpp | EichlerLab/blasr | c9bced1fedfb026b4992e2b49e4ffa0f107819ea | [
"BSD-3-Clause"
] | 6 | 2015-07-07T14:01:00.000Z | 2021-04-17T07:53:12.000Z | alignment/PrintTupleCountTable.cpp | EichlerLab/blasr | c9bced1fedfb026b4992e2b49e4ffa0f107819ea | [
"BSD-3-Clause"
] | 10 | 2015-01-22T19:27:40.000Z | 2022-02-17T06:43:01.000Z | #include <string>
#include <vector>
#include <iostream>
#include <fstream>
#include "../common/FASTASequence.h"
#include "../common/FASTAReader.h"
#include "../common/tuples/DNATuple.h"
#include "../common/tuples/CompressedDNATuple.h"
#include "../common/tuples/TupleMetrics.h"
#include "../common/datastructures/tuplel... | 28.348485 | 86 | 0.730625 | [
"vector"
] |
2f9204e46573798938eacde072e4e63b2e96a15d | 1,624 | cpp | C++ | e-olymp/Almost-shortest-path.cpp | MaGnsio/CP-Problems | a7f518a20ba470f554b6d54a414b84043bf209c5 | [
"Unlicense"
] | 3 | 2020-11-01T06:31:30.000Z | 2022-02-21T20:37:51.000Z | e-olymp/Almost-shortest-path.cpp | MaGnsio/CP-Problems | a7f518a20ba470f554b6d54a414b84043bf209c5 | [
"Unlicense"
] | null | null | null | e-olymp/Almost-shortest-path.cpp | MaGnsio/CP-Problems | a7f518a20ba470f554b6d54a414b84043bf209c5 | [
"Unlicense"
] | 1 | 2021-05-05T18:56:31.000Z | 2021-05-05T18:56:31.000Z | /**
* author: MaGnsi0
* created: 10/06/2021 01:23:22
**/
#include <bits/stdc++.h>
using namespace std;
void bfs(int& n, vector<vector<int>>& adj, vector<int>& d, int& s, int& e) {
queue<int> q;
q.push(s);
d[s] = 0;
while (!q.empty()) {
int v = q.front();
q.pop();
for (a... | 24.606061 | 76 | 0.398399 | [
"vector"
] |
2f95d9cf7ccbb706836e660605429bc66d4bd547 | 1,698 | hpp | C++ | inst/include/Package.hpp | nsaripalli/instrumentr | 4bd52d1c454dd1c188e12f687db6a574536b75ae | [
"MIT"
] | 4 | 2020-06-11T14:58:55.000Z | 2021-10-18T20:19:15.000Z | inst/include/Package.hpp | nsaripalli/instrumentr | 4bd52d1c454dd1c188e12f687db6a574536b75ae | [
"MIT"
] | 42 | 2020-06-29T18:13:52.000Z | 2020-09-29T09:55:12.000Z | inst/include/Package.hpp | nsaripalli/instrumentr | 4bd52d1c454dd1c188e12f687db6a574536b75ae | [
"MIT"
] | 1 | 2021-02-18T13:26:05.000Z | 2021-02-18T13:26:05.000Z | #ifndef INSTRUMENTR_PACKAGE_HPP
#define INSTRUMENTR_PACKAGE_HPP
#include <vector>
#include <string>
#include "Object.hpp"
#include "Function.hpp"
namespace instrumentr {
class Package: public Object {
public:
Package(const std::string& name,
const std::string& directory,
SEXP r_environm... | 21.225 | 70 | 0.618375 | [
"object",
"vector"
] |
2f9c5d69c54dd9af9cc9bdf381d4ee4a3c88b446 | 2,394 | cpp | C++ | miniapp/cosma_miniapp.cpp | simonpintarelli/COSMA | db26aeac475e3b0a15d36d74e56514392d3e8e00 | [
"BSD-3-Clause"
] | null | null | null | miniapp/cosma_miniapp.cpp | simonpintarelli/COSMA | db26aeac475e3b0a15d36d74e56514392d3e8e00 | [
"BSD-3-Clause"
] | 1 | 2020-04-29T17:46:25.000Z | 2020-04-29T17:46:25.000Z | miniapp/cosma_miniapp.cpp | simonpintarelli/COSMA | db26aeac475e3b0a15d36d74e56514392d3e8e00 | [
"BSD-3-Clause"
] | null | null | null | #include <cosma/multiply.hpp>
#include <algorithm>
#include <cctype>
#include <chrono>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <limits>
#include <sstream>
#include <string>
#include <vector>
#include "../utils/parse_strategy.hpp"
using namespace cosma;
template <typename T>
void fill_int(T... | 23.94 | 77 | 0.601086 | [
"vector"
] |
2f9ce8cbf75c15b2dfd2bfb7313f0457e3736fea | 16,263 | cpp | C++ | Tests/Source/ClosestJammingStepTests.cpp | MINATILO/packing-generation | 4d4f5d037e0687b57178602b989431e82a5c8b96 | [
"MIT"
] | 79 | 2015-08-23T12:05:30.000Z | 2022-03-31T16:39:56.000Z | Tests/Source/ClosestJammingStepTests.cpp | MINATILO/packing-generation | 4d4f5d037e0687b57178602b989431e82a5c8b96 | [
"MIT"
] | 31 | 2015-07-20T17:57:08.000Z | 2022-03-02T10:31:50.000Z | Tests/Source/ClosestJammingStepTests.cpp | MINATILO/packing-generation | 4d4f5d037e0687b57178602b989431e82a5c8b96 | [
"MIT"
] | 36 | 2015-10-14T02:43:16.000Z | 2022-03-18T12:51:03.000Z | // Copyright (c) 2013 Vasili Baranau
// Distributed under the MIT software license
// See the accompanying file License.txt or http://opensource.org/licenses/MIT
#include "../Headers/ClosestJammingStepTests.h"
#include "../Headers/Assert.h"
#include "Core/Headers/Math.h"
#include "Core/Headers/MemoryUtility.h"
#i... | 45.427374 | 200 | 0.675644 | [
"geometry",
"vector",
"model"
] |
2f9fc9e3402d775f0723036645f21af163b57168 | 2,206 | cpp | C++ | 1. White/Week 4/07. Students list/main.cpp | AmaterasuOmikami/The-art-of-modern-Cpp-development | 4f0958197da92d216ee526384a6f7386a0fe62a0 | [
"MIT"
] | 1 | 2022-02-17T10:58:58.000Z | 2022-02-17T10:58:58.000Z | 1. White/Week 4/07. Students list/main.cpp | AmaterasuOmikami/The-art-of-modern-Cpp-development | 4f0958197da92d216ee526384a6f7386a0fe62a0 | [
"MIT"
] | null | null | null | 1. White/Week 4/07. Students list/main.cpp | AmaterasuOmikami/The-art-of-modern-Cpp-development | 4f0958197da92d216ee526384a6f7386a0fe62a0 | [
"MIT"
] | null | null | null | /*
* Определите структуру «Студент» со следующими полями: имя, фамилия, день,
* месяц и год рождения. Создайте вектор из таких структур, заполните его из
* входных данных и затем по запросам выведите нужные поля. Чтение и запись
* данных в этой задаче производится с использованием стандартных потоков.
*
* Формат ... | 28.649351 | 80 | 0.643246 | [
"vector"
] |
2fb8aae3d7be0936cabd1b5eeb1db979f04e45cb | 1,717 | hpp | C++ | irohad/simulator/verified_proposal_creator.hpp | truongnmt/iroha | e9b969df9a0eb6ce62eae3ab62c5c3f046a5e6e1 | [
"Apache-2.0"
] | null | null | null | irohad/simulator/verified_proposal_creator.hpp | truongnmt/iroha | e9b969df9a0eb6ce62eae3ab62c5c3f046a5e6e1 | [
"Apache-2.0"
] | null | null | null | irohad/simulator/verified_proposal_creator.hpp | truongnmt/iroha | e9b969df9a0eb6ce62eae3ab62c5c3f046a5e6e1 | [
"Apache-2.0"
] | null | null | null | /**
* Copyright Soramitsu Co., Ltd. 2017 All Rights Reserved.
* http://soramitsu.co.jp
*
* 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/LICENS... | 29.603448 | 75 | 0.70297 | [
"object"
] |
2fd3131648a667c3ee868c83a905916658786556 | 1,938 | cpp | C++ | src/ToGraphvizWriter.cpp | dueringa/WikiWalker | 24a83936efac1e217af949275b0677861c216957 | [
"MIT"
] | null | null | null | src/ToGraphvizWriter.cpp | dueringa/WikiWalker | 24a83936efac1e217af949275b0677861c216957 | [
"MIT"
] | 1 | 2018-03-17T15:42:18.000Z | 2018-03-19T11:49:03.000Z | src/ToGraphvizWriter.cpp | dueringa/WikiWalker | 24a83936efac1e217af949275b0677861c216957 | [
"MIT"
] | null | null | null | //! \file ToGraphvizWriter.cpp
#include "ToGraphvizWriter.h"
#include <string>
// uh-oh...
#include <regex>
#include "Article.h"
namespace WikiWalker
{
static void writeHeader(std::ostream& os)
{
os << "digraph G {";
os << std::endl;
}
static void writeFooter(std::ostream& os)
{
os << "}";
... | 23.634146 | 80 | 0.567595 | [
"shape"
] |
2fd4f5c2197b0a9ea00a951cbbd62ef68b9f9a4b | 13,255 | hpp | C++ | source/patterns.hpp | huhlig/libcube | f322593b511ec75375a4a9ac3fd3596a64c39933 | [
"Apache-2.0"
] | 2 | 2020-01-18T21:34:24.000Z | 2020-07-12T04:31:20.000Z | source/patterns.hpp | huhlig/libcube | f322593b511ec75375a4a9ac3fd3596a64c39933 | [
"Apache-2.0"
] | null | null | null | source/patterns.hpp | huhlig/libcube | f322593b511ec75375a4a9ac3fd3596a64c39933 | [
"Apache-2.0"
] | null | null | null | #ifndef LEDCUBE_PATTERNS_HPP
#define LEDCUBE_PATTERNS_HPP
#include "cube.hpp"
#include <vector>
std::vector<MonochromeCube<4, 4, 4>::Frame> pattern_1{
MonochromeCube<4, 4, 4>::Frame(MonochromeCube<4, 4, 4>::Buffer{
0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00,
... | 33.987179 | 71 | 0.419615 | [
"vector"
] |
2fd8ad327fa2b93c58ec945a05cccedb02d1ec79 | 2,781 | cpp | C++ | KernelSDK/src/coredrivers/KernelFileLogDriver/cTextLogDriver.cpp | rodrigomr/VFS | 6b68b00df8cb668106c2d0841cbcd46138298717 | [
"Apache-2.0"
] | 38 | 2018-09-24T09:37:41.000Z | 2022-02-21T04:16:43.000Z | KernelSDK/src/coredrivers/KernelFileLogDriver/cTextLogDriver.cpp | rodrigomr/VFS | 6b68b00df8cb668106c2d0841cbcd46138298717 | [
"Apache-2.0"
] | 1 | 2018-10-02T17:57:44.000Z | 2018-10-07T06:55:44.000Z | KernelSDK/src/coredrivers/KernelFileLogDriver/cTextLogDriver.cpp | rodrigomr/VFS | 6b68b00df8cb668106c2d0841cbcd46138298717 | [
"Apache-2.0"
] | 6 | 2018-10-02T17:12:38.000Z | 2021-01-27T10:01:30.000Z | // Copyright 2018 Grass Valley, A Belden Brand
// 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 ag... | 28.670103 | 179 | 0.665228 | [
"transform"
] |
2fd8e9828961f7d050b42cea252f14c75966fd85 | 4,819 | tpp | C++ | Core/src.tpp/Range$en-us.tpp | koz4k/soccer | 7bceea654b50c5c0e18effd38e79249bd295e0a4 | [
"MIT"
] | 1 | 2018-09-28T17:04:11.000Z | 2018-09-28T17:04:11.000Z | Core/src.tpp/Range$en-us.tpp | koz4k/soccer | 7bceea654b50c5c0e18effd38e79249bd295e0a4 | [
"MIT"
] | 1 | 2021-04-06T21:57:39.000Z | 2021-04-06T21:57:39.000Z | Core/src.tpp/Range$en-us.tpp | koz4k/soccer | 7bceea654b50c5c0e18effd38e79249bd295e0a4 | [
"MIT"
] | 3 | 2017-08-26T12:06:05.000Z | 2019-11-22T16:57:47.000Z | topic "Range";
[2 $$0,0#00000000000000000000000000000000:Default]
[i448;a25;kKO9;2 $$1,0#37138531426314131252341829483380:class]
[l288;2 $$2,2#27521748481378242620020725143825:desc]
[0 $$3,0#96390100711032703541132217272105:end]
[H6;0 $$4,0#05600065144404261032431302351956:begin]
[i448;a25;kKO9;2 $$5,0#3713853142... | 48.19 | 96 | 0.584146 | [
"vector"
] |
7c7f630ecddb87582c89aae4947b20d350ed4cfb | 829 | cc | C++ | algorithm/test.cc | zhangxuhuizju/cpp-primer-5th | e85b8493cc53157b0d1edac45d0c5b57e9a322b5 | [
"OLDAP-2.2.1"
] | 1 | 2019-10-15T08:39:56.000Z | 2019-10-15T08:39:56.000Z | algorithm/test.cc | zhangxuhuizju/cpp-primer-5th | e85b8493cc53157b0d1edac45d0c5b57e9a322b5 | [
"OLDAP-2.2.1"
] | null | null | null | algorithm/test.cc | zhangxuhuizju/cpp-primer-5th | e85b8493cc53157b0d1edac45d0c5b57e9a322b5 | [
"OLDAP-2.2.1"
] | null | null | null |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
//返回两部分的差值
int diff(vector<int>& vec)
{
int len = vec.size();
int sum = 0;
for (int i = 0; i < len; ++i) {
sum += vec[i];
}
vector<vector<int>> dp;
for (int i = 0; i <= len; i++) {
vector<int>tmp;... | 18.840909 | 83 | 0.436671 | [
"vector"
] |
7c82c70955b6bb701c7cce0c10433c1ce00e2e1f | 2,694 | cpp | C++ | src/SearchOptV.cpp | PaCoders/SAT-to-CNF-Reductor | 38fc699997fe58120c183711abea4888748a9292 | [
"MIT"
] | null | null | null | src/SearchOptV.cpp | PaCoders/SAT-to-CNF-Reductor | 38fc699997fe58120c183711abea4888748a9292 | [
"MIT"
] | null | null | null | src/SearchOptV.cpp | PaCoders/SAT-to-CNF-Reductor | 38fc699997fe58120c183711abea4888748a9292 | [
"MIT"
] | null | null | null | /*
==============================================================================
Search and Optimisation problem
Francisco Chanivet Sanchez
==============================================================================
*/
#include <iostream>
#include <list>
#include <cstdlib>
#include <vector>
#include <fst... | 24.27027 | 143 | 0.556422 | [
"vector"
] |
7c8609e49f81e4082823ba1ec0ef0a354cf51ea4 | 7,178 | cpp | C++ | src/Persistence/src/Dao/SQLite/SQLiteHandleDao.cpp | till213/SkyDolly | 75caa54fa9fcbaae04b6605c3c1a68e0cb9a0c16 | [
"MIT"
] | 21 | 2021-03-01T00:19:41.000Z | 2022-02-22T02:57:19.000Z | src/Persistence/src/Dao/SQLite/SQLiteHandleDao.cpp | till213/SkyDolly | 75caa54fa9fcbaae04b6605c3c1a68e0cb9a0c16 | [
"MIT"
] | 11 | 2021-06-20T20:16:56.000Z | 2022-03-28T19:03:34.000Z | src/Persistence/src/Dao/SQLite/SQLiteHandleDao.cpp | till213/SkyDolly | 75caa54fa9fcbaae04b6605c3c1a68e0cb9a0c16 | [
"MIT"
] | 3 | 2021-04-06T19:06:16.000Z | 2022-01-20T21:22:39.000Z | /**
* Sky Dolly - The Black Sheep for your Flight Recordings
*
* Copyright (c) Oliver Knoll
* All rights reserved.
*
* MIT License
*
* 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
* ... | 37.778947 | 173 | 0.678462 | [
"vector",
"model"
] |
7c937fa4fd82b7a1a46a47c26b1ee6369a18001d | 3,607 | cpp | C++ | aws-cpp-sdk-acm-pca/source/model/CertificateAuthorityStatus.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-acm-pca/source/model/CertificateAuthorityStatus.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2022-01-03T23:59:37.000Z | 2022-01-03T23:59:37.000Z | aws-cpp-sdk-acm-pca/source/model/CertificateAuthorityStatus.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2021-11-09T11:58:03.000Z | 2021-11-09T11:58:03.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/acm-pca/model/CertificateAuthorityStatus.h>
#include <aws/core/utils/HashingUtils.h>
#include <aws/core/Globals.h>
#include <aws/core/utils/EnumParseOverflowContainer.h>
using namespace... | 34.028302 | 100 | 0.630995 | [
"model"
] |
7c9b93759a822f5ed8c382fb9e3fa79c730f2bfd | 1,049 | cpp | C++ | aws-cpp-sdk-forecast/source/model/Baseline.cpp | Nexuscompute/aws-sdk-cpp | e7ef485e46e6962c9e084b8c9b104c1bfcceaf26 | [
"Apache-2.0"
] | null | null | null | aws-cpp-sdk-forecast/source/model/Baseline.cpp | Nexuscompute/aws-sdk-cpp | e7ef485e46e6962c9e084b8c9b104c1bfcceaf26 | [
"Apache-2.0"
] | null | null | null | aws-cpp-sdk-forecast/source/model/Baseline.cpp | Nexuscompute/aws-sdk-cpp | e7ef485e46e6962c9e084b8c9b104c1bfcceaf26 | [
"Apache-2.0"
] | null | null | null | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/forecast/model/Baseline.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws
{
namespace F... | 17.483333 | 74 | 0.734032 | [
"model"
] |
7ca8b56a9d25b3a3b4e5b5f5a9e3f61cf08c5727 | 3,993 | hpp | C++ | include/lastfmpp/detail/transform.hpp | chrismanning/lastfmpp | 59439e62d2654359a48f8244a4b69b95d398beb3 | [
"MIT"
] | null | null | null | include/lastfmpp/detail/transform.hpp | chrismanning/lastfmpp | 59439e62d2654359a48f8244a4b69b95d398beb3 | [
"MIT"
] | null | null | null | include/lastfmpp/detail/transform.hpp | chrismanning/lastfmpp | 59439e62d2654359a48f8244a4b69b95d398beb3 | [
"MIT"
] | null | null | null | /**************************************************************************
** Copyright (C) 2015 Christian Manning
**
** This software may be modified and distributed under the terms
** of the MIT license. See the LICENSE file for details.
**************************************************************************/
#... | 30.25 | 115 | 0.627348 | [
"vector",
"transform"
] |
7ca9c2945735811419b10d52832490e5df3d88d5 | 432 | cpp | C++ | unix/phasor.cpp | kybr/MAT240B-2019 | d3a875f90e12df195a172b4f4f485153d4251086 | [
"MIT"
] | null | null | null | unix/phasor.cpp | kybr/MAT240B-2019 | d3a875f90e12df195a172b4f4f485153d4251086 | [
"MIT"
] | null | null | null | unix/phasor.cpp | kybr/MAT240B-2019 | d3a875f90e12df195a172b4f4f485153d4251086 | [
"MIT"
] | null | null | null | #include "everything.h"
using namespace diy;
int main(int argc, char* argv[]) {
float frequency = 220;
float phase = 0;
std::vector<std::string> a(argv, argv + argc);
if (argc > 2) phase = fmod(stof(a[2]), 2.0f);
if (argc > 1) frequency = stof(a[1]);
float perSampleIncrement = frequency / SAMPLE_RATE;
... | 22.736842 | 53 | 0.613426 | [
"vector"
] |
7cab89e54e13cc555b0b5c4f34193c12514c5bdf | 737 | cc | C++ | cpp/leetcode/78.subsets.cc | liubang/laboratory | 747f239a123cd0c2e5eeba893b9a4d1536555b1e | [
"MIT"
] | 3 | 2021-03-03T13:18:23.000Z | 2022-02-09T07:49:24.000Z | cpp/leetcode/78.subsets.cc | liubang/laboratory | 747f239a123cd0c2e5eeba893b9a4d1536555b1e | [
"MIT"
] | null | null | null | cpp/leetcode/78.subsets.cc | liubang/laboratory | 747f239a123cd0c2e5eeba893b9a4d1536555b1e | [
"MIT"
] | 1 | 2021-03-29T15:21:42.000Z | 2021-03-29T15:21:42.000Z | #include <gtest/gtest.h>
#include <vector>
namespace {
class Solution {
public:
std::vector<std::vector<int>> subsets(const std::vector<int>& nums) {
std::vector<std::vector<int>> ret;
ret.push_back({});
for (int i = 0; i < nums.size(); ++i) {
int all = ret.size();
for (int j = 0; j < all; ... | 23.774194 | 71 | 0.497965 | [
"vector"
] |
7cb09314fb98548d046fa5fd48db52a44e26349f | 7,254 | cpp | C++ | File.cpp | gochaorg/zipsfx-cpp | bcfa69f3bf5009f1e4c3e426feb176268312d340 | [
"MIT"
] | 1 | 2020-03-30T05:13:09.000Z | 2020-03-30T05:13:09.000Z | File.cpp | gochaorg/zipsfx-cpp | bcfa69f3bf5009f1e4c3e426feb176268312d340 | [
"MIT"
] | null | null | null | File.cpp | gochaorg/zipsfx-cpp | bcfa69f3bf5009f1e4c3e426feb176268312d340 | [
"MIT"
] | null | null | null | /*
* File: File.cpp
* Author: User
*
* Created on 14 Январь 2012 г., 23:35
*/
#include "File.h"
#include <sys/types.h>
#include <sys/stat.h>
#include <libgen.h>
#include <stdlib.h>
#include <io.h>
#include <iostream>
#include <direct.h>
#include <dirent.h>
#include <string.h>
#include <winbase.h>
#include "... | 24.673469 | 84 | 0.506479 | [
"vector"
] |
7cb38b0619783dda7afbefa6413b74ca03bc2381 | 1,376 | cpp | C++ | src/GraphTheory/Kruskal.cpp | Rabbytr/Algorithm-Cpp | 1723ae9e522358a16faeccf7f61324ba95b9d602 | [
"MIT"
] | 1 | 2018-11-19T05:11:44.000Z | 2018-11-19T05:11:44.000Z | src/GraphTheory/Kruskal.cpp | Rabbytr/Algorithm-Cpp | 1723ae9e522358a16faeccf7f61324ba95b9d602 | [
"MIT"
] | null | null | null | src/GraphTheory/Kruskal.cpp | Rabbytr/Algorithm-Cpp | 1723ae9e522358a16faeccf7f61324ba95b9d602 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC diagnostic error "-std=c++11"
//#pragma comment(linker, "/STACK:102400000,102400000")
#define REP(i, a, b) for(int i = a; i < b; ++i)
#define debug(x) { cerr << #x << '=' << x << "\n"; }
#define Arr(a, l, r) { cerr << #a << " = {"; REP(_, l, r) cerr << ' ... | 22.557377 | 96 | 0.572674 | [
"vector"
] |
7cc24ee321d52be7a7d3031bcdc65609c263d4f3 | 975 | hpp | C++ | program/ode_solver/include/hypercubes/leaf.hpp | statphysandml/ODEVisualisation | cadc8f9b1e2adeaf1ce702197af7119e9f3b1ede | [
"MIT"
] | null | null | null | program/ode_solver/include/hypercubes/leaf.hpp | statphysandml/ODEVisualisation | cadc8f9b1e2adeaf1ce702197af7119e9f3b1ede | [
"MIT"
] | null | null | null | program/ode_solver/include/hypercubes/leaf.hpp | statphysandml/ODEVisualisation | cadc8f9b1e2adeaf1ce702197af7119e9f3b1ede | [
"MIT"
] | null | null | null | //
// Created by lukas on 13.03.19.
//
#ifndef PROJECT_LEAF_HPP
#define PROJECT_LEAF_HPP
#include "param_helper/json.hpp"
using json = nlohmann::json;
class Leaf
{
public:
Leaf(const std::vector< int > cube_indices_) :
cube_indices(cube_indices_), depth(cube_indices_.size() - 1)
{}
void inf... | 21.666667 | 81 | 0.580513 | [
"vector"
] |
7cc40e829d5c1ea459e3571647b9d41e8238aa47 | 7,426 | cpp | C++ | FilePersistence/src/SystemClipboard.cpp | dimitar-asenov/Envision | 1ab5c846fca502b7fe73ae4aff59e8746248446c | [
"BSD-3-Clause"
] | 75 | 2015-01-18T13:29:43.000Z | 2022-01-14T08:02:01.000Z | FilePersistence/src/SystemClipboard.cpp | dimitar-asenov/Envision | 1ab5c846fca502b7fe73ae4aff59e8746248446c | [
"BSD-3-Clause"
] | 364 | 2015-01-06T10:20:21.000Z | 2018-12-17T20:12:28.000Z | FilePersistence/src/SystemClipboard.cpp | dimitar-asenov/Envision | 1ab5c846fca502b7fe73ae4aff59e8746248446c | [
"BSD-3-Clause"
] | 14 | 2015-01-09T00:44:24.000Z | 2022-02-22T15:01:44.000Z | /***********************************************************************************************************************
**
** Copyright (c) 2011, 2014 ETH Zurich
** All rights reserved.
**
** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the
** following c... | 25.258503 | 120 | 0.702936 | [
"model"
] |
7cc538ec5aefefe18afddfcd016cda2c5fe459ac | 7,865 | cpp | C++ | VC/NotUsedCpps/CSAFuncs.cpp | hkujy/VC | 54b79fac4ecf4ac225b54325d879a580a9b17be6 | [
"MIT"
] | null | null | null | VC/NotUsedCpps/CSAFuncs.cpp | hkujy/VC | 54b79fac4ecf4ac225b54325d879a580a9b17be6 | [
"MIT"
] | null | null | null | VC/NotUsedCpps/CSAFuncs.cpp | hkujy/VC | 54b79fac4ecf4ac225b54325d879a580a9b17be6 | [
"MIT"
] | null | null | null | #include "CommonHeaders.h"
#include <assert.h>
#include <math.h> /* pow */
#include "RandomFuncs.h"
using namespace std;
void GenerateCloneSet(const vector<CHROME> &Chroms, const int NumPop, const int NumClone,
vector<int> &CloneSet);
// the compare class is from http://www.cplusplus.com/reference/algorithm/sort... | 26.129568 | 108 | 0.641322 | [
"vector"
] |
7cd78a6cb9a8341a395212db9b4c4ba4f376599e | 8,864 | cc | C++ | tool/SecVerilog-1.0/SecVerilog/tgt-vhdl/cast.cc | gokulprasath7c/secure_i2c_using_ift | 124384983ba70e8164b7217db70c43dfdf302d4b | [
"MIT"
] | 1 | 2019-01-28T21:23:37.000Z | 2019-01-28T21:23:37.000Z | tool/SecVerilog-1.0/SecVerilog/tgt-vhdl/cast.cc | gokulprasath7c/secure_i2c_using_ift | 124384983ba70e8164b7217db70c43dfdf302d4b | [
"MIT"
] | null | null | null | tool/SecVerilog-1.0/SecVerilog/tgt-vhdl/cast.cc | gokulprasath7c/secure_i2c_using_ift | 124384983ba70e8164b7217db70c43dfdf302d4b | [
"MIT"
] | null | null | null | /*
* Generate code to convert between VHDL types.
*
* Copyright (C) 2008-2009 Nick Gasson (nick@nickg.me.uk)
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of th... | 28.410256 | 81 | 0.636169 | [
"vector"
] |
7cd92af0471be84f1d0e329000807ad93400a43e | 1,190 | cpp | C++ | recursion-and-dp/towers-of-hanoi.cpp | mayankamencherla/cracking-the-coding-interview-solutions | 3cccad728cd4d41154eed9e93dd0546923a23fda | [
"MIT"
] | 3 | 2018-12-04T09:41:01.000Z | 2020-10-05T17:30:49.000Z | recursion-and-dp/towers-of-hanoi.cpp | mayankamencherla/cracking-the-coding-interview-solutions | 3cccad728cd4d41154eed9e93dd0546923a23fda | [
"MIT"
] | null | null | null | recursion-and-dp/towers-of-hanoi.cpp | mayankamencherla/cracking-the-coding-interview-solutions | 3cccad728cd4d41154eed9e93dd0546923a23fda | [
"MIT"
] | 1 | 2018-12-04T09:41:05.000Z | 2018-12-04T09:41:05.000Z | /**
* Given 2 numbers, recursively multiply them
* Without using *, use +, -, >>, <<
* Minimize the operations listed above
*/
#include <vector>
#include <iostream>
#include <stack>
using namespace std;
void initializeMain(stack<int>& main, int n)
{
for (int i=n; i>=1; i--)
{
main.push(i);
}
... | 15.25641 | 83 | 0.569748 | [
"vector"
] |
7ce52c51f24fc7fbd797674f7fe29ea32f1f5459 | 359 | cpp | C++ | Leetcode/0406. Queue Reconstruction by Height/0406.cpp | Next-Gen-UI/Code-Dynamics | a9b9d5e3f27e870b3e030c75a1060d88292de01c | [
"MIT"
] | null | null | null | Leetcode/0406. Queue Reconstruction by Height/0406.cpp | Next-Gen-UI/Code-Dynamics | a9b9d5e3f27e870b3e030c75a1060d88292de01c | [
"MIT"
] | null | null | null | Leetcode/0406. Queue Reconstruction by Height/0406.cpp | Next-Gen-UI/Code-Dynamics | a9b9d5e3f27e870b3e030c75a1060d88292de01c | [
"MIT"
] | null | null | null | class Solution {
public:
vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
vector<vector<int>> ans;
sort(begin(people), end(people), [](const auto& a, const auto& b) {
return a[0] == b[0] ? a[1] < b[1] : a[0] > b[0];
});
for (const auto& p : people)
ans.insert(begin(an... | 22.4375 | 71 | 0.554318 | [
"vector"
] |
7cf02038bbd99599cd784c5266df28efea9156d3 | 60,523 | cpp | C++ | demoMain.cpp | TheMagnat/Demo-Graphique-OpenGL | af1d21df44ce23bf272829e87417c771b4eaef77 | [
"MIT"
] | null | null | null | demoMain.cpp | TheMagnat/Demo-Graphique-OpenGL | af1d21df44ce23bf272829e87417c771b4eaef77 | [
"MIT"
] | null | null | null | demoMain.cpp | TheMagnat/Demo-Graphique-OpenGL | af1d21df44ce23bf272829e87417c771b4eaef77 | [
"MIT"
] | null | null | null |
/*
Projet programmation Graphique Guillaume Magniadas
Note : Il y à certaine partie du code qui aurait pu être mieux écrite pour mieux tirer profit des avantage du C++,
En commencant ce projet je me suis trop vite lancé, je pense que j'aurais pu ecrire plus de classe pour améliorer la lisibilité du code,
... | 27.610858 | 157 | 0.632685 | [
"render",
"vector",
"model",
"3d"
] |
7cf68c4bf2a50c7b40c11b1c52fbb7c9e8750f30 | 2,355 | hpp | C++ | LinaPhysics/include/Core/PhysicsCommon.hpp | moonantonio/LinaEngine | fe5a91a85c64dd0719656eb38e2fb37037bacfc1 | [
"MIT"
] | 10 | 2018-09-30T22:29:27.000Z | 2018-10-08T14:04:42.000Z | LinaPhysics/include/Core/PhysicsCommon.hpp | moonantonio/LinaEngine | fe5a91a85c64dd0719656eb38e2fb37037bacfc1 | [
"MIT"
] | 15 | 2018-10-02T22:14:17.000Z | 2018-10-12T08:01:36.000Z | LinaPhysics/include/Core/PhysicsCommon.hpp | moonantonio/LinaEngine | fe5a91a85c64dd0719656eb38e2fb37037bacfc1 | [
"MIT"
] | 1 | 2018-09-30T16:37:10.000Z | 2018-09-30T16:37:10.000Z | /*
This file is a part of: Lina Engine
https://github.com/inanevin/LinaEngine
Author: Inan Evin
http://www.inanevin.com
Copyright (c) [2018-2020] [Inan Evin]
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 t... | 30.192308 | 78 | 0.763907 | [
"vector"
] |
7cf9d671896e053c4560217c938595ba0eeaf027 | 6,239 | hpp | C++ | include/Roadmap.hpp | TobiasLundby/ROVI2 | d2666abf12196930074db910488e33d6fc43f7cc | [
"BSD-3-Clause"
] | 1 | 2019-01-07T14:33:00.000Z | 2019-01-07T14:33:00.000Z | include/Roadmap.hpp | TobiasLundby/ROVI2 | d2666abf12196930074db910488e33d6fc43f7cc | [
"BSD-3-Clause"
] | 1 | 2017-05-14T20:28:44.000Z | 2017-05-18T07:50:48.000Z | include/Roadmap.hpp | TobiasLundby/ROVI2 | d2666abf12196930074db910488e33d6fc43f7cc | [
"BSD-3-Clause"
] | null | null | null | #ifndef ROADMAP_ROS
#define ROADMAP_ROS
#include "ros/ros.h"
#include <rw/models/WorkCell.hpp>
#include <rw/kinematics/State.hpp>
#include <rw/models/Device.hpp>
#include <rw/rw.hpp>
#include <rw/math/Q.hpp>
#include "rovi2/Q.h"
#include "rovi2/Plan.h"
#include "rovi2/path.h"
#include "rovi2/Conf.h"
//#include <rw/mat... | 27.606195 | 131 | 0.729604 | [
"vector"
] |
cfb3272cdd9294edf782382362a0a08084e877ff | 3,458 | cpp | C++ | cpp_concepts/code/multi_threading_v1.cpp | filippo82/cpp_programming | 56e8046aadbebf1f8a883f990c31300e56522011 | [
"Apache-2.0"
] | null | null | null | cpp_concepts/code/multi_threading_v1.cpp | filippo82/cpp_programming | 56e8046aadbebf1f8a883f990c31300e56522011 | [
"Apache-2.0"
] | null | null | null | cpp_concepts/code/multi_threading_v1.cpp | filippo82/cpp_programming | 56e8046aadbebf1f8a883f990c31300e56522011 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <vector>
#include <thread>
#include <chrono>
// using namespace std;
// Function
void accumulator_function2(const std::vector<int> &v, unsigned long long &acm,
unsigned int beginIndex, unsigned int endIndex)
{
acm = 0;
for (unsigned int i = beginIndex; i... | 26.6 | 103 | 0.539618 | [
"vector"
] |
cfb3a87a5bf51c285a618fbc224e26927c68d057 | 8,098 | cpp | C++ | game_2048_v2/Chessboard.cpp | trionfordring/CppGames | b6e5882df55e3ff0a432b8432f0d7063a101f0f4 | [
"Apache-2.0"
] | null | null | null | game_2048_v2/Chessboard.cpp | trionfordring/CppGames | b6e5882df55e3ff0a432b8432f0d7063a101f0f4 | [
"Apache-2.0"
] | null | null | null | game_2048_v2/Chessboard.cpp | trionfordring/CppGames | b6e5882df55e3ff0a432b8432f0d7063a101f0f4 | [
"Apache-2.0"
] | null | null | null | //
// Created by fordring on 2020/5/3.
//
#include "Chessboard.h"
using std::vector;
Chessboard::Chessboard(int width, int height) : board(height, vector<Cell>(width)), maxNum(0) {
}
bool Chessboard::insertPiece(Point point, int num) {
if(isEmpty(point)){
setPiece(point,num);
return true;
}
... | 25.872204 | 95 | 0.431959 | [
"vector"
] |
cfc1cf14746ce3e3585ee61262a24cb5423c98b4 | 4,275 | hpp | C++ | src/Externals/spire/es-render/comp/CommonUniforms.hpp | Haydelj/SCIRun | f7ee04d85349b946224dbff183438663e54b9413 | [
"MIT"
] | 92 | 2015-02-09T22:42:11.000Z | 2022-03-25T09:14:50.000Z | src/Externals/spire/es-render/comp/CommonUniforms.hpp | Haydelj/SCIRun | f7ee04d85349b946224dbff183438663e54b9413 | [
"MIT"
] | 1,618 | 2015-01-05T19:39:13.000Z | 2022-03-27T20:28:45.000Z | src/Externals/spire/es-render/comp/CommonUniforms.hpp | Haydelj/SCIRun | f7ee04d85349b946224dbff183438663e54b9413 | [
"MIT"
] | 64 | 2015-02-20T17:51:23.000Z | 2021-11-19T07:08:08.000Z | /*
For more information, please see: http://software.sci.utah.edu
The MIT License
Copyright (c) 2020 Scientific Computing and Imaging Institute,
University of Utah.
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the ... | 40.714286 | 123 | 0.663626 | [
"object",
"vector",
"transform"
] |
cfca57262a2aeb326cc49511e2c5eebb5de26fe1 | 11,845 | cpp | C++ | src/async_engine.cpp | quarkslab/nodescan | 2c9f14ed4cb1e1548a73c6a565b96d5618bd4c0a | [
"BSD-3-Clause"
] | 11 | 2015-01-01T05:37:01.000Z | 2021-11-15T10:45:00.000Z | src/async_engine.cpp | quarkslab/nodescan | 2c9f14ed4cb1e1548a73c6a565b96d5618bd4c0a | [
"BSD-3-Clause"
] | null | null | null | src/async_engine.cpp | quarkslab/nodescan | 2c9f14ed4cb1e1548a73c6a565b96d5618bd4c0a | [
"BSD-3-Clause"
] | 4 | 2015-04-20T01:28:28.000Z | 2021-11-14T03:26:49.000Z | /*
* Copyright (c) 2014, Quarkslab
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice, this
* list of condition... | 26.322222 | 150 | 0.688729 | [
"vector"
] |
cfcf326e019905df191a038a5c0674252cd20379 | 1,423 | cpp | C++ | Kickstart/KickStart20B/gen.cpp | Shahraaz/CP_P_S5 | b068ad02d34338337e549d92a14e3b3d9e8df712 | [
"MIT"
] | null | null | null | Kickstart/KickStart20B/gen.cpp | Shahraaz/CP_P_S5 | b068ad02d34338337e549d92a14e3b3d9e8df712 | [
"MIT"
] | null | null | null | Kickstart/KickStart20B/gen.cpp | Shahraaz/CP_P_S5 | b068ad02d34338337e549d92a14e3b3d9e8df712 | [
"MIT"
] | null | null | null | // Optimise
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/home/shahraaz/bin/debug.h"
#else
#define db(...)
#endif
using ll = long long;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(), v.end()
const int NAX = 9999, MOD = 1000000007;
// double prob[NAX][NAX];
//... | 21.892308 | 131 | 0.471539 | [
"vector"
] |
cfcf9f429b223d0ba5ed35e3d784d41f420be145 | 20,745 | cpp | C++ | branch/old_angsys/angsys_beta1/source/angsys/angsys.shared/source/collections/vector.cpp | ChuyX3/angsys | 89b2eaee866bcfd11e66efda49b38acc7468c780 | [
"Apache-2.0"
] | null | null | null | branch/old_angsys/angsys_beta1/source/angsys/angsys.shared/source/collections/vector.cpp | ChuyX3/angsys | 89b2eaee866bcfd11e66efda49b38acc7468c780 | [
"Apache-2.0"
] | null | null | null | branch/old_angsys/angsys_beta1/source/angsys/angsys.shared/source/collections/vector.cpp | ChuyX3/angsys | 89b2eaee866bcfd11e66efda49b38acc7468c780 | [
"Apache-2.0"
] | null | null | null | /*********************************************************************************************************************/
/* File Name: vector.cpp */
/* Author: Ing. Jesus Rocha <chuyangel.rm@gmail.com>, July 2016. ... | 30.417889 | 213 | 0.708797 | [
"vector"
] |
cfd03337362251f6bc4848dbe00885498bde51b2 | 3,765 | cpp | C++ | src/util/helper.cpp | raphaelsulzer/mesh-tools | 73150bec58813e2b9b750205807002a1c3f18884 | [
"MIT"
] | 1 | 2022-02-24T03:39:05.000Z | 2022-02-24T03:39:05.000Z | src/util/helper.cpp | raphaelsulzer/mesh-tools | 73150bec58813e2b9b750205807002a1c3f18884 | [
"MIT"
] | 1 | 2022-02-24T06:59:59.000Z | 2022-03-04T01:25:09.000Z | src/util/helper.cpp | raphaelsulzer/mesh-tools | 73150bec58813e2b9b750205807002a1c3f18884 | [
"MIT"
] | null | null | null | #include <base/cgal_typedefs.h>
#include <util/helper.h>
//#include <processing/tetIntersection.h>
#include <random>
#include <iterator>
using namespace std;
#ifdef RECONBENCH
#include <modeling/Vector3.h>
const Vector3RB point2Vector3RB(const Point p){
return Vector3RB(p.x(),p.y(),p.z());
}
#endif
const Eige... | 22.54491 | 93 | 0.630013 | [
"vector"
] |
cfd4375c61897d5ed439c1b5ee8362a617ff04a7 | 2,066 | cc | C++ | libs/core/src/core/image_canvas.cc | madeso/euphoria | 59b72d148a90ae7a19e197e91216d4d42f194fd5 | [
"MIT"
] | 24 | 2015-07-27T14:32:18.000Z | 2021-11-15T12:11:31.000Z | libs/core/src/core/image_canvas.cc | madeso/euphoria | 59b72d148a90ae7a19e197e91216d4d42f194fd5 | [
"MIT"
] | 27 | 2021-07-09T21:18:40.000Z | 2021-07-14T13:39:56.000Z | libs/core/src/core/image_canvas.cc | madeso/euphoria | 59b72d148a90ae7a19e197e91216d4d42f194fd5 | [
"MIT"
] | null | null | null | #include "core/image_canvas.h"
#include "core/image.h"
#include "core/assert.h"
#include "core/numeric.h"
#include "core/mat2.h"
#include "core/image_draw.h"
#include "core/stringutils.h"
#include "core/stringmerger.h"
#include "core/log.h"
namespace euphoria::core
{
Vec2f
Canvas::transform_position(const ... | 21.081633 | 93 | 0.5697 | [
"transform"
] |
cfd78d3bbc2247041caf84455670701e0e613962 | 5,403 | cpp | C++ | hard/4_median_of_two_sorted_arrays.cpp | pdu/leetcode_cpp | c487df7561f92562b20a31317957f47e0a20c485 | [
"Apache-2.0"
] | 4 | 2019-07-22T03:53:23.000Z | 2019-10-17T01:37:41.000Z | hard/4_median_of_two_sorted_arrays.cpp | pdu/leetcode_cpp | c487df7561f92562b20a31317957f47e0a20c485 | [
"Apache-2.0"
] | null | null | null | hard/4_median_of_two_sorted_arrays.cpp | pdu/leetcode_cpp | c487df7561f92562b20a31317957f47e0a20c485 | [
"Apache-2.0"
] | 2 | 2020-03-10T03:30:41.000Z | 2020-11-10T06:51:34.000Z | // step 1: clarify
//
// 1. it's two sorted array
// 2. if there're two medium numbers, get the average value
// 3. the arrays cannot be both empty but maybe empty
//
// step 2: solutions
//
// the problem is: find the kth number in two sorted array
//
// the first solution:
// 1. get 2 indexes starting from the begin... | 32.160714 | 143 | 0.568388 | [
"vector"
] |
cfd95648aedf7fddba8c4f3b43b3f14a49aa2ada | 2,001 | cpp | C++ | out/production/leetcode/io/github/zhengyhn/leetcode/advantage_shuffle/advantage-shuffle.cpp | zhengyhn/leetcode | 2e5e618dd7c964c8e983b187c6b1762cbe1764de | [
"MIT"
] | null | null | null | out/production/leetcode/io/github/zhengyhn/leetcode/advantage_shuffle/advantage-shuffle.cpp | zhengyhn/leetcode | 2e5e618dd7c964c8e983b187c6b1762cbe1764de | [
"MIT"
] | null | null | null | out/production/leetcode/io/github/zhengyhn/leetcode/advantage_shuffle/advantage-shuffle.cpp | zhengyhn/leetcode | 2e5e618dd7c964c8e983b187c6b1762cbe1764de | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <vector>
#include <algorithm>
#include <random>
#include <chrono>
using namespace std;
class Solution {
public:
vector<int> advantageCount(vector<int>& A, vector<int>& B) {
srand(time(NULL));
float temperature = 100000... | 29.865672 | 172 | 0.549225 | [
"vector"
] |
cfdd33cff0e659056c34246a879e311aa9c25ffa | 10,530 | cpp | C++ | source/src/microapp/cs_MicroappStorage.cpp | Mergon/bluenet | d6eadc3a3e0c8abc112df70780669a5739fe11bd | [
"Apache-2.0",
"MIT"
] | null | null | null | source/src/microapp/cs_MicroappStorage.cpp | Mergon/bluenet | d6eadc3a3e0c8abc112df70780669a5739fe11bd | [
"Apache-2.0",
"MIT"
] | null | null | null | source/src/microapp/cs_MicroappStorage.cpp | Mergon/bluenet | d6eadc3a3e0c8abc112df70780669a5739fe11bd | [
"Apache-2.0",
"MIT"
] | null | null | null | /*
* Store "micro" apps in flash.
*
* Author: Crownstone Team
* Copyright: Crownstone (https://crownstone.rocks)
* Date: April 4, 2020
* License: LGPLv3+, Apache License 2.0, and/or MIT (triple-licensed)
*/
#include "nrf_fstorage_sd.h"
#include <algorithm>
#include <ble/cs_UUID.h>
#include <cfg/cs_AutoConfig.... | 33.75 | 118 | 0.751092 | [
"object"
] |
cfe92144f5fcdbdd5756d433c328f22f8d2275dd | 1,798 | cpp | C++ | src/tools.cpp | ChenKuanSun/CarND-Extended-Kalman-Filter | 33363a355823c285588a2385f133ddbeeb6df49d | [
"MIT"
] | null | null | null | src/tools.cpp | ChenKuanSun/CarND-Extended-Kalman-Filter | 33363a355823c285588a2385f133ddbeeb6df49d | [
"MIT"
] | null | null | null | src/tools.cpp | ChenKuanSun/CarND-Extended-Kalman-Filter | 33363a355823c285588a2385f133ddbeeb6df49d | [
"MIT"
] | null | null | null | #include <iostream>
#include "tools.h"
using Eigen::VectorXd;
using Eigen::MatrixXd;
using std::vector;
//initialize paramater
Tools::Tools() {}
Tools::~Tools() {}
VectorXd Tools::CalculateRMSE(const vector<VectorXd> &estimations,
const vector<VectorXd> &ground_truth) {
/**
TODO:
... | 22.475 | 94 | 0.5901 | [
"vector"
] |
cff6c6b539ce97723b22717ec5d4a86d5d8718a4 | 21,795 | cc | C++ | src/MapsMesh.cc | 45degree/MAPS | aa2aacdda97ab67cc3e80aca3251000eed49d1e3 | [
"MIT"
] | null | null | null | src/MapsMesh.cc | 45degree/MAPS | aa2aacdda97ab67cc3e80aca3251000eed49d1e3 | [
"MIT"
] | null | null | null | src/MapsMesh.cc | 45degree/MAPS | aa2aacdda97ab67cc3e80aca3251000eed49d1e3 | [
"MIT"
] | null | null | null | #include "MapsMesh.h"
#include <igl/gaussian_curvature.h>
#include <poly2tri.h>
#include <tbb/tbb.h>
#include <Eigen/Dense>
#include <algorithm>
#include <limits>
#include <progressbar/progressbar.hpp>
namespace Maps {
template <class Mesh>
static void OpenMesh2IGL(const Mesh *mesh, Eigen::MatrixX3d &V, Eigen::Matr... | 36.204319 | 100 | 0.560633 | [
"mesh",
"vector"
] |
cffbe54c78e5c439b26405a670651ecdadade0f1 | 1,624 | cpp | C++ | 51.cpp | pengzhezhe/LeetCode | 305ec0c5b4cb5ea7cd244b3308132dee778138bc | [
"Apache-2.0"
] | null | null | null | 51.cpp | pengzhezhe/LeetCode | 305ec0c5b4cb5ea7cd244b3308132dee778138bc | [
"Apache-2.0"
] | null | null | null | 51.cpp | pengzhezhe/LeetCode | 305ec0c5b4cb5ea7cd244b3308132dee778138bc | [
"Apache-2.0"
] | null | null | null | //
// Created by pzz on 2021/12/10.
//
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
class Solution {
private:
vector<vector<string>> result;
vector<string> chessBoard;
void backtracing(int n, int row) {
if (row == n) {
result.push_... | 22.246575 | 72 | 0.439655 | [
"vector"
] |
321501cb1fc9cd77f3d82ded5ec528787e89f7a6 | 9,426 | cpp | C++ | src/obj_to_ps2icon.cpp | bignaux/ps2iconsys | ec5cdc56d53bcfc7d79277f76c0ed2233da9ff9d | [
"MIT"
] | 10 | 2019-11-29T00:31:18.000Z | 2022-01-29T22:02:34.000Z | src/obj_to_ps2icon.cpp | bignaux/ps2iconsys | ec5cdc56d53bcfc7d79277f76c0ed2233da9ff9d | [
"MIT"
] | 2 | 2021-04-16T23:57:59.000Z | 2021-08-18T21:27:40.000Z | src/obj_to_ps2icon.cpp | bignaux/ps2iconsys | ec5cdc56d53bcfc7d79277f76c0ed2233da9ff9d | [
"MIT"
] | 4 | 2021-04-11T12:42:03.000Z | 2022-02-13T13:22:43.000Z | /**
* @file src/obj_to_ps2icon.cpp
*
* @brief A tool for converting Wavefront OBJ to PS2 Iconsbuild_header/
*/
#include <iostream>
#include "../include/ps2_ps2icon.hpp"
#include "../include/obj_loader.hpp"
#include "../gbLib/include/gbException.hpp"
#include "../gbLib/include/gbImageLoader.hpp"
char const* obj_inp... | 36.393822 | 111 | 0.549226 | [
"mesh",
"geometry"
] |
321f4378b41a154118d0fd434c666388e11853a3 | 3,098 | cpp | C++ | RaytracerOpencl/host.cpp | sriravic/Raytracer | 7afb24d6a759362902b1c6f8c6ee29d43c179388 | [
"MIT"
] | 1 | 2018-05-16T20:47:21.000Z | 2018-05-16T20:47:21.000Z | RaytracerOpencl/host.cpp | sriravic/Raytracer | 7afb24d6a759362902b1c6f8c6ee29d43c179388 | [
"MIT"
] | null | null | null | RaytracerOpencl/host.cpp | sriravic/Raytracer | 7afb24d6a759362902b1c6f8c6ee29d43c179388 | [
"MIT"
] | null | null | null | #include <iostream>
#include <CL/cl.hpp>
#include <vector>
#include <fstream>
#include <iterator>
#include <string>
#include <memory>
int main(int argc, char** argv) {
std::cout << "OpenCL Raytracer" << std::endl;
std::cout << "Srinath Ravichandran" << std::endl;
// Step1 : initialize and get all availabl... | 34.043956 | 111 | 0.603938 | [
"vector"
] |
3221c3674a987cb451849ebc72b41149a3f097d4 | 931 | cpp | C++ | Dataset/Leetcode/train/56/79.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/56/79.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/56/79.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<vector<int>> XXX(vector<vector<int>>& intervals) {
if(intervals.size()==1){
return intervals;
}
std::sort(intervals.begin(), intervals.end(),
[](const std::vector<int>& a, const std::vector<int>& b) {
return a[0] < b[0];
... | 26.6 | 70 | 0.46724 | [
"vector"
] |
32263d02108d8321294ddb643bf27d738509922d | 914 | cpp | C++ | src/IceRay/main/interface/python/core/geometry/rtss/list.cpp | dmilos/IceRay | 4e01f141363c0d126d3c700c1f5f892967e3d520 | [
"MIT-0"
] | 2 | 2020-09-04T12:27:15.000Z | 2022-01-17T14:49:40.000Z | src/IceRay/main/interface/python/core/geometry/rtss/list.cpp | dmilos/IceRay | 4e01f141363c0d126d3c700c1f5f892967e3d520 | [
"MIT-0"
] | null | null | null | src/IceRay/main/interface/python/core/geometry/rtss/list.cpp | dmilos/IceRay | 4e01f141363c0d126d3c700c1f5f892967e3d520 | [
"MIT-0"
] | 1 | 2020-09-04T12:27:52.000Z | 2020-09-04T12:27:52.000Z |
#include "../../../def_submodule.hpp"
#include "../../../../../../geometry/rtss/list.hpp"
typedef GS_DDMRM::S_IceRay::S_type::GT_size GTs_size;
typedef GS_DDMRM::S_IceRay::S_type::GT_scalar GTs_scalar;
typedef GS_DDMRM::S_IceRay::S_type::S_coord::GT_scalar3D GTs_coord3D;
type... | 30.466667 | 91 | 0.669584 | [
"geometry"
] |
7a8c933e970a292fffabb3e9b00d4df3e3cc3f96 | 1,412 | cpp | C++ | CCF-CSP/201812-2.cpp | windcry1/My-ACM-ICPC | b85b1c83b72c6b51731dae946a0df57c31d3e7a1 | [
"MIT"
] | null | null | null | CCF-CSP/201812-2.cpp | windcry1/My-ACM-ICPC | b85b1c83b72c6b51731dae946a0df57c31d3e7a1 | [
"MIT"
] | null | null | null | CCF-CSP/201812-2.cpp | windcry1/My-ACM-ICPC | b85b1c83b72c6b51731dae946a0df57c31d3e7a1 | [
"MIT"
] | null | null | null | //Author:LanceYu
#include<iostream>
#include<string>
#include<cstring>
#include<cstdio>
#include<fstream>
#include<iosfwd>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<ctime>
#include<algorithm>
#include<complex>
#include<cmath>
#include<array>
#include<valarray>
#include<bitset>
#define ll... | 20.463768 | 61 | 0.497167 | [
"vector"
] |
7a8dd4776eccd1f00a2674499acad1379a233070 | 1,613 | cpp | C++ | E6-I/standard.cpp | Matrix53/algo | 7a176dac9ed9c6ad65d1514afb6388f7ee6b912a | [
"MIT"
] | 1 | 2021-12-14T08:54:11.000Z | 2021-12-14T08:54:11.000Z | E6-I/standard.cpp | Matrix53/algo | 7a176dac9ed9c6ad65d1514afb6388f7ee6b912a | [
"MIT"
] | null | null | null | E6-I/standard.cpp | Matrix53/algo | 7a176dac9ed9c6ad65d1514afb6388f7ee6b912a | [
"MIT"
] | 1 | 2021-12-13T09:31:40.000Z | 2021-12-13T09:31:40.000Z | // Author: Matrix53
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-6;
int sgn(double x) {
if (fabs(x) < eps) return 0;
return x > 0 ? 1 : -1;
}
struct Point {
double x, y;
Point() : x(0), y(0) {}
Point(double a, double b) : x(a), y(b) {}
Point operator-(... | 24.815385 | 65 | 0.535028 | [
"vector"
] |
7a8ea1e5565a1de80eddd24e7008a6c05bc03b12 | 736 | hpp | C++ | include/loquat/graph/breadth_first_search.hpp | logicmachine/loquat | 162d22fb0098de37990bd469d7fbba8f990713aa | [
"MIT"
] | 1 | 2019-07-15T10:19:12.000Z | 2019-07-15T10:19:12.000Z | include/loquat/graph/breadth_first_search.hpp | logicmachine/loquat | 162d22fb0098de37990bd469d7fbba8f990713aa | [
"MIT"
] | null | null | null | include/loquat/graph/breadth_first_search.hpp | logicmachine/loquat | 162d22fb0098de37990bd469d7fbba8f990713aa | [
"MIT"
] | null | null | null | #pragma once
#include <vector>
#include <queue>
#include "loquat/graph/adjacency_list.hpp"
namespace loquat {
template <typename EdgeType, typename F>
void breadth_first_search(
const adjacency_list<EdgeType>& g,
vertex_t root,
std::vector<bool>& vis,
F func)
{
std::queue<vertex_t> q;
q.push(root);
vis[root] =... | 17.52381 | 42 | 0.663043 | [
"vector"
] |
7a93003b201602b58e9f9b54110f0b250f0f2d44 | 1,670 | cc | C++ | asylo/crypto/sha256_hash.cc | kevin405/mosl_vsgx_migration | 76ddd438c8caad1051ea9a7e2040bf6ccee996a2 | [
"Apache-2.0"
] | 1 | 2019-01-13T21:39:32.000Z | 2019-01-13T21:39:32.000Z | asylo/crypto/sha256_hash.cc | kevin405/mosl_vsgx_migration | 76ddd438c8caad1051ea9a7e2040bf6ccee996a2 | [
"Apache-2.0"
] | null | null | null | asylo/crypto/sha256_hash.cc | kevin405/mosl_vsgx_migration | 76ddd438c8caad1051ea9a7e2040bf6ccee996a2 | [
"Apache-2.0"
] | 1 | 2019-01-02T22:04:21.000Z | 2019-01-02T22:04:21.000Z | /*
*
* Copyright 2017 Asylo authors
*
* 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 agree... | 30.363636 | 78 | 0.738323 | [
"vector"
] |
7a952c0122034c1038c87952dd8cb34e276315a3 | 2,538 | cpp | C++ | Contrib-Intel/RSD-PSME-RMM/application/src/rest/endpoints/account_service/account_service.cpp | opencomputeproject/Rack-Manager | e1a61d3eeeba0ff655fe9c1301e8b510d9b2122a | [
"MIT"
] | 5 | 2019-11-11T07:57:26.000Z | 2022-03-28T08:26:53.000Z | Contrib-Intel/RSD-PSME-RMM/application/src/rest/endpoints/account_service/account_service.cpp | opencomputeproject/Rack-Manager | e1a61d3eeeba0ff655fe9c1301e8b510d9b2122a | [
"MIT"
] | 3 | 2019-09-05T21:47:07.000Z | 2019-09-17T18:10:45.000Z | Contrib-Intel/RSD-PSME-RMM/application/src/rest/endpoints/account_service/account_service.cpp | opencomputeproject/Rack-Manager | e1a61d3eeeba0ff655fe9c1301e8b510d9b2122a | [
"MIT"
] | 11 | 2019-07-20T00:16:32.000Z | 2022-01-11T14:17:48.000Z | /*!
* @copyright
* Copyright (c) 2018-2019 Intel Corporation
*
* @copyright
* 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
*
* @copyright
* http://www.apache.org/licenses/LICENSE-... | 30.214286 | 90 | 0.715524 | [
"object",
"model"
] |
7a9696ddf62e5d38bcc89984dbc694fe337698c9 | 632 | cpp | C++ | codeforces/3/3A_ShortestPathOfTheKing.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 3 | 2015-05-25T06:24:37.000Z | 2016-09-10T07:58:00.000Z | codeforces/3/3A_ShortestPathOfTheKing.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | null | null | null | codeforces/3/3A_ShortestPathOfTheKing.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 5 | 2015-05-25T06:24:40.000Z | 2021-08-19T19:22:29.000Z | #include <cassert>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <cstring>
#include <queue>
#include <utility>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
cout << max(abs(s[0]-t[0]), abs(s[1]-t[... | 21.793103 | 56 | 0.46519 | [
"vector"
] |
7a9d18819e3eb772896a23a74a9d176547c49fac | 46,522 | cc | C++ | src/Graph/graph.cc | hgl71964/PET | 4cedb25c5dce0c49eebb693125235fc4ad1e26f8 | [
"Apache-2.0"
] | null | null | null | src/Graph/graph.cc | hgl71964/PET | 4cedb25c5dce0c49eebb693125235fc4ad1e26f8 | [
"Apache-2.0"
] | null | null | null | src/Graph/graph.cc | hgl71964/PET | 4cedb25c5dce0c49eebb693125235fc4ad1e26f8 | [
"Apache-2.0"
] | null | null | null | #include "graph.h"
#include "common.h"
#include "ffi.h"
#include "operator.h"
#include "tensor.h"
#include <string>
#include <unordered_map>
#include <unordered_set>
namespace tpm {
PYBIND11_EMBEDDED_MODULE(cpp_module, m) {
py::class_<Tensor>(m, "Tensor");
py::class_<Operator>(m, "Operator");
py::class_<P... | 33.565657 | 80 | 0.540497 | [
"vector",
"model"
] |
7aa1180f4a6533b260d92f495ac184811ff69c73 | 9,150 | hpp | C++ | ccore/include/pyclustering/cluster/kmeans_plus_plus.hpp | JosephChataignon/pyclustering | bf4f51a472622292627ec8c294eb205585e50f52 | [
"BSD-3-Clause"
] | 1,013 | 2015-01-26T19:50:14.000Z | 2022-03-31T07:38:48.000Z | ccore/include/pyclustering/cluster/kmeans_plus_plus.hpp | peterlau0626/pyclustering | bf4f51a472622292627ec8c294eb205585e50f52 | [
"BSD-3-Clause"
] | 542 | 2015-01-20T16:44:32.000Z | 2022-01-29T14:57:20.000Z | ccore/include/pyclustering/cluster/kmeans_plus_plus.hpp | peterlau0626/pyclustering | bf4f51a472622292627ec8c294eb205585e50f52 | [
"BSD-3-Clause"
] | 262 | 2015-03-19T07:28:12.000Z | 2022-03-30T07:28:24.000Z | /*!
@authors Andrei Novikov (pyclustering@yandex.ru)
@date 2014-2020
@copyright BSD-3-Clause
*/
#pragma once
#include <random>
#include <unordered_set>
#include <pyclustering/definitions.hpp>
#include <pyclustering/cluster/center_initializer.hpp>
#include <pyclustering/cluster/cluster_data.hpp>
#include <pyclus... | 31.6609 | 175 | 0.66929 | [
"vector"
] |
7aa54af63983238ffbcf8c1a984ffa60b7f6ed06 | 4,450 | cpp | C++ | GAME/gamemap/skybox.cpp | leogenot/IMACRUN | 9767a6f23d03d8ef61d3aa2bd7c5a8873f3d21b4 | [
"MIT"
] | null | null | null | GAME/gamemap/skybox.cpp | leogenot/IMACRUN | 9767a6f23d03d8ef61d3aa2bd7c5a8873f3d21b4 | [
"MIT"
] | null | null | null | GAME/gamemap/skybox.cpp | leogenot/IMACRUN | 9767a6f23d03d8ef61d3aa2bd7c5a8873f3d21b4 | [
"MIT"
] | 1 | 2021-11-10T13:52:22.000Z | 2021-11-10T13:52:22.000Z | #include "GAME_H/gamemap/skybox.hpp"
void Skybox::initSkybox()
{
Shader skyboxShader("GAME/shaders/skybox.vs", "GAME/shaders/skybox.fs");
m_skyboxShader = skyboxShader;
float skyboxVertices[] = {
// positions
-1.0f, 1.0f, -1.0f,
-1.0f, -1.0f, -1.0f,
1.0f, -1.0f, -1.0f,
... | 32.014388 | 122 | 0.586517 | [
"vector",
"model"
] |
7aac54004945854b1ceed8d4a4f1fefcddf6996b | 2,198 | cpp | C++ | src/backtest.cpp | nKastelan/Ed | ffa8e2800ba1f9e1001230710820742897acb7a9 | [
"MIT"
] | 2 | 2021-10-09T12:56:02.000Z | 2022-01-04T05:33:46.000Z | src/backtest.cpp | nKastelan/Ed | ffa8e2800ba1f9e1001230710820742897acb7a9 | [
"MIT"
] | null | null | null | src/backtest.cpp | nKastelan/Ed | ffa8e2800ba1f9e1001230710820742897acb7a9 | [
"MIT"
] | null | null | null | #include "backtest.hpp"
Backtest::Backtest(std::vector<std::string>* symbols, std::string* csvDirectory, double* initialCapital) : exchange(&eventQueue, &dataHandler) {
this->symbols = *symbols;
this->csvDirectory = *csvDirectory;
this->initialCapital = initialCapital;
this->continueBacktest = false;
this->dataH... | 26.804878 | 144 | 0.643767 | [
"vector"
] |
7ab31f6d0b9379402bb5366b1e3d4771d4be1e99 | 738 | cpp | C++ | NOIP/oj.noi.cn/1101_submatrix_sum.cpp | webturing/CPlusPlus | 6b9c671b0c9a7c0d24d937610bf54e9aec9a5a1f | [
"AFL-2.0"
] | 14 | 2018-06-21T14:41:26.000Z | 2021-12-19T14:43:51.000Z | NOIP/oj.noi.cn/1101_submatrix_sum.cpp | webturing/CPlusPlus | 6b9c671b0c9a7c0d24d937610bf54e9aec9a5a1f | [
"AFL-2.0"
] | null | null | null | NOIP/oj.noi.cn/1101_submatrix_sum.cpp | webturing/CPlusPlus | 6b9c671b0c9a7c0d24d937610bf54e9aec9a5a1f | [
"AFL-2.0"
] | 2 | 2020-04-20T11:16:53.000Z | 2021-01-02T15:58:35.000Z | //
// Created by jal on 18-6-29.
//
#include <bits/stdc++.h>
using namespace std;
int main(){
ifstream cin("input.txt");
int n,m;
cin >> n >> m;
vector<vector<int>>v(n+1, vector<int>(m+1, 0));
for(int i = 1; i <= n; i ++ ){
for(int j = 1; j <= m; j++){
cin >> v[i][j];
}
... | 24.6 | 86 | 0.410569 | [
"vector"
] |
7abbb274faabf33c64307fdbdf64adc62c58aca1 | 3,889 | cc | C++ | bin/preinit-lazylm-get-statetable.cc | chenzhehuai/kaldi-decoders | b6f6e1e72f09a44efe5ee943d65ebf32c994aa47 | [
"MIT"
] | 17 | 2018-01-21T23:58:43.000Z | 2019-08-15T11:47:19.000Z | bin/preinit-lazylm-get-statetable.cc | chenzhehuai/kaldi-decoders | b6f6e1e72f09a44efe5ee943d65ebf32c994aa47 | [
"MIT"
] | null | null | null | bin/preinit-lazylm-get-statetable.cc | chenzhehuai/kaldi-decoders | b6f6e1e72f09a44efe5ee943d65ebf32c994aa47 | [
"MIT"
] | 5 | 2018-04-28T13:29:49.000Z | 2020-02-11T03:16:03.000Z | // bin/preinit-lazylm-get-statetable.cc
//
// Copyright 2018 Zhehuai Chen
//
// 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
//... | 35.678899 | 90 | 0.686552 | [
"model"
] |
7ac1204b11d6a7f1a93d70895514b4e607ad5e64 | 735 | cpp | C++ | C++/0939-Minimum-Area-Rectangle/soln-1.cpp | wyaadarsh/LeetCode-Solutions | 3719f5cb059eefd66b83eb8ae990652f4b7fd124 | [
"MIT"
] | 5 | 2020-07-24T17:48:59.000Z | 2020-12-21T05:56:00.000Z | C++/0939-Minimum-Area-Rectangle/soln-1.cpp | zhangyaqi1989/LeetCode-Solutions | 2655a1ffc8678ad1de6c24295071308a18c5dc6e | [
"MIT"
] | null | null | null | C++/0939-Minimum-Area-Rectangle/soln-1.cpp | zhangyaqi1989/LeetCode-Solutions | 2655a1ffc8678ad1de6c24295071308a18c5dc6e | [
"MIT"
] | 2 | 2020-07-24T17:49:01.000Z | 2020-08-31T19:57:35.000Z | class Solution {
public:
int minAreaRect(vector<vector<int>>& points) {
unordered_map<int, unordered_set<int>> x_to_ys;
for(vector<int> & point : points) x_to_ys[point[0]].insert(point[1]);
int min_area = INT_MAX;
for(vector<int> & p1 : points) {
for(vector<int> & p2 : po... | 38.684211 | 109 | 0.488435 | [
"vector"
] |
7ac2fd5370f680c18ef5c1910e5db987ad451802 | 4,997 | cc | C++ | test/parse_html.cc | RobertWeber1/web_ui_helper | 88ebe6fd5b8bd5b23301400c0dfc4056a576358c | [
"MIT"
] | null | null | null | test/parse_html.cc | RobertWeber1/web_ui_helper | 88ebe6fd5b8bd5b23301400c0dfc4056a576358c | [
"MIT"
] | null | null | null | test/parse_html.cc | RobertWeber1/web_ui_helper | 88ebe6fd5b8bd5b23301400c0dfc4056a576358c | [
"MIT"
] | null | null | null | #include <catch2/catch.hpp>
#include <web_ui/compressor.h>
#include <iostream>
TEST_CASE("get file content")
{
REQUIRE(
web_ui::Compressor::get_file_content(TEST_DATA_PATH "index.html")
==
R"XML(<!DOCTYPE HTML>
<html>
<head>
<meta charset="UTF-8"/>
<title>Foo</title>
<link rel="stylesheet" type="text/css" ... | 50.474747 | 1,886 | 0.728037 | [
"transform"
] |
7ac54ddd370ddf9f0a1e1b17a2f5aac71db746d8 | 43,647 | cc | C++ | squid/squid3-3.3.8.spaceify/src/snmp_core.cc | spaceify/spaceify | 4296d6c93cad32bb735cefc9b8157570f18ffee4 | [
"MIT"
] | 4 | 2015-01-20T15:25:34.000Z | 2017-12-20T06:47:42.000Z | squid/squid3-3.3.8.spaceify/src/snmp_core.cc | spaceify/spaceify | 4296d6c93cad32bb735cefc9b8157570f18ffee4 | [
"MIT"
] | 4 | 2015-05-15T09:32:55.000Z | 2016-02-18T13:43:31.000Z | squid/squid3-3.3.8.spaceify/src/snmp_core.cc | spaceify/spaceify | 4296d6c93cad32bb735cefc9b8157570f18ffee4 | [
"MIT"
] | null | null | null | /*
* DEBUG: section 49 SNMP support
* AUTHOR: Glenn Chisholm
*
* SQUID Web Proxy Cache http://www.squid-cache.org/
* ----------------------------------------------------------
*
* Squid is the result of efforts by numerous individuals from
* the Internet community; see the CONTRIBUTORS file for fu... | 36.342215 | 157 | 0.624258 | [
"object"
] |
7ac864a0e59eb5fb7f48451bd9263a2c2b1ff8fa | 7,823 | cpp | C++ | Project/check.cpp | jsmjsm/jlu_cpp_2019_design | b2b68da39616c366e621e5cfe640b9f13a8a979c | [
"MIT"
] | null | null | null | Project/check.cpp | jsmjsm/jlu_cpp_2019_design | b2b68da39616c366e621e5cfe640b9f13a8a979c | [
"MIT"
] | null | null | null | Project/check.cpp | jsmjsm/jlu_cpp_2019_design | b2b68da39616c366e621e5cfe640b9f13a8a979c | [
"MIT"
] | null | null | null | //
// Created by Levy Pan on 2019-09-24.
//
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <SQLiteCpp/SQLiteCpp.h>
#include <vector>
#include "listedit.h"
#include "dataPZY.h"
int checkid(std::string _app, int _id){
std::string app = "";
if (_app == "qq"){app = "QQinfo";};
if (_app == ... | 29.858779 | 134 | 0.577656 | [
"vector"
] |
7ac911205fecf75775f1e4860b50d75f0caabe58 | 6,044 | cpp | C++ | rdPhysicS/rdPhysicS/src/rdps-CL/Application/ApplicationCL.cpp | rt-framework/rdPhysicalS | 0c4cd477169f2a573b1130f5d2867c04ce139368 | [
"MIT"
] | null | null | null | rdPhysicS/rdPhysicS/src/rdps-CL/Application/ApplicationCL.cpp | rt-framework/rdPhysicalS | 0c4cd477169f2a573b1130f5d2867c04ce139368 | [
"MIT"
] | null | null | null | rdPhysicS/rdPhysicS/src/rdps-CL/Application/ApplicationCL.cpp | rt-framework/rdPhysicalS | 0c4cd477169f2a573b1130f5d2867c04ce139368 | [
"MIT"
] | null | null | null | #include "ApplicationCL.h"
#include "PlatformComponent.h"
#include "DeviceComponent.h"
#include "ContextComponent.h"
#include "CommandQueueComponent.h"
#include "ProgramComponent.h"
#include "KernelComponent.h"
#include "MemObjectComponent.h"
#include "ItensWorkGroupComponent.h"
USING_RDPS
USING_CL
ApplicationCL::App... | 19.371795 | 116 | 0.702515 | [
"vector"
] |
7acae258ea045dfa61ac78bce57aa2a25dece84c | 1,235 | cpp | C++ | kruskal_mst.cpp | rj011/Hacktoberfest2021-4 | 0aa981d4ba5e71c86cc162d34fe57814050064c2 | [
"MIT"
] | 41 | 2021-10-03T16:03:52.000Z | 2021-11-14T18:15:33.000Z | kruskal_mst.cpp | rj011/Hacktoberfest2021-4 | 0aa981d4ba5e71c86cc162d34fe57814050064c2 | [
"MIT"
] | 175 | 2021-10-03T10:47:31.000Z | 2021-10-20T11:55:32.000Z | kruskal_mst.cpp | rj011/Hacktoberfest2021-4 | 0aa981d4ba5e71c86cc162d34fe57814050064c2 | [
"MIT"
] | 208 | 2021-10-03T11:24:04.000Z | 2021-10-31T17:27:59.000Z | //Kruskal's Algorithm to find Minimum Spanning Tree using DSU
#include "bits/stdc++.h"
using namespace std;
typedef pair<int, pair<int, int> >ii;
vector<int> root;
vector<int> size;
int find(int a){
if(root[a] == a) return a;
return root[a] = find(root[a]);
}
void join(int a, int b){
a = find(a);
b ... | 19.296875 | 61 | 0.496356 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.