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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5dfff44cee6b3c9263934ccb862cfb39a294a14b | 6,917 | cxx | C++ | libs/gamepad/src/gamepad.cxx | tobias-haenel/cgv-density-estimation | 3be1b07a7b21d1cfd956fb19b5f0d83fb51bd308 | [
"BSD-3-Clause"
] | null | null | null | libs/gamepad/src/gamepad.cxx | tobias-haenel/cgv-density-estimation | 3be1b07a7b21d1cfd956fb19b5f0d83fb51bd308 | [
"BSD-3-Clause"
] | null | null | null | libs/gamepad/src/gamepad.cxx | tobias-haenel/cgv-density-estimation | 3be1b07a7b21d1cfd956fb19b5f0d83fb51bd308 | [
"BSD-3-Clause"
] | null | null | null | #include <gamepad/gamepad.h>
#include <gamepad/gamepad_driver.h>
#include <cassert>
namespace gamepad {
std::string convert_key_to_string(unsigned short key)
{
static const char* gamepad_key_names[] = {
"UNKNOWN",
"A",
"B",
"X",
"Y",
"RIGHT_BUMPER",
"LEFT_BUMPER",
"LEFT_TRIGGER",
"RIG... | 23.211409 | 144 | 0.682521 | [
"vector"
] |
b9016fa17ada7e2c00c2c778d258a37df60e6a77 | 2,399 | cpp | C++ | Days 221 - 230/Day 228/LargestNumberFromStringList.cpp | LucidSigma/Daily-Coding-Problems | 21dc8f7e615edd535d7beb1f5d0e41dd3b4bcc1a | [
"MIT"
] | null | null | null | Days 221 - 230/Day 228/LargestNumberFromStringList.cpp | LucidSigma/Daily-Coding-Problems | 21dc8f7e615edd535d7beb1f5d0e41dd3b4bcc1a | [
"MIT"
] | null | null | null | Days 221 - 230/Day 228/LargestNumberFromStringList.cpp | LucidSigma/Daily-Coding-Problems | 21dc8f7e615edd535d7beb1f5d0e41dd3b4bcc1a | [
"MIT"
] | null | null | null | #include <algorithm>
#include <cstddef>
#include <cstdlib>
#include <iostream>
#include <initializer_list>
#include <iterator>
#include <map>
#include <string>
#include <vector>
unsigned int GetLargestNumber(const std::initializer_list<unsigned int>& numbers) noexcept
{
std::map<unsigned int, std::vector<std::string>... | 23.519608 | 139 | 0.6807 | [
"vector"
] |
b901ec934496e6498236c96b1492492976d28c48 | 1,023,941 | cpp | C++ | IL2CPP/Il2CppOutputProject/Source/il2cppOutput/Bulk_Newtonsoft.Json_2.cpp | dngoins/AutographTheWorld-MR | 24e567c8030b73a6942e25b36b7370667c649b90 | [
"MIT"
] | null | null | null | IL2CPP/Il2CppOutputProject/Source/il2cppOutput/Bulk_Newtonsoft.Json_2.cpp | dngoins/AutographTheWorld-MR | 24e567c8030b73a6942e25b36b7370667c649b90 | [
"MIT"
] | null | null | null | IL2CPP/Il2CppOutputProject/Source/il2cppOutput/Bulk_Newtonsoft.Json_2.cpp | dngoins/AutographTheWorld-MR | 24e567c8030b73a6942e25b36b7370667c649b90 | [
"MIT"
] | null | null | null | #include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <cstring>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <limits>
#include <assert.h>
#include <stdint.h>
#include "il2cpp-class-internals.h"
#include "codegen/il2cpp-codegen.h"
#include "il... | 43.209731 | 430 | 0.803785 | [
"object"
] |
b90f9ae0881eb25689b2d6ee5226ba483f3eb390 | 6,796 | hpp | C++ | include/caffe/util/util_others.hpp | fzd9752/caffe | d2dfe624c741ff38e604f4d37c8eecb095c3dd73 | [
"Intel",
"BSD-2-Clause"
] | null | null | null | include/caffe/util/util_others.hpp | fzd9752/caffe | d2dfe624c741ff38e604f4d37c8eecb095c3dd73 | [
"Intel",
"BSD-2-Clause"
] | null | null | null | include/caffe/util/util_others.hpp | fzd9752/caffe | d2dfe624c741ff38e604f4d37c8eecb095c3dd73 | [
"Intel",
"BSD-2-Clause"
] | null | null | null |
#ifndef CAFFE_UTIL_UTIL_OTHERS_HPP_
#define CAFFE_UTIL_UTIL_OTHERS_HPP_
#include <string>
#include <map>
#include <utility>
#include <vector>
#include "caffe/common.hpp"
#include "caffe/proto/caffe.pb.h"
using namespace std;
namespace caffe
{
template <typename Dtype>
struct InfoCam3d
{
InfoCam3d() {
... | 35.957672 | 127 | 0.633608 | [
"vector"
] |
b91227ca346e1d021ae180adfa3eeef489661b3e | 1,358 | cpp | C++ | projectGame/src/scene_death.cpp | Gilleslenaerts007/gba-sprite-engine | 0675291392a950c6edd1eecc13c6528bc6fe2c87 | [
"MIT"
] | null | null | null | projectGame/src/scene_death.cpp | Gilleslenaerts007/gba-sprite-engine | 0675291392a950c6edd1eecc13c6528bc6fe2c87 | [
"MIT"
] | null | null | null | projectGame/src/scene_death.cpp | Gilleslenaerts007/gba-sprite-engine | 0675291392a950c6edd1eecc13c6528bc6fe2c87 | [
"MIT"
] | null | null | null | //
// Created by Gille on 1/26/2021.
//
#include <libgba-sprite-engine/sprites/sprite_builder.h>
#include <libgba-sprite-engine/background/text_stream.h>
#include <libgba-sprite-engine/gba/tonc_memdef.h>
#include <libgba-sprite-engine/gba_engine.h>
#include <libgba-sprite-engine/effects/fade_out_scene.h>
#include "sce... | 30.177778 | 122 | 0.707658 | [
"vector"
] |
b9134d2f71b00a4c1dbdb473304df05382d64322 | 8,958 | hxx | C++ | main/slideshow/source/inc/slide.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/slideshow/source/inc/slide.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/slideshow/source/inc/slide.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 331 | 2015-01-06T11:40:55.000Z | 2022-03-14T04:07:51.000Z | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to y... | 40.90411 | 125 | 0.519536 | [
"render",
"object",
"vector",
"model"
] |
b9152a60415df856c89380c992015c206a1740e2 | 761 | cpp | C++ | clic/src/tier1/cleEqualKernel.cpp | StRigaud/CLIc_prototype | 83fe15b3f8406c4e5a1f415fcba29dc30b12cad3 | [
"BSD-3-Clause"
] | 1 | 2021-01-04T14:34:45.000Z | 2021-01-04T14:34:45.000Z | clic/src/tier1/cleEqualKernel.cpp | StRigaud/CLIc_prototype | 83fe15b3f8406c4e5a1f415fcba29dc30b12cad3 | [
"BSD-3-Clause"
] | null | null | null | clic/src/tier1/cleEqualKernel.cpp | StRigaud/CLIc_prototype | 83fe15b3f8406c4e5a1f415fcba29dc30b12cad3 | [
"BSD-3-Clause"
] | 1 | 2021-01-02T17:27:35.000Z | 2021-01-02T17:27:35.000Z |
#include "cleEqualKernel.hpp"
namespace cle
{
EqualKernel::EqualKernel(std::shared_ptr<GPU> t_gpu) :
Kernel( t_gpu,
"equal",
{"src1", "src2", "dst"}
)
{
this->m_Sources.insert({this->m_KernelName + "_2d", this->m_OclHeader2d});
this->m_Sources.insert({this->m_KernelName + "_... | 18.560976 | 78 | 0.638633 | [
"object"
] |
b917d7674b05070096aa2631249d5ba6195890fd | 3,209 | hpp | C++ | lumino/LuminoEngine/include/LuminoEngine/Scene/Camera.hpp | GameDevery/Lumino | abce2ddca4b7678b04dbfd0ae5348e196c3c9379 | [
"MIT"
] | 113 | 2020-03-05T01:27:59.000Z | 2022-03-28T13:20:51.000Z | lumino/LuminoEngine/include/LuminoEngine/Scene/Camera.hpp | GameDevery/Lumino | abce2ddca4b7678b04dbfd0ae5348e196c3c9379 | [
"MIT"
] | 35 | 2016-04-18T06:14:08.000Z | 2020-02-09T15:51:58.000Z | lumino/LuminoEngine/include/LuminoEngine/Scene/Camera.hpp | GameDevery/Lumino | abce2ddca4b7678b04dbfd0ae5348e196c3c9379 | [
"MIT"
] | 12 | 2020-12-21T12:03:59.000Z | 2021-12-15T02:07:49.000Z |
#pragma once
#include <LuminoEngine/Visual/CameraComponent.hpp>
#include "WorldObject.hpp"
namespace ln {
class WorldRenderView;
class CameraComponent;
/**
* カメラのクラスです。カメラは 3D シーンを描画する際の視点となります。
*/
LN_CLASS()
class Camera
: public WorldObject
{
LN_OBJECT;
public:
/** 既定の設定で Camera を作成します。 */
static Ref<... | 29.990654 | 125 | 0.724836 | [
"3d"
] |
2c710e5a951133fd673bd13bc0044d53c4e03993 | 1,458 | cpp | C++ | examples/contrib/Server/client.cpp | micpub/WebSocket | 6274b62b64e71ecdb8e47f0fcf2ac63f95395923 | [
"MIT"
] | 26 | 2020-04-18T09:27:55.000Z | 2022-03-11T15:36:29.000Z | examples/contrib/Server/client.cpp | micpub/WebSocket | 6274b62b64e71ecdb8e47f0fcf2ac63f95395923 | [
"MIT"
] | 2 | 2020-04-18T09:46:18.000Z | 2021-04-14T15:54:32.000Z | examples/contrib/Server/client.cpp | micpub/WebSocket | 6274b62b64e71ecdb8e47f0fcf2ac63f95395923 | [
"MIT"
] | 4 | 2020-04-18T09:43:11.000Z | 2021-05-27T12:40:57.000Z | #include "client.h"
#include <WebSocket.h>
#include <QDateTime>
#include <QDebug>
#include <QTimer>
#include <memory>
Client::Client(QTcpSocket *sock, QObject *parent)
: QObject(parent)
{
p_wrapper = new WebSocket::Wrapper(sock /* ownership of socket passed to wrapper object */, this);
co... | 28.588235 | 136 | 0.652263 | [
"object"
] |
2c77508d92e48a473372165eb59626c08967d25c | 5,437 | cpp | C++ | codeforces/practice/EDU2_77E.cpp | Shahraaz/CP_S5 | 2cfb5467841d660c1e47cb8338ea692f10ca6e60 | [
"MIT"
] | 3 | 2020-02-08T10:34:16.000Z | 2020-02-09T10:23:19.000Z | codeforces/practice/EDU2_77E.cpp | Shahraaz/CP_S5 | 2cfb5467841d660c1e47cb8338ea692f10ca6e60 | [
"MIT"
] | null | null | null | codeforces/practice/EDU2_77E.cpp | Shahraaz/CP_S5 | 2cfb5467841d660c1e47cb8338ea692f10ca6e60 | [
"MIT"
] | 2 | 2020-10-02T19:05:32.000Z | 2021-09-08T07:01:49.000Z | // Optimise
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// #define MULTI_TEST
#ifdef LOCAL
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
#define pc(...) PC(#__VA_ARGS__, __VA_ARGS__);
template <typename T, type... | 26.393204 | 131 | 0.467905 | [
"vector"
] |
2c77f4c00e371d421a8e73be5690740bbfa9cf6b | 75,434 | cpp | C++ | DaggerTool.cpp | Interkarma/daggerfallcartographer | 8cc55dc66dbd8065ca11a11bb51a0e317862cb62 | [
"MIT"
] | 3 | 2019-06-30T22:32:03.000Z | 2021-11-14T17:46:57.000Z | DaggerTool.cpp | Interkarma/daggerfallcartographer | 8cc55dc66dbd8065ca11a11bb51a0e317862cb62 | [
"MIT"
] | null | null | null | DaggerTool.cpp | Interkarma/daggerfallcartographer | 8cc55dc66dbd8065ca11a11bb51a0e317862cb62 | [
"MIT"
] | null | null | null | /*************************************************************************************************\
*
* Filename: DaggerTool.cpp
* Purpose: Implement all Daggerfall tool classes
* Version: 0.90
* Author: Gavin Clayton
*
* Last Updated: 29/08/2002
*
* Copyright 2002. Gavin Clayton. All Rights Reserved.
*
*
* NOTE:
... | 24.03122 | 153 | 0.652955 | [
"object",
"vector",
"3d",
"solid"
] |
2c7fb9bb609d112da91904e00b2f01fd36544819 | 13,413 | cc | C++ | ge/graph/passes/atomic_addr_clean_pass.cc | tomzhang/graphengine | 49aa7bb17b371caf58a871172fc53afc31b8022c | [
"Apache-2.0"
] | null | null | null | ge/graph/passes/atomic_addr_clean_pass.cc | tomzhang/graphengine | 49aa7bb17b371caf58a871172fc53afc31b8022c | [
"Apache-2.0"
] | null | null | null | ge/graph/passes/atomic_addr_clean_pass.cc | tomzhang/graphengine | 49aa7bb17b371caf58a871172fc53afc31b8022c | [
"Apache-2.0"
] | null | null | null | /**
* Copyright 2019-2020 Huawei Technologies Co., Ltd
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicabl... | 38.765896 | 118 | 0.70126 | [
"vector"
] |
2c86c3fb063c39dac2f49876de1bf51f5ca30c9f | 1,132 | cpp | C++ | LeetCode/0062/0062_2.cpp | samsonwang/ToyCpp | a6a757aacf1a0e6d9ba3c943c5744fde611a2f7c | [
"MIT"
] | null | null | null | LeetCode/0062/0062_2.cpp | samsonwang/ToyCpp | a6a757aacf1a0e6d9ba3c943c5744fde611a2f7c | [
"MIT"
] | null | null | null | LeetCode/0062/0062_2.cpp | samsonwang/ToyCpp | a6a757aacf1a0e6d9ba3c943c5744fde611a2f7c | [
"MIT"
] | null | null | null |
/*
https://leetcode.com/problems/unique-paths/discuss/22954/C%2B%2B-DP
使用dp方法，这篇文章逐步推进，展现了对内存空间使用的优化思路
*/
// 普通dp方法
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> dp(m, vector<int>(n, 1));
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
... | 21.358491 | 69 | 0.441696 | [
"vector"
] |
2c8bacacff120e32bb7c82e5cfc91e3002af2ac2 | 2,595 | cpp | C++ | lib/scipoptsuite-5.0.1/soplex/src/example.cpp | npwebste/UPS_Controller | a90ce2229108197fd48f956310ae2929e0fa5d9a | [
"AFL-1.1"
] | null | null | null | lib/scipoptsuite-5.0.1/soplex/src/example.cpp | npwebste/UPS_Controller | a90ce2229108197fd48f956310ae2929e0fa5d9a | [
"AFL-1.1"
] | null | null | null | lib/scipoptsuite-5.0.1/soplex/src/example.cpp | npwebste/UPS_Controller | a90ce2229108197fd48f956310ae2929e0fa5d9a | [
"AFL-1.1"
] | null | null | null | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* */
/* This file is part of the class library */
/* SoPlex --- the Sequential object-oriented simPlex. */
... | 36.549296 | 113 | 0.470906 | [
"object"
] |
2c8ee0f3609a8a933549a54831e3840f2a4851a5 | 9,119 | hpp | C++ | external/boost_1_47_0/boost/geometry/strategies/cartesian/distance_pythagoras.hpp | zigaosolin/Raytracer | df17f77e814b2e4b90c4a194e18cc81fa84dcb27 | [
"MIT"
] | 47 | 2015-01-01T14:37:36.000Z | 2021-04-25T07:38:07.000Z | external/boost_1_47_0/boost/geometry/strategies/cartesian/distance_pythagoras.hpp | zigaosolin/Raytracer | df17f77e814b2e4b90c4a194e18cc81fa84dcb27 | [
"MIT"
] | 6 | 2016-01-11T05:20:05.000Z | 2021-02-06T11:37:24.000Z | external/boost_1_47_0/boost/geometry/strategies/cartesian/distance_pythagoras.hpp | zigaosolin/Raytracer | df17f77e814b2e4b90c4a194e18cc81fa84dcb27 | [
"MIT"
] | 17 | 2015-01-05T15:10:43.000Z | 2021-06-22T04:59:16.000Z | // Boost.Geometry (aka GGL, Generic Geometry Library)
// Copyright (c) 2008-2011 Bruno Lalande, Paris, France.
// Copyright (c) 2008-2011 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2009-2011 Mateusz Loskot, London, UK.
// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
// (ge... | 26.355491 | 116 | 0.728369 | [
"geometry"
] |
2c909b93b829c3a0eb2501e3ec1785f319ea3cbc | 1,075 | hpp | C++ | stapl_release/stapl/containers/graph/mesh/geom_vector.hpp | parasol-ppl/PPL_utils | 92728bb89692fda1705a0dee436592d97922a6cb | [
"BSD-3-Clause"
] | null | null | null | stapl_release/stapl/containers/graph/mesh/geom_vector.hpp | parasol-ppl/PPL_utils | 92728bb89692fda1705a0dee436592d97922a6cb | [
"BSD-3-Clause"
] | null | null | null | stapl_release/stapl/containers/graph/mesh/geom_vector.hpp | parasol-ppl/PPL_utils | 92728bb89692fda1705a0dee436592d97922a6cb | [
"BSD-3-Clause"
] | null | null | null | /*
// Copyright (c) 2000-2009, Texas Engineering Experiment Station (TEES), a
// component of the Texas A&M University System.
// All rights reserved.
// The information and source code contained herein is the exclusive
// property of TEES and may not be disclosed, examined or reproduced
// in whole or in part withou... | 30.714286 | 74 | 0.674419 | [
"mesh",
"vector"
] |
2c928e73ddbb28055f33255f8db733c8fc31be8b | 130,820 | cpp | C++ | winprom/Domain.cpp | Frontline-Processing/winprom | 621e1422333a9b4e84cd2f507a412e8bb0e68c46 | [
"MIT"
] | 17 | 2015-10-23T13:07:06.000Z | 2021-08-25T07:06:13.000Z | winprom/Domain.cpp | Frontline-Processing/winprom | 621e1422333a9b4e84cd2f507a412e8bb0e68c46 | [
"MIT"
] | null | null | null | winprom/Domain.cpp | Frontline-Processing/winprom | 621e1422333a9b4e84cd2f507a412e8bb0e68c46 | [
"MIT"
] | 3 | 2016-01-27T22:13:40.000Z | 2018-05-09T12:56:02.000Z | // WinProm Copyright 2015 Edward Earl
// All rights reserved.
//
// This software is distributed under a license that is described in
// the LICENSE file that accompanies it.
//
#pragma warning (disable : 4786)
#include "stdafx.h"
#include <algorithm>
#include <map>
#include "domain.h"
//#define trace_connect
#ifndef... | 28.127284 | 99 | 0.663935 | [
"vector",
"transform",
"3d"
] |
2c95c66bf3c534a3830feab287968f3070fda421 | 1,469 | cpp | C++ | modules/search-graph-diameter/src/search-graph-diameter.cpp | gurylev-nikita/devtools-course-practice | bab6ba4e39f04940e27c9ac148505eb152c05d17 | [
"CC-BY-4.0"
] | null | null | null | modules/search-graph-diameter/src/search-graph-diameter.cpp | gurylev-nikita/devtools-course-practice | bab6ba4e39f04940e27c9ac148505eb152c05d17 | [
"CC-BY-4.0"
] | 3 | 2021-04-08T16:19:27.000Z | 2021-04-25T09:29:45.000Z | modules/search-graph-diameter/src/search-graph-diameter.cpp | taktaev-artyom/devtools-course-practice | 7cf19defe061c07cfb3ebb71579456e807430a5d | [
"CC-BY-4.0"
] | null | null | null | // Copyright 2021 Kurnikova Anastasia
#include <limits>
#include <vector>
#include <algorithm>
#include "include/search-graph-diameter.h"
Graph::Graph() : number(10) {
vertex.resize(number);
for (int i = 0; i < number; ++i) {
vertex[i].resize(number);
for (int j = 0; j < number; ++j)
... | 27.716981 | 73 | 0.507148 | [
"vector"
] |
2c96d9e04db7599f499ec7e92519fe33e66d613e | 1,203 | cpp | C++ | leetcode/leetcode021.cpp | KevinYang515/C-Projects | 1bf95a09a0ffc18102f12263c9163619ce6dba55 | [
"MIT"
] | null | null | null | leetcode/leetcode021.cpp | KevinYang515/C-Projects | 1bf95a09a0ffc18102f12263c9163619ce6dba55 | [
"MIT"
] | null | null | null | leetcode/leetcode021.cpp | KevinYang515/C-Projects | 1bf95a09a0ffc18102f12263c9163619ce6dba55 | [
"MIT"
] | null | null | null | #include "ListNode.h"
#include <iostream>
#include <vector>
using namespace std;
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2);
int main(){
vector<ListNode*> l1_v = {new ListNode(1, new ListNode(2, new ListNode(4)))};
vector<ListNode*> l2_v = {new ListNode(1, new ListNode(3, new ListNode(4)))};
fo... | 25.0625 | 81 | 0.523691 | [
"vector"
] |
2c9aa52244deb09e28af2da7043eb6c85db370fa | 10,274 | cpp | C++ | src/mesh.cpp | niess/turtle-perfs | ca7f92c7381cb147132995430bcc57a1ea9464a1 | [
"Unlicense"
] | null | null | null | src/mesh.cpp | niess/turtle-perfs | ca7f92c7381cb147132995430bcc57a1ea9464a1 | [
"Unlicense"
] | null | null | null | src/mesh.cpp | niess/turtle-perfs | ca7f92c7381cb147132995430bcc57a1ea9464a1 | [
"Unlicense"
] | null | null | null | /* Standard library */
#include <iostream>
#include <list>
/* The TURTLE library */
#include "turtle.h"
/* The CGAL library */
#include <CGAL/Simple_cartesian.h>
/* The C interfaces */
extern "C" {
#include "downsampler.h"
#include "geometry.h"
}
typedef CGAL::Simple_cartesian<double> Kernel;
typedef Kernel::FT Scala... | 29.438395 | 78 | 0.508857 | [
"mesh",
"geometry",
"vector",
"model"
] |
2c9b37bac29e930d41adb35b5e72989b1a2d5100 | 11,587 | cpp | C++ | main.cpp | Laakeri/kandi | 026c3c45c7242c08dd21541a6b06188e79cfa90e | [
"MIT"
] | null | null | null | main.cpp | Laakeri/kandi | 026c3c45c7242c08dd21541a6b06188e79cfa90e | [
"MIT"
] | null | null | null | main.cpp | Laakeri/kandi | 026c3c45c7242c08dd21541a6b06188e79cfa90e | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
const int N=20101010;
vector<int> g[N];
int n,m;
int vc_chosen=0;
int rem_n=0;
int rem_m=0;
int ch[N];
void ReadInput(){
string t;
cin>>t;
assert(t=="p");
cin>>t;
assert(t=="td");
cin>>n>>m;
assert(n<N&&m<N);
for (int i=... | 19.840753 | 129 | 0.448175 | [
"vector"
] |
2c9dd9f3217bf3da91740655507513d538d2bde4 | 1,278 | cpp | C++ | secretsmanager/src/base64.cpp | definitelyNotFBI/utt | 1695e3a1f81848e19b042cdc4db9cf1d263c26a9 | [
"Apache-2.0"
] | 340 | 2018-08-27T16:30:45.000Z | 2022-03-28T14:31:44.000Z | secretsmanager/src/base64.cpp | definitelyNotFBI/utt | 1695e3a1f81848e19b042cdc4db9cf1d263c26a9 | [
"Apache-2.0"
] | 706 | 2018-09-02T17:50:32.000Z | 2022-03-31T13:03:15.000Z | secretsmanager/src/base64.cpp | glevkovich/concord-bft | a1b7b57472f5375230428d16c613a760b33233fa | [
"Apache-2.0"
] | 153 | 2018-08-29T05:37:25.000Z | 2022-03-23T14:08:45.000Z | // Concord
//
// Copyright (c) 2020 VMware, Inc. All Rights Reserved.
//
// This product is licensed to you under the Apache 2.0 license (the
// "License"). You may not use this product except in compliance with the
// Apache 2.0 License.
//
// This product may include a number of subcomponents with separate copyright... | 31.95 | 101 | 0.741002 | [
"vector"
] |
2c9f08853714de164c433081c721246b55a5605f | 5,466 | inl | C++ | include/vRt/Parts/Structures.inl | gitter-badger/vRt | a50b67d42a7d8eb0735016337ec7f482a2bde253 | [
"MIT"
] | null | null | null | include/vRt/Parts/Structures.inl | gitter-badger/vRt | a50b67d42a7d8eb0735016337ec7f482a2bde253 | [
"MIT"
] | null | null | null | include/vRt/Parts/Structures.inl | gitter-badger/vRt | a50b67d42a7d8eb0735016337ec7f482a2bde253 | [
"MIT"
] | null | null | null | #pragma once
#include "Headers.inl"
#include "StructuresLow.inl"
#include "StructuresDef.inl"
#include "Enums.inl"
#include "Handlers.inl"
namespace vt { // store in official namespace
// Description structs for make vRt objects
// Note: structures already have default headers for identifying
// in genera... | 38.765957 | 246 | 0.716795 | [
"object"
] |
2cad83bec43dc3c0d65350db5aaf485a4489943e | 2,083 | cpp | C++ | depth first search/130. Surrounded Regions.cpp | Constantine-L01/leetcode | 1f1e3a8226fcec036370e75c1d69e823d1323392 | [
"MIT"
] | 1 | 2021-04-08T10:33:48.000Z | 2021-04-08T10:33:48.000Z | depth first search/130. Surrounded Regions.cpp | Constantine-L01/leetcode | 1f1e3a8226fcec036370e75c1d69e823d1323392 | [
"MIT"
] | null | null | null | depth first search/130. Surrounded Regions.cpp | Constantine-L01/leetcode | 1f1e3a8226fcec036370e75c1d69e823d1323392 | [
"MIT"
] | 1 | 2021-02-23T05:58:58.000Z | 2021-02-23T05:58:58.000Z | Given an m x n matrix board containing 'X' and 'O', capture all regions surrounded by 'X'.
A region is captured by flipping all 'O's into 'X's in that surrounded region.
Example 1:
Input: board = [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
Output: [["X","X","X","X"],["X","X","X","X"],[... | 32.546875 | 331 | 0.402784 | [
"vector"
] |
2cadc96327511af72ad1d52a9368f7163ec31b62 | 99 | cpp | C++ | coding/merge_intervals/starter.cpp | Arijit1000/tech-interview-questions | 885717a9a0625d3a825a1030476c9c7806170a92 | [
"MIT"
] | 14 | 2022-02-08T17:29:29.000Z | 2022-03-27T17:22:14.000Z | coding/merge_intervals/starter.cpp | Arijit1000/tech-interview-questions | 885717a9a0625d3a825a1030476c9c7806170a92 | [
"MIT"
] | 18 | 2022-01-27T17:37:26.000Z | 2022-03-29T15:16:18.000Z | coding/merge_intervals/starter.cpp | Arijit1000/tech-interview-questions | 885717a9a0625d3a825a1030476c9c7806170a92 | [
"MIT"
] | 9 | 2022-02-08T16:03:10.000Z | 2022-03-19T03:26:30.000Z | class Solution {
public:
vector<vector<int>> merge(vector<vector<int>>& intervals) {
}
};
| 14.142857 | 63 | 0.636364 | [
"vector"
] |
2cb260d8c79f59054c9e66b4a92c47a1f629696e | 5,213 | cc | C++ | src/vbucketmap.cc | daverigby/ep-engine | b83769c89eec9cae396737cdbc11510b69514dbb | [
"Apache-2.0"
] | null | null | null | src/vbucketmap.cc | daverigby/ep-engine | b83769c89eec9cae396737cdbc11510b69514dbb | [
"Apache-2.0"
] | null | null | null | src/vbucketmap.cc | daverigby/ep-engine | b83769c89eec9cae396737cdbc11510b69514dbb | [
"Apache-2.0"
] | null | null | null | /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/*
* Copyright 2015 Couchbase, Inc
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* h... | 31.786585 | 86 | 0.621331 | [
"vector"
] |
2cb5911ffe8c61546b05e3357918a96cca36c151 | 8,745 | cpp | C++ | src/option.cpp | stkchp/pxtnplay | 349f2bd4af75f91c5158fab1bce277cbeb025987 | [
"MIT"
] | 27 | 2016-10-23T16:51:37.000Z | 2022-01-25T21:42:59.000Z | src/option.cpp | stkchp/pxtnplay | 349f2bd4af75f91c5158fab1bce277cbeb025987 | [
"MIT"
] | 1 | 2017-03-30T10:15:11.000Z | 2017-04-10T13:57:27.000Z | src/option.cpp | stkchp/pxtnplay | 349f2bd4af75f91c5158fab1bce277cbeb025987 | [
"MIT"
] | 1 | 2017-02-18T06:40:38.000Z | 2017-02-18T06:40:38.000Z | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <limits>
#include <regex>
#include <sstream>
#include <string>
#include <getopt.h>
#include "option.h"
#define GETOPT_LONG_INDEX (0x100)
//
// Utility functions
//
namespace
{
bool parseBool(const std::string &in)
{
if (in == "true" || in == "1"... | 25.12931 | 93 | 0.539508 | [
"vector"
] |
2cb8e154d288d4ba96721efc3599392879fea77c | 12,433 | cpp | C++ | Game/Source/SceneBattle.cpp | Hydeon-git/Project2_RPG | bed3f6ba412b4f533d6b8c9e401182259fcb43e5 | [
"MIT"
] | 4 | 2021-02-23T20:18:27.000Z | 2021-04-17T22:43:01.000Z | Game/Source/SceneBattle.cpp | Hydeon-git/Project2_RPG | bed3f6ba412b4f533d6b8c9e401182259fcb43e5 | [
"MIT"
] | 1 | 2021-02-25T11:10:11.000Z | 2021-02-25T11:10:11.000Z | Game/Source/SceneBattle.cpp | Hydeon-git/Project2_RPG | bed3f6ba412b4f533d6b8c9e401182259fcb43e5 | [
"MIT"
] | null | null | null | #include <string>
#include "SceneBattle.h"
#include "App.h"
#include "Audio.h"
#include "Input.h"
#include "Textures.h"
#include "Render.h"
#include "Window.h"
#include "Scene.h"
#include "Player.h"
#include "Enemy.h"
#include "FlyingEnemy.h"
#include "SceneWin.h"
#include "SceneLose.h"
#include "FadeToBlack.h"
#includ... | 20.825796 | 124 | 0.605566 | [
"render"
] |
2cb8ec386910c52aa052a085ff46b8a729684797 | 1,585 | hpp | C++ | Sources/Graph/edgeless.hpp | vigsterkr/netket | 1e187ae2b9d2aa3f2e53b09fe743e50763d04c9a | [
"Apache-2.0"
] | null | null | null | Sources/Graph/edgeless.hpp | vigsterkr/netket | 1e187ae2b9d2aa3f2e53b09fe743e50763d04c9a | [
"Apache-2.0"
] | null | null | null | Sources/Graph/edgeless.hpp | vigsterkr/netket | 1e187ae2b9d2aa3f2e53b09fe743e50763d04c9a | [
"Apache-2.0"
] | null | null | null | // Copyright 2018-2019 The Simons Foundation, Inc. - All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless ... | 30.480769 | 75 | 0.743849 | [
"vector"
] |
2cbd6506ec79702aac0183b2e097f3a814ddc8d7 | 9,457 | cpp | C++ | DT3Core/Scripting/ScriptingSoundReverb.cpp | 9heart/DT3 | 4ba8fd2af3aebb5c0d77036ac3941e83cd4d1c7e | [
"MIT"
] | 3 | 2016-01-27T13:17:18.000Z | 2019-03-19T09:18:25.000Z | DT3Core/Scripting/ScriptingSoundReverb.cpp | pakoito/DT3 | 4ba8fd2af3aebb5c0d77036ac3941e83cd4d1c7e | [
"MIT"
] | 1 | 2016-01-28T14:39:49.000Z | 2016-01-28T22:12:07.000Z | DT3Core/Scripting/ScriptingSoundReverb.cpp | adderly/DT3 | e2605be091ec903d3582e182313837cbaf790857 | [
"MIT"
] | 3 | 2016-01-25T16:44:51.000Z | 2021-01-29T19:59:45.000Z | //==============================================================================
///
/// File: ScriptingSoundReverb.cpp
///
/// Copyright (C) 2000-2014 by Smells Like Donkey Software Inc. All rights reserved.
///
/// This file is subject to the terms and conditions defined in
/// file 'LICENSE.txt', which is p... | 37.379447 | 103 | 0.518029 | [
"object"
] |
2cc7855019e7985b1dc1143008d9dd68710078cd | 5,905 | cpp | C++ | lyricwidget.cpp | jjzhang166/doubanfm-qt | 199b55d379b6de3b70693c70fa433943dcf413bf | [
"MIT"
] | 425 | 2015-01-03T13:34:16.000Z | 2022-02-09T07:01:49.000Z | lyricwidget.cpp | jjzhang166/doubanfm-qt | 199b55d379b6de3b70693c70fa433943dcf413bf | [
"MIT"
] | 29 | 2015-01-06T15:40:09.000Z | 2018-01-10T01:22:29.000Z | lyricwidget.cpp | jjzhang166/doubanfm-qt | 199b55d379b6de3b70693c70fa433943dcf413bf | [
"MIT"
] | 108 | 2015-01-01T08:02:42.000Z | 2021-02-19T13:36:43.000Z | #include "lyricwidget.h"
#include "libs/doubanplayer.h"
#include <QVBoxLayout>
#include <QDebug>
#include <QPropertyAnimation>
#include <QDebug>
LyricWidget::LyricWidget(QWidget *parent) :
QWidget(parent), ui(new Ui_LyricWidget),
animWidget(nullptr),
firstShowing(false),
lyricGetter(new LyricGetter(th... | 30.91623 | 95 | 0.58696 | [
"geometry"
] |
2ccc198ca56f802f1f777c246f235586976392aa | 9,333 | cc | C++ | google/cloud/spanner/bytes_test.cc | antfitch/google-cloud-cpp-spanner | 05a2e3ad3ee0ac96164013ce4d9cfce251059569 | [
"Apache-2.0"
] | null | null | null | google/cloud/spanner/bytes_test.cc | antfitch/google-cloud-cpp-spanner | 05a2e3ad3ee0ac96164013ce4d9cfce251059569 | [
"Apache-2.0"
] | null | null | null | google/cloud/spanner/bytes_test.cc | antfitch/google-cloud-cpp-spanner | 05a2e3ad3ee0ac96164013ce4d9cfce251059569 | [
"Apache-2.0"
] | null | null | null | // Copyright 2019 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in w... | 35.896154 | 80 | 0.672131 | [
"vector"
] |
2cda7afae0976c158cc08c8ebc27ee204068f63b | 23,560 | hpp | C++ | dockerfiles/gaas_tutorial_2/GAAS/software/SLAM/ygz_slam_ros/Thirdparty/PCL/outofcore/include/pcl/outofcore/impl/octree_disk_container.hpp | hddxds/scripts_from_gi | afb8977c001b860335f9062464e600d9115ea56e | [
"Apache-2.0"
] | 2 | 2019-04-10T14:04:52.000Z | 2019-05-29T03:41:58.000Z | software/SLAM/ygz_slam_ros/Thirdparty/PCL/outofcore/include/pcl/outofcore/impl/octree_disk_container.hpp | glider54321/GAAS | 5c3b8c684e72fdf7f62c5731a260021e741069e7 | [
"BSD-3-Clause"
] | null | null | null | software/SLAM/ygz_slam_ros/Thirdparty/PCL/outofcore/include/pcl/outofcore/impl/octree_disk_container.hpp | glider54321/GAAS | 5c3b8c684e72fdf7f62c5731a260021e741069e7 | [
"BSD-3-Clause"
] | 1 | 2021-12-20T06:54:41.000Z | 2021-12-20T06:54:41.000Z | /*
* Software License Agreement (BSD License)
*
* Point Cloud Library (PCL) - www.pointclouds.org
* Copyright (c) 2010-2012, Willow Garage, Inc.
* Copyright (c) 2012, Urban Robotics, Inc.
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are ... | 33.850575 | 220 | 0.578098 | [
"vector"
] |
2ce90aad0ec543c8a90265e9aeb20345493d6399 | 2,155 | cpp | C++ | src/solvers/BFS.cpp | mdd36/picture_maze_solver | 6f7e8c997960ea5dc1e0e725026d8ff0b0cd9dee | [
"MIT"
] | null | null | null | src/solvers/BFS.cpp | mdd36/picture_maze_solver | 6f7e8c997960ea5dc1e0e725026d8ff0b0cd9dee | [
"MIT"
] | null | null | null | src/solvers/BFS.cpp | mdd36/picture_maze_solver | 6f7e8c997960ea5dc1e0e725026d8ff0b0cd9dee | [
"MIT"
] | null | null | null | //
// Created by Matthew on 8/22/2018.
//
#include <iostream>
#include <queue>
#include "Solver.h"
class BFS : public Solver{
public:
/**
* Solve the maze by running BFS on the graph.
* @param head Starting node
* @param tail Target node
* @param grid Grid to color as the search occurs
*... | 29.520548 | 96 | 0.562877 | [
"vector"
] |
f8e7d0fd01bf5b27eb5bfffa9124a0de428cdeb2 | 5,309 | cpp | C++ | Plugins/NaiveCustomMeshComponent/Source/StaticDataStaticMeshComponent/Private/StaticDataStaticMeshSceneProxy.cpp | cas2void/SkelAnimTestbed | 5a3a866c8d564273747a4523a2bb59b012f6adc9 | [
"MIT"
] | null | null | null | Plugins/NaiveCustomMeshComponent/Source/StaticDataStaticMeshComponent/Private/StaticDataStaticMeshSceneProxy.cpp | cas2void/SkelAnimTestbed | 5a3a866c8d564273747a4523a2bb59b012f6adc9 | [
"MIT"
] | null | null | null | Plugins/NaiveCustomMeshComponent/Source/StaticDataStaticMeshComponent/Private/StaticDataStaticMeshSceneProxy.cpp | cas2void/SkelAnimTestbed | 5a3a866c8d564273747a4523a2bb59b012f6adc9 | [
"MIT"
] | null | null | null | #include "StaticDataStaticMeshSceneProxy.h"
#include "Materials/MaterialInterface.h"
#include "Materials/Material.h"
FStaticDataStaticMeshSceneProxy::FStaticDataStaticMeshSceneProxy(const UStaticDataStaticMeshComponent* Component)
: FPrimitiveSceneProxy(Component)
, VertexFactory(GetScene().GetFeatureLevel(),... | 43.162602 | 198 | 0.718779 | [
"mesh",
"render"
] |
f8eb358e1de834be52b56ca9e4ceb83f364bc5d2 | 6,475 | cxx | C++ | clsim/private/clsim/random_value/I3CLSimRandomValueApplyFunction.cxx | hschwane/offline_production | e14a6493782f613b8bbe64217559765d5213dc1e | [
"MIT"
] | 1 | 2020-12-24T22:00:01.000Z | 2020-12-24T22:00:01.000Z | clsim/private/clsim/random_value/I3CLSimRandomValueApplyFunction.cxx | hschwane/offline_production | e14a6493782f613b8bbe64217559765d5213dc1e | [
"MIT"
] | null | null | null | clsim/private/clsim/random_value/I3CLSimRandomValueApplyFunction.cxx | hschwane/offline_production | e14a6493782f613b8bbe64217559765d5213dc1e | [
"MIT"
] | 3 | 2020-07-17T09:20:29.000Z | 2021-03-30T16:44:18.000Z | /**
* Copyright (c) 2011, 2012
* Claudio Kopper <claudio.kopper@icecube.wisc.edu>
* and the IceCube Collaboration <http://www.icecube.wisc.edu>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice ... | 37.427746 | 126 | 0.709344 | [
"vector"
] |
f8f0f958e05c26e1a009aaa38fdddea1834d269f | 576 | cpp | C++ | cpp/codeforces/unnatural_conditions.cpp | danyfang/SourceCode | 8168f6058648f2a330a7354daf3a73a4d8a4e730 | [
"MIT"
] | null | null | null | cpp/codeforces/unnatural_conditions.cpp | danyfang/SourceCode | 8168f6058648f2a330a7354daf3a73a4d8a4e730 | [
"MIT"
] | null | null | null | cpp/codeforces/unnatural_conditions.cpp | danyfang/SourceCode | 8168f6058648f2a330a7354daf3a73a4d8a4e730 | [
"MIT"
] | null | null | null | //Codeforces Problem No. 1028 B
//Written by Xuqiang Fang on 27 Aug, 2018
/*
Description:
*/
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <map>
#include <unordered_set>
#include <set>
#include <stack>
#include <queue>
using namespace std;
int main(){
int n,m;
cin >... | 16.457143 | 41 | 0.565972 | [
"vector"
] |
f8f3eeacc3abe971abd85afd6e57e9157074f18d | 626 | cpp | C++ | src/main/cpp/binarysearch/one_interval.cpp | jo3-l/cp-practice | d1db0c8e9269c8720b31013068dff948b33f57fd | [
"MIT"
] | 5 | 2022-01-05T20:15:47.000Z | 2022-02-15T22:40:44.000Z | src/main/cpp/binarysearch/one_interval.cpp | jo3-l/ccc-java | 7a77f365e52496967e5265ecefb34f3b7db5fae8 | [
"MIT"
] | 3 | 2022-01-06T01:34:42.000Z | 2022-01-20T23:46:53.000Z | src/main/cpp/binarysearch/one_interval.cpp | jo3-l/ccc-java | 7a77f365e52496967e5265ecefb34f3b7db5fae8 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int solve(vector<vector<int>> &intervals) {
sort(begin(intervals), end(intervals), [](auto &a, auto &b) { return a[0] < b[0]; });
int min_end = INT_MAX, max_start = INT_MIN;
int disjoint_intervals = 0;
int i = 0;
while (i < intervals.size()) {
auto &interval = inte... | 32.947368 | 115 | 0.65655 | [
"vector"
] |
f8f96789732ca7e310095e208e202a9cf4771919 | 4,549 | hpp | C++ | include/UnityEngine/ProBuilder/MeshOperations/VertexEditing.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/UnityEngine/ProBuilder/MeshOperations/VertexEditing.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/UnityEngine/ProBuilder/MeshOperations/VertexEditing.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "extern/beatsaber-hook/shared/utils/typedefs.h"
// Including type: UnityEngine.ProBuilder.SimpleTuple`2
#include "UnityEngine/ProBuilder/... | 60.653333 | 432 | 0.763245 | [
"mesh"
] |
f8fe2082945fa4278b9ffc0bf5bcce95508db8d0 | 984 | hpp | C++ | include/mcfile/je/chunksection/chunk-section-116.hpp | kbinani/libminecraft-file | 7068e877f49f442be7229e996325276ed13dcf47 | [
"MIT"
] | 3 | 2020-02-07T19:58:13.000Z | 2022-02-15T14:00:35.000Z | include/mcfile/je/chunksection/chunk-section-116.hpp | kbinani/libminecraft-file | 7068e877f49f442be7229e996325276ed13dcf47 | [
"MIT"
] | null | null | null | include/mcfile/je/chunksection/chunk-section-116.hpp | kbinani/libminecraft-file | 7068e877f49f442be7229e996325276ed13dcf47 | [
"MIT"
] | null | null | null | #pragma once
namespace mcfile::je::chunksection {
class ChunkSection116 : public ChunkSection113Base<BlockStatesParser116> {
public:
static std::shared_ptr<ChunkSection> MakeEmpty(int sectionY) {
using namespace std;
vector<shared_ptr<Block const>> palette;
vector<uint16_t> paletteIndices;... | 33.931034 | 88 | 0.603659 | [
"vector"
] |
5d05641a5d3690f39fde5aa3815ccbf65c6586bd | 1,356 | cpp | C++ | 0686-Repeated String Match/0686-Repeated String Match.cpp | zhuangli1987/LeetCode-1 | e81788abf9e95e575140f32a58fe983abc97fa4a | [
"MIT"
] | 49 | 2018-05-05T02:53:10.000Z | 2022-03-30T12:08:09.000Z | 0601-0700/0686-Repeated String Match/0686-Repeated String Match.cpp | jolly-fellow/LeetCode | ab20b3ec137ed05fad1edda1c30db04ab355486f | [
"MIT"
] | 11 | 2017-12-15T22:31:44.000Z | 2020-10-02T12:42:49.000Z | 0601-0700/0686-Repeated String Match/0686-Repeated String Match.cpp | jolly-fellow/LeetCode | ab20b3ec137ed05fad1edda1c30db04ab355486f | [
"MIT"
] | 28 | 2017-12-05T10:56:51.000Z | 2022-01-26T18:18:27.000Z | class Solution {
public:
int repeatedStringMatch(string A, string B) {
int n = A.size();
if (n == 0) {
return -1;
}
int m = B.size();
vector<int> lps(m);
int i = 1;
int len = 0;
while (i < m) {
if (B[i] == B[len]) {
... | 21.52381 | 68 | 0.276549 | [
"vector"
] |
5d13fe6060beb99a96a387bee3ff3f3f92418d4a | 172 | cpp | C++ | chapter-9/9.41.cpp | zero4drift/Cpp-Primer-5th-Exercises | d3d0f0d228e8c2c5a3b3fe1fd03ce34e0894e93f | [
"MIT"
] | null | null | null | chapter-9/9.41.cpp | zero4drift/Cpp-Primer-5th-Exercises | d3d0f0d228e8c2c5a3b3fe1fd03ce34e0894e93f | [
"MIT"
] | null | null | null | chapter-9/9.41.cpp | zero4drift/Cpp-Primer-5th-Exercises | d3d0f0d228e8c2c5a3b3fe1fd03ce34e0894e93f | [
"MIT"
] | null | null | null | #include <vector>
#include <string>
using std::vector;
using std::string;
int main()
{
vector<char> vc = {'h', 'e', 'l', 'l', 'o'};
string s(vc.begin(), vc.end());
}
| 14.333333 | 46 | 0.563953 | [
"vector"
] |
5d15107dd1672b0296964f764207212f49b4818d | 4,930 | hpp | C++ | include/memory/hadesmem/process_helpers.hpp | CvX/hadesmem | d2c5164cc753dac37879ac8079f2ae23f2b8edb5 | [
"MIT"
] | 24 | 2018-08-18T18:05:37.000Z | 2021-09-28T00:26:35.000Z | include/memory/hadesmem/process_helpers.hpp | CvX/hadesmem | d2c5164cc753dac37879ac8079f2ae23f2b8edb5 | [
"MIT"
] | null | null | null | include/memory/hadesmem/process_helpers.hpp | CvX/hadesmem | d2c5164cc753dac37879ac8079f2ae23f2b8edb5 | [
"MIT"
] | 9 | 2018-04-16T09:53:09.000Z | 2021-02-26T05:04:49.000Z | // Copyright (C) 2010-2014 Joshua Boyce.
// See the file COPYING for copying permission.
#pragma once
#include <algorithm>
#include <string>
#include <vector>
#include <windows.h>
#include <hadesmem/config.hpp>
#include <hadesmem/detail/to_upper_ordinal.hpp>
#include <hadesmem/detail/winapi.hpp>
#include <hadesmem/... | 31.202532 | 80 | 0.670994 | [
"vector"
] |
5d16d60a4815aad82b93e7efdb3ca8d7cc38c797 | 9,803 | hpp | C++ | src/NumericalAlgorithms/DiscontinuousGalerkin/NumericalFluxes/Hll.hpp | marissawalker/spectre | afc8205e2f697de5e8e4f05e881499e05c9fd8a0 | [
"MIT"
] | null | null | null | src/NumericalAlgorithms/DiscontinuousGalerkin/NumericalFluxes/Hll.hpp | marissawalker/spectre | afc8205e2f697de5e8e4f05e881499e05c9fd8a0 | [
"MIT"
] | null | null | null | src/NumericalAlgorithms/DiscontinuousGalerkin/NumericalFluxes/Hll.hpp | marissawalker/spectre | afc8205e2f697de5e8e4f05e881499e05c9fd8a0 | [
"MIT"
] | null | null | null | // Distributed under the MIT License.
// See LICENSE.txt for details.
#pragma once
#include <algorithm>
#include <cstddef>
#include "DataStructures/DataBox/DataBoxTag.hpp"
#include "DataStructures/DataBox/Prefixes.hpp"
#include "DataStructures/Tensor/Tensor.hpp"
#include "Options/Options.hpp"
#include "Utilities/Gsl... | 44.157658 | 80 | 0.645415 | [
"vector"
] |
5d2579e774b1a8a0549bc4a219a42837e405daae | 3,600 | cpp | C++ | assignments/tp01/primera-entrega.cpp | rnsavinelli/aed | 747f784b28a4891e329d7045f36c59681bcbb5e7 | [
"MIT"
] | null | null | null | assignments/tp01/primera-entrega.cpp | rnsavinelli/aed | 747f784b28a4891e329d7045f36c59681bcbb5e7 | [
"MIT"
] | null | null | null | assignments/tp01/primera-entrega.cpp | rnsavinelli/aed | 747f784b28a4891e329d7045f36c59681bcbb5e7 | [
"MIT"
] | null | null | null | /* primera-entrega.cpp
*
* Copyright (c) 2020 Savinelli Roberto Nicolás <rsavinelli@est.frba.utn.edu.ar>
*
* 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... | 35.294118 | 81 | 0.640556 | [
"vector"
] |
5d25892767f7dcbbd659605283d208c601e2d93a | 1,157 | hpp | C++ | src/CL_MapMode_stub.hpp | fccm/ocaml-clanlib | 1929f1c11d4cc9fc19e7da22826238b4cce7a07d | [
"Zlib",
"OLDAP-2.2.1"
] | 1 | 2020-10-24T14:48:04.000Z | 2020-10-24T14:48:04.000Z | src/CL_MapMode_stub.hpp | fccm/ocaml-clanlib | 1929f1c11d4cc9fc19e7da22826238b4cce7a07d | [
"Zlib",
"OLDAP-2.2.1"
] | null | null | null | src/CL_MapMode_stub.hpp | fccm/ocaml-clanlib | 1929f1c11d4cc9fc19e7da22826238b4cce7a07d | [
"Zlib",
"OLDAP-2.2.1"
] | null | null | null | /* ocaml-clanlib: OCaml bindings to the ClanLib SDK
Copyright (C) 2013 Florent Monnier
This software is provided "AS-IS", without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this soft... | 26.295455 | 71 | 0.73898 | [
"render"
] |
5d25bf6f053a2f44b5c1ae287dd1300626177988 | 10,256 | cpp | C++ | tester/testmain.cpp | vs49688/nimroda | 6a86742affac391ee39c75ed184e7c9f0c028483 | [
"Apache-2.0"
] | null | null | null | tester/testmain.cpp | vs49688/nimroda | 6a86742affac391ee39c75ed184e7c9f0c028483 | [
"Apache-2.0"
] | null | null | null | tester/testmain.cpp | vs49688/nimroda | 6a86742affac391ee39c75ed184e7c9f0c028483 | [
"Apache-2.0"
] | null | null | null | /*
* Nimrod/A Native Optimisation Library for Nimrod/OK
* https://github.com/vs49688/nimroda
*
* SPDX-License-Identifier: Apache-2.0
* Copyright (c) 2019 Zane van Iperen
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You ... | 27.42246 | 121 | 0.627145 | [
"vector"
] |
5d2d3d6566cf6292b307bfadc1d93f3969c5cd2c | 3,922 | cpp | C++ | VC2010Samples/MFC/general/propdlg/propdlg.cpp | alonmm/VCSamples | 6aff0b4902f5027164d593540fcaa6601a0407c3 | [
"MIT"
] | 300 | 2019-05-09T05:32:33.000Z | 2022-03-31T20:23:24.000Z | VC2010Samples/MFC/general/propdlg/propdlg.cpp | JaydenChou/VCSamples | 9e1d4475555b76a17a3568369867f1d7b6cc6126 | [
"MIT"
] | 9 | 2016-09-19T18:44:26.000Z | 2018-10-26T10:20:05.000Z | VC2010Samples/MFC/general/propdlg/propdlg.cpp | JaydenChou/VCSamples | 9e1d4475555b76a17a3568369867f1d7b6cc6126 | [
"MIT"
] | 633 | 2019-05-08T07:34:12.000Z | 2022-03-30T04:38:28.000Z | // propdlg.cpp : Defines the class behaviors for the application.
//
// This is a part of the Microsoft Foundation Classes C++ library.
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// This source code is only intended as a supplement to the
// Microsoft Foundation Classes Reference and related
// el... | 24.980892 | 77 | 0.663437 | [
"object",
"3d"
] |
5d30ba160736c2868aea267ab8249ea2dbb20a75 | 1,581 | cc | C++ | code/render/frame/framealgorithm.cc | gscept/nebula-trifid | e7c0a0acb05eedad9ed37a72c1bdf2d658511b42 | [
"BSD-2-Clause"
] | 67 | 2015-03-30T19:56:16.000Z | 2022-03-11T13:52:17.000Z | code/render/frame/framealgorithm.cc | gscept/nebula-trifid | e7c0a0acb05eedad9ed37a72c1bdf2d658511b42 | [
"BSD-2-Clause"
] | 5 | 2015-04-15T17:17:33.000Z | 2016-02-11T00:40:17.000Z | code/render/frame/framealgorithm.cc | gscept/nebula-trifid | e7c0a0acb05eedad9ed37a72c1bdf2d658511b42 | [
"BSD-2-Clause"
] | 34 | 2015-03-30T15:08:00.000Z | 2021-09-23T05:55:10.000Z | //------------------------------------------------------------------------------
// framealgorithm.cc
// (C) 2013-2016 Individual contributors, see AUTHORS file
//------------------------------------------------------------------------------
#include "stdneb.h"
#include "framealgorithm.h"
#include "algorithm/algorith... | 20.802632 | 80 | 0.368121 | [
"render"
] |
5d363aad774d8bf939e2b9a5b70435f5c00111cb | 5,111 | cpp | C++ | raspberry_pi_build/program/resource_test.cpp | santais/iotivity_1.1.0 | 611d90f537fafd63f8da2e2df90cf197ad0235fe | [
"Apache-2.0"
] | null | null | null | raspberry_pi_build/program/resource_test.cpp | santais/iotivity_1.1.0 | 611d90f537fafd63f8da2e2df90cf197ad0235fe | [
"Apache-2.0"
] | null | null | null | raspberry_pi_build/program/resource_test.cpp | santais/iotivity_1.1.0 | 611d90f537fafd63f8da2e2df90cf197ad0235fe | [
"Apache-2.0"
] | 1 | 2019-07-26T08:18:26.000Z | 2019-07-26T08:18:26.000Z | #include "RPIRCSController.h"
#include "RPIRCSResourceObject.h"
#include "RCSRequest.h"
#include "ConfigurationResource.h"
#include "MaintenanceResource.h"
#include "LightResource.h"
#include "ButtonResource.h"
#include "TVResource.h"
#include "resource_types.h"
#include "OCPlatform.h"
#include "OCApi.h"
#include <... | 30.242604 | 155 | 0.68245 | [
"vector"
] |
5d4304a99450e381aa6c7f05a516288fdc739ea2 | 320 | cpp | C++ | 1101-9999/1557. Minimum Number of Vertices to Reach All Nodes.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | 1101-9999/1557. Minimum Number of Vertices to Reach All Nodes.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | 1101-9999/1557. Minimum Number of Vertices to Reach All Nodes.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | class Solution
{
public:
vector<int> findSmallestSetOfVertices(int n, vector<vector<int>> &edges)
{
vector<int> f(n, 0);
for (auto &edge : edges)
{
f[edge[1]]++;
}
vector<int> ret;
for (int i = 0; i < n; ++i)
{
if (!f[i])
ret.push_back(i);
}
return ret;
}
}; | 16.842105 | 74 | 0.5 | [
"vector"
] |
5d4fd06d2bd1ba54ed8f8437c6a1f8a5ebf5af97 | 2,918 | hpp | C++ | tau/TauEngine/include/renderer/BatchRenderer.hpp | hyfloac/TauEngine | 1559b2a6e6d1887b8ee02932fe0aa6e5b9d5652c | [
"MIT"
] | 1 | 2020-04-22T04:07:01.000Z | 2020-04-22T04:07:01.000Z | tau/TauEngine/include/renderer/BatchRenderer.hpp | hyfloac/TauEngine | 1559b2a6e6d1887b8ee02932fe0aa6e5b9d5652c | [
"MIT"
] | null | null | null | tau/TauEngine/include/renderer/BatchRenderer.hpp | hyfloac/TauEngine | 1559b2a6e6d1887b8ee02932fe0aa6e5b9d5652c | [
"MIT"
] | null | null | null | #pragma once
#include <Objects.hpp>
#include <Safeties.hpp>
#include "DLL.hpp"
#include "Color.hpp"
#include <glm/vec2.hpp>
#include <glm/vec3.hpp>
#include <glm/vec4.hpp>
#include <glm/mat4x4.hpp>
class IGraphicsInterface;
class ICommandList;
class IResource;
class TAU_DLL BatchRenderer final
{
DELETE_CONSTRU... | 55.056604 | 180 | 0.758739 | [
"transform"
] |
5d5171f7969372b9b3ded88f887d4480edfb7781 | 2,663 | cpp | C++ | test/TestData/TestInitializers.cpp | alexweav/BackpropFramework | 2de396628180db1e6535037663497f9814e83039 | [
"MIT"
] | 1 | 2017-10-25T07:04:30.000Z | 2017-10-25T07:04:30.000Z | test/TestData/TestInitializers.cpp | alexweav/BackpropFramework | 2de396628180db1e6535037663497f9814e83039 | [
"MIT"
] | 21 | 2017-08-21T23:16:34.000Z | 2018-06-04T00:53:13.000Z | test/TestData/TestInitializers.cpp | alexweav/BackpropFramework | 2de396628180db1e6535037663497f9814e83039 | [
"MIT"
] | null | null | null | #include "TestData.h"
TEST(InitializerTests, ZeroInitGivesScalarZero) {
DataObject zeroScalar = Initializers::Zeros();
EXPECT_EQ(zeroScalar.Dim(), 0);
EXPECT_EQ(zeroScalar.Shape(), std::vector<int64_t>());
EXPECT_FLOAT_EQ(zeroScalar.ToScalar(), 0.0);
zeroScalar = Initializers::Zeros({});
EXPECT... | 39.161765 | 69 | 0.665039 | [
"shape",
"vector"
] |
5d55b51421891482a4bc90f8e2e4ba2396c5b720 | 4,334 | cpp | C++ | src/control_a/src/velocity_handler.cpp | METUrone/ROSAPI2 | c66e6be32504ee4a88f4e88eca2418d464c5bcf2 | [
"MIT"
] | null | null | null | src/control_a/src/velocity_handler.cpp | METUrone/ROSAPI2 | c66e6be32504ee4a88f4e88eca2418d464c5bcf2 | [
"MIT"
] | null | null | null | src/control_a/src/velocity_handler.cpp | METUrone/ROSAPI2 | c66e6be32504ee4a88f4e88eca2418d464c5bcf2 | [
"MIT"
] | null | null | null | #include "control_a/velocity_handler.hpp"
#include "math.h"
#include "vector"
struct velocity{
double x;
double y;
double z;
};
std::vector<velocity> velocities;
ros::ServiceClient hiz_client;
UAVvel::UAVvel(ros::NodeHandle& _n){
n = _n;
odom_client = n.serviceClient<control_a::odom_srv>("/cont... | 30.307692 | 181 | 0.630595 | [
"vector"
] |
5d5751a7b5a2ef4751f598a85db9d74f1fe0e5cb | 8,287 | hpp | C++ | include/uitsl/distributed/RdmaWindow.hpp | mmore500/pipe-profile | 861babd819909d1bda5e933269e7bc64018272d6 | [
"MIT"
] | 15 | 2020-07-31T23:06:09.000Z | 2022-01-13T18:05:33.000Z | include/uitsl/distributed/RdmaWindow.hpp | mmore500/pipe-profile | 861babd819909d1bda5e933269e7bc64018272d6 | [
"MIT"
] | 137 | 2020-08-13T23:32:17.000Z | 2021-10-16T04:00:40.000Z | include/uitsl/distributed/RdmaWindow.hpp | mmore500/pipe-profile | 861babd819909d1bda5e933269e7bc64018272d6 | [
"MIT"
] | 3 | 2020-08-09T01:52:03.000Z | 2020-10-02T02:13:47.000Z | #pragma once
#ifndef UITSL_DISTRIBUTED_RDMAWINDOW_HPP_INCLUDE
#define UITSL_DISTRIBUTED_RDMAWINDOW_HPP_INCLUDE
#include <stddef.h>
#include <mpi.h>
#include "../../../third-party/Empirical/include/emp/base/optional.hpp"
#include "../../../third-party/Empirical/include/emp/base/vector.hpp"
#include "../mpi/audited_r... | 26.560897 | 86 | 0.656933 | [
"object",
"vector"
] |
5d57d6c308ed48a5bed8e26d52419436efb0fe88 | 5,523 | cpp | C++ | smart_pointers/main.cpp | VgTajdd/cpp_playground | d13c198952782a96cccdd35504abd8c915128e19 | [
"MIT"
] | 2 | 2019-12-18T12:20:12.000Z | 2021-08-02T00:16:17.000Z | smart_pointers/main.cpp | VgTajdd/cpp_playground | d13c198952782a96cccdd35504abd8c915128e19 | [
"MIT"
] | null | null | null | smart_pointers/main.cpp | VgTajdd/cpp_playground | d13c198952782a96cccdd35504abd8c915128e19 | [
"MIT"
] | null | null | null | #include <iostream>
#include <memory>
class Entity
{
public:
Entity( const char* name ) : m_name( name )
{
std::cout << "Created Entity : " << m_name << std::endl;
}
~Entity()
{
std::cout << "Destroyed Entity : " << m_name << std::endl;
}
void doSomething()
{
std::cout << m_name << " doing something...... | 30.513812 | 107 | 0.634438 | [
"object"
] |
5d5835ed285467bc9e2ae1f437aff98a8bc39772 | 45,203 | cpp | C++ | Noise.cpp | sherrbss/ProceduralNoise | 99162d9b00d52b50e33a64313911300406af0745 | [
"MIT"
] | null | null | null | Noise.cpp | sherrbss/ProceduralNoise | 99162d9b00d52b50e33a64313911300406af0745 | [
"MIT"
] | null | null | null | Noise.cpp | sherrbss/ProceduralNoise | 99162d9b00d52b50e33a64313911300406af0745 | [
"MIT"
] | null | null | null | /**
* Noise.cpp
* Authors: Sheldon Taylor, Jiju Poovvancheri
*
* Driver function for noise generation.
*/
#include "Noise.h"
Noise::Noise() {}
Noise::~Noise() {}
/*
* Generates Perlin noise.
*
* Parameters:
* pairingFunction: pairing function to be used
* noiseType: type of noise to be used
* ... | 32.058865 | 140 | 0.557419 | [
"vector"
] |
5d6d593dc8354e93ab4590df691185448be9401f | 9,042 | hpp | C++ | OcularCore/include/Math/Geometry/Frustum.hpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 8 | 2017-01-27T01:06:06.000Z | 2020-11-05T20:23:19.000Z | OcularCore/include/Math/Geometry/Frustum.hpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 39 | 2016-06-03T02:00:36.000Z | 2017-03-19T17:47:39.000Z | OcularCore/include/Math/Geometry/Frustum.hpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 4 | 2019-05-22T09:13:36.000Z | 2020-12-01T03:17:45.000Z | /**
* Copyright 2014-2017 Steven T Sell (ssell@vertexfragment.com)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless requir... | 33 | 137 | 0.487945 | [
"geometry",
"object"
] |
5d6df3997ceb2d081b57a44c9840c512d7fb9d38 | 4,088 | cpp | C++ | src/visvalingam_algorithm.cpp | giraldeau/visvalingam_simplify | e28fc3b760d2037dcdaf0c19af644ecaa2367347 | [
"BSD-2-Clause-FreeBSD"
] | 26 | 2015-03-07T01:17:19.000Z | 2022-01-14T06:17:49.000Z | src/visvalingam_algorithm.cpp | giraldeau/visvalingam_simplify | e28fc3b760d2037dcdaf0c19af644ecaa2367347 | [
"BSD-2-Clause-FreeBSD"
] | null | null | null | src/visvalingam_algorithm.cpp | giraldeau/visvalingam_simplify | e28fc3b760d2037dcdaf0c19af644ecaa2367347 | [
"BSD-2-Clause-FreeBSD"
] | 7 | 2017-04-05T12:43:41.000Z | 2021-05-08T12:51:10.000Z | //
//
// 2013 (c) Mathieu Courtemanche
#include "visvalingam_algorithm.h"
#include <cstdlib>
#include <cmath>
#include <limits>
#include <vector>
#include <iostream>
#include "heap.hpp"
static const double NEARLY_ZERO = 1e-7;
// Represents 3 vertices from the input line and its associated effective area.
struct Vert... | 29.2 | 79 | 0.619374 | [
"vector"
] |
5d78075920a9f54e692135c448d302202810ba84 | 2,597 | cc | C++ | extensions/pyre/timers/wall_timers.cc | PyreFramework/pyre | 345c7449a3416eea1c1affa74fb32faff30a6aaa | [
"BSD-3-Clause"
] | null | null | null | extensions/pyre/timers/wall_timers.cc | PyreFramework/pyre | 345c7449a3416eea1c1affa74fb32faff30a6aaa | [
"BSD-3-Clause"
] | null | null | null | extensions/pyre/timers/wall_timers.cc | PyreFramework/pyre | 345c7449a3416eea1c1affa74fb32faff30a6aaa | [
"BSD-3-Clause"
] | null | null | null | // -*- c++ -*-
//
// michael a.g. aïvázis <michael.aivazis@para-sim.com>
// (c) 1998-2022 all rights reserved
// externals
#include "external.h"
// namespace setup
#include "forward.h"
// type alias
using wall_timer_t = pyre::timers::wall_timer_t;
// add bindings timers
void
pyre::py::timers::wall_timers(py::modu... | 25.460784 | 100 | 0.501733 | [
"render",
"object"
] |
5d7c7601292614f249c57c97fc6f9397988d65ed | 6,665 | cpp | C++ | 8088/demo/moire/make_table.cpp | reenigne/reenigne | c3eb8b31d7964e78bbe44908987d4be052a74488 | [
"Unlicense"
] | 92 | 2015-04-10T17:45:11.000Z | 2022-03-30T17:58:51.000Z | 8088/demo/moire/make_table.cpp | MS-DOS-stuff/reenigne | 0a113990aef398550c6f14d1c7a33af1cb091887 | [
"Unlicense"
] | 2 | 2017-11-05T07:21:35.000Z | 2018-11-04T23:36:13.000Z | 8088/demo/moire/make_table.cpp | MS-DOS-stuff/reenigne | 0a113990aef398550c6f14d1c7a33af1cb091887 | [
"Unlicense"
] | 18 | 2015-04-11T20:32:44.000Z | 2021-11-06T05:19:57.000Z | #include "alfe/main.h"
#include "alfe/vectors.h"
class Program : public ProgramBase
{
public:
int colour(Vector p)
{
int palette[16] =
// { 0, 8, 9, 1, 5, 13, 12, 4, 6, 14, 15, 7, 3, 11, 10, 2 };
{ 0, 1, 5, 4, 6, 7, 3, 2, 10, 11, 15, 14, 12, 13, 9, 8 };
double... | 32.832512 | 83 | 0.413353 | [
"vector"
] |
5d7eb5a9abdd389dee9f5bb8843e405ea32fd051 | 386 | cpp | C++ | LeetCode/Solutions/LC0643.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 54 | 2019-05-13T12:13:09.000Z | 2022-02-27T02:59:00.000Z | LeetCode/Solutions/LC0643.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 2 | 2020-10-02T07:16:43.000Z | 2020-10-19T04:36:19.000Z | LeetCode/Solutions/LC0643.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 20 | 2020-05-26T09:48:13.000Z | 2022-03-18T15:18:27.000Z | /*
Problem Statement: https://leetcode.com/problems/maximum-average-subarray-i/
*/
class Solution {
public:
double findMaxAverage(vector<int>& nums, int k) {
double max_sum, sum;
max_sum = sum = accumulate(nums.begin(), nums.begin() + k, 0);
for (int i = k; i < nums.size(); i++) {
sum += nums[i] - nums[i - k... | 24.125 | 76 | 0.624352 | [
"vector"
] |
5d7f92ab950e06ddcab49c5bddd530fc964e6f20 | 2,608 | cpp | C++ | Codeforces/ChessTournament/solution.cpp | arushmangal/Hack-CP-DSA | 91f5aabc4741c1c518f35065273c7fcfced67061 | [
"MIT"
] | 205 | 2021-09-30T15:41:05.000Z | 2022-03-27T18:34:56.000Z | Codeforces/ChessTournament/solution.cpp | arushmangal/Hack-CP-DSA | 91f5aabc4741c1c518f35065273c7fcfced67061 | [
"MIT"
] | 566 | 2021-09-30T15:27:27.000Z | 2021-10-16T21:21:02.000Z | Codeforces/ChessTournament/solution.cpp | arushmangal/Hack-CP-DSA | 91f5aabc4741c1c518f35065273c7fcfced67061 | [
"MIT"
] | 399 | 2021-09-29T05:40:46.000Z | 2022-03-27T18:34:58.000Z | /*
Each chess game ends in either a win for one player
and a loss for another player, or a draw for both players.
Expectations of the player can be of 2 types:
1. a player wants not to lose any game (i. e. finish the tournament with zero losses);
2. a player wants to win at least one game.
Output : Print "YES" and t... | 32.197531 | 96 | 0.389954 | [
"vector"
] |
5d871f5c1cd7484853988a26d44afa23e7445060 | 2,057 | hxx | C++ | opencascade/IFSelect_SignType.hxx | valgur/OCP | 2f7d9da73a08e4ffe80883614aedacb27351134f | [
"Apache-2.0"
] | 117 | 2020-03-07T12:07:05.000Z | 2022-03-27T07:35:22.000Z | opencascade/IFSelect_SignType.hxx | CadQuery/cpp-py-bindgen | 66e7376d3a27444393fc99acbdbef40bbc7031ae | [
"Apache-2.0"
] | 66 | 2019-12-20T16:07:36.000Z | 2022-03-15T21:56:10.000Z | opencascade/IFSelect_SignType.hxx | CadQuery/cpp-py-bindgen | 66e7376d3a27444393fc99acbdbef40bbc7031ae | [
"Apache-2.0"
] | 76 | 2020-03-16T01:47:46.000Z | 2022-03-21T16:37:07.000Z | // Created on: 1996-01-29
// Created by: Christian CAILLET
// Copyright (c) 1996-1999 Matra Datavision
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the ... | 26.714286 | 152 | 0.775401 | [
"object",
"model"
] |
5d93c37bce70565f8d529015bd3ada938d665912 | 1,061 | cpp | C++ | ScoreAfterFlippingMatrix.cpp | ArnabBir/leetcode-solutions | 31cf1edaa2f39c1f8d0300ad815889999058a0c8 | [
"MIT"
] | null | null | null | ScoreAfterFlippingMatrix.cpp | ArnabBir/leetcode-solutions | 31cf1edaa2f39c1f8d0300ad815889999058a0c8 | [
"MIT"
] | null | null | null | ScoreAfterFlippingMatrix.cpp | ArnabBir/leetcode-solutions | 31cf1edaa2f39c1f8d0300ad815889999058a0c8 | [
"MIT"
] | null | null | null | class Solution {
public:
int matrixScore(vector<vector<int>>& A) {
int count0;
for(int i = 0; i < A.size(); ++i) {
if(A[i][0] == 0) {
for(int j = 0; j < A[i].size(); ++j) {
A[i][j] = abs(A[i][j] -1);
}
... | 27.205128 | 57 | 0.28181 | [
"vector"
] |
5d93d666ad82510e436c8b9a70b23a3e99c12fd3 | 1,285 | cpp | C++ | system/lib/libcxxabi/src/format_exception.cpp | rajkumarananthu/emscripten | a2d0b4e533d1af75e0d2897c805cea0b7572799a | [
"MIT"
] | 1 | 2019-06-30T22:24:26.000Z | 2019-06-30T22:24:26.000Z | system/lib/libcxxabi/src/format_exception.cpp | rajkumarananthu/emscripten | a2d0b4e533d1af75e0d2897c805cea0b7572799a | [
"MIT"
] | null | null | null | system/lib/libcxxabi/src/format_exception.cpp | rajkumarananthu/emscripten | a2d0b4e533d1af75e0d2897c805cea0b7572799a | [
"MIT"
] | null | null | null | #include "cxa_exception.h"
#include "cxxabi.h"
#include <stdio.h>
#include <typeinfo>
#ifdef __USING_EMSCRIPTEN_EXCEPTIONS__
extern "C" {
int __cxa_can_catch(const std::type_info* catchType,
const std::type_info* excpType,
void** thrown);
char* emscripten_format_exception(voi... | 27.340426 | 79 | 0.654475 | [
"object"
] |
5d9846df7d9a30bf6b9c8d212bbaa3b1f763eae6 | 1,687 | hpp | C++ | orca_gazebo/include/orca_gazebo/orca_gazebo_util.hpp | tsaoyu/orca2 | 101513efe9168d0d122158b8c26968595ddf28d4 | [
"BSD-3-Clause"
] | null | null | null | orca_gazebo/include/orca_gazebo/orca_gazebo_util.hpp | tsaoyu/orca2 | 101513efe9168d0d122158b8c26968595ddf28d4 | [
"BSD-3-Clause"
] | null | null | null | orca_gazebo/include/orca_gazebo/orca_gazebo_util.hpp | tsaoyu/orca2 | 101513efe9168d0d122158b8c26968595ddf28d4 | [
"BSD-3-Clause"
] | null | null | null | #ifndef ORCA_GAZEBO_UTIL_H
#define ORCA_GAZEBO_UTIL_H
#include "ignition/math/Vector3.hh"
#include "ignition/math/Quaternion.hh"
#include "geometry_msgs/msg/vector3.hpp"
#include "geometry_msgs/msg/quaternion.hpp"
namespace orca_gazebo
{
double gaussianKernel(double mean, double stddev)
{
// Get 2 random nu... | 27.655738 | 103 | 0.6639 | [
"transform"
] |
4b6e8e983bfb55fbb7998b808f850511fb2162e8 | 9,485 | cpp | C++ | src/resolver_impl.cpp | samuelpowell/liblsl | 92f0e2f4870cd9b505cd35c89f70c7a9d3b191a3 | [
"MIT"
] | null | null | null | src/resolver_impl.cpp | samuelpowell/liblsl | 92f0e2f4870cd9b505cd35c89f70c7a9d3b191a3 | [
"MIT"
] | null | null | null | src/resolver_impl.cpp | samuelpowell/liblsl | 92f0e2f4870cd9b505cd35c89f70c7a9d3b191a3 | [
"MIT"
] | null | null | null | #include <iostream>
#include <boost/asio/ip/udp.hpp>
#include <boost/asio/placeholders.hpp>
#include <boost/bind.hpp>
#include <boost/thread/thread_only.hpp>
#include "api_config.h"
#include "cast.h"
#include "resolve_attempt_udp.h"
#include "resolver_impl.h"
#include "socket_utils.h"
// === implementation of the res... | 37.94 | 208 | 0.719346 | [
"render",
"object",
"vector"
] |
4b70972044b7f760d03f03470bfd7b429d38d371 | 3,191 | hpp | C++ | src/entities/Player.hpp | andrelegault/cpp-risk | 73c59a9add8e43824c681c9dcde4715b027d09a2 | [
"MIT"
] | null | null | null | src/entities/Player.hpp | andrelegault/cpp-risk | 73c59a9add8e43824c681c9dcde4715b027d09a2 | [
"MIT"
] | null | null | null | src/entities/Player.hpp | andrelegault/cpp-risk | 73c59a9add8e43824c681c9dcde4715b027d09a2 | [
"MIT"
] | null | null | null | #pragma once
#include <vector>
#include <iostream>
#include <algorithm>
#include "Player.fwd.hpp"
#include "PlayerStrategies.hpp"
#include "Map.hpp"
#include "Order.hpp"
#include "Cards.hpp"
#include "UI.hpp"
#include "MVC.hpp"
using std::cout;
using std::ostream;
using std::endl;
/**
* A Risk player.
*/
class Pl... | 21.273333 | 70 | 0.625509 | [
"object",
"vector"
] |
4b754af401b8decf0e68ca042f738dbf9a358286 | 1,502 | cpp | C++ | c++/day14/20.cpp | msoild/sword-to-offer | 6c15c78ad773da0b66cb76c9e01292851aca45c5 | [
"MIT"
] | null | null | null | c++/day14/20.cpp | msoild/sword-to-offer | 6c15c78ad773da0b66cb76c9e01292851aca45c5 | [
"MIT"
] | null | null | null | c++/day14/20.cpp | msoild/sword-to-offer | 6c15c78ad773da0b66cb76c9e01292851aca45c5 | [
"MIT"
] | null | null | null | class MyQueue {
public:
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
mStack.push(x);
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
in... | 20.575342 | 79 | 0.449401 | [
"object"
] |
4b779ab201b00b89b48c8f87c614f9bd93bd00ef | 1,051 | cpp | C++ | Data_structures/2d array/grid_successors.cpp | satvik007/uva | 72a763f7ed46a34abfcf23891300d68581adeb44 | [
"MIT"
] | 3 | 2017-08-12T06:09:39.000Z | 2018-09-16T02:31:27.000Z | Data_structures/2d array/grid_successors.cpp | satvik007/uva | 72a763f7ed46a34abfcf23891300d68581adeb44 | [
"MIT"
] | null | null | null | Data_structures/2d array/grid_successors.cpp | satvik007/uva | 72a763f7ed46a34abfcf23891300d68581adeb44 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
typedef vector <int> vi;
typedef long long ll;
vector <vector <bool>> a(3, vector <bool> (3));
int func(){
vector <vector <bool>> temp(a);
a[0][0] = temp[1][0] ^ temp[0][1];
a[2][2] = temp[2][1] ^ temp[1][2];
a[0][2] = temp[1][2] ^ temp[0][1];
a[2][0] = t... | 25.02381 | 71 | 0.490961 | [
"vector"
] |
4b7aee24913ff3a23e5402b2edef42e25cecc170 | 5,371 | cpp | C++ | libs/bloom-filter/tests/unit/bloom_filter_tests.cpp | chr15murray/ledger | 85be05221f19598de8c6c58652139a1f2d9e362f | [
"Apache-2.0"
] | 96 | 2018-08-23T16:49:05.000Z | 2021-11-25T00:47:16.000Z | libs/bloom-filter/tests/unit/bloom_filter_tests.cpp | chr15murray/ledger | 85be05221f19598de8c6c58652139a1f2d9e362f | [
"Apache-2.0"
] | 1,011 | 2018-08-17T12:25:21.000Z | 2021-11-18T09:30:19.000Z | libs/bloom-filter/tests/unit/bloom_filter_tests.cpp | chr15murray/ledger | 85be05221f19598de8c6c58652139a1f2d9e362f | [
"Apache-2.0"
] | 65 | 2018-08-20T20:05:40.000Z | 2022-02-26T23:54:35.000Z | //------------------------------------------------------------------------------
//
// Copyright 2018-2020 Fetch.AI Limited
//
// 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
//
// ... | 29.674033 | 99 | 0.700987 | [
"vector"
] |
4b7b19e497e4b3c4def5e218638b08a88d56f12d | 16,730 | cpp | C++ | indra/newview/piemenu.cpp | humbletim/archived-casviewer | 3b51b1baae7e7cebf1c7dca62d9c02751709ee57 | [
"Unlicense"
] | null | null | null | indra/newview/piemenu.cpp | humbletim/archived-casviewer | 3b51b1baae7e7cebf1c7dca62d9c02751709ee57 | [
"Unlicense"
] | null | null | null | indra/newview/piemenu.cpp | humbletim/archived-casviewer | 3b51b1baae7e7cebf1c7dca62d9c02751709ee57 | [
"Unlicense"
] | null | null | null | /**
* @file piemenu.cpp
* @brief Pie menu class
*
* $LicenseInfo:firstyear=2001&license=viewerlgpl$
* Second Life Viewer Source Code
* Copyright (C) 2010, Linden Research, Inc.
* Copyright (C) 2011, Zi Ree @ Second Life
*
* This library is free software; you can redistribute it and/or
* modify it under the te... | 30.867159 | 154 | 0.713568 | [
"3d"
] |
4b7bc9d3997f9adc37ad408759f1ea92a5d6988b | 28,961 | cc | C++ | ash/components/phonehub/camera_roll_manager_impl_unittest.cc | chromium/chromium | df46e572c3449a4b108d6e02fbe4f6d24cf98381 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 14,668 | 2015-01-01T01:57:10.000Z | 2022-03-31T23:33:32.000Z | ash/components/phonehub/camera_roll_manager_impl_unittest.cc | chromium/chromium | df46e572c3449a4b108d6e02fbe4f6d24cf98381 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 86 | 2015-10-21T13:02:42.000Z | 2022-03-14T07:50:50.000Z | ash/components/phonehub/camera_roll_manager_impl_unittest.cc | chromium/chromium | df46e572c3449a4b108d6e02fbe4f6d24cf98381 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 5,941 | 2015-01-02T11:32:21.000Z | 2022-03-31T16:35:46.000Z | // Copyright 2021 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/components/phonehub/camera_roll_manager_impl.h"
#include "ash/components/phonehub/camera_roll_item.h"
#include "ash/components/phonehub/cam... | 42.094477 | 89 | 0.784123 | [
"vector"
] |
4b89fbc7e064a6b0d5fcbfd319870978ac53fd1c | 6,610 | cpp | C++ | EvtGen1_06_00/src/EvtGenModels/EvtTauHadnu.cpp | klendathu2k/StarGenerator | 7dd407c41d4eea059ca96ded80d30bda0bc014a4 | [
"MIT"
] | 2 | 2018-12-24T19:37:00.000Z | 2022-02-28T06:57:20.000Z | EvtGen1_06_00/src/EvtGenModels/EvtTauHadnu.cpp | klendathu2k/StarGenerator | 7dd407c41d4eea059ca96ded80d30bda0bc014a4 | [
"MIT"
] | null | null | null | EvtGen1_06_00/src/EvtGenModels/EvtTauHadnu.cpp | klendathu2k/StarGenerator | 7dd407c41d4eea059ca96ded80d30bda0bc014a4 | [
"MIT"
] | null | null | null | //--------------------------------------------------------------------------
//
// Environment:
// This software is part of the EvtGen package developed jointly
// for the BaBar and CLEO collaborations. If you use all or part
// of it, please give an appropriate acknowledgement.
//
// Copyright Informat... | 24.849624 | 115 | 0.585023 | [
"model"
] |
4b8a2c93c399afcbe40aea4fa0440890dcfb59e2 | 2,742 | cc | C++ | third_party/blink/renderer/platform/wtf/ref_ptr_test.cc | zipated/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 2,151 | 2020-04-18T07:31:17.000Z | 2022-03-31T08:39:18.000Z | third_party/blink/renderer/platform/wtf/ref_ptr_test.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 395 | 2020-04-18T08:22:18.000Z | 2021-12-08T13:04:49.000Z | third_party/blink/renderer/platform/wtf/ref_ptr_test.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 338 | 2020-04-18T08:03:10.000Z | 2022-03-29T12:33:22.000Z | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/memory/scoped_refptr.h"
#include "testing/gtest/include/gtest/gtest.h"
#include "third_party/blink/renderer/platform/wtf/ref_counted.h"
#i... | 25.388889 | 79 | 0.7469 | [
"object"
] |
4b8e1a75f2829be518c4cf854b8aa8f74048f836 | 2,208 | hpp | C++ | include/PlantArchitect/InternodeBehaviours/LSystemBehaviour.hpp | edisonlee0212/PlantArchitect | f01e48fb67291947407a45494178db982b9be0e3 | [
"BSD-3-Clause"
] | 1 | 2021-08-25T06:25:00.000Z | 2021-08-25T06:25:00.000Z | include/PlantArchitect/InternodeBehaviours/LSystemBehaviour.hpp | edisonlee0212/PlantArchitect-dev | f01e48fb67291947407a45494178db982b9be0e3 | [
"BSD-3-Clause"
] | null | null | null | include/PlantArchitect/InternodeBehaviours/LSystemBehaviour.hpp | edisonlee0212/PlantArchitect-dev | f01e48fb67291947407a45494178db982b9be0e3 | [
"BSD-3-Clause"
] | 1 | 2022-02-07T02:54:05.000Z | 2022-02-07T02:54:05.000Z | #pragma once
#include <plant_architect_export.h>
#include <IInternodeBehaviour.hpp>
using namespace UniEngine;
namespace PlantArchitect {
struct PLANT_ARCHITECT_API LSystemTag : public IDataComponent {
};
struct PLANT_ARCHITECT_API LSystemParameters : public IDataComponent {
float m_internodeLeng... | 22.30303 | 103 | 0.569746 | [
"vector"
] |
4b940240280a84a64befb12e3742081568ff7aad | 6,224 | cc | C++ | gpgpu/demos/signed_distance_objects.cc | jpanikulam/experiments | be36319a89f8baee54d7fa7618b885edb7025478 | [
"MIT"
] | 1 | 2019-04-14T11:40:28.000Z | 2019-04-14T11:40:28.000Z | gpgpu/demos/signed_distance_objects.cc | jpanikulam/experiments | be36319a89f8baee54d7fa7618b885edb7025478 | [
"MIT"
] | 5 | 2018-04-18T13:54:29.000Z | 2019-08-22T20:04:17.000Z | gpgpu/demos/signed_distance_objects.cc | jpanikulam/experiments | be36319a89f8baee54d7fa7618b885edb7025478 | [
"MIT"
] | 1 | 2018-12-24T03:45:47.000Z | 2018-12-24T03:45:47.000Z | #include "gpgpu/demos/ray_lut.hh"
#include "gpgpu/import/load_kernel.hh"
#include "gpgpu/interplatform/cl_liegroups.hh"
#include "gpgpu/wrappers/create_context.hh"
#include "gpgpu/wrappers/errors.hh"
#include "gpgpu/wrappers/image_read_write.hh"
#include "util/timing.hh"
#include "viewer/interaction/ui2d.hh"
#include... | 31.276382 | 90 | 0.674647 | [
"geometry",
"render",
"vector",
"model"
] |
4b982e293e1ab1af2288cb60df20e0666fb17624 | 1,055 | cpp | C++ | src/view/TavoloDaGioco.cpp | lohathe/monopoliMoralista | 8c7df0a01bfb62ba37e81a9a6ecccba4f94b6cf3 | [
"MIT"
] | null | null | null | src/view/TavoloDaGioco.cpp | lohathe/monopoliMoralista | 8c7df0a01bfb62ba37e81a9a6ecccba4f94b6cf3 | [
"MIT"
] | null | null | null | src/view/TavoloDaGioco.cpp | lohathe/monopoliMoralista | 8c7df0a01bfb62ba37e81a9a6ecccba4f94b6cf3 | [
"MIT"
] | null | null | null | /*
* Copyright (c) 2009-2016 Marco Ziccardi, Luca Bonato
* Licensed under the MIT license.
*/
#include"TavoloDaGioco.h"
TavoloDaGioco::TavoloDaGioco(TurnoGrafico * tur, vector<CasellaGrafica *> & cas, InfoGiocatori * i): QWidget(0), t(tur), caselle(cas), Info(i)
{
setWindowTitle("Monopoly");
setFixedSize(1020,70... | 20.686275 | 143 | 0.574408 | [
"vector"
] |
4b9b766f2680e5f459d74b1fbd79dcd86bd3ecc6 | 523 | cpp | C++ | Chapter9/adaptor.cpp | heiheiyoyo/LearnCpp | 8b053e9e34d929f5fc3b210d30e646affe5b6dc8 | [
"WTFPL"
] | null | null | null | Chapter9/adaptor.cpp | heiheiyoyo/LearnCpp | 8b053e9e34d929f5fc3b210d30e646affe5b6dc8 | [
"WTFPL"
] | null | null | null | Chapter9/adaptor.cpp | heiheiyoyo/LearnCpp | 8b053e9e34d929f5fc3b210d30e646affe5b6dc8 | [
"WTFPL"
] | null | null | null | #include <iostream>
#include <vector>
#include <stack>
#include <string>
int main()
{
std::stack<int,std::vector<int>> istack{std::vector<int>{1,2,3}};
std::string s="Hello,world!";
std::stack<char,std::string> cstack{s};
for(std::vector<int>::size_type i=0,s=istack.size();i!=s;++i)
{
std::... | 23.772727 | 69 | 0.560229 | [
"vector"
] |
4ba6d4cd4bbad341cbea488a39bb520839d61e2b | 107,475 | cpp | C++ | qtdeclarative/tests/auto/quick/qquickitem2/tst_qquickitem.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 | [
"Apache-2.0"
] | 1 | 2020-04-30T15:47:35.000Z | 2020-04-30T15:47:35.000Z | qtdeclarative/tests/auto/quick/qquickitem2/tst_qquickitem.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 | [
"Apache-2.0"
] | null | null | null | qtdeclarative/tests/auto/quick/qquickitem2/tst_qquickitem.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 | [
"Apache-2.0"
] | null | null | null | /****************************************************************************
**
** Copyright (C) 2015 The Qt Company Ltd.
** Contact: http://www.qt.io/licensing/
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL21$
** Commercial License Usage
** Licensees holding valid commercia... | 35.099608 | 165 | 0.677432 | [
"object",
"shape",
"transform"
] |
4bacfcaec2a87eb206137a5612e5eefa2bb8b880 | 3,337 | cpp | C++ | Nistal Engine/UIAbout.cpp | AlbertCayuela/NistalEngine | d5a082c49326dcd47557fdb856a5a86deac40616 | [
"MIT"
] | null | null | null | Nistal Engine/UIAbout.cpp | AlbertCayuela/NistalEngine | d5a082c49326dcd47557fdb856a5a86deac40616 | [
"MIT"
] | null | null | null | Nistal Engine/UIAbout.cpp | AlbertCayuela/NistalEngine | d5a082c49326dcd47557fdb856a5a86deac40616 | [
"MIT"
] | 1 | 2020-09-28T13:25:32.000Z | 2020-09-28T13:25:32.000Z | #include "Application.h"
#include "Globals.h"
#include "UIAbout.h"
#include "UIWindow.h"
using namespace ImGui;
UIAbout::UIAbout() : UIWindow()
{
is_on = false;
}
UIAbout::~UIAbout()
{}
bool UIAbout::Start()
{
bool ret = true;
return ret;
}
bool UIAbout::CleanUp()
{
return true;
}
void UIAbout::Draw()
{
Be... | 24.718519 | 185 | 0.670962 | [
"3d"
] |
4bae0002fc40aed9146a247352397ff64db093d2 | 1,456 | cpp | C++ | 14/tests/iterator_cast.cpp | rapha-opensource/viper | 78f25771c7198ac66b846afde3f38c8b2c1c7cc9 | [
"MIT"
] | 2 | 2018-04-28T19:54:49.000Z | 2021-01-13T17:31:12.000Z | 17/tests/iterator_cast.cpp | rapha-opensource/viper | 78f25771c7198ac66b846afde3f38c8b2c1c7cc9 | [
"MIT"
] | null | null | null | 17/tests/iterator_cast.cpp | rapha-opensource/viper | 78f25771c7198ac66b846afde3f38c8b2c1c7cc9 | [
"MIT"
] | null | null | null | #include <array>
#include <iostream>
#include <vector>
#include "catch.hpp"
#include "../headers/iterator_cast.h"
SCENARIO( "iterator_cast wrapping an iterator object", "[iterator_cast], [object]" ) {
GIVEN( "A vector of integers [1,2,3,4]" ) {
std::vector<int> vi{1,2,3,4};
WHEN( "mapped into a... | 31.652174 | 107 | 0.543956 | [
"object",
"vector"
] |
4bb3b079b1f2445dc48235c114d0459a7e92e7f8 | 4,493 | cpp | C++ | src/plugins/gmp/Rational.cpp | ngoyal/flusspferd | 93ca7ec99d751bc4e240fbd7cbcf235f8fa49e3e | [
"MIT"
] | 1 | 2016-09-20T19:26:56.000Z | 2016-09-20T19:26:56.000Z | src/plugins/gmp/Rational.cpp | ngoyal/flusspferd | 93ca7ec99d751bc4e240fbd7cbcf235f8fa49e3e | [
"MIT"
] | null | null | null | src/plugins/gmp/Rational.cpp | ngoyal/flusspferd | 93ca7ec99d751bc4e240fbd7cbcf235f8fa49e3e | [
"MIT"
] | null | null | null | #include "Rational.hpp"
#include "Float.hpp"
#include "Integer.hpp"
using namespace flusspferd;
namespace multi_precision {
Rational::Rational(flusspferd::object const &self, mpq_class const &mp)
: base_type(self), mp(mp)
{ }
Rational::Rational(flusspferd::object const &self, flusspferd::call_context &x)
... | 36.827869 | 94 | 0.565992 | [
"object"
] |
4bbcce947ea82e3083c721b5075aaf88ffe3af9f | 1,165 | cpp | C++ | test/Algorithm/Search/BinarySearchTest.cpp | jljacoblo/jalgorithmCPP | b64307bfd029e3e276d8f9a91381aef812075e6f | [
"MIT"
] | null | null | null | test/Algorithm/Search/BinarySearchTest.cpp | jljacoblo/jalgorithmCPP | b64307bfd029e3e276d8f9a91381aef812075e6f | [
"MIT"
] | null | null | null | test/Algorithm/Search/BinarySearchTest.cpp | jljacoblo/jalgorithmCPP | b64307bfd029e3e276d8f9a91381aef812075e6f | [
"MIT"
] | null | null | null | //
// Created by Jacob Lo on 10/2/18.
//
#include <vector>
#include <iostream>
#include "catch.hpp"
#include "Search/BinarySearch.h"
using namespace std;
using namespace BinarySearch;
TEST_CASE( "Test Binary Search iterate", "[TestBSIterate]" ) {
vector<int> a { 0,2,3,5,6,9,10,11,14,15 };
int* arr = a.data();
... | 34.264706 | 62 | 0.593133 | [
"vector"
] |
4bc9a605298b21c8e4ea4ef04a864691e0dbe1f8 | 14,619 | cpp | C++ | hphp/runtime/base/empty-array.cpp | Gpapas/hhvm | 6173469fbd8377c6e0e846cdaa673ed79fb3a7d7 | [
"PHP-3.01",
"Zend-2.0"
] | null | null | null | hphp/runtime/base/empty-array.cpp | Gpapas/hhvm | 6173469fbd8377c6e0e846cdaa673ed79fb3a7d7 | [
"PHP-3.01",
"Zend-2.0"
] | null | null | null | hphp/runtime/base/empty-array.cpp | Gpapas/hhvm | 6173469fbd8377c6e0e846cdaa673ed79fb3a7d7 | [
"PHP-3.01",
"Zend-2.0"
] | null | null | null | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-2013 Facebook, Inc. (http://www.facebook.com) |
+---------... | 32.414634 | 79 | 0.625966 | [
"vector"
] |
4bcb2bfebe1661555dcd7ca9044233eb7ba256c0 | 22,182 | cpp | C++ | plugins/core/qPhotoscanIO/src/PhotoScanFilter.cpp | ohanlonl/qCMAT | f6ca04fa7c171629f094ee886364c46ff8b27c0b | [
"BSD-Source-Code"
] | null | null | null | plugins/core/qPhotoscanIO/src/PhotoScanFilter.cpp | ohanlonl/qCMAT | f6ca04fa7c171629f094ee886364c46ff8b27c0b | [
"BSD-Source-Code"
] | null | null | null | plugins/core/qPhotoscanIO/src/PhotoScanFilter.cpp | ohanlonl/qCMAT | f6ca04fa7c171629f094ee886364c46ff8b27c0b | [
"BSD-Source-Code"
] | 1 | 2019-02-03T12:19:42.000Z | 2019-02-03T12:19:42.000Z | //##########################################################################
//# #
//# CLOUDCOMPARE PLUGIN: qPhotoScanIO #
//# #
//# This pr... | 23.77492 | 155 | 0.634073 | [
"mesh",
"vector",
"model",
"transform"
] |
4bd963f0f64ab0d779663ac36a3bd523d556f89b | 2,068 | cpp | C++ | src/activity/Backbutton.cpp | ArthurSonzogni/pigami | bc33ed2797ba1da534d9cd4337e59d33ce46d4c5 | [
"MIT"
] | 4 | 2019-12-19T17:08:04.000Z | 2020-09-20T08:31:15.000Z | src/activity/Backbutton.cpp | ArthurSonzogni/pigami | bc33ed2797ba1da534d9cd4337e59d33ce46d4c5 | [
"MIT"
] | null | null | null | src/activity/Backbutton.cpp | ArthurSonzogni/pigami | bc33ed2797ba1da534d9cd4337e59d33ce46d4c5 | [
"MIT"
] | null | null | null | // Copyright 2019 Arthur Sonzogni. All rights reserved.
// Use of this source code is governed by the MIT license that can be found in
// the LICENSE file.
#include "activity/Backbutton.hpp"
#include <cmath>
#include <smk/Color.hpp>
#include <smk/Input.hpp>
#include <smk/Shape.hpp>
#include <smk/Text.hpp>
#include "... | 30.411765 | 78 | 0.686654 | [
"shape"
] |
4be64ce2a2975776a6a66c9ee559869e2add3b36 | 6,067 | cc | C++ | third_party/blink/renderer/core/loader/history_item.cc | zipated/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 2,151 | 2020-04-18T07:31:17.000Z | 2022-03-31T08:39:18.000Z | third_party/blink/renderer/core/loader/history_item.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 395 | 2020-04-18T08:22:18.000Z | 2021-12-08T13:04:49.000Z | third_party/blink/renderer/core/loader/history_item.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 338 | 2020-04-18T08:03:10.000Z | 2022-03-29T12:33:22.000Z | /*
* Copyright (C) 2005, 2006, 2008, 2011 Apple Inc. 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 li... | 33.335165 | 80 | 0.761332 | [
"object",
"vector"
] |
4be6ceb131c2793242303abe68e2726fe206fa9e | 4,996 | cc | C++ | python/pytinyrenderer.cc | erwincoumans/tinyrenderer | 0e8b3fe69f34f0b01683760c3eee29b077410631 | [
"Zlib"
] | 12 | 2017-03-20T15:11:48.000Z | 2022-03-03T23:40:05.000Z | python/pytinyrenderer.cc | erwincoumans/tinyrenderer | 0e8b3fe69f34f0b01683760c3eee29b077410631 | [
"Zlib"
] | null | null | null | python/pytinyrenderer.cc | erwincoumans/tinyrenderer | 0e8b3fe69f34f0b01683760c3eee29b077410631 | [
"Zlib"
] | 1 | 2016-09-19T13:08:51.000Z | 2016-09-19T13:08:51.000Z | // Copyright 2021 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agree... | 41.289256 | 113 | 0.643114 | [
"vector",
"model"
] |
4bef9353fb981e643ce1ba7cbb65be0805f71efa | 2,163 | cpp | C++ | lib/item/src/Collection.cpp | maxim-puchkov/TheAdventure2019 | 049b0318b492f7a360817825f8772d7e28b5f75e | [
"MIT"
] | null | null | null | lib/item/src/Collection.cpp | maxim-puchkov/TheAdventure2019 | 049b0318b492f7a360817825f8772d7e28b5f75e | [
"MIT"
] | null | null | null | lib/item/src/Collection.cpp | maxim-puchkov/TheAdventure2019 | 049b0318b492f7a360817825f8772d7e28b5f75e | [
"MIT"
] | null | null | null | //
// Collection.cpp
// adventure2019
//
// Created by admin on 2019-02-06.
// Copyright © 2019 maximpuchkov. All rights reserved.
//
#include "Collection.h"
// using namespace objects;
//using items::Collection;
namespace items {
/* Constructors */
//Collection::Collection()
//{ }
Collection::~Collection()... | 17.166667 | 73 | 0.626445 | [
"object"
] |
4bf1317ffd9f789fcae408a7c30109750836a449 | 4,018 | cpp | C++ | AI-DungeonGeneration/AStar.cpp | LiadKhamd/AI-DungeonGeneration | fd19320002e2d3d0529575d723cb018dad90bfd5 | [
"MIT"
] | 1 | 2019-12-18T00:50:49.000Z | 2019-12-18T00:50:49.000Z | AI-DungeonGeneration/AStar.cpp | LiadKh/AI-DungeonGeneration | fd19320002e2d3d0529575d723cb018dad90bfd5 | [
"MIT"
] | null | null | null | AI-DungeonGeneration/AStar.cpp | LiadKh/AI-DungeonGeneration | fd19320002e2d3d0529575d723cb018dad90bfd5 | [
"MIT"
] | null | null | null | #include "AStar.h"
extern int maze[MSIZE][MSIZE];
AStar::AStar()
{
}
AStar::~AStar()
{
delete lastTarget;
solution.clear();
}
AStar::AStar(Point2D *pos)
{
myPos = pos;
lastTarget = new Point2D(-1, -1);
}
int AStar::getDiraction(Point2D *p)
{
if (myPos->GetX() != p->GetX())
{
if (myPos->GetX() > p->GetX(... | 28.295775 | 118 | 0.684171 | [
"vector"
] |
4bfaaf72b24b0f2c5b323a511aa5f3aadcf82e68 | 10,325 | cpp | C++ | ace/tests/Refcounted_Auto_Ptr_Test.cpp | tharindusathis/sourcecodes-of-CodeReadingTheOpenSourcePerspective | 1b0172cdb78757fd17898503aaf6ce03d940ef28 | [
"Apache-1.1"
] | 46 | 2015-12-04T17:12:58.000Z | 2022-03-11T04:30:49.000Z | ace/tests/Refcounted_Auto_Ptr_Test.cpp | tharindusathis/sourcecodes-of-CodeReadingTheOpenSourcePerspective | 1b0172cdb78757fd17898503aaf6ce03d940ef28 | [
"Apache-1.1"
] | null | null | null | ace/tests/Refcounted_Auto_Ptr_Test.cpp | tharindusathis/sourcecodes-of-CodeReadingTheOpenSourcePerspective | 1b0172cdb78757fd17898503aaf6ce03d940ef28 | [
"Apache-1.1"
] | 23 | 2016-10-24T09:18:14.000Z | 2022-02-25T02:11:35.000Z | // Refcounted_Auto_Ptr_Test.cpp,v 4.8 2001/06/18 19:33:43 shuston Exp
//=============================================================================
/**
* @file Refcounted_Auto_Ptr_Test.cpp
*
* Refcounted_Auto_Ptr_Test.cpp,v 4.8 2001/06/18 19:33:43 shuston Exp
*
* This example tests the <ACE_Refcou... | 26.139241 | 81 | 0.638063 | [
"object"
] |
4bfc7288ad8a8ed870c92acf47ebef7f7444dac4 | 826 | cpp | C++ | tests/geometry/algorithm/intersect/circle_circle.cpp | AlCash07/ACTL | 15de4e2783d8e39dbd8e10cd635aaab328ca4f5b | [
"BSL-1.0"
] | 17 | 2018-08-22T06:48:20.000Z | 2022-02-22T21:20:09.000Z | tests/geometry/algorithm/intersect/circle_circle.cpp | AlCash07/ACTL | 15de4e2783d8e39dbd8e10cd635aaab328ca4f5b | [
"BSL-1.0"
] | null | null | null | tests/geometry/algorithm/intersect/circle_circle.cpp | AlCash07/ACTL | 15de4e2783d8e39dbd8e10cd635aaab328ca4f5b | [
"BSL-1.0"
] | null | null | null | // Copyright 2018 Oleksandr Bacherikov.
//
// Distributed under the Boost Software License, Version 1.0
// (see accompanying file LICENSE.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt).
#include <actl/geometry/algorithm/intersect/circle_circle.hpp>
#include "test.hpp"
TEST_CASE("default")
{
circle<int>... | 30.592593 | 62 | 0.622276 | [
"geometry",
"vector"
] |
4bfd72202960ce4c92b10806aea8d80e8305594c | 1,613 | cpp | C++ | cpp/1034.coloring-a-border.cpp | Yu-Xiaoxian/leetcode | 294f8240b57810bb16e4acae39e68e81f99f6db1 | [
"Apache-2.0"
] | null | null | null | cpp/1034.coloring-a-border.cpp | Yu-Xiaoxian/leetcode | 294f8240b57810bb16e4acae39e68e81f99f6db1 | [
"Apache-2.0"
] | null | null | null | cpp/1034.coloring-a-border.cpp | Yu-Xiaoxian/leetcode | 294f8240b57810bb16e4acae39e68e81f99f6db1 | [
"Apache-2.0"
] | null | null | null | /*
* @lc app=leetcode id=1034 lang=cpp
*
* [1034] Coloring A Border
*/
#include <vector>
using namespace std;
// @lc code=start
class Solution {
public:
vector<vector<int>> colorBorder(vector<vector<int>>& grid, int r0, int c0, int color) {
int originColor = grid[r0][c0];
int height = grid.si... | 26.442623 | 111 | 0.515809 | [
"vector"
] |
ef02556be005f6b783aa2bca1f17386beff68eec | 11,796 | cpp | C++ | video/common/Video/jhcListVSrc.cpp | jconnell11/ALIA | f7a6c9dfd775fbd41239051aeed7775adb878b0a | [
"Apache-2.0"
] | 1 | 2020-03-01T13:22:34.000Z | 2020-03-01T13:22:34.000Z | video/common/Video/jhcListVSrc.cpp | jconnell11/ALIA | f7a6c9dfd775fbd41239051aeed7775adb878b0a | [
"Apache-2.0"
] | null | null | null | video/common/Video/jhcListVSrc.cpp | jconnell11/ALIA | f7a6c9dfd775fbd41239051aeed7775adb878b0a | [
"Apache-2.0"
] | 1 | 2020-07-30T10:24:58.000Z | 2020-07-30T10:24:58.000Z | // jhcListVSrc.cpp : makes a video from a file containing a list of names
//
// Written by Jonathan H. Connell, jconnell@alum.mit.edu
//
///////////////////////////////////////////////////////////////////////////
//
// Copyright 1999-2019 IBM Corporation
//
// Licensed under the Apache License, Version 2.0 (the "Licens... | 25.259101 | 93 | 0.567396 | [
"geometry"
] |
ef070b93846914295e2b620c8ef382827f4be257 | 11,168 | cc | C++ | GeneratorInterface/Herwig7Interface/src/Herwig7Interface.cc | bisnupriyasahu/cmssw | 6cf37ca459246525be0e8a6f5172c6123637d259 | [
"Apache-2.0"
] | 3 | 2018-08-24T19:10:26.000Z | 2019-02-19T11:45:32.000Z | GeneratorInterface/Herwig7Interface/src/Herwig7Interface.cc | bisnupriyasahu/cmssw | 6cf37ca459246525be0e8a6f5172c6123637d259 | [
"Apache-2.0"
] | 3 | 2018-08-23T13:40:24.000Z | 2019-12-05T21:16:03.000Z | GeneratorInterface/Herwig7Interface/src/Herwig7Interface.cc | bisnupriyasahu/cmssw | 6cf37ca459246525be0e8a6f5172c6123637d259 | [
"Apache-2.0"
] | 5 | 2018-08-21T16:37:52.000Z | 2020-01-09T13:33:17.000Z | /** \class Herwig7Interface
*
* Marco A. Harrendorf marco.harrendorf@cern.ch
* Dominik Beutel dominik.beutel@cern.ch
*/
#include <iostream>
#include <fstream>
#include <sstream>
#include <cstdlib>
#include <memory>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <boost/shared_ptr.hpp>
#incl... | 32.091954 | 126 | 0.680963 | [
"object",
"vector",
"transform"
] |
ef09f9948687bbc5a9b044c2113c213dcefb676f | 868 | cpp | C++ | 0043-Maximum Subarray III/0043-Maximum Subarray III.cpp | lightwindy/LintCode-1 | 316fa395c9a6de9bfac1d9c9cf58acb5ffb384a6 | [
"MIT"
] | 77 | 2017-12-30T13:33:37.000Z | 2022-01-16T23:47:08.000Z | 0001-0100/0043-Maximum Subarray III/0043-Maximum Subarray III.cpp | jxhangithub/LintCode-1 | a8aecc65c47a944e9debad1971a7bc6b8776e48b | [
"MIT"
] | 1 | 2018-05-14T14:15:40.000Z | 2018-05-14T14:15:40.000Z | 0001-0100/0043-Maximum Subarray III/0043-Maximum Subarray III.cpp | jxhangithub/LintCode-1 | a8aecc65c47a944e9debad1971a7bc6b8776e48b | [
"MIT"
] | 39 | 2017-12-07T14:36:25.000Z | 2022-03-10T23:05:37.000Z | class Solution {
public:
/**
* @param nums: A list of integers
* @param k: An integer denote to find k non-overlapping subarrays
* @return: An integer denote the sum of max k non-overlapping subarrays
*/
int maxSubArray(vector<int> nums, int k) {
// write your code here
int n... | 32.148148 | 87 | 0.46659 | [
"vector"
] |
ef0ef87e0a2c4a7f07585a2c91c98eb72986045b | 5,680 | cc | C++ | rocksdb.cc | cighao/ycsb-c | 4e58ead9d5174778dedc51a79a0f3568a6fcc4d5 | [
"Apache-2.0"
] | 1 | 2019-09-30T05:50:14.000Z | 2019-09-30T05:50:14.000Z | rocksdb.cc | cighao/ycsb-c | 4e58ead9d5174778dedc51a79a0f3568a6fcc4d5 | [
"Apache-2.0"
] | null | null | null | rocksdb.cc | cighao/ycsb-c | 4e58ead9d5174778dedc51a79a0f3568a6fcc4d5 | [
"Apache-2.0"
] | null | null | null | /*
* rocksdb.cc
* Hao Chen
* 2019-07-21
*/
#include <cstring>
#include <iostream>
#include <vector>
#include <thread>
#include "core/utils.h"
#include "core/timer.h"
#include "core/rocksdb_client.h"
#include "core/core_workload.h"
#include "db/db_factory.h"
#include "db/rocksdb_db.h"
using namespace std;
void Usage... | 31.555556 | 102 | 0.576761 | [
"vector"
] |
ef1512185c187258d27c4a94faf273d8c1131230 | 1,897 | cc | C++ | PROIECT/core/entry.cc | m3sserschmitt/lab_poo | 6d635cb395f908efa8502005964edf52cdcb643c | [
"MIT"
] | null | null | null | PROIECT/core/entry.cc | m3sserschmitt/lab_poo | 6d635cb395f908efa8502005964edf52cdcb643c | [
"MIT"
] | null | null | null | PROIECT/core/entry.cc | m3sserschmitt/lab_poo | 6d635cb395f908efa8502005964edf52cdcb643c | [
"MIT"
] | null | null | null | #include "./include/entry.h"
#include "../util/include/util.h"
#include <vector>
using namespace std;
Entry::Entry() {}
Entry::Entry(string name)
{
this->name = name;
}
Entry::Entry(const Entry &e)
{
this->name = e.name;
this->date = e.date;
}
Entry::~Entry() {}
void Entry::set_date(Date date)
{
... | 15.941176 | 77 | 0.579863 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.