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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0308f42528363987663d097e764d7249ded9cf85 | 960 | cc | C++ | http/http_request.cc | kianooshm/cpp-base | aa9722a73fc2dd73ad9278b560b4feb1565dbb7b | [
"Apache-2.0"
] | 2 | 2016-06-11T22:51:15.000Z | 2017-03-21T00:58:18.000Z | http/http_request.cc | kianooshm/cpp-base | aa9722a73fc2dd73ad9278b560b4feb1565dbb7b | [
"Apache-2.0"
] | null | null | null | http/http_request.cc | kianooshm/cpp-base | aa9722a73fc2dd73ad9278b560b4feb1565dbb7b | [
"Apache-2.0"
] | null | null | null | /*
* -
*
* Copyright 2011 David Parrish <david@dparrish.com>
*
* vim: sw=2 tw=120
*
*/
#include "cpp-base/http/http_request.h"
#include <string>
#include <vector>
using std::string;
namespace cpp_base {
bool HttpRequest::HasParam(const string &key) const {
for (const auto& param : uri.params) {
if (pa... | 21.333333 | 75 | 0.590625 | [
"vector"
] |
030d551601389df8d04e493e84723aa32a2d053f | 5,230 | cpp | C++ | qtmultimedia/src/imports/multimedia/qdeclarativecameraflash.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 | [
"Apache-2.0"
] | 1 | 2020-04-30T15:47:35.000Z | 2020-04-30T15:47:35.000Z | qtmultimedia/src/imports/multimedia/qdeclarativecameraflash.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 | [
"Apache-2.0"
] | null | null | null | qtmultimedia/src/imports/multimedia/qdeclarativecameraflash.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 | [
"Apache-2.0"
] | null | null | null | /****************************************************************************
**
** Copyright (C) 2015 The Qt Company Ltd.
** Contact: http://www.qt.io/licensing/
**
** This file is part of the plugins of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL21$
** Commercial License Usage
** Licensees holding valid commercial Q... | 35.821918 | 124 | 0.68566 | [
"object"
] |
0311cef285e533f69c0a6adf6f622aef961b4217 | 3,132 | ipp | C++ | ddsrouter_yaml/test/unittest/entities/address/test_units/YamlGetEntityAddressTest_get_address_ip.ipp | eProsima/DDS-Router | 59ff7e87acc718fad7ad9e38912100210675cbca | [
"Apache-2.0"
] | 25 | 2021-11-17T11:48:40.000Z | 2022-03-28T05:59:45.000Z | ddsrouter_yaml/test/unittest/entities/address/test_units/YamlGetEntityAddressTest_get_address_ip.ipp | eProsima/DDS-Router | 59ff7e87acc718fad7ad9e38912100210675cbca | [
"Apache-2.0"
] | 128 | 2021-11-16T11:38:59.000Z | 2022-03-25T10:32:12.000Z | ddsrouter_yaml/test/unittest/entities/address/test_units/YamlGetEntityAddressTest_get_address_ip.ipp | eProsima/DDS-Router | 59ff7e87acc718fad7ad9e38912100210675cbca | [
"Apache-2.0"
] | 4 | 2021-12-17T18:14:36.000Z | 2022-03-11T10:10:16.000Z | // Copyright 2022 Proyectos y Sistemas de Mantenimiento SL (eProsima).
//
// 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 re... | 29 | 104 | 0.574074 | [
"vector"
] |
031b68e73172c30e7e21fe0792c3b0bc4a06cac5 | 3,818 | cpp | C++ | framework/preprocess/GenerateAnchor.cpp | OAID/TengineFactory | 6276677c9eb2a0b145f6e663c05dbb1e4fb19050 | [
"Apache-2.0"
] | 70 | 2021-03-09T06:36:28.000Z | 2022-03-09T06:35:47.000Z | framework/preprocess/GenerateAnchor.cpp | FeiGeChuanShu/TengineFactory | 89524b8edc3fb6d00f60f12ebfcfdea985639e03 | [
"Apache-2.0"
] | 3 | 2021-03-12T11:08:57.000Z | 2021-04-21T02:18:45.000Z | framework/preprocess/GenerateAnchor.cpp | FeiGeChuanShu/TengineFactory | 89524b8edc3fb6d00f60f12ebfcfdea985639e03 | [
"Apache-2.0"
] | 20 | 2021-03-23T13:04:49.000Z | 2022-03-09T06:35:41.000Z | #include "GenerateAnchor.hpp"
namespace TFactory {
GenerateAnchor::GenerateAnchor(/* args */)
{
}
Anchor GenerateAnchor::GenerateDetectAnchor(Dataset *data)
{
Anchor result_anchor;
std::vector<std::vector<float>> featuremap_size;
std::vector<std::vector<float>> shrinkage_size;
std::vector<int> w_h_lis... | 38.18 | 127 | 0.514929 | [
"vector"
] |
031e2df5d9590eb829254ed7d4806cd83ef6b60e | 536 | hpp | C++ | Spaceliens/EntityManager.hpp | aclonegeek/Spaceliens | 4dd10bd1f70ebc405499e71be1369927c65dc02a | [
"MIT"
] | null | null | null | Spaceliens/EntityManager.hpp | aclonegeek/Spaceliens | 4dd10bd1f70ebc405499e71be1369927c65dc02a | [
"MIT"
] | 1 | 2016-08-11T21:22:09.000Z | 2020-09-22T01:41:13.000Z | Spaceliens/EntityManager.hpp | aclonegeek/Spaceliens | 4dd10bd1f70ebc405499e71be1369927c65dc02a | [
"MIT"
] | null | null | null | #pragma once
#include <map>
#include <memory>
#include <vector>
#include "Entity.hpp"
class EntityManager {
public:
EntityManager(sf::RenderWindow& window);
void add(const std::string& name, std::unique_ptr<Entity> entity);
bool exists(const std::string& name);
void remove();
void update(const sf::Time& dt);
v... | 23.304348 | 67 | 0.727612 | [
"vector"
] |
031f6cf57e5ac7228849b8ccc5363d77972377b5 | 2,724 | hpp | C++ | engine/core/asset/image.hpp | warnwar/KestrelEngine | 985d1664b71aad62dd51721e0f81d5937d8ae9d4 | [
"MIT"
] | 47 | 2020-09-14T04:11:09.000Z | 2022-01-21T03:15:35.000Z | engine/core/asset/image.hpp | warnwar/KestrelEngine | 985d1664b71aad62dd51721e0f81d5937d8ae9d4 | [
"MIT"
] | 19 | 2020-09-30T19:04:19.000Z | 2021-12-21T03:41:22.000Z | engine/core/asset/image.hpp | warnwar/KestrelEngine | 985d1664b71aad62dd51721e0f81d5937d8ae9d4 | [
"MIT"
] | 3 | 2020-09-30T19:00:09.000Z | 2021-03-08T08:41:02.000Z | // Copyright (c) 2020 Tom Hancocks
//
// 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, publish, ... | 40.656716 | 127 | 0.720999 | [
"object",
"vector"
] |
0320bea5f95128a961c83ef789996e53fa9640d5 | 1,047 | cpp | C++ | DirectX3D11/Scenes/TerrainScene.cpp | GyumLee/DirectX3D11 | 6158874aa12e790747e6fd8a53de608071c49574 | [
"Apache-2.0"
] | null | null | null | DirectX3D11/Scenes/TerrainScene.cpp | GyumLee/DirectX3D11 | 6158874aa12e790747e6fd8a53de608071c49574 | [
"Apache-2.0"
] | null | null | null | DirectX3D11/Scenes/TerrainScene.cpp | GyumLee/DirectX3D11 | 6158874aa12e790747e6fd8a53de608071c49574 | [
"Apache-2.0"
] | null | null | null | #include "Framework.h"
#include "TerrainScene.h"
TerrainScene::TerrainScene()
{
terrain = new Terrain();
terrain->GetMaterial()->Load("TextData/Materials/Dirt2.mat");
sphere = new Sphere();
sphere->GetMaterial()->Load("TextData/Materials/FieldStone.mat");
sphere->Load();
destPos = sphere->position;
}
TerrainS... | 16.619048 | 66 | 0.690544 | [
"render"
] |
03220af39b930d3ca41805246ee3f95ef007b255 | 13,368 | cpp | C++ | secure-indices/tests/AggTreeUnitTest.cpp | ucbrise/waldo | d435d7f447a36b5d000f45ff1b0c73747c1d7aa2 | [
"Apache-2.0"
] | 7 | 2021-12-19T11:31:06.000Z | 2022-03-01T04:19:51.000Z | secure-indices/tests/AggTreeUnitTest.cpp | ucbrise/waldo | d435d7f447a36b5d000f45ff1b0c73747c1d7aa2 | [
"Apache-2.0"
] | null | null | null | secure-indices/tests/AggTreeUnitTest.cpp | ucbrise/waldo | d435d7f447a36b5d000f45ff1b0c73747c1d7aa2 | [
"Apache-2.0"
] | null | null | null | #include "secure-indices/core/players.h"
#include <string>
using namespace std;
//using namespace osuCrypto;
using namespace dorydb;
//#define VERBOSE_PRINT
bool malicious = true;
int mac_factor = malicious ? 2 : 1;
void copy_keys_to_server(clkey* ckey, svkey* s0key, svkey* s1key){
uint64_t dpf_size = ckey->dpf... | 42.170347 | 266 | 0.608019 | [
"vector"
] |
03227a4c743827314111fd4e3313e88134f0c8cf | 1,180 | cpp | C++ | lib/libcpp/Mesh/meshvisitorinterface.cpp | beckerrh/simfemsrc | d857eb6f6f8627412d4f9d89a871834c756537db | [
"MIT"
] | null | null | null | lib/libcpp/Mesh/meshvisitorinterface.cpp | beckerrh/simfemsrc | d857eb6f6f8627412d4f9d89a871834c756537db | [
"MIT"
] | 1 | 2019-01-31T10:59:11.000Z | 2019-01-31T10:59:11.000Z | lib/libcpp/Mesh/meshvisitorinterface.cpp | beckerrh/simfemsrc | d857eb6f6f8627412d4f9d89a871834c756537db | [
"MIT"
] | null | null | null | #include "Mesh/meshvisitorinterface.hpp"
#include <cassert>
using namespace mesh;
/*--------------------------------------------------------------------------*/
MeshVisitorInterface::~MeshVisitorInterface() {}
MeshVisitorInterface::MeshVisitorInterface(): alat::InterfaceBase(){}
MeshVisitorInterface::MeshVisitorInt... | 51.304348 | 239 | 0.700847 | [
"mesh"
] |
0323db8e251b4fec5c4581b8c5391015e90df288 | 697 | cpp | C++ | crack-data-structures-and-algorithms/leetcode/gas_station_q134.cpp | Watch-Later/Eureka | 3065e76d5bf8b37d5de4f9ee75b2714a42dd4c35 | [
"MIT"
] | 20 | 2016-05-16T11:09:04.000Z | 2021-12-08T09:30:33.000Z | crack-data-structures-and-algorithms/leetcode/gas_station_q134.cpp | Watch-Later/Eureka | 3065e76d5bf8b37d5de4f9ee75b2714a42dd4c35 | [
"MIT"
] | 1 | 2018-12-30T09:55:31.000Z | 2018-12-30T14:08:30.000Z | crack-data-structures-and-algorithms/leetcode/gas_station_q134.cpp | Watch-Later/Eureka | 3065e76d5bf8b37d5de4f9ee75b2714a42dd4c35 | [
"MIT"
] | 11 | 2016-05-02T09:17:12.000Z | 2021-12-08T09:30:35.000Z | #include <vector>
using namespace std;
// 核心思路
// 使用两个累计变量跟踪油量和旅途消耗差值
// total: 全局的 gas[i] - cost[i]；要能跑完一圈，总量肯定要至少不小于0
// accum: 从起点开始的累计 gas[i] - cost[i]；如果对某个station i，导致accum < 0
// 那么说明从[start, i] 之间的加油站都不能作为起点；这个时候只能尝试i+1为起点的case
class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>&... | 24.892857 | 65 | 0.516499 | [
"vector"
] |
032812f56fa9cffdf72211acc9bca8b4e88ffe9f | 6,160 | hpp | C++ | lib/stages/frbNetworkProcess.hpp | james-s-willis/kotekan | 155e874bb039702cec72c1785362a017548aa00a | [
"MIT"
] | null | null | null | lib/stages/frbNetworkProcess.hpp | james-s-willis/kotekan | 155e874bb039702cec72c1785362a017548aa00a | [
"MIT"
] | null | null | null | lib/stages/frbNetworkProcess.hpp | james-s-willis/kotekan | 155e874bb039702cec72c1785362a017548aa00a | [
"MIT"
] | null | null | null | /**
* @file frbNetworkProcess.hpp
* @brief Network transmission stage for FRB obs
* - frbNetworkProcess : public kotekan::Stage
*/
#ifndef FRBNETWORKPROCESS_HPP
#define FRBNETWORKPROCESS_HPP
#include "Stage.hpp"
#include "buffer.h"
#include "restServer.hpp"
#include <atomic>
#include <functional>
#include <stri... | 34.222222 | 100 | 0.717208 | [
"vector"
] |
03348698269ca9ae660337cee7bdd26a128bd1a2 | 894 | cpp | C++ | examples/reverse/example-reverse-gradient-derivatives-using-eigen.cpp | pariterre/autodiff | 62586497b621fd6296e060162394f849d0dea1fb | [
"MIT"
] | null | null | null | examples/reverse/example-reverse-gradient-derivatives-using-eigen.cpp | pariterre/autodiff | 62586497b621fd6296e060162394f849d0dea1fb | [
"MIT"
] | null | null | null | examples/reverse/example-reverse-gradient-derivatives-using-eigen.cpp | pariterre/autodiff | 62586497b621fd6296e060162394f849d0dea1fb | [
"MIT"
] | 1 | 2019-11-22T08:36:38.000Z | 2019-11-22T08:36:38.000Z | // C++ includes
#include <iostream>
using namespace std;
// Eigen includes
#include <eigen3/Eigen/Core>
using namespace Eigen;
// autodiff include
#include <autodiff/reverse.hpp>
#include <autodiff/reverse/eigen.hpp>
using namespace autodiff;
// The scalar function for which the gradient is needed
var f(const Vector... | 27.9375 | 87 | 0.577181 | [
"vector"
] |
03493f4d44b665638e4bac9fad349ec3bf49ce15 | 1,338 | hpp | C++ | pomegranate/graphics/color.hpp | alexa-griffin/sycamore | 4d2608cbbf56cde1828b6bf0350012c6d8d84896 | [
"Apache-2.0"
] | null | null | null | pomegranate/graphics/color.hpp | alexa-griffin/sycamore | 4d2608cbbf56cde1828b6bf0350012c6d8d84896 | [
"Apache-2.0"
] | null | null | null | pomegranate/graphics/color.hpp | alexa-griffin/sycamore | 4d2608cbbf56cde1828b6bf0350012c6d8d84896 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "base.hpp"
#include "maths/vector.hpp"
#include <cmath>
namespace pom {
/// @addtogroup graphics
/// @{
/// Standard shader parsable color. `r` `g` `b` and `a` are the channels, where 0.0f is the minimum value and 1.0f
/// is the maximum value for a given channel.
struct Co... | 27.875 | 120 | 0.493274 | [
"vector"
] |
034a8bdc134868977e06916e55ad3324a18b4cf8 | 4,919 | hpp | C++ | AudioKit/Core/AudioKitCore/Common/ADSREnvelope.hpp | niklassaers/AudioKit | 26c559128751ef95f56366cfabd0ac9edf16cbb8 | [
"MIT"
] | 1 | 2019-11-17T09:02:32.000Z | 2019-11-17T09:02:32.000Z | AudioKit/Core/AudioKitCore/Common/ADSREnvelope.hpp | niklassaers/AudioKit | 26c559128751ef95f56366cfabd0ac9edf16cbb8 | [
"MIT"
] | null | null | null | AudioKit/Core/AudioKitCore/Common/ADSREnvelope.hpp | niklassaers/AudioKit | 26c559128751ef95f56366cfabd0ac9edf16cbb8 | [
"MIT"
] | null | null | null | //
// ADSREnvelope.hpp
// AudioKit Core
//
// Created by Shane Dunne, revision history on Github.
// Copyright © 2018 AudioKit. All rights reserved.
//
#pragma once
#include "LinearRamper.hpp"
#include "FunctionTable.hpp"
namespace AudioKitCore
{
/// many ADSREnvelopes can share a common set of parameters
... | 33.013423 | 123 | 0.56048 | [
"shape"
] |
035cbd34391e1708ae12d1049d4cfe6c5cf1bd6b | 8,069 | cc | C++ | test/nosync/lines-reader-test.cc | nokia/libNoSync | af0f0e5b738feac8c42c357c9dbdf3dc7e541a76 | [
"BSD-3-Clause"
] | 2 | 2018-04-28T18:29:08.000Z | 2018-07-03T08:16:34.000Z | test/nosync/lines-reader-test.cc | nokia/libNoSync | af0f0e5b738feac8c42c357c9dbdf3dc7e541a76 | [
"BSD-3-Clause"
] | null | null | null | test/nosync/lines-reader-test.cc | nokia/libNoSync | af0f0e5b738feac8c42c357c9dbdf3dc7e541a76 | [
"BSD-3-Clause"
] | 1 | 2018-04-27T07:53:16.000Z | 2018-04-27T07:53:16.000Z | // This file is part of libnosync library. See LICENSE file for license details.
#include <cstddef>
#include <gmock/gmock.h>
#include <gtest/gtest.h>
#include <memory>
#include <nosync/bytes-reader-mock.h>
#include <nosync/const-bytes-reader.h>
#include <nosync/event-loop-utils.h>
#include <nosync/event-loop.h>
#includ... | 32.800813 | 113 | 0.684471 | [
"vector"
] |
035e14fbe2f2c74241d0266bc7d9040c51ecd3b1 | 16,500 | hpp | C++ | reef-env/rocclr/device/pal/palgpuopen.hpp | SJTU-IPADS/reef-artifacts | 8750974f2d6655525a2cc317bf2471914fe68dab | [
"Apache-2.0"
] | 7 | 2022-03-23T07:04:20.000Z | 2022-03-30T02:44:42.000Z | reef-env/rocclr/device/pal/palgpuopen.hpp | SJTU-IPADS/reef-artifacts | 8750974f2d6655525a2cc317bf2471914fe68dab | [
"Apache-2.0"
] | null | null | null | reef-env/rocclr/device/pal/palgpuopen.hpp | SJTU-IPADS/reef-artifacts | 8750974f2d6655525a2cc317bf2471914fe68dab | [
"Apache-2.0"
] | null | null | null | /* Copyright (c) 2016-present Advanced Micro Devices, 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 limitation the rights
to use, copy, modify, me... | 39.568345 | 106 | 0.688545 | [
"object",
"vector"
] |
03626baa6c977449975da165d9f4cce5e54e372b | 310 | hpp | C++ | src/ai.hpp | jgke/putkijuoksu | bf34eb707a7a5681341940ec203aec9b42f75bc7 | [
"MIT"
] | null | null | null | src/ai.hpp | jgke/putkijuoksu | bf34eb707a7a5681341940ec203aec9b42f75bc7 | [
"MIT"
] | null | null | null | src/ai.hpp | jgke/putkijuoksu | bf34eb707a7a5681341940ec203aec9b42f75bc7 | [
"MIT"
] | null | null | null | #ifndef AI_HPP
#define AI_HPP
#include "coord.hpp"
#include "qtree.hpp"
class Searcher {
public:
Searcher();
void tick(Qtree<char> &level, GLCoord target);
void render();
private:
GLCoord pos;
GLCoord delta;
Coord target;
int movec;
};
#endif
| 15.5 | 54 | 0.577419 | [
"render"
] |
24eca2fced4bed801c5713d4bb4aa36929ee9770 | 38,537 | cpp | C++ | src/maple_me/src/irmap.cpp | harmonyos-mirror/OpenArkCompiler-test | 1755550ea22eb185cbef8cc5864fa273caebf95a | [
"MulanPSL-1.0"
] | 796 | 2019-08-30T16:20:33.000Z | 2021-12-25T14:45:06.000Z | src/maple_me/src/irmap.cpp | harmonyos-mirror/OpenArkCompiler-test | 1755550ea22eb185cbef8cc5864fa273caebf95a | [
"MulanPSL-1.0"
] | 16 | 2019-08-30T18:04:08.000Z | 2021-09-19T05:02:58.000Z | src/maple_me/src/irmap.cpp | harmonyos-mirror/OpenArkCompiler-test | 1755550ea22eb185cbef8cc5864fa273caebf95a | [
"MulanPSL-1.0"
] | 326 | 2019-08-30T16:11:29.000Z | 2021-11-26T12:31:17.000Z | /*
* Copyright (c) [2019-2020] Huawei Technologies Co.,Ltd.All rights reserved.
*
* OpenArkCompiler is licensed under the Mulan PSL v1.
* You can use this software according to the terms and conditions of the Mulan PSL v1.
* You may obtain a copy of Mulan PSL v1 at:
*
* http://license.coscl.org.cn/MulanPSL
... | 39.85212 | 118 | 0.71469 | [
"vector"
] |
24f462859d0247b22538637fea3fcba3cb4bab3d | 858 | cpp | C++ | kernel/source/interactive/acroform/AcroFormSignatureSVMDPDictionary.cpp | Hydrorastaman/PDFOut-SDK | 329e08068f96c1623493ed4ddb292a333f668762 | [
"MIT"
] | 4 | 2021-03-23T15:04:08.000Z | 2021-08-28T08:08:14.000Z | kernel/source/interactive/acroform/AcroFormSignatureSVMDPDictionary.cpp | Hydrorastaman/PDFOut-SDK | 329e08068f96c1623493ed4ddb292a333f668762 | [
"MIT"
] | null | null | null | kernel/source/interactive/acroform/AcroFormSignatureSVMDPDictionary.cpp | Hydrorastaman/PDFOut-SDK | 329e08068f96c1623493ed4ddb292a333f668762 | [
"MIT"
] | null | null | null | #include <interactive/acroform/AcroFormSignatureSVMDPDictionary.h>
namespace{
std::string const keyP = "P";
}
namespace kernel{ namespace interactive{
std::unordered_map<AcroFormSignatureSVMDPDictionaryKey, std::pair<std::string, uint32_t>> AcroFormSignatureSVMDPDictionary::mAcroFormSignatureSVMDPDiction... | 35.75 | 164 | 0.786713 | [
"object"
] |
24fd6c4d82c276b0d0f91673bb02e63125a6f8dc | 5,116 | cc | C++ | src/ComponentBased/BaseComponents.cc | 3DExtended/Dreamroam | c924715cdb77965e352f2748911944c28bd8e464 | [
"MIT"
] | 1 | 2020-08-13T12:00:02.000Z | 2020-08-13T12:00:02.000Z | src/ComponentBased/BaseComponents.cc | 3DExtended/Dreamroam | c924715cdb77965e352f2748911944c28bd8e464 | [
"MIT"
] | 4 | 2020-07-20T18:28:08.000Z | 2020-09-27T09:56:10.000Z | src/ComponentBased/BaseComponents.cc | 3DExtended/Dreamroam | c924715cdb77965e352f2748911944c28bd8e464 | [
"MIT"
] | 2 | 2020-08-16T23:24:17.000Z | 2020-10-09T10:42:19.000Z | #include "BaseComponents.hh"
#include <Utils/Base.hh>
using namespace DCore::ComponentSystem;
glm::mat4 TransformComponent::getModelMatrix() {
// TODO make it possible to set a parent on the entity
#if 0
if (parent != nullptr)
{
return getPosMatrix() * getRotationMatrix() * getScaleMatrix() * par... | 36.805755 | 98 | 0.583659 | [
"object"
] |
7001931d87ba50a86fa4f83ccd8a9b73635f4c51 | 412 | cpp | C++ | Day-17/Day-17-Codeforces/34B-Sale.cpp | LawranceMichaelite/100-Days-of-Code | de80015c2ab7c94956d4fe39f6e143627cdd7bc9 | [
"Apache-2.0"
] | null | null | null | Day-17/Day-17-Codeforces/34B-Sale.cpp | LawranceMichaelite/100-Days-of-Code | de80015c2ab7c94956d4fe39f6e143627cdd7bc9 | [
"Apache-2.0"
] | null | null | null | Day-17/Day-17-Codeforces/34B-Sale.cpp | LawranceMichaelite/100-Days-of-Code | de80015c2ab7c94956d4fe39f6e143627cdd7bc9 | [
"Apache-2.0"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin >> n >>m ;
vector<int>arr(n);
for(int i = 0 ; i < n ; i++)
cin >> arr[i];
sort(arr.begin(),arr.end());
auto i = arr.begin();
int ans = 0;
int carry = 0;
while(i != arr.end() && *i <= 0 && carry < m)
{
... | 17.166667 | 49 | 0.434466 | [
"vector"
] |
700228df5a68a321a87ce1e53bc780f02cefb92a | 11,960 | cpp | C++ | src/shared_library/markdown/markdown.cpp | snowmeltarcade/projectfarm | 6a35330f63bff06465c4ee1a0fbc5277c0d22982 | [
"MIT"
] | null | null | null | src/shared_library/markdown/markdown.cpp | snowmeltarcade/projectfarm | 6a35330f63bff06465c4ee1a0fbc5277c0d22982 | [
"MIT"
] | 7 | 2021-05-30T21:52:39.000Z | 2021-06-25T22:35:28.000Z | src/shared_library/markdown/markdown.cpp | snowmeltarcade/projectfarm | 6a35330f63bff06465c4ee1a0fbc5277c0d22982 | [
"MIT"
] | null | null | null | #include <unordered_map>
#include <stack>
#include "markdown.h"
namespace projectfarm::shared::markdown
{
auto ReadColor(std::uint32_t& index,
std::string_view text,
const shared::graphics::colors::Color& defaultColor) noexcept
-> std::pair<shared::graphics::colors::C... | 30.510204 | 122 | 0.426338 | [
"vector"
] |
70026187ba6329a0534c29d6e8c2f6e4334cf4f9 | 556 | cc | C++ | Greedy/JumpGame2.cc | plantree/LeetCode | 0ac6734b6a4c6e826df15a3d2e43e8f8df92a510 | [
"MIT"
] | null | null | null | Greedy/JumpGame2.cc | plantree/LeetCode | 0ac6734b6a4c6e826df15a3d2e43e8f8df92a510 | [
"MIT"
] | null | null | null | Greedy/JumpGame2.cc | plantree/LeetCode | 0ac6734b6a4c6e826df15a3d2e43e8f8df92a510 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
int max(int x, int y) {
return x > y ? x : y;
}
int jump(vector<int>& nums) {
if (nums.empty()) {
return 0;
}
int res = 0, n = nums.size(), i = 0, cur = 0;
while (cur < n-1) {
res++;
int pre = cur;
for (; i... | 17.935484 | 49 | 0.429856 | [
"vector"
] |
700a3cc4543611e3393f7302639fd41dc7c216f3 | 15,827 | cpp | C++ | NOLF/ObjectDLL/ObjectRemover.cpp | haekb/nolf1-modernizer | 25bac3d43c40a83b8e90201a70a14ef63b4240e7 | [
"Unlicense"
] | 38 | 2019-09-16T14:46:42.000Z | 2022-03-10T20:28:10.000Z | NOLF/ObjectDLL/ObjectRemover.cpp | haekb/nolf1-modernizer | 25bac3d43c40a83b8e90201a70a14ef63b4240e7 | [
"Unlicense"
] | 39 | 2019-08-12T01:35:33.000Z | 2022-02-28T16:48:16.000Z | NOLF/ObjectDLL/ObjectRemover.cpp | haekb/nolf1-modernizer | 25bac3d43c40a83b8e90201a70a14ef63b4240e7 | [
"Unlicense"
] | 6 | 2019-09-17T12:49:18.000Z | 2022-03-10T20:28:12.000Z | // ----------------------------------------------------------------------- //
//
// MODULE : ObjectRemover.h
//
// PURPOSE : ObjectRemover - Implementation
//
// CREATED : 04.23.1999
//
// ----------------------------------------------------------------------- //
#include "stdafx.h"
#include "ObjectRemover.h"
#includ... | 36.636574 | 100 | 0.699059 | [
"object"
] |
701e5d40d761883e1b66f0fd644834ff698862f7 | 3,093 | cpp | C++ | torch/lib/c10d/test/ProcessGroupMPITest.cpp | DavidKo3/mctorch | 53ffe61763059677978b4592c8b2153b0c15428f | [
"BSD-3-Clause"
] | 1 | 2019-07-21T02:13:22.000Z | 2019-07-21T02:13:22.000Z | torch/lib/c10d/test/ProcessGroupMPITest.cpp | DavidKo3/mctorch | 53ffe61763059677978b4592c8b2153b0c15428f | [
"BSD-3-Clause"
] | null | null | null | torch/lib/c10d/test/ProcessGroupMPITest.cpp | DavidKo3/mctorch | 53ffe61763059677978b4592c8b2153b0c15428f | [
"BSD-3-Clause"
] | null | null | null | #include <cstdlib>
#include <iostream>
#include <sstream>
#include <string>
#include <thread>
#include <unistd.h>
#include <c10d/ProcessGroupMPI.hpp>
#define STR_HELPER(x) #x
#define STR(x) STR_HELPER(x)
void testAllreduce(int iter = 1000) {
auto pg = c10d::ProcessGroupMPI::createProcessGroupMPI();
// Generate ... | 27.131579 | 78 | 0.587456 | [
"vector"
] |
70200c0e51b10be3ea709e8dbf2ab205ce892b3b | 2,776 | cpp | C++ | src/plugins/cgal/nodes/selection/logical_op.cpp | martin-pr/possumwood | 0ee3e0fe13ef27cf14795a79fb497e4d700bef63 | [
"MIT"
] | 232 | 2017-10-09T11:45:28.000Z | 2022-03-28T11:14:46.000Z | src/plugins/cgal/nodes/selection/logical_op.cpp | martin-pr/possumwood | 0ee3e0fe13ef27cf14795a79fb497e4d700bef63 | [
"MIT"
] | 26 | 2019-01-20T21:38:25.000Z | 2021-10-16T03:57:17.000Z | src/plugins/cgal/nodes/selection/logical_op.cpp | martin-pr/possumwood | 0ee3e0fe13ef27cf14795a79fb497e4d700bef63 | [
"MIT"
] | 33 | 2017-10-26T19:20:38.000Z | 2022-03-16T11:21:43.000Z | #include <possumwood_sdk/datatypes/enum.h>
#include <possumwood_sdk/node_implementation.h>
#include "datatypes/meshes.h"
#include "datatypes/selection.h"
#include "errors.h"
namespace {
using possumwood::CGALPolyhedron;
using possumwood::FaceSelection;
using possumwood::Meshes;
typedef possumwood::CGALPolyhedron Me... | 31.191011 | 116 | 0.714697 | [
"mesh",
"vector"
] |
702443e68194b5397902f0312110f58706073c81 | 4,075 | cpp | C++ | Sources/Elastos/LibCore/src/org/xml/sax/helpers/CAttributeListImpl.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 7 | 2017-07-13T10:34:54.000Z | 2021-04-16T05:40:35.000Z | Sources/Elastos/LibCore/src/org/xml/sax/helpers/CAttributeListImpl.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | null | null | null | Sources/Elastos/LibCore/src/org/xml/sax/helpers/CAttributeListImpl.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 9 | 2017-07-13T12:33:20.000Z | 2021-06-19T02:46:48.000Z | //=========================================================================
// Copyright (C) 2012 The Elastos Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// ... | 20.073892 | 84 | 0.588712 | [
"object"
] |
702d7c99a49cc00769fcfbc7bec674e2300be5eb | 22,945 | cc | C++ | src/HistTool.cc | zhenbinwu/SuperTopTagger | 82376d028e341ab79c498cb02a2eb43c6ec23ec6 | [
"MIT"
] | null | null | null | src/HistTool.cc | zhenbinwu/SuperTopTagger | 82376d028e341ab79c498cb02a2eb43c6ec23ec6 | [
"MIT"
] | null | null | null | src/HistTool.cc | zhenbinwu/SuperTopTagger | 82376d028e341ab79c498cb02a2eb43c6ec23ec6 | [
"MIT"
] | null | null | null | // ===========================================================================
//
// Filename: HistTool.hh
//
// Description: A helpful class to handle the histograms
//
// Version: 1.0
// Created: 05/29/2013 02:19:25 PM
// Revision: none
// Compiler: g++
//
// Autho... | 36.133858 | 98 | 0.486293 | [
"vector"
] |
7042c6c33c20926fe98d00f04afc91ab18e08e28 | 6,418 | cpp | C++ | ddot/alignOntology/alignOntology.cpp | pupster90/ddot2 | 1952bff30383b35dff72b332592e1471201d40f3 | [
"MIT"
] | 15 | 2018-07-11T07:59:53.000Z | 2022-01-10T20:20:42.000Z | ddot/alignOntology/alignOntology.cpp | pupster90/ddot2 | 1952bff30383b35dff72b332592e1471201d40f3 | [
"MIT"
] | 6 | 2018-10-23T11:35:49.000Z | 2022-02-09T00:11:50.000Z | ddot/alignOntology/alignOntology.cpp | pupster90/ddot2 | 1952bff30383b35dff72b332592e1471201d40f3 | [
"MIT"
] | 9 | 2018-05-15T06:15:12.000Z | 2022-01-10T20:20:44.000Z | #include <iostream>
#include <time.h>
#include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/io.hpp>
#include <stdlib.h>
#include "graph.h"
#include "alignmentUtils.h"
int main(int argc, char* argv[]) {
if (argc < 5) {
cout << "Needs 4 arguments - ontologyComputed, referenceOntology, minimum sim... | 36.259887 | 218 | 0.634933 | [
"vector"
] |
70484f06c2ce43194adeb18ed007ea12f21556c6 | 13,130 | hxx | C++ | src/engine/ivp/ivp_collision/ivp_compact_ledge_solver.hxx | cstom4994/SourceEngineRebuild | edfd7f8ce8af13e9d23586318350319a2e193c08 | [
"MIT"
] | 6 | 2022-01-23T09:40:33.000Z | 2022-03-20T20:53:25.000Z | src/engine/ivp/ivp_collision/ivp_compact_ledge_solver.hxx | cstom4994/SourceEngineRebuild | edfd7f8ce8af13e9d23586318350319a2e193c08 | [
"MIT"
] | null | null | null | src/engine/ivp/ivp_collision/ivp_compact_ledge_solver.hxx | cstom4994/SourceEngineRebuild | edfd7f8ce8af13e9d23586318350319a2e193c08 | [
"MIT"
] | 1 | 2022-02-06T21:05:23.000Z | 2022-02-06T21:05:23.000Z | // Copyright (C) Ipion Software GmbH 1999-2000. All rights reserved.
#ifdef SUN4
# define IVP_STATIC_INLINE inline
# define IVP_STATIC
#else
# define IVP_STATIC_INLINE static inline
# define IVP_STATIC static
#endif
#define IVP_MAGIC_INERTIA_RADIUS 100.0f // for ill calculated inertias use this default radius
#i... | 43.190789 | 132 | 0.592993 | [
"object",
"vector"
] |
704be60f9c04f2118f0df55dbad00b393cd56820 | 2,064 | cpp | C++ | STL/NonModifyingAlgorithms/search-find_end.cpp | NibiruCpp/CppCert | 8de7fa61f0327a6f0ed6a0ee1663235e55277cca | [
"MIT"
] | 1 | 2016-10-27T15:06:34.000Z | 2016-10-27T15:06:34.000Z | STL/NonModifyingAlgorithms/search-find_end.cpp | NibiruCpp/CppCert | 8de7fa61f0327a6f0ed6a0ee1663235e55277cca | [
"MIT"
] | null | null | null | STL/NonModifyingAlgorithms/search-find_end.cpp | NibiruCpp/CppCert | 8de7fa61f0327a6f0ed6a0ee1663235e55277cca | [
"MIT"
] | null | null | null | /*
Both functions search a given range of elements (last, first) for the presence of sequence of elements
specified by iterators s_first and s_last. search() algorithm will return an iterator to the first
occurrence of the sequence s_first, s_last, whereas the find_end() function will return an iterator
to the last ... | 37.527273 | 103 | 0.70155 | [
"object",
"vector"
] |
704e241be726b12d25739d3a875d8a1b4286ad0f | 2,478 | cpp | C++ | src/module/HardwareIO/Muscle/Muscle.cpp | tayloryoung6396/FYP | 3ad6589fa67f89d5522510aeea7cfa433530d398 | [
"MIT"
] | null | null | null | src/module/HardwareIO/Muscle/Muscle.cpp | tayloryoung6396/FYP | 3ad6589fa67f89d5522510aeea7cfa433530d398 | [
"MIT"
] | null | null | null | src/module/HardwareIO/Muscle/Muscle.cpp | tayloryoung6396/FYP | 3ad6589fa67f89d5522510aeea7cfa433530d398 | [
"MIT"
] | null | null | null | #include "Muscle.hpp"
#include <stdint.h>
#include <iostream>
#include <vector>
#include "utility/io/gpio.hpp"
#include "utility/io/uart.hpp"
#include "utility/math/median.hpp"
namespace module {
namespace HardwareIO {
Muscle::Muscle(module::HardwareIO::muscle_t muscle)
: valve(muscle.valve)
... | 33.04 | 121 | 0.560533 | [
"vector"
] |
704f4dc07647dc8f830d13c51bf47291913061ed | 1,227 | cpp | C++ | Sorting and Searching/Factory_Machines.cpp | hamzahasbi/my-cses | fe5a92b9ff126d6a4fbd7b4c61538f32c9ee4f80 | [
"MIT"
] | 3 | 2021-03-28T22:29:20.000Z | 2021-03-29T13:25:54.000Z | Sorting and Searching/Factory_Machines.cpp | hamzahasbi/my-cses | fe5a92b9ff126d6a4fbd7b4c61538f32c9ee4f80 | [
"MIT"
] | null | null | null | Sorting and Searching/Factory_Machines.cpp | hamzahasbi/my-cses | fe5a92b9ff126d6a4fbd7b4c61538f32c9ee4f80 | [
"MIT"
] | null | null | null | /*
Author: Hamza Hasbi
@Copyrights: __Morty
*/
#include<bits/stdc++.h>
#ifdef ONLINE_JUDGE
#pragma GCC optimize("O3")
#endif
#define ll long long
#define ld long double
#define ull unsigned long long
#define uld unsigned long double
#define ud unsigned double
#define uf unsigned float
#define pi 2 * acos(0.0)
#defin... | 17.528571 | 92 | 0.577832 | [
"vector"
] |
70529ab71cf72796ee5a8656846f910030d8cb03 | 944 | cpp | C++ | src/Renderer/Buffer.cpp | kettlekern/raytracer-kettlekern | 27a8df15a2e5b629b7491e5852d83ef273eed7cb | [
"MIT"
] | null | null | null | src/Renderer/Buffer.cpp | kettlekern/raytracer-kettlekern | 27a8df15a2e5b629b7491e5852d83ef273eed7cb | [
"MIT"
] | null | null | null | src/Renderer/Buffer.cpp | kettlekern/raytracer-kettlekern | 27a8df15a2e5b629b7491e5852d83ef273eed7cb | [
"MIT"
] | null | null | null | #include "Buffer.h"
using namespace std;
void Buffer::push_back(FragmentOutput & frag) {
fragBuffer.push_back(frag);
}
//This functions leaks memory, but since it is only ever called at the end of a program I don't have to care for now
unsigned char* Buffer::toArray(){
//make_shared does not support arrays until c... | 42.909091 | 148 | 0.709746 | [
"vector"
] |
705cad7694c64ffb4aeff8cd643e1aeb9a3cd8c0 | 717 | cpp | C++ | LeetCode/Problems/Algorithms/#1429_FirstUniqueNumber_sol1_map_660ms_82.8MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | 1 | 2022-01-26T14:50:07.000Z | 2022-01-26T14:50:07.000Z | LeetCode/Problems/Algorithms/#1429_FirstUniqueNumber_sol1_map_660ms_82.8MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | LeetCode/Problems/Algorithms/#1429_FirstUniqueNumber_sol1_map_660ms_82.8MB.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | class FirstUnique {
private:
queue<int> q;
map<int, int> cnt;
public:
FirstUnique(vector<int>& nums) {
for(int num: nums){
q.push(num);
++cnt[num];
}
}
int showFirstUnique() {
while(!q.empty() && cnt[q.front()] >= 2){
... | 20.485714 | 68 | 0.458856 | [
"object",
"vector"
] |
705eb16a8ce49d1f810cbf164207319d50473a81 | 5,292 | cc | C++ | tests/structure_test.cc | scylla-zpp-blas/linear-algebra | 823fe4085fdac992ed9695416d9a38d2cf6908d8 | [
"Apache-2.0"
] | 2 | 2021-09-07T18:36:37.000Z | 2021-10-01T19:23:30.000Z | tests/structure_test.cc | scylla-zpp-blas/linear-algebra | 823fe4085fdac992ed9695416d9a38d2cf6908d8 | [
"Apache-2.0"
] | 16 | 2020-12-19T18:10:34.000Z | 2021-06-14T18:06:17.000Z | tests/structure_test.cc | scylla-zpp-blas/linear-algebra | 823fe4085fdac992ed9695416d9a38d2cf6908d8 | [
"Apache-2.0"
] | null | null | null | #include <boost/test/unit_test.hpp>
#include "scylla_blas/queue/scylla_queue.hh"
#include "scylla_blas/matrix.hh"
#include "scylla_blas/vector.hh"
#include "scylla_blas/config.hh"
#include "fixture.hh"
BOOST_FIXTURE_TEST_SUITE(structure_tests, scylla_fixture)
BOOST_AUTO_TEST_CASE(matrices)
{
scylla_blas::matrix<... | 33.075 | 116 | 0.657596 | [
"vector"
] |
0ad537171f0ecadcbf72aface73c0ec490e8cc2b | 11,727 | cpp | C++ | TommyGun/Plugins/ImageEditor/ScreenImage/fScreenType.cpp | tonyt73/TommyGun | 2c2ffae3dcd5dc25fd64d68a9f4cc96d99a1cd36 | [
"BSD-3-Clause"
] | 34 | 2017-05-08T18:39:13.000Z | 2022-02-13T05:05:33.000Z | TommyGun/Plugins/ImageEditor/ScreenImage/fScreenType.cpp | tonyt73/TommyGun | 2c2ffae3dcd5dc25fd64d68a9f4cc96d99a1cd36 | [
"BSD-3-Clause"
] | null | null | null | TommyGun/Plugins/ImageEditor/ScreenImage/fScreenType.cpp | tonyt73/TommyGun | 2c2ffae3dcd5dc25fd64d68a9f4cc96d99a1cd36 | [
"BSD-3-Clause"
] | 6 | 2017-05-27T01:14:20.000Z | 2020-01-20T14:54:30.000Z | /*---------------------------------------------------------------------------
(c) 2004 Scorpio Software
19 Wittama Drive
Glenmore Park
Sydney NSW 2745
Australia
-----------------------------------------------------------------------------
$Workfile:: ... | 41.003497 | 124 | 0.50081 | [
"vector"
] |
0ad87c0cb595966f92c500a423f03c7b86ba564c | 7,964 | cpp | C++ | SRC/OpenGL/render.cpp | Jollyrogerxp/Z-Treme-Engine-model-converter | 6ae5d1d6c943ae7a0f1a5de2f1eefdf3eafbb410 | [
"MIT"
] | 3 | 2019-12-01T19:55:48.000Z | 2021-08-31T06:22:28.000Z | SRC/OpenGL/render.cpp | Jollyrogerxp/Z-Treme-Engine-model-converter | 6ae5d1d6c943ae7a0f1a5de2f1eefdf3eafbb410 | [
"MIT"
] | null | null | null | SRC/OpenGL/render.cpp | Jollyrogerxp/Z-Treme-Engine-model-converter | 6ae5d1d6c943ae7a0f1a5de2f1eefdf3eafbb410 | [
"MIT"
] | 2 | 2020-11-23T02:50:41.000Z | 2021-07-14T19:06:16.000Z | #include "../COMMON.H"
extern player_t PLAYER[];
extern int ZT_FRAMERATE;
int testAnim = 0;
int playSpeed = 32;
void ztUpdateAnimation(animationControl_t * animCtrl, animated_model_t * currentModel)
{
if (currentModel->nbFrames==0)return;
//XPDATA * currentPDATA = currentModel->pol[0];
//model_t * cu... | 43.048649 | 231 | 0.550603 | [
"render",
"model"
] |
0ad8dc7e6f9689f40d865c1568e29bba056c755a | 16,520 | cpp | C++ | auv_ekf_slam/src/ekf_slam_core.cpp | nilsbore/smarc_navigation | 97d0a30498e72506e7472c98c5fa0d86d19f0f04 | [
"BSD-3-Clause"
] | 15 | 2020-01-24T10:24:10.000Z | 2022-03-19T10:22:41.000Z | auv_ekf_slam/src/ekf_slam_core.cpp | nilsbore/smarc_navigation | 97d0a30498e72506e7472c98c5fa0d86d19f0f04 | [
"BSD-3-Clause"
] | 20 | 2018-02-08T09:46:01.000Z | 2021-05-07T09:40:26.000Z | auv_ekf_slam/src/ekf_slam_core.cpp | nilsbore/smarc_navigation | 97d0a30498e72506e7472c98c5fa0d86d19f0f04 | [
"BSD-3-Clause"
] | 14 | 2018-01-25T14:42:24.000Z | 2022-03-08T15:18:28.000Z | /* Copyright 2018 Ignacio Torroba (ignaciotb@kth.se)
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the follow... | 41.928934 | 758 | 0.616949 | [
"object",
"vector",
"model",
"transform"
] |
0ae092536dddb975843f3004bb9bb2e2f1c56edf | 2,430 | cpp | C++ | demo-topdown/Player.cpp | leftidev/cpp-GEngine | fb1a000336f8295386c5e9e401072cfe0679b587 | [
"MIT"
] | 4 | 2016-04-02T05:52:59.000Z | 2021-05-15T21:03:17.000Z | demo-topdown/Player.cpp | lefti-/cpp-GEngine | fb1a000336f8295386c5e9e401072cfe0679b587 | [
"MIT"
] | null | null | null | demo-topdown/Player.cpp | lefti-/cpp-GEngine | fb1a000336f8295386c5e9e401072cfe0679b587 | [
"MIT"
] | 1 | 2016-04-13T17:25:44.000Z | 2016-04-13T17:25:44.000Z | #include <iostream>
#include <algorithm>
#include <SDL/SDL.h>
#include "Player.h"
const float TILE_WIDTH = 64.0f;
Player::Player() { }
Player::~Player() { }
void Player::init(glm::fvec2 pos, GEngine::InputManager* inputManager, GEngine::Camera2D* camera) {
m_textureID = GEngine::ResourceManager::getTexture("... | 27 | 119 | 0.705761 | [
"vector"
] |
0ae22f72cbb606884f1f20ca97068a7e0dfa6457 | 764 | cpp | C++ | lib/qt4/AbilitiesComboBox.cpp | codemonkey85/LibPKMN | 96a1800a24bf3861da405cf56daa2d7afd6c850d | [
"MIT"
] | null | null | null | lib/qt4/AbilitiesComboBox.cpp | codemonkey85/LibPKMN | 96a1800a24bf3861da405cf56daa2d7afd6c850d | [
"MIT"
] | null | null | null | lib/qt4/AbilitiesComboBox.cpp | codemonkey85/LibPKMN | 96a1800a24bf3861da405cf56daa2d7afd6c850d | [
"MIT"
] | 1 | 2019-07-08T20:43:57.000Z | 2019-07-08T20:43:57.000Z | /*
* Copyright (c) 2013-2014 Nicholas Corgan (n.corgan@gmail.com)
*
* Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt
* or copy at http://opensource.org/licenses/MIT)
*/
#include <string>
#include <vector>
#include <pkmn/qt4/AbilitiesComboBox.hpp>
#include <pkmn/lists.hpp>
namespace p... | 25.466667 | 98 | 0.617801 | [
"vector"
] |
0ae6fecb63390a18f04525bd54dccf962fcf3a3e | 893 | cpp | C++ | src/skeleton.cpp | Reesy/sdl-rpg-battle-system | 40a7b5027f6891495484d01f39b72a1162bdf6a8 | [
"MIT"
] | null | null | null | src/skeleton.cpp | Reesy/sdl-rpg-battle-system | 40a7b5027f6891495484d01f39b72a1162bdf6a8 | [
"MIT"
] | null | null | null | src/skeleton.cpp | Reesy/sdl-rpg-battle-system | 40a7b5027f6891495484d01f39b72a1162bdf6a8 | [
"MIT"
] | null | null | null | #include <iostream>
#include <Skeleton.hpp>
#include <Animator.hpp>
Skeleton::Skeleton(SDL_Texture *_texture, SDL_Texture *_idleTexture)
{
this->texture = _texture;
this->idleTexture = _idleTexture;
this->textureRect = {0, 0, 32, 32};
this->positionRect = {0, 0, 60, 60};
this->isIdle = false;
... | 19.844444 | 86 | 0.665174 | [
"render"
] |
0af003b40ad855a4b348fea3eb2c7479f4c887e8 | 1,524 | cpp | C++ | source/io/load_tri_file.cpp | RichardJ112/Nebula | 072e5a8c003aedd07f850cd62cd32bea61828fb5 | [
"BSD-3-Clause"
] | 3 | 2021-02-13T17:54:43.000Z | 2021-09-09T14:29:08.000Z | source/io/load_tri_file.cpp | RichardJ112/Nebula | 072e5a8c003aedd07f850cd62cd32bea61828fb5 | [
"BSD-3-Clause"
] | 2 | 2021-02-13T19:21:00.000Z | 2021-02-16T19:07:45.000Z | source/io/load_tri_file.cpp | RichardJ112/Nebula | 072e5a8c003aedd07f850cd62cd32bea61828fb5 | [
"BSD-3-Clause"
] | 4 | 2020-10-02T11:01:45.000Z | 2021-03-20T16:43:12.000Z | #include "../config/config.h"
#include "load_tri_file.h"
#include <fstream>
#include <sstream>
namespace nbl {
std::vector<triangle> load_tri_file(std::string const & filename)
{
std::vector<triangle> triangle_vec;
std::ifstream ifs(filename);
if(!ifs.is_open())
return triangle_vec;
size_t line_num = 1;
whil... | 24.190476 | 107 | 0.629921 | [
"vector"
] |
0af0eb3ebc0c0b94284257a3f20087cfaaf29708 | 13,626 | cpp | C++ | extras/debug.cpp | danielsuo/cuSIFT | 224f0490b6a315fa44132d7b94e36f73b0d84541 | [
"MIT"
] | 15 | 2016-06-21T09:10:12.000Z | 2022-01-02T05:26:29.000Z | extras/debug.cpp | danielsuo/cuSIFT | 224f0490b6a315fa44132d7b94e36f73b0d84541 | [
"MIT"
] | 47 | 2015-12-10T21:51:48.000Z | 2016-10-19T08:25:05.000Z | extras/debug.cpp | danielsuo/cuSIFT | 224f0490b6a315fa44132d7b94e36f73b0d84541 | [
"MIT"
] | 6 | 2015-12-17T14:29:37.000Z | 2021-07-01T02:24:26.000Z | #include "debug.h"
////////////////////////////////////////////////////////////////////////////////
void writeMatToFile(cv::Mat& m, const char* filename)
{
ofstream fout(filename);
double sum = 0;
if(!fout) {
cout<<"File Not Opened"<<endl; return;
}
for(int i = 0; i < m.rows; i++) {
for(int j = 0... | 30.013216 | 112 | 0.621973 | [
"vector"
] |
0af1561f675afdf6fc30a5cd5a9cc2359fa30166 | 13,061 | cpp | C++ | glwidget.cpp | m4tob/opengl-game-tetris-3d | 025a262ec92cc3988c690f7f95466897e99a4827 | [
"MIT"
] | null | null | null | glwidget.cpp | m4tob/opengl-game-tetris-3d | 025a262ec92cc3988c690f7f95466897e99a4827 | [
"MIT"
] | null | null | null | glwidget.cpp | m4tob/opengl-game-tetris-3d | 025a262ec92cc3988c690f7f95466897e99a4827 | [
"MIT"
] | 2 | 2020-10-18T17:52:29.000Z | 2020-10-25T15:16:08.000Z | /*
* UNIVERSIDADE ESTADUAL DE FEIRA DE SANTANA - UEFS
* Engenharia da Computação
* TEC431 - Computação Gráfica
*
* Trabalho Final - 2019.2E
*
* Alunos:
* Matheus Oliveira Borges <matob@live.com>
* Luiz Ricardo Inês de Souza <lzricardo.ecomp@gmail.com>
*
* -------------------------------------------... | 37 | 128 | 0.601562 | [
"3d"
] |
0af3669903df3e334bc7fb37b7ddff535b4c0b5a | 26,291 | cc | C++ | src/trusted/validator_arm/validator_tests.cc | eseidel/native_client_patches | c699f77e085b91fcc1684ecb63e2e211733afbde | [
"BSD-3-Clause"
] | 4 | 2015-10-27T04:43:02.000Z | 2021-08-13T08:21:45.000Z | src/trusted/validator_arm/validator_tests.cc | eseidel/native_client_patches | c699f77e085b91fcc1684ecb63e2e211733afbde | [
"BSD-3-Clause"
] | null | null | null | src/trusted/validator_arm/validator_tests.cc | eseidel/native_client_patches | c699f77e085b91fcc1684ecb63e2e211733afbde | [
"BSD-3-Clause"
] | 1 | 2015-11-08T10:18:42.000Z | 2015-11-08T10:18:42.000Z | /*
* Copyright 2010 The Native Client Authors. All rights reserved.
* Use of this source code is governed by a BSD-style license that can
* be found in the LICENSE file.
*/
/*
* Unit tests for the ARM validator
*
* These tests use the google-test framework (gtest for short) to exercise the
* ARM validator. Th... | 37.081805 | 80 | 0.637442 | [
"vector",
"model"
] |
0af3f47f9a3ed8900a7806fa2c90c448c74797c6 | 6,534 | cpp | C++ | tags/20081005_PRE_ENGINE_REFACTORY/ProjectFootball/src/state/CStateQuickPlay.cpp | dividio/projectfootball | 3c0b94937de2e3cd6e7daf9d3b4942fda974f20c | [
"Zlib"
] | null | null | null | tags/20081005_PRE_ENGINE_REFACTORY/ProjectFootball/src/state/CStateQuickPlay.cpp | dividio/projectfootball | 3c0b94937de2e3cd6e7daf9d3b4942fda974f20c | [
"Zlib"
] | null | null | null | tags/20081005_PRE_ENGINE_REFACTORY/ProjectFootball/src/state/CStateQuickPlay.cpp | dividio/projectfootball | 3c0b94937de2e3cd6e7daf9d3b4942fda974f20c | [
"Zlib"
] | null | null | null | /******************************************************************************
* Copyright (C) 2008 - Ikaro Games www.ikarogames.com *
* *
* This program is free software; you can redistribute it and/or *
... | 39.125749 | 149 | 0.6206 | [
"vector"
] |
e400adf978d9b8966c4a192e647d459a1137fcaa | 9,977 | hpp | C++ | graphics/source/environment/device.hpp | HrvojeFER/irg-lab | 53f27430d39fa099dd605cfd632e38b55a392699 | [
"MIT"
] | null | null | null | graphics/source/environment/device.hpp | HrvojeFER/irg-lab | 53f27430d39fa099dd605cfd632e38b55a392699 | [
"MIT"
] | null | null | null | graphics/source/environment/device.hpp | HrvojeFER/irg-lab | 53f27430d39fa099dd605cfd632e38b55a392699 | [
"MIT"
] | null | null | null | #ifndef IRGLAB_DEVICE_HPP
#define IRGLAB_DEVICE_HPP
#include "external/external.hpp"
#if !defined(NDEBUG)
#include "debug_printer.hpp"
#endif
#include "environment.hpp"
#include "window.hpp"
namespace il
{
struct [[maybe_unused]] queue_family_indices
{
std::optional<unsigned int>... | 33.479866 | 106 | 0.513581 | [
"vector"
] |
e4163cf5a66be53eca57a2cef0c7d5c06fbed342 | 1,625 | cpp | C++ | C++/1250.cpp | rakhi2001/ecom7 | 73790d44605fbd51e8f7e804b9808e364fcfc680 | [
"MIT"
] | 854 | 2018-11-09T08:06:16.000Z | 2022-03-31T06:05:53.000Z | C++/1250.cpp | rakhi2001/ecom7 | 73790d44605fbd51e8f7e804b9808e364fcfc680 | [
"MIT"
] | 29 | 2019-06-02T05:02:25.000Z | 2021-11-15T04:09:37.000Z | C++/1250.cpp | rakhi2001/ecom7 | 73790d44605fbd51e8f7e804b9808e364fcfc680 | [
"MIT"
] | 347 | 2018-12-23T01:57:37.000Z | 2022-03-12T14:51:21.000Z | __________________________________________________________________________________________________
sample 16 ms submission
static const int __ = []() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
return 0;
}();
typedef long long ll;
typedef unsigned int ui;
typedef u... | 20.56962 | 98 | 0.577231 | [
"vector"
] |
e42f7e551574f37155c56aaf5ede95ad96df6a0e | 7,369 | cc | C++ | lite/kernels/fpga/elementwise_compute.cc | 714627034/Paddle-Lite | 015ba88a4d639db0b73603e37f83e47be041a4eb | [
"Apache-2.0"
] | 1,799 | 2019-08-19T03:29:38.000Z | 2022-03-31T14:30:50.000Z | lite/kernels/fpga/elementwise_compute.cc | 714627034/Paddle-Lite | 015ba88a4d639db0b73603e37f83e47be041a4eb | [
"Apache-2.0"
] | 3,767 | 2019-08-19T03:36:04.000Z | 2022-03-31T14:37:26.000Z | lite/kernels/fpga/elementwise_compute.cc | 714627034/Paddle-Lite | 015ba88a4d639db0b73603e37f83e47be041a4eb | [
"Apache-2.0"
] | 798 | 2019-08-19T02:28:23.000Z | 2022-03-31T08:31:54.000Z | // Copyright (c) 2019 PaddlePaddle Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required... | 34.274419 | 75 | 0.580812 | [
"shape"
] |
e437cf17190abac8f5bc8edd552d2e0412cd0cec | 1,240 | cpp | C++ | coj.uci.cu/DyckWords.cpp | facug91/OJ-Solutions | 9aa55be066ce5596e4e64737c28cd3ff84e092fe | [
"Apache-2.0"
] | 6 | 2016-09-10T03:16:34.000Z | 2020-04-07T14:45:32.000Z | coj.uci.cu/DyckWords.cpp | facug91/OJ-Solutions | 9aa55be066ce5596e4e64737c28cd3ff84e092fe | [
"Apache-2.0"
] | null | null | null | coj.uci.cu/DyckWords.cpp | facug91/OJ-Solutions | 9aa55be066ce5596e4e64737c28cd3ff84e092fe | [
"Apache-2.0"
] | 2 | 2018-08-11T20:55:35.000Z | 2020-01-15T23:23:11.000Z | /*
By: facug91
From: http://coj.uci.cu/24h/problem.xhtml?abb=2260
Name: Dyck Words
Number: 2260
Date: 02/08/2014
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <dequ... | 18.235294 | 52 | 0.609677 | [
"vector"
] |
e43903818003d5e885cc81d728eb25a1225d1afd | 1,664 | cpp | C++ | 0733_FloodFill.cpp | taro-masuda/leetcode | 39739e9fec7c66513b114c740ef982ccc09dc39f | [
"MIT"
] | null | null | null | 0733_FloodFill.cpp | taro-masuda/leetcode | 39739e9fec7c66513b114c740ef982ccc09dc39f | [
"MIT"
] | null | null | null | 0733_FloodFill.cpp | taro-masuda/leetcode | 39739e9fec7c66513b114c740ef982ccc09dc39f | [
"MIT"
] | 1 | 2020-03-18T05:23:40.000Z | 2020-03-18T05:23:40.000Z | class Solution {
public:
vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) {
int R = image.size(); int C = image[0].size();
stack<pair<int, int>> s;
s.push(pair(sr, sc));
set<pair<int,int>> visited;
visited.insert(pair(sr,sc));
in... | 34.666667 | 95 | 0.397837 | [
"vector"
] |
e43bdb137fa2124ee52c651d568b8a15f7a0dac7 | 15,869 | hh | C++ | Replicator/tests/ReplicatorAPITest.hh | mleduque/couchbase-lite-core | 6003a9e9a52d31fb7872dd10717a1ffdcc6f0a9c | [
"Apache-2.0"
] | null | null | null | Replicator/tests/ReplicatorAPITest.hh | mleduque/couchbase-lite-core | 6003a9e9a52d31fb7872dd10717a1ffdcc6f0a9c | [
"Apache-2.0"
] | null | null | null | Replicator/tests/ReplicatorAPITest.hh | mleduque/couchbase-lite-core | 6003a9e9a52d31fb7872dd10717a1ffdcc6f0a9c | [
"Apache-2.0"
] | null | null | null | //
// ReplicatorAPITest.hh
// LiteCore
//
// Created by Jens Alfke on 7/12/17.
// Copyright © 2017 Couchbase. All rights reserved.
//
#pragma once
#include "fleece/slice.hh"
#include "fleece/Fleece.hh"
#include "c4.hh"
#include "c4Certificate.h"
#include "Address.hh"
#include "Response.hh"
#include "c4Test.hh"
#in... | 35.342984 | 137 | 0.575525 | [
"vector"
] |
e4453b06f60083e5b3ab14bacc6709c67cc4b022 | 43,295 | cpp | C++ | test/unit/math/mix/mat/fun/mdivide_right_ldlt_test.cpp | jrmie/math | 2850ec262181075a5843968e805dc9ad1654e069 | [
"BSD-3-Clause"
] | 1 | 2019-09-06T15:53:17.000Z | 2019-09-06T15:53:17.000Z | test/unit/math/mix/mat/fun/mdivide_right_ldlt_test.cpp | jrmie/math | 2850ec262181075a5843968e805dc9ad1654e069 | [
"BSD-3-Clause"
] | 8 | 2019-01-17T18:51:16.000Z | 2019-01-17T18:51:39.000Z | test/unit/math/mix/mat/fun/mdivide_right_ldlt_test.cpp | jrmie/math | 2850ec262181075a5843968e805dc9ad1654e069 | [
"BSD-3-Clause"
] | null | null | null | #include <stan/math/mix/mat.hpp>
#include <gtest/gtest.h>
#include <vector>
using stan::math::fvar;
using stan::math::var;
TEST(AgradMixMatrixMdivideRightLDLT, matrix_fv_matrix_fv_1) {
stan::math::LDLT_factor<fvar<var>, -1, -1> ldlt_Ad;
stan::math::matrix_fv Ad(2, 2);
stan::math::matrix_fv Av(2, 2);
stan::mat... | 29.312796 | 69 | 0.636309 | [
"vector"
] |
e44966300c28e8d51969f6753b27158c93d8fe76 | 34,146 | cpp | C++ | src/projects/repeat_resolution/mdbg.cpp | fedarko/LJA | f20c85395d741b0f94f6d0172c7451d72d7c8713 | [
"BSD-3-Clause"
] | null | null | null | src/projects/repeat_resolution/mdbg.cpp | fedarko/LJA | f20c85395d741b0f94f6d0172c7451d72d7c8713 | [
"BSD-3-Clause"
] | null | null | null | src/projects/repeat_resolution/mdbg.cpp | fedarko/LJA | f20c85395d741b0f94f6d0172c7451d72d7c8713 | [
"BSD-3-Clause"
] | null | null | null | //
// Created by Andrey Bzikadze on 11/25/21.
//
#include "mdbg.hpp"
using namespace repeat_resolution;
std::vector<SuccinctEdgeInfo> MultiplexDBG::SparseDBG2SuccinctEdgeInfo(
dbg::SparseDBG &dbg, const UniqueClassificator &classificator) {
const std::unordered_map<std::string, uint64_t> vert2ind = [&dbg]() ... | 40.505338 | 82 | 0.605342 | [
"vector"
] |
e455b9155c49cc74d86420c63228a19a1fbb1957 | 1,926 | cxx | C++ | test/src/cli_parser.packed.cxx | isbodand/InfoCLI | 67f9ff2dab575b8bbd7957f6bb3256539010d265 | [
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | test/src/cli_parser.packed.cxx | isbodand/InfoCLI | 67f9ff2dab575b8bbd7957f6bb3256539010d265 | [
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | 1 | 2020-10-24T20:42:36.000Z | 2020-10-24T20:42:36.000Z | test/src/cli_parser.packed.cxx | bodand/InfoCLI | 67f9ff2dab575b8bbd7957f6bb3256539010d265 | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (c) 2020 bodand
* Licensed under the BSD 3-Clause license
*
* Tests for parsing packed short options like -abc
*/
#include <array>
#include <string_view>
using namespace std::literals;
#include <catch2/catch.hpp>
#include <info/cli/cli_parser.hxx>
using namespace info::cli::udl;
TEST_CASE("cli_p... | 27.126761 | 85 | 0.567497 | [
"vector"
] |
e4565a89109af8dc22a9f4b5c7ba86ee91153d99 | 2,087 | hpp | C++ | src/SpriteRenderer.hpp | ReeCocho/Snek | fb1aec6516adb0586fcc57bd0dccd0d43082d3b2 | [
"MIT"
] | null | null | null | src/SpriteRenderer.hpp | ReeCocho/Snek | fb1aec6516adb0586fcc57bd0dccd0d43082d3b2 | [
"MIT"
] | null | null | null | src/SpriteRenderer.hpp | ReeCocho/Snek | fb1aec6516adb0586fcc57bd0dccd0d43082d3b2 | [
"MIT"
] | null | null | null | #pragma once
/**
* @file SpriteRenderer.hpp
* @brief Sprite renderer header file.
* @author Connor J. Bramham (ReeCocho)
*/
/** Includes. */
#include "Component.hpp"
#include "Material.hpp"
#include "Mesh.hpp"
#include "Transform.hpp"
namespace snk
{
class SpriteRenderer : public Component
{
public:
/**
... | 17.391667 | 74 | 0.617633 | [
"mesh",
"render",
"object",
"transform"
] |
e4586ef848779455aa7eb9414ec25743dc62c4b4 | 577 | hpp | C++ | include/flexui/Style/StyleTreeUpdater.hpp | franciscod/flexui | 9af2c32a8ac3fe7127a9dd6927abe8b1945237c4 | [
"MIT"
] | null | null | null | include/flexui/Style/StyleTreeUpdater.hpp | franciscod/flexui | 9af2c32a8ac3fe7127a9dd6927abe8b1945237c4 | [
"MIT"
] | null | null | null | include/flexui/Style/StyleTreeUpdater.hpp | franciscod/flexui | 9af2c32a8ac3fe7127a9dd6927abe8b1945237c4 | [
"MIT"
] | null | null | null | #pragma once
#include <vector>
#include "flexui/TreeProcessor.hpp"
#include "flexui/Style/StyleSelectorMatcher.hpp"
namespace flexui {
class StyleSheet;
struct StyleSelector;
class StyleTreeUpdater : public TreeProcessor {
public:
StyleTreeUpdater(Surface* surface);
virtual ~StyleTreeUpdater();
void pr... | 18.612903 | 49 | 0.764298 | [
"vector"
] |
e4694d15dfe4d8ec519a19c0a0b8c940f4544915 | 3,366 | cpp | C++ | bme280.cpp | lupyuen/send-altitude-cocoos | 77f33be2ddf3d243056f78e30a1c86c71b8a9d81 | [
"MIT"
] | 24 | 2018-08-16T09:57:44.000Z | 2020-12-18T22:32:48.000Z | bme280.cpp | lupyuen/send-altitude-cocoos | 77f33be2ddf3d243056f78e30a1c86c71b8a9d81 | [
"MIT"
] | 1 | 2019-04-13T14:37:06.000Z | 2019-04-17T06:34:03.000Z | bme280.cpp | lupyuen/send-altitude-cocoos | 77f33be2ddf3d243056f78e30a1c86c71b8a9d81 | [
"MIT"
] | 6 | 2018-09-10T19:48:05.000Z | 2020-12-14T23:12:07.000Z | // BME280 I2C interface for temperature, humidity and altitude sensors.
// Reuses the Arduino library for BME280, even on Blue Pill: https://github.com/finitespace/BME280
#include "platform.h"
#include "display.h"
#ifdef SENSOR_DATA
#include "bme280.h"
#include <Wire.h>
// We will scan these I2C addresses for the ... | 43.153846 | 118 | 0.67142 | [
"model"
] |
e46b8f8b464c0f58843de6a55d08982e8013ccaa | 676 | cpp | C++ | 0084_Largest_Rectangle_in_Histogram/solution.cpp | Heliovic/LeetCode_Solutions | 73d5a7aaffe62da9a9cd8a80288b260085fda08f | [
"MIT"
] | 2 | 2019-02-18T15:32:57.000Z | 2019-03-18T12:55:35.000Z | 0084_Largest_Rectangle_in_Histogram/solution.cpp | Heliovic/LeetCode_Solutions | 73d5a7aaffe62da9a9cd8a80288b260085fda08f | [
"MIT"
] | null | null | null | 0084_Largest_Rectangle_in_Histogram/solution.cpp | Heliovic/LeetCode_Solutions | 73d5a7aaffe62da9a9cd8a80288b260085fda08f | [
"MIT"
] | null | null | null | class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
int ans = 0;
stack<int> stk;
for (int i = 0; i <= heights.size(); i++)
{
int h = (i == heights.size() ? 0 : heights[i]);
if (stk.size() == 0 || h > heights[stk.top()])
... | 25.037037 | 59 | 0.357988 | [
"vector"
] |
e46bd4cb8612c5154995e3f1e9691d33eeb81466 | 6,194 | cpp | C++ | src/utils.cpp | shubhomoydas/computer_graphics | 8a13680967617ab5ffdf0a38604e02a19c4b40fe | [
"MIT"
] | null | null | null | src/utils.cpp | shubhomoydas/computer_graphics | 8a13680967617ab5ffdf0a38604e02a19c4b40fe | [
"MIT"
] | null | null | null | src/utils.cpp | shubhomoydas/computer_graphics | 8a13680967617ab5ffdf0a38604e02a19c4b40fe | [
"MIT"
] | null | null | null | #include <string>
#include <vector>
#include "utils.h"
bool CommandOptions::parseCommandLine(int argc, char **argv) {
file = "obj/cube.obj";
FFfile = "c:/temp/FF.csv";
cr.set(0.0, 0.0, 1.0); // blue
specular.set(1.0,1.0,1.0,1.0);
e.set(2.0,2.0,2.0); // eye coordinates
at.set(0.0,0.0,0.0); // look at coordinates
... | 27.40708 | 85 | 0.532451 | [
"vector"
] |
e47c26cc88e4c38c6f7f52be75a119bd3516ec15 | 2,760 | cpp | C++ | Standard Graph Problems/Labyrinth.cpp | rahulgrover99/Competitive | b975b67e815e0d891eadc2d1f21d88944bb36c63 | [
"MIT"
] | null | null | null | Standard Graph Problems/Labyrinth.cpp | rahulgrover99/Competitive | b975b67e815e0d891eadc2d1f21d88944bb36c63 | [
"MIT"
] | null | null | null | Standard Graph Problems/Labyrinth.cpp | rahulgrover99/Competitive | b975b67e815e0d891eadc2d1f21d88944bb36c63 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
#define FOR0(i,n) for(int i=0;i<n;i++)
#define FOR1(i,n) for(int i=1;i<=n;i++)
#define FORl(i,l,n) for(int i=l;i<n;i++)
using namespace std;
#define pi pair<ll,ll>
#define pb push_back
#define ll long long
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define mst... | 25.794393 | 134 | 0.450725 | [
"vector"
] |
e47cb924aa7cc964c71515652c7d5c15a586f601 | 1,184 | hpp | C++ | source/util/string.hpp | copsey/dice | eb7239d93368600c2a0a0fa94315ba5f30dfa7e9 | [
"MIT"
] | null | null | null | source/util/string.hpp | copsey/dice | eb7239d93368600c2a0a0fa94315ba5f30dfa7e9 | [
"MIT"
] | null | null | null | source/util/string.hpp | copsey/dice | eb7239d93368600c2a0a0fa94315ba5f30dfa7e9 | [
"MIT"
] | null | null | null | #ifndef DICE_UTIL_STRING
#define DICE_UTIL_STRING
#include <charconv>
#include <string>
#include <string_view>
#include <vector>
namespace dice {
namespace util {
/// Split `str` into the vector of non-empty substrings that are
/// delimited by whitespace in `str`.
///
/// Empty substrings are automatically ... | 30.358974 | 86 | 0.668919 | [
"vector"
] |
e47de910d679d37469548dc9c3bf10cdcce50ead | 3,117 | cpp | C++ | testing/parsing_test.cpp | stian-svedenborg/xyuv | c725b4f926ef3c5311878b0b8b9c4dacbbf0db34 | [
"MIT"
] | 5 | 2015-08-13T18:46:45.000Z | 2018-04-18T18:51:43.000Z | testing/parsing_test.cpp | stian-svedenborg/xyuv | c725b4f926ef3c5311878b0b8b9c4dacbbf0db34 | [
"MIT"
] | 18 | 2015-08-19T13:25:30.000Z | 2017-05-08T10:55:48.000Z | testing/parsing_test.cpp | stian-svedenborg/xyuv | c725b4f926ef3c5311878b0b8b9c4dacbbf0db34 | [
"MIT"
] | 3 | 2016-07-21T12:18:06.000Z | 2018-05-19T05:32:32.000Z | /*
* The MIT License (MIT)
*
* Copyright (c) 2015 Stian Valentin Svedenborg
*
* 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 righ... | 28.59633 | 80 | 0.508181 | [
"vector"
] |
e480a832e78e50f83563d9286b013278149494ff | 1,529 | cpp | C++ | books/tech/cpp/qt/m_shlee-qt_5_3/ch_12-interview_model_presentation_/05-observer_program/main.cpp | ordinary-developer/education | 1b1f40dacab873b28ee01dfa33a9bd3ec4cfed58 | [
"MIT"
] | null | null | null | books/tech/cpp/qt/m_shlee-qt_5_3/ch_12-interview_model_presentation_/05-observer_program/main.cpp | ordinary-developer/education | 1b1f40dacab873b28ee01dfa33a9bd3ec4cfed58 | [
"MIT"
] | null | null | null | books/tech/cpp/qt/m_shlee-qt_5_3/ch_12-interview_model_presentation_/05-observer_program/main.cpp | ordinary-developer/education | 1b1f40dacab873b28ee01dfa33a9bd3ec4cfed58 | [
"MIT"
] | null | null | null | #include <QtWidgets>
int main(int argc, char** argv) {
QApplication app{ argc, argv };
QSplitter spl(Qt::Horizontal);
QFileSystemModel model{};
model.setRootPath(QDir::rootPath());
QTreeView* pTreeView{ new QTreeView };
pTreeView->setModel(&model);
QTableView* pTableView{ new QTableView... | 30.58 | 66 | 0.534336 | [
"model"
] |
6b07a64c3f2c0199cbcdc9389fffc4825bea7fc2 | 818 | cpp | C++ | CCC/Stage1/02-Done/ccc02s5.cpp | zzh8829/CompetitiveProgramming | 36f36b10269b4648ca8be0b08c2c49e96abede25 | [
"MIT"
] | 1 | 2017-10-01T00:51:39.000Z | 2017-10-01T00:51:39.000Z | CCC/Stage1/02-Done/ccc02s5.cpp | zzh8829/CompetitiveProgramming | 36f36b10269b4648ca8be0b08c2c49e96abede25 | [
"MIT"
] | null | null | null | CCC/Stage1/02-Done/ccc02s5.cpp | zzh8829/CompetitiveProgramming | 36f36b10269b4648ca8be0b08c2c49e96abede25 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <fstream>
#include <bitset>
#include <cstring>
#include <cmath>
#include <ctime>
using namespace std;
double slope;
double w,h;
double sx,sy;
int ans;
int main()
{
... | 14.872727 | 30 | 0.52445 | [
"vector"
] |
6b0842236dda53b68348cc9c755227a05fbb0e67 | 6,018 | cc | C++ | dali/operators/decoder/audio/audio_decoder_impl.cc | a-sansanwal/DALI | 83aeb96792d053f60dd4252b8efa0fc8fdd9012a | [
"ECL-2.0",
"Apache-2.0"
] | 1 | 2020-10-07T23:07:23.000Z | 2020-10-07T23:07:23.000Z | dali/operators/decoder/audio/audio_decoder_impl.cc | MAKali4737/DALI | 3b114c6ebee38ff3815a9b4a234402e4d1affaa0 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | dali/operators/decoder/audio/audio_decoder_impl.cc | MAKali4737/DALI | 3b114c6ebee38ff3815a9b4a234402e4d1affaa0 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | // Copyright (c) 2020, NVIDIA CORPORATION. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required ... | 47.385827 | 100 | 0.685278 | [
"shape"
] |
6b1c93f60d36e8052132974e0afcff8c6d6bdec6 | 2,561 | cpp | C++ | PathPlanningNotes/BehaviourPlanning/cost2.cpp | ahtchow/CarND-PathPlanning-P6 | 887cc1aeb2110791da09e3b9b7cf538479362c21 | [
"MIT"
] | null | null | null | PathPlanningNotes/BehaviourPlanning/cost2.cpp | ahtchow/CarND-PathPlanning-P6 | 887cc1aeb2110791da09e3b9b7cf538479362c21 | [
"MIT"
] | null | null | null | PathPlanningNotes/BehaviourPlanning/cost2.cpp | ahtchow/CarND-PathPlanning-P6 | 887cc1aeb2110791da09e3b9b7cf538479362c21 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <cmath>
using std::cout;
using std::endl;
double inefficiency_cost(int target_speed, int intended_lane, int final_lane,
const std::vector<int> &lane_speeds) {
// Cost becomes higher for trajectories with intended lane and final lane
// th... | 38.80303 | 112 | 0.600937 | [
"vector"
] |
6b248dbe53629350c92f1d71e9da1f20a2c06b1d | 24,817 | cpp | C++ | srccon/AStyleTestCon_Print.cpp | FabianSchmitt/TP8 | 2b9918322e9f7776d9ef62c06f2c435a00b70322 | [
"MIT"
] | null | null | null | srccon/AStyleTestCon_Print.cpp | FabianSchmitt/TP8 | 2b9918322e9f7776d9ef62c06f2c435a00b70322 | [
"MIT"
] | null | null | null | srccon/AStyleTestCon_Print.cpp | FabianSchmitt/TP8 | 2b9918322e9f7776d9ef62c06f2c435a00b70322 | [
"MIT"
] | null | null | null | // AStyleTestCon_Print.cpp
// Copyright (c) 2018 by Jim Pattee <jimp03@email.com>.
// This code is licensed under the MIT License.
// License.md describes the conditions under which this software may be distributed.
// AStyleTestCon tests the ASConsole class only. This class is used only in
// the console build. It al... | 34.515994 | 97 | 0.654189 | [
"object",
"vector"
] |
6b28e16dbea5f4b2c686807bbf6de30b863bc140 | 44,260 | cpp | C++ | SPOUTSDK/SpoutDirectX/SpoutDX/Tutorial07/Tutorial07.cpp | dlvrydryvr/Spout2 | 9ffa0fb25f67aa2da7778db33dd8ac6f12a37695 | [
"BSD-2-Clause"
] | 465 | 2015-01-12T17:32:29.000Z | 2022-03-31T08:12:48.000Z | SPOUTSDK/SpoutDirectX/SpoutDX/Tutorial07/Tutorial07.cpp | dlvrydryvr/Spout2 | 9ffa0fb25f67aa2da7778db33dd8ac6f12a37695 | [
"BSD-2-Clause"
] | 71 | 2015-01-30T17:54:37.000Z | 2022-03-08T01:30:00.000Z | SPOUTSDK/SpoutDirectX/SpoutDX/Tutorial07/Tutorial07.cpp | dlvrydryvr/Spout2 | 9ffa0fb25f67aa2da7778db33dd8ac6f12a37695 | [
"BSD-2-Clause"
] | 114 | 2015-01-15T06:43:37.000Z | 2022-03-11T06:13:01.000Z | //--------------------------------------------------------------------------------------
// File: Tutorial07.cpp
//
// - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Adapted for SPOUT output (http://spout.zeal.co/)
// from : https://github.com/walbourn/directx-sdk-samples/tree/master/Direct3D11Tutorials
// Se... | 33.029851 | 148 | 0.63362 | [
"render"
] |
6b2cef5712d0279992692e416a20bab04e12bbfd | 3,755 | cpp | C++ | tc 160+/Quilting.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 3 | 2015-05-25T06:24:37.000Z | 2016-09-10T07:58:00.000Z | tc 160+/Quilting.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | null | null | null | tc 160+/Quilting.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 5 | 2015-05-25T06:24:40.000Z | 2021-08-19T19:22:29.000Z | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <cstring>
using namespace std;
struct Color {
int orig, cnt;
int susjed;
char c;
Color(int o, int cn, int s, char sym): orig(o), cnt(cn), susjed(s), c(sym) {}
};
bool operator<(const Color& a, c... | 37.929293 | 315 | 0.552597 | [
"vector"
] |
6b358712125f6c4150684badf299cc84d8f98362 | 8,942 | cc | C++ | Algorithms/extractWithCentroiding/ImageSegmentation.cc | jwillemsen/sidecar | 941d9f3b84d05ca405df1444d4d9fd0bde03887f | [
"MIT"
] | null | null | null | Algorithms/extractWithCentroiding/ImageSegmentation.cc | jwillemsen/sidecar | 941d9f3b84d05ca405df1444d4d9fd0bde03887f | [
"MIT"
] | null | null | null | Algorithms/extractWithCentroiding/ImageSegmentation.cc | jwillemsen/sidecar | 941d9f3b84d05ca405df1444d4d9fd0bde03887f | [
"MIT"
] | null | null | null | #include "ImageSegmentation.h"
ImageSegmentation::ImageSegmentation(Logger::Log& logg) : m_maxRowDepth(0), log(logg)
{
}
ImageSegmentation::~ImageSegmentation()
{
}
void
ImageSegmentation::CloseAllOpenTargets()
{
m_closedTargets.insert(m_closedTargets.end(), m_openTargets.begin(), m_openTargets.end());
m_ope... | 35.343874 | 119 | 0.577499 | [
"vector"
] |
6b3692e882cb97836c1cd840f791c26c92f58059 | 1,130 | cpp | C++ | DSA_Implementation/ZRevise01/Sorting/2. SelectionSort.cpp | Sowmik23/All-Codes | 212ef0d940fa84624bb2972a257768a830a709a3 | [
"MIT"
] | 5 | 2021-02-14T17:48:21.000Z | 2022-01-24T14:29:44.000Z | DSA_Implementation/ZRevise01/Sorting/2. SelectionSort.cpp | Sowmik23/All-Codes | 212ef0d940fa84624bb2972a257768a830a709a3 | [
"MIT"
] | null | null | null | DSA_Implementation/ZRevise01/Sorting/2. SelectionSort.cpp | Sowmik23/All-Codes | 212ef0d940fa84624bb2972a257768a830a709a3 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
/*
* Selection Sort
* Time: O(n^2) Best case: O(n^2)
* Space: O(1)
* In-place: Yes
* Stable: NO //example: Given [2, 2, 1], the '2' values will not
* retain their initial order. Selection Sort is not stable because
* it swaps non-adjacent elements.
*
* Selec... | 20.925926 | 73 | 0.645133 | [
"vector"
] |
6b3a9a9ab8988f7b4b79ebb406b42ba28a4f803c | 23,980 | cpp | C++ | ccxx/cxapplication.cpp | oudream/ccxx | 7746ef93b48bf44157048a43c4878152fe6a4d2b | [
"MIT"
] | 39 | 2015-12-09T09:28:46.000Z | 2021-11-16T12:57:25.000Z | ccxx/cxapplication.cpp | oudream/ccxx | 7746ef93b48bf44157048a43c4878152fe6a4d2b | [
"MIT"
] | 1 | 2020-10-17T02:23:42.000Z | 2020-10-17T02:23:42.000Z | ccxx/cxapplication.cpp | oudream/ccxx | 7746ef93b48bf44157048a43c4878152fe6a4d2b | [
"MIT"
] | 8 | 2018-05-29T12:48:13.000Z | 2022-02-27T01:45:57.000Z | #include "cxapplication.h"
#include "cxprocess.h"
#include "cxinterinfo.h"
#include "cxlog.h"
#include "cxsystem.h"
using namespace std;
struct ProcessCallBack
{
ProcessCallBack(fn_void_msg_tlv_t fn1)
: fn(fn1), msg(0), tag(0), source(0), target(0), data(), hadRun(false) {}
ProcessCallBack(fn_void_ms... | 29.863014 | 294 | 0.628565 | [
"vector"
] |
6b40f659c18e61a7c4b3a5bdb8ad5c84756a42ea | 85,373 | cpp | C++ | src/saveload/afterload.cpp | trademarks/OpenTTD | fd7fca73cf61a2960e8df8fa221b179d23ae3ef0 | [
"Unlicense"
] | 8 | 2016-10-21T09:01:43.000Z | 2021-05-31T06:32:14.000Z | src/saveload/afterload.cpp | blackberry/OpenTTD | fd7fca73cf61a2960e8df8fa221b179d23ae3ef0 | [
"Unlicense"
] | null | null | null | src/saveload/afterload.cpp | blackberry/OpenTTD | fd7fca73cf61a2960e8df8fa221b179d23ae3ef0 | [
"Unlicense"
] | 4 | 2017-05-16T00:15:58.000Z | 2020-08-06T01:46:31.000Z | /* $Id$ */
/*
* This file is part of OpenTTD.
* OpenTTD 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, version 2.
* OpenTTD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without... | 32.326013 | 212 | 0.657152 | [
"object"
] |
6b4194411bc31b4d0b44bb70847f19a01ad5820d | 16,338 | hpp | C++ | svntrunk/src/ParaFrames/fft3d/include/fft3D_MPI.hpp | Bhaskers-Blu-Org1/BlueMatter | 1ab2c41af870c19e2e1b1095edd1d5c85eeb9b5e | [
"BSD-2-Clause"
] | 7 | 2020-02-25T15:46:18.000Z | 2022-02-25T07:04:47.000Z | svntrunk/src/bgfe/fft3dx/include/fft3D_MPI.hpp | IBM/BlueMatter | 5243c0ef119e599fc3e9b7c4213ecfe837de59f3 | [
"BSD-2-Clause"
] | null | null | null | svntrunk/src/bgfe/fft3dx/include/fft3D_MPI.hpp | IBM/BlueMatter | 5243c0ef119e599fc3e9b7c4213ecfe837de59f3 | [
"BSD-2-Clause"
] | 5 | 2019-06-06T16:30:21.000Z | 2020-11-16T19:43:01.000Z | /* Copyright 2001, 2019 IBM Corporation
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the
* following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the
* following d... | 28.764085 | 121 | 0.611764 | [
"mesh",
"3d"
] |
6b41b3fbc4e4ead936556bc200a99cd224821e3d | 7,744 | cpp | C++ | foo_dotnet_component_host/net_objects/fb_file_info.cpp | TheQwertiest/foo_dotnet_component_host | f849849b591a5d85b4bc12790123dc40aaf24f93 | [
"MIT"
] | 4 | 2021-12-01T18:54:26.000Z | 2022-03-30T13:16:17.000Z | foo_dotnet_component_host/net_objects/fb_file_info.cpp | TheQwertiest/foo_dotnet_component_host | f849849b591a5d85b4bc12790123dc40aaf24f93 | [
"MIT"
] | 1 | 2021-11-29T13:25:14.000Z | 2022-01-16T22:54:57.000Z | foo_dotnet_component_host/net_objects/fb_file_info.cpp | TheQwertiest/foo_dotnet_component_host | f849849b591a5d85b4bc12790123dc40aaf24f93 | [
"MIT"
] | null | null | null | #include <stdafx.h>
#include "fb_file_info.h"
#include <convert/to_net.h>
#include <net_objects/impl/enumerable_impl.h>
namespace Qwr::DotnetHost
{
ref class InfoEnumerator;
ref class MetaEnumerator;
ref class MetaValuesEnumerator;
} // namespace Qwr::DotnetHost
namespace Qwr::DotnetHost
{
private
ref class Info... | 19.555556 | 88 | 0.683368 | [
"object"
] |
6b48c6ae0e8a8e09b0e7fd4a4d9bef910cef0149 | 3,752 | cpp | C++ | src/vendor/mariadb-10.6.7/storage/columnstore/columnstore/tools/fixdate/fixdate.cpp | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | null | null | null | src/vendor/mariadb-10.6.7/storage/columnstore/columnstore/tools/fixdate/fixdate.cpp | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | null | null | null | src/vendor/mariadb-10.6.7/storage/columnstore/columnstore/tools/fixdate/fixdate.cpp | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | 2 | 2022-02-27T14:00:01.000Z | 2022-03-31T06:24:22.000Z | /* Copyright (C) 2014 InfiniDB, Inc.
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; version 2 of
the License.
This program is distributed in the hope that it will be useful,
but W... | 21.318182 | 74 | 0.572228 | [
"vector"
] |
6b4a0a2a68b146152ee894dfa65aae585ef500b6 | 25,537 | cpp | C++ | include/mainMenu.cpp | BridgeFan/bridgefan-tbs-game | 062593cf3094cc6fe9858b5575dd76d020774698 | [
"MIT"
] | null | null | null | include/mainMenu.cpp | BridgeFan/bridgefan-tbs-game | 062593cf3094cc6fe9858b5575dd76d020774698 | [
"MIT"
] | 1 | 2020-08-16T18:01:37.000Z | 2020-08-16T18:01:37.000Z | include/mainMenu.cpp | BridgeFan/bridgefan-tbs-game | 062593cf3094cc6fe9858b5575dd76d020774698 | [
"MIT"
] | null | null | null | #include "mainMenu.hpp"
#include "basic/constants.hpp"
#include "LoadingScreen.hpp"
#include "basic/megaTexture.hpp"
#include "Data.hpp"
#include <filesystem>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <chrono>
namespace fs=std::filesystem;
MainMenu::MainMenu(const Data& data,... | 38.751138 | 185 | 0.648784 | [
"vector"
] |
6b509d333fef97fceffd4898ccb6167e7cac6d3d | 84,478 | cpp | C++ | test/test_primitives/test_cylinder.cpp | orgarten/blazert | ac645b1e6701c2b1b45101b29d370ef1842f7369 | [
"BSD-3-Clause"
] | null | null | null | test/test_primitives/test_cylinder.cpp | orgarten/blazert | ac645b1e6701c2b1b45101b29d370ef1842f7369 | [
"BSD-3-Clause"
] | null | null | null | test/test_primitives/test_cylinder.cpp | orgarten/blazert | ac645b1e6701c2b1b45101b29d370ef1842f7369 | [
"BSD-3-Clause"
] | null | null | null | /*
* Created by ogarten on 15/05/2020.
* Modified on 11/06/202 by ogarten
*
* This file holds test cases for the cylinder primitive for the following cases:
* 1. correct bounding box
* 1.1 center at origin ( rotated, non-rotated cylinder)
* 1.1 center not at origin (rotated, non-rotated cylinder)
*
* 2. testin... | 46.314693 | 117 | 0.552866 | [
"vector"
] |
6b52e42fdc0675807ab32dd7a30153d8d58fa0f5 | 16,885 | cpp | C++ | dwarfz/location.cpp | cristivlas/zerobugs | 5f080c8645b123d7887fd8a64f60e8d226e3b1d5 | [
"BSL-1.0"
] | 2 | 2018-03-19T23:27:47.000Z | 2018-06-24T16:15:19.000Z | dwarfz/location.cpp | cristivlas/zerobugs | 5f080c8645b123d7887fd8a64f60e8d226e3b1d5 | [
"BSL-1.0"
] | null | null | null | dwarfz/location.cpp | cristivlas/zerobugs | 5f080c8645b123d7887fd8a64f60e8d226e3b1d5 | [
"BSL-1.0"
] | 1 | 2021-11-28T05:39:05.000Z | 2021-11-28T05:39:05.000Z | //
// $Id$
//
// -------------------------------------------------------------------------
// This file is part of ZeroBugs, Copyright (c) 2010 Cristian L. Vlasceanu
//
// 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.... | 26.507064 | 85 | 0.519337 | [
"object"
] |
6b59f73630aa4de079d6f671f160d5aa3dae67c8 | 54,067 | cc | C++ | src/ifmap/client/test/peer_server_finder_test.cc | biswajit-mandal/contrail-controller | 80c4a7e8515f7296b18ba4c21a439bd3daefcc4a | [
"Apache-2.0"
] | 5 | 2015-01-08T17:34:41.000Z | 2017-09-28T16:00:25.000Z | src/ifmap/client/test/peer_server_finder_test.cc | biswajit-mandal/contrail-controller | 80c4a7e8515f7296b18ba4c21a439bd3daefcc4a | [
"Apache-2.0"
] | null | null | null | src/ifmap/client/test/peer_server_finder_test.cc | biswajit-mandal/contrail-controller | 80c4a7e8515f7296b18ba4c21a439bd3daefcc4a | [
"Apache-2.0"
] | 18 | 2017-01-12T09:28:44.000Z | 2019-04-18T20:47:42.000Z | /*
* Copyright (c) 2013 Juniper Networks, Inc. All rights reserved.
*/
#include "ifmap/client/peer_server_finder.h"
#include "base/logging.h"
#include "base/task.h"
#include "base/task_annotations.h"
#include <sandesh/sandesh.h>
#include "discovery_client.h"
#include "ifmap/client/ifmap_manager.h"
#include "ifmap... | 45.168755 | 80 | 0.735865 | [
"vector"
] |
6b5b5123e4a9519d69f591096871e47e5950fbee | 1,126 | cpp | C++ | src/08_RecurrentNeuralNetworks/RNN.cpp | jiamny/D2L_pytorch_cpp | 5bd89bb5531b9fca4fbe0dc3bfe5beaa7c45cb09 | [
"MIT"
] | null | null | null | src/08_RecurrentNeuralNetworks/RNN.cpp | jiamny/D2L_pytorch_cpp | 5bd89bb5531b9fca4fbe0dc3bfe5beaa7c45cb09 | [
"MIT"
] | null | null | null | src/08_RecurrentNeuralNetworks/RNN.cpp | jiamny/D2L_pytorch_cpp | 5bd89bb5531b9fca4fbe0dc3bfe5beaa7c45cb09 | [
"MIT"
] | 1 | 2022-03-11T00:12:20.000Z | 2022-03-11T00:12:20.000Z | #include <torch/torch.h>
#include <torch/script.h>
#include <torch/autograd.h>
#include <torch/utils.h>
#include <iostream>
#include <unistd.h>
#include <iomanip>
int main() {
std::cout << "Current path is " << get_current_dir_name() << '\n';
//=============================================
// Recurrent Neural Net... | 28.871795 | 119 | 0.585258 | [
"shape"
] |
6b61ffb6c48f18022376e1e1af6bc5147f214acb | 4,071 | cpp | C++ | sunglasses/src/Extra/ShadowPointLight.cpp | jonathanbuchanan/Sunglasses | ab82b66f32650a813234cee8963f9b598ef5c1c8 | [
"MIT"
] | 1 | 2016-04-01T02:21:27.000Z | 2016-04-01T02:21:27.000Z | sunglasses/src/Extra/ShadowPointLight.cpp | jonathanbuchanan/Sunglasses | ab82b66f32650a813234cee8963f9b598ef5c1c8 | [
"MIT"
] | 49 | 2015-07-08T13:48:06.000Z | 2017-06-27T01:40:51.000Z | sunglasses/src/Extra/ShadowPointLight.cpp | jonathanbuchanan/Sunglasses | ab82b66f32650a813234cee8963f9b598ef5c1c8 | [
"MIT"
] | null | null | null | // Copyright 2016 Jonathan Buchanan.
// This file is part of Sunglasses, which is licensed under the MIT License.
// See LICENSE.md for details.
#include <sunglasses/Extra/ShadowPointLight.h>
#include <sunglasses/Graphics/Primitives.h>
#include <sunglasses/Graphics/Shader.h>
#include <glm/gtc/type_ptr.hpp>
namespace... | 38.046729 | 143 | 0.698845 | [
"render"
] |
6b67a024f162881740e8227412bc030387890bff | 148 | cpp | C++ | UUT/Core/ObjectFactory.cpp | kolyden/uut-engine | aa8e5a42c350aceecee668941e06ac626aac6c52 | [
"MIT"
] | null | null | null | UUT/Core/ObjectFactory.cpp | kolyden/uut-engine | aa8e5a42c350aceecee668941e06ac626aac6c52 | [
"MIT"
] | null | null | null | UUT/Core/ObjectFactory.cpp | kolyden/uut-engine | aa8e5a42c350aceecee668941e06ac626aac6c52 | [
"MIT"
] | null | null | null | #include "ObjectFactory.h"
#include "Object.h"
namespace uut
{
ObjectFactory::ObjectFactory()
{
}
ObjectFactory::~ObjectFactory() = default;
} | 13.454545 | 43 | 0.716216 | [
"object"
] |
6b6cb08511912e357c00ef7cf0d846e0c370c2be | 1,748 | cpp | C++ | sgd-comm/test_hash.cpp | a1exwang/dirty-linux-experiments | fb7f89e32e066e764045ab5a50f96d11d6173afe | [
"MIT"
] | null | null | null | sgd-comm/test_hash.cpp | a1exwang/dirty-linux-experiments | fb7f89e32e066e764045ab5a50f96d11d6173afe | [
"MIT"
] | null | null | null | sgd-comm/test_hash.cpp | a1exwang/dirty-linux-experiments | fb7f89e32e066e764045ab5a50f96d11d6173afe | [
"MIT"
] | null | null | null | #include "cache.hpp"
#include <cassert>
using namespace std;
int main() {
std::vector<std::pair<std::set<int>, std::tuple<int64_t, int64_t, int64_t, int64_t, int64_t>>> table = {
// total_images > total_cached_images
{{}, {90, 8, 1, 2, 100}},
// one replication
{{0}, {0, 2, 1, 2, 4}},
{{1}... | 27.3125 | 127 | 0.493135 | [
"vector"
] |
6b7edbe0c8dd38649c722133e86e5a03e765739d | 1,877 | cpp | C++ | cpp/max_heap.cpp | aocsa/cs_hackers_hub | b3c42932260720c60e2cc9a5d552f3987a45fa21 | [
"Apache-2.0"
] | 4 | 2021-03-04T02:45:26.000Z | 2021-05-28T22:51:45.000Z | cpp/max_heap.cpp | aocsa/cs_hackers_hub | b3c42932260720c60e2cc9a5d552f3987a45fa21 | [
"Apache-2.0"
] | 1 | 2021-03-14T16:12:32.000Z | 2021-03-14T16:12:32.000Z | cpp/max_heap.cpp | aocsa/cs_hackers_hub | b3c42932260720c60e2cc9a5d552f3987a45fa21 | [
"Apache-2.0"
] | 5 | 2021-03-16T05:20:48.000Z | 2021-03-24T01:46:28.000Z | #include <iostream>
#include <vector>
#include <memory>
#include <string>
#include <cstring>
//value of the parent node is greater than or equal to the value of its left and right child.
// We use an array to represent a maxheap. The root element is arr[0]. For an index i we have
// https://i1.wp.com/golangbyexample... | 25.364865 | 103 | 0.561534 | [
"vector"
] |
6b860a8410685d83c6785773a97426c96f1c6a7a | 4,412 | cpp | C++ | cpp/AnyValue3.cpp | so61pi/examples | 38e2831cd6517864fc05f499f72fbb4ff6ae27c0 | [
"MIT"
] | 4 | 2019-05-01T07:23:53.000Z | 2022-03-05T00:05:06.000Z | cpp/AnyValue3.cpp | so61pi/examples | 38e2831cd6517864fc05f499f72fbb4ff6ae27c0 | [
"MIT"
] | 16 | 2020-02-24T13:04:12.000Z | 2022-02-26T10:19:48.000Z | cpp/AnyValue3.cpp | so61pi/examples | 38e2831cd6517864fc05f499f72fbb4ff6ae27c0 | [
"MIT"
] | 1 | 2019-03-30T07:29:58.000Z | 2019-03-30T07:29:58.000Z | #include <cassert>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
#include <boost/any.hpp>
enum class Type {
String,
Number,
Boolean,
Null,
Object,
Array
};
struct Value {
Value() : type(Type::Null) {}
Type type;
boost::any internal;... | 20.054545 | 87 | 0.604034 | [
"object",
"vector"
] |
6b87b57b99c39d806278a5e09f632da6d99c52b3 | 2,467 | tcc | C++ | tuning/util/dp_data.tcc | jungmair/START | 0cb87becf6a4b0a60f4f8eb164c6ac1802c79238 | [
"MIT"
] | 23 | 2020-04-21T19:43:38.000Z | 2022-03-07T06:38:55.000Z | tuning/util/dp_data.tcc | jungmair/START | 0cb87becf6a4b0a60f4f8eb164c6ac1802c79238 | [
"MIT"
] | null | null | null | tuning/util/dp_data.tcc | jungmair/START | 0cb87becf6a4b0a60f4f8eb164c6ac1802c79238 | [
"MIT"
] | 4 | 2020-07-13T19:25:34.000Z | 2022-03-15T02:50:45.000Z | #pragma once
#include "../../util/compile-time-switch.tcc"
//data for optimization with dynamic programming
struct dp_data {
//during the dynamic programming, we need to store accumulated data for the last N tree levels
//for each tree level, one levelInfo struct is maintainted.
struct levelInfo {
... | 32.038961 | 98 | 0.567896 | [
"vector"
] |
6b87b8333b4c3dffcb212b52f4babe3adb3be936 | 588 | cpp | C++ | ICPC Cookbook/BIT.cpp | Mindjolt2406/Competitive-Programming | d000d98bf7005ee4fb809bcea2f110e4c4793b80 | [
"MIT"
] | 2 | 2018-12-11T14:37:24.000Z | 2022-01-23T18:11:54.000Z | ICPC Cookbook/BIT.cpp | Mindjolt2406/Competitive-Programming | d000d98bf7005ee4fb809bcea2f110e4c4793b80 | [
"MIT"
] | null | null | null | ICPC Cookbook/BIT.cpp | Mindjolt2406/Competitive-Programming | d000d98bf7005ee4fb809bcea2f110e4c4793b80 | [
"MIT"
] | null | null | null | // Only ll
typedef struct BIT //ll
{
vector<ll> bit;
int n;
void init(int n)
{
this->n = n;
bit.assign(n,0);
}
ll sum(int i)
{
ll res = 0;
for(;i>=0;i = (i&(i+1)) -1)
{
res+=bit[i];
}
return res;
}
void inc(int i, ll delta)
{
for(;i<n;i = i|(i+1))
{
... | 14 | 73 | 0.467687 | [
"vector"
] |
6b8ba5de7c844458206dc9a6c380b2a81867c79e | 30,673 | cpp | C++ | framework/graphics/graphics/texture/texture.cpp | YiJiangFengYun/vulkan-graphics-examples | e7b788b8f47dd238b08840c019940c7c52335a54 | [
"MIT"
] | 1 | 2018-03-01T01:05:25.000Z | 2018-03-01T01:05:25.000Z | framework/graphics/graphics/texture/texture.cpp | YiJiangFengYun/vulkan-graphics-examples | e7b788b8f47dd238b08840c019940c7c52335a54 | [
"MIT"
] | null | null | null | framework/graphics/graphics/texture/texture.cpp | YiJiangFengYun/vulkan-graphics-examples | e7b788b8f47dd238b08840c019940c7c52335a54 | [
"MIT"
] | null | null | null | #include "graphics/texture/texture.hpp"
namespace vg
{
inline uint32_t caculateImageSizeWithMipmapLevel(uint32_t size, uint32_t mipmapLevel);
TextureDataInfo::Component::Component(uint32_t mipLevel
, uint32_t baseArrayLayer
, uint32_t layerCount
, uint32_t size
, Bool32 hasImag... | 34.386771 | 137 | 0.573729 | [
"vector",
"transform"
] |
6b8bb7bf470f4cc16deb0b5c16563d8eedf59659 | 6,444 | cpp | C++ | python/inode.cpp | EricKTCheung/dmlite | 7fe31e16fc18e3c3d8b048a3507f7769ef3f8a9d | [
"Apache-2.0"
] | null | null | null | python/inode.cpp | EricKTCheung/dmlite | 7fe31e16fc18e3c3d8b048a3507f7769ef3f8a9d | [
"Apache-2.0"
] | null | null | null | python/inode.cpp | EricKTCheung/dmlite | 7fe31e16fc18e3c3d8b048a3507f7769ef3f8a9d | [
"Apache-2.0"
] | null | null | null | /*
* inode.cpp
*
* Python bindings for inode.h from the c++ dmlite library
* via Boost:Python.
*/
#include "pydmlite.h"
#include "inodewrapper.cpp"
void export_inode()
{
class_<IDirectory, boost::noncopyable >("IDirectory", no_init)
;
class_<ExtendedStat, bases< Extensible > >("ExtendedStat", in... | 48.089552 | 154 | 0.647734 | [
"vector"
] |
6b956def2300a1eafa15b4ab077b017bec02b752 | 27,582 | cpp | C++ | branch/old_angsys/angsys_beta3/source/angsys/angsys.shared/source/strings/string.cpp | ChuyX3/angsys | 89b2eaee866bcfd11e66efda49b38acc7468c780 | [
"Apache-2.0"
] | null | null | null | branch/old_angsys/angsys_beta3/source/angsys/angsys.shared/source/strings/string.cpp | ChuyX3/angsys | 89b2eaee866bcfd11e66efda49b38acc7468c780 | [
"Apache-2.0"
] | null | null | null | branch/old_angsys/angsys_beta3/source/angsys/angsys.shared/source/strings/string.cpp | ChuyX3/angsys | 89b2eaee866bcfd11e66efda49b38acc7468c780 | [
"Apache-2.0"
] | null | null | null | #include "pch.h"
#include "angsys.h"
#include "format_parser.h"
#include "string_factory.h"
using namespace ang;
using namespace ang::text;
ANG_IMPLEMENT_INTERFACE_CLASS_INFO(ang::text::istring_view, intf);
ANG_IMPLEMENT_INTERFACE_CLASS_INFO(ang::text::istring, istring_view);
#define MY_TYPE ang::text::istring_view
... | 32.072093 | 214 | 0.712421 | [
"object",
"vector"
] |
6b968760d90bde033c6f796deaa838a6e76af814 | 8,505 | cc | C++ | iree/hal/vulkan/dynamic_symbols.cc | aniket-daphale/iree | 6fdbbf8656a20a5ce00c465bef99c01c16e33409 | [
"Apache-2.0"
] | 1 | 2020-08-16T17:38:33.000Z | 2020-08-16T17:38:33.000Z | iree/hal/vulkan/dynamic_symbols.cc | aniket-daphale/iree | 6fdbbf8656a20a5ce00c465bef99c01c16e33409 | [
"Apache-2.0"
] | null | null | null | iree/hal/vulkan/dynamic_symbols.cc | aniket-daphale/iree | 6fdbbf8656a20a5ce00c465bef99c01c16e33409 | [
"Apache-2.0"
] | null | null | null | // Copyright 2019 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... | 38.484163 | 80 | 0.718636 | [
"object"
] |
6b9b0b794432ad766d8a48072338f48806e58809 | 1,832 | cc | C++ | cpp/PalindromePartitioning2.cc | speedfirst/leetcode | a4d95cf8d75f3cd4d1247ea66efebfb6a848ab51 | [
"BSD-3-Clause"
] | null | null | null | cpp/PalindromePartitioning2.cc | speedfirst/leetcode | a4d95cf8d75f3cd4d1247ea66efebfb6a848ab51 | [
"BSD-3-Clause"
] | null | null | null | cpp/PalindromePartitioning2.cc | speedfirst/leetcode | a4d95cf8d75f3cd4d1247ea66efebfb6a848ab51 | [
"BSD-3-Clause"
] | null | null | null | namepsace PalindromePartitioning2 {
class Solution {
public:
// This is a double dp solution.
// The first dp is to calculate the min cuts. dp[i] = min(dp[j + 1] + 1), given i <= j < n
// The second dp is to calculate whether a sub string s[i, j] is a palindrome.
// p[i][j] == p[i + 1][j - 1] && s... | 38.978723 | 95 | 0.433952 | [
"vector",
"model"
] |
6ba1d895f3dd2bf6f22c2e3e6a6d695d75e8d0c8 | 22,366 | cpp | C++ | src/ExtraEventHandlers.cpp | clearly-broken-software/dpf-nanovg-widgets | ddc82f8868b05c403c19c03a5bd13374acb51cc5 | [
"0BSD"
] | 2 | 2021-12-30T17:20:26.000Z | 2021-12-31T02:18:28.000Z | src/ExtraEventHandlers.cpp | clearly-broken-software/dpf-nanovg-widgets | ddc82f8868b05c403c19c03a5bd13374acb51cc5 | [
"0BSD"
] | null | null | null | src/ExtraEventHandlers.cpp | clearly-broken-software/dpf-nanovg-widgets | ddc82f8868b05c403c19c03a5bd13374acb51cc5 | [
"0BSD"
] | null | null | null | /*
* Copyright (C) 2021 Filipe Coelho <falktx@falktx.com>, Rob van den Berg <rghvdberg at gmail dot com
* SPDX-License-Identifier: ISC
*/
#include "ExtraEventHandlers.hpp"
#include "SubWidget.hpp"
START_NAMESPACE_DGL
// -----------------------------------------------------------------------------------------------... | 24.605061 | 119 | 0.555754 | [
"vector"
] |
6baa38f37421bb5f87cc188f92d33478f4e27432 | 4,851 | cpp | C++ | Game/Source/ModuleParticles.cpp | AMADE128/PlatformerGame | f81b25505781ef82171984e95f2a8b675767a715 | [
"MIT"
] | null | null | null | Game/Source/ModuleParticles.cpp | AMADE128/PlatformerGame | f81b25505781ef82171984e95f2a8b675767a715 | [
"MIT"
] | null | null | null | Game/Source/ModuleParticles.cpp | AMADE128/PlatformerGame | f81b25505781ef82171984e95f2a8b675767a715 | [
"MIT"
] | null | null | null | #include "ModuleParticles.h"
#include "App.h"
#include "Textures.h"
#include "Render.h"
#include "Collisions.h"
#include "Input.h"
#include "Player.h"
#include "Log.h"
#include "SDL/include/SDL_scancode.h"
#include "SDL/include/SDL.h"
#include "SDL/include/SDL_timer.h"
ModuleParticles::ModuleParticles() : Entity()
... | 25.134715 | 154 | 0.670171 | [
"render"
] |
6bac4018580d88d5dcf8ac861bed6a302b1e80c9 | 31,031 | hpp | C++ | Source/cx_matrix/cx_matrix.hpp | Vasar007/CxMatrix | 1ae2fa7bea6fb6377c5fd843b573b94a905c77b1 | [
"MIT"
] | 2 | 2018-12-08T09:13:58.000Z | 2018-12-08T09:14:11.000Z | Source/cx_matrix/cx_matrix.hpp | Vasar007/CxMatrix | 1ae2fa7bea6fb6377c5fd843b573b94a905c77b1 | [
"MIT"
] | 3 | 2018-10-12T21:46:34.000Z | 2019-01-31T11:40:33.000Z | Source/cx_matrix/cx_matrix.hpp | Vasar007/numerical_mathematics_methods | cca8d94057f684c70fbd0093ae56881d9d165aa0 | [
"Apache-2.0"
] | null | null | null | // Copyright (C) 2018 Vasily Vasilyev (vasar007@yandex.ru)
#pragma once
#include <iterator>
#include <algorithm>
#include <array>
#include <stdexcept>
#include <initializer_list>
#include <string>
#include <cmath>
#include <cassert>
#include <iterator>
#include <type_traits>
#include "cx_math.h"
#include "cx_algorth... | 28.031617 | 99 | 0.519158 | [
"vector"
] |
6bb0694d02e57ac68605615b731106c12c50f2ec | 3,087 | cpp | C++ | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/net/http/X509TrustManagerExtensions.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 7 | 2017-07-13T10:34:54.000Z | 2021-04-16T05:40:35.000Z | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/net/http/X509TrustManagerExtensions.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | null | null | null | Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/net/http/X509TrustManagerExtensions.cpp | jingcao80/Elastos | d0f39852356bdaf3a1234743b86364493a0441bc | [
"Apache-2.0"
] | 9 | 2017-07-13T12:33:20.000Z | 2021-06-19T02:46:48.000Z | //=========================================================================
// Copyright (C) 2012 The Elastos Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// ... | 31.824742 | 101 | 0.681892 | [
"object"
] |
6bb5857f57a0b61ac757d2801bbd65bb4a999229 | 890 | cpp | C++ | tools/info_gen/src/info_gen.cpp | neo-bolea/timen | 5e49caf8e0c9300d883ff3db9e878e4f82886af0 | [
"MIT"
] | null | null | null | tools/info_gen/src/info_gen.cpp | neo-bolea/timen | 5e49caf8e0c9300d883ff3db9e878e4f82886af0 | [
"MIT"
] | null | null | null | tools/info_gen/src/info_gen.cpp | neo-bolea/timen | 5e49caf8e0c9300d883ff3db9e878e4f82886af0 | [
"MIT"
] | null | null | null | #include <assert.h>
#include <direct.h>
#include <fstream>
#include <random>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
struct proc_info
{
int ProcID;
float Time;
};
void main()
{
assert(_chdir("../data") == 0);
std::ifstream sym_file("Log.out");
assert(!sym_file.fail());
std:... | 21.190476 | 69 | 0.673034 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.