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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c99c80a3f6ccc516e2d1cdb8c0a8ce5c393e8d37 | 8,054 | hpp | C++ | src/truth_table.hpp | loic-broyer/BDD | 1d3269050f60c57a90446fa627cea56ab2b41d34 | [
"MIT"
] | null | null | null | src/truth_table.hpp | loic-broyer/BDD | 1d3269050f60c57a90446fa627cea56ab2b41d34 | [
"MIT"
] | null | null | null | src/truth_table.hpp | loic-broyer/BDD | 1d3269050f60c57a90446fa627cea56ab2b41d34 | [
"MIT"
] | null | null | null | #pragma once
#include <iostream>
#include <cassert>
#include <vector>
#include <string>
/* helper function for power calculation */
inline int power(int val, int pow){ //OK
if(pow == 0) return 1;
int ret = val;
for(int i=0; i<pow-1;i++) ret *= val;
return ret;
}
/* masks used to filter out unused bits */
inl... | 28.160839 | 123 | 0.629625 | [
"vector"
] |
c99e99dece676f68fa879eb04d4e0e8f969fa479 | 10,180 | cpp | C++ | src/subsume.cpp | Incudine/sat2021 | f56041f50eba1bb89434865f728eaba592ab1f0b | [
"MIT"
] | null | null | null | src/subsume.cpp | Incudine/sat2021 | f56041f50eba1bb89434865f728eaba592ab1f0b | [
"MIT"
] | null | null | null | src/subsume.cpp | Incudine/sat2021 | f56041f50eba1bb89434865f728eaba592ab1f0b | [
"MIT"
] | null | null | null | /*-------------------------------------------------------------------------+
| Copyright (c) 2020, Henrik Cao, henrik.cao@aalto.fi, Espoo, Finland. |
| |
| Permission is hereby granted, free of charge, to any person obtaining a |
| copy of t... | 42.416667 | 80 | 0.507957 | [
"vector"
] |
c9a10ff14aa712ddc4d2d43bf015952095a81a7e | 598 | cpp | C++ | algorithms/137.single-number-ii.cpp | huklee/leetcode | 6337dfde618e2bef97c8622494d180973c5014a9 | [
"MIT"
] | 2 | 2017-02-16T04:37:58.000Z | 2017-03-27T14:20:04.000Z | algorithms/137.single-number-ii.cpp | huklee/leetcode | 6337dfde618e2bef97c8622494d180973c5014a9 | [
"MIT"
] | null | null | null | algorithms/137.single-number-ii.cpp | huklee/leetcode | 6337dfde618e2bef97c8622494d180973c5014a9 | [
"MIT"
] | null | null | null | class Solution {
public:
// O(n) solution with 32 bits
int singleNumber(vector<int>& nums) {
// bit summation & mod 3 operations
int bits[32] = {0,};
for (int i=0; i < nums.size(); i++){
for (int j=0; j < 32; j++){
int mask = 1<<j;
int add_bit ... | 27.181818 | 53 | 0.40301 | [
"vector"
] |
c9a2aa510a318373a79ed1d608e5ffce71c08cbf | 4,307 | hpp | C++ | lib/Atom.hpp | atfrank/LarmorD_New | d1d166c699f26be523557a10523be0f37cb188f5 | [
"BSD-4-Clause-UC"
] | 7 | 2021-06-16T00:48:08.000Z | 2022-03-22T11:21:55.000Z | lib/Atom.hpp | atfrank/LarmorD_New | d1d166c699f26be523557a10523be0f37cb188f5 | [
"BSD-4-Clause-UC"
] | 2 | 2022-01-10T09:56:21.000Z | 2022-01-24T13:22:51.000Z | lib/Atom.hpp | atfrank/Metallo | 0bce801cb127fb8557bf2599ae31d2611ebb0256 | [
"BSD-4-Clause-UC"
] | 2 | 2021-08-28T01:48:28.000Z | 2021-11-24T23:05:28.000Z | /*
Copyright University of Michigan.
This file is part of the Larmor software suite and is made available under license.
University of Michigan (UM) TECHtransfer: phone: 734-763-0614 email: techtransfer@umich.edu.
Author: Sean M. Law and Aaron T. Frank
*/
#ifndef ATOM_H
#define ATOM_H
#include "Coo... | 30.764286 | 127 | 0.661017 | [
"vector"
] |
c9ae9c88c091f989148a9e3d3c7843a0446b6398 | 2,119 | hpp | C++ | editor/bt_editor/BehaviorTreeNodeModel.hpp | miccol/YARP-Behavior-Trees | 6c4767688c71606283eaf7d702e91c646b4a4036 | [
"MIT"
] | 9 | 2019-01-02T13:58:17.000Z | 2021-03-12T08:28:34.000Z | editor/bt_editor/BehaviorTreeNodeModel.hpp | miccol/YARP-Behavior-Trees | 6c4767688c71606283eaf7d702e91c646b4a4036 | [
"MIT"
] | 1 | 2018-03-01T09:20:36.000Z | 2018-03-01T09:20:36.000Z | editor/bt_editor/BehaviorTreeNodeModel.hpp | miccol/YARP-Behavior-Trees | 6c4767688c71606283eaf7d702e91c646b4a4036 | [
"MIT"
] | 5 | 2018-02-28T16:16:45.000Z | 2020-10-28T00:39:49.000Z | #ifndef BEHAVIORTREENODEMODEL_H
#define BEHAVIORTREENODEMODEL_H
#include <QObject>
#include <QLabel>
#include <QFormLayout>
#include <QComboBox>
#include <QTextEdit>
#include <node_editor/NodeDataModel>
#include <iostream>
#include <memory>
#include <vector>
#include <map>
#include <functional>
#include "NodeFactory.... | 22.784946 | 91 | 0.719679 | [
"object",
"vector"
] |
c9b91ad0770cc5d796eb6e14572eb98d73b33353 | 9,562 | cpp | C++ | dockerfiles/gaas_tutorial_2/GAAS/software/SLAM/ygz_slam_ros/Thirdparty/PCL/apps/src/pcd_video_player/pcd_video_player.cpp | hddxds/scripts_from_gi | afb8977c001b860335f9062464e600d9115ea56e | [
"Apache-2.0"
] | 2 | 2019-04-10T14:04:52.000Z | 2019-05-29T03:41:58.000Z | software/SLAM/ygz_slam_ros/Thirdparty/PCL/apps/src/pcd_video_player/pcd_video_player.cpp | glider54321/GAAS | 5c3b8c684e72fdf7f62c5731a260021e741069e7 | [
"BSD-3-Clause"
] | null | null | null | software/SLAM/ygz_slam_ros/Thirdparty/PCL/apps/src/pcd_video_player/pcd_video_player.cpp | glider54321/GAAS | 5c3b8c684e72fdf7f62c5731a260021e741069e7 | [
"BSD-3-Clause"
] | 1 | 2021-12-20T06:54:41.000Z | 2021-12-20T06:54:41.000Z | /*
* Software License Agreement (BSD License)
*
* Point Cloud Library (PCL) - www.pointclouds.org
* Copyright (c) 2010-2012, Willow Garage, Inc.
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following condit... | 30.549521 | 150 | 0.648714 | [
"vector"
] |
c9bd8df9ebb9c912fab995f33987b8a9aae4b065 | 466 | cpp | C++ | competitive-programming/leetcode/contests/contest/contest-two/counting-words-given-prefix.cpp | dushimsam/deep-dive-in-algorithms | 0c6a04b3115ba789ab4aca68cce51c9a3c3a075a | [
"MIT"
] | null | null | null | competitive-programming/leetcode/contests/contest/contest-two/counting-words-given-prefix.cpp | dushimsam/deep-dive-in-algorithms | 0c6a04b3115ba789ab4aca68cce51c9a3c3a075a | [
"MIT"
] | null | null | null | competitive-programming/leetcode/contests/contest/contest-two/counting-words-given-prefix.cpp | dushimsam/deep-dive-in-algorithms | 0c6a04b3115ba789ab4aca68cce51c9a3c3a075a | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int checkcontains(string pref, string word)
{
for (int i = 0; i < pref.length(); i++)
{
if (pref[i] != word[i])
return false;
}
return true;
}
int countPrefix(string pref, vector<string> words)
{
int count = 0;
for (int i = 0; i <... | 17.259259 | 50 | 0.527897 | [
"vector"
] |
c9be271abf3ebaf581391e1dbcecf869891cdfe7 | 2,488 | cpp | C++ | devmand/gateway/src/devmand/channels/cli/Command.cpp | remo5000/magma | 1d1dd9a23800a8e07b1ce016776d93e12430ec15 | [
"BSD-3-Clause"
] | 2 | 2020-11-05T18:58:26.000Z | 2021-02-09T06:42:49.000Z | devmand/gateway/src/devmand/channels/cli/Command.cpp | remo5000/magma | 1d1dd9a23800a8e07b1ce016776d93e12430ec15 | [
"BSD-3-Clause"
] | 14 | 2019-11-15T12:01:18.000Z | 2019-12-12T14:37:42.000Z | devmand/gateway/src/devmand/channels/cli/Command.cpp | 119Vik/magma-1 | 107a7b374466a837fc0a49b283ba9d6ff1d702e3 | [
"BSD-3-Clause"
] | 3 | 2019-11-15T15:56:25.000Z | 2019-11-21T10:34:59.000Z | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the BSD-style license found in the
// LICENSE file in the root directory of this source tree. An additional grant
// of patent rights can be found in the PATENTS file in the same directory.
#include <devmand/... | 29.619048 | 78 | 0.721865 | [
"vector"
] |
c9c5a9fbe66dfd5c24d7fd829a8f279b43b3505b | 490 | cpp | C++ | solved/easy/1512. Number of Good Pairs/main.cpp | SlaveWilson/leetcode | b762380594908ed44ae278ca1a14e9185eec2f0e | [
"MIT"
] | null | null | null | solved/easy/1512. Number of Good Pairs/main.cpp | SlaveWilson/leetcode | b762380594908ed44ae278ca1a14e9185eec2f0e | [
"MIT"
] | null | null | null | solved/easy/1512. Number of Good Pairs/main.cpp | SlaveWilson/leetcode | b762380594908ed44ae278ca1a14e9185eec2f0e | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
class Solution
{
public:
int numIdenticalPairs(vector<int> &nums)
{
int pairs = 0;
for (int i = 0; i < nums.size(); i++)
{
for (int j = 0; j < nums.size(); j++)
{
if (nums[i] == nums[j] && i < j)
pairs++;
}
... | 16.333333 | 43 | 0.522449 | [
"vector"
] |
c9c914e9b29d434d58dc28fd117f0cc74dbb0b7f | 12,370 | cpp | C++ | Sources/Internal/Scene2D/GameObject.cpp | Serviak/dava.engine | d51a26173a3e1b36403f846ca3b2e183ac298a1a | [
"BSD-3-Clause"
] | 1 | 2020-11-14T10:18:24.000Z | 2020-11-14T10:18:24.000Z | Sources/Internal/Scene2D/GameObject.cpp | Serviak/dava.engine | d51a26173a3e1b36403f846ca3b2e183ac298a1a | [
"BSD-3-Clause"
] | null | null | null | Sources/Internal/Scene2D/GameObject.cpp | Serviak/dava.engine | d51a26173a3e1b36403f846ca3b2e183ac298a1a | [
"BSD-3-Clause"
] | 1 | 2020-09-05T21:16:17.000Z | 2020-09-05T21:16:17.000Z | #include "Scene2D/GameObject.h"
#include "Animation/AnimationManager.h"
#include "Logger/Logger.h"
#include "Scene2D/GameObjectManager.h"
#include "Animation/LinearAnimation.h"
#include "Animation/BezierSplineAnimation.h"
#include "Collision/CollisionObject2.h"
#include "Animation/KeyframeAnimation.h"
#include "Scene2... | 27.86036 | 143 | 0.679062 | [
"render",
"object"
] |
c9c94a28cf2fc291e64e25d4a877dc8b63da2bec | 407 | cpp | C++ | CPP STL/vector/vector3.cpp | Jon3sjns/open-source-contribution | b1dc4a90ce3bd5575b74bf2961a9f6867d16aef4 | [
"MIT"
] | 2 | 2022-03-10T17:37:24.000Z | 2022-03-10T17:40:05.000Z | CPP STL/vector/vector3.cpp | Jon3sjns/open-source-contribution | b1dc4a90ce3bd5575b74bf2961a9f6867d16aef4 | [
"MIT"
] | null | null | null | CPP STL/vector/vector3.cpp | Jon3sjns/open-source-contribution | b1dc4a90ce3bd5575b74bf2961a9f6867d16aef4 | [
"MIT"
] | 1 | 2021-12-29T16:13:52.000Z | 2021-12-29T16:13:52.000Z | #include <bits/stdc++.h>
using namespace std;
//#define int long long
int count = 0;
//part:-3 vector initialization, declaration and traversal
int main()
{
int n = 3, x = 10; //n is the size of vector, and x is the element. so the vector will be :- {10,10,10}
vector<int> v(n, x);
for (auto it = v.begin... | 21.421053 | 107 | 0.567568 | [
"vector"
] |
c9d2920b418e167bdf54bf3699ab3e149a8b285a | 9,452 | cpp | C++ | training/src/compiler/training/compiler/WorkflowEager.cpp | steelONIONknight/bolt | 9bd3d08f2abb14435ca3ad0179889e48fa7e9b47 | [
"MIT"
] | null | null | null | training/src/compiler/training/compiler/WorkflowEager.cpp | steelONIONknight/bolt | 9bd3d08f2abb14435ca3ad0179889e48fa7e9b47 | [
"MIT"
] | null | null | null | training/src/compiler/training/compiler/WorkflowEager.cpp | steelONIONknight/bolt | 9bd3d08f2abb14435ca3ad0179889e48fa7e9b47 | [
"MIT"
] | null | null | null | // Copyright (C) 2022. Huawei Technologies Co., Ltd. All rights reserved.
// Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"),
// to deal in the Software without restriction, including without limitation the rights to use,... | 35.939163 | 194 | 0.562526 | [
"shape",
"vector"
] |
c9d3c22b1ffec07553230de42aa014622f64764f | 643 | cpp | C++ | problems/codeforces/1513/b-and-sequences/code.cpp | brunodccarvalho/competitive | 4177c439174fbe749293b9da3445ce7303bd23c2 | [
"MIT"
] | 7 | 2020-10-15T22:37:10.000Z | 2022-02-26T17:23:49.000Z | problems/codeforces/1513/b-and-sequences/code.cpp | brunodccarvalho/competitive | 4177c439174fbe749293b9da3445ce7303bd23c2 | [
"MIT"
] | null | null | null | problems/codeforces/1513/b-and-sequences/code.cpp | brunodccarvalho/competitive | 4177c439174fbe749293b9da3445ce7303bd23c2 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
// *****
constexpr unsigned long long MOD = 1e9 + 7;
auto solve() {
int N;
cin >> N;
vector<unsigned> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
unsigned sum = accumulate(begin(A), end(A), A[0], std::bit_and<unsigned>{});
unsigned lo... | 18.911765 | 80 | 0.475894 | [
"vector"
] |
c9d7dbcab025f7a701713a9f30fc499413f887bc | 4,632 | cpp | C++ | core/src/editor/edit_variables.cpp | castle-xyz/castle-client | ad43c91a60b8d9137008bb752fe755a75b2ad61b | [
"MIT"
] | 20 | 2020-09-18T18:45:56.000Z | 2022-02-10T22:29:54.000Z | core/src/editor/edit_variables.cpp | castle-xyz/castle-client | ad43c91a60b8d9137008bb752fe755a75b2ad61b | [
"MIT"
] | 8 | 2021-01-27T01:02:47.000Z | 2022-03-09T16:41:48.000Z | core/src/editor/edit_variables.cpp | castle-xyz/castle-client | ad43c91a60b8d9137008bb752fe755a75b2ad61b | [
"MIT"
] | null | null | null | #include "edit_variables.h"
#include "engine.h"
//
// Read / write
//
void EditVariables::read(Reader &reader) {
variables.clear();
reader.each([&]() {
auto variableIdCStr = reader.str("id");
if (!variableIdCStr) {
return;
}
auto nameCStr = reader.str("name");
if (!nameCStr) {
retu... | 31.944828 | 86 | 0.636874 | [
"vector"
] |
c9e2b7f4c4f00b6c251f5ccc88a76b27feca7684 | 11,718 | cpp | C++ | test/old_tests/UnitTests/FastInput.cpp | sylveon/cppwinrt | 4d5c5ae3de386ce1f18c3410a27b9ceb40aa524d | [
"MIT"
] | 859 | 2016-10-13T00:11:52.000Z | 2019-05-06T15:45:46.000Z | test/old_tests/UnitTests/FastInput.cpp | shinsetsu/cppwinrt | ae0378373d2318d91448b8697a91d5b65a1fb2e5 | [
"MIT"
] | 655 | 2019-10-08T12:15:16.000Z | 2022-03-31T18:26:40.000Z | test/old_tests/UnitTests/FastInput.cpp | shinsetsu/cppwinrt | ae0378373d2318d91448b8697a91d5b65a1fb2e5 | [
"MIT"
] | 137 | 2016-10-13T04:19:59.000Z | 2018-11-09T05:08:03.000Z | #include "pch.h"
#include "catch.hpp"
#include "winrt/Component.h"
using namespace winrt;
using namespace Windows::Foundation;
using namespace Windows::Foundation::Collections;
using namespace Component;
TEST_CASE("FastInput")
{
FastInput fast;
{
REQUIRE(fast.String(L"One") == L"One");
REQUIR... | 43.4 | 169 | 0.587899 | [
"vector"
] |
5190bb3990acff177c9c5b88551c1273ac311b3b | 1,478 | hpp | C++ | cpp/Containers/DemoVector/aqueue.hpp | ArboreusSystems/arboreus_examples | 17d39e18f4b2511c19f97d4e6c07ec9d7087fae8 | [
"BSD-3-Clause"
] | 17 | 2019-02-19T21:29:22.000Z | 2022-01-29T11:03:45.000Z | cpp/Containers/DemoVector/aqueue.hpp | MbohBless/arboreus_examples | 97f0e25182bbc4b5ffab37c6157514332002aeee | [
"BSD-3-Clause"
] | null | null | null | cpp/Containers/DemoVector/aqueue.hpp | MbohBless/arboreus_examples | 97f0e25182bbc4b5ffab37c6157514332002aeee | [
"BSD-3-Clause"
] | 9 | 2021-02-21T05:32:23.000Z | 2022-02-26T07:51:52.000Z | // ----------------------------------------------------------
/*!
\class AQueue
\title
\brief Template file files/cppheader/file.h
\list
\li @notice Template file classes/file.h
\li @copyright Arboreus (http://arboreus.systems)
\li @author Alexandr Kirilov (http://alexandr.kirilov.me)
\li @created 20/01/2020 a... | 12.114754 | 61 | 0.541949 | [
"vector"
] |
519187e459d14220d5490ab145a3ffcf22341e0b | 912 | cpp | C++ | avogadro/tooltipfilter.cpp | adityanarayanm095/avogadroapp | 1452c4707e50c7e1c27c610219f0bef955a0572c | [
"BSD-3-Clause"
] | 113 | 2015-01-21T22:39:50.000Z | 2022-03-15T22:02:21.000Z | avogadro/tooltipfilter.cpp | adityanarayanm095/avogadroapp | 1452c4707e50c7e1c27c610219f0bef955a0572c | [
"BSD-3-Clause"
] | 122 | 2015-04-10T17:04:33.000Z | 2022-03-11T21:02:31.000Z | avogadro/tooltipfilter.cpp | adityanarayanm095/avogadroapp | 1452c4707e50c7e1c27c610219f0bef955a0572c | [
"BSD-3-Clause"
] | 61 | 2015-01-29T16:23:59.000Z | 2022-03-10T13:16:41.000Z | /******************************************************************************
This source file is part of the Avogadro project.
This source code is released under the 3-Clause BSD License, (see "LICENSE").
******************************************************************************/
#include "tooltipfilter.h"
... | 29.419355 | 79 | 0.575658 | [
"object"
] |
5194221e92d7ac40ddc876158e6edf0ebe7df648 | 781 | cpp | C++ | src/nc/core/ir/vars/Variable.cpp | treadstoneproject/tracethreat_nrml | bcf666b01c20f7da4234fed018dad3b2cf4d3d28 | [
"Apache-2.0"
] | 6 | 2016-09-06T02:10:08.000Z | 2021-01-19T09:02:04.000Z | src/nc/core/ir/vars/Variable.cpp | treadstoneproject/tracethreat_nrml | bcf666b01c20f7da4234fed018dad3b2cf4d3d28 | [
"Apache-2.0"
] | null | null | null | src/nc/core/ir/vars/Variable.cpp | treadstoneproject/tracethreat_nrml | bcf666b01c20f7da4234fed018dad3b2cf4d3d28 | [
"Apache-2.0"
] | 6 | 2015-10-02T14:11:45.000Z | 2021-01-19T09:02:07.000Z | /* The file is part of Snowman decompiler. */
/* See doc/licenses.asciidoc for the licensing information. */
#include "Variable.h"
#include <numeric> /* std::accumulate */
namespace nc {
namespace core {
namespace ir {
namespace vars {
Variable::Variable(Scope scope, std::vector<TermAndLocation> termsAndLocations):... | 26.033333 | 109 | 0.697823 | [
"vector"
] |
51978f3e2c80fce43df65c9bc68e4741134cdccb | 12,461 | cpp | C++ | samples/PlatformInfo/FlexiTimer2.cpp | apla/cuwire | a9f9a7ab9cd799415adb8ae7cdcbb985b975578d | [
"Unlicense"
] | 70 | 2015-02-05T09:18:51.000Z | 2021-04-15T19:06:22.000Z | samples/PlatformInfo/FlexiTimer2.cpp | apla/cuwire | a9f9a7ab9cd799415adb8ae7cdcbb985b975578d | [
"Unlicense"
] | 5 | 2015-02-03T21:46:53.000Z | 2015-04-08T01:03:54.000Z | samples/PlatformInfo/FlexiTimer2.cpp | apla/cuwire | a9f9a7ab9cd799415adb8ae7cdcbb985b975578d | [
"Unlicense"
] | 2 | 2015-03-26T08:32:04.000Z | 2022-01-30T08:41:54.000Z | /*
FlexiTimer2.h - Using timer2 with a configurable resolution
Wim Leers <work@wimleers.com>
Based on MsTimer2
Javier Valencia <javiervalencia80@gmail.com>
History:
6/Jun/2014 - Added Teensy 3.0 & 3.1 support
16/Dec/2011 - Added Teensy/Teensy++ support (bperrybap)
note: teensy uses timer4 instead of time... | 35.101408 | 251 | 0.659096 | [
"vector"
] |
519fcc48e844ed75828ee1efe40fee3241346ddb | 1,599 | cpp | C++ | Source Code/Core/Resources/ConcreteLoaders/Sphere3DLoaderImpl.cpp | IonutCava/trunk | 19dc976bbd7dc637f467785bd0ca15f34bc31ed5 | [
"MIT"
] | null | null | null | Source Code/Core/Resources/ConcreteLoaders/Sphere3DLoaderImpl.cpp | IonutCava/trunk | 19dc976bbd7dc637f467785bd0ca15f34bc31ed5 | [
"MIT"
] | null | null | null | Source Code/Core/Resources/ConcreteLoaders/Sphere3DLoaderImpl.cpp | IonutCava/trunk | 19dc976bbd7dc637f467785bd0ca15f34bc31ed5 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "Core/Headers/PlatformContext.h"
#include "Core/Resources/Headers/ResourceLoader.h"
#include "Core/Resources/Headers/ResourceCache.h"
#include "Geometry/Material/Headers/Material.h"
#include "Geometry/Shapes/Predefined/Headers/Sphere3D.h"
namespace Divide {
CachedResource_ptr I... | 41 | 132 | 0.473421 | [
"geometry"
] |
51a98f271392e2188e7ae762af378093274b2403 | 2,314 | cpp | C++ | middleware/domain/unittest/source/manager/test_api.cpp | casualcore/casual | 047a4eaabbba52ad3ce63dc698a9325ad5fcec6d | [
"MIT"
] | null | null | null | middleware/domain/unittest/source/manager/test_api.cpp | casualcore/casual | 047a4eaabbba52ad3ce63dc698a9325ad5fcec6d | [
"MIT"
] | null | null | null | middleware/domain/unittest/source/manager/test_api.cpp | casualcore/casual | 047a4eaabbba52ad3ce63dc698a9325ad5fcec6d | [
"MIT"
] | 1 | 2022-02-21T18:30:25.000Z | 2022-02-21T18:30:25.000Z | //!
//! Copyright (c) 2019, The casual project
//!
//! This software is licensed under the MIT license, https://opensource.org/licenses/MIT
//!
#include "common/unittest.h"
#include "casual/domain/manager/api/internal/transform.h"
#include "domain/manager/admin/server.h"
#include "domain/manager/unittest/process.h"
... | 27.879518 | 132 | 0.484875 | [
"model",
"transform"
] |
51a9f07ffff3665df1db46f1ae2ff3fe30e0925d | 598 | hpp | C++ | ut/test-contracts/integration_test/integration_test.hpp | fredgrid/bvs | a172d67933ac68ee46aec6db9cc656852e7bcae0 | [
"MIT"
] | 7 | 2019-06-12T01:29:34.000Z | 2022-01-13T17:06:25.000Z | ut/test-contracts/integration_test/integration_test.hpp | fredgrid/bvs | a172d67933ac68ee46aec6db9cc656852e7bcae0 | [
"MIT"
] | null | null | null | ut/test-contracts/integration_test/integration_test.hpp | fredgrid/bvs | a172d67933ac68ee46aec6db9cc656852e7bcae0 | [
"MIT"
] | 1 | 2019-06-10T01:49:49.000Z | 2019-06-10T01:49:49.000Z | /**
* @file
* @copyright defined in bvs/LICENSE
*/
#pragma once
#include <bvsio/bvsio.hpp>
class [[bvsio::contract]] integration_test : public bvsio::contract {
public:
using bvsio::contract::contract;
[[bvsio::action]]
void store( bvsio::name from, bvsio::name to, uint64_t num );
struct [[bvsio::t... | 21.357143 | 71 | 0.635452 | [
"vector"
] |
51aeceedd1f1d13e09a45254d4e3711e25b61d86 | 2,565 | cpp | C++ | generated-sources/cpp-qt5/mojang-api/client/com.github.asyncmc.mojang.api.cpp.qt5.model/OAISecurityQuestion.cpp | AsyncMC/Mojang-API-Libs | b01bbd2bce44bfa2b9ed705a128cf4ecda077916 | [
"Apache-2.0"
] | null | null | null | generated-sources/cpp-qt5/mojang-api/client/com.github.asyncmc.mojang.api.cpp.qt5.model/OAISecurityQuestion.cpp | AsyncMC/Mojang-API-Libs | b01bbd2bce44bfa2b9ed705a128cf4ecda077916 | [
"Apache-2.0"
] | null | null | null | generated-sources/cpp-qt5/mojang-api/client/com.github.asyncmc.mojang.api.cpp.qt5.model/OAISecurityQuestion.cpp | AsyncMC/Mojang-API-Libs | b01bbd2bce44bfa2b9ed705a128cf4ecda077916 | [
"Apache-2.0"
] | null | null | null | /**
* Mojang API
* No description provided (generated by Openapi Generator https://github.com/openapitools/openapi-generator)
*
* OpenAPI spec version: 2020-06-05
*
*
* NOTE: This class is auto generated by OpenAPI Generator (https://openapi-generator.tech).
* https://openapi-generator.tech
* Do not edit the ... | 20.52 | 109 | 0.677583 | [
"object"
] |
51af253df68eee581aea286501b29cd9468ba7d9 | 3,806 | hpp | C++ | Source/Compiler/Program.hpp | Cristian-A/Spin | 1d63cdcffa7b41325a77ed40b51930ea8244dfc4 | [
"MIT"
] | 4 | 2019-12-06T20:28:14.000Z | 2020-12-28T20:36:10.000Z | Source/Compiler/Program.hpp | Cristian-A/Spin | 1d63cdcffa7b41325a77ed40b51930ea8244dfc4 | [
"MIT"
] | 6 | 2020-02-02T23:39:44.000Z | 2021-03-10T14:08:09.000Z | Source/Compiler/Program.hpp | Cristian-A/Spin | 1d63cdcffa7b41325a77ed40b51930ea8244dfc4 | [
"MIT"
] | null | null | null |
#include "../Common/Header.hpp"
#ifndef SPIN_PROGRAM_HPP
#define SPIN_PROGRAM_HPP
#include "../Token/Token.hpp"
#include <vector>
#include <unordered_map>
namespace Spin {
// Never change the order of types
// since it's used for type check.
enum Interrupt: UInt8 {
write = 0xA0,
writeln = 0x0A,
read = 0... | 16.264957 | 55 | 0.631372 | [
"vector"
] |
51b67caa1513bf6726ed669e121612b4b90bcf11 | 1,166 | cpp | C++ | cpp/godot-cpp/src/gen/VisualScriptBuiltinFunc.cpp | GDNative-Gradle/proof-of-concept | 162f467430760cf959f68f1638adc663fd05c5fd | [
"MIT"
] | 1 | 2021-03-16T09:51:00.000Z | 2021-03-16T09:51:00.000Z | cpp/godot-cpp/src/gen/VisualScriptBuiltinFunc.cpp | GDNative-Gradle/proof-of-concept | 162f467430760cf959f68f1638adc663fd05c5fd | [
"MIT"
] | null | null | null | cpp/godot-cpp/src/gen/VisualScriptBuiltinFunc.cpp | GDNative-Gradle/proof-of-concept | 162f467430760cf959f68f1638adc663fd05c5fd | [
"MIT"
] | null | null | null | #include "VisualScriptBuiltinFunc.hpp"
#include <core/GodotGlobal.hpp>
#include <core/CoreTypes.hpp>
#include <core/Ref.hpp>
#include <core/Godot.hpp>
#include "__icalls.hpp"
namespace godot {
VisualScriptBuiltinFunc::___method_bindings VisualScriptBuiltinFunc::___mb = {};
void VisualScriptBuiltinFunc::___ini... | 32.388889 | 227 | 0.80789 | [
"object"
] |
51b8b3aca58c9494b119cf7c15ef9a6e692bfc5d | 5,121 | cc | C++ | src/decoders/TitleTemplate.cc | b8raoult/magics | eb2c86ec6e392e89c90044128dc671f22283d6ad | [
"ECL-2.0",
"Apache-2.0"
] | 41 | 2018-12-07T23:10:50.000Z | 2022-02-19T03:01:49.000Z | src/decoders/TitleTemplate.cc | b8raoult/magics | eb2c86ec6e392e89c90044128dc671f22283d6ad | [
"ECL-2.0",
"Apache-2.0"
] | 59 | 2019-01-04T15:43:30.000Z | 2022-03-31T09:48:15.000Z | src/decoders/TitleTemplate.cc | b8raoult/magics | eb2c86ec6e392e89c90044128dc671f22283d6ad | [
"ECL-2.0",
"Apache-2.0"
] | 13 | 2019-01-07T14:36:33.000Z | 2021-09-06T14:48:36.000Z | /*
* (C) Copyright 1996-2016 ECMWF.
*
* This software is licensed under the terms of the Apache Licence Version 2.0
* which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
* In applying this licence, ECMWF does not waive the privileges and immunities
* granted to it by virtue of its status as an in... | 30.482143 | 112 | 0.599688 | [
"object"
] |
51b9ed4bd919a41d121fa9e190f04e2b7df13925 | 7,993 | hpp | C++ | src/libraries/lagrangian/intermediate/submodels/Thermodynamic/HeatTransferModel/HeatTransferModel/HeatTransferModel.hpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | src/libraries/lagrangian/intermediate/submodels/Thermodynamic/HeatTransferModel/HeatTransferModel/HeatTransferModel.hpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | src/libraries/lagrangian/intermediate/submodels/Thermodynamic/HeatTransferModel/HeatTransferModel/HeatTransferModel.hpp | MrAwesomeRocks/caelus-cml | 55b6dc5ba47d0e95c07412d9446ac72ac11d7fd7 | [
"mpich2"
] | null | null | null | /*---------------------------------------------------------------------------*\
Copyright (C) 2014 Applied CCM
Copyright (C) 2011-2015 OpenFOAM Foundation
-------------------------------------------------------------------------------
License
This file is part of CAELUS.
CAELUS is free software: you can redist... | 28.243816 | 80 | 0.495934 | [
"model"
] |
51bf8ea7675b1de7231fb7896b17bb6ccda24b9e | 96,390 | cpp | C++ | src/_scm.cpp | NCAR/rda-gatherxml | afc7d8693ecb259eb54a501a9d09cf5edee5a782 | [
"MIT"
] | null | null | null | src/_scm.cpp | NCAR/rda-gatherxml | afc7d8693ecb259eb54a501a9d09cf5edee5a782 | [
"MIT"
] | null | null | null | src/_scm.cpp | NCAR/rda-gatherxml | afc7d8693ecb259eb54a501a9d09cf5edee5a782 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include <thread>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <ftw.h>
#include <signal.h>
#include <pthread.h>
#include <sstream>
#include <regex>
#include <gatherxml.hpp>
#include <mymap.hpp>
#include <strutils.hpp>
#include <utils.hpp>
#includ... | 39.246743 | 251 | 0.564571 | [
"vector"
] |
51c195d32537cdb1607ba570bd1e6edae4dd8f60 | 10,138 | cpp | C++ | gtsam/geometry/tests/testTriangulation.cpp | ashariati/gtsam-3.2.1 | f880365c259eb7532b9c1d20979ecad2eb04779c | [
"BSD-3-Clause"
] | 75 | 2015-04-02T08:58:57.000Z | 2022-03-18T08:01:42.000Z | gtsam/geometry/tests/testTriangulation.cpp | ashariati/gtsam-3.2.1 | f880365c259eb7532b9c1d20979ecad2eb04779c | [
"BSD-3-Clause"
] | 5 | 2016-07-05T16:21:08.000Z | 2020-05-13T16:50:42.000Z | gtsam/geometry/tests/testTriangulation.cpp | ashariati/gtsam-3.2.1 | f880365c259eb7532b9c1d20979ecad2eb04779c | [
"BSD-3-Clause"
] | 66 | 2015-06-01T11:22:38.000Z | 2022-02-18T11:03:57.000Z | /* ----------------------------------------------------------------------------
* GTSAM Copyright 2010, Georgia Tech Research Corporation,
* Atlanta, Georgia 30332-0415
* All Rights Reserved
* Authors: Frank Dellaert, et al. (see THANKS for the full author list)
* See LICENSE for the license information
* ----... | 34.482993 | 83 | 0.660189 | [
"geometry",
"vector",
"model"
] |
51c1e6af3271ac4b02a045498fd093c6ad9b200c | 11,756 | cpp | C++ | src/TpMMPD/ExoMM_SimulTieP.cpp | kikislater/micmac | 3009dbdad62b3ad906ec882b74b85a3db86ca755 | [
"CECILL-B"
] | 451 | 2016-11-25T09:40:28.000Z | 2022-03-30T04:20:42.000Z | src/TpMMPD/ExoMM_SimulTieP.cpp | kikislater/micmac | 3009dbdad62b3ad906ec882b74b85a3db86ca755 | [
"CECILL-B"
] | 143 | 2016-11-25T20:35:57.000Z | 2022-03-01T11:58:02.000Z | src/TpMMPD/ExoMM_SimulTieP.cpp | kikislater/micmac | 3009dbdad62b3ad906ec882b74b85a3db86ca755 | [
"CECILL-B"
] | 139 | 2016-12-02T10:26:21.000Z | 2022-03-10T19:40:29.000Z | /*Header-MicMac-eLiSe-25/06/2007
MicMac : Multi Image Correspondances par Methodes Automatiques de Correlation
eLiSe : ELements of an Image Software Environnement
www.micmac.ign.fr
Copyright : Institut Geographique National
Author : Marc Pierrot Deseilligny
Contributors : Gregoire Maillet, ... | 43.865672 | 171 | 0.549677 | [
"geometry",
"vector",
"3d"
] |
51c2f5842f96c0309b970cfbf30d16b97fa9b806 | 1,792 | hpp | C++ | include/hitbit-common.hpp | NewYaroslav/hitbit-cpp-api | fc214cb9b71a20e167e35c3234eb2d04e8eeb7cb | [
"MIT"
] | null | null | null | include/hitbit-common.hpp | NewYaroslav/hitbit-cpp-api | fc214cb9b71a20e167e35c3234eb2d04e8eeb7cb | [
"MIT"
] | null | null | null | include/hitbit-common.hpp | NewYaroslav/hitbit-cpp-api | fc214cb9b71a20e167e35c3234eb2d04e8eeb7cb | [
"MIT"
] | null | null | null | /*
* hitbit-cpp-api - C ++ API client for hitbit
*
* Copyright (c) 2021 Elektro Yar. Email: git.electroyar@gmail.com
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, inc... | 37.333333 | 83 | 0.715402 | [
"transform"
] |
51c37a0581542c6ebf3f08653b41cf9e2fd3c0af | 868 | hpp | C++ | windows/CsForFinancialMarketsPart2/Chapters20+21+22+23/Demos - CLI-CS Interop with Excel/CLI GUI/UtilitiesDJD/Geometry/Mesher.hpp | jdm7dv/financial | 673a552d58751643dbca0ba633aeff119eda107d | [
"MIT"
] | 1 | 2020-06-22T06:54:08.000Z | 2020-06-22T06:54:08.000Z | windows/CsForFinancialMarketsPart2/Chapters20+21+22+23/Demos - CLI-CS Interop with Excel/CLI GUI/UtilitiesDJD/Geometry/Mesher.hpp | jdm7dv/financial | 673a552d58751643dbca0ba633aeff119eda107d | [
"MIT"
] | null | null | null | windows/CsForFinancialMarketsPart2/Chapters20+21+22+23/Demos - CLI-CS Interop with Excel/CLI GUI/UtilitiesDJD/Geometry/Mesher.hpp | jdm7dv/financial | 673a552d58751643dbca0ba633aeff119eda107d | [
"MIT"
] | 2 | 2018-09-19T19:27:18.000Z | 2021-01-05T06:26:06.000Z | // Mesher.hpp
//
// A simple mesher on a 1d domain. We divide
// an interval into J+1 mesh points, J-1 of which
// are internal mesh points.
//
// Future projects:
//
// 1. Separate space and time meshing
// 2. Meshing in hypercubes (modelling geometric aspects)
//
// (C) Datasim Education BV 2006
//
#i... | 20.186047 | 61 | 0.645161 | [
"mesh",
"vector"
] |
51cbcce02e7dbf2ca20d5329e154cbde12d9fcdc | 907 | cpp | C++ | bld/insertionsortstrategy.cpp | kstrat2001/fun | 84a1222b69e4747834617a2c5aa1cb347cd27fc6 | [
"MIT"
] | null | null | null | bld/insertionsortstrategy.cpp | kstrat2001/fun | 84a1222b69e4747834617a2c5aa1cb347cd27fc6 | [
"MIT"
] | null | null | null | bld/insertionsortstrategy.cpp | kstrat2001/fun | 84a1222b69e4747834617a2c5aa1cb347cd27fc6 | [
"MIT"
] | null | null | null | #include "insertionsortstrategy.h"
#include "icomparable.h"
#include <vector>
#include <iostream>
namespace gfx
{
void InsertionSortStrategy::Sort(
std::vector<IComparable*>& sortVec ) const
{
for( size_t i = 1; i < sortVec.size(); ++i )
{
size_t numShift = 0;
... | 22.675 | 69 | 0.411246 | [
"vector"
] |
51ce3a8e4de9755b80bd2bb77d09077e7386040f | 2,535 | cpp | C++ | Il2Native.Logic/NativeImplementations/System.Private.CoreLib/System/StubHelpers/MngdNativeArrayMarshaler.cpp | Vinay1705/cs2cpp | d07d3206fb57edb959df8536562909a4d516e359 | [
"MIT"
] | 192 | 2016-03-23T04:33:24.000Z | 2022-03-28T14:41:06.000Z | Il2Native.Logic/NativeImplementations/System.Private.CoreLib/System/StubHelpers/MngdNativeArrayMarshaler.cpp | Vinay1705/cs2cpp | d07d3206fb57edb959df8536562909a4d516e359 | [
"MIT"
] | 9 | 2017-03-08T14:45:16.000Z | 2021-09-06T09:28:47.000Z | Il2Native.Logic/NativeImplementations/System.Private.CoreLib/System/StubHelpers/MngdNativeArrayMarshaler.cpp | Vinay1705/cs2cpp | d07d3206fb57edb959df8536562909a4d516e359 | [
"MIT"
] | 56 | 2016-03-22T20:37:08.000Z | 2022-03-28T12:20:47.000Z | #include "System.Private.CoreLib.h"
namespace CoreLib { namespace System { namespace StubHelpers {
namespace _ = ::CoreLib::System::StubHelpers;
// Method : System.StubHelpers.MngdNativeArrayMarshaler.CreateMarshaler(System.IntPtr, System.IntPtr, int)
void MngdNativeArrayMarshaler::CreateMarshaler(::CoreL... | 48.75 | 182 | 0.746746 | [
"object"
] |
51d47642820dc1dc2b782b2ae58803262be2565a | 24,359 | cpp | C++ | src/libs/fileext/excel/book.cpp | dmryutov/document2html | 753d37a42a7c9e9daeb33183228ac5bf0df87295 | [
"MIT"
] | 7 | 2018-01-18T05:39:53.000Z | 2020-05-25T10:16:44.000Z | src/libs/fileext/excel/book.cpp | dmryutov/document2html | 753d37a42a7c9e9daeb33183228ac5bf0df87295 | [
"MIT"
] | 1 | 2018-02-07T11:04:23.000Z | 2018-02-10T18:16:02.000Z | src/libs/fileext/excel/book.cpp | dmryutov/document2html | 753d37a42a7c9e9daeb33183228ac5bf0df87295 | [
"MIT"
] | 4 | 2018-06-27T23:53:46.000Z | 2021-09-22T05:38:39.000Z | /**
* @brief Excel files (xls/xlsx) into HTML сonverter
* @package excel
* @file book.cpp
* @author dmryutov (dmryutov@gmail.com)
* @copyright python-excel (https://github.com/python-excel/xlrd)
* @date 02.12.2016 -- 29.01.2018
*/
#include <fstream>
#include "../../encoding/encoding.hpp"
#inc... | 29.597813 | 100 | 0.662958 | [
"vector",
"transform"
] |
51d68abb831d3affee2e10f3661bf8e542477f32 | 1,380 | cpp | C++ | src/graficos/GraficoDeEscenario.cpp | humbertodias/Final-Fight | f5f8983dce599cc68548797d6d992cb34b44c3b2 | [
"MIT"
] | null | null | null | src/graficos/GraficoDeEscenario.cpp | humbertodias/Final-Fight | f5f8983dce599cc68548797d6d992cb34b44c3b2 | [
"MIT"
] | null | null | null | src/graficos/GraficoDeEscenario.cpp | humbertodias/Final-Fight | f5f8983dce599cc68548797d6d992cb34b44c3b2 | [
"MIT"
] | null | null | null | //
// Created by sebas on 10/9/19.
//
#include "GraficoDeEscenario.h"
#include "../servicios/Locator.h"
#include "../modelo/serializables/Posicion.h"
#include <utility>
#include <cmath>
GraficoDeEscenario::GraficoDeEscenario (Entidad * entidad,
vector < SDL_Texture * >sprites,
vector < SDL_Rect > posicione... | 30 | 77 | 0.696377 | [
"vector"
] |
51d840a7544caddd4620b0f55219fbf0ecda7c19 | 4,946 | cpp | C++ | app/src/main/cpp/com_xiaowei_ndkcpp_NDKCpp.cpp | sxwn/ndkcpp | 6d778d6e7ad63109473323b2b722dae9dcf0f462 | [
"Apache-2.0"
] | null | null | null | app/src/main/cpp/com_xiaowei_ndkcpp_NDKCpp.cpp | sxwn/ndkcpp | 6d778d6e7ad63109473323b2b722dae9dcf0f462 | [
"Apache-2.0"
] | null | null | null | app/src/main/cpp/com_xiaowei_ndkcpp_NDKCpp.cpp | sxwn/ndkcpp | 6d778d6e7ad63109473323b2b722dae9dcf0f462 | [
"Apache-2.0"
] | null | null | null | //
// Created by Administrator on 2019/12/20.
//
#include "com_xiaowei_ndkcpp_NDKCpp.h"
#include <iostream>
using namespace std;
#include "model/Student.h"
#include "model/StaticClass.h"
#include "model/FriendFunc.h"
#include <android/log.h>
extern "C" {
//C++构造函数
//需求:Teacher类中没有提供无参数的构造函数,在Student类中定义一个Teac... | 28.923977 | 90 | 0.690659 | [
"model"
] |
51db7297bcaa0ff2d942762969cb219b4148ccb1 | 24,575 | cxx | C++ | IO/AMR/vtkAMReXParticlesReader.cxx | forestGzh/VTK | bc98327275bd5cfa95c5825f80a2755a458b6da8 | [
"BSD-3-Clause"
] | 3 | 2015-07-28T18:07:50.000Z | 2018-02-28T20:59:58.000Z | IO/AMR/vtkAMReXParticlesReader.cxx | forestGzh/VTK | bc98327275bd5cfa95c5825f80a2755a458b6da8 | [
"BSD-3-Clause"
] | 4 | 2018-10-25T09:46:11.000Z | 2019-01-17T16:49:17.000Z | IO/AMR/vtkAMReXParticlesReader.cxx | forestGzh/VTK | bc98327275bd5cfa95c5825f80a2755a458b6da8 | [
"BSD-3-Clause"
] | 4 | 2016-09-08T02:11:00.000Z | 2019-08-15T02:38:39.000Z | /*=========================================================================
Program: Visualization Toolkit
Module: vtkAMReXParticlesReader.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This s... | 29.933009 | 100 | 0.608383 | [
"vector"
] |
51dd177a66211a651ad722e5e923947daccc861d | 8,876 | cpp | C++ | src/ls.cpp | NK-Nikunj/VFMS | d36ff8148dd1fac679a42a3b6655c5bbc220536d | [
"MIT"
] | 1 | 2018-12-27T20:40:22.000Z | 2018-12-27T20:40:22.000Z | src/ls.cpp | NK-Nikunj/VFMS | d36ff8148dd1fac679a42a3b6655c5bbc220536d | [
"MIT"
] | null | null | null | src/ls.cpp | NK-Nikunj/VFMS | d36ff8148dd1fac679a42a3b6655c5bbc220536d | [
"MIT"
] | null | null | null | #include <VFMS/command/realize_command.hpp>
#include <VFMS/command_map.hpp>
#include <VFMS/vfs.hpp>
#include <vector>
#include <string>
#include <unordered_map>
#include <boost/algorithm/string.hpp>
// #include <VFMS/command/ls.hpp>
namespace vfms
{
namespace assets
{
extern void send_error(std::str... | 26.73494 | 125 | 0.423276 | [
"object",
"vector"
] |
51eb35bcb2cdd90a8a9da0aaf02f94b8e546726f | 3,635 | hpp | C++ | include/MultiLibrary/Common/Process.hpp | danielga/multilibrary | 3d1177dd3affa875e06015f5e3e42dda525f3336 | [
"BSD-3-Clause"
] | 2 | 2018-06-22T12:43:57.000Z | 2019-05-31T21:56:27.000Z | include/MultiLibrary/Common/Process.hpp | danielga/multilibrary | 3d1177dd3affa875e06015f5e3e42dda525f3336 | [
"BSD-3-Clause"
] | 1 | 2017-09-09T01:21:31.000Z | 2017-11-12T17:52:56.000Z | include/MultiLibrary/Common/Process.hpp | danielga/multilibrary | 3d1177dd3affa875e06015f5e3e42dda525f3336 | [
"BSD-3-Clause"
] | 1 | 2022-03-30T18:57:41.000Z | 2022-03-30T18:57:41.000Z | /*************************************************************************
* MultiLibrary - https://danielga.github.io/multilibrary/
* A C++ library that covers multiple low level systems.
*------------------------------------------------------------------------
* Copyright (c) 2014-2022, Daniel Almeida
* All righ... | 25.780142 | 104 | 0.678955 | [
"object",
"vector"
] |
51f4df6a98e870282410e14f19b7ab5eed5bb510 | 3,260 | hpp | C++ | http/HttpHandler.hpp | mateuszb/glutenfree | cefd2be7256a94867fdafbd8330cb4c73c6e3e4e | [
"BSD-4-Clause"
] | 1 | 2018-04-03T07:38:58.000Z | 2018-04-03T07:38:58.000Z | http/HttpHandler.hpp | mateuszb/glutenfree | cefd2be7256a94867fdafbd8330cb4c73c6e3e4e | [
"BSD-4-Clause"
] | null | null | null | http/HttpHandler.hpp | mateuszb/glutenfree | cefd2be7256a94867fdafbd8330cb4c73c6e3e4e | [
"BSD-4-Clause"
] | null | null | null | #pragma once
#include <http/request.hpp>
#include <io/ApplicationHandler.hpp>
#include <io/Dispatcher.hpp>
#include <io/Socket.hpp>
#include <map>
#include <memory>
#include <unordered_set>
namespace http
{
using namespace std;
const string make_header(
const uint16_t code,
const string& reason,
const m... | 25.46875 | 70 | 0.66319 | [
"vector"
] |
51f817997571b37a67b16aa10f86e7beb1981998 | 37,744 | cpp | C++ | OnlineDB/EcalCondDB/test/LaserSeqToDB.cpp | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 3 | 2018-08-24T19:10:26.000Z | 2019-02-19T11:45:32.000Z | OnlineDB/EcalCondDB/test/LaserSeqToDB.cpp | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 3 | 2018-08-23T13:40:24.000Z | 2019-12-05T21:16:03.000Z | OnlineDB/EcalCondDB/test/LaserSeqToDB.cpp | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 5 | 2018-08-21T16:37:52.000Z | 2020-01-09T13:33:17.000Z | #include <time.h>
#include <stdio.h>
#include <cmath>
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <cassert>
using namespace std;
#include <TString.h>
#include <TObjString.h>
#include "OnlineDB/EcalCondDB/interface/EcalCondDBInterface.h"
#incl... | 31.61139 | 216 | 0.564143 | [
"vector"
] |
51fb52a7c9ecc760ce76df6a5d1b41e84cf05de0 | 3,026 | cpp | C++ | tests/std/tests/P0024R2_parallel_algorithms_equal/test.cpp | oktonion/STL | e2fce45b9ca899f3887b7fa48e24de95859a7b8e | [
"Apache-2.0"
] | 2 | 2021-01-19T02:43:19.000Z | 2021-11-20T05:21:42.000Z | tests/std/tests/P0024R2_parallel_algorithms_equal/test.cpp | tapaswenipathak/STL | 0d75fc5ab6684d4f6239879a6ec162aad0da860d | [
"Apache-2.0"
] | null | null | null | tests/std/tests/P0024R2_parallel_algorithms_equal/test.cpp | tapaswenipathak/STL | 0d75fc5ab6684d4f6239879a6ec162aad0da860d | [
"Apache-2.0"
] | 4 | 2020-04-24T05:04:54.000Z | 2020-05-17T22:48:58.000Z | // Copyright (c) Microsoft Corporation.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
#include <algorithm>
#include <assert.h>
#include <execution>
#include <forward_list>
#include <iterator>
#include <list>
#include <parallel_algorithms_utilities.hpp>
#include <vector>
using namespace std;
... | 35.186047 | 116 | 0.61996 | [
"vector"
] |
a4023c5eb333bc4457971d619de07a084f10e5bd | 317 | hpp | C++ | include/coulombSolver.hpp | qacwnfq/coulombSolver | e99a90a62d4c43fbd6fa9f85608585b204ff7af4 | [
"MIT"
] | null | null | null | include/coulombSolver.hpp | qacwnfq/coulombSolver | e99a90a62d4c43fbd6fa9f85608585b204ff7af4 | [
"MIT"
] | null | null | null | include/coulombSolver.hpp | qacwnfq/coulombSolver | e99a90a62d4c43fbd6fa9f85608585b204ff7af4 | [
"MIT"
] | null | null | null | #ifndef COULOMBSOLVER_INCLUDE_COULOMBSOLVER_INCLUDED
#define COULOMBSOLVER_INCLUDE_COULOMBSOLVER_INCLUDED
#include <utility>
#include <vector>
#include "float_t.hpp"
namespace coulombSolver {
std::vector<std::vector<Float_t>>
forces(const std::vector<std::pair<Float_t, std::vector<Float_t>>> &particles);
}
#endif
| 24.384615 | 79 | 0.804416 | [
"vector"
] |
a40cee00b59c3f070bbb11a565285461933be201 | 6,407 | cc | C++ | libwfc/libwfc.cc | yexf/wfc | 1d3bf6fef0fd780165960928c979683698546e4b | [
"MIT"
] | null | null | null | libwfc/libwfc.cc | yexf/wfc | 1d3bf6fef0fd780165960928c979683698546e4b | [
"MIT"
] | null | null | null | libwfc/libwfc.cc | yexf/wfc | 1d3bf6fef0fd780165960928c979683698546e4b | [
"MIT"
] | null | null | null | // Copyright (c) 2013 The Chromium Embedded Framework 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 <tchar.h>
#include <io.h>
#include <map>
#include <string>
#include "libwfc.h"
#include "cef_app_handler.h"
#inc... | 25.939271 | 95 | 0.69705 | [
"render",
"object"
] |
a41471b9c1815ab1e938f4183e57271537295078 | 20,146 | cpp | C++ | test/cl/CountTest/CountTest.cpp | MattPD/Bolt | ada8cb02fccd9001947ebe592edc1d3a6715b0e7 | [
"BSL-1.0"
] | 2 | 2017-02-25T04:38:03.000Z | 2018-04-07T10:44:48.000Z | test/cl/CountTest/CountTest.cpp | MattPD/Bolt | ada8cb02fccd9001947ebe592edc1d3a6715b0e7 | [
"BSL-1.0"
] | null | null | null | test/cl/CountTest/CountTest.cpp | MattPD/Bolt | ada8cb02fccd9001947ebe592edc1d3a6715b0e7 | [
"BSL-1.0"
] | 1 | 2021-03-01T11:16:46.000Z | 2021-03-01T11:16:46.000Z | /***************************************************************************
* Copyright 2012 - 2013 Advanced Micro Devices, Inc.
* ... | 34.030405 | 161 | 0.624342 | [
"vector"
] |
a4160b8709552a807b0eff690f770f1de2698c45 | 1,959 | cpp | C++ | src/atcoder/abc107/abc107_b/main_2.cpp | kzmsh/compete | 5cbe8062689a10bd81c97612b800fd434d93aa3f | [
"MIT"
] | null | null | null | src/atcoder/abc107/abc107_b/main_2.cpp | kzmsh/compete | 5cbe8062689a10bd81c97612b800fd434d93aa3f | [
"MIT"
] | null | null | null | src/atcoder/abc107/abc107_b/main_2.cpp | kzmsh/compete | 5cbe8062689a10bd81c97612b800fd434d93aa3f | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
template<typename T>
bool choose_min(T &min, const T &value) {
if (min > value) {
min = value;
return true;
}
return f... | 18.657143 | 62 | 0.416029 | [
"vector"
] |
a41b971a6b39e94d84704046d5e891bde0c1c379 | 2,605 | cpp | C++ | engine/src/math/utils.cpp | olavim/apparitor | b468c49c6d826326d7dfec542a9ed042c60a443a | [
"MIT"
] | null | null | null | engine/src/math/utils.cpp | olavim/apparitor | b468c49c6d826326d7dfec542a9ed042c60a443a | [
"MIT"
] | null | null | null | engine/src/math/utils.cpp | olavim/apparitor | b468c49c6d826326d7dfec542a9ed042c60a443a | [
"MIT"
] | null | null | null | #include <GL/glew.h>
#include <math.h>
#include <stdio.h>
#include "utils.hpp"
namespace apr = apparator;
void apr::printVec(const apr::Vector3 &vec) {
printf("%f, %f, %f\n", vec[0], vec[1], vec[2]);
}
void apr::printVec(const apr::Vector4 &vec) {
printf("%f, %f, %f, %f\n", vec[0], vec[1], vec[2], vec[3]);
}
voi... | 26.85567 | 104 | 0.585797 | [
"vector"
] |
a421f75b947f38b3c687901376fc3cf4797ab390 | 7,496 | cc | C++ | src/Thread.cc | libinqi/idr-routon | 921f0dc044a0815c3df0a5df6600b5443fc6fd98 | [
"MIT"
] | 4 | 2018-07-13T15:39:09.000Z | 2021-02-26T08:29:07.000Z | src/Thread.cc | libinqi/idr-decard | 28d5993724c8500e70482c2f178cc1a5d7fedc81 | [
"MIT"
] | 3 | 2018-08-05T15:03:51.000Z | 2019-11-10T04:29:59.000Z | src/Thread.cc | libinqi/idr-decard | 28d5993724c8500e70482c2f178cc1a5d7fedc81 | [
"MIT"
] | 3 | 2017-11-27T15:20:38.000Z | 2021-03-13T14:58:36.000Z | #include "Thread.h"
Baton *Thread::baton = NULL;
uv_loop_t *Thread::loop = NULL;
void (*Thread::doExecute)() = NULL;
bool Thread::isWaiting = false;
bool Thread::isRan = false;
bool Thread::isDied = false;
static std::string GBKToUTF8(const std::string &strGBK)
{
static std::string strOutUTF8 = "";
WCHAR *str... | 30.348178 | 121 | 0.612193 | [
"object"
] |
a4306ca4ed5e3bbec633e8febfa98e52621f04b5 | 1,619 | cpp | C++ | emulator/src/mame/video/nes.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | 1 | 2022-01-15T21:38:38.000Z | 2022-01-15T21:38:38.000Z | emulator/src/mame/video/nes.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | null | null | null | emulator/src/mame/video/nes.cpp | rjw57/tiw-computer | 5ef1c79893165b8622d1114d81cd0cded58910f0 | [
"MIT"
] | null | null | null | // license:BSD-3-Clause
// copyright-holders:Brad Oliver,Fabio Priuli
/***************************************************************************
video/nes.c
Routines to control the unique NES video hardware/PPU.
***************************************************************************/
#include "emu.h"
#inc... | 25.698413 | 142 | 0.56084 | [
"render"
] |
a43247e5b05b963bbc33b1b9dff4f2c75a7649a7 | 9,625 | cc | C++ | repobuild/nodes/java_library.cc | chrisvana/repobuild | 5fb7ee8901eef5bc243abb64898f841d85bd699f | [
"BSD-3-Clause"
] | 73 | 2015-01-17T02:06:49.000Z | 2021-10-13T07:38:24.000Z | repobuild/nodes/java_library.cc | chrisvana/repobuild | 5fb7ee8901eef5bc243abb64898f841d85bd699f | [
"BSD-3-Clause"
] | 2 | 2015-01-31T14:25:58.000Z | 2015-05-07T15:04:24.000Z | repobuild/nodes/java_library.cc | chrisvana/repobuild | 5fb7ee8901eef5bc243abb64898f841d85bd699f | [
"BSD-3-Clause"
] | 8 | 2015-02-02T06:30:37.000Z | 2021-03-02T14:15:14.000Z | // Copyright 2013
// Author: Christopher Van Arsdale
#include <algorithm>
#include <set>
#include <string>
#include <vector>
#include "common/log/log.h"
#include "common/strings/path.h"
#include "common/strings/strutil.h"
#include "repobuild/env/input.h"
#include "repobuild/nodes/java_library.h"
#include "repobuild/no... | 35.127737 | 82 | 0.609247 | [
"object",
"vector"
] |
a433206415e0d895b4862c48df24280a6eb21967 | 615 | cpp | C++ | LeetCodeSolutions/LeetCode_0303.cpp | lih627/python-algorithm-templates | a61fd583e33a769b44ab758990625d3381793768 | [
"MIT"
] | 24 | 2020-03-28T06:10:25.000Z | 2021-11-23T05:01:29.000Z | LeetCodeSolutions/LeetCode_0303.cpp | lih627/python-algorithm-templates | a61fd583e33a769b44ab758990625d3381793768 | [
"MIT"
] | null | null | null | LeetCodeSolutions/LeetCode_0303.cpp | lih627/python-algorithm-templates | a61fd583e33a769b44ab758990625d3381793768 | [
"MIT"
] | 8 | 2020-05-18T02:43:16.000Z | 2021-05-24T18:11:38.000Z | /*
* @lc app=leetcode.cn id=303 lang=cpp
*
* [303] 区域和检索 - 数组不可变
*/
// @lc code=start
class NumArray {
vector<int> prefix;
public:
NumArray(vector<int>& nums) {
for(auto &num: nums){
if(prefix.empty()) prefix.push_back(num);
else prefix.push_back(prefix.back() + num);
... | 19.83871 | 64 | 0.565854 | [
"object",
"vector"
] |
a433eca54b26188452a20a624fa5887c154736da | 7,772 | cpp | C++ | src/Ypng/PngWriter.cpp | jebreimo/Ypng | 67c9c521b98c9d3c8240be4566b8e7b7758cdd03 | [
"BSD-2-Clause"
] | null | null | null | src/Ypng/PngWriter.cpp | jebreimo/Ypng | 67c9c521b98c9d3c8240be4566b8e7b7758cdd03 | [
"BSD-2-Clause"
] | null | null | null | src/Ypng/PngWriter.cpp | jebreimo/Ypng | 67c9c521b98c9d3c8240be4566b8e7b7758cdd03 | [
"BSD-2-Clause"
] | null | null | null | //****************************************************************************
// Copyright © 2021 Jan Erik Breimo. All rights reserved.
// Created by Jan Erik Breimo on 2021-01-03.
//
// This file is distributed under the BSD License.
// License text is included with the source distribution.
//************************... | 31.088 | 93 | 0.551724 | [
"vector",
"transform"
] |
bfa17e789d4c76a7cc6f95aea56f437ff2068fc4 | 521 | cpp | C++ | Week3/rotate.cpp | AkashRajpurohit/leetcode-october-2020-challenge | 4bf49f2ac1d51c049d166a0bf07b3ae11552f1e7 | [
"MIT"
] | 1 | 2020-10-29T11:21:58.000Z | 2020-10-29T11:21:58.000Z | Week3/rotate.cpp | AkashRajpurohit/leetcode-october-2020-challenge | 4bf49f2ac1d51c049d166a0bf07b3ae11552f1e7 | [
"MIT"
] | null | null | null | Week3/rotate.cpp | AkashRajpurohit/leetcode-october-2020-challenge | 4bf49f2ac1d51c049d166a0bf07b3ae11552f1e7 | [
"MIT"
] | null | null | null | class Solution {
private:
void reverse(vector<int>& nums, int start, int end) {
int tmp;
while(start < end) {
tmp = nums[start];
nums[start] = nums[end];
nums[end] = tmp;
start++;
end--;
}
}
public:
voi... | 21.708333 | 57 | 0.408829 | [
"vector"
] |
bfa32ab02ea8f85eef26c5983768cbd0c07c1203 | 1,699 | cpp | C++ | CLPERM.cpp | NithinSethumadhavan/Competitive-Programming | 8eb31a795bb3f371b09a3a6f341e8925bb4113e2 | [
"MIT"
] | null | null | null | CLPERM.cpp | NithinSethumadhavan/Competitive-Programming | 8eb31a795bb3f371b09a3a6f341e8925bb4113e2 | [
"MIT"
] | null | null | null | CLPERM.cpp | NithinSethumadhavan/Competitive-Programming | 8eb31a795bb3f371b09a3a6f341e8925bb4113e2 | [
"MIT"
] | 10 | 2019-05-21T05:15:36.000Z | 2019-05-21T05:36:26.000Z | #include<bits/stdc++.h>
#define gc getchar
#define pc putchar
#define maxm 100005
#define si(n) scanf("%d",&n)
#define sc(c) scanf("%c",&c)
#define sll(n) scanf("%lld",&n)
#define print(n) printf("%d",n)
#define printll(n) printf("%lld",n)
#define loop(i,j,n) for(int(i)=(j);(i)<(n);++(i))
#define rep(i,n) for... | 18.67033 | 50 | 0.422013 | [
"vector"
] |
bfa50bc2f11acb723b2badc87cfaaf608bbf66d1 | 10,730 | cpp | C++ | tests/chain_tests/atomicswap/atomicswap_service_tests.cpp | scorum/scorum | 1da00651f2fa14bcf8292da34e1cbee06250ae78 | [
"MIT"
] | 53 | 2017-10-28T22:10:35.000Z | 2022-02-18T02:20:48.000Z | tests/chain_tests/atomicswap/atomicswap_service_tests.cpp | Scorum/Scorum | fb4aa0b0960119b97828865d7a5b4d0409af7876 | [
"MIT"
] | 38 | 2017-11-25T09:06:51.000Z | 2018-10-31T09:17:22.000Z | tests/chain_tests/atomicswap/atomicswap_service_tests.cpp | Scorum/Scorum | fb4aa0b0960119b97828865d7a5b4d0409af7876 | [
"MIT"
] | 27 | 2018-01-08T19:43:35.000Z | 2022-01-14T10:50:42.000Z | #include <boost/test/unit_test.hpp>
#include <scorum/chain/services/atomicswap.hpp>
#include <scorum/chain/services/account.hpp>
#include <scorum/chain/schema/account_objects.hpp>
#include <scorum/chain/schema/atomicswap_objects.hpp>
#include <sstream>
#include <fc/time.hpp>
#include "database_default_integration.... | 42.078431 | 120 | 0.734017 | [
"vector"
] |
bfa7f8560f4cd700878a02b9ff9cca17c3118240 | 39,653 | cpp | C++ | runtime.cpp | Vector35/llil_transpiler | 6f6f368d34cb872460ad1634ddcbc4207276feb6 | [
"MIT"
] | 14 | 2019-08-23T13:49:07.000Z | 2021-12-24T20:09:57.000Z | runtime.cpp | Vector35/llil_transpiler | 6f6f368d34cb872460ad1634ddcbc4207276feb6 | [
"MIT"
] | null | null | null | runtime.cpp | Vector35/llil_transpiler | 6f6f368d34cb872460ad1634ddcbc4207276feb6 | [
"MIT"
] | 1 | 2021-12-24T20:10:00.000Z | 2021-12-24T20:10:00.000Z |
#include <string>
#include <vector>
#include <map>
using namespace std;
#include <stdint.h>
#include "runtime.h"
#define DEBUG_RUNTIME_ALL
#define DEBUG_RUNTIME_SETS
#define DEBUG_RUNTIME_STACK
#define debug printf
#if defined(DEBUG_RUNTIME_SETS) || defined(DEBUG_RUNTIME_ALL)
#define debug_set printf
#else
#def... | 30.085736 | 144 | 0.643154 | [
"vector"
] |
bfb0a3720c813c33aad7aa895125bbfce0878b91 | 2,531 | cpp | C++ | Source/AboutWindow.cpp | sergipa/The-Creator-3D | 69acf8a4ac169f96ef8ed15e6eb1a47c3a372bda | [
"MIT"
] | 6 | 2017-11-24T06:15:40.000Z | 2021-01-05T04:47:21.000Z | Source/AboutWindow.cpp | sergipa/The-Creator-3D | 69acf8a4ac169f96ef8ed15e6eb1a47c3a372bda | [
"MIT"
] | null | null | null | Source/AboutWindow.cpp | sergipa/The-Creator-3D | 69acf8a4ac169f96ef8ed15e6eb1a47c3a372bda | [
"MIT"
] | 3 | 2017-11-21T13:11:47.000Z | 2019-07-01T09:22:49.000Z | #include "AboutWindow.h"
AboutWindow::AboutWindow()
{
active = false;
window_name = "About";
}
AboutWindow::~AboutWindow()
{
}
void AboutWindow::DrawWindow()
{
ImGui::Begin(window_name.c_str(), &active,
ImGuiWindowFlags_AlwaysAutoResize |
ImGuiWindowFlags_NoCollapse |
ImGuiWindowFlags_ShowBorders);
ImGui:... | 36.681159 | 95 | 0.720664 | [
"3d"
] |
bfb2699c51d2aad821b3448ab808ddf13d7c2636 | 4,025 | cpp | C++ | Algorithms/Recursion/Crossword Puzzle/solution.cpp | kitarp29/ds-algo-solutions | c06effdaec2ff014248ca399268934cd8a639b5a | [
"MIT"
] | 48 | 2020-12-04T17:48:47.000Z | 2022-02-26T17:56:52.000Z | Algorithms/Recursion/Crossword Puzzle/solution.cpp | kitarp29/ds-algo-solutions | c06effdaec2ff014248ca399268934cd8a639b5a | [
"MIT"
] | 465 | 2020-12-04T02:12:56.000Z | 2021-12-07T16:09:51.000Z | Algorithms/Recursion/Crossword Puzzle/solution.cpp | kitarp29/ds-algo-solutions | c06effdaec2ff014248ca399268934cd8a639b5a | [
"MIT"
] | 199 | 2020-12-04T02:39:56.000Z | 2021-12-07T10:10:50.000Z | #include<bits/stdc++.h>
using namespace std;
// checks all positions in the grid where it's possible to place the strings
bool placeString(vector<string>& grid, const string& l) {
int len = l.length();
bool placed = false;
// check the horizontal positions
// checking each row
for (int i = 0... | 25.314465 | 76 | 0.412919 | [
"vector"
] |
bfb27578fbc482a224d4a84749f4038ecf5d4a08 | 2,270 | hpp | C++ | btcnew/node/voting.hpp | thebitcoinnew/btcnew-node | 59c8e3885ff269befaf3a8f82fe63a0c674cc27b | [
"BSD-2-Clause"
] | null | null | null | btcnew/node/voting.hpp | thebitcoinnew/btcnew-node | 59c8e3885ff269befaf3a8f82fe63a0c674cc27b | [
"BSD-2-Clause"
] | null | null | null | btcnew/node/voting.hpp | thebitcoinnew/btcnew-node | 59c8e3885ff269befaf3a8f82fe63a0c674cc27b | [
"BSD-2-Clause"
] | null | null | null | #pragma once
#include <btcnew/lib/config.hpp>
#include <btcnew/lib/numbers.hpp>
#include <btcnew/lib/utility.hpp>
#include <btcnew/secure/common.hpp>
#include <boost/multi_index/hashed_index.hpp>
#include <boost/multi_index/member.hpp>
#include <boost/multi_index/ordered_index.hpp>
#include <boost/multi_index/random_... | 31.09589 | 158 | 0.771806 | [
"vector"
] |
bfb2c274a3c17e76317eaa4fa0164ccfc00e2696 | 9,306 | hpp | C++ | include/microlife/detail/parser.hpp | qingl812/microlife-json | 69042e12a7c30941e701e1863e92d450713f216c | [
"MIT"
] | null | null | null | include/microlife/detail/parser.hpp | qingl812/microlife-json | 69042e12a7c30941e701e1863e92d450713f216c | [
"MIT"
] | null | null | null | include/microlife/detail/parser.hpp | qingl812/microlife-json | 69042e12a7c30941e701e1863e92d450713f216c | [
"MIT"
] | null | null | null | #pragma once
#include "macro_scope.hpp" // json_assert()
#include <memory> // std::unique_ptr
#include <stack> // stack
namespace microlife {
namespace detail {
/***
* @brief JSON parser
* @details Parses JSON string and returns a tree of nodes
* @author qingl
* @date 2022_04_09
*/
template <template <typename>... | 35.655172 | 80 | 0.441651 | [
"object"
] |
bfb5f5e6f4cfabedde4bbd9c963a24dec7ac4212 | 14,504 | cc | C++ | components/document/src/rich_text/common/RTCommonSource.cc | SBKarr/stappler | d9311cba0b0e9362be55feca39a866d7bccd6dff | [
"MIT"
] | 10 | 2015-06-16T16:52:53.000Z | 2021-04-15T09:21:22.000Z | components/document/src/rich_text/common/RTCommonSource.cc | SBKarr/stappler | d9311cba0b0e9362be55feca39a866d7bccd6dff | [
"MIT"
] | 3 | 2015-09-23T10:04:00.000Z | 2020-09-10T15:47:34.000Z | components/document/src/rich_text/common/RTCommonSource.cc | SBKarr/stappler | d9311cba0b0e9362be55feca39a866d7bccd6dff | [
"MIT"
] | 3 | 2018-11-11T00:37:49.000Z | 2020-09-07T03:04:31.000Z | // This is an open source non-commercial project. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++ and C#: http://www.viva64.com
/**
Copyright (c) 2017 Roman Katuntsev <sbkarr@stappler.org>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and... | 26.612844 | 168 | 0.677675 | [
"vector"
] |
bfc834435de551e786cebe8fcc663413d795767f | 24,681 | cpp | C++ | llvm-5.0.1.src/lib/Target/X86/X86CmovConversion.cpp | ShawnLess/TBD | fc98e93b3462509022fdf403978cd82aa05c2331 | [
"Apache-2.0"
] | 60 | 2017-12-21T06:49:58.000Z | 2022-02-24T09:43:52.000Z | llvm-5.0.1.src/lib/Target/X86/X86CmovConversion.cpp | ShawnLess/TBD | fc98e93b3462509022fdf403978cd82aa05c2331 | [
"Apache-2.0"
] | null | null | null | llvm-5.0.1.src/lib/Target/X86/X86CmovConversion.cpp | ShawnLess/TBD | fc98e93b3462509022fdf403978cd82aa05c2331 | [
"Apache-2.0"
] | 17 | 2017-12-20T09:54:56.000Z | 2021-06-24T05:39:36.000Z | //====-- X86CmovConversion.cpp - Convert Cmov to Branch -------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... | 40.328431 | 80 | 0.631255 | [
"transform"
] |
bfcccb403327a7f3c145b8c5bcb9a176a588830d | 13,101 | cpp | C++ | Hammer/src/Hammer/Scene/Scene.cpp | ZMen9/Hammer | 69284f8f804504ca87d6404250d433fb99156f5a | [
"Apache-2.0"
] | null | null | null | Hammer/src/Hammer/Scene/Scene.cpp | ZMen9/Hammer | 69284f8f804504ca87d6404250d433fb99156f5a | [
"Apache-2.0"
] | null | null | null | Hammer/src/Hammer/Scene/Scene.cpp | ZMen9/Hammer | 69284f8f804504ca87d6404250d433fb99156f5a | [
"Apache-2.0"
] | null | null | null | #include "hmpch.h"
#include "Hammer/Scene/Scene.h"
#include <glm/glm.hpp>
#include "Hammer/Scene/Entity.h"
#include "Hammer/Scene/Components.h"
#include "Hammer/Renderer/Renderer2D.h"
#include "Hammer/Scene/ScriptableEntity.h"
// Box2D phyics
#include <box2d/b2_body.h>
#include <box2d/b2_world.h>
#include <box2d/b2_pol... | 34.385827 | 80 | 0.693459 | [
"render",
"shape",
"transform"
] |
bfce6edb8ee5d8c12e385267c006c8bcfbb8b063 | 762 | cpp | C++ | find_k_closest_elements.cpp | ArnabBir/leetcode-solutions | 31cf1edaa2f39c1f8d0300ad815889999058a0c8 | [
"MIT"
] | null | null | null | find_k_closest_elements.cpp | ArnabBir/leetcode-solutions | 31cf1edaa2f39c1f8d0300ad815889999058a0c8 | [
"MIT"
] | null | null | null | find_k_closest_elements.cpp | ArnabBir/leetcode-solutions | 31cf1edaa2f39c1f8d0300ad815889999058a0c8 | [
"MIT"
] | null | null | null | class Solution {
public:
struct comparator {
bool operator()(pair<long,int> a, pair<long,int> b) {
if(a.first > b.first) return true;
if(a.first < b.first) return false;
return a.second > b.second;
}
};
vector<int> findClosestElements(vector<... | 28.222222 | 78 | 0.497375 | [
"vector"
] |
bfcecff561878b7f167ca24d65ec6131bcbb51a3 | 1,614 | cpp | C++ | LiberoEngine/src/RigidbodyComponent.cpp | Kair0z/LiberoEngine2D | 79fb93d7bbb5f5e6b805da6826c64ffa520989c3 | [
"MIT"
] | null | null | null | LiberoEngine/src/RigidbodyComponent.cpp | Kair0z/LiberoEngine2D | 79fb93d7bbb5f5e6b805da6826c64ffa520989c3 | [
"MIT"
] | null | null | null | LiberoEngine/src/RigidbodyComponent.cpp | Kair0z/LiberoEngine2D | 79fb93d7bbb5f5e6b805da6826c64ffa520989c3 | [
"MIT"
] | null | null | null | #include "PCH.h"
#include "RigidbodyComponent.h"
#include "PhysicsMaster.h"
#include "ColliderComponent.h"
namespace Libero
{
RigidbodyComponent::RigidbodyComponent(BodyType type)
: m_pBody{nullptr}
{
b2BodyDef bodyDef{};
switch (type)
{
case BodyType::Dynamic: bodyDef.type = b2BodyType::b2_dynamicBody; b... | 20.961039 | 79 | 0.741636 | [
"shape"
] |
bfdf8c143bddbdb04e153875631e51e1d0983849 | 2,123 | cpp | C++ | interviewbit/math_power_of_two_integer.cpp | qiaotian/CodeInterview | 294c1ba86d8ace41a121c5ada4ba4c3765ccc17d | [
"WTFPL"
] | 5 | 2016-10-29T09:28:11.000Z | 2019-10-19T23:02:48.000Z | interviewbit/math_power_of_two_integer.cpp | qiaotian/CodeInterview | 294c1ba86d8ace41a121c5ada4ba4c3765ccc17d | [
"WTFPL"
] | null | null | null | interviewbit/math_power_of_two_integer.cpp | qiaotian/CodeInterview | 294c1ba86d8ace41a121c5ada4ba4c3765ccc17d | [
"WTFPL"
] | null | null | null | /*
Given a positive integer which fits in a 32 bit signed integer, find if it can be expressed as A^P where P > 1 and A > 0. A and P both should be integers.
Example
Input : 4
Output : True
as 2^2 = 4.
*/
#include <cmath>
#include <iostream>
// solution one: 内存使用异常MLE
//
// for test case "1024000000"
int gcd(int a, i... | 22.585106 | 154 | 0.505417 | [
"vector"
] |
bfe2e9921d841b102e75e23b7c0b32008fac78c6 | 996 | cpp | C++ | src/processor.cpp | satlawa/ucy_cpp_system_monitor | 7d71783d4f19396a2ac4b405f959fed83858bd95 | [
"MIT"
] | null | null | null | src/processor.cpp | satlawa/ucy_cpp_system_monitor | 7d71783d4f19396a2ac4b405f959fed83858bd95 | [
"MIT"
] | null | null | null | src/processor.cpp | satlawa/ucy_cpp_system_monitor | 7d71783d4f19396a2ac4b405f959fed83858bd95 | [
"MIT"
] | null | null | null | #include <string>
#include <vector>
#include "processor.h"
#include "linux_parser.h"
using std::string;
using std::vector;
Processor::Processor() : oldTotal_(0.0), oldIdle_(0.0) {};
// TODO: Return the aggregate CPU utilization
float Processor::Utilization() {
vector<long> cpuInfo = LinuxParser::CpuUtilization()... | 29.294118 | 75 | 0.687751 | [
"vector"
] |
bfef92dc99bf9ec5cb5d29b568ce24eae1fcdbdc | 1,537 | cpp | C++ | leetcode-cpp/LowestCommonAncestorofaBinarySearchTree_235.cpp | emacslisp/cpp | 8230f81117d6f64adaa1696b0943cdb47505335a | [
"Apache-2.0"
] | null | null | null | leetcode-cpp/LowestCommonAncestorofaBinarySearchTree_235.cpp | emacslisp/cpp | 8230f81117d6f64adaa1696b0943cdb47505335a | [
"Apache-2.0"
] | null | null | null | leetcode-cpp/LowestCommonAncestorofaBinarySearchTree_235.cpp | emacslisp/cpp | 8230f81117d6f64adaa1696b0943cdb47505335a | [
"Apache-2.0"
] | null | null | null | #include <vector>
#include <iostream>
#include <climits>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <math.h>
#include "lib/Tree.h"
using namespace std;
#define ll long long
#define ld long double
#define fora(i, start, end) for(int i=start;i<end;i++)
#define forb(i, start, end) for(... | 23.287879 | 78 | 0.554327 | [
"vector"
] |
bff2440a83efc83457125d73135cbde0a17f829f | 5,733 | cpp | C++ | main.cpp | Not-Nik/HUE | 645471456ba04378d47302d43645f6280b2cb00d | [
"MIT"
] | 3 | 2020-07-25T10:27:50.000Z | 2021-04-08T12:36:40.000Z | main.cpp | Not-Nik/HUE | 645471456ba04378d47302d43645f6280b2cb00d | [
"MIT"
] | null | null | null | main.cpp | Not-Nik/HUE | 645471456ba04378d47302d43645f6280b2cb00d | [
"MIT"
] | null | null | null | #include <map>
#include <string>
#include <vector>
#include <iostream>
bool Throw(const std::string & s) { throw std::runtime_error(s); }
#define assert(cond) (cond ? true : Throw("Assertion failed; line " + std::to_string(lex_pos.l) + " column " + std::to_string(lex_pos.c)))
#define match(s, r) (assert((r ? read() :... | 29.25 | 138 | 0.546136 | [
"vector"
] |
bff3383eda89955155766e483b2acfbcde789c40 | 1,345 | cc | C++ | Distortion.cc | lemrobotry/thesis | 14ad489e8f04cb957707b89c454ee7d81ec672ad | [
"MIT"
] | null | null | null | Distortion.cc | lemrobotry/thesis | 14ad489e8f04cb957707b89c454ee7d81ec672ad | [
"MIT"
] | null | null | null | Distortion.cc | lemrobotry/thesis | 14ad489e8f04cb957707b89c454ee7d81ec672ad | [
"MIT"
] | null | null | null | #include <Fsa/Static.hh>
#include "Distortion.hh"
namespace Permute {
Fsa::ConstAutomatonRef distortion (const Permutation & p, double d) {
// For now, assumes (possibly erroneously) that the tokens in the sentence
// are unique.
Fsa::StaticAutomaton * fsa = new Fsa::StaticAutomaton (Fsa::TypeAcceptor)... | 34.487179 | 81 | 0.592565 | [
"model"
] |
bff9fcfdde5499b494fa01aead53df3bb89f09d4 | 132,300 | cpp | C++ | Felix/MemoryWindowFrame.cpp | ultimatezen/felix | 5a7ad298ca4dcd5f1def05c60ae3c84519ec54c4 | [
"MIT"
] | null | null | null | Felix/MemoryWindowFrame.cpp | ultimatezen/felix | 5a7ad298ca4dcd5f1def05c60ae3c84519ec54c4 | [
"MIT"
] | null | null | null | Felix/MemoryWindowFrame.cpp | ultimatezen/felix | 5a7ad298ca4dcd5f1def05c60ae3c84519ec54c4 | [
"MIT"
] | null | null | null | /*!
* \date 2007/01/31
* \author Ryan Ginstrom
*
* Detailed description here.
*
* Copyright (C) Ryan Ginstrom.
*/
#include "StdAfx.h"
#include "MemoryWindowFrame.h"
#include "winuser.h"
#include "ConcordanceDialog.h"
#include "aboutdlg.h" // CAboutDlg
#include "PropertiesDlg.h" // CProp... | 25.764362 | 155 | 0.703893 | [
"object",
"vector",
"model"
] |
87041c11a22d38efb91a936ff54e0dcdf584df16 | 17,919 | cc | C++ | chrome/browser/ui/ash/launcher/arc_app_launcher_browsertest.cc | xzhan96/chromium.src | 1bd0cf3997f947746c0fc5406a2466e7b5f6159e | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2021-01-07T18:51:03.000Z | 2021-01-07T18:51:03.000Z | chrome/browser/ui/ash/launcher/arc_app_launcher_browsertest.cc | emilio/chromium.src | 1bd0cf3997f947746c0fc5406a2466e7b5f6159e | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | chrome/browser/ui/ash/launcher/arc_app_launcher_browsertest.cc | emilio/chromium.src | 1bd0cf3997f947746c0fc5406a2466e7b5f6159e | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/common/shelf/shelf_delegate.h"
#include "ash/common/wm_shell.h"
#include "ash/wm/window_util.h"
#include "base/macros.h"
#include "base/run_... | 35.343195 | 80 | 0.729338 | [
"vector"
] |
870684e9bfa58efef25333e164f43fd29b3503c1 | 2,844 | cpp | C++ | third_party/spirv-tools/test/ext_inst.non_semantic_test.cpp | Alan-love/filament | 87ee5783b7f72bb5b045d9334d719ea2de9f5247 | [
"Apache-2.0"
] | 13,885 | 2018-08-03T17:46:24.000Z | 2022-03-31T14:26:19.000Z | test/ext_inst.non_semantic_test.cpp | indrarahul2013/SPIRV-Tools | 636f449e1529a10d259eb7dc37d97192cf2820f8 | [
"Apache-2.0"
] | 3,533 | 2015-11-16T15:43:09.000Z | 2022-03-31T17:42:38.000Z | test/ext_inst.non_semantic_test.cpp | indrarahul2013/SPIRV-Tools | 636f449e1529a10d259eb7dc37d97192cf2820f8 | [
"Apache-2.0"
] | 1,500 | 2018-08-03T23:34:27.000Z | 2022-03-30T13:43:10.000Z | // Copyright (c) 2015-2016 The Khronos Group 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 applicable ... | 31.252747 | 79 | 0.753868 | [
"vector"
] |
8708b657396c6e6a3b6ba0308f41ef672b8fc203 | 5,079 | hpp | C++ | src/Engine/Manager/ResourceManager.hpp | Chainsawkitten/test-dev | 7b2e1bf4bac48b17a92c2ef60a56d0248947ee83 | [
"MIT"
] | 10 | 2019-01-13T05:51:54.000Z | 2022-02-02T14:34:47.000Z | src/Engine/Manager/ResourceManager.hpp | Chainsawkitten/test-dev | 7b2e1bf4bac48b17a92c2ef60a56d0248947ee83 | [
"MIT"
] | 46 | 2016-12-30T11:14:25.000Z | 2021-09-04T12:50:40.000Z | src/Engine/Manager/ResourceManager.hpp | Chainsawkitten/test-dev | 7b2e1bf4bac48b17a92c2ef60a56d0248947ee83 | [
"MIT"
] | 4 | 2017-09-28T09:00:58.000Z | 2019-10-22T05:28:32.000Z | #pragma once
#include <map>
#include <string>
namespace Video {
class Renderer;
class LowLevelRenderer;
class Texture2D;
namespace Geometry {
class Rectangle;
}
} // namespace Video
namespace Geometry {
class Cube;
class Model;
} // namespace Geometry
namespace Audio {
class SoundFile;
class AudioMaterial;
} // names... | 26.180412 | 72 | 0.653672 | [
"geometry",
"model"
] |
8708bc3f271513f1af18e2dcf035767258980f1e | 7,915 | hpp | C++ | include/la/matrix_engine.hpp | abakfja/linear-algebra | 024974bc537f3c1aa86bd011e5821e6e4465aa49 | [
"MIT"
] | null | null | null | include/la/matrix_engine.hpp | abakfja/linear-algebra | 024974bc537f3c1aa86bd011e5821e6e4465aa49 | [
"MIT"
] | null | null | null | include/la/matrix_engine.hpp | abakfja/linear-algebra | 024974bc537f3c1aa86bd011e5821e6e4465aa49 | [
"MIT"
] | null | null | null | //
// Copyright (c) 2021 Kannav Mehta
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
#ifndef LA_MATRIX_ENGINE_H
#define LA_MATRIX_ENGINE_H
#include <cstddef>
#include <array>
#include <vector>
#inclu... | 30.917969 | 93 | 0.683007 | [
"object",
"vector"
] |
871400f5ab1fde94bb1d2213912c9819ba5f8f08 | 1,829 | cpp | C++ | Backtracking/N-Queens-2-52-brute.cpp | devangi2000/Data-Structures-Algorithms-Handbook | ce0f00de89af5da7f986e65089402dc6908a09b5 | [
"MIT"
] | 38 | 2021-10-14T09:36:53.000Z | 2022-01-27T02:36:19.000Z | Backtracking/N-Queens-2-52-brute.cpp | devangi2000/Data-Structures-Algorithms-Handbook | ce0f00de89af5da7f986e65089402dc6908a09b5 | [
"MIT"
] | null | null | null | Backtracking/N-Queens-2-52-brute.cpp | devangi2000/Data-Structures-Algorithms-Handbook | ce0f00de89af5da7f986e65089402dc6908a09b5 | [
"MIT"
] | 4 | 2021-12-06T15:47:12.000Z | 2022-02-04T04:25:00.000Z | // The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.
// Given an integer n, return the number of distinct solutions to the n-queens puzzle.
// Example 1:
// Input: n = 4
// Output: 2
// Explanation: There are two distinct solutions to the ... | 26.507246 | 124 | 0.4538 | [
"vector"
] |
871a0b94dca1a11f48e3de3add1f1df8fad6ff7b | 1,992 | cpp | C++ | CppSTL/Chapter1/io/append_to_file.cpp | SebastianTirado/Cpp-Learning-Archive | fb83379d0cc3f9b2390cef00119464ec946753f4 | [
"MIT"
] | 19 | 2019-09-15T12:23:51.000Z | 2020-06-18T08:31:26.000Z | CppSTL/Chapter1/io/append_to_file.cpp | SebastianTirado/Cpp-Learning-Archive | fb83379d0cc3f9b2390cef00119464ec946753f4 | [
"MIT"
] | 15 | 2021-12-07T06:46:03.000Z | 2022-01-31T07:55:32.000Z | CppSTL/Chapter1/io/append_to_file.cpp | SebastianTirado/Cpp-Learning-Archive | fb83379d0cc3f9b2390cef00119464ec946753f4 | [
"MIT"
] | 13 | 2019-06-29T02:58:27.000Z | 2020-05-07T08:52:22.000Z | #include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define FAIL 1
#define SUCCESS 0
#define FILENAME "/home/diman91/Documents/Cpp-STL-Examples/Firewall.txt"
bool cat_file(const char* filename)
{
char ch;
ifstream in_file;
in_file.open(filename);
if(!in_file.is_open()) {
cout ... | 21.652174 | 101 | 0.558735 | [
"vector"
] |
871a761b1a33ae53173596d17fec8a2173e200ac | 3,018 | cpp | C++ | tests/validation/reference/ReductionOperation.cpp | hemantbits/ComputeLibrary | 389335e60b96926761ee64974e1330194a3b69fb | [
"MIT"
] | 2 | 2020-07-25T20:27:14.000Z | 2021-08-22T17:20:59.000Z | tests/validation/reference/ReductionOperation.cpp | hemantbits/ComputeLibrary | 389335e60b96926761ee64974e1330194a3b69fb | [
"MIT"
] | null | null | null | tests/validation/reference/ReductionOperation.cpp | hemantbits/ComputeLibrary | 389335e60b96926761ee64974e1330194a3b69fb | [
"MIT"
] | 1 | 2021-08-22T17:09:09.000Z | 2021-08-22T17:09:09.000Z | /*
* Copyright (c) 2017-2018 ARM Limited.
*
* SPDX-License-Identifier: MIT
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* ri... | 31.768421 | 153 | 0.70444 | [
"shape"
] |
26b5bd84c59a08fab14308c813bc67db61aba791 | 14,604 | cpp | C++ | ConsoleApplication2/overlay.cpp | freshertm/WinOpenGLLiveWallpaper | 924793d3b1cdad3216d7bac6fc93e5a85e20f87f | [
"MIT"
] | 2 | 2020-06-22T13:28:41.000Z | 2021-11-17T01:29:25.000Z | ConsoleApplication2/overlay.cpp | freshertm/WinOpenGLLiveWallpaper | 924793d3b1cdad3216d7bac6fc93e5a85e20f87f | [
"MIT"
] | null | null | null | ConsoleApplication2/overlay.cpp | freshertm/WinOpenGLLiveWallpaper | 924793d3b1cdad3216d7bac6fc93e5a85e20f87f | [
"MIT"
] | null | null | null | #include "overlay.h"
#include <stdexcept>
DXOverlay::DXOverlay(UINT32 width, UINT32 height, DWORD keyColor) : width(width), height(height), keyColor(keyColor)
{
// Initialize DirectDraw
if( InitDDraw() < 0 )
throw std::logic_error("Failed to initialize DirectDraw.");
// Check overlay support
... | 31.61039 | 117 | 0.556902 | [
"object"
] |
26bc2e707f2c78e79e70f74524e6bdd0c335fbed | 2,888 | cpp | C++ | Tudat/External/SpiceInterface/spiceRotationalEphemeris.cpp | sebranchett/tudat | 24e5f3cc85c250fcbed0aac37f026c1dd7fd6c44 | [
"BSD-3-Clause"
] | null | null | null | Tudat/External/SpiceInterface/spiceRotationalEphemeris.cpp | sebranchett/tudat | 24e5f3cc85c250fcbed0aac37f026c1dd7fd6c44 | [
"BSD-3-Clause"
] | null | null | null | Tudat/External/SpiceInterface/spiceRotationalEphemeris.cpp | sebranchett/tudat | 24e5f3cc85c250fcbed0aac37f026c1dd7fd6c44 | [
"BSD-3-Clause"
] | null | null | null | /* Copyright (c) 2010-2019, Delft University of Technology
* All rigths reserved
*
* This file is part of the Tudat. Redistribution and use in source and
* binary forms, with or without modification, are permitted exclusively
* under the terms of the Modified BSD license. You should have receiv... | 43.757576 | 118 | 0.762465 | [
"vector"
] |
26c06e5b73ad884704a80a115117e827bd25bb58 | 6,081 | cpp | C++ | day5/src/p1.cpp | aeden/aoc2021 | ca0e796169d5ca86f899e72d0754914445aacfb0 | [
"MIT"
] | 1 | 2021-12-01T13:08:14.000Z | 2021-12-01T13:08:14.000Z | day5/src/p1.cpp | aeden/aoc2021 | ca0e796169d5ca86f899e72d0754914445aacfb0 | [
"MIT"
] | null | null | null | day5/src/p1.cpp | aeden/aoc2021 | ca0e796169d5ca86f899e72d0754914445aacfb0 | [
"MIT"
] | 1 | 2021-12-07T21:12:57.000Z | 2021-12-07T21:12:57.000Z | #include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include "lib/io.h"
using namespace std;
const string SEGMENT_DELIMITER = " -> ";
const string COORDINATE_DELIMITER = ",";
class Coordinates {
public:
int x;
int y;
Coordinates() {
x = 0;... | 26.211207 | 98 | 0.534123 | [
"vector"
] |
26c1e76867b731b104c308f7159d056ab1aa82f3 | 8,791 | cpp | C++ | src/DisciplesGL/MidRenderer.cpp | Verokster/DisciplesGL | dfe07126835f14282bc9894f739cce07b33c8f78 | [
"MIT"
] | 38 | 2019-03-04T11:05:45.000Z | 2022-01-27T23:53:36.000Z | src/DisciplesGL/MidRenderer.cpp | Verokster/DisciplesGL | dfe07126835f14282bc9894f739cce07b33c8f78 | [
"MIT"
] | 5 | 2019-07-08T15:58:21.000Z | 2021-02-23T22:25:23.000Z | src/DisciplesGL/MidRenderer.cpp | Verokster/DisciplesGL | dfe07126835f14282bc9894f739cce07b33c8f78 | [
"MIT"
] | 1 | 2021-02-28T13:23:57.000Z | 2021-02-28T13:23:57.000Z | /*
MIT License
Copyright (c) 2020 Oleksiy Ryabchun
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, ... | 33.048872 | 194 | 0.679672 | [
"vector"
] |
26c30c843b63ca3989b183031be751ecf1458429 | 33,995 | hpp | C++ | c++/include/serial/impl/stltypes.hpp | OpenHero/gblastn | a0d6c1c288fe916ab85fc637a44cdd6e79ebd2a8 | [
"MIT"
] | 31 | 2016-12-09T04:56:59.000Z | 2021-12-31T17:19:10.000Z | c++/include/serial/impl/stltypes.hpp | OpenHero/gblastn | a0d6c1c288fe916ab85fc637a44cdd6e79ebd2a8 | [
"MIT"
] | 6 | 2017-03-10T17:25:13.000Z | 2021-09-22T15:49:49.000Z | c++/include/serial/impl/stltypes.hpp | OpenHero/gblastn | a0d6c1c288fe916ab85fc637a44cdd6e79ebd2a8 | [
"MIT"
] | 20 | 2015-01-04T02:15:17.000Z | 2021-12-03T02:31:43.000Z | #ifndef STLTYPES__HPP
#define STLTYPES__HPP
/* $Id: stltypes.hpp 354590 2012-02-28 16:30:13Z ucko $
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/databas... | 36.397216 | 188 | 0.604707 | [
"vector"
] |
26ca7f3a6a036b669ddd9e1e1b46ea10f88746cd | 3,114 | cpp | C++ | src/State.cpp | MartinsLucas/Jogos | e72ac454d19557d3a45211a57e0695bb6c3f104a | [
"MIT"
] | null | null | null | src/State.cpp | MartinsLucas/Jogos | e72ac454d19557d3a45211a57e0695bb6c3f104a | [
"MIT"
] | 7 | 2019-06-06T17:39:10.000Z | 2019-07-17T07:37:55.000Z | src/State.cpp | MartinsLucas/Jogos | e72ac454d19557d3a45211a57e0695bb6c3f104a | [
"MIT"
] | null | null | null | #include "State.h"
#include "Alien.h"
#include "Camera.h"
#include "CameraFollower.h"
#include <memory>
State::State() : music("assets/audio/stageState.ogg") {
this->quitRequested = false;
this->started = false;
// this->music.Play(-1);
this->objectArray = std::vector<std::shared_ptr<GameObject>>();
}
void ... | 26.389831 | 89 | 0.68754 | [
"render",
"object",
"vector"
] |
26caa05204d61fdb25eea46977a0449cca2d5fef | 1,093 | hpp | C++ | stan/math/prim/arr/fun/rep_array.hpp | christophernhill/math | dc41aba296d592c7099be15eed6ba136d0f140b3 | [
"BSD-3-Clause"
] | null | null | null | stan/math/prim/arr/fun/rep_array.hpp | christophernhill/math | dc41aba296d592c7099be15eed6ba136d0f140b3 | [
"BSD-3-Clause"
] | null | null | null | stan/math/prim/arr/fun/rep_array.hpp | christophernhill/math | dc41aba296d592c7099be15eed6ba136d0f140b3 | [
"BSD-3-Clause"
] | null | null | null | #ifndef STAN_MATH_PRIM_ARR_FUN_REP_ARRAY_HPP
#define STAN_MATH_PRIM_ARR_FUN_REP_ARRAY_HPP
#include <stan/math/prim/meta.hpp>
#include <stan/math/prim/err.hpp>
#include <vector>
namespace stan {
namespace math {
template <typename T>
inline std::vector<T> rep_array(const T& x, int n) {
check_nonnegative("rep_array"... | 28.025641 | 80 | 0.651418 | [
"vector"
] |
26d17b1a9aedf724371a5589132da100ad174df7 | 5,599 | cpp | C++ | kernel/thor/system/acpi/pm-interface.cpp | Apache-HB/managarm | df922a987167948369ea1d0e675925126bb5fdad | [
"MIT"
] | null | null | null | kernel/thor/system/acpi/pm-interface.cpp | Apache-HB/managarm | df922a987167948369ea1d0e675925126bb5fdad | [
"MIT"
] | null | null | null | kernel/thor/system/acpi/pm-interface.cpp | Apache-HB/managarm | df922a987167948369ea1d0e675925126bb5fdad | [
"MIT"
] | null | null | null |
#ifdef __x86_64__
#include <arch/io_space.hpp>
#include <thor-internal/arch/hpet.hpp>
#endif
#include <thor-internal/fiber.hpp>
#include <thor-internal/io.hpp>
#include <thor-internal/kernel_heap.hpp>
#include <thor-internal/acpi/pm-interface.hpp>
#include <hw.frigg_bragi.hpp>
#include <mbus.frigg_pb.hpp>
#include <b... | 33.130178 | 92 | 0.716914 | [
"object"
] |
26ee8ba2ed7eb3d28dfab58767205b7e70d1c250 | 7,424 | cpp | C++ | gm_dotnet_native/dotnethelper-src/LuaAPIExposure.cpp | SupinePandora43/GmodDotNet | 515af9dd012f2a07184c71fd229ca50f9982c987 | [
"MIT"
] | null | null | null | gm_dotnet_native/dotnethelper-src/LuaAPIExposure.cpp | SupinePandora43/GmodDotNet | 515af9dd012f2a07184c71fd229ca50f9982c987 | [
"MIT"
] | null | null | null | gm_dotnet_native/dotnethelper-src/LuaAPIExposure.cpp | SupinePandora43/GmodDotNet | 515af9dd012f2a07184c71fd229ca50f9982c987 | [
"MIT"
] | null | null | null | //
// Created by Gleb Krasilich on 06.10.2019.
//
#include "LuaAPIExposure.h"
#include <GarrysMod/Lua/Interface.h>
#include <GarrysMod/Lua/LuaBase.h>
#include <string>
#include <cstring>
using namespace std;
using namespace GarrysMod;
using namespace GarrysMod::Lua;
int export_top(ILuaBase * lua)
{
return lua->... | 18.890585 | 127 | 0.675512 | [
"vector"
] |
26fc6579ac4c61618386f6d648f567181bc27932 | 5,287 | cpp | C++ | odevice/app/src/main/jni/ParallelME/runtime/src/parallelme/Buffer.cpp | rcarvs/android-ocr | f8760afd378607ced0beca0b2c1beda14ea4ab49 | [
"MIT"
] | 5 | 2016-08-09T17:09:46.000Z | 2020-12-12T21:17:33.000Z | src/parallelme/Buffer.cpp | ParallelME/runtime | 80c3104c88e8efe9e4d746aa2976702c84f6302d | [
"Apache-2.0"
] | 12 | 2016-04-07T19:42:02.000Z | 2017-06-12T13:37:50.000Z | src/parallelme/Buffer.cpp | ParallelME/runtime | 80c3104c88e8efe9e4d746aa2976702c84f6302d | [
"Apache-2.0"
] | 2 | 2017-04-07T20:31:10.000Z | 2021-04-19T23:24:38.000Z | /* _ __ ____
* _ __ ___ _____ ___ __ __ ___ __ / | / / __/
* | _ \/ _ | _ | / _ | / / / / / __/ / / | / / /__
* | __/ __ | ___|/ __ |/ /_/ /__/ __/ /__ / / v / /__
* |_| /_/ |_|_|\_\/_/ |_/____/___/___/____/ /_/ /_/____/
*
*/
#incl... | 29.536313 | 92 | 0.631171 | [
"object"
] |
f8049cdb35e74a6c9ee1219bece7e5cf652cac6d | 2,554 | cpp | C++ | samples/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.NameObjectCollectionBase.IsReadOnly/CPP/nocb_isreadonly.cpp | hamarb123/dotnet-api-docs | 6aeb55784944a2f1f5e773b657791cbd73a92dd4 | [
"CC-BY-4.0",
"MIT"
] | 421 | 2018-04-01T01:57:50.000Z | 2022-03-28T15:24:42.000Z | samples/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.NameObjectCollectionBase.IsReadOnly/CPP/nocb_isreadonly.cpp | hamarb123/dotnet-api-docs | 6aeb55784944a2f1f5e773b657791cbd73a92dd4 | [
"CC-BY-4.0",
"MIT"
] | 5,797 | 2018-04-02T21:12:23.000Z | 2022-03-31T23:54:38.000Z | samples/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.NameObjectCollectionBase.IsReadOnly/CPP/nocb_isreadonly.cpp | hamarb123/dotnet-api-docs | 6aeb55784944a2f1f5e773b657791cbd73a92dd4 | [
"CC-BY-4.0",
"MIT"
] | 1,482 | 2018-03-31T11:26:20.000Z | 2022-03-30T22:36:45.000Z | // The following example creates a read-only collection.
// For an expanded version of this example, see the NameObjectCollectionBase class topic.
// <snippet1>
#using <System.dll>
using namespace System;
using namespace System::Collections;
using namespace System::Collections::Specialized;
public ref class ... | 27.76087 | 97 | 0.615114 | [
"object"
] |
f80bc9eb48ced907adbdc991c1c0e53bb8dcf694 | 766 | cpp | C++ | Algorithms/0970.Powerful_Integers.cpp | metehkaya/LeetCode | 52f4a1497758c6f996d515ced151e8783ae4d4d2 | [
"MIT"
] | 2 | 2020-07-20T06:40:22.000Z | 2021-11-20T01:23:26.000Z | Problems/LeetCode/Problems/0970.Powerful_Integers.cpp | metehkaya/Algo-Archive | 03b5fdcf06f84a03125c57762c36a4e03ca6e756 | [
"MIT"
] | null | null | null | Problems/LeetCode/Problems/0970.Powerful_Integers.cpp | metehkaya/Algo-Archive | 03b5fdcf06f84a03125c57762c36a4e03ca6e756 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<int> getVec(int x , int lim) {
vector<int> v(1,1);
if(x > 1)
while(v.back()*x <= lim) {
int add = v.back()*x;
v.push_back(add);
}
return v;
}
vector<int> powerfulIntegers(int x, int y, int lim) {
... | 28.37037 | 57 | 0.409922 | [
"vector"
] |
f80e2b07400b983fc7bb5618be298fb75f5ca254 | 3,478 | cpp | C++ | src/qsspropertyblock.cpp | ajax-crypto/libqss | e8f24319e587640b6748202bc645589c2b6a5a9a | [
"MIT"
] | 2 | 2020-12-14T15:40:06.000Z | 2021-09-22T02:34:18.000Z | src/qsspropertyblock.cpp | ajax-crypto/libqss | e8f24319e587640b6748202bc645589c2b6a5a9a | [
"MIT"
] | null | null | null | src/qsspropertyblock.cpp | ajax-crypto/libqss | e8f24319e587640b6748202bc645589c2b6a5a9a | [
"MIT"
] | null | null | null | #include "../include/qsspropertyblock.h"
qss::PropertyBlock::PropertyBlock(const QString & str)
{
parse(str);
}
qss::PropertyBlock& qss::PropertyBlock::operator=(const PropertyBlock &block)
{
m_params = block.m_params;
return *this;
}
qss::PropertyBlock& qss::PropertyBlock::addParam(const QString &key, c... | 22.584416 | 118 | 0.610983 | [
"vector"
] |
f8136f6299f50e15b45f47ef96b7f4de1661794d | 1,572 | cpp | C++ | test_case/main.cpp | Ji-Yuhang/pat_cpp | 100525878db4119eaa4be25ef192af9a3b9543bd | [
"MIT"
] | null | null | null | test_case/main.cpp | Ji-Yuhang/pat_cpp | 100525878db4119eaa4be25ef192af9a3b9543bd | [
"MIT"
] | null | null | null | test_case/main.cpp | Ji-Yuhang/pat_cpp | 100525878db4119eaa4be25ef192af9a3b9543bd | [
"MIT"
] | null | null | null | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <assert.h>
#include <queue>
#include <cstdlib>
#include <ctime>
using namespace std;
void test_case()
{
std::srand(std::time(0)); //use current time as seed for random generator
queue<int> Q;
vector<int> G[101];
int s_id... | 20.415584 | 77 | 0.379135 | [
"vector"
] |
f814f8502d4b76918675c2cff1f1cf13b692a70c | 5,255 | cpp | C++ | RayTracer/RayTracer.cpp | yiyaowen/RayTracer | cf600fae714d78c1617b5043430fe2c4d4f5d99c | [
"MIT"
] | null | null | null | RayTracer/RayTracer.cpp | yiyaowen/RayTracer | cf600fae714d78c1617b5043430fe2c4d4f5d99c | [
"MIT"
] | null | null | null | RayTracer/RayTracer.cpp | yiyaowen/RayTracer | cf600fae714d78c1617b5043430fe2c4d4f5d99c | [
"MIT"
] | null | null | null | /*
* Ray Tracer @ https://github.com/yiyaowen/RayTracer
*
* yiyaowen 2021 (c) All Rights Reserved.
*
* Also see tutorial: Ray Tracing in One Weekend by Peter Shirley.
* Web URL: https://raytracing.github.io/books/RayTracingInOneWeekend.html
*/
#include <functional>
#include <future>
#include <thread>
#include "... | 41.377953 | 118 | 0.60628 | [
"render",
"vector"
] |
f818fa23e21e1190a537e423f7eda8164f6985a1 | 5,197 | cpp | C++ | VSSimDB/VSEventSupplierOneTableCommon.cpp | sfegan/ChiLA | 916bdd95348c2df2ecc736511d5f5b2bfb4a831e | [
"BSD-3-Clause"
] | 1 | 2018-04-17T14:03:36.000Z | 2018-04-17T14:03:36.000Z | VSSimDB/VSEventSupplierOneTableCommon.cpp | sfegan/ChiLA | 916bdd95348c2df2ecc736511d5f5b2bfb4a831e | [
"BSD-3-Clause"
] | null | null | null | VSSimDB/VSEventSupplierOneTableCommon.cpp | sfegan/ChiLA | 916bdd95348c2df2ecc736511d5f5b2bfb4a831e | [
"BSD-3-Clause"
] | null | null | null | //-*-mode:c++; mode:font-lock;-*-
/*! \file VSEventSupplierOneTableCommon.cpp
Input of event from single table from simulations dataCommon
\author Stephen Fegan \n
UCLA \n
sfegan@astro.ucla.edu \n
\version 0.1
\date ... | 29.196629 | 78 | 0.734077 | [
"vector"
] |
f819c6e47a19d72ba0ea24d1bda86ea7874a5e58 | 12,686 | cpp | C++ | DebugLoop.cpp | devinacker/UnrealKey | 591c4ae8d4ccad0031af0fc5fa042e4d45512a5e | [
"MIT"
] | 22 | 2021-05-04T00:59:54.000Z | 2022-03-05T11:55:43.000Z | DebugLoop.cpp | LievreAI/UnrealKey | 591c4ae8d4ccad0031af0fc5fa042e4d45512a5e | [
"MIT"
] | 13 | 2021-10-31T03:11:36.000Z | 2022-03-02T01:50:55.000Z | DebugLoop.cpp | LievreAI/UnrealKey | 591c4ae8d4ccad0031af0fc5fa042e4d45512a5e | [
"MIT"
] | 3 | 2021-12-22T21:19:43.000Z | 2022-02-25T00:51:03.000Z | #include <cstdio>
#include <vector>
#include <string>
#include "Breakpoint.h"
#include "DebugLoop.h"
#include "common.h"
extern "C"
{
#include "aes.h"
}
#define PID_DEBUG(fmt, pid, ...) printf("[%5d] " fmt, pid, __VA_ARGS__)
static union
{
WCHAR g_pathw[1024];
CHAR g_path[1024];
};
struct FoundKey
{
std::wstrin... | 26.319502 | 127 | 0.662463 | [
"vector"
] |
f81be673b8d1e838336e2f32988289e9c57e0877 | 819 | cpp | C++ | Visual Studio 2010/Projects/bjarneStroustrupC++PartIV/bjarneStroustrupC++PartIV/Chapter26Drill4.cpp | Ziezi/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | 9 | 2018-10-24T15:16:47.000Z | 2021-12-14T13:53:50.000Z | Visual Studio 2010/Projects/bjarneStroustrupC++PartIV/bjarneStroustrupC++PartIV/Chapter26Drill4.cpp | ChrisBKirov/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | null | null | null | Visual Studio 2010/Projects/bjarneStroustrupC++PartIV/bjarneStroustrupC++PartIV/Chapter26Drill4.cpp | ChrisBKirov/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | 7 | 2018-10-29T15:30:37.000Z | 2021-01-18T15:15:09.000Z | /*
TITLE Test Binary_search with strings Chapter26Drill4.cpp
COMMENT
Objective: Repeat the tests with sequence of strings
such as: { Bohr , Darwin , Einstein , Lavoisier , Newton , Turing }
Input: -
Output: -
Author: Chris B. Kirov
Date: 31.05.2017
*/
#include <iostream>
#include <... | 18.2 | 74 | 0.623932 | [
"vector"
] |
f822aacc7e5686ea42cdae8930b07b061221df4b | 5,430 | cpp | C++ | cbits/python/bind_operator.cpp | twesterhout/nqs-playground | 9fbb65a0631f2a0898effe5bfb1bbb41966cce65 | [
"BSD-3-Clause"
] | 10 | 2019-12-19T07:37:52.000Z | 2021-05-23T11:02:31.000Z | cbits/python/bind_operator.cpp | twesterhout/nqs-playground | 9fbb65a0631f2a0898effe5bfb1bbb41966cce65 | [
"BSD-3-Clause"
] | 4 | 2018-12-05T21:03:15.000Z | 2021-04-09T14:32:55.000Z | cbits/python/bind_operator.cpp | twesterhout/nqs-playground | 9fbb65a0631f2a0898effe5bfb1bbb41966cce65 | [
"BSD-3-Clause"
] | 6 | 2018-10-11T08:03:53.000Z | 2020-04-29T12:24:20.000Z | #include "bind_operator.hpp"
#include "../operator.hpp"
#include "../trim.hpp"
#include <fmt/format.h>
#include <pybind11/complex.h>
#include <pybind11/numpy.h>
#include <pybind11/pybind11.h>
#include <pybind11/stl.h>
#include <torch/extension.h>
TCM_NAMESPACE_BEGIN
namespace {
template <class T> auto make_call_func... | 41.136364 | 84 | 0.505525 | [
"object",
"shape",
"vector"
] |
f82884f68cea1e963a43e0eb76aac85934cf367a | 7,705 | cpp | C++ | test/compliance.cpp | ningfei/charls | 071958cd855c76ed9b5831b116aa9c07ebf0fd2b | [
"BSD-3-Clause"
] | null | null | null | test/compliance.cpp | ningfei/charls | 071958cd855c76ed9b5831b116aa9c07ebf0fd2b | [
"BSD-3-Clause"
] | null | null | null | test/compliance.cpp | ningfei/charls | 071958cd855c76ed9b5831b116aa9c07ebf0fd2b | [
"BSD-3-Clause"
] | null | null | null | //
// (C) Jan de Vaan 2007-2010, all rights reserved. See the accompanying "License.txt" for licensed use.
//
#include "compliance.h"
#include "util.h"
#include "../src/charls.h"
#include <iostream>
#include <vector>
#include <cstring>
using namespace charls;
namespace
{
void Triplet2Planar(std:... | 34.397321 | 189 | 0.623491 | [
"vector",
"transform"
] |
f82c181f42f4b44a16a9c2f71cd69350ca7a3d5c | 5,826 | hpp | C++ | Support/Modules/PropertyOperations/DynamicBuiltInPropertyDefinitionContainer.hpp | graphisoft-python/TextEngine | 20c2ff53877b20fdfe2cd51ce7abdab1ff676a70 | [
"Apache-2.0"
] | 3 | 2019-07-15T10:54:54.000Z | 2020-01-25T08:24:51.000Z | Support/Modules/PropertyOperations/DynamicBuiltInPropertyDefinitionContainer.hpp | graphisoft-python/GSRoot | 008fac2c6bf601ca96e7096705e25b10ba4d3e75 | [
"Apache-2.0"
] | null | null | null | Support/Modules/PropertyOperations/DynamicBuiltInPropertyDefinitionContainer.hpp | graphisoft-python/GSRoot | 008fac2c6bf601ca96e7096705e25b10ba4d3e75 | [
"Apache-2.0"
] | 1 | 2020-09-26T03:17:22.000Z | 2020-09-26T03:17:22.000Z | // Contact person: KiP
#ifndef DYNAMIC_BUILTIN_PROPERTY_DEFINITION_CONTAINER_HPP
#define DYNAMIC_BUILTIN_PROPERTY_DEFINITION_CONTAINER_HPP
#pragma once
// === Includes ========================================================================================================
// from Property"
#include "OrderedAssociat... | 52.486486 | 176 | 0.662547 | [
"object"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.