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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a23cff4835c60c3d585b0c8466da36cbaabba369 | 1,198 | cc | C++ | leetcode/leetcode_224.cc | math715/arts | ff73ccb7d67f7f7c87150204e15aeb46047f0e02 | [
"MIT"
] | null | null | null | leetcode/leetcode_224.cc | math715/arts | ff73ccb7d67f7f7c87150204e15aeb46047f0e02 | [
"MIT"
] | null | null | null | leetcode/leetcode_224.cc | math715/arts | ff73ccb7d67f7f7c87150204e15aeb46047f0e02 | [
"MIT"
] | null | null | null | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <stack>
#include <cassert>
#include <cctype>
using namespace std;
int calculate(string s) {
long a = 0, b = 0, r = 0;
stack<long> st;
long res = 0;
int sign = 1;
for (int i = 0; i < s.size(); ++i) {... | 21.781818 | 53 | 0.459933 | [
"vector"
] |
a2427c08b25020bd556be7c14aacab45a1ec0be5 | 948 | cpp | C++ | cf/Div2/C/Number of Ways/main.cpp | wdjpng/soi | dd565587ae30985676f7f374093ec0687436b881 | [
"MIT"
] | null | null | null | cf/Div2/C/Number of Ways/main.cpp | wdjpng/soi | dd565587ae30985676f7f374093ec0687436b881 | [
"MIT"
] | null | null | null | cf/Div2/C/Number of Ways/main.cpp | wdjpng/soi | dd565587ae30985676f7f374093ec0687436b881 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
// Turn off synchronization between cin/cout and scanf/printf
ios_base::sync_with_stdio(false);
// Disable automatic flush of cout when reading from cin cin.tie(0);
cin.tie(0);
int n;
cin >> n;
vector<int>... | 21.066667 | 83 | 0.493671 | [
"vector"
] |
a24482274ad89d7cde8776438c211d33b40a8774 | 4,708 | hpp | C++ | src/Common/SpinLock.hpp | dale-wilson/HSQueue | 04d01ed42707069d28e81b5494aba61904e6e591 | [
"BSD-3-Clause"
] | 2 | 2015-12-29T17:33:25.000Z | 2021-12-20T02:30:44.000Z | src/Common/SpinLock.hpp | dale-wilson/HighQueue | 04d01ed42707069d28e81b5494aba61904e6e591 | [
"BSD-3-Clause"
] | null | null | null | src/Common/SpinLock.hpp | dale-wilson/HighQueue | 04d01ed42707069d28e81b5494aba61904e6e591 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) 2015 Object Computing, Inc.
// All rights reserved.
// See the file license.txt for licensing information.
#pragma once
#include <atomic>
#define HIGHQUEUE_USE_CRITICAL_SECTION 1
#if HIGHQUEUE_USE_CRITICAL_SECTION && !defined(_WIN32)
#include <linux/spinlock.h>
#endif
namespace HighQueue
{
class... | 21.497717 | 78 | 0.564571 | [
"object"
] |
a2489e42e1852c679fc58640bde0da230a818ae4 | 9,154 | cpp | C++ | aten/src/ATen/native/mkldnn/Conv.cpp | stungkit/pytorch | 0f05e398705bf15406bce79f7ee57d3935ad2abd | [
"Intel"
] | 2 | 2020-03-13T06:57:49.000Z | 2020-05-17T04:18:14.000Z | aten/src/ATen/native/mkldnn/Conv.cpp | ellhe-blaster/pytorch | e5282c3cb8bf6ad8c5161f9d0cc271edb9abed25 | [
"Intel"
] | 1 | 2022-01-10T18:39:28.000Z | 2022-01-10T19:15:57.000Z | aten/src/ATen/native/mkldnn/Conv.cpp | ellhe-blaster/pytorch | e5282c3cb8bf6ad8c5161f9d0cc271edb9abed25 | [
"Intel"
] | 1 | 2022-03-26T14:42:50.000Z | 2022-03-26T14:42:50.000Z | #include <ATen/ATen.h>
#include <ATen/native/ConvUtils.h>
#include <ATen/NativeFunctions.h>
#include <ATen/Config.h>
#if !AT_MKLDNN_ENABLED()
namespace at { namespace native {
Tensor mkldnn_convolution(
const Tensor& input, const Tensor& weight, const c10::optional<Tensor>& bias_opt,
IntArrayRef padding, Int... | 35.898039 | 116 | 0.692921 | [
"model"
] |
a24dac64fa89eb0bf8e9fca93c7686ad50d818e6 | 1,933 | cc | C++ | hackerrank/euler/29.cc | metaflow/contests | 5e9ffcb72c3e7da54b5e0818b1afa59f5778ffa2 | [
"MIT"
] | 1 | 2019-05-12T23:41:00.000Z | 2019-05-12T23:41:00.000Z | hackerrank/euler/29.cc | metaflow/contests | 5e9ffcb72c3e7da54b5e0818b1afa59f5778ffa2 | [
"MIT"
] | null | null | null | hackerrank/euler/29.cc | metaflow/contests | 5e9ffcb72c3e7da54b5e0818b1afa59f5778ffa2 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ii = pair<int,int>;
using vii = vector<ii>;
using vvi = vector<vi>;
using ll = long long;
using llu = unsigned long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vll = vector<ll>... | 20.347368 | 88 | 0.444904 | [
"vector"
] |
a25055ca98d76d49f14685aa666b337755beeb8c | 2,653 | cc | C++ | Applications/genericCC/rat.cc | comnetsAD/ALCC | fc9c627de8c381987fc775ce0872339fceb43ddf | [
"MIT"
] | 6 | 2021-05-19T16:58:15.000Z | 2022-03-10T03:51:20.000Z | Applications/genericCC/rat.cc | comnetsAD/ALCC | fc9c627de8c381987fc775ce0872339fceb43ddf | [
"MIT"
] | null | null | null | Applications/genericCC/rat.cc | comnetsAD/ALCC | fc9c627de8c381987fc775ce0872339fceb43ddf | [
"MIT"
] | 4 | 2021-05-24T11:19:18.000Z | 2022-03-08T17:58:24.000Z | #include <algorithm>
#include <limits>
#include "rat.hh"
using namespace std;
Rat::Rat( WhiskerTree & s_whiskers, const bool s_track )
: _whiskers( s_whiskers ),
_memory(),
_packets_sent( 0 ),
_packets_received( 0 ),
_track( s_track ),
_last_send_time( 0 ),
_the_window( 0 ),
_in... | 29.153846 | 247 | 0.676969 | [
"vector"
] |
a250668b9df49bb3b0d9c5bcbf013d67d171dd3a | 1,438 | cpp | C++ | src/OpenGL/core/ScreenMapper.cpp | kelcykai/softpiple | 74ed4b0f239215fb8293cbf8e33436ee404e2c07 | [
"MIT"
] | null | null | null | src/OpenGL/core/ScreenMapper.cpp | kelcykai/softpiple | 74ed4b0f239215fb8293cbf8e33436ee404e2c07 | [
"MIT"
] | null | null | null | src/OpenGL/core/ScreenMapper.cpp | kelcykai/softpiple | 74ed4b0f239215fb8293cbf8e33436ee404e2c07 | [
"MIT"
] | null | null | null | #include "ScreenMapper.h"
#include "DataFlow.h"
#include "DrawEngine.h"
#include "GLContext.h"
NS_OPEN_GLSP_OGL()
using glm::vec4;
ScreenMapper::ScreenMapper():
PipeStage("Viewport Transform", DrawEngine::getDrawEngine())
{
}
void ScreenMapper::emit(void *data)
{
Batch *bat = static_cast<Batch *>(data);
viewpo... | 19.173333 | 61 | 0.634214 | [
"transform"
] |
a2521881f96f09638b5bbb2bf51822c9cb8a690a | 1,446 | cpp | C++ | Algorithm/dfs&bfs/2667.cpp | TheStarkor/Major | fd23c3ed4452f7c4748b7afa35f430b3292f8018 | [
"MIT"
] | null | null | null | Algorithm/dfs&bfs/2667.cpp | TheStarkor/Major | fd23c3ed4452f7c4748b7afa35f430b3292f8018 | [
"MIT"
] | null | null | null | Algorithm/dfs&bfs/2667.cpp | TheStarkor/Major | fd23c3ed4452f7c4748b7afa35f430b3292f8018 | [
"MIT"
] | null | null | null | #include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
int n, dx[4] = {0, 0, -1, 1}, dy[4] = {-1, 1, 0, 0};
int map[25][25];
bool check[25][25];
int bfs (int row, int col)
{
int cnt = 0;
queue<pair<int, int>> q;
check[row][col] = true;
q.p... | 19.808219 | 63 | 0.383126 | [
"vector"
] |
a25a453cdd3014b7b725e421310c065a2cbb72af | 998 | cpp | C++ | aws-cpp-sdk-mediatailor/source/model/ListPrefetchSchedulesRequest.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-mediatailor/source/model/ListPrefetchSchedulesRequest.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2021-10-14T16:57:00.000Z | 2021-10-18T10:47:24.000Z | aws-cpp-sdk-mediatailor/source/model/ListPrefetchSchedulesRequest.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2021-12-30T04:25:33.000Z | 2021-12-30T04:25:33.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/mediatailor/model/ListPrefetchSchedulesRequest.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::MediaTailor::Model;
using namespace Aws::Utils... | 19.192308 | 69 | 0.745491 | [
"model"
] |
a25cad789c698669e952d35c5884bd741839d4e3 | 5,425 | hpp | C++ | rpl-shell/rpl/rewriting/rewriter.hpp | Murray1991/rplsh | 38c29216c8ec11a10e3bd2ba4f5f55fe23e19995 | [
"MIT"
] | 6 | 2017-12-05T12:10:26.000Z | 2020-06-01T04:11:00.000Z | rpl-shell/rpl/rewriting/rewriter.hpp | Murray1991/rplsh | 38c29216c8ec11a10e3bd2ba4f5f55fe23e19995 | [
"MIT"
] | 1 | 2019-07-04T14:05:07.000Z | 2019-07-04T19:20:15.000Z | rpl-shell/rpl/rewriting/rewriter.hpp | Murray1991/rplsh | 38c29216c8ec11a10e3bd2ba4f5f55fe23e19995 | [
"MIT"
] | 2 | 2019-09-07T14:54:03.000Z | 2019-10-07T08:42:10.000Z | #pragma once
// TODO funzia, ma un po' incasinato
#include "rewrules.hpp"
#include "nodes/skeletons.hpp"
#include "visitors/visitors.hpp"
#include <unordered_map>
using namespace std;
typedef unordered_map<string, skel_node*> node_set;
typedef pair<skel_node*, skel_node*> pair_node;
void combine( skel_nod... | 30.138889 | 103 | 0.607742 | [
"vector"
] |
a25e4d5f023c77608a5392a64c68e297fecb213e | 3,335 | hpp | C++ | src/cli/cli_ble.hpp | CAJ2/openthread | 120aa72ff2268cce60f773219ebe9162d20f0b90 | [
"BSD-3-Clause"
] | null | null | null | src/cli/cli_ble.hpp | CAJ2/openthread | 120aa72ff2268cce60f773219ebe9162d20f0b90 | [
"BSD-3-Clause"
] | null | null | null | src/cli/cli_ble.hpp | CAJ2/openthread | 120aa72ff2268cce60f773219ebe9162d20f0b90 | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (c) 2017, The OpenThread Authors.
* 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 ... | 32.067308 | 79 | 0.703148 | [
"object"
] |
a25fabd6b3ed496cfa1ea95d142abef72e94c83e | 431 | cpp | C++ | src/GameStates/GameState.cpp | marcogillies/ShooterInheritanceExample | 7ee315a98e8e96d3086a354f585fa205c0608e9e | [
"MIT"
] | null | null | null | src/GameStates/GameState.cpp | marcogillies/ShooterInheritanceExample | 7ee315a98e8e96d3086a354f585fa205c0608e9e | [
"MIT"
] | null | null | null | src/GameStates/GameState.cpp | marcogillies/ShooterInheritanceExample | 7ee315a98e8e96d3086a354f585fa205c0608e9e | [
"MIT"
] | null | null | null | //
// GameState.cpp
// ShooterInhertiance
//
// Created by Marco Gillies on 04/03/2016.
//
//
#include "GameState.hpp"
/*
* define the static variables
*/
std::vector<std::unique_ptr<GameState> > GameState::gameStates;
int GameState::currentGameState = -1;
/*
* base class constructor and destructor do nothi... | 13.46875 | 63 | 0.670534 | [
"vector"
] |
a260eb02e857d0734895237c88847c32576ffbc8 | 8,371 | cpp | C++ | software/perception/registration/src/analysis/doMatching2D.cpp | liangfok/oh-distro | eeee1d832164adce667e56667dafc64a8d7b8cee | [
"BSD-3-Clause"
] | 92 | 2016-01-14T21:03:50.000Z | 2021-12-01T17:57:46.000Z | software/perception/registration/src/analysis/doMatching2D.cpp | liangfok/oh-distro | eeee1d832164adce667e56667dafc64a8d7b8cee | [
"BSD-3-Clause"
] | 62 | 2016-01-16T18:08:14.000Z | 2016-03-24T15:16:28.000Z | software/perception/registration/src/analysis/doMatching2D.cpp | liangfok/oh-distro | eeee1d832164adce667e56667dafc64a8d7b8cee | [
"BSD-3-Clause"
] | 41 | 2016-01-14T21:26:58.000Z | 2022-03-28T03:10:39.000Z | // doMatching2D
// Program for 2D LIDAR alignment
// using the FRSM library. It uses pretty brute force
// settings.
//
// Options: - take 2 scans from user and give transformation between them (-a reference.csv, -b input.csv)
// - loop over a dataset and give transformation between all combinations (write to... | 30.551095 | 106 | 0.638753 | [
"vector",
"transform"
] |
a265c5f4357cc35bed42939e3248b378e6f5b64c | 371 | cpp | C++ | src/Utility.cpp | JagerDesu/text-renderer | 92c6a2b206d86fc90b62098a6435d2e232d6d729 | [
"BSD-2-Clause"
] | null | null | null | src/Utility.cpp | JagerDesu/text-renderer | 92c6a2b206d86fc90b62098a6435d2e232d6d729 | [
"BSD-2-Clause"
] | null | null | null | src/Utility.cpp | JagerDesu/text-renderer | 92c6a2b206d86fc90b62098a6435d2e232d6d729 | [
"BSD-2-Clause"
] | null | null | null | #include "Utility.hpp"
namespace Utility {
void LoadFile(const char* path, std::vector<uint8_t>& buffer) {
std::ifstream file(path, std::ios::binary);
if (!file) {
return;
}
size_t size;
file.seekg(0, std::ios::end);
size = file.tellg();
file.seekg(0, std::ios::beg);
buffer.resize(size);
fi... | 20.611111 | 64 | 0.625337 | [
"vector"
] |
a2697bdf89b6a729e2c2853466569fd4ae0c83e2 | 103,304 | cpp | C++ | 3rdparty/libVISCA2/visca/libvisca.cpp | dzyswy/stereo-client | 2855500187047e535a6834dcad31cf3c6f2b86a3 | [
"MIT"
] | 2 | 2019-10-17T09:11:29.000Z | 2022-01-17T06:19:25.000Z | 3rdparty/libVISCA2/visca/libvisca.cpp | dzyswy/stereo-client | 2855500187047e535a6834dcad31cf3c6f2b86a3 | [
"MIT"
] | null | null | null | 3rdparty/libVISCA2/visca/libvisca.cpp | dzyswy/stereo-client | 2855500187047e535a6834dcad31cf3c6f2b86a3 | [
"MIT"
] | null | null | null | /*
* VISCA(tm) Camera Control Library
* Copyright (C) 2002 Damien Douxchamps
*
* Written by Damien Douxchamps <ddouxchamps@users.sf.net>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Fou... | 28.655756 | 161 | 0.769476 | [
"model"
] |
a2832571f4d6f4539c0795dc2752ea54c378483e | 6,042 | hpp | C++ | src/Kernel/Sources/StereoCalibration.hpp | dairoku/Calibra | f482cf414c24ddbe103b49c1d3a22a8605bb9b03 | [
"MIT"
] | null | null | null | src/Kernel/Sources/StereoCalibration.hpp | dairoku/Calibra | f482cf414c24ddbe103b49c1d3a22a8605bb9b03 | [
"MIT"
] | null | null | null | src/Kernel/Sources/StereoCalibration.hpp | dairoku/Calibra | f482cf414c24ddbe103b49c1d3a22a8605bb9b03 | [
"MIT"
] | 1 | 2020-08-10T12:43:26.000Z | 2020-08-10T12:43:26.000Z | // =============================================================================
// StereoCalibration.hpp
//
// MIT License
//
// Copyright (c) 2007-2018 Dairoku Sekiguchi
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the ... | 37.7625 | 82 | 0.675604 | [
"vector"
] |
a28faf7ff78cd5a8aff3fc1d6731c33da792ef05 | 3,277 | cpp | C++ | plugins/community/repos/AudibleInstruments/src/Shades.cpp | guillaume-plantevin/VeeSeeVSTRack | 76fafc8e721613669d6f5ae82a0f58ce923a91e1 | [
"Zlib",
"BSD-3-Clause"
] | 233 | 2018-07-02T16:49:36.000Z | 2022-02-27T21:45:39.000Z | plugins/community/repos/AudibleInstruments/src/Shades.cpp | guillaume-plantevin/VeeSeeVSTRack | 76fafc8e721613669d6f5ae82a0f58ce923a91e1 | [
"Zlib",
"BSD-3-Clause"
] | 24 | 2018-07-09T11:32:15.000Z | 2022-01-07T01:45:43.000Z | plugins/community/repos/AudibleInstruments/src/Shades.cpp | guillaume-plantevin/VeeSeeVSTRack | 76fafc8e721613669d6f5ae82a0f58ce923a91e1 | [
"Zlib",
"BSD-3-Clause"
] | 24 | 2018-07-14T21:55:30.000Z | 2021-05-04T04:20:34.000Z | #include "AudibleInstruments.hpp"
#include <string.h>
struct Shades : Module {
enum ParamIds {
GAIN1_PARAM,
GAIN2_PARAM,
GAIN3_PARAM,
MODE1_PARAM,
MODE2_PARAM,
MODE3_PARAM,
NUM_PARAMS
};
enum InputIds {
IN1_INPUT,
IN2_INPUT,
IN3_INPUT,
NUM_INPUTS
};
enum OutputIds {
OUT1_OUTPUT,
OUT2_OU... | 32.127451 | 113 | 0.700336 | [
"model"
] |
a29864833bad8b8c389f1ec822fffa93a49a1469 | 2,295 | hpp | C++ | src/include/duckdb/common/types/hyperloglog.hpp | lokax/duckdb | c2581dfebccaebae9468c924c2c722fcf0306944 | [
"MIT"
] | 1 | 2022-01-06T17:44:07.000Z | 2022-01-06T17:44:07.000Z | src/include/duckdb/common/types/hyperloglog.hpp | lokax/duckdb | c2581dfebccaebae9468c924c2c722fcf0306944 | [
"MIT"
] | 2 | 2022-02-16T08:36:03.000Z | 2022-03-08T17:13:33.000Z | src/include/duckdb/common/types/hyperloglog.hpp | lokax/duckdb | c2581dfebccaebae9468c924c2c722fcf0306944 | [
"MIT"
] | null | null | null | //===----------------------------------------------------------------------===//
// DuckDB
//
// duckdb/common/types/hyperloglog.hpp
//
//
//===----------------------------------------------------------------------===//
#pragma once
#include "duckdb/common/mutex.hpp"
#include "duckdb/common/ty... | 34.772727 | 114 | 0.672767 | [
"vector"
] |
a29e56997e9b13ab6870ea2cd682d56288930ffe | 2,232 | cpp | C++ | src/kalman_filter.cpp | JamesDiDonato/CarND-Extended-Kalman-Filter | 79f57fbb0627a9cf9aa758fd4063eb8841a2226d | [
"MIT"
] | null | null | null | src/kalman_filter.cpp | JamesDiDonato/CarND-Extended-Kalman-Filter | 79f57fbb0627a9cf9aa758fd4063eb8841a2226d | [
"MIT"
] | null | null | null | src/kalman_filter.cpp | JamesDiDonato/CarND-Extended-Kalman-Filter | 79f57fbb0627a9cf9aa758fd4063eb8841a2226d | [
"MIT"
] | null | null | null | #include "kalman_filter.h"
using Eigen::MatrixXd;
using Eigen::VectorXd;
// Please note that the Eigen library does not initialize
// VectorXd or MatrixXd objects with zeros upon creation.
KalmanFilter::KalmanFilter() {}
KalmanFilter::~KalmanFilter() {}
# define PI 3.14159265358979323846
void KalmanFilter::Init(... | 24 | 73 | 0.586022 | [
"vector"
] |
a2a0cdc8b37d57ce88d86d2f47d51b19cada22c4 | 10,890 | cpp | C++ | Pages/ManageTicketWidget.cpp | rafaelgc/EasyReceipt | c4dae474fff0bba14f0f64ff485e3e3e19a9f399 | [
"MIT"
] | 1 | 2021-07-12T06:36:10.000Z | 2021-07-12T06:36:10.000Z | Pages/ManageTicketWidget.cpp | rafaelgc/SplitQt | c4dae474fff0bba14f0f64ff485e3e3e19a9f399 | [
"MIT"
] | null | null | null | Pages/ManageTicketWidget.cpp | rafaelgc/SplitQt | c4dae474fff0bba14f0f64ff485e3e3e19a9f399 | [
"MIT"
] | null | null | null | #include "ManageTicketWidget.hpp"
ManageTicketWidget::ManageTicketWidget(UserContainer *userContainer, TicketContainer *ticketContainer, Config *config, QWidget *parent) :
QWidget(parent),ui(new Ui::TicketManagerForm)
{
ui->setupUi(this);
ui->historialList->installEventFilter(this);
this->config = con... | 36.915254 | 172 | 0.679706 | [
"object",
"vector"
] |
947e3549dad002aa9639f2524bed7e0a8613e922 | 37,473 | hh | C++ | src/c++/include/alignment/FragmentMetadata.hh | Illumina/Isaac4 | 0924fba8b467868da92e1c48323b15d7cbca17dd | [
"BSD-3-Clause"
] | 13 | 2018-02-09T22:59:39.000Z | 2021-11-29T06:33:22.000Z | src/c++/include/alignment/FragmentMetadata.hh | Illumina/Isaac4 | 0924fba8b467868da92e1c48323b15d7cbca17dd | [
"BSD-3-Clause"
] | 17 | 2018-01-26T11:36:07.000Z | 2022-02-03T18:48:43.000Z | src/c++/include/alignment/FragmentMetadata.hh | Illumina/Isaac4 | 0924fba8b467868da92e1c48323b15d7cbca17dd | [
"BSD-3-Clause"
] | 4 | 2018-10-19T20:00:00.000Z | 2020-10-29T14:44:06.000Z | /**
** Isaac Genome Alignment Software
** Copyright (c) 2010-2017 Illumina, Inc.
** All rights reserved.
**
** This software is provided under the terms and conditions of the
** GNU GENERAL PUBLIC LICENSE Version 3
**
** You should have received a copy of the GNU GENERAL PUBLIC LICENSE Version 3
** along with ... | 39.570222 | 175 | 0.638033 | [
"vector"
] |
94821c57acc3cb3cf39f20a0a0caa708ee03d7d0 | 9,559 | cpp | C++ | Source/MiniSolarSystem/Private/Star.cpp | setg2002/SpaceGame | 7e2c78b077e9331aec4310f6cfc9e309c2c6989b | [
"MIT"
] | 1 | 2021-12-29T18:05:35.000Z | 2021-12-29T18:05:35.000Z | Source/MiniSolarSystem/Private/Star.cpp | setg2002/SpaceGame | 7e2c78b077e9331aec4310f6cfc9e309c2c6989b | [
"MIT"
] | null | null | null | Source/MiniSolarSystem/Private/Star.cpp | setg2002/SpaceGame | 7e2c78b077e9331aec4310f6cfc9e309c2c6989b | [
"MIT"
] | null | null | null | // Copyright Soren Gilbertson
#include "Star.h"
#include "NiagaraSystem.h"
#include "OverviewPlayer.h"
#include "CelestialPlayer.h"
#include "OrbitDebugActor.h"
#include "NiagaraComponent.h"
#include "CelestialGameMode.h"
#include "NiagaraFunctionLibrary.h"
#include "Kismet/KismetMathLibrary.h"
#include "Components/S... | 38.236 | 232 | 0.785333 | [
"transform"
] |
9484fbf7dfb2db865c35eaca614d8f272e471296 | 920 | cc | C++ | src/other/stepcode/src/clSchemas/example/schema.cc | Zitara/BRLCAD | 620449d036e38bd52257f6b5b10daa55d9284900 | [
"BSD-4-Clause",
"BSD-3-Clause"
] | 35 | 2015-03-11T11:51:48.000Z | 2021-07-25T16:04:49.000Z | src/other/stepcode/src/clSchemas/example/schema.cc | pombredanne/sf.net-brlcad | fb56f37c201b51241e8f3aa7b979436856f43b8c | [
"BSD-4-Clause",
"BSD-3-Clause"
] | null | null | null | src/other/stepcode/src/clSchemas/example/schema.cc | pombredanne/sf.net-brlcad | fb56f37c201b51241e8f3aa7b979436856f43b8c | [
"BSD-4-Clause",
"BSD-3-Clause"
] | 19 | 2016-05-04T08:39:37.000Z | 2021-12-07T12:45:54.000Z | #ifndef SCHEMA_CC
#define SCHEMA_CC
// This file was generated by exp2cxx. You probably don't want to edit
// it since your modifications will be lost if exp2cxx is used to
// regenerate it.
/* $Id$ */
#include <schema.h>
class Registry;
void
SchemaInit( Registry & reg ) {
extern void InitSchemasAndEnts( Regis... | 30.666667 | 81 | 0.726087 | [
"model"
] |
9485fd3664f0da6b88038e5563d8324a1f40469b | 7,125 | cpp | C++ | tools/model_compiler/mesh_builder.cpp | SharpLinesTech/slt_tech_runtime | 53689dd1d4907659335187d10621d9785c0164e0 | [
"Apache-2.0"
] | null | null | null | tools/model_compiler/mesh_builder.cpp | SharpLinesTech/slt_tech_runtime | 53689dd1d4907659335187d10621d9785c0164e0 | [
"Apache-2.0"
] | null | null | null | tools/model_compiler/mesh_builder.cpp | SharpLinesTech/slt_tech_runtime | 53689dd1d4907659335187d10621d9785c0164e0 | [
"Apache-2.0"
] | null | null | null | #include "slt/log/log.h"
#include "mesh_builder.h"
slt::Setting<std::string> vertex_attrib_name(
"slt_vertex", "vertex_attrib",
"The attribute name to assign tp vertices when exporting a mesh.");
slt::Setting<std::string> normal_attrib_name("slt_normal", "normal_attrib",
... | 31.113537 | 80 | 0.62807 | [
"mesh",
"render",
"vector"
] |
94877f08f1ebf1f4bbaee564e48694cdf89f179a | 7,113 | cpp | C++ | src/shapes/mesh.cpp | neverfelly/LuisaRender | 2f7a2b52908b81b035d17e541df1ce3dbc18b2b8 | [
"BSD-3-Clause"
] | null | null | null | src/shapes/mesh.cpp | neverfelly/LuisaRender | 2f7a2b52908b81b035d17e541df1ce3dbc18b2b8 | [
"BSD-3-Clause"
] | null | null | null | src/shapes/mesh.cpp | neverfelly/LuisaRender | 2f7a2b52908b81b035d17e541df1ce3dbc18b2b8 | [
"BSD-3-Clause"
] | null | null | null | //
// Created by Mike on 2022/1/7.
//
#include <assimp/Importer.hpp>
#include <assimp/postprocess.h>
#include <assimp/scene.h>
#include <assimp/mesh.h>
#include <core/thread_pool.h>
#include <base/shape.h>
namespace luisa::render {
class MeshLoader {
private:
luisa::vector<Shape::Vertex> _vertices;
luisa::... | 44.45625 | 119 | 0.565022 | [
"mesh",
"render",
"shape",
"vector",
"model",
"transform"
] |
9493ca6eb5116d663445694724d623a2240ca0f9 | 3,356 | hpp | C++ | source/mapping/occupating_grid.hpp | Gabriellgpc/Sistemas_Roboticos | 299fe01b85c3644acb7fa2141d9b095649c5dcef | [
"MIT"
] | 4 | 2021-02-06T09:13:54.000Z | 2021-12-14T20:09:23.000Z | source/mapping/occupating_grid.hpp | Gabriellgpc/Sistemas_Roboticos | 299fe01b85c3644acb7fa2141d9b095649c5dcef | [
"MIT"
] | null | null | null | source/mapping/occupating_grid.hpp | Gabriellgpc/Sistemas_Roboticos | 299fe01b85c3644acb7fa2141d9b095649c5dcef | [
"MIT"
] | 1 | 2021-12-30T15:49:42.000Z | 2021-12-30T15:49:42.000Z | #pragma once
#include <configSpaceTools.hpp> //Vector2D, Config
#include <vector>
#include <string>
#include <iostream>
constexpr double l_0 = 0.0;//iniciar desconhecidas
constexpr double l_oc= 0.8;//incremento em log odd para celulas provavelmente ocupadas
constexpr double l_L =-0.5;//incremento para log odd para cel... | 34.597938 | 103 | 0.69994 | [
"vector"
] |
9496569ea1248d4739032558ab2367cf9da08a59 | 6,268 | cpp | C++ | uxn/demos/muxoclon/muxoclon.cpp | kaagha/patl | 878542818a0a41f2d993ef49b8ff5249e902fd9d | [
"BSD-3-Clause"
] | null | null | null | uxn/demos/muxoclon/muxoclon.cpp | kaagha/patl | 878542818a0a41f2d993ef49b8ff5249e902fd9d | [
"BSD-3-Clause"
] | null | null | null | uxn/demos/muxoclon/muxoclon.cpp | kaagha/patl | 878542818a0a41f2d993ef49b8ff5249e902fd9d | [
"BSD-3-Clause"
] | null | null | null | /*-
| This source code is part of PATL (Practical Algorithm Template Library)
| Released under the BSD License (http://www.opensource.org/licenses/bsd-license.php)
| Copyright (c) 2005, 2007..2009, Roman S. Klyujkov (uxnuxn AT gmail.com)
|
| Find the shortest word ladders stretching between the following pairs
| ... | 32.816754 | 110 | 0.556637 | [
"vector",
"transform"
] |
94a58145e217f7e33a9742e6678cb59b2bd08a0a | 748 | cpp | C++ | arrays-101/in-place/move-zeroes.cpp | lpapp/leetcode | 58274e021004824bea9c58033632f1d5cf11a7e9 | [
"MIT"
] | null | null | null | arrays-101/in-place/move-zeroes.cpp | lpapp/leetcode | 58274e021004824bea9c58033632f1d5cf11a7e9 | [
"MIT"
] | null | null | null | arrays-101/in-place/move-zeroes.cpp | lpapp/leetcode | 58274e021004824bea9c58033632f1d5cf11a7e9 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
void moveZeroes_suboptimal(vector<int>& nums) {
size_t k = 0;
for (size_t i = 0; i < nums.size(); ++i) if (nums[i]) nums[k++] = nums[i];
for (; k < nums.size(); ++k) nums[k] = 0;
}
void moveZeroes(vector... | 18.7 | 92 | 0.520053 | [
"vector"
] |
94b411a6b39613a09304f097163c53b71a7455f9 | 86,139 | cpp | C++ | src/postgres/backend/optimizer/plan/subselect.cpp | jessesleeping/my_peloton | a19426cfe34a04692a11008eaffc9c3c9b49abc4 | [
"Apache-2.0"
] | 6 | 2017-04-28T00:38:52.000Z | 2018-11-06T07:06:49.000Z | src/postgres/backend/optimizer/plan/subselect.cpp | jessesleeping/my_peloton | a19426cfe34a04692a11008eaffc9c3c9b49abc4 | [
"Apache-2.0"
] | 57 | 2016-03-19T22:27:55.000Z | 2017-07-08T00:41:51.000Z | src/postgres/backend/optimizer/plan/subselect.cpp | eric-haibin-lin/pelotondb | 904d6bbd041a0498ee0e034d4f9f9f27086c3cab | [
"Apache-2.0"
] | 4 | 2016-07-17T20:44:56.000Z | 2018-06-27T01:01:36.000Z | /*-------------------------------------------------------------------------
*
* subselect.c
* Planning routines for subselects and parameters.
*
* Portions Copyright (c) 1996-2015, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
* IDENTIFICATION
* ... | 31.300509 | 102 | 0.693995 | [
"transform"
] |
94c43169940239317774f9d1d1cf5b8b446da353 | 5,012 | hxx | C++ | main/sc/source/ui/inc/AccessibleDataPilotControl.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/sc/source/ui/inc/AccessibleDataPilotControl.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/sc/source/ui/inc/AccessibleDataPilotControl.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... | 35.295775 | 102 | 0.652833 | [
"object",
"vector"
] |
94c77ae8983f1a9c9118373b67bee9c731cc253a | 5,781 | cpp | C++ | day23-2/day23-2.cpp | throx/advent2021 | 2295a65e14a8defacd3e83229985c97134c21501 | [
"Unlicense"
] | 1 | 2021-12-05T14:19:59.000Z | 2021-12-05T14:19:59.000Z | day23-2/day23-2.cpp | throx/advent2021 | 2295a65e14a8defacd3e83229985c97134c21501 | [
"Unlicense"
] | null | null | null | day23-2/day23-2.cpp | throx/advent2021 | 2295a65e14a8defacd3e83229985c97134c21501 | [
"Unlicense"
] | null | null | null | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cassert>
#include "../shared/Point.h"
using namespace std;
int COST[] = { 1, 10, 100, 1000 };
//char STATE[] = "BDDACCBDBBACDACA";
char STATE[] = "BDDBACBCABADDACC";
// Part2
//#############
//#ab.c.d.e.fg#
//###h#l#p#t##... | 23.216867 | 86 | 0.383671 | [
"vector"
] |
94ca67cd232939c086cf7f576ebc1d5903736486 | 6,235 | cpp | C++ | jni/application/bootstrap.cpp | garoose/eecs494.p2 | fc86f50a9ba77f4b653b3b3cd6e6c61aa2e1ca27 | [
"MIT"
] | null | null | null | jni/application/bootstrap.cpp | garoose/eecs494.p2 | fc86f50a9ba77f4b653b3b3cd6e6c61aa2e1ca27 | [
"MIT"
] | null | null | null | jni/application/bootstrap.cpp | garoose/eecs494.p2 | fc86f50a9ba77f4b653b3b3cd6e6c61aa2e1ca27 | [
"MIT"
] | null | null | null | /* This file is part of the Zenipex Library (zenilib).
* Copyleft (C) 2011 Mitchell Keith Bloch (bazald).
*
* This source file is simply under the public domain.
*/
#include <zenilib.h>
#include <string>
#include "Buggy.h"
#include "Map.h"
#include "Score.h"
#if defined(_DEBUG) && defined(_WINDOWS)
#define DEBUG_... | 25.345528 | 125 | 0.676183 | [
"render"
] |
94d4f232efab09f7671ba470b0e87f9f28ff1656 | 4,235 | cpp | C++ | Cpp14/Strou/ctor_17/class_object_initialization_main.cpp | ernestyalumni/HrdwCCppCUDA | 17ed937dea06431a4d5ca103f993ea69a6918734 | [
"MIT"
] | 1 | 2018-02-09T19:44:51.000Z | 2018-02-09T19:44:51.000Z | Cpp14/Strou/ctor_17/class_object_initialization_main.cpp | ernestyalumni/HrdwCCppCUDA | 17ed937dea06431a4d5ca103f993ea69a6918734 | [
"MIT"
] | null | null | null | Cpp14/Strou/ctor_17/class_object_initialization_main.cpp | ernestyalumni/HrdwCCppCUDA | 17ed937dea06431a4d5ca103f993ea69a6918734 | [
"MIT"
] | null | null | null | //------------------------------------------------------------------------------
/// \file class_object_initialization_main.cpp
/// \author Ernest Yeung
/// \email ernestyalumni@gmail.com
/// \brief Main driver file for class object initialization examples..
/// \ref Ch. 17 Constructors; Bjarne Stroustrup, 17.3 Class... | 33.346457 | 214 | 0.649351 | [
"object"
] |
94d54ec12d52fc52b42339c3833cb7a170da57dc | 3,335 | cpp | C++ | src/Plugins/OpenGL/Shader/GLShader.cpp | MemoryDealer/LORE | 2ce0c6cf03c119e5d1b0b90f3ee044901353283a | [
"MIT"
] | 2 | 2021-07-14T06:05:48.000Z | 2021-07-14T18:07:18.000Z | src/Plugins/OpenGL/Shader/GLShader.cpp | MemoryDealer/LORE | 2ce0c6cf03c119e5d1b0b90f3ee044901353283a | [
"MIT"
] | null | null | null | src/Plugins/OpenGL/Shader/GLShader.cpp | MemoryDealer/LORE | 2ce0c6cf03c119e5d1b0b90f3ee044901353283a | [
"MIT"
] | null | null | null | // ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: //
// The MIT License (MIT)
// This source file is part of LORE
// ( Lightweight Object-oriented Rendering Engine )
//
// Copyright (c) 2017-2021 Jordan Sparks
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
... | 29.254386 | 86 | 0.537331 | [
"geometry",
"object"
] |
94dd0ef94e363d5f3553b82479cbe7b7379c88dd | 6,224 | hpp | C++ | examples/include/base.hpp | mshiryaev/oneccl | fb4bd69b0bfa72f0ed16ac2328205e51cf12d4aa | [
"Apache-2.0"
] | null | null | null | examples/include/base.hpp | mshiryaev/oneccl | fb4bd69b0bfa72f0ed16ac2328205e51cf12d4aa | [
"Apache-2.0"
] | null | null | null | examples/include/base.hpp | mshiryaev/oneccl | fb4bd69b0bfa72f0ed16ac2328205e51cf12d4aa | [
"Apache-2.0"
] | null | null | null | /*
Copyright 2016-2019 Intel Corporation
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.976879 | 97 | 0.424325 | [
"vector"
] |
94e3ace4a3da98d53397f0f75620bc216082fb6b | 1,399 | cpp | C++ | atl/codes/Graph/edmond.cpp | rknguyen/teamnote | 52c47eefee432e66695473b50ad03554510e336c | [
"MIT"
] | null | null | null | atl/codes/Graph/edmond.cpp | rknguyen/teamnote | 52c47eefee432e66695473b50ad03554510e336c | [
"MIT"
] | null | null | null | atl/codes/Graph/edmond.cpp | rknguyen/teamnote | 52c47eefee432e66695473b50ad03554510e336c | [
"MIT"
] | null | null | null | struct Edge {
int u, v, cap, flow;
};
const int N = 1007;
vector <Edge> E;
vector <int> adj[N];
int n, m, s, t, trace[N];
void addEdge(int u, int v, int cap) {
E.push_back(Edge({ v, u, 0, 0 }));
E.push_back(Edge({ u, v, cap, 0 }));
adj[u].push_back(E.size() - 1);
adj[v].push_back(E.size() - 2);
}
in... | 26.903846 | 61 | 0.373838 | [
"vector"
] |
94e890677db5ec21e4133d50d7a03099266b32c8 | 2,899 | cpp | C++ | CodeForces/Miscellaneous/762/usb_ps2.cpp | Alecs-Li/Competitive-Programming | 39941ff8e2c8994abbae8c96a1ed0a04b10058b8 | [
"MIT"
] | 1 | 2021-07-06T02:14:03.000Z | 2021-07-06T02:14:03.000Z | CodeForces/Miscellaneous/762/usb_ps2.cpp | Alex01890-creator/competitive-programming | 39941ff8e2c8994abbae8c96a1ed0a04b10058b8 | [
"MIT"
] | null | null | null | CodeForces/Miscellaneous/762/usb_ps2.cpp | Alex01890-creator/competitive-programming | 39941ff8e2c8994abbae8c96a1ed0a04b10058b8 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <cmath>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll,ll> pll;
typedef pair<char, char> pc;
typedef pair... | 22.826772 | 58 | 0.51742 | [
"vector"
] |
94eb5533d3ef837ac191391fab989ab9ff9dd820 | 4,813 | cc | C++ | src/problem.cc | russellw/Ayane | 8109f9f134053fa1ededd2a4ff54da050291244e | [
"MIT"
] | null | null | null | src/problem.cc | russellw/Ayane | 8109f9f134053fa1ededd2a4ff54da050291244e | [
"MIT"
] | null | null | null | src/problem.cc | russellw/Ayane | 8109f9f134053fa1ededd2a4ff54da050291244e | [
"MIT"
] | 2 | 2015-04-14T12:44:58.000Z | 2019-09-02T15:37:24.000Z | #include "main.h"
template <class T> T* alloc(uint32_t& o) {
o = heap->alloc(sizeof(T));
return (T*)heap->ptr(o);
}
void Problem::axiom(term a, const char* file, const char* name) {
// Check where to put a formula object corresponding to this term.
auto& o = initialFormulas.gadd(a);
// If we have already record... | 38.814516 | 129 | 0.719302 | [
"object"
] |
a2027fd935e1d5306886e69d8a27d16394b79455 | 261,596 | cpp | C++ | 286-walls-and-gates/solution.cpp | darxsys/leetcode | 1174f0dbad56c6bfd8196bc4c14798b5f8cee418 | [
"MIT"
] | null | null | null | 286-walls-and-gates/solution.cpp | darxsys/leetcode | 1174f0dbad56c6bfd8196bc4c14798b5f8cee418 | [
"MIT"
] | null | null | null | 286-walls-and-gates/solution.cpp | darxsys/leetcode | 1174f0dbad56c6bfd8196bc4c14798b5f8cee418 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <unordered_set>
using namespace std;
class Solution {
public:
void ... | 3,442.052632 | 259,807 | 0.744878 | [
"vector"
] |
a206fcac79fdc4188940c8d3fda7a363146b6862 | 5,562 | cpp | C++ | samples/tests/chain_problem.cpp | henrytseng/Box2D | 022d9eccfcbebe339f1df3a17d205110d9623a80 | [
"MIT"
] | 1 | 2020-05-25T20:36:19.000Z | 2020-05-25T20:36:19.000Z | samples/tests/chain_problem.cpp | henrytseng/Box2D | 022d9eccfcbebe339f1df3a17d205110d9623a80 | [
"MIT"
] | null | null | null | samples/tests/chain_problem.cpp | henrytseng/Box2D | 022d9eccfcbebe339f1df3a17d205110d9623a80 | [
"MIT"
] | null | null | null | // MIT License
// Copyright (c) 2019 Erin Catto
// 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, merg... | 41.819549 | 91 | 0.552499 | [
"shape"
] |
a20bf595de77ed97412c904677ceee08bc4f1251 | 16,383 | cpp | C++ | src/external_plugins/term_buffer/internal_term_buffer.cpp | stonewell/wxglterm | 27480ed01e2832e98785b517ac17037a71cefe7c | [
"MIT"
] | 12 | 2017-11-23T16:02:41.000Z | 2019-12-29T08:36:36.000Z | src/external_plugins/term_buffer/internal_term_buffer.cpp | stonewell/wxglterm | 27480ed01e2832e98785b517ac17037a71cefe7c | [
"MIT"
] | 9 | 2017-12-04T15:55:51.000Z | 2019-11-01T13:08:21.000Z | src/external_plugins/term_buffer/internal_term_buffer.cpp | stonewell/wxglterm | 27480ed01e2832e98785b517ac17037a71cefe7c | [
"MIT"
] | 5 | 2018-09-02T07:35:13.000Z | 2019-12-29T08:36:37.000Z | #include "default_term_selection_decl.h"
#include "default_term_line.h"
#include "default_term_cell.h"
#include "internal_term_buffer.h"
#include "default_term_buffer_decl.h"
#include <vector>
#include <iostream>
#include <cassert>
#include <functional>
__InternalTermBuffer::__InternalTermBuffer(DefaultTermBuffer* t... | 29.895985 | 127 | 0.564732 | [
"vector"
] |
a213e6da67c5f4c511b6abcb03a5f4468b1fa1f2 | 1,087 | hpp | C++ | TP01_SDL/include/utils.hpp | diogenesvazmelo/Computacao_Grafica | 9a9742fc9e9ea19182c7b4dff5c02cf57188cd5d | [
"MIT"
] | null | null | null | TP01_SDL/include/utils.hpp | diogenesvazmelo/Computacao_Grafica | 9a9742fc9e9ea19182c7b4dff5c02cf57188cd5d | [
"MIT"
] | null | null | null | TP01_SDL/include/utils.hpp | diogenesvazmelo/Computacao_Grafica | 9a9742fc9e9ea19182c7b4dff5c02cf57188cd5d | [
"MIT"
] | null | null | null | #ifndef MY_UTILS_HPP
#define MY_UTILS_HPP
#if __linux__
#include <SDL2/SDL.h>
#elif _WIN32
#include <SDL.h>
#endif
#include <vector>
#include "../include/spaceship.hpp"
namespace utils {
enum STATES { PLAYING, VICTORY, PAUSED, GAME_OVER, EXIT };
SDL_Rect makeRect(int _x, int _y, int _h, int _w);
void reset(Spaceshi... | 31.057143 | 72 | 0.74149 | [
"vector"
] |
a21ce646a8093fa3df8891d6626442859dd9c3b7 | 3,898 | cpp | C++ | algorithms/graph theory/RoadsAndLibraries.cpp | HannoFlohr/hackerrank | 9644c78ce05a6b1bc5d8f542966781d53e5366e3 | [
"MIT"
] | null | null | null | algorithms/graph theory/RoadsAndLibraries.cpp | HannoFlohr/hackerrank | 9644c78ce05a6b1bc5d8f542966781d53e5366e3 | [
"MIT"
] | null | null | null | algorithms/graph theory/RoadsAndLibraries.cpp | HannoFlohr/hackerrank | 9644c78ce05a6b1bc5d8f542966781d53e5366e3 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
class City {
public:
int id;
vector<int> neighbors;
City(){}
City(int i) {
id = i;
neighbors = vector<int>();
}
};
int visitNeighbors(int n, const vector<City*>& cities, vector<bool>& visited, int&... | 25.311688 | 115 | 0.556183 | [
"vector"
] |
b8c5e20cc9522adaa5086538eb9a27ccfcc69b12 | 432 | cpp | C++ | code/ch11/11.1.2_maxslidingwindow.cpp | leetcode-pp/leetcode-pp1 | a1f9e46fdd2f480d2fcb94e76370e040e0f0a4f5 | [
"MIT"
] | 22 | 2021-02-23T13:42:28.000Z | 2022-03-02T11:19:28.000Z | code/ch11/11.1.2_maxslidingwindow.cpp | leetcode-pp/leetcode-pp1 | a1f9e46fdd2f480d2fcb94e76370e040e0f0a4f5 | [
"MIT"
] | 9 | 2021-06-16T10:42:01.000Z | 2021-08-24T09:06:29.000Z | code/ch11/11.1.2_maxslidingwindow.cpp | leetcode-pp/leetcode-pp1 | a1f9e46fdd2f480d2fcb94e76370e040e0f0a4f5 | [
"MIT"
] | 9 | 2021-02-20T08:29:00.000Z | 2021-09-18T08:52:25.000Z | class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
vector<int> res;
multiset<int> mysetting;
for (int i = 0; i < nums.size(); i++) {
mysetting.insert(nums[i]);
if (i >= k - 1) {
res.push_back(*mysetting.rbegin());
... | 27 | 65 | 0.476852 | [
"vector"
] |
b8c95e9b52feb61f74fdba615d4e032b377f0efa | 1,962 | cpp | C++ | MSVC/14.24.28314/crt/src/stl/iosptrs.cpp | 825126369/UCRT | 8853304fdc2a5c216658d08b6dbbe716aa2a7b1f | [
"MIT"
] | 2 | 2021-01-27T10:19:30.000Z | 2021-02-09T06:24:30.000Z | MSVC/14.24.28314/crt/src/stl/iosptrs.cpp | 825126369/UCRT | 8853304fdc2a5c216658d08b6dbbe716aa2a7b1f | [
"MIT"
] | null | null | null | MSVC/14.24.28314/crt/src/stl/iosptrs.cpp | 825126369/UCRT | 8853304fdc2a5c216658d08b6dbbe716aa2a7b1f | [
"MIT"
] | 1 | 2021-01-27T10:19:36.000Z | 2021-01-27T10:19:36.000Z | // Copyright (c) Microsoft Corporation.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
// iostream object pointers
#include <iostream>
#include <Windows.h>
_STD_BEGIN
#if defined(_M_CEE) && !defined(_M_CEE_MIXED)
#error This file cannot be built /clr:pure, etc. because of the use of _PGLOBAL.
#endif
#p... | 33.827586 | 99 | 0.729358 | [
"object"
] |
b8d497c3108ecffd637a2bd08869358dcb607803 | 8,322 | cpp | C++ | src/ShapeTools.cpp | tapeguy/heekscad | e5037d15d642551de756f352e4e14505c39ad7cf | [
"BSD-3-Clause"
] | null | null | null | src/ShapeTools.cpp | tapeguy/heekscad | e5037d15d642551de756f352e4e14505c39ad7cf | [
"BSD-3-Clause"
] | null | null | null | src/ShapeTools.cpp | tapeguy/heekscad | e5037d15d642551de756f352e4e14505c39ad7cf | [
"BSD-3-Clause"
] | null | null | null | // ShapeTools.cpp
// Copyright (c) 2009, Dan Heeks
// This program is released under the BSD license. See the file COPYING for details.
#include "stdafx.h"
#include "Face.h"
#include "ShapeTools.h"
#include "Vertex.h"
#include <BRepAdaptor_Curve.hxx>
const wxBitmap &CFaceList::GetIcon()
{
static wxBitmap* icon = NUL... | 26.758842 | 103 | 0.616318 | [
"shape",
"vector",
"solid"
] |
b8d6aeecb0181797c4dd6ae32edd330b5b62c9a3 | 11,956 | cpp | C++ | tester/tests/test_merge_float_cpu_random.cpp | 01org/idlf | 6f9b1986bc67856e3019ae3c83ed8d4b8a3b3972 | [
"BSD-3-Clause"
] | 375 | 2015-03-03T12:09:07.000Z | 2019-01-14T09:22:56.000Z | tester/tests/test_merge_float_cpu_random.cpp | intel/idlf | 6f9b1986bc67856e3019ae3c83ed8d4b8a3b3972 | [
"BSD-3-Clause"
] | 5 | 2015-07-14T02:48:45.000Z | 2016-07-08T08:02:06.000Z | tester/tests/test_merge_float_cpu_random.cpp | 01org/idlf | 6f9b1986bc67856e3019ae3c83ed8d4b8a3b3972 | [
"BSD-3-Clause"
] | 103 | 2015-04-18T10:57:02.000Z | 2018-07-29T23:56:12.000Z | /*
Copyright (c) 2015, Intel Corporation
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 conditions and the following disclaimer.
* Redis... | 42.098592 | 151 | 0.621613 | [
"object"
] |
b8deef42cceb62789877a8f1b1d862901a731d2f | 2,074 | cpp | C++ | ICCardSystem/CEmployeeDB.cpp | zaxai/ICCardSystem | ccd02bd90d0481b90061d3c99bd40c2adc54ebd4 | [
"MIT"
] | 2 | 2019-03-30T01:58:59.000Z | 2019-09-12T06:50:37.000Z | ICCardSystem/CEmployeeDB.cpp | zaxai/ICCardSystem | ccd02bd90d0481b90061d3c99bd40c2adc54ebd4 | [
"MIT"
] | null | null | null | ICCardSystem/CEmployeeDB.cpp | zaxai/ICCardSystem | ccd02bd90d0481b90061d3c99bd40c2adc54ebd4 | [
"MIT"
] | 3 | 2018-12-21T18:31:27.000Z | 2020-12-07T05:44:22.000Z | #include "stdafx.h"
#include "CEmployeeDB.h"
CEmployeeDB::CEmployeeDB()
: m_strPathDB(_T(""))
{
m_strPathDB = ZUtil::GetExeCatalogPath() + _T("\\Data.mdb");
CreateTable();
}
CEmployeeDB::~CEmployeeDB()
{
}
void CEmployeeDB::CreateTable()
{
ZSqlite3 zsql;
zsql.OpenDB(m_strPathDB);
CString strSql;
strSql = _... | 23.83908 | 205 | 0.690935 | [
"vector"
] |
b8e6f5846f74080776b97ee0b7ef72a5488fb02a | 37,658 | cpp | C++ | docs/template_plugin/tests/functional/op_reference/convert.cpp | ethz-asl/openvino | b4ad7a1755b4799f92ef042bacc719ec3c0c1cbd | [
"Apache-2.0"
] | null | null | null | docs/template_plugin/tests/functional/op_reference/convert.cpp | ethz-asl/openvino | b4ad7a1755b4799f92ef042bacc719ec3c0c1cbd | [
"Apache-2.0"
] | 11 | 2021-08-04T10:06:53.000Z | 2022-02-21T13:10:58.000Z | docs/template_plugin/tests/functional/op_reference/convert.cpp | ethz-asl/openvino | b4ad7a1755b4799f92ef042bacc719ec3c0c1cbd | [
"Apache-2.0"
] | null | null | null | // Copyright (C) 2018-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include <gtest/gtest.h>
#include <ie_core.hpp>
#include <ie_ngraph_utils.hpp>
#include <ngraph/ngraph.hpp>
#include <shared_test_classes/base/layer_test_utils.hpp>
#include <tuple>
#include "base_reference_test.hpp"
using namesp... | 85.006772 | 160 | 0.572999 | [
"shape",
"vector"
] |
b8f02f5f980f2a2bad4057192ea2fe915587b030 | 31,870 | cpp | C++ | src/lower/lowerer_impl.cpp | ychen306/taco | c81053c0388eeaecbb6e59403dadefe2a7ad0f2d | [
"MIT"
] | null | null | null | src/lower/lowerer_impl.cpp | ychen306/taco | c81053c0388eeaecbb6e59403dadefe2a7ad0f2d | [
"MIT"
] | null | null | null | src/lower/lowerer_impl.cpp | ychen306/taco | c81053c0388eeaecbb6e59403dadefe2a7ad0f2d | [
"MIT"
] | null | null | null | #include "taco/lower/lowerer_impl.h"
#include "taco/index_notation/index_notation.h"
#include "taco/index_notation/index_notation_nodes.h"
#include "taco/index_notation/index_notation_visitor.h"
#include "taco/ir/ir.h"
#include "ir/ir_generators.h"
#include "taco/ir/simplify.h"
#include "taco/lower/iterator.h"
#includ... | 35.137817 | 83 | 0.649137 | [
"vector"
] |
b8f221a9ff06958de14c5bd22ecbfb4979ad5f22 | 1,658 | hh | C++ | DRsim/include/HepMCG4Interface.hh | chanchoen/eic-dual-readout | 8cea1f6df9f837c9355416ad84df33a8de2ab600 | [
"Apache-2.0"
] | 1 | 2021-04-19T02:33:00.000Z | 2021-04-19T02:33:00.000Z | DRsim/include/HepMCG4Interface.hh | chanchoen/eic-dual-readout | 8cea1f6df9f837c9355416ad84df33a8de2ab600 | [
"Apache-2.0"
] | 1 | 2021-04-16T05:37:08.000Z | 2021-07-21T12:05:07.000Z | DRsim/include/HepMCG4Interface.hh | chanchoen/eic-dual-readout | 8cea1f6df9f837c9355416ad84df33a8de2ab600 | [
"Apache-2.0"
] | 3 | 2021-04-25T23:02:22.000Z | 2021-07-19T08:14:49.000Z | #ifndef HEPMC_G4_INTERFACE_h
#define HEPMC_G4_INTERFACE_h 1
#include "G4VPrimaryGenerator.hh"
#include "HepMC3/GenEvent.h"
#include "HepMC3/GenVertex.h"
#include "HepMC3/GenParticle.h"
/// A base class for primary generation via HepMC object.
/// This class is derived from G4VPrimaryGenerator.
class HepMCG4Interface... | 36.043478 | 91 | 0.767189 | [
"object"
] |
b8f641fdaae3d1ce9e815646993259307ee86509 | 1,227 | cpp | C++ | 639-2/2.cpp | deepankar/topcoder-srm | 0efc596662211bf74ede4896eb43b787d31f8a83 | [
"MIT"
] | null | null | null | 639-2/2.cpp | deepankar/topcoder-srm | 0efc596662211bf74ede4896eb43b787d31f8a83 | [
"MIT"
] | null | null | null | 639-2/2.cpp | deepankar/topcoder-srm | 0efc596662211bf74ede4896eb43b787d31f8a83 | [
"MIT"
] | null | null | null | //passed
#include <limits.h>
#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
using namespace std;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<string> VS;
typedef long long int lin... | 19.171875 | 55 | 0.562347 | [
"vector"
] |
b8f92976d89e8c53f07c64939c7dfc3148ea25ca | 26,806 | cpp | C++ | src/pke/lib/bv.cpp | marcelmon/PALISADE_capstone | 2cfd1626b26576f8fe93bb3a424f934ef700c5b2 | [
"BSD-2-Clause"
] | null | null | null | src/pke/lib/bv.cpp | marcelmon/PALISADE_capstone | 2cfd1626b26576f8fe93bb3a424f934ef700c5b2 | [
"BSD-2-Clause"
] | null | null | null | src/pke/lib/bv.cpp | marcelmon/PALISADE_capstone | 2cfd1626b26576f8fe93bb3a424f934ef700c5b2 | [
"BSD-2-Clause"
] | null | null | null | /*
* @file bv.cpp - BV scheme implementation.
* @author TPOC: palisade@njit.edu
*
* @copyright Copyright (c) 2017, New Jersey Institute of Technology (NJIT)
* All rights reserved.
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following condit... | 35.646277 | 755 | 0.753637 | [
"vector"
] |
b8fda7e68c2704ff3dc5f968781c99b9dfacd998 | 1,613 | cpp | C++ | main.cpp | Charl86/Random-Sequences | b036ca15190eea5f09fd610338959cb6ba2fbd5a | [
"MIT"
] | null | null | null | main.cpp | Charl86/Random-Sequences | b036ca15190eea5f09fd610338959cb6ba2fbd5a | [
"MIT"
] | null | null | null | main.cpp | Charl86/Random-Sequences | b036ca15190eea5f09fd610338959cb6ba2fbd5a | [
"MIT"
] | null | null | null | /*
This program takes a file of randomly generated sequences and processess them, or
creates a new file of randomly generated sequences in order to process it. During
the processing phase this program will normalize the sequences, find the mean value,
find the standard deviation and sorts them using the... | 36.659091 | 88 | 0.717297 | [
"object",
"vector"
] |
b8ffaa1c3dde0438482b12ba6c1bf86bf69668c5 | 3,272 | cpp | C++ | Tests/2018-2019/T2/Tests/tests.cpp | DoStini/FEUP-AEDA | 4ac4bbeda07c17837a13a81de197bfcc7857c3be | [
"MIT"
] | null | null | null | Tests/2018-2019/T2/Tests/tests.cpp | DoStini/FEUP-AEDA | 4ac4bbeda07c17837a13a81de197bfcc7857c3be | [
"MIT"
] | 1 | 2020-09-30T18:59:40.000Z | 2020-10-09T22:13:39.000Z | Tests/2018-2019/T2/Tests/tests.cpp | DoStini/FEUP-AEDA | 4ac4bbeda07c17837a13a81de197bfcc7857c3be | [
"MIT"
] | null | null | null | #include <gtest/gtest.h>
#include <gmock/gmock.h>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <sstream>
#include <vector>
#include <time.h>
#include "Kart.h"
#include "CStack.h"
#include "CSimpleList.h"
using testing::Eq;
using namespace std;
TEST(test_1, test_a){
CGrupo grupo1;
grupo1.cr... | 25.364341 | 88 | 0.610636 | [
"vector"
] |
77149f69a98cabba63807358ec025b3f98aa0e35 | 5,545 | hpp | C++ | dynd/include/type_unpack.hpp | mwiebe/dynd-python | 45ffecaf7887761a5634140f0ed120b33ace58a3 | [
"BSD-2-Clause"
] | 93 | 2015-01-29T14:00:57.000Z | 2021-11-23T14:37:27.000Z | dynd/include/type_unpack.hpp | ContinuumIO/dynd-python | bae7afb8eb604b0bce09befc9e896c8ec8357aaa | [
"BSD-2-Clause"
] | 143 | 2015-01-04T12:30:24.000Z | 2016-09-29T18:36:22.000Z | dynd/include/type_unpack.hpp | ContinuumIO/dynd-python | bae7afb8eb604b0bce09befc9e896c8ec8357aaa | [
"BSD-2-Clause"
] | 20 | 2015-06-08T11:54:46.000Z | 2021-03-09T07:57:25.000Z | //
// Copyright (C) 2011-15 DyND Developers
// BSD 2-Clause License, see LICENSE.txt
//
#pragma once
#include <Python.h>
#include <type_traits>
#include <dynd/type_registry.hpp>
#include "types/pyobject_type.hpp"
using namespace dynd;
// Unpack and convert a single element to a PyObject.
template <typename T,
... | 29.184211 | 119 | 0.676826 | [
"vector"
] |
77167c6e8ec53c08a8eda83a9764ba050d7a3312 | 1,268 | cpp | C++ | SimpleLearn/13.MMapTest01/GetHisData.cpp | codeworkscn/learn-cpp | c72b2330934bdead2489509cd89343e666e631b4 | [
"Apache-2.0"
] | null | null | null | SimpleLearn/13.MMapTest01/GetHisData.cpp | codeworkscn/learn-cpp | c72b2330934bdead2489509cd89343e666e631b4 | [
"Apache-2.0"
] | null | null | null | SimpleLearn/13.MMapTest01/GetHisData.cpp | codeworkscn/learn-cpp | c72b2330934bdead2489509cd89343e666e631b4 | [
"Apache-2.0"
] | null | null | null |
#include "PutHisData.h"
DWORD GetMapMemory(unsigned char *szResult,long len,const char* svcname)
{
HANDLE hMapFile = NULL;
PVOID pView = NULL;
DWORD dwError = 0;
char fullmapname[_MAX_FNAME+1];
char tempsvcname[256];
strcpy_s(tempsvcname,128,svcname);
sprintf_s(fullmapname,_MAX_FNAME+1,"%s%s",MAP_PREFIX,strlw... | 23.924528 | 82 | 0.634069 | [
"object"
] |
772120d32178922e9ca36b17e7d48df82ffe49ff | 41,432 | cpp | C++ | wznmcmbd/CrdWznmApp/DlgWznmAppWrite_blks.cpp | mpsitech/wznm-WhizniumSBE | 4911d561b28392d485c46e98fb915168d82b3824 | [
"MIT"
] | 3 | 2020-09-20T16:24:48.000Z | 2021-12-01T19:44:51.000Z | wznmcmbd/CrdWznmApp/DlgWznmAppWrite_blks.cpp | mpsitech/wznm-WhizniumSBE | 4911d561b28392d485c46e98fb915168d82b3824 | [
"MIT"
] | null | null | null | wznmcmbd/CrdWznmApp/DlgWznmAppWrite_blks.cpp | mpsitech/wznm-WhizniumSBE | 4911d561b28392d485c46e98fb915168d82b3824 | [
"MIT"
] | null | null | null | /**
* \file DlgWznmAppWrite_blks.cpp
* job handler for job DlgWznmAppWrite (implementation of blocks)
* \copyright (C) 2016-2020 MPSI Technologies GmbH
* \author Alexander Wirthmueller (auto-generation)
* \date created: 28 Nov 2020
*/
// IP header --- ABOVE
using namespace std;
using namespace Sbecore;
using nam... | 26.730323 | 239 | 0.624348 | [
"vector"
] |
7722564fff555d3e6030ca86cf06eb32667d10fc | 1,331 | cpp | C++ | PC/SDK/Entity/entity.cpp | sn0wyQ/SQ-Project-CSGO-Arduino | 50515e44b55d9e867c8eb60fa79e4737244b3990 | [
"BSD-3-Clause"
] | 25 | 2021-07-15T14:31:06.000Z | 2022-03-26T11:51:30.000Z | PC/SDK/Entity/entity.cpp | sn0wyQ/SQ-Project-CSGO-Arduino | 50515e44b55d9e867c8eb60fa79e4737244b3990 | [
"BSD-3-Clause"
] | 7 | 2021-07-16T07:25:00.000Z | 2022-02-25T13:20:17.000Z | PC/SDK/Entity/entity.cpp | sn0wyQ/SQ-Project-CSGO-Arduino | 50515e44b55d9e867c8eb60fa79e4737244b3990 | [
"BSD-3-Clause"
] | null | null | null | #include "entity.h"
Entity::Entity(DWORD address) : address_(address) {}
DWORD Entity::GetAddress() const {
return address_;
}
int Entity::GetHP() const {
return Memory::Read<int>(address_ + NetVars::m_iHealth);
}
bool Entity::IsAlive() const {
return (this->GetHP() > 0);
}
bool Entity::IsDormant() const {
... | 25.596154 | 78 | 0.67994 | [
"vector"
] |
772d914c177d0a5f56b92d307506729d1c6f4a9f | 30,686 | hxx | C++ | itkCudaRWSegmentationFilter/itkCudaRWSegmentationFilter.hxx | enricperera/itkRWSegmentationFilter | 0188a4cfa31c8798301af58c37b28d430efdef06 | [
"Apache-2.0"
] | 1 | 2021-01-20T13:29:02.000Z | 2021-01-20T13:29:02.000Z | itkCudaRWSegmentationFilter/itkCudaRWSegmentationFilter.hxx | enricperera/itkRWSegmentationFilter | 0188a4cfa31c8798301af58c37b28d430efdef06 | [
"Apache-2.0"
] | 1 | 2020-04-10T09:48:45.000Z | 2020-04-10T09:48:45.000Z | Plugins/org.upf.rwSegmentationPlugin/src/internal/itkCudaRWSegmentationFilter/itkCudaRWSegmentationFilter.hxx | enricperera/mitkRWSegmentationPlugin | 20e4bbb7bd977fdc929e694a233410af1aa67cab | [
"BSD-2-Clause"
] | null | null | null | /*=========================================================================
*
* Copyright Universitat Pompeu Fabra, Department of Information and
* Comunication Technologies.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
... | 35.932084 | 200 | 0.629831 | [
"vector"
] |
772dcd2a48fdd525df7d56e8bf01725152a348be | 918 | cpp | C++ | Entry 1 - Into the Unknown/ex2_0_region_database.cpp | tensorush/Cpp-Deep-Dive | fa2aa46b906662cf29b48359a2f17c3ddc1b1792 | [
"MIT"
] | 1 | 2021-01-24T22:42:29.000Z | 2021-01-24T22:42:29.000Z | Entry 1 - Into the Unknown/ex2_0_region_database.cpp | geotrush/Cpp-Deep-Dive | fa2aa46b906662cf29b48359a2f17c3ddc1b1792 | [
"MIT"
] | null | null | null | Entry 1 - Into the Unknown/ex2_0_region_database.cpp | geotrush/Cpp-Deep-Dive | fa2aa46b906662cf29b48359a2f17c3ddc1b1792 | [
"MIT"
] | 1 | 2021-09-12T11:41:35.000Z | 2021-09-12T11:41:35.000Z | /*
Task
You should write a function that accepts a regional database and
returns the maximal number of region repetitions.
*/
#include <algorithm>
#include <string>
#include <vector>
#include <tuple>
#include <map>
using std::max;
using std::map;
using std::tuple;
using std::string;
using std::vector;
enum class Lan... | 21.348837 | 78 | 0.700436 | [
"vector"
] |
77322436aeb5739095e6426849e95b4739c2ccff | 469 | cpp | C++ | BaekJoon/11650.cpp | falconlee236/Algorithm_Practice | 4e6e380a0e6c840525ca831a05c35253eeaaa25c | [
"MIT"
] | null | null | null | BaekJoon/11650.cpp | falconlee236/Algorithm_Practice | 4e6e380a0e6c840525ca831a05c35253eeaaa25c | [
"MIT"
] | null | null | null | BaekJoon/11650.cpp | falconlee236/Algorithm_Practice | 4e6e380a0e6c840525ca831a05c35253eeaaa25c | [
"MIT"
] | null | null | null | /*11650*/
/*Got it!*/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n; cin >> n;
vector<pair<int, int>> v;
for(int i = 0; i < n; i++){
int a, b; cin >> a >> b;
v.push_back(m... | 23.45 | 80 | 0.513859 | [
"vector"
] |
773d9ae81998353c14a173d86bf2681c7ac22eb2 | 7,347 | cpp | C++ | applications/ParticlesEditor/src/Objects/ParticleField.cpp | AluminiumRat/mtt | 3052f8ad0ffabead05a1033e1d714a61e77d0aa8 | [
"MIT"
] | null | null | null | applications/ParticlesEditor/src/Objects/ParticleField.cpp | AluminiumRat/mtt | 3052f8ad0ffabead05a1033e1d714a61e77d0aa8 | [
"MIT"
] | null | null | null | applications/ParticlesEditor/src/Objects/ParticleField.cpp | AluminiumRat/mtt | 3052f8ad0ffabead05a1033e1d714a61e77d0aa8 | [
"MIT"
] | null | null | null | #include <algorithm>
#include <exception>
#include <mtt/utilities/Abort.h>
#include <Objects/Fluid/FluidObject.h>
#include <Objects/EmitterObject.h>
#include <Objects/ModificatorObject.h>
#include <Objects/ParticleField.h>
ParticleField::ParticleField( const QString& name,
bool canBeRen... | 27.620301 | 138 | 0.654417 | [
"vector"
] |
77476ecfc9726ed5db62bafea578e3cd072f211f | 1,050 | cpp | C++ | ACM/Math and Geometry/SieveOfEratosthenes_RepeatingGoldbachs.cpp | JahodaPaul/FIT_CTU | 2d96f18c7787ddfe340a15a36da6eea910225461 | [
"MIT"
] | 17 | 2019-03-09T17:13:40.000Z | 2022-03-05T14:42:05.000Z | ACM/Math and Geometry/SieveOfEratosthenes_RepeatingGoldbachs.cpp | JahodaPaul/FIT_CTU | 2d96f18c7787ddfe340a15a36da6eea910225461 | [
"MIT"
] | 1 | 2018-06-23T15:57:32.000Z | 2018-06-23T15:57:32.000Z | ACM/Math and Geometry/SieveOfEratosthenes_RepeatingGoldbachs.cpp | JahodaPaul/FIT_CTU | 2d96f18c7787ddfe340a15a36da6eea910225461 | [
"MIT"
] | 16 | 2019-04-09T00:10:55.000Z | 2022-02-21T20:28:05.000Z | #include <bits/stdc++.h>
using namespace std;
int n;
int primes[1000007];
void SieveOfEratosthenes(int n)
{
// Create a boolean array "prime[0..n]" and initialize
// all entries it as true. A value in prime[i] will
// finally be false if i is Not a prime, else true.
vector<bool> prime;
prime.res... | 20.192308 | 58 | 0.475238 | [
"vector"
] |
7747f1df99a5759723a073c100332fab0ffd1166 | 2,656 | hpp | C++ | Sub3D/Tools.Depth.hpp | slavanap/ssifSource | 739f42b62cffe4072c3a9ec602e5c595c8af7be8 | [
"MIT"
] | 15 | 2016-06-23T03:01:56.000Z | 2022-02-15T23:19:17.000Z | Sub3D/Tools.Depth.hpp | slavanap/ssifSource | 739f42b62cffe4072c3a9ec602e5c595c8af7be8 | [
"MIT"
] | null | null | null | Sub3D/Tools.Depth.hpp | slavanap/ssifSource | 739f42b62cffe4072c3a9ec602e5c595c8af7be8 | [
"MIT"
] | 3 | 2018-09-27T07:04:41.000Z | 2020-07-15T05:50:22.000Z | //
// 3D subtitle rendering tool
// Copyright 2016 Vyacheslav Napadovsky.
//
// 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
/... | 30.883721 | 103 | 0.695783 | [
"3d"
] |
7748bb229a2c912d070922cbf13d88b506c3b70d | 4,591 | cpp | C++ | Google Kickstart/2019/Round 2019/B.cpp | Mindjolt2406/Competitive-Programming | d000d98bf7005ee4fb809bcea2f110e4c4793b80 | [
"MIT"
] | 2 | 2018-12-11T14:37:24.000Z | 2022-01-23T18:11:54.000Z | Google Kickstart/2019/Round 2019/B.cpp | Mindjolt2406/Competitive-Programming | d000d98bf7005ee4fb809bcea2f110e4c4793b80 | [
"MIT"
] | null | null | null | Google Kickstart/2019/Round 2019/B.cpp | Mindjolt2406/Competitive-Programming | d000d98bf7005ee4fb809bcea2f110e4c4793b80 | [
"MIT"
] | null | null | null | /*
Rathin Bhargava
IIIT Bangalore
*/
#include<bits/stdc++.h>
#define mt make_tuple
#define mp make_pair
#define pu push_back
#define INF 1000000001
#define MOD 1000000007
#define ll long long int
#define ld long double
#define vi vector<int>
#define vll vector<long long int>
#define fi first
#define se second
#define ... | 26.537572 | 152 | 0.464169 | [
"vector"
] |
77494f80b06a53b787a4ea26403a76a6b7d04108 | 695 | hpp | C++ | Source/System/Graphics/DataType/MatrixData.hpp | arian153/Engine-5 | 34f85433bc0a74a7ebe7da350d3f3698de77226e | [
"MIT"
] | 2 | 2020-01-09T07:48:24.000Z | 2020-01-09T07:48:26.000Z | Source/System/Graphics/DataType/MatrixData.hpp | arian153/Engine-5 | 34f85433bc0a74a7ebe7da350d3f3698de77226e | [
"MIT"
] | null | null | null | Source/System/Graphics/DataType/MatrixData.hpp | arian153/Engine-5 | 34f85433bc0a74a7ebe7da350d3f3698de77226e | [
"MIT"
] | null | null | null | #pragma once
#include "../../Math/Algebra/Matrix44.hpp"
namespace Engine5
{
class MatrixData
{
public:
MatrixData()
{
}
MatrixData(const Matrix44& m, const Matrix44& v, const Matrix44& p)
: model(m), view(v), projection(p)
{
}
MatrixData... | 17.820513 | 75 | 0.48777 | [
"model"
] |
774bf3e8104ceba3089a9825a0514abba500b358 | 45,060 | cpp | C++ | source/DefaultSceneRenderer/DefaultSceneRenderer.cpp | mackron/GTGameEngine | 380d1e01774fe6bc2940979e4e5983deef0bf082 | [
"BSD-3-Clause"
] | 31 | 2015-03-19T08:44:48.000Z | 2021-12-15T20:52:31.000Z | source/DefaultSceneRenderer/DefaultSceneRenderer.cpp | mackron/GTGameEngine | 380d1e01774fe6bc2940979e4e5983deef0bf082 | [
"BSD-3-Clause"
] | 19 | 2015-07-09T09:02:44.000Z | 2016-06-09T03:51:03.000Z | source/DefaultSceneRenderer/DefaultSceneRenderer.cpp | mackron/GTGameEngine | 380d1e01774fe6bc2940979e4e5983deef0bf082 | [
"BSD-3-Clause"
] | 3 | 2017-10-04T23:38:18.000Z | 2022-03-07T08:27:13.000Z | // Copyright (C) 2011 - 2014 David Reid. See included LICENCE.
#include <GTGE/DefaultSceneRenderer/DefaultSceneRenderer.hpp>
#include <GTGE/DefaultSceneRenderer/DefaultSceneRenderer_SinglePassPipeline.hpp>
#include <GTGE/DefaultSceneRenderer/DefaultSceneRenderer_MultiPassPipeline.hpp>
#include <GTGE/ShaderLibrary.hpp>... | 39.665493 | 229 | 0.640524 | [
"mesh",
"render",
"vector",
"transform"
] |
774ecc1e0d00569c0bafa70c527da91833aad864 | 3,039 | cpp | C++ | src/GLEngine/graphics/Camera.cpp | michaelbuerger/GLEngine | cf0bc2d7e1e955c2fcb3fafb154a2af7a5e3cd6b | [
"MIT"
] | 1 | 2019-08-01T04:53:45.000Z | 2019-08-01T04:53:45.000Z | src/GLEngine/graphics/Camera.cpp | michaelbuerger/GLEngine | cf0bc2d7e1e955c2fcb3fafb154a2af7a5e3cd6b | [
"MIT"
] | null | null | null | src/GLEngine/graphics/Camera.cpp | michaelbuerger/GLEngine | cf0bc2d7e1e955c2fcb3fafb154a2af7a5e3cd6b | [
"MIT"
] | 2 | 2020-07-20T20:43:24.000Z | 2020-12-07T06:02:14.000Z | #include "GLEngine/graphics/Camera.hpp"
#include "GLEngine/graphics/Transform.hpp"
#include "glm/gtc/matrix_transform.hpp"
namespace GLEngine {
Camera::Camera(const Transform &transform)
{
m_projectionMatrixNeedsRecalc = true;
this->transform = transform;
m_fov = 90.0f;
m_aspect... | 31.329897 | 155 | 0.649227 | [
"transform"
] |
7758b8c17257b53b4e159a2d98debfae6b8d0dbf | 699 | cpp | C++ | src/Core/ResourceManager/FileLoaderManager.cpp | bluespeck/OakVR | 65d56942af390dc2ab2d969b44285d23bd53f139 | [
"MIT"
] | null | null | null | src/Core/ResourceManager/FileLoaderManager.cpp | bluespeck/OakVR | 65d56942af390dc2ab2d969b44285d23bd53f139 | [
"MIT"
] | null | null | null | src/Core/ResourceManager/FileLoaderManager.cpp | bluespeck/OakVR | 65d56942af390dc2ab2d969b44285d23bd53f139 | [
"MIT"
] | null | null | null | #include "FileLoaderManager.h"
#include <algorithm>
namespace oakvr
{
namespace core
{
std::vector<sp<FileLoader>> &FileLoaderManager::GetFileLoaders()
{
static std::vector<sp<FileLoader>> s_fileLoaders;
return s_fileLoaders;
}
auto FileLoaderManager::RegisterFileLoader(sp<FileLoader> pFileLoader) -> ... | 27.96 | 180 | 0.726753 | [
"vector"
] |
775f4ce173e5ae887c451e5e163180cb3bdd8812 | 1,336 | cpp | C++ | others/groupAnagrams.cpp | wanghengg/LeetCode | 4f73d7e176c8de5d2d9b87ab2812f7aa80c20a79 | [
"Apache-2.0"
] | null | null | null | others/groupAnagrams.cpp | wanghengg/LeetCode | 4f73d7e176c8de5d2d9b87ab2812f7aa80c20a79 | [
"Apache-2.0"
] | null | null | null | others/groupAnagrams.cpp | wanghengg/LeetCode | 4f73d7e176c8de5d2d9b87ab2812f7aa80c20a79 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <unordered_map>
#include <vector>
#include <string>
#include <algorithm>
/*
* 用hash map求解
*/
class Solution{
public:
std::vector<std::vector<std::string>> groupAnagrams(std::vector<std::string>& data) {
std::unordered_map<std::string, int> hash;
std::vector<std::vecto... | 29.043478 | 89 | 0.511976 | [
"vector"
] |
7767a7f45f7e3bd46e5db019289c805a1a2504a2 | 1,499 | cpp | C++ | Sid's Levels/Level - 3/Graphs/Word Ladder - Optimized.cpp | Tiger-Team-01/DSA-A-Z-Practice | e08284ffdb1409c08158dd4e90dc75dc3a3c5b18 | [
"MIT"
] | 14 | 2021-08-22T18:21:14.000Z | 2022-03-08T12:04:23.000Z | Sid's Levels/Level - 3/Graphs/Word Ladder - Optimized.cpp | Tiger-Team-01/DSA-A-Z-Practice | e08284ffdb1409c08158dd4e90dc75dc3a3c5b18 | [
"MIT"
] | 1 | 2021-10-17T18:47:17.000Z | 2021-10-17T18:47:17.000Z | Sid's Levels/Level - 3/Graphs/Word Ladder - Optimized.cpp | Tiger-Team-01/DSA-A-Z-Practice | e08284ffdb1409c08158dd4e90dc75dc3a3c5b18 | [
"MIT"
] | 5 | 2021-09-01T08:21:12.000Z | 2022-03-09T12:13:39.000Z | //Usage of dictionary for lookups
class Solution {
public:
//OM GAN GANAPATHAYE NAMO NAMAH
//JAI SHRI RAM
//JAI BAJRANGBALI
//AMME NARAYANA, DEVI NARAYANA, LAKSHMI NARAYANA, BHADRE NARAYANA
struct Node
{
string s;
int d;
};
int ladderLength(string beginWord, string e... | 28.826923 | 82 | 0.393596 | [
"vector"
] |
776b451a5b85ef299d6a11ec2bbbde5f5f755636 | 6,129 | cxx | C++ | src/BinnedCountsCache.cxx | fermi-lat/Likelihood | 78f6bd72449896e0699ffd832826f1b0dfffa3cc | [
"BSD-3-Clause"
] | 5 | 2017-11-09T09:27:27.000Z | 2020-06-26T14:22:37.000Z | src/BinnedCountsCache.cxx | fermi-lat/Likelihood | 78f6bd72449896e0699ffd832826f1b0dfffa3cc | [
"BSD-3-Clause"
] | 60 | 2018-01-11T01:57:51.000Z | 2022-02-25T19:49:40.000Z | src/BinnedCountsCache.cxx | fermi-lat/Likelihood | 78f6bd72449896e0699ffd832826f1b0dfffa3cc | [
"BSD-3-Clause"
] | 2 | 2018-11-14T19:17:59.000Z | 2020-01-13T11:43:34.000Z | /**
* @file BinnedCountsCache.cxx
* @brief
* @author
*
* $Header: /nfs/slac/g/glast/ground/cvs/Likelihood/src/BinnedCountsCache.cxx,v 1.3 2017/10/06 01:31:00 echarles Exp $
*/
#include "Likelihood/BinnedCountsCache.h"
#include <stdexcept>
#include "Likelihood/WeightMap.h"
#include "Likelihood/FileUtils.h"
#... | 30.192118 | 118 | 0.653124 | [
"vector",
"model"
] |
776e54a312cd4658419f25a63e08954edee3cff2 | 5,699 | cpp | C++ | matrix_chain_multiplication.cpp | SAK90/dynamicProgramming | 09dbcd701fd121582956812ec4200bb4f81b8419 | [
"MIT"
] | null | null | null | matrix_chain_multiplication.cpp | SAK90/dynamicProgramming | 09dbcd701fd121582956812ec4200bb4f81b8419 | [
"MIT"
] | null | null | null | matrix_chain_multiplication.cpp | SAK90/dynamicProgramming | 09dbcd701fd121582956812ec4200bb4f81b8419 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
/*
int MCM_recursive(vector<int>& v, int i, int j){
// dimension of matrix a[i] = v[i-1] x v[i]
if(i>=j)
return 0;
int ans = INT_MAX;
for(int k = i; k <= j-1; k++){
int temp_ans_left = MCM_recursive(v, i, k);
int temp_ans... | 26.506977 | 95 | 0.451307 | [
"vector"
] |
7770d09f1872990f7922c525a5895b68f02103be | 4,664 | cpp | C++ | IrrlichtExtensions/TouchKey.cpp | wolfgang1991/CommonLibraries | 949251019cc8dd532938d16ab85a4e772eb6817e | [
"Zlib"
] | null | null | null | IrrlichtExtensions/TouchKey.cpp | wolfgang1991/CommonLibraries | 949251019cc8dd532938d16ab85a4e772eb6817e | [
"Zlib"
] | 1 | 2020-07-31T13:20:54.000Z | 2020-08-06T15:45:39.000Z | IrrlichtExtensions/TouchKey.cpp | wolfgang1991/CommonLibraries | 949251019cc8dd532938d16ab85a4e772eb6817e | [
"Zlib"
] | null | null | null | #include <TouchKey.h>
#include <ICommonAppContext.h>
#include <timing.h>
#include <FlexibleFont.h>
#include <mathUtils.h>
#include <Drawer2D.h>
#include <IrrlichtDevice.h>
using namespace std;
using namespace irr;
using namespace core;
using namespace video;
using namespace gui;
#define PRESS_SCALE 0.75
TouchKey::T... | 33.314286 | 178 | 0.733491 | [
"render"
] |
a5666baaba944991bda93cecdc3c1aaf7c31ecb9 | 2,233 | hpp | C++ | TFD_Units/Classes/Vehicles/SoldierSurvival.hpp | Heartbroken-Git/TFP_CORE | 2102248d548f2a2d69794f6c47932f9a998c5c3a | [
"RSA-MD",
"Naumen",
"Condor-1.1",
"MS-PL"
] | null | null | null | TFD_Units/Classes/Vehicles/SoldierSurvival.hpp | Heartbroken-Git/TFP_CORE | 2102248d548f2a2d69794f6c47932f9a998c5c3a | [
"RSA-MD",
"Naumen",
"Condor-1.1",
"MS-PL"
] | 37 | 2016-03-29T06:25:42.000Z | 2021-01-03T19:12:19.000Z | TFD_Units/Classes/Vehicles/SoldierSurvival.hpp | Heartbroken-Git/TFP_CORE | 2102248d548f2a2d69794f6c47932f9a998c5c3a | [
"RSA-MD",
"Naumen",
"Condor-1.1",
"MS-PL"
] | 2 | 2017-12-13T23:10:05.000Z | 2019-03-16T11:55:34.000Z | class TFD_Plouf_UBACS: b_soldier_survival_F // Define of a new class, which parameters are inherited from B_Soldier_base_F, with exception of those defined below.
{
author = "Heartbroken"; // The name of the author of the asset, which is displayed in the editor.
displayName = "Sauveteur-plongeur (UBA... | 101.5 | 217 | 0.667712 | [
"model"
] |
a56daf82fdf4967917d4b89d3f3ab2408182cd02 | 1,188 | cpp | C++ | xdl-algorithm-solution/TDMServing/test/model/blaze/blaze_model_conf_test.cpp | Ru-Xiang/x-deeplearning | 04cc0497150920c64b06bb8c314ef89977a3427a | [
"Apache-2.0"
] | 4,071 | 2018-12-13T04:17:38.000Z | 2022-03-30T03:29:35.000Z | xdl-algorithm-solution/TDMServing/test/model/blaze/blaze_model_conf_test.cpp | laozhuang727/x-deeplearning | 781545783a4e2bbbda48fc64318fb2c6d8bbb3cc | [
"Apache-2.0"
] | 359 | 2018-12-21T01:14:57.000Z | 2022-02-15T07:18:02.000Z | xdl-algorithm-solution/TDMServing/test/model/blaze/blaze_model_conf_test.cpp | laozhuang727/x-deeplearning | 781545783a4e2bbbda48fc64318fb2c6d8bbb3cc | [
"Apache-2.0"
] | 1,054 | 2018-12-20T09:57:42.000Z | 2022-03-29T07:16:53.000Z | /* Copyright (C) 2016-2018 Alibaba Group Holding 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
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed ... | 30.461538 | 80 | 0.723906 | [
"model"
] |
a573d0041e4318272e1b9bcd087c11156e2dcc29 | 2,598 | cpp | C++ | CppLisp/CppLispInterpreter/Exception.cpp | mneuroth/fuel-lang | 3b21d058a0eaf43df5c73685a4079bdb877c3c07 | [
"MIT"
] | 1 | 2018-08-14T00:11:35.000Z | 2018-08-14T00:11:35.000Z | CppLisp/CppLispInterpreter/Exception.cpp | mneuroth/fuel-lang | 3b21d058a0eaf43df5c73685a4079bdb877c3c07 | [
"MIT"
] | null | null | null | CppLisp/CppLispInterpreter/Exception.cpp | mneuroth/fuel-lang | 3b21d058a0eaf43df5c73685a4079bdb877c3c07 | [
"MIT"
] | 2 | 2018-08-14T00:11:39.000Z | 2020-09-03T08:36:36.000Z | /*
* FUEL(isp) is a fast usable embeddable lisp interpreter.
*
* Copyright (c) 2016 Michael Neuroth
*
* 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 li... | 32.886076 | 137 | 0.734026 | [
"object"
] |
a57dbc9de4af3bfe47521fd874381107be3d23b8 | 27,502 | inl | C++ | blast/include/util/row_reader.inl | mycolab/ncbi-blast | e59746cec78044d2bf6d65de644717c42f80b098 | [
"Apache-2.0"
] | null | null | null | blast/include/util/row_reader.inl | mycolab/ncbi-blast | e59746cec78044d2bf6d65de644717c42f80b098 | [
"Apache-2.0"
] | null | null | null | blast/include/util/row_reader.inl | mycolab/ncbi-blast | e59746cec78044d2bf6d65de644717c42f80b098 | [
"Apache-2.0"
] | null | null | null | #ifndef UTIL___ROW_READER__INL
#define UTIL___ROW_READER__INL
/* $Id: row_reader.inl 575325 2018-11-27 18:22:00Z ucko $
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* T... | 34.901015 | 84 | 0.575885 | [
"vector"
] |
a57e18cada3186a84566b43e04b766818c30d041 | 22,544 | cc | C++ | Code/Components/Analysis/analysis/current/patternmatching/Matcher.cc | rtobar/askapsoft | 6bae06071d7d24f41abe3f2b7f9ee06cb0a9445e | [
"BSL-1.0",
"Apache-2.0",
"OpenSSL"
] | 1 | 2020-06-18T08:37:43.000Z | 2020-06-18T08:37:43.000Z | Code/Components/Analysis/analysis/current/patternmatching/Matcher.cc | ATNF/askapsoft | d839c052d5c62ad8a511e58cd4b6548491a6006f | [
"BSL-1.0",
"Apache-2.0",
"OpenSSL"
] | null | null | null | Code/Components/Analysis/analysis/current/patternmatching/Matcher.cc | ATNF/askapsoft | d839c052d5c62ad8a511e58cd4b6548491a6006f | [
"BSL-1.0",
"Apache-2.0",
"OpenSSL"
] | null | null | null | /// @file
///
/// Provides base class for handling the matching of lists of points
///
/// @copyright (c) 2007 CSIRO
/// Australia Telescope National Facility (ATNF)
/// Commonwealth Scientific and Industrial Research Organisation (CSIRO)
/// PO Box 76, Epping NSW 1710, Australia
/// atnf-enquiries@csiro.au
///
/// Thi... | 36.302738 | 135 | 0.512952 | [
"object",
"vector"
] |
a57f83d1a34a1ef2d8604caae8e60d6f02bd1176 | 1,616 | cpp | C++ | src/yars/physics/bullet/Actuator.cpp | kzahedi/YARS | 48d9fe4178d699fba38114d3b299a228da41293d | [
"MIT"
] | 4 | 2017-08-05T03:33:21.000Z | 2021-11-08T09:15:42.000Z | src/yars/physics/bullet/Actuator.cpp | kzahedi/YARS | 48d9fe4178d699fba38114d3b299a228da41293d | [
"MIT"
] | null | null | null | src/yars/physics/bullet/Actuator.cpp | kzahedi/YARS | 48d9fe4178d699fba38114d3b299a228da41293d | [
"MIT"
] | 1 | 2019-03-24T08:35:25.000Z | 2019-03-24T08:35:25.000Z | #include <yars/physics/bullet/Actuator.h>
#include <yars/configuration/YarsConfiguration.h>
#include <yars/util/YarsErrorHandler.h>
#include <sstream>
Actuator::Actuator(string name, string source, string destination, Robot *robot)
{
_robot = robot;
if (source == "")
{
YarsErrorHandler *e = YarsErrorHandl... | 22.760563 | 88 | 0.593441 | [
"object",
"vector"
] |
a58222722d2c577f75b2412a2957cfa2f812e358 | 1,445 | cpp | C++ | shared_interest.cpp | karanjakhar/technical_training | a22092ef233d76362e89f92fc17b546dfac7aa5d | [
"Apache-2.0"
] | null | null | null | shared_interest.cpp | karanjakhar/technical_training | a22092ef233d76362e89f92fc17b546dfac7aa5d | [
"Apache-2.0"
] | null | null | null | shared_interest.cpp | karanjakhar/technical_training | a22092ef233d76362e89f92fc17b546dfac7aa5d | [
"Apache-2.0"
] | null | null | null | int sharedInterests(int friends_nodes, int friends_edges, std::vector<int> friends_from, std::vector<int> friends_to, std::vector<int> friends_weight) {
map<int,vector<int>>mp;
for(int i = 0; i < friends_edges; i++){
mp[friends_from[i]].push_back(friends_weight[i]);
mp[friends_to[i]].push_back(... | 30.744681 | 152 | 0.442907 | [
"vector"
] |
a58c5acc7d728860e650f924689a252104cd70c1 | 918 | cpp | C++ | test/test_high-side-switch.cpp | NikhitaR-IFX/high-side-switch | 37ce95da04f228a36885c14e2b2046e7137e1996 | [
"MIT"
] | 6 | 2020-09-17T14:34:56.000Z | 2022-01-26T02:41:15.000Z | test/test_high-side-switch.cpp | NikhitaR-IFX/high-side-switch | 37ce95da04f228a36885c14e2b2046e7137e1996 | [
"MIT"
] | 3 | 2020-05-19T12:03:07.000Z | 2021-09-09T10:53:51.000Z | test/test_high-side-switch.cpp | NikhitaR-IFX/high-side-switch | 37ce95da04f228a36885c14e2b2046e7137e1996 | [
"MIT"
] | 3 | 2021-08-30T13:13:55.000Z | 2022-01-26T02:41:11.000Z | #include <gtest/gtest.h>
#include <gmock/gmock.h>
#include "../src/corelib/high-side-switch.h"
using ::testing::Return;
//using ::testing::Matcher;
// using ::testing::NotNull;
// using ::testing::Sequence;
using ::testing::_;
/**
* Class High Side Switch Test Suite
*/
class HSSwitchAPI: public ::testing::Test
{
... | 16.690909 | 68 | 0.600218 | [
"object"
] |
a58d9836bf28e898f9f22efef7e21bb586321aa5 | 2,292 | cpp | C++ | C++/1563. StoneGameV.cpp | nizD/LeetCode-Solutions | 7f4ca37bab795e0d6f9bfd9148a8fe3b62aa5349 | [
"MIT"
] | 263 | 2020-10-05T18:47:29.000Z | 2022-03-31T19:44:46.000Z | C++/1563. StoneGameV.cpp | nizD/LeetCode-Solutions | 7f4ca37bab795e0d6f9bfd9148a8fe3b62aa5349 | [
"MIT"
] | 1,264 | 2020-10-05T18:13:05.000Z | 2022-03-31T23:16:35.000Z | C++/1563. StoneGameV.cpp | nizD/LeetCode-Solutions | 7f4ca37bab795e0d6f9bfd9148a8fe3b62aa5349 | [
"MIT"
] | 760 | 2020-10-05T18:22:51.000Z | 2022-03-29T06:06:20.000Z | /*
Probelem Statement:
There are several stones arranged in a row, and each stone has an associated value which is an integer given in the array stoneValue.
In each round of the game, Alice divides the row into two non-empty rows (i.e. left row and right row), then Bob calculates the value of each row which is the sum... | 47.75 | 462 | 0.655323 | [
"vector"
] |
a590b3523c48e1f92093d6b30fd98364849434fd | 2,597 | cpp | C++ | codeforces/gym/2019-2020 ACM-ICPC Pacific Northwest Regional Contest/m.cpp | tysm/cpsols | 262212646203e516d1706edf962290de93762611 | [
"MIT"
] | 4 | 2020-10-05T19:24:10.000Z | 2021-07-15T00:45:43.000Z | codeforces/gym/2019-2020 ACM-ICPC Pacific Northwest Regional Contest/m.cpp | tysm/cpsols | 262212646203e516d1706edf962290de93762611 | [
"MIT"
] | null | null | null | codeforces/gym/2019-2020 ACM-ICPC Pacific Northwest Regional Contest/m.cpp | tysm/cpsols | 262212646203e516d1706edf962290de93762611 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int>
#define all(x) x.begin(), x.end()
#define Matrix v... | 22.982301 | 72 | 0.41625 | [
"vector"
] |
a5920f489a1bb8b1862a5d5a26fd75f674f0fb40 | 857 | cpp | C++ | 128. Longest Consecutive Sequence.cpp | rajeev-ranjan-au6/Leetcode_Cpp | f64cd98ab96ec110f1c21393f418acf7d88473e8 | [
"MIT"
] | 3 | 2020-12-30T00:29:59.000Z | 2021-01-24T22:43:04.000Z | 128. Longest Consecutive Sequence.cpp | rajeevranjancom/Leetcode_Cpp | f64cd98ab96ec110f1c21393f418acf7d88473e8 | [
"MIT"
] | null | null | null | 128. Longest Consecutive Sequence.cpp | rajeevranjancom/Leetcode_Cpp | f64cd98ab96ec110f1c21393f418acf7d88473e8 | [
"MIT"
] | null | null | null | class Solution {
public:
int longestConsecutive(vector<int>& nums) {
int maxlen = 0;
unordered_map<int, int>m;
for(auto x: nums){
if(m[x]) continue;
int left = m[x - 1];
int right = m[x + 1];
m[x + right] = m[x - left] = m[x] = left + right + 1... | 23.805556 | 65 | 0.392065 | [
"vector"
] |
a5999e984f0ef1ecfed28b288e17dd8cdfd8b23a | 27,024 | cpp | C++ | src/blockchain/txpool.cpp | metabasenet/metabasenet | e9bc89b22c11981bcf1d71b63b9b66df3a4e54e1 | [
"MIT"
] | null | null | null | src/blockchain/txpool.cpp | metabasenet/metabasenet | e9bc89b22c11981bcf1d71b63b9b66df3a4e54e1 | [
"MIT"
] | null | null | null | src/blockchain/txpool.cpp | metabasenet/metabasenet | e9bc89b22c11981bcf1d71b63b9b66df3a4e54e1 | [
"MIT"
] | null | null | null | // Copyright (c) 2021-2022 The MetabaseNet developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "txpool.h"
#include <algorithm>
#include <boost/range/adaptor/reversed.hpp>
#include <deque>
using namespace st... | 28.566596 | 174 | 0.568273 | [
"vector"
] |
a59b7c4b258c78a1cf323a96554f8a69327f0df0 | 3,435 | cpp | C++ | Board.cpp | Orya-s/Ariel_CPP_Ex2 | b5300705533a138a9ed5c13b18d584036db76c7e | [
"MIT"
] | null | null | null | Board.cpp | Orya-s/Ariel_CPP_Ex2 | b5300705533a138a9ed5c13b18d584036db76c7e | [
"MIT"
] | null | null | null | Board.cpp | Orya-s/Ariel_CPP_Ex2 | b5300705533a138a9ed5c13b18d584036db76c7e | [
"MIT"
] | null | null | null | #include "Board.hpp"
#include <iostream>
#include <stdexcept>
#include <algorithm>
using namespace std;
namespace ariel
{
string const message;
void Board::post(uint row, uint col, Direction direction, const string &message)
{
// adding more vectors aka lines
if (board.size() <= row + m... | 26.835938 | 91 | 0.406405 | [
"vector"
] |
a59d789eb8b2457d0c7f45ce68d4c59dfa0dc57e | 810 | cpp | C++ | tests/word-break-ii-test.cpp | Red-Li/leetcode | 908d579f4dbf63a0099b6aae909265300ead46c5 | [
"Apache-2.0"
] | null | null | null | tests/word-break-ii-test.cpp | Red-Li/leetcode | 908d579f4dbf63a0099b6aae909265300ead46c5 | [
"Apache-2.0"
] | null | null | null | tests/word-break-ii-test.cpp | Red-Li/leetcode | 908d579f4dbf63a0099b6aae909265300ead46c5 | [
"Apache-2.0"
] | null | null | null | /**
* @file word-break-ii-test.cpp
* @brief
* @author Red Li
* @version
* @date 2014-11-27
*/
#include <sstream>
#include <gtest/gtest.h>
#include <unordered_set>
using namespace std;
namespace word_break_ii{
#define NAMESPACE
#include "word-break-ii.hpp"
}
using namespace word_break_ii;
class WordBreakI... | 14.210526 | 59 | 0.623457 | [
"vector"
] |
a5a12e3af7b22e7993d3f8d7ac77b144340ff9b2 | 9,080 | cpp | C++ | irohad/synchronizer/impl/synchronizer_impl.cpp | kuvaldini/iroha | f6a739743f8c5d80bc341c1e286b56fe484e5daa | [
"Apache-2.0"
] | 1 | 2021-05-18T09:02:45.000Z | 2021-05-18T09:02:45.000Z | irohad/synchronizer/impl/synchronizer_impl.cpp | kuvaldini/iroha | f6a739743f8c5d80bc341c1e286b56fe484e5daa | [
"Apache-2.0"
] | 6 | 2021-05-20T15:07:14.000Z | 2021-05-21T08:50:11.000Z | irohad/synchronizer/impl/synchronizer_impl.cpp | kuvaldini/iroha | f6a739743f8c5d80bc341c1e286b56fe484e5daa | [
"Apache-2.0"
] | 1 | 2021-05-13T09:20:23.000Z | 2021-05-13T09:20:23.000Z | /**
* Copyright Soramitsu Co., Ltd. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#include "synchronizer/impl/synchronizer_impl.hpp"
#include <utility>
#include "ametsuchi/block_query_factory.hpp"
#include "ametsuchi/command_executor.hpp"
#include "ametsuchi/mutable_storage.hpp"
#include "common/b... | 40.355556 | 80 | 0.582599 | [
"object"
] |
a5a3892d9050489546337061cd7568cac357f6ea | 14,228 | hpp | C++ | inference-engine/src/inference_engine/low_precision_transformations/network_helper.hpp | giulio1979/dldt | e7061922066ccefc54c8dae6e3215308ce9559e1 | [
"Apache-2.0"
] | 1 | 2021-07-30T17:03:50.000Z | 2021-07-30T17:03:50.000Z | inference-engine/src/inference_engine/low_precision_transformations/network_helper.hpp | Dipet/dldt | b2140c083a068a63591e8c2e9b5f6b240790519d | [
"Apache-2.0"
] | null | null | null | inference-engine/src/inference_engine/low_precision_transformations/network_helper.hpp | Dipet/dldt | b2140c083a068a63591e8c2e9b5f6b240790519d | [
"Apache-2.0"
] | null | null | null | // Copyright (C) 2018-2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#pragma once
#include <cmath>
#include <memory>
#include <string>
#include <vector>
#include <unordered_set>
#include "cnn_network_impl.hpp"
#include "low_precision_transformations/common/dequantization_details.hpp"
#include "low... | 43.378049 | 143 | 0.653289 | [
"vector"
] |
a5a76af9816a1c09dea59a232f69eb0c9aee3307 | 3,818 | cpp | C++ | src/LightBulb/Learning/Evolution/SharedSamplingCombiningStrategy.cpp | domin1101/ANNHelper | 50acb5746d6dad6777532e4c7da4983a7683efe0 | [
"Zlib"
] | 5 | 2016-02-04T06:14:42.000Z | 2017-02-06T02:21:43.000Z | src/LightBulb/Learning/Evolution/SharedSamplingCombiningStrategy.cpp | domin1101/ANNHelper | 50acb5746d6dad6777532e4c7da4983a7683efe0 | [
"Zlib"
] | 41 | 2015-04-15T21:05:45.000Z | 2015-07-09T12:59:02.000Z | src/LightBulb/Learning/Evolution/SharedSamplingCombiningStrategy.cpp | domin1101/LightBulb | 50acb5746d6dad6777532e4c7da4983a7683efe0 | [
"Zlib"
] | null | null | null | // Includes
#include "LightBulb/Learning/Evolution/SharedSamplingCombiningStrategy.hpp"
#include "LightBulb/Learning/Evolution/AbstractIndividual.hpp"
#include "LightBulb/Learning/Evolution/AbstractCoevolutionEnvironment.hpp"
//Library includes
namespace LightBulb
{
void SharedSamplingCombiningStrategy::combine(Abstr... | 42.898876 | 206 | 0.762179 | [
"vector"
] |
a5ae2ff500cfaa1e251b5ac468864560c8bfde78 | 1,590 | hh | C++ | src/link.hh | CN-TU/remy | 0c0887322b0cbf6e3497e3aeb95c979907f03623 | [
"Apache-2.0"
] | 6 | 2020-03-19T04:16:02.000Z | 2022-03-30T15:41:39.000Z | src/link.hh | CN-TU/remy | 0c0887322b0cbf6e3497e3aeb95c979907f03623 | [
"Apache-2.0"
] | 1 | 2020-05-20T12:05:49.000Z | 2021-11-14T13:39:23.000Z | src/link.hh | CN-TU/remy | 0c0887322b0cbf6e3497e3aeb95c979907f03623 | [
"Apache-2.0"
] | null | null | null | #ifndef LINK_HH
#define LINK_HH
#include <deque>
#include <vector>
#include "packet.hh"
using namespace remy;
#include "delay.hh"
#include "receiver.hh"
class Link
{
private:
std::deque< Packet > _buffer;
Delay _pending_packet;
unsigned int _limit;
public:
Link( const double s_rate,
const unsigned int s_... | 24.090909 | 109 | 0.644025 | [
"vector"
] |
a5b408881dae0ca7c054827318462499e234492b | 13,531 | cpp | C++ | xlitomatic/urlsource.cpp | srl295/icu | 7c7f805b917476f269babc853fb1eb3e0a17a88b | [
"ICU",
"Unlicense"
] | 1 | 2018-07-24T21:03:12.000Z | 2018-07-24T21:03:12.000Z | xlitomatic/urlsource.cpp | srl295/icu | 7c7f805b917476f269babc853fb1eb3e0a17a88b | [
"ICU",
"Unlicense"
] | null | null | null | xlitomatic/urlsource.cpp | srl295/icu | 7c7f805b917476f269babc853fb1eb3e0a17a88b | [
"ICU",
"Unlicense"
] | 1 | 2018-07-13T15:52:46.000Z | 2018-07-13T15:52:46.000Z | /**********************************************************************
* Copyright (C) 2000, International Business Machines
* Corporation and others. All Rights Reserved.
***********************************************************************/
#include "urlsource.h"
# include <sys/socket.h>
#include <signal.h>
... | 19.840176 | 205 | 0.523686 | [
"object"
] |
a5bb76d0979893935fe7f6016f275d514ac407ad | 3,327 | cc | C++ | RecoLocalTracker/Phase2TrackerRecHits/src/Phase2StripCPE.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 3 | 2018-08-24T19:10:26.000Z | 2019-02-19T11:45:32.000Z | RecoLocalTracker/Phase2TrackerRecHits/src/Phase2StripCPE.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 3 | 2018-08-23T13:40:24.000Z | 2019-12-05T21:16:03.000Z | RecoLocalTracker/Phase2TrackerRecHits/src/Phase2StripCPE.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 5 | 2018-08-21T16:37:52.000Z | 2020-01-09T13:33:17.000Z | #include "RecoLocalTracker/Phase2TrackerRecHits/interface/Phase2StripCPE.h"
#include "Geometry/CommonTopologies/interface/PixelTopology.h"
#include "FWCore/MessageLogger/interface/MessageLogger.h"
Phase2StripCPE::Phase2StripCPE(edm::ParameterSet & conf, const MagneticField & magf,const TrackerGeometry& geom) :
magf... | 38.686047 | 125 | 0.700331 | [
"geometry"
] |
a5bf156807254884676a7f37ec9fe5c7909a2cd0 | 20,880 | cc | C++ | elang/compiler/syntax/parser.cc | eval1749/elang | 5208b386ba3a3e866a5c0f0271280f79f9aac8c4 | [
"Apache-2.0"
] | 1 | 2018-01-27T22:40:53.000Z | 2018-01-27T22:40:53.000Z | elang/compiler/syntax/parser.cc | eval1749/elang | 5208b386ba3a3e866a5c0f0271280f79f9aac8c4 | [
"Apache-2.0"
] | 1 | 2016-01-29T00:54:49.000Z | 2016-01-29T00:54:49.000Z | elang/compiler/syntax/parser.cc | eval1749/elang | 5208b386ba3a3e866a5c0f0271280f79f9aac8c4 | [
"Apache-2.0"
] | null | null | null | // Copyright 2014-2015 Project Vogue. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "elang/compiler/syntax/parser.h"
#include <string>
#include <vector>
#include <unordered_set>
#include "base/logging.h"
#include "elang/compiler/... | 31.164179 | 80 | 0.64636 | [
"vector"
] |
a5c36cfcd8261b1d3c0bc0f59ea5dab4a4db10a2 | 5,083 | hpp | C++ | src/TransportCellProperty.hpp | OSS-Lab/ChemChaste | d32c36afa1cd870512fee3cba0753d5c6faf8109 | [
"BSD-3-Clause"
] | null | null | null | src/TransportCellProperty.hpp | OSS-Lab/ChemChaste | d32c36afa1cd870512fee3cba0753d5c6faf8109 | [
"BSD-3-Clause"
] | null | null | null | src/TransportCellProperty.hpp | OSS-Lab/ChemChaste | d32c36afa1cd870512fee3cba0753d5c6faf8109 | [
"BSD-3-Clause"
] | null | null | null | #ifndef TRANSPORTCELLPROPERTY_HPP
#define TRANSPORTCELLPROPERTY_HPP
//general includes
#include <vector>
#include <boost/shared_ptr.hpp>
// chaste includes
#include "Cell.hpp"
#include "AbstractCellProperty.hpp"
#include "StateVariableRegister.hpp"
#include "AbstractTransportReactionSystem.hpp"
#include "AbstractTran... | 30.620482 | 140 | 0.793823 | [
"vector"
] |
a5d84ddbce08e076bf3bbd985fc93e73e6710989 | 62,599 | cpp | C++ | bagged_boosting_ensemble.cpp | ninoarsov/collaborative_bagging_of_gentle_boost_ensembles | 6c67794f545f615c795baccc4ac97e5b508363a3 | [
"MIT"
] | null | null | null | bagged_boosting_ensemble.cpp | ninoarsov/collaborative_bagging_of_gentle_boost_ensembles | 6c67794f545f615c795baccc4ac97e5b508363a3 | [
"MIT"
] | null | null | null | bagged_boosting_ensemble.cpp | ninoarsov/collaborative_bagging_of_gentle_boost_ensembles | 6c67794f545f615c795baccc4ac97e5b508363a3 | [
"MIT"
] | null | null | null | #include "bagged_boosting_ensemble.hpp"
#include <limits>
#include <algorithm>
#include <iostream>
#include <functional>
#include <thread>
#include <cstdlib>
#include <cmath>
#define MAX_MP std::numeric_limits<double>::max()
namespace bu = BaggingUtils;
/*
Helper functions
*/
void remove_row ( Matrix& matrix... | 37.801329 | 177 | 0.522708 | [
"vector"
] |
a5da21f8571f823f54b0470e2adc99743a96ae68 | 2,108 | cpp | C++ | version1.0/REX_TO_DFA/REX_TO_DFA/main.cpp | henry-bugfree/regex_to_nfa_to_dfa_to_minimizedDfa | 4e4cba6b8145649d3e153ad97e6e7a58357c7447 | [
"MIT"
] | null | null | null | version1.0/REX_TO_DFA/REX_TO_DFA/main.cpp | henry-bugfree/regex_to_nfa_to_dfa_to_minimizedDfa | 4e4cba6b8145649d3e153ad97e6e7a58357c7447 | [
"MIT"
] | null | null | null | version1.0/REX_TO_DFA/REX_TO_DFA/main.cpp | henry-bugfree/regex_to_nfa_to_dfa_to_minimizedDfa | 4e4cba6b8145649d3e153ad97e6e7a58357c7447 | [
"MIT"
] | null | null | null | #include"graph.h"
#include"rex_to_rpn.h"
#include"nfa_to_dfa.h"
#include"main.h"
#include"rpn_to_nfa.h"
#include"nfa_to_dfa.h"
#include"minimize_dfa.h"
using namespace std;
#define MAX_REX_SIZE 100
#define TEST_NUM 5
stack<graph> temp_nfa_stack;
extern vector<char> rpn_vector;
extern stack<char> rpn_op_... | 20.466019 | 78 | 0.673624 | [
"vector"
] |
777ed40514b05144dd8bf67389ba50fa50cd771d | 34,176 | hpp | C++ | src/fuml/src_gen/fUML/FUMLFactory.hpp | dataliz9r/MDE4CPP | 9c5ce01c800fb754c371f1a67f648366eeabae49 | [
"MIT"
] | null | null | null | src/fuml/src_gen/fUML/FUMLFactory.hpp | dataliz9r/MDE4CPP | 9c5ce01c800fb754c371f1a67f648366eeabae49 | [
"MIT"
] | null | null | null | src/fuml/src_gen/fUML/FUMLFactory.hpp | dataliz9r/MDE4CPP | 9c5ce01c800fb754c371f1a67f648366eeabae49 | [
"MIT"
] | null | null | null | //********************************************************************
//*
//* Warning: This file was generated by ecore4CPP Generator
//*
//********************************************************************
#ifndef FUMLFACTORY_HPP
#define FUMLFACTORY_HPP
#include <map>
#include <memory>
#include "ecore/EFacto... | 64.727273 | 290 | 0.807526 | [
"object"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.