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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b2d03b0b492537c5a55cac6853119e893b9b5980 | 5,980 | cpp | C++ | kernel/elfreader.cpp | Bunogi/bunos | 52e55d16938c87d45aa148c18d3bf389f2067445 | [
"BSD-3-Clause"
] | null | null | null | kernel/elfreader.cpp | Bunogi/bunos | 52e55d16938c87d45aa148c18d3bf389f2067445 | [
"BSD-3-Clause"
] | null | null | null | kernel/elfreader.cpp | Bunogi/bunos | 52e55d16938c87d45aa148c18d3bf389f2067445 | [
"BSD-3-Clause"
] | null | null | null | #include <bustd/math.hpp>
#include <bustd/vector.hpp>
#include <kernel/elfreader.hpp>
#include <kernel/filesystem/vfs.hpp>
#include <kernel/memory.hpp>
#include <kernel/process.hpp>
#include <kernel/x86/memory.hpp>
#include <string.h>
#define ELFSIZE 32
#include <kernel/exec_elf.h>
#define DEBUG_ELF
#ifdef DEBUG_ELF
... | 29.60396 | 78 | 0.653344 | [
"vector"
] |
b2d56deb26e0696f9ce96a29f32d7d29fc6e980f | 5,380 | cpp | C++ | tests/test_point.cpp | orbingol/PointVector | c1c11d934b40105b4cf37019655bb78481f9091a | [
"MIT"
] | 1 | 2019-03-26T00:58:51.000Z | 2019-03-26T00:58:51.000Z | tests/test_point.cpp | orbingol/PointVector | c1c11d934b40105b4cf37019655bb78481f9091a | [
"MIT"
] | null | null | null | tests/test_point.cpp | orbingol/PointVector | c1c11d934b40105b4cf37019655bb78481f9091a | [
"MIT"
] | 1 | 2019-03-26T00:58:50.000Z | 2019-03-26T00:58:50.000Z | /**
* PointVector -- n-dimensional point and vector implementations
* Copyright (c) 2018 Onur Rauf Bingol
*
* Licensed under the MIT License
* Catch2 is licensed under the Boost Software Licence 1.0 -- https://github.com/catchorg/Catch2
*
*
* Unit testing of Point class using Catch Framework
*/
#define CATCH_... | 24.125561 | 96 | 0.529182 | [
"vector"
] |
b2d9707fd7e239574d2c7e1b7792ae47c281234b | 33,432 | cpp | C++ | admin/wmi/wbem/tools/wmic/wmiclixmllog.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | admin/wmi/wbem/tools/wmic/wmiclixmllog.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | admin/wmi/wbem/tools/wmic/wmiclixmllog.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | ///////////////////////////////////////////////////////////////////////
/****************************************************************************
Copyright information : Copyright (c) 1998-1999 Microsoft Corporation
File Name : WMICliLog.cpp
Project Name : WMI Command Line
Author Name : Biplab Mi... | 31.480226 | 82 | 0.609087 | [
"object",
"vector"
] |
b2db194df7dd6a65303da502fd743745202cc2ec | 1,032 | cpp | C++ | solutions/binary_search.cpp | kmykoh97/My-Leetcode | 0ffdea16c3025805873aafb6feffacaf3411a258 | [
"Apache-2.0"
] | null | null | null | solutions/binary_search.cpp | kmykoh97/My-Leetcode | 0ffdea16c3025805873aafb6feffacaf3411a258 | [
"Apache-2.0"
] | null | null | null | solutions/binary_search.cpp | kmykoh97/My-Leetcode | 0ffdea16c3025805873aafb6feffacaf3411a258 | [
"Apache-2.0"
] | null | null | null | // Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If target exists, then return its index, otherwise return -1.
// Example 1:
// Input: nums = [-1,0,3,5,9,12], target = 9
// Output: 4
// Explanation: 9 exists in nums and its index i... | 25.8 | 196 | 0.598837 | [
"vector"
] |
b2de378cc3b4be62ae742e0379202901116159cd | 3,005 | hpp | C++ | include/anvil (deprecated)/ocl/Event.hpp | asmith-git/anvil | 5f31fdeccf70016b8276c261f8ac4f2525dc6f66 | [
"Apache-2.0"
] | null | null | null | include/anvil (deprecated)/ocl/Event.hpp | asmith-git/anvil | 5f31fdeccf70016b8276c261f8ac4f2525dc6f66 | [
"Apache-2.0"
] | null | null | null | include/anvil (deprecated)/ocl/Event.hpp | asmith-git/anvil | 5f31fdeccf70016b8276c261f8ac4f2525dc6f66 | [
"Apache-2.0"
] | null | null | null | //Copyright 2017 Adam G. Smith
//
//Licensed under the Apache License, Version 2.0 (the "License");
//you may not use this file except in compliance with the License.
//You may obtain a copy of the License at
//
//http ://www.apache.org/licenses/LICENSE-2.0
//
//Unless required by applicable law or agreed to in writing... | 29.174757 | 74 | 0.753078 | [
"object",
"vector"
] |
b2e3c7c86f8d55e60d0411353697bb18331bf1d2 | 25,514 | cpp | C++ | src_main/materialsystem/stdshaders/vortwarp_dx9.cpp | ArcadiusGFN/SourceEngine2007 | 51cd6d4f0f9ed901cb9b61456eb621a50ce44f55 | [
"bzip2-1.0.6"
] | 25 | 2018-02-28T15:04:42.000Z | 2021-08-16T03:49:00.000Z | src_main/materialsystem/stdshaders/vortwarp_dx9.cpp | ArcadiusGFN/SourceEngine2007 | 51cd6d4f0f9ed901cb9b61456eb621a50ce44f55 | [
"bzip2-1.0.6"
] | 1 | 2019-09-20T11:06:03.000Z | 2019-09-20T11:06:03.000Z | src_main/materialsystem/stdshaders/vortwarp_dx9.cpp | ArcadiusGFN/SourceEngine2007 | 51cd6d4f0f9ed901cb9b61456eb621a50ce44f55 | [
"bzip2-1.0.6"
] | 9 | 2019-07-31T11:58:20.000Z | 2021-08-31T11:18:15.000Z | // Copyright © 1996-2018, Valve Corporation, All rights reserved.
#include "BaseVSShader.h"
#include "vertexlitgeneric_dx9_helper.h"
#include "vortwarp_ps20.inc"
#include "vortwarp_ps20b.inc"
#include "vortwarp_vs20.inc"
#include "tier1/convar.h"
#include "vortwarp_ps30.inc"
#include "vortwarp_vs30.inc"
DEFINE_FA... | 39.865625 | 80 | 0.684448 | [
"model",
"transform"
] |
b2fa38f6cb20ac9141f03ae7b32c0f44d95f59b5 | 1,471 | hpp | C++ | CompositeFactory/line.hpp | easaemad14/CST276SRS03 | bc5fb7fcbcde1ef250f288f362895262d7b5078a | [
"MIT"
] | null | null | null | CompositeFactory/line.hpp | easaemad14/CST276SRS03 | bc5fb7fcbcde1ef250f288f362895262d7b5078a | [
"MIT"
] | null | null | null | CompositeFactory/line.hpp | easaemad14/CST276SRS03 | bc5fb7fcbcde1ef250f288f362895262d7b5078a | [
"MIT"
] | null | null | null | #pragma once
/********************************************************************************************
* File: line.hpp
* Author: Easa El Sirgany
* easa.elsirgany@oit.edu
*
* Description: Defines the line shape class
********************************************************************************************/... | 19.878378 | 93 | 0.521414 | [
"shape"
] |
b2fc312e71f03b1b3f392e9933ede2535405da0e | 2,820 | cpp | C++ | VoxelEngine/Classes/ShaderManager.cpp | bsy6766/VoxelEngine | d822d8bcc3bf5609bdce2fdc2ef5154994bc23f1 | [
"FTL",
"BSL-1.0",
"Zlib"
] | null | null | null | VoxelEngine/Classes/ShaderManager.cpp | bsy6766/VoxelEngine | d822d8bcc3bf5609bdce2fdc2ef5154994bc23f1 | [
"FTL",
"BSL-1.0",
"Zlib"
] | null | null | null | VoxelEngine/Classes/ShaderManager.cpp | bsy6766/VoxelEngine | d822d8bcc3bf5609bdce2fdc2ef5154994bc23f1 | [
"FTL",
"BSL-1.0",
"Zlib"
] | null | null | null | // pch
#include "PreCompiled.h"
// voxel
#include "ShaderManager.h"
#include "Logger.h"
#include "Config.h"
using namespace Voxel;
ShaderManager::~ShaderManager()
{
releaseAll();
}
Shader * ShaderManager::createShader(const std::string& name, const std::string & filePath, const Shader::Type shaderType)
{
Shader* ... | 19.315068 | 157 | 0.692199 | [
"geometry",
"object"
] |
b2fcf112bcabd6f336a0408ff80810e56bd9ee45 | 826 | cpp | C++ | solutions/cpp/Problem83.cpp | tjyiiuan/LeetCode | abd10944c6a1f7a7f36bd9b6218c511cf6c0f53e | [
"MIT"
] | null | null | null | solutions/cpp/Problem83.cpp | tjyiiuan/LeetCode | abd10944c6a1f7a7f36bd9b6218c511cf6c0f53e | [
"MIT"
] | null | null | null | solutions/cpp/Problem83.cpp | tjyiiuan/LeetCode | abd10944c6a1f7a7f36bd9b6218c511cf6c0f53e | [
"MIT"
] | null | null | null | #pragma once
/*
83. Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.
*/
#include "Source.h"
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if (head == NULL)
{
return head;
}
int last = head->val;
int cu... | 19.666667 | 90 | 0.646489 | [
"vector"
] |
650046297f873f017933ec0fa0311b08524588ce | 8,064 | cpp | C++ | dungeonCrawler.cpp | Dcooley1350/DungeonCrawler | 9ea7b7e6f06fc24d923b262f002f1528059cd0da | [
"MIT"
] | null | null | null | dungeonCrawler.cpp | Dcooley1350/DungeonCrawler | 9ea7b7e6f06fc24d923b262f002f1528059cd0da | [
"MIT"
] | null | null | null | dungeonCrawler.cpp | Dcooley1350/DungeonCrawler | 9ea7b7e6f06fc24d923b262f002f1528059cd0da | [
"MIT"
] | null | null | null |
#include <iostream>
#include <limits>
#include "dungeonCrawler.hpp"
using std::cin, std::cout, std::endl;
void addObjectsToDungeon(char (&)[MAX_SIZE][MAX_SIZE], char, int);
void addObjectToDungeon(char (&)[MAX_SIZE][MAX_SIZE], char, int []);
void resetStream();
bool validateCharacterInput(char, const char [], int);
... | 33.882353 | 125 | 0.543775 | [
"object"
] |
650993404a619ff7cd4f0b87d3617eb493e8bd80 | 4,830 | cpp | C++ | cpp/SynchrO/SynchrO.cpp | kfsone/tinker | 81ed372117bcad691176aac960302f497adf8d82 | [
"MIT"
] | null | null | null | cpp/SynchrO/SynchrO.cpp | kfsone/tinker | 81ed372117bcad691176aac960302f497adf8d82 | [
"MIT"
] | null | null | null | cpp/SynchrO/SynchrO.cpp | kfsone/tinker | 81ed372117bcad691176aac960302f497adf8d82 | [
"MIT"
] | null | null | null | // SynchrO.cpp : Defines the entry point for the application.
//
#include "SynchrO.h"
#include <array>
#include <atomic>
#include <condition_variable>
#include <limits>
#include <memory>
#include <mutex>
#include <vector>
// Flow:
// - Server launches:
// - recursive directory walk discovers files,
// - each file mm... | 21.659193 | 90 | 0.665217 | [
"vector"
] |
650b237ba164752732ffeb418a0c88c52e095cc6 | 16,032 | cpp | C++ | ext/Objects/dictobject.cpp | creativemindplus/skybison | d1740e08d8de85a0a56b650675717da67de171a0 | [
"CNRI-Python-GPL-Compatible"
] | 278 | 2021-08-31T00:46:51.000Z | 2022-02-13T19:43:28.000Z | ext/Objects/dictobject.cpp | creativemindplus/skybison | d1740e08d8de85a0a56b650675717da67de171a0 | [
"CNRI-Python-GPL-Compatible"
] | 9 | 2021-11-05T22:28:43.000Z | 2021-11-23T08:39:04.000Z | ext/Objects/dictobject.cpp | tekknolagi/skybison | bea8fc2af0a70e7203b4c19f36c14a745512a335 | [
"CNRI-Python-GPL-Compatible"
] | 12 | 2021-08-31T07:49:54.000Z | 2021-10-08T01:09:01.000Z | // Copyright (c) Facebook, Inc. and its affiliates. (http://www.facebook.com)
// dictobject.c implementation
#include "cpython-func.h"
#include "api-handle.h"
#include "dict-builtins.h"
#include "handles.h"
#include "int-builtins.h"
#include "object-builtins.h"
#include "objects.h"
#include "runtime.h"
#include "str-... | 35.004367 | 80 | 0.698291 | [
"object"
] |
650bc57baf54015bc0a965d92a49813ed3a609d0 | 6,267 | cpp | C++ | toolboxes/mri/pmri/gpu/cuBuffer.cpp | roopchansinghv/gadgetron | fb6c56b643911152c27834a754a7b6ee2dd912da | [
"MIT"
] | 1 | 2022-02-22T21:06:36.000Z | 2022-02-22T21:06:36.000Z | toolboxes/mri/pmri/gpu/cuBuffer.cpp | apd47/gadgetron | 073e84dabe77d2dae3b3dd9aa4bf9edbf1f890f2 | [
"MIT"
] | null | null | null | toolboxes/mri/pmri/gpu/cuBuffer.cpp | apd47/gadgetron | 073e84dabe77d2dae3b3dd9aa4bf9edbf1f890f2 | [
"MIT"
] | null | null | null | #include "cuBuffer.h"
#include "vector_td_utilities.h"
#include "cuNDArray_operators.h"
#include "cuNDArray_elemwise.h"
#include "cuNDArray_utils.h"
namespace Gadgetron{
template<class REAL, unsigned int D>
cuBuffer<REAL,D>::cuBuffer()
{
acc_buffer_ = boost::shared_ptr< cuNDArray<_complext> >(new cuNDArray<... | 31.335 | 139 | 0.673528 | [
"vector"
] |
6511c1f6e1fda1a5e897b01f5618e1ab15c7c664 | 5,341 | hpp | C++ | examples/mantevo/miniFE-1.1/optional/stk_mesh/base/DataTraitsEnum.hpp | sdressler/objekt | 30ee938f5cb06193871f802be0bbdae6ecd26a33 | [
"BSD-3-Clause"
] | 1 | 2019-11-26T22:24:12.000Z | 2019-11-26T22:24:12.000Z | examples/mantevo/miniFE-1.1/optional/stk_mesh/base/DataTraitsEnum.hpp | sdressler/objekt | 30ee938f5cb06193871f802be0bbdae6ecd26a33 | [
"BSD-3-Clause"
] | null | null | null | examples/mantevo/miniFE-1.1/optional/stk_mesh/base/DataTraitsEnum.hpp | sdressler/objekt | 30ee938f5cb06193871f802be0bbdae6ecd26a33 | [
"BSD-3-Clause"
] | null | null | null | /*------------------------------------------------------------------------*/
/* Copyright 2010 Sandia Corporation. */
/* Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive */
/* license for use of this work by or on behalf of the U.S. Government. */
/* Export o... | 30.005618 | 76 | 0.478937 | [
"mesh",
"vector"
] |
6517940f7e332086ab5a5bbce9ca8d6943987a82 | 2,657 | cpp | C++ | codeforces/practice/EDU2_76F.cpp | Shahraaz/CP_S5 | 2cfb5467841d660c1e47cb8338ea692f10ca6e60 | [
"MIT"
] | 3 | 2020-02-08T10:34:16.000Z | 2020-02-09T10:23:19.000Z | codeforces/practice/EDU2_76F.cpp | Shahraaz/CP_S5 | 2cfb5467841d660c1e47cb8338ea692f10ca6e60 | [
"MIT"
] | null | null | null | codeforces/practice/EDU2_76F.cpp | Shahraaz/CP_S5 | 2cfb5467841d660c1e47cb8338ea692f10ca6e60 | [
"MIT"
] | 2 | 2020-10-02T19:05:32.000Z | 2021-09-08T07:01:49.000Z | // Optimise
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/home/shahraaz/bin/debug.h"
#else
#define db(...)
#endif
using ll = long long;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(), v.end()
const int AUX = 5e6 + 5, MOD = 1000000007;
const int NAX = 100, K = 1... | 19.536765 | 131 | 0.424915 | [
"vector"
] |
651ab2757d4f7bec541fbb516693b3add92116b4 | 1,583 | cpp | C++ | Algorithms/0883.ProjectionAreaOf3DShapes/solution.cpp | stdstring/leetcode | 84e6bade7d6fc1a737eb6796cb4e2565440db5e3 | [
"MIT"
] | null | null | null | Algorithms/0883.ProjectionAreaOf3DShapes/solution.cpp | stdstring/leetcode | 84e6bade7d6fc1a737eb6796cb4e2565440db5e3 | [
"MIT"
] | null | null | null | Algorithms/0883.ProjectionAreaOf3DShapes/solution.cpp | stdstring/leetcode | 84e6bade7d6fc1a737eb6796cb4e2565440db5e3 | [
"MIT"
] | null | null | null | #include <algorithm>
#include <vector>
#include "gtest/gtest.h"
namespace
{
class Solution
{
public:
int projectionArea(std::vector<std::vector<int>> const &grid) const
{
const size_t rowCount = grid.size();
const size_t columnCount = grid.front().size();
int xyProjection = 0;
... | 27.77193 | 86 | 0.55338 | [
"vector"
] |
fb974793bebeaded3ea73765fe458c4e39f95df0 | 4,505 | cpp | C++ | Outils/lata2dx/lata2dx/commun_triou/Lata_tools.cpp | cea-trust-platform/trust-code | c4f42d8f8602a8cc5e0ead0e29dbf0be8ac52f72 | [
"BSD-3-Clause"
] | 12 | 2021-06-30T18:50:38.000Z | 2022-03-23T09:03:16.000Z | Outils/lata2dx/lata2dx/commun_triou/Lata_tools.cpp | pledac/trust-code | 46ab5c5da3f674185f53423090f526a38ecdbad1 | [
"BSD-3-Clause"
] | null | null | null | Outils/lata2dx/lata2dx/commun_triou/Lata_tools.cpp | pledac/trust-code | 46ab5c5da3f674185f53423090f526a38ecdbad1 | [
"BSD-3-Clause"
] | 2 | 2021-10-04T09:19:39.000Z | 2021-12-15T14:21:04.000Z | /*****************************************************************************
*
* Copyright (c) 2011 - 2013, CEA
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source ... | 34.922481 | 94 | 0.683907 | [
"object"
] |
fba2ce3f340e1d71f92b71d020b7dfc3c2e21c4a | 1,001 | cpp | C++ | test/source/postalt.cpp | tigeroses/bwa-postalt | 74bc52e931a03395708c5038394055a29f1babbf | [
"Unlicense"
] | 2 | 2020-10-21T08:24:48.000Z | 2022-01-17T10:04:44.000Z | test/source/postalt.cpp | tigeroses/bwa-postalt | 74bc52e931a03395708c5038394055a29f1babbf | [
"Unlicense"
] | null | null | null | test/source/postalt.cpp | tigeroses/bwa-postalt | 74bc52e931a03395708c5038394055a29f1babbf | [
"Unlicense"
] | null | null | null |
#include <doctest/doctest.h>
#include <postalt/postalt.h>
#include <postalt/version.h>
#include <string>
#include <vector>
TEST_CASE("Postalt") {
using namespace postalt;
Postalt postalt("Tests");
std::vector<std::string> l;
l.push_back("F221 99 chr11 105017764 0 100M = 105018042 378 TAGCAAGGCAGGCCAACATTCAG... | 47.666667 | 310 | 0.805195 | [
"vector"
] |
fba3fa5adaf91bf2738dbd70c3605016a786bc25 | 676 | cpp | C++ | Cplus/StrangePrinter.cpp | JumHorn/leetcode | 1447237ae8fc3920b19f60b30c71a84b088cc200 | [
"MIT"
] | 1 | 2018-01-22T12:06:28.000Z | 2018-01-22T12:06:28.000Z | Cplus/StrangePrinter.cpp | JumHorn/leetcode | 1447237ae8fc3920b19f60b30c71a84b088cc200 | [
"MIT"
] | null | null | null | Cplus/StrangePrinter.cpp | JumHorn/leetcode | 1447237ae8fc3920b19f60b30c71a84b088cc200 | [
"MIT"
] | null | null | null | #include <algorithm>
#include <string>
#include <vector>
using namespace std;
class Solution
{
public:
int strangePrinter(string s)
{
if (s.empty())
return 0;
int N = s.length();
vector<vector<int>> dp(N, vector<int>(N, -1));
return memdp(s, 0, N - 1, dp);
}
int memdp(const string &s, int first, int la... | 21.125 | 75 | 0.572485 | [
"vector"
] |
fba6e10e4c65d89f017d2aa919850dfb3a176372 | 16,390 | cpp | C++ | tests/TestFilesystemFunc.cpp | end2endzone/msbuildreorder | 9df4df177092e2ad141692ec7b43eb814b806d9b | [
"MIT"
] | 9 | 2018-12-18T11:56:26.000Z | 2022-01-17T07:51:10.000Z | tests/TestFilesystemFunc.cpp | end2endzone/msbuildreorder | 9df4df177092e2ad141692ec7b43eb814b806d9b | [
"MIT"
] | 15 | 2018-02-09T21:37:10.000Z | 2019-07-20T19:31:41.000Z | tests/TestFilesystemFunc.cpp | end2endzone/msbuildreorder | 9df4df177092e2ad141692ec7b43eb814b806d9b | [
"MIT"
] | 3 | 2018-12-18T11:56:29.000Z | 2022-03-07T09:26:25.000Z | #include "TestFilesystemFunc.h"
#include "filesystemfunc.h"
#include "nativefunc.h"
#include "gtesthelper.h"
using namespace filesystem;
namespace filesystem { namespace test
{
bool createDummyFile(const char * iPath)
{
FILE * f = fopen(iPath, "w");
if (f == NULL)
return false;
fputs("FOO!\n", f... | 32.137255 | 103 | 0.565101 | [
"vector"
] |
fba8210a925f4df745b57117df30631ac3a38867 | 499 | cpp | C++ | Chapter 22/Definition of class DeckOfCards that represents a deck of playing cards/Definition of class DeckOfCards that represents a deck of playing cards/main.cpp | MarvelousAudio/CPlusPlus-How-to-program-tenth-edition | a667b080938cf964909d79b272f0d863adc300e0 | [
"MIT"
] | null | null | null | Chapter 22/Definition of class DeckOfCards that represents a deck of playing cards/Definition of class DeckOfCards that represents a deck of playing cards/main.cpp | MarvelousAudio/CPlusPlus-How-to-program-tenth-edition | a667b080938cf964909d79b272f0d863adc300e0 | [
"MIT"
] | null | null | null | Chapter 22/Definition of class DeckOfCards that represents a deck of playing cards/Definition of class DeckOfCards that represents a deck of playing cards/main.cpp | MarvelousAudio/CPlusPlus-How-to-program-tenth-edition | a667b080938cf964909d79b272f0d863adc300e0 | [
"MIT"
] | null | null | null | //
// main.cpp
// Definition of class DeckOfCards that represents a deck of playing cards
//
// Created by ben haywood on 5/3/20.
// Copyright © 2020 ben haywood. All rights reserved.
//
#include <iostream>
#include "DeckOfCards.hpp"
int main(int argc, const char * argv[]) {
// insert code here...
DeckO... | 23.761905 | 75 | 0.681363 | [
"object"
] |
fbaa2969ddfe0ec896b61cfc1b07224a87275e20 | 4,935 | hpp | C++ | src/vk-renderer/vk-renderer-common.hpp | itsermo/vk-renderer | bdc1738d2b644e163356982a84dadc164d79ef53 | [
"BSD-3-Clause"
] | 1 | 2019-06-04T10:31:18.000Z | 2019-06-04T10:31:18.000Z | src/vk-renderer/vk-renderer-common.hpp | itsermo/vk-renderer | bdc1738d2b644e163356982a84dadc164d79ef53 | [
"BSD-3-Clause"
] | null | null | null | src/vk-renderer/vk-renderer-common.hpp | itsermo/vk-renderer | bdc1738d2b644e163356982a84dadc164d79ef53 | [
"BSD-3-Clause"
] | null | null | null | #pragma once
#ifndef VK_RENDERER_COMMON
#define VK_RENDERER_COMMON
#include <linalg.h>
#include <vector>
#include <string>
using namespace linalg::aliases;
namespace vk_renderer
{
const float DEG_TO_RAD = 0.017453292519943295769236907684886f;
struct vertex
{
float3 pos;
float3 color;
float2 tex_coord;
bo... | 37.105263 | 176 | 0.704559 | [
"vector",
"model",
"transform",
"3d"
] |
fbafb5dfbdf8b0ff552725a7009bf8fc4c5ca478 | 3,419 | cpp | C++ | src/backend/zoo/crop_nd.cpp | ViewFaceCore/TenniS | c1d21a71c1cd025ddbbe29924c8b3296b3520fc0 | [
"BSD-2-Clause"
] | null | null | null | src/backend/zoo/crop_nd.cpp | ViewFaceCore/TenniS | c1d21a71c1cd025ddbbe29924c8b3296b3520fc0 | [
"BSD-2-Clause"
] | null | null | null | src/backend/zoo/crop_nd.cpp | ViewFaceCore/TenniS | c1d21a71c1cd025ddbbe29924c8b3296b3520fc0 | [
"BSD-2-Clause"
] | null | null | null | //
// Created by kier on 2019/4/9.
//
#include "backend/zoo/crop_nd.h"
#include "backend/name.h"
#include "core/tensor_builder.h"
#include "utils/assert.h"
#include "global/operator_factory.h"
#include "utils/ctxmgr_lite.h"
#include "core/device_context.h"
#include "runtime/stack.h"
#include <array>
namespace ts {... | 29.730435 | 107 | 0.48172 | [
"shape",
"vector"
] |
fbb0b7c43f8c960c5bd2c491b4f551467b3addf5 | 29,815 | cc | C++ | src/GaIA/pkgs/nmap/nmap-6.40/nse_nmaplib.cc | uninth/UNItools | c8b1fbfd5d3753b5b14fa19033e39737dedefc00 | [
"BSD-3-Clause"
] | null | null | null | src/GaIA/pkgs/nmap/nmap-6.40/nse_nmaplib.cc | uninth/UNItools | c8b1fbfd5d3753b5b14fa19033e39737dedefc00 | [
"BSD-3-Clause"
] | null | null | null | src/GaIA/pkgs/nmap/nmap-6.40/nse_nmaplib.cc | uninth/UNItools | c8b1fbfd5d3753b5b14fa19033e39737dedefc00 | [
"BSD-3-Clause"
] | 1 | 2021-06-08T15:59:26.000Z | 2021-06-08T15:59:26.000Z |
extern "C" {
#include "lua.h"
#include "lauxlib.h"
#include "lualib.h"
}
#include <math.h>
#include "nmap.h"
#include "nmap_error.h"
#include "NmapOps.h"
#include "Target.h"
#include "TargetGroup.h"
#include "portlist.h"
#include "service_scan.h"
#include "nmap_dns.h"
#include "osscan.h"
#include "protocols.h"... | 30.579487 | 95 | 0.649371 | [
"object",
"vector"
] |
fbbd36263a26314755ac5cc8cf4a67e7be9cba92 | 2,826 | hpp | C++ | src/master/state.hpp | benh/twesos | 194e1976d474005d807f37e7204ea08766e4b42a | [
"BSD-3-Clause"
] | 1 | 2019-02-17T15:56:26.000Z | 2019-02-17T15:56:26.000Z | src/master/state.hpp | benh/twesos | 194e1976d474005d807f37e7204ea08766e4b42a | [
"BSD-3-Clause"
] | null | null | null | src/master/state.hpp | benh/twesos | 194e1976d474005d807f37e7204ea08766e4b42a | [
"BSD-3-Clause"
] | 3 | 2017-07-10T07:28:30.000Z | 2020-07-25T19:48:07.000Z | #ifndef MASTER_STATE_HPP
#define MASTER_STATE_HPP
#include <iostream>
#include <string>
#include <vector>
#include <mesos_types.hpp>
#include "common/foreach.hpp"
#include "config/config.hpp"
namespace mesos { namespace internal { namespace master { namespace state {
struct SlaveResources
{
SlaveID slave_id;... | 20.042553 | 81 | 0.675513 | [
"vector"
] |
fbc51fbbfae3d0fc9c03494d609d5d3dfe3fc82b | 2,074 | hpp | C++ | IntrusivePtr.hpp | amikey/music-player-core | d124f8b43362648501d157a67d203d5f4ef008ad | [
"BSD-2-Clause"
] | 56 | 2015-04-21T05:35:38.000Z | 2021-02-16T13:42:45.000Z | IntrusivePtr.hpp | n-peugnet/music-player-core | d124f8b43362648501d157a67d203d5f4ef008ad | [
"BSD-2-Clause"
] | 13 | 2015-05-09T17:36:27.000Z | 2020-02-13T17:44:59.000Z | IntrusivePtr.hpp | n-peugnet/music-player-core | d124f8b43362648501d157a67d203d5f4ef008ad | [
"BSD-2-Clause"
] | 27 | 2015-06-15T14:54:58.000Z | 2021-07-22T09:59:40.000Z | #ifndef MP_INTRUSIVEPTR_HPP
#define MP_INTRUSIVEPTR_HPP
#include <atomic>
// boost::intrusive_ptr but safe/atomic.
// I.e. pointer to an object with an embedded reference count.
// intrusive_ptr_add_ref(T*) and intrusive_ptr_release(T*) must be declared.
// You can also derive from boost::intrusive_ref_counter.
temp... | 22.543478 | 78 | 0.686114 | [
"object"
] |
fbcb065d426ab89e3e4d7ebc87ea5f8b020c5ff7 | 16,914 | hpp | C++ | include/dynamix/message_macros.hpp | area55git/dynamix | c800209c6f467c19065235e87cbfe60171e75d68 | [
"MIT"
] | null | null | null | include/dynamix/message_macros.hpp | area55git/dynamix | c800209c6f467c19065235e87cbfe60171e75d68 | [
"MIT"
] | null | null | null | include/dynamix/message_macros.hpp | area55git/dynamix | c800209c6f467c19065235e87cbfe60171e75d68 | [
"MIT"
] | null | null | null | // DynaMix
// Copyright (c) 2013-2018 Borislav Stanimirov, Zahary Karadjov
//
// Distributed under the MIT Software License
// See accompanying file LICENSE.txt or copy at
// https://opensource.org/licenses/MIT
//
#pragma once
/**
* \file
* Macros used to declare and define messages.
*/
#include "message.hpp"
#i... | 42.928934 | 137 | 0.731938 | [
"object"
] |
fbcbd1fc62ef8dacf6ea207dba5789690d4e54bb | 2,274 | cpp | C++ | CLRS/BitManipulation/Subsets.cpp | ComputerProgrammerStorager/DataStructureAlgorithm | 508f7e37898c907ea7ea6ec40749621a2349e93f | [
"MIT"
] | null | null | null | CLRS/BitManipulation/Subsets.cpp | ComputerProgrammerStorager/DataStructureAlgorithm | 508f7e37898c907ea7ea6ec40749621a2349e93f | [
"MIT"
] | null | null | null | CLRS/BitManipulation/Subsets.cpp | ComputerProgrammerStorager/DataStructureAlgorithm | 508f7e37898c907ea7ea6ec40749621a2349e93f | [
"MIT"
] | null | null | null | /*
Given an integer array nums of unique elements, return all possible subsets (the power set).
The solution set must not contain duplicate subsets. Return the solution in any order.
Example 1:
Input: nums = [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
Example 2:
Input: nums = [0]
Output: [[],[0]]
... | 24.989011 | 137 | 0.529903 | [
"vector"
] |
fbcbd62ee377e3c045b59e02018e87da49699e5e | 5,260 | cpp | C++ | plugins/committee_api/committee_api.cpp | VIZ-World/viz-core | 634825fcfff9e392a26789f8e23c4cfab2952b71 | [
"MIT"
] | 7 | 2018-03-21T12:56:32.000Z | 2018-04-02T16:06:24.000Z | plugins/committee_api/committee_api.cpp | VIZ-World/viz-core | 634825fcfff9e392a26789f8e23c4cfab2952b71 | [
"MIT"
] | 18 | 2018-03-21T13:29:46.000Z | 2018-05-18T10:56:43.000Z | plugins/committee_api/committee_api.cpp | VIZ-World/VIZ.Core | 634825fcfff9e392a26789f8e23c4cfab2952b71 | [
"MIT"
] | 9 | 2018-10-17T19:02:40.000Z | 2019-02-14T10:35:00.000Z | #include <boost/program_options/options_description.hpp>
#include <graphene/plugins/committee_api/committee_api.hpp>
#include <graphene/chain/index.hpp>
#include <graphene/chain/chain_objects.hpp>
#include <graphene/chain/committee_objects.hpp>
#include <graphene/api/committee_api_object.hpp>
#define CHECK_ARG_SIZE(_S... | 37.042254 | 107 | 0.553042 | [
"vector"
] |
fbcf2e83bf3b202f27cd6da28a1073e6eaf8a0a2 | 2,789 | cc | C++ | voro++/examples/no_release/lloyd_box.cc | lsmo-epfl/zeoplusplus | b8acd8d08d7256aecdbb92454250760314a00b06 | [
"BSD-3-Clause-LBNL"
] | 2 | 2019-11-14T02:27:33.000Z | 2020-05-05T23:17:47.000Z | voro++/examples/no_release/lloyd_box.cc | lsmo-epfl/zeoplusplus | b8acd8d08d7256aecdbb92454250760314a00b06 | [
"BSD-3-Clause-LBNL"
] | 4 | 2018-10-17T08:20:58.000Z | 2020-12-19T03:28:01.000Z | voro++/examples/no_release/lloyd_box.cc | lsmo-epfl/zeopp-lsmo | b8acd8d08d7256aecdbb92454250760314a00b06 | [
"BSD-3-Clause-LBNL"
] | 3 | 2019-03-04T11:25:44.000Z | 2019-05-29T16:37:12.000Z | // Voronoi calculation example code
//
// Author : Chris H. Rycroft (LBL / UC Berkeley)
// Email : chr@alum.mit.edu
// Date : August 30th 2011
#include "voro++.hh"
using namespace voro;
#include <vector>
using namespace std;
// Set up constants for the container geometry
const double boxl = 1;
// Set up th... | 28.459184 | 80 | 0.543564 | [
"mesh",
"geometry",
"vector"
] |
fbd608d13dd8beba3efb86c5502f89010511f8a3 | 2,989 | cc | C++ | examples/cmake/loopback.cc | bolderflight/easycan | 79b5dd0b180af7e187bf6d2e078be733ad891726 | [
"MIT"
] | null | null | null | examples/cmake/loopback.cc | bolderflight/easycan | 79b5dd0b180af7e187bf6d2e078be733ad891726 | [
"MIT"
] | null | null | null | examples/cmake/loopback.cc | bolderflight/easycan | 79b5dd0b180af7e187bf6d2e078be733ad891726 | [
"MIT"
] | null | null | null | /*
* Brian R Taylor
* brian.taylor@bolderflight.com
*
* Copyright (c) 2022 Bolder Flight Systems Inc
*
* 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 ... | 32.139785 | 79 | 0.688525 | [
"object"
] |
fbd876982475b73013a938c0b1812194bb7e11ee | 6,605 | cc | C++ | solution.cc | mkaminaga/satpass | fc6520dfdb22ffd72da23b2c2d1812df03b239b1 | [
"MIT"
] | null | null | null | solution.cc | mkaminaga/satpass | fc6520dfdb22ffd72da23b2c2d1812df03b239b1 | [
"MIT"
] | 5 | 2017-09-12T02:42:42.000Z | 2017-09-27T09:07:52.000Z | solution.cc | mkaminaga/satpass | fc6520dfdb22ffd72da23b2c2d1812df03b239b1 | [
"MIT"
] | null | null | null | // @file solution.cc
// @brief The functions to solve orbit parameters.
// @author Mamoru Kaminaga
// @date 2017-09-11 16:01:03
// Copyright 2017 Mamoru Kaminaga
#include <assert.h>
#include <wchar.h>
#include <sat/v1.0.2/data.h>
#include <sat/v1.0.2/sat.h>
#include <sat/v1.0.2/util.h>
#include <tle/v2.1.0/tl... | 35.320856 | 78 | 0.560939 | [
"vector"
] |
fbd9b481946e2a07f34c5289c1dc0db6879e32f9 | 2,729 | cpp | C++ | cpp/tests/src/test_ste_global.cpp | tomerten/steibs | 8d4e994020dd17475ba1371e9c6f365c916828a0 | [
"MIT"
] | null | null | null | cpp/tests/src/test_ste_global.cpp | tomerten/steibs | 8d4e994020dd17475ba1371e9c6f365c916828a0 | [
"MIT"
] | null | null | null | cpp/tests/src/test_ste_global.cpp | tomerten/steibs | 8d4e994020dd17475ba1371e9c6f365c916828a0 | [
"MIT"
] | null | null | null | #include <ibs>
#include <iomanip>
#include <iostream>
#include <ste>
// for testing
template <typename T>
bool RequireVectorEquals(const std::vector<T> &a, const std::vector<T> &b,
T max_error = 0.000000001) {
const auto first_mismatch = std::mismatch(
a.begin(), a.end(), b.begin(), [m... | 31.011364 | 79 | 0.618908 | [
"vector"
] |
fbe1bab162f8711fb646b120e791bb4bd7c74d39 | 1,158 | cpp | C++ | TopicWiseQuestions/DP/Cses/CoinSChange1/main.cpp | jeevanpuchakay/a2oj | f867e9b2ced6619be3ca6b1a1a1838107322782d | [
"MIT"
] | null | null | null | TopicWiseQuestions/DP/Cses/CoinSChange1/main.cpp | jeevanpuchakay/a2oj | f867e9b2ced6619be3ca6b1a1a1838107322782d | [
"MIT"
] | null | null | null | TopicWiseQuestions/DP/Cses/CoinSChange1/main.cpp | jeevanpuchakay/a2oj | f867e9b2ced6619be3ca6b1a1a1838107322782d | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
#define endl "\n"
vector<vector<ll>> adjlist;
ll max(ll x, ll y) { return (x > y) ? x : y; }
ll min(ll x, ll y) { return (x > y) ? y : x; }
#define mod 1000000007
ll cases = 1, n, sum, m;
ll x, y;
// ll getNoOfWays(ll sum, ... | 23.632653 | 114 | 0.48791 | [
"vector"
] |
fbe3400e6f86d47a1b17de883bbbb7c0a3d29fe4 | 1,505 | cpp | C++ | p1025.cpp | ThinkiNOriginal/PTA-Advanced | 55cae28f76102964d0f6fd728dd62d6eba980c49 | [
"MIT"
] | null | null | null | p1025.cpp | ThinkiNOriginal/PTA-Advanced | 55cae28f76102964d0f6fd728dd62d6eba980c49 | [
"MIT"
] | null | null | null | p1025.cpp | ThinkiNOriginal/PTA-Advanced | 55cae28f76102964d0f6fd728dd62d6eba980c49 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
struct Student {
char rn[13];
int grades;
int final_r;
int local_r;
int ln;
};
bool cmp (const Student& s1, const Student& s2) {
if (s1.grades != s2.grades)
return s1.grades > s2.grades;
else
return std::strcmp(s1.rn, s2.rn... | 18.8125 | 60 | 0.548173 | [
"vector"
] |
fbec473de82285f65178b24d1fa7d5fe723728de | 5,387 | hpp | C++ | modules/cvv/src/qtutil/registerhelper.hpp | Nondzu/opencv_contrib | 0b0616a25d4239ee81fda965818b49b721620f56 | [
"BSD-3-Clause"
] | 7,158 | 2016-07-04T22:19:27.000Z | 2022-03-31T07:54:32.000Z | modules/cvv/src/qtutil/registerhelper.hpp | Nondzu/opencv_contrib | 0b0616a25d4239ee81fda965818b49b721620f56 | [
"BSD-3-Clause"
] | 2,184 | 2016-07-05T12:04:14.000Z | 2022-03-30T19:10:12.000Z | modules/cvv/src/qtutil/registerhelper.hpp | Nondzu/opencv_contrib | 0b0616a25d4239ee81fda965818b49b721620f56 | [
"BSD-3-Clause"
] | 5,535 | 2016-07-06T12:01:10.000Z | 2022-03-31T03:13:24.000Z | #ifndef CVVISUAL_REGISTERHELPER_HPP
#define CVVISUAL_REGISTERHELPER_HPP
// std
#include <map>
#include <vector>
#include <stdexcept>
#include <memory>
#include <functional>
// QT
#include <QWidget>
#include <QString>
#include <QComboBox>
#include <QVBoxLayout>
// cvv
#include "signalslot.hpp"
namespace cvv
{
namespace... | 24.049107 | 77 | 0.685911 | [
"vector"
] |
fbf9c78408954d76de5a519dc50c81594a552365 | 1,279 | hpp | C++ | include/notima/internal/stats.hpp | drtconway/notima | fb542096b435bdc3246192fd7e4ba86080952afd | [
"MIT"
] | null | null | null | include/notima/internal/stats.hpp | drtconway/notima | fb542096b435bdc3246192fd7e4ba86080952afd | [
"MIT"
] | null | null | null | include/notima/internal/stats.hpp | drtconway/notima | fb542096b435bdc3246192fd7e4ba86080952afd | [
"MIT"
] | null | null | null | #ifndef NOTIMA_INTERNAL_STATS_HPP
#define NOTIMA_INTERNAL_STATS_HPP
#include <nlohmann/json.hpp>
namespace notima
{
namespace internal
{
template <typename T, typename U = void>
struct gather
{
nlohmann::json operator()(const T& p_ob) const
{
std... | 26.102041 | 98 | 0.503518 | [
"vector"
] |
81fc2a2d2ca1a111d02418375797301e26404b20 | 20,696 | cpp | C++ | src/btree.cpp | celinao/Btree | f090f404a3dcd9b9b3204611c12965c479e8ac7e | [
"Apache-2.0"
] | null | null | null | src/btree.cpp | celinao/Btree | f090f404a3dcd9b9b3204611c12965c479e8ac7e | [
"Apache-2.0"
] | null | null | null | src/btree.cpp | celinao/Btree | f090f404a3dcd9b9b3204611c12965c479e8ac7e | [
"Apache-2.0"
] | null | null | null | /**
* Group 24:
* Celina Ough 9074747438
* Atharva Kudkilwar 9081348659
*
* @author See Contributors.txt for code contributors and overview of BadgerDB.
*
* @section LICENSE
* Copyright (c) 2012 Database Group, Computer Sciences Department, University of Wisconsin-Madison.
*/
#include "btree.h"
#include "f... | 27.484728 | 127 | 0.636741 | [
"object"
] |
c30597b931414bc17a586971af46e2308e2587cd | 4,918 | cpp | C++ | VGP332/01_HelloPathFindingApp/GameState.cpp | amyrhzhao/CooEngine | 8d467cc53fd8fe3806d726cfe4d7482ad0aca06a | [
"MIT"
] | 3 | 2020-07-23T02:50:11.000Z | 2020-10-20T14:49:40.000Z | VGP332/01_HelloPathFindingApp/GameState.cpp | amyrhzhao/CooEngine | 8d467cc53fd8fe3806d726cfe4d7482ad0aca06a | [
"MIT"
] | null | null | null | VGP332/01_HelloPathFindingApp/GameState.cpp | amyrhzhao/CooEngine | 8d467cc53fd8fe3806d726cfe4d7482ad0aca06a | [
"MIT"
] | null | null | null | #include "GameState.h"
TileMap map;
struct GetGCost
{
float operator()(AI::GraphSearch::Context context, size_t parentIndex, size_t nodeIndex)
{
if (parentIndex == InvalidNode)
{
return 0.0f;
}
int columns = map.GetColumns();
size_t parentColumn = parentIndex % columns;
size_t parentRow =... | 24.107843 | 139 | 0.649858 | [
"render"
] |
c30aa8bfe49e38189dce97aaeb04c4f512cdc538 | 3,758 | cpp | C++ | src/UnitTests/WOSTest2.cpp | fsaintjacques/cstore | 3300a81c359c4a48e13ad397e3eb09384f57ccd7 | [
"BSD-2-Clause"
] | 14 | 2016-07-11T04:08:09.000Z | 2022-03-11T05:56:59.000Z | src/UnitTests/WOSTest2.cpp | ibrarahmad/cstore | 3300a81c359c4a48e13ad397e3eb09384f57ccd7 | [
"BSD-2-Clause"
] | null | null | null | src/UnitTests/WOSTest2.cpp | ibrarahmad/cstore | 3300a81c359c4a48e13ad397e3eb09384f57ccd7 | [
"BSD-2-Clause"
] | 13 | 2016-06-01T10:41:15.000Z | 2022-01-06T09:01:15.000Z | /* Copyright (c) 2005, Regents of Massachusetts Institute of Technology,
* Brandeis University, Brown University, and University of Massachusetts
* Boston. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following condit... | 38.742268 | 90 | 0.675625 | [
"vector"
] |
c30e8b4f84145527781698f2daae0a05d75ded45 | 1,514 | cpp | C++ | LeetCode/Problems/Algorithms/#698_PartitionToKEqualSumSubsets_sol5_memoization_with_vector_O(N2^N)_time_O(2^N)_extra_space_4ms_15MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | 1 | 2022-01-26T14:50:07.000Z | 2022-01-26T14:50:07.000Z | LeetCode/Problems/Algorithms/#698_PartitionToKEqualSumSubsets_sol5_memoization_with_vector_O(N2^N)_time_O(2^N)_extra_space_4ms_15MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | LeetCode/Problems/Algorithms/#698_PartitionToKEqualSumSubsets_sol5_memoization_with_vector_O(N2^N)_time_O(2^N)_extra_space_4ms_15MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | class Solution {
private:
bool solve(int k, int mask, int sum, const int& PARTITION_SUM, vector<int>& nums, vector<int>& memo){
if(memo[mask] != -1){
return memo[mask];
}
if(k == 1){
memo[mask] = true;
return true;
}
for(int b... | 35.209302 | 106 | 0.47424 | [
"vector"
] |
c31278f2b1c0d3cd98303eb65742f60f3201e60c | 3,752 | cc | C++ | topcoder/671/BearDarts.cc | metaflow/contests | 5e9ffcb72c3e7da54b5e0818b1afa59f5778ffa2 | [
"MIT"
] | 1 | 2019-05-12T23:41:00.000Z | 2019-05-12T23:41:00.000Z | topcoder/671/BearDarts.cc | metaflow/contests | 5e9ffcb72c3e7da54b5e0818b1afa59f5778ffa2 | [
"MIT"
] | null | null | null | topcoder/671/BearDarts.cc | metaflow/contests | 5e9ffcb72c3e7da54b5e0818b1afa59f5778ffa2 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
using vi = vector<int>; using vvi = vector<vi>;
using ii = pair<int,int>; using vii = vector<ii>;
using l = long long; using vl = vector<l>; using vvl = vector<vl>;
using lu = unsigned long long; using ll = pair<l, l>;
using vb = vector<bool>; using vvb = vector<vb>;
using ... | 48.102564 | 320 | 0.526386 | [
"vector"
] |
c315e34dd66afcd6b060ce9fccbbd23503ffdab1 | 574 | cc | C++ | src/openvslam/initialize/base.cc | bumplzz69/openvslam | 6d03050a0f04323adfdf3fcf3693b180abc4553f | [
"BSD-2-Clause",
"MIT"
] | 1 | 2021-06-10T02:16:52.000Z | 2021-06-10T02:16:52.000Z | src/openvslam/initialize/base.cc | PetWorm/openvslam | d746173867f6078007f246b4f1e681a317e6c377 | [
"BSD-2-Clause",
"MIT"
] | null | null | null | src/openvslam/initialize/base.cc | PetWorm/openvslam | d746173867f6078007f246b4f1e681a317e6c377 | [
"BSD-2-Clause",
"MIT"
] | 1 | 2019-10-24T08:42:22.000Z | 2019-10-24T08:42:22.000Z | #include "openvslam/initialize/base.h"
namespace openvslam {
namespace initialize {
base::base(const unsigned int max_num_iters)
: max_num_iters_(max_num_iters) {}
Mat33_t base::get_rotation_ref_to_cur() const {
return rot_ref_to_cur_;
}
Vec3_t base::get_translation_ref_to_cur() const {
return trans... | 21.259259 | 63 | 0.75784 | [
"vector"
] |
c3280971fed01b4bb997544b73fd3d0d05b52ecc | 8,437 | hpp | C++ | emulation/hel/include/joystick.hpp | HiceS/synthesis | 9dbc6812cd296a04c35d45854e821f76c5890b56 | [
"Apache-2.0"
] | 136 | 2016-07-11T23:31:33.000Z | 2022-03-29T21:14:23.000Z | emulation/hel/include/joystick.hpp | hartisticexpressions/synthesis | 8267cf4c85b5d4236fefeab404afeb6090677f17 | [
"Apache-2.0"
] | 370 | 2016-08-16T22:33:02.000Z | 2022-03-23T23:57:18.000Z | emulation/hel/include/joystick.hpp | hartisticexpressions/synthesis | 8267cf4c85b5d4236fefeab404afeb6090677f17 | [
"Apache-2.0"
] | 62 | 2016-07-28T17:54:17.000Z | 2021-07-15T13:15:59.000Z | #ifndef _JOYSTICK_HPP_
#define _JOYSTICK_HPP_
#include <cstdint>
#include <string>
#include "bounds_checked_array.hpp"
namespace hel{
/**
* \brief A data container for joystick data
* Holds data surrounding joystick inputs and outputs and a description
*/
struct Joystick{
/**
... | 25.722561 | 134 | 0.576864 | [
"object"
] |
c3339a4eeec06688ff1dccf3d384e14b9b10cb6a | 26,357 | cpp | C++ | llightscene.cpp | Calinou/godot-llightmap | 7815dfb84a6299a4775faf3b306492961c45ed8c | [
"MIT"
] | 49 | 2020-07-16T10:56:22.000Z | 2022-03-07T06:20:14.000Z | llightscene.cpp | Calinou/godot-llightmap | 7815dfb84a6299a4775faf3b306492961c45ed8c | [
"MIT"
] | 3 | 2020-08-01T22:38:52.000Z | 2022-03-08T20:58:13.000Z | llightscene.cpp | Calinou/godot-llightmap | 7815dfb84a6299a4775faf3b306492961c45ed8c | [
"MIT"
] | 3 | 2020-07-24T01:11:17.000Z | 2022-03-07T01:07:03.000Z | #include "llightscene.h"
#include "llightmapper_base.h"
#include "llighttests_simd.h"
#include "llighttypes.h"
#include "scene/3d/mesh_instance.h"
//#define LLIGHTSCENE_VERBOSE
//#define LLIGHTSCENE_TRACE_VERBOSE
using namespace LM;
bool LightScene::TestVoxelHits(const Ray &ray, const PackedRay &pray, const Voxel &v... | 25.490329 | 163 | 0.657283 | [
"mesh",
"object",
"vector",
"transform",
"3d"
] |
c33db6f004e2e1803c92ff179f337f35eb96c0ce | 5,704 | cpp | C++ | samples/snippets/cpp/VS_Snippets_Remoting/HttpWebRequest_BeginGetResponse/CPP/httpwebrequest_begingetresponse.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_Remoting/HttpWebRequest_BeginGetResponse/CPP/httpwebrequest_begingetresponse.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_Remoting/HttpWebRequest_BeginGetResponse/CPP/httpwebrequest_begingetresponse.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 |
// System::Net::HttpWebRequest::BeginGetResponse System::Net::HttpWebRequest::EndGetResponse
/**
* Snippet1, Snippet2, Snippet3 go together.
* This program shows how to use BeginGetResponse and EndGetResponse methods of the
* HttpWebRequest class.
* It uses an asynchronous approach to get the response for the... | 35.874214 | 183 | 0.632013 | [
"object"
] |
c34e636a6a3160dee82561be6c43cf3c583d1652 | 5,125 | cc | C++ | webkit/fileapi/file_system_origin_database_unittest.cc | gavinp/chromium | 681563ea0f892a051f4ef3d5e53438e0bb7d2261 | [
"BSD-3-Clause"
] | 1 | 2016-03-10T09:13:57.000Z | 2016-03-10T09:13:57.000Z | webkit/fileapi/file_system_origin_database_unittest.cc | gavinp/chromium | 681563ea0f892a051f4ef3d5e53438e0bb7d2261 | [
"BSD-3-Clause"
] | 1 | 2022-03-13T08:39:05.000Z | 2022-03-13T08:39:05.000Z | webkit/fileapi/file_system_origin_database_unittest.cc | gavinp/chromium | 681563ea0f892a051f4ef3d5e53438e0bb7d2261 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) 2011 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 "testing/gtest/include/gtest/gtest.h"
#include <string>
#include "base/file_util.h"
#include "base/scoped_temp_dir.h"
#include "webkit/file... | 30.688623 | 73 | 0.758634 | [
"vector"
] |
c35575be0ad7fc4af41cb32eb703aa6add84988a | 3,938 | cpp | C++ | RollerCoaster/Roller Coaster/Src/Triangle.cpp | Zhang-Yu-Bo/NTUST-108CG-Project03-RollerCoaster | 7800db3795abd6a960de8f50a7d02b8ae71e8c21 | [
"MIT"
] | null | null | null | RollerCoaster/Roller Coaster/Src/Triangle.cpp | Zhang-Yu-Bo/NTUST-108CG-Project03-RollerCoaster | 7800db3795abd6a960de8f50a7d02b8ae71e8c21 | [
"MIT"
] | null | null | null | RollerCoaster/Roller Coaster/Src/Triangle.cpp | Zhang-Yu-Bo/NTUST-108CG-Project03-RollerCoaster | 7800db3795abd6a960de8f50a7d02b8ae71e8c21 | [
"MIT"
] | null | null | null | #include "Triangle.h"
Triangle::Triangle()
{
}
void Triangle::DimensionTransformation(GLfloat source[],GLfloat target[][4])
{
//for uniform value, transfer 1 dimension to 2 dimension
int i = 0;
for(int j=0;j<4;j++)
for(int k=0;k<4;k++)
{
target[j][k] = source[i];
i++;
}
}
void Triangle::Paint(GLfloat* P... | 29.609023 | 126 | 0.729558 | [
"object"
] |
c364b5d7e8c8f5e4072d2571d455c9b6f4f5beb6 | 5,248 | cpp | C++ | VC2012Samples/Windows 8 samples/C++/Windows 8 app samples/Hilo C++ sample (Windows 8)/C++/Hilo/TileUpdateScheduler.cpp | alonmm/VCSamples | 6aff0b4902f5027164d593540fcaa6601a0407c3 | [
"MIT"
] | 300 | 2019-05-09T05:32:33.000Z | 2022-03-31T20:23:24.000Z | VC2012Samples/Windows 8 samples/C++/Windows 8 app samples/Hilo C++ sample (Windows 8)/C++/Hilo/TileUpdateScheduler.cpp | JaydenChou/VCSamples | 9e1d4475555b76a17a3568369867f1d7b6cc6126 | [
"MIT"
] | 9 | 2016-09-19T18:44:26.000Z | 2018-10-26T10:20:05.000Z | VC2012Samples/Windows 8 samples/C++/Windows 8 app samples/Hilo C++ sample (Windows 8)/C++/Hilo/TileUpdateScheduler.cpp | JaydenChou/VCSamples | 9e1d4475555b76a17a3568369867f1d7b6cc6126 | [
"MIT"
] | 633 | 2019-05-08T07:34:12.000Z | 2022-03-30T04:38:28.000Z | // THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
// PARTICULAR PURPOSE.
//
// Copyright (c) Microsoft Corporation. All rights reserved
#include "pch.h"
#include "T... | 41.322835 | 163 | 0.701791 | [
"vector"
] |
c3728705a36f2dab6eed7b237699cc592b1868cf | 7,211 | cpp | C++ | src/activeobject.cpp | EnnoSlunder/PositionBasedDynamics | bba2e1d67262454df425bd4910a173fed979a10f | [
"MIT"
] | null | null | null | src/activeobject.cpp | EnnoSlunder/PositionBasedDynamics | bba2e1d67262454df425bd4910a173fed979a10f | [
"MIT"
] | null | null | null | src/activeobject.cpp | EnnoSlunder/PositionBasedDynamics | bba2e1d67262454df425bd4910a173fed979a10f | [
"MIT"
] | 2 | 2019-08-06T10:24:58.000Z | 2021-06-03T17:11:40.000Z | #include "activeobject.h"
#include "sceneobject.h"
#include "GLWidget.h"
#include "Scene.h"
#include "dynamics/dynamicsWorld.h"
#include "dynamics/particle.h"
ActiveObject::ActiveObject()
{
}
ActiveObject::ActiveObject(GLWidget *_widget)
{
m_GLWidget = _widget;
}
void ActiveObject::notify(int _id)
{
}
void A... | 26.906716 | 108 | 0.578561 | [
"transform"
] |
c37aebd3c3a2fa769314aaedf18dffc1a5b73fc7 | 1,096 | cpp | C++ | src/JsonWrapper.cpp | ShixiongQi/HElib | 9973ccc68a292d5c52388eca40eac08ae11d0263 | [
"Apache-2.0"
] | 992 | 2019-04-07T01:05:10.000Z | 2022-03-30T22:42:36.000Z | src/JsonWrapper.cpp | maliasadi/HElib | 7b919ce4ff22a04f1fb394d875172b91ae2c4c11 | [
"Apache-2.0"
] | 180 | 2019-04-29T20:19:22.000Z | 2022-03-31T13:11:15.000Z | src/JsonWrapper.cpp | maliasadi/HElib | 7b919ce4ff22a04f1fb394d875172b91ae2c4c11 | [
"Apache-2.0"
] | 289 | 2019-04-08T15:22:21.000Z | 2022-03-28T21:27:52.000Z | #include <helib/JsonWrapper.h>
#include <helib/assertions.h>
#include <string>
#include "io.h"
#include <json.hpp>
using json = ::nlohmann::json;
namespace helib {
std::string JsonWrapper::pretty(long indent) const
{
try {
auto j = std::any_cast<json>(this->json_obj);
return j.dump(indent);
} catch (con... | 22.833333 | 80 | 0.648723 | [
"object"
] |
c384a195f8ce6b56039626f9e4634a2474d7b47f | 11,632 | cpp | C++ | ref/src/Chapter11/NEAT Sweepers/phenotype.cpp | kugao222/geneticAlgorithmInLua | 9bfd2a443f9492759027791a2b2b41b9467241b2 | [
"MIT"
] | null | null | null | ref/src/Chapter11/NEAT Sweepers/phenotype.cpp | kugao222/geneticAlgorithmInLua | 9bfd2a443f9492759027791a2b2b41b9467241b2 | [
"MIT"
] | null | null | null | ref/src/Chapter11/NEAT Sweepers/phenotype.cpp | kugao222/geneticAlgorithmInLua | 9bfd2a443f9492759027791a2b2b41b9467241b2 | [
"MIT"
] | null | null | null | #include "phenotype.h"
//------------------------------------Sigmoid function------------------------
//
//----------------------------------------------------------------------------
float Sigmoid(float netinput, float response)
{
return ( 1 / ( 1 + exp(-netinput / response)));
}
//-------------------------------... | 27.961538 | 95 | 0.567056 | [
"vector",
"solid"
] |
c38acdbb20e36692f8a999a7ece3a359b7397127 | 5,123 | cpp | C++ | vne/gamecontext.cpp | tuxzz/codebase | a7279a4b1e782811b12d4adc30f7381e7ed94b70 | [
"Unlicense"
] | null | null | null | vne/gamecontext.cpp | tuxzz/codebase | a7279a4b1e782811b12d4adc30f7381e7ed94b70 | [
"Unlicense"
] | null | null | null | vne/gamecontext.cpp | tuxzz/codebase | a7279a4b1e782811b12d4adc30f7381e7ed94b70 | [
"Unlicense"
] | null | null | null | #include "gamecontext.hpp"
#include "commandbase.hpp"
#include "corelib/ratiohub.hpp"
#include <QVariant>
GameContext::GameContext(QObject *parent) : QObject(parent)
{
m_commandTimerRatioHub = new RatioHub();
m_pc = 0;
m_running = false;
m_nextStep = false;
}
GameContext::~GameContext()
... | 27.395722 | 121 | 0.616436 | [
"object"
] |
c3a675c9ca62a638ee3bb209b1c021e0e2c13baa | 16,686 | cc | C++ | src/libemane/commonphyheader.cc | weston-nrl/emane | 763a703c62693fbbdeec6def3cd05de7fbf4e660 | [
"BSD-3-Clause"
] | 114 | 2015-04-10T18:29:45.000Z | 2022-03-24T20:22:35.000Z | src/libemane/commonphyheader.cc | weston-nrl/emane | 763a703c62693fbbdeec6def3cd05de7fbf4e660 | [
"BSD-3-Clause"
] | 184 | 2015-01-06T15:33:54.000Z | 2022-03-24T22:17:56.000Z | src/libemane/commonphyheader.cc | weston-nrl/emane | 763a703c62693fbbdeec6def3cd05de7fbf4e660 | [
"BSD-3-Clause"
] | 34 | 2015-04-15T14:13:18.000Z | 2022-03-16T11:05:30.000Z | /*
* Copyright (c) 2013,2016 - Adjacent Link LLC, Bridgewater, New Jersey
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyr... | 33.845842 | 142 | 0.607575 | [
"vector"
] |
c3a8d09ea02847cfb19a533dfd236b6f00ee7bf4 | 1,882 | cpp | C++ | C++/MakeYourOwnVector/MakeYourOwnVector/main.cpp | znickle24/ZanderProjects | 674d72d2cba888d0605d9bc8230ecee724ec09b1 | [
"MIT"
] | null | null | null | C++/MakeYourOwnVector/MakeYourOwnVector/main.cpp | znickle24/ZanderProjects | 674d72d2cba888d0605d9bc8230ecee724ec09b1 | [
"MIT"
] | null | null | null | C++/MakeYourOwnVector/MakeYourOwnVector/main.cpp | znickle24/ZanderProjects | 674d72d2cba888d0605d9bc8230ecee724ec09b1 | [
"MIT"
] | null | null | null | //
// main.cpp
// MakeYourOwnVector
//
// Created by Zander Nickle on 9/11/17.
// Copyright © 2017 Zander Nickle. All rights reserved.
//
#include <iostream>
#include "StructsAndFunctions.hpp"
using namespace std;
int main(int argc, const char * argv[]) {
// test 1 to make sure a vector is made and to make ... | 21.632184 | 101 | 0.55898 | [
"vector"
] |
ce82e2da5171fd4ca3db7c914c761d16c0245225 | 19,986 | cpp | C++ | homeworks/HW3Source/HW 3/main.cpp | anshuman1811/cs687-reinforcementlearning | cf30cc0ab2b0e515cd4b643fc55c60cc5f38a481 | [
"MIT"
] | null | null | null | homeworks/HW3Source/HW 3/main.cpp | anshuman1811/cs687-reinforcementlearning | cf30cc0ab2b0e515cd4b643fc55c60cc5f38a481 | [
"MIT"
] | null | null | null | homeworks/HW3Source/HW 3/main.cpp | anshuman1811/cs687-reinforcementlearning | cf30cc0ab2b0e515cd4b643fc55c60cc5f38a481 | [
"MIT"
] | null | null | null | /*
This file includes all of the code for HW3. The lines that you must fill in are in one location, labeled
with "// TODO".
If you are new to C++, please follow some online tutorials to get a feel for C++. Don't worry about "pointers"
or "makefiles", as you won't need to know about them for these assignments.
... | 71.378571 | 459 | 0.702141 | [
"object",
"vector"
] |
ce992c3bf6012a511ff9208dbcb447e791e34692 | 25,637 | cpp | C++ | blast/src/objtools/readers/gtf_reader.cpp | mycolab/ncbi-blast | e59746cec78044d2bf6d65de644717c42f80b098 | [
"Apache-2.0"
] | null | null | null | blast/src/objtools/readers/gtf_reader.cpp | mycolab/ncbi-blast | e59746cec78044d2bf6d65de644717c42f80b098 | [
"Apache-2.0"
] | null | null | null | blast/src/objtools/readers/gtf_reader.cpp | mycolab/ncbi-blast | e59746cec78044d2bf6d65de644717c42f80b098 | [
"Apache-2.0"
] | null | null | null | /* $Id: gtf_reader.cpp 632531 2021-06-02 17:25:37Z ivanov $
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Wo... | 33.512418 | 98 | 0.506612 | [
"vector"
] |
ce9a559ba5501a35bcb93e5b9541094c177f42db | 4,920 | cxx | C++ | Libraries/Common/niftkMathsUtils.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | 13 | 2018-07-28T13:36:38.000Z | 2021-11-01T19:17:39.000Z | Libraries/Common/niftkMathsUtils.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | null | null | null | Libraries/Common/niftkMathsUtils.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | 10 | 2018-08-20T07:06:00.000Z | 2021-07-07T07:55:27.000Z | /*=============================================================================
NifTK: A software platform for medical image computing.
Copyright (c) University College London (UCL). All rights reserved.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY o... | 24.356436 | 101 | 0.489837 | [
"vector",
"transform"
] |
ce9baa0b5e7344ea1acf6579cbbf8131bbd90adb | 849 | cpp | C++ | Reverse words in a given string - GFG/reverse-words-in-a-given-string.cpp | champmaniac/LeetCode | 65810e0123e0ceaefb76d0a223436d1525dac0d4 | [
"MIT"
] | 1 | 2022-02-27T09:01:07.000Z | 2022-02-27T09:01:07.000Z | Reverse words in a given string - GFG/reverse-words-in-a-given-string.cpp | champmaniac/LeetCode | 65810e0123e0ceaefb76d0a223436d1525dac0d4 | [
"MIT"
] | null | null | null | Reverse words in a given string - GFG/reverse-words-in-a-given-string.cpp | champmaniac/LeetCode | 65810e0123e0ceaefb76d0a223436d1525dac0d4 | [
"MIT"
] | null | null | null | // { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
//Function to reverse words in a given string.
string reverseWords(string S)
{
// code here
vector<string> rev;
string temp="";
for(auto a:S){
... | 18.456522 | 50 | 0.43934 | [
"vector"
] |
cea02bbee503214a301d65742df8bcb3f5945821 | 11,637 | cpp | C++ | hello_sane.cpp | betamake/intelligence | 3ca68f03a29f54e3cefe28d33c67183488891c27 | [
"Unlicense"
] | 1 | 2021-01-16T02:34:33.000Z | 2021-01-16T02:34:33.000Z | hello_sane.cpp | betamake/intelligence | 3ca68f03a29f54e3cefe28d33c67183488891c27 | [
"Unlicense"
] | null | null | null | hello_sane.cpp | betamake/intelligence | 3ca68f03a29f54e3cefe28d33c67183488891c27 | [
"Unlicense"
] | 1 | 2019-07-16T00:48:29.000Z | 2019-07-16T00:48:29.000Z | #include "hello_sane.h"
#ifdef __cplusplus
extern "C" {
#endif
typedef struct
{
uint8_t *data;
int width;
int height;
int x;
int y;
}
Image;
#define STRIP_HEIGHT 256
static SANE_Handle device = NULL;
static int verbose;
static int progress = 0;
static SANE_Byte *buffer;
static size_t buffer_size;
static v... | 27.77327 | 135 | 0.434476 | [
"model"
] |
cea3f8216f889133f5b766a39a901ed245841c7c | 6,385 | cpp | C++ | resources/provided.cpp | T0T0R/minimax2048 | 53f03c5d0461a0f68f522cf282c185d39ce0052c | [
"MIT"
] | null | null | null | resources/provided.cpp | T0T0R/minimax2048 | 53f03c5d0461a0f68f522cf282c185d39ce0052c | [
"MIT"
] | null | null | null | resources/provided.cpp | T0T0R/minimax2048 | 53f03c5d0461a0f68f522cf282c185d39ce0052c | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <string>
#include <array>
#include "../src/mm2048.h"
#include "../src/GameManager.h"
#include "../src/Grid.h"
#include "../src/Tile.h"
#include "../src/Vec2D.h"
#include "./provided.h"
Vec2D rot90(Vec2D const& M){
/*** Anti-clockwise rotation at 90 degrees. ***/
Vec2... | 27.521552 | 140 | 0.541425 | [
"vector"
] |
ceb421a179e636dd1b7015135cf508df30de0f5a | 6,375 | cc | C++ | 3rd_party/vrippack-0.31/src/plytools/plyarea.cc | yuxng/3DVP | 3551a31bc45d49e661f2140ea90b8bd83fe65e3b | [
"MIT"
] | 42 | 2016-07-03T22:16:47.000Z | 2021-03-30T22:23:46.000Z | 3rd_party/vrippack-0.31/src/plytools/plyarea.cc | PeiliangLi/3DVP | 3551a31bc45d49e661f2140ea90b8bd83fe65e3b | [
"MIT"
] | 2 | 2016-11-12T10:36:48.000Z | 2017-09-07T11:32:34.000Z | 3rd_party/vrippack-0.31/src/plytools/plyarea.cc | PeiliangLi/3DVP | 3551a31bc45d49e661f2140ea90b8bd83fe65e3b | [
"MIT"
] | 16 | 2016-08-06T01:20:40.000Z | 2020-07-13T14:59:35.000Z | /*
Compute the area of a triangle mesh
Brian Curless, October 1997
*/
#include <stdio.h>
#include <math.h>
#include <malloc.h>
#include <strings.h>
#include <ply.h>
#include <unistd.h>
#ifdef LINUX
#include <stdlib.h>
#endif
/* user's vertex and face definitions for a polygonal object */
typedef struct Vertex {... | 25.398406 | 79 | 0.542275 | [
"mesh",
"object"
] |
ceb77b1d57fa7630355dd290d01b94e4a0d7b6aa | 10,607 | cpp | C++ | Samples/Step03-Using_Render_Passes.cpp | THISISAGOODNAME/vkCookBook | d022b4151a02c33e5c58534dc53ca39610eee7b5 | [
"MIT"
] | 5 | 2019-03-02T16:29:15.000Z | 2021-11-07T11:07:53.000Z | Samples/Step03-Using_Render_Passes.cpp | THISISAGOODNAME/vkCookBook | d022b4151a02c33e5c58534dc53ca39610eee7b5 | [
"MIT"
] | null | null | null | Samples/Step03-Using_Render_Passes.cpp | THISISAGOODNAME/vkCookBook | d022b4151a02c33e5c58534dc53ca39610eee7b5 | [
"MIT"
] | 2 | 2018-07-10T18:15:40.000Z | 2020-01-03T04:02:32.000Z | //
// Created by aicdg on 2017/6/24.
//
//
// 03-Using_Render_Passes
#include "CookbookSampleFramework.h"
#include "All_Lib.h"
using namespace VKCookbook;
class Sample : public VulkanCookbookSample {
VkDestroyer<VkCommandPool> CommandPool;
VkCommandBuffer CommandBuffer;
VkDestroyer<VkRender... | 52.771144 | 182 | 0.536061 | [
"render",
"vector"
] |
cec5333c0348d985136dbcb9e60678298b6f455c | 1,557 | cc | C++ | cpp/src/graph/numIslands.cc | dacozai/algorithm-diary | 8ed5e119e4450e92e63276047ef19bbf422c2770 | [
"MIT"
] | 1 | 2019-10-17T08:34:55.000Z | 2019-10-17T08:34:55.000Z | cpp/src/graph/numIslands.cc | dacozai/algorithm-diary | 8ed5e119e4450e92e63276047ef19bbf422c2770 | [
"MIT"
] | 1 | 2020-05-24T08:32:13.000Z | 2020-05-24T08:32:13.000Z | cpp/src/graph/numIslands.cc | dacozai/algorithm-diary | 8ed5e119e4450e92e63276047ef19bbf422c2770 | [
"MIT"
] | null | null | null | #include "test.h"
/** Question no 200 medium Number of Islands
* Author : Li-Han, Chen; 陳立瀚
* Date : 9th, February, 2020
* Source : https://leetcode.com/problems/number-of-islands/
*
* Given a 2d grid map of '1's (land) and '0's (water), count the number of islands.
* An island is surrounded by water and is f... | 23.953846 | 107 | 0.537572 | [
"vector"
] |
ced0f065e75b1f2a4f97ff7f2ac0e86f5d63fa22 | 17,428 | hpp | C++ | src/Providers/UNIXProviders/DatabaseSystem/UNIX_DatabaseSystem_FREEBSD.hpp | brunolauze/openpegasus-providers-old | b00f1aad575bae144b8538bf57ba5fd5582a4ec7 | [
"MIT"
] | 1 | 2020-10-12T09:00:09.000Z | 2020-10-12T09:00:09.000Z | src/Providers/UNIXProviders/DatabaseSystem/UNIX_DatabaseSystem_FREEBSD.hpp | brunolauze/openpegasus-providers-old | b00f1aad575bae144b8538bf57ba5fd5582a4ec7 | [
"MIT"
] | null | null | null | src/Providers/UNIXProviders/DatabaseSystem/UNIX_DatabaseSystem_FREEBSD.hpp | brunolauze/openpegasus-providers-old | b00f1aad575bae144b8538bf57ba5fd5582a4ec7 | [
"MIT"
] | null | null | null | //%LICENSE////////////////////////////////////////////////////////////////
//
// Licensed to The Open Group (TOG) under one or more contributor license
// agreements. Refer to the OpenPegasusNOTICE.txt file distributed with
// this work for additional information regarding copyright ownership.
// Each contributor lice... | 23.519568 | 90 | 0.729688 | [
"object"
] |
ced79379141a073398e5418d5296b34b1d5fc4e9 | 1,604 | cc | C++ | src/jit.cc | jlarmstrongiv/libtorchjs | d2466337db2707157f8b402dbefd80e84466e3a1 | [
"BSD-3-Clause"
] | 20 | 2019-01-08T00:45:44.000Z | 2021-05-21T23:38:26.000Z | src/jit.cc | jlarmstrongiv/libtorchjs | d2466337db2707157f8b402dbefd80e84466e3a1 | [
"BSD-3-Clause"
] | 5 | 2020-02-19T14:39:00.000Z | 2021-04-18T20:33:49.000Z | src/jit.cc | jlarmstrongiv/libtorchjs | d2466337db2707157f8b402dbefd80e84466e3a1 | [
"BSD-3-Clause"
] | 4 | 2019-07-14T10:50:08.000Z | 2021-04-10T20:19:52.000Z | #include "jit.h"
#include "script_module.h"
#include <torch/torch.h>
#include <torch/script.h>
#include <stdlib.h>
#include <napi.h>
namespace libtorchjs {
class LoadWorker : public Napi::AsyncWorker {
public:
static void load(const Napi::CallbackInfo &info) {
// first arg is s... | 32.734694 | 97 | 0.55985 | [
"object"
] |
cee9554b95d1dc1346520069ce218a3db689777d | 1,348 | cpp | C++ | problems/max_area_of_island/solution.cpp | sauravchandra1/Leetcode | be89c7d8d93083326a94906a28bfad2342aa1dfe | [
"MIT"
] | null | null | null | problems/max_area_of_island/solution.cpp | sauravchandra1/Leetcode | be89c7d8d93083326a94906a28bfad2342aa1dfe | [
"MIT"
] | null | null | null | problems/max_area_of_island/solution.cpp | sauravchandra1/Leetcode | be89c7d8d93083326a94906a28bfad2342aa1dfe | [
"MIT"
] | null | null | null | class Solution {
public:
int maxAreaOfIsland(vector<vector<int>>& grid) {
int n = grid.size();
int m = grid[0].size();
queue<pair<int, int>> Q;
int ans = 0;
auto isFine = [&](int x, int y) {
if (x < 0 || y < 0 || x >= n || y >= m) return false;
return ... | 33.7 | 70 | 0.281899 | [
"vector"
] |
ceee4ad2d156b2d384230289084b3065301957a3 | 245 | cpp | C++ | src/base/py.cpp | alexa-infra/negine | d9060a7c83a41c95c361c470b56c2ddab3ba04de | [
"MIT"
] | 4 | 2016-11-11T20:35:34.000Z | 2018-12-24T18:30:16.000Z | src/base/py.cpp | alexa-infra/negine | d9060a7c83a41c95c361c470b56c2ddab3ba04de | [
"MIT"
] | null | null | null | src/base/py.cpp | alexa-infra/negine | d9060a7c83a41c95c361c470b56c2ddab3ba04de | [
"MIT"
] | null | null | null | #include "base/py.h"
#include <cmath>
#include <boost/python.hpp>
#include "math/py_math.h"
#include "render/py_render.h"
using namespace boost::python;
BOOST_PYTHON_MODULE(negine_core)
{
init_py_math();
init_py_render();
} | 18.846154 | 33 | 0.693878 | [
"render"
] |
cef4b3d04099548422ce7190c44587e08fc367c6 | 4,938 | hpp | C++ | WuManber.hpp | ebayboy/WuManber | 2f71780058e774a08299d5da40128cae64c96fd0 | [
"MIT"
] | null | null | null | WuManber.hpp | ebayboy/WuManber | 2f71780058e774a08299d5da40128cae64c96fd0 | [
"MIT"
] | null | null | null | WuManber.hpp | ebayboy/WuManber | 2f71780058e774a08299d5da40128cae64c96fd0 | [
"MIT"
] | null | null | null | #pragma once
#include <string>
#include <unordered_map>
#include <algorithm>
#include <list>
#include <vector>
#include <cstddef>
#include <iostream>
#include <cstdio>
#include <string>
struct WMResult_t {
std::size_t pattern_id;
std::size_t index;
};
class WuManber {
public:
// construc... | 29.218935 | 125 | 0.585662 | [
"vector"
] |
cef7bf47faba1fecaba15e24ff86b5309745dab3 | 24,032 | cpp | C++ | implementations/ugene/src/corelibs/U2Core/src/datatype/msa/MultipleChromatogramAlignment.cpp | r-barnes/sw_comparison | 1ac2c9cc10a32badd6b8fb1e96516c97f7800176 | [
"BSD-Source-Code"
] | null | null | null | implementations/ugene/src/corelibs/U2Core/src/datatype/msa/MultipleChromatogramAlignment.cpp | r-barnes/sw_comparison | 1ac2c9cc10a32badd6b8fb1e96516c97f7800176 | [
"BSD-Source-Code"
] | null | null | null | implementations/ugene/src/corelibs/U2Core/src/datatype/msa/MultipleChromatogramAlignment.cpp | r-barnes/sw_comparison | 1ac2c9cc10a32badd6b8fb1e96516c97f7800176 | [
"BSD-Source-Code"
] | null | null | null | /**
* UGENE - Integrated Bioinformatics Tools.
* Copyright (C) 2008-2020 UniPro <ugene@unipro.ru>
* http://ugene.net
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* ... | 37.201238 | 216 | 0.683505 | [
"model"
] |
cefa1c3a2c453c0c9c4bb75a98e1a7a14994fc16 | 2,863 | cpp | C++ | Gfg/C++/Rotten Oranges.cpp | abdzitter/Daily-Coding-DS-ALGO-Practice | 26ddbf7a3673608039a07d26d812fce31b69871a | [
"MIT"
] | 289 | 2021-05-15T22:56:03.000Z | 2022-03-28T23:13:25.000Z | Gfg/C++/Rotten Oranges.cpp | abdzitter/Daily-Coding-DS-ALGO-Practice | 26ddbf7a3673608039a07d26d812fce31b69871a | [
"MIT"
] | 1,812 | 2021-05-09T13:49:58.000Z | 2022-01-15T19:27:17.000Z | Gfg/C++/Rotten Oranges.cpp | abdzitter/Daily-Coding-DS-ALGO-Practice | 26ddbf7a3673608039a07d26d812fce31b69871a | [
"MIT"
] | 663 | 2021-05-09T16:57:58.000Z | 2022-03-27T14:15:07.000Z | // Link tp problem:
//https://practice.geeksforgeeks.org/problems/rotten-oranges2536/1
/*Algorithm:
First we will push the index of grid having value 2(rotten orange) and count total no of fresh oranges. Then we will keep poping
index from queue and add the adjacent oranges which will get rot. We will keep count of a... | 24.681034 | 129 | 0.398184 | [
"vector"
] |
3000d4d23398ed3346d635bd36ea39f06be3f808 | 3,038 | cxx | C++ | MassiveNumbers.cxx | jackytck/topcoder | 5a83ce478d4f05aeb97062f8a30aa1d6fbc969d3 | [
"MIT"
] | null | null | null | MassiveNumbers.cxx | jackytck/topcoder | 5a83ce478d4f05aeb97062f8a30aa1d6fbc969d3 | [
"MIT"
] | null | null | null | MassiveNumbers.cxx | jackytck/topcoder | 5a83ce478d4f05aeb97062f8a30aa1d6fbc969d3 | [
"MIT"
] | null | null | null | // BEGIN CUT HERE
// PROBLEM STATEMENT
// Massive numbers can be represented using the exponent notation. For example, 3^100 is 3 raised to the power of 100. 3 is the base and 100 is the exponent.
Suppose we want to compare two massive numbers. Instead of computing the exact value of each number we can rely on a u... | 28.933333 | 283 | 0.675444 | [
"vector"
] |
30036075db51f3a7496622e35d18eef031b40d48 | 4,481 | hpp | C++ | Source/AllProjects/Drivers/ZWave/ZWaveLevi2/Client/ZWaveLevi2C_ZWIndex.hpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | 51 | 2020-12-26T18:17:16.000Z | 2022-03-15T04:29:35.000Z | Source/AllProjects/Drivers/ZWave/ZWaveLevi2/Client/ZWaveLevi2C_ZWIndex.hpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | null | null | null | Source/AllProjects/Drivers/ZWave/ZWaveLevi2/Client/ZWaveLevi2C_ZWIndex.hpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | 4 | 2020-12-28T07:24:39.000Z | 2021-12-29T12:09:37.000Z | //
// FILE NAME: ZWaveLevi2C_ZWIndex.hpp
//
// AUTHOR: Dean Roddey
//
// CREATED: 08/26/2014
//
// COPYRIGHT: Charmed Quark Systems, Ltd @ 2020
//
// This software is copyrighted by 'Charmed Quark Systems, Ltd' and
// the author (Dean Roddey.) It is licensed under the MIT Open Source
// license:
//
// https://ope... | 33.192593 | 84 | 0.40058 | [
"model"
] |
300ea2576a08a84a85bc1443677dd1f8fc84d36f | 2,434 | cpp | C++ | src/convertbase.cpp | kylegmaxwell/training | 82def44a0aa453cd988394fd8102c74238e6cb1d | [
"MIT"
] | null | null | null | src/convertbase.cpp | kylegmaxwell/training | 82def44a0aa453cd988394fd8102c74238e6cb1d | [
"MIT"
] | null | null | null | src/convertbase.cpp | kylegmaxwell/training | 82def44a0aa453cd988394fd8102c74238e6cb1d | [
"MIT"
] | null | null | null | #include <math.h>
#include <unordered_map>
#include <sstream>
#include <vector>
#include "convertbase.h"
using namespace std;
UnitTest::TestResult ConvertBase::test()
{
if (mVerbose)
cout << "convert base" << endl;
TestResult state = TestResult::PASS;
string begin = "A08";
string result = c... | 24.836735 | 71 | 0.593673 | [
"vector"
] |
3012bb580243f65bd28ce45cedb15c83319b0dbb | 710 | cpp | C++ | solutions/0046.permutations/0046.permutations.1548858296.cpp | nettee/leetcode | 19aa8d54d64cce3679db5878ee0194fad95d8fa1 | [
"MIT"
] | 1 | 2021-01-14T06:01:02.000Z | 2021-01-14T06:01:02.000Z | solutions/0046.permutations/0046.permutations.1548858296.cpp | nettee/leetcode | 19aa8d54d64cce3679db5878ee0194fad95d8fa1 | [
"MIT"
] | 8 | 2018-03-27T11:47:19.000Z | 2018-11-12T06:02:12.000Z | solutions/0046.permutations/0046.permutations.1548858296.cpp | nettee/leetcode | 19aa8d54d64cce3679db5878ee0194fad95d8fa1 | [
"MIT"
] | 2 | 2020-04-30T09:47:01.000Z | 2020-12-03T09:34:08.000Z | class Solution {
public:
vector<vector<int>> permute(vector<int>& nums) {
if (nums.size() == 1) {
return vector<vector<int>>{{nums[0]}};
}
vector<vector<int>> res;
for (int i = 0; i < nums.size(); i++) {
int n = nums[i];
vector<int> remaining;
... | 28.4 | 59 | 0.415493 | [
"vector"
] |
30198383edb1c4548aa89d8e0dfec13b9cdfa8d5 | 7,251 | cpp | C++ | IfcPlusPlus/src/ifcpp/IFC4/IfcLightSourceGoniometric.cpp | linsipese/ifcppstudy | e09f05d276b5e129fcb6be65800472979cd4c800 | [
"MIT"
] | 1 | 2018-10-23T09:43:07.000Z | 2018-10-23T09:43:07.000Z | IfcPlusPlus/src/ifcpp/IFC4/IfcLightSourceGoniometric.cpp | linsipese/ifcppstudy | e09f05d276b5e129fcb6be65800472979cd4c800 | [
"MIT"
] | null | null | null | IfcPlusPlus/src/ifcpp/IFC4/IfcLightSourceGoniometric.cpp | linsipese/ifcppstudy | e09f05d276b5e129fcb6be65800472979cd4c800 | [
"MIT"
] | null | null | null | /* -*-c++-*- IfcPlusPlus - www.ifcplusplus.com - Copyright (C) 2011 Fabian Gerold
*
* This library is open source and may be redistributed and/or modified under
* the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or
* (at your option) any later version. The full license is in LICENSE file
* in... | 63.052174 | 235 | 0.756172 | [
"vector",
"model"
] |
301b37241b50e9fef1df29aaed24500a0869dbfe | 4,601 | cpp | C++ | unittests/blocks_unittest.cpp | dgkimura/dafs | 20273ea13d71bbb9ca8f6e85045c0abb1cf45aba | [
"MIT"
] | 2 | 2018-06-29T05:59:16.000Z | 2018-07-01T05:58:14.000Z | unittests/blocks_unittest.cpp | dgkimura/dafs | 20273ea13d71bbb9ca8f6e85045c0abb1cf45aba | [
"MIT"
] | 7 | 2018-06-04T16:26:37.000Z | 2018-11-03T00:47:08.000Z | unittests/blocks_unittest.cpp | dgkimura/dafs | 20273ea13d71bbb9ca8f6e85045c0abb1cf45aba | [
"MIT"
] | null | null | null | #include "gtest/gtest.h"
#include "dafs/blocks.hpp"
TEST(BlocksTest, testRootFieldsAreConstructed)
{
std::string directory = "a_directory";
dafs::Root root(directory);
ASSERT_EQ(directory, root.directory);
}
TEST(BlocksTest, testBlockFieldsAreConstructed)
{
std::string contents = "the_block_conte... | 27.884848 | 85 | 0.505108 | [
"vector"
] |
3024565f3807448264858e49daa05b9b08f4850f | 2,035 | hpp | C++ | module-services/service-cellular/service-cellular/requests/Request.hpp | bitigchi/MuditaOS | 425d23e454e09fd6ae274b00f8d19c57a577aa94 | [
"BSL-1.0"
] | 369 | 2021-11-10T09:20:29.000Z | 2022-03-30T06:36:58.000Z | module-services/service-cellular/service-cellular/requests/Request.hpp | bitigchi/MuditaOS | 425d23e454e09fd6ae274b00f8d19c57a577aa94 | [
"BSL-1.0"
] | 149 | 2021-11-10T08:38:35.000Z | 2022-03-31T23:01:52.000Z | module-services/service-cellular/service-cellular/requests/Request.hpp | bitigchi/MuditaOS | 425d23e454e09fd6ae274b00f8d19c57a577aa94 | [
"BSL-1.0"
] | 41 | 2021-11-10T08:30:37.000Z | 2022-03-29T08:12:46.000Z | // Copyright (c) 2017-2021, Mudita Sp. z.o.o. All rights reserved.
// For licensing, see https://github.com/mudita/MuditaOS/LICENSE.md
#pragma once
#include <at/Result.hpp>
#include <at/Commands.hpp>
#include "service-cellular/RequestHandler.hpp"
#include <at/Cmd.hpp>
namespace cellular
{
constexpr inline auto m... | 37.685185 | 115 | 0.615233 | [
"vector"
] |
6f7ab889504534cb52990ec1b75f9082a8b838e4 | 864 | cpp | C++ | src/cxx/test/test_separating_hyperplanes.cpp | tardani95/iris-distro | dbb1ebbde2e52b4cc747b4aa2fe88518b238071a | [
"BSD-2-Clause"
] | 82 | 2016-03-30T15:32:47.000Z | 2022-03-28T03:03:08.000Z | src/cxx/test/test_separating_hyperplanes.cpp | tardani95/iris-distro | dbb1ebbde2e52b4cc747b4aa2fe88518b238071a | [
"BSD-2-Clause"
] | 49 | 2015-01-21T16:13:20.000Z | 2021-12-29T02:47:52.000Z | src/cxx/test/test_separating_hyperplanes.cpp | tardani95/iris-distro | dbb1ebbde2e52b4cc747b4aa2fe88518b238071a | [
"BSD-2-Clause"
] | 61 | 2015-03-20T18:49:31.000Z | 2022-01-27T12:35:38.000Z | #include <Eigen/Core>
#include "iris/iris.h"
#include "test_util.h"
int main() {
// A simple example with a sphere centered at the origin
Eigen::MatrixXd C(2,2);
C << 1, 0,
0, 1;
Eigen::VectorXd d(2);
d << 0, 0;
iris::Ellipsoid ellipsoid(C, d);
Eigen::MatrixXd obs(2,4);
obs << 2, 3, 3, 2,
... | 27 | 79 | 0.657407 | [
"vector"
] |
6f9cf8eb8cced2c4e81d68dd5c0d5dc89b745e2c | 1,629 | cpp | C++ | src/circle.cpp | Nimor111/LearnOpenGL-Engine | 24738fbdbb4e879171b8992a24430db14531369a | [
"MIT"
] | null | null | null | src/circle.cpp | Nimor111/LearnOpenGL-Engine | 24738fbdbb4e879171b8992a24430db14531369a | [
"MIT"
] | null | null | null | src/circle.cpp | Nimor111/LearnOpenGL-Engine | 24738fbdbb4e879171b8992a24430db14531369a | [
"MIT"
] | null | null | null | #include <glad/glad.h>
#include <GLFW/glfw3.h>
#include "../include/Shader.h"
#include "../include/VertexData.h"
#include "../include/Window.h"
#include <vector>
#define NUMBER_OF_VERTICES 64
int main(int argc, char const** argv)
{
glfwInit();
glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);
glfwWindowHi... | 26.274194 | 88 | 0.644567 | [
"vector"
] |
6fa1e57fc80916f41637cfa2e915ccc2e4551182 | 8,045 | cpp | C++ | pixetto.cpp | pixetto/pxt-pixetto-16 | b58308ce76800db61a6cc3a7fb0057bd5ed93049 | [
"MIT"
] | null | null | null | pixetto.cpp | pixetto/pxt-pixetto-16 | b58308ce76800db61a6cc3a7fb0057bd5ed93049 | [
"MIT"
] | null | null | null | pixetto.cpp | pixetto/pxt-pixetto-16 | b58308ce76800db61a6cc3a7fb0057bd5ed93049 | [
"MIT"
] | null | null | null | #include "pxt.h"
#include "MicroBit.h"
#include "MicroBitFile.h"
#ifdef CODAL_CONFIG_H
#define MICROBIT_CODAL 1
#else
#define MICROBIT_CODAL 0
#define target_panic(n) microbit_panic(n)
#define target_wait(n) wait_ms(n)
#endif
#define PXT_PACKET_START 0xFD
#define PXT_PACKET_END 0xFE
#define PXT_CMD_GE... | 21.339523 | 95 | 0.602859 | [
"object",
"shape"
] |
6fa4312da011efb630870ac113f8faba44a5b6ba | 730 | cpp | C++ | UCRolling/ucRollingBundle.cpp | jalving/PIPS | 62f664237447c7ce05a62552952c86003d90e68f | [
"BSD-3-Clause-LBNL"
] | 65 | 2016-02-04T18:03:39.000Z | 2022-03-24T08:59:38.000Z | UCRolling/ucRollingBundle.cpp | jalving/PIPS | 62f664237447c7ce05a62552952c86003d90e68f | [
"BSD-3-Clause-LBNL"
] | 34 | 2015-11-17T04:26:51.000Z | 2020-09-24T16:00:22.000Z | UCRolling/ucRollingBundle.cpp | jalving/PIPS | 62f664237447c7ce05a62552952c86003d90e68f | [
"BSD-3-Clause-LBNL"
] | 26 | 2015-10-15T20:27:52.000Z | 2021-07-14T08:13:34.000Z | #include "ucRollingModel.hpp"
#include "CbcLagrangeSolver.hpp"
#include "ClpRecourseSolver.hpp"
#include "conicBundleDriver.hpp"
#include <boost/scoped_ptr.hpp>
using namespace std;
using boost::scoped_ptr;
int main(int argc, char **argv) {
MPI_Init(&argc, &argv);
int mype;
MPI_Comm... | 21.470588 | 81 | 0.634247 | [
"model"
] |
6fa48ba1a8aa0ba743563890c6a65b1e84662859 | 7,116 | cpp | C++ | mapper/src/mapper/generate_final_map.cpp | anpl-technion/anpl_mrbsp | 973734fd2d1c7bb5e1405922300add489f088e81 | [
"MIT"
] | 1 | 2021-12-03T03:11:20.000Z | 2021-12-03T03:11:20.000Z | mapper/src/mapper/generate_final_map.cpp | anpl-technion/anpl_mrbsp | 973734fd2d1c7bb5e1405922300add489f088e81 | [
"MIT"
] | null | null | null | mapper/src/mapper/generate_final_map.cpp | anpl-technion/anpl_mrbsp | 973734fd2d1c7bb5e1405922300add489f088e81 | [
"MIT"
] | 1 | 2021-12-03T03:11:23.000Z | 2021-12-03T03:11:23.000Z | /* ---------------------------------------------------------------------------
*
* Autonomous Navigation and Perception Lab (ANPL),
* Technion, Israel Institute of Technology,
* Faculty of Aerospace Engineering,
* Haifa, Israel, 32000
* All Rights Reserved
*
* See LICENSE for the license information
*
* -----... | 38.258065 | 136 | 0.663435 | [
"object",
"vector"
] |
6fb6eef3189f1fabd33d3995e65863f7dec80458 | 618 | cpp | C++ | PHONELST.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | 1 | 2019-05-23T20:03:40.000Z | 2019-05-23T20:03:40.000Z | PHONELST.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | null | null | null | PHONELST.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | 1 | 2021-08-28T16:48:42.000Z | 2021-08-28T16:48:42.000Z | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
int main(void)
{
int t,n;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
vector <string> lst;
for( int i=0 ; i<n ; i++ )
{
string s;
cin>>s;
lst.push_back(s);
}
bool flag=false;
... | 15.073171 | 51 | 0.459547 | [
"vector"
] |
6fb73afeda94f9572704747981f6a5fc0da09260 | 15,045 | cpp | C++ | vm/llvm/jit_inline_method.cpp | sshao/rubinius | 368df60245471f45f1294b0cd18f769377437246 | [
"BSD-3-Clause"
] | 1 | 2015-11-08T12:37:15.000Z | 2015-11-08T12:37:15.000Z | vm/llvm/jit_inline_method.cpp | sshao/rubinius | 368df60245471f45f1294b0cd18f769377437246 | [
"BSD-3-Clause"
] | null | null | null | vm/llvm/jit_inline_method.cpp | sshao/rubinius | 368df60245471f45f1294b0cd18f769377437246 | [
"BSD-3-Clause"
] | null | null | null | #ifdef ENABLE_LLVM
#include "llvm/jit_inline_method.hpp"
#include "llvm/method_info.hpp"
#include "call_frame.hpp"
using namespace llvm;
namespace rubinius {
namespace jit {
BasicBlock* InlineMethodBuilder::setup_inline(Value* self, Value* blk,
std::vector<Value*>& stack_args)
{
llvm::Value* prev = in... | 29.674556 | 99 | 0.579993 | [
"object",
"vector"
] |
6fbd14776d3e5370701b839cc2311506179d2d3a | 8,061 | cpp | C++ | src/modules/DopingProfileReader/DopingProfileReaderModule.cpp | bencline1/Allpix_GaAs | c4922dc9d981aca265e076eb5bfe4cefe51913a2 | [
"MIT"
] | 3 | 2019-03-04T22:31:32.000Z | 2021-04-20T11:19:17.000Z | src/modules/DopingProfileReader/DopingProfileReaderModule.cpp | bencline1/Allpix_GaAs | c4922dc9d981aca265e076eb5bfe4cefe51913a2 | [
"MIT"
] | 27 | 2019-04-01T12:25:46.000Z | 2021-09-03T12:20:19.000Z | src/modules/DopingProfileReader/DopingProfileReaderModule.cpp | bencline1/Allpix_GaAs | c4922dc9d981aca265e076eb5bfe4cefe51913a2 | [
"MIT"
] | 15 | 2017-08-08T14:57:51.000Z | 2021-06-26T17:16:21.000Z | /**
* @file
* @brief Implementation of module to read doping concentration maps
* @copyright Copyright (c) 2017 CERN and the Allpix Squared authors.
* This software is distributed under the terms of the MIT License, copied verbatim in the file "LICENSE.md".
* In applying this license, CERN does not waive the privi... | 49.759259 | 125 | 0.639251 | [
"mesh",
"vector",
"model"
] |
6fcd8b58f86f2b475a385fec0dc803d0c91a6ad3 | 7,271 | cpp | C++ | FrameLib_Objects/Time_Smoothing/FrameLib_MovingAverage.cpp | AlexHarker/FrameLib | 04b9882561c83d3240c6cb07f14861244d1d6272 | [
"BSD-3-Clause"
] | 33 | 2017-08-13T00:02:41.000Z | 2022-03-10T23:02:17.000Z | FrameLib_Objects/Time_Smoothing/FrameLib_MovingAverage.cpp | AlexHarker/FrameLib | 04b9882561c83d3240c6cb07f14861244d1d6272 | [
"BSD-3-Clause"
] | 60 | 2018-02-01T23:33:36.000Z | 2022-03-23T23:25:13.000Z | FrameLib_Objects/Time_Smoothing/FrameLib_MovingAverage.cpp | AlexHarker/FrameLib | 04b9882561c83d3240c6cb07f14861244d1d6272 | [
"BSD-3-Clause"
] | 8 | 2018-02-01T20:18:46.000Z | 2020-07-03T12:53:04.000Z |
#include "FrameLib_MovingAverage.h"
#include "../../FrameLib_Dependencies/Interpolation.hpp"
// Constructor
FrameLib_MovingAverage::FrameLib_MovingAverage(FrameLib_Context context, const FrameLib_Parameters::Serial *serialisedParameters, FrameLib_Proxy *proxy)
: FrameLib_Processor(context, proxy, &sParamInfo, 5, 2)
... | 35.642157 | 152 | 0.623986 | [
"object"
] |
6fd1cdb569135d871589d2a661959ae1aa52c1e4 | 2,344 | hpp | C++ | source/hougl/include/hou/gl/gl_invalid_context_error.hpp | DavideCorradiDev/houzi-game-engine | d704aa9c5b024300578aafe410b7299c4af4fcec | [
"MIT"
] | 2 | 2018-04-12T20:59:20.000Z | 2018-07-26T16:04:07.000Z | source/hougl/include/hou/gl/gl_invalid_context_error.hpp | DavideCorradiDev/houzi-game-engine | d704aa9c5b024300578aafe410b7299c4af4fcec | [
"MIT"
] | null | null | null | source/hougl/include/hou/gl/gl_invalid_context_error.hpp | DavideCorradiDev/houzi-game-engine | d704aa9c5b024300578aafe410b7299c4af4fcec | [
"MIT"
] | null | null | null | // Houzi Game Engine
// Copyright (c) 2018 Davide Corradi
// Licensed under the MIT license.
#ifndef HOU_GL_GL_INVALID_CONTEXT_ERROR_HPP
#define HOU_GL_GL_INVALID_CONTEXT_ERROR_HPP
#include "hou/cor/exception.hpp"
#include "hou/gl/open_gl.hpp"
#include "hou/gl/gl_config.hpp"
#include "hou/cor/std_string.hpp"
na... | 24.93617 | 80 | 0.731655 | [
"object"
] |
6fd3420a1342483d8fcb65eb8ebe71a0db4f38a5 | 4,936 | cpp | C++ | src/qa.cpp | diogo-aos/CarND-Path-Planning-Project | d7fff1b928621a43630c45953162cd549bf1af86 | [
"MIT"
] | 2 | 2022-02-24T11:04:08.000Z | 2022-02-24T11:04:26.000Z | src/qa.cpp | diogo-aos/CarND-Path-Planning-Project | d7fff1b928621a43630c45953162cd549bf1af86 | [
"MIT"
] | null | null | null | src/qa.cpp | diogo-aos/CarND-Path-Planning-Project | d7fff1b928621a43630c45953162cd549bf1af86 | [
"MIT"
] | null | null | null | int lane = 1;
double ref_speed = 49.5; // mph
prev_size = previous_path_x.size();
if(prev_size > 0){
car_s = end_path_s;
}
bool too_close = false;
//find ref_v to use
for (int i=0; i < sensor_fusion.size(); i++){
//car is in my lane
double d = sensor_fusion[i][6];
double my_lane_center = 2 * 4 * lane;
... | 28.045455 | 105 | 0.688209 | [
"vector",
"model"
] |
6fe51861a87e0375ed8ad371d500afaae6dce8e3 | 8,263 | cpp | C++ | kuka_kr6r900_common/kuka_cv/src/CommonCV.cpp | AlexeiOvcharov/kuka_kr6r900_simulation | 0d9125fe0cf56ca0a48aa1be2eb6ec72884bda4c | [
"Apache-2.0"
] | 10 | 2020-06-12T08:00:16.000Z | 2022-03-23T09:54:35.000Z | kuka_kr6r900_common/kuka_cv/src/CommonCV.cpp | airalab/kuka_kr6r900_simulation | 0d9125fe0cf56ca0a48aa1be2eb6ec72884bda4c | [
"Apache-2.0"
] | 7 | 2020-11-17T19:58:58.000Z | 2021-04-19T12:01:24.000Z | kuka_kr6r900_common/kuka_cv/src/CommonCV.cpp | airalab/kuka_kr6r900_simulation | 0d9125fe0cf56ca0a48aa1be2eb6ec72884bda4c | [
"Apache-2.0"
] | 2 | 2020-11-16T14:33:45.000Z | 2021-05-31T02:02:14.000Z | #include <CommonCV.h>
#include <iostream>
#include <math.h>
#define COMMONCV_DEBUG false
bool checkUniqueOfVector(std::vector<cv::Vec2f> & vec, cv::Vec2f critria, cv::Vec2f maxDiff)
{
if (vec.empty())
return true;
for (size_t i = 0; i < vec.size(); ++i)
if (abs(vec[i][0] - critria[0]) < maxDif... | 38.078341 | 169 | 0.497519 | [
"vector"
] |
6fe8a44c963390c20b4f531486ac1ef7f54a3117 | 12,134 | cpp | C++ | Editor/UI/AGETransformPanel.cpp | alexshpunt/art_gear | 64a2d001570812690fc8845f694f2bfe1d96c3a2 | [
"MIT"
] | null | null | null | Editor/UI/AGETransformPanel.cpp | alexshpunt/art_gear | 64a2d001570812690fc8845f694f2bfe1d96c3a2 | [
"MIT"
] | null | null | null | Editor/UI/AGETransformPanel.cpp | alexshpunt/art_gear | 64a2d001570812690fc8845f694f2bfe1d96c3a2 | [
"MIT"
] | null | null | null | #include "AGETransformPanel.h"
#include "Managers/AGLogger.h"
#include "Managers/AGEStateManager.h"
#include "Math/AGMath.h"
AGETransformPanel::AGETransformPanel()
{
m_ui.setupUi( this );
this->setFixedWidth( 349 );
m_notifyer = new AGETransformPanelNotifyer( this );
m_nameEdit = new QLineEdit;
m_panelName ... | 25.707627 | 119 | 0.716499 | [
"transform"
] |
6febc2b22b6f6e30fab852d0c163c3eccb1dcb13 | 46,496 | cpp | C++ | Sankore-3.1/src/core/UBSettings.cpp | eaglezzb/rsdc | cce881f6542ff206bf286cf798c8ec8da3b51d50 | [
"MIT"
] | null | null | null | Sankore-3.1/src/core/UBSettings.cpp | eaglezzb/rsdc | cce881f6542ff206bf286cf798c8ec8da3b51d50 | [
"MIT"
] | null | null | null | Sankore-3.1/src/core/UBSettings.cpp | eaglezzb/rsdc | cce881f6542ff206bf286cf798c8ec8da3b51d50 | [
"MIT"
] | null | null | null | /*
* Copyright (C) 2010-2013 Groupement d'Intérêt Public pour l'Education Numérique en Afrique (GIP ENA)
*
* This file is part of Open-Sankoré.
*
* Open-Sankoré is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Found... | 33.839884 | 197 | 0.71047 | [
"shape"
] |
6fed290add1ddf90c3ef6df81de39c2e34bc8267 | 4,317 | hpp | C++ | include/stc/gl/context.hpp | vtavernier/shadertoy-connector | f458a1216b0910ddbbf570932038e68decb2da26 | [
"MIT"
] | null | null | null | include/stc/gl/context.hpp | vtavernier/shadertoy-connector | f458a1216b0910ddbbf570932038e68decb2da26 | [
"MIT"
] | null | null | null | include/stc/gl/context.hpp | vtavernier/shadertoy-connector | f458a1216b0910ddbbf570932038e68decb2da26 | [
"MIT"
] | null | null | null | #ifndef _STC_GL_CONTEXT_HPP_
#define _STC_GL_CONTEXT_HPP_
#include <memory>
#include <string>
#include <epoxy/gl.h>
#include <GLFW/glfw3.h>
#include <shadertoy.hpp>
#include "stc/core/basic_context.hpp"
namespace stc
{
namespace gl
{
class context : public core::basic_context
{
/// Rendering size
shadertoy::rs... | 26.648148 | 139 | 0.708594 | [
"render",
"vector"
] |
6ff6a71a1b267d61fc00f4052b70e315d598bb54 | 386 | cpp | C++ | 118. Pascal's Triangle.cpp | MadanParth786/LeetcodeSolutions_PracticeQuestions | 8a9c1eb88a6d5214abdb2becf2115a51e317a5c4 | [
"MIT"
] | 1 | 2022-01-19T14:25:36.000Z | 2022-01-19T14:25:36.000Z | 118. Pascal's Triangle.cpp | MadanParth786/LeetcodeSolutions_PracticeQuestions | 8a9c1eb88a6d5214abdb2becf2115a51e317a5c4 | [
"MIT"
] | null | null | null | 118. Pascal's Triangle.cpp | MadanParth786/LeetcodeSolutions_PracticeQuestions | 8a9c1eb88a6d5214abdb2becf2115a51e317a5c4 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<vector<int>> Generate(int numrows) {
vector<vector<int>>r(numRows);
for (int i = 0; i < numrows; i++) {
r[i].resize(i + 1);
r[i][0] = r[i][i] = 1;
for (int j = 1; j < i; j++)
r[i][j] = r[i - 1][j - 1] +... | 22.705882 | 57 | 0.360104 | [
"vector"
] |
6ff76f8093e2651e3d48decd86d1bc5bca585afd | 3,567 | cpp | C++ | src/SolARNonFreeOpenCVHelper.cpp | SolarFramework/SolARModuleNonFreeOpenCV | d14beef73fcfd7be5baf548ebf93b8c4f3548291 | [
"Apache-2.0"
] | null | null | null | src/SolARNonFreeOpenCVHelper.cpp | SolarFramework/SolARModuleNonFreeOpenCV | d14beef73fcfd7be5baf548ebf93b8c4f3548291 | [
"Apache-2.0"
] | 1 | 2020-02-24T10:44:06.000Z | 2020-02-24T10:44:06.000Z | src/SolARNonFreeOpenCVHelper.cpp | SolarFramework/SolARModuleNonFreeOpenCV | d14beef73fcfd7be5baf548ebf93b8c4f3548291 | [
"Apache-2.0"
] | 2 | 2019-07-25T09:19:48.000Z | 2019-12-09T10:03:33.000Z | /**
* @copyright Copyright (c) 2017 B-com http://www.b-com.com/
*
* 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... | 35.316832 | 172 | 0.708719 | [
"vector"
] |
6ffe3a478cf0629641f9fe72e10d87da3cc82752 | 32,171 | cc | C++ | installer/util/vivaldi_install_dialog.cc | careylam/vivaldi | bff2a435c35fe2cb3327d8d4a76430d4be5f666e | [
"BSD-3-Clause"
] | null | null | null | installer/util/vivaldi_install_dialog.cc | careylam/vivaldi | bff2a435c35fe2cb3327d8d4a76430d4be5f666e | [
"BSD-3-Clause"
] | null | null | null | installer/util/vivaldi_install_dialog.cc | careylam/vivaldi | bff2a435c35fe2cb3327d8d4a76430d4be5f666e | [
"BSD-3-Clause"
] | 1 | 2020-05-12T23:54:41.000Z | 2020-05-12T23:54:41.000Z | // Copyright (c) 2015 Vivaldi Technologies AS. All rights reserved.
#include "installer/util/vivaldi_install_dialog.h"
#include <Shellapi.h>
#include <Shlwapi.h>
#include <shlobj.h>
#include <windowsx.h>
#include <iterator>
#include <map>
#include <memory>
#include <vector>
#include "base/files/file_util.h"
#includ... | 33.61651 | 79 | 0.649032 | [
"vector"
] |
b5045381c32eca98511b346d76b62e29e186f599 | 8,051 | hpp | C++ | src/Util/ThreadPool.hpp | allen-cell-animated/medyan | 0b5ef64fb338c3961673361e5632980617937ee6 | [
"BSD-4-Clause-UC"
] | null | null | null | src/Util/ThreadPool.hpp | allen-cell-animated/medyan | 0b5ef64fb338c3961673361e5632980617937ee6 | [
"BSD-4-Clause-UC"
] | null | null | null | src/Util/ThreadPool.hpp | allen-cell-animated/medyan | 0b5ef64fb338c3961673361e5632980617937ee6 | [
"BSD-4-Clause-UC"
] | null | null | null | #ifndef MEDYAN_Util_ThreadPool_hpp
#define MEDYAN_Util_ThreadPool_hpp
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <cstddef> // size_t
#include <functional>
#include <future>
#include <memory> // unique_ptr
#include <mutex>
#include <ostream>
#include <queue>
#include <thread>
#include <t... | 29.490842 | 116 | 0.571482 | [
"vector"
] |
b50aebcfca03df244d4c59b42c677c3aa16139d5 | 4,914 | cpp | C++ | heart/src/render/hPipelineStateDesc.cpp | JoJo2nd/Heart | 4b50dfa6cbf87d32768f6c01b578bc1b23c18591 | [
"BSD-3-Clause"
] | 1 | 2016-05-14T09:22:26.000Z | 2016-05-14T09:22:26.000Z | heart/src/render/hPipelineStateDesc.cpp | JoJo2nd/Heart | 4b50dfa6cbf87d32768f6c01b578bc1b23c18591 | [
"BSD-3-Clause"
] | null | null | null | heart/src/render/hPipelineStateDesc.cpp | JoJo2nd/Heart | 4b50dfa6cbf87d32768f6c01b578bc1b23c18591 | [
"BSD-3-Clause"
] | null | null | null | /********************************************************************
Written by James Moran
Please see the file HEART_LICENSE.txt in the source's root directory.
*********************************************************************/
#include "render/hPipelineStateDesc.h"
#include "base/hMemoryUtil.h"
#include... | 28.08 | 145 | 0.56105 | [
"render"
] |
b515213c33630a6b2b036cbb2b0ecf8e4a12be3e | 3,343 | cc | C++ | packages/legacycomponents/mcstas2/lib/share/ref-lib.cc | mcvine/mcvine | 42232534b0c6af729628009bed165cd7d833789d | [
"BSD-3-Clause"
] | 5 | 2017-01-16T03:59:47.000Z | 2020-06-23T02:54:19.000Z | packages/legacycomponents/mcstas2/lib/share/ref-lib.cc | mcvine/mcvine | 42232534b0c6af729628009bed165cd7d833789d | [
"BSD-3-Clause"
] | 293 | 2015-10-29T17:45:52.000Z | 2022-01-07T16:31:09.000Z | packages/legacycomponents/mcstas2/lib/share/ref-lib.cc | mcvine/mcvine | 42232534b0c6af729628009bed165cd7d833789d | [
"BSD-3-Clause"
] | 1 | 2019-05-25T00:53:31.000Z | 2019-05-25T00:53:31.000Z | /****************************************************************************
*
* McStas, neutron ray-tracing package
* Copyright 1997-2006, All rights reserved
* Risoe National Laboratory, Roskilde, Denmark
* Institut Laue Langevin, Grenoble, France
*
* Library: share/ref-lib.c
*
* %Identificat... | 29.848214 | 106 | 0.532456 | [
"vector"
] |
dddfdb1cc03bf9ea95b07e50c11b4e1d1e507a0b | 21,582 | cc | C++ | tests/syntax_highlighter_test.cc | kev0960/md2 | f8480b664b1111f3f5d4b5202fb2b5db3ee434bd | [
"MIT"
] | 5 | 2021-01-27T03:55:00.000Z | 2022-03-07T02:35:37.000Z | tests/syntax_highlighter_test.cc | kev0960/md2 | f8480b664b1111f3f5d4b5202fb2b5db3ee434bd | [
"MIT"
] | null | null | null | tests/syntax_highlighter_test.cc | kev0960/md2 | f8480b664b1111f3f5d4b5202fb2b5db3ee434bd | [
"MIT"
] | null | null | null | #include "generators/asm_syntax_highlighter.h"
#include "generators/cpp_syntax_highlighter.h"
#include "generators/generator_context.h"
#include "generators/objdump_highlighter.h"
#include "generators/py_syntax_highlighter.h"
#include "generators/rust_syntax_highlighter.h"
#include "gtest/gtest.h"
#include "logger.h"
#... | 31.369186 | 97 | 0.509499 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.