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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7247ba28ec3c7b4fa40391a4790b9d2bf105bc9a | 5,851 | cpp | C++ | server.cpp | artistic709/websocket_practice | ef8aee45dba2784f6a789f5d6bc318db09decd3d | [
"MIT"
] | null | null | null | server.cpp | artistic709/websocket_practice | ef8aee45dba2784f6a789f5d6bc318db09decd3d | [
"MIT"
] | null | null | null | server.cpp | artistic709/websocket_practice | ef8aee45dba2784f6a789f5d6bc318db09decd3d | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <cstring>
#include <string>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
#include <arpa/inet.h>
#include <iostream>
#include <pthread.h>
#include <vector>
#define numofthread 8
using namespace std;
//userd... | 26.595455 | 88 | 0.473765 | [
"vector"
] |
7257aa95bffb7e5a30f5d6136a6ebc2916e7fc84 | 2,548 | cxx | C++ | ValueAddedTax.cxx | jackytck/topcoder | 5a83ce478d4f05aeb97062f8a30aa1d6fbc969d3 | [
"MIT"
] | null | null | null | ValueAddedTax.cxx | jackytck/topcoder | 5a83ce478d4f05aeb97062f8a30aa1d6fbc969d3 | [
"MIT"
] | null | null | null | ValueAddedTax.cxx | jackytck/topcoder | 5a83ce478d4f05aeb97062f8a30aa1d6fbc969d3 | [
"MIT"
] | null | null | null | // BEGIN CUT HERE
// PROBLEM STATEMENT
// In Russia, the Value Added Tax is 18% for almost all goods, with the exception of certain food items, which have a Value Added Tax of only 10%.
You are given a String product, the name of a product, and an int price, the price of the product before tax. You are also given a ... | 26.541667 | 418 | 0.682496 | [
"vector"
] |
7268a7d311db31d64c4a873b85e694a94964cbf1 | 1,302 | cpp | C++ | devdc44.cpp | vidit1999/coding_problems | b6c9fa7fda37d9424cd11bcd54b385fd8cf1ee0a | [
"BSD-2-Clause"
] | 1 | 2020-02-24T18:28:48.000Z | 2020-02-24T18:28:48.000Z | devdc44.cpp | vidit1999/coding_problems | b6c9fa7fda37d9424cd11bcd54b385fd8cf1ee0a | [
"BSD-2-Clause"
] | null | null | null | devdc44.cpp | vidit1999/coding_problems | b6c9fa7fda37d9424cd11bcd54b385fd8cf1ee0a | [
"BSD-2-Clause"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
/*
The wave (known as the Mexican wave in the English-speaking world outside North America)
is an example of metachronal rhythm typically achieved in a packed stadium.
Spectators will start a cheer in one corner and then roll it around the arena,
with each section rising f... | 29.590909 | 91 | 0.700461 | [
"vector"
] |
726d855a520541914887143d592e2522dd228efd | 5,695 | hpp | C++ | include/bencode/detail/parser/parsing_error.hpp | fbdtemme/bencode | edf7dd5b580c44723821dbf737c8412d628294e4 | [
"MIT"
] | 25 | 2020-08-24T01:54:10.000Z | 2021-12-22T08:55:54.000Z | include/bencode/detail/parser/parsing_error.hpp | fbdtemme/bencode | edf7dd5b580c44723821dbf737c8412d628294e4 | [
"MIT"
] | 1 | 2021-12-29T05:38:56.000Z | 2021-12-29T05:38:56.000Z | include/bencode/detail/parser/parsing_error.hpp | fbdtemme/bencode | edf7dd5b580c44723821dbf737c8412d628294e4 | [
"MIT"
] | 4 | 2020-08-18T19:31:26.000Z | 2022-02-01T18:57:51.000Z | #pragma once
#include <exception>
#include <system_error>
#include <string>
#include <optional>
#include <gsl-lite/gsl-lite.hpp>
#include <fmt/format.h>
#include "bencode/detail/symbol.hpp"
#include "bencode/detail/bencode_type.hpp"
#include "bencode/detail/exception.hpp"
namespace bencode {
/// Error code enumerat... | 31.994382 | 122 | 0.673749 | [
"object"
] |
726d95b53290ad7bf8aa55abcb222885ac3d53bc | 368 | cpp | C++ | CodeChef/Beginner/MNMX.cpp | nsudhanva/Competetive | d9e93fdeefaa4e422a2101db41a7ab0a5676e9da | [
"Unlicense"
] | null | null | null | CodeChef/Beginner/MNMX.cpp | nsudhanva/Competetive | d9e93fdeefaa4e422a2101db41a7ab0a5676e9da | [
"Unlicense"
] | null | null | null | CodeChef/Beginner/MNMX.cpp | nsudhanva/Competetive | d9e93fdeefaa4e422a2101db41a7ab0a5676e9da | [
"Unlicense"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--){
unsigned long long n;
cin >> n;
vector<unsigned long long> a(n);
unsigned long long minCost = 0;
for (unsigned long long i = 0; i < n; ++i)
{
cin >> a[i];
if(a[i] < a[minCost]){
minCost = i;
}
... | 12.689655 | 44 | 0.516304 | [
"vector"
] |
726e9e54ba4363de55349f6ee25a40892292984d | 1,670 | cc | C++ | ll_graphic/model/scenes.cc | LoSealL/lltech | 5acb399820c99f84345e88537c7db259e13d63e4 | [
"MIT"
] | 1 | 2019-09-11T11:55:07.000Z | 2019-09-11T11:55:07.000Z | ll_graphic/model/scenes.cc | LoSealL/lltech | 5acb399820c99f84345e88537c7db259e13d63e4 | [
"MIT"
] | null | null | null | ll_graphic/model/scenes.cc | LoSealL/lltech | 5acb399820c99f84345e88537c7db259e13d63e4 | [
"MIT"
] | null | null | null | /********************************************************************
Copyright 2018 Tang, Wenyi. All Rights Reserved.
Description : scenes
Author : Wenyi Tang
Email : wenyi.tang@intel.com
Created : Feb. 28th, 2018
********************************************************************/
#include "ll_graphic... | 29.298246 | 74 | 0.604192 | [
"shape",
"model"
] |
726fec2448e4b39a4281d102e4067f4e841b4282 | 1,333 | hpp | C++ | include/BCTNode.hpp | Seong-su/hierarchical-data-structure | a56e0df2c9b6a8c5c38349c90a49d57fd49b4102 | [
"MIT"
] | null | null | null | include/BCTNode.hpp | Seong-su/hierarchical-data-structure | a56e0df2c9b6a8c5c38349c90a49d57fd49b4102 | [
"MIT"
] | null | null | null | include/BCTNode.hpp | Seong-su/hierarchical-data-structure | a56e0df2c9b6a8c5c38349c90a49d57fd49b4102 | [
"MIT"
] | null | null | null | #ifndef BCT_NODE_HPP_
#define BCT_NODE_HPP_
#include <forward_list>
#include <fstream>
#include <map>
#include <memory>
#include <string>
#include <unordered_set>
#include <vector>
class BCTNode {
public:
explicit BCTNode(const std::string &source_node,
const std::string &target_node, int id);
... | 24.685185 | 76 | 0.700675 | [
"vector"
] |
727407f1eb6c56a8fcf8ffcba9227b7ef23ff7e2 | 302 | hpp | C++ | src/line.hpp | ramnasidharta/graphical-recipe | 257d0455b73d2f5b212ebec028ec7b4c7a02db07 | [
"MIT"
] | null | null | null | src/line.hpp | ramnasidharta/graphical-recipe | 257d0455b73d2f5b212ebec028ec7b4c7a02db07 | [
"MIT"
] | 32 | 2019-03-22T15:14:10.000Z | 2020-04-01T14:57:33.000Z | src/line.hpp | ramnasidharta/graphical-recipe | 257d0455b73d2f5b212ebec028ec7b4c7a02db07 | [
"MIT"
] | null | null | null | #ifndef LINE_HPP
#define LINE_HPP
#include "graphicObject2D.hpp"
/*! Structures a representation and behavior of a "line segment" */
class Line: public GraphicObject2D {
public:
Line(string name, vector<Coordinate*> &lineCoordinates) :
GraphicObject2D(name, LINE, lineCoordinates) {}
};
#endif
| 20.133333 | 67 | 0.751656 | [
"vector"
] |
72740908e413b96dd17cbc0c489e4320e2d7774c | 4,784 | cpp | C++ | src/emscripten-optimizer/parser.cpp | shrin18/binaryen | fd252fede518bcb33deb0e2c6837fe9f685841f2 | [
"Apache-2.0"
] | 1 | 2021-06-20T03:38:17.000Z | 2021-06-20T03:38:17.000Z | src/emscripten-optimizer/parser.cpp | shrin18/binaryen | fd252fede518bcb33deb0e2c6837fe9f685841f2 | [
"Apache-2.0"
] | null | null | null | src/emscripten-optimizer/parser.cpp | shrin18/binaryen | fd252fede518bcb33deb0e2c6837fe9f685841f2 | [
"Apache-2.0"
] | 1 | 2021-06-20T03:38:49.000Z | 2021-06-20T03:38:49.000Z | /*
* Copyright 2015 WebAssembly Community Group participants
*
* 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... | 29.530864 | 78 | 0.687918 | [
"object",
"vector"
] |
72782828674c62b48a14adfa6fe3b672e9671c89 | 2,538 | hpp | C++ | src/reaction_network/reaction.hpp | rblake-llnl/wcs | ac2d49fb66d89bdcf8f815958b62d9b566a34a8f | [
"MIT-0",
"MIT"
] | null | null | null | src/reaction_network/reaction.hpp | rblake-llnl/wcs | ac2d49fb66d89bdcf8f815958b62d9b566a34a8f | [
"MIT-0",
"MIT"
] | null | null | null | src/reaction_network/reaction.hpp | rblake-llnl/wcs | ac2d49fb66d89bdcf8f815958b62d9b566a34a8f | [
"MIT-0",
"MIT"
] | null | null | null | /******************************************************************************
* *
* Copyright 2020 Lawrence Livermore National Security, LLC and other *
* Whole Cell Simulator Project Developers. See the top-level COPYRIGHT *
... | 33.84 | 81 | 0.611111 | [
"vector"
] |
727896078634aa575d50396d638d00ddfd0033df | 14,066 | hpp | C++ | external/PCMSolver/PCMSolver-source/src/solver/SolverImpl.hpp | robertodr/externalize | c7b1dda2009dab329a6efb580c57ef8e1494cf3b | [
"MIT"
] | 1 | 2017-02-15T22:16:34.000Z | 2017-02-15T22:16:34.000Z | external/PCMSolver/PCMSolver-source/src/solver/SolverImpl.hpp | robertodr/externalize | c7b1dda2009dab329a6efb580c57ef8e1494cf3b | [
"MIT"
] | null | null | null | external/PCMSolver/PCMSolver-source/src/solver/SolverImpl.hpp | robertodr/externalize | c7b1dda2009dab329a6efb580c57ef8e1494cf3b | [
"MIT"
] | null | null | null | /* pcmsolver_copyright_start */
/*
* PCMSolver, an API for the Polarizable Continuum Model
* Copyright (C) 2013-2016 Roberto Di Remigio, Luca Frediani and contributors
*
* This file is part of PCMSolver.
*
* PCMSolver is free software: you can redistribute it and/or modify
* it unde... | 39.734463 | 128 | 0.678587 | [
"model"
] |
727d524d134177bb583d179c67f1922e2b605afb | 400 | cpp | C++ | 198.House Robber/test.cpp | ReZeroS/LeetCode | 807ae800437e0b6224bd4672f28007388625437b | [
"MIT"
] | 2 | 2018-10-24T03:34:44.000Z | 2020-07-16T15:34:44.000Z | 198.House Robber/test.cpp | ReZeroS/LeetCode | 807ae800437e0b6224bd4672f28007388625437b | [
"MIT"
] | null | null | null | 198.House Robber/test.cpp | ReZeroS/LeetCode | 807ae800437e0b6224bd4672f28007388625437b | [
"MIT"
] | null | null | null | class Solution {
public:
int rob(vector<int>& nums) {
vector<int> ans;
if(nums.size() == 0) return 0;
if(nums.size() == 1) return nums[0];
ans.push_back(nums[0]);
ans.push_back(max(nums[0], nums[1]));
for(int i = 2; i < nums.size(); ++i) {
ans.push_back(ma... | 26.666667 | 61 | 0.4825 | [
"vector"
] |
7284d981ef5c485e0c240e053ceeaa330aadb7c2 | 25,878 | cpp | C++ | src/backend/relivedb.cpp | gulrak/relive-client | 47dd66716d81ee466a18ccbd2d268259a1631d05 | [
"BSD-3-Clause"
] | 5 | 2019-09-15T16:03:59.000Z | 2021-06-06T22:00:01.000Z | src/backend/relivedb.cpp | gulrak/relive-client | 47dd66716d81ee466a18ccbd2d268259a1631d05 | [
"BSD-3-Clause"
] | 3 | 2019-10-15T15:04:45.000Z | 2021-06-07T06:00:11.000Z | src/backend/relivedb.cpp | gulrak/relive-client | 47dd66716d81ee466a18ccbd2d268259a1631d05 | [
"BSD-3-Clause"
] | null | null | null | //---------------------------------------------------------------------------------------
// SPDX-License-Identifier: BSD-3-Clause
// relive-client - A C++ implementation of the reLive protocol and an sqlite backend
// Copyright (c) 2019, Steffen Schümann <s.schuemann@pobox.com>
//--------------------------------------... | 45.32049 | 251 | 0.522954 | [
"vector"
] |
728a1a2559f95afa6beca4ebcd7294f1f4bb5960 | 2,019 | cpp | C++ | hiro/windows/widget/combo-button.cpp | 13824125580/higan | fbdd3f980b65412c362096579869ae76730e4118 | [
"Intel",
"ISC"
] | 10 | 2019-12-19T01:19:41.000Z | 2021-02-18T16:30:29.000Z | hiro/windows/widget/combo-button.cpp | 13824125580/higan | fbdd3f980b65412c362096579869ae76730e4118 | [
"Intel",
"ISC"
] | null | null | null | hiro/windows/widget/combo-button.cpp | 13824125580/higan | fbdd3f980b65412c362096579869ae76730e4118 | [
"Intel",
"ISC"
] | null | null | null | #if defined(Hiro_ComboButton)
namespace hiro {
auto pComboButton::construct() -> void {
hwnd = CreateWindow(
L"COMBOBOX", L"",
WS_CHILD | WS_TABSTOP | CBS_DROPDOWNLIST | CBS_HASSTRINGS,
0, 0, 0, 0,
_parentHandle(), nullptr, GetModuleHandle(0), 0
);
pWidget::construct();
for(auto& item : state(... | 30.134328 | 124 | 0.682516 | [
"geometry"
] |
728e8f9f0c191b965643a562627ff381890b4893 | 9,504 | cpp | C++ | pcdet/ops/votr_ops/src/build_attention_indices.cpp | ocNflag/point2seq | 710686f576b3df5469a06c66860758b25f852dbd | [
"Apache-2.0"
] | 21 | 2022-03-24T09:37:38.000Z | 2022-03-31T13:21:54.000Z | pcdet/ops/votr_ops/src/build_attention_indices.cpp | ocNflag/point2seq | 710686f576b3df5469a06c66860758b25f852dbd | [
"Apache-2.0"
] | null | null | null | pcdet/ops/votr_ops/src/build_attention_indices.cpp | ocNflag/point2seq | 710686f576b3df5469a06c66860758b25f852dbd | [
"Apache-2.0"
] | 1 | 2022-03-24T09:37:48.000Z | 2022-03-24T09:37:48.000Z | /*
Find indices for each attention pattern
Written by Jiageng Mao
*/
#include <torch/serialize/tensor.h>
#include <vector>
#include <THC/THC.h>
#include <cuda.h>
#include <cuda_runtime_api.h>
#include "build_attention_indices_gpu.h"
extern THCState *state;
#define CHECK_CUDA(x) do { \
if (!x.type().is_cuda()) { \
... | 52.21978 | 156 | 0.656671 | [
"vector"
] |
728fd9fad8a918d7a6fdf3d2de70a3acae9db2c2 | 729 | cpp | C++ | SHVDNPro/core/OutputArgument.cpp | codecat/SHVDNPro | 5347c605a64a884ce84bc38e4182f32bc5b0308d | [
"Zlib"
] | 11 | 2017-07-07T14:22:47.000Z | 2020-08-07T18:29:32.000Z | SHVDNPro/core/OutputArgument.cpp | codecat/SHVDNPro | 5347c605a64a884ce84bc38e4182f32bc5b0308d | [
"Zlib"
] | 4 | 2017-07-14T10:18:45.000Z | 2020-09-16T00:19:15.000Z | SHVDNPro/core/OutputArgument.cpp | codecat/SHVDNPro | 5347c605a64a884ce84bc38e4182f32bc5b0308d | [
"Zlib"
] | 8 | 2017-07-13T15:34:38.000Z | 2022-01-22T15:08:27.000Z | #include <OutputArgument.h>
#include <NativeObjects.h>
#include <cstring>
#include <cstdlib>
GTA::Native::OutputArgument::OutputArgument()
{
_storage = malloc(24);
memset(_storage, 0, 24);
}
GTA::Native::OutputArgument::OutputArgument(Object ^value) : OutputArgument()
{
*reinterpret_cast<System::UInt64*>(_storag... | 19.184211 | 93 | 0.731139 | [
"object"
] |
7297820669a343f71e2127fbee676640eace1817 | 1,545 | cpp | C++ | LeetCode/Array/BinarySearch/SearchinRotatedSortedArray.cpp | a4org/Angorithm4 | d2227d36608491bed270375bcea67fbde134209a | [
"MIT"
] | 3 | 2021-07-26T15:58:45.000Z | 2021-09-08T14:55:11.000Z | LeetCode/Array/BinarySearch/SearchinRotatedSortedArray.cpp | a4org/Angorithm4 | d2227d36608491bed270375bcea67fbde134209a | [
"MIT"
] | null | null | null | LeetCode/Array/BinarySearch/SearchinRotatedSortedArray.cpp | a4org/Angorithm4 | d2227d36608491bed270375bcea67fbde134209a | [
"MIT"
] | 2 | 2021-05-31T11:27:59.000Z | 2021-10-03T13:26:00.000Z | /*
* LeetCode 33 Search in Rotated Sorted Array
* Medium
* Shuo Feng
* 2021.9.23
*/
#include<iostream>
#include<vector>
using namespace std;
/*
* Solution: Binary Search
* When search in sorted array, always consider binary search.
* Some differences： After rotated, the new array is a combination of two d... | 26.637931 | 123 | 0.471197 | [
"vector"
] |
72abe97a1d820d1893c97611247a32aafe43ead4 | 9,126 | cpp | C++ | src/PlaneSeg.cpp | richard5635/PlaneLoc | aab6637124b1b99ad726a94e9f6762dddf3716b5 | [
"MIT"
] | 22 | 2017-08-29T06:22:07.000Z | 2021-12-29T07:42:31.000Z | src/PlaneSeg.cpp | richard5635/PlaneLoc | aab6637124b1b99ad726a94e9f6762dddf3716b5 | [
"MIT"
] | 5 | 2019-03-26T06:10:18.000Z | 2021-11-26T01:59:41.000Z | src/PlaneSeg.cpp | richard5635/PlaneLoc | aab6637124b1b99ad726a94e9f6762dddf3716b5 | [
"MIT"
] | 14 | 2018-04-24T08:49:01.000Z | 2021-12-15T07:56:58.000Z | /*
Copyright (c) 2017 Mobile Robots Laboratory at Poznan University of Technology:
-Jan Wietrzykowski name.surname [at] put.poznan.pl
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 Sof... | 34.437736 | 103 | 0.62426 | [
"object",
"vector",
"model",
"transform"
] |
72ad0a24dbe7fe8f86f89adf5fef9873f74f00f2 | 2,339 | hpp | C++ | src/gen_pipeline.hpp | AnnoyingDog99/GEngine | 5d0ef1b168e803559098c146f6c082c12e52dadd | [
"MIT"
] | null | null | null | src/gen_pipeline.hpp | AnnoyingDog99/GEngine | 5d0ef1b168e803559098c146f6c082c12e52dadd | [
"MIT"
] | null | null | null | src/gen_pipeline.hpp | AnnoyingDog99/GEngine | 5d0ef1b168e803559098c146f6c082c12e52dadd | [
"MIT"
] | null | null | null | #pragma once
#include "gen_device.hpp"
// std
#include <string>
#include <vector>
namespace gen
{
// config is here so app can configure pipeline completely, also, config can now be easily shared between different pipelines
struct PipelineConfigInfo
{
PipelineConfigInfo() = default;
Pipe... | 37.126984 | 143 | 0.734929 | [
"vector"
] |
72ad6c8eb4774262f499599effb895f3ed05fbcd | 453 | cpp | C++ | COJ/Apples.cpp | MartinAparicioPons/Competitive-Programming | 58151df0ed08a5e4e605abefdd69fef1ecc10fa0 | [
"Apache-2.0"
] | 1 | 2019-09-29T03:58:35.000Z | 2019-09-29T03:58:35.000Z | COJ/Apples.cpp | MartinAparicioPons/Competitive-Programming | 58151df0ed08a5e4e605abefdd69fef1ecc10fa0 | [
"Apache-2.0"
] | null | null | null | COJ/Apples.cpp | MartinAparicioPons/Competitive-Programming | 58151df0ed08a5e4e605abefdd69fef1ecc10fa0 | [
"Apache-2.0"
] | null | null | null | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<iterator>
#include<string>
#include<cstring>
using namespace std;
int main(){
int n, u, p, m;
bool first = true;
while(scanf("%d", &n) != EOF){
if(!first){
printf("\n");
}
first = false;
p = 0;
u = 0;
for(... | 14.15625 | 31 | 0.536424 | [
"vector"
] |
72b936123d4678c9fd1670348ebe4a5a0f60aef1 | 126,723 | cpp | C++ | MultiPaneCtrl/MultiPaneCtrl.cpp | baradzenka/MultiPaneCtrl | b81b84632fe1b6f57ad267d19a827299a341cfbf | [
"Unlicense"
] | 7 | 2021-03-19T06:33:22.000Z | 2022-03-18T10:45:52.000Z | MultiPaneCtrl/MultiPaneCtrl.cpp | baradzenka/MultiPaneCtrl | b81b84632fe1b6f57ad267d19a827299a341cfbf | [
"Unlicense"
] | null | null | null | MultiPaneCtrl/MultiPaneCtrl.cpp | baradzenka/MultiPaneCtrl | b81b84632fe1b6f57ad267d19a827299a341cfbf | [
"Unlicense"
] | 2 | 2021-03-17T14:21:14.000Z | 2021-05-24T03:14:57.000Z | //==========================================================
// Author: Baradzenka Aleh (baradzenka@gmail.com)
//==========================================================
//
/////////////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "MultiPaneCtrl.h"
#include <cassert>
... | 31.01395 | 191 | 0.586973 | [
"vector"
] |
72cc815e3bc2edb9745efe68044388a5440cb777 | 2,785 | cpp | C++ | test/testswarm.cpp | aswathselvam/swarm_robots | 8127c30223a27c4545401dc56a27b045bd298598 | [
"BSD-3-Clause"
] | 1 | 2021-12-13T12:37:35.000Z | 2021-12-13T12:37:35.000Z | test/testswarm.cpp | kavyadevd/swarm_robots | 8127c30223a27c4545401dc56a27b045bd298598 | [
"BSD-3-Clause"
] | 2 | 2021-12-08T22:02:02.000Z | 2021-12-13T00:32:54.000Z | test/testswarm.cpp | kavyadevd/swarm_robots | 8127c30223a27c4545401dc56a27b045bd298598 | [
"BSD-3-Clause"
] | 2 | 2021-11-15T15:10:37.000Z | 2021-12-06T14:05:06.000Z |
/**
* @file testswarm.cpp
* @author Kavyashree Devadiga (kavya@umd.edu), Aswath Muthuselvam
* (aswath@umd.edu)
* @date 13th November 2021
* @brief Cpp file to define test cases
* @copyright BSD3 Copyright (c) 2021
*/
// Include required headers
#include <gtest/gtest.h>
#include <ros/ros.h>
#includ... | 23.016529 | 67 | 0.641293 | [
"object",
"vector"
] |
72cf4007ad048c67584ac6889c20cb41963f3790 | 1,640 | hh | C++ | src/fft/validation.hh | merijn/host-template | 3e994b1368fc4084d073e7d2cca997803e4cf26f | [
"Apache-2.0"
] | null | null | null | src/fft/validation.hh | merijn/host-template | 3e994b1368fc4084d073e7d2cca997803e4cf26f | [
"Apache-2.0"
] | 6 | 2019-01-24T12:10:17.000Z | 2020-05-12T14:11:24.000Z | src/fft/validation.hh | merijn/host-template | 3e994b1368fc4084d073e7d2cca997803e4cf26f | [
"Apache-2.0"
] | 1 | 2019-02-21T09:53:15.000Z | 2019-02-21T09:53:15.000Z | #pragma once
#include <fftw3.h>
#include <functional>
#include <gsl/span>
#include <map>
#include <string>
#include <vector>
#include <cassert>
template <typename T>
using complex_span = gsl::span<std::complex<T>>;
using shape_t = std::vector<int>;
namespace TripleA2 {
template <typename Config, typename InputNu... | 24.848485 | 78 | 0.595122 | [
"shape",
"vector"
] |
72d60487400d8f05376275cb90259588c7a8a1fb | 1,059 | cpp | C++ | libconfig/test/yaml-test.cpp | qiu708/libconfig | 24e79f923c96a5210a1dc5603000d90b56b13318 | [
"MIT"
] | null | null | null | libconfig/test/yaml-test.cpp | qiu708/libconfig | 24e79f923c96a5210a1dc5603000d90b56b13318 | [
"MIT"
] | null | null | null | libconfig/test/yaml-test.cpp | qiu708/libconfig | 24e79f923c96a5210a1dc5603000d90b56b13318 | [
"MIT"
] | null | null | null | //
// Created by qiu on 2021/12/20.
//
#include <yaml-cpp/yaml.h>
#include<iostream>
#include <libconfig/Config.h>
using namespace std;
void printYaml(YAML::Node node)
{
for(auto it=node.begin();it!=node.end();it++)
{
cout<<it->first.as<string>()<<endl;
}
}
void templatetest()
{
// std::cout<<l... | 29.416667 | 95 | 0.644948 | [
"vector"
] |
72d77945dedb6879060db4228973cea4e120948d | 7,976 | cpp | C++ | coding/compressed_varnum_vector.cpp | bowlofstew/omim | 8045157c95244aa8f862d47324df42a19b87e335 | [
"Apache-2.0"
] | 1 | 2019-01-11T05:02:05.000Z | 2019-01-11T05:02:05.000Z | coding/compressed_varnum_vector.cpp | bowlofstew/omim | 8045157c95244aa8f862d47324df42a19b87e335 | [
"Apache-2.0"
] | null | null | null | coding/compressed_varnum_vector.cpp | bowlofstew/omim | 8045157c95244aa8f862d47324df42a19b87e335 | [
"Apache-2.0"
] | 1 | 2019-08-09T21:21:09.000Z | 2019-08-09T21:21:09.000Z | #include "coding/compressed_varnum_vector.hpp"
/*
#include "coding/arithmetic_codec.hpp"
#include "coding/bit_streams.hpp"
#include "coding/reader.hpp"
#include "coding/writer.hpp"
#include "coding/varint_misc.hpp"
#include "base/bits.hpp"
#include "std/algorithm.hpp"
#include "std/unique_ptr.hpp"
#include "std/vecto... | 36.090498 | 192 | 0.723546 | [
"vector"
] |
72d7f7bb3fb234efac8439a6499c1a9e55287d82 | 464 | cpp | C++ | exercises/grade-school/example.cpp | marko213/cpp | 871529cd9c10d7c9c0b52d7e35e10ef2b9b4758f | [
"MIT"
] | 1 | 2019-07-14T18:07:13.000Z | 2019-07-14T18:07:13.000Z | exercises/grade-school/example.cpp | marko213/cpp | 871529cd9c10d7c9c0b52d7e35e10ef2b9b4758f | [
"MIT"
] | 4 | 2019-09-08T15:56:22.000Z | 2021-12-03T00:53:01.000Z | exercises/grade-school/example.cpp | marko213/cpp | 871529cd9c10d7c9c0b52d7e35e10ef2b9b4758f | [
"MIT"
] | 1 | 2020-03-25T15:53:16.000Z | 2020-03-25T15:53:16.000Z | #include "grade_school.h"
#include <algorithm>
using namespace std;
namespace grade_school
{
void school::add(string const& name, int grade)
{
vector<string>& grade_roster = roster_[grade];
auto it = lower_bound(grade_roster.begin(), grade_roster.end(), name);
grade_roster.insert(it, name);
}
vector<str... | 20.173913 | 74 | 0.6875 | [
"vector"
] |
72e0f6ac7ceff7293009f374dc81508ca7ad369a | 709 | cpp | C++ | Binary Trees/11 Bottom View of a tree.cpp | i-am-grut/LoveBabbar-450-Questions | 08faaa70198363c6ac481a67c548e1e7e4c7c591 | [
"MIT"
] | 2 | 2021-06-25T07:26:23.000Z | 2022-01-28T22:24:34.000Z | Binary Trees/11 Bottom View of a tree.cpp | i-am-grut/LoveBabbar-450-Questions | 08faaa70198363c6ac481a67c548e1e7e4c7c591 | [
"MIT"
] | null | null | null | Binary Trees/11 Bottom View of a tree.cpp | i-am-grut/LoveBabbar-450-Questions | 08faaa70198363c6ac481a67c548e1e7e4c7c591 | [
"MIT"
] | null | null | null | class Solution {
//Time complecity O(nlogn) because of insertion in map
public:
vector <int> bottomView(Node *root) {
vector<int> ans;
if(root==NULL){
return ans;
}
map<int,int> m;
queue<pair<Node*,int>> q;
q.push({root,0});
while(!q.empty())... | 24.448276 | 58 | 0.421721 | [
"vector"
] |
72e151e166a58f0d02b8c2a4b002cb091502a146 | 1,742 | cpp | C++ | Sources/Elastos/Frameworks/Droid/Commands/Am/src/elastos/droid/commands/am/CIntentReceiver.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 7 | 2017-07-13T10:34:54.000Z | 2021-04-16T05:40:35.000Z | Sources/Elastos/Frameworks/Droid/Commands/Am/src/elastos/droid/commands/am/CIntentReceiver.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | null | null | null | Sources/Elastos/Frameworks/Droid/Commands/Am/src/elastos/droid/commands/am/CIntentReceiver.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 9 | 2017-07-13T12:33:20.000Z | 2021-06-19T02:46:48.000Z | //=========================================================================
// Copyright (C) 2012 The Elastos Open Source Project
//
// 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
//
// ... | 26.8 | 78 | 0.642939 | [
"object"
] |
72e8ff62e2e0a384fb8aecc432c7d4fa1fa360f6 | 25,648 | cpp | C++ | src/coherence/util/CircularArrayList.cpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-01T21:38:30.000Z | 2021-11-03T01:35:11.000Z | src/coherence/util/CircularArrayList.cpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 1 | 2020-07-24T17:29:22.000Z | 2020-07-24T18:29:04.000Z | src/coherence/util/CircularArrayList.cpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-10T18:40:58.000Z | 2022-02-18T01:23:40.000Z | /*
* Copyright (c) 2000, 2020, Oracle and/or its affiliates.
*
* Licensed under the Universal Permissive License v 1.0 as shown at
* http://oss.oracle.com/licenses/upl.
*/
#include "coherence/util/CircularArrayList.hpp"
#include "coherence/util/ConcurrentModificationException.hpp"
#include <algorithm>
COH_OPEN_... | 28.092004 | 79 | 0.525733 | [
"object"
] |
6392558c82c4aefc323deab01cc36f61e6c7bc31 | 6,906 | cpp | C++ | src/libtriton/engines/solver/solverEngine.cpp | romainthomas/Triton | b84841e571fc9d51c1f48ed19503162e582c84b8 | [
"BSD-3-Clause"
] | null | null | null | src/libtriton/engines/solver/solverEngine.cpp | romainthomas/Triton | b84841e571fc9d51c1f48ed19503162e582c84b8 | [
"BSD-3-Clause"
] | null | null | null | src/libtriton/engines/solver/solverEngine.cpp | romainthomas/Triton | b84841e571fc9d51c1f48ed19503162e582c84b8 | [
"BSD-3-Clause"
] | 1 | 2021-03-04T13:22:48.000Z | 2021-03-04T13:22:48.000Z | //! \file
/*
** Copyright (C) - Triton
**
** This program is under the terms of the BSD License.
*/
#include <api.hpp>
#include <ast.hpp>
#include <exceptions.hpp>
#include <tritonToZ3Ast.hpp>
#include <z3Result.hpp>
#include <solverEngine.hpp>
/*! \page solver_interface_page SMT Solver Interface
\brief [**in... | 32.422535 | 162 | 0.602809 | [
"vector",
"model"
] |
63937d72d8fd7f77c74e869f25531f6db21adfb6 | 4,267 | cpp | C++ | WorldOutlinerWidget.cpp | derekniess/3D-Physics-Engine-Framework | 3a0c2c83813bfa1a433dbed4edfcdaa1082bfd32 | [
"MIT"
] | 3 | 2020-05-21T05:53:59.000Z | 2020-09-26T11:20:33.000Z | WorldOutlinerWidget.cpp | derekniess/3D-Physics-Engine | 3a0c2c83813bfa1a433dbed4edfcdaa1082bfd32 | [
"MIT"
] | null | null | null | WorldOutlinerWidget.cpp | derekniess/3D-Physics-Engine | 3a0c2c83813bfa1a433dbed4edfcdaa1082bfd32 | [
"MIT"
] | null | null | null | #include <glm/gtc/type_ptr.hpp>
#include "WorldOutlinerWidget.h"
#include "WindowManager.h"
#include "GameObjectFactory.h"
#include "InputManager.h"
#include "Engine.h"
bool WorldOutlinerWidget::DrawWidget()
{
int height = ImGuiManagerReference.EngineHandle.GetWindowManager().Height;
int width = ImGuiManagerReferen... | 29.427586 | 164 | 0.719241 | [
"object",
"vector",
"transform"
] |
63a371ad7c820935d9b7d32e56eb4ca60406674f | 2,243 | hpp | C++ | fmath.hpp | ibequa/fmath | 8b20a98eeb15a00d47a07f3aeffea9eb16a45127 | [
"MIT"
] | null | null | null | fmath.hpp | ibequa/fmath | 8b20a98eeb15a00d47a07f3aeffea9eb16a45127 | [
"MIT"
] | null | null | null | fmath.hpp | ibequa/fmath | 8b20a98eeb15a00d47a07f3aeffea9eb16a45127 | [
"MIT"
] | null | null | null | //
// fmath.hpp
// Flexo
//
// Created by Ilya on 08/04/16.
// Copyright © 2016 Flexo. All rights reserved.
//
#ifndef fmath_hpp
#define fmath_hpp
#include "vec3.hpp"
#include "quaternion.hpp"
#include "mat4.hpp"
namespace fmath {
/** \brief Constructs orthogonal projection matrix
* \return 4x4 ort... | 32.507246 | 96 | 0.662506 | [
"vector"
] |
63a6395f9b5c0359e72c4b146d9c0d7cb6856932 | 5,679 | cpp | C++ | src/cam_cv.cpp | dominicdoty/RTES-Final-Project | 290eb55422df6a866eccc2891ddfe4d080d5727e | [
"MIT"
] | null | null | null | src/cam_cv.cpp | dominicdoty/RTES-Final-Project | 290eb55422df6a866eccc2891ddfe4d080d5727e | [
"MIT"
] | null | null | null | src/cam_cv.cpp | dominicdoty/RTES-Final-Project | 290eb55422df6a866eccc2891ddfe4d080d5727e | [
"MIT"
] | null | null | null | // Cam CV transforms service
// ECEN 5623
#include "cam_cv.hpp"
#include "debug.h"
#include "data.h"
#include <syslog.h>
#define DEBUG 0
#define USEC_PER_MSEC (1000)
#define NSEC_PER_MSEC (1000000)
#define PERIOD (125)
using namespace cv;
using namespace std;
void* cam_lines(void* args)
{
int buffer_Val = ... | 24.799127 | 141 | 0.654164 | [
"vector"
] |
63b15cdc99e9c2975cf783159c6371fa19ebe06f | 5,411 | cc | C++ | 10_Lambda/UnitsCalculations/Main.cc | franneck94/UdemyCppExercises | 862d3e3df198ef8f3c7b850bbeead6161700f9d1 | [
"MIT"
] | null | null | null | 10_Lambda/UnitsCalculations/Main.cc | franneck94/UdemyCppExercises | 862d3e3df198ef8f3c7b850bbeead6161700f9d1 | [
"MIT"
] | null | null | null | 10_Lambda/UnitsCalculations/Main.cc | franneck94/UdemyCppExercises | 862d3e3df198ef8f3c7b850bbeead6161700f9d1 | [
"MIT"
] | 5 | 2022-02-06T20:05:07.000Z | 2022-03-10T12:48:58.000Z | #include <algorithm>
#include <array>
#include <cmath>
#include "Units.hpp"
#include "utils.hpp"
constexpr std::size_t NUM_ENTRIES = 3;
constexpr std::uint32_t TIME_SPAN_MS = 50;
void compute_velocities(const std::array<float, NUM_ENTRIES> long_velocities_mps,
const std::array<float, NUM_ENTR... | 45.470588 | 109 | 0.64757 | [
"transform"
] |
63c54e9eb84c174aee218dbe12a9be0aa8dcf4de | 5,106 | cpp | C++ | sleuthkit/tools/autotools/tsk_loaddb.cpp | hcktheheaven/OpenDF | 2664307a9a4924c47f487d2c62b603a5fa449923 | [
"Apache-2.0"
] | 53 | 2015-01-24T10:36:01.000Z | 2021-07-04T12:27:03.000Z | sleuthkit/tools/autotools/tsk_loaddb.cpp | OSSSP/OpenDF | 2664307a9a4924c47f487d2c62b603a5fa449923 | [
"Apache-2.0"
] | 84 | 2015-01-24T06:40:58.000Z | 2019-07-07T17:35:30.000Z | sleuthkit/tools/autotools/tsk_loaddb.cpp | OSSSP/OpenDF | 2664307a9a4924c47f487d2c62b603a5fa449923 | [
"Apache-2.0"
] | 122 | 2015-01-24T17:52:45.000Z | 2020-03-18T06:32:15.000Z | /*
** tsk_loaddb
** The Sleuth Kit
**
** Brian Carrier [carrier <at> sleuthkit [dot] org]
** Copyright (c) 2010-2011 Brian Carrier. All Rights reserved
**
** This software is distributed under the Common Public License 1.0
**
*/
#include "tsk/tsk_tools_i.h"
#include "tsk/auto/tsk_case_db.h"
#include <locale... | 27.75 | 146 | 0.553271 | [
"vector"
] |
63cd05e7868cad413fa926ea74591b8094de66d3 | 5,326 | cpp | C++ | src/renderer/mesh.cpp | kevinmkchin/opengl-sdl-cpp | 4ac9a7b397fb4fb13f40c669ed782ad51824b064 | [
"MIT"
] | null | null | null | src/renderer/mesh.cpp | kevinmkchin/opengl-sdl-cpp | 4ac9a7b397fb4fb13f40c669ed782ad51824b064 | [
"MIT"
] | null | null | null | src/renderer/mesh.cpp | kevinmkchin/opengl-sdl-cpp | 4ac9a7b397fb4fb13f40c669ed782ad51824b064 | [
"MIT"
] | null | null | null | #include "mesh.h"
#include "../debugging/console.h"
void mesh_t::gl_create_mesh(mesh_t& mesh,
float* vertices,
u32* indices,
u32 vertices_array_count,
u32 indices_array_count,
u8 ... | 43.300813 | 188 | 0.642133 | [
"mesh",
"render",
"object"
] |
63d1b7b5d1c76f0ecc1a68758d5266c0bf52cff8 | 6,261 | cpp | C++ | src/model/model-chain.cpp | zhaoyi2/kaldi-based-asr-server | e886efefb4072e5e5a5c33d0152d7616c45d0e8b | [
"Apache-2.0"
] | 6 | 2020-09-12T05:42:29.000Z | 2021-12-23T07:15:25.000Z | src/model/model-chain.cpp | zhaoyi2/kaldi-based-asr-server | e886efefb4072e5e5a5c33d0152d7616c45d0e8b | [
"Apache-2.0"
] | null | null | null | src/model/model-chain.cpp | zhaoyi2/kaldi-based-asr-server | e886efefb4072e5e5a5c33d0152d7616c45d0e8b | [
"Apache-2.0"
] | 4 | 2020-09-14T14:33:32.000Z | 2021-08-05T13:07:09.000Z | // model-chain.cpp - Chain Model Implementation
// stl includes
#include <iostream>
#include <string>
// local includes
#include "model.hpp"
#include "utils.hpp"
#include "types.hpp"
namespace kaldiserve {
ChainModel::ChainModel(const ModelSpec &model_spec) : model_spec(model_spec) {
std::string model_dir = mo... | 47.075188 | 153 | 0.679444 | [
"model"
] |
63dfc6fbf2d05015f8351191e219566e2f0cb3cc | 1,574 | cpp | C++ | tests/unittest/id_manager_multithreaded.cpp | lukaszstolarczuk/pmemstream | 972f029d13858d783d80654d73168c5e8334eab6 | [
"BSD-3-Clause"
] | null | null | null | tests/unittest/id_manager_multithreaded.cpp | lukaszstolarczuk/pmemstream | 972f029d13858d783d80654d73168c5e8334eab6 | [
"BSD-3-Clause"
] | 123 | 2021-11-02T12:06:07.000Z | 2022-03-31T10:50:48.000Z | tests/unittest/id_manager_multithreaded.cpp | lukaszstolarczuk/pmemstream | 972f029d13858d783d80654d73168c5e8334eab6 | [
"BSD-3-Clause"
] | 5 | 2021-11-02T12:20:38.000Z | 2022-02-15T23:50:04.000Z | // SPDX-License-Identifier: BSD-3-Clause
/* Copyright 2022, Intel Corporation */
/* id_manager_multithreaded.cpp -- verifies correctness of id_manager module in multithreaded env. */
#include "id_manager.h"
#include <algorithm>
#include <numeric>
#include <vector>
#include "thread_helpers.hpp"
#include "unittest.hp... | 28.107143 | 101 | 0.675349 | [
"vector"
] |
63e0ed68c2dfd53d253ba85ce5b0a73b17b6fdc0 | 2,037 | cpp | C++ | CubeEngine/EngineSrc/3D/Primitive/LinePrimitive.cpp | multithread3/Cube-Engine | aa76db88fdace41b09cbfc51e5959a9686cca3f3 | [
"MIT"
] | 1 | 2020-10-25T17:43:38.000Z | 2020-10-25T17:43:38.000Z | CubeEngine/EngineSrc/3D/Primitive/LinePrimitive.cpp | multithread3/Cube-Engine | aa76db88fdace41b09cbfc51e5959a9686cca3f3 | [
"MIT"
] | null | null | null | CubeEngine/EngineSrc/3D/Primitive/LinePrimitive.cpp | multithread3/Cube-Engine | aa76db88fdace41b09cbfc51e5959a9686cca3f3 | [
"MIT"
] | null | null | null | #include "LinePrimitive.h"
#include "../../Rendering/Renderer.h"
#include "../../Scene/SceneMgr.h"
namespace tzw {
LinePrimitive::LinePrimitive(vec3 begin, vec3 end)
{
append(begin, end);
init();
initBuffer();
}
LinePrimitive::LinePrimitive():m_mesh(nullptr)
{
init();
}
void LinePrimitive::submitDrawCmd(Render... | 21.21875 | 115 | 0.722631 | [
"mesh"
] |
120828600e5a4a11d7521f9f0fc6f21bcf6be5c9 | 631 | cpp | C++ | Online Judges/Neps Academy/OperacoesSimples/main.cpp | AnneLivia/URI-Online | 02ff972be172a62b8abe25030c3676f6c04efd1b | [
"MIT"
] | 64 | 2019-03-17T08:56:28.000Z | 2022-01-14T02:31:21.000Z | Online Judges/Neps Academy/OperacoesSimples/main.cpp | AnneLivia/URI-Online | 02ff972be172a62b8abe25030c3676f6c04efd1b | [
"MIT"
] | 1 | 2020-12-24T07:16:30.000Z | 2021-03-23T20:51:05.000Z | Online Judges/Neps Academy/OperacoesSimples/main.cpp | AnneLivia/URI-Online | 02ff972be172a62b8abe25030c3676f6c04efd1b | [
"MIT"
] | 19 | 2019-05-25T10:48:16.000Z | 2022-01-07T10:07:46.000Z | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void insersionSort(vector<int>& v) {
for (int i = 1; i < (int)v.size(); i++) {
int number = v[i], j = i - 1;
while(number < v[j] && j >= 0) {
v[j + 1] = v[j];
j--;
}
v[j + 1] = n... | 18.028571 | 45 | 0.391442 | [
"vector"
] |
12094b585ba268bccbcff708af2e257b2392eb21 | 11,791 | cpp | C++ | tests/test_enumerate_iterator.cpp | ftlorg/ftl | 75a580043ddf011477f0fbcb0ed1dc01be37814d | [
"BSL-1.0"
] | 47 | 2020-07-17T07:31:42.000Z | 2022-02-18T10:31:45.000Z | tests/test_enumerate_iterator.cpp | ftlorg/ftl | 75a580043ddf011477f0fbcb0ed1dc01be37814d | [
"BSL-1.0"
] | 40 | 2020-07-23T09:01:39.000Z | 2020-12-19T15:19:44.000Z | tests/test_enumerate_iterator.cpp | ftlorg/ftl | 75a580043ddf011477f0fbcb0ed1dc01be37814d | [
"BSL-1.0"
] | 1 | 2020-07-26T18:21:36.000Z | 2020-07-26T18:21:36.000Z | #include <catch2/catch.hpp>
#include <ftl/ftl.hpp>
#define TEST_TAG "[enumerate_iterator]"
TEST_CASE(TEST_TAG "enumerate", TEST_TAG) {
constexpr std::size_t size = 5;
ftl::array<int, size> arr = { { 1, 2, 3, 4, 5 } };
for (const auto &[index, item] : arr.iter().enumerate()) {
REQUIRE(arr[index] == item);
... | 32.128065 | 120 | 0.585786 | [
"vector"
] |
120b7fef02526526a4766712537ba8a5742670c6 | 5,150 | hpp | C++ | src/math.hpp | kabicm/arbor | cfab5fd6a2e6a211c097659c96dcc098ee806e68 | [
"BSD-3-Clause"
] | null | null | null | src/math.hpp | kabicm/arbor | cfab5fd6a2e6a211c097659c96dcc098ee806e68 | [
"BSD-3-Clause"
] | null | null | null | src/math.hpp | kabicm/arbor | cfab5fd6a2e6a211c097659c96dcc098ee806e68 | [
"BSD-3-Clause"
] | null | null | null | #pragma once
#include <cmath>
#include <limits>
#include <utility>
namespace arb {
namespace math {
template <typename T>
T constexpr pi() {
return T(3.1415926535897932384626433832795l);
}
template <typename T = float>
T constexpr infinity() {
return std::numeric_limits<T>::infinity();
}
template <typename... | 22.991071 | 91 | 0.582913 | [
"vector"
] |
120eddd8c061994a752a401fee26c39f2f3059ce | 40,771 | cpp | C++ | Source/AllProjects/Drivers/HAIOmniTCP2/Server/HAIOmniTCP2S_DriverImpl3.cpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | 51 | 2020-12-26T18:17:16.000Z | 2022-03-15T04:29:35.000Z | Source/AllProjects/Drivers/HAIOmniTCP2/Server/HAIOmniTCP2S_DriverImpl3.cpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | null | null | null | Source/AllProjects/Drivers/HAIOmniTCP2/Server/HAIOmniTCP2S_DriverImpl3.cpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | 4 | 2020-12-28T07:24:39.000Z | 2021-12-29T12:09:37.000Z | //
// FILE NAME: HAIOmniTCP2S_DriverImpl3.cpp
//
// AUTHOR: Dean Roddey
//
// CREATED: 02/06/2014
//
// COPYRIGHT: Charmed Quark Systems, Ltd @ 2020
//
// This software is copyrighted by 'Charmed Quark Systems, Ltd' and
// the author (Dean Roddey.) It is licensed under the MIT Open Source
// license:
//
// https://... | 33.611707 | 90 | 0.582179 | [
"object"
] |
120f409a37fba294e9027014b993a23dc65e5a5f | 35,777 | cpp | C++ | Sandbox/Eudora/ReadMessageFrame.cpp | dusong7/eudora-win | 850a6619e6b0d5abc770bca8eb5f3b9001b7ccd2 | [
"BSD-3-Clause-Clear"
] | 10 | 2018-05-23T10:43:48.000Z | 2021-12-02T17:59:48.000Z | Windows/Sandbox/Eudora/ReadMessageFrame.cpp | officialrafsan/EUDORA | bf43221f5663ec2338aaf90710a89d1490b92ed2 | [
"MIT"
] | 1 | 2019-03-19T03:56:36.000Z | 2021-05-26T18:36:03.000Z | Windows/Sandbox/Eudora/ReadMessageFrame.cpp | officialrafsan/EUDORA | bf43221f5663ec2338aaf90710a89d1490b92ed2 | [
"MIT"
] | 11 | 2018-05-23T10:43:53.000Z | 2021-12-27T15:42:58.000Z | // ReadMessageFrame.cpp: implementation of the CReadMessageFrame class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "PgReadMsgView.h"
#undef SubclassWindow // Nasty!
#include "resource.h"
#include "msgutils.h"
#include "utils.h"
#include "BlahBlahBlahView... | 24.52159 | 123 | 0.694804 | [
"object"
] |
1215dbf522861213c5b5cf2d11e9563afe2525a5 | 4,792 | cpp | C++ | src/execution/sql/filter_manager.cpp | algebra2k/terrier | 8b6f4b0b0c30dc94411f197e610f634ce0ab5b0b | [
"MIT"
] | 1 | 2019-03-08T18:59:57.000Z | 2019-03-08T18:59:57.000Z | src/execution/sql/filter_manager.cpp | LiuXiaoxuanPKU/terrier | 35916e9435201016903d8a01e3f587b8edb36f0b | [
"MIT"
] | 34 | 2019-03-21T20:47:59.000Z | 2019-05-17T06:06:46.000Z | src/execution/sql/filter_manager.cpp | LiuXiaoxuanPKU/terrier | 35916e9435201016903d8a01e3f587b8edb36f0b | [
"MIT"
] | 3 | 2020-11-10T11:06:20.000Z | 2022-03-26T15:30:55.000Z | #include "execution/sql/filter_manager.h"
#include <memory>
#include <numeric>
#include <utility>
#include <vector>
#include "execution/bandit/agent.h"
#include "execution/bandit/multi_armed_bandit.h"
#include "execution/bandit/policy.h"
#include "execution/sql/projected_columns_iterator.h"
#include "execution/util/t... | 35.235294 | 117 | 0.732471 | [
"vector"
] |
1218a6d73ebfe585f408409b240fe90bdb837cb6 | 15,883 | cpp | C++ | benchmark_apps/elmerfem/ElmerGUI/netgen/libsrc/meshing/zrefine.cpp | readex-eu/readex-apps | 38493b11806c306f4e8f1b7b2d97764b45fac8e2 | [
"BSD-3-Clause"
] | 2 | 2020-11-25T13:10:11.000Z | 2021-03-15T20:26:35.000Z | elmerfem/ElmerGUI/netgen/libsrc/meshing/zrefine.cpp | jcmcmurry/pipelining | 8fface1a501b5050f58e7b902aacdcdde68e9648 | [
"MIT"
] | null | null | null | elmerfem/ElmerGUI/netgen/libsrc/meshing/zrefine.cpp | jcmcmurry/pipelining | 8fface1a501b5050f58e7b902aacdcdde68e9648 | [
"MIT"
] | 2 | 2021-08-02T23:23:40.000Z | 2022-02-26T12:39:30.000Z | #include <mystdlib.h>
#include "meshing.hpp"
#include <csg.hpp>
namespace netgen
{
// find singular edges
void SelectSingularEdges (const Mesh & mesh, const CSGeometry & geom,
INDEX_2_HASHTABLE<int> & singedges,
ZRefinementOptions & opt)
{
int i, j;
// edges selected in csg input file
... | 21.40566 | 137 | 0.504691 | [
"mesh"
] |
1221ac87cdf593173bf118a6b2fd3f695d2041bd | 4,532 | cpp | C++ | src/scope/OUI_Scope.cpp | nik-m2/OUIScript | 36dcbcbe8138731bfa43d1d6b014c276d8f9701a | [
"MIT"
] | 2 | 2018-04-04T23:16:17.000Z | 2018-04-05T05:25:46.000Z | src/scope/OUI_Scope.cpp | c-mcg/OUIScript | 36dcbcbe8138731bfa43d1d6b014c276d8f9701a | [
"MIT"
] | null | null | null | src/scope/OUI_Scope.cpp | c-mcg/OUIScript | 36dcbcbe8138731bfa43d1d6b014c276d8f9701a | [
"MIT"
] | null | null | null | #include "scope/OUI_Scope.h"
#include "scope/OUI_Linker.h"
#include <algorithm>
#include "util/OUI_StringUtil.h"//TODO remove?
#include <iostream>//TODO remove
oui::Scope::~Scope() {
auto it = variables.begin();
while (variables.size() > 0) {
it->second->destroyValue();
delete it->second;
it = variables.eras... | 23.481865 | 104 | 0.677405 | [
"vector"
] |
122317ca6727388f50fd34658d5dcdd4c92c0e7c | 1,558 | cpp | C++ | Path Sum-2.cpp | dishanp/Coding-In-C-and-Cpp | bb615c8c524920f1b0bcbadf1c8b9328aa83616a | [
"BSD-2-Clause"
] | 2 | 2021-10-01T04:20:04.000Z | 2021-10-01T04:20:06.000Z | Path Sum-2.cpp | dishanp/Coding-In-C-and-Cpp | bb615c8c524920f1b0bcbadf1c8b9328aa83616a | [
"BSD-2-Clause"
] | null | null | null | Path Sum-2.cpp | dishanp/Coding-In-C-and-Cpp | bb615c8c524920f1b0bcbadf1c8b9328aa83616a | [
"BSD-2-Clause"
] | 8 | 2021-10-01T04:20:38.000Z | 2022-03-19T17:05:05.000Z | /**
* 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) : val(x), l... | 26.40678 | 93 | 0.535302 | [
"vector"
] |
1228312e206494fbeec310d29c75168f6ea0b8f2 | 14,986 | cc | C++ | src/operators/test/operator_advdiff.cc | fmyuan/amanzi | edb7b815ae6c22956c8519acb9d87b92a9915ed4 | [
"RSA-MD"
] | 37 | 2017-04-26T16:27:07.000Z | 2022-03-01T07:38:57.000Z | src/operators/test/operator_advdiff.cc | fmyuan/amanzi | edb7b815ae6c22956c8519acb9d87b92a9915ed4 | [
"RSA-MD"
] | 494 | 2016-09-14T02:31:13.000Z | 2022-03-13T18:57:05.000Z | src/operators/test/operator_advdiff.cc | fmyuan/amanzi | edb7b815ae6c22956c8519acb9d87b92a9915ed4 | [
"RSA-MD"
] | 43 | 2016-09-26T17:58:40.000Z | 2022-03-25T02:29:59.000Z | /*
Operators
Copyright 2010-201x held jointly by LANS/LANL, LBNL, and PNNL.
Amanzi is released under the three-clause BSD License.
The terms of use and "as is" disclaimer for this license are
provided in the top-level COPYRIGHT file.
Author: Konstantin Lipnikov (lipnikov@lanl.gov)
*/
#include <cstdlib... | 34.770302 | 103 | 0.65014 | [
"mesh",
"vector",
"3d"
] |
1230d527d2d86cf35580fb4834c3e06076b53712 | 5,691 | hh | C++ | src/mem/cache/prefetch/sbooe.hh | fei-shan/gem5-experiment | 70781db30d42b1fe50e495bd04f7755a4b0e0e59 | [
"BSD-3-Clause"
] | 2 | 2021-01-15T17:32:18.000Z | 2021-12-21T02:53:58.000Z | src/mem/cache/prefetch/sbooe.hh | fei-shan/gem5-experiment | 70781db30d42b1fe50e495bd04f7755a4b0e0e59 | [
"BSD-3-Clause"
] | 3 | 2021-03-26T20:33:59.000Z | 2022-01-24T22:54:03.000Z | src/mem/cache/prefetch/sbooe.hh | fei-shan/gem5-experiment | 70781db30d42b1fe50e495bd04f7755a4b0e0e59 | [
"BSD-3-Clause"
] | 3 | 2021-03-27T16:36:19.000Z | 2022-03-28T18:32:57.000Z | /**
* Copyright (c) 2018 Metempsy Technology Consulting
* 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 ... | 34.91411 | 79 | 0.644175 | [
"vector"
] |
12384f6c34d4685e35767bcded8ee1d2d81d2ff6 | 656 | cpp | C++ | Source/Object/renderable.cpp | nanhasa/Blocker | e34ce35ea02468a0bf6bb65900c9209b2fe54df0 | [
"MIT"
] | null | null | null | Source/Object/renderable.cpp | nanhasa/Blocker | e34ce35ea02468a0bf6bb65900c9209b2fe54df0 | [
"MIT"
] | null | null | null | Source/Object/renderable.cpp | nanhasa/Blocker | e34ce35ea02468a0bf6bb65900c9209b2fe54df0 | [
"MIT"
] | null | null | null | #include "Object/renderable.h"
#pragma warning (push, 2) // Temporarily set warning level 2
#include <3rdParty/glm/glm.hpp>
#include <3rdParty/glm/gtc/matrix_transform.hpp>
#pragma warning (pop) // Restore back
Renderable::Renderable(std::shared_ptr<Model> model, unsigned int textureId)
: m_model(model), m_te... | 34.526316 | 77 | 0.745427 | [
"object",
"model",
"transform"
] |
72e99a67dcca5f2e458f24cbb0079a34825dce32 | 1,333 | cpp | C++ | atcoder/others/Educational_DP_Contest/e.cpp | zaurus-yusya/atcoder | 5fc345b3da50222fa1366d1ce52ae58799488cef | [
"MIT"
] | 3 | 2020-05-27T16:27:12.000Z | 2021-01-27T12:47:12.000Z | atcoder/others/Educational_DP_Contest/e.cpp | zaurus-yusya/Competitive-Programming | c72e13a11f76f463510bd4a476b86631d9d1b13a | [
"MIT"
] | null | null | null | atcoder/others/Educational_DP_Contest/e.cpp | zaurus-yusya/Competitive-Programming | c72e13a11f76f463510bd4a476b86631d9d1b13a | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
using Graph = vector<vecto... | 23.803571 | 95 | 0.522131 | [
"vector"
] |
72eb1a2441e848698b6bb8d6354574e6719e27a6 | 21,509 | cxx | C++ | src/Event.cxx | demarley/leopard | 52c5eb2dd732798972d429887c273f8449039c8f | [
"MIT"
] | null | null | null | src/Event.cxx | demarley/leopard | 52c5eb2dd732798972d429887c273f8449039c8f | [
"MIT"
] | 1 | 2018-08-26T16:48:47.000Z | 2018-08-26T16:48:47.000Z | src/Event.cxx | demarley/leopard | 52c5eb2dd732798972d429887c273f8449039c8f | [
"MIT"
] | 1 | 2018-09-06T07:57:03.000Z | 2018-09-06T07:57:03.000Z | /*
Created: 14 August 2018
Last Updated: 14 August 2018
Dan Marley
daniel.edison.marley@cernSPAMNOT.ch
Texas A&M University
-----
Event class
Contains all the objects (& structs) with event information
*/
#include "Analysis/leopard/interface/Event.h"
// constructor
Event::Event( TTreeReader &myReader, con... | 34.747981 | 112 | 0.591613 | [
"object",
"vector"
] |
72eca3314ae2dcc80435ebe9fa67a2fad6a0d9f5 | 25,340 | cpp | C++ | source/comp/markv_codec.cpp | schwa423/SPIRV-Tools | b6319c3a430dbee80f8d85883f3d4fd5a403535c | [
"Apache-2.0"
] | null | null | null | source/comp/markv_codec.cpp | schwa423/SPIRV-Tools | b6319c3a430dbee80f8d85883f3d4fd5a403535c | [
"Apache-2.0"
] | null | null | null | source/comp/markv_codec.cpp | schwa423/SPIRV-Tools | b6319c3a430dbee80f8d85883f3d4fd5a403535c | [
"Apache-2.0"
] | null | null | null | // Copyright (c) 2018 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 ... | 31.954603 | 80 | 0.654696 | [
"vector",
"model"
] |
72fc661c8162bfeca558aa67f08b880093b6bfb8 | 14,203 | hpp | C++ | src/custom_object_type.hpp | sweetkristas/anura | 5e8cbcfc7b761c5c01e5c5509a0fb159b8fb60cd | [
"CC0-1.0"
] | null | null | null | src/custom_object_type.hpp | sweetkristas/anura | 5e8cbcfc7b761c5c01e5c5509a0fb159b8fb60cd | [
"CC0-1.0"
] | null | null | null | src/custom_object_type.hpp | sweetkristas/anura | 5e8cbcfc7b761c5c01e5c5509a0fb159b8fb60cd | [
"CC0-1.0"
] | null | null | null | /*
Copyright (C) 2003-2013 by David White <davewx7@gmail.com>
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 of the License, or
(at your option) any later version.... | 33.576832 | 140 | 0.779624 | [
"render",
"object",
"vector",
"solid"
] |
f404e16e23fd3aa5464d0f11c021dc8bda3b0d39 | 5,545 | hh | C++ | src/solvers/IterativeMethodBelos.hh | fmyuan/amanzi | edb7b815ae6c22956c8519acb9d87b92a9915ed4 | [
"RSA-MD"
] | 37 | 2017-04-26T16:27:07.000Z | 2022-03-01T07:38:57.000Z | src/solvers/IterativeMethodBelos.hh | fmyuan/amanzi | edb7b815ae6c22956c8519acb9d87b92a9915ed4 | [
"RSA-MD"
] | 494 | 2016-09-14T02:31:13.000Z | 2022-03-13T18:57:05.000Z | src/solvers/IterativeMethodBelos.hh | fmyuan/amanzi | edb7b815ae6c22956c8519acb9d87b92a9915ed4 | [
"RSA-MD"
] | 43 | 2016-09-26T17:58:40.000Z | 2022-03-25T02:29:59.000Z | /*
Copyright 2010-201x held jointly by LANS/LANL, LBNL, and PNNL.
Amanzi is released under the three-clause BSD License.
The terms of use and "as is" disclaimer for this license are
provided in the top-level COPYRIGHT file.
Authors: Alicia Klinvex (amklinv@sandia.gov)
Ethan Coon (coonet@ornl.gov)
... | 33.606061 | 109 | 0.707124 | [
"vector"
] |
f40d5ec1a726f0bfe21e261af788a3cf8804f047 | 16,662 | cpp | C++ | src/http.cpp | jjsisjjz/klib | 29348e6fc03c6c5b84e4d5b8da8236ba74f02df8 | [
"MIT"
] | null | null | null | src/http.cpp | jjsisjjz/klib | 29348e6fc03c6c5b84e4d5b8da8236ba74f02df8 | [
"MIT"
] | null | null | null | src/http.cpp | jjsisjjz/klib | 29348e6fc03c6c5b84e4d5b8da8236ba74f02df8 | [
"MIT"
] | 1 | 2021-11-06T14:21:39.000Z | 2021-11-06T14:21:39.000Z | #include "klib/http.h"
#include <cstddef>
#include <filesystem>
#include <string_view>
#include <curl/curl.h>
#include <boost/algorithm/string.hpp>
#include "klib/error.h"
#include "klib/exception.h"
#include "klib/util.h"
// https://curl.se/libcurl/c/multi-single.html
// https://curl.se/libcurl/c/http2-download.ht... | 29.967626 | 80 | 0.662405 | [
"vector"
] |
f41417b1941ec8ef20996aaf6a03a751f5b15fde | 1,290 | cpp | C++ | ass1-int/source/MultiValue.cpp | homoroselaps/DV1565 | 03276e3b0c9cda2b9a7cfe61d8896abe33b4a4ca | [
"MIT"
] | null | null | null | ass1-int/source/MultiValue.cpp | homoroselaps/DV1565 | 03276e3b0c9cda2b9a7cfe61d8896abe33b4a4ca | [
"MIT"
] | null | null | null | ass1-int/source/MultiValue.cpp | homoroselaps/DV1565 | 03276e3b0c9cda2b9a7cfe61d8896abe33b4a4ca | [
"MIT"
] | null | null | null |
#include "MultiValue.h"
#include "Value.h"
#include <cassert>
MultiValue * MultiValue::Create(std::vector<std::shared_ptr<Value>> &values) {
m_type = ValueType::MULTI;
m_values = std::vector<std::shared_ptr<Value>>{};
for (auto value : values) {
if (value->getType() == ValueType::MULTI) {
for (auto subValue :... | 24.339623 | 78 | 0.673643 | [
"vector"
] |
f41617a853fb61f8f818eac8a8b1e3c2e75eb380 | 488 | cpp | C++ | 0901-1000/0915-Partition Array into Disjoint Intervals/0915-Partition Array into Disjoint Intervals.cpp | jiadaizhao/LeetCode | 4ddea0a532fe7c5d053ffbd6870174ec99fc2d60 | [
"MIT"
] | 49 | 2018-05-05T02:53:10.000Z | 2022-03-30T12:08:09.000Z | 0901-1000/0915-Partition Array into Disjoint Intervals/0915-Partition Array into Disjoint Intervals.cpp | jolly-fellow/LeetCode | ab20b3ec137ed05fad1edda1c30db04ab355486f | [
"MIT"
] | 11 | 2017-12-15T22:31:44.000Z | 2020-10-02T12:42:49.000Z | 0901-1000/0915-Partition Array into Disjoint Intervals/0915-Partition Array into Disjoint Intervals.cpp | jolly-fellow/LeetCode | ab20b3ec137ed05fad1edda1c30db04ab355486f | [
"MIT"
] | 28 | 2017-12-05T10:56:51.000Z | 2022-01-26T18:18:27.000Z | class Solution {
public:
int partitionDisjoint(vector<int>& A) {
vector<int> right(A.size());
right.back() = A.back();
for (int i = A.size() - 2; i >= 0; --i) {
right[i] = min(right[i + 1], A[i]);
}
int left = A[0];
for (int i = 0; i < A.size() - ... | 24.4 | 49 | 0.372951 | [
"vector"
] |
f419dc02dfadba5e6e24fb10d9afa0517fd26f23 | 1,941 | cpp | C++ | src/input.cpp | hiddewie/Hartenjagen | b7acd871dddeecaa633a73153f599a4a1925b7e4 | [
"MIT"
] | null | null | null | src/input.cpp | hiddewie/Hartenjagen | b7acd871dddeecaa633a73153f599a4a1925b7e4 | [
"MIT"
] | null | null | null | src/input.cpp | hiddewie/Hartenjagen | b7acd871dddeecaa633a73153f599a4a1925b7e4 | [
"MIT"
] | null | null | null | #include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include "hearts.h"
using namespace std;
Input::Input(int id, int round) :
IPlayer(id, round) {
}
vector<int> Input::passCards() {
Card::sortCardsAscending(this->hand);
cout << "Your current hand is: " << endl;
for (... | 30.328125 | 99 | 0.586296 | [
"vector"
] |
f41af66907b57af601e03e110f8961ef35ffb633 | 3,196 | cc | C++ | operators/base64.cc | vvchernov/onnxruntime-extensions | cc858e831b719d31e4f34ee9adb391105b4ce26b | [
"MIT"
] | 59 | 2021-04-29T07:39:42.000Z | 2022-03-29T21:12:05.000Z | operators/base64.cc | vvchernov/onnxruntime-extensions | cc858e831b719d31e4f34ee9adb391105b4ce26b | [
"MIT"
] | 45 | 2021-05-12T08:32:58.000Z | 2022-03-29T21:11:59.000Z | operators/base64.cc | vvchernov/onnxruntime-extensions | cc858e831b719d31e4f34ee9adb391105b4ce26b | [
"MIT"
] | 18 | 2021-05-10T10:15:46.000Z | 2022-03-22T10:46:36.000Z | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
#include "base64.h"
#include <stdexcept>
const static std::string encodeLookup("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/");
const static char padCharacter = '=';
bool base64_encode(const std::vector... | 34 | 106 | 0.586984 | [
"vector"
] |
f426456edcf0f23ae812527fe665f91f2d3a2531 | 1,682 | cpp | C++ | random_util/sample2.cpp | SimplyCpp/exemplos | 139cd3c7af6885d0f4be45b0049e0f714bce3468 | [
"MIT"
] | 6 | 2015-05-19T06:30:06.000Z | 2018-07-24T08:15:45.000Z | random_util/sample2.cpp | SimplyCpp/exemplos | 139cd3c7af6885d0f4be45b0049e0f714bce3468 | [
"MIT"
] | 1 | 2015-05-19T06:42:38.000Z | 2015-05-19T14:45:49.000Z | random_util/sample2.cpp | SimplyCpp/exemplos | 139cd3c7af6885d0f4be45b0049e0f714bce3468 | [
"MIT"
] | 3 | 2015-10-09T05:54:58.000Z | 2018-07-25T13:52:32.000Z | //Sample provided by Fabio Galuppo
//October 2016
//http://www.simplycpp.com
#include "sample2.hpp"
#include "random_int_util.hpp"
#include <cstdio>
template<typename Integer>
void display_bounds(Integer lower_bound = Integer(-1), Integer upper_bound = Integer(-1))
{
Integer a = lower_bound, b = upper_bound;
if... | 24.028571 | 111 | 0.575505 | [
"3d"
] |
f4377fd3071ba2e55f9e9f53c85a46c9064dbf97 | 10,574 | cpp | C++ | Source/COTD/Map.cpp | jhhoward/CatacombsCGA | 4883a53d612c5d35725552bc84df6d7a5f1881e0 | [
"MIT"
] | 8 | 2020-09-03T19:34:21.000Z | 2022-03-23T04:21:07.000Z | Source/COTD/Map.cpp | jhhoward/CatacombsCGA | 4883a53d612c5d35725552bc84df6d7a5f1881e0 | [
"MIT"
] | null | null | null | Source/COTD/Map.cpp | jhhoward/CatacombsCGA | 4883a53d612c5d35725552bc84df6d7a5f1881e0 | [
"MIT"
] | 1 | 2022-03-23T04:21:16.000Z | 2022-03-23T04:21:16.000Z | #include "Defines.h"
#include "Map.h"
#include "Game.h"
#include "FixedMath.h"
#include "Draw.h"
#include "Platform.h"
#include "Enemy.h"
uint8_t Map::level[MAP_WIDTH * MAP_HEIGHT];
uint8_t Map::roomIndex[MAP_WIDTH * MAP_HEIGHT];
Room Map::rooms[MAX_ROOMS];
bool Map::IsBlocked(uint8_t x, uint8_t y)
{
return GetCell... | 22.739785 | 153 | 0.565065 | [
"render"
] |
f438b67f12ae4e68b9f2e79793aacc169fb1c8d9 | 3,723 | cpp | C++ | 3des_encryption/F.cpp | Deeplygends/encryption_3des | e3eb40c98f963f37edc9eccc275b8246fb4d5105 | [
"MIT"
] | null | null | null | 3des_encryption/F.cpp | Deeplygends/encryption_3des | e3eb40c98f963f37edc9eccc275b8246fb4d5105 | [
"MIT"
] | null | null | null | 3des_encryption/F.cpp | Deeplygends/encryption_3des | e3eb40c98f963f37edc9eccc275b8246fb4d5105 | [
"MIT"
] | null | null | null | #include "f.h"
#include "permutation.h"
f::f(const sequence_d<64>& seq_d)
{
/*
* Valeur des sboxes
*/
int sboxes[8][4][16] = {
{
{14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7},
{0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8},
{4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0... | 29.784 | 124 | 0.463336 | [
"vector"
] |
f43ae78b4d4c62682ec6247055322d03d74effc1 | 19,638 | cpp | C++ | fkie_iop_range_sensor/src/urn_jaus_jss_environmentSensing_RangeSensor/RangeSensor_ReceiveFSM.cpp | fkie/iop_jaus_sensing | 9803ee8ea8e6024a7b8bcb7e17c271dfebc655f3 | [
"BSD-3-Clause"
] | null | null | null | fkie_iop_range_sensor/src/urn_jaus_jss_environmentSensing_RangeSensor/RangeSensor_ReceiveFSM.cpp | fkie/iop_jaus_sensing | 9803ee8ea8e6024a7b8bcb7e17c271dfebc655f3 | [
"BSD-3-Clause"
] | null | null | null | fkie_iop_range_sensor/src/urn_jaus_jss_environmentSensing_RangeSensor/RangeSensor_ReceiveFSM.cpp | fkie/iop_jaus_sensing | 9803ee8ea8e6024a7b8bcb7e17c271dfebc655f3 | [
"BSD-3-Clause"
] | null | null | null | /**
ROS/IOP Bridge
Copyright (c) 2017 Fraunhofer
This program is dual licensed; you can redistribute it and/or
modify it under the terms of the GNU General Public License
version 2 as published by the Free Software Foundation, or
enter into a proprietary license agreement with the copyright
holder.
This program is di... | 46.980861 | 271 | 0.780273 | [
"transform"
] |
f43f5d0c1579de709dfc175f7bf37e57b9be78b0 | 3,555 | cpp | C++ | toonz/sources/toonz/history.cpp | wofogen/tahoma2d | ce5a89a7b1027b2c1769accb91184a2ee6442b4d | [
"BSD-3-Clause"
] | 115 | 2020-11-24T10:36:13.000Z | 2022-03-10T12:57:58.000Z | toonz/sources/toonz/history.cpp | wofogen/tahoma2d | ce5a89a7b1027b2c1769accb91184a2ee6442b4d | [
"BSD-3-Clause"
] | 355 | 2020-11-23T01:06:32.000Z | 2022-03-31T13:46:11.000Z | toonz/sources/toonz/history.cpp | wofogen/tahoma2d | ce5a89a7b1027b2c1769accb91184a2ee6442b4d | [
"BSD-3-Clause"
] | 49 | 2020-11-24T02:46:33.000Z | 2022-03-27T13:33:53.000Z |
#include "history.h"
#include "tsystem.h"
#include "tenv.h"
//#include "tutil.h"
#include "tfilepath_io.h"
#include "toonz/toonzfolders.h"
//#include <fstream.h>
inline TFilePath getHistoryFile() {
return ToonzFolder::getMyModuleDir() + L"file_history.txt";
}
std::string History::Day::getDate() const {
QDate t... | 25.392857 | 79 | 0.569339 | [
"vector"
] |
f459bbc36ecf884eb3846c89e18ba8e09af42056 | 3,093 | hpp | C++ | include/eve/module/combinatorial/regular/lcm.hpp | the-moisrex/eve | 80b52663eefee11460abb0aedf4158a5067cf7dc | [
"MIT"
] | 340 | 2020-09-16T21:12:48.000Z | 2022-03-28T15:40:33.000Z | include/eve/module/combinatorial/regular/lcm.hpp | the-moisrex/eve | 80b52663eefee11460abb0aedf4158a5067cf7dc | [
"MIT"
] | 383 | 2020-09-17T06:56:35.000Z | 2022-03-13T15:58:53.000Z | include/eve/module/combinatorial/regular/lcm.hpp | the-moisrex/eve | 80b52663eefee11460abb0aedf4158a5067cf7dc | [
"MIT"
] | 28 | 2021-02-27T23:11:23.000Z | 2022-03-25T12:31:29.000Z | //==================================================================================================
/*
EVE - Expressive Vector Engine
Copyright : EVE Contributors & Maintainers
SPDX-License-Identifier: MIT
*/
//==================================================================================================
#pr... | 34.752809 | 130 | 0.462011 | [
"object",
"vector"
] |
f45aabca86266b25b773a130e03df39e2742b448 | 3,620 | cpp | C++ | FaceRecognition/elbp.cpp | lishanlu136/FaceRecognition | e1ebf5311a6e5f4285dd48172e5ce36207b5627f | [
"MIT"
] | 6 | 2019-01-26T02:12:37.000Z | 2022-03-14T07:55:06.000Z | FaceRecognition/elbp.cpp | lishanlu136/FaceRecognition | e1ebf5311a6e5f4285dd48172e5ce36207b5627f | [
"MIT"
] | 2 | 2019-03-26T09:04:54.000Z | 2019-11-13T02:56:15.000Z | FaceRecognition/elbp.cpp | lishanlu136/FaceRecognition | e1ebf5311a6e5f4285dd48172e5ce36207b5627f | [
"MIT"
] | 2 | 2019-11-16T13:30:36.000Z | 2020-04-21T14:28:53.000Z | #include "elbp.h"
Mat histc_(const Mat& src, int minVal, int maxVal, bool normed)
{
Mat result;
// Establish the number of bins.
int histSize = maxVal - minVal + 1;
// Set the ranges.
float range[] = { static_cast<float>(minVal), static_cast<float>(maxVal + 1) };
const float* histRange = { range };
// calc hist... | 31.206897 | 204 | 0.64558 | [
"vector"
] |
f45f6bd1b97f532a5e1747610d6a53c494a53ffd | 6,492 | cpp | C++ | Installer project example/Game/Source/Map.cpp | FeroXx07/Game-Installer-Creation | 9c8d1525742619ec5fbd659fd413ebacbccc1140 | [
"MIT"
] | null | null | null | Installer project example/Game/Source/Map.cpp | FeroXx07/Game-Installer-Creation | 9c8d1525742619ec5fbd659fd413ebacbccc1140 | [
"MIT"
] | null | null | null | Installer project example/Game/Source/Map.cpp | FeroXx07/Game-Installer-Creation | 9c8d1525742619ec5fbd659fd413ebacbccc1140 | [
"MIT"
] | null | null | null |
#include "App.h"
#include "Render.h"
#include "Textures.h"
#include "Map.h"
#include "Defs.h"
#include "Log.h"
#include <math.h>
Map::Map() : Module(), mapLoaded(false)
{
name.Create("map");
}
// Destructor
Map::~Map()
{}
// L06: DONE 7: Ask for the value of a custom property
int Properties::GetProperty(const... | 20.161491 | 113 | 0.642483 | [
"render"
] |
c2e282268c211e12123a218ca5a817b8a497c5f2 | 555 | cc | C++ | Alignment/CocoaDDLObjects/src/CocoaSolidShapeTubs.cc | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 852 | 2015-01-11T21:03:51.000Z | 2022-03-25T21:14:00.000Z | Alignment/CocoaDDLObjects/src/CocoaSolidShapeTubs.cc | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 30,371 | 2015-01-02T00:14:40.000Z | 2022-03-31T23:26:05.000Z | Alignment/CocoaDDLObjects/src/CocoaSolidShapeTubs.cc | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 3,240 | 2015-01-02T05:53:18.000Z | 2022-03-31T17:24:21.000Z | // COCOA class implementation file
// Id: CocoaSolidShapeTubs.cc
// CAT: Model
//
// History: v1.0
// Pedro Arce
#include <fstream>
#include <map>
#include "Alignment/CocoaDDLObjects/interface/CocoaSolidShapeTubs.h"
CocoaSolidShapeTubs::CocoaSolidShapeTubs(
const ALIstring type, ALIfloat pRMin,... | 26.428571 | 104 | 0.715315 | [
"model"
] |
c2e5b8253a2cf07e433d13feda784ccb574ebd23 | 13,875 | cpp | C++ | src/stella.cpp | sci4me/Stella | 220416ea25e72bd7db4bc3602c04c5451ed59deb | [
"MIT"
] | 1 | 2020-11-23T06:16:25.000Z | 2020-11-23T06:16:25.000Z | src/stella.cpp | sci4me/Stella | 220416ea25e72bd7db4bc3602c04c5451ed59deb | [
"MIT"
] | null | null | null | src/stella.cpp | sci4me/Stella | 220416ea25e72bd7db4bc3602c04c5451ed59deb | [
"MIT"
] | null | null | null | #include "platform_interface.hpp"
#include "stella.hpp"
// NOTE: I have yet to decide whether I truly want these
// to be globals or not. So far it's been fine but... eh.
// Sometimes I feel like I'd be more comfortable
// accessing them through the PlatformAPI struct. EXCEPT...
// In the static compilation case, tha... | 30.561674 | 147 | 0.612324 | [
"render"
] |
c2e62b205cb88cab85e827a36bdc4697ec45aab1 | 8,914 | hpp | C++ | tpcc_silo/tpcc/tpcc_util.hpp | masa16/ccbench | c4b67dfd025775bba87785b44fa7fd43fbb90055 | [
"Apache-2.0"
] | 30 | 2019-03-20T07:23:53.000Z | 2022-02-01T01:00:02.000Z | tpcc_silo/tpcc/tpcc_util.hpp | masa16/ccbench | c4b67dfd025775bba87785b44fa7fd43fbb90055 | [
"Apache-2.0"
] | 8 | 2019-06-06T04:24:16.000Z | 2021-12-10T05:55:35.000Z | tpcc_silo/tpcc/tpcc_util.hpp | masa16/ccbench | c4b67dfd025775bba87785b44fa7fd43fbb90055 | [
"Apache-2.0"
] | 10 | 2019-07-21T15:24:19.000Z | 2022-03-15T02:07:23.000Z | #pragma once
#include <string_view>
#include <cstring>
#include <cinttypes>
#include <sstream>
#include <cstdio>
#include <cassert>
#include <vector>
#include "../include/random.hh"
template<typename Int>
Int byteswap(Int in) {
switch (sizeof(Int)) {
case 1:
return in;
case 2:
return __builtin_... | 25.468571 | 110 | 0.640902 | [
"vector"
] |
c2efa394b337ff972e090b9647b8f06984b93cef | 18,679 | cpp | C++ | pyoptsparse/pyNOMAD/source/nomad_src/Point.cpp | robfalck/pyoptsparse | c99f4bfe8961492d0a1879f9ecff7a2fbb3c8c1d | [
"CNRI-Python"
] | 26 | 2020-08-25T16:16:21.000Z | 2022-03-10T08:23:57.000Z | pyoptsparse/pyNOMAD/source/nomad_src/Point.cpp | robfalck/pyoptsparse | c99f4bfe8961492d0a1879f9ecff7a2fbb3c8c1d | [
"CNRI-Python"
] | 90 | 2020-08-24T23:02:47.000Z | 2022-03-29T13:48:15.000Z | pyoptsparse/pyNOMAD/source/nomad_src/Point.cpp | robfalck/pyoptsparse | c99f4bfe8961492d0a1879f9ecff7a2fbb3c8c1d | [
"CNRI-Python"
] | 25 | 2020-08-24T19:28:24.000Z | 2022-01-27T21:17:37.000Z | /*-------------------------------------------------------------------------------------*/
/* NOMAD - Nonlinear Optimization by Mesh Adaptive Direct search - version 3.7.1 */
/* */
/* Copyright (C) 2001-2015 Mark Abramson ... | 31.929915 | 91 | 0.394614 | [
"mesh"
] |
c2efbc6e338bac04a70cc8a0043b6f45e308d291 | 6,038 | cpp | C++ | src/RemotePhotoTool/CameraFileSystemFileListView.cpp | vividos/RemotePhotoTool | d17ae2abbda531acbd0ec8e90ddc4856c4fdfa00 | [
"BSD-2-Clause"
] | 16 | 2015-03-26T02:32:43.000Z | 2021-10-18T16:34:31.000Z | src/RemotePhotoTool/CameraFileSystemFileListView.cpp | vividos/RemotePhotoTool | d17ae2abbda531acbd0ec8e90ddc4856c4fdfa00 | [
"BSD-2-Clause"
] | 7 | 2019-02-21T06:07:09.000Z | 2022-01-01T10:00:50.000Z | src/RemotePhotoTool/CameraFileSystemFileListView.cpp | vividos/RemotePhotoTool | d17ae2abbda531acbd0ec8e90ddc4856c4fdfa00 | [
"BSD-2-Clause"
] | 6 | 2019-05-07T09:21:15.000Z | 2021-09-01T06:36:24.000Z | //
// RemotePhotoTool - remote camera control software
// Copyright (C) 2008-2020 Michael Fink
//
/// \file CameraFileSystemFileListView.cpp File list view for camera file system
//
#include "stdafx.h"
#include "CameraFileSystemFileListView.hpp"
#include "CameraFileSystemDropSource.hpp"
#include "SystemImageList.hpp"
#... | 29.891089 | 132 | 0.70901 | [
"vector"
] |
c2fd78092bd62eca6df7041521223f112b332cda | 8,093 | cpp | C++ | lwr_controllers/src/one_task_inverse_dynamics_jl.cpp | tecnalia-advancedmanufacturing-robotics/kuka-lwr | 6ee3eecc7df70beda20dbdd41e4f409d56bb88a5 | [
"Unlicense"
] | 106 | 2015-01-20T12:45:32.000Z | 2022-03-17T11:27:28.000Z | lwr_controllers/src/one_task_inverse_dynamics_jl.cpp | tecnalia-advancedmanufacturing-robotics/kuka-lwr | 6ee3eecc7df70beda20dbdd41e4f409d56bb88a5 | [
"Unlicense"
] | 92 | 2015-01-26T09:08:37.000Z | 2021-10-13T09:31:41.000Z | lwr_controllers/src/one_task_inverse_dynamics_jl.cpp | tecnalia-advancedmanufacturing-robotics/kuka-lwr | 6ee3eecc7df70beda20dbdd41e4f409d56bb88a5 | [
"Unlicense"
] | 93 | 2015-01-23T16:39:20.000Z | 2021-12-09T09:24:39.000Z | #include <lwr_controllers/one_task_inverse_dynamics_jl.h>
#include <utils/pseudo_inversion.h>
#include <utils/skew_symmetric.h>
#include <pluginlib/class_list_macros.h>
#include <kdl_parser/kdl_parser.hpp>
#include <Eigen/LU>
#include <math.h>
namespace lwr_controllers
{
OneTaskInverseDynamicsJL::OneTaskInverseDyn... | 30.085502 | 150 | 0.6581 | [
"vector"
] |
6c016f11e003432f4fd0acca9b4ee1ccf3529353 | 3,119 | cc | C++ | chromeos/printing/printer_translator.cc | metux/chromium-deb | 3c08e9b89a1b6f95f103a61ff4f528dbcd57fc42 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | chromeos/printing/printer_translator.cc | metux/chromium-deb | 3c08e9b89a1b6f95f103a61ff4f528dbcd57fc42 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | chromeos/printing/printer_translator.cc | metux/chromium-deb | 3c08e9b89a1b6f95f103a61ff4f528dbcd57fc42 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | // Copyright 2016 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 "chromeos/printing/printer_translator.h"
#include <memory>
#include <string>
#include <utility>
#include <vector>
#include "base/memory/ptr_uti... | 26.887931 | 80 | 0.714011 | [
"object",
"vector",
"model"
] |
6c06672ea87a7f401a9f0157f29d0dc47f60713f | 2,718 | hpp | C++ | exhaustive_subsequence.hpp | 55jflores/jflores_cpsc335_proj3 | 293753f54bd3c2dac6a30a9cd1f04853f38d3596 | [
"MIT"
] | null | null | null | exhaustive_subsequence.hpp | 55jflores/jflores_cpsc335_proj3 | 293753f54bd3c2dac6a30a9cd1f04853f38d3596 | [
"MIT"
] | null | null | null | exhaustive_subsequence.hpp | 55jflores/jflores_cpsc335_proj3 | 293753f54bd3c2dac6a30a9cd1f04853f38d3596 | [
"MIT"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
// exhaustive_subsequence.hpp
//
// Exhaustive search algorithms for the longest substring, and longest
// subsequence, problems.
//
///////////////////////////////////////////////////////////////////////////////
#pragma once
#include <al... | 25.166667 | 82 | 0.510302 | [
"vector"
] |
6c0d229174840396a0eade3a0d069bef48f9fb30 | 2,662 | cc | C++ | stats.cc | haehn/cs410fullrun | d3740ef9774c7194540e2cae3776364fb3fbbc88 | [
"MIT"
] | null | null | null | stats.cc | haehn/cs410fullrun | d3740ef9774c7194540e2cae3776364fb3fbbc88 | [
"MIT"
] | null | null | null | stats.cc | haehn/cs410fullrun | d3740ef9774c7194540e2cae3776364fb3fbbc88 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
template <typename T>
class Stats {
public:
T get_min(std::vector<T> v);
T get_max(std::vector<T> v);
float get_mean(std::vector<T> v);
float get_stddev(std::vector<T> v);
};... | 16.742138 | 85 | 0.577385 | [
"vector"
] |
6c0dc9bf3145c2813d50c0aafac35a1b7fcd2b67 | 7,445 | cpp | C++ | src/Bottleneck_distance/example/alpha_rips_persistence_bottleneck_distance.cpp | jmarino/gudhi-devel | b1824e4de6fd1d037af3c1341c3065731472ffc8 | [
"MIT"
] | 2 | 2020-01-27T03:32:18.000Z | 2021-03-14T21:14:14.000Z | src/Bottleneck_distance/example/alpha_rips_persistence_bottleneck_distance.cpp | jmarino/gudhi-devel | b1824e4de6fd1d037af3c1341c3065731472ffc8 | [
"MIT"
] | 1 | 2020-08-25T16:03:23.000Z | 2020-08-28T07:36:21.000Z | src/Bottleneck_distance/example/alpha_rips_persistence_bottleneck_distance.cpp | jmarino/gudhi-devel | b1824e4de6fd1d037af3c1341c3065731472ffc8 | [
"MIT"
] | 2 | 2019-11-06T12:36:23.000Z | 2020-08-25T14:53:13.000Z | /* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
* See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
* Author(s): Vincent Rouvreau
*
* Copyright (C) 2017 Inria
*
* Modification(s):
* - YYYY/MM Author: ... | 41.592179 | 129 | 0.663264 | [
"vector",
"transform"
] |
6c151954f2354a19ba338d0f4c64f3df8834bdb4 | 4,609 | cpp | C++ | test/test_file.cpp | allenbo/libgdrive | a7838bcf55fbbc6cfb66209bb2db1fbe82758924 | [
"MIT"
] | 16 | 2015-05-04T01:05:12.000Z | 2022-03-13T05:25:34.000Z | test/test_file.cpp | allenbo/libgdrive | a7838bcf55fbbc6cfb66209bb2db1fbe82758924 | [
"MIT"
] | 1 | 2019-07-28T19:28:49.000Z | 2021-05-14T14:08:57.000Z | test/test_file.cpp | allenbo/libgdrive | a7838bcf55fbbc6cfb66209bb2db1fbe82758924 | [
"MIT"
] | 3 | 2019-12-06T17:48:44.000Z | 2021-12-07T02:07:29.000Z | #include "gdrive/oauth.hpp"
#include "gdrive/credential.hpp"
#include "gdrive/drive.hpp"
#include "gdrive/servicerequest.hpp"
#include <iostream>
#include <assert.h>
using namespace GDRIVE;
int main() {
char* user_home = getenv("HOME");
if (user_home == NULL) {
fprintf(stderr, "No $HOME environment va... | 30.322368 | 153 | 0.583424 | [
"vector"
] |
6c1f2389702ad54db2a0d07ee6ff7c94ad7c67c4 | 1,529 | tpp | C++ | src/squareMatrix.tpp | tstuessi/matrix | e189d35589887c37c3acc25790b1c3840ea3c5b0 | [
"MIT"
] | null | null | null | src/squareMatrix.tpp | tstuessi/matrix | e189d35589887c37c3acc25790b1c3840ea3c5b0 | [
"MIT"
] | null | null | null | src/squareMatrix.tpp | tstuessi/matrix | e189d35589887c37c3acc25790b1c3840ea3c5b0 | [
"MIT"
] | null | null | null | #include <vector>
#include <cmath>
using namespace std;
template<typename tElement>
matrix<tElement> matrix<tElement>::inverse() {
if(mRows != mColumns) {
operationsError = true;
return *this;
}
matrix<tElement> c = *this;
matrix<tElement> d(c.mRows, c.mColumns);
for(int i = 0; (i < c.mRows) && (i < c.mColu... | 21.236111 | 70 | 0.551995 | [
"vector"
] |
6c1f41cc65f5d983efd994a2a6023eb5ef54baa6 | 3,603 | hh | C++ | extern/acgl/include/ACGL/Utils/StringHelpers.hh | Faerbit/Saxum | 3b255142337e08988f2b4f1f56d6e061e8754336 | [
"CC-BY-3.0",
"CC-BY-4.0"
] | 2 | 2015-03-12T16:19:10.000Z | 2015-11-24T20:23:26.000Z | extern/acgl/include/ACGL/Utils/StringHelpers.hh | Faerbit/Saxum | 3b255142337e08988f2b4f1f56d6e061e8754336 | [
"CC-BY-3.0",
"CC-BY-4.0"
] | 15 | 2015-03-14T14:13:12.000Z | 2015-06-02T18:39:55.000Z | extern/acgl/include/ACGL/Utils/StringHelpers.hh | Faerbit/Saxum | 3b255142337e08988f2b4f1f56d6e061e8754336 | [
"CC-BY-3.0",
"CC-BY-4.0"
] | null | null | null | /***********************************************************************
* Copyright 2011-2012 Computer Graphics Group RWTH Aachen University. *
* All rights reserved. *
* Distributed under the terms of the MIT License (see LICENSE.TXT). *
***************************... | 39.593407 | 126 | 0.642243 | [
"vector"
] |
6c229a898f13a4af6ad3e92e1578098a7581f49c | 511 | cpp | C++ | sprint01/t01/src/moveAlong.cpp | viacheslavpleshkov/unit-factory-ucode-half-marathon-c | 9ff260290382ea03b07e28a92c0f922ec85d31d0 | [
"MIT"
] | null | null | null | sprint01/t01/src/moveAlong.cpp | viacheslavpleshkov/unit-factory-ucode-half-marathon-c | 9ff260290382ea03b07e28a92c0f922ec85d31d0 | [
"MIT"
] | null | null | null | sprint01/t01/src/moveAlong.cpp | viacheslavpleshkov/unit-factory-ucode-half-marathon-c | 9ff260290382ea03b07e28a92c0f922ec85d31d0 | [
"MIT"
] | null | null | null | #include "moveAlong.h"
void moveAlong(std::vector<std::string> arguments) {
std::vector<std::string> temp = arguments;
for (int i = 0; i < temp.size(); i++) {
for (int j = 0; temp[i][j]; j++)
temp[i][j] = tolower(temp[i][j]);
if (temp[i].find("mercer") != std::string::npos ||
... | 30.058824 | 74 | 0.497065 | [
"vector"
] |
6c262f4a57ffbb8b89a9861943a723bdd41015f9 | 1,669 | hpp | C++ | src/entropy.hpp | jnferguson/entropyDeviation | 8b66ea73d1be76a375f3506892e86da1386e1e30 | [
"BSD-2-Clause"
] | null | null | null | src/entropy.hpp | jnferguson/entropyDeviation | 8b66ea73d1be76a375f3506892e86da1386e1e30 | [
"BSD-2-Clause"
] | null | null | null | src/entropy.hpp | jnferguson/entropyDeviation | 8b66ea73d1be76a375f3506892e86da1386e1e30 | [
"BSD-2-Clause"
] | null | null | null | #ifndef HAVE_ENTROPY_HPP
#define HAVE_ENTROPY_HPP
#define _USE_MATH_DEFINES
#include <cstdint>
#include <stdexcept>
#include <vector>
#include <array>
#include <memory>
#include <random>
#include <math.h>
#include <string.h>
#include "entropy_retval.hpp"
#include "entropy_chunk.hpp"
#include "dist.hpp"
typedef std::... | 25.676923 | 88 | 0.713002 | [
"vector"
] |
6c26841ee5ddae67a73baa9044fb8dd82570dd02 | 55,373 | cpp | C++ | Source/Engine/World/Private/Components/InputComponent.cpp | CodeLikeCXK/AngieEngine | 26f3cfdb1fdef6378ee75b000b8fe966bebb3a6e | [
"MIT"
] | 24 | 2019-07-15T22:48:44.000Z | 2021-11-02T04:42:48.000Z | Source/Engine/World/Private/Components/InputComponent.cpp | CodeLikeCXK/AngieEngine | 26f3cfdb1fdef6378ee75b000b8fe966bebb3a6e | [
"MIT"
] | 1 | 2021-11-02T09:41:31.000Z | 2021-11-05T18:35:14.000Z | Source/Engine/World/Private/Components/InputComponent.cpp | CodeLikeCXK/AngieEngine | 26f3cfdb1fdef6378ee75b000b8fe966bebb3a6e | [
"MIT"
] | 3 | 2020-02-03T08:34:50.000Z | 2021-07-28T05:19:22.000Z | /*
Angie Engine Source Code
MIT License
Copyright (C) 2017-2021 Alexander Samusev.
This file is part of the Angie Engine Source Code.
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 re... | 35.359515 | 172 | 0.57808 | [
"object"
] |
6c32687f3886f8cd777215cf1cd1009a5a363611 | 28,040 | cpp | C++ | StuFW/src/lcd/menu/menu_advanced.cpp | onekk/StuFW | 9dd7cd41c0cec2749ded8d1d97b7f9fcaa61489b | [
"RSA-MD"
] | 1 | 2020-12-30T21:45:12.000Z | 2020-12-30T21:45:12.000Z | StuFW/src/lcd/menu/menu_advanced.cpp | onekk/StuFW | 9dd7cd41c0cec2749ded8d1d97b7f9fcaa61489b | [
"RSA-MD"
] | 1 | 2020-08-24T16:17:25.000Z | 2020-08-24T16:17:25.000Z | StuFW/src/lcd/menu/menu_advanced.cpp | onekk/StuFW | 9dd7cd41c0cec2749ded8d1d97b7f9fcaa61489b | [
"RSA-MD"
] | null | null | null | /**
* StuFW Firmware for 3D Printer
*
* Based on MK4duo, Marlin, Sprinter and grbl
* Copyright (C) 2011 Camiel Gubbels / Erik van der Zalm
* Copyright (C) 2013 Alberto Cotronei @MagoKimbra
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Pu... | 44.649682 | 180 | 0.696291 | [
"3d"
] |
6c3e43153d47fe7d9abc426c427c57763120b36e | 11,188 | cpp | C++ | src/fgseaMultilevelSupplement.cpp | vdsukhov/fgsea | d45a181fa3afca7ea197501b7ce1489c98927398 | [
"MIT"
] | 261 | 2016-05-12T09:28:23.000Z | 2022-03-24T22:58:01.000Z | src/fgseaMultilevelSupplement.cpp | vdsukhov/fgsea | d45a181fa3afca7ea197501b7ce1489c98927398 | [
"MIT"
] | 101 | 2016-06-27T18:33:01.000Z | 2022-03-24T07:01:44.000Z | src/fgseaMultilevelSupplement.cpp | vdsukhov/fgsea | d45a181fa3afca7ea197501b7ce1489c98927398 | [
"MIT"
] | 56 | 2016-09-28T10:14:26.000Z | 2022-01-07T19:44:41.000Z | #include "fgseaMultilevelSupplement.h"
#include "esCalculation.h"
#include "util.h"
double betaMeanLog(unsigned long a, unsigned long b) {
return boost::math::digamma(a) - boost::math::digamma(b + 1);
}
pair<double, bool> calcLogCorrection(const vector<unsigned int> &probCorrector,
... | 34.530864 | 173 | 0.542724 | [
"vector"
] |
6c407cb1a4f35f0a87fc204c520c1277640889a9 | 5,398 | c++ | C++ | tests/core/slot.test.c++ | 1094387012/SKUI | c85dd7fb9d30ff15d5d6de184670cb47e46df6de | [
"MIT"
] | 309 | 2017-05-06T02:15:43.000Z | 2022-03-23T08:27:05.000Z | tests/core/slot.test.c++ | qdtroy/skui | 201707d06bd29c9ec4b05350b25b777493d5362e | [
"MIT"
] | 20 | 2018-05-11T20:56:45.000Z | 2022-03-11T06:10:12.000Z | tests/core/slot.test.c++ | qdtroy/skui | 201707d06bd29c9ec4b05350b25b777493d5362e | [
"MIT"
] | 48 | 2017-06-27T06:04:15.000Z | 2022-03-01T12:56:32.000Z | /**
* The MIT License (MIT)
*
* Copyright © 2017-2020 Ruben Van Boxem
*
* 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
* ... | 34.602564 | 109 | 0.668581 | [
"object"
] |
6c408a48e4625ce10c7c5a0693b480c4d8e324f8 | 809 | cpp | C++ | src/DSP/oscillators/cheap/CheapPulse.cpp | nspotrepka/ofxPDSP | e106991f4abf4314116d4e7c4ef7ad69d6ca005f | [
"MIT"
] | 288 | 2016-02-06T18:50:47.000Z | 2022-03-21T12:54:30.000Z | src/DSP/oscillators/cheap/CheapPulse.cpp | thomasgeissl/ofxPDSP | 9109a38f0dbc1de21cfa8ddc374a78f56a7649ac | [
"MIT"
] | 68 | 2016-03-09T15:12:48.000Z | 2021-11-29T14:05:49.000Z | src/DSP/oscillators/cheap/CheapPulse.cpp | thomasgeissl/ofxPDSP | 9109a38f0dbc1de21cfa8ddc374a78f56a7649ac | [
"MIT"
] | 37 | 2016-02-11T20:36:28.000Z | 2022-01-23T17:31:22.000Z |
#include "CheapPulse.h"
pdsp::CheapPulse::CheapPulse(){
input_shape.setDefaultValue( 0.5f );
}
pdsp::Patchable& pdsp::CheapPulse::set(float pulseWidth){
if(pulseWidth>1.0f){
input_shape.setDefaultValue(1.0f);
}else if(pulseWidth<0.0f){
input_shape.setDefaultValue(0.0f);
}else{
... | 27.896552 | 139 | 0.718171 | [
"shape"
] |
6c466fb21fb46e09961dc874e9e39655f83d17c6 | 6,508 | cc | C++ | paddle/fluid/framework/ir/graph_pattern_detector_tester.cc | ysh329/Paddle | 50ad9046c9a440564d104eaa354eb9df83a35678 | [
"Apache-2.0"
] | 8 | 2019-06-16T12:36:11.000Z | 2021-03-05T05:33:21.000Z | paddle/fluid/framework/ir/graph_pattern_detector_tester.cc | ysh329/Paddle | 50ad9046c9a440564d104eaa354eb9df83a35678 | [
"Apache-2.0"
] | 1 | 2016-12-22T10:52:40.000Z | 2016-12-22T13:28:20.000Z | paddle/fluid/framework/ir/graph_pattern_detector_tester.cc | ysh329/Paddle | 50ad9046c9a440564d104eaa354eb9df83a35678 | [
"Apache-2.0"
] | 25 | 2019-12-07T02:14:14.000Z | 2021-12-30T06:16:30.000Z | // Copyright (c) 2018 PaddlePaddle 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... | 31.439614 | 80 | 0.624309 | [
"shape"
] |
6c4a74c94c2e37f66631d2ceb0b53d4cbae1748c | 2,540 | cpp | C++ | aws-cpp-sdk-network-firewall/source/model/AttachmentStatus.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-02-12T08:09:30.000Z | 2022-02-12T08:09:30.000Z | aws-cpp-sdk-network-firewall/source/model/AttachmentStatus.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2021-10-14T16:57:00.000Z | 2021-10-18T10:47:24.000Z | aws-cpp-sdk-network-firewall/source/model/AttachmentStatus.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/network-firewall/model/AttachmentStatus.h>
#include <aws/core/utils/HashingUtils.h>
#include <aws/core/Globals.h>
#include <aws/core/utils/EnumParseOverflowContainer.h>
using namespace ... | 29.882353 | 92 | 0.61063 | [
"model"
] |
6c538b60b5aa25f1eff965918d41cb27d05173ce | 912 | hpp | C++ | cpp/include/piece.hpp | ford442/3dtris | 397e1de677a7d76ec1a252f79f7dcb8c563d4db5 | [
"Apache-2.0"
] | null | null | null | cpp/include/piece.hpp | ford442/3dtris | 397e1de677a7d76ec1a252f79f7dcb8c563d4db5 | [
"Apache-2.0"
] | null | null | null | cpp/include/piece.hpp | ford442/3dtris | 397e1de677a7d76ec1a252f79f7dcb8c563d4db5 | [
"Apache-2.0"
] | null | null | null | #ifndef __PIECE_HPP__
#define __PIECE_HPP__
#include "api.hpp"
#include <vector>
struct Rotation{
Axis axis;
RotationDirection direction;
};
struct Piece{
private:
Pos3d center;
std::vector <Block> blocks;
public:
Piece(std::vector <Block> blocks_) : Piece(Pos3d{0,0,0},blocks_){}
Piece(Pos3d center_,std::vector <Block>... | 26.057143 | 84 | 0.756579 | [
"vector"
] |
4843965c451c7b23c925f3466a9f6f79166f1b9f | 10,556 | cpp | C++ | NeatLib/NeatLib/Genome.cpp | CodeBulletin/NEAT-CPlusPlus | 9b8415a14dd5727083a866040248bf8567f4f68e | [
"MIT"
] | null | null | null | NeatLib/NeatLib/Genome.cpp | CodeBulletin/NEAT-CPlusPlus | 9b8415a14dd5727083a866040248bf8567f4f68e | [
"MIT"
] | null | null | null | NeatLib/NeatLib/Genome.cpp | CodeBulletin/NEAT-CPlusPlus | 9b8415a14dd5727083a866040248bf8567f4f68e | [
"MIT"
] | null | null | null | #include "Genome.hpp"
#include "Node.hpp"
#include "ConnectionGene.hpp"
#include "ConnectionHistory.hpp"
#include "extras.hpp"
#include <string>
#include <iostream>
namespace NEAT {
Genome::Genome() : m_settings{}, m_nextNode{ 0 }, m_layers{ 0 }, m_biasNode{ 0 }, m_inputNodes{ 0 },
m_outputNodes{ 0 }, m... | 31.416667 | 109 | 0.686434 | [
"vector"
] |
4846e8eab77479b2c654df27eadcc12c4eab84bc | 609 | hpp | C++ | src/wavebrain.hpp | jamiesyme/CozyCape | 11228119402bf39bbc30aeea242d07fbde6f9994 | [
"Unlicense"
] | null | null | null | src/wavebrain.hpp | jamiesyme/CozyCape | 11228119402bf39bbc30aeea242d07fbde6f9994 | [
"Unlicense"
] | null | null | null | src/wavebrain.hpp | jamiesyme/CozyCape | 11228119402bf39bbc30aeea242d07fbde6f9994 | [
"Unlicense"
] | null | null | null | #pragma once
#include "gameobject.hpp"
#include "tickable.hpp"
#include "counter.hpp"
class WaveBrain : public GameObject,
public Tickable {
public:
WaveBrain();
~WaveBrain();
void onInit();
void onKill();
void onTick(float dt);
void onMessage(const std::string& msg, GameObject* go);
void... | 17.911765 | 56 | 0.681445 | [
"vector"
] |
484a2dacb9022a9732a5bbadfa2716f124c0267a | 3,089 | hpp | C++ | src/nonlin/Newton.hpp | spraetor/amdis2 | 53c45c81a65752a8fafbb54f9ae6724a86639dcd | [
"MIT"
] | 2 | 2018-07-04T16:44:04.000Z | 2021-01-03T07:26:27.000Z | src/nonlin/Newton.hpp | spraetor/amdis2 | 53c45c81a65752a8fafbb54f9ae6724a86639dcd | [
"MIT"
] | null | null | null | src/nonlin/Newton.hpp | spraetor/amdis2 | 53c45c81a65752a8fafbb54f9ae6724a86639dcd | [
"MIT"
] | null | null | null | #pragma once
// AMDiS includes
#include "CreatorInterface.hpp"
#include "io/VtkWriter.hpp"
#include "nonlin/NonLinSolver.hpp"
#include "solver/LinearSolverInterface.hpp"
namespace AMDiS
{
/**
* \ingroup Solver
*
* \Brief
* Implements the newton method for solving a non linear system. Sub class of
* N... | 23.052239 | 79 | 0.53642 | [
"object"
] |
484fd19ac4ff0311008a01a25e955a27a5a10547 | 9,067 | cc | C++ | SMC/SW/HOST/app/multithread_pim_queue/main_singlepim.cc | tanvirarafin/Brown-SMCSim | ff3d9334c1d5c8d6a00421848c0d51e50e6b67f8 | [
"MIT"
] | 10 | 2019-10-21T08:33:13.000Z | 2021-06-17T00:21:13.000Z | SMC/SW/HOST/app/multithread_pim_queue/main_singlepim.cc | tanvirarafin/Brown-SMCSim | ff3d9334c1d5c8d6a00421848c0d51e50e6b67f8 | [
"MIT"
] | null | null | null | SMC/SW/HOST/app/multithread_pim_queue/main_singlepim.cc | tanvirarafin/Brown-SMCSim | ff3d9334c1d5c8d6a00421848c0d51e50e6b67f8 | [
"MIT"
] | 6 | 2019-06-20T14:57:50.000Z | 2021-06-05T20:08:26.000Z | #include "pim_api.hh"
#include <unistd.h>
#include <iostream>
#include <unistd.h>
#include <cstring>
#include <iomanip>
#include "app_utils.hh" // This must be included before anything else
#include <stdlib.h> // srand(), rand()
#include <time.h> // time()
#include "utils.hh"
#ifdef HOST_DEBUG_ON
... | 31.702797 | 139 | 0.594463 | [
"vector"
] |
48542408c9d0808efff71078faa697f06f9b207c | 15,143 | cpp | C++ | src/bindings.cpp | jeroenooms/poppler | 481dad60cffa1daa4c60339bb7d579d46a8e47d4 | [
"MIT"
] | 14 | 2016-02-24T19:33:49.000Z | 2016-02-26T16:39:20.000Z | src/bindings.cpp | jeroenooms/poppler | 481dad60cffa1daa4c60339bb7d579d46a8e47d4 | [
"MIT"
] | 3 | 2016-02-25T17:50:47.000Z | 2016-02-25T23:56:53.000Z | src/bindings.cpp | jeroenooms/pdftools | 481dad60cffa1daa4c60339bb7d579d46a8e47d4 | [
"MIT"
] | null | null | null | #define R_NO_REMAP
#define STRICT_R_HEADERS
#include <poppler-document.h>
#include <poppler-page.h>
#include <poppler-font.h>
#include <poppler-version.h>
#include <poppler-embedded-file.h>
#include <poppler-image.h>
#include <poppler-toc.h>
#include <poppler-page-renderer.h>
#include <Rcpp.h>
#include <cstring>
#incl... | 34.105856 | 119 | 0.664069 | [
"vector"
] |
48563121bfb1868d1f4647cde587815d75b5e6cf | 10,256 | cc | C++ | gjstest/internal/cpp/run_tests.cc | stephenfarrar/gjstest | a078b78cf28651a84b552c9b644106ba42507412 | [
"Apache-2.0"
] | null | null | null | gjstest/internal/cpp/run_tests.cc | stephenfarrar/gjstest | a078b78cf28651a84b552c9b644106ba42507412 | [
"Apache-2.0"
] | null | null | null | gjstest/internal/cpp/run_tests.cc | stephenfarrar/gjstest | a078b78cf28651a84b552c9b644106ba42507412 | [
"Apache-2.0"
] | null | null | null | // Copyright 2010 Google Inc. All Rights Reserved.
// Author: jacobsa@google.com (Aaron Jacobs)
//
// 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/LI... | 30.253687 | 80 | 0.668974 | [
"object",
"vector"
] |
485663629ee84fed0d6653a593429f932880b940 | 15,437 | cpp | C++ | src/Planet.cpp | connorcl/genetic-simulation | 0af17ad6645f16817b2855a20ff81b07750d2377 | [
"MIT"
] | null | null | null | src/Planet.cpp | connorcl/genetic-simulation | 0af17ad6645f16817b2855a20ff81b07750d2377 | [
"MIT"
] | null | null | null | src/Planet.cpp | connorcl/genetic-simulation | 0af17ad6645f16817b2855a20ff81b07750d2377 | [
"MIT"
] | null | null | null | #include "Planet.h"
#include "helper/benchmark_helper.h"
#include <cmath>
#include <vector>
#include <chrono>
#include <string>
#include <memory>
#ifdef GPU_SUPPORT
#include <amp.h>
#include <amp_math.h>
#endif
#include <algorithm>
#include <thread>
#include <boost/math/special_functions/sign.hpp>
using std::vector;
u... | 41.609164 | 142 | 0.761288 | [
"vector"
] |
485b3ad6450c82ff11638a83347f83cf02ace50c | 1,713 | cpp | C++ | Graph Theory/Spanning Tree/kruskals_algorithm.cpp | binarybeast004/Competitive-Programming | 4bbc84a9c06139d4cf0c719f253da672917dc669 | [
"MIT"
] | 1 | 2021-12-30T09:14:39.000Z | 2021-12-30T09:14:39.000Z | Graph Theory/Spanning Tree/kruskals_algorithm.cpp | binarybeast004/Competitive-Programming | 4bbc84a9c06139d4cf0c719f253da672917dc669 | [
"MIT"
] | 1 | 2022-01-17T13:34:53.000Z | 2022-01-17T13:34:53.000Z | Graph Theory/Spanning Tree/kruskals_algorithm.cpp | binarybeast004/Competitive-Programming | 4bbc84a9c06139d4cf0c719f253da672917dc669 | [
"MIT"
] | 2 | 2021-12-30T09:23:06.000Z | 2022-01-17T13:27:14.000Z | #include<bits/stdc++.h>
using namespace std;
class DSU {
vector<int> size, parent;
public:
DSU(int n) {
size.assign(n, 1);
parent.assign(n, 0);
for(int i=0; i<n; i++) {
parent[i] = i;
}
}
int find_set(int v) {
if(v == parent[v]) {
return v... | 22.246753 | 53 | 0.477525 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.