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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
630e7f96b7e3672cbb3bf8845a4b776402c58c42 | 11,494 | cpp | C++ | src/ClasterizeByCentroids/main.cpp | vladimir-inoz/maputils | 554fe1df70d8a77e572058b9e28ae717977ebc0a | [
"MIT"
] | null | null | null | src/ClasterizeByCentroids/main.cpp | vladimir-inoz/maputils | 554fe1df70d8a77e572058b9e28ae717977ebc0a | [
"MIT"
] | null | null | null | src/ClasterizeByCentroids/main.cpp | vladimir-inoz/maputils | 554fe1df70d8a77e572058b9e28ae717977ebc0a | [
"MIT"
] | null | null | null | /*!
\file
\brief Кластеризация по центроидам
\details Программа предназначена для
кластеризации входной геометрии по координатам
центроидов. Номер кластера добавляется как
новое поле для геометрии. Кластеризуется
каждый входной файл по отдельности.
\author Владимир Иноземцев
\version 1.0
*/
//gdal
#include <gdal.h>
... | 32.84 | 82 | 0.557682 | [
"vector"
] |
63159943d7823f84b6c9fe6b442c7d62345a678e | 7,364 | cpp | C++ | src/biomolecules/sprelay/gui/indicator_button.cpp | lumik/sprelay | aaae1167038fc5477fc5dc9ee026d08c1d1b88bc | [
"BSD-3-Clause"
] | null | null | null | src/biomolecules/sprelay/gui/indicator_button.cpp | lumik/sprelay | aaae1167038fc5477fc5dc9ee026d08c1d1b88bc | [
"BSD-3-Clause"
] | 65 | 2017-04-11T14:40:39.000Z | 2022-01-28T18:24:39.000Z | src/biomolecules/sprelay/gui/indicator_button.cpp | lumik/sprelay | aaae1167038fc5477fc5dc9ee026d08c1d1b88bc | [
"BSD-3-Clause"
] | null | null | null | // -*-c++-*-
/***************************************************************************
** **
** Controlling interface for K8090 8-Channel Relay Card from Velleman **
** through usb using virtual serial port in Qt. *... | 29.693548 | 118 | 0.603476 | [
"object"
] |
6315fab7a185baa38f66f281891a6fd1821104f5 | 1,444 | cpp | C++ | src/dx11/xGSdatabuffer.cpp | livingcreative/xgs | 2fc51c8b8f04e23740466414092f0ca1e0acb436 | [
"BSD-3-Clause"
] | 6 | 2016-03-17T16:11:39.000Z | 2021-02-08T18:03:23.000Z | src/dx11/xGSdatabuffer.cpp | livingcreative/xgs | 2fc51c8b8f04e23740466414092f0ca1e0acb436 | [
"BSD-3-Clause"
] | 6 | 2016-07-15T07:02:44.000Z | 2018-05-24T20:39:57.000Z | src/dx11/xGSdatabuffer.cpp | livingcreative/xgs | 2fc51c8b8f04e23740466414092f0ca1e0acb436 | [
"BSD-3-Clause"
] | 4 | 2016-03-20T11:43:11.000Z | 2022-01-21T21:07:54.000Z | /*
xGS 3D Low-level rendering API
Low-level 3D rendering wrapper API with multiple back-end support
(c) livingcreative, 2015 - 2018
https://github.com/livingcreative/xgs
dx11/xGSdatabuffer.cpp
DataBuffer object implementation class
*/
#include "xGSdatabuffer.h"
#include "xGSstate.h... | 20.927536 | 93 | 0.726454 | [
"object",
"3d"
] |
631d2baf97ef3d75e83ba548852fc423160276f9 | 82,728 | cpp | C++ | src/test_game.cpp | nekoshota/teippi_PronogoMod | 590b59384118b4dc99800260356accf9d484eb63 | [
"MIT"
] | null | null | null | src/test_game.cpp | nekoshota/teippi_PronogoMod | 590b59384118b4dc99800260356accf9d484eb63 | [
"MIT"
] | null | null | null | src/test_game.cpp | nekoshota/teippi_PronogoMod | 590b59384118b4dc99800260356accf9d484eb63 | [
"MIT"
] | null | null | null | #ifdef DEBUG
#include "test_game.h"
#include "unit.h"
#include "offsets.h"
#include "limits.h"
#include "player.h"
#include "common/assert.h"
#include "tech.h"
#include "order.h"
#include "text.h"
#include "bullet.h"
#include "unitsearch.h"
#include "targeting.h"
#include "dialog.h"
#include "yms.h"
#include "ai.h"
#i... | 38.26457 | 121 | 0.502454 | [
"vector"
] |
6334507a283075d765e9aa7596d13f6dab9dab69 | 2,043 | cpp | C++ | aws-cpp-sdk-lightsail/source/model/UpdateDistributionRequest.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-lightsail/source/model/UpdateDistributionRequest.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2022-01-03T23:59:37.000Z | 2022-01-03T23:59:37.000Z | aws-cpp-sdk-lightsail/source/model/UpdateDistributionRequest.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2021-12-30T04:25:33.000Z | 2021-12-30T04:25:33.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/lightsail/model/UpdateDistributionRequest.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Lightsail::Model;
using namespace Aws::Utils::Json;... | 24.035294 | 121 | 0.765541 | [
"model"
] |
6341861cf95967dc5d461e2cf3784bc15567fc07 | 1,366 | cpp | C++ | Lesson5/Exercise24/shortest_job_first.cpp | gogowonji/080239 | e2af987cf5266f9da515fb2afe17dafe6b1ac01b | [
"MIT"
] | 33 | 2020-12-15T07:37:24.000Z | 2022-03-08T16:26:37.000Z | Lesson5/Exercise24/shortest_job_first.cpp | gogowonji/080239 | e2af987cf5266f9da515fb2afe17dafe6b1ac01b | [
"MIT"
] | 1 | 2021-05-08T19:28:31.000Z | 2021-05-08T19:28:31.000Z | Lesson5/Exercise24/shortest_job_first.cpp | gogowonji/080239 | e2af987cf5266f9da515fb2afe17dafe6b1ac01b | [
"MIT"
] | 26 | 2021-01-04T07:21:31.000Z | 2022-02-07T12:39:42.000Z | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
template<typename T>
auto compute_waiting_times(std::vector<T>& service_times)
{
std::vector<T> W(service_times.size());
W[0] = 0;
for (auto i = 1; i < service_times.size(); i++)
W[i] = W[i - 1] + service_times[i - 1];
return W;
}
... | 23.551724 | 114 | 0.658858 | [
"vector"
] |
6349c028876c4b14bdedbfdad54877f6bdaf5a61 | 31,331 | hpp | C++ | src/Visual/Gui.hpp | allen-cell-animated/medyan | 0b5ef64fb338c3961673361e5632980617937ee6 | [
"BSD-4-Clause-UC"
] | null | null | null | src/Visual/Gui.hpp | allen-cell-animated/medyan | 0b5ef64fb338c3961673361e5632980617937ee6 | [
"BSD-4-Clause-UC"
] | null | null | null | src/Visual/Gui.hpp | allen-cell-animated/medyan | 0b5ef64fb338c3961673361e5632980617937ee6 | [
"BSD-4-Clause-UC"
] | null | null | null | #ifndef MEDYAN_Visual_Gui_hpp
#define MEDYAN_Visual_Gui_hpp
#include <cstdio>
#include <type_traits>
#include <imgui.h>
#include <imgui_impl_glfw.h>
#include <imgui_impl_opengl3.h>
#include <imgui_internal.h>
#include <imgui_stdlib.h>
#include <nfd.h>
#include "Visual/DisplaySettings.hpp"
#include "Visual/DisplaySta... | 36.644444 | 202 | 0.589576 | [
"mesh",
"render",
"object",
"vector"
] |
635200eaa1d0542fb34b651ac4b0c12a1bba98c9 | 49,088 | cpp | C++ | plugins/liberty_parser/test/liberty_parser.cpp | e7p/hal | 2a88a8abefe5e2f79a74ec646e5fb3d8e6eb7cc8 | [
"MIT"
] | null | null | null | plugins/liberty_parser/test/liberty_parser.cpp | e7p/hal | 2a88a8abefe5e2f79a74ec646e5fb3d8e6eb7cc8 | [
"MIT"
] | null | null | null | plugins/liberty_parser/test/liberty_parser.cpp | e7p/hal | 2a88a8abefe5e2f79a74ec646e5fb3d8e6eb7cc8 | [
"MIT"
] | null | null | null | #include "netlist_test_utils.h"
#include "liberty_parser/liberty_parser.h"
#include "hal_core/netlist/gate_library/gate_type/gate_type_lut.h"
#include <experimental/filesystem>
namespace hal {
class LibertyParserTest : public ::testing::Test {
protected:
virtual void SetUp() {
test_utils::... | 57.212121 | 168 | 0.337088 | [
"vector"
] |
63565d9c606d7768d8d77eec108e3fff70deec34 | 9,939 | cc | C++ | examples/others/mathintprt/mathintprt.cc | paulhjkelly/taskgraph-metaprogramming | 54c4e2806a97bec555a90784ab4cf0880660bf89 | [
"BSD-3-Clause"
] | 5 | 2020-04-11T21:30:19.000Z | 2021-12-04T16:16:09.000Z | examples/others/mathintprt/mathintprt.cc | paulhjkelly/taskgraph-metaprogramming | 54c4e2806a97bec555a90784ab4cf0880660bf89 | [
"BSD-3-Clause"
] | null | null | null | examples/others/mathintprt/mathintprt.cc | paulhjkelly/taskgraph-metaprogramming | 54c4e2806a97bec555a90784ab4cf0880660bf89 | [
"BSD-3-Clause"
] | null | null | null | /*
* NOTE: This example does not work under cygwin.
*/
#include "TaskGraph"
#include "TaskUserFunctions.h"
#include <cstdio>
#include <vector>
#include <map>
#define MAX_EXPRESSION_ARGS 3
#define Register_Command(name, arity) \
commandVector.push_back( mathCommand ( (name), (arity) ) ); \
commandDictionary[(name)]... | 27.455801 | 217 | 0.61153 | [
"vector"
] |
636212a2244603a577589e5db24bb2a79abc76fb | 8,310 | cpp | C++ | src/ArmadilloHTTP.cpp | philbowles/ArmadilloHTTP | 2c22ca50795af0ed8e37907dc3d1ec4963a82162 | [
"MIT"
] | 1 | 2021-05-24T09:30:22.000Z | 2021-05-24T09:30:22.000Z | src/ArmadilloHTTP.cpp | philbowles/ArmadilloHTTP | 2c22ca50795af0ed8e37907dc3d1ec4963a82162 | [
"MIT"
] | null | null | null | src/ArmadilloHTTP.cpp | philbowles/ArmadilloHTTP | 2c22ca50795af0ed8e37907dc3d1ec4963a82162 | [
"MIT"
] | 1 | 2021-07-19T23:01:53.000Z | 2021-07-19T23:01:53.000Z | #include<pmbtools.h>
#include<ArmadilloHTTP.h>
ArmadilloHTTP::ArmadilloHTTP(): AardvarkTCP(){
onTCPdisconnect([=](int8_t e){ _scavenge(); });
rx([=](const uint8_t* d,size_t s){ _rx(d,s); });
}
void ArmadilloHTTP::_appendHeaders(std::string* p){
for(auto const& r:requestHeaders) *p+=r.first+": "+r.second... | 37.264574 | 148 | 0.575572 | [
"vector"
] |
6368bf92e92dd5c5ec489770980e66292601d7d5 | 6,227 | cc | C++ | sstmac/backends/native/clock_cycle_parallel/thread_barrier.cc | minyee/sst-macro | fd2c52b3872b9c49af77f5f82b3177cc7bbe403c | [
"BSD-Source-Code"
] | 4 | 2017-11-18T22:49:38.000Z | 2021-01-22T18:33:50.000Z | sstmac/backends/native/clock_cycle_parallel/thread_barrier.cc | minyee/sst-macro | fd2c52b3872b9c49af77f5f82b3177cc7bbe403c | [
"BSD-Source-Code"
] | null | null | null | sstmac/backends/native/clock_cycle_parallel/thread_barrier.cc | minyee/sst-macro | fd2c52b3872b9c49af77f5f82b3177cc7bbe403c | [
"BSD-Source-Code"
] | 1 | 2019-03-14T23:04:47.000Z | 2019-03-14T23:04:47.000Z | /**
Copyright 2009-2017 National Technology and Engineering Solutions of Sandia,
LLC (NTESS). Under the terms of Contract DE-NA-0003525, the U.S. Government
retains certain rights in this software.
Sandia National Laboratories is a multimission laboratory managed and operated
by National Technology and Engineering... | 28.56422 | 90 | 0.701783 | [
"vector"
] |
6372da68579456feb20bae9edc644fddcff834c4 | 237 | cpp | C++ | LeetCode/Problems/Algorithms/#338_CountingBits_sol4_dp_O(N).cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | 1 | 2022-01-26T14:50:07.000Z | 2022-01-26T14:50:07.000Z | LeetCode/Problems/Algorithms/#338_CountingBits_sol4_dp_O(N).cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | LeetCode/Problems/Algorithms/#338_CountingBits_sol4_dp_O(N).cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<int> countBits(int num) {
vector<int> answer(num + 1);
for(int i = 1; i <= num; ++i){
answer[i] = (i % 2) + answer[i / 2];
}
return answer;
}
}; | 23.7 | 49 | 0.438819 | [
"vector"
] |
63740896bd10a7409bc8ed93714a3204b45474b0 | 1,111 | cpp | C++ | Contests/Codeforces_Round_#706/probC.cpp | francoisvogel/cp | ae59cf635ab19382d924344fbb137ab9ae631103 | [
"MIT"
] | 1 | 2021-10-02T15:40:33.000Z | 2021-10-02T15:40:33.000Z | Contests/Codeforces_Round_#706/probC.cpp | francoisvogel/cp | ae59cf635ab19382d924344fbb137ab9ae631103 | [
"MIT"
] | null | null | null | Contests/Codeforces_Round_#706/probC.cpp | francoisvogel/cp | ae59cf635ab19382d924344fbb137ab9ae631103 | [
"MIT"
] | null | null | null | /*
* Author: Francois Vogel
* Comment:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
#define pii pair<int, int>
#define f first
#define s second
#define vi vector<int>
#define all(x)... | 18.213115 | 100 | 0.562556 | [
"vector"
] |
6375a0b72dc4620c8598dca78936fbad7e132ad8 | 9,177 | cpp | C++ | eX0/src/InputManager.cpp | shurcooL/eX0 | 425cdd4bace184bef3b63efa0867add4e469e291 | [
"MIT"
] | 54 | 2015-03-09T08:38:12.000Z | 2021-06-20T15:54:57.000Z | eX0/src/InputManager.cpp | shurcooL/eX0 | 425cdd4bace184bef3b63efa0867add4e469e291 | [
"MIT"
] | 7 | 2015-03-02T21:03:54.000Z | 2017-12-21T06:06:00.000Z | eX0/src/InputManager.cpp | shurcooL/eX0 | 425cdd4bace184bef3b63efa0867add4e469e291 | [
"MIT"
] | 10 | 2015-03-11T06:38:38.000Z | 2021-05-10T04:35:33.000Z | #include "globals.h"
InputManager * g_pInputManager = NULL;
InputManager * InputManager::m_pInstance = NULL;
InputManager::InputManager()
: m_oListeners(),
m_oListenersMutex(glfwCreateMutex()),
m_bIsMousePointerVisible(true),
m_oJoysticks()
{
eX0_assert(m_pInstance == NULL, "m_pInstance wasn't... | 30.287129 | 151 | 0.705786 | [
"vector"
] |
638541012ecc08d91973e40c481312d7107beab4 | 6,015 | hpp | C++ | DirectXer/src/Containers.hpp | palikar/DirectXer | c21b87eed220fc54d97d5363e8a33bd0944a2596 | [
"MIT"
] | null | null | null | DirectXer/src/Containers.hpp | palikar/DirectXer | c21b87eed220fc54d97d5363e8a33bd0944a2596 | [
"MIT"
] | null | null | null | DirectXer/src/Containers.hpp | palikar/DirectXer | c21b87eed220fc54d97d5363e8a33bd0944a2596 | [
"MIT"
] | null | null | null | #pragma once
#include <robin_hood.h>
#include <Utils.hpp>
#include <Types.hpp>
#include <Config.hpp>
#include <Logging.hpp>
#include <GraphicsCommon.hpp>
#include <Tags.hpp>
template<class T, class Allocator> class Vector : public Allocator
{
public:
/* ----- Constructors ----- */
// Default constructor
Vector(... | 18.680124 | 90 | 0.61995 | [
"vector"
] |
b0cc1e322c52c358eed948d9a917c542f54d9156 | 1,378 | cpp | C++ | 043-multiply-strings/multiply-strings.cpp | TJUSsr/leetcodesolution | 8244de2d76c9e8e5b9d98dd1e8efed4d680d44ee | [
"MIT"
] | null | null | null | 043-multiply-strings/multiply-strings.cpp | TJUSsr/leetcodesolution | 8244de2d76c9e8e5b9d98dd1e8efed4d680d44ee | [
"MIT"
] | 2 | 2021-03-31T19:10:41.000Z | 2021-12-13T19:58:15.000Z | 043-multiply-strings/multiply-strings.cpp | TJUSsr/leetcodesolution | 8244de2d76c9e8e5b9d98dd1e8efed4d680d44ee | [
"MIT"
] | null | null | null | // Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.
//
// Example 1:
//
//
// Input: num1 = "2", num2 = "3"
// Output: "6"
//
// Example 2:
//
//
// Input: num1 = "123", num2 = "456"
// Output: "56088"
//
//
// Note:
//
//
/... | 23.355932 | 140 | 0.513788 | [
"vector"
] |
b0d436996f0e9b3bd61b1b345c7b7956cdf8faea | 2,849 | cpp | C++ | test/memoryfile.cpp | bfierz/vcl.filesystem | bcbf19a465fefe7d9998839dc0be4f6fccb5e316 | [
"MIT"
] | null | null | null | test/memoryfile.cpp | bfierz/vcl.filesystem | bcbf19a465fefe7d9998839dc0be4f6fccb5e316 | [
"MIT"
] | null | null | null | test/memoryfile.cpp | bfierz/vcl.filesystem | bcbf19a465fefe7d9998839dc0be4f6fccb5e316 | [
"MIT"
] | null | null | null | /*
* This file is part of the Visual Computing Library (VCL) release under the
* MIT license.
*
* Copyright (c) 2014-2016 Basil Fierz
*
* 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... | 33.517647 | 85 | 0.723763 | [
"vector"
] |
b0d5d183b49b1aea5c594c4e7c8781aa744615d7 | 568 | cpp | C++ | math/linear_phi.cpp | warwick965/competitive-programming | 78074365eff204b0331410a98f32cf41962e9644 | [
"MIT"
] | 6 | 2020-04-08T00:25:44.000Z | 2021-09-04T20:39:15.000Z | math/linear_phi.cpp | warwick965/competitive-programming | 78074365eff204b0331410a98f32cf41962e9644 | [
"MIT"
] | 2 | 2020-04-09T06:59:12.000Z | 2020-04-09T14:56:32.000Z | math/linear_phi.cpp | warwick965/competitive-programming | 78074365eff204b0331410a98f32cf41962e9644 | [
"MIT"
] | 6 | 2020-04-16T03:47:06.000Z | 2021-09-07T10:21:32.000Z | #include <bits/stdc++.h>
using namespace std;
#define N (int)1e6
int phi[N+1];
void sieve(){
for(int i = 1;i <= N;i++) phi[i] = i-1;
phi[1] = 1;
vector<int>primes;
for(int i = 2;i <= N;i++){
if (phi[i] == i-1) primes.push_back(i);
for(auto p:primes){
if (i*p > N) break;
... | 15.777778 | 47 | 0.40669 | [
"vector"
] |
b0d6d373efd0dcf00d966339b702d03a7733fa50 | 3,197 | cpp | C++ | main.cpp | Hiroaki-Tanaka-0606/CGSolve | 1fa04a46e3025febfb67e23d50686e82118dd433 | [
"MIT"
] | null | null | null | main.cpp | Hiroaki-Tanaka-0606/CGSolve | 1fa04a46e3025febfb67e23d50686e82118dd433 | [
"MIT"
] | null | null | null | main.cpp | Hiroaki-Tanaka-0606/CGSolve | 1fa04a46e3025febfb67e23d50686e82118dd433 | [
"MIT"
] | null | null | null | #include <stdio.h>
#include "matrix_util.h"
#include "CGSolve.h"
#include <time.h>
extern "C"{
void dgesv_(int* N, int* NRHS, double* A, int* LDA, int* IPIV, double* B, int* LDB, int* INFO);
}
const char* format="%12.5f ";
int main(){
int N=160;
double threshold=1e-10;
int iterMax=1000;
double** A=alloc_dmatrix... | 19.259036 | 96 | 0.560213 | [
"vector"
] |
b0dd6b7a37c94c586cbd99ca796ff9527d272387 | 10,927 | cpp | C++ | simulation.cpp | GabriellaXue/Cashier-Line-Sim | ae0984e02db0df40aa7d0effcad45e1039712614 | [
"MIT"
] | 1 | 2021-04-14T10:06:50.000Z | 2021-04-14T10:06:50.000Z | simulation.cpp | GabriellaXue/Cashier-Line-Sim | ae0984e02db0df40aa7d0effcad45e1039712614 | [
"MIT"
] | 1 | 2021-04-13T15:59:43.000Z | 2021-04-13T15:59:43.000Z | simulation.cpp | GabriellaXue/Cashier-Line-Sim | ae0984e02db0df40aa7d0effcad45e1039712614 | [
"MIT"
] | null | null | null | /**
* @file simulation.cpp
* Implementation of Simulation class which is used to handle cashier simulation.
*/
#include <vector>
using std::vector;
#include <tuple>
using std::tuple;
#include <string>
using std::string;
#include <iostream>
using std::cout;
using std::endl;
#include <queue>
using std::queue;
#i... | 32.715569 | 108 | 0.565297 | [
"vector"
] |
b0ddf5c0d57e89052d5127205e66dbf24ffd16be | 1,295 | cpp | C++ | leetcode/isIdealPermutation.cpp | jcpince/algorithms | c43dd8e98a0f0df691ead5f25c2c17a9241db908 | [
"MIT"
] | null | null | null | leetcode/isIdealPermutation.cpp | jcpince/algorithms | c43dd8e98a0f0df691ead5f25c2c17a9241db908 | [
"MIT"
] | null | null | null | leetcode/isIdealPermutation.cpp | jcpince/algorithms | c43dd8e98a0f0df691ead5f25c2c17a9241db908 | [
"MIT"
] | null | null | null | /*
775. Global and Local Inversions
Medium
We have some permutation A of [0, 1, ..., N - 1], where N is the length of A.
The number of (global) inversions is the number of i < j with 0 <= i < j < N and A[i] > A[j].
The number of local inversions is the number of i with 0 <= i < N and A[i] > A[i+1].
Return true if a... | 23.545455 | 102 | 0.598456 | [
"vector"
] |
b0df80d6c14f1547d12c77b363087e6872b16108 | 1,310 | cpp | C++ | generative-adversarial-network/src/Application.cpp | tautvydass/vu-coursework | 604e8e38b14849b832782d45f7321cc8b2275b5f | [
"Apache-2.0"
] | 1 | 2019-04-16T09:49:35.000Z | 2019-04-16T09:49:35.000Z | generative-adversarial-network/src/Application.cpp | tautvydass/vu-coursework | 604e8e38b14849b832782d45f7321cc8b2275b5f | [
"Apache-2.0"
] | null | null | null | generative-adversarial-network/src/Application.cpp | tautvydass/vu-coursework | 604e8e38b14849b832782d45f7321cc8b2275b5f | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <armadillo>
#include "utils/ImageUtils.h"
#include "utils/Benchmark.h"
#include "models/neural-network-model/discriminator/ArtDiscriminatorModel.h"
#include "models/neural-network-model/generator/ArtGeneratorModel.h"
#define LOG(x) std::cout << x << std::endl;
#define IMAGE_SIZE 64
#defi... | 25.192308 | 88 | 0.79084 | [
"model"
] |
b0e792364b24107d35710dcc2512fb823ee11e86 | 8,095 | cpp | C++ | src/lib/operators/jit_operator/specialization/llvm_extensions.cpp | nilsthamm/hyrise | 75a701f281bb7dc1636832012c43005ec3c66384 | [
"MIT"
] | 2 | 2019-05-28T12:09:04.000Z | 2019-05-29T08:18:43.000Z | src/lib/operators/jit_operator/specialization/llvm_extensions.cpp | nilsthamm/hyrise | 75a701f281bb7dc1636832012c43005ec3c66384 | [
"MIT"
] | 69 | 2019-05-24T10:01:32.000Z | 2019-12-13T19:09:05.000Z | src/lib/operators/jit_operator/specialization/llvm_extensions.cpp | nilsthamm/hyrise | 75a701f281bb7dc1636832012c43005ec3c66384 | [
"MIT"
] | null | null | null | #include "llvm_extensions.hpp"
#include <llvm/Analysis/ConstantFolding.h>
#include <llvm/IR/Constants.h>
#include <unordered_set>
#include "jit_runtime_pointer.hpp"
#pragma clang diagnostic ignored "-Wshadow-all"
#pragma clang diagnostic ignored "-Wmissing-prototypes"
namespace opossum {
const std::shared_ptr<con... | 50.59375 | 120 | 0.699444 | [
"object",
"vector"
] |
b0e90f6134ecfb7eebe51cee13798fc312dad708 | 1,535 | cpp | C++ | two pointers/Leetcode_two_pointers/567_permutation_in_string.cpp | Hadleyhzy/data_structure_and_algorithm | 0e610ba78dcb216323d9434a0f182756780ce5c0 | [
"MIT"
] | 1 | 2020-10-12T19:18:19.000Z | 2020-10-12T19:18:19.000Z | two pointers/Leetcode_two_pointers/567_permutation_in_string.cpp | Hadleyhzy/data_structure_and_algorithm | 0e610ba78dcb216323d9434a0f182756780ce5c0 | [
"MIT"
] | null | null | null | two pointers/Leetcode_two_pointers/567_permutation_in_string.cpp | Hadleyhzy/data_structure_and_algorithm | 0e610ba78dcb216323d9434a0f182756780ce5c0 | [
"MIT"
] | 1 | 2020-10-12T19:18:04.000Z | 2020-10-12T19:18:04.000Z | //
// 567_permutation_in_string.cpp
// Leetcode_two_pointers
//
// Created by Hadley on 15.08.20.
// Copyright © 2020 Hadley. All rights reserved.
//
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <stack>
#include <cstring>
#include... | 20.466667 | 49 | 0.468404 | [
"vector"
] |
b0e9d6ab2bbf77f5a219d696dac666f5e337eafe | 3,062 | cpp | C++ | Libraries/include/openal-impl-vid1/SoundBuffer.cpp | acalasanzs/dessor | c262b49db88d63510266ffce8d61f6ae1b5e1fd6 | [
"MIT"
] | 1 | 2021-09-09T10:03:20.000Z | 2021-09-09T10:03:20.000Z | Libraries/include/openal-impl-vid1/SoundBuffer.cpp | acalasanzs/dessor | c262b49db88d63510266ffce8d61f6ae1b5e1fd6 | [
"MIT"
] | null | null | null | Libraries/include/openal-impl-vid1/SoundBuffer.cpp | acalasanzs/dessor | c262b49db88d63510266ffce8d61f6ae1b5e1fd6 | [
"MIT"
] | null | null | null | #include "SoundBuffer.h"
#include <sndfile.h>
#include <inttypes.h>
#include <AL\alext.h>
SoundBuffer* SoundBuffer::get()
{
static SoundBuffer* sndbuf = new SoundBuffer();
return sndbuf;
}
ALuint SoundBuffer::addSoundEffect(const char* filename)
{
ALenum err, format;
ALuint buffer;
SNDFILE* sndfile;
SF_INFO sf... | 23.374046 | 97 | 0.696277 | [
"object"
] |
b0ea53e7c4243b48e2e1eb2fc74c0962630dcbeb | 16,301 | cc | C++ | library/endpoint.cc | driplineorg/dripline-cpp | 4f6490226eefc16a880ae5b342014b590f6115af | [
"Apache-2.0"
] | 1 | 2021-09-06T10:07:55.000Z | 2021-09-06T10:07:55.000Z | library/endpoint.cc | driplineorg/dripline-cpp | 4f6490226eefc16a880ae5b342014b590f6115af | [
"Apache-2.0"
] | 56 | 2019-02-22T02:15:42.000Z | 2021-09-10T19:46:35.000Z | library/endpoint.cc | driplineorg/dripline-cpp | 4f6490226eefc16a880ae5b342014b590f6115af | [
"Apache-2.0"
] | 1 | 2021-06-28T14:10:39.000Z | 2021-06-28T14:10:39.000Z | /*
* endpoint.cc
*
* Created on: Aug 14, 2018
* Author: N.S. Oblath
*/
#define DRIPLINE_API_EXPORTS
#include "endpoint.hh"
#include "dripline_exceptions.hh"
#include "service.hh"
#include "throw_reply.hh"
#include "logger.hh"
#ifdef DL_PYTHON
#include "reply_cache.hh"
#include "pybind11/pybind11.h"
#in... | 35.591703 | 176 | 0.567573 | [
"object"
] |
b0eea8da9af2b7ad22cd6dc37af86f87abc36672 | 1,033 | cpp | C++ | 2-Data_Structures_and_Libraries/2.4-Data_Structures_with_Our-Own_Libraries/1-Graph_Data_Structures_Problems/EdyJunior/10895.cpp | IFCE-CP/CP3-solutions | 1abcabd9a06968184a55d3b0414637019014694c | [
"MIT"
] | 1 | 2017-11-16T10:56:17.000Z | 2017-11-16T10:56:17.000Z | 2-Data_Structures_and_Libraries/2.4-Data_Structures_with_Our-Own_Libraries/1-Graph_Data_Structures_Problems/EdyJunior/10895.cpp | IFCE-CP/CP3-solutions | 1abcabd9a06968184a55d3b0414637019014694c | [
"MIT"
] | null | null | null | 2-Data_Structures_and_Libraries/2.4-Data_Structures_with_Our-Own_Libraries/1-Graph_Data_Structures_Problems/EdyJunior/10895.cpp | IFCE-CP/CP3-solutions | 1abcabd9a06968184a55d3b0414637019014694c | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define F first
#define S second
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
using namespace std;
typedef pair<int, int> pii;
int main() {
int m, n;
while (scanf("%d %d", &m, &n) != EOF && m + n) {
vector<vector<pii>> g(n + 1);
for (int i = 1, r, c; ... | 24.595238 | 52 | 0.346563 | [
"vector"
] |
b0f3f3db03a2a0646c98450d3c46a0cefb19b425 | 14,001 | cpp | C++ | src/asiEngine/func/asiEngine_BuildPatchFunc.cpp | CadQuery/AnalysisSitus | f3b379ca9158325a21e50fefba8133cab51d9cd9 | [
"BSD-3-Clause"
] | 3 | 2021-11-04T01:36:56.000Z | 2022-03-10T07:11:01.000Z | src/asiEngine/func/asiEngine_BuildPatchFunc.cpp | CadQuery/AnalysisSitus | f3b379ca9158325a21e50fefba8133cab51d9cd9 | [
"BSD-3-Clause"
] | null | null | null | src/asiEngine/func/asiEngine_BuildPatchFunc.cpp | CadQuery/AnalysisSitus | f3b379ca9158325a21e50fefba8133cab51d9cd9 | [
"BSD-3-Clause"
] | 1 | 2021-09-25T18:14:30.000Z | 2021-09-25T18:14:30.000Z | //-----------------------------------------------------------------------------
// Created on: 09 July 2019
//-----------------------------------------------------------------------------
// Copyright (c) 2019-present, Sergey Slyadnev
// All rights reserved.
//
// Redistribution and use in source and binary forms, with... | 34.400491 | 112 | 0.58053 | [
"mesh",
"vector",
"model"
] |
7c0503b0df0fa8bb7373dd7fb178e0cf0d46c170 | 321 | cpp | C++ | leet_code/arrays/maxSubarr.cpp | sahilduhan/codeforces | a8042d52c12806e026fd7027e35e97ed8b4eeed6 | [
"MIT"
] | null | null | null | leet_code/arrays/maxSubarr.cpp | sahilduhan/codeforces | a8042d52c12806e026fd7027e35e97ed8b4eeed6 | [
"MIT"
] | null | null | null | leet_code/arrays/maxSubarr.cpp | sahilduhan/codeforces | a8042d52c12806e026fd7027e35e97ed8b4eeed6 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
int maxSubArray(vector<int> &nums)
{
int sum = 0, max_sum = INT_MIN;
for (auto it : nums){
sum += it;
max_sum= max(sum, max_sum);
if(sum<0) sum=0;
}
return max_sum;
}
};... | 18.882353 | 39 | 0.501558 | [
"vector"
] |
7c0cd9d2ba545e76118edaa1ce0678e8054e28ce | 7,741 | hpp | C++ | src/navigation/navigation.hpp | Hyp-ed/hyped-2022 | 9cac4632b660f569629cf0ad4048787f6017905d | [
"Apache-2.0"
] | 9 | 2021-07-31T16:22:24.000Z | 2022-01-19T18:14:31.000Z | src/navigation/navigation.hpp | Hyp-ed/hyped-2022 | 9cac4632b660f569629cf0ad4048787f6017905d | [
"Apache-2.0"
] | 91 | 2021-07-29T18:21:30.000Z | 2022-03-31T20:44:55.000Z | src/navigation/navigation.hpp | Hyp-ed/hyped-2022 | 9cac4632b660f569629cf0ad4048787f6017905d | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "kalman_filter.hpp"
#include "stripe_handler.hpp"
#include <math.h>
#include <array>
#include <cstdint>
#include <fstream>
#include <data/data.hpp>
#include <data/data_point.hpp>
#include <sensors/imu.hpp>
#include <utils/logger.hpp>
#include <utils/math/integrator.hpp>
#include <utils/math/st... | 32.120332 | 99 | 0.707661 | [
"object",
"vector"
] |
7c0d7fa65361c02622675959eb4d9f24f82e86a7 | 2,268 | cpp | C++ | src/17_phone_num.cpp | coolspeed/leetcode | d5fdcd3ba9849327b43e35bf3b5cb2bd1d8e312d | [
"CC0-1.0"
] | 1 | 2015-06-12T02:32:51.000Z | 2015-06-12T02:32:51.000Z | src/17_phone_num.cpp | coolspeed/leetcode | d5fdcd3ba9849327b43e35bf3b5cb2bd1d8e312d | [
"CC0-1.0"
] | null | null | null | src/17_phone_num.cpp | coolspeed/leetcode | d5fdcd3ba9849327b43e35bf3b5cb2bd1d8e312d | [
"CC0-1.0"
] | null | null | null | /*
25 / 25 test cases passed.
Status: Accepted
Runtime: 0 ms
Given a digit string, return all possible letter combinations that the number could represent.
A mapping of digit to letters (just like on the telephone buttons) is given below.
Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce... | 25.772727 | 98 | 0.55291 | [
"vector"
] |
7c1eb1f0615b7b94d26492f84dcacebf5b6252ab | 4,275 | hpp | C++ | src/Evolution/Systems/GrMhd/GhValenciaDivClean/FiniteDifference/ReconstructWork.hpp | nilsvu/spectre | 1455b9a8d7e92db8ad600c66f54795c29c3052ee | [
"MIT"
] | 117 | 2017-04-08T22:52:48.000Z | 2022-03-25T07:23:36.000Z | src/Evolution/Systems/GrMhd/GhValenciaDivClean/FiniteDifference/ReconstructWork.hpp | nilsvu/spectre | 1455b9a8d7e92db8ad600c66f54795c29c3052ee | [
"MIT"
] | 3,177 | 2017-04-07T21:10:18.000Z | 2022-03-31T23:55:59.000Z | src/Evolution/Systems/GrMhd/GhValenciaDivClean/FiniteDifference/ReconstructWork.hpp | nilsvu/spectre | 1455b9a8d7e92db8ad600c66f54795c29c3052ee | [
"MIT"
] | 85 | 2017-04-07T19:36:13.000Z | 2022-03-01T10:21:00.000Z | // Distributed under the MIT License.
// See LICENSE.txt for details.
#pragma once
#include <array>
#include <boost/functional/hash.hpp>
#include <cstddef>
#include <utility>
#include "DataStructures/FixedHashMap.hpp"
#include "DataStructures/Tensor/TypeAliases.hpp"
#include "Domain/Structure/MaxNumberOfNeighbors.hp... | 42.326733 | 79 | 0.767485 | [
"mesh",
"vector"
] |
7c21e70ba296e6ae557228e56155e0b5e6ab3cbc | 9,785 | cpp | C++ | src/storage/index/bplustree_index.cpp | abhijithanilkumar/terrier | 5d05d15894b8338d997eb874268a40bc41f67b30 | [
"MIT"
] | null | null | null | src/storage/index/bplustree_index.cpp | abhijithanilkumar/terrier | 5d05d15894b8338d997eb874268a40bc41f67b30 | [
"MIT"
] | null | null | null | src/storage/index/bplustree_index.cpp | abhijithanilkumar/terrier | 5d05d15894b8338d997eb874268a40bc41f67b30 | [
"MIT"
] | null | null | null | #include "storage/index/bplustree_index.h"
#include "storage/index/compact_ints_key.h"
#include "storage/index/generic_key.h"
#include "transaction/deferred_action_manager.h"
#include "transaction/transaction_context.h"
namespace noisepage::storage::index {
template <typename KeyType>
BPlusTreeIndex<KeyType>::BPlusT... | 44.885321 | 120 | 0.716607 | [
"vector"
] |
7c27b208f4877036ab09251a9f2976b1d5c51afa | 3,965 | cpp | C++ | aws-cpp-sdk-dataexchange/source/model/ApiGatewayApiAsset.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-dataexchange/source/model/ApiGatewayApiAsset.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-01-03T23:59:37.000Z | 2022-01-03T23:59:37.000Z | aws-cpp-sdk-dataexchange/source/model/ApiGatewayApiAsset.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2021-11-09T11:58:03.000Z | 2021-11-09T11:58:03.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/dataexchange/model/ApiGatewayApiAsset.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws... | 22.027778 | 136 | 0.749054 | [
"model"
] |
7c2991f0540be417143a9833a0dba2cdbb9c1c1e | 29,012 | cpp | C++ | shell/osshell/snapins/devmgr/snapin/utils.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | shell/osshell/snapins/devmgr/snapin/utils.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | shell/osshell/snapins/devmgr/snapin/utils.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | /*++
Copyright (C) Microsoft Corporation
Module Name:
utils.cpp
Abstract:
This module implements some utilities classes
Author:
William Hsieh (williamh) created
Revision History:
--*/
#include "devmgr.h"
//
// CPropSheetData implementation
//
// Every device or clas... | 23.97686 | 87 | 0.515787 | [
"object"
] |
7c346d40e7d875ae0d771ffd043c3f09335a6d60 | 176 | hpp | C++ | include/linear_algebra/linear_algebra.hpp | TheTryton/linear_algebra | 1975bab581e56451e2a7e45749374f11274248a5 | [
"MIT"
] | null | null | null | include/linear_algebra/linear_algebra.hpp | TheTryton/linear_algebra | 1975bab581e56451e2a7e45749374f11274248a5 | [
"MIT"
] | null | null | null | include/linear_algebra/linear_algebra.hpp | TheTryton/linear_algebra | 1975bab581e56451e2a7e45749374f11274248a5 | [
"MIT"
] | null | null | null | #pragma once
#include "vector/vector.hpp"
#include "vector/vector.inl"
#include "matrix/matrix.hpp"
#include "matrix/matrix.inl"
#include "equation_system/equation_system.hpp" | 25.142857 | 46 | 0.784091 | [
"vector"
] |
7c360135562f91712d30a672cf81fa7ebdc5bc73 | 3,848 | hpp | C++ | fsc/include/worker_thread.hpp | gbucknell/fsc-sdk | 11b7cda4eea35ec53effbe37382f4b28020cd59d | [
"MIT"
] | null | null | null | fsc/include/worker_thread.hpp | gbucknell/fsc-sdk | 11b7cda4eea35ec53effbe37382f4b28020cd59d | [
"MIT"
] | null | null | null | fsc/include/worker_thread.hpp | gbucknell/fsc-sdk | 11b7cda4eea35ec53effbe37382f4b28020cd59d | [
"MIT"
] | null | null | null | // (c) Copyright 2008 Samuel Debionne.
//
// Distributed under the MIT Software License. (See accompanying file
// license.txt) or copy at http://www.opensource.org/licenses/mit-license.php)
//
// See http://code.google.com/p/fsc-sdk/ for the library home page.
//
// $Revision: $
// $History: $
/// \fi... | 30.0625 | 197 | 0.547297 | [
"object"
] |
7c382a167ae2888711e339b5b132776f5800132d | 8,682 | hpp | C++ | src/Database/Implementations/StandaloneDatabase.hpp | prostoiChelovek/faceDetector | 9cecefbf6d52b1cee971ec342d6a9ae8f593b60b | [
"MIT"
] | 2 | 2019-07-10T13:05:34.000Z | 2019-08-09T11:23:09.000Z | src/Database/Implementations/StandaloneDatabase.hpp | prostoiChelovek/faceDetector | 9cecefbf6d52b1cee971ec342d6a9ae8f593b60b | [
"MIT"
] | null | null | null | src/Database/Implementations/StandaloneDatabase.hpp | prostoiChelovek/faceDetector | 9cecefbf6d52b1cee971ec342d6a9ae8f593b60b | [
"MIT"
] | 1 | 2019-08-09T11:23:11.000Z | 2019-08-09T11:23:11.000Z | /**
* @file StandaloneDatabase.h
* @author Люнгрин Андрей aka prostoichelovek <iam.prostoi.chelovek@gmail.com>
* @date 26 Aug 2020
* @copyright MIT License
*
* @brief This file contains a standalone Database implementation
*/
#ifndef FACES_STANDALONEDATABASE_HPP
#define FACES_STANDALONEDATABASE_HPP
#include <u... | 32.639098 | 101 | 0.5956 | [
"object",
"vector"
] |
7c3dbf9f34575f4343c30953d2fcf27c72faf169 | 11,556 | cpp | C++ | src/cpp/mummer-lib/delta-filter.cpp | UTbioinf/SMSC | 0d5765518b3863d2363f264d9f256063c7f7ce71 | [
"MIT"
] | null | null | null | src/cpp/mummer-lib/delta-filter.cpp | UTbioinf/SMSC | 0d5765518b3863d2363f264d9f256063c7f7ce71 | [
"MIT"
] | 2 | 2019-05-31T06:36:36.000Z | 2019-09-18T22:13:09.000Z | src/cpp/mummer-lib/delta-filter.cpp | UTbioinf/SMSC | 0d5765518b3863d2363f264d9f256063c7f7ce71 | [
"MIT"
] | 1 | 2021-12-01T10:30:58.000Z | 2021-12-01T10:30:58.000Z | //------------------------------------------------------------------------------
// Modified by: zijuexiansheng
// Programmer: Adam M Phillippy, The Institute for Genomic Research
// File: delta-filter.cc
// Date: 09 / 22 / 2004
//
// Usage: delta-filter [options] <deltafile>
// ... | 30.172324 | 132 | 0.557113 | [
"vector"
] |
7c41d4def0959bc557754cb4564b17cf1c700f00 | 1,014 | cpp | C++ | Codeforces/Round-496-Div3/E1.cpp | TISparta/competitive-programming-solutions | 31987d4e67bb874bf15653565c6418b5605a20a8 | [
"MIT"
] | 1 | 2018-01-30T13:21:30.000Z | 2018-01-30T13:21:30.000Z | Codeforces/Round-496-Div3/E1.cpp | TISparta/competitive-programming-solutions | 31987d4e67bb874bf15653565c6418b5605a20a8 | [
"MIT"
] | null | null | null | Codeforces/Round-496-Div3/E1.cpp | TISparta/competitive-programming-solutions | 31987d4e67bb874bf15653565c6418b5605a20a8 | [
"MIT"
] | 1 | 2018-08-29T13:26:50.000Z | 2018-08-29T13:26:50.000Z | // Sorting
// 5
// 12-08-2020
#include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef ve... | 19.132075 | 42 | 0.489152 | [
"vector"
] |
7c4425553580d2b02523b97c02b612b4376cb1e8 | 12,724 | hpp | C++ | include/cpm/bootstrap_theme.hpp | wichtounet/cpm | 83d6bbe32e3230ced5341b8f3d7a4c447a2f5067 | [
"MIT"
] | 45 | 2015-06-15T05:45:39.000Z | 2022-03-22T06:41:09.000Z | include/cpm/bootstrap_theme.hpp | wichtounet/cpm | 83d6bbe32e3230ced5341b8f3d7a4c447a2f5067 | [
"MIT"
] | 1 | 2015-07-01T12:53:11.000Z | 2015-07-07T13:05:53.000Z | include/cpm/bootstrap_theme.hpp | wichtounet/cpm | 83d6bbe32e3230ced5341b8f3d7a4c447a2f5067 | [
"MIT"
] | 8 | 2015-06-16T03:50:54.000Z | 2020-06-26T16:40:08.000Z | //=======================================================================
// Copyright (c) 2015-2016 Baptiste Wicht
// Distributed under the terms of the MIT License.
// (See accompanying file LICENSE or copy at
// http://opensource.org/licenses/MIT)
//==================================================================... | 33.572559 | 156 | 0.466363 | [
"vector"
] |
7c49ef1f1f4f5fdb643f762e9c43aa26610e8fc4 | 811 | cc | C++ | components/services/heap_profiling/allocation.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 14,668 | 2015-01-01T01:57:10.000Z | 2022-03-31T23:33:32.000Z | components/services/heap_profiling/allocation.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 113 | 2015-05-04T09:58:14.000Z | 2022-01-31T19:35:03.000Z | components/services/heap_profiling/allocation.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 5,941 | 2015-01-02T11:32:21.000Z | 2022-03-31T16:35:46.000Z | // Copyright 2019 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 "components/services/heap_profiling/allocation.h"
#include "base/hash/hash.h"
namespace heap_profiling {
namespace {
uint32_t ComputeHash(cons... | 28.964286 | 73 | 0.675709 | [
"vector"
] |
7c4b6e79e984bc42e8aa6d270deb7d052471fd07 | 16,139 | cpp | C++ | hsolv/hsolvdoc.cpp | ResonanceGroup/FEMM | 227f1cb46fc18b298e2da48d732692c206d0539f | [
"MIT"
] | 1 | 2020-05-18T00:57:57.000Z | 2020-05-18T00:57:57.000Z | hsolv/hsolvdoc.cpp | ResonanceGroup/FEMM | 227f1cb46fc18b298e2da48d732692c206d0539f | [
"MIT"
] | 1 | 2018-05-02T13:43:31.000Z | 2018-05-02T13:43:31.000Z | hsolv/hsolvdoc.cpp | ResonanceGroup/FEMM | 227f1cb46fc18b298e2da48d732692c206d0539f | [
"MIT"
] | 3 | 2018-05-02T13:38:43.000Z | 2021-05-19T10:48:49.000Z | // hsolvdoc.cpp : implementation of the Chsolvdoc class
//
#include <stdafx.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include "hsolv.h"
#include "hsolvDlg.h"
#include "mesh.h"
#include "spars.h"
#include "hsolvdoc.h"
/////////////////////////////////////////////... | 21.957823 | 78 | 0.538075 | [
"mesh"
] |
7c56213a18bad4bb2fd2578c8ff5981a90e4d598 | 9,585 | cpp | C++ | TAO/tests/RTCORBA/Server_Declared/server.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 36 | 2015-01-10T07:27:33.000Z | 2022-03-07T03:32:08.000Z | TAO/tests/RTCORBA/Server_Declared/server.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 2 | 2018-08-13T07:30:51.000Z | 2019-02-25T03:04:31.000Z | TAO/tests/RTCORBA/Server_Declared/server.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 38 | 2015-01-08T14:12:06.000Z | 2022-01-19T08:33:00.000Z | // $Id: server.cpp 83471 2008-10-28 11:46:04Z sma $
#include "testS.h"
#include "ace/Get_Opt.h"
#include "tao/ORB_Core.h"
#include "ace/Task.h"
#include "tao/RTCORBA/RTCORBA.h"
#include "tao/RTPortableServer/RTPortableServer.h"
#include "../check_supported_priorities.cpp"
class Test_i : public POA_Test
{
// = TITLE... | 26.699164 | 119 | 0.542097 | [
"object"
] |
7c56ebc8880b5af1159adbebf7e1ca8ec66b15e7 | 10,492 | cpp | C++ | dynamic/wrappers/cell_based/AbstractCentreBasedCellPopulation3_3.cppwg.cpp | jmsgrogan/PyChaste | 48a9863d2c941c71e47ecb72e917b477ba5c1413 | [
"FTL"
] | 6 | 2017-02-04T16:10:53.000Z | 2021-07-01T08:03:16.000Z | dynamic/wrappers/cell_based/AbstractCentreBasedCellPopulation3_3.cppwg.cpp | jmsgrogan/PyChaste | 48a9863d2c941c71e47ecb72e917b477ba5c1413 | [
"FTL"
] | 6 | 2017-06-22T08:50:41.000Z | 2019-12-15T20:17:29.000Z | dynamic/wrappers/cell_based/AbstractCentreBasedCellPopulation3_3.cppwg.cpp | jmsgrogan/PyChaste | 48a9863d2c941c71e47ecb72e917b477ba5c1413 | [
"FTL"
] | 3 | 2017-05-15T21:33:58.000Z | 2019-10-27T21:43:07.000Z | #include <pybind11/pybind11.h>
#include <pybind11/stl.h>
#include <set>
#include <vector>
#include <string>
#include <map>
#include "SmartPointers.hpp"
#include "UblasIncludes.hpp"
#include "AbstractCentreBasedCellPopulation.hpp"
#include "AbstractCentreBasedCellPopulation3_3.cppwg.hpp"
namespace py = pybind11;
typed... | 49.961905 | 251 | 0.672322 | [
"vector"
] |
7c5cb3309d2dc5ba4e5ca403c9fa34e512f33517 | 50,253 | cc | C++ | ge/generator/ge_generator.cc | mindspore-ai/graphengine | 460406cbd691b963d125837f022be5d8abd1a637 | [
"Apache-2.0"
] | 207 | 2020-03-28T02:12:50.000Z | 2021-11-23T18:27:45.000Z | ge/generator/ge_generator.cc | mindspore-ai/graphengine | 460406cbd691b963d125837f022be5d8abd1a637 | [
"Apache-2.0"
] | 4 | 2020-04-17T07:32:44.000Z | 2021-06-26T04:55:03.000Z | ge/generator/ge_generator.cc | mindspore-ai/graphengine | 460406cbd691b963d125837f022be5d8abd1a637 | [
"Apache-2.0"
] | 13 | 2020-03-28T02:52:26.000Z | 2021-07-03T23:12:54.000Z | /**
* Copyright 2020 Huawei Technologies Co., Ltd
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law... | 42.158557 | 120 | 0.692635 | [
"shape",
"vector",
"model"
] |
7c650efc3499bc8cdcb8ac6bfc5dbbe636a6b012 | 16,187 | cpp | C++ | main.cpp | anthonycherepkov/SuffixTreeSuffixAutomaton | 621cb10cfec7db2bbd553ddd01b7b420c353d163 | [
"MIT"
] | null | null | null | main.cpp | anthonycherepkov/SuffixTreeSuffixAutomaton | 621cb10cfec7db2bbd553ddd01b7b420c353d163 | [
"MIT"
] | null | null | null | main.cpp | anthonycherepkov/SuffixTreeSuffixAutomaton | 621cb10cfec7db2bbd553ddd01b7b420c353d163 | [
"MIT"
] | null | null | null | #include <iostream>
#include <algorithm>
#include <unordered_map>
#include <vector>
#include <cassert>
#include <limits>
template <char MIN_CHAR, char MAX_CHAR>
class SuffixAutomaton {
protected:
const static size_t ALPHABET_SIZE = MAX_CHAR - MIN_CHAR + static_cast<size_t>(1);
struct Node {
int transit... | 30.369606 | 128 | 0.556867 | [
"vector"
] |
7c670d61cc19473b5c02e0e5beeccb06c55a9a7a | 3,318 | hh | C++ | include/sot/core/feature-joint-limits.hh | machines-in-motion/sot-core | 9c0b1b3cd2bc03d36179cc8e47e11f7d42c1d4a5 | [
"BSD-2-Clause"
] | 12 | 2016-03-28T07:15:27.000Z | 2022-01-05T13:41:06.000Z | include/sot/core/feature-joint-limits.hh | machines-in-motion/sot-core | 9c0b1b3cd2bc03d36179cc8e47e11f7d42c1d4a5 | [
"BSD-2-Clause"
] | 121 | 2015-02-17T08:38:25.000Z | 2021-12-01T10:54:05.000Z | include/sot/core/feature-joint-limits.hh | machines-in-motion/sot-core | 9c0b1b3cd2bc03d36179cc8e47e11f7d42c1d4a5 | [
"BSD-2-Clause"
] | 24 | 2015-07-01T16:25:24.000Z | 2021-11-08T15:06:58.000Z | /*
* Copyright 2010,
* François Bleibel,
* Olivier Stasse,
*
* CNRS/AIST
*
*/
#ifndef __SOT_FEATURE_JOINTLIMITS_HH__
#define __SOT_FEATURE_JOINTLIMITS_HH__
/* --------------------------------------------------------------------- */
/* --- INCLUDE --------------------------------------------------------- */
/* ... | 30.440367 | 80 | 0.556962 | [
"vector"
] |
7c69949177bfa26c44d34a2113d9d144a5d32908 | 2,019 | hpp | C++ | include/api_dx11/device_dx11.hpp | Basez/Agnostik-Engine | 10171bbeb73c590e75e9db5adf0135e0235f2884 | [
"MIT"
] | 7 | 2015-06-29T09:45:09.000Z | 2017-06-06T08:14:09.000Z | include/api_dx11/device_dx11.hpp | Basez/Agnostik-Engine | 10171bbeb73c590e75e9db5adf0135e0235f2884 | [
"MIT"
] | null | null | null | include/api_dx11/device_dx11.hpp | Basez/Agnostik-Engine | 10171bbeb73c590e75e9db5adf0135e0235f2884 | [
"MIT"
] | null | null | null | #pragma once
#include "i_device.hpp"
// fwd declare
struct DXGI_RATIONAL;
struct ID3D11Device;
struct ID3D11DeviceContext;
struct IDXGISwapChain;
struct ID3D11Debug;
struct ID3D11DeviceChild;
struct ID3DUserDefinedAnnotation;
namespace AGN
{
class DeviceDX11 : public IDevice
{
public:
DeviceDX11();
~DeviceDX1... | 33.65 | 141 | 0.789995 | [
"vector"
] |
7c708410a8842d400344f7d11daaba6ce7a33b64 | 11,874 | cpp | C++ | Code/Engine/Resource/CompositorNode/Pass/GenerateMipmaps/CompositorInstancePassGenerateMipmaps.cpp | WarzesProject/Micro3DRPG | 36604d51d5dd640836cad77995abbfecfe4bdccc | [
"MIT"
] | 3 | 2020-05-12T04:36:38.000Z | 2021-04-04T07:21:44.000Z | Code/Engine/Resource/CompositorNode/Pass/GenerateMipmaps/CompositorInstancePassGenerateMipmaps.cpp | WarzesProject/Micro3DRPG | 36604d51d5dd640836cad77995abbfecfe4bdccc | [
"MIT"
] | null | null | null | Code/Engine/Resource/CompositorNode/Pass/GenerateMipmaps/CompositorInstancePassGenerateMipmaps.cpp | WarzesProject/Micro3DRPG | 36604d51d5dd640836cad77995abbfecfe4bdccc | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "Resource/CompositorNode/Pass/GenerateMipmaps/CompositorInstancePassGenerateMipmaps.h"
#include "Resource/CompositorNode/Pass/GenerateMipmaps/CompositorResourcePassGenerateMipmaps.h"
#include "Resource/CompositorNode/Pass/Compute/CompositorInstancePassCompute.h"
#include "Resource/Composito... | 58.782178 | 374 | 0.752569 | [
"render"
] |
7c789ca1fc2cb6c69912caed6b7f04d501a6c1a9 | 2,751 | cpp | C++ | btcb/core_test/message.cpp | melnaquib/btcb | f55c9867113d403118c3028d5ba11a0debcd7609 | [
"BSD-2-Clause"
] | 8 | 2019-03-01T13:33:33.000Z | 2019-06-02T04:42:38.000Z | btcb/core_test/message.cpp | melnaquib/btcb | f55c9867113d403118c3028d5ba11a0debcd7609 | [
"BSD-2-Clause"
] | null | null | null | btcb/core_test/message.cpp | melnaquib/btcb | f55c9867113d403118c3028d5ba11a0debcd7609 | [
"BSD-2-Clause"
] | 5 | 2019-04-03T14:27:56.000Z | 2019-12-22T17:14:28.000Z | #include <gtest/gtest.h>
#include <btcb/node/common.hpp>
TEST (message, keepalive_serialization)
{
btcb::keepalive request1;
std::vector<uint8_t> bytes;
{
btcb::vectorstream stream (bytes);
request1.serialize (stream);
}
auto error (false);
btcb::bufferstream stream (bytes.data (), bytes.size ());
btcb::me... | 31.988372 | 128 | 0.721556 | [
"vector"
] |
75a7bfeb5ad26f0e183131004aece81023ae0df3 | 11,532 | cpp | C++ | src/model_likelihood.cpp | geneprophet/BSDMR | 81ff68646a8a304dd1241f8131041d0321d0e04b | [
"MIT"
] | null | null | null | src/model_likelihood.cpp | geneprophet/BSDMR | 81ff68646a8a304dd1241f8131041d0321d0e04b | [
"MIT"
] | null | null | null | src/model_likelihood.cpp | geneprophet/BSDMR | 81ff68646a8a304dd1241f8131041d0321d0e04b | [
"MIT"
] | null | null | null | // -*- mode: C++; c-indent-level: 4; c-basic-offset: 4; indent-tabs-mode: nil; -*-
// we only include RcppArmadillo.h which pulls Rcpp.h in for us
#include "RcppArmadillo.h"
// via the depends attribute we tell Rcpp to create hooks for
// RcppArmadillo so that the build process will know what to do
// [[Rcpp::depends... | 33.32948 | 84 | 0.563822 | [
"vector",
"model"
] |
75aa775473829d44036879f50c1c02552d4725a2 | 3,524 | hpp | C++ | Include/Rover/ScalarView.hpp | kranar/rover | a4a824321859e34478fec0924c0b76144b3fc20e | [
"Apache-2.0"
] | null | null | null | Include/Rover/ScalarView.hpp | kranar/rover | a4a824321859e34478fec0924c0b76144b3fc20e | [
"Apache-2.0"
] | 30 | 2019-02-05T23:18:13.000Z | 2019-07-05T14:19:04.000Z | Include/Rover/ScalarView.hpp | kranar/rover | a4a824321859e34478fec0924c0b76144b3fc20e | [
"Apache-2.0"
] | 1 | 2020-06-01T06:32:05.000Z | 2020-06-01T06:32:05.000Z | #ifndef ROVER_SCALAR_VIEW_HPP
#define ROVER_SCALAR_VIEW_HPP
#include <functional>
#include <optional>
#include <type_traits>
#include <vector>
#include "Rover/TrialIterator.hpp"
namespace Rover {
//! Representation of a sample using a single numeric type.
template<typename T>
struct ScalarSample {
//! The ... | 27.748031 | 79 | 0.661748 | [
"vector"
] |
75bd60f1899d3d3410b1fbb34ed5f670b34bb0c0 | 6,889 | cpp | C++ | aws-cpp-sdk-sagemaker/source/model/FeatureGroup.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-sagemaker/source/model/FeatureGroup.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-01-03T23:59:37.000Z | 2022-01-03T23:59:37.000Z | aws-cpp-sdk-sagemaker/source/model/FeatureGroup.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/sagemaker/model/FeatureGroup.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws
{
namesp... | 25.420664 | 138 | 0.757585 | [
"model"
] |
75c4fcdc028d37091eb6064583f9b299eaa85e3d | 5,245 | cpp | C++ | Source/SystemQOR/MSWindows/WinQAPI/src/MinGW32.cpp | mfaithfull/QOR | 0fa51789344da482e8c2726309265d56e7271971 | [
"BSL-1.0"
] | 9 | 2016-05-27T01:00:39.000Z | 2021-04-01T08:54:46.000Z | Source/SystemQOR/MSWindows/WinQAPI/src/MinGW32.cpp | mfaithfull/QOR | 0fa51789344da482e8c2726309265d56e7271971 | [
"BSL-1.0"
] | 1 | 2016-03-03T22:54:08.000Z | 2016-03-03T22:54:08.000Z | Source/SystemQOR/MSWindows/WinQAPI/src/MinGW32.cpp | mfaithfull/QOR | 0fa51789344da482e8c2726309265d56e7271971 | [
"BSL-1.0"
] | 4 | 2016-05-27T01:00:43.000Z | 2018-08-19T08:47:49.000Z | //MinGW32.cpp
// Copyright Querysoft Limited 2013
//
// Permission is hereby granted, free of charge, to any person or organization
// obtaining a copy of the software and accompanying documentation covered by
// this license (the "Software") to use, reproduce, display, distribute,
// execute, and transmit the Softwar... | 33.196203 | 164 | 0.612583 | [
"object"
] |
75c9940b76b9a9178f7b7e0ee93d79b1bcb02b85 | 4,610 | hpp | C++ | libadb/include/libadb/api/channel/data/channel.hpp | faserg1/adb | 65507dc17589ac6ec00caf2ecd80f6dbc4026ad4 | [
"MIT"
] | 1 | 2022-03-10T15:14:13.000Z | 2022-03-10T15:14:13.000Z | libadb/include/libadb/api/channel/data/channel.hpp | faserg1/adb | 65507dc17589ac6ec00caf2ecd80f6dbc4026ad4 | [
"MIT"
] | 9 | 2022-03-07T21:00:08.000Z | 2022-03-15T23:14:52.000Z | libadb/include/libadb/api/channel/data/channel.hpp | faserg1/adb | 65507dc17589ac6ec00caf2ecd80f6dbc4026ad4 | [
"MIT"
] | null | null | null | #pragma once
#include <string>
#include <optional>
#include <libadb/libadb.hpp>
#include <nlohmann/json_fwd.hpp>
#include <libadb/types/time.hpp>
#include <libadb/types/snowflake.hpp>
#include <libadb/types/nullable.hpp>
#include <libadb/resource/image.hpp>
#include <libadb/api/user/data/user.hpp>
#include <libadb/api... | 52.386364 | 125 | 0.681128 | [
"object",
"vector"
] |
75cd810c9314f9f870ab821b71ed7cc0e7cd51ca | 2,343 | hpp | C++ | include/Interop/ComCastor3D/CastorUtils/ComQuaternion.hpp | Mu-L/Castor3D | 7b9c6e7be6f7373ad60c0811d136c0004e50e76b | [
"MIT"
] | 245 | 2015-10-29T14:31:45.000Z | 2022-03-31T13:04:45.000Z | include/Interop/ComCastor3D/CastorUtils/ComQuaternion.hpp | Mu-L/Castor3D | 7b9c6e7be6f7373ad60c0811d136c0004e50e76b | [
"MIT"
] | 64 | 2016-03-11T19:45:05.000Z | 2022-03-31T23:58:33.000Z | include/Interop/ComCastor3D/CastorUtils/ComQuaternion.hpp | Mu-L/Castor3D | 7b9c6e7be6f7373ad60c0811d136c0004e50e76b | [
"MIT"
] | 11 | 2018-05-24T09:07:43.000Z | 2022-03-21T21:05:20.000Z | /* See LICENSE file in root folder */
#ifndef __COMC3D_COM_QUATERNION_H__
#define __COMC3D_COM_QUATERNION_H__
#include "ComCastor3D/ComCastor3DPrerequisites.hpp"
#include "ComCastor3D/ComAtlObject.hpp"
#include "ComCastor3D/CastorUtils/ComMatrix4x4.hpp"
#include <CastorUtils/Math/Quaternion.hpp>
namespace CastorCom... | 36.609375 | 221 | 0.67563 | [
"object",
"transform"
] |
75d1c1ce225e53a0194538a827e4bb8dd26cf8f6 | 5,014 | hh | C++ | src/IPStackSimulator.hh | clint-david/newserv | 40aa08bd4f391d8d3f6d41d3b539de5bc4c5c679 | [
"MIT"
] | null | null | null | src/IPStackSimulator.hh | clint-david/newserv | 40aa08bd4f391d8d3f6d41d3b539de5bc4c5c679 | [
"MIT"
] | null | null | null | src/IPStackSimulator.hh | clint-david/newserv | 40aa08bd4f391d8d3f6d41d3b539de5bc4c5c679 | [
"MIT"
] | null | null | null | #include <stdint.h>
#include <netinet/in.h>
#include <deque>
#include <string>
#include <phosg/Process.hh>
#include <phosg/Filesystem.hh>
#include "IPFrameInfo.hh"
#include "Server.hh"
#include "ProxyServer.hh"
#include "ServerState.hh"
class IPStackSimulator {
public:
IPStackSimulator(
std::shared_ptr<str... | 35.814286 | 98 | 0.744515 | [
"object"
] |
75d5127c348fa41769376161ff7e943f80f86520 | 21,593 | cpp | C++ | isis/src/qisis/objs/ShapeList/ShapeList.cpp | kdl222/ISIS3 | aab0e63088046690e6c031881825596c1c2cc380 | [
"CC0-1.0"
] | 134 | 2018-01-18T00:16:24.000Z | 2022-03-24T03:53:33.000Z | isis/src/qisis/objs/ShapeList/ShapeList.cpp | kdl222/ISIS3 | aab0e63088046690e6c031881825596c1c2cc380 | [
"CC0-1.0"
] | 3,825 | 2017-12-11T21:27:34.000Z | 2022-03-31T21:45:20.000Z | isis/src/qisis/objs/ShapeList/ShapeList.cpp | jlaura/isis3 | 2c40e08caed09968ea01d5a767a676172ad20080 | [
"CC0-1.0"
] | 164 | 2017-11-30T21:15:44.000Z | 2022-03-23T10:22:29.000Z | /** This is free and unencumbered software released into the public domain.
The authors of ISIS do not claim copyright on the contents of this file.
For more details about the LICENSE terms and the AUTHORS, you will
find files of those names at the top level of this repository. **/
/* SPDX-License-Identifier: CC0-1.0... | 25.984356 | 111 | 0.62122 | [
"shape"
] |
75d7573ded0d17ca8470b44fc4bdcc0e9a7802e8 | 6,892 | hh | C++ | include/vkhr/input_map.hh | clayne/vkhr | ffcc0394c0991049337011e45ff3da9f3bd1bbe5 | [
"MIT"
] | 403 | 2019-05-27T20:17:12.000Z | 2022-03-19T17:32:16.000Z | include/vkhr/input_map.hh | tangxianbo/vkhr | 22713d0d9a7d42f207a86fac1d02f626e6007217 | [
"MIT"
] | 5 | 2019-06-19T15:46:41.000Z | 2021-11-26T00:12:39.000Z | include/vkhr/input_map.hh | tangxianbo/vkhr | 22713d0d9a7d42f207a86fac1d02f626e6007217 | [
"MIT"
] | 31 | 2019-06-05T02:32:17.000Z | 2022-02-04T04:13:29.000Z | #ifndef VKHR_INPUT_MAP_HH
#define VKHR_INPUT_MAP_HH
#include <vkhr/window.hh>
#include <imgui.h>
#include <imgui_impl_glfw.h>
#include <glm/glm.hpp>
#include <string>
#include <vector>
#include <unordered_map>
namespace vkhr {
namespace Input {
enum class State {
Pressed = GLFW_PRESS,
... | 36.855615 | 90 | 0.610273 | [
"vector"
] |
75d7b41bb8da12de7494c0e4c310b77b7765f651 | 3,188 | hpp | C++ | master/core/third/RCF/include/RCF/util/Scan.hpp | importlib/klib | a59837857689d0e60d3df6d2ebd12c3160efa794 | [
"MIT"
] | 4 | 2017-12-04T08:22:48.000Z | 2019-10-26T21:44:59.000Z | master/core/third/RCF/include/RCF/util/Scan.hpp | isuhao/klib | a59837857689d0e60d3df6d2ebd12c3160efa794 | [
"MIT"
] | null | null | null | master/core/third/RCF/include/RCF/util/Scan.hpp | isuhao/klib | a59837857689d0e60d3df6d2ebd12c3160efa794 | [
"MIT"
] | 4 | 2017-12-04T08:22:49.000Z | 2018-12-27T03:20:31.000Z |
//*****************************************************************************
// Copyright (c) 2003. All rights reserved.
// Developed by Jarl Lindrud.
// Contact: jlindrud@hotmail.com .
//*****************************************************************************
#ifndef _UTIL_SCAN_HPP_
#define _UTIL_SCA... | 30.653846 | 131 | 0.4266 | [
"vector"
] |
75d856e5364735ebf0e8697868997e17c210aad5 | 2,823 | cpp | C++ | Insipid3D/engine.cpp | thehugh100/Insipid3D | 429a9e6022c1a0bca842209310f949647f4c441e | [
"MIT"
] | 90 | 2017-04-10T20:08:53.000Z | 2022-03-28T19:16:04.000Z | Insipid3D/engine.cpp | CristianRodrigoGuarachiIbanez/Insipid3D | 429a9e6022c1a0bca842209310f949647f4c441e | [
"MIT"
] | 2 | 2019-11-29T04:00:26.000Z | 2021-05-29T10:39:24.000Z | Insipid3D/engine.cpp | CristianRodrigoGuarachiIbanez/Insipid3D | 429a9e6022c1a0bca842209310f949647f4c441e | [
"MIT"
] | 15 | 2017-10-02T03:15:03.000Z | 2022-03-28T20:46:34.000Z | #include "engine.h"
#include "FlyCam.h"
#include <algorithm>
#include <thread>
#include <glm/gtc/type_ptr.hpp>
#include <glm/gtc/matrix_transform.hpp>
#include "EntityClientCam.h"
#include "Client_UDP.h"
#include "NetworkClient.h"
#include "NetworkServer.h"
#include "MeshManager.h"
Engine::Engine()
{
networkClient =... | 21.225564 | 158 | 0.69288 | [
"render"
] |
75e7572e44d8908155909a7929712419044b1fad | 9,780 | cpp | C++ | github/polylogarithm/v322/src/Li.cpp | gxusthjw/JPolylogarithm | fd5f4e82815d87793dc9099eaa8acbf4be89e8c2 | [
"Apache-2.0"
] | null | null | null | github/polylogarithm/v322/src/Li.cpp | gxusthjw/JPolylogarithm | fd5f4e82815d87793dc9099eaa8acbf4be89e8c2 | [
"Apache-2.0"
] | null | null | null | github/polylogarithm/v322/src/Li.cpp | gxusthjw/JPolylogarithm | fd5f4e82815d87793dc9099eaa8acbf4be89e8c2 | [
"Apache-2.0"
] | null | null | null | // ====================================================================
// This file is part of Polylogarithm.
//
// Polylogarithm is licenced under the GNU Lesser General Public
// License (GNU LGPL) version 3.
// ====================================================================
#include "Li.hpp"
#include <array>
... | 27.318436 | 92 | 0.530164 | [
"vector"
] |
75eadbc90e5afacfc3dbf5cd0cf42df2313a42b8 | 7,863 | cpp | C++ | tao/x11/dynamic_any/dynenum_i.cpp | ClausKlein/taox11 | 669cfd2d0be258722c7ee32b23f2e5cb83e4520f | [
"MIT"
] | 20 | 2019-11-13T12:31:20.000Z | 2022-02-27T12:30:39.000Z | tao/x11/dynamic_any/dynenum_i.cpp | ClausKlein/taox11 | 669cfd2d0be258722c7ee32b23f2e5cb83e4520f | [
"MIT"
] | 46 | 2019-11-15T20:40:18.000Z | 2022-03-31T19:04:36.000Z | tao/x11/dynamic_any/dynenum_i.cpp | ClausKlein/taox11 | 669cfd2d0be258722c7ee32b23f2e5cb83e4520f | [
"MIT"
] | 5 | 2019-11-12T15:00:50.000Z | 2022-01-17T17:33:05.000Z | /**
* @file dynenum_i.cpp
* @author Marijke Henstmengel
*
* @brief CORBA C++11 TAOX11 DynamicAny::DynAny implementation
*
* @copyright Copyright (c) Remedy IT Expertise BV
*/
#include "tao/AnyTypeCode/Marshal.h"
#include "tao/x11/anytypecode/typecode_impl.h"
#include "tao/x11/anytypecode/any_unknown_type... | 23.471642 | 85 | 0.580694 | [
"object"
] |
75ebc9eeeab0dd856bcd8d663b76675803422f5a | 15,562 | cpp | C++ | src/gui/rendering/Load3ds.cpp | rockstorm101/GMAT | 00b6b61a40560c095da3d83dab4ab1e9157f01c7 | [
"Apache-2.0"
] | 1 | 2018-09-18T07:09:36.000Z | 2018-09-18T07:09:36.000Z | src/gui/rendering/Load3ds.cpp | rockstorm101/GMAT | 00b6b61a40560c095da3d83dab4ab1e9157f01c7 | [
"Apache-2.0"
] | null | null | null | src/gui/rendering/Load3ds.cpp | rockstorm101/GMAT | 00b6b61a40560c095da3d83dab4ab1e9157f01c7 | [
"Apache-2.0"
] | 2 | 2020-06-18T04:45:30.000Z | 2021-07-20T02:11:54.000Z | //------------------------------------------------------------------------------
// Load3ds
//------------------------------------------------------------------------------
// GMAT: General Mission Analysis Tool
//
// Copyright (c) 2002 - 2015 United States Government as represented by... | 42.98895 | 112 | 0.546652 | [
"mesh",
"object",
"model",
"3d"
] |
75f11bc3a66243d7527b1445490609ea16539e6f | 4,379 | cpp | C++ | src/kite_estimation/kiteEKF.cpp | jowaibel/openkite | 165e4fc8e3e01934a36543be03e34a8cfa5b9926 | [
"MIT"
] | 4 | 2019-05-21T20:40:49.000Z | 2021-01-19T19:28:17.000Z | src/kite_estimation/kiteEKF.cpp | jowaibel/openkite | 165e4fc8e3e01934a36543be03e34a8cfa5b9926 | [
"MIT"
] | 1 | 2019-12-04T14:00:12.000Z | 2019-12-04T14:00:12.000Z | src/kite_estimation/kiteEKF.cpp | jowaibel/openkite | 165e4fc8e3e01934a36543be03e34a8cfa5b9926 | [
"MIT"
] | 4 | 2019-07-11T09:53:26.000Z | 2020-05-06T13:01:12.000Z | #include "kiteEKF.h"
using namespace casadi;
/** experimentaly defined values */
const DM KiteEKF::SIGMA_Q = DM::diag(DMVector{0.01, 0.05, 0.05, 0.05});
const DM KiteEKF::SIGMA_V = DM::diag(DMVector{0.5, 0.5, 0.5});
const DM KiteEKF::SIGMA_W = DM::diag(casadi::DMVector{0.5, 0.5, 0.5});
const DM KiteEKF::SIGMA_R = DM:... | 34.480315 | 120 | 0.658826 | [
"object",
"model"
] |
75f130dbcb07e71cfad1f4c0564202034af53e87 | 2,446 | cc | C++ | android_webview/renderer/aw_execution_termination_filter.cc | 7kbird/chrome | f56688375530f1003e34c34f441321977c5af3c3 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2019-01-16T03:57:39.000Z | 2019-01-16T03:57:39.000Z | android_webview/renderer/aw_execution_termination_filter.cc | 7kbird/chrome | f56688375530f1003e34c34f441321977c5af3c3 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2018-02-10T21:00:08.000Z | 2018-03-20T05:09:50.000Z | android_webview/renderer/aw_execution_termination_filter.cc | aranajhonny/chromium | caf5bcb822f79b8997720e589334266551a50a13 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2020-11-04T07:23:37.000Z | 2020-11-04T07:23:37.000Z | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "android_webview/renderer/aw_execution_termination_filter.h"
#include <v8.h>
#include "android_webview/common/render_view_messages.h"
#include ... | 31.766234 | 75 | 0.770646 | [
"render"
] |
75ff1e3fec892aec2c202800caed2900b04665e6 | 1,485 | cpp | C++ | DynamicProgramming/shortestcommonsupersequencei.cpp | thisisnitish/cp-dsa- | 9ae94930b65f8dc293d088e9148960939b9f6fa4 | [
"MIT"
] | 4 | 2020-12-29T09:27:10.000Z | 2022-02-12T14:20:23.000Z | DynamicProgramming/shortestcommonsupersequencei.cpp | thisisnitish/cp-dsa- | 9ae94930b65f8dc293d088e9148960939b9f6fa4 | [
"MIT"
] | 1 | 2021-11-27T06:15:28.000Z | 2021-11-27T06:15:28.000Z | DynamicProgramming/shortestcommonsupersequencei.cpp | thisisnitish/cp-dsa- | 9ae94930b65f8dc293d088e9148960939b9f6fa4 | [
"MIT"
] | 1 | 2021-11-17T21:42:57.000Z | 2021-11-17T21:42:57.000Z | /*
Shortest Common Supersequence
https://practice.geeksforgeeks.org/problems/shortest-common-supersequence0322/1#
*/
class Solution
{
public:
//Function to find length of shortest common supersequence of two strings.
/*the basic idea is that find the lcs length from both the strings
and concatenate both th... | 29.117647 | 80 | 0.480808 | [
"vector"
] |
2f086681f7a4961a41d56b41038528aeb38128ec | 3,012 | cpp | C++ | imaging/cv_mat/filters/hard_edge.cpp | mission-systems-pty-ltd/snark | 2bc8a20292ee3684d3a9897ba6fee43fed8d89ae | [
"BSD-3-Clause"
] | 1 | 2022-03-27T00:24:37.000Z | 2022-03-27T00:24:37.000Z | imaging/cv_mat/filters/hard_edge.cpp | NEU-LC/snark | db890f73f4c4bbe679405f3a607fd9ea373deb2c | [
"BSD-3-Clause"
] | null | null | null | imaging/cv_mat/filters/hard_edge.cpp | NEU-LC/snark | db890f73f4c4bbe679405f3a607fd9ea373deb2c | [
"BSD-3-Clause"
] | 1 | 2020-10-30T02:11:55.000Z | 2020-10-30T02:11:55.000Z | // Copyright (c) 2019 Vsevolod Vlaskine
/// @author vsevolod vlaskine
#include <memory>
#include <sstream>
#include <vector>
#include <boost/bind.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/date_time/posix_time/ptime.hpp>
#include <tbb/parallel_for.h>
#include <comma/base/exception.h>
#include "hard_edge.h... | 40.16 | 174 | 0.543825 | [
"vector"
] |
2f12e0ed81c448ad6913ccf6f93627b3f872577f | 14,550 | cpp | C++ | src/generate/gen_codefiles.cpp | KeyWorksRW/wxUiEditor | fc58bb37284430fa5901579ae121d4482b588c75 | [
"Apache-2.0"
] | 7 | 2021-10-22T02:43:12.000Z | 2022-01-15T10:52:58.000Z | src/generate/gen_codefiles.cpp | KeyWorksRW/wxUiEditor | fc58bb37284430fa5901579ae121d4482b588c75 | [
"Apache-2.0"
] | 288 | 2021-05-16T19:12:04.000Z | 2022-03-30T13:22:31.000Z | src/generate/gen_codefiles.cpp | KeyWorksRW/wxUiEditor | fc58bb37284430fa5901579ae121d4482b588c75 | [
"Apache-2.0"
] | null | null | null | /////////////////////////////////////////////////////////////////////////////
// Purpose: Generate code files
// Author: Ralph Walden
// Copyright: Copyright (c) 2020-2021 KeyWorks Software (Ralph Walden)
// License: Apache License -- see ../../LICENSE
////////////////////////////////////////////////////////////... | 32.119205 | 124 | 0.51354 | [
"vector"
] |
2f1b95207aa3259a730339b971aa60cb8acd6920 | 51,228 | cpp | C++ | applications/plugins/Compliant/Compliant_test/Assembly_test.cpp | sofa-framework/issofa | 94855f488465bc3ed41223cbde987581dfca5389 | [
"OML"
] | null | null | null | applications/plugins/Compliant/Compliant_test/Assembly_test.cpp | sofa-framework/issofa | 94855f488465bc3ed41223cbde987581dfca5389 | [
"OML"
] | null | null | null | applications/plugins/Compliant/Compliant_test/Assembly_test.cpp | sofa-framework/issofa | 94855f488465bc3ed41223cbde987581dfca5389 | [
"OML"
] | null | null | null | #include "Compliant_test.h"
#include "../assembly/AssemblyVisitor.h"
#include <SofaBoundaryCondition/ConstantForceField.h>
namespace sofa
{
using namespace modeling;
using namespace component;
using namespace simulation;
using core::objectmodel::New;
/** Test suite for matrix assembly.
*/
struct Assembly_test : pu... | 43.561224 | 224 | 0.624034 | [
"object",
"vector"
] |
2f208cc339448fd445ec530962bf809aec079f8d | 17,532 | hpp | C++ | ntree/ntree.hpp | degarashi/boomstick | 55dc5bfcfad6119d8401f578f91df7bbd44c192b | [
"MIT"
] | 1 | 2015-06-14T15:54:27.000Z | 2015-06-14T15:54:27.000Z | ntree/ntree.hpp | degarashi/boomstick | 55dc5bfcfad6119d8401f578f91df7bbd44c192b | [
"MIT"
] | null | null | null | ntree/ntree.hpp | degarashi/boomstick | 55dc5bfcfad6119d8401f578f91df7bbd44c192b | [
"MIT"
] | null | null | null | #pragma once
#include "spinner/bits.hpp"
#include "spinner/common.hpp"
#include "spinner/resmgr.hpp"
#include "../common.hpp"
#include <stack>
namespace boom {
namespace ntree {
using MortonId = uint32_t;
using MortonId_OP = spn::Optional<MortonId>;
using PositionId = uint32_t;
using CacheId = uint32_t;
str... | 29.715254 | 133 | 0.589836 | [
"vector"
] |
2f20cd61fb9ab4903c75517fa364d9f3ae738555 | 4,284 | cpp | C++ | Plugins/org.mitk.gui.qt.ext/src/internal/QmitkConfigPreferencePage.cpp | samsmu/MITK | c93dce6dc38d8f4c961de4440e4dd113b9841c8c | [
"BSD-3-Clause"
] | 5 | 2015-02-05T10:58:41.000Z | 2019-04-17T15:04:07.000Z | Plugins/org.mitk.gui.qt.ext/src/internal/QmitkConfigPreferencePage.cpp | kometa-dev/MITK | 984b5f7ac8ea614e80f303381ef1fc77d8ca4c3d | [
"BSD-3-Clause"
] | 141 | 2015-03-03T06:52:01.000Z | 2020-12-10T07:28:14.000Z | Plugins/org.mitk.gui.qt.ext/src/internal/QmitkConfigPreferencePage.cpp | kometa-dev/MITK | 984b5f7ac8ea614e80f303381ef1fc77d8ca4c3d | [
"BSD-3-Clause"
] | 4 | 2015-02-19T06:48:13.000Z | 2020-06-19T16:20:25.000Z | /*===================================================================
BlueBerry Platform
Copyright (c) German Cancer Research Center,
Division of Medical and Biological Informatics.
All rights reserved.
This software is distributed WITHOUT ANY WARRANTY; without
even the implied warranty of MERCHANTABILITY or FITNESS... | 27.286624 | 133 | 0.679272 | [
"vector"
] |
2f2338a98ab219e9ea3c3b53cdfe6f998dc199c1 | 1,973 | hh | C++ | include/introvirt/util/HexDump.hh | IntroVirt/IntroVirt | 917f735f3430d0855d8b59c814bea7669251901c | [
"Apache-2.0"
] | 23 | 2021-02-17T16:58:52.000Z | 2022-02-12T17:01:06.000Z | include/introvirt/util/HexDump.hh | IntroVirt/IntroVirt | 917f735f3430d0855d8b59c814bea7669251901c | [
"Apache-2.0"
] | 1 | 2021-04-01T22:41:32.000Z | 2021-09-24T14:14:17.000Z | include/introvirt/util/HexDump.hh | IntroVirt/IntroVirt | 917f735f3430d0855d8b59c814bea7669251901c | [
"Apache-2.0"
] | 4 | 2021-02-17T16:53:18.000Z | 2021-04-13T16:51:10.000Z | /*
* Copyright 2021 Assured Information Security, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by a... | 29.014706 | 84 | 0.676128 | [
"object"
] |
2f2ac082c5074b42a11868b048cb1b89a91fd6b0 | 3,419 | cpp | C++ | client/client-multi/client-cpp/impl/event/registration/UserTransport.cpp | acHefei/anteater_hf | 2d8cc2041b7f9a394541052f4c4c27e79af515d3 | [
"ECL-2.0",
"Apache-2.0"
] | 1 | 2017-08-24T08:53:32.000Z | 2017-08-24T08:53:32.000Z | client/client-multi/client-cpp/impl/event/registration/UserTransport.cpp | acHefei/anteater_hf | 2d8cc2041b7f9a394541052f4c4c27e79af515d3 | [
"ECL-2.0",
"Apache-2.0"
] | 2 | 2019-11-13T02:57:27.000Z | 2020-12-02T18:34:01.000Z | client/client-multi/client-cpp/impl/event/registration/UserTransport.cpp | acHefei/anteater_hf | 2d8cc2041b7f9a394541052f4c4c27e79af515d3 | [
"ECL-2.0",
"Apache-2.0"
] | 1 | 2017-08-24T08:53:38.000Z | 2017-08-24T08:53:38.000Z | /**
* Copyright 2014-2016 CyberVision, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicabl... | 30.526786 | 125 | 0.710442 | [
"vector"
] |
2f2d2dd86ddd6146e85486f0d4fc15c64281e1cc | 7,232 | cpp | C++ | src/api/ConfigurationBavieca.cpp | atk-/bavieca-0014 | 031216739b4800285af717f22f44ecda54675139 | [
"Apache-2.0"
] | null | null | null | src/api/ConfigurationBavieca.cpp | atk-/bavieca-0014 | 031216739b4800285af717f22f44ecda54675139 | [
"Apache-2.0"
] | null | null | null | src/api/ConfigurationBavieca.cpp | atk-/bavieca-0014 | 031216739b4800285af717f22f44ecda54675139 | [
"Apache-2.0"
] | null | null | null | /*---------------------------------------------------------------------------------------------*
* Copyright (C) 2012 Daniel Bolaños - www.bltek.com - Boulder Language Technologies *
* *
* www.bavieca.org is the web... | 44.097561 | 115 | 0.684458 | [
"model"
] |
2f3120ca5f38f3121c65e30f1d9a045d1284573d | 4,826 | hpp | C++ | include/camera.hpp | namelessvoid/nparticles | 6a113d201b726c7f06eae1ffd965f8b2041a683d | [
"Zlib"
] | 1 | 2016-05-31T11:29:18.000Z | 2016-05-31T11:29:18.000Z | include/camera.hpp | namelessvoid/nparticles | 6a113d201b726c7f06eae1ffd965f8b2041a683d | [
"Zlib"
] | 1 | 2016-09-03T13:18:53.000Z | 2016-09-03T13:18:53.000Z | include/camera.hpp | namelessvoid/nparticles | 6a113d201b726c7f06eae1ffd965f8b2041a683d | [
"Zlib"
] | null | null | null | /*
* Copyright (C) 2015 Simon Kerler
*
* This file is part of the "Nameless Particle Engine".
* For conditions of distribution and use, see the copyright notice you should
* have recievied with this software. I not, see:
* http://opensource.org/licenses/Zlib
*/
#ifndef NP_CAMERA_HPP
#define NP_CAMERA_HPP
#incl... | 28.222222 | 132 | 0.631786 | [
"vector"
] |
2f31a9a1952899dc4a64881b215b05ce26b708c5 | 3,089 | cpp | C++ | grasp_generation/graspitmodified_lm/Coin-3.1.3/src/nodes/SoTextureCoordinateDefault.cpp | KraftOreo/EBM_Hand | 9ab1722c196b7eb99b4c3ecc85cef6e8b1887053 | [
"MIT"
] | null | null | null | grasp_generation/graspitmodified_lm/Coin-3.1.3/src/nodes/SoTextureCoordinateDefault.cpp | KraftOreo/EBM_Hand | 9ab1722c196b7eb99b4c3ecc85cef6e8b1887053 | [
"MIT"
] | null | null | null | grasp_generation/graspitmodified_lm/Coin-3.1.3/src/nodes/SoTextureCoordinateDefault.cpp | KraftOreo/EBM_Hand | 9ab1722c196b7eb99b4c3ecc85cef6e8b1887053 | [
"MIT"
] | null | null | null | /**************************************************************************\
*
* This file is part of the Coin 3D visualization library.
* Copyright (C) by Kongsberg Oil & Gas Technologies.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public ... | 29.701923 | 108 | 0.688249 | [
"3d"
] |
2f334190fe37b3e4f7f82e58600a9ded4004e6bd | 37,827 | hh | C++ | EnergyPlus/PackagedTerminalHeatPump.hh | yurigabrich/EnergyPlusShadow | 396ca83aa82b842e6b177ba35c91b3f481dfbbf9 | [
"BSD-3-Clause"
] | null | null | null | EnergyPlus/PackagedTerminalHeatPump.hh | yurigabrich/EnergyPlusShadow | 396ca83aa82b842e6b177ba35c91b3f481dfbbf9 | [
"BSD-3-Clause"
] | 1 | 2020-07-08T13:32:09.000Z | 2020-07-08T13:32:09.000Z | EnergyPlus/PackagedTerminalHeatPump.hh | yurigabrich/EnergyPlusShadow | 396ca83aa82b842e6b177ba35c91b3f481dfbbf9 | [
"BSD-3-Clause"
] | null | null | null | // EnergyPlus, Copyright (c) 1996-2018, The Board of Trustees of the University of Illinois,
// The Regents of the University of California, through Lawrence Berkeley National Laboratory
// (subject to receipt of any required approvals from the U.S. Dept. of Energy), Oak Ridge
// National Laboratory, managed by UT-Batt... | 69.153565 | 150 | 0.623179 | [
"object",
"model"
] |
2f360ae61238cd4132ee431e0d0557d1796abd54 | 2,821 | cpp | C++ | Libraries/BulletAnimatSim/BlPlane.cpp | NeuroRoboticTech/AnimatLabPublicSource | c5b23f8898513582afb7891eb994a7bd40a89f08 | [
"BSD-3-Clause"
] | 8 | 2015-01-09T21:59:50.000Z | 2021-04-14T14:08:47.000Z | Libraries/BulletAnimatSim/BlPlane.cpp | NeuroRoboticTech/AnimatLabPublicSource | c5b23f8898513582afb7891eb994a7bd40a89f08 | [
"BSD-3-Clause"
] | null | null | null | Libraries/BulletAnimatSim/BlPlane.cpp | NeuroRoboticTech/AnimatLabPublicSource | c5b23f8898513582afb7891eb994a7bd40a89f08 | [
"BSD-3-Clause"
] | 2 | 2018-12-21T02:58:30.000Z | 2020-08-12T11:44:39.000Z | /**
\file BlPlane.cpp
\brief Implements the vortex plane class.
**/
#include "StdAfx.h"
#include "BlJoint.h"
#include "BlMotorizedJoint.h"
#include "BlRigidBody.h"
#include "BlPlane.h"
#include "BlSimulator.h"
namespace BulletAnimatSim
{
namespace Environment
{
namespace Bodies
{
/**
\brief Default constructo... | 23.122951 | 108 | 0.706133 | [
"geometry",
"object"
] |
2f38e1c697dc1e8bff3c6097e5ef86295973dd6d | 3,069 | cpp | C++ | 2_1_11/2_1_11.cpp | navigatore/SedgewickWayne | 8fe14c3516e60bf03a0ec3ceb7cc7d4e383fc42b | [
"MIT"
] | null | null | null | 2_1_11/2_1_11.cpp | navigatore/SedgewickWayne | 8fe14c3516e60bf03a0ec3ceb7cc7d4e383fc42b | [
"MIT"
] | null | null | null | 2_1_11/2_1_11.cpp | navigatore/SedgewickWayne | 8fe14c3516e60bf03a0ec3ceb7cc7d4e383fc42b | [
"MIT"
] | null | null | null | #include <algorithm>
#include <cassert>
template <typename T>
void shellsort(const T first, const T last) {
static constexpr auto gaps = std::array{1L,
4L,
13L,
40L,
... | 42.625 | 80 | 0.284783 | [
"vector"
] |
2f3b4f3990d39db4c2d3df0ad781fed68a3f17c8 | 43,251 | cpp | C++ | interfaces/innerkits/huks_standard/test/moduletest/src/hks_rsa_ecb_oaep_sha256_mt.cpp | openharmony/security_huks | ad5c362e115ab39282b2b6b12c1232a6c54acb4c | [
"Apache-2.0"
] | null | null | null | interfaces/innerkits/huks_standard/test/moduletest/src/hks_rsa_ecb_oaep_sha256_mt.cpp | openharmony/security_huks | ad5c362e115ab39282b2b6b12c1232a6c54acb4c | [
"Apache-2.0"
] | null | null | null | interfaces/innerkits/huks_standard/test/moduletest/src/hks_rsa_ecb_oaep_sha256_mt.cpp | openharmony/security_huks | ad5c362e115ab39282b2b6b12c1232a6c54acb4c | [
"Apache-2.0"
] | 2 | 2021-09-13T11:13:36.000Z | 2021-12-15T15:10:55.000Z | /*
* Copyright (C) 2021 Huawei Device Co., Ltd.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law ... | 43.468342 | 105 | 0.682597 | [
"vector"
] |
2f409fa2d076196827fc622823924c1aa6ac95b0 | 2,120 | cc | C++ | Delay_in_Networks/Dijkstra.cc | acmpesuecc/Simple_Algos | 7d9e4b1b1b3b5d87c1acd4ca881116abcd47ec36 | [
"MIT"
] | null | null | null | Delay_in_Networks/Dijkstra.cc | acmpesuecc/Simple_Algos | 7d9e4b1b1b3b5d87c1acd4ca881116abcd47ec36 | [
"MIT"
] | 7 | 2020-10-23T18:18:27.000Z | 2020-10-25T10:01:31.000Z | Delay_in_Networks/Dijkstra.cc | acmpesuecc/Simple_Algos | 7d9e4b1b1b3b5d87c1acd4ca881116abcd47ec36 | [
"MIT"
] | 3 | 2020-10-24T05:37:09.000Z | 2020-10-24T10:59:14.000Z | #include<iostream>
#include<vector>
#include<limits>
#include<bits/stdc++.h>
using pairType = std::pair<int, int>;
using graphType = std::unordered_map<int, vector<pairType> >;
using heapType = std::priority_queue<pairType, vector<pairType> >;
int dijkstra(const int & K, const int &N, std::vector<int> &delay... | 24.367816 | 107 | 0.511321 | [
"vector"
] |
2f43591dff729dcba381c1d29140bc0957360025 | 5,521 | cpp | C++ | src/ProcMonGUI/ProcMonGUIDlg.cpp | apriorit/windows-process-monitor | 97197b898555daebe7a2a4a68e373dc5bea6da6b | [
"MIT"
] | 100 | 2017-04-14T01:02:10.000Z | 2022-02-10T07:42:33.000Z | src/ProcMonGUI/ProcMonGUIDlg.cpp | apriorit/windows-process-monitor | 97197b898555daebe7a2a4a68e373dc5bea6da6b | [
"MIT"
] | 1 | 2021-05-30T20:19:07.000Z | 2021-05-30T20:19:07.000Z | src/ProcMonGUI/ProcMonGUIDlg.cpp | apriorit/windows-process-monitor | 97197b898555daebe7a2a4a68e373dc5bea6da6b | [
"MIT"
] | 44 | 2017-05-04T12:55:36.000Z | 2021-12-09T08:21:44.000Z |
// ProcMonGUIDlg.cpp : implementation file
//
#include "stdafx.h"
#include "ProcMonGUI.h"
#include "ProcMonGUIDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// CAboutDlg dialog used for App About
class CAboutDlg : public CDialog
{
public:
CAboutDlg();
// Dialog Data
enum { IDD = IDD_ABOUTBOX };
protected:... | 23.493617 | 86 | 0.751494 | [
"model"
] |
2f4f91dae0cb910214ae18b61a6276a021dc3011 | 10,394 | cpp | C++ | server.cpp | s25g5d4/netproghw2 | 05739f27eaae0a4436f753f6b03fc52d217118e4 | [
"MIT"
] | null | null | null | server.cpp | s25g5d4/netproghw2 | 05739f27eaae0a4436f753f6b03fc52d217118e4 | [
"MIT"
] | null | null | null | server.cpp | s25g5d4/netproghw2 | 05739f27eaae0a4436f753f6b03fc52d217118e4 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include <exception>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include "commons.hpp"
#include "my_huffman.hpp"
extern "C" {
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <netdb.h>
#includ... | 27.138381 | 127 | 0.583895 | [
"object",
"vector"
] |
016dfc500ac2c1448625c1738449dd5818f6a211 | 593 | cc | C++ | minimal_cost.cc | jamie-jjd/oj | 5c9b89c8b1455cc9c85233bac19eb866fd76e62a | [
"MIT"
] | null | null | null | minimal_cost.cc | jamie-jjd/oj | 5c9b89c8b1455cc9c85233bac19eb866fd76e62a | [
"MIT"
] | null | null | null | minimal_cost.cc | jamie-jjd/oj | 5c9b89c8b1455cc9c85233bac19eb866fd76e62a | [
"MIT"
] | null | null | null | #include <iostream>
#include <queue>
int main ()
{
uint64_t N {};
while (std::cin >> N && N)
{
std::priority_queue<uint64_t, std::vector<uint64_t>, std::greater<uint64_t>> min_heap;
for (uint64_t i {}, x {}; i != N; ++i)
{
std::cin >> x;
min_heap.push(x);
}
uint64_t cost {};
w... | 21.962963 | 90 | 0.532884 | [
"vector"
] |
01758d8df79b9d2ec64c277a3f5ec9ee851efa81 | 2,732 | cpp | C++ | CFD/UI/Graphics3DAxes.cpp | shellshocked2003/WE-UQ | b5d296b604310ce49a01dcce91c8c05405146d88 | [
"BSD-2-Clause"
] | 5 | 2019-08-22T13:39:06.000Z | 2021-08-22T15:44:51.000Z | CFD/UI/Graphics3DAxes.cpp | shellshocked2003/WE-UQ | b5d296b604310ce49a01dcce91c8c05405146d88 | [
"BSD-2-Clause"
] | null | null | null | CFD/UI/Graphics3DAxes.cpp | shellshocked2003/WE-UQ | b5d296b604310ce49a01dcce91c8c05405146d88 | [
"BSD-2-Clause"
] | 11 | 2019-05-07T05:07:07.000Z | 2021-08-22T15:44:53.000Z | #include "Graphics3DAxes.h"
#include <Qt3DExtras/QPhongAlphaMaterial>
#include <Qt3DExtras/QCuboidMesh>
#include <Qt3DExtras/QCylinderMesh>
#include <Qt3DExtras/QText2DEntity>
Graphics3DAxes::Graphics3DAxes(Qt3DCore::QEntity* rootEntity, QObject *parent) : QObject(parent)
{
//Origin Cube
auto cubeEntity = new... | 37.944444 | 158 | 0.732064 | [
"transform"
] |
0177bd771db1cc1bf0d205bc65fb6453287b02f6 | 2,231 | hpp | C++ | include/codegen/include/UnityEngine/ProBuilder/Poly2Tri/AdvancingFrontNode.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 1 | 2021-11-12T09:29:31.000Z | 2021-11-12T09:29:31.000Z | include/codegen/include/UnityEngine/ProBuilder/Poly2Tri/AdvancingFrontNode.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | null | null | null | include/codegen/include/UnityEngine/ProBuilder/Poly2Tri/AdvancingFrontNode.hpp | Futuremappermydud/Naluluna-Modifier-Quest | bfda34370764b275d90324b3879f1a429a10a873 | [
"MIT"
] | 2 | 2021-10-03T02:14:20.000Z | 2021-11-12T09:29:36.000Z | // Autogenerated from CppHeaderCreator on 7/27/2020 3:10:22 PM
// Created by Sc2ad
// =========================================================================
#pragma once
#pragma pack(push, 8)
// Begin includes
#include "utils/typedefs.h"
// Including type: System.Object
#include "System/Object.hpp"
#include "utils/i... | 41.314815 | 136 | 0.737786 | [
"object"
] |
017ded569ee9eaca7071ce54426d1115bdee39fb | 4,503 | cpp | C++ | First semester/Homework/3/dz3.2[icYFTL].cpp | icYFTL/Procedural_programming | 438ce2a5cbaac68b9b628db03c4390a2e20eba42 | [
"Apache-2.0"
] | 3 | 2020-09-10T19:39:47.000Z | 2020-09-24T16:10:11.000Z | First semester/Homework/3/dz3.2[icYFTL].cpp | icYFTL/MIREA_Programming | 438ce2a5cbaac68b9b628db03c4390a2e20eba42 | [
"Apache-2.0"
] | null | null | null | First semester/Homework/3/dz3.2[icYFTL].cpp | icYFTL/MIREA_Programming | 438ce2a5cbaac68b9b628db03c4390a2e20eba42 | [
"Apache-2.0"
] | 1 | 2019-12-19T15:30:39.000Z | 2019-12-19T15:30:39.000Z | /*
* NOTICE: THIS SOLUTION PROBABLY WILL NOT WORK CORRECTLY
* NOTICE: U NEED TO DOWNLOAD AND CONNECT BOOST LIBRARY TO THE PROJECT (GOOGLE IT)
* */
#define _WIN32_WINNT 0x0A00
#define BOOST_DATE_TIME_NO_LIB
#define BOOST_REGEX_NO_LIB
#include <vector>
#include <iostream>
#include <string>
#include <fstream>
#includ... | 22.628141 | 275 | 0.577171 | [
"vector",
"3d"
] |
017ea27c4fbc1528d7f690cf3682f11b8ad79fec | 7,448 | cc | C++ | ns-allinone-2.35/qs/qsagent.cc | nitishk017/ns2project | f037b796ff10300ffe0422580be5855c37d0b140 | [
"MIT"
] | 1 | 2020-05-29T13:04:42.000Z | 2020-05-29T13:04:42.000Z | ns-allinone-2.35/qs/qsagent.cc | nitishk017/ns2project | f037b796ff10300ffe0422580be5855c37d0b140 | [
"MIT"
] | 1 | 2019-01-20T17:35:23.000Z | 2019-01-22T21:41:38.000Z | ns-allinone-2.35/qs/qsagent.cc | nitishk017/ns2project | f037b796ff10300ffe0422580be5855c37d0b140 | [
"MIT"
] | 1 | 2021-09-29T16:06:57.000Z | 2021-09-29T16:06:57.000Z |
/*
* qsagent.cc
* Copyright (C) 2001 by the University of Southern California
* $Id: qsagent.cc,v 1.9 2010/03/08 05:54:53 tom_henderson Exp $
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License,
* version 2, as published by the Free Sof... | 28.319392 | 130 | 0.684748 | [
"object"
] |
0189e28d4fcf903e713e86b49553caf691f594bb | 4,553 | cpp | C++ | src/strongly-connected-component.cpp | yaozhongxiao/algorithm | 657f22952a7ff9974e13c0627fa5923b69ab5487 | [
"Apache-2.0"
] | null | null | null | src/strongly-connected-component.cpp | yaozhongxiao/algorithm | 657f22952a7ff9974e13c0627fa5923b69ab5487 | [
"Apache-2.0"
] | null | null | null | src/strongly-connected-component.cpp | yaozhongxiao/algorithm | 657f22952a7ff9974e13c0627fa5923b69ab5487 | [
"Apache-2.0"
] | null | null | null | /*
* Strongly Conntected Component Generation for DAG
*/
#include <iostream>
#include <vector>
/*
* Vector-Based stack_ extension for std::stack_
*/
template <typename T> class SStack {
public:
SStack(bool flag = false) : dump_flag() {}
~SStack() = default;
void push(const T &v) { container_.push_back(v)... | 23.713542 | 74 | 0.486053 | [
"vector"
] |
018b59bf2e945ef7a376075db470e8c38461d5d5 | 1,401 | hpp | C++ | inc/taskdb.hpp | pirobtumen/Remember | 5d218d9c0e353ff1df7695486c794288f1ba0a96 | [
"MIT"
] | null | null | null | inc/taskdb.hpp | pirobtumen/Remember | 5d218d9c0e353ff1df7695486c794288f1ba0a96 | [
"MIT"
] | null | null | null | inc/taskdb.hpp | pirobtumen/Remember | 5d218d9c0e353ff1df7695486c794288f1ba0a96 | [
"MIT"
] | null | null | null | // -----------------------------------------------------------------------------
#ifndef __TASK_DB_HPP
#define __TASK_DB_HPP
#include <vector>
#include <map>
#include <fstream>
#include "task.hpp"
// -----------------------------------------------------------------------------
class TaskDB{
private:
std::map<unsi... | 28.591837 | 102 | 0.455389 | [
"vector"
] |
018bb6d7eebe6bc00143992d2d31eb60b7fbeac3 | 1,554 | cpp | C++ | TIMUS-1471. Tree/main.cpp | rusucosmin/Cplusplus | 0e95cd01d20b22404aa4166c71d5a9e834a5a21b | [
"MIT"
] | 11 | 2015-08-29T13:41:22.000Z | 2020-01-08T20:34:06.000Z | TIMUS-1471. Tree/main.cpp | rusucosmin/Cplusplus | 0e95cd01d20b22404aa4166c71d5a9e834a5a21b | [
"MIT"
] | null | null | null | TIMUS-1471. Tree/main.cpp | rusucosmin/Cplusplus | 0e95cd01d20b22404aa4166c71d5a9e834a5a21b | [
"MIT"
] | 5 | 2016-01-20T18:17:01.000Z | 2019-10-30T11:57:15.000Z | #include <iostream>
#include <vector>
using namespace std;
const int maxn = 50005;
const int maxlg = 22;
int n, anc[maxlg][maxn], level[maxn];
vector <pair<int, int> > g[maxn];
long long sum[maxn];
inline void dfs(int node, int father) {
level[node] = level[father] + 1;
anc[0][node] = father;
for(auto i... | 23.19403 | 63 | 0.432432 | [
"vector"
] |
01961d3d239270be73a52897361b149202045ed1 | 41,575 | cpp | C++ | third_party/reil/reil/aarch64/printer.cpp | avniculae/TinyInst | ca6ae41539a318b82d0365b91ea703fb3d9bad4e | [
"Apache-2.0"
] | 802 | 2020-06-04T17:55:15.000Z | 2022-03-31T08:47:56.000Z | third_party/reil/reil/aarch64/printer.cpp | avniculae/TinyInst | ca6ae41539a318b82d0365b91ea703fb3d9bad4e | [
"Apache-2.0"
] | 47 | 2020-06-09T09:30:25.000Z | 2022-03-08T10:45:14.000Z | third_party/reil/reil/aarch64/printer.cpp | avniculae/TinyInst | ca6ae41539a318b82d0365b91ea703fb3d9bad4e | [
"Apache-2.0"
] | 80 | 2020-06-04T19:31:45.000Z | 2022-03-28T15:08:06.000Z | // Copyright 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
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in ... | 25.258202 | 80 | 0.509369 | [
"vector"
] |
019f080bd2ec5bb1deb1b4c19f517d845dba406d | 1,683 | cpp | C++ | src/image_view.cpp | gasinvein/vkBasalt | 2aad4245dd133feac80f80177dccba53c6cb2be5 | [
"Zlib"
] | null | null | null | src/image_view.cpp | gasinvein/vkBasalt | 2aad4245dd133feac80f80177dccba53c6cb2be5 | [
"Zlib"
] | null | null | null | src/image_view.cpp | gasinvein/vkBasalt | 2aad4245dd133feac80f80177dccba53c6cb2be5 | [
"Zlib"
] | null | null | null | #include "image_view.hpp"
namespace vkBasalt
{
std::vector<VkImageView> createImageViews(std::shared_ptr<LogicalDevice> pLogicalDevice, VkFormat format, std::vector<VkImage> images, VkImageViewType viewType, VkImageAspectFlags aspectMask, uint32_t mipLevels)
{
std::vector<VkImageView> imageViews(images... | 44.289474 | 215 | 0.715389 | [
"vector"
] |
01b0120fef585704d05ddac937e1e8b0f86df188 | 2,463 | cpp | C++ | src/Engine/Loaders/XmlLoader.cpp | xcasadio/casaengine | 19e34c0457265435c28667df7f2e5c137d954b98 | [
"MIT"
] | null | null | null | src/Engine/Loaders/XmlLoader.cpp | xcasadio/casaengine | 19e34c0457265435c28667df7f2e5c137d954b98 | [
"MIT"
] | null | null | null | src/Engine/Loaders/XmlLoader.cpp | xcasadio/casaengine | 19e34c0457265435c28667df7f2e5c137d954b98 | [
"MIT"
] | null | null | null | #include "Base.h"
#include "XmlLoader.h"
#include "Parsers/Xml/tinyxml2.h"
using namespace tinyxml2;
namespace CasaEngine
{
XmlLoader::XmlLoader()
{
}
XmlLoader::~XmlLoader()
{
}
/**
*
*/
void HandleXmlError(XMLError error_, const std::string& Filename = "")
{
if (error_ != XML_SUCCESS)
{
std::stri... | 33.283784 | 93 | 0.761267 | [
"object"
] |
01b579cbdb46d9d107e9e7711500eec641dae39f | 400 | hpp | C++ | include/wordprediction.hpp | afairon/markov-cpp-playground | cec0e3e27046a8da9b1e51ea93e1caf801dbafda | [
"MIT"
] | null | null | null | include/wordprediction.hpp | afairon/markov-cpp-playground | cec0e3e27046a8da9b1e51ea93e1caf801dbafda | [
"MIT"
] | null | null | null | include/wordprediction.hpp | afairon/markov-cpp-playground | cec0e3e27046a8da9b1e51ea93e1caf801dbafda | [
"MIT"
] | null | null | null | #ifndef WORD_PREDICTION_HPP_
#define WORD_PREDICTION_HPP_
#include <string>
#include <vector>
typedef std::vector<std::string> NGram;
// WordPrediction abstract class for word prediction
class WordPrediction {
public:
WordPrediction() {}
~WordPrediction() {}
virtual void Add(const NGram& ... | 22.222222 | 59 | 0.69 | [
"vector"
] |
01b9b88ea76efd28287db4cae3a79117d468f3a6 | 2,989 | hpp | C++ | include/hops/Model/MultivariateGaussianModel.hpp | modsim/hops | 4285dd75a07dd844295440a0756b3ba25f5819ac | [
"MIT"
] | 7 | 2020-11-26T05:13:03.000Z | 2022-01-12T02:08:40.000Z | include/hops/Model/MultivariateGaussianModel.hpp | modsim/hops | 4285dd75a07dd844295440a0756b3ba25f5819ac | [
"MIT"
] | 1 | 2021-02-20T23:16:34.000Z | 2021-02-20T23:16:34.000Z | include/hops/Model/MultivariateGaussianModel.hpp | modsim/hops | 4285dd75a07dd844295440a0756b3ba25f5819ac | [
"MIT"
] | null | null | null | #ifndef HOPS_MULTIVARIATEGAUSSIANMODEL_HPP
#define HOPS_MULTIVARIATEGAUSSIANMODEL_HPP
#define _USE_MATH_DEFINES
#include <math.h>
#include <Eigen/Cholesky>
#include <Eigen/Core>
#include <Eigen/LU>
#include <utility>
namespace hops {
template<typename Matrix, typename Vector>
class MultivariateGaussianModel {... | 39.853333 | 119 | 0.680495 | [
"vector"
] |
01bb45b469f01440c61a0edcc791ccc248800c6e | 104,146 | cpp | C++ | production/libs/fog/Fog/Src/Fog/G2d/Painting/RasterInit_SSE2.cpp | Lewerow/DetailIdentifier | bd5e0b3b55b5ce5b24db51ae45ed53298d331687 | [
"MIT"
] | null | null | null | production/libs/fog/Fog/Src/Fog/G2d/Painting/RasterInit_SSE2.cpp | Lewerow/DetailIdentifier | bd5e0b3b55b5ce5b24db51ae45ed53298d331687 | [
"MIT"
] | null | null | null | production/libs/fog/Fog/Src/Fog/G2d/Painting/RasterInit_SSE2.cpp | Lewerow/DetailIdentifier | bd5e0b3b55b5ce5b24db51ae45ed53298d331687 | [
"MIT"
] | null | null | null | // [Fog-G2d]
//
// [License]
// MIT, See COPYING file in package
// [Precompiled Headers]
#if defined(FOG_PRECOMP)
#include FOG_PRECOMP
#endif // FOG_PRECOMP
// [Dependencies]
#include <Fog/Core/Global/Global.h>
#include <Fog/G2d/Painting/RasterApi_p.h>
#include <Fog/G2d/Painting/RasterConstants_p.h>
#include <Fog/G... | 67.104381 | 136 | 0.723167 | [
"solid"
] |
01ca43de49f900db17e5af6aa4fdc812b72cd33d | 494 | cpp | C++ | Cplus/SquaresofaSortedArray.cpp | JumHorn/leetcode | 1447237ae8fc3920b19f60b30c71a84b088cc200 | [
"MIT"
] | 1 | 2018-01-22T12:06:28.000Z | 2018-01-22T12:06:28.000Z | Cplus/SquaresofaSortedArray.cpp | JumHorn/leetcode | 1447237ae8fc3920b19f60b30c71a84b088cc200 | [
"MIT"
] | null | null | null | Cplus/SquaresofaSortedArray.cpp | JumHorn/leetcode | 1447237ae8fc3920b19f60b30c71a84b088cc200 | [
"MIT"
] | null | null | null | #include <algorithm>
#include <vector>
using namespace std;
class Solution
{
public:
vector<int> sortedSquares(vector<int> &A)
{
int N = A.size();
vector<int> res(N);
int i = lower_bound(A.begin(), A.end(), 0) - A.begin(), j = i - 1;
//merge
for (int k = 0; i < N || j >= 0; ++k)
{
if (i == N)
res[... | 19.76 | 73 | 0.47166 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.