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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
6499e706ed03158da99ffd48163003f67004e25b | 25,836 | cpp | C++ | simulation_intersection_scenario/dstarlite.cpp | SirTobias/DMPCRobotSimulation | e393538b37e5a63bfe4da94e9bd13feba45699db | [
"MIT"
] | 2 | 2021-12-06T08:05:12.000Z | 2022-03-22T13:56:38.000Z | simulation_intersection_scenario/dstarlite.cpp | SirTobias/DMPCRobotSimulation | e393538b37e5a63bfe4da94e9bd13feba45699db | [
"MIT"
] | null | null | null | simulation_intersection_scenario/dstarlite.cpp | SirTobias/DMPCRobotSimulation | e393538b37e5a63bfe4da94e9bd13feba45699db | [
"MIT"
] | 1 | 2022-03-29T12:46:37.000Z | 2022-03-29T12:46:37.000Z | #include "dstarlite.h"
#include "algorithm"
#include "iomanip"
#include <QDebug>
/**
* @brief DstarLite::DstarLite
* @param car
* @param start
* @param target
* @param T sampling interval
*/
DstarLite::DstarLite(const QString &car, const PathItem &start, const PathItem &target, const double &T) :
m_car(car)... | 33.905512 | 193 | 0.636941 | [
"vector"
] |
649e62782fb2a2c1750afe8ad083f555ae7f26e7 | 6,666 | cpp | C++ | samples/advanced_samples/AntiAlias/jni/AntiAlias.cpp | hannesa2/opengl-es-sdk-for-android | 4ca9fdb10bcd721bb9af19ccd9bdd95bdf34a07b | [
"MIT"
] | 283 | 2017-06-28T04:54:53.000Z | 2022-03-28T10:00:32.000Z | samples/advanced_samples/AntiAlias/jni/AntiAlias.cpp | NickHardwood/opengl-es-sdk-for-android | 4ca9fdb10bcd721bb9af19ccd9bdd95bdf34a07b | [
"MIT"
] | 3 | 2021-06-13T08:19:35.000Z | 2022-02-25T17:26:15.000Z | samples/advanced_samples/AntiAlias/jni/AntiAlias.cpp | NickHardwood/opengl-es-sdk-for-android | 4ca9fdb10bcd721bb9af19ccd9bdd95bdf34a07b | [
"MIT"
] | 102 | 2017-07-09T04:25:48.000Z | 2022-03-16T11:20:44.000Z | /* Copyright (c) 2013-2017, ARM Limited and Contributors
*
* SPDX-License-Identifier: MIT
*
* 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 limita... | 33.164179 | 129 | 0.706571 | [
"object"
] |
64a88e187242cd6910de15f0ab3abb1998e16cfd | 34,364 | cc | C++ | chrome/browser/android/compositor/layer/contextual_search_layer.cc | google-ar/chromium | 2441c86a5fd975f09a6c30cddb57dfb7fc239699 | [
"Apache-2.0",
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 777 | 2017-08-29T15:15:32.000Z | 2022-03-21T05:29:41.000Z | chrome/browser/android/compositor/layer/contextual_search_layer.cc | harrymarkovskiy/WebARonARCore | 2441c86a5fd975f09a6c30cddb57dfb7fc239699 | [
"Apache-2.0",
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 66 | 2017-08-30T18:31:18.000Z | 2021-08-02T10:59:35.000Z | chrome/browser/android/compositor/layer/contextual_search_layer.cc | harrymarkovskiy/WebARonARCore | 2441c86a5fd975f09a6c30cddb57dfb7fc239699 | [
"Apache-2.0",
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 123 | 2017-08-30T01:19:34.000Z | 2022-03-17T22:55:31.000Z | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/android/compositor/layer/contextual_search_layer.h"
#include "cc/layers/layer.h"
#include "cc/layers/nine_patch_layer.h"
#includ... | 41.502415 | 80 | 0.673961 | [
"transform"
] |
64a9af5965df0976f7a9f49853c4356b7fd2afc1 | 595 | cpp | C++ | isFibo.cpp | vkku/cppWorkspace | 1b07511eb30929139a3769cffc0be9e4683c8683 | [
"MIT"
] | 1 | 2016-10-20T17:08:02.000Z | 2016-10-20T17:08:02.000Z | isFibo.cpp | vkku/cppWorkspace | 1b07511eb30929139a3769cffc0be9e4683c8683 | [
"MIT"
] | null | null | null | isFibo.cpp | vkku/cppWorkspace | 1b07511eb30929139a3769cffc0be9e4683c8683 | [
"MIT"
] | null | null | null | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
unsigned int fibo[105] = {0};
unsigned int realFabo[105] = {0};
unsigned int term;
int until;
cin>>until;
realFabo[0] = 0;
realFabo[1] = 1;
for(int i = 2 ; i ... | 18.59375 | 52 | 0.510924 | [
"vector"
] |
64ac9400ffab33cc082324b4a8fa44695fa5d419 | 272 | cpp | C++ | src/main/func.cpp | yxtj/FAB | f483672e13ea96a3f1da450c9655b1fc239233b1 | [
"MIT"
] | null | null | null | src/main/func.cpp | yxtj/FAB | f483672e13ea96a3f1da450c9655b1fc239233b1 | [
"MIT"
] | null | null | null | src/main/func.cpp | yxtj/FAB | f483672e13ea96a3f1da450c9655b1fc239233b1 | [
"MIT"
] | null | null | null | #include "func.h"
#include <cmath>
using namespace std;
double vectorDifference(const vector<double>& a, const vector<double>& b){
double res = 0.0;
size_t n = a.size();
for(size_t i = 0; i < n; ++i){
double t = a[i] - b[i];
res += t * t;
}
return sqrt(res);
}
| 18.133333 | 74 | 0.606618 | [
"vector"
] |
64aec188abf274505e1f112d833df063cdd115d3 | 1,128 | hpp | C++ | catkin_ws/src/costmap/include/costmap/types/helper/CloudTransformer.hpp | WPI-Capstone-Project-Team-1-2020/Capstone-Final-Mile | 60cf6be95305ec720f001bf18327ae881168443c | [
"MIT"
] | null | null | null | catkin_ws/src/costmap/include/costmap/types/helper/CloudTransformer.hpp | WPI-Capstone-Project-Team-1-2020/Capstone-Final-Mile | 60cf6be95305ec720f001bf18327ae881168443c | [
"MIT"
] | null | null | null | catkin_ws/src/costmap/include/costmap/types/helper/CloudTransformer.hpp | WPI-Capstone-Project-Team-1-2020/Capstone-Final-Mile | 60cf6be95305ec720f001bf18327ae881168443c | [
"MIT"
] | null | null | null | #ifndef CM_CLOUD_TRANSFORMER_HPP
#define CM_CLOUD_TRANSFORMER_HPP
// Ros
#include <geometry_msgs/Quaternion.h>
#include <tf/tf.h>
// Libraries
#include <boost/cstdfloat.hpp>
#include <pcl/point_cloud.h>
#include <pcl/point_types.h>
#include <pcl_ros/transforms.h>
namespace cm
{
using float64_t = boost::float64_t; /... | 30.486486 | 143 | 0.725177 | [
"transform"
] |
64b1192f0ddb9541faf1ad5103f5cf6ace240f6f | 1,957 | cpp | C++ | 798_c.cpp | onexmaster/cp | b78b0f1e586d6977d86c97b32f48fed33f1469af | [
"Apache-2.0",
"MIT"
] | null | null | null | 798_c.cpp | onexmaster/cp | b78b0f1e586d6977d86c97b32f48fed33f1469af | [
"Apache-2.0",
"MIT"
] | null | null | null | 798_c.cpp | onexmaster/cp | b78b0f1e586d6977d86c97b32f48fed33f1469af | [
"Apache-2.0",
"MIT"
] | null | null | null | // Created by Tanuj Jain
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define mp make_pair
# define M_PI 3.14159265358979323846 /* pi */
#define FIO ios_base::sync_with_stdio(... | 26.445946 | 106 | 0.47164 | [
"vector"
] |
64b7d8cd6370f33c3684a5b5e2a31a924cf7f61b | 4,279 | cc | C++ | proxy/hdrs/SDKAllocator.cc | ibrezac/trafficserver | 640c4f738b7858f93069f987ea141e0cafae72da | [
"Apache-2.0"
] | 2 | 2019-01-19T02:49:35.000Z | 2019-06-12T09:21:10.000Z | proxy/hdrs/SDKAllocator.cc | pquerna/trafficserver | 43b94d9926bf11573b178f46c01db6e235f1345e | [
"Apache-2.0"
] | null | null | null | proxy/hdrs/SDKAllocator.cc | pquerna/trafficserver | 43b94d9926bf11573b178f46c01db6e235f1345e | [
"Apache-2.0"
] | null | null | null | /** @file
A brief file description
@section license License
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 you und... | 22.056701 | 82 | 0.624445 | [
"object"
] |
64c0c6f5423cc243c94b7de7cf5213e6777e9f2f | 2,895 | cpp | C++ | Scratch-firmata/Scratch_Firmata_lib/LedMatrix.cpp | bLandais/txRobotic | bfe4a0ef0fdb9745e222ab0f5c61223cb3543e03 | [
"CC0-1.0"
] | 2 | 2018-04-04T18:59:50.000Z | 2021-06-13T01:07:38.000Z | Scratch-firmata/Scratch_Firmata_lib/LedMatrix.cpp | bLandais/txRobotic | bfe4a0ef0fdb9745e222ab0f5c61223cb3543e03 | [
"CC0-1.0"
] | 9 | 2017-03-22T17:26:25.000Z | 2017-06-25T13:35:34.000Z | Scratch-firmata/Scratch_Firmata_lib/LedMatrix.cpp | bLandais/txRobotic | bfe4a0ef0fdb9745e222ab0f5c61223cb3543e03 | [
"CC0-1.0"
] | 3 | 2017-03-22T15:09:12.000Z | 2018-04-04T18:59:51.000Z | //
//
//
#include <Adafruit_NeoPixel.h>
#include "LedMatrix.h"
#include "EmotionSprite.h"
//#include "Arduino.h"
LedMatrix::LedMatrix() {
}
LedMatrix::LedMatrix(int dataIn, int load, int clock, int maxInUse) {
this->dataIn = dataIn;
this->load = load;
this->clock = clock;
this->maxInUse = maxInUse;
pinMod... | 26.805556 | 92 | 0.606218 | [
"vector"
] |
64c75f9b1f42a9ead635d3a8dbc2dedf43b88935 | 17,179 | cpp | C++ | src/tests/class_tests/openms/source/DBSuitability_test.cpp | Amit0617/OpenMS | 70ef98e32b02721f45fe72bd4de4b4833755a66f | [
"BSL-1.0",
"Zlib",
"Apache-2.0"
] | 1 | 2022-03-23T09:45:02.000Z | 2022-03-23T09:45:02.000Z | src/tests/class_tests/openms/source/DBSuitability_test.cpp | Amit0617/OpenMS | 70ef98e32b02721f45fe72bd4de4b4833755a66f | [
"BSL-1.0",
"Zlib",
"Apache-2.0"
] | 1 | 2018-04-02T18:07:10.000Z | 2018-04-02T18:07:10.000Z | src/tests/class_tests/openms/source/DBSuitability_test.cpp | Amit0617/OpenMS | 70ef98e32b02721f45fe72bd4de4b4833755a66f | [
"BSL-1.0",
"Zlib",
"Apache-2.0"
] | 3 | 2018-01-10T19:50:48.000Z | 2021-11-12T15:56:13.000Z | // --------------------------------------------------------------------------
// OpenMS -- Open-Source Mass Spectrometry
// --------------------------------------------------------------------------
// Copyright The OpenMS Team -- Eberhard Karls University Tuebingen,
// ETH Zurich, and Freie Universit... | 38.604494 | 360 | 0.7274 | [
"vector"
] |
64c9946313ebae4e35b45cfc1320ba69d7321939 | 1,134 | hpp | C++ | include/DREAM/DiagonalPreconditioner.hpp | chalmersplasmatheory/DREAM | 715637ada94f5e35db16f23c2fd49bb7401f4a27 | [
"MIT"
] | 12 | 2020-09-07T11:19:10.000Z | 2022-02-17T17:40:19.000Z | include/DREAM/DiagonalPreconditioner.hpp | chalmersplasmatheory/DREAM | 715637ada94f5e35db16f23c2fd49bb7401f4a27 | [
"MIT"
] | 110 | 2020-09-02T15:29:24.000Z | 2022-03-09T09:50:01.000Z | include/DREAM/DiagonalPreconditioner.hpp | chalmersplasmatheory/DREAM | 715637ada94f5e35db16f23c2fd49bb7401f4a27 | [
"MIT"
] | 3 | 2021-05-21T13:24:31.000Z | 2022-02-11T14:43:12.000Z | #ifndef _DREAM_DIAGONAL_PRECONDITIONER_HPP
#define _DREAM_DIAGONAL_PRECONDITIONER_HPP
#include <unordered_map>
#include <vector>
#include "FVM/Matrix.hpp"
#include "FVM/UnknownQuantityHandler.hpp"
namespace DREAM {
class DiagonalPreconditioner {
private:
FVM::UnknownQuantityHandler *uqh;
std:... | 27.658537 | 88 | 0.689594 | [
"vector"
] |
64d08300d1fa396e8a84d798edf586ff850fa1e5 | 16,674 | cc | C++ | xic/src/edit/move.cc | wrcad/xictools | f46ba6d42801426739cc8b2940a809b74f1641e2 | [
"Apache-2.0"
] | 73 | 2017-10-26T12:40:24.000Z | 2022-03-02T16:59:43.000Z | xic/src/edit/move.cc | chris-ayala/xictools | 4ea72c118679caed700dab3d49a8d36445acaec3 | [
"Apache-2.0"
] | 12 | 2017-11-01T10:18:22.000Z | 2022-03-20T19:35:36.000Z | xic/src/edit/move.cc | chris-ayala/xictools | 4ea72c118679caed700dab3d49a8d36445acaec3 | [
"Apache-2.0"
] | 34 | 2017-10-06T17:04:21.000Z | 2022-02-18T16:22:03.000Z |
/*========================================================================*
* *
* Distributed by Whiteley Research Inc., Sunnyvale, California, USA *
* http://wrcad.com *
* Copyright (... | 29.407407 | 76 | 0.479369 | [
"object"
] |
64d83e47ad28cacc7c6db5d15083e655743bf4ee | 1,498 | cpp | C++ | VectorSort.cpp | Khurdhula-Harshavardhan/piroGrams | 510de6ea5a4be6bc217419581913cbda290c4fe5 | [
"MIT"
] | null | null | null | VectorSort.cpp | Khurdhula-Harshavardhan/piroGrams | 510de6ea5a4be6bc217419581913cbda290c4fe5 | [
"MIT"
] | null | null | null | VectorSort.cpp | Khurdhula-Harshavardhan/piroGrams | 510de6ea5a4be6bc217419581913cbda290c4fe5 | [
"MIT"
] | null | null | null | /*
You are given integers.Sort the integers and print the sorted order.
Store the integers in a vector.Vectors are sequence containers representing arrays that can change in size.
Declaration:
vector<int>v; (creates an empty vector of integers)
Size:
int size=v.size();
Pushing an integer into a vector:
... | 20.805556 | 109 | 0.635514 | [
"vector"
] |
64dc47072da7b11908a79b321e130d1ec9d41deb | 4,359 | cpp | C++ | Source1.cpp | Captainxia/3DbuildingExtraction | 80880249a44eaf94e25aea201eeea2ff5c281b06 | [
"MIT"
] | 2 | 2019-04-27T13:14:48.000Z | 2021-10-17T06:58:09.000Z | Source1.cpp | jtpils/3DbuildingExtraction | 80880249a44eaf94e25aea201eeea2ff5c281b06 | [
"MIT"
] | null | null | null | Source1.cpp | jtpils/3DbuildingExtraction | 80880249a44eaf94e25aea201eeea2ff5c281b06 | [
"MIT"
] | 3 | 2018-12-18T08:50:29.000Z | 2021-10-17T06:58:10.000Z | //#define _SCL_SECURE_NO_WARNINGS
//#define _CRT_SECURE_NO_WARNINGS
// PCL_3d.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <pcl/io/pcd_io.h>
#include <pcl/io/ply_io.h>
#include <pcl/point_cloud.h>
#include <pcl/point_types.h>
#include <pcl/visualization/pcl_v... | 32.529851 | 121 | 0.703831 | [
"vector"
] |
64df590421651538ac97e3c1cde2aa386a030d60 | 2,309 | cc | C++ | folding_libs/MELIBS/arpack++/examples/band/sym/bsymshf.cc | parasol-ppl/PPL_utils | 92728bb89692fda1705a0dee436592d97922a6cb | [
"BSD-3-Clause"
] | 1 | 2016-05-16T02:27:46.000Z | 2016-05-16T02:27:46.000Z | arpack++/examples/band/sym/bsymshf.cc | red2901/sandbox | fae6c1624cc9957593d030f3b0306dbded29f0a2 | [
"MIT"
] | null | null | null | arpack++/examples/band/sym/bsymshf.cc | red2901/sandbox | fae6c1624cc9957593d030f3b0306dbded29f0a2 | [
"MIT"
] | null | null | null | /*
ARPACK++ v1.2 2/18/2000
c++ interface to ARPACK code.
MODULE BSymShf.cc.
Example program that illustrates how to solve a real symmetric
standard eigenvalue problem in shift and invert mode using the
ARluSymStdEig class.
1) Problem description:
In this example we try to solve A*x = x*lam... | 27.164706 | 72 | 0.647466 | [
"vector"
] |
64e3ba7d82657721d849eba8411292d4c8fdfa33 | 2,344 | cpp | C++ | CP Solutions/Codeforces/116B.cpp | Ritesh-10/Programming | 25687b180e92588a9582f160304f5e8d71572f5a | [
"MIT"
] | 8 | 2021-10-17T04:18:02.000Z | 2022-01-14T06:59:31.000Z | CP Solutions/Codeforces/116B.cpp | Ritesh-10/Programming | 25687b180e92588a9582f160304f5e8d71572f5a | [
"MIT"
] | 9 | 2021-10-16T18:44:52.000Z | 2021-10-20T14:58:12.000Z | CP Solutions/Codeforces/116B.cpp | Ritesh-10/Programming | 25687b180e92588a9582f160304f5e8d71572f5a | [
"MIT"
] | 17 | 2021-10-16T17:50:21.000Z | 2022-01-14T06:59:35.000Z | /*
Author: Sanchit Sharma (sanchit06)
link: https://codeforces.com/contest/116/problem/B
*/
#include<bits/stdc++.h>
using namespace std;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(char ch) {
string s(1, ch);
return '\'' + s + '\'';
}
string to_string(const char *s) {
ret... | 22.980392 | 78 | 0.493174 | [
"vector"
] |
64e3c70ff830ccf3295e3b5ebd8511af2d43fecc | 1,230 | cpp | C++ | Scripts/33.cpp | zzz0906/LeetCode | cd0b4a4fd03d0dff585c9ef349984eba1922ece0 | [
"MIT"
] | 17 | 2018-08-23T08:53:56.000Z | 2021-04-17T00:06:13.000Z | Scripts/33.cpp | zzz0906/LeetCode | cd0b4a4fd03d0dff585c9ef349984eba1922ece0 | [
"MIT"
] | null | null | null | Scripts/33.cpp | zzz0906/LeetCode | cd0b4a4fd03d0dff585c9ef349984eba1922ece0 | [
"MIT"
] | null | null | null | #include<algorithm>
#include<vector>
using namespace std;
class Solution {
public:
int po;
bool flag;
void find(int start,int end,vector<int>& nums){
if (end < start)
return;
if ((end-1 > 0) && nums[end] > nums[end-1]){
this->po = end;
this->flag = true;
... | 30 | 89 | 0.521951 | [
"vector"
] |
64e3e51e57de7643843667b6ebf7ed6987996e26 | 17,213 | hh | C++ | command-line-arguments.hh | skepner/command-line-arguments | f198ccf953456afab2389655cccd9cd0b0cfbd6c | [
"MIT"
] | null | null | null | command-line-arguments.hh | skepner/command-line-arguments | f198ccf953456afab2389655cccd9cd0b0cfbd6c | [
"MIT"
] | null | null | null | command-line-arguments.hh | skepner/command-line-arguments | f198ccf953456afab2389655cccd9cd0b0cfbd6c | [
"MIT"
] | null | null | null | #pragma once
#include <typeinfo>
#include <functional>
#include <algorithm>
#include <memory>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <tuple>
// ----------------------------------------------------------------------
namespace command_line_arguments
{
#pr... | 42.712159 | 203 | 0.501017 | [
"vector"
] |
64e7c78c1f46037554b1375be03955405f0837d0 | 2,702 | cpp | C++ | aoj/ALDS1/ALDS2C/main.cpp | xirc/cp-algorithm | 89c67cff2f00459c5bb020ab44bff5ae419a1728 | [
"Apache-2.0"
] | 8 | 2020-12-23T07:54:53.000Z | 2021-11-23T02:46:35.000Z | aoj/ALDS1/ALDS2C/main.cpp | xirc/cp-algorithm | 89c67cff2f00459c5bb020ab44bff5ae419a1728 | [
"Apache-2.0"
] | 1 | 2020-11-07T13:22:29.000Z | 2020-12-20T12:54:00.000Z | aoj/ALDS1/ALDS2C/main.cpp | xirc/cp-algorithm | 89c67cff2f00459c5bb020ab44bff5ae419a1728 | [
"Apache-2.0"
] | 1 | 2021-01-16T03:40:10.000Z | 2021-01-16T03:40:10.000Z | #include <bits/stdc++.h>
using namespace std;
template<class T>
void bubble_sort(vector<T>& array) {
for (int i = 0; i < array.size(); ++i) {
for (int j = array.size() - 1; j > i; --j) {
if (array[j] < array[j-1]) {
swap(array[j], array[j-1]);
}
}
}
}
... | 25.980769 | 74 | 0.544782 | [
"vector"
] |
64ed4a44df26be6e4c98381e09facc46bd7a71a9 | 712 | cpp | C++ | Google/Kick Start/2020/Round F/B.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 54 | 2019-05-13T12:13:09.000Z | 2022-02-27T02:59:00.000Z | Google/Kick Start/2020/Round F/B.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 2 | 2020-10-02T07:16:43.000Z | 2020-10-19T04:36:19.000Z | Google/Kick Start/2020/Round F/B.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 20 | 2020-05-26T09:48:13.000Z | 2022-03-18T15:18:27.000Z | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int metal_harvest(int N, int K, vector<pair<int, int>>& E) {
int robots, beg, need;
robots = beg = 0;
sort(E.begin(), E.end());
for (int i = 0; i < N; i++) {
if (beg >= E[i].second)
continue;
beg = max(E[... | 18.736842 | 66 | 0.521067 | [
"vector"
] |
64eea503f657015861ef9dd578c4088de9be9852 | 1,191 | cpp | C++ | Leetcode/1000-2000/1434. Number of Ways to Wear Different Hats to Each Other/1434.cpp | Next-Gen-UI/Code-Dynamics | a9b9d5e3f27e870b3e030c75a1060d88292de01c | [
"MIT"
] | null | null | null | Leetcode/1000-2000/1434. Number of Ways to Wear Different Hats to Each Other/1434.cpp | Next-Gen-UI/Code-Dynamics | a9b9d5e3f27e870b3e030c75a1060d88292de01c | [
"MIT"
] | null | null | null | Leetcode/1000-2000/1434. Number of Ways to Wear Different Hats to Each Other/1434.cpp | Next-Gen-UI/Code-Dynamics | a9b9d5e3f27e870b3e030c75a1060d88292de01c | [
"MIT"
] | null | null | null | class Solution {
public:
int numberWays(vector<vector<int>>& hats) {
constexpr int nHats = 40;
const int nPeople = hats.size();
hatToPeople.resize(nHats + 1);
// dp[i][j] := # of ways to assign hats 1, 2, ..., i to people in mask j
dp.resize(nHats + 1, vector<int>(1 << nPeople, -1));
for (in... | 25.340426 | 76 | 0.563392 | [
"vector"
] |
64f1141ee3afff19e28780ab86b9a34b60133388 | 2,969 | cpp | C++ | src/operator/neural_net_consumer.cpp | ccanel/saf | 5bc296e352419ae3688eb51dded72154f732127e | [
"Apache-2.0"
] | 28 | 2018-09-06T19:18:27.000Z | 2022-02-10T05:56:08.000Z | src/operator/neural_net_consumer.cpp | ccanel/saf | 5bc296e352419ae3688eb51dded72154f732127e | [
"Apache-2.0"
] | 13 | 2018-09-13T13:41:53.000Z | 2021-05-12T01:18:36.000Z | src/operator/neural_net_consumer.cpp | ccanel/saf | 5bc296e352419ae3688eb51dded72154f732127e | [
"Apache-2.0"
] | 14 | 2018-09-06T14:33:37.000Z | 2021-05-22T20:07:45.000Z | // Copyright 2018 The SAF Authors. 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 required by appli... | 32.988889 | 80 | 0.715056 | [
"shape",
"vector"
] |
64f40ad1f048579c33440580280be84ea5940de8 | 2,592 | cpp | C++ | src/subsys/factories/ClimberFactory.cpp | Team302/2017Steamworks | 757a5332c47dd007482e30ee067852d13582ba39 | [
"MIT"
] | null | null | null | src/subsys/factories/ClimberFactory.cpp | Team302/2017Steamworks | 757a5332c47dd007482e30ee067852d13582ba39 | [
"MIT"
] | 1 | 2018-09-07T14:14:28.000Z | 2018-09-13T04:01:33.000Z | src/subsys/factories/ClimberFactory.cpp | Team302/2017Steamworks | 757a5332c47dd007482e30ee067852d13582ba39 | [
"MIT"
] | null | null | null | /*
* ClimberFactory.cpp
*
* Created on: Jan 12, 2017
* Author: Tumtu
*/
//Team 302 includes
#include <subsys/factories/ClimberFactory.h> // This Class
#include <RobotDefn.h>
#include <subsys/CompBot/CompBotClimber.h>
#include <subsys/interfaces/IClimber.h>
#include <subsys/SWBot/SWBotClimber.h>
#include <... | 29.454545 | 86 | 0.539352 | [
"object"
] |
64f9396d5cccedb20112672258ed60a0fce0a443 | 3,964 | hpp | C++ | Adobe/Illustrator/plugin/Illustrator2019SDK/illustratorapi/illustrator/IAIGlobalUnicodeString.hpp | MingboPeng/rhino.inside | 9fdb1cf1c72e8f16e2e75509c48d22b15e61bef5 | [
"MIT"
] | 317 | 2018-08-23T19:43:37.000Z | 2022-03-12T04:22:20.000Z | Adobe/Illustrator/plugin/Illustrator2019SDK/illustratorapi/illustrator/IAIGlobalUnicodeString.hpp | hiroyainage/rhino.inside | d4bc5d212a3e7492cc0dd18af541232c24bf9117 | [
"MIT"
] | 90 | 2018-10-23T17:11:15.000Z | 2022-03-12T12:47:39.000Z | Adobe/Illustrator/plugin/Illustrator2019SDK/illustratorapi/illustrator/IAIGlobalUnicodeString.hpp | hiroyainage/rhino.inside | d4bc5d212a3e7492cc0dd18af541232c24bf9117 | [
"MIT"
] | 153 | 2018-09-12T02:16:55.000Z | 2022-03-30T04:30:52.000Z | /*************************************************************************
*
* ADOBE CONFIDENTIAL
*
* Copyright 2017 Adobe
*
* All Rights Reserved.
*
* NOTICE: Adobe permits you to use, modify, and distribute this file in
* accordance with the terms of the Adobe license agreement accompanying
* it. If you have receiv... | 34.469565 | 117 | 0.712159 | [
"object"
] |
64fa7c38ef7813356947ac607ee4f4f4665f4675 | 17,937 | cc | C++ | fast_pca/fast_pca.cc | jpuigcerver/fast_pca | f440268ca9383e8042264f0930f76ae41013003a | [
"MIT"
] | 9 | 2016-09-06T01:20:55.000Z | 2022-03-04T06:35:48.000Z | fast_pca/fast_pca.cc | jpuigcerver/fast_pca | f440268ca9383e8042264f0930f76ae41013003a | [
"MIT"
] | 2 | 2015-05-02T14:11:13.000Z | 2015-06-02T00:35:46.000Z | fast_pca/fast_pca.cc | jpuigcerver/fast_pca | f440268ca9383e8042264f0930f76ae41013003a | [
"MIT"
] | 2 | 2017-12-05T17:34:32.000Z | 2022-01-09T13:44:59.000Z | /*
The MIT License (MIT)
Copyright (c) 2014,2015 Joan Puigcerver
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, c... | 38.740821 | 80 | 0.616435 | [
"vector"
] |
64ff9940fa9366dc159b8603655ef38a941e410b | 2,552 | cpp | C++ | src/Program.cpp | chay116/cha_engine | 31cabd71a2f59710c762c931372013d0c2369fd8 | [
"MIT"
] | null | null | null | src/Program.cpp | chay116/cha_engine | 31cabd71a2f59710c762c931372013d0c2369fd8 | [
"MIT"
] | null | null | null | src/Program.cpp | chay116/cha_engine | 31cabd71a2f59710c762c931372013d0c2369fd8 | [
"MIT"
] | null | null | null | //
// Created by Chaeyoung Lim on 2022/02/10.
//
#include "Program.h"
ProgramUPtr Program::Create(const std::vector<ShaderSPtr> &shaders) {
auto program = ProgramUPtr(new Program());
if (!program->Link(shaders))
return nullptr;
return std::move(program);
}
ProgramUPtr Program::Create(
cons... | 30.746988 | 81 | 0.654781 | [
"vector"
] |
8f02c5d88f6dd8348bc168ee30127b4f8167c295 | 3,625 | cc | C++ | src/sepia/ppdtable/closeunique.cc | mahmoudimus/flamingo | 61b46a9f57c9aa4050b0dd8b95a44e1abef0d006 | [
"Unlicense"
] | 4 | 2018-08-23T08:05:33.000Z | 2019-06-13T09:23:27.000Z | src/sepia/ppdtable/closeunique.cc | mahmoudimus/flamingo | 61b46a9f57c9aa4050b0dd8b95a44e1abef0d006 | [
"Unlicense"
] | null | null | null | src/sepia/ppdtable/closeunique.cc | mahmoudimus/flamingo | 61b46a9f57c9aa4050b0dd8b95a44e1abef0d006 | [
"Unlicense"
] | null | null | null | /*
$Id: closeunique.cc 4143 2008-12-08 23:23:55Z abehm $
Copyright (C) 2007 by The Regents of the University of California
Redistribution of this file is permitted under the terms of the
BSD license
Date: 01/14/2006
Author: Rares Vernica <rares (at) ics.uci.edu>
*/
#include "closeunique.h"
#include <a... | 25.70922 | 83 | 0.57931 | [
"vector"
] |
55855adadd86bbe1cf92f22c81902ed268248ba8 | 4,977 | cpp | C++ | src/managers/connection/ConnectionManager.cpp | LesGameDevToolsMagique/MagiqueMessenger | 66c502b9b97f0a8761114f7b601216005a73e907 | [
"MIT"
] | null | null | null | src/managers/connection/ConnectionManager.cpp | LesGameDevToolsMagique/MagiqueMessenger | 66c502b9b97f0a8761114f7b601216005a73e907 | [
"MIT"
] | null | null | null | src/managers/connection/ConnectionManager.cpp | LesGameDevToolsMagique/MagiqueMessenger | 66c502b9b97f0a8761114f7b601216005a73e907 | [
"MIT"
] | null | null | null | //
// Created by Jean-Antoine Dupont on 16/03/2016.
//
#include "ConnectionManager.hpp"
#include <iostream>
ConnectionManager::ConnectionManager(const std::string &ip_address, const unsigned int port)
{
this->socket_fd = SOCKET_FD_DEFAULT_VALUE;
this->ip_address = ip_address;
this->port = port;
... | 25.263959 | 122 | 0.578059 | [
"object"
] |
5585a62aa40becdd7bbcf0acca2158199406287e | 3,195 | cpp | C++ | bark/geometry/standard_shapes.cpp | Bmete7/bark | ced50cf4d8090265b0756ddf97a56f3e92aed817 | [
"MIT"
] | 174 | 2019-04-03T11:37:37.000Z | 2022-03-27T09:14:38.000Z | bark/geometry/standard_shapes.cpp | Bmete7/bark | ced50cf4d8090265b0756ddf97a56f3e92aed817 | [
"MIT"
] | 192 | 2019-04-05T09:41:40.000Z | 2022-03-03T14:14:28.000Z | bark/geometry/standard_shapes.cpp | Bmete7/bark | ced50cf4d8090265b0756ddf97a56f3e92aed817 | [
"MIT"
] | 55 | 2019-04-05T13:22:46.000Z | 2022-01-21T07:03:41.000Z | // Copyright (c) 2020 fortiss GmbH
//
// Authors: Julian Bernhard, Klemens Esterle, Patrick Hart and
// Tobias Kessler
//
// This work is licensed under the terms of the MIT license.
// For a copy, see <https://opensource.org/licenses/MIT>.
#include "bark/geometry/standard_shapes.hpp"
#include <vector>
namespace bark... | 44.375 | 92 | 0.565258 | [
"geometry",
"vector"
] |
5586fc844874088ffa5e4f5e4d7a4961d7362346 | 93,822 | cpp | C++ | code/q3_render.cpp | jiminychris/q3 | 2048ba14d3ca2695bedad22c8049e9455bfc8150 | [
"MIT"
] | null | null | null | code/q3_render.cpp | jiminychris/q3 | 2048ba14d3ca2695bedad22c8049e9455bfc8150 | [
"MIT"
] | null | null | null | code/q3_render.cpp | jiminychris/q3 | 2048ba14d3ca2695bedad22c8049e9455bfc8150 | [
"MIT"
] | null | null | null | /* ========================================================================
$File: $
$Date: $
$Revision: $
$Creator: Christopher LaBauve $
$Notice: $
======================================================================== */
#define TEXT_Z 200000.0f
#define HUD_Z 100000.0f
#define DEBUG_BITMAPS 0
i... | 46.081532 | 137 | 0.586472 | [
"render"
] |
558f22ea57450845e40a538f3b0c199d0f543aad | 8,333 | cpp | C++ | src/core/subsystem/gui/SSChat.cpp | Robograde/Robograde | 2c9a7d0b8250ec240102d504127f5c54532cb2b0 | [
"Zlib"
] | 5 | 2015-10-11T10:22:39.000Z | 2019-07-24T10:09:13.000Z | src/core/subsystem/gui/SSChat.cpp | Robograde/Robograde | 2c9a7d0b8250ec240102d504127f5c54532cb2b0 | [
"Zlib"
] | null | null | null | src/core/subsystem/gui/SSChat.cpp | Robograde/Robograde | 2c9a7d0b8250ec240102d504127f5c54532cb2b0 | [
"Zlib"
] | null | null | null | /**************************************************
Copyright 2015 Isak Almgren
***************************************************/
#include "SSChat.h"
#include <cctype>
#include <messaging/GameMessages.h>
#include "../utility/SSMail.h"
#include "../network/SSNetworkController.h"
#include <input/Input.h>
#include <in... | 24.949102 | 149 | 0.647066 | [
"transform"
] |
5598e593a11cabf2d5bcd49c9e9335770c5b474f | 1,457 | cpp | C++ | meta/SaiAttrWrapper.cpp | vmittal-msft/sonic-sairedis | 6baff35880005aee2854fdcde105c4322c28d04f | [
"Apache-2.0"
] | 50 | 2016-03-23T08:04:44.000Z | 2022-03-25T05:06:16.000Z | meta/SaiAttrWrapper.cpp | vmittal-msft/sonic-sairedis | 6baff35880005aee2854fdcde105c4322c28d04f | [
"Apache-2.0"
] | 589 | 2016-04-01T04:09:09.000Z | 2022-03-31T00:38:10.000Z | meta/SaiAttrWrapper.cpp | vmittal-msft/sonic-sairedis | 6baff35880005aee2854fdcde105c4322c28d04f | [
"Apache-2.0"
] | 234 | 2016-03-28T20:59:21.000Z | 2022-03-23T09:26:22.000Z | #include "SaiAttrWrapper.h"
#include "swss/logger.h"
#include "sai_serialize.h"
using namespace saimeta;
SaiAttrWrapper::SaiAttrWrapper(
_In_ const sai_attr_metadata_t* meta,
_In_ const sai_attribute_t& attr):
m_meta(meta),
m_attr(attr)
{
SWSS_LOG_ENTER();
if (!meta)
{
S... | 20.814286 | 79 | 0.684283 | [
"object"
] |
559d76ad39ff1642b25d91a04b26c53d63283245 | 1,255 | cpp | C++ | sortElementsOfArrayByFrequency.cpp | harshallgarg/CPP | 4d15c5e5d426bb00d192368d21924ec9f017445f | [
"MIT"
] | 2 | 2020-08-09T02:09:50.000Z | 2020-08-09T07:07:47.000Z | sortElementsOfArrayByFrequency.cpp | harshallgarg/CPP | 4d15c5e5d426bb00d192368d21924ec9f017445f | [
"MIT"
] | null | null | null | sortElementsOfArrayByFrequency.cpp | harshallgarg/CPP | 4d15c5e5d426bb00d192368d21924ec9f017445f | [
"MIT"
] | 4 | 2020-05-25T10:24:14.000Z | 2021-05-03T07:52:35.000Z | /*
elements that have higher frequency come first,
if frequencies of two elements are same, then smaller number comes first
*/
#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cstdio>
using namespace std;
unordered_map<int,int> m2; //stores index of the... | 20.916667 | 81 | 0.563347 | [
"vector"
] |
55a636a7c8c8dd277151e461a79b849e20020e0e | 5,620 | cpp | C++ | tests/MappingBuffer_unittest.cpp | adamelliot/LightString | cca027cd788954543491702b41a0e1dc43ea72bf | [
"MIT"
] | 3 | 2015-10-21T20:41:32.000Z | 2017-03-27T19:23:33.000Z | tests/MappingBuffer_unittest.cpp | adamelliot/LightString | cca027cd788954543491702b41a0e1dc43ea72bf | [
"MIT"
] | 1 | 2017-06-30T23:35:34.000Z | 2017-06-30T23:35:34.000Z | tests/MappingBuffer_unittest.cpp | adamelliot/LightString | cca027cd788954543491702b41a0e1dc43ea72bf | [
"MIT"
] | null | null | null | #include "gtest/gtest.h"
#include <stdlib.h>
#include "helpers.h"
#include "../src/PixelBuffer.h"
using namespace LightString;
// -------------- 2d -----------------
TEST(TMappingPixelBuffer2d, creation) {
TMappingPixelBuffer2d<TRGB, uint8_t> buffer(20, 20);
EXPECT_EQ(buffer.length, 400);
EXPECT_TRUE(buffer.sh... | 25.6621 | 59 | 0.665302 | [
"3d"
] |
55b0ed52c698011e91fd02bbef4d57bdefa18a82 | 1,331 | cpp | C++ | 863. All Nodes Distance K in Binary Tree.cpp | dipta007/leetcode-solutions-dipta007 | 0454ad24ce686a37fab8025c75efb7d857985f29 | [
"MIT"
] | null | null | null | 863. All Nodes Distance K in Binary Tree.cpp | dipta007/leetcode-solutions-dipta007 | 0454ad24ce686a37fab8025c75efb7d857985f29 | [
"MIT"
] | null | null | null | 863. All Nodes Distance K in Binary Tree.cpp | dipta007/leetcode-solutions-dipta007 | 0454ad24ce686a37fab8025c75efb7d857985f29 | [
"MIT"
] | null | null | null | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
int k;
TreeNode *target;
vector <int> res;
public:
int dfs(TreeNode *curr) {
if(!cu... | 22.183333 | 68 | 0.41698 | [
"vector"
] |
55b16a166b9b9d202e070bd8d1924dcaf740799b | 3,983 | cpp | C++ | combined/example/example-app-rs-panda.cpp | hietalajulius/rs-torch-panda | 4c1f06de1fe8b03c60056538461982fa5aa9d5b1 | [
"MIT"
] | null | null | null | combined/example/example-app-rs-panda.cpp | hietalajulius/rs-torch-panda | 4c1f06de1fe8b03c60056538461982fa5aa9d5b1 | [
"MIT"
] | null | null | null | combined/example/example-app-rs-panda.cpp | hietalajulius/rs-torch-panda | 4c1f06de1fe8b03c60056538461982fa5aa9d5b1 | [
"MIT"
] | null | null | null | // Copyright (c) 2017 Franka Emika GmbH
// Use of this source code is governed by the Apache-2.0 license, see LICENSE
#include <cmath>
#include <iostream>
#include <franka/exception.h>
#include <franka/robot.h>
#include "examples_common.h"
#include <librealsense2/rs.hpp>
#include<thread>
void thread_fn_1() {
try... | 31.864 | 142 | 0.590008 | [
"object"
] |
55b29914188cb6d4eb4b51cf8890e9c0b74c54b5 | 2,883 | cc | C++ | sas/src/model/DescribeUuidsByVulNamesResult.cc | aliyun/aliyun-openapi-cpp-sdk | 0cf5861ece17dfb0bb251f13bf3fbdb39c0c6e36 | [
"Apache-2.0"
] | 89 | 2018-02-02T03:54:39.000Z | 2021-12-13T01:32:55.000Z | sas/src/model/DescribeUuidsByVulNamesResult.cc | aliyun/aliyun-openapi-cpp-sdk | 0cf5861ece17dfb0bb251f13bf3fbdb39c0c6e36 | [
"Apache-2.0"
] | 89 | 2018-03-14T07:44:54.000Z | 2021-11-26T07:43:25.000Z | sas/src/model/DescribeUuidsByVulNamesResult.cc | aliyun/aliyun-openapi-cpp-sdk | 0cf5861ece17dfb0bb251f13bf3fbdb39c0c6e36 | [
"Apache-2.0"
] | 69 | 2018-01-22T09:45:52.000Z | 2022-03-28T07:58:38.000Z | /*
* Copyright 2009-2017 Alibaba Cloud 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 required... | 42.397059 | 130 | 0.814429 | [
"vector",
"model"
] |
55b9563c7bba7b40d91e799c91a714c40952aaec | 2,629 | cpp | C++ | bistro/scheduler/test/test_level_for_tasks.cpp | jiazerojia/bistro | 95c8d9cf9786ff87d845d7732622a46d90de5f58 | [
"BSD-3-Clause"
] | 1 | 2021-05-19T23:02:04.000Z | 2021-05-19T23:02:04.000Z | bistro/scheduler/test/test_level_for_tasks.cpp | jiazerojia/bistro | 95c8d9cf9786ff87d845d7732622a46d90de5f58 | [
"BSD-3-Clause"
] | null | null | null | bistro/scheduler/test/test_level_for_tasks.cpp | jiazerojia/bistro | 95c8d9cf9786ff87d845d7732622a46d90de5f58 | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (c) 2017, Facebook, Inc.
* 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. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*
*/
#include <gt... | 30.929412 | 79 | 0.715101 | [
"object"
] |
55bee80f23563f929758c0c23e278a893f66726b | 2,896 | hpp | C++ | Mikropascal-Compiler/Scanner.hpp | jonfast565/Mikropascal-Compiler | 58efa6344f06dc4ddae2e72fe54bbe4dfc2d1bca | [
"Unlicense",
"BSD-3-Clause"
] | null | null | null | Mikropascal-Compiler/Scanner.hpp | jonfast565/Mikropascal-Compiler | 58efa6344f06dc4ddae2e72fe54bbe4dfc2d1bca | [
"Unlicense",
"BSD-3-Clause"
] | null | null | null | Mikropascal-Compiler/Scanner.hpp | jonfast565/Mikropascal-Compiler | 58efa6344f06dc4ddae2e72fe54bbe4dfc2d1bca | [
"Unlicense",
"BSD-3-Clause"
] | null | null | null | #ifndef scanner_h
#define scanner_h
#include "Standard.hpp"
#include "Input.hpp"
#include "FiniteAutomata.hpp"
#include "Tokens.hpp"
#include "Helper.hpp"
// makes this easier to read
class Scanner;
using ScannerPtr = shared_ptr<Scanner>;
using ScanBufPtr = shared_ptr<vector<char>>;
using ScanBuf = vector<char>;
usin... | 23.168 | 59 | 0.697169 | [
"vector"
] |
55c0d6239234d62e5dbf2fbf098029a7610d857a | 1,599 | hpp | C++ | src/include/XEUI/widgets/UIItemBox.hpp | devxkh/FrankE | 72faca02759b54aaec842831f3c7a051e7cf5335 | [
"MIT"
] | 11 | 2017-01-17T15:02:25.000Z | 2020-11-27T16:54:42.000Z | src/include/XEUI/widgets/UIItemBox.hpp | devxkh/FrankE | 72faca02759b54aaec842831f3c7a051e7cf5335 | [
"MIT"
] | 9 | 2016-10-23T20:15:38.000Z | 2018-02-06T11:23:17.000Z | src/include/XEUI/widgets/UIItemBox.hpp | devxkh/FrankE | 72faca02759b54aaec842831f3c7a051e7cf5335 | [
"MIT"
] | 2 | 2019-08-29T10:23:51.000Z | 2020-04-03T06:08:34.000Z | #ifndef ITEMBOX_H
#define ITEMBOX_H
#include <XEUI/XEUI.hpp>
#include <XEUI/Widgets/UIElement.hpp>
#include <functional>
namespace XE {
namespace UI {
//predefinition
enum ITEM_ID;
class ItemBar;
class ItemBox : public UIElement
{
public:
/// @brief Function type of listeners associated with Event
///
typedef s... | 21.039474 | 104 | 0.727955 | [
"vector"
] |
55d26e823d3ee128008e4d21e075c61327aed599 | 900 | cpp | C++ | permutations.cpp | ArnabBir/leetcode-solutions | 31cf1edaa2f39c1f8d0300ad815889999058a0c8 | [
"MIT"
] | null | null | null | permutations.cpp | ArnabBir/leetcode-solutions | 31cf1edaa2f39c1f8d0300ad815889999058a0c8 | [
"MIT"
] | null | null | null | permutations.cpp | ArnabBir/leetcode-solutions | 31cf1edaa2f39c1f8d0300ad815889999058a0c8 | [
"MIT"
] | null | null | null | class Solution {
public:
void permuteUtil(vector<int>& nums,
vector<int>& perm,
vector<bool>& visited,
vector<vector<int>> & perms,
int n) {
if(perm.size() == n) {
perms.push_back(perm);
... | 26.470588 | 55 | 0.442222 | [
"vector"
] |
55d91f080e7129799bfc0ce228ae5decb2cbeeb6 | 2,433 | cpp | C++ | camera/streamRetrieve.cpp | xiaolong1130/R-M_Robot-2 | 247e778659d21986c1bbf756b05bbaab352d39c5 | [
"BSD-3-Clause"
] | null | null | null | camera/streamRetrieve.cpp | xiaolong1130/R-M_Robot-2 | 247e778659d21986c1bbf756b05bbaab352d39c5 | [
"BSD-3-Clause"
] | null | null | null | camera/streamRetrieve.cpp | xiaolong1130/R-M_Robot-2 | 247e778659d21986c1bbf756b05bbaab352d39c5 | [
"BSD-3-Clause"
] | 1 | 2021-05-12T07:49:38.000Z | 2021-05-12T07:49:38.000Z | #ifdef __unix__
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#endif
#include "StreamRetrieve.h"
#include "GenICam/Frame.h"
#include "Media/RecordVideo.h"
extern HANDLE g_hHandle;
StreamRetrieve::StreamRetrieve(IStreamSourcePtr& streamSptr)
: CThread("streamRetrieve")
, m_isLoo... | 23.852941 | 182 | 0.689684 | [
"object"
] |
55d97db7e773b577944b0eb5b7dc7e08d1f89ff8 | 9,573 | cpp | C++ | iecp/src/v20210914/model/GridInfo.cpp | suluner/tencentcloud-sdk-cpp | a56c73cc3f488c4d1e10755704107bb15c5e000d | [
"Apache-2.0"
] | null | null | null | iecp/src/v20210914/model/GridInfo.cpp | suluner/tencentcloud-sdk-cpp | a56c73cc3f488c4d1e10755704107bb15c5e000d | [
"Apache-2.0"
] | null | null | null | iecp/src/v20210914/model/GridInfo.cpp | suluner/tencentcloud-sdk-cpp | a56c73cc3f488c4d1e10755704107bb15c5e000d | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. 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
... | 26.815126 | 139 | 0.668338 | [
"model"
] |
55e51b0b959c9146480c4a600695536e720f8a76 | 3,146 | cpp | C++ | src/rt_media/GLRender/RTShaderUtil.cpp | wizardst/Rockit | 8c6c5e59b6069735e95e34cca2607b9b6541b520 | [
"Apache-2.0"
] | null | null | null | src/rt_media/GLRender/RTShaderUtil.cpp | wizardst/Rockit | 8c6c5e59b6069735e95e34cca2607b9b6541b520 | [
"Apache-2.0"
] | null | null | null | src/rt_media/GLRender/RTShaderUtil.cpp | wizardst/Rockit | 8c6c5e59b6069735e95e34cca2607b9b6541b520 | [
"Apache-2.0"
] | 2 | 2022-01-04T20:29:44.000Z | 2022-01-04T20:39:31.000Z | /*
* Copyright 2018 Rockchip Electronics Co. LTD
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by a... | 28.089286 | 86 | 0.63986 | [
"render",
"object"
] |
55e9a2839d52776899a99a789dbc396319803482 | 12,444 | cc | C++ | modules/planning/lattice/behavior_decider/path_time_neighborhood.cc | zhuyawen/apollo | 91c1811970edf0a43f2b4c3b6070c171e11e646d | [
"Apache-2.0"
] | null | null | null | modules/planning/lattice/behavior_decider/path_time_neighborhood.cc | zhuyawen/apollo | 91c1811970edf0a43f2b4c3b6070c171e11e646d | [
"Apache-2.0"
] | null | null | null | modules/planning/lattice/behavior_decider/path_time_neighborhood.cc | zhuyawen/apollo | 91c1811970edf0a43f2b4c3b6070c171e11e646d | [
"Apache-2.0"
] | null | null | null | /******************************************************************************
* Copyright 2017 The Apollo Authors. 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
... | 37.146269 | 80 | 0.697525 | [
"vector"
] |
55ed360b877dc5590409baf54c83d7657600fb85 | 1,506 | cpp | C++ | examples/jacobi-iteration/main.cpp | Mooxmirror/tmath | aef1a6ce5a121987c3d943e0de9ec4a8aafe5054 | [
"MIT"
] | 8 | 2016-03-29T04:37:57.000Z | 2020-10-29T16:53:48.000Z | examples/jacobi-iteration/main.cpp | lnsp/tmath | aef1a6ce5a121987c3d943e0de9ec4a8aafe5054 | [
"MIT"
] | 23 | 2016-04-06T14:50:04.000Z | 2018-07-10T22:51:33.000Z | examples/jacobi-iteration/main.cpp | Mooxmirror/tmath | aef1a6ce5a121987c3d943e0de9ec4a8aafe5054 | [
"MIT"
] | 1 | 2019-09-04T23:28:20.000Z | 2019-09-04T23:28:20.000Z | #include <iostream>
#include "tmath.hpp"
TMath::Vector solve(TMath::Matrix A, TMath::Vector b, TMath::DOUBLE delta)
{
int n = A.rowCount(), m = A.colCount(), p = b.dim();
if (n != m || n != p) throw "mismatch dimensions";
TMath::Vector x, x_ = b;
do {
x = b;
for (int i = 0; i < n; i++)... | 26.421053 | 77 | 0.439575 | [
"vector"
] |
55f0fa3c70058259daf8c3cf31ed00d7078ea9da | 833 | cpp | C++ | console/src/boost_1_78_0/libs/python/test/aligned_class.cpp | vany152/FilesHash | 39f282807b7f1abc56dac389e8259ee3bb557a8d | [
"MIT"
] | 375 | 2015-01-29T13:45:31.000Z | 2022-03-30T01:29:20.000Z | console/src/boost_1_78_0/libs/python/test/aligned_class.cpp | vany152/FilesHash | 39f282807b7f1abc56dac389e8259ee3bb557a8d | [
"MIT"
] | 328 | 2015-03-18T03:23:05.000Z | 2022-03-19T16:45:19.000Z | console/src/boost_1_78_0/libs/python/test/aligned_class.cpp | vany152/FilesHash | 39f282807b7f1abc56dac389e8259ee3bb557a8d | [
"MIT"
] | 208 | 2015-01-14T14:57:35.000Z | 2022-03-23T11:25:56.000Z | // 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)
#include <boost/python/module.hpp>
#include <boost/python/def.hpp>
#include <boost/python/object.hpp>
#include <boost/python/class.hpp>
#include <boost/assert.hpp>
... | 24.5 | 66 | 0.684274 | [
"object"
] |
55f18b671058376a5700d14476a71c1da2ef6137 | 8,618 | cpp | C++ | src/Unserialize.cpp | Justasic/Titanium | 398741d42dd25642e122823ad86170e271496186 | [
"BSD-2-Clause"
] | 1 | 2015-09-08T20:55:08.000Z | 2015-09-08T20:55:08.000Z | src/Unserialize.cpp | Justasic/Titanium | 398741d42dd25642e122823ad86170e271496186 | [
"BSD-2-Clause"
] | null | null | null | src/Unserialize.cpp | Justasic/Titanium | 398741d42dd25642e122823ad86170e271496186 | [
"BSD-2-Clause"
] | null | null | null | #include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <cstring>
#include "Unserialize.h"
#include "json.hpp"
///////////////////////////////////////////////
// Function: UnserializeData
//
// Description:
// Accept a block of data and unserialize that data
// into an information_t structure so we can use... | 43.525253 | 138 | 0.629612 | [
"vector",
"model"
] |
55f55c8c4323e0e98ba3be4b6615ee0e261ecc35 | 2,006 | cpp | C++ | franka-interface/src/termination_handler/final_joint_termination_handler.cpp | iamlab-cmu/franka-interface | fffa3983884d29d723c8a04b8883244c6cfc9621 | [
"Apache-2.0"
] | 9 | 2021-11-09T01:35:37.000Z | 2022-03-24T02:55:30.000Z | franka-interface/src/termination_handler/final_joint_termination_handler.cpp | iamlab-cmu/franka-interface | fffa3983884d29d723c8a04b8883244c6cfc9621 | [
"Apache-2.0"
] | null | null | null | franka-interface/src/termination_handler/final_joint_termination_handler.cpp | iamlab-cmu/franka-interface | fffa3983884d29d723c8a04b8883244c6cfc9621 | [
"Apache-2.0"
] | 1 | 2022-03-02T17:40:56.000Z | 2022-03-02T17:40:56.000Z | //
// Created by mohit on 11/30/18.
//
#include "franka-interface/termination_handler/final_joint_termination_handler.h"
#include <exception>
#include "franka-interface/trajectory_generator/joint_trajectory_generator.h"
void FinalJointTerminationHandler::parse_parameters() {
int data_size = (params_[1] + (params_... | 31.34375 | 110 | 0.655533 | [
"model"
] |
55fdd455bb8e82b03d5ec9963aed3f3ecf152c78 | 749 | cpp | C++ | medium/0781numRabbits.cpp | wanghengg/LeetCode | 4f73d7e176c8de5d2d9b87ab2812f7aa80c20a79 | [
"Apache-2.0"
] | null | null | null | medium/0781numRabbits.cpp | wanghengg/LeetCode | 4f73d7e176c8de5d2d9b87ab2812f7aa80c20a79 | [
"Apache-2.0"
] | null | null | null | medium/0781numRabbits.cpp | wanghengg/LeetCode | 4f73d7e176c8de5d2d9b87ab2812f7aa80c20a79 | [
"Apache-2.0"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
class Solution{
public:
/*
* 用map记录(兔子的答案，相同答案的个数)
* 说有k个兔子颜色和我一样的兔子最多有k+1，剩余的兔子应该有其他的颜色
*/
int numRabbits(vector<int>& answers) {
map<int, int> numbers;
for (auto& iter : answers) {
numbers[iter]++;
}
int ... | 23.40625 | 52 | 0.504673 | [
"vector"
] |
55fe0f8d1e23d6997a5523de8231a5f0ad9c5211 | 28,524 | cpp | C++ | src/core/conv.cpp | masc-it/dlprimitives | 475ec017708482e82892e106117069e05c9e2376 | [
"MIT"
] | null | null | null | src/core/conv.cpp | masc-it/dlprimitives | 475ec017708482e82892e106117069e05c9e2376 | [
"MIT"
] | null | null | null | src/core/conv.cpp | masc-it/dlprimitives | 475ec017708482e82892e106117069e05c9e2376 | [
"MIT"
] | null | null | null | #include <dlprim/core/conv.hpp>
#include <dlprim/core/bias.hpp>
#include <dlprim/core/common.hpp>
#include <dlprim/gpu/gemm.hpp>
#include <dlprim/gpu/program_cache.hpp>
namespace dlprim {
namespace core {
Shape Conv2DBase::get_output_shape(Convolution2DConfigBase const &config,Shape const &in)
{
DLPRIM... | 38.861035 | 157 | 0.525978 | [
"shape"
] |
55fe4aa5364b2ef8bc871519641901b3b33a855a | 682 | cpp | C++ | Chapter12/lin_space_ranges.cpp | markusbuchholz/Cpp-High-Performance-Second-Edition | 9d8ce97fae15a5f893a780fb3f8b187d11961a43 | [
"MIT"
] | 57 | 2020-07-09T22:54:31.000Z | 2022-03-31T14:18:41.000Z | Chapter12/lin_space_ranges.cpp | markusbuchholz/Cpp-High-Performance-Second-Edition | 9d8ce97fae15a5f893a780fb3f8b187d11961a43 | [
"MIT"
] | 5 | 2021-04-02T17:25:31.000Z | 2021-07-30T09:38:42.000Z | Chapter12/lin_space_ranges.cpp | PacktPublishing/Cpp-High-Performance-Second-Edition | 9d8ce97fae15a5f893a780fb3f8b187d11961a43 | [
"MIT"
] | 36 | 2019-12-25T19:30:47.000Z | 2022-03-16T16:41:02.000Z | #include <gtest/gtest.h>
#include "lin_value.h"
#include <sstream>
#include <version>
#if defined(__cpp_lib_ranges)
#include <ranges>
namespace {
template <typename T>
auto lin_space(T start, T stop, std::size_t n) {
return std::views::iota(0ul, n) |
std::views::transform([=](auto i) {
return lin_value(s... | 17.947368 | 49 | 0.585044 | [
"transform"
] |
55fea94b67583cdcc6dd4c84d4fd12ce34f71220 | 4,712 | cpp | C++ | src/nn.cpp | rohskopf/modulant | eaaacd70a5f5811798b25e7447fdf76ab69b97c3 | [
"MIT"
] | null | null | null | src/nn.cpp | rohskopf/modulant | eaaacd70a5f5811798b25e7447fdf76ab69b97c3 | [
"MIT"
] | null | null | null | src/nn.cpp | rohskopf/modulant | eaaacd70a5f5811798b25e7447fdf76ab69b97c3 | [
"MIT"
] | null | null | null | /*
nn.cpp
Copyright (c) 2018 Andrew Rohskopf
This file is distributed under the terms of the MIT license.
Please see the file 'LICENCE.txt' in the root directory
or http://opensource.org/licenses/mit-license.php for information.
*/
#include <iostream>
#include <iomanip>
#include <vector>
#include "mpi.h"
#inc... | 24.414508 | 109 | 0.542445 | [
"vector"
] |
55ff894d77a585977e37c6d0e9aaefdbb684d5cb | 622 | cpp | C++ | Kattis_Problems/Geppetto.cpp | MAXI0008/Kattis-Problems | ff6ec752b741a56fc37a993c528fc925ca302cc8 | [
"MIT"
] | 3 | 2019-04-01T05:38:09.000Z | 2021-11-17T11:43:20.000Z | Kattis_Problems/Geppetto.cpp | MAXI0008/Algorithms-Practices | ff6ec752b741a56fc37a993c528fc925ca302cc8 | [
"MIT"
] | null | null | null | Kattis_Problems/Geppetto.cpp | MAXI0008/Algorithms-Practices | ff6ec752b741a56fc37a993c528fc925ca302cc8 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, M, a, b, cnt = 0;
bool valid;
scanf("%d %d", &N, &M);
vector<pair<int, int>> constrains;
for (int i = 0; i < M; i++) {
scanf("%d %d", &a, &b);
constrains.push_back(make_pair(a,b));
}
for (int i = 0; i < (1<<N);... | 27.043478 | 112 | 0.427653 | [
"vector"
] |
360154a8d8e25156e94b1bc2fe3f379f59461059 | 11,285 | cpp | C++ | Examples_3/Aura/src/AuraMiddlewareImpl/TaskManager.cpp | swan-gh/ForgeWorks-TF-Branch | e5d64cc16e0203fadde73e93d4f2c2036f184824 | [
"Apache-2.0"
] | null | null | null | Examples_3/Aura/src/AuraMiddlewareImpl/TaskManager.cpp | swan-gh/ForgeWorks-TF-Branch | e5d64cc16e0203fadde73e93d4f2c2036f184824 | [
"Apache-2.0"
] | null | null | null | Examples_3/Aura/src/AuraMiddlewareImpl/TaskManager.cpp | swan-gh/ForgeWorks-TF-Branch | e5d64cc16e0203fadde73e93d4f2c2036f184824 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (c) 2017-2022 The Forge Interactive Inc.
*
* This is a part of Aura.
*
* This file(code) is licensed under a
* Creative Commons Attribution-NonCommercial 4.0 International License
*
* (https://creativecommons.org/licenses/by-nc/4.0/legalcode)
*
* Based on a work at https://github.com/Conf... | 24.747807 | 117 | 0.683208 | [
"object"
] |
361aa950c9e05d281ddd7b3971c7817617ca7f5b | 17,663 | hpp | C++ | src/singlenode/tcsc_spmspv2.hpp | hmofrad/LA3HPC | 99d0be526d4f00ca91ad9782fc84f6e633bde29a | [
"BSD-3-Clause"
] | 1 | 2019-03-01T04:09:18.000Z | 2019-03-01T04:09:18.000Z | src/singlenode/tcsc_spmspv2.hpp | hmofrad/GraphTap | 99d0be526d4f00ca91ad9782fc84f6e633bde29a | [
"BSD-3-Clause"
] | null | null | null | src/singlenode/tcsc_spmspv2.hpp | hmofrad/GraphTap | 99d0be526d4f00ca91ad9782fc84f6e633bde29a | [
"BSD-3-Clause"
] | null | null | null | /*
* tcsc.hpp: TCSC SpMSpV implementation
* (c) Mohammad Hasanzadeh Mofrad, 2019
* (e) m.hasanzadeh.mofrad@gmail.com
*/
#ifndef TCSC_SPMVSPV_HPP
#define TCSC_SPMSPV_HPP
#include <chrono>
#include "pair.hpp"
#include "io.cpp"
#include "tcsc_base.hpp"
class TCSC {
public:
TC... | 31.317376 | 145 | 0.506879 | [
"vector"
] |
361d739d7313c3d79697aef6ef52f7884630ae46 | 235,793 | cpp | C++ | RSDKv4/Script.cpp | 0xR00KIE/Decomp-for-S1F | c8ffedd211f25bb46803f9d637baf1b1fc635db0 | [
"Unlicense"
] | 2 | 2022-01-15T05:05:39.000Z | 2022-03-19T07:36:31.000Z | RSDKv4/Script.cpp | LittlePlanetCD/Decomp-for-S1F | c8ffedd211f25bb46803f9d637baf1b1fc635db0 | [
"Unlicense"
] | null | null | null | RSDKv4/Script.cpp | LittlePlanetCD/Decomp-for-S1F | c8ffedd211f25bb46803f9d637baf1b1fc635db0 | [
"Unlicense"
] | null | null | null | #include "RetroEngine.hpp"
#include <cmath>
ObjectScript objectScriptList[OBJECT_COUNT];
ScriptPtr functionScriptList[FUNCTION_COUNT];
int scriptData[SCRIPTDATA_COUNT];
int jumpTableData[JUMPTABLE_COUNT];
int jumpTableStack[JUMPSTACK_COUNT];
int functionStack[FUNCSTACK_COUNT];
int foreachStack[FORSTACK_COUNT];
int s... | 46.242989 | 150 | 0.493959 | [
"object",
"3d"
] |
361fde6d98f9aee7fe0202333623fd3213dabb7e | 5,236 | cpp | C++ | modules/clipper/clipper/core/clipper_stats.cpp | jorgediazjr/dials-dev20191018 | 77d66c719b5746f37af51ad593e2941ed6fbba17 | [
"BSD-3-Clause"
] | null | null | null | modules/clipper/clipper/core/clipper_stats.cpp | jorgediazjr/dials-dev20191018 | 77d66c719b5746f37af51ad593e2941ed6fbba17 | [
"BSD-3-Clause"
] | null | null | null | modules/clipper/clipper/core/clipper_stats.cpp | jorgediazjr/dials-dev20191018 | 77d66c719b5746f37af51ad593e2941ed6fbba17 | [
"BSD-3-Clause"
] | 1 | 2020-02-04T15:39:06.000Z | 2020-02-04T15:39:06.000Z | /* clipper_stats.cpp: implementation file for clipper helper functions */
//C Copyright (C) 2000-2004 Kevin Cowtan and University of York
//C Copyright (C) 2000-2005 Kevin Cowtan and University of York
//L
//L This library is free software and is distributed under the terms
//L and conditions of version 2.1 of the GN... | 32.521739 | 84 | 0.647441 | [
"object",
"vector"
] |
362541e13bf118c4d76be4785b20a7659eb83167 | 721 | cpp | C++ | src/world/serialization/entityparsers/propparser.cpp | Eae02/tank-game | 0c526b177ccc15dd49e3228489163f13335040db | [
"Zlib"
] | null | null | null | src/world/serialization/entityparsers/propparser.cpp | Eae02/tank-game | 0c526b177ccc15dd49e3228489163f13335040db | [
"Zlib"
] | null | null | null | src/world/serialization/entityparsers/propparser.cpp | Eae02/tank-game | 0c526b177ccc15dd49e3228489163f13335040db | [
"Zlib"
] | null | null | null | #include "propparser.h"
#include "../parseutils.h"
#include "../../entities/propentity.h"
#include "../../../utils/jsonparseutils.h"
namespace TankGame
{
std::unique_ptr<Entity> PropParser::ParseEntity(const nlohmann::json& json, const ParseParams& params) const
{
std::unique_ptr<PropEntity> entity = std::make_uni... | 26.703704 | 109 | 0.656033 | [
"solid"
] |
1568748b6d4125e1fb6c3ca760aafe966c9a2731 | 1,825 | hpp | C++ | KPI/RayTracer/Include/RayTracer/Scene.hpp | All8Up/cpf | 81c68fbb69619261a5aa058cda73e35812ed3543 | [
"MIT"
] | 6 | 2017-02-15T01:50:32.000Z | 2019-07-05T13:50:57.000Z | KPI/RayTracer/Include/RayTracer/Scene.hpp | All8Up/cpf | 81c68fbb69619261a5aa058cda73e35812ed3543 | [
"MIT"
] | 40 | 2017-04-06T13:29:02.000Z | 2018-04-20T23:39:21.000Z | KPI/RayTracer/Include/RayTracer/Scene.hpp | All8Up/cpf | 81c68fbb69619261a5aa058cda73e35812ed3543 | [
"MIT"
] | 3 | 2017-08-03T15:17:01.000Z | 2019-03-08T07:58:59.000Z | //////////////////////////////////////////////////////////////////////////
#pragma once
#include "Configuration.hpp"
#include <string>
#include "RayTracer/Camera.hpp"
#include "RayTracer/Environment.hpp"
#include "RayTracer/Material.hpp"
#include "RayTracer/Model.hpp"
#include "RayTracer/Light.hpp"
#include "RayTracer/... | 29.918033 | 113 | 0.565479 | [
"render",
"model"
] |
156927d452f242757453b0705fc5f724025848c6 | 2,425 | hpp | C++ | include/natalie_parser/node/call_node.hpp | natalie-lang/natalie_parser | 683bec34f8708f5b9160359ca0107edda242fdb9 | [
"MIT"
] | 10 | 2022-03-14T14:57:17.000Z | 2022-03-31T06:51:28.000Z | include/natalie_parser/node/call_node.hpp | natalie-lang/natalie_parser | 683bec34f8708f5b9160359ca0107edda242fdb9 | [
"MIT"
] | 1 | 2022-03-15T21:40:34.000Z | 2022-03-16T02:05:41.000Z | include/natalie_parser/node/call_node.hpp | natalie-lang/natalie_parser | 683bec34f8708f5b9160359ca0107edda242fdb9 | [
"MIT"
] | 1 | 2022-03-15T20:24:53.000Z | 2022-03-15T20:24:53.000Z | #pragma once
#include "natalie_parser/node/node.hpp"
#include "natalie_parser/node/node_with_args.hpp"
#include "tm/hashmap.hpp"
#include "tm/owned_ptr.hpp"
#include "tm/string.hpp"
namespace NatalieParser {
using namespace TM;
class CallNode : public NodeWithArgs {
public:
CallNode(const Token &token, SharedPt... | 28.197674 | 91 | 0.593814 | [
"transform"
] |
156f392672aff60d3516443fde98d751cfcd70bd | 3,174 | cpp | C++ | src/systems/inventory_system.cpp | albin-johansson/wanderer | 74c1e788e37d6555def23fb6f49d2342baf2a6fe | [
"MIT"
] | 11 | 2021-05-09T09:19:35.000Z | 2022-03-22T10:11:16.000Z | src/systems/inventory_system.cpp | albin-johansson/wanderer | 74c1e788e37d6555def23fb6f49d2342baf2a6fe | [
"MIT"
] | 5 | 2021-02-23T11:43:10.000Z | 2021-02-23T11:43:52.000Z | src/systems/inventory_system.cpp | albin-johansson/wanderer | 74c1e788e37d6555def23fb6f49d2342baf2a6fe | [
"MIT"
] | null | null | null | #include "inventory_system.hpp"
#include "container_trigger.hpp"
#include "game_constants.hpp"
#include "index_to_matrix.hpp"
#include "inventory.hpp"
#include "item.hpp"
#include "maybe.hpp"
#include "update_triggers.hpp"
namespace wanderer::sys {
namespace {
inline constexpr auto nRows = 4; ///< Amount of i... | 31.117647 | 89 | 0.643352 | [
"render"
] |
1579d27ca47db7e7aed3aaabbfb2d0eb81743c8f | 1,365 | cpp | C++ | Solutions/codeforces/1426C.cpp | eashwaranRaghu/Data-Structures-and-Algorithms | 3aad0f1da3d95b572fbb1950c770198bd042a80f | [
"MIT"
] | 6 | 2020-01-29T14:05:56.000Z | 2021-04-24T04:37:27.000Z | Solutions/codeforces/1426C.cpp | eashwaranRaghu/Data-Structures-and-Algorithms | 3aad0f1da3d95b572fbb1950c770198bd042a80f | [
"MIT"
] | null | null | null | Solutions/codeforces/1426C.cpp | eashwaranRaghu/Data-Structures-and-Algorithms | 3aad0f1da3d95b572fbb1950c770198bd042a80f | [
"MIT"
] | 1 | 2020-05-22T06:37:20.000Z | 2020-05-22T06:37:20.000Z | // 28-09-2020 14:24:14 necronomicon
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ARR_MAX (int)1e5
#define INF (int)1e9 //10^9
#define EPS 1e-9 //10^-9
#define MOD 1000000007 //10^9+7
#define PI 3.1415926535897932384626433832795
typedef long int int32;
typedef unsigned ... | 24.818182 | 50 | 0.625641 | [
"vector"
] |
15866b18b9e081a3b03211e164c63408e53d426e | 956 | cpp | C++ | ABC/ABC244/C/abc244-c.cpp | keitaronaruse/AtCoderTraining | 9fb8f0d492be678a788080c96b06c33992cb6db2 | [
"MIT"
] | null | null | null | ABC/ABC244/C/abc244-c.cpp | keitaronaruse/AtCoderTraining | 9fb8f0d492be678a788080c96b06c33992cb6db2 | [
"MIT"
] | null | null | null | ABC/ABC244/C/abc244-c.cpp | keitaronaruse/AtCoderTraining | 9fb8f0d492be678a788080c96b06c33992cb6db2 | [
"MIT"
] | null | null | null | /**
* @file abc244-c.cpp
* @brief ABC244 Problem C - Yamanote Line Game
* @author Keitaro Naruse
* @date 2022-03-20
* @copyright MIT License
* @details https://atcoder.jp/contests/abc244/tasks/abc244_c
*/
// # Solution
#include <iostream>
#include <vector>
int main()
{
// Read N = [ 1, 10^3 ]
int N = 0;
... | 21.244444 | 66 | 0.479079 | [
"vector"
] |
15875be5210cc63252e2bd9da0d726f26ba40d1b | 4,847 | cpp | C++ | implementations/ugene/src/plugins/api_tests/src/core/datatype/udr/RawDataUdrSchemaUnitTests.cpp | r-barnes/sw_comparison | 1ac2c9cc10a32badd6b8fb1e96516c97f7800176 | [
"BSD-Source-Code"
] | null | null | null | implementations/ugene/src/plugins/api_tests/src/core/datatype/udr/RawDataUdrSchemaUnitTests.cpp | r-barnes/sw_comparison | 1ac2c9cc10a32badd6b8fb1e96516c97f7800176 | [
"BSD-Source-Code"
] | null | null | null | implementations/ugene/src/plugins/api_tests/src/core/datatype/udr/RawDataUdrSchemaUnitTests.cpp | r-barnes/sw_comparison | 1ac2c9cc10a32badd6b8fb1e96516c97f7800176 | [
"BSD-Source-Code"
] | null | null | null | /**
* UGENE - Integrated Bioinformatics Tools.
* Copyright (C) 2008-2020 UniPro <ugene@unipro.ru>
* http://ugene.net
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* ... | 32.313333 | 98 | 0.727873 | [
"object"
] |
15889c4ea5485ff2c6b5204d32e838f2ac389316 | 3,394 | cpp | C++ | Source/WebCore/platform/graphics/iso/ISOProtectionSystemSpecificHeaderBox.cpp | jacadcaps/webkitty | 9aebd2081349f9a7b5d168673c6f676a1450a66d | [
"BSD-2-Clause"
] | 6 | 2021-07-05T16:09:39.000Z | 2022-03-06T22:44:42.000Z | Source/WebCore/platform/graphics/iso/ISOProtectionSystemSpecificHeaderBox.cpp | jacadcaps/webkitty | 9aebd2081349f9a7b5d168673c6f676a1450a66d | [
"BSD-2-Clause"
] | 7 | 2022-03-15T13:25:39.000Z | 2022-03-15T13:25:44.000Z | Source/WebCore/platform/graphics/iso/ISOProtectionSystemSpecificHeaderBox.cpp | jacadcaps/webkitty | 9aebd2081349f9a7b5d168673c6f676a1450a66d | [
"BSD-2-Clause"
] | null | null | null | /*
* Copyright (C) 2017 Apple Inc. All rights reserved.
* Copyright (C) 2018 Metrological Group B.V.
* Copyright (C) 2018 Igalia S.L
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of sour... | 36.106383 | 114 | 0.694461 | [
"vector"
] |
158a8fbb8fca87e8207c422dd89ef0b76e571b9e | 861 | cc | C++ | P9 Data Structure (tuples)/P24730.cc | miquelt9/Problemes-PRO1 | 1bd5214ce75129e9a027728b93ad8354ec993e41 | [
"Apache-2.0"
] | 2 | 2021-09-01T10:52:32.000Z | 2021-11-09T09:19:57.000Z | P9 Data Structure (tuples)/P24730.cc | miquelt9/Problemes-PRO1 | 1bd5214ce75129e9a027728b93ad8354ec993e41 | [
"Apache-2.0"
] | null | null | null | P9 Data Structure (tuples)/P24730.cc | miquelt9/Problemes-PRO1 | 1bd5214ce75129e9a027728b93ad8354ec993e41 | [
"Apache-2.0"
] | 1 | 2021-09-24T20:00:41.000Z | 2021-09-24T20:00:41.000Z | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Professor{
string nom;
int pastanagues, caramels;
};
typedef vector<Professor> Professorat;
bool professor_pastanaga(const Professor& a, const Professor& b){
if(a.caramels != b.caramels){
return a.caramels > b.caramels;
}
i... | 20.5 | 71 | 0.622532 | [
"vector"
] |
158bdc93c921c71ff47546f7b2e046a80442836d | 914 | cc | C++ | algo/lc.253.cc | cdluminate/MyNotes | cf28f2a3fa72723153147e21fed5e7b598baf44f | [
"CC0-1.0"
] | null | null | null | algo/lc.253.cc | cdluminate/MyNotes | cf28f2a3fa72723153147e21fed5e7b598baf44f | [
"CC0-1.0"
] | null | null | null | algo/lc.253.cc | cdluminate/MyNotes | cf28f2a3fa72723153147e21fed5e7b598baf44f | [
"CC0-1.0"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
class Solution {
public:
int minMeetingRooms(vector<pair<int, int>>& intervals) {
if (intervals.empty()) return 0;
// get right bound. lbound = 0
int rbound = 0;
for (auto ij: intervals) {
rbound = max(rboun... | 20.311111 | 57 | 0.630197 | [
"vector"
] |
158f859ce4137e7caf795ea01c8540f313a90f60 | 8,275 | cpp | C++ | src/renderer/Vulkan/Swapchain.cpp | tsaah/Efreet | 6e84aa170bfb9d76cb49106ca455d440dc3ca8c7 | [
"MIT"
] | null | null | null | src/renderer/Vulkan/Swapchain.cpp | tsaah/Efreet | 6e84aa170bfb9d76cb49106ca455d440dc3ca8c7 | [
"MIT"
] | null | null | null | src/renderer/Vulkan/Swapchain.cpp | tsaah/Efreet | 6e84aa170bfb9d76cb49106ca455d440dc3ca8c7 | [
"MIT"
] | null | null | null | #include "Swapchain.h"
#include "Context.h"
#include <maths.h>
namespace efreet::engine::renderer::vulkan::swapchain {
namespace {
b8 create_(Context& context, u32 width, u32 height, Swapchain& outSwapchain) {
VkExtent2D swapchainExtent = { width, height };
// Choose a swap surface format.
b8 found = f... | 42.435897 | 156 | 0.700785 | [
"vector"
] |
1590474d737585309673d99a6b8470f375044cb7 | 1,561 | cpp | C++ | spoj/abcpath/main.cpp | xirc/cp-algorithm | 89c67cff2f00459c5bb020ab44bff5ae419a1728 | [
"Apache-2.0"
] | 8 | 2020-12-23T07:54:53.000Z | 2021-11-23T02:46:35.000Z | spoj/abcpath/main.cpp | xirc/cp-algorithm | 89c67cff2f00459c5bb020ab44bff5ae419a1728 | [
"Apache-2.0"
] | 1 | 2020-11-07T13:22:29.000Z | 2020-12-20T12:54:00.000Z | spoj/abcpath/main.cpp | xirc/cp-algorithm | 89c67cff2f00459c5bb020ab44bff5ae419a1728 | [
"Apache-2.0"
] | 1 | 2021-01-16T03:40:10.000Z | 2021-01-16T03:40:10.000Z | // https://www.spoj.com/problems/ABCPATH/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int H, W;
vector<vector<char>> G;
vector<vector<int>> cache_count;
int dfs(int x, int y, int count) {
static int dx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
static int dy[] = { 1, 1, 1, 0, -1... | 22.623188 | 61 | 0.428571 | [
"vector"
] |
159053d171643c7364c9f576ffb53ddfcb2a74d6 | 1,119 | cpp | C++ | leetcode/algorithms/tree/traversals/Q107-binary-tree-level-order-traversal-ii.cpp | jatin69/Revision-cpp | 52742ea76ee2440d92b116252399360fef46e0c7 | [
"MIT"
] | 4 | 2020-01-16T14:49:46.000Z | 2021-08-23T12:45:19.000Z | leetcode/algorithms/tree/traversals/Q107-binary-tree-level-order-traversal-ii.cpp | jatin69/coding-practice | 52742ea76ee2440d92b116252399360fef46e0c7 | [
"MIT"
] | 2 | 2018-06-06T13:08:11.000Z | 2018-10-02T19:07:32.000Z | leetcode/algorithms/tree/traversals/Q107-binary-tree-level-order-traversal-ii.cpp | jatin69/coding-practice | 52742ea76ee2440d92b116252399360fef46e0c7 | [
"MIT"
] | 5 | 2018-10-02T13:49:16.000Z | 2021-08-11T07:29:50.000Z | /*
* Author : Jatin Rohilla
* Date : June-July-2019
*
* Compiler : g++ 5.1.0
* flags : -std=c++14
*/
#include<bits/stdc++.h>
using namespace std;
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), ... | 20.722222 | 59 | 0.439678 | [
"vector"
] |
1591a65d2a3adba8289b3512f2522495eee37cfc | 2,897 | cpp | C++ | DEM/Src/L2/AI/Memory/MemSystem.cpp | moltenguy1/deusexmachina | 134f4ca4087fff791ec30562cb250ccd50b69ee1 | [
"MIT"
] | 2 | 2017-04-30T20:24:29.000Z | 2019-02-12T08:36:26.000Z | DEM/Src/L2/AI/Memory/MemSystem.cpp | moltenguy1/deusexmachina | 134f4ca4087fff791ec30562cb250ccd50b69ee1 | [
"MIT"
] | null | null | null | DEM/Src/L2/AI/Memory/MemSystem.cpp | moltenguy1/deusexmachina | 134f4ca4087fff791ec30562cb250ccd50b69ee1 | [
"MIT"
] | null | null | null | #include "MemSystem.h"
//#include <AI/AIServer.h>
#include <AI/Prop/PropActorBrain.h>
#include <Game/GameServer.h> //???separate time source for AI?
namespace AI
{
/*
void CMemSystem::Init()
{
for (int i = 0; i < Facts.GetListCount(); ++i)
{
nArray<PSensor>::iterator It = pActor->GetSensors().Begin... | 28.401961 | 107 | 0.56921 | [
"object"
] |
1597a135214703eef07f3cff02b4a2b240606a66 | 1,202 | cpp | C++ | Client/Src/LObjectMgr.cpp | leafvmaple/L3D11Engine | 894d17385eb7472d9a377e2912b8a99f35f10e6f | [
"MIT"
] | null | null | null | Client/Src/LObjectMgr.cpp | leafvmaple/L3D11Engine | 894d17385eb7472d9a377e2912b8a99f35f10e6f | [
"MIT"
] | null | null | null | Client/Src/LObjectMgr.cpp | leafvmaple/L3D11Engine | 894d17385eb7472d9a377e2912b8a99f35f10e6f | [
"MIT"
] | null | null | null | #include "LObjectMgr.h"
#include "LAssert.h"
#include "Object/LModel.h"
LObjectMgr::LObjectMgr()
{
m_ObjectList.clear();
}
LObjectMgr::~LObjectMgr()
{
LModel* pObject = NULL;
std::list<LModel*>::iterator it;
for (it = m_ObjectList.begin(); it != m_ObjectList.end(); it++)
{
pObject = *it;
SAFE_DELETE(pObject... | 18.78125 | 74 | 0.673877 | [
"object"
] |
159b31e303b0cc310e1d5abd2d6dd1e4f911ce55 | 6,924 | cpp | C++ | Source/bindings/v8/custom/V8NodeCustom.cpp | quanganh2627/bytm-x64-L-w05-2015_external_chromium_org_third_party_WebKit | 20e637e67a0c272870ae4d78466a68bcb77af041 | [
"BSD-3-Clause"
] | 7 | 2017-07-13T10:34:54.000Z | 2021-04-16T05:40:35.000Z | Source/bindings/v8/custom/V8NodeCustom.cpp | quanganh2627/bytm-x64-L-w05-2015_external_chromium_org_third_party_WebKit | 20e637e67a0c272870ae4d78466a68bcb77af041 | [
"BSD-3-Clause"
] | null | null | null | Source/bindings/v8/custom/V8NodeCustom.cpp | quanganh2627/bytm-x64-L-w05-2015_external_chromium_org_third_party_WebKit | 20e637e67a0c272870ae4d78466a68bcb77af041 | [
"BSD-3-Clause"
] | 9 | 2017-07-13T12:33:20.000Z | 2021-06-19T02:46:48.000Z | /*
* Copyright (C) 2007-2009 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of con... | 44.101911 | 126 | 0.741912 | [
"object"
] |
159bf4f549914cb54cb3c589aa51498450280da9 | 3,040 | hpp | C++ | sdo/LookupTable.hpp | rgottwald/libsdo | 6937784258672e3a2d4252107242796b95f026aa | [
"MIT"
] | null | null | null | sdo/LookupTable.hpp | rgottwald/libsdo | 6937784258672e3a2d4252107242796b95f026aa | [
"MIT"
] | null | null | null | sdo/LookupTable.hpp | rgottwald/libsdo | 6937784258672e3a2d4252107242796b95f026aa | [
"MIT"
] | null | null | null | #ifndef _LOOKUP_TABLE_H_
#define _LOOKUP_TABLE_H_
#include <boost/tuple/tuple_comparison.hpp>
#include <boost/iterator/zip_iterator.hpp>
#include <memory>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <cassert>
#include <limits>
#include <boost/functional/hash.hpp>
#include <boost/optional.hpp>
n... | 19.74026 | 93 | 0.576645 | [
"vector"
] |
15a5e30b2bdfa789dac70852abca5fef517d6864 | 13,916 | cpp | C++ | src/registry.cpp | vpoddubchak/gst-cef-1 | a68bbeb96e86bbffd3adfec7cc95c6ce9e4595f6 | [
"MIT"
] | 8 | 2018-09-28T19:38:52.000Z | 2019-11-16T19:01:26.000Z | src/registry.cpp | vpoddubchak/gst-cef-1 | a68bbeb96e86bbffd3adfec7cc95c6ce9e4595f6 | [
"MIT"
] | 6 | 2018-10-12T16:56:59.000Z | 2018-10-31T19:56:31.000Z | src/registry.cpp | vpoddubchak/gst-cef-1 | a68bbeb96e86bbffd3adfec7cc95c6ce9e4595f6 | [
"MIT"
] | 4 | 2019-04-02T18:51:24.000Z | 2020-11-17T13:58:56.000Z | // Copyright 2015 The Chromium 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:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of condit... | 30.318083 | 99 | 0.691003 | [
"vector"
] |
15ab4ed93dee0947a08000c119cbfdc57855b1d8 | 4,012 | cpp | C++ | solution1_part2.cpp | tilhr/Cpp-Essentials | 8fe0f915047c75fd76af9443910102ec88fcfb26 | [
"MIT"
] | 2 | 2020-09-04T13:36:42.000Z | 2021-06-29T10:46:27.000Z | solution1_part2.cpp | tilhr/Cpp-Essentials | 8fe0f915047c75fd76af9443910102ec88fcfb26 | [
"MIT"
] | null | null | null | solution1_part2.cpp | tilhr/Cpp-Essentials | 8fe0f915047c75fd76af9443910102ec88fcfb26 | [
"MIT"
] | null | null | null | #include "Student.h"
/*******************************************************************************
* Function Prototypes
*******************************************************************************/
void getInput(Student[], const int);
int modify(int);
void display(const Student[], const int);
/*****... | 31.34375 | 81 | 0.473081 | [
"object"
] |
15ad1a96cf02d840b890b5831b57a0f988a0db8d | 9,220 | cpp | C++ | Tema_5_Ordenamiento/biblioteca/biblioteca/main.cpp | vcubells/tc1031 | 43d328df12194be840e8c83966b814e5625347b3 | [
"MIT"
] | 10 | 2020-08-15T16:54:13.000Z | 2021-10-05T16:24:05.000Z | Tema_5_Ordenamiento/biblioteca/biblioteca/main.cpp | vcubells/tc1031 | 43d328df12194be840e8c83966b814e5625347b3 | [
"MIT"
] | null | null | null | Tema_5_Ordenamiento/biblioteca/biblioteca/main.cpp | vcubells/tc1031 | 43d328df12194be840e8c83966b814e5625347b3 | [
"MIT"
] | 4 | 2020-09-05T02:12:52.000Z | 2021-09-22T00:54:25.000Z | //
// main.cpp
// biblioteca
//
// Created by Vicente Cubells Nonell on 09/09/20.
// Copyright © 2020 Vicente Cubells Nonell. All rights reserved.
//
#include <iostream>
#include <vector>
#include "../../ordenamiento_generico/ordenamiento_generico/Ordenamiento.hpp"
#include "Biblioteca.hpp"
void menu(Biblioteca &... | 28.722741 | 101 | 0.454772 | [
"vector"
] |
15b09d223961198ed9980b8b08e4208d10a977aa | 352 | cpp | C++ | DP/chords.cpp | aneesh001/InterviewBit | fcbac096fd8e9554a52db10dc9e5a88cb8a83ef3 | [
"MIT"
] | null | null | null | DP/chords.cpp | aneesh001/InterviewBit | fcbac096fd8e9554a52db10dc9e5a88cb8a83ef3 | [
"MIT"
] | null | null | null | DP/chords.cpp | aneesh001/InterviewBit | fcbac096fd8e9554a52db10dc9e5a88cb8a83ef3 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int chordCnt(int A) {
vector<long long> dp(A + 1, 0);
dp[0] = 1;
for(int i = 1; i <= A; ++i) {
long long s = 0;
for(int j = 0; j <= i - 1; ++j) {
s = (s + (dp[j] * dp[i - 1 - j]) % mod) % mod;
}
dp[i] = s;
}
return dp[A];
... | 16.761905 | 49 | 0.502841 | [
"vector"
] |
15b1601f1ed407b82ac387941c9cb36127770a2f | 7,108 | cc | C++ | modules/db/sqlite3/sqlite3.cc | clever-lang/clever | 2c03e4d4a4bd48b110226907fd158ba76bbccb97 | [
"MIT"
] | 20 | 2015-03-13T16:03:08.000Z | 2022-02-22T17:47:40.000Z | modules/db/sqlite3/sqlite3.cc | felipensp/clever | f0795e5ad271750795f55386d2aad815a1d7cb82 | [
"MIT"
] | 1 | 2021-05-14T11:50:44.000Z | 2021-05-14T11:50:44.000Z | modules/db/sqlite3/sqlite3.cc | felipensp/clever | f0795e5ad271750795f55386d2aad815a1d7cb82 | [
"MIT"
] | 9 | 2015-01-14T19:21:54.000Z | 2020-10-01T16:42:06.000Z | /**
* Clever programming language
* Copyright (c) Clever Team
*
* This file is distributed under the MIT license. See LICENSE for details.
*/
#include "core/cexception.h"
#include "modules/db/sqlite3/sqlite3.h"
#include "modules/std/core/map.h"
#include "modules/std/core/str.h"
namespace clever { namespace modul... | 22.282132 | 87 | 0.694851 | [
"vector"
] |
15b42e072a4c7cf5e40a8250945161664eb0628a | 572 | cpp | C++ | testing/Textgame MVP/Tools/Container.cpp | 195623/cpp_practice | 94a778fd6de4bb92f6d4030b300c37d530290db1 | [
"MIT"
] | null | null | null | testing/Textgame MVP/Tools/Container.cpp | 195623/cpp_practice | 94a778fd6de4bb92f6d4030b300c37d530290db1 | [
"MIT"
] | null | null | null | testing/Textgame MVP/Tools/Container.cpp | 195623/cpp_practice | 94a778fd6de4bb92f6d4030b300c37d530290db1 | [
"MIT"
] | null | null | null | #include "../headers.h"
using namespace std ;
Container::Container( vector<Object*> contents )
{
this->contents = contents ;
}
void Container::Set_contents( vector<Object*> objects )
{
this->contents = objects ;
}
void Container::Container::Add_Object( Object* object )
{
this->contents.p... | 19.066667 | 75 | 0.657343 | [
"object",
"vector"
] |
15c445a8a9215cc65e5167b2d970c7aecea9daa9 | 55,624 | cpp | C++ | ad_map_access/tests/generated/ad/map/landmark/LandmarkValidInputRangeTests.cpp | woojinjjang/map-1 | d12bb410f03d078a995130b4e671746ace8b6287 | [
"MIT"
] | 61 | 2019-12-19T20:57:24.000Z | 2022-03-29T15:20:51.000Z | ad_map_access/tests/generated/ad/map/landmark/LandmarkValidInputRangeTests.cpp | woojinjjang/map-1 | d12bb410f03d078a995130b4e671746ace8b6287 | [
"MIT"
] | 54 | 2020-04-05T05:32:47.000Z | 2022-03-15T18:42:33.000Z | ad_map_access/tests/generated/ad/map/landmark/LandmarkValidInputRangeTests.cpp | woojinjjang/map-1 | d12bb410f03d078a995130b4e671746ace8b6287 | [
"MIT"
] | 31 | 2019-12-20T07:37:39.000Z | 2022-03-16T13:06:16.000Z | /*
* ----------------- BEGIN LICENSE BLOCK ---------------------------------
*
* Copyright (C) 2018-2021 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
* ----------------- END LICENSE BLOCK -----------------------------------
*/
/*
* Generated file
*/
#include <gtest/gtest.h>
#include <limits>
#incl... | 60.857768 | 119 | 0.815403 | [
"geometry"
] |
15c73bd611446baac067257e11092f79ebf4d578 | 1,593 | hh | C++ | src/stitch/transform_estimate.hh | couetilj/OpenPano | f2f9c02cbb82ffed5fceed172a9c458eee5aace3 | [
"MIT"
] | 1,318 | 2017-02-22T15:59:36.000Z | 2022-03-31T07:18:41.000Z | src/stitch/transform_estimate.hh | couetilj/OpenPano | f2f9c02cbb82ffed5fceed172a9c458eee5aace3 | [
"MIT"
] | 91 | 2017-02-14T11:53:46.000Z | 2022-02-02T21:02:55.000Z | src/stitch/transform_estimate.hh | couetilj/OpenPano | f2f9c02cbb82ffed5fceed172a9c458eee5aace3 | [
"MIT"
] | 439 | 2017-02-15T04:53:39.000Z | 2022-03-24T02:16:50.000Z | // File: transform_estimate.hh
// Date: Fri May 03 04:50:30 2013 +0800
// Author: Yuxin Wu
#pragma once
#include <vector>
#include "lib/matrix.hh"
#include "lib/geometry.hh"
#include "match_info.hh"
#include "common/common.hh"
namespace pano {
class MatchData;
class Homography;
struct Descriptor;
// find transformat... | 27 | 72 | 0.73258 | [
"geometry",
"object",
"vector",
"transform"
] |
15c9476e1d9c244a506a3eea8c748d65fdd74636 | 2,076 | cc | C++ | src/conversion/waveform_to_spectrum.cc | takenori-y/SPTK | 573df2dd032c39db2aa24de012d2fe9a44f96280 | [
"Apache-2.0"
] | 91 | 2017-12-25T14:13:17.000Z | 2022-03-15T14:33:23.000Z | src/conversion/waveform_to_spectrum.cc | takenori-y/SPTK | 573df2dd032c39db2aa24de012d2fe9a44f96280 | [
"Apache-2.0"
] | 4 | 2020-09-28T03:58:29.000Z | 2021-12-14T01:23:13.000Z | src/conversion/waveform_to_spectrum.cc | takenori-y/SPTK | 573df2dd032c39db2aa24de012d2fe9a44f96280 | [
"Apache-2.0"
] | 16 | 2018-03-12T07:08:09.000Z | 2022-03-22T02:38:13.000Z | // ------------------------------------------------------------------------ //
// Copyright 2021 SPTK Working Group //
// //
// Licensed under the Apache License, Version 2.0 (the "License"); //
// y... | 51.9 | 78 | 0.501445 | [
"vector"
] |
15ca5b1114a7a395d293912537287d756d2d635c | 21,125 | inl | C++ | workflow_monitor/source/utils/monitor_utils.inl | MaybeShewill-CV/image-classification-tensorflow | 1587fa7acfaba6d33fb07c2c25248570c5d41927 | [
"MIT"
] | 4 | 2021-03-24T13:39:10.000Z | 2021-12-16T16:49:22.000Z | workflow_monitor/source/utils/monitor_utils.inl | MaybeShewill-CV/image-classification-tensorflow | 1587fa7acfaba6d33fb07c2c25248570c5d41927 | [
"MIT"
] | null | null | null | workflow_monitor/source/utils/monitor_utils.inl | MaybeShewill-CV/image-classification-tensorflow | 1587fa7acfaba6d33fb07c2c25248570c5d41927 | [
"MIT"
] | null | null | null | // Copyright 2021 MaybeShewill-CV All Rights Reserved.
// Author: MaybeShewill-CV
// File: monitor_utils.inl
// Date: 2021/4/29 上午11:03
#include <fstream>
#include <algorithm>
#include <sys/stat.h>
#include <glog/logging.h>
#include <boost/lexical_cast.hpp>
#include <boost/filesystem.hpp>
#include "file_system_utils... | 39.783427 | 120 | 0.645065 | [
"vector",
"model"
] |
15cd2a6b932a7aa4124f7cb13baaaeb8cb6c511e | 8,376 | cpp | C++ | test/vgl/test_polygon.cpp | lood339/tiny-xvl | 52259ef588932ac61e5f1caab552af7dc117eca6 | [
"BSD-2-Clause"
] | 2 | 2020-07-11T00:08:55.000Z | 2020-07-11T01:56:13.000Z | test/vgl/test_polygon.cpp | lood339/tiny-xvl | 52259ef588932ac61e5f1caab552af7dc117eca6 | [
"BSD-2-Clause"
] | 1 | 2020-12-22T04:33:45.000Z | 2020-12-22T04:33:45.000Z | test/vgl/test_polygon.cpp | lood339/tiny-vxl | 52259ef588932ac61e5f1caab552af7dc117eca6 | [
"BSD-2-Clause"
] | null | null | null | // Some tests for vgl_polygon
// Amitha Perera, Sep 2001.
#include <iostream>
#include <fstream>
#include <vgl/vgl_polygon.h>
#include <gtest/gtest.h>
TEST(vgl_polygon, simple_polygon)
{
std::cout << "Simple polygon\n";
// Simple triangle
vgl_polygon<double> p;
p.new_sheet();
p.push_back( 0.0... | 31.607547 | 81 | 0.561605 | [
"vector"
] |
15cd91d9071b17895ab5e6b0da9a740c03687038 | 1,741 | cpp | C++ | DFS/90. Subsets II.cpp | YuPeize/LeetCode- | b01d00f28e1eedcb04aee9eca984685bd9d52791 | [
"MIT"
] | 2 | 2019-10-28T06:40:09.000Z | 2022-03-09T10:50:06.000Z | DFS/90. Subsets II.cpp | sumiya-NJU/LeetCode | 8e6065e160da3db423a51aaf3ae53b2023068d05 | [
"MIT"
] | null | null | null | DFS/90. Subsets II.cpp | sumiya-NJU/LeetCode | 8e6065e160da3db423a51aaf3ae53b2023068d05 | [
"MIT"
] | 1 | 2018-12-09T13:46:06.000Z | 2018-12-09T13:46:06.000Z | /*
思路同第78题，注意将nums排序后，每次回溯避免起始元素相同即可。
author: ypz
*/
class Solution {
public:
void backTracking(vector<vector<int>> &ans, vector<int> &curr, vector<int> &nums, int k) {
if(curr.size() == k) ans.push_back(curr);
else {
if(nums.size() == 0) return;
for(int i = 0; i < nums.size... | 27.634921 | 94 | 0.514647 | [
"vector"
] |
15cdc6cfbbd747a20d7a5c7bc20b075ab7c47a56 | 8,627 | cpp | C++ | Source/database.cpp | DSPNerd/SRStateMachine | 815d29928c1599b998c5c196dd4e90da6d0e2a6f | [
"BSD-3-Clause"
] | null | null | null | Source/database.cpp | DSPNerd/SRStateMachine | 815d29928c1599b998c5c196dd4e90da6d0e2a6f | [
"BSD-3-Clause"
] | null | null | null | Source/database.cpp | DSPNerd/SRStateMachine | 815d29928c1599b998c5c196dd4e90da6d0e2a6f | [
"BSD-3-Clause"
] | null | null | null | /* Copyright Steve Rabin, 2010.
* All rights reserved worldwide.
*
* This software is provided "as is" without express or implied
* warranties. You may freely copy and compile this source into
* applications you distribute provided that the copyright text
* below is included in the resulting source code, f... | 28.756667 | 139 | 0.512229 | [
"object"
] |
15e97b97d7d7b69a7714314fe8ac3814082c598f | 8,963 | cpp | C++ | src/RemoteTreeViewer/RemoteTreeViewerWrapper.cpp | mwoehlke-kitware/spartan | 966a1f87482739ab073e441f61bdb519aad8ffa9 | [
"BSD-3-Clause-Clear"
] | null | null | null | src/RemoteTreeViewer/RemoteTreeViewerWrapper.cpp | mwoehlke-kitware/spartan | 966a1f87482739ab073e441f61bdb519aad8ffa9 | [
"BSD-3-Clause-Clear"
] | null | null | null | src/RemoteTreeViewer/RemoteTreeViewerWrapper.cpp | mwoehlke-kitware/spartan | 966a1f87482739ab073e441f61bdb519aad8ffa9 | [
"BSD-3-Clause-Clear"
] | null | null | null | #include "RemoteTreeViewerWrapper.hpp"
#include <string>
#include <stdexcept>
#include <iostream>
#include <random>
#include <unistd.h>
#include "json.hpp"
#include "lcmtypes/robotlocomotion/viewer2_comms_t.hpp"
using namespace std;
using namespace Eigen;
using namespace drake::lcm;
using namespace DrakeShapes;
usin... | 30.906897 | 160 | 0.594332 | [
"mesh",
"geometry",
"vector",
"transform"
] |
15f1864767538d7fa9db3e96b5ebfde8fdd33c40 | 9,239 | cpp | C++ | src/03_LinearNeuralNetworks/softmax_regression_scratch.cpp | jiamny/D2L_pytorch_cpp | 5bd89bb5531b9fca4fbe0dc3bfe5beaa7c45cb09 | [
"MIT"
] | null | null | null | src/03_LinearNeuralNetworks/softmax_regression_scratch.cpp | jiamny/D2L_pytorch_cpp | 5bd89bb5531b9fca4fbe0dc3bfe5beaa7c45cb09 | [
"MIT"
] | null | null | null | src/03_LinearNeuralNetworks/softmax_regression_scratch.cpp | jiamny/D2L_pytorch_cpp | 5bd89bb5531b9fca4fbe0dc3bfe5beaa7c45cb09 | [
"MIT"
] | 1 | 2022-03-11T00:12:20.000Z | 2022-03-11T00:12:20.000Z | #include <torch/torch.h>
#include <torch/script.h>
#include <torch/autograd.h>
#include <torch/utils.h>
#include <iostream>
#include <unistd.h>
#include <iomanip>
#include "../fashion.h"
#include "../utils.h"
#include "../matplotlibcpp.h"
namespace plt = matplotlibcpp;
using torch::indexing::Slice;
using torch::ind... | 30.592715 | 159 | 0.63968 | [
"vector",
"model"
] |
15f2543db773be761be2a6b29f342ae95b3a27da | 59,897 | cpp | C++ | FEBioSource2.9/FECore/FEModel.cpp | wzaylor/FEBio_MCLS | f1052733c31196544fb0921aa55ffa5167a25f98 | [
"Intel"
] | 1 | 2021-08-24T08:37:21.000Z | 2021-08-24T08:37:21.000Z | FEBioSource2.9/FECore/FEModel.cpp | wzaylor/FEBio_MCLS | f1052733c31196544fb0921aa55ffa5167a25f98 | [
"Intel"
] | null | null | null | FEBioSource2.9/FECore/FEModel.cpp | wzaylor/FEBio_MCLS | f1052733c31196544fb0921aa55ffa5167a25f98 | [
"Intel"
] | 1 | 2021-03-15T08:22:06.000Z | 2021-03-15T08:22:06.000Z | /*This file is part of the FEBio source code and is licensed under the MIT license
listed below.
See Copyright-FEBio.txt for details.
Copyright (c) 2019 University of Utah, The Trustees of Columbia University in
the City of New York, and others.
Permission is hereby granted, free of charge, to any person obtaining ... | 27.213539 | 121 | 0.558409 | [
"mesh",
"geometry",
"object",
"vector",
"model"
] |
15f2e2968691d29b682bb95fd4c1baa51f8692ee | 1,625 | cc | C++ | cpp/util/xml_test.cc | propaganda-gold/deeprev | 0c6ccf83131a879ed858acdb0675e75ebf2f2d3d | [
"BSD-3-Clause"
] | null | null | null | cpp/util/xml_test.cc | propaganda-gold/deeprev | 0c6ccf83131a879ed858acdb0675e75ebf2f2d3d | [
"BSD-3-Clause"
] | 2 | 2021-05-11T16:29:38.000Z | 2022-01-22T12:28:49.000Z | cpp/util/xml_test.cc | propaganda-gold/deeprev | 0c6ccf83131a879ed858acdb0675e75ebf2f2d3d | [
"BSD-3-Clause"
] | null | null | null | #include "util/xml.h"
#include "util/download.h"
#include "gmock/gmock.h"
#include "gtest/gtest.h"
namespace vectorbook {
namespace xml {
TEST(AllLinks, Basic) {
auto content = R"(
<a href="link1">
<A href="link1">
<A HREF="link1">
<a HREF="link1">
)";
auto links = AllLinks(content);
ASSERT_TRUE(links.o... | 25.390625 | 93 | 0.645538 | [
"vector"
] |
15f6c7ce1c4222b4a7cf10917b9d1ac165264f92 | 3,961 | cpp | C++ | 2020autumn/4.cpp | GRAYCN/Algorithm-notebook | 04fa7b759a797fb47e11bcdd1f8cc7bef297578c | [
"Apache-2.0"
] | 1 | 2019-07-06T10:40:28.000Z | 2019-07-06T10:40:28.000Z | 2020autumn/4.cpp | GRAYCN/Algorithm-notebook | 04fa7b759a797fb47e11bcdd1f8cc7bef297578c | [
"Apache-2.0"
] | null | null | null | 2020autumn/4.cpp | GRAYCN/Algorithm-notebook | 04fa7b759a797fb47e11bcdd1f8cc7bef297578c | [
"Apache-2.0"
] | null | null | null | //
// Created by w on 2020/11/10.
//
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1005;
const int MAX_DIS = 500;
struct Edge {
int v;
int score, daijinquan;
Edge() {};
Edge(int _v, int _score, int _daijinquan) {
v = _v;
score = _score;
daijinquan = _daiji... | 23.43787 | 84 | 0.441303 | [
"vector"
] |
15f8d07b1138c419f7f7c2ea2476dd2258da71e7 | 2,555 | cc | C++ | logistic regression/use_cpp_and_eigen/eigen_tutorial/eigen_usage.cc | Alvin1king/Machine-Learning- | c9edf1e995bd1448a5bc833c2f2be2376ae73106 | [
"MIT"
] | null | null | null | logistic regression/use_cpp_and_eigen/eigen_tutorial/eigen_usage.cc | Alvin1king/Machine-Learning- | c9edf1e995bd1448a5bc833c2f2be2376ae73106 | [
"MIT"
] | null | null | null | logistic regression/use_cpp_and_eigen/eigen_tutorial/eigen_usage.cc | Alvin1king/Machine-Learning- | c9edf1e995bd1448a5bc833c2f2be2376ae73106 | [
"MIT"
] | null | null | null | /*
Created on 2015/09/14
Author: wepon, http://2hwp.com
Reference: http://eigen.tuxfamily.org/dox/group__TutorialMatrixArithmetic.html
*/
#include <iostream>
#include <eigen3/Eigen/Dense>
using namespace Eigen;
int main()
{
/* Matrix */
Matrix2d m; //2*2,double
m(0,0) = 3;
m(1,0) = 2.5;
m(0,1) = -1;
m(1,... | 23.018018 | 98 | 0.522896 | [
"vector"
] |
15fa40b8cd09bd4a9d44f2a003547350cb5637d6 | 1,694 | cpp | C++ | labsound/src/extended/DiodeNode.cpp | ngokevin/LabSound | 1cd830e44befae10111675a2799dee3082e6ae1f | [
"MIT"
] | 6 | 2018-02-24T05:55:56.000Z | 2018-12-09T05:09:33.000Z | labsound/src/extended/DiodeNode.cpp | ngokevin/LabSound | 1cd830e44befae10111675a2799dee3082e6ae1f | [
"MIT"
] | 10 | 2018-06-05T09:45:19.000Z | 2019-05-24T12:53:03.000Z | labsound/src/extended/DiodeNode.cpp | ngokevin/LabSound | 1cd830e44befae10111675a2799dee3082e6ae1f | [
"MIT"
] | 3 | 2018-03-29T16:16:03.000Z | 2018-10-16T02:53:42.000Z | // License: BSD 2 Clause
// Copyright (C) 2015+, The LabSound Authors. All rights reserved.
#include "LabSound/extended/DiodeNode.h"
#include "LabSound/core/Macros.h"
#include <mutex>
namespace lab
{
// Based on the DiodeNode found at the BBC Radiophonic Workshop
// http://webaudio.prototyping.bbc.co.uk... | 30.25 | 117 | 0.55608 | [
"vector"
] |
15fa4310656e14b95019de3c024fa06debb888eb | 539 | cpp | C++ | tests/util_test.cpp | Thavarshan/vigaro | 697df33eb29e4fdf40aad96d3c30c0b90c82c158 | [
"MIT"
] | 3 | 2021-07-22T03:00:53.000Z | 2021-08-07T09:52:53.000Z | tests/util_test.cpp | Thavarshan/vigaro | 697df33eb29e4fdf40aad96d3c30c0b90c82c158 | [
"MIT"
] | 5 | 2021-03-01T12:01:01.000Z | 2021-03-04T17:14:39.000Z | tests/util_test.cpp | Thavarshan/vigaro | 697df33eb29e4fdf40aad96d3c30c0b90c82c158 | [
"MIT"
] | 1 | 2021-04-09T20:29:11.000Z | 2021-04-09T20:29:11.000Z | #include "../src/include/utils.h"
#include "gtest/gtest.h"
#include <string>
#include <vector>
TEST(UtilTest, ElementIsInList)
{
std::vector<std::string> list = {"apple", "oranges"};
EXPECT_TRUE(inList("apple", list));
EXPECT_FALSE(inList("grapes", list));
}
TEST(UtilTest, IntegerIsInRange)
{
EXPECT_... | 19.962963 | 57 | 0.667904 | [
"vector"
] |
c60724e30ebd9035c64070f3a02c909cfc3b06a4 | 296 | cc | C++ | 0162_find_peak_element/peak.cc | zl3one6/leetcode | 85827e51348e78a89df7bfa1e28ea0d99702858b | [
"MIT"
] | 2,960 | 2017-07-16T14:19:34.000Z | 2022-03-31T04:37:36.000Z | 0162_find_peak_element/peak.cc | zl3one6/leetcode | 85827e51348e78a89df7bfa1e28ea0d99702858b | [
"MIT"
] | 16 | 2017-11-11T08:50:46.000Z | 2021-10-08T02:55:22.000Z | 0162_find_peak_element/peak.cc | zl3one6/leetcode | 85827e51348e78a89df7bfa1e28ea0d99702858b | [
"MIT"
] | 889 | 2017-11-11T01:15:08.000Z | 2022-03-31T04:37:42.000Z | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int findPeakElement(vector<int>& nums) {
int i;
for (i = 1; i < nums.size(); i++) {
if (nums[i] < nums[i - 1]) {
break;
}
}
return i - 1;
}
};
| 17.411765 | 44 | 0.432432 | [
"vector"
] |
c60da6f5db23c6a16235f4a17f8f1f83430fc5a5 | 504 | cpp | C++ | src/RaycastCommon.cpp | TheFakeMontyOnTheRun/castle-of-viana-3D | 69084cfbce46e356653e49e633a736551b2c3d71 | [
"BSD-2-Clause"
] | null | null | null | src/RaycastCommon.cpp | TheFakeMontyOnTheRun/castle-of-viana-3D | 69084cfbce46e356653e49e633a736551b2c3d71 | [
"BSD-2-Clause"
] | null | null | null | src/RaycastCommon.cpp | TheFakeMontyOnTheRun/castle-of-viana-3D | 69084cfbce46e356653e49e633a736551b2c3d71 | [
"BSD-2-Clause"
] | null | null | null | //
// Created by monty on 04-07-2017.
//
#include <functional>
#include <memory>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <sg14/fixed_point>
#include <EASTL/vector.h>
#include <EASTL/array.h>
using eastl::vector;
using eastl::array;
using sg14::fixed_point;
#include "RaycastCommon.h"
name... | 14.823529 | 48 | 0.615079 | [
"vector"
] |
c614be0e9ceedb76082ac6e0d94fdf221765591b | 2,611 | hpp | C++ | Plugin/Source/PluginEditor.hpp | papahuge/audiogridder | 1230fa0552e2acf1f62231f207ec1dbdab8485e0 | [
"MIT"
] | 1 | 2021-06-18T11:16:54.000Z | 2021-06-18T11:16:54.000Z | Plugin/Source/PluginEditor.hpp | papahuge/audiogridder | 1230fa0552e2acf1f62231f207ec1dbdab8485e0 | [
"MIT"
] | null | null | null | Plugin/Source/PluginEditor.hpp | papahuge/audiogridder | 1230fa0552e2acf1f62231f207ec1dbdab8485e0 | [
"MIT"
] | null | null | null | /*
* Copyright (c) 2020 Andreas Pohl
* Licensed under MIT (https://github.com/apohl79/audiogridder/blob/master/COPYING)
*
* Author: Andreas Pohl
*/
#pragma once
#include <JuceHeader.h>
#include "PluginButton.hpp"
#include "PluginProcessor.hpp"
#include "GenericEditor.hpp"
#include "StatisticsWindow.hpp"
#include... | 31.457831 | 112 | 0.720414 | [
"vector"
] |
724528d164cbc668d91209d7add91e6af7ab014d | 2,316 | hpp | C++ | DT3Core/Scripting/ScriptingStringConcat.hpp | 9heart/DT3 | 4ba8fd2af3aebb5c0d77036ac3941e83cd4d1c7e | [
"MIT"
] | 3 | 2018-10-05T15:03:27.000Z | 2019-03-19T11:01:56.000Z | DT3Core/Scripting/ScriptingStringConcat.hpp | pakoito/DT3 | 4ba8fd2af3aebb5c0d77036ac3941e83cd4d1c7e | [
"MIT"
] | null | null | null | DT3Core/Scripting/ScriptingStringConcat.hpp | pakoito/DT3 | 4ba8fd2af3aebb5c0d77036ac3941e83cd4d1c7e | [
"MIT"
] | 3 | 2016-01-14T07:51:52.000Z | 2021-08-21T08:02:51.000Z | #ifndef DT3_SCRIPTINGSTRINGCONCAT
#define DT3_SCRIPTINGSTRINGCONCAT
//==============================================================================
///
/// File: ScriptingStringConcat.hpp
///
/// Copyright (C) 2000-2014 by Smells Like Donkey Software Inc. All rights reserved.
///
/// This file is subject to ... | 36.1875 | 91 | 0.420121 | [
"object"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.