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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0d3fd81a70b9507d87b289272bbf67cce4957638 | 3,272 | cpp | C++ | System Programming C/MultiThreadSortProject/Utils/SplitFunctions.cpp | Bzahov98/TU-University-Tasks | 9d8e86e059e36356276b8e69579735b188b72634 | [
"MIT"
] | 3 | 2018-01-31T09:33:34.000Z | 2022-01-19T13:04:19.000Z | System Programming C/MultiThreadSortProject/Utils/SplitFunctions.cpp | Bzahov98/TU-University-Tasks | 9d8e86e059e36356276b8e69579735b188b72634 | [
"MIT"
] | 1 | 2020-10-03T07:43:53.000Z | 2020-10-03T07:43:53.000Z | System Programming C/MultiThreadSortProject/Utils/SplitFunctions.cpp | Bzahov98/TU-University-Tasks | 9d8e86e059e36356276b8e69579735b188b72634 | [
"MIT"
] | 3 | 2018-11-21T03:52:15.000Z | 2020-09-30T18:07:28.000Z | //
// Created by bzahov on 31.05.20 г..
//
#include "SplitFunctions.h"
void SplitUtils::splitToTokens(const string &inputString, int *data) {
string basicString = inputString.substr(0, inputString.length());
string delimiter = ",";
size_t pos = 0;
string token;
int i = 0;
while ((pos = basicSt... | 29.745455 | 84 | 0.571822 | [
"vector"
] |
0d46fa152ef755d7cf7d724417a6490e6866be62 | 3,736 | cpp | C++ | implementations/OpenGL/framebuffer.cpp | rsayers/abstract-gpu | 48176fcb88bde7d56de662c9e49d3d0e562819e1 | [
"MIT"
] | 41 | 2016-03-25T18:14:37.000Z | 2022-01-20T11:16:52.000Z | implementations/OpenGL/framebuffer.cpp | rsayers/abstract-gpu | 48176fcb88bde7d56de662c9e49d3d0e562819e1 | [
"MIT"
] | 4 | 2016-05-05T22:08:01.000Z | 2021-12-10T13:06:55.000Z | implementations/OpenGL/framebuffer.cpp | rsayers/abstract-gpu | 48176fcb88bde7d56de662c9e49d3d0e562819e1 | [
"MIT"
] | 9 | 2016-05-23T01:51:25.000Z | 2021-08-21T15:32:37.000Z | #include "texture.hpp"
#include "texture_view.hpp"
#include "framebuffer.hpp"
#include "../Common/texture_formats_common.hpp"
#include <string.h>
namespace AgpuGL
{
inline const char *framebufferStatusToString(GLenum status)
{
switch(status)
{
#define MAP_ENUM_NAME(x) case x: return #x;
MAP_ENUM_NAME(GL_FRAMEBUFFER... | 28.090226 | 216 | 0.744379 | [
"object"
] |
0d4aa698a91fd449dab5851e83377dc59dbae39e | 17,973 | cc | C++ | storage/src/android/metadata_android.cc | oliwilkinsonio/firebase-cpp-sdk | 1a2790030e92f77ad2aaa87000a1222d12dcabfc | [
"Apache-2.0"
] | 193 | 2019-03-18T16:30:43.000Z | 2022-03-30T17:39:32.000Z | storage/src/android/metadata_android.cc | oliwilkinsonio/firebase-cpp-sdk | 1a2790030e92f77ad2aaa87000a1222d12dcabfc | [
"Apache-2.0"
] | 647 | 2019-03-18T20:50:41.000Z | 2022-03-31T18:32:33.000Z | storage/src/android/metadata_android.cc | oliwilkinsonio/firebase-cpp-sdk | 1a2790030e92f77ad2aaa87000a1222d12dcabfc | [
"Apache-2.0"
] | 86 | 2019-04-21T09:40:38.000Z | 2022-03-26T20:48:37.000Z | // Copyright 2016 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in ... | 35.449704 | 80 | 0.696322 | [
"object",
"vector"
] |
0d4c1994d142d177ca1b65c8652d0dbbe45540e3 | 415 | cc | C++ | 16-Set-and-Map/cpp/09-Leetcode-Problems-about-Map-and-Set/Solution2.cc | OpenCreate/Play-with-DSA | 49de3eb3e54815d1ff6520e5933e467c1f56bdfc | [
"MIT"
] | 9 | 2020-08-10T03:43:54.000Z | 2021-11-12T06:26:32.000Z | 16-Set-and-Map/cpp/09-Leetcode-Problems-about-Map-and-Set/Solution2.cc | OpenCreate/Play-with-DSA | 49de3eb3e54815d1ff6520e5933e467c1f56bdfc | [
"MIT"
] | null | null | null | 16-Set-and-Map/cpp/09-Leetcode-Problems-about-Map-and-Set/Solution2.cc | OpenCreate/Play-with-DSA | 49de3eb3e54815d1ff6520e5933e467c1f56bdfc | [
"MIT"
] | null | null | null | // https://leetcode-cn.com/problems/intersection-of-two-arrays-ii/
class Solution {
public:
vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
map<int, int> m;
for (auto e : nums1) m[e]++;
vector<int> res;
for (auto e : nums2) {
auto it = m.find(e);
if (it != m.end()) {
... | 23.055556 | 66 | 0.53012 | [
"vector"
] |
0d4f2365a6a8d9a4e9736ce352e44f5b32a613e4 | 16,720 | cpp | C++ | components/contentselector/model/contentmodel.cpp | Bodillium/openmw | 5fdd264d0704e33b44b1ccf17ab4fb721f362e34 | [
"Unlicense"
] | null | null | null | components/contentselector/model/contentmodel.cpp | Bodillium/openmw | 5fdd264d0704e33b44b1ccf17ab4fb721f362e34 | [
"Unlicense"
] | null | null | null | components/contentselector/model/contentmodel.cpp | Bodillium/openmw | 5fdd264d0704e33b44b1ccf17ab4fb721f362e34 | [
"Unlicense"
] | null | null | null | #include "contentmodel.hpp"
#include "esmfile.hpp"
#include <stdexcept>
#include <QDir>
#include <QTextCodec>
#include <QDebug>
#include "components/esm/esmreader.hpp"
ContentSelectorModel::ContentModel::ContentModel(QObject *parent) :
QAbstractTableModel(parent),
mMimeType ("application/omwcontent"),
m... | 26.752 | 147 | 0.599581 | [
"model"
] |
0d4fbda15ce7a07e09f5e3e3901e8e870d9824bd | 987 | cpp | C++ | algorithms/Permutations/permutations.cpp | PikachuPikachuHAHA/leetcode-2 | 4cf8d30509f4b994b1845765807380eeffb95c73 | [
"MIT"
] | 93 | 2016-04-27T23:25:27.000Z | 2021-07-13T20:32:25.000Z | algorithms/Permutations/permutations.cpp | shangan/leetcode | db05338f8057ad440cb5dd6cfe0151aafb7a8d56 | [
"MIT"
] | null | null | null | algorithms/Permutations/permutations.cpp | shangan/leetcode | db05338f8057ad440cb5dd6cfe0151aafb7a8d56 | [
"MIT"
] | 43 | 2016-05-31T15:46:50.000Z | 2021-04-09T04:07:39.000Z | #include <vector>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;
void print(vector<int> v)
{
for (auto i : v)
printf("%d ", i);
printf("\n");
}
class Solution {
public:
vector<vector<int> > permute(vector<int> &num) {
vector<vector<int>> ans;
sort(num.begin(), num.end(... | 20.142857 | 54 | 0.527862 | [
"vector"
] |
0d50b5158585d96ed239c741055a32474736d8ac | 9,561 | hpp | C++ | Extensions/Editor/Editor.hpp | RachelWilSingh/ZeroCore | e9a2f82d395e5c89fb98eceac44ce60d016dbff3 | [
"MIT"
] | 52 | 2018-09-11T17:18:35.000Z | 2022-03-13T15:28:21.000Z | Extensions/Editor/Editor.hpp | RachelWilSingh/ZeroCore | e9a2f82d395e5c89fb98eceac44ce60d016dbff3 | [
"MIT"
] | 1,409 | 2018-09-19T18:03:43.000Z | 2021-06-09T08:33:33.000Z | Extensions/Editor/Editor.hpp | RachelWilSingh/ZeroCore | e9a2f82d395e5c89fb98eceac44ce60d016dbff3 | [
"MIT"
] | 26 | 2018-09-11T17:16:32.000Z | 2021-11-22T06:21:19.000Z | ///////////////////////////////////////////////////////////////////////////////
///
/// \file Editor.hpp
/// Declaration of the Editor classes.
///
/// Authors: Chris Peters
/// Copyright 2010-2013, DigiPen Institute of Technology
///
////////////////////////////////////////////////////////////////////////////... | 31.87 | 116 | 0.691455 | [
"object"
] |
0d56c1c2979b262cb5ecdf5f340d9b1cad6dfbb2 | 1,091 | hpp | C++ | include/rua/funchain.hpp | yulon/tmd | 70fe8ea46fd14f77c7213c7ef4a3dd3925168fd0 | [
"MIT"
] | null | null | null | include/rua/funchain.hpp | yulon/tmd | 70fe8ea46fd14f77c7213c7ef4a3dd3925168fd0 | [
"MIT"
] | null | null | null | include/rua/funchain.hpp | yulon/tmd | 70fe8ea46fd14f77c7213c7ef4a3dd3925168fd0 | [
"MIT"
] | null | null | null | #ifndef _RUA_FUNCHAIN_HPP
#define _RUA_FUNCHAIN_HPP
#include "util.hpp"
#include <functional>
#include <vector>
namespace rua {
template <typename Ret, typename... Args>
class _funchain_base : public std::vector<std::function<Ret(Args...)>> {
public:
_funchain_base() = default;
};
template <typename Callback, typ... | 19.836364 | 80 | 0.657195 | [
"vector"
] |
0d5e76d85c6d2460622409957264b93fbccf1d08 | 24,960 | cpp | C++ | circe/gl/texture/texture.cpp | gui-works/circe | c126a8f9521dca1eb23ac47c8f2e8081f2102f17 | [
"MIT"
] | 1 | 2021-09-17T18:12:47.000Z | 2021-09-17T18:12:47.000Z | circe/gl/texture/texture.cpp | gui-works/circe | c126a8f9521dca1eb23ac47c8f2e8081f2102f17 | [
"MIT"
] | null | null | null | circe/gl/texture/texture.cpp | gui-works/circe | c126a8f9521dca1eb23ac47c8f2e8081f2102f17 | [
"MIT"
] | 2 | 2021-09-17T18:13:02.000Z | 2021-09-17T18:16:21.000Z | /*
* Copyright (c) 2017 FilipeCN
*
* The MIT License (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 limitation the rights
* to use, cop... | 40.784314 | 120 | 0.576723 | [
"render",
"object",
"vector",
"transform"
] |
0d5f3c075074dcdec011f5482333d61db42ac2f1 | 14,230 | cc | C++ | src/search_local/index_read/doc_manager.cc | jdisearch/isearch1 | 272bd4ab0dc82d9e33c8543474b1294569947bb3 | [
"Apache-2.0"
] | 3 | 2021-08-18T09:59:42.000Z | 2021-09-07T03:11:28.000Z | src/search_local/index_read/doc_manager.cc | jdisearch/isearch1 | 272bd4ab0dc82d9e33c8543474b1294569947bb3 | [
"Apache-2.0"
] | null | null | null | src/search_local/index_read/doc_manager.cc | jdisearch/isearch1 | 272bd4ab0dc82d9e33c8543474b1294569947bb3 | [
"Apache-2.0"
] | null | null | null | /*
* =====================================================================================
*
* Filename: doc_manager.h
*
* Description: doc manager class definition.
*
* Version: 1.0
* Created: 09/08/2018
* Revision: none
* Compiler: gcc
*
* Author: zhulin, ... | 41.246377 | 155 | 0.568587 | [
"vector"
] |
0d621e06cd3f625ef053b418b83b76c41fbf9ec3 | 16,472 | cpp | C++ | source/decoder.cpp | astolap/WaSP | 2daa1963d1f3d3fb50d3b576d470f9af0f6ce463 | [
"BSD-2-Clause"
] | 4 | 2020-03-04T10:41:26.000Z | 2021-04-15T06:29:41.000Z | source/decoder.cpp | astolap/WaSP | 2daa1963d1f3d3fb50d3b576d470f9af0f6ce463 | [
"BSD-2-Clause"
] | 2 | 2019-01-14T15:58:47.000Z | 2021-04-18T09:09:51.000Z | source/decoder.cpp | astolap/WaSP | 2daa1963d1f3d3fb50d3b576d470f9af0f6ce463 | [
"BSD-2-Clause"
] | 4 | 2018-07-20T14:36:42.000Z | 2021-06-28T13:03:57.000Z | /*BSD 2-Clause License
* Copyright(c) 2019, Pekka Astola
* 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
* list ... | 25.981073 | 113 | 0.502975 | [
"vector"
] |
0d69d2464023f6d851ccb440d19c51c577406152 | 1,420 | cpp | C++ | books/programming-principles-and-practice-using-c++/4d.cpp | kruschk/learning | a93cefacbd277bd00de2919e31dfbf8e619cfff2 | [
"MIT"
] | 1 | 2021-06-19T03:34:20.000Z | 2021-06-19T03:34:20.000Z | books/programming-principles-and-practice-using-c++/4d.cpp | kruschk/learning | a93cefacbd277bd00de2919e31dfbf8e619cfff2 | [
"MIT"
] | 3 | 2021-05-10T21:53:08.000Z | 2022-03-25T22:46:26.000Z | books/programming-principles-and-practice-using-c++/4d.cpp | kruschk/learning | a93cefacbd277bd00de2919e31dfbf8e619cfff2 | [
"MIT"
] | null | null | null | #include "std_lib_facilities.h"
double unit_conversion(double, string);
int main(void) {
vector<double> record;
double number, smallest, largest;
string unit = "|";
double sum = 0;
cin >> number >> unit;
number = unit_conversion(number, unit);
smallest = largest = number;
cout << number << " m, the smallest ... | 21.846154 | 64 | 0.583099 | [
"vector"
] |
0d74302f87e355bde602b1ad2c5b8115d16020c5 | 3,401 | cpp | C++ | Tests/VtkHDF5Test.cpp | mpartio/MXADataModel | cfab4b41bca5c71d0ab16fb4f3ed3097093f0a57 | [
"BSD-3-Clause"
] | null | null | null | Tests/VtkHDF5Test.cpp | mpartio/MXADataModel | cfab4b41bca5c71d0ab16fb4f3ed3097093f0a57 | [
"BSD-3-Clause"
] | null | null | null | Tests/VtkHDF5Test.cpp | mpartio/MXADataModel | cfab4b41bca5c71d0ab16fb4f3ed3097093f0a57 | [
"BSD-3-Clause"
] | 1 | 2020-08-26T07:08:26.000Z | 2020-08-26T07:08:26.000Z | ///////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2007, 2010 Michael A. Jackson for BlueQuartz Software
// All rights reserved.
// BSD License: http://www.opensource.org/licenses/bsd-license.html
//
// This code was written under United States Air Force Contract num... | 31.490741 | 121 | 0.579535 | [
"vector",
"model"
] |
0d792e486aec3d458847f057cefe9f0d539f96d4 | 18,664 | cpp | C++ | src/execution_tree/primitives/add_operation.cpp | rtohid/phylanx | c2e4e8e531c204a70b1907995b1fd467870e6d9d | [
"BSL-1.0"
] | null | null | null | src/execution_tree/primitives/add_operation.cpp | rtohid/phylanx | c2e4e8e531c204a70b1907995b1fd467870e6d9d | [
"BSL-1.0"
] | null | null | null | src/execution_tree/primitives/add_operation.cpp | rtohid/phylanx | c2e4e8e531c204a70b1907995b1fd467870e6d9d | [
"BSL-1.0"
] | null | null | null | // Copyright (c) 2017-2018 Hartmut Kaiser
//
// 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 <phylanx/config.hpp>
#include <phylanx/execution_tree/primitives/add_operation.hpp>
#include <phylanx/ir/node_da... | 31.633898 | 79 | 0.504126 | [
"vector"
] |
0d86b8439d7cd724d20c092d928a0230c0dae557 | 59,101 | cc | C++ | rambo_dict.cc | nkarast/MG5quadme | a9eb7346ff9248a3991981ef0206a696941f8a36 | [
"MIT"
] | null | null | null | rambo_dict.cc | nkarast/MG5quadme | a9eb7346ff9248a3991981ef0206a696941f8a36 | [
"MIT"
] | null | null | null | rambo_dict.cc | nkarast/MG5quadme | a9eb7346ff9248a3991981ef0206a696941f8a36 | [
"MIT"
] | null | null | null | //
// File generated by rootcint at Tue Apr 8 14:56:29 2014
// Do NOT change. Changes will be lost next time file is generated
//
#define R__DICTIONARY_FILENAME rambo_dict
#include "RConfig.h" //rootcint 4834
#if !defined(R__ACCESS_IN_SYMBOL)
//Break the privacy of classes -- Disabled for the moment
#define private ... | 65.304972 | 538 | 0.723676 | [
"vector"
] |
0d992935b4488a16631a859927c6727def03342a | 638 | cpp | C++ | October LeetCode Challenge/Day_11.cpp | mishrraG/100DaysOfCode | 3358af290d4f05889917808d68b95f37bd76e698 | [
"MIT"
] | 13 | 2020-08-10T14:06:37.000Z | 2020-09-24T14:21:33.000Z | October LeetCode Challenge/Day_11.cpp | mishrraG/DaysOfCP | 3358af290d4f05889917808d68b95f37bd76e698 | [
"MIT"
] | null | null | null | October LeetCode Challenge/Day_11.cpp | mishrraG/DaysOfCP | 3358af290d4f05889917808d68b95f37bd76e698 | [
"MIT"
] | 1 | 2020-05-31T21:09:14.000Z | 2020-05-31T21:09:14.000Z | class Solution {
public:
string removeDuplicateLetters(string s) {
string res = "";
vector<bool> visited(26, false);
vector<int> dict(26, 0);
for (auto it : s)
dict[it - 'a'] ++;
for (int i = 0; i < s.length(); i++) {
dict[s[i] - 'a'] --;
i... | 30.380952 | 83 | 0.410658 | [
"vector"
] |
0d9b24f0b9d99874a4586f30a82c715627b422e3 | 764 | cpp | C++ | leetcode_solutions/curated_top_100/dynamic_programming/s_55_Jump_Game_20201110.cpp | lovms/code_snippets | 243d751cb2b3725e20dca1adb5b5563b64a3eed0 | [
"MIT"
] | null | null | null | leetcode_solutions/curated_top_100/dynamic_programming/s_55_Jump_Game_20201110.cpp | lovms/code_snippets | 243d751cb2b3725e20dca1adb5b5563b64a3eed0 | [
"MIT"
] | null | null | null | leetcode_solutions/curated_top_100/dynamic_programming/s_55_Jump_Game_20201110.cpp | lovms/code_snippets | 243d751cb2b3725e20dca1adb5b5563b64a3eed0 | [
"MIT"
] | null | null | null | //Given an array of non-negative integers, you are initially positioned at the first index of the array.
//
//Each element in the array represents your maximum jump length at that position.
//
//Determine if you are able to reach the last index.
//
//
//
//Example 1:
//
//Input: nums = [2,3,1,1,4]
//Output: true
//Exp... | 23.151515 | 145 | 0.659686 | [
"vector"
] |
0d9bc4ed14d37e64dbc00f04d32b52700cada8b3 | 2,880 | cc | C++ | Codeforces/338 Division 2/Problem C/C.cc | VastoLorde95/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | 170 | 2017-07-25T14:47:29.000Z | 2022-01-26T19:16:31.000Z | Codeforces/338 Division 2/Problem C/C.cc | navodit15/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | null | null | null | Codeforces/338 Division 2/Problem C/C.cc | navodit15/Competitive-Programming | 6c990656178fb0cd33354cbe5508164207012f24 | [
"MIT"
] | 55 | 2017-07-28T06:17:33.000Z | 2021-10-31T03:06:22.000Z | #include <bits/stdc++.h>
#define sd(x) scanf("%d",&x)
#define sd2(x,y) scanf("%d%d",&x,&y)
#define sd3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define LET(x, a) __typeof(a) x(a)
#define foreach(it, v) for(LET(it, v.begin()); it != v... | 23.606557 | 139 | 0.478472 | [
"vector"
] |
3107d31f45257e6f13338e3018fd61d60d11bae6 | 1,588 | cpp | C++ | C++/wordBreakII.cpp | black-shadows/LeetCode-Solutions | b1692583f7b710943ffb19b392b8bf64845b5d7a | [
"Fair",
"Unlicense"
] | 1 | 2020-04-16T08:38:14.000Z | 2020-04-16T08:38:14.000Z | wordBreakII.cpp | Jeevan-kumar-Raj/LeetCode-Solutions-Topicwise | f1111b4edd401a3fc47111993bd7250cf4dc76da | [
"MIT"
] | null | null | null | wordBreakII.cpp | Jeevan-kumar-Raj/LeetCode-Solutions-Topicwise | f1111b4edd401a3fc47111993bd7250cf4dc76da | [
"MIT"
] | 1 | 2021-12-25T14:48:56.000Z | 2021-12-25T14:48:56.000Z | // Time Complexity: O(n^2) ?
// Space Complexity: O(n^2)
class Solution {
public:
vector<string> wordBreak(string s, unordered_set<string> &dict) {
vector<bool> f(s.length() + 1, false);
vector<vector<bool> > valid(s.length(), vector<bool>(s.length() + 1, false));
... | 33.787234 | 123 | 0.384131 | [
"vector"
] |
3107f926ce600ed3b04ae63be9b3a9aac6740f30 | 1,583 | cpp | C++ | design-phone-directory/solution-0.cpp | tsenmu/leetcode | 6f6d11dec4e5ee0fbc0c59fd6fa97b2c556e05ee | [
"Apache-2.0"
] | null | null | null | design-phone-directory/solution-0.cpp | tsenmu/leetcode | 6f6d11dec4e5ee0fbc0c59fd6fa97b2c556e05ee | [
"Apache-2.0"
] | null | null | null | design-phone-directory/solution-0.cpp | tsenmu/leetcode | 6f6d11dec4e5ee0fbc0c59fd6fa97b2c556e05ee | [
"Apache-2.0"
] | null | null | null | class PhoneDirectory {
protected:
vector<int> m_list;
vector<bool> m_taken;
int m_top;
int m_maxNumbers;
public:
/** Initialize your data structure here
@param maxNumbers - The maximum numbers that can be stored in the phone directory. */
PhoneDirectory(int maxNumbers) {
m_maxNum... | 27.77193 | 93 | 0.556538 | [
"object",
"vector"
] |
310aa124dfc6360ecd1bbe1136517b11d48cabdf | 11,317 | cpp | C++ | IO/vdb/vdb.cpp | chenjiunfeng/openMaelstrom | 6dc6ffe3501f056eb83d1d6306d2ac5ec754c192 | [
"MIT"
] | 45 | 2019-11-07T13:51:50.000Z | 2022-02-11T01:51:14.000Z | IO/vdb/vdb.cpp | chenjiunfeng/openMaelstrom | 6dc6ffe3501f056eb83d1d6306d2ac5ec754c192 | [
"MIT"
] | 2 | 2020-03-06T20:25:02.000Z | 2021-02-07T21:45:39.000Z | IO/vdb/vdb.cpp | chenjiunfeng/openMaelstrom | 6dc6ffe3501f056eb83d1d6306d2ac5ec754c192 | [
"MIT"
] | 10 | 2019-08-22T09:11:23.000Z | 2022-02-07T07:04:55.000Z | //#define NO_OPERATORS
#define BOOST_USE_WINDOWS_H
#include <IO/vdb/vdb.h>
#include <iostream>
#include <utility/identifier.h>
#include <cuda.h>
#include <cuda_runtime.h>
#include <fstream>
#include <utility/generation.h>
#include <utility/bullet/DynamicsWorld.h>
void IO::vdb::emitParticleVolumes() {
//emit fluid v... | 43.526923 | 144 | 0.689847 | [
"vector"
] |
310db5d8ff0e11b19549da3fb693ac15a630bb0b | 2,249 | cpp | C++ | kattis_done/boxes.cpp | heiseish/Competitive-Programming | e4dd4db83c38e8837914562bc84bc8c102e68e34 | [
"MIT"
] | 5 | 2019-03-17T01:33:19.000Z | 2021-06-25T09:50:45.000Z | kattis_done/boxes.cpp | heiseish/Competitive-Programming | e4dd4db83c38e8837914562bc84bc8c102e68e34 | [
"MIT"
] | null | null | null | kattis_done/boxes.cpp | heiseish/Competitive-Programming | e4dd4db83c38e8837914562bc84bc8c102e68e34 | [
"MIT"
] | null | null | null | /**
Although this mirror can show a reflection, it cannot show you the truth.
*/
#include <bits/stdc++.h>
#define forn(i, l, r) for(int i=l;i<=r;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define nd second
#define st first
#define sz(x) (int)x.size()
#define UNIQUE(v) (v).resize(unique(all(v)) ... | 21.419048 | 81 | 0.501556 | [
"vector"
] |
310fca876f4df9bc24293f2f55b2fa744c884e5c | 11,534 | cpp | C++ | src/Data/MapObject.cpp | jmakovicka/OsmAnd-core | d18f57bb123b6c6ad0adbed0c2f4419d0e6a6610 | [
"MIT"
] | null | null | null | src/Data/MapObject.cpp | jmakovicka/OsmAnd-core | d18f57bb123b6c6ad0adbed0c2f4419d0e6a6610 | [
"MIT"
] | null | null | null | src/Data/MapObject.cpp | jmakovicka/OsmAnd-core | d18f57bb123b6c6ad0adbed0c2f4419d0e6a6610 | [
"MIT"
] | null | null | null | #include "MapObject.h"
#include "stdlib_common.h"
#include <algorithm>
#include "QtExtensions.h"
#include "QtCommon.h"
#include "OsmAndCore.h"
#include "Common.h"
#include "QKeyIterator.h"
#include "QKeyValueIterator.h"
std::shared_ptr<const OsmAnd::MapObject::EncodingDecodingRules> OsmAnd::MapObject::defaultEncodi... | 31.6 | 159 | 0.686319 | [
"object"
] |
31156d5cf4998a7dbda1965a7c2dd867846178e5 | 1,779 | cpp | C++ | LeetCode/Problems/Algorithms/#971_FlipBinaryTreeToMatchPreorderTraversal_sol1_dfs_O(N)_time_O(H)_extra_space.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | 1 | 2022-01-26T14:50:07.000Z | 2022-01-26T14:50:07.000Z | LeetCode/Problems/Algorithms/#971_FlipBinaryTreeToMatchPreorderTraversal_sol1_dfs_O(N)_time_O(H)_extra_space.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | LeetCode/Problems/Algorithms/#971_FlipBinaryTreeToMatchPreorderTraversal_sol1_dfs_O(N)_time_O(H)_extra_space.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : v... | 34.882353 | 106 | 0.482293 | [
"vector"
] |
3124e35877492e7116a1630b668b4af4bf8cd81c | 11,503 | cpp | C++ | Felix/felix_cl_options_test.cpp | ultimatezen/felix | 5a7ad298ca4dcd5f1def05c60ae3c84519ec54c4 | [
"MIT"
] | null | null | null | Felix/felix_cl_options_test.cpp | ultimatezen/felix | 5a7ad298ca4dcd5f1def05c60ae3c84519ec54c4 | [
"MIT"
] | null | null | null | Felix/felix_cl_options_test.cpp | ultimatezen/felix | 5a7ad298ca4dcd5f1def05c60ae3c84519ec54c4 | [
"MIT"
] | null | null | null | /*!
@brief Unit tests for felix_cl_options
@author Ryan Ginstrom
*/
#include "StdAfx.h"
#include "felix_cl_options.h"
#include <boost/test/unit_test.hpp>
#ifdef UNIT_TEST
BOOST_AUTO_TEST_SUITE( test_parse_command_line )
BOOST_AUTO_TEST_CASE( simple)
{
LPCTSTR command_line_text = _T("foo.txt") ;... | 31.089189 | 88 | 0.724594 | [
"vector"
] |
312b25109160b9a707e5b01107b9344ea729078b | 131,506 | hpp | C++ | plll/include/plll/matrix-ops2.hpp | KudrinMatvey/myfplll | 99fa018201097b6c078c00721cdc409cdcd4092c | [
"MIT"
] | null | null | null | plll/include/plll/matrix-ops2.hpp | KudrinMatvey/myfplll | 99fa018201097b6c078c00721cdc409cdcd4092c | [
"MIT"
] | null | null | null | plll/include/plll/matrix-ops2.hpp | KudrinMatvey/myfplll | 99fa018201097b6c078c00721cdc409cdcd4092c | [
"MIT"
] | null | null | null | /*
Copyright (c) 2011-2014 University of Zurich
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, m... | 65.523667 | 281 | 0.582833 | [
"object",
"transform"
] |
312d8fe9789d9b39f6b16a43bc3302a4cbdbae70 | 1,663 | cpp | C++ | Engine/Animation.cpp | metalheadjohny/Stale_Memes | 69717ff036471fa642141ac2ff9a23525b475cea | [
"MIT"
] | 1 | 2019-09-02T08:23:40.000Z | 2019-09-02T08:23:40.000Z | Engine/Animation.cpp | metalheadjohny/Stale_Memes | 69717ff036471fa642141ac2ff9a23525b475cea | [
"MIT"
] | 3 | 2021-05-09T20:19:23.000Z | 2021-08-10T19:00:19.000Z | Engine/Animation.cpp | metalheadjohny/Stale_Memes | 69717ff036471fa642141ac2ff9a23525b475cea | [
"MIT"
] | null | null | null | #include "pch.h"
#include "Animation.h"
#include "Bone.h"
Animation::Animation() noexcept = default;
Animation::Animation(std::string& name, double ticks, double ticksPerSecond, int nc) noexcept
: _name(name), _ticks(ticks), _ticksPerSecond(ticksPerSecond)
{
_duration = _ticks / _ticksPerSecond;
_tickDuration =... | 25.984375 | 137 | 0.705953 | [
"vector"
] |
3130694a2ed2c07c5b0a79d9d1e4b5f774085ee7 | 4,549 | cxx | C++ | Tracing/TraceEdit/NodeModel.cxx | tostathaina/farsight | 7e9d6d15688735f34f7ca272e4e715acd11473ff | [
"Apache-2.0"
] | 8 | 2016-07-22T11:24:19.000Z | 2021-04-10T04:22:31.000Z | Tracing/TraceEdit/NodeModel.cxx | YanXuHappygela/Farsight | 1711b2a1458c7e035edd21fe0019a1f7d23fcafa | [
"Apache-2.0"
] | null | null | null | Tracing/TraceEdit/NodeModel.cxx | YanXuHappygela/Farsight | 1711b2a1458c7e035edd21fe0019a1f7d23fcafa | [
"Apache-2.0"
] | 7 | 2016-07-21T07:39:17.000Z | 2020-01-29T02:03:27.000Z | #include "TraceBit.h"
#include "TraceLine.h"
#include "NodeModel.h"
NodeModel::NodeModel()
{
this->DataTable = vtkSmartPointer<vtkTable>::New();
this->Selection = new ObjectSelection();
this->additionalHeaders.clear();
}
NodeModel::NodeModel(std::vector<TraceLine*> trace_lines)
{
this->DataTable = vtkSmartPointe... | 25.413408 | 96 | 0.681688 | [
"vector"
] |
31361c792e7703646f548b254204c4a6ee9c7e08 | 3,198 | cpp | C++ | src/Collision/CollisionRect.cpp | TmCrafz/ArenaSFML | a112330816b1e76564194ead9aff99e28ff9b454 | [
"MIT"
] | 2 | 2017-05-16T22:39:14.000Z | 2021-03-16T13:56:55.000Z | src/Collision/CollisionRect.cpp | TmCrafz/ArenaSFML | a112330816b1e76564194ead9aff99e28ff9b454 | [
"MIT"
] | null | null | null | src/Collision/CollisionRect.cpp | TmCrafz/ArenaSFML | a112330816b1e76564194ead9aff99e28ff9b454 | [
"MIT"
] | 1 | 2017-12-05T05:34:20.000Z | 2017-12-05T05:34:20.000Z | #include "Collision/CollisionRect.hpp"
#include "Collision/CollisionHandler.hpp"
#include "Calc.hpp"
CollisionRect::CollisionRect(sf::Vector2f rectSize)
: m_width{ rectSize.x }
, m_height{ rectSize.y }
{
}
float CollisionRect::getWidth() const
{
return m_width;
}
float CollisionRect::getHeight() const
{
ret... | 30.169811 | 82 | 0.659787 | [
"vector"
] |
31418a48eae0bd5169cbc831446079700aabfa6c | 2,931 | cpp | C++ | currency_train/currency.cpp | aajay980/CurrencyRecognition | 7d49cf29c6738081cd8cbcc70942939d1ea9c980 | [
"IJG"
] | null | null | null | currency_train/currency.cpp | aajay980/CurrencyRecognition | 7d49cf29c6738081cd8cbcc70942939d1ea9c980 | [
"IJG"
] | null | null | null | currency_train/currency.cpp | aajay980/CurrencyRecognition | 7d49cf29c6738081cd8cbcc70942939d1ea9c980 | [
"IJG"
] | null | null | null | #include "train_BOW_IR_utils.cpp"
#include "opencv2/core/types_c.h"
using namespace cv;
using namespace std;
int main(int argc,char **argv)
{
/******************** extract features ********************/
Mat siftFeature;
const int vocabSize = (int)strtol(argv[2], NULL, 0);
const int numImagesToTra... | 33.306818 | 107 | 0.591948 | [
"vector"
] |
314a54c1431d3029cc398e46adcdb9fe26a0361c | 6,367 | cpp | C++ | CIM_Framework/CIMFramework/CPPClasses/Src/CIM_RemoteServiceAccessPoint.cpp | rgl/lms | cda6a25e0f39b2a18f10415560ee6a2cfc5fbbcb | [
"Apache-2.0"
] | 18 | 2019-04-17T10:43:35.000Z | 2022-03-22T22:30:39.000Z | CIM_Framework/CIMFramework/CPPClasses/Src/CIM_RemoteServiceAccessPoint.cpp | rgl/lms | cda6a25e0f39b2a18f10415560ee6a2cfc5fbbcb | [
"Apache-2.0"
] | 9 | 2019-10-03T15:29:51.000Z | 2021-12-27T14:03:33.000Z | CIM_Framework/CIMFramework/CPPClasses/Src/CIM_RemoteServiceAccessPoint.cpp | isabella232/lms | 50d16f81b49aba6007388c001e8137352c5eb42e | [
"Apache-2.0"
] | 8 | 2019-06-13T23:30:50.000Z | 2021-06-25T15:51:59.000Z | //----------------------------------------------------------------------------
//
// Copyright (c) Intel Corporation, 2003 - 2012 All Rights Reserved.
//
// File: CIM_RemoteServiceAccessPoint.cpp
//
// Contents: RemoteServiceAccessPoint describes access or addressing information or a combination of this inf... | 33.867021 | 320 | 0.763782 | [
"object",
"vector"
] |
314c04b512d081ff96f272239adfe62e2601b9c5 | 2,613 | hpp | C++ | Source/Streams.hpp | sawickiap/RegEngine | 613c31fd60558a75c5b8902529acfa425fc97b2a | [
"MIT"
] | 11 | 2022-01-02T22:50:42.000Z | 2022-02-15T09:10:25.000Z | Source/Streams.hpp | sawickiap/RegEngine | 613c31fd60558a75c5b8902529acfa425fc97b2a | [
"MIT"
] | null | null | null | Source/Streams.hpp | sawickiap/RegEngine | 613c31fd60558a75c5b8902529acfa425fc97b2a | [
"MIT"
] | null | null | null | #pragma once
class BaseStream
{
public:
// Values match WinAPI constants FILE_BEGIN, FILE_CURRENT, FILE_END.
enum class MoveMethod { Begin = 0, Current = 1, End = 2 };
virtual ~BaseStream() = default;
// Default implementation asserts as not supported and returns SIZE_MAX.
virtual size... | 29.693182 | 77 | 0.641791 | [
"vector"
] |
314c71f0e71571028f87143a7bc7eaea4c94ab65 | 2,061 | cpp | C++ | IRadiance/src/IRadiance/Raytracer/Geometry/OpenCylinder.cpp | Nickelium/IRadiance | 7e7040460852a6f9f977cf466e6dcecf44618ae7 | [
"MIT"
] | null | null | null | IRadiance/src/IRadiance/Raytracer/Geometry/OpenCylinder.cpp | Nickelium/IRadiance | 7e7040460852a6f9f977cf466e6dcecf44618ae7 | [
"MIT"
] | null | null | null | IRadiance/src/IRadiance/Raytracer/Geometry/OpenCylinder.cpp | Nickelium/IRadiance | 7e7040460852a6f9f977cf466e6dcecf44618ae7 | [
"MIT"
] | null | null | null | #include "pch.h"
#include "OpenCylinder.h"
namespace IRadiance
{
const float OpenCylinder::eps = 1e-3f;
OpenCylinder::OpenCylinder(float _r /*= 1.0f*/, float _y0 /*= -1.0f*/, float _y1 /*= 1.0f*/)
: r(_r), y0(_y0), y1(_y1)
{
}
bool OpenCylinder::Hit(const Ray& _ray, float& _tMin, HitRecord& _sr) c... | 20.818182 | 94 | 0.499757 | [
"vector"
] |
3160ff127d7a7cdf5baaf3a2820cc018e4c7bdd5 | 1,785 | cpp | C++ | code/BFolder.cpp | omerdagan84/neomem | 7d2f782bb37f1ab0ac6580d00672e114605afab7 | [
"MIT"
] | 1 | 2022-02-10T01:41:32.000Z | 2022-02-10T01:41:32.000Z | code/BFolder.cpp | omerdagan84/neomem | 7d2f782bb37f1ab0ac6580d00672e114605afab7 | [
"MIT"
] | null | null | null | code/BFolder.cpp | omerdagan84/neomem | 7d2f782bb37f1ab0ac6580d00672e114605afab7 | [
"MIT"
] | null | null | null |
#include "Precompiled.h"
#include "BFolder.h"
#include "ConstantsDatabase.h"
#include "Brooklyn.h"
// 'new' handler - create a BObject
BFolder::BFolder(BDoc& doc, LPCTSTR pszName, OBJID idParent, OBJID idDefaultClass, OBJID idIcon, ULONG lngFlags) :
// "classFolder": this is an object of class '... | 30.254237 | 120 | 0.72381 | [
"object"
] |
316246fe77b12a4cee080b8ed85734cf867ad335 | 1,962 | hpp | C++ | includes/General.hpp | Chobischtroumpf/webserv | d538d32e1ca24c51adc1e74b6f6856f445dff1c1 | [
"Unlicense"
] | null | null | null | includes/General.hpp | Chobischtroumpf/webserv | d538d32e1ca24c51adc1e74b6f6856f445dff1c1 | [
"Unlicense"
] | null | null | null | includes/General.hpp | Chobischtroumpf/webserv | d538d32e1ca24c51adc1e74b6f6856f445dff1c1 | [
"Unlicense"
] | null | null | null | #ifndef GENERAL_HPP
# define GENERAL_HPP
# include <unistd.h>
# include <sys/types.h>
# include <sys/stat.h>
# include <fcntl.h>
# include <sys/wait.h>
# include <sys/time.h>
# include <sys/resource.h>
# include <signal.h>
# include <dirent.h>
# include <stdio.h>
# include <errno.h>
# include <sys/select.h>
# include ... | 26.16 | 89 | 0.699796 | [
"vector"
] |
3168a92a157420f4ff75737272ad6dbbf8381956 | 6,183 | cc | C++ | resonance_audio/utils/lockless_task_queue_test.cc | seba10000/resonance-audio | e1923fe6fe733ae4d3c8460ff883c87e2ad05d6b | [
"Apache-2.0"
] | 396 | 2018-03-14T09:55:52.000Z | 2022-03-27T14:58:38.000Z | resonance_audio/utils/lockless_task_queue_test.cc | seba10000/resonance-audio | e1923fe6fe733ae4d3c8460ff883c87e2ad05d6b | [
"Apache-2.0"
] | 46 | 2018-04-18T17:14:29.000Z | 2022-02-19T21:35:57.000Z | resonance_audio/utils/lockless_task_queue_test.cc | seba10000/resonance-audio | e1923fe6fe733ae4d3c8460ff883c87e2ad05d6b | [
"Apache-2.0"
] | 96 | 2018-03-14T17:20:50.000Z | 2022-03-03T01:12:37.000Z | /*
Copyright 2018 Google Inc. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in ... | 28.625 | 79 | 0.712761 | [
"vector"
] |
316bdf8fcf8def23e97940559da8c4cb0be68ab3 | 1,656 | cpp | C++ | src/posix/dlfcn.cpp | KristianJerpetjon/IncludeOS | 367a1dcefafd6f9618e5373c9133839f9ee2d675 | [
"Apache-2.0"
] | 1 | 2019-09-14T09:58:20.000Z | 2019-09-14T09:58:20.000Z | src/posix/dlfcn.cpp | KristianJerpetjon/IncludeOS | 367a1dcefafd6f9618e5373c9133839f9ee2d675 | [
"Apache-2.0"
] | 1 | 2016-06-28T13:30:26.000Z | 2016-06-28T13:30:26.000Z | src/posix/dlfcn.cpp | KristianJerpetjon/IncludeOS | 367a1dcefafd6f9618e5373c9133839f9ee2d675 | [
"Apache-2.0"
] | 1 | 2019-09-14T09:58:31.000Z | 2019-09-14T09:58:31.000Z | // This file is a part of the IncludeOS unikernel - www.includeos.org
//
// Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences
// and Alfred Bratterud
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// Yo... | 28.551724 | 79 | 0.65157 | [
"object"
] |
316cc964a33f8cf10e911bfeee42de6514228cea | 1,831 | hpp | C++ | Gamma/Sources/GammaRenderer.hpp | harskish/gamma | e627cc9e6159141f49852493025484cea4476050 | [
"MIT"
] | 2 | 2019-12-26T00:39:36.000Z | 2020-12-03T16:36:04.000Z | Gamma/Sources/GammaRenderer.hpp | harskish/gamma | e627cc9e6159141f49852493025484cea4476050 | [
"MIT"
] | null | null | null | Gamma/Sources/GammaRenderer.hpp | harskish/gamma | e627cc9e6159141f49852493025484cea4476050 | [
"MIT"
] | 1 | 2021-03-15T13:26:40.000Z | 2021-03-15T13:26:40.000Z | #pragma once
#include <GLFW/glfw3.h>
#include <memory>
#include <vector>
#include <imgui.h>
#include "Scene.hpp"
#include "Camera.hpp"
#include "IBLMaps.hpp"
#include "BloomPass.hpp"
class GammaRenderer
{
public:
GammaRenderer(GLFWwindow *w);
~GammaRenderer() = default;
void linkScene(std::shared_ptr<Scen... | 26.926471 | 82 | 0.674495 | [
"render",
"vector"
] |
31750565f1c88ea1cf21580dc244af4bdb1d1a9c | 5,242 | cpp | C++ | legacy_renderer.cpp | RomanFesenko/SurfaceViewer | e8f27946ae3bce125b4c6639d9315e4652f401e5 | [
"MIT"
] | null | null | null | legacy_renderer.cpp | RomanFesenko/SurfaceViewer | e8f27946ae3bce125b4c6639d9315e4652f401e5 | [
"MIT"
] | null | null | null | legacy_renderer.cpp | RomanFesenko/SurfaceViewer | e8f27946ae3bce125b4c6639d9315e4652f401e5 | [
"MIT"
] | null | null | null | #include <iostream>
#include <assert.h>
#include "opengl_iface.h"
#include "legacy_renderer.h"
void LegacyRender(const CFunctionalMesh&mesh)
{
using point_t=CFunctionalMesh::point_t;
auto traits=mesh.RenderingTraits();
glDisable(GL_LIGHTING);// for correct use glColor*
if(traits.IsBox())
{
... | 23.401786 | 95 | 0.544258 | [
"mesh",
"render"
] |
317be9ad073b87aad0e705ab734bc65c0f8c027c | 4,498 | cpp | C++ | base/patterns/inverse/reader.cpp | zeionara/meager | a7634103cf92452a7396f100fdd7a0f7e9946315 | [
"Apache-2.0"
] | null | null | null | base/patterns/inverse/reader.cpp | zeionara/meager | a7634103cf92452a7396f100fdd7a0f7e9946315 | [
"Apache-2.0"
] | null | null | null | base/patterns/inverse/reader.cpp | zeionara/meager | a7634103cf92452a7396f100fdd7a0f7e9946315 | [
"Apache-2.0"
] | null | null | null | #include <fstream>
#include <vector>
#include <unordered_set>
#include "main.h"
#include "../../Reader.h"
using namespace std;
const int nTriplesPerPattern = 2;
// vector<PatternInstance> symmetricTriples;
vector<PatternInstance>** inverseTriplePatternInstances = (vector<PatternInstance>**)malloc(sizeof(vector<Patt... | 38.444444 | 174 | 0.636505 | [
"vector"
] |
317da2cd8c1a41bec3427245671051ab0e219364 | 2,663 | hxx | C++ | cpp/src/nvgraph/include/widest_path.hxx | rgsl888prabhu/cugraph | e030a2fe22ad308fba05d6146765a3c9aa865e5b | [
"Apache-2.0"
] | 16 | 2019-09-13T11:43:26.000Z | 2022-03-02T10:11:59.000Z | cpp/src/nvgraph/include/widest_path.hxx | rgsl888prabhu/cugraph | e030a2fe22ad308fba05d6146765a3c9aa865e5b | [
"Apache-2.0"
] | 5 | 2020-02-12T14:55:25.000Z | 2021-12-06T17:55:12.000Z | cpp/src/nvgraph/include/widest_path.hxx | rgsl888prabhu/cugraph | e030a2fe22ad308fba05d6146765a3c9aa865e5b | [
"Apache-2.0"
] | 6 | 2020-04-06T01:34:45.000Z | 2021-01-21T17:13:24.000Z | /*
* Copyright (c) 2019, NVIDIA 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 ... | 42.269841 | 153 | 0.664664 | [
"vector"
] |
31870745797512434007fd022e242ef5c60505b5 | 473 | cpp | C++ | Dataset/Leetcode/train/88/234.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/88/234.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | Dataset/Leetcode/train/88/234.cpp | kkcookies99/UAST | fff81885aa07901786141a71e5600a08d7cb4868 | [
"MIT"
] | null | null | null | class Solution {
public:
void XXX(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int t = m+n-1;
int i = m - 1, j = n - 1;
while(i >= 0 && j >= 0){
if(nums1[i]>=nums2[j]){
nums1[t--] = nums1[i--];
}else{
nums1[... | 22.52381 | 68 | 0.325581 | [
"vector"
] |
3189a9eadcd696622e7f839ca67e265b3be2ba5b | 2,131 | cpp | C++ | Engine/Src/BRQ/Utilities/FileSystem.cpp | saeenyoda/Burraq-Engine | 885c76308358515ef4af9fcc4d6802985ae2aa18 | [
"MIT"
] | null | null | null | Engine/Src/BRQ/Utilities/FileSystem.cpp | saeenyoda/Burraq-Engine | 885c76308358515ef4af9fcc4d6802985ae2aa18 | [
"MIT"
] | null | null | null | Engine/Src/BRQ/Utilities/FileSystem.cpp | saeenyoda/Burraq-Engine | 885c76308358515ef4af9fcc4d6802985ae2aa18 | [
"MIT"
] | null | null | null | #include <BRQ.h>
#include "FileSystem.h"
namespace BRQ { namespace Utilities {
FileSystem* FileSystem::s_Instance = nullptr;
void FileSystem::Init() {
s_Instance = new FileSystem();
}
void FileSystem::Shutdown() {
if (s_Instance) {
delete s_Instance;
}
}
... | 23.417582 | 119 | 0.557015 | [
"vector"
] |
318eff9ad9547c6f94ab72d81c9fa1e55b46bd2e | 105,086 | cpp | C++ | Libraries/RobsJuceModules/jura_processors/instruments/jura_Liberty.cpp | RobinSchmidt/RS-MET-Preliminary | 6c01cbaad7cce3daa3293c444dd9e4b74e5ebfbe | [
"FTL"
] | 34 | 2017-04-19T18:26:02.000Z | 2022-02-15T17:47:26.000Z | Libraries/RobsJuceModules/jura_processors/instruments/jura_Liberty.cpp | RobinSchmidt/RS-MET-Preliminary | 6c01cbaad7cce3daa3293c444dd9e4b74e5ebfbe | [
"FTL"
] | 307 | 2017-05-04T21:45:01.000Z | 2022-02-03T00:59:01.000Z | Libraries/RobsJuceModules/jura_processors/instruments/jura_Liberty.cpp | RobinSchmidt/RS-MET-Preliminary | 6c01cbaad7cce3daa3293c444dd9e4b74e5ebfbe | [
"FTL"
] | 4 | 2017-09-05T17:04:31.000Z | 2021-12-15T21:24:28.000Z | using namespace romos;
//=================================================================================================
// class LibertyInterfaceState:
LibertyInterfaceState::LibertyInterfaceState()
{
activePanel = STRUCTURE_PANEL;
}
//============================================================================... | 38.436723 | 219 | 0.693023 | [
"object",
"vector"
] |
319bc9a2200fd93211cf86f9f0e31601f2287a8f | 307 | cpp | C++ | bjarnePPPUC/chp4/4.6/mean_median.cpp | Binary-bug/Cplusplus | 48e33d1c572062b34ca57fe61a186ef675a9980b | [
"MIT"
] | null | null | null | bjarnePPPUC/chp4/4.6/mean_median.cpp | Binary-bug/Cplusplus | 48e33d1c572062b34ca57fe61a186ef675a9980b | [
"MIT"
] | null | null | null | bjarnePPPUC/chp4/4.6/mean_median.cpp | Binary-bug/Cplusplus | 48e33d1c572062b34ca57fe61a186ef675a9980b | [
"MIT"
] | null | null | null | #include "std_lib_facilities.h"
int main(){
vector<double> temps;
for(double temp;cin>>temp;)
temps.push_back(temp);
double sum=0;
for(double x:temps) sum+=x;
cout<<"Average temperature: "<<sum/temps.size()<<'\n';
sort(temps);
cout<<"Media temperatute: "<<temps[temps.size()/2]<<'\n';
return 0;
}
| 16.157895 | 57 | 0.664495 | [
"vector"
] |
31a42bec013c966b117d501d08986f92b74f0341 | 3,064 | hh | C++ | ermia/include/transaction.hh | KoseMasu/ccbench-1 | ec43e67acf0674919feaea6ff252f904cd38a5bc | [
"Apache-2.0"
] | 30 | 2019-03-20T07:23:53.000Z | 2022-02-01T01:00:02.000Z | ermia/include/transaction.hh | KoseMasu/ccbench-1 | ec43e67acf0674919feaea6ff252f904cd38a5bc | [
"Apache-2.0"
] | 8 | 2019-06-06T04:24:16.000Z | 2021-12-10T05:55:35.000Z | ermia/include/transaction.hh | KoseMasu/ccbench-1 | ec43e67acf0674919feaea6ff252f904cd38a5bc | [
"Apache-2.0"
] | 10 | 2019-07-21T15:24:19.000Z | 2022-03-15T02:07:23.000Z | #pragma once
#include <cstdint>
#include <map>
#include <vector>
#include "../../include/config.hh"
#include "../../include/procedure.hh"
#include "../../include/result.hh"
#include "../../include/string.hh"
#include "../../include/util.hh"
#include "common.hh"
#include "ermia_op_element.hh"
#include "garbage_collect... | 26.877193 | 84 | 0.676567 | [
"vector"
] |
b3b1b00b88a6a919d163e1c062f7974e66c763de | 11,667 | cpp | C++ | Samples/Win7Samples/tabletpc/multireco/cpp/ChildWnds.cpp | windows-development/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | 8 | 2017-04-30T17:38:27.000Z | 2021-11-29T00:59:03.000Z | Samples/Win7Samples/tabletpc/multireco/cpp/ChildWnds.cpp | TomeSq/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | null | null | null | Samples/Win7Samples/tabletpc/multireco/cpp/ChildWnds.cpp | TomeSq/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | 2 | 2020-08-11T13:21:49.000Z | 2021-09-01T10:41:51.000Z | // THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
// PARTICULAR PURPOSE.
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// Module:
// ... | 29.31407 | 107 | 0.490015 | [
"object"
] |
b3b9c640fb43d24502c9b59b2b923d5a97bccdc7 | 722 | cpp | C++ | VNOJ/Data_Structures/Prefix_Sum/nkseq.cpp | hoanghai1803/CP_Training | 03495a21509fb3ab7fc64674b9a1b0c7d4327ecb | [
"MIT"
] | 4 | 2021-08-25T10:53:32.000Z | 2021-09-30T03:25:50.000Z | VNOJ/Data_Structures/Prefix_Sum/nkseq.cpp | hoanghai1803/CP_Training | 03495a21509fb3ab7fc64674b9a1b0c7d4327ecb | [
"MIT"
] | null | null | null | VNOJ/Data_Structures/Prefix_Sum/nkseq.cpp | hoanghai1803/CP_Training | 03495a21509fb3ab7fc64674b9a1b0c7d4327ecb | [
"MIT"
] | null | null | null | // Author: __BruteForce__
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
vector<bool> chk1(n + 1, false);
for (int... | 21.878788 | 49 | 0.432133 | [
"vector"
] |
b3bee11891d741e6732a21d4bc0c8f50af1d2a52 | 6,016 | cpp | C++ | Src/Geometries/TriMesh/MeshConverter.cpp | dtcxzyw/Piper | af17b45848d46687ba6c9f214264759275a35a9f | [
"MIT"
] | 1 | 2021-12-28T14:31:28.000Z | 2021-12-28T14:31:28.000Z | Src/Geometries/TriMesh/MeshConverter.cpp | dtcxzyw/Piper | af17b45848d46687ba6c9f214264759275a35a9f | [
"MIT"
] | null | null | null | Src/Geometries/TriMesh/MeshConverter.cpp | dtcxzyw/Piper | af17b45848d46687ba6c9f214264759275a35a9f | [
"MIT"
] | 1 | 2022-02-17T08:04:05.000Z | 2022-02-17T08:04:05.000Z | #include <filesystem>
#include <fstream>
#pragma warning(push, 0)
#include <assimp/Importer.hpp>
#include <assimp/postprocess.h>
#include <assimp/scene.h>
#include <assimp/vector3.h>
#include <cxxopts.hpp>
#include <lz4hc.h>
#pragma warning(pop)
#include "../../Shared/CommandAPI.hpp"
BUS_MODULE_NAME("Piper.BuiltinGeom... | 40.92517 | 80 | 0.570977 | [
"mesh",
"vector"
] |
b3ce5835ec6ee975aa0aafa924ec560d40a77c54 | 525 | cpp | C++ | leetcode.com/1665 Minimum Initial Energy to Finish Tasks/main.cpp | sky-bro/AC | 29bfa3f13994612887e18065fa6e854b9a29633d | [
"MIT"
] | 1 | 2020-08-20T11:02:49.000Z | 2020-08-20T11:02:49.000Z | leetcode.com/1665 Minimum Initial Energy to Finish Tasks/main.cpp | sky-bro/AC | 29bfa3f13994612887e18065fa6e854b9a29633d | [
"MIT"
] | null | null | null | leetcode.com/1665 Minimum Initial Energy to Finish Tasks/main.cpp | sky-bro/AC | 29bfa3f13994612887e18065fa6e854b9a29633d | [
"MIT"
] | 1 | 2022-01-01T23:23:13.000Z | 2022-01-01T23:23:13.000Z | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int minimumEffort(vector<vector<int>>& tasks) {
int res = 0;
for (auto& t : tasks) res += t[0];
sort(tasks.begin(), tasks.end(), [](vector<int>& a, vector<int>& b) {
return a[1] - a[0] > b[1] ... | 20.192308 | 73 | 0.510476 | [
"vector"
] |
b3ce60f16f8c38cd5468d2e7564a6d69033db548 | 1,962 | cpp | C++ | LeetCode/ThousandOne/0638-shopping_offers.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0638-shopping_offers.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0638-shopping_offers.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | #include "leetcode.hpp"
/* 638. 大礼包
在LeetCode商店中， 有许多在售的物品。
然而，也有一些大礼包，每个大礼包以优惠的价格捆绑销售一组物品。
现给定每个物品的价格，每个大礼包包含物品的清单，以及待购物品清单。
请输出确切完成待购清单的最低花费。
每个大礼包的由一个数组中的一组数据描述，最后一个数字代表大礼包的价格，其他数字分别表示内含的其他种类物品的数量。
任意大礼包可无限次购买。
示例 1:
输入: [2,5], [[3,0,5],[1,2,10]], [3,2]
输出: 14
解释:
有A和B两种物品，价格分别为¥2和¥5。
大礼包1，你可以以¥5的价格购买3A和0B。
大礼包2... | 20.226804 | 67 | 0.621305 | [
"vector"
] |
b3cf05c630e2fad6643fb3f8dd93d0b22fa8da53 | 739 | cpp | C++ | test/data_structures/lazy_segment_tree.max_update.test.cpp | takata-daiki/algorithms | 299f7379a2acf8a3e14bc3e3de6509e821eec115 | [
"MIT"
] | null | null | null | test/data_structures/lazy_segment_tree.max_update.test.cpp | takata-daiki/algorithms | 299f7379a2acf8a3e14bc3e3de6509e821eec115 | [
"MIT"
] | null | null | null | test/data_structures/lazy_segment_tree.max_update.test.cpp | takata-daiki/algorithms | 299f7379a2acf8a3e14bc3e3de6509e821eec115 | [
"MIT"
] | 1 | 2019-12-11T06:45:30.000Z | 2019-12-11T06:45:30.000Z | #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_2_F"
#include "../../data_structures/lazy_segment_tree.hpp"
#include "../../monoids/max.hpp"
#include "../../monoids/change.hpp"
#include "../../monoids/max_change_action.hpp"
#include <bits/stdc++.h>
using namespace std;
int main() {
... | 28.423077 | 103 | 0.537212 | [
"vector"
] |
b3d47f842e17f42cef246ed71b0b37e8c9f4c56c | 13,447 | cpp | C++ | third_party/omr/gc/base/segregated/AllocationContextSegregated.cpp | xiacijie/omr-wala-linkage | a1aff7aef9ed131a45555451abde4615a04412c1 | [
"Apache-2.0"
] | null | null | null | third_party/omr/gc/base/segregated/AllocationContextSegregated.cpp | xiacijie/omr-wala-linkage | a1aff7aef9ed131a45555451abde4615a04412c1 | [
"Apache-2.0"
] | null | null | null | third_party/omr/gc/base/segregated/AllocationContextSegregated.cpp | xiacijie/omr-wala-linkage | a1aff7aef9ed131a45555451abde4615a04412c1 | [
"Apache-2.0"
] | null | null | null | /*******************************************************************************
* Copyright (c) 1991, 2016 IBM Corp. and others
*
* This program and the accompanying materials are made available under
* the terms of the Eclipse Public License 2.0 which accompanies this
* distribution and is available at https://w... | 34.74677 | 201 | 0.761806 | [
"object"
] |
b3d6c1f563d25e8a1ca04b1632061b84f6e2da48 | 1,555 | cpp | C++ | Codes/Math/Fourier2.cpp | cjtoribio/Algorithms | 78499613a9b018eb5e489307b14e31e5fe8227e3 | [
"MIT"
] | 18 | 2015-05-24T20:28:46.000Z | 2021-01-27T02:34:43.000Z | Codes/Math/Fourier2.cpp | cjtoribio/Algorithms | 78499613a9b018eb5e489307b14e31e5fe8227e3 | [
"MIT"
] | null | null | null | Codes/Math/Fourier2.cpp | cjtoribio/Algorithms | 78499613a9b018eb5e489307b14e31e5fe8227e3 | [
"MIT"
] | 4 | 2015-05-24T20:28:32.000Z | 2021-01-30T04:04:55.000Z | namespace Fourier {
#define lowbit(x) (((x) ^ (x-1)) & (x))
typedef complex<long double> Complex;
void FFT(vector<Complex> &A, int s){
int n = A.size();
int p = __builtin_ctz(n);
vector<Complex> a = A;
for(int i = 0;i<n;++i){
int rev = 0;
for(int j = 0;j<p;++j){
rev <<= 1;
rev |= ((i >>... | 19.935897 | 80 | 0.480386 | [
"vector"
] |
b3db0bb2565a760d1a8391c94bc7c3cbbc9ea4d6 | 1,653 | cpp | C++ | training/1-5-3-pprime/cpp11/main.cpp | hsun324/usaco-solutions | 27f77911971513a4d2b1b820eaa09802acadfefa | [
"MIT"
] | 2 | 2015-12-26T21:20:12.000Z | 2017-12-19T00:11:45.000Z | training/1-5-3-pprime/cpp11/main.cpp | hsun324/usaco-solutions | 27f77911971513a4d2b1b820eaa09802acadfefa | [
"MIT"
] | null | null | null | training/1-5-3-pprime/cpp11/main.cpp | hsun324/usaco-solutions | 27f77911971513a4d2b1b820eaa09802acadfefa | [
"MIT"
] | null | null | null | /**
ID: <ID HERE>
LANG: C++11
TASK: pprime
*/
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <cmath>
#include <vector>
using namespace std;
bool is_prime(int num) {
int max = (int) sqrt(num);
for (int i = 2; i <= max; i++)
if (num % i == 0)
return false;
return true;
}
void gen... | 19.915663 | 71 | 0.580157 | [
"vector"
] |
b3e09009f84b21c258ebd725fcc904993e9b969c | 1,364 | cpp | C++ | leetcode-algorithms/035. Search Insert Position/35.search-insert-position.cpp | cnyy7/LeetCode_EY | 44e92f102b61f5e931e66081ed6636d7ecbdefd4 | [
"MIT"
] | null | null | null | leetcode-algorithms/035. Search Insert Position/35.search-insert-position.cpp | cnyy7/LeetCode_EY | 44e92f102b61f5e931e66081ed6636d7ecbdefd4 | [
"MIT"
] | null | null | null | leetcode-algorithms/035. Search Insert Position/35.search-insert-position.cpp | cnyy7/LeetCode_EY | 44e92f102b61f5e931e66081ed6636d7ecbdefd4 | [
"MIT"
] | null | null | null | /*
* @lc app=leetcode id=35 lang=cpp
*
* [35] Search Insert Position
*
* https://leetcode.com/problems/search-insert-position/description/
*
* algorithms
* Easy (40.48%)
* Total Accepted: 381.4K
* Total Submissions: 938.6K
* Testcase Example: '[1,3,5,6]\n5'
*
* Given a sorted array and a t... | 18.186667 | 78 | 0.446481 | [
"vector"
] |
b3e69eecd02f7f37b27728c05d6a61344831caf8 | 2,736 | cpp | C++ | Samples/Win7Samples/netds/upnp/dco_dimmerservice/DeviceDll.cpp | windows-development/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | 8 | 2017-04-30T17:38:27.000Z | 2021-11-29T00:59:03.000Z | Samples/Win7Samples/netds/upnp/dco_dimmerservice/DeviceDll.cpp | TomeSq/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | null | null | null | Samples/Win7Samples/netds/upnp/dco_dimmerservice/DeviceDll.cpp | TomeSq/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | 2 | 2020-08-11T13:21:49.000Z | 2021-09-01T10:41:51.000Z | // THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
// PARTICULAR PURPOSE.
//
// Copyright (c) Microsoft Corporation. All rights reserved
//
// DeviceDll.cpp :... | 29.419355 | 80 | 0.504386 | [
"object"
] |
b3e824ae0222e0008605fa2af86e76e7535f54d3 | 417 | cpp | C++ | test/RecordingListener.cpp | jeffkilpatrick/thermocouple | fb433e46706543cce76402cfbce7c63df2790cda | [
"MIT"
] | null | null | null | test/RecordingListener.cpp | jeffkilpatrick/thermocouple | fb433e46706543cce76402cfbce7c63df2790cda | [
"MIT"
] | 15 | 2019-06-02T21:09:40.000Z | 2019-06-08T20:44:32.000Z | test/RecordingListener.cpp | jeffkilpatrick/thermocouple | fb433e46706543cce76402cfbce7c63df2790cda | [
"MIT"
] | null | null | null | //
// RecordingListener.cpp
// Thermocouple
//
// Created by Jeff Kilpatrick on 11/30/14.
// Copyright (c) 2014 Jeff Kilpatrick. All rights reserved.
//
#include "RecordingListener.h"
void
RecordingListener::Notify(float celsius)
{
m_values.emplace_back(std::chrono::system_clock::now(), celsius);
}
const std... | 19.857143 | 69 | 0.729017 | [
"vector"
] |
b3e86619ecfb0b4a5a817420c043ebb3889eda63 | 8,151 | cpp | C++ | ut/source/test_r_disco.cpp | TroyDL/revere | 541bdc2bed9db212c1b74414b24733cf39675d08 | [
"BSD-3-Clause"
] | null | null | null | ut/source/test_r_disco.cpp | TroyDL/revere | 541bdc2bed9db212c1b74414b24733cf39675d08 | [
"BSD-3-Clause"
] | null | null | null | ut/source/test_r_disco.cpp | TroyDL/revere | 541bdc2bed9db212c1b74414b24733cf39675d08 | [
"BSD-3-Clause"
] | null | null | null |
#include "test_r_disco.h"
#include "utils.h"
#include "r_pipeline/r_gst_source.h"
#include "r_pipeline/r_arg.h"
#include "r_pipeline/r_stream_info.h"
#include "r_fakey/r_fake_camera.h"
#include "r_utils/r_string_utils.h"
#include "r_utils/r_work_q.h"
#include "r_utils/r_std_utils.h"
#include "r_utils/r_file.h"
#includ... | 28.400697 | 107 | 0.697092 | [
"vector"
] |
b3eeadc3b82370dfca59b5dd346e5dcc10dc4c33 | 3,137 | hh | C++ | src/lib/MeshFEM/Utilities/NameMangling.hh | pbedenbaugh/MeshFEM | 742d609d4851582ffb9c5616774fc2ef489e2f88 | [
"MIT"
] | 19 | 2020-10-21T10:05:17.000Z | 2022-03-20T13:41:50.000Z | src/lib/MeshFEM/Utilities/NameMangling.hh | pbedenbaugh/MeshFEM | 742d609d4851582ffb9c5616774fc2ef489e2f88 | [
"MIT"
] | 4 | 2021-01-01T15:58:15.000Z | 2021-09-19T03:31:09.000Z | src/lib/MeshFEM/Utilities/NameMangling.hh | pbedenbaugh/MeshFEM | 742d609d4851582ffb9c5616774fc2ef489e2f88 | [
"MIT"
] | 4 | 2020-10-05T09:01:50.000Z | 2022-01-11T03:02:39.000Z | ////////////////////////////////////////////////////////////////////////////////
// NameMangling.hh
////////////////////////////////////////////////////////////////////////////////
/*! @file
// Provides mangled names needed, e.g., for generating python bindings for
// template instantiations
*/
//////////////////////... | 36.057471 | 129 | 0.636914 | [
"mesh"
] |
b3f49023708802134203e7b09a25893df4c01afe | 804 | cpp | C++ | Homework/2. HW/3/Truck.cpp | Ignatoff/FMI-OOP-2018 | a84c250e4b6d2df3135708a2fbe0447b9533858a | [
"MIT"
] | 3 | 2018-03-20T18:28:53.000Z | 2018-06-06T17:29:13.000Z | Homework/2. HW/3/Truck.cpp | Ignatoff/FMI-OOP-2018 | a84c250e4b6d2df3135708a2fbe0447b9533858a | [
"MIT"
] | null | null | null | Homework/2. HW/3/Truck.cpp | Ignatoff/FMI-OOP-2018 | a84c250e4b6d2df3135708a2fbe0447b9533858a | [
"MIT"
] | null | null | null | #include "Truck.h"
#include <iostream>
Truck::Truck() : Vehicle(), size(0) { }
Truck::Truck(const Truck & rhs) : Vehicle(rhs), size(rhs.size) {}
Truck::Truck(const char *make, const char *model, const char *color, const int &year, const int &mileage, const int& size) : Vehicle(make, model, color, year, mileage)
{
t... | 22.971429 | 167 | 0.572139 | [
"model"
] |
b3fd00ddf595ce9b66394e30bb5ef0f3b5df66a5 | 12,992 | cpp | C++ | apps/ospTestSuite/test_fixture.cpp | tribal-tec/ospray | 31ea9d16f8551c06551a11d54fe908d9d004a767 | [
"Apache-2.0"
] | null | null | null | apps/ospTestSuite/test_fixture.cpp | tribal-tec/ospray | 31ea9d16f8551c06551a11d54fe908d9d004a767 | [
"Apache-2.0"
] | null | null | null | apps/ospTestSuite/test_fixture.cpp | tribal-tec/ospray | 31ea9d16f8551c06551a11d54fe908d9d004a767 | [
"Apache-2.0"
] | null | null | null | // Copyright 2017-2019 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
#include "test_fixture.h"
#include "ArcballCamera.h"
// ospray_testing
#include "ospray_testing.h"
// ospcommon
#include "ospcommon/utility/multidim_index_sequence.h"
extern OSPRayEnvironment *ospEnv;
namespace OSPRayTestScenes {
// Hel... | 25.984 | 80 | 0.657635 | [
"geometry",
"vector",
"model"
] |
b3fdc0755ff0555dcd89e8904f51fb57f7f9647b | 34,224 | inl | C++ | DirectXErrors/DirectXErrors/data/mf.inl | Const-me/DirectXErrors | 87bebfe1655ad9e09cd8203064905900e9422756 | [
"MIT"
] | 33 | 2019-01-28T03:32:17.000Z | 2022-02-12T18:17:26.000Z | DirectXErrors/DirectXErrors/data/mf.inl | Const-me/DirectXErrors | 87bebfe1655ad9e09cd8203064905900e9422756 | [
"MIT"
] | 2 | 2019-11-18T17:54:58.000Z | 2020-07-21T18:11:21.000Z | DirectXErrors/DirectXErrors/data/mf.inl | Const-me/DirectXErrors | 87bebfe1655ad9e09cd8203064905900e9422756 | [
"MIT"
] | 5 | 2019-02-16T23:00:11.000Z | 2022-03-27T15:22:10.000Z | CHK_ERR( MF_E_PLATFORM_NOT_INITIALIZED, "Platform not initialized. Please call MFStartup()." )
CHK_ERR( MF_E_BUFFERTOOSMALL, "The buffer was too small to carry out the requested action." )
CHK_ERR( MF_E_INVALIDREQUEST, "The request is invalid in the current state." )
CHK_ERR( MF_E_INVALIDSTREAMNUMBER, "The stream numbe... | 104.66055 | 336 | 0.817438 | [
"object",
"vector",
"transform"
] |
b60021ff39e77a2fba72d96b48d2752f3778b9e6 | 2,333 | cpp | C++ | fboss/agent/hw/bcm/BcmControlPlaneQueueManager.cpp | dhtech/fboss | f8c87a0d2855acdcf92e358bc900200cfa1a31bf | [
"BSD-3-Clause"
] | 1 | 2018-10-11T08:45:23.000Z | 2018-10-11T08:45:23.000Z | fboss/agent/hw/bcm/BcmControlPlaneQueueManager.cpp | dhtech/fboss | f8c87a0d2855acdcf92e358bc900200cfa1a31bf | [
"BSD-3-Clause"
] | 2 | 2018-10-06T18:29:44.000Z | 2018-10-07T16:46:04.000Z | fboss/agent/hw/bcm/BcmControlPlaneQueueManager.cpp | dhtech/fboss | f8c87a0d2855acdcf92e358bc900200cfa1a31bf | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (c) 2004-present, 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.
*
*/
#inc... | 34.820896 | 79 | 0.744535 | [
"vector"
] |
b601529d07a962c29db47cc54cfa65f6d6b6bea3 | 2,668 | hh | C++ | alps/include/alps/pegasus/region.hh | liujiawinds/sparkle | 23099cead99603a997803af9f66e17e17161faa2 | [
"Apache-2.0"
] | 40 | 2016-03-15T20:55:01.000Z | 2021-12-01T11:45:43.000Z | alps/include/alps/pegasus/region.hh | liujiawinds/sparkle | 23099cead99603a997803af9f66e17e17161faa2 | [
"Apache-2.0"
] | 18 | 2016-05-19T11:10:13.000Z | 2020-03-18T01:42:49.000Z | alps/include/alps/pegasus/region.hh | liujiawinds/sparkle | 23099cead99603a997803af9f66e17e17161faa2 | [
"Apache-2.0"
] | 19 | 2016-06-03T16:12:25.000Z | 2022-02-18T07:16:54.000Z | /*
* (c) Copyright 2016 Hewlett Packard Enterprise Development LP
*
* 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 requi... | 26.156863 | 106 | 0.675787 | [
"object",
"vector"
] |
b601edda165e3ef8ab0dac261ff985d618a7f5ee | 7,983 | hpp | C++ | src/algebraiccontainers/algebraiccontainers_algebraicvector.hpp | meteoritenhagel/fractional-pde | a740e3d5c88ed68bb57cb15b420d2b7e2d8a52c6 | [
"MIT"
] | null | null | null | src/algebraiccontainers/algebraiccontainers_algebraicvector.hpp | meteoritenhagel/fractional-pde | a740e3d5c88ed68bb57cb15b420d2b7e2d8a52c6 | [
"MIT"
] | null | null | null | src/algebraiccontainers/algebraiccontainers_algebraicvector.hpp | meteoritenhagel/fractional-pde | a740e3d5c88ed68bb57cb15b420d2b7e2d8a52c6 | [
"MIT"
] | null | null | null | #include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#include "containerfactory.h"
template<class floating>
AlgebraicVector<floating> operator* (const floating scalar, const AlgebraicVector<floating> &B)
{
AlgebraicVector<floating> tmp(B);
tmp.scale(scalar);
... | 32.717213 | 156 | 0.705624 | [
"object",
"vector"
] |
b60a3f1534f0db01feb458695a4394f2f095c8ae | 1,872 | hpp | C++ | rpi_gpio.hpp | markondej/rpi_gpio | 6a665e7a4eac59648e8bd87fb580c62b614fa11f | [
"BSD-3-Clause"
] | 1 | 2022-02-01T18:17:31.000Z | 2022-02-01T18:17:31.000Z | rpi_gpio.hpp | markondej/rpi_gpio | 6a665e7a4eac59648e8bd87fb580c62b614fa11f | [
"BSD-3-Clause"
] | null | null | null | rpi_gpio.hpp | markondej/rpi_gpio | 6a665e7a4eac59648e8bd87fb580c62b614fa11f | [
"BSD-3-Clause"
] | 1 | 2022-02-01T11:57:39.000Z | 2022-02-01T11:57:39.000Z | #pragma once
#include <vector>
#include <thread>
#include <mutex>
#include <atomic>
#define GPIO_COUNT 28
#define GPIO0 0
#define GPIO1 1
#define GPIO2 2
#define GPIO3 3
#define GPIO4 4
#define GPIO5 5
#define GPIO6 6
#define GPIO7 7
#define GPIO8 8
#define GPIO9 9
#define GPIO10 10
#define GPIO11 11
#define GPIO12 ... | 24.631579 | 99 | 0.63141 | [
"vector"
] |
b60d8b5b6e1a5e56698a932829e5b3069b2d9138 | 2,607 | cpp | C++ | LeetCode/Problems/Algorithms/#720_LongestWordInDictionary_sol1_64ms_29MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | 1 | 2022-01-26T14:50:07.000Z | 2022-01-26T14:50:07.000Z | LeetCode/Problems/Algorithms/#720_LongestWordInDictionary_sol1_64ms_29MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | LeetCode/Problems/Algorithms/#720_LongestWordInDictionary_sol1_64ms_29MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | class TrieNode{
public:
static const int ALPHABET_SIZE = 26;
static const char FIRST_LETTER = 'a';
bool is_terminal_node;
vector<TrieNode*> children;
int max_len;
int max_len_edge_id;
TrieNode(bool is_terminal_node = false){
this->is_terminal_node = is_terminal_node;
... | 36.208333 | 125 | 0.529344 | [
"vector"
] |
b6106c17cd083ebc922fb1b8f1b790441a0794a0 | 61,563 | cc | C++ | NodeModule.cc | T-amairi/IOTA | f7a212be681a002413219adca56f69bcdfbe8d17 | [
"MIT"
] | 3 | 2021-06-28T19:42:11.000Z | 2021-08-11T08:23:10.000Z | NodeModule.cc | T-amairi/IOTA | f7a212be681a002413219adca56f69bcdfbe8d17 | [
"MIT"
] | null | null | null | NodeModule.cc | T-amairi/IOTA | f7a212be681a002413219adca56f69bcdfbe8d17 | [
"MIT"
] | 1 | 2022-03-21T14:12:07.000Z | 2022-03-21T14:12:07.000Z | #include "NodeModule.h"
enum MessageType{SETTING,ISSUE,POW,UPDATE,ParasiteChainAttack,SplittingAttack,InitializationSplittingAttack,MaintainBalance};
Define_Module(NodeModule);
std::vector<int> NodeModule::readCSV(bool IfExp)
{
auto env = cSimulation::getActiveEnvir();
auto currentRun = env->getCon... | 26.376607 | 211 | 0.455809 | [
"vector"
] |
b611f2fd63dff72401f101d49f4937787186a8d4 | 1,213 | hpp | C++ | src/lib/view/hpp/menuVendedor.hpp | iagoizi/poo-petshop-cpp | 1eb9f6858ed6f55f3c1d07024b18ef67b0533358 | [
"MIT"
] | null | null | null | src/lib/view/hpp/menuVendedor.hpp | iagoizi/poo-petshop-cpp | 1eb9f6858ed6f55f3c1d07024b18ef67b0533358 | [
"MIT"
] | null | null | null | src/lib/view/hpp/menuVendedor.hpp | iagoizi/poo-petshop-cpp | 1eb9f6858ed6f55f3c1d07024b18ef67b0533358 | [
"MIT"
] | null | null | null | #ifndef MENU_VENDEDOR_HPP
#define MENU_VENDEDOR_HPP
#include "../../model/hpp/lib.hpp"
#include "../../model/hpp/petshop.hpp"
#include "../../model/hpp/usuario.hpp"
#include "../../model/hpp/vendedor.hpp"
#include "menu.hpp"
#define CADASTRAR_CLIENTE 1
#define VENDER_PRODUTO 2
#define VENDER_SERVICO 3
u... | 32.783784 | 114 | 0.713932 | [
"model"
] |
b6251ce035c3f2efa4cccc264d310f128c3b7da5 | 1,081 | cpp | C++ | src/scenes/game/ui/sidemenu.cpp | Blackhawk-TA/32blit-rpg | eaad46e1eeab6765a6b8f6e31a2d196aeeaba6f9 | [
"MIT"
] | null | null | null | src/scenes/game/ui/sidemenu.cpp | Blackhawk-TA/32blit-rpg | eaad46e1eeab6765a6b8f6e31a2d196aeeaba6f9 | [
"MIT"
] | null | null | null | src/scenes/game/ui/sidemenu.cpp | Blackhawk-TA/32blit-rpg | eaad46e1eeab6765a6b8f6e31a2d196aeeaba6f9 | [
"MIT"
] | null | null | null | //
// Created by daniel on 21.09.21.
//
#include "sidemenu.hpp"
#include "overlay.hpp"
#include "../../../utils/saves/savegame.hpp"
namespace game::sidemenu {
Listbox *control;
bool open_state = false;
void init(uint8_t save_id) {
std::vector<Listbox::Item> items = {
listbox_item::create_sidemenu_item(listbo... | 18.637931 | 79 | 0.689177 | [
"vector"
] |
b625e1d84a162f033b5676bcd37ea288dd01dfb2 | 360 | cpp | C++ | sdl/include/source/Player.cpp | numfo/tryme | 596b48160cc1c2377bee05675570f62df4f37d9d | [
"MIT"
] | null | null | null | sdl/include/source/Player.cpp | numfo/tryme | 596b48160cc1c2377bee05675570f62df4f37d9d | [
"MIT"
] | null | null | null | sdl/include/source/Player.cpp | numfo/tryme | 596b48160cc1c2377bee05675570f62df4f37d9d | [
"MIT"
] | null | null | null | #include "../header/Player.h"
Player::Player(const LoaderParams* pParams):SDLGameObject(pParams){
}
void Player::draw(){
SDLGameObject::draw();
}
void Player::update(){
m_currentFrame = int (((SDL_GetTicks()/100)%6));
m_acceleration.setX(.01);
SDLGameObject::update();
}
void Player::clean(){
... | 20 | 67 | 0.661111 | [
"object"
] |
b629c84fb5474fbb8377e31708e6cad70e4f7e57 | 578 | cpp | C++ | Graph/AP.cpp | ISeaTeL/Codebook | 2c137377d39085cb642294e5481bff039a074985 | [
"MIT"
] | null | null | null | Graph/AP.cpp | ISeaTeL/Codebook | 2c137377d39085cb642294e5481bff039a074985 | [
"MIT"
] | null | null | null | Graph/AP.cpp | ISeaTeL/Codebook | 2c137377d39085cb642294e5481bff039a074985 | [
"MIT"
] | 1 | 2021-01-26T05:02:48.000Z | 2021-01-26T05:02:48.000Z | #define MAXN 10001
vector<int> v[MAXN]; //adjacency list
bool rec[MAXN];
int clk[MAXN], low[MAXN], time, ct; //ct: the # of AP
void dfs(int x, int parent){
rec[x] = 1;
clk[x] = low[x] = ++time;
int child = 0;
bool ap = 0;
for(int i = 0; i < v[x].size(); i++){
int y = v[x][i];
if(y != p){
if(!rec[y]){
... | 19.931034 | 53 | 0.475779 | [
"vector"
] |
b62e7d2426e93087eca6ced4eddc28912c99ee68 | 1,835 | cpp | C++ | src/eight_queens.cpp | olafdietsche/algorithms | 0844c19423227cfea330c0301928ffdc28aa99e0 | [
"MIT"
] | null | null | null | src/eight_queens.cpp | olafdietsche/algorithms | 0844c19423227cfea330c0301928ffdc28aa99e0 | [
"MIT"
] | null | null | null | src/eight_queens.cpp | olafdietsche/algorithms | 0844c19423227cfea330c0301928ffdc28aa99e0 | [
"MIT"
] | null | null | null | #include "eight_queens.h"
board::board(int size)
: board_size(size),
a(board_size, std::vector<bool>(board_size, false))
{
}
bool board::valid(int row, int col) const
{
return row_empty(row) && column_empty(col) && diagonals_empty(row, col);
}
bool board::row_empty(int row) const
{
for (int col = 0; col < boar... | 16.238938 | 73 | 0.525886 | [
"vector"
] |
ac072bc44399f8ed50ebca5c617af9fb5d8bc6da | 890 | hpp | C++ | Constants/include/ParseParams.hpp | msolanik/Geliosphere | bad72f7869e8eb30fe54344ad374f2534a7f45a5 | [
"BSD-3-Clause"
] | null | null | null | Constants/include/ParseParams.hpp | msolanik/Geliosphere | bad72f7869e8eb30fe54344ad374f2534a7f45a5 | [
"BSD-3-Clause"
] | null | null | null | Constants/include/ParseParams.hpp | msolanik/Geliosphere | bad72f7869e8eb30fe54344ad374f2534a7f45a5 | [
"BSD-3-Clause"
] | null | null | null | /**
* @file ParseParams.hpp
* @author Michal Solanik
* @brief Parser of arguements from CLI
* @version 0.1
* @date 2021-07-13
*
* @copyright Copyright (c) 2021
*
*/
#ifndef PARSE_PARAMS_H
#define PARSE_PARAMS_H
#include <string>
#include "ParamsCarrier.hpp"
/**
* @brief ParseParams is responsible for par... | 17.45098 | 68 | 0.67191 | [
"object"
] |
ac19af8bcaf017a31096701c0019bc8d80fbfd17 | 970 | cpp | C++ | src/Pineapple/SurfaceColorIntegrator.cpp | ScottSWu/scwu-renderer | 0136d732fdb1a6d40e46942d74f1edcbc66dc283 | [
"MIT"
] | 3 | 2016-02-23T15:41:52.000Z | 2017-12-27T17:57:10.000Z | src/Pineapple/SurfaceColorIntegrator.cpp | ScottSWu/scwu-renderer | 0136d732fdb1a6d40e46942d74f1edcbc66dc283 | [
"MIT"
] | null | null | null | src/Pineapple/SurfaceColorIntegrator.cpp | ScottSWu/scwu-renderer | 0136d732fdb1a6d40e46942d74f1edcbc66dc283 | [
"MIT"
] | null | null | null | #include "Pineapple/Integrator/SurfaceColorIntegrator.hpp"
#include "Pineapple/Intersection.hpp"
#include "Pineapple/Scene.hpp"
#include "Pineapple/Ray.hpp"
SurfaceColorIntegrator::SurfaceColorIntegrator() :
SurfaceIntegrator() {
}
SurfaceColorIntegrator::~SurfaceColorIntegrator() {
}
glm::vec4 SurfaceCol... | 24.25 | 73 | 0.629897 | [
"vector"
] |
ac1baabad10fd3aedb3ded62d71746321cfa72a1 | 1,145 | cpp | C++ | leetcode.com/Weekly Contest 240/3/main.cpp | sky-bro/AC | 29bfa3f13994612887e18065fa6e854b9a29633d | [
"MIT"
] | 1 | 2020-08-20T11:02:49.000Z | 2020-08-20T11:02:49.000Z | leetcode.com/Weekly Contest 240/3/main.cpp | sky-bro/AC | 29bfa3f13994612887e18065fa6e854b9a29633d | [
"MIT"
] | null | null | null | leetcode.com/Weekly Contest 240/3/main.cpp | sky-bro/AC | 29bfa3f13994612887e18065fa6e854b9a29633d | [
"MIT"
] | 1 | 2022-01-01T23:23:13.000Z | 2022-01-01T23:23:13.000Z | #include <bits/stdc++.h>
using namespace std;
int __fastio = []() { ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); cin.tie(nullptr); return 0; } ();
const int MOD = 1e9 + 7;
typedef unsigned long long ull;
typedef long long ll;
class Solution {
public:
int maxSumMinProduct(vector<int>& A) {
... | 28.625 | 124 | 0.426201 | [
"vector"
] |
ac1d372495a828ffdef4d3bc9adff48454e65c2e | 5,222 | cpp | C++ | examples/rocketwar/src/game/basicState.cpp | AlexAUT/rocketWar | edea1c703755e198b1ad8909c82e5d8d56c443ef | [
"MIT"
] | null | null | null | examples/rocketwar/src/game/basicState.cpp | AlexAUT/rocketWar | edea1c703755e198b1ad8909c82e5d8d56c443ef | [
"MIT"
] | null | null | null | examples/rocketwar/src/game/basicState.cpp | AlexAUT/rocketWar | edea1c703755e198b1ad8909c82e5d8d56c443ef | [
"MIT"
] | null | null | null | #include "basicState.hpp"
#include <aw/engine/engine.hpp>
#include <aw/engine/resources/loaders/ofbxLoader.hpp>
#include <aw/graphics/core/shaderStage.hpp>
#include <aw/opengl/opengl.hpp>
#include <aw/util/colors.hpp>
#include <glm/gtx/string_cast.hpp>
#include "logApp.hpp"
BasicState::BasicState(aw::engine::Engine... | 27.776596 | 93 | 0.673114 | [
"mesh",
"render",
"transform"
] |
ac259165fc698f4966bd595f32b85173a05cc1cb | 1,198 | cpp | C++ | aws-cpp-sdk-opsworks/source/model/UpdateRdsDbInstanceRequest.cpp | lintonv/aws-sdk-cpp | 15e19c265ffce19d2046b18aa1b7307fc5377e58 | [
"Apache-2.0"
] | 1 | 2022-02-12T08:09:30.000Z | 2022-02-12T08:09:30.000Z | aws-cpp-sdk-opsworks/source/model/UpdateRdsDbInstanceRequest.cpp | lintonv/aws-sdk-cpp | 15e19c265ffce19d2046b18aa1b7307fc5377e58 | [
"Apache-2.0"
] | 1 | 2022-01-03T23:59:37.000Z | 2022-01-03T23:59:37.000Z | aws-cpp-sdk-opsworks/source/model/UpdateRdsDbInstanceRequest.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2022-03-23T15:17:18.000Z | 2022-03-23T15:17:18.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/opsworks/model/UpdateRdsDbInstanceRequest.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::OpsWorks::Model;
using namespace Aws::Utils::Json;
... | 20.655172 | 102 | 0.757095 | [
"model"
] |
ac291afa10167875f6e0606ca4f4fcb298661a19 | 5,678 | hpp | C++ | src/core/cpp/include/io/ConfigReader.hpp | railtoolkit/OpenLinTim | 27eba8b6038946ce162e9f7bbc0bd23045029d51 | [
"MIT"
] | null | null | null | src/core/cpp/include/io/ConfigReader.hpp | railtoolkit/OpenLinTim | 27eba8b6038946ce162e9f7bbc0bd23045029d51 | [
"MIT"
] | null | null | null | src/core/cpp/include/io/ConfigReader.hpp | railtoolkit/OpenLinTim | 27eba8b6038946ce162e9f7bbc0bd23045029d51 | [
"MIT"
] | null | null | null | /**
* A reader for config files. To use, initialize a new ConfigReader and use it to call
* {@link CsvReader#readCsv(std::string, java.util.function.BiConsumer)} with the config file to read.
*/
#ifndef CONFIGREADER_HPP
#define CONFIGREADER_HPP
#include "../exception/exceptions.hpp"
#include "../io/CsvReader.hpp"... | 38.107383 | 159 | 0.615005 | [
"vector"
] |
ac29cbaf37fd1cebf27394099fb2f531491ed474 | 2,059 | hpp | C++ | tket/src/Mapping/include/Mapping/RoutingMethod.hpp | CQCL/tket | 3f3d7c24d9a6c9cfd85966c13dcccc8a13f92adb | [
"Apache-2.0"
] | 104 | 2021-09-15T08:16:25.000Z | 2022-03-28T21:19:00.000Z | tket/src/Mapping/include/Mapping/RoutingMethod.hpp | CQCL/tket | 3f3d7c24d9a6c9cfd85966c13dcccc8a13f92adb | [
"Apache-2.0"
] | 109 | 2021-09-16T17:14:22.000Z | 2022-03-29T06:48:40.000Z | tket/src/Mapping/include/Mapping/RoutingMethod.hpp | CQCL/tket | 3f3d7c24d9a6c9cfd85966c13dcccc8a13f92adb | [
"Apache-2.0"
] | 8 | 2021-10-02T13:47:34.000Z | 2022-03-17T15:36:56.000Z | // Copyright 2019-2022 Cambridge Quantum Computing
//
// 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... | 34.316667 | 80 | 0.735794 | [
"object"
] |
ac300147e4e6debd6f0a2c9860b54bc90c586f81 | 1,653 | cpp | C++ | LeetCode/ThousandTwo/1224-max_equal_freq.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandTwo/1224-max_equal_freq.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandTwo/1224-max_equal_freq.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | #include "leetcode.hpp"
/* 1224. 最大相等频率
给出一个正整数数组 nums，请你帮忙从该数组中找出能满足下面要求的 最长 前缀，并返回其长度：
从前缀中 删除一个 元素后，使得所剩下的每个数字的出现次数相同。
如果删除这个元素后没有剩余元素存在，仍可认为每个数字都具有相同的出现次数（也就是 0 次）。
示例 1：
输入：nums = [2,2,1,1,5,3,3,5]
输出：7
解释：对于长度为 7 的子数组 [2,2,1,1,5,3,3]，如果我们从中删去 nums[4]=5，就可以得到 [2,2,1,1,3,3]，里面每个数字都出现了两次。
示例 2：
输入：nums = [1,1... | 19.678571 | 122 | 0.534785 | [
"vector"
] |
ac31adc2528365d0f39641a0d5b90401aa514de8 | 1,913 | hpp | C++ | src/jointentropyseedselector.hpp | LaoZZZZZ/bartender-1.1 | ddfb2e52bdf92258dd837ab8ee34306e9fb45b81 | [
"MIT"
] | 22 | 2016-08-11T06:16:25.000Z | 2022-02-22T00:06:59.000Z | src/jointentropyseedselector.hpp | LaoZZZZZ/bartender-1.1 | ddfb2e52bdf92258dd837ab8ee34306e9fb45b81 | [
"MIT"
] | 9 | 2016-12-08T12:42:38.000Z | 2021-12-28T20:12:15.000Z | src/jointentropyseedselector.hpp | LaoZZZZZ/bartender-1.1 | ddfb2e52bdf92258dd837ab8ee34306e9fb45b81 | [
"MIT"
] | 8 | 2017-06-26T13:15:06.000Z | 2021-11-12T18:39:54.000Z | //
// jointentropyseedselector.hpp
// barcode_project
//
// Created by luzhao on 4/27/16.
// Copyright © 2016 luzhao. All rights reserved.
//
#ifndef jointentropyseedselector_hpp
#define jointentropyseedselector_hpp
#include "bpfrequencytracker.hpp"
#include "jointentropy.hpp"
#include "seedpositionpool.hpp"
#in... | 32.982759 | 96 | 0.681129 | [
"vector"
] |
ac46a847a57b53f6e463d90a3ee51726fcecb063 | 2,130 | hpp | C++ | Entity/Enemies/EnemyTank.hpp | JTuthill01/Hell-on-Treads | a89c939c3f1d0bd47d075d5b02d589637548ca31 | [
"MIT"
] | null | null | null | Entity/Enemies/EnemyTank.hpp | JTuthill01/Hell-on-Treads | a89c939c3f1d0bd47d075d5b02d589637548ca31 | [
"MIT"
] | null | null | null | Entity/Enemies/EnemyTank.hpp | JTuthill01/Hell-on-Treads | a89c939c3f1d0bd47d075d5b02d589637548ca31 | [
"MIT"
] | null | null | null | #pragma once
#include <Entity/Player/Player.hpp>
#include <Entity/Entity.hpp>
class EnemyTank : Entity
{
public:
EnemyTank();
~EnemyTank();
const int enemyDealDamage() const;
void removeEnemyTankProjectile(unsigned index);
void takeDamage(int damage);
void render(sf::RenderTarget& target);
void u... | 29.178082 | 99 | 0.752113 | [
"render",
"vector"
] |
ac5099d6ada7b8631b340008f80bd58b0490a571 | 1,145 | cc | C++ | cpptest/test4.cc | wshonline/test | 2eed4c08798f7a68b139295f080a8df31c55fac4 | [
"MIT"
] | null | null | null | cpptest/test4.cc | wshonline/test | 2eed4c08798f7a68b139295f080a8df31c55fac4 | [
"MIT"
] | null | null | null | cpptest/test4.cc | wshonline/test | 2eed4c08798f7a68b139295f080a8df31c55fac4 | [
"MIT"
] | null | null | null | #include <vector>
using namespace std;
int totalFruit(vector<int>& fruits) {
// 滑动窗口
int max_len = 0;
int cur_len = 0;
vector<int> per_type_cnt(fruits.size(), 0);
int type_cnt = 0;
int i = 0;
for (int j = 0; j < fruits.size(); j++) {
if (per_type_cnt[fruits[j]] > 0) {
p... | 27.926829 | 65 | 0.466376 | [
"vector"
] |
ac5ef5718892478dbcf8bd952aba7f4af66633c0 | 2,409 | cpp | C++ | Source/RawSpeed/common/TableLookUp.cpp | FSchiltz/RawParser | 0f6dc895a0023298e681cc68292565f30a138419 | [
"MIT"
] | 11 | 2018-02-03T14:59:06.000Z | 2020-11-23T23:39:06.000Z | Source/RawSpeed/common/TableLookUp.cpp | FSchiltz/RawParser | 0f6dc895a0023298e681cc68292565f30a138419 | [
"MIT"
] | null | null | null | Source/RawSpeed/common/TableLookUp.cpp | FSchiltz/RawParser | 0f6dc895a0023298e681cc68292565f30a138419 | [
"MIT"
] | 5 | 2019-04-09T09:37:50.000Z | 2021-09-26T20:11:54.000Z | /*
RawSpeed - RAW file decoder.
Copyright (C) 2009-2014 Klaus Post
Copyright (C) 2017 Roman Lebedev
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 Foundation; either
version ... | 30.493671 | 80 | 0.644251 | [
"vector"
] |
ac60c9e30c0c7be4c3036733f7ef7c7fc576abe6 | 10,344 | cpp | C++ | source/ff.dx11/source/object_cache.cpp | spadapet/ff_game_library | f1bf00f90adde66c2c2aa35b109fe61b8d2c6352 | [
"MIT"
] | null | null | null | source/ff.dx11/source/object_cache.cpp | spadapet/ff_game_library | f1bf00f90adde66c2c2aa35b109fe61b8d2c6352 | [
"MIT"
] | null | null | null | source/ff.dx11/source/object_cache.cpp | spadapet/ff_game_library | f1bf00f90adde66c2c2aa35b109fe61b8d2c6352 | [
"MIT"
] | null | null | null | #include "pch.h"
#include "operators.h"
#include "object_cache.h"
size_t ff::dx11::object_cache::hash_data::operator()(const std::shared_ptr<ff::data_base>& value) const
{
return (value && value->size()) ? ff::stable_hash_bytes(value->data(), value->size()) : 0;
}
bool ff::dx11::object_cache::equals_data::operato... | 35.546392 | 240 | 0.685712 | [
"object"
] |
ac67c437c8ff1ff79fcdff1c2d8db61e0e83b59f | 1,038 | cpp | C++ | tournaments/superResources/superResources.cpp | gurfinkel/codeSignal | 114817947ac6311bd53a48f0f0e17c0614bf7911 | [
"MIT"
] | 5 | 2020-02-06T09:51:22.000Z | 2021-03-19T00:18:44.000Z | tournaments/superResources/superResources.cpp | gurfinkel/codeSignal | 114817947ac6311bd53a48f0f0e17c0614bf7911 | [
"MIT"
] | null | null | null | tournaments/superResources/superResources.cpp | gurfinkel/codeSignal | 114817947ac6311bd53a48f0f0e17c0614bf7911 | [
"MIT"
] | 3 | 2019-09-27T13:06:21.000Z | 2021-04-20T23:13:17.000Z | typedef std::vector<std::string> elemT;
typedef std::vector<elemT> listT;
listT superResources(listT requests) {
struct Helper {
bool le(std::string const & a, std::string const & b) {
return std::stoi(a) <= std::stoi(b);
}
};
Helper h;
if (requests.size() < 2) {
return requests;
}
listT... | 24.139535 | 70 | 0.540462 | [
"vector"
] |
ac696c3498db579976213405a523f55424968228 | 18,541 | cpp | C++ | games/pacman/Pacman.cpp | Sinjide/cpp_arcade | c6a9dc54ed10ea5300d7bf972c5ee2bee2e58116 | [
"MIT"
] | null | null | null | games/pacman/Pacman.cpp | Sinjide/cpp_arcade | c6a9dc54ed10ea5300d7bf972c5ee2bee2e58116 | [
"MIT"
] | null | null | null | games/pacman/Pacman.cpp | Sinjide/cpp_arcade | c6a9dc54ed10ea5300d7bf972c5ee2bee2e58116 | [
"MIT"
] | null | null | null | //
//man.cpp for pacman in /home/nicolas/arcade/cpp_arcade/libs/games
//
// Made by Nicolas Guillon
// Login <nicolas@epitech.net>
//
// Started on Thu Mar 16 10:32:07 2017 Nicolas Guillon
// Last update Sun Apr 9 18:43:17 2017 Jerome Dang
//
#include <stdlib.h>
#include <ctime>
#include <vector>
#include <map>
... | 40.394336 | 558 | 0.553961 | [
"vector"
] |
ac6c5dbcc353c16ce6f4a8f1f161e8675f816a7b | 663 | cpp | C++ | acwing/1524.cpp | zyzisyz/OJ | 55221a55515231182b6bd133edbdb55501a565fc | [
"Apache-2.0"
] | null | null | null | acwing/1524.cpp | zyzisyz/OJ | 55221a55515231182b6bd133edbdb55501a565fc | [
"Apache-2.0"
] | null | null | null | acwing/1524.cpp | zyzisyz/OJ | 55221a55515231182b6bd133edbdb55501a565fc | [
"Apache-2.0"
] | 2 | 2020-01-01T13:49:08.000Z | 2021-03-06T06:54:26.000Z | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
string str;
int main(void){
getline(cin, str);
int n = str.size();
string re_str = str;
reverse(re_str.begin(), re_str.end());
if(str==re_str){
cout<<n<<endl;
return 0;
}
vector<vector<int>> f(n, vector<int>(n,... | 14.733333 | 45 | 0.524887 | [
"vector"
] |
ac732b1ee329cd7dfe19f4e3604c6ac76e3a1308 | 7,301 | cc | C++ | src/util/str_util.cc | LeeOHzzZ/ILAng | 24225294ac133e5d08af5037350ede8f78610c45 | [
"MIT"
] | 21 | 2019-03-18T18:35:35.000Z | 2022-01-27T06:57:47.000Z | src/util/str_util.cc | LeeOHzzZ/ILAng | 24225294ac133e5d08af5037350ede8f78610c45 | [
"MIT"
] | 105 | 2019-01-19T07:09:25.000Z | 2021-01-11T20:06:24.000Z | src/util/str_util.cc | LeeOHzzZ/ILAng | 24225294ac133e5d08af5037350ede8f78610c45 | [
"MIT"
] | 7 | 2019-01-28T19:48:09.000Z | 2020-11-05T14:42:05.000Z | /// \file
/// Source for some utility functions for string formating.
#include <ilang/util/str_util.h>
#include <regex>
#include <sstream>
#include <type_traits>
#include <ilang/util/log.h>
#if defined(_WIN32) || defined(_WIN64)
#include <locale>
#endif
namespace ilang {
// it is of course possible to update it w... | 28.189189 | 80 | 0.61019 | [
"vector",
"transform"
] |
ac7e068b6a72726801c063de6b950ef62cd43bac | 6,757 | cpp | C++ | legacy_firmware/firmware/steval_gps_waves_drifter/params.cpp | jerabaul29/OpenMetBuoy-v2021a | 8fa4a3a9de82c8b82ecf290ccf57303cad667041 | [
"MIT"
] | 7 | 2021-12-07T18:37:21.000Z | 2022-03-28T17:26:50.000Z | legacy_firmware/firmware/standard_gps_waves_thermistors_drifter/params.cpp | jerabaul29/OpenMetBuoy-v2021a | 8fa4a3a9de82c8b82ecf290ccf57303cad667041 | [
"MIT"
] | 32 | 2021-12-09T08:28:20.000Z | 2022-03-31T21:16:01.000Z | legacy_firmware/firmware/two_ways_gps_waves_drifter/params.cpp | jerabaul29/OpenMetBuoy-v2021a | 8fa4a3a9de82c8b82ecf290ccf57303cad667041 | [
"MIT"
] | null | null | null | #include "params.h"
void print_params(void){
Serial.print(F("baudrate_debug_serial : ")); Serial.println(baudrate_debug_serial );
Serial.print(F("i2c_port_number: ")); Serial.println(i2c_port_number );
Serial.println(F("----- TEST_MODE -----"));
Serial.print(F("DEPLOYMENT_MODE: ")); Serial.println(DEP... | 69.659794 | 193 | 0.753737 | [
"transform"
] |
ac85789747c4710b621584862278b29abae3d679 | 922 | cpp | C++ | AAD/Aufgabe4.2/myClass.cpp | Solaflex/hf-ict | 2ebed689087407019b540df07612525e8b8d6821 | [
"MIT"
] | null | null | null | AAD/Aufgabe4.2/myClass.cpp | Solaflex/hf-ict | 2ebed689087407019b540df07612525e8b8d6821 | [
"MIT"
] | null | null | null | AAD/Aufgabe4.2/myClass.cpp | Solaflex/hf-ict | 2ebed689087407019b540df07612525e8b8d6821 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <vector>
#include <C:\git\RunProject\RunProject\myHeader.h>
using namespace std;
Result::Result() {
cout << "Konstruktor" << endl;
}
Result ArrayUtil::analyseArray(vector<int> input) {
Result ReturnResult;
int PositiveCounter = 0, ZeroCounter = 0, NegativeCounter =... | 20.954545 | 81 | 0.682213 | [
"vector"
] |
12be8621bd6461b08ed9f047e15252f1ea6222c4 | 1,342 | cpp | C++ | algorithms/graph theory/PrimsMST.cpp | HannoFlohr/hackerrank | 9644c78ce05a6b1bc5d8f542966781d53e5366e3 | [
"MIT"
] | null | null | null | algorithms/graph theory/PrimsMST.cpp | HannoFlohr/hackerrank | 9644c78ce05a6b1bc5d8f542966781d53e5366e3 | [
"MIT"
] | null | null | null | algorithms/graph theory/PrimsMST.cpp | HannoFlohr/hackerrank | 9644c78ce05a6b1bc5d8f542966781d53e5366e3 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
struct Less {
bool operator()(const pair<int,int> &p1, const pair<int,int> &p2) const {
return p1.second > p2.second;
}
};
int prims(const int &n, vector<vector<int>> &edges, int start) {
vector<vector<pair<int,int>>> e( n+1 );
for(int i=0; i<edge... | 23.54386 | 77 | 0.483607 | [
"vector"
] |
12c84cac26a1733bf8f4d24773139945b9e2e026 | 24,342 | cpp | C++ | src/vscp/common/udpsrv.cpp | nanocortex/vscp | 0b1a51a35a886921179a8112c592547f84c9771a | [
"CC-BY-3.0"
] | null | null | null | src/vscp/common/udpsrv.cpp | nanocortex/vscp | 0b1a51a35a886921179a8112c592547f84c9771a | [
"CC-BY-3.0"
] | null | null | null | src/vscp/common/udpsrv.cpp | nanocortex/vscp | 0b1a51a35a886921179a8112c592547f84c9771a | [
"CC-BY-3.0"
] | null | null | null | // udpsrv.cpp
//
// This file is part of the VSCP (https://www.vscp.org)
//
// The MIT License (MIT)
//
// Copyright © 2000-2020 Ake Hedman, Grodans Paradis AB
// <info@grodansparadis.com>
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation... | 30.542033 | 81 | 0.569386 | [
"object",
"vector"
] |
12d615ce42529f6aa6f4433fe00e6208a2503d96 | 530 | cpp | C++ | src/semana-9/N-Repeated-Element-in-Size-2N-Array.cpp | RicardoLopes1/desafios-prog-2021-1 | 1e698f0696b5636fa5608d669dd58d170f8049ea | [
"MIT"
] | null | null | null | src/semana-9/N-Repeated-Element-in-Size-2N-Array.cpp | RicardoLopes1/desafios-prog-2021-1 | 1e698f0696b5636fa5608d669dd58d170f8049ea | [
"MIT"
] | null | null | null | src/semana-9/N-Repeated-Element-in-Size-2N-Array.cpp | RicardoLopes1/desafios-prog-2021-1 | 1e698f0696b5636fa5608d669dd58d170f8049ea | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
// https://leetcode.com/problems/n-repeated-element-in-size-2n-array/
// 961. N-Repeated Element in Size 2N Array
class Solution {
public:
int repeatedNTimes(vector<int>& nums) {
map <int, int> freq;
int nsize = nums.size();
for(auto n :... | 21.2 | 69 | 0.496226 | [
"vector"
] |
12dc2b5891daa3819a0ba20a66e664618f14c91e | 669 | hpp | C++ | test/pch.hpp | severalgh/SimpleOpenSSL | a915c31a3e2a67e02ee3103f44f891fa5971a783 | [
"MIT"
] | 4 | 2021-01-19T00:48:02.000Z | 2021-06-21T18:21:08.000Z | test/pch.hpp | severalgh/SimpleOpenSSL | a915c31a3e2a67e02ee3103f44f891fa5971a783 | [
"MIT"
] | null | null | null | test/pch.hpp | severalgh/SimpleOpenSSL | a915c31a3e2a67e02ee3103f44f891fa5971a783 | [
"MIT"
] | 1 | 2020-02-17T16:03:26.000Z | 2020-02-17T16:03:26.000Z | #ifndef PDY_TEST_PCH_H_
#define PDY_TEST_PCH_H_
#include <gtest/gtest.h>
#include <gmock/gmock.h>
// openssl
#include <openssl/asn1.h>
#include <openssl/ec.h>
#include <openssl/evp.h>
#include <openssl/err.h>
#include <openssl/bio.h>
#include <openssl/bn.h>
#include <openssl/x509.h>
#include <openssl/x509v3.h>
#inclu... | 18.081081 | 27 | 0.726457 | [
"vector"
] |
12de63a8a178669956354961d66447ea0b0c1d6f | 18,751 | cpp | C++ | mysql-server/storage/ndb/test/run-test/process_management.cpp | silenc3502/MYSQL-Arch-Doc-Summary | fcc6bb65f72a385b9f56debc9b2c00cee5914bae | [
"MIT"
] | null | null | null | mysql-server/storage/ndb/test/run-test/process_management.cpp | silenc3502/MYSQL-Arch-Doc-Summary | fcc6bb65f72a385b9f56debc9b2c00cee5914bae | [
"MIT"
] | null | null | null | mysql-server/storage/ndb/test/run-test/process_management.cpp | silenc3502/MYSQL-Arch-Doc-Summary | fcc6bb65f72a385b9f56debc9b2c00cee5914bae | [
"MIT"
] | null | null | null | /*
Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2.0,
as published by the Free Software Foundation.
This program is also distributed with certain s... | 29.071318 | 80 | 0.628073 | [
"vector"
] |
12de7136aae28842e7c207b94202f179fc57dfe9 | 4,521 | cpp | C++ | tests/geometry/Plane_Inter.cpp | gaelh7/Graphics | 48041204c39c3d52bbb470581683c850b000af68 | [
"MIT"
] | null | null | null | tests/geometry/Plane_Inter.cpp | gaelh7/Graphics | 48041204c39c3d52bbb470581683c850b000af68 | [
"MIT"
] | null | null | null | tests/geometry/Plane_Inter.cpp | gaelh7/Graphics | 48041204c39c3d52bbb470581683c850b000af68 | [
"MIT"
] | null | null | null | #include <gtest/gtest.h>
#include "Graphics/geometry.hpp"
struct PlaneDistTest: public ::testing::Test {
gmh::Plane obj;
virtual void SetUp() override {
obj = gmh::Plane(glm::vec3(0, -8, 0), glm::vec3(0, 1, 0), glm::vec3(0, 0, 1));
}
template<typename T>
inline void checkNoInter(const T& ... | 50.233333 | 186 | 0.564477 | [
"geometry"
] |
12e0c7791b692a611555f38fc29065a9758303be | 6,332 | cpp | C++ | prj/TileBasedRenderer/SoftRaster/Raster.cpp | vicutrinu/pragma-studios | 181fd14d072ccbb169fa786648dd942a3195d65a | [
"MIT"
] | null | null | null | prj/TileBasedRenderer/SoftRaster/Raster.cpp | vicutrinu/pragma-studios | 181fd14d072ccbb169fa786648dd942a3195d65a | [
"MIT"
] | null | null | null | prj/TileBasedRenderer/SoftRaster/Raster.cpp | vicutrinu/pragma-studios | 181fd14d072ccbb169fa786648dd942a3195d65a | [
"MIT"
] | null | null | null | /**
* @file Raster.cpp
* @author Victor Soria
*
* @brief Rasterization general functions
*/
#include "Raster.h"
#include <pragma/graphics/types.h>
#include <pragma/geometry/functions.h>
#include <pragma/math/functions.h>
#include <stdio.h>
#include <memory.h>
#include <assert.h>
namespace pragma { namespace Ra... | 29.7277 | 149 | 0.699305 | [
"geometry",
"render"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.