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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b764324e865c7c9254a5170a28c28bf5ae92d4df | 521 | hpp | C++ | include/hal.hpp | CMI-NLP/WordVectors | 62bdf01bd76d8515dcd600cbda37cf37f6ebc683 | [
"MIT"
] | 2 | 2019-11-04T07:31:32.000Z | 2019-11-10T15:52:21.000Z | include/hal.hpp | CMI-NLP/WordVectors | 62bdf01bd76d8515dcd600cbda37cf37f6ebc683 | [
"MIT"
] | null | null | null | include/hal.hpp | CMI-NLP/WordVectors | 62bdf01bd76d8515dcd600cbda37cf37f6ebc683 | [
"MIT"
] | 1 | 2019-11-10T15:52:31.000Z | 2019-11-10T15:52:31.000Z | #ifndef __HAL_HPP__
#define __HAL_HPP__
#include <vector>
#include <string>
#include <algorithm>
#include <armadillo>
namespace wove
{
class hal
{
protected:
std::string corpus_name;
public:
hal(std::string corpus_name);
~hal();
void word_vectors(std::vector<std::string> tokens, std::vector<std::string... | 23.681818 | 105 | 0.714012 | [
"vector"
] |
b76950ff496bb165d6cff6d272a483ec388963f1 | 3,645 | cpp | C++ | engines/kinduction.cpp | Kuree/cosa2 | 8a0a893d85e309543a9cb793c98bc7ff1d74ebbf | [
"BSD-3-Clause"
] | 1 | 2022-03-24T07:30:43.000Z | 2022-03-24T07:30:43.000Z | engines/kinduction.cpp | zhanghongce/cosa2 | f5ce28866761f3725649ec7ff2609a53d915fee1 | [
"BSD-3-Clause"
] | null | null | null | engines/kinduction.cpp | zhanghongce/cosa2 | f5ce28866761f3725649ec7ff2609a53d915fee1 | [
"BSD-3-Clause"
] | null | null | null | /********************* */
/*! \file
** \verbatim
** Top contributors (to current version):
** Ahmed Irfan, Makai Mann
** This file is part of the cosa2 project.
** Copyright (c) 2019 by the authors listed in the file AUTHORS
** in the top-level source dire... | 23.980263 | 80 | 0.636214 | [
"model"
] |
b76a2f578c290806b10c335d3427b38225024f39 | 13,880 | hpp | C++ | src/value.hpp | conradjones/sentry-native-premake | 6dd1624ed8937eea6dfed10355562f3ae623098e | [
"MIT"
] | null | null | null | src/value.hpp | conradjones/sentry-native-premake | 6dd1624ed8937eea6dfed10355562f3ae623098e | [
"MIT"
] | null | null | null | src/value.hpp | conradjones/sentry-native-premake | 6dd1624ed8937eea6dfed10355562f3ae623098e | [
"MIT"
] | null | null | null | #ifndef SENTRY_VALUE_HPP_INCLUDED
#define SENTRY_VALUE_HPP_INCLUDED
#include <assert.h>
#include <algorithm>
#include <atomic>
#include <cmath>
#include <map>
#include <sstream>
#include <string>
#include <vector>
#include "internal.hpp"
#include "uuid.hpp"
#include "vendor/mpack.h"
namespace sentry {
class Value;
... | 25.992509 | 79 | 0.51585 | [
"object",
"vector"
] |
b76e4a1e6127dfc2b64583e5004ebfc4d5b40405 | 3,468 | hpp | C++ | addons/arsenal/configs/Cfg3DEN.hpp | Braincrushy/TBMod | 785f11cd9cd0defb0d01a6d2861beb6c207eb8a3 | [
"MIT"
] | null | null | null | addons/arsenal/configs/Cfg3DEN.hpp | Braincrushy/TBMod | 785f11cd9cd0defb0d01a6d2861beb6c207eb8a3 | [
"MIT"
] | 4 | 2018-12-21T06:57:25.000Z | 2020-07-09T09:06:38.000Z | addons/arsenal/configs/Cfg3DEN.hpp | Braincrushy/TBMod | 785f11cd9cd0defb0d01a6d2861beb6c207eb8a3 | [
"MIT"
] | null | null | null | #include "macros.inc"
/*
Part of the TBMod ( https://github.com/TacticalBaconDevs/TBMod )
Developed by http://tacticalbacon.de
*/
class ctrlCombo;
class Cfg3DEN
{
class Attributes
{
class Default;
class Title: Default
{
class Controls
{
cl... | 30.156522 | 149 | 0.322376 | [
"object"
] |
b76fc0274bc792ae3e35656ac4bb11eb2e8171d5 | 3,220 | cpp | C++ | os/kernel/testsuite/vesa.cpp | rvedam/es-operating-system | 32d3e4791c28a5623744800f108d029c40c745fc | [
"Apache-2.0"
] | 2 | 2020-11-30T18:38:20.000Z | 2021-06-07T07:44:03.000Z | os/kernel/testsuite/vesa.cpp | LambdaLord/es-operating-system | 32d3e4791c28a5623744800f108d029c40c745fc | [
"Apache-2.0"
] | 1 | 2019-01-14T03:09:45.000Z | 2019-01-14T03:09:45.000Z | os/kernel/testsuite/vesa.cpp | LambdaLord/es-operating-system | 32d3e4791c28a5623744800f108d029c40c745fc | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2008, 2009 Google Inc.
* Copyright 2006 Nintendo 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
*
* Unle... | 24.029851 | 75 | 0.539441 | [
"object"
] |
b77011e215e2569f16cb52b3de49f9418f5d027c | 1,624 | cpp | C++ | acmicpc/11559.cpp | juseongkr/BOJ | 8f10a2bf9a7d695455493fbe7423347a8b648416 | [
"Apache-2.0"
] | 7 | 2020-02-03T10:00:19.000Z | 2021-11-16T11:03:57.000Z | acmicpc/11559.cpp | juseongkr/Algorithm-training | 8f10a2bf9a7d695455493fbe7423347a8b648416 | [
"Apache-2.0"
] | 1 | 2021-01-03T06:58:24.000Z | 2021-01-03T06:58:24.000Z | acmicpc/11559.cpp | juseongkr/Algorithm-training | 8f10a2bf9a7d695455493fbe7423347a8b648416 | [
"Apache-2.0"
] | 1 | 2020-01-22T14:34:03.000Z | 2020-01-22T14:34:03.000Z | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define N 12
#define M 6
vector<pair<int, int>> hist;
string map[N];
int visit[N][M];
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
int cnt, ans, flag;
void bfs(int a, int b, char c)
{
for (int i=0; i<N; ++i)
for (int j=0; j<M; ++j... | 16.40404 | 62 | 0.472291 | [
"vector"
] |
b7710d31b5aeebdf058eaabce492db936ed709bf | 4,223 | cpp | C++ | logdevice/server/locallogstore/ClusterMarkerChecker.cpp | YangKian/LogDevice | e5c2168c11e9de867a1bcf519f95016e1c879b5c | [
"BSD-3-Clause"
] | 1,831 | 2018-09-12T15:41:52.000Z | 2022-01-05T02:38:03.000Z | logdevice/server/locallogstore/ClusterMarkerChecker.cpp | YangKian/LogDevice | e5c2168c11e9de867a1bcf519f95016e1c879b5c | [
"BSD-3-Clause"
] | 183 | 2018-09-12T16:14:59.000Z | 2021-12-07T15:49:43.000Z | logdevice/server/locallogstore/ClusterMarkerChecker.cpp | YangKian/LogDevice | e5c2168c11e9de867a1bcf519f95016e1c879b5c | [
"BSD-3-Clause"
] | 228 | 2018-09-12T15:41:51.000Z | 2022-01-05T08:12:09.000Z | /**
* Copyright (c) 2017-present, Facebook, Inc. and its affiliates.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "logdevice/server/locallogstore/ClusterMarkerChecker.h"
#include "logdevice/c... | 35.788136 | 80 | 0.640303 | [
"vector"
] |
b772dce6bb0b3da65242983bc60132e987bd7270 | 6,037 | cpp | C++ | Grid.cpp | TryItOnline/Fission | 9b3d880c323badf66bdab908876ebea84c390aa9 | [
"MIT"
] | 26 | 2015-04-30T21:49:16.000Z | 2021-11-14T17:39:45.000Z | Grid.cpp | TryItOnline/Fission | 9b3d880c323badf66bdab908876ebea84c390aa9 | [
"MIT"
] | 6 | 2015-05-01T09:08:44.000Z | 2017-06-04T08:14:17.000Z | Grid.cpp | C0deH4cker/Fission | 9b3d880c323badf66bdab908876ebea84c390aa9 | [
"MIT"
] | 6 | 2015-05-21T23:06:24.000Z | 2018-09-19T02:51:28.000Z | //
// Grid.cpp
// Fission
//
// Created by C0deH4cker on 2/23/14.
// Copyright (c) 2014 C0deH4cker. All rights reserved.
//
#include "Grid.h"
#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <unordered_set>
#include <sstream>
#include <uni... | 24.843621 | 92 | 0.634752 | [
"vector"
] |
b77c82d2728a298b2221759dc2c9d0332cbdcc41 | 3,639 | cpp | C++ | rtHMM/hmm.cpp | fdlm/rtHMM | 11db9fe499bb85c6637dd582134be61c992397d7 | [
"MIT"
] | 2 | 2020-08-18T21:56:22.000Z | 2021-03-31T06:08:02.000Z | rtHMM/hmm.cpp | fdlm/rtHMM | 11db9fe499bb85c6637dd582134be61c992397d7 | [
"MIT"
] | null | null | null | rtHMM/hmm.cpp | fdlm/rtHMM | 11db9fe499bb85c6637dd582134be61c992397d7 | [
"MIT"
] | 1 | 2021-03-23T03:10:25.000Z | 2021-03-23T03:10:25.000Z | #include "hmm.h"
namespace rtHMM {
namespace internal {
void insert_or_update(hmm::link&& lnk, vector<hmm::link>& links)
{
auto elem = find(begin(links), end(links), lnk);
if (elem == links.end()) {
links.emplace_back(lnk);
} else {
... | 33.081818 | 101 | 0.528167 | [
"vector",
"model"
] |
b77ff2ddca0ed35a50637a6d587047bd1a914664 | 1,242 | cpp | C++ | aws-cpp-sdk-signer/source/model/S3SignedObject.cpp | lintonv/aws-sdk-cpp | 15e19c265ffce19d2046b18aa1b7307fc5377e58 | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-signer/source/model/S3SignedObject.cpp | lintonv/aws-sdk-cpp | 15e19c265ffce19d2046b18aa1b7307fc5377e58 | [
"Apache-2.0"
] | 1 | 2021-10-14T16:57:00.000Z | 2021-10-18T10:47:24.000Z | aws-cpp-sdk-signer/source/model/S3SignedObject.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2022-03-23T15:17:18.000Z | 2022-03-23T15:17:18.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/signer/model/S3SignedObject.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws
{
namespa... | 16.56 | 69 | 0.708535 | [
"model"
] |
b780806563bb93090fb142b2efb83c7bf44d805f | 12,634 | cpp | C++ | TrueRPG.cpp | TheRedSpy15/MyFirstCodes | 73c0966a4de4a26800a03f9f4d4117f581237661 | [
"MIT"
] | null | null | null | TrueRPG.cpp | TheRedSpy15/MyFirstCodes | 73c0966a4de4a26800a03f9f4d4117f581237661 | [
"MIT"
] | null | null | null | TrueRPG.cpp | TheRedSpy15/MyFirstCodes | 73c0966a4de4a26800a03f9f4d4117f581237661 | [
"MIT"
] | null | null | null | #include <iostream>
#include <ctime>
#include <cstdlib>
#include <unistd.h>
#include <fstream>
using namespace std;
class PlayerClass{
public:
int ReturnName(){
return Name;
}
int ReturnLastName(){
return lastName;
}
int ReturnHealth(){
return Health;
}
int ReturnGold(){
r... | 32.901042 | 198 | 0.531977 | [
"object"
] |
b785d7cbac575e2305fbe890dfb9b35888dbd468 | 4,217 | hpp | C++ | Phoenix/Common/Include/Common/Voxels/Map.hpp | M3TIOR/Phoenix | 6e35b4f430fa9ad1bd77b5485ed65a652154be6b | [
"BSD-3-Clause"
] | null | null | null | Phoenix/Common/Include/Common/Voxels/Map.hpp | M3TIOR/Phoenix | 6e35b4f430fa9ad1bd77b5485ed65a652154be6b | [
"BSD-3-Clause"
] | null | null | null | Phoenix/Common/Include/Common/Voxels/Map.hpp | M3TIOR/Phoenix | 6e35b4f430fa9ad1bd77b5485ed65a652154be6b | [
"BSD-3-Clause"
] | null | null | null | // Copyright 2019-20 Genten Studios
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclai... | 31.237037 | 80 | 0.713778 | [
"vector"
] |
b78c05690ffaddd2faeeca9644c288654055c0b8 | 12,376 | cc | C++ | src/draco/io/ply_decoder.cc | adrianstephens/draco | da76d8322ef400fc23c292993088eeaceaba589d | [
"Apache-2.0"
] | 13,885 | 2018-08-03T17:46:24.000Z | 2022-03-31T14:26:19.000Z | src/draco/io/ply_decoder.cc | adrianstephens/draco | da76d8322ef400fc23c292993088eeaceaba589d | [
"Apache-2.0"
] | 3,677 | 2015-01-02T08:06:57.000Z | 2022-03-31T19:24:26.000Z | src/draco/io/ply_decoder.cc | adrianstephens/draco | da76d8322ef400fc23c292993088eeaceaba589d | [
"Apache-2.0"
] | 2,728 | 2015-01-01T19:28:19.000Z | 2022-03-31T16:07:18.000Z | // Copyright 2016 The Draco 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... | 38.554517 | 80 | 0.675339 | [
"mesh",
"vector"
] |
b78e733b4f9b0a1c5d258817e8e96f0ca884542a | 6,641 | cpp | C++ | src/DANE/dane_mpi.cpp | microsoft/DistrOpt | 73f2fc0c5d12257d4fb4e1aacc77ab23a0d2de98 | [
"MIT"
] | 1 | 2020-10-26T10:23:27.000Z | 2020-10-26T10:23:27.000Z | src/DANE/dane_mpi.cpp | microsoft/DistrOpt | 73f2fc0c5d12257d4fb4e1aacc77ab23a0d2de98 | [
"MIT"
] | null | null | null | src/DANE/dane_mpi.cpp | microsoft/DistrOpt | 73f2fc0c5d12257d4fb4e1aacc77ab23a0d2de98 | [
"MIT"
] | 3 | 2020-09-04T06:36:36.000Z | 2021-11-10T11:28:05.000Z | // Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.
#include <iostream>
#include <fstream>
#include <iomanip>
#include <numeric>
#include <algorithm>
#include "timer.h"
#include "utils.h"
#include "randalgms.h"
#include "dane_omp.h"
#include "lbfgs_omp.h"
namespace distropt
{
... | 33.540404 | 123 | 0.617527 | [
"vector",
"model"
] |
b7909972ffbc66b861608004a64bda577796cbf6 | 12,859 | cpp | C++ | src/frameworks/native/libs/binder/tests/binderThroughputTest.cpp | dAck2cC2/m3e | 475b89b59d5022a94e00b636438b25e27e4eaab2 | [
"Apache-2.0"
] | 5 | 2020-12-19T06:56:06.000Z | 2022-01-09T01:28:42.000Z | src/frameworks/native/libs/binder/tests/binderThroughputTest.cpp | dAck2cC2/m3e | 475b89b59d5022a94e00b636438b25e27e4eaab2 | [
"Apache-2.0"
] | 1 | 2021-09-27T06:00:40.000Z | 2021-09-27T06:00:40.000Z | src/frameworks/native/libs/binder/tests/binderThroughputTest.cpp | dAck2cC2/m3e | 475b89b59d5022a94e00b636438b25e27e4eaab2 | [
"Apache-2.0"
] | 3 | 2020-12-19T06:56:27.000Z | 2021-09-26T18:50:44.000Z | #include <binder/Binder.h>
#include <binder/IBinder.h>
#include <binder/IPCThreadState.h>
#include <binder/IServiceManager.h>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <vector>
#include <tuple>
#include <unistd.h>
#include <sys/wait.h>
using namespace std;... | 31.987562 | 137 | 0.562563 | [
"vector"
] |
b79165a43d1272b93a79de077f50d10a5cef5aa2 | 2,925 | hpp | C++ | src/components/VisualCharacter.hpp | KirmesBude/REGoth-bs | 2e13dc3b9005744fccd7cea9c7e7cc1f94809e4a | [
"MIT"
] | 399 | 2019-01-06T17:55:18.000Z | 2022-03-21T17:41:18.000Z | src/components/VisualCharacter.hpp | KirmesBude/REGoth-bs | 2e13dc3b9005744fccd7cea9c7e7cc1f94809e4a | [
"MIT"
] | 101 | 2019-04-18T21:03:53.000Z | 2022-01-08T13:27:01.000Z | src/components/VisualCharacter.hpp | KirmesBude/REGoth-bs | 2e13dc3b9005744fccd7cea9c7e7cc1f94809e4a | [
"MIT"
] | 56 | 2019-04-10T10:18:27.000Z | 2022-02-08T01:23:31.000Z | /** \file
*/
#pragma once
#include "VisualSkeletalAnimation.hpp"
#include <BsPrerequisites.h>
#include <Scene/BsComponent.h>
namespace REGoth
{
class RTTI_VisualCharacter;
class NodeVisuals;
using HNodeVisuals = bs::GameObjectHandle<NodeVisuals>;
/**
* Component for rendering an animated character (Play... | 28.398058 | 83 | 0.629402 | [
"mesh",
"vector",
"model"
] |
b796f7ba787645398695d8bba93909a006f6a932 | 1,203 | cpp | C++ | sources/armory/src/map/tile_mesh.cpp | MadMcCrow/ARMORY | c28b031ef5141ef6cce3c337194752dac5d29383 | [
"MIT"
] | 1 | 2021-01-21T19:43:15.000Z | 2021-01-21T19:43:15.000Z | sources/armory/src/map/tile_mesh.cpp | MadMcCrow/ARMORY | c28b031ef5141ef6cce3c337194752dac5d29383 | [
"MIT"
] | null | null | null | sources/armory/src/map/tile_mesh.cpp | MadMcCrow/ARMORY | c28b031ef5141ef6cce3c337194752dac5d29383 | [
"MIT"
] | null | null | null | /* Copyright © Noé Perard-Gayot 2020. */
/* Licensed under the MIT License. You may obtain a copy of the License at https://opensource.org/licenses/mit-license.php */
#include "map/tile_mesh.h"
using namespace Armory;
void TileMesh::set_height(unsigned int h)
{
height = clamp<unsigned int>(h, 0b00, 0b11);
}
voi... | 32.513514 | 125 | 0.738986 | [
"mesh",
"object"
] |
b7980dd45819869a38a8bda984dec47504e4952b | 1,297 | cpp | C++ | src/RayTracerFacility/MLVQ/MLVQRenderer.cpp | edisonlee0212/RayTracerFacility | 76c1ff6ffd08d84e99eeba32ca2a1783103e2393 | [
"BSD-3-Clause"
] | 1 | 2021-12-16T02:27:00.000Z | 2021-12-16T02:27:00.000Z | src/RayTracerFacility/MLVQ/MLVQRenderer.cpp | edisonlee0212/RayTracerFacility | 76c1ff6ffd08d84e99eeba32ca2a1783103e2393 | [
"BSD-3-Clause"
] | null | null | null | src/RayTracerFacility/MLVQ/MLVQRenderer.cpp | edisonlee0212/RayTracerFacility | 76c1ff6ffd08d84e99eeba32ca2a1783103e2393 | [
"BSD-3-Clause"
] | null | null | null | //
// Created by lllll on 9/3/2021.
//
#include "MLVQRenderer.hpp"
using namespace RayTracerFacility;
#include <Editor.hpp>
#include <MeshRenderer.hpp>
using namespace UniEngine;
const char *MLVQMaterials[]{"None", "alu", "corduroy", "fabric01", "impalla",
"proposte", "pulli", "wallpape... | 27.595745 | 79 | 0.653816 | [
"mesh",
"vector"
] |
b79cd4ee615bbe183f237ae7cb02d5b7fc754d73 | 13,931 | cpp | C++ | branch/old_angsys/angsys_beta2/source/angsys/angsys.shared/source/object.cpp | ChuyX3/angsys | 89b2eaee866bcfd11e66efda49b38acc7468c780 | [
"Apache-2.0"
] | null | null | null | branch/old_angsys/angsys_beta2/source/angsys/angsys.shared/source/object.cpp | ChuyX3/angsys | 89b2eaee866bcfd11e66efda49b38acc7468c780 | [
"Apache-2.0"
] | null | null | null | branch/old_angsys/angsys_beta2/source/angsys/angsys.shared/source/object.cpp | ChuyX3/angsys | 89b2eaee866bcfd11e66efda49b38acc7468c780 | [
"Apache-2.0"
] | null | null | null | #include "pch.h"
#include <angsys.hpp>
#include <ang/streams.hpp>
using namespace ang;
ANG_IMPLEMENT_INTERFACE(ang, iobject);
ANG_IMPLEMENT_ENUM(ang, comparision_result, int, comparision_result::diferent);
ang::type_name_t interface_t::class_name() { return "interface"; }
bool interface_t::is_inherited_of(type_name_... | 22.875205 | 142 | 0.715024 | [
"object"
] |
b79f3245b7d039a35297e2e5a671b7186da3052b | 2,195 | cpp | C++ | compiler/parser/ast/pattern.cpp | matthewha123/seq | a1f9dc683483cf76b5e75d77cbcdb5350d049c38 | [
"Apache-2.0"
] | null | null | null | compiler/parser/ast/pattern.cpp | matthewha123/seq | a1f9dc683483cf76b5e75d77cbcdb5350d049c38 | [
"Apache-2.0"
] | null | null | null | compiler/parser/ast/pattern.cpp | matthewha123/seq | a1f9dc683483cf76b5e75d77cbcdb5350d049c38 | [
"Apache-2.0"
] | null | null | null | #include <memory>
#include <ostream>
#include <string>
#include <tuple>
#include <vector>
#include "util/fmt/format.h"
#include "util/fmt/ostream.h"
#include "parser/ast/pattern.h"
#include "parser/common.h"
using fmt::format;
using std::move;
using std::ostream;
using std::string;
using std::tuple;
using std::uniqu... | 27.098765 | 80 | 0.679727 | [
"vector"
] |
b7a0bd3929bf80a169f0b3732ece45d5d88a7592 | 1,092 | cpp | C++ | src/longestCommonPrefix.cpp | guitargeek/leetcode | 7d587774d3f922020b5ba3ca2d533b2686891fed | [
"MIT"
] | null | null | null | src/longestCommonPrefix.cpp | guitargeek/leetcode | 7d587774d3f922020b5ba3ca2d533b2686891fed | [
"MIT"
] | null | null | null | src/longestCommonPrefix.cpp | guitargeek/leetcode | 7d587774d3f922020b5ba3ca2d533b2686891fed | [
"MIT"
] | null | null | null | /**
14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string "".
Example 1:
```
Input: ["flower","flow","flight"]
Output: "fl"
```
Example 2:
```
Input: ["dog","racecar","car"]
Output: ""
Explanation: The... | 17.901639 | 86 | 0.501832 | [
"vector"
] |
b7a29f28dd9b3b617de371601717158354ddc3db | 32,989 | cpp | C++ | src/prod/src/httpgateway/SecretsResourceHandler.cpp | gridgentoo/ServiceFabricAzure | c3e7a07617e852322d73e6cc9819d266146866a4 | [
"MIT"
] | 2,542 | 2018-03-14T21:56:12.000Z | 2019-05-06T01:18:20.000Z | src/prod/src/httpgateway/SecretsResourceHandler.cpp | gridgentoo/ServiceFabricAzure | c3e7a07617e852322d73e6cc9819d266146866a4 | [
"MIT"
] | 994 | 2019-05-07T02:39:30.000Z | 2022-03-31T13:23:04.000Z | src/prod/src/httpgateway/SecretsResourceHandler.cpp | gridgentoo/ServiceFabricAzure | c3e7a07617e852322d73e6cc9819d266146866a4 | [
"MIT"
] | 300 | 2018-03-14T21:57:17.000Z | 2019-05-06T20:07:00.000Z | // ------------------------------------------------------------
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License (MIT). See License.txt in the repo root for license information.
// ------------------------------------------------------------
#include "stdafx.h"
using nam... | 34.363542 | 151 | 0.694383 | [
"object",
"vector",
"transform"
] |
b7aa2c1ff132e45548611d3308c3b4aa5a9d3633 | 1,664 | cpp | C++ | Moist-InsertionSort/moist.cpp | xfrings/CodeMonkey | e0176ffe0c588aad72a47cd872ea487e3f5fbd45 | [
"AAL"
] | null | null | null | Moist-InsertionSort/moist.cpp | xfrings/CodeMonkey | e0176ffe0c588aad72a47cd872ea487e3f5fbd45 | [
"AAL"
] | null | null | null | Moist-InsertionSort/moist.cpp | xfrings/CodeMonkey | e0176ffe0c588aad72a47cd872ea487e3f5fbd45 | [
"AAL"
] | null | null | null | #include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <queue>
#include <climits>
#include <iterator>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main()
{
ifstream infile;
infile.open("test.in");
ofstream outfile;
outfile.open("test.out");
... | 20.54321 | 64 | 0.447716 | [
"vector"
] |
b7ac545c9aa0a6459ae4146da02e4f0a39bda4e3 | 1,587 | hpp | C++ | include/gui/status_bar.hpp | lucckb/telesecure | 9da299c29551d8abdba244458a0f894a9cc89b19 | [
"BSD-3-Clause"
] | 1 | 2020-03-22T17:06:43.000Z | 2020-03-22T17:06:43.000Z | include/gui/status_bar.hpp | lucckb/telesecure | 9da299c29551d8abdba244458a0f894a9cc89b19 | [
"BSD-3-Clause"
] | null | null | null | include/gui/status_bar.hpp | lucckb/telesecure | 9da299c29551d8abdba244458a0f894a9cc89b19 | [
"BSD-3-Clause"
] | null | null | null | #pragma once
#include "window.hpp"
#include <string>
#include <map>
#include <input/Console.hpp>
namespace gui {
class status_bar final: public window
{
public:
using id_t = int;
private:
struct item {
item(std::string_view _username, bool _online, bool _newmsg )
... | 30.519231 | 75 | 0.550725 | [
"object"
] |
b7ae40188022434876391d03d4737af92ee821e4 | 4,600 | cc | C++ | tests/t_geo_test.cc | karelrooted/kvrocks | 973d693f9f444f89f2847a07b414989154122de2 | [
"BSD-3-Clause"
] | 672 | 2021-06-15T11:40:33.000Z | 2022-03-29T08:33:48.000Z | tests/t_geo_test.cc | karelrooted/kvrocks | 973d693f9f444f89f2847a07b414989154122de2 | [
"BSD-3-Clause"
] | 140 | 2021-06-16T10:48:32.000Z | 2022-03-31T09:28:48.000Z | tests/t_geo_test.cc | karelrooted/kvrocks | 973d693f9f444f89f2847a07b414989154122de2 | [
"BSD-3-Clause"
] | 93 | 2021-06-15T12:53:24.000Z | 2022-03-30T13:35:39.000Z | #include <gtest/gtest.h>
#include <math.h>
#include "test_base.h"
#include "redis_geo.h"
class RedisGeoTest : public TestBase {
protected:
RedisGeoTest() : TestBase() {
geo = new Redis::Geo(storage_, "geo_ns"
);
}
~RedisGeoTest() {
delete geo;
}
void SetUp() {
key_ = "test_geo_key";
fiel... | 32.857143 | 108 | 0.62587 | [
"vector"
] |
5d9d87169ef2536b0dbd8caf01b170a2555f72c5 | 4,390 | cpp | C++ | life_gpu/quadsprite.cpp | Kvazikot/python_vfx | 3b02d0aaaef542cdae33856023da4b88cbe54cf2 | [
"MIT"
] | null | null | null | life_gpu/quadsprite.cpp | Kvazikot/python_vfx | 3b02d0aaaef542cdae33856023da4b88cbe54cf2 | [
"MIT"
] | null | null | null | life_gpu/quadsprite.cpp | Kvazikot/python_vfx | 3b02d0aaaef542cdae33856023da4b88cbe54cf2 | [
"MIT"
] | null | null | null | /****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the QtCore module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:BSD$
** You may use this file under the terms ... | 34.031008 | 109 | 0.677904 | [
"geometry"
] |
5da7ea09494f5c56c6fe7d6123bdc53d938ff9ef | 4,892 | cpp | C++ | corelib/src/camera/CameraVideo.cpp | Troy9527/rtabmap | 4c58e525339f8428e93705dbe99a396b837c5cbf | [
"BSD-3-Clause"
] | 2 | 2020-02-02T07:35:46.000Z | 2020-04-20T17:02:55.000Z | corelib/src/camera/CameraVideo.cpp | Troy9527/rtabmap | 4c58e525339f8428e93705dbe99a396b837c5cbf | [
"BSD-3-Clause"
] | 1 | 2019-05-28T09:57:11.000Z | 2019-05-28T09:57:11.000Z | corelib/src/camera/CameraVideo.cpp | Troy9527/rtabmap | 4c58e525339f8428e93705dbe99a396b837c5cbf | [
"BSD-3-Clause"
] | null | null | null | /*
Copyright (c) 2010-2016, Mathieu Labbe - IntRoLab - Universite de Sherbrooke
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
... | 27.027624 | 108 | 0.688675 | [
"object",
"model",
"transform"
] |
5dab7aecb0b0d9e46af3d0d4988c1a12d5807e2b | 1,781 | cpp | C++ | homework/Adamenko/08/myvector/myvector/main.cpp | mtrempoltsev/msu_cpp_autumn_2017 | 0e87491dc117670b99d2ca2f7e1c5efbc425ae1c | [
"MIT"
] | 10 | 2017-09-21T15:17:33.000Z | 2021-01-11T13:11:55.000Z | homework/Adamenko/08/myvector/myvector/main.cpp | mtrempoltsev/msu_cpp_autumn_2017 | 0e87491dc117670b99d2ca2f7e1c5efbc425ae1c | [
"MIT"
] | null | null | null | homework/Adamenko/08/myvector/myvector/main.cpp | mtrempoltsev/msu_cpp_autumn_2017 | 0e87491dc117670b99d2ca2f7e1c5efbc425ae1c | [
"MIT"
] | 22 | 2017-09-21T15:45:08.000Z | 2019-02-21T19:15:25.000Z | # include "vector.h"
#include <iostream>
//Практическая работа
//
//Написать свой контейнер Vector аналогичный std::vector и итератор для него.
//Из поддерживаемых методов достаточно
//operator[] # Get element
//push_back # Put at the end
//pop_back # Pop last element
//empty # Is vector empty?
//size ... | 25.811594 | 77 | 0.436272 | [
"vector"
] |
5dabb5e52868a64a92c868a88eee9225689cc905 | 8,659 | hpp | C++ | src/tables/format.hpp | steinwurf/tables | fd6fa3a4dc7949621ca4e33ee8d3a63a08100d64 | [
"BSD-3-Clause"
] | 3 | 2017-12-09T20:49:43.000Z | 2020-06-27T23:25:04.000Z | src/tables/format.hpp | steinwurf/tables | fd6fa3a4dc7949621ca4e33ee8d3a63a08100d64 | [
"BSD-3-Clause"
] | 3 | 2015-04-11T01:26:23.000Z | 2015-05-26T19:01:23.000Z | src/tables/format.hpp | steinwurf/tables | fd6fa3a4dc7949621ca4e33ee8d3a63a08100d64 | [
"BSD-3-Clause"
] | 4 | 2015-05-06T06:16:51.000Z | 2020-05-13T01:22:58.000Z | // Copyright (c) 2014 Steinwurf ApS
// All Rights Reserved
//
// Distributed under the "BSD License". See the accompanying LICENSE.rst file.
#pragma once
#include <cassert>
#include <cstdint>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
#include <boost/any.hpp>
#include "table.hpp"
n... | 27.753205 | 78 | 0.53505 | [
"vector"
] |
5dacafabb8b916dc3281545087e5be2ba702795a | 6,909 | hxx | C++ | main/framework/inc/uielement/toolbarsmenucontroller.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/framework/inc/uielement/toolbarsmenucontroller.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/framework/inc/uielement/toolbarsmenucontroller.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... | 56.631148 | 245 | 0.643508 | [
"vector"
] |
5db32a3824688c11befe82ed1c7921e27cdaf392 | 14,705 | cxx | C++ | Projects/device_shapehand/device_shapehand_layout.cxx | Neill3d/MoPlugs | 84efea03e045f820f3dc132c1a60a779fc5e34fc | [
"BSD-3-Clause"
] | 23 | 2017-10-20T07:01:18.000Z | 2022-02-25T08:46:07.000Z | Projects/device_shapehand/device_shapehand_layout.cxx | droidoid/MoPlugs | fce52e6469408e32e94af8ac8a303840bc956e53 | [
"BSD-3-Clause"
] | 1 | 2019-11-08T04:03:38.000Z | 2019-11-10T10:16:00.000Z | Projects/device_shapehand/device_shapehand_layout.cxx | droidoid/MoPlugs | fce52e6469408e32e94af8ac8a303840bc956e53 | [
"BSD-3-Clause"
] | 5 | 2017-12-03T20:43:27.000Z | 2020-01-22T16:54:13.000Z |
//////////////////////////////////////////////////////////////////////////////////////////////////
//
// file: device_shapehand_layout.cpp
//
// Author Sergey Solokhin (Neill3d)
//
//
// GitHub page - https://github.com/Neill3d/MoPlugs
// Licensed under BSD 3-Clause - https://github.com/Neill3d/MoPlugs/blob/master/LIC... | 32.970852 | 110 | 0.600884 | [
"model"
] |
5db3c8a860fa5d9de77b668dcdbcc24e37cc0bcd | 905 | cpp | C++ | src/ITCGetChannelConfig2.cpp | AllenInstitute/ITCXOP2 | 3979557f487c3e7d54b515ea0e0c384322034892 | [
"BSD-3-Clause"
] | 1 | 2019-09-29T22:36:52.000Z | 2019-09-29T22:36:52.000Z | src/ITCGetChannelConfig2.cpp | AllenInstitute/ITCXOP2 | 3979557f487c3e7d54b515ea0e0c384322034892 | [
"BSD-3-Clause"
] | 4 | 2018-09-06T15:59:59.000Z | 2021-11-04T12:12:31.000Z | src/ITCGetChannelConfig2.cpp | AllenInstitute/ITCXOP2 | 3979557f487c3e7d54b515ea0e0c384322034892 | [
"BSD-3-Clause"
] | 2 | 2017-10-30T19:11:30.000Z | 2017-12-17T00:09:39.000Z | #include "ITC_StandardHeaders.h"
// This file is part of the `ITCXOP2` project and licensed under BSD-3-Clause.
// Operation template: ITCGetChannelConfig2/Z[=number:displayErrors]
// /DEV=number:deviceID/CHN=number:channelTypeNumeric/CHS=string:channelTypeString/O/FREE
// number:channelNumber, DataFolderAndName:{des... | 31.206897 | 89 | 0.78895 | [
"vector"
] |
5db44d08d619d6884f126f0093bb37fe71f772a8 | 17,205 | cpp | C++ | src/XMODULE.cpp | cse-sim/cse | ebe460ef8f38442424fe5a145ba51e34ef1d4639 | [
"BSD-3-Clause"
] | 13 | 2016-01-11T18:34:03.000Z | 2021-12-21T03:10:49.000Z | src/XMODULE.cpp | cse-sim/cse | ebe460ef8f38442424fe5a145ba51e34ef1d4639 | [
"BSD-3-Clause"
] | 90 | 2016-09-23T15:22:23.000Z | 2022-03-31T22:57:23.000Z | src/XMODULE.cpp | cse-sim/cse | ebe460ef8f38442424fe5a145ba51e34ef1d4639 | [
"BSD-3-Clause"
] | 5 | 2016-09-16T21:30:55.000Z | 2020-03-03T20:22:13.000Z | // Copyright (c) 1997-2019 The CSE Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license
// that can be found in the LICENSE file.
///////////////////////////////////////////////////////////////////////////////
// xmodule.cpp -- interface to external DLL/EXE functions
////////////... | 34.89858 | 156 | 0.548794 | [
"object",
"model"
] |
5db74c31c2802a00fef6c477d0fc60a4c96df72c | 7,087 | cpp | C++ | Intermediate/Build/Win64/UE4Editor/Inc/Coop_Game_Prototype/SCharacter.gen.cpp | Zvie/Coop_Game_Prototype | 47d0bd9c224efee48e7f821a64f0d26acdd7a232 | [
"MIT"
] | null | null | null | Intermediate/Build/Win64/UE4Editor/Inc/Coop_Game_Prototype/SCharacter.gen.cpp | Zvie/Coop_Game_Prototype | 47d0bd9c224efee48e7f821a64f0d26acdd7a232 | [
"MIT"
] | null | null | null | Intermediate/Build/Win64/UE4Editor/Inc/Coop_Game_Prototype/SCharacter.gen.cpp | Zvie/Coop_Game_Prototype | 47d0bd9c224efee48e7f821a64f0d26acdd7a232 | [
"MIT"
] | null | null | null | // Copyright 1998-2018 Epic Games, Inc. All Rights Reserved.
/*===========================================================================
Generated code exported from UnrealHeaderTool.
DO NOT modify this manually! Edit the corresponding .h files instead!
==============================================================... | 55.80315 | 445 | 0.783124 | [
"object"
] |
5dbfba2ee80f95d9d7765046c59dc4d416efaf76 | 976 | cpp | C++ | src/Method.cpp | Fahien/pyspot | 69a6fc817cdcf9101940025850d647567f5efe3e | [
"MIT"
] | 2 | 2018-01-09T13:06:25.000Z | 2018-02-12T10:05:26.000Z | src/Method.cpp | Fahien/pyspot | 69a6fc817cdcf9101940025850d647567f5efe3e | [
"MIT"
] | null | null | null | src/Method.cpp | Fahien/pyspot | 69a6fc817cdcf9101940025850d647567f5efe3e | [
"MIT"
] | null | null | null | #include "pyspot/Method.h"
#include <cstdio>
#include <string>
#include "pyspot/Exception.h"
#include "pyspot/Module.h"
namespace pyspot
{
Method::Method( const Module& module, const std::string& n )
: Object{ PyObject_GetAttrString( module.GetObject(), n.c_str() ) }, name{ n }
{
if ( !object || !P... | 24.4 | 107 | 0.634221 | [
"object"
] |
5dc33d3ad517e5e6d480fb76f4313a3cfbaf229d | 29,511 | cxx | C++ | osprey/ipa/main/analyze/ipa_pcg.cxx | sharugupta/OpenUH | daddd76858a53035f5d713f648d13373c22506e8 | [
"BSD-2-Clause"
] | null | null | null | osprey/ipa/main/analyze/ipa_pcg.cxx | sharugupta/OpenUH | daddd76858a53035f5d713f648d13373c22506e8 | [
"BSD-2-Clause"
] | null | null | null | osprey/ipa/main/analyze/ipa_pcg.cxx | sharugupta/OpenUH | daddd76858a53035f5d713f648d13373c22506e8 | [
"BSD-2-Clause"
] | null | null | null | // ====================================================================
//
// Copyright (C) 2011, Hewlett-Packard Development Company, L.P.
// All Rights Reserved.
//
// Open64 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 Sof... | 30.77268 | 89 | 0.694656 | [
"vector"
] |
5dcc2196954546808964ce23ba46317430af5d69 | 25,563 | cpp | C++ | syntax_analyzer/context_free_grammar/cfg.cpp | yakout/compiler | dacf182d9dd1a8198fe01eeb303838f00a1e8a3b | [
"MIT"
] | 15 | 2018-05-15T04:46:00.000Z | 2021-09-16T21:47:46.000Z | syntax_analyzer/context_free_grammar/cfg.cpp | yakout/compiler | dacf182d9dd1a8198fe01eeb303838f00a1e8a3b | [
"MIT"
] | 16 | 2018-12-09T22:57:58.000Z | 2018-12-09T22:58:00.000Z | syntax_analyzer/context_free_grammar/cfg.cpp | yakout/compiler | dacf182d9dd1a8198fe01eeb303838f00a1e8a3b | [
"MIT"
] | 3 | 2019-04-07T16:12:13.000Z | 2021-09-13T02:50:00.000Z | #include "cfg.h"
#include <fstream>
#include <utility>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <map>
// *********************** UTILITIES *****************************
struct rule_holder {
std::string lhs_symbol_name;
std::vector <std::vector <std::string>> prod... | 36.208215 | 144 | 0.567813 | [
"vector"
] |
5dcc85cc23ecfef7caee3697da4ff8ebcb9a73f8 | 11,928 | cpp | C++ | Src/Engine_Interface/UIListBox.cpp | dingpong/Old-GameEngine-BaseProject | a04d634dcfe04300525198b26d167603299bd4ac | [
"MIT"
] | null | null | null | Src/Engine_Interface/UIListBox.cpp | dingpong/Old-GameEngine-BaseProject | a04d634dcfe04300525198b26d167603299bd4ac | [
"MIT"
] | null | null | null | Src/Engine_Interface/UIListBox.cpp | dingpong/Old-GameEngine-BaseProject | a04d634dcfe04300525198b26d167603299bd4ac | [
"MIT"
] | null | null | null |
#include "StdAfx.h"
#include "UIDialog.h"
#include "UIListBox.h"
//--------------------------------------------------------------------------------------
// cUIListBox class
//--------------------------------------------------------------------------------------
cUIListBox::cUIListBox( cUIDialog *pDialog ) : m_Scrol... | 26.506667 | 132 | 0.667505 | [
"render"
] |
5dcfe74fe15f06ce4e1ccdeca898049e68e7f015 | 16,182 | hpp | C++ | include/ghex/structured/regular/make_pattern.hpp | tehrengruber/GHEX | f164bb625aaa106f77d31d45fce05c4711b066f0 | [
"BSD-3-Clause"
] | null | null | null | include/ghex/structured/regular/make_pattern.hpp | tehrengruber/GHEX | f164bb625aaa106f77d31d45fce05c4711b066f0 | [
"BSD-3-Clause"
] | null | null | null | include/ghex/structured/regular/make_pattern.hpp | tehrengruber/GHEX | f164bb625aaa106f77d31d45fce05c4711b066f0 | [
"BSD-3-Clause"
] | null | null | null | /*
* GridTools
*
* Copyright (c) 2014-2020, ETH Zurich
* All rights reserved.
*
* Please, refer to the LICENSE file in the root directory.
* SPDX-License-Identifier: BSD-3-Clause
*
*/
#ifndef INCLUDED_GHEX_STRUCTURED_REGULAR_MAKE_PATTERN_HPP
#define INCLUDED_GHEX_STRUCTURED_REGULAR_MAKE_PATTERN_HPP
#include<a... | 46.634006 | 119 | 0.574033 | [
"vector"
] |
5dd029ce2d5b6f6f92076c0beacc66a91e4a0152 | 10,657 | cpp | C++ | SystemExplorer/COMView.cpp | hugmyndakassi/SystemExplorer | ea0036c9c274c06d2df44677e0ae5581796fcac8 | [
"MIT"
] | 387 | 2018-01-23T11:07:54.000Z | 2022-03-31T16:55:43.000Z | SystemExplorer/COMView.cpp | hugmyndakassi/SystemExplorer | ea0036c9c274c06d2df44677e0ae5581796fcac8 | [
"MIT"
] | 6 | 2018-07-03T18:21:04.000Z | 2022-02-21T07:53:11.000Z | SystemExplorer/COMView.cpp | hugmyndakassi/SystemExplorer | ea0036c9c274c06d2df44677e0ae5581796fcac8 | [
"MIT"
] | 70 | 2018-01-23T11:10:20.000Z | 2022-03-28T07:14:58.000Z | #include "pch.h"
#include "COMView.h"
#include "SortHelper.h"
#include <algorithm>
#include "resource.h"
using namespace WinSys;
CComView::CComView(IMainFrame* frame) : CViewBase(frame) {
}
DWORD CComView::OnPrePaint(int, LPNMCUSTOMDRAW cd) {
m_hFont = (HFONT)::GetCurrentObject(cd->hdc, OBJ_FONT);
return CDRF_NOT... | 31.344118 | 140 | 0.728535 | [
"model"
] |
5dd69ed4410b7fd46e538dcbb8fcd8988f056069 | 1,832 | cc | C++ | modules/ugdk-core/src/action/scene.cc | uspgamedev/ugdk | 95885a70df282a8e8e6e5c72b28a7f2f21bf7e99 | [
"Zlib"
] | 11 | 2015-03-06T13:14:32.000Z | 2020-06-09T23:34:28.000Z | modules/ugdk-core/src/action/scene.cc | uspgamedev/ugdk | 95885a70df282a8e8e6e5c72b28a7f2f21bf7e99 | [
"Zlib"
] | 62 | 2015-01-04T05:47:40.000Z | 2018-06-15T17:00:25.000Z | modules/ugdk-core/src/action/scene.cc | uspgamedev/ugdk | 95885a70df282a8e8e6e5c72b28a7f2f21bf7e99 | [
"Zlib"
] | 2 | 2017-04-05T20:35:49.000Z | 2017-07-30T03:44:02.000Z | #include <ugdk/action/scene.h>
#include <ugdk/action/events.h>
#include <ugdk/audio/module.h>
#include <ugdk/audio/music.h>
#include <ugdk/debug/profiler.h>
#include <ugdk/desktop/module.h>
#include <algorithm>
#include <vector>
namespace ugdk {
namespace action {
using std::list;
Scene::Scene()
: active_(true)... | 22.617284 | 86 | 0.64738 | [
"render",
"vector"
] |
5dd74a890c1ac69546134699f3460b263435cd68 | 46,180 | cpp | C++ | Project/RSA_Algorithms.cpp | elie-wanko/RSA-in-Optical-Networks | a23e4525b865826aca8e2d5b6ce55d7b3fc20528 | [
"MIT"
] | null | null | null | Project/RSA_Algorithms.cpp | elie-wanko/RSA-in-Optical-Networks | a23e4525b865826aca8e2d5b6ce55d7b3fc20528 | [
"MIT"
] | null | null | null | Project/RSA_Algorithms.cpp | elie-wanko/RSA-in-Optical-Networks | a23e4525b865826aca8e2d5b6ce55d7b3fc20528 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstdlib>
#include <vector>
#include <set>
#include <tuple>
#include "Vertex.hpp"
#include "Edge.hpp"
#include "Arc.hpp"
#include "Path.hpp"
#include "Graph.hpp"
#include "Demand.hpp"
#include "Clique.hpp"
#include "RSA_Input.hpp"
#in... | 39.268707 | 192 | 0.559095 | [
"vector",
"model"
] |
5dded224d30d27259e51f246f50c6cc48b2ff341 | 835 | cpp | C++ | answers/leetcode/Minimum Path Sum/Minimum Path Sum.cpp | FeiZhan/Algo-Collection | 708c4a38112e0b381864809788b9e44ac5ae4d05 | [
"MIT"
] | 3 | 2015-09-04T21:32:31.000Z | 2020-12-06T00:37:32.000Z | answers/leetcode/Minimum Path Sum/Minimum Path Sum.cpp | FeiZhan/Algo-Collection | 708c4a38112e0b381864809788b9e44ac5ae4d05 | [
"MIT"
] | null | null | null | answers/leetcode/Minimum Path Sum/Minimum Path Sum.cpp | FeiZhan/Algo-Collection | 708c4a38112e0b381864809788b9e44ac5ae4d05 | [
"MIT"
] | null | null | null | // 2014-04-22 AC clearer version
//@result 61 / 61 test cases passed. Status: Accepted Runtime: 32 ms Submitted: 1 minute ago You are here! Your runtime beats 11.17% of cpp submissions.
class Solution {
public:
int minPathSum(vector<vector<int> > &grid) {
if (0 == grid.size())
{
return 0;
}
vector<vector<i... | 25.30303 | 152 | 0.517365 | [
"vector"
] |
5de03f83b6c00267adc8409a5a39cf2061755b8a | 4,943 | cpp | C++ | source/system/GameDialog.cpp | Leinnan/carpg | ff484f094abe381b0deec3c52ef33725f765ff1f | [
"MIT"
] | 19 | 2015-05-30T12:14:07.000Z | 2021-05-26T19:17:21.000Z | source/system/GameDialog.cpp | Leinnan/carpg | ff484f094abe381b0deec3c52ef33725f765ff1f | [
"MIT"
] | 402 | 2016-02-26T08:39:21.000Z | 2021-07-06T16:47:16.000Z | source/system/GameDialog.cpp | Leinnan/carpg | ff484f094abe381b0deec3c52ef33725f765ff1f | [
"MIT"
] | 21 | 2015-07-28T14:11:39.000Z | 2020-12-11T07:54:09.000Z | #include "Pch.h"
#include "GameDialog.h"
#include "ScriptManager.h"
#include <angelscript.h>
GameDialog::Map GameDialog::dialogs;
DialogScripts DialogScripts::global;
//=================================================================================================
int DialogScripts::AddCode(FUNC f, const string& ... | 23.098131 | 99 | 0.487154 | [
"vector"
] |
5de4855da23fe97f1636dc32f13e1efa5d7699b9 | 2,075 | cpp | C++ | dali/tensor/op/reshape.cpp | bzcheeseman/Dali | a77c7ce60b20ce150a5927747e128688657907eb | [
"MIT"
] | null | null | null | dali/tensor/op/reshape.cpp | bzcheeseman/Dali | a77c7ce60b20ce150a5927747e128688657907eb | [
"MIT"
] | null | null | null | dali/tensor/op/reshape.cpp | bzcheeseman/Dali | a77c7ce60b20ce150a5927747e128688657907eb | [
"MIT"
] | null | null | null | #include "reshape.h"
#include "dali/tensor/tape.h"
#include "dali/array/op/concatenate.h"
#include "dali/tensor/tensor_macros.h"
namespace tensor_ops {
// Join a sequence of arrays along an existing axis.
Tensor concatenate(const std::vector<Tensor>& tensors, int axis) {
// if concatenating a single te... | 31.923077 | 72 | 0.538313 | [
"shape",
"vector"
] |
5de76f6a68a1ed4b8421b29bb2f55c8ac9e76fc4 | 1,289 | cc | C++ | topside/qgc/src/FactSystem/FactMetaData.cc | slicht-uri/Sandshark-Beta-Lab- | 6cff36b227b49b776d13187c307e648d2a52bdae | [
"MIT"
] | null | null | null | topside/qgc/src/FactSystem/FactMetaData.cc | slicht-uri/Sandshark-Beta-Lab- | 6cff36b227b49b776d13187c307e648d2a52bdae | [
"MIT"
] | null | null | null | topside/qgc/src/FactSystem/FactMetaData.cc | slicht-uri/Sandshark-Beta-Lab- | 6cff36b227b49b776d13187c307e648d2a52bdae | [
"MIT"
] | 1 | 2019-10-18T06:25:14.000Z | 2019-10-18T06:25:14.000Z | /*=====================================================================
QGroundControl Open Source Ground Control Station
(c) 2009 - 2014 QGROUNDCONTROL PROJECT <http://www.qgroundcontrol.org>
This file is part of the QGROUNDCONTROL project
QGROUNDCONTROL is free software: you can redistribute it and/or mod... | 31.439024 | 73 | 0.671063 | [
"object"
] |
5de88f5ec772ba802f6452ada752724909b5ea69 | 823 | cpp | C++ | Chapter08/Exercises/Ex12.cpp | 9ndres/PPP-using-cpp-2ed | 2de1f69800403121fb37604c9f82c98371ccb02a | [
"MIT"
] | null | null | null | Chapter08/Exercises/Ex12.cpp | 9ndres/PPP-using-cpp-2ed | 2de1f69800403121fb37604c9f82c98371ccb02a | [
"MIT"
] | null | null | null | Chapter08/Exercises/Ex12.cpp | 9ndres/PPP-using-cpp-2ed | 2de1f69800403121fb37604c9f82c98371ccb02a | [
"MIT"
] | null | null | null | // 07/28/2021
// Purpose: Prints a vector of strings until a determined string "s"
// appears.
#include <iostream>
#include <vector>
#include <string>
#include <algorithm> // std::count
using std::vector;
using std::string;
void printUntilS(const vector<string>& v,const string& quit) {
for (const auto& s : v) {
... | 23.514286 | 79 | 0.534629 | [
"vector"
] |
5defbe2bf6b669389134be322f9119a9f1981aac | 640 | cpp | C++ | [137] Single Number II/137.single-number-ii.cpp | Coolzyh/Leetcode | 4abf685501427be0ce36b83016c4fa774cdf1a1a | [
"MIT"
] | null | null | null | [137] Single Number II/137.single-number-ii.cpp | Coolzyh/Leetcode | 4abf685501427be0ce36b83016c4fa774cdf1a1a | [
"MIT"
] | null | null | null | [137] Single Number II/137.single-number-ii.cpp | Coolzyh/Leetcode | 4abf685501427be0ce36b83016c4fa774cdf1a1a | [
"MIT"
] | null | null | null | /*
* @lc app=leetcode id=137 lang=cpp
*
* [137] Single Number II
*/
// @lc code=start
class Solution {
public:
int singleNumber(vector<int>& nums) {
// https://leetcode.com/problems/single-number-ii/discuss/43295/Detailed-explanation-and-generalization-of-the-bitwise-operation-method-for-single-numbers... | 22.857143 | 162 | 0.542188 | [
"vector"
] |
5df75bbcf81ee63551a4ac6b8a7f0ddd5bd16345 | 3,528 | hpp | C++ | include/Console.hpp | fossabot/blame | 71d62b11768e26c4848f790de0ae4d6d8a2ba5ff | [
"BSD-3-Clause"
] | 14 | 2019-01-15T18:17:30.000Z | 2021-11-05T19:44:26.000Z | include/Console.hpp | fossabot/blame | 71d62b11768e26c4848f790de0ae4d6d8a2ba5ff | [
"BSD-3-Clause"
] | 10 | 2019-01-06T11:19:06.000Z | 2021-04-20T23:17:16.000Z | include/Console.hpp | chocorho/blame | 3f05bbf915d1993a667029e90cd9fdaea2f48c09 | [
"BSD-3-Clause"
] | 3 | 2019-01-06T03:54:12.000Z | 2021-04-09T04:13:54.000Z | #pragma once
#include <sstream>
#include <vector>
#include <string>
#include <atomic>
#include <iostream>
#include <thread>
#include <algorithm>
#include <termios.h>
#include <widgets/Listener.hpp>
#include <util/Area.hpp>
#include <util/EscapeCodes.hpp>
namespace Blame {
class Console {
public:
Cons... | 28.224 | 105 | 0.493481 | [
"vector"
] |
5df988e1dc8093b6324d24a1cec9075e007a73b3 | 1,650 | cpp | C++ | jrex/src/SplashScreen.cpp | ronanlv/gba-sprite-engine | 863547eedd11439d57d2320d872788b865dd5a8e | [
"MIT"
] | null | null | null | jrex/src/SplashScreen.cpp | ronanlv/gba-sprite-engine | 863547eedd11439d57d2320d872788b865dd5a8e | [
"MIT"
] | null | null | null | jrex/src/SplashScreen.cpp | ronanlv/gba-sprite-engine | 863547eedd11439d57d2320d872788b865dd5a8e | [
"MIT"
] | null | null | null | // Created by Ronan Van Der Veken (@ronanlv/@rlv)
#include <libgba-sprite-engine/gba/tonc_memdef.h>
#include <libgba-sprite-engine/effects/fade_out_scene.h>
#include "../h/SplashScreen.hpp"
#include "../h/DesertScene.hpp"
#include "../h/CastleScene.hpp"
#include "../h/assets/SplashScreen.h"
#include "../h/assets/spla... | 31.730769 | 144 | 0.722424 | [
"vector"
] |
5dfba6d72057b5440aca058297635f3355b54658 | 1,461 | cc | C++ | python/src/kontiki/sensors/py_atan_camera.cc | copark86/kontiki | 431349f9500c6ee954bc46c0643f49281163a7f3 | [
"MIT"
] | 94 | 2018-06-19T05:59:27.000Z | 2022-03-31T03:25:29.000Z | python/src/kontiki/sensors/py_atan_camera.cc | copark86/kontiki | 431349f9500c6ee954bc46c0643f49281163a7f3 | [
"MIT"
] | 3 | 2019-10-23T06:52:50.000Z | 2020-09-01T15:27:11.000Z | python/src/kontiki/sensors/py_atan_camera.cc | hovren/kontiki | 4c44edb7ef041c6abd549e1fe66fe3e9ca255399 | [
"MIT"
] | 31 | 2018-06-24T12:10:08.000Z | 2022-03-13T18:34:13.000Z | #include <pybind11/pybind11.h>
#include <pybind11/eigen.h>
#include <Eigen/Dense>
#include "camera_help.h"
#include "kontiki/sensors/atan_camera.h"
namespace py = pybind11;
namespace C = kontiki::sensors;
PYBIND11_MODULE(_atan_camera, m) {
// py::module::import("kontiki.sensors._pinhole_camera");
using Class =... | 32.466667 | 107 | 0.71321 | [
"model"
] |
b9027a00d6b7808a361fc7adf41cf467b6d177d7 | 523 | cpp | C++ | src/AND.cpp | sphan007/cs100 | 13cfbb0fbbd6f75bde512276f80dbaabdbbf0e05 | [
"BSD-3-Clause"
] | null | null | null | src/AND.cpp | sphan007/cs100 | 13cfbb0fbbd6f75bde512276f80dbaabdbbf0e05 | [
"BSD-3-Clause"
] | null | null | null | src/AND.cpp | sphan007/cs100 | 13cfbb0fbbd6f75bde512276f80dbaabdbbf0e05 | [
"BSD-3-Clause"
] | null | null | null | #include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include "Connector.h"
#include "AND.h"
using namespace std;
AND::AND() : Connector() {}
void AND::run(vector<string> &commands) {
string ext = "exit";
if(commands.front() == "&&") { //check for previous
commands.erase... | 18.678571 | 57 | 0.642447 | [
"vector"
] |
b903411d79a62fc9df5e0752ca752cd6be261046 | 5,484 | cpp | C++ | src/symmatrix.cpp | Ixhel/Algebra | a42a9a2d48237ab00febddbffc4a35b7e7e5fee8 | [
"MIT"
] | null | null | null | src/symmatrix.cpp | Ixhel/Algebra | a42a9a2d48237ab00febddbffc4a35b7e7e5fee8 | [
"MIT"
] | null | null | null | src/symmatrix.cpp | Ixhel/Algebra | a42a9a2d48237ab00febddbffc4a35b7e7e5fee8 | [
"MIT"
] | null | null | null | /*
SymbolicC++ : An object oriented computer algebra system written in C++
Copyright (C) 2008 Yorick Hardy and Willi-Hans Steeb
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; ei... | 25.506977 | 78 | 0.622356 | [
"object"
] |
b9067b59cd88230dbce52bbf14b45632cb29f34e | 1,162 | cpp | C++ | 1629 slowest key/slowest_key.cpp | JawadAsifBD/leetcode | 15c3bd0363f2a0bf2956fec38c095a955ca6c000 | [
"MIT"
] | null | null | null | 1629 slowest key/slowest_key.cpp | JawadAsifBD/leetcode | 15c3bd0363f2a0bf2956fec38c095a955ca6c000 | [
"MIT"
] | null | null | null | 1629 slowest key/slowest_key.cpp | JawadAsifBD/leetcode | 15c3bd0363f2a0bf2956fec38c095a955ca6c000 | [
"MIT"
] | null | null | null | class Solution {
public:
char slowestKey(vector<int>& releaseTimes, string keysPressed) {
unordered_map<char, int> durationMap;
durationMap[keysPressed[0]] = releaseTimes[0];
// find and store the keypress duration for each key in the durationMap
for (int i = 1; i < releaseTimes.size... | 41.5 | 79 | 0.584337 | [
"vector"
] |
b9093fcdcd2efd10ac1d48d8a9aec5589e17207f | 10,891 | cpp | C++ | power-split-3/MainPage.xaml.cpp | KR-Studio/power-split | cb9f3d279d9de8dbf48cf7c38727e3b3b06c6126 | [
"BSD-3-Clause"
] | null | null | null | power-split-3/MainPage.xaml.cpp | KR-Studio/power-split | cb9f3d279d9de8dbf48cf7c38727e3b3b06c6126 | [
"BSD-3-Clause"
] | null | null | null | power-split-3/MainPage.xaml.cpp | KR-Studio/power-split | cb9f3d279d9de8dbf48cf7c38727e3b3b06c6126 | [
"BSD-3-Clause"
] | null | null | null | //
// MainPage.xaml.cpp
// Implementation of the MainPage class.
//
#include "pch.h"
#include "MainPage.xaml.h"
#include <regex>
#include <future>
using namespace PowerSplit;
using namespace Platform;
using namespace Windows::Foundation;
using namespace Windows::Foundation::Collections;
using namespace Windows::UI:... | 32.804217 | 112 | 0.724727 | [
"object",
"vector"
] |
b90ae42dfa95084d3cc3d84da948300dc145c1d7 | 6,025 | cpp | C++ | sgu_ru/task293.cpp | greendwin/puzzles | 5df1175f178d0c3e1ffa765160057d90e9da37cd | [
"MIT"
] | null | null | null | sgu_ru/task293.cpp | greendwin/puzzles | 5df1175f178d0c3e1ffa765160057d90e9da37cd | [
"MIT"
] | null | null | null | sgu_ru/task293.cpp | greendwin/puzzles | 5df1175f178d0c3e1ffa765160057d90e9da37cd | [
"MIT"
] | null | null | null | /************************************************************
* TASK293.CPP 20.03.2008
*
* .
************************************************************/
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
using namespace std;
/*************************... | 21.989051 | 75 | 0.365477 | [
"vector"
] |
b912269607747f10c2cd068ca0150809ebf77859 | 14,478 | cpp | C++ | winage/age/AgeDlg.cpp | spieglt/winage | aea439dcd8e8e6b2cb0c76ad7f8462154671e3f8 | [
"BSD-3-Clause"
] | 40 | 2021-12-06T17:07:14.000Z | 2022-03-14T10:21:08.000Z | winage/age/AgeDlg.cpp | spieglt/winage | aea439dcd8e8e6b2cb0c76ad7f8462154671e3f8 | [
"BSD-3-Clause"
] | null | null | null | winage/age/AgeDlg.cpp | spieglt/winage | aea439dcd8e8e6b2cb0c76ad7f8462154671e3f8 | [
"BSD-3-Clause"
] | null | null | null |
// AgeDlg.cpp : implementation file
//
#include "stdafx.h"
#include "Age.h"
#include "AgeDlg.h"
#include "afxdialogex.h"
#include "winuser.h"
#include "ConfirmPassDlg.h"
#include "GenPassDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
#define MALLOC_CHECK(ptr) { \
if (ptr == NULL) { \
MessageBox("Memory alloc... | 27.949807 | 183 | 0.711148 | [
"model"
] |
b91584c29eea58a153fbd349a89e0994eea87ef3 | 33,878 | cpp | C++ | applications/physbam/physbam-lib/Public_Library/PhysBAM_Dynamics/Parallel_Computation/MPI_SOLID_FLUID_SLIP.cpp | schinmayee/nimbus | 170cd15e24a7a88243a6ea80aabadc0fc0e6e177 | [
"BSD-3-Clause"
] | 20 | 2017-07-03T19:09:09.000Z | 2021-09-10T02:53:56.000Z | applications/physbam/physbam-lib/Public_Library/PhysBAM_Dynamics/Parallel_Computation/MPI_SOLID_FLUID_SLIP.cpp | schinmayee/nimbus | 170cd15e24a7a88243a6ea80aabadc0fc0e6e177 | [
"BSD-3-Clause"
] | null | null | null | applications/physbam/physbam-lib/Public_Library/PhysBAM_Dynamics/Parallel_Computation/MPI_SOLID_FLUID_SLIP.cpp | schinmayee/nimbus | 170cd15e24a7a88243a6ea80aabadc0fc0e6e177 | [
"BSD-3-Clause"
] | 9 | 2017-09-17T02:05:06.000Z | 2020-01-31T00:12:01.000Z | // Copyright 2008-2009, Avi Robinson-Mosher, Jonathan Su.
// This file is part of PhysBAM whose distribution is governed by the license contained in the accompanying file PHYSBAM_COPYRIGHT.txt.
//#####################################################################
// Class MPI_SOLID_FLUID_SLIP
//######################... | 61.262206 | 379 | 0.689563 | [
"vector"
] |
b918f59137e5d6f4af50fd2d6a193d39ad576311 | 1,317 | cpp | C++ | eagleeye/engine/nano/op/clip_op.cpp | jianzfb/eagleeye | e28810033eb656b181b6291ca702da825c4946c2 | [
"Apache-2.0"
] | 12 | 2020-09-21T02:24:11.000Z | 2022-03-10T03:02:03.000Z | eagleeye/engine/nano/op/clip_op.cpp | jianzfb/eagleeye | e28810033eb656b181b6291ca702da825c4946c2 | [
"Apache-2.0"
] | 1 | 2020-11-30T08:22:50.000Z | 2020-11-30T08:22:50.000Z | eagleeye/engine/nano/op/clip_op.cpp | jianzfb/eagleeye | e28810033eb656b181b6291ca702da825c4946c2 | [
"Apache-2.0"
] | 3 | 2020-03-16T12:10:55.000Z | 2021-07-20T09:58:15.000Z | #include "eagleeye/engine/nano/op/clip_op.h"
#include "eagleeye/engine/math/arm/clip.h"
namespace eagleeye{
namespace dataflow{
ClipOp::ClipOp(float min_v, float max_v){
this->m_min_v = min_v;
this->m_max_v = max_v;
}
ClipOp::ClipOp(const ClipOp& op)
:m_min_v(op.m_min_v),
m_max_v(op.m_max_v... | 23.945455 | 83 | 0.579347 | [
"vector"
] |
2c6decd67135092a1d5b4897b381ed7591c9babb | 4,731 | cpp | C++ | source/GTest/FX/DynLight.cpp | paradoxnj/Genesis3D | 272fc6aa2580de4ee223274ea04a101199c535a1 | [
"Condor-1.1",
"Unlicense"
] | 3 | 2020-04-29T03:17:50.000Z | 2021-05-26T19:53:46.000Z | source/GTest/FX/DynLight.cpp | paradoxnj/Genesis3D | 272fc6aa2580de4ee223274ea04a101199c535a1 | [
"Condor-1.1",
"Unlicense"
] | 1 | 2020-04-29T03:12:47.000Z | 2020-04-29T03:12:47.000Z | source/GTest/FX/DynLight.cpp | paradoxnj/Genesis3D | 272fc6aa2580de4ee223274ea04a101199c535a1 | [
"Condor-1.1",
"Unlicense"
] | null | null | null | #define WIN32_LEAN_AND_MEAN
#include <windows.h>
#include <math.h>
#include <stdlib.h>
#include <assert.h>
#define BUILD_DYNLIGHT
#include "Dynlight.h"
#include "errorlog.h"
static geBoolean DynLight_SetWorld(geWorld *World, geVFile *Context);
geBoolean DynLight_Init(geEngine *Engine, geWorld *World, geVFile *Conte... | 24.640625 | 106 | 0.703445 | [
"model"
] |
2c6e927b0e32aa73b7919709941445e30fa0e737 | 3,878 | cc | C++ | source/builder.cc | chinmaygarde/doxygen2docset | 915de729857dcea24581a1561d9e4f4fb322c674 | [
"MIT"
] | 12 | 2019-12-08T13:36:13.000Z | 2022-02-15T09:15:40.000Z | source/builder.cc | chinmaygarde/doxygen2docset | 915de729857dcea24581a1561d9e4f4fb322c674 | [
"MIT"
] | null | null | null | source/builder.cc | chinmaygarde/doxygen2docset | 915de729857dcea24581a1561d9e4f4fb322c674 | [
"MIT"
] | null | null | null | // This source file is part of doxygen2docset.
// Licensed under the MIT License. See LICENSE.md file for details.
#include "builder.h"
#include <set>
#include "docset_index.h"
#include "file.h"
#include "html_parser.h"
#include "logger.h"
#include "plist_parser.h"
#include "token_parser.h"
namespace d2d {
bool Bu... | 31.024 | 79 | 0.596957 | [
"vector"
] |
2c6ec3c89f1dccc01c4262b73d00120b134f0ce6 | 3,802 | cpp | C++ | tools/Vitis-AI-Library/xmodel_image/postprocessors/segmentation/segmentation.cpp | hito0512/Vitis-AI | 996459fb96cb077ed2f7e789d515893b1cccbc95 | [
"Apache-2.0"
] | 1 | 2022-02-17T22:13:23.000Z | 2022-02-17T22:13:23.000Z | tools/Vitis-AI-Library/xmodel_image/postprocessors/segmentation/segmentation.cpp | hito0512/Vitis-AI | 996459fb96cb077ed2f7e789d515893b1cccbc95 | [
"Apache-2.0"
] | null | null | null | tools/Vitis-AI-Library/xmodel_image/postprocessors/segmentation/segmentation.cpp | hito0512/Vitis-AI | 996459fb96cb077ed2f7e789d515893b1cccbc95 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2019 Xilinx Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to ... | 31.163934 | 79 | 0.666754 | [
"vector"
] |
2c6f15797cd91b3266b336b7ee87e7789a438c28 | 3,342 | cpp | C++ | raidutil/parserr.cpp | barak/raidutils | 8eed7a577ac4565da324cd742e8f1afe7ae101e0 | [
"BSD-3-Clause"
] | null | null | null | raidutil/parserr.cpp | barak/raidutils | 8eed7a577ac4565da324cd742e8f1afe7ae101e0 | [
"BSD-3-Clause"
] | null | null | null | raidutil/parserr.cpp | barak/raidutils | 8eed7a577ac4565da324cd742e8f1afe7ae101e0 | [
"BSD-3-Clause"
] | null | null | null | /* Copyright (c) 1996-2004, Adaptec Corporation
* 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... | 32.134615 | 80 | 0.664273 | [
"object"
] |
2c843437a5fbad2c46ecd3c4cd2c1089d0359b98 | 1,443 | cpp | C++ | Build/hosEngine/Component.cpp | Game-institute-1st-While-true/hosEngine | 2cc0b464740a976a8b37afd7a9e3479fe7484cf0 | [
"MIT"
] | null | null | null | Build/hosEngine/Component.cpp | Game-institute-1st-While-true/hosEngine | 2cc0b464740a976a8b37afd7a9e3479fe7484cf0 | [
"MIT"
] | null | null | null | Build/hosEngine/Component.cpp | Game-institute-1st-While-true/hosEngine | 2cc0b464740a976a8b37afd7a9e3479fe7484cf0 | [
"MIT"
] | 2 | 2021-07-14T00:14:18.000Z | 2021-07-27T04:16:53.000Z | #include "Component.h"
#include "GameObject.h"
using namespace hos;
hos::com::Component::Component() :Object(), m_GameObject(nullptr), ExecutionOrder(DEFAULT_EXECUTION_ORDER)
{
mbstring tt = typeid(*this).name();
string str(tt.begin(), tt.end());
SetName(str);
}
hos::com::Component::Component(const Component& de... | 17.385542 | 129 | 0.705475 | [
"object",
"vector"
] |
2c8ddcb7e4abfab5b809716ba70f0142baa04763 | 2,473 | hpp | C++ | include/highfive/H5Reference.hpp | sanjayankur31/HighFive | f2a6b1d29ff2f8ba1c08f85916e8b5fbe83763b8 | [
"BSL-1.0"
] | 425 | 2015-12-10T13:27:00.000Z | 2022-03-28T06:18:08.000Z | include/highfive/H5Reference.hpp | sanjayankur31/HighFive | f2a6b1d29ff2f8ba1c08f85916e8b5fbe83763b8 | [
"BSL-1.0"
] | 402 | 2015-12-11T11:09:01.000Z | 2022-03-31T16:21:04.000Z | include/highfive/H5Reference.hpp | sanjayankur31/HighFive | f2a6b1d29ff2f8ba1c08f85916e8b5fbe83763b8 | [
"BSL-1.0"
] | 143 | 2016-02-25T15:17:42.000Z | 2022-03-22T18:08:27.000Z | /*
* Copyright (c), 2020, EPFL - Blue Brain Project
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*
*/
#ifndef H5REFERENCE_HPP
#define H5REFERENCE_HPP
#include <string>
#include <vector>
... | 29.795181 | 88 | 0.699151 | [
"object",
"vector"
] |
2ca7a902a5e9f226721d23694a29d6e1fbd1d28d | 220,202 | cpp | C++ | ojcpp/leetcode/300/315_h_countsmallernumberafterself.cpp | softarts/oj | 2f51f360a7a6c49e865461755aec2f3a7e721b9e | [
"Apache-2.0"
] | 3 | 2019-05-04T03:26:02.000Z | 2019-08-29T01:20:44.000Z | ojcpp/leetcode/300/315_h_countsmallernumberafterself.cpp | softarts/oj | 2f51f360a7a6c49e865461755aec2f3a7e721b9e | [
"Apache-2.0"
] | null | null | null | ojcpp/leetcode/300/315_h_countsmallernumberafterself.cpp | softarts/oj | 2f51f360a7a6c49e865461755aec2f3a7e721b9e | [
"Apache-2.0"
] | null | null | null | //
// Created by rui zhou on 27/03/18.
//
/*
* https://leetcode.com/problems/count-of-smaller-numbers-after-self/description/
* You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].
... | 1,983.801802 | 109,571 | 0.784657 | [
"vector"
] |
2ca9b1501efabcceb8cd35a6e0ff50afec38376c | 4,133 | cpp | C++ | lib/src/physics/SpringBone.cpp | stackos/viry3d | a57638c4b807faa7cbaa11f2019cab47029ca5ba | [
"Apache-2.0"
] | null | null | null | lib/src/physics/SpringBone.cpp | stackos/viry3d | a57638c4b807faa7cbaa11f2019cab47029ca5ba | [
"Apache-2.0"
] | null | null | null | lib/src/physics/SpringBone.cpp | stackos/viry3d | a57638c4b807faa7cbaa11f2019cab47029ca5ba | [
"Apache-2.0"
] | 1 | 2020-09-04T07:38:32.000Z | 2020-09-04T07:38:32.000Z | /*
* Viry3D
* Copyright 2014-2019 by Stack - stackos@qq.com
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicabl... | 34.731092 | 141 | 0.605855 | [
"transform"
] |
2caa80b3bfdc4f0fcfff1b656a95c0eabfdbcb1f | 4,270 | cpp | C++ | UVA Online Judge Solve/UVA531.cpp | Remonhasan/programming-solve | 5a4ac8c738dd361e1c974162e0eaebbaae72fd80 | [
"Apache-2.0"
] | null | null | null | UVA Online Judge Solve/UVA531.cpp | Remonhasan/programming-solve | 5a4ac8c738dd361e1c974162e0eaebbaae72fd80 | [
"Apache-2.0"
] | null | null | null | UVA Online Judge Solve/UVA531.cpp | Remonhasan/programming-solve | 5a4ac8c738dd361e1c974162e0eaebbaae72fd80 | [
"Apache-2.0"
] | null | null | null | // Remon Hasan
#include <cstdio>
#include <map>
#include <vector>
#include <string>
#include <cstring>
using namespace std;
#define MAX_NUM_WORD 100
#define MAX_WORD_LENGTH 30
#define END_TEXT '#'
#define UP 0
#define LEFT 1
#define DIAGONAL 2
void constructLongestCommonSubseq(int arrIdOne[], int arrIdTwo[], int ind... | 27.197452 | 160 | 0.720843 | [
"vector"
] |
2cb5ec0c019a88b1850144ddbf68a8114d285e3c | 14,369 | cpp | C++ | thrift/compiler/test/fixtures/mcpp2-compare/gen-cpp2/ExtraService.cpp | JoeLoser/fbthrift | 8c856ec8fa0bc26380a8da024a64a9906583ffe6 | [
"Apache-2.0"
] | null | null | null | thrift/compiler/test/fixtures/mcpp2-compare/gen-cpp2/ExtraService.cpp | JoeLoser/fbthrift | 8c856ec8fa0bc26380a8da024a64a9906583ffe6 | [
"Apache-2.0"
] | null | null | null | thrift/compiler/test/fixtures/mcpp2-compare/gen-cpp2/ExtraService.cpp | JoeLoser/fbthrift | 8c856ec8fa0bc26380a8da024a64a9906583ffe6 | [
"Apache-2.0"
] | null | null | null | /**
* Autogenerated by Thrift
*
* DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
* @generated
*/
#include "src/gen-cpp2/ExtraService.h"
#include "src/gen-cpp2/ExtraService.tcc"
#include <thrift/lib/cpp2/protocol/BinaryProtocol.h>
#include <thrift/lib/cpp2/protocol/CompactProtocol.h>
#include <t... | 61.669528 | 304 | 0.795045 | [
"vector"
] |
2cb782a41b373e1fb0e1a89cc2d7761031b68c19 | 1,305 | cpp | C++ | LeetCode/cpp/792.cpp | ZintrulCre/LeetCode_Archiver | de23e16ead29336b5ee7aa1898a392a5d6463d27 | [
"MIT"
] | 279 | 2019-02-19T16:00:32.000Z | 2022-03-23T12:16:30.000Z | LeetCode/cpp/792.cpp | ZintrulCre/LeetCode_Archiver | de23e16ead29336b5ee7aa1898a392a5d6463d27 | [
"MIT"
] | 2 | 2019-03-31T08:03:06.000Z | 2021-03-07T04:54:32.000Z | LeetCode/cpp/792.cpp | ZintrulCre/LeetCode_Crawler | de23e16ead29336b5ee7aa1898a392a5d6463d27 | [
"MIT"
] | 12 | 2019-01-29T11:45:32.000Z | 2019-02-04T16:31:46.000Z | class Solution {
public:
int numMatchingSubseq(string S, vector<string> &words) {
unordered_map<char, vector<int>> sub;
int total = 0;
for (int i = 0; i < S.size(); ++i) {
if (sub.find(S[i]) == sub.end())
sub[S[i]] = vector<int>();
sub[S[i]].push_back(... | 31.829268 | 60 | 0.329502 | [
"vector"
] |
2cbc39aac366586f914b4199917c318206647a04 | 534 | cc | C++ | leetcode/leetcode_202.cc | math715/arts | ff73ccb7d67f7f7c87150204e15aeb46047f0e02 | [
"MIT"
] | null | null | null | leetcode/leetcode_202.cc | math715/arts | ff73ccb7d67f7f7c87150204e15aeb46047f0e02 | [
"MIT"
] | null | null | null | leetcode/leetcode_202.cc | math715/arts | ff73ccb7d67f7f7c87150204e15aeb46047f0e02 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <set>
using namespace std;
bool isHappy(int n) {
long _n = n;
set<int> s;
while (true) {
vector<int> vs;
while (_n > 0) {
vs.push_back(_n % 10);
_n = _n / 10;
}
_n = 0;
for (auto v : vs) {
_n += v * v;
}
// cout << _n << endl;
if (_n ==... | 13.692308 | 32 | 0.477528 | [
"vector"
] |
2cc4c888ed78842ad6d77e793a4a915426abcb1b | 2,122 | cpp | C++ | CLRS/BackTracking/ CombinationSumIII.cpp | ComputerProgrammerStorager/DataStructureAlgorithm | 508f7e37898c907ea7ea6ec40749621a2349e93f | [
"MIT"
] | null | null | null | CLRS/BackTracking/ CombinationSumIII.cpp | ComputerProgrammerStorager/DataStructureAlgorithm | 508f7e37898c907ea7ea6ec40749621a2349e93f | [
"MIT"
] | null | null | null | CLRS/BackTracking/ CombinationSumIII.cpp | ComputerProgrammerStorager/DataStructureAlgorithm | 508f7e37898c907ea7ea6ec40749621a2349e93f | [
"MIT"
] | null | null | null | /*
Find all valid combinations of k numbers that sum up to n such that the following conditions are true:
Only numbers 1 through 9 are used.
Each number is used at most once.
Return a list of all possible valid combinations. The list must not contain the same combination twice, and the combinations may be returned in ... | 24.390805 | 154 | 0.588596 | [
"vector"
] |
2cce2fb95e313d01f6e0516e496d5f0e162dce71 | 11,167 | cpp | C++ | Engine/W_Scene.cpp | SOLID-TEAM/SOLID_ENGINE | 7fa9eccc28217d49a937fcf1dcfc052716825d30 | [
"MIT"
] | 2 | 2019-11-22T23:34:36.000Z | 2019-11-27T10:27:35.000Z | Engine/W_Scene.cpp | SOLID-TEAM/SOLID_ENGINE | 7fa9eccc28217d49a937fcf1dcfc052716825d30 | [
"MIT"
] | null | null | null | Engine/W_Scene.cpp | SOLID-TEAM/SOLID_ENGINE | 7fa9eccc28217d49a937fcf1dcfc052716825d30 | [
"MIT"
] | null | null | null | #include "W_Scene.h"
#include "Application.h"
#include "ModuleRenderer3D.h"
#include "ModuleResources.h"
#include "ModuleInput.h"
#include "CameraEditor.h"
#include "Viewport.h"
#include "ImGui/imgui.h"
#include "ImGui/imgui_internal.h"
#include "ImGuizmo/ImGuizmo.h"
#include "IconFontAwesome/IconsFontAwesome5.h"
#... | 36.139159 | 198 | 0.680039 | [
"model"
] |
2cdc37f1276bd13d1c0316a9876e623519b86fde | 18,448 | cpp | C++ | src/programs/libpfasst_swe_sphere_mlsdc/ceval.cpp | valentinaschueller/sweet | 27e99c7a110c99deeadee70688c186d82b39ac90 | [
"MIT"
] | null | null | null | src/programs/libpfasst_swe_sphere_mlsdc/ceval.cpp | valentinaschueller/sweet | 27e99c7a110c99deeadee70688c186d82b39ac90 | [
"MIT"
] | null | null | null | src/programs/libpfasst_swe_sphere_mlsdc/ceval.cpp | valentinaschueller/sweet | 27e99c7a110c99deeadee70688c186d82b39ac90 | [
"MIT"
] | null | null | null | #include <iomanip>
#include <math.h>
#include <string>
#include <sweet/SimulationVariables.hpp>
#include "../swe_sphere_timeintegrators/SWE_Sphere_TS_l_irk.hpp"
#include "../swe_sphere_timeintegrators/SWE_Sphere_TS_lg_irk.hpp"
#include "ceval.hpp"
#include "../swe_sphere_benchmarks/BenchmarksSphereSWE.hpp"
#include ... | 26.892128 | 105 | 0.717205 | [
"object",
"vector"
] |
2cdd6cb7ca06849a3d53c8a885716cc1e39bb9ec | 3,199 | cpp | C++ | src/commands.cpp | devinsmith/tfstool | bccd7dc97a769a87fb576c1feae32290cf6bd8c3 | [
"MIT"
] | null | null | null | src/commands.cpp | devinsmith/tfstool | bccd7dc97a769a87fb576c1feae32290cf6bd8c3 | [
"MIT"
] | null | null | null | src/commands.cpp | devinsmith/tfstool | bccd7dc97a769a87fb576c1feae32290cf6bd8c3 | [
"MIT"
] | null | null | null | // Copyright (c) 2020 Devn Smith <devin@devinsmith.net>
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the "Software"),
// to deal in the Software without restriction, including without limitation
// the rights to use, copy, mod... | 30.466667 | 98 | 0.682713 | [
"vector"
] |
2ce2b4f8b9f66528b0e277dd41dc21589a77d51b | 1,137 | cpp | C++ | src/CGnuPlotIndexData.cpp | colinw7/CQGnuPlot | 8001b0a0d40c1fde8e5efe05ebe0c9b0541daa94 | [
"MIT"
] | null | null | null | src/CGnuPlotIndexData.cpp | colinw7/CQGnuPlot | 8001b0a0d40c1fde8e5efe05ebe0c9b0541daa94 | [
"MIT"
] | null | null | null | src/CGnuPlotIndexData.cpp | colinw7/CQGnuPlot | 8001b0a0d40c1fde8e5efe05ebe0c9b0541daa94 | [
"MIT"
] | 1 | 2019-04-01T13:08:45.000Z | 2019-04-01T13:08:45.000Z | #include <CGnuPlotIndexData.h>
#include <CExpr.h>
#include <CStrUtil.h>
#include <limits>
namespace {
bool evaluateExpression(CExpr *expr, const std::string &exprStr, CExprValuePtr &value) {
bool oldQuiet = expr->getQuiet();
expr->setQuiet(true);
if (! expr->evaluateExpression(exprStr, value))
value = CEx... | 17.492308 | 88 | 0.604222 | [
"vector"
] |
2ce452818992e8ea86f4544dafbfb2e9bff4afd8 | 913 | cpp | C++ | GameEngineContents/Chapter1DevilSD.cpp | AnWooJin/Portfolio | 612c1b9d29f552d1bba586f461babf7dff3a1e4e | [
"MIT"
] | null | null | null | GameEngineContents/Chapter1DevilSD.cpp | AnWooJin/Portfolio | 612c1b9d29f552d1bba586f461babf7dff3a1e4e | [
"MIT"
] | null | null | null | GameEngineContents/Chapter1DevilSD.cpp | AnWooJin/Portfolio | 612c1b9d29f552d1bba586f461babf7dff3a1e4e | [
"MIT"
] | null | null | null | #include "Chapter1DevilSD.h"
#include <GameEngine/GameEngine.h>
#include <GameEngineBase/GameEngineWindow.h>
#include <GameEngine/GameEngineImageManager.h>
#include <GameEngineBase/GameEngineInput.h>
#include <GameEngineBase/GameEngineTime.h>
#include <GameEngine/GameEngineRenderer.h>
Chapter1DevilSD::Chapter1DevilSD(... | 21.232558 | 79 | 0.740416 | [
"render"
] |
2cea1335267df87b923ad9c41322dc0f18b27b4b | 3,063 | cpp | C++ | libs/DS4_SDK/samples/saving/customscenedata/myscenemodel.cpp | Red54/reality | 510d4f5fde2f4c5535482f1ea199f914102b8a2a | [
"BSD-3-Clause"
] | null | null | null | libs/DS4_SDK/samples/saving/customscenedata/myscenemodel.cpp | Red54/reality | 510d4f5fde2f4c5535482f1ea199f914102b8a2a | [
"BSD-3-Clause"
] | null | null | null | libs/DS4_SDK/samples/saving/customscenedata/myscenemodel.cpp | Red54/reality | 510d4f5fde2f4c5535482f1ea199f914102b8a2a | [
"BSD-3-Clause"
] | null | null | null | /**********************************************************************
Copyright (C) 2002-2012 DAZ 3D, Inc. All Rights Reserved.
This file is part of the DAZ Studio SDK.
This file may be used only in accordance with the DAZ Studio SDK
license provided with the DAZ Studio SDK.
The contents of this file... | 24.504 | 112 | 0.685276 | [
"object",
"model",
"3d"
] |
f8eeee7d7830531fba230dbab88c7b3ffe43964f | 9,056 | cpp | C++ | server/main.cpp | JohndeVostok/THU-Network-Theory | 75e6e4039b98f60eb6f3d7ad1d6c361546d0b17d | [
"MIT"
] | null | null | null | server/main.cpp | JohndeVostok/THU-Network-Theory | 75e6e4039b98f60eb6f3d7ad1d6c361546d0b17d | [
"MIT"
] | null | null | null | server/main.cpp | JohndeVostok/THU-Network-Theory | 75e6e4039b98f60eb6f3d7ad1d6c361546d0b17d | [
"MIT"
] | null | null | null | #include <cstdio>
#include <cstring>
#include <unistd.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <vector>
#include <thread>
#include <string>
#include <mutex>
using namespace std;
struct Msg
{
int read;
string user, content;
string getStr()
{
return... | 20.124444 | 94 | 0.60932 | [
"vector"
] |
f8f90bdd69b604b017a1708dead1b4cd0ffe49aa | 2,475 | hpp | C++ | src/mlpack/methods/cf/neighbor_search_policies/lmetric_search.hpp | florian-rosenthal/mlpack | 4287a89886e39703571165ef1d40693eb51d22c6 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 4,216 | 2015-01-01T02:06:12.000Z | 2022-03-31T19:12:06.000Z | src/mlpack/methods/cf/neighbor_search_policies/lmetric_search.hpp | florian-rosenthal/mlpack | 4287a89886e39703571165ef1d40693eb51d22c6 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 2,621 | 2015-01-01T01:41:47.000Z | 2022-03-31T19:01:26.000Z | src/mlpack/methods/cf/neighbor_search_policies/lmetric_search.hpp | florian-rosenthal/mlpack | 4287a89886e39703571165ef1d40693eb51d22c6 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1,972 | 2015-01-01T23:37:13.000Z | 2022-03-28T06:03:41.000Z | /**
* @file methods/cf/neighbor_search_policies/lmetric_search.hpp
* @author Wenhao Huang
*
* Nearest neighbor search with L_p distance.
*
* mlpack is free software; you may redistribute it and/or modify it under the
* terms of the 3-clause BSD license. You should have received a copy of the
* 3-clause BSD lic... | 29.117647 | 78 | 0.720404 | [
"object"
] |
f8fa31c9a649636c9d29562eb8ddc1e03bdd7d4c | 7,635 | cpp | C++ | i23dSFM/multiview/solver_resection_kernel_test.cpp | zyxrrr/GraphSfM | 1af22ec17950ffc8a5c737a6a46f4465c40aa470 | [
"BSD-3-Clause"
] | null | null | null | i23dSFM/multiview/solver_resection_kernel_test.cpp | zyxrrr/GraphSfM | 1af22ec17950ffc8a5c737a6a46f4465c40aa470 | [
"BSD-3-Clause"
] | null | null | null | i23dSFM/multiview/solver_resection_kernel_test.cpp | zyxrrr/GraphSfM | 1af22ec17950ffc8a5c737a6a46f4465c40aa470 | [
"BSD-3-Clause"
] | 1 | 2019-02-18T09:49:32.000Z | 2019-02-18T09:49:32.000Z |
// Copyright (c) 2010 libmv authors.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publis... | 34.547511 | 85 | 0.648854 | [
"vector",
"3d"
] |
f8fff18f8a28e3a88dede875625709bfcbae722b | 1,056 | cpp | C++ | Volt/src/render/opengl/GlShader.cpp | Daninjakiwi/Volt | bd62f8fcde96607e8f63ecb25056a1bae72a7c30 | [
"MIT"
] | null | null | null | Volt/src/render/opengl/GlShader.cpp | Daninjakiwi/Volt | bd62f8fcde96607e8f63ecb25056a1bae72a7c30 | [
"MIT"
] | null | null | null | Volt/src/render/opengl/GlShader.cpp | Daninjakiwi/Volt | bd62f8fcde96607e8f63ecb25056a1bae72a7c30 | [
"MIT"
] | null | null | null | #include <render/opengl/GlShader.hpp>
#include <render/opengl/GlFunctions.hpp>
#include <iostream>
namespace volt {
GlShader::GlShader(const char* vert_src, const char* frag_src) : m_id(0) {
m_id = glCreateProgram();
unsigned int vert = compile(vert_src, GL_VERTEX_SHADER);
unsigned int frag = compile(frag_src,... | 19.555556 | 75 | 0.683712 | [
"render"
] |
5d08df602de40063cdf7d5045cf7b5a3bc276e0f | 5,343 | cpp | C++ | doc/cxx/examples/serialization.cpp | nachawati/zorba | f7719e4c0e6f03d9aa54a856bb9704c8bdfdfda3 | [
"Apache-2.0"
] | 40 | 2016-06-23T18:04:37.000Z | 2022-03-18T22:24:27.000Z | doc/cxx/examples/serialization.cpp | nachawati/zorba | f7719e4c0e6f03d9aa54a856bb9704c8bdfdfda3 | [
"Apache-2.0"
] | 17 | 2016-10-04T14:05:47.000Z | 2020-02-20T01:37:40.000Z | doc/cxx/examples/serialization.cpp | nachawati/zorba | f7719e4c0e6f03d9aa54a856bb9704c8bdfdfda3 | [
"Apache-2.0"
] | 18 | 2017-02-20T11:13:09.000Z | 2022-02-10T09:48:07.000Z | /*
* Copyright 2006-2016 zorba.io
*
* 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... | 24.509174 | 89 | 0.667977 | [
"object"
] |
5d127dc909d37c75a884dff19cb000d207908793 | 1,253 | cpp | C++ | src/app/update/modelupdateinfo.cpp | botorabi/Meet4Eat-Desktop | a3f27df5ab4b4697fcb5682900f48716b2021869 | [
"MIT"
] | 1 | 2018-03-20T08:21:34.000Z | 2018-03-20T08:21:34.000Z | src/app/update/modelupdateinfo.cpp | botorabi/Meet4Eat-Desktop | a3f27df5ab4b4697fcb5682900f48716b2021869 | [
"MIT"
] | 2 | 2018-03-15T10:13:59.000Z | 2018-03-15T10:20:15.000Z | src/app/update/modelupdateinfo.cpp | botorabi/Meet4Eat-Desktop | a3f27df5ab4b4697fcb5682900f48716b2021869 | [
"MIT"
] | null | null | null | /**
* Copyright (c) 2017 by Botorabi. All rights reserved.
* https://github.com/botorabi/Meet4Eat
*
* License: MIT License (MIT), read the LICENSE text in
* main directory for more details.
*/
#include <configuration.h>
#include "modelupdateinfo.h"
#include <QJsonDocument>
#include <QJsonObject>
names... | 23.203704 | 82 | 0.627294 | [
"object"
] |
5d13932ff27ed10957eaa698d1fa38809b8c00b9 | 19,425 | cpp | C++ | src/MessageModel.cpp | KDE/kaidan | e6292d8dc8ea4827fef5d0b4dc398446d73c6a6a | [
"Apache-2.0"
] | 14 | 2019-05-06T19:40:55.000Z | 2022-02-23T04:28:57.000Z | src/MessageModel.cpp | KDE/kaidan | e6292d8dc8ea4827fef5d0b4dc398446d73c6a6a | [
"Apache-2.0"
] | null | null | null | src/MessageModel.cpp | KDE/kaidan | e6292d8dc8ea4827fef5d0b4dc398446d73c6a6a | [
"Apache-2.0"
] | null | null | null | /*
* Kaidan - A user-friendly XMPP client for every device!
*
* Copyright (C) 2016-2021 Kaidan developers and contributors
* (see the LICENSE file for a full list of copyright authors)
*
* Kaidan is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License a... | 29.431818 | 134 | 0.733282 | [
"model"
] |
5d1b965930093562563123ad2e774c6bdb15638a | 1,232 | cpp | C++ | Array/81. Search in Rotated Sorted Array II.cpp | sumiya-NJU/LeetCode- | 8e6065e160da3db423a51aaf3ae53b2023068d05 | [
"MIT"
] | 2 | 2019-10-28T06:40:09.000Z | 2022-03-09T10:50:06.000Z | Array/81. Search in Rotated Sorted Array II.cpp | sumiya-NJU/LeetCode | 8e6065e160da3db423a51aaf3ae53b2023068d05 | [
"MIT"
] | null | null | null | Array/81. Search in Rotated Sorted Array II.cpp | sumiya-NJU/LeetCode | 8e6065e160da3db423a51aaf3ae53b2023068d05 | [
"MIT"
] | 1 | 2018-12-09T13:46:06.000Z | 2018-12-09T13:46:06.000Z | /*
author: ypz
*/
class Solution {
public:
bool search(vector<int>& nums, int target) {
if(nums.size() == 0)
return false;
if(nums.size() == 1)
return nums[0] == target;
int left = 0, right = nums.size() - 1;
while(left <= right) {
//... | 26.782609 | 69 | 0.36039 | [
"vector"
] |
5d2193b3a81fc5dc166dfaf9f4f46713dce6e082 | 388 | cpp | C++ | AtCoder/ABC247/C/abc247_c.cpp | object-oriented-human/competitive | 9e761020e887d8980a39a64eeaeaa39af0ecd777 | [
"MIT"
] | 1 | 2022-02-21T15:43:01.000Z | 2022-02-21T15:43:01.000Z | AtCoder/ABC247/C/abc247_c.cpp | foooop/competitive | 9e761020e887d8980a39a64eeaeaa39af0ecd777 | [
"MIT"
] | null | null | null | AtCoder/ABC247/C/abc247_c.cpp | foooop/competitive | 9e761020e887d8980a39a64eeaeaa39af0ecd777 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
signed main() {
fastio;
int n; cin >> n;
vector<string> V = {"1"};
for (int i = 2; i <= n; i++) {
string x = V.back() + " " + to_string(i) + "... | 25.866667 | 67 | 0.533505 | [
"vector"
] |
5d258308883ed13ce866c42d56e053f42bd3c696 | 1,022 | cpp | C++ | src/Modules/VRDistortionModule/VRDistortionRenderable.cpp | eegeo/cardboard-vr-integration | 3f0c3d0f1b7ddaa6b2ef980e46ead71c8a85a260 | [
"BSD-2-Clause"
] | 8 | 2017-07-02T01:14:29.000Z | 2021-06-19T07:14:38.000Z | src/Modules/VRDistortionModule/VRDistortionRenderable.cpp | eegeo/cardboard-vr-demo | 3f0c3d0f1b7ddaa6b2ef980e46ead71c8a85a260 | [
"BSD-2-Clause"
] | null | null | null | src/Modules/VRDistortionModule/VRDistortionRenderable.cpp | eegeo/cardboard-vr-demo | 3f0c3d0f1b7ddaa6b2ef980e46ead71c8a85a260 | [
"BSD-2-Clause"
] | 5 | 2018-02-07T07:43:51.000Z | 2020-01-24T12:29:25.000Z | // Copyright eeGeo Ltd (2012-2016), All Rights Reserved
#include "VRDistortionRenderable.h"
namespace Eegeo
{
namespace VR
{
namespace Distortion
{
void VRDistortionRenderable::Render(Eegeo::Rendering::GLState& glState) const
{
m_material->SetStatePerRen... | 29.2 | 98 | 0.57045 | [
"render"
] |
5d282d8181a90ad8fbb7bd583c288444e1d3c830 | 5,266 | cpp | C++ | Source/Geometry/Analytic/imstkOrientedBox.cpp | jcfr/iMSTK | 1602383c32eb116916fa5ca7a19e6c60a540922c | [
"Apache-2.0"
] | null | null | null | Source/Geometry/Analytic/imstkOrientedBox.cpp | jcfr/iMSTK | 1602383c32eb116916fa5ca7a19e6c60a540922c | [
"Apache-2.0"
] | null | null | null | Source/Geometry/Analytic/imstkOrientedBox.cpp | jcfr/iMSTK | 1602383c32eb116916fa5ca7a19e6c60a540922c | [
"Apache-2.0"
] | null | null | null | /*=========================================================================
Library: iMSTK
Copyright (c) Kitware, Inc. & Center for Modeling, Simulation,
& Imaging in Medicine, Rensselaer Polytechnic Institute.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file e... | 29.093923 | 98 | 0.576149 | [
"geometry"
] |
5d29bdcc054f888d4fd5709fe76347e5fa7f8e6e | 4,107 | cpp | C++ | engine/core/gizmos/Gizmos.cpp | johndpope/echo | e9ce2f4037e8a5d49b74cc7a9d9ee09f296e7fa7 | [
"MIT"
] | null | null | null | engine/core/gizmos/Gizmos.cpp | johndpope/echo | e9ce2f4037e8a5d49b74cc7a9d9ee09f296e7fa7 | [
"MIT"
] | null | null | null | engine/core/gizmos/Gizmos.cpp | johndpope/echo | e9ce2f4037e8a5d49b74cc7a9d9ee09f296e7fa7 | [
"MIT"
] | null | null | null | #include "Gizmos.h"
#include "engine/core/memory/MemAllocDef.h"
#include "engine/core/scene/node_tree.h"
// opaque material
static const char* g_gizmoOpaqueMaterial = R"(
<?xml version = "1.0" encoding = "utf-8"?>
<Shader>
<VS>#version 100
attribute vec3 a_Position;
attribute vec4 a_Color;
uniform mat4 u_Worl... | 21.615789 | 103 | 0.698076 | [
"mesh",
"render"
] |
5d2c65831478886882a9295658ea668dfa11f72c | 12,056 | cpp | C++ | metricknn/metricknn_lib/src/metricknn/metricknn_cpp/impl/mevaluation_eval.cpp | juanbarrios/multimedia_tools | 91fe64779168c3dd3ad4e51e089df9ccad5f176b | [
"BSD-2-Clause"
] | 6 | 2015-09-08T00:14:59.000Z | 2018-09-11T09:46:40.000Z | metricknn/metricknn_lib/src/metricknn/metricknn_cpp/impl/mevaluation_eval.cpp | juanbarrios/multimedia_tools | 91fe64779168c3dd3ad4e51e089df9ccad5f176b | [
"BSD-2-Clause"
] | null | null | null | metricknn/metricknn_lib/src/metricknn/metricknn_cpp/impl/mevaluation_eval.cpp | juanbarrios/multimedia_tools | 91fe64779168c3dd3ad4e51e089df9ccad5f176b | [
"BSD-2-Clause"
] | 1 | 2020-11-13T15:55:30.000Z | 2020-11-13T15:55:30.000Z | /*
* Copyright (C) 2012-2015, Juan Manuel Barrios <http://juan.cl/>
* All rights reserved.
*
* This file is part of MetricKnn. http://metricknn.org/
* MetricKnn is made available under the terms of the BSD 2-Clause License.
*/
#include <string>
#include <vector>
#include <map>
#include <set>
#include <iostream>
... | 40.592593 | 134 | 0.718397 | [
"vector"
] |
5d35466f776062c2fe76600474f6aee68090dbc7 | 14,099 | cc | C++ | ui/views/controls/tabbed_pane/native_tabbed_pane_win.cc | junmin-zhu/chromium-rivertrail | eb1a57aca71fe68d96e48af8998dcfbe45171ee1 | [
"BSD-3-Clause"
] | 5 | 2018-03-10T13:08:42.000Z | 2021-07-26T15:02:11.000Z | ui/views/controls/tabbed_pane/native_tabbed_pane_win.cc | quisquous/chromium | b25660e05cddc9d0c3053b3514f07037acc69a10 | [
"BSD-3-Clause"
] | 1 | 2015-07-21T08:02:01.000Z | 2015-07-21T08:02:01.000Z | ui/views/controls/tabbed_pane/native_tabbed_pane_win.cc | jianglong0156/chromium.src | d496dfeebb0f282468827654c2b3769b3378c087 | [
"BSD-3-Clause"
] | 6 | 2016-11-14T10:13:35.000Z | 2021-01-23T15:29:53.000Z | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/views/controls/tabbed_pane/native_tabbed_pane_win.h"
#include <vssym32.h>
#include "base/logging.h"
#include "base/stl_util.h"
#include... | 35.33584 | 80 | 0.665437 | [
"object",
"vector"
] |
5d4cbb4800772feda7b44cb0fabc670287190f3d | 1,013 | cpp | C++ | 排序/内部排序的应用/P349.3.cpp | Ruvikm/Wangdao-Data-Structures | e00494f40c0be9d81229062bf69fe1e12e340773 | [
"MIT"
] | 103 | 2021-01-07T13:03:57.000Z | 2022-03-31T03:10:35.000Z | 排序/内部排序的应用/P349.3.cpp | fu123567/Wangdao-Data-Structures | e00494f40c0be9d81229062bf69fe1e12e340773 | [
"MIT"
] | null | null | null | 排序/内部排序的应用/P349.3.cpp | fu123567/Wangdao-Data-Structures | e00494f40c0be9d81229062bf69fe1e12e340773 | [
"MIT"
] | 23 | 2021-04-10T07:53:03.000Z | 2022-03-31T00:33:05.000Z | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
#define ElemType int
//P349.3
//有一种简单的排序算法, 称为计数排序(count sorting)这种排序算法对一个待排序的表
//用数组表示)进行排序, 并将排序结果存放到另一个新的表中。必须注意的是, 表中所
//有待排序的关键码互不相同, 计数排序算法针对表中的每个记录, 扫描待排序的表一趟
//统计表中有多少个记录的关键码比该记录的关键码小, 假设针对某个记录统计出的计数
//值为c, 则这个记录在新有序表中的合适存放位置即为c
//1... | 20.673469 | 62 | 0.555775 | [
"vector"
] |
5d4ee19e91228ac616af627c9cd7aadd92d97f41 | 26,181 | cpp | C++ | src/graph/Shard.cpp | raphaelsc/ragedb | 8116d17480b7a1fa9af38139b41385973e2941fd | [
"Apache-2.0"
] | null | null | null | src/graph/Shard.cpp | raphaelsc/ragedb | 8116d17480b7a1fa9af38139b41385973e2941fd | [
"Apache-2.0"
] | null | null | null | src/graph/Shard.cpp | raphaelsc/ragedb | 8116d17480b7a1fa9af38139b41385973e2941fd | [
"Apache-2.0"
] | null | null | null | /*
* Copyright Amazon.com, Inc. or its affiliates. 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 ... | 55.002101 | 147 | 0.649822 | [
"object",
"vector"
] |
5d54da4a4bcbd7a6373d1824b37012fa8486ce3d | 340 | hpp | C++ | include/zisa/meta/return_t.hpp | 1uc/ZisaCore | 9243c391b70f5b1ff8c0275905351158c4f59eab | [
"MIT"
] | null | null | null | include/zisa/meta/return_t.hpp | 1uc/ZisaCore | 9243c391b70f5b1ff8c0275905351158c4f59eab | [
"MIT"
] | 1 | 2021-07-18T15:16:10.000Z | 2021-07-18T15:16:10.000Z | include/zisa/meta/return_t.hpp | 1uc/ZisaCore | 9243c391b70f5b1ff8c0275905351158c4f59eab | [
"MIT"
] | null | null | null | // SPDX-License-Identifier: MIT
// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval
#ifndef ZISA_RETURN_T_HPP
#define ZISA_RETURN_T_HPP
#include <type_traits>
namespace zisa {
template <class Transform, class Arg1, class Arg2>
using return_t = std::result_of_t<Transform(const Arg1 &, const Arg2 &)>;
}
#endif /... | 20 | 73 | 0.758824 | [
"transform"
] |
5d5c9d4177926ad78eb815c62c1220b612b263b3 | 2,078 | cpp | C++ | emp/sh_test/test/mult3.cpp | chart21/frameworks | 6fe4c06bae2d100a8e24377045178d8491f45a31 | [
"MIT"
] | 388 | 2018-08-07T20:32:08.000Z | 2022-03-29T07:49:06.000Z | emp/sh_test/test/mult3.cpp | chart21/frameworks | 6fe4c06bae2d100a8e24377045178d8491f45a31 | [
"MIT"
] | 53 | 2018-10-17T15:32:42.000Z | 2021-11-24T14:16:29.000Z | emp/sh_test/test/mult3.cpp | chart21/frameworks | 6fe4c06bae2d100a8e24377045178d8491f45a31 | [
"MIT"
] | 106 | 2018-10-17T19:49:59.000Z | 2021-12-24T05:40:31.000Z | #include "emp-sh2pc/emp-sh2pc.h"
using namespace emp;
using namespace std;
void test_mult3(int bitsize, string inputs_a[], string inputs_b[]) {
Integer product(bitsize, 1);
Integer a[3];
Integer b[3];
for (int i=0; i<3; i++)
a[i] = Integer(bitsize, stoi(inputs_a[i]), ALICE);
for (int i=0; i<3; i++)
... | 24.738095 | 71 | 0.572666 | [
"model"
] |
5d6c57000636caf9a8b32982b01ffd0835cd690d | 2,062 | cpp | C++ | Codeforces/1209/D.cpp | Code-With-Aagam/competitive-programming | 610520cc396fb13a03c606b5fb6739cfd68cc444 | [
"MIT"
] | 2 | 2022-02-08T12:37:41.000Z | 2022-03-09T03:48:56.000Z | Codeforces/1209/D.cpp | Code-With-Aagam/competitive-programming | 610520cc396fb13a03c606b5fb6739cfd68cc444 | [
"MIT"
] | null | null | null | Codeforces/1209/D.cpp | Code-With-Aagam/competitive-programming | 610520cc396fb13a03c606b5fb6739cfd68cc444 | [
"MIT"
] | null | null | null | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize ("O3")
#pragma GCC optimize(... | 22.911111 | 96 | 0.526188 | [
"vector"
] |
5d74498af4ad9964389df413794c79e7716632ea | 1,260 | cpp | C++ | Olympiad Solutions/URI/2426.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 36 | 2019-12-27T08:23:08.000Z | 2022-01-24T20:35:47.000Z | Olympiad Solutions/URI/2426.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 10 | 2019-11-13T02:55:18.000Z | 2021-10-13T23:28:09.000Z | Olympiad Solutions/URI/2426.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 53 | 2020-08-15T11:08:40.000Z | 2021-10-09T15:51:38.000Z | // Ivan Carvalho
// Solution to https://www.urionlinejudge.com.br/judge/problems/view/2426
#include <cstdio>
#include <vector>
#include <queue>
#define MAXN 550
#define MP make_pair
#define PB push_back
using namespace std;
typedef pair<int,int> ii;
typedef vector<int> vi;
int n,e,s,m,visitados[MAXN],visitados1[MAXN],v... | 24.705882 | 87 | 0.619841 | [
"vector"
] |
5d7e9f3266d66f6f27dfa18f9849bcd8c89889b0 | 1,011 | cpp | C++ | src/Utilities.cpp | mfrischknecht/srtm2ply | 57ce9a09a588492e4e7db4bb10af18ed795f2e37 | [
"MIT"
] | 1 | 2017-02-02T20:29:22.000Z | 2017-02-02T20:29:22.000Z | src/Utilities.cpp | mfrischknecht/srtm2ply | 57ce9a09a588492e4e7db4bb10af18ed795f2e37 | [
"MIT"
] | null | null | null | src/Utilities.cpp | mfrischknecht/srtm2ply | 57ce9a09a588492e4e7db4bb10af18ed795f2e37 | [
"MIT"
] | 2 | 2016-04-18T12:33:49.000Z | 2020-11-25T23:33:12.000Z |
#include <climits>
#include <cstdlib>
#include <exception>
#include <sstream>
#include "Utilities.h"
#if defined(_MSC_VER)
#include <windows.h>
#include <Shlwapi.h>
#include <vector>
#endif
std::string getAbsolutePath(const std::string &path)
{
std::string result = "";
#if defined(_MSC_VER)
result.resize(MAX_PATH... | 20.632653 | 85 | 0.677547 | [
"vector"
] |
5d87f0f32e9ef7d8d9c2c0d568c1976387a908b7 | 398 | cpp | C++ | prac/copy_constructor.cpp | OmairK/OOP_LAB | 2cf73a7764529a68e210f2f8c9b65c441577a670 | [
"MIT"
] | null | null | null | prac/copy_constructor.cpp | OmairK/OOP_LAB | 2cf73a7764529a68e210f2f8c9b65c441577a670 | [
"MIT"
] | null | null | null | prac/copy_constructor.cpp | OmairK/OOP_LAB | 2cf73a7764529a68e210f2f8c9b65c441577a670 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
class Object
{
private:
int number;
public:
Object() {}
Object(int a) : number(a) {}
Object(Object &o)
{
cout<<"Number "<<this->number<<endl;
this->number = o.number;
cout<<"Number "<<this->number<<endl;
}
~Object... | 13.724138 | 44 | 0.51005 | [
"object"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.