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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0d017ef874e206085c129ae12a3ce7c4117ace6a | 989 | cpp | C++ | src/modules/communication/buffer.cpp | molayab/bobot-car-iot | 978a7ce279b894619f3b03ceb6d7675d8a414e2b | [
"MIT"
] | null | null | null | src/modules/communication/buffer.cpp | molayab/bobot-car-iot | 978a7ce279b894619f3b03ceb6d7675d8a414e2b | [
"MIT"
] | null | null | null | src/modules/communication/buffer.cpp | molayab/bobot-car-iot | 978a7ce279b894619f3b03ceb6d7675d8a414e2b | [
"MIT"
] | null | null | null | #include "modules/communication/communication.h"
using namespace Communication;
Buffer::Buffer() {
context = std::vector<uint8_t>();
}
void Buffer::write_byte(uint8_t byte) {
context.push_back(byte);
}
uint8_t Buffer::read_byte() {
auto value = context[0];
context.erase(context.begin());
return ... | 27.472222 | 102 | 0.683519 | [
"vector"
] |
0d0e8017f1b94d9ccb0c51798f7b112ebad33432 | 19,569 | hpp | C++ | src/detail/ComputeMatrixTransform.hpp | x4kkk3r/IOMath | 1101090023b57bd2db34e5a3e07a620b9311ac0b | [
"MIT"
] | 3 | 2020-07-23T11:49:35.000Z | 2020-07-24T12:22:28.000Z | src/detail/ComputeMatrixTransform.hpp | x4kkk3r/IOMath | 1101090023b57bd2db34e5a3e07a620b9311ac0b | [
"MIT"
] | null | null | null | src/detail/ComputeMatrixTransform.hpp | x4kkk3r/IOMath | 1101090023b57bd2db34e5a3e07a620b9311ac0b | [
"MIT"
] | 1 | 2020-07-23T12:18:58.000Z | 2020-07-23T12:18:58.000Z | /*
MIT License
Copyright (c) 2020 x4kkk3r
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.76875 | 201 | 0.649905 | [
"object"
] |
0d198356ec7f9ca6abf11a4b2271061996282c82 | 753 | cpp | C++ | 0000/10/17a.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | 1 | 2020-07-03T15:55:52.000Z | 2020-07-03T15:55:52.000Z | 0000/10/17a.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | null | null | null | 0000/10/17a.cpp | actium/cf | d7be128c3a9adb014a231a399f1c5f19e1ab2a38 | [
"Unlicense"
] | 3 | 2020-10-01T14:55:28.000Z | 2021-07-11T11:33:58.000Z | #include <algorithm>
#include <iostream>
#include <vector>
void answer(bool v)
{
constexpr const char* s[2] = { "NO", "YES" };
std::cout << s[v] << '\n';
}
void solve(unsigned n, unsigned k)
{
std::vector<unsigned> primes = { 2 };
for (unsigned x = 3; x <= n; x += 2) {
if (std::any_of(primes.c... | 18.825 | 100 | 0.499336 | [
"vector"
] |
0d1e492c777d2997044d54ac956adc57fa5b5638 | 31,532 | cc | C++ | wrappers/8.1.1/vtkChartXYWrap.cc | axkibe/node-vtk | 900ad7b5500f672519da5aa24c99aa5a96466ef3 | [
"BSD-3-Clause"
] | 6 | 2016-02-03T12:48:36.000Z | 2020-09-16T15:07:51.000Z | wrappers/8.1.1/vtkChartXYWrap.cc | axkibe/node-vtk | 900ad7b5500f672519da5aa24c99aa5a96466ef3 | [
"BSD-3-Clause"
] | 4 | 2016-02-13T01:30:43.000Z | 2020-03-30T16:59:32.000Z | wrappers/8.1.1/vtkChartXYWrap.cc | axkibe/node-vtk | 900ad7b5500f672519da5aa24c99aa5a96466ef3 | [
"BSD-3-Clause"
] | null | null | null | /* this file has been autogenerated by vtkNodeJsWrap */
/* editing this might proof futile */
#define VTK_WRAPPING_CXX
#define VTK_STREAMS_FWD_ONLY
#include <nan.h>
#include "vtkChartWrap.h"
#include "vtkChartXYWrap.h"
#include "vtkObjectBaseWrap.h"
#include "vtkContext2DWrap.h"
#include "vtkPlotWrap.h"
#include "vtk... | 31.06601 | 107 | 0.725136 | [
"object"
] |
0d22b9921037dda3f4fc5758082ab46cee35d22c | 5,699 | cpp | C++ | IfcPlusPlus/src/ifcpp/IFC4/IfcElementQuantity.cpp | linsipese/ifcppstudy | e09f05d276b5e129fcb6be65800472979cd4c800 | [
"MIT"
] | 1 | 2018-10-23T09:43:07.000Z | 2018-10-23T09:43:07.000Z | IfcPlusPlus/src/ifcpp/IFC4/IfcElementQuantity.cpp | linsipese/ifcppstudy | e09f05d276b5e129fcb6be65800472979cd4c800 | [
"MIT"
] | null | null | null | IfcPlusPlus/src/ifcpp/IFC4/IfcElementQuantity.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... | 49.556522 | 226 | 0.736971 | [
"vector",
"model"
] |
0d23842010111b4f979dad06c592ccf735b09378 | 30,571 | cpp | C++ | hackathon/fl_cellseg/src/FL_evolve.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | 1 | 2021-12-27T19:14:03.000Z | 2021-12-27T19:14:03.000Z | hackathon/fl_cellseg/src/FL_evolve.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | 1 | 2016-12-03T05:33:13.000Z | 2016-12-03T05:33:13.000Z | hackathon/fl_cellseg/src/FL_evolve.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | null | null | null | // curve/surface evolution according to the level set evolution equation in Chunming Li et al's paper:
// "Level Set Evolution Without Reinitialization: A New Variational Formulation"
// in Proceedings CVPR'2005
//latest 200910107
#ifndef __EVOLVE_CPP__
#define __EVOLVE_CPP__
#include <stdio.h>... | 25.518364 | 154 | 0.51526 | [
"3d"
] |
0d2630aa17075c40b82a5e7fde71ceb96064cde0 | 4,063 | cpp | C++ | src/EditorCamera.cpp | inugami-dev64/deng | 96e5bc4c9c9a91aa46cb7c71927853b0a764f7d9 | [
"Apache-2.0"
] | null | null | null | src/EditorCamera.cpp | inugami-dev64/deng | 96e5bc4c9c9a91aa46cb7c71927853b0a764f7d9 | [
"Apache-2.0"
] | null | null | null | src/EditorCamera.cpp | inugami-dev64/deng | 96e5bc4c9c9a91aa46cb7c71927853b0a764f7d9 | [
"Apache-2.0"
] | null | null | null | // DENG: dynamic engine - small but powerful 3D game engine
// licence: Apache, see LICENCE file
// file: EditorCamera.cpp - Editor camera class implementation
// author: Karl-Mihkel Ott
#define EDITOR_CAMERA_CPP
#include <EditorCamera.h>
namespace DENG {
EditorCamera::EditorCamera(Renderer &_rend, Window &_win,... | 37.971963 | 125 | 0.578144 | [
"3d"
] |
0d39d0eadeb85874e4d574fd2bba6aefdcaee1d1 | 9,399 | hpp | C++ | src/Algebra.hpp | clauderichard/OptimistRacing | 808ffcef44307c9097035bf5dacdcae8fc7663a7 | [
"MIT"
] | null | null | null | src/Algebra.hpp | clauderichard/OptimistRacing | 808ffcef44307c9097035bf5dacdcae8fc7663a7 | [
"MIT"
] | null | null | null | src/Algebra.hpp | clauderichard/OptimistRacing | 808ffcef44307c9097035bf5dacdcae8fc7663a7 | [
"MIT"
] | null | null | null | /* Copyright (C) 2012 Claude Richard
*
* Optimist Racing 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 3 of the License, or
* (at your option) any later version.
*
* Optimist Racing is... | 14.437788 | 112 | 0.597085 | [
"vector"
] |
0d461742d15c295bd7ffd8ef2497cdb41c364635 | 26,943 | hxx | C++ | include/quadruped-walkgen/quadruped_augmented_time.hxx | loco-3d/quadruped-walkgen | d78c205bcfcc69919eacb7cb4b51e426e2bc626f | [
"BSD-2-Clause"
] | null | null | null | include/quadruped-walkgen/quadruped_augmented_time.hxx | loco-3d/quadruped-walkgen | d78c205bcfcc69919eacb7cb4b51e426e2bc626f | [
"BSD-2-Clause"
] | null | null | null | include/quadruped-walkgen/quadruped_augmented_time.hxx | loco-3d/quadruped-walkgen | d78c205bcfcc69919eacb7cb4b51e426e2bc626f | [
"BSD-2-Clause"
] | 1 | 2021-12-06T18:28:31.000Z | 2021-12-06T18:28:31.000Z | #ifndef __quadruped_walkgen_quadruped_augmented_time_hxx__
#define __quadruped_walkgen_quadruped_augmented_time_hxx__
#include "crocoddyl/core/utils/exception.hpp"
namespace quadruped_walkgen {
template <typename Scalar>
ActionModelQuadrupedAugmentedTimeTpl<Scalar>::ActionModelQuadrupedAugmentedTimeTpl()
: crocod... | 39.505865 | 119 | 0.629551 | [
"vector",
"model"
] |
0d4b2fdbcf6d507d672d1bda39df8d10d0900ac1 | 5,002 | cpp | C++ | pfcp/pfcptest/pcaps/pcaps.cpp | AustinKnutsonSprint/epctools-1 | 5a1839fe5847a8e7a83362d080abf8af0e53d5fd | [
"Apache-2.0"
] | 1 | 2020-06-17T16:29:50.000Z | 2020-06-17T16:29:50.000Z | pfcp/pfcptest/pcaps/pcaps.cpp | AustinKnutsonSprint/epctools-1 | 5a1839fe5847a8e7a83362d080abf8af0e53d5fd | [
"Apache-2.0"
] | 1 | 2020-07-24T19:32:29.000Z | 2020-07-24T19:32:29.000Z | pfcp/pfcptest/pcaps/pcaps.cpp | AustinKnutsonSprint/epctools-1 | 5a1839fe5847a8e7a83362d080abf8af0e53d5fd | [
"Apache-2.0"
] | 4 | 2020-06-01T20:08:52.000Z | 2020-06-24T12:42:23.000Z | /*
* Copyright (c) 2020 T-Mobile
*
* 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 writin... | 35.225352 | 132 | 0.577169 | [
"vector"
] |
0d4b6b2ba530390d0a4602fa35bf51dc3eb270c8 | 449 | cpp | C++ | DzidzoAndHisSongs.cpp | OrlykM/Algotester | 6d0702b191610795beb959d378ab1feef6191b68 | [
"CC0-1.0"
] | null | null | null | DzidzoAndHisSongs.cpp | OrlykM/Algotester | 6d0702b191610795beb959d378ab1feef6191b68 | [
"CC0-1.0"
] | null | null | null | DzidzoAndHisSongs.cpp | OrlykM/Algotester | 6d0702b191610795beb959d378ab1feef6191b68 | [
"CC0-1.0"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
string s;
cin >> s;
if (s.size() >= 2 && s.size() <= 100)
{
vector<string> pairss;
for (int i = 0; i < s.size(); i++)
{
string temp = "";
temp += s[i];
s.erase(s.begin() + i);
pairss.push_back(s);
s.in... | 17.96 | 67 | 0.561247 | [
"vector"
] |
0d4fc66fafec384a6d707ba1d6438ef9f5663870 | 26,812 | cpp | C++ | tket/src/Transformations/CliffordReductionPass.cpp | NewGitter2017/tket | 6ff81af26280770bf2ca80bfb2140e8fa98182aa | [
"Apache-2.0"
] | null | null | null | tket/src/Transformations/CliffordReductionPass.cpp | NewGitter2017/tket | 6ff81af26280770bf2ca80bfb2140e8fa98182aa | [
"Apache-2.0"
] | null | null | null | tket/src/Transformations/CliffordReductionPass.cpp | NewGitter2017/tket | 6ff81af26280770bf2ca80bfb2140e8fa98182aa | [
"Apache-2.0"
] | null | null | null | // Copyright 2019-2021 Cambridge Quantum Computing
//
// 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... | 34.820779 | 80 | 0.61741 | [
"vector",
"transform"
] |
0d58e5d470f518366b386513ee84e6dc8afe3beb | 8,458 | cpp | C++ | Test/Math.cpp | AirGuanZ/Utils | 6ededbd838697682430a2c0746bfd3b36ff14a5b | [
"MIT"
] | 10 | 2018-10-30T14:19:57.000Z | 2021-12-06T07:46:59.000Z | Test/Math.cpp | AirGuanZ/Utils | 6ededbd838697682430a2c0746bfd3b36ff14a5b | [
"MIT"
] | null | null | null | Test/Math.cpp | AirGuanZ/Utils | 6ededbd838697682430a2c0746bfd3b36ff14a5b | [
"MIT"
] | 3 | 2019-04-24T13:42:02.000Z | 2021-06-28T08:17:28.000Z | #include <AGZUtils/Utils/Math.h>
#include "Catch.hpp"
using namespace AGZ::Math;
using namespace std;
TEST_CASE("Math")
{
SECTION("Angle")
{
REQUIRE(ApproxEq(PI<Radd>.value, 3.1415926, 1e-5));
REQUIRE(ApproxEq(PI<Degd>.value, 180.0, 1e-7));
REQUIRE(ApproxEq(PI<double>, 3.1415926, 1e-5... | 34.382114 | 102 | 0.461693 | [
"vector",
"transform"
] |
0d688d23cddda9f4bac6e477cb3171d6fa5b94c0 | 680 | cpp | C++ | 327.count-of-range-sum.cpp | bsmsnd/LeetCode-CharlieChen | db72f0a3463c9e723aac800cdbe38218b36aa639 | [
"MIT"
] | null | null | null | 327.count-of-range-sum.cpp | bsmsnd/LeetCode-CharlieChen | db72f0a3463c9e723aac800cdbe38218b36aa639 | [
"MIT"
] | null | null | null | 327.count-of-range-sum.cpp | bsmsnd/LeetCode-CharlieChen | db72f0a3463c9e723aac800cdbe38218b36aa639 | [
"MIT"
] | null | null | null | /*
* @lc app=leetcode id=327 lang=cpp
*
* [327] Count of Range Sum
*/
class Solution {
public:
int countRangeSum(vector<int>& nums, int lower, int upper) {
multiset<long long> sums;
int size = nums.size();
sums.insert(0);
int ans = 0;
long long sum = 0;
for (int i... | 27.2 | 143 | 0.55 | [
"vector"
] |
0d6b57c3c7e3d93dc9d1f6d2831913e08adb1409 | 4,904 | cpp | C++ | TAO/orbsvcs/examples/Notify/Lanes/Supplier.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 36 | 2015-01-10T07:27:33.000Z | 2022-03-07T03:32:08.000Z | TAO/orbsvcs/examples/Notify/Lanes/Supplier.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 2 | 2018-08-13T07:30:51.000Z | 2019-02-25T03:04:31.000Z | TAO/orbsvcs/examples/Notify/Lanes/Supplier.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 38 | 2015-01-08T14:12:06.000Z | 2022-01-19T08:33:00.000Z | // $Id: Supplier.cpp 91672 2010-09-08 18:44:58Z johnnyw $
#include "Supplier.h"
#include "tao/ORB_Core.h"
TAO_Notify_Lanes_Supplier::TAO_Notify_Lanes_Supplier (TAO_Notify_ORB_Objects& orb_objects)
: orb_objects_ (orb_objects)
, proxy_consumer_id_ (0)
, expected_consumer_count_ (2)
, consumers_connected_ (... | 29.542169 | 113 | 0.699837 | [
"object"
] |
0d6e67957443f721a4b9267b8a1617f5e1c7af65 | 525 | hh | C++ | src/BGL/BGLCommon.hh | revarbat/Mandoline | 1aafd7e6702ef740bcac6ab8c8c43282a104c60a | [
"BSD-2-Clause-FreeBSD"
] | 17 | 2015-01-07T10:32:06.000Z | 2021-07-06T11:00:38.000Z | src/BGL/BGLCommon.hh | revarbat/Mandoline | 1aafd7e6702ef740bcac6ab8c8c43282a104c60a | [
"BSD-2-Clause-FreeBSD"
] | 2 | 2017-08-17T17:44:42.000Z | 2018-06-14T23:39:04.000Z | src/BGL/BGLCommon.hh | revarbat/Mandoline | 1aafd7e6702ef740bcac6ab8c8c43282a104c60a | [
"BSD-2-Clause-FreeBSD"
] | 3 | 2015-01-07T10:32:06.000Z | 2019-03-22T16:56:51.000Z | //
// BGLCommon.hh
// Part of the Belfry Geometry Library
//
// Created by GM on 10/13/10.
// Copyright 2010 Belfry Software. All rights reserved.
//
#ifndef BGL_COMMON_H
#define BGL_COMMON_H
namespace BGL {
extern double EPSILON;
extern double CLOSEENOUGH;
typedef enum {
USED = 0,
OUTSIDE = 1,
INS... | 14.189189 | 56 | 0.655238 | [
"geometry"
] |
0d7f8e546b299f6d9d389a5b2c9bfe266ce9dd8a | 687 | hpp | C++ | week3-exercise3/drawable.hpp | jakah/hu-v1oopc-exercises | 74d830fa150525705306bcb59652cc9baa991985 | [
"MIT"
] | null | null | null | week3-exercise3/drawable.hpp | jakah/hu-v1oopc-exercises | 74d830fa150525705306bcb59652cc9baa991985 | [
"MIT"
] | null | null | null | week3-exercise3/drawable.hpp | jakah/hu-v1oopc-exercises | 74d830fa150525705306bcb59652cc9baa991985 | [
"MIT"
] | null | null | null | #ifndef DRAWABLE_HPP
#define DRAWABLE_HPP
#include <ostream>
#include "window.hpp"
#include "vector.hpp"
class drawable {
protected:
window w;
vector location;
vector size;
vector bounce;
public:
drawable( window & w, const vector & location, const vector & size, const vector & bounce = vector(1,1) );... | 24.535714 | 113 | 0.676856 | [
"vector"
] |
0d80e66121ef1bf5c2f2fc4732540ffdc5a98a73 | 12,427 | cc | C++ | src/board.cc | hiro-dot-exe/gunjin-shogi | 0dd2302c6a325333e7c5aaa498ef0a30502f1d04 | [
"MIT"
] | null | null | null | src/board.cc | hiro-dot-exe/gunjin-shogi | 0dd2302c6a325333e7c5aaa498ef0a30502f1d04 | [
"MIT"
] | null | null | null | src/board.cc | hiro-dot-exe/gunjin-shogi | 0dd2302c6a325333e7c5aaa498ef0a30502f1d04 | [
"MIT"
] | null | null | null | //-----------------------------------------------------------------------------
// Copyright (c) 2016 @hirodotexe. All rights reserved.
//-----------------------------------------------------------------------------
// Information on this class is described in "board.h".
//------------------------------------------... | 33.495957 | 80 | 0.592017 | [
"vector"
] |
0d84793a50214c21ea8e1b20177ae57be285e0b9 | 1,496 | hpp | C++ | Source/Entity.hpp | LepusM42/OrionEngine | b8c43d0d8473c19b840cc60cf1b6cc8bc9cbe37b | [
"MIT"
] | null | null | null | Source/Entity.hpp | LepusM42/OrionEngine | b8c43d0d8473c19b840cc60cf1b6cc8bc9cbe37b | [
"MIT"
] | 11 | 2021-04-28T23:48:00.000Z | 2021-12-28T06:33:28.000Z | Source/Entity.hpp | LepusM42/OrionEngine | b8c43d0d8473c19b840cc60cf1b6cc8bc9cbe37b | [
"MIT"
] | null | null | null | /*!*****************************************************************************
* \file Entity.hpp
* \author Lepus
* \brief This is a stub file, used as a template for all other files.
*******************************************************************************/
#pragma once
#include <vector>
#include <string>
name... | 27.2 | 80 | 0.530749 | [
"object",
"vector"
] |
0d896d42e19b9327a81377a2481318a1dd61ac65 | 3,163 | cpp | C++ | system/zombie/pogo.cpp | dnartz/PvZ-Emulator | 3954f36f4e0f22cee07d6a86003d3892f0938b8b | [
"BSD-2-Clause"
] | 1 | 2022-03-29T23:49:55.000Z | 2022-03-29T23:49:55.000Z | system/zombie/pogo.cpp | dnartz/PvZ-Emulator | 3954f36f4e0f22cee07d6a86003d3892f0938b8b | [
"BSD-2-Clause"
] | 2 | 2021-03-10T18:17:07.000Z | 2021-05-11T13:59:22.000Z | system/zombie/pogo.cpp | dnartz/PvZ-Emulator | 3954f36f4e0f22cee07d6a86003d3892f0938b8b | [
"BSD-2-Clause"
] | 1 | 2021-10-18T18:29:47.000Z | 2021-10-18T18:29:47.000Z | #include "zombie.h"
#include "system/util.h"
namespace pvz_emulator::system {
using namespace pvz_emulator::object;
void zombie_pogo::remove_stick(zombie& z) {
if (!z.has_item_or_walk_left) {
return;
}
z.action = zombie_action::falling;
z.status = zombie_status::walking;
reanim.update_s... | 25.103175 | 80 | 0.564338 | [
"object"
] |
0d8dbe10f6aaac420f5e7afad32d8127f266332d | 13,147 | cpp | C++ | ColliderBit/src/analyses/Analysis_ATLAS_7TeV_1OR2LEPStop_4_7invfb.cpp | GambitBSM/gambit_2.0 | a4742ac94a0352585a3b9dcb9b222048a5959b91 | [
"Unlicense"
] | 1 | 2021-09-17T22:53:26.000Z | 2021-09-17T22:53:26.000Z | ColliderBit/src/analyses/Analysis_ATLAS_7TeV_1OR2LEPStop_4_7invfb.cpp | GambitBSM/gambit_2.0 | a4742ac94a0352585a3b9dcb9b222048a5959b91 | [
"Unlicense"
] | 3 | 2021-07-22T11:23:48.000Z | 2021-08-22T17:24:41.000Z | ColliderBit/src/analyses/Analysis_ATLAS_7TeV_1OR2LEPStop_4_7invfb.cpp | GambitBSM/gambit_2.0 | a4742ac94a0352585a3b9dcb9b222048a5959b91 | [
"Unlicense"
] | 1 | 2021-08-14T10:31:41.000Z | 2021-08-14T10:31:41.000Z | //
// Created by dsteiner on 31/07/18.
// Amended by Martin White on 08/03/19.
//
// Based on https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/SUSY-2012-10/ (arXiv:1209.2102)
//#include <gambit/ColliderBit/colliders/SpecializablePythia.hpp>
#include "gambit/ColliderBit/analyses/Analysis.hpp"
#include "gambit/Coll... | 26.775967 | 135 | 0.609873 | [
"vector"
] |
0d948da8662828a36727ea07b9fb9ec73e217399 | 2,640 | hpp | C++ | AirLib/include/vehicles/plane/UFRotorParams.hpp | artemopolus/AirSim-1 | 4a741e79c0197acf3cb6f3397bc55ea1d267f8c8 | [
"MIT"
] | null | null | null | AirLib/include/vehicles/plane/UFRotorParams.hpp | artemopolus/AirSim-1 | 4a741e79c0197acf3cb6f3397bc55ea1d267f8c8 | [
"MIT"
] | null | null | null | AirLib/include/vehicles/plane/UFRotorParams.hpp | artemopolus/AirSim-1 | 4a741e79c0197acf3cb6f3397bc55ea1d267f8c8 | [
"MIT"
] | null | null | null | #ifndef msr_airlib_UFRotorParams_hpp
#define msr_airlib_UFRotorParams_hpp
#include "UniForceParams.hpp"
namespace msr {
namespace airlib {
class UFRotorParams : public UniForceParams
{
public:
UFRotorParams()
{
initialize();
}
virtual void calculateMaxThrust() {
revolutions_per_second = max_... | 31.807229 | 94 | 0.669697 | [
"vector"
] |
0d94a23d361f7465614c3c10d317ad35632656c5 | 1,578 | hpp | C++ | src/lib/reseau_graphe/machine/Ordinateur.hpp | uvsq21603504/in608-tcp_ip_simulation | 95cedcbe7dab5991b84e182297b6ada3ae24679b | [
"MIT"
] | null | null | null | src/lib/reseau_graphe/machine/Ordinateur.hpp | uvsq21603504/in608-tcp_ip_simulation | 95cedcbe7dab5991b84e182297b6ada3ae24679b | [
"MIT"
] | null | null | null | src/lib/reseau_graphe/machine/Ordinateur.hpp | uvsq21603504/in608-tcp_ip_simulation | 95cedcbe7dab5991b84e182297b6ada3ae24679b | [
"MIT"
] | null | null | null | #pragma once
#include <map>
#include <deque>
#include "Machine.hpp"
#include "../../../include/ParamInterface.hpp"
#include "../../protocole_tcp_ip/transport/Transport.hpp"
#include "../../../include/ElementControleCongestion.hpp"
class Ordinateur : public Machine {
private:
// Attributs
static u... | 28.178571 | 79 | 0.589354 | [
"vector"
] |
0d97bbcbed19d6d6542d90189f19f017f260be8a | 5,626 | cpp | C++ | src/main.cpp | superman-t/BinaryTreePacker | 6860064d0eaf27375d9fb75d3f7fc53ac368ab6c | [
"MIT"
] | 2 | 2019-05-31T11:05:18.000Z | 2021-01-22T08:58:04.000Z | src/main.cpp | superman-t/BinaryTreePacker | 6860064d0eaf27375d9fb75d3f7fc53ac368ab6c | [
"MIT"
] | null | null | null | src/main.cpp | superman-t/BinaryTreePacker | 6860064d0eaf27375d9fb75d3f7fc53ac368ab6c | [
"MIT"
] | null | null | null | #include "nanogui.h"
#include <iostream>
#include <string>
#include <cstdint>
#include <memory>
#include <utility>
#include "BinPack.h"
#include <random>
#include <queue>
using std::cout;
using std::cerr;
using std::endl;
using std::string;
using std::vector;
using std::pair;
using std::to_string;
using namespace BP;... | 21.310606 | 108 | 0.616779 | [
"vector"
] |
31020d92e4b268a5e5b0c14583c485d9b993599b | 1,289 | hpp | C++ | framework/sphere.hpp | caixiaoniweimar/programmiersprachen-raytracer | 98b5e9bcf89bbc81c18160221a2c7c34a130cf35 | [
"MIT"
] | null | null | null | framework/sphere.hpp | caixiaoniweimar/programmiersprachen-raytracer | 98b5e9bcf89bbc81c18160221a2c7c34a130cf35 | [
"MIT"
] | null | null | null | framework/sphere.hpp | caixiaoniweimar/programmiersprachen-raytracer | 98b5e9bcf89bbc81c18160221a2c7c34a130cf35 | [
"MIT"
] | null | null | null | #ifndef SPHERE_HPP
#define SPHERE_HPP
#include <glm/vec3.hpp>
#include <glm/glm.hpp>
#include <glm/gtx/intersect.hpp>
#include "shape.hpp"
#include <string>
#include "material.hpp"
using namespace std;
// Mittelpunkt und einen Radius
// Konstruktor; get-Methoden; Methoden area und volume
class Sphere : publ... | 26.306122 | 111 | 0.734678 | [
"shape"
] |
310bd408a229ac82e07508945e9ed37773dfbe5b | 2,068 | cpp | C++ | src/DotNet/DNSequence.cpp | divyang4481/quickfast | 339c78e96a1f63b74c139afa1a3c9a07afff7b5f | [
"BSD-3-Clause"
] | 198 | 2015-04-26T08:06:18.000Z | 2022-03-13T01:31:50.000Z | src/DotNet/DNSequence.cpp | divyang4481/quickfast | 339c78e96a1f63b74c139afa1a3c9a07afff7b5f | [
"BSD-3-Clause"
] | 15 | 2015-07-07T19:47:08.000Z | 2022-02-04T05:56:51.000Z | src/DotNet/DNSequence.cpp | divyang4481/quickfast | 339c78e96a1f63b74c139afa1a3c9a07afff7b5f | [
"BSD-3-Clause"
] | 96 | 2015-04-24T15:19:43.000Z | 2022-03-28T13:15:11.000Z | // Copyright (c) 2009, 2010 Object Computing, Inc.
// All rights reserved.
// See the file license.txt for licensing information.
#include "QuickFASTDotNetPch.h"
#include "DNSequence.h"
#include <DotNet/ImplSequence.h>
#include <DotNet/DNFieldSet.h>
#include <DotNet/StringConversion.h>
using namespace QuickFAST;
using... | 17.982609 | 95 | 0.717602 | [
"object"
] |
310bda735ab0942df3ed0be7eed483812e69a93a | 3,032 | hpp | C++ | include/LiteNetLib/Utils/NetPacketProcessor_SubscribeDelegate.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/LiteNetLib/Utils/NetPacketProcessor_SubscribeDelegate.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/LiteNetLib/Utils/NetPacketProcessor_SubscribeDelegate.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "extern/beatsaber-hook/shared/utils/typedefs.h"
// Including type: LiteNetLib.Utils.NetPacketProcessor
#include "LiteNetLib/Utils/NetPack... | 51.389831 | 164 | 0.743734 | [
"object"
] |
310d9b01ac0489610598cc16219d16565ebfaa72 | 50,736 | cpp | C++ | src/ConstraintSolver/SolverFunctions.cpp | peizhan/psketcher | d84be7c64b101e3ec5fdec416a21c4a4674f535d | [
"BSD-2-Clause"
] | 1 | 2022-03-01T09:03:40.000Z | 2022-03-01T09:03:40.000Z | src/ConstraintSolver/SolverFunctions.cpp | peizhan/psketcher | d84be7c64b101e3ec5fdec416a21c4a4674f535d | [
"BSD-2-Clause"
] | null | null | null | src/ConstraintSolver/SolverFunctions.cpp | peizhan/psketcher | d84be7c64b101e3ec5fdec416a21c4a4674f535d | [
"BSD-2-Clause"
] | 1 | 2022-03-01T09:03:42.000Z | 2022-03-01T09:03:42.000Z | /*
Copyright (c) 2006-2014, Michael Greminger
All rights reserved.
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 fo... | 54.321199 | 704 | 0.70246 | [
"vector"
] |
310db9ca4092f6a78dc7559e780e18c3c0041c4d | 3,913 | cc | C++ | media/cast/logging/simple_event_subscriber_unittest.cc | iplo/Chain | 8bc8943d66285d5258fffc41bed7c840516c4422 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 231 | 2015-01-08T09:04:44.000Z | 2021-12-30T03:03:10.000Z | media/cast/logging/simple_event_subscriber_unittest.cc | JasonEric/chromium | c7361d39be8abd1574e6ce8957c8dbddd4c6ccf7 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2017-02-14T21:55:58.000Z | 2017-02-14T21:55:58.000Z | media/cast/logging/simple_event_subscriber_unittest.cc | JasonEric/chromium | c7361d39be8abd1574e6ce8957c8dbddd4c6ccf7 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 268 | 2015-01-21T05:53:28.000Z | 2022-03-25T22:09:01.000Z | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/memory/ref_counted.h"
#include "base/memory/scoped_ptr.h"
#include "base/test/simple_test_tick_clock.h"
#include "base/time/tick_clock.h"
#... | 43 | 80 | 0.743419 | [
"vector"
] |
310e910ae398e1d5ebc24bdde116b1937b439798 | 6,541 | cpp | C++ | bindings/ruby/sfml-audio/audio/SoundBufferRecorder.cpp | yoyonel/sflm2-custom | 1ebeabe7cfe6605590b341f7b415b24bed1f50d1 | [
"Zlib"
] | null | null | null | bindings/ruby/sfml-audio/audio/SoundBufferRecorder.cpp | yoyonel/sflm2-custom | 1ebeabe7cfe6605590b341f7b415b24bed1f50d1 | [
"Zlib"
] | null | null | null | bindings/ruby/sfml-audio/audio/SoundBufferRecorder.cpp | yoyonel/sflm2-custom | 1ebeabe7cfe6605590b341f7b415b24bed1f50d1 | [
"Zlib"
] | null | null | null | /* rbSFML - Copyright (c) 2010 Henrik Valter Vogelius Hansson - groogy@groogy.se
* This software is provided 'as-is', without any express or
* implied warranty. In no event will the authors be held
* liable for any damages arising from the use of this software.
*
* Permission is granted to anyone to use this softw... | 31 | 121 | 0.717169 | [
"object"
] |
3112bd6e96937f68e79b6ce201c7f4a97aa818b7 | 20,338 | cpp | C++ | wdbecmbd/IexWdbe/JobWdbeIexPrj.cpp | mpsitech/wdbe-WhizniumDBE | 27360ce6569dc55098a248b8a0a4b7e3913a6ce6 | [
"MIT"
] | 4 | 2020-10-27T14:33:25.000Z | 2021-08-07T20:55:42.000Z | wdbecmbd/IexWdbe/JobWdbeIexPrj.cpp | mpsitech/wdbe-WhizniumDBE | 27360ce6569dc55098a248b8a0a4b7e3913a6ce6 | [
"MIT"
] | null | null | null | wdbecmbd/IexWdbe/JobWdbeIexPrj.cpp | mpsitech/wdbe-WhizniumDBE | 27360ce6569dc55098a248b8a0a4b7e3913a6ce6 | [
"MIT"
] | null | null | null | /**
* \file JobWdbeIexPrj.cpp
* job handler for job JobWdbeIexPrj (implementation)
* \copyright (C) 2016-2020 MPSI Technologies GmbH
* \author Alexander Wirthmueller (auto-generation)
* \date created: 28 Nov 2020
*/
// IP header --- ABOVE
#ifdef WDBECMBD
#include <Wdbecmbd.h>
#else
#include <Wdbed.h>
#endif
#... | 28.325905 | 226 | 0.673763 | [
"vector"
] |
31171953ef8fdbbe3ab67c1390ff5e9e73ca3c94 | 29,996 | cpp | C++ | Common/Drawer/ssplayer_render_gl.cpp | SpriteStudio/SpriteStudio6-SDK | f2ad84c8e3ca9d189904da9c3d1114bb4044eecb | [
"BSD-3-Clause"
] | 18 | 2017-11-08T05:14:20.000Z | 2022-03-29T01:18:50.000Z | Common/Drawer/ssplayer_render_gl.cpp | SpriteStudio/SpriteStudio6-SDK | f2ad84c8e3ca9d189904da9c3d1114bb4044eecb | [
"BSD-3-Clause"
] | 29 | 2017-11-14T03:28:34.000Z | 2022-03-15T11:18:29.000Z | Common/Drawer/ssplayer_render_gl.cpp | SpriteStudio/SpriteStudio6-SDK | f2ad84c8e3ca9d189904da9c3d1114bb4044eecb | [
"BSD-3-Clause"
] | 11 | 2017-11-08T05:11:12.000Z | 2021-04-02T22:20:40.000Z | #include <stdio.h>
#include <cstdlib>
#include "ssOpenGLSetting.h"
#include <map>
#include <memory>
#include "../Helper/OpenGL/SSTextureGL.h"
#include "../Animator/ssplayer_animedecode.h"
#include "../Animator/ssplayer_matrix.h"
#include "ssplayer_render_gl.h"
#include "ssplayer_shader_gl.h"
#include "ssplayer... | 22.89771 | 152 | 0.678124 | [
"mesh",
"vector"
] |
311e28cf293497dfc33abe18555129d1f463e024 | 2,323 | hpp | C++ | CanteraPFR/include/CanteraPFR/ConstAreaPFR.hpp | waltermateriais/CanteraPFR | 46437e39793ad45897c658dd2cd5aaf8d9e9c04c | [
"Unlicense"
] | 8 | 2019-12-29T20:52:45.000Z | 2021-11-10T08:38:17.000Z | CanteraPFR/include/CanteraPFR/ConstAreaPFR.hpp | waltermateriais/CanteraPFR | 46437e39793ad45897c658dd2cd5aaf8d9e9c04c | [
"Unlicense"
] | null | null | null | CanteraPFR/include/CanteraPFR/ConstAreaPFR.hpp | waltermateriais/CanteraPFR | 46437e39793ad45897c658dd2cd5aaf8d9e9c04c | [
"Unlicense"
] | 2 | 2019-04-22T21:28:35.000Z | 2022-02-21T15:36:45.000Z | // ***************************************************************************
// Provides a generic constant area plug-flow reactor model.
//
// Author : Walter Dal'Maz Silva
// Date : December 30th 2018
// ***************************************************************************
#ifndef __CONSTAREAPFR_HPP__
#def... | 31.391892 | 80 | 0.470512 | [
"model"
] |
311e3d4648ac5aada90b58d8687196b7a81e1b8b | 1,289 | cpp | C++ | week27/I.cpp | webturing/ACMProgramming2020 | 94c01645420c5fbc303a0eb1ed74ebb6679ab398 | [
"MIT"
] | 3 | 2020-05-31T08:41:56.000Z | 2020-09-27T15:14:03.000Z | week27/I.cpp | webturing/ACMProgramming2020 | 94c01645420c5fbc303a0eb1ed74ebb6679ab398 | [
"MIT"
] | null | null | null | week27/I.cpp | webturing/ACMProgramming2020 | 94c01645420c5fbc303a0eb1ed74ebb6679ab398 | [
"MIT"
] | null | null | null | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T=int>
inline void oo(const string &str, T val) { cerr << str << val << endl; }
template<typename T=int>
inline T read() {
T x;
cin >> x;
return ... | 27.425532 | 87 | 0.541505 | [
"vector"
] |
31210a8c0a46018b74b72f23489e78419031da3c | 18,555 | cpp | C++ | includes/visualization/plot_model.cpp | Biehrer/ecg-analyzer | b72ce81e8834ed0aec4c5ecb08dae02bde5cd25a | [
"Apache-2.0"
] | 4 | 2020-04-14T06:28:14.000Z | 2021-02-22T03:10:43.000Z | includes/visualization/plot_model.cpp | Biehrer/ecg-analyzer | b72ce81e8834ed0aec4c5ecb08dae02bde5cd25a | [
"Apache-2.0"
] | 31 | 2020-04-03T10:09:16.000Z | 2020-10-23T11:55:30.000Z | includes/visualization/plot_model.cpp | Biehrer/ecg-analyzer | b72ce81e8834ed0aec4c5ecb08dae02bde5cd25a | [
"Apache-2.0"
] | 1 | 2021-09-03T14:55:11.000Z | 2021-09-03T14:55:11.000Z | #include "plot_model.h"
#include "plot_model.h"
PlotModel_C::PlotModel_C(QObject* parent)
:/*QAbstractItemModel(parent)*/ QAbstractTableModel(parent)
{
//setIndexWidget(index, new QLineEdit);
}
PlotModel_C::~PlotModel_C()
{
}
// Sets the first row and determines the layout ( with #COLS items)
QVariant
... | 34.108456 | 197 | 0.631258 | [
"geometry",
"vector"
] |
3129a8b6f3ab61c459167c6f226f9cc0a72be007 | 9,030 | cpp | C++ | miniProj/temp/SudokuMain.cpp | yongsenliu/cxxBootCamp2021 | 95adfe1a0ec0dc16448dcc44590b3e9d1f00f186 | [
"MIT"
] | null | null | null | miniProj/temp/SudokuMain.cpp | yongsenliu/cxxBootCamp2021 | 95adfe1a0ec0dc16448dcc44590b3e9d1f00f186 | [
"MIT"
] | 1 | 2021-11-08T12:44:38.000Z | 2021-11-10T00:04:10.000Z | miniProj/temp/SudokuMain.cpp | yongsenliu/cxxBootCamp2021 | 95adfe1a0ec0dc16448dcc44590b3e9d1f00f186 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
#include <memory>
#define N 9
using namespace std;
/**************************************************************
// Two dimentional array for passing numbers to sovler one by one
**************************************************************/
int sudoku[N][N... | 27.035928 | 93 | 0.447619 | [
"vector"
] |
3131fa6e4ea598084d359cc8fab1590279d30221 | 4,431 | cpp | C++ | MIRZA/1/src/MIRZA.cpp | zavolanlab/Dockerfiles | 4457207fd584e84b1ab7f7589da5816bb99b647e | [
"Apache-2.0"
] | 6 | 2018-11-02T10:51:17.000Z | 2022-01-04T15:50:47.000Z | MIRZA/1/src/MIRZA.cpp | zavolanlab/Dockerfiles | 4457207fd584e84b1ab7f7589da5816bb99b647e | [
"Apache-2.0"
] | 36 | 2018-10-10T11:45:59.000Z | 2021-04-09T15:13:21.000Z | MIRZA/1/src/MIRZA.cpp | zavolanlab/Dockerfiles | 4457207fd584e84b1ab7f7589da5816bb99b647e | [
"Apache-2.0"
] | 2 | 2018-11-23T20:51:47.000Z | 2019-02-05T14:34:29.000Z | // ===========================================================================
// Name : MIRZA.cpp
// Author : Mohsen Khorshid
// Copyright : University of Basel, 2010
// Description : Alignment model miRNA to mRNA target
// ===========================================================================
//
//... | 31.425532 | 142 | 0.723313 | [
"model"
] |
31367b1028d93377c8305f27060a9278d6d293d7 | 7,140 | cpp | C++ | module-sys/SystemManager/tests/test-DependencyGraph.cpp | bitigchi/MuditaOS | 425d23e454e09fd6ae274b00f8d19c57a577aa94 | [
"BSL-1.0"
] | 369 | 2021-11-10T09:20:29.000Z | 2022-03-30T06:36:58.000Z | module-sys/SystemManager/tests/test-DependencyGraph.cpp | bitigchi/MuditaOS | 425d23e454e09fd6ae274b00f8d19c57a577aa94 | [
"BSL-1.0"
] | 149 | 2021-11-10T08:38:35.000Z | 2022-03-31T23:01:52.000Z | module-sys/SystemManager/tests/test-DependencyGraph.cpp | 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
#include <catch2/catch.hpp>
#include "Service/ServiceCreator.hpp"
#include "SystemManager/DependencyGraph.hpp"
#include "SystemManager/graph/TopologicalSort.hpp"
using namespace sys;... | 40.568182 | 113 | 0.67465 | [
"vector"
] |
313737e5d255562877d970cb27ef7f278a2ce67d | 3,108 | cc | C++ | plugins/devtools/bridge/inspector/protocol/scope.cc | devjiangzhou/kraken | d7b48100f8a017a9ccb9ea1628e319d8f1159c91 | [
"Apache-2.0"
] | 4,465 | 2020-12-04T08:56:15.000Z | 2022-03-31T19:04:00.000Z | plugins/devtools/bridge/inspector/protocol/scope.cc | devjiangzhou/kraken | d7b48100f8a017a9ccb9ea1628e319d8f1159c91 | [
"Apache-2.0"
] | 796 | 2021-01-05T08:21:00.000Z | 2022-03-31T13:31:28.000Z | plugins/devtools/bridge/inspector/protocol/scope.cc | devjiangzhou/kraken | d7b48100f8a017a9ccb9ea1628e319d8f1159c91 | [
"Apache-2.0"
] | 261 | 2020-12-04T11:32:42.000Z | 2022-03-31T03:34:47.000Z | /*
* Copyright (C) 2020 Alibaba Inc. All rights reserved.
* Author: Kraken Team.
*/
#include "scope.h"
namespace kraken {
namespace debugger {
const char *Scope::TypeEnum::Global = "global";
const char *Scope::TypeEnum::Local = "local";
const char *Scope::TypeEnum::With = "with";
const char *Scope::TypeEnum::Clos... | 31.393939 | 106 | 0.659588 | [
"object"
] |
313918aa8fdf3a8807679115edc794b29966347a | 2,699 | hpp | C++ | src/base/rmg/internal/object2d_shader.hpp | khantkyawkhaung/robot-monitor-graphics | 2d365b3f3537e141cd1ec82f840c300abd79082b | [
"MIT"
] | 2 | 2020-06-16T14:47:11.000Z | 2020-07-09T15:34:55.000Z | src/base/rmg/internal/object2d_shader.hpp | khantkyawkhaung/robot-monitor-graphics | 2d365b3f3537e141cd1ec82f840c300abd79082b | [
"MIT"
] | null | null | null | src/base/rmg/internal/object2d_shader.hpp | khantkyawkhaung/robot-monitor-graphics | 2d365b3f3537e141cd1ec82f840c300abd79082b | [
"MIT"
] | null | null | null | /**
* @file object2d_shader.hpp
* @brief Displays 2D objects like sprites and texts
*
* @copyright Copyright (c) 2020 Khant Kyaw Khaung
*
* @license{This project is released under the MIT License.}
*/
#pragma once
#ifndef __RMG_OBJECT2D_SHADER_H__
#define __RMG_OBJECT2D_SHADER_H__
#ifndef RMG_API
#ifdef _WI... | 18.874126 | 69 | 0.626528 | [
"render",
"object"
] |
3140aaedc2d3a11f5a608ba66744298f10c5f0bc | 2,211 | cpp | C++ | Source/Scene.cpp | maxattack/Trinket | b989bc88800ac858f0a150858e1c9670b88d4aad | [
"Unlicense"
] | 1 | 2020-06-11T21:31:25.000Z | 2020-06-11T21:31:25.000Z | Source/Scene.cpp | maxattack/Trinket | b989bc88800ac858f0a150858e1c9670b88d4aad | [
"Unlicense"
] | null | null | null | Source/Scene.cpp | maxattack/Trinket | b989bc88800ac858f0a150858e1c9670b88d4aad | [
"Unlicense"
] | null | null | null | // Trinket Game Engine
// (C) 2020 Max Kaufmann <max.kaufmann@gmail.com>
#include "Scene.h"
#include <shared_mutex>
Scene::Scene()
: mgr(false)
{
mgr.ReserveCompact(1024);
CreateSublevel("Default Level");
}
Scene::~Scene() {
}
ObjectID Scene::CreateObject(Name name) {
return mgr.CreateObject(name);
}
ObjectID... | 23.273684 | 75 | 0.715966 | [
"vector"
] |
3144da783190bc12cff0f6d0e3a69cd7b88cadf7 | 2,016 | cpp | C++ | src/NextionIf.cpp | jyberg/ITEADLIB_Arduino_Nextion | 3448d5beeb49b11aeb1d791929f845e435d8516c | [
"MIT"
] | 42 | 2019-04-29T11:35:14.000Z | 2022-02-22T18:55:37.000Z | src/NextionIf.cpp | jyberg/ITEADLIB_Arduino_Nextion | 3448d5beeb49b11aeb1d791929f845e435d8516c | [
"MIT"
] | 26 | 2019-11-18T14:12:16.000Z | 2022-03-09T16:44:20.000Z | src/NextionIf.cpp | jyberg/ITEADLIB_Arduino_Nextion | 3448d5beeb49b11aeb1d791929f845e435d8516c | [
"MIT"
] | 24 | 2019-07-04T10:47:23.000Z | 2022-01-20T05:33:19.000Z | /**
* @file NextionIf.cpp
*
* Implementation of class NextionIf
*
* @author Jyrki Berg 11/23/2019 (https://github.com/jyberg)
*
* @copyright 2020 Jyrki Berg
*
**/
#include "NextionIf.h"
#include "NexHardware.h"
NextionIf::NextionIf(Nextion *nextion):m_nextion{nextion}
{}
NextionIf::~NextionIf()
{}
bool... | 21.221053 | 91 | 0.750992 | [
"vector"
] |
314c864c13c7a81c557cb59dd4e9bf705070aeb6 | 2,360 | cpp | C++ | src/CollapsedBayesEngine.cpp | arunchaganty/ctm-cvb | 3e0fd5afe904b3e205ebfa422b6a1f677cee75c0 | [
"BSD-3-Clause"
] | 2 | 2019-11-24T02:58:21.000Z | 2020-02-29T14:31:58.000Z | src/CollapsedBayesEngine.cpp | arunchaganty/ctm-cvb | 3e0fd5afe904b3e205ebfa422b6a1f677cee75c0 | [
"BSD-3-Clause"
] | null | null | null | src/CollapsedBayesEngine.cpp | arunchaganty/ctm-cvb | 3e0fd5afe904b3e205ebfa422b6a1f677cee75c0 | [
"BSD-3-Clause"
] | null | null | null | /*
* ctm-cvb
*
* Collapsed Variational Bayes Inference Engine
*/
#include <iostream>
#include <limits>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;
#include "ctm.h"
#include "util.h"
#include "ctm-data.h"
#include "CollapsedBayesEngine.h"
#include <gsl/gsl_vector.h>
#include <g... | 22.056075 | 77 | 0.600424 | [
"model"
] |
315772fa66ca41c02e6ded987c757106b8de616a | 430 | cpp | C++ | Algorithms/0877.Stone_Game.cpp | metehkaya/LeetCode | 52f4a1497758c6f996d515ced151e8783ae4d4d2 | [
"MIT"
] | 2 | 2020-07-20T06:40:22.000Z | 2021-11-20T01:23:26.000Z | Problems/LeetCode/Problems/0877.Stone_Game.cpp | metehkaya/Algo-Archive | 03b5fdcf06f84a03125c57762c36a4e03ca6e756 | [
"MIT"
] | null | null | null | Problems/LeetCode/Problems/0877.Stone_Game.cpp | metehkaya/Algo-Archive | 03b5fdcf06f84a03125c57762c36a4e03ca6e756 | [
"MIT"
] | null | null | null | class Solution {
public:
bool stoneGame(vector<int>& ar) {
int n = ar.size();
int dp[n][n];
for( int i = 0 ; i < n ; i++ )
dp[i][i] = ar[i];
for( int len = 2 ; len <= n ; len++ )
for( int i = 0 ; i <= n-len ; i++ ) {
int j = i+len-1;
... | 28.666667 | 66 | 0.355814 | [
"vector"
] |
315c79cb7f527032f1e7f9337bfcb134eec7eab4 | 333,575 | cpp | C++ | test/tailoring_rule_test_zh_pinyin_004.cpp | jan-moeller/text | c61e51c82dfb0ae6e74200c01ce040fa6db730c4 | [
"BSL-1.0"
] | null | null | null | test/tailoring_rule_test_zh_pinyin_004.cpp | jan-moeller/text | c61e51c82dfb0ae6e74200c01ce040fa6db730c4 | [
"BSL-1.0"
] | 1 | 2021-03-05T12:56:59.000Z | 2021-03-05T13:11:53.000Z | test/tailoring_rule_test_zh_pinyin_004.cpp | jan-moeller/text | c61e51c82dfb0ae6e74200c01ce040fa6db730c4 | [
"BSL-1.0"
] | 3 | 2019-10-30T18:38:15.000Z | 2021-03-05T12:10:13.000Z |
// Warning! This file is autogenerated.
#include <boost/text/collation_table.hpp>
#include <boost/text/collate.hpp>
#include <boost/text/data/all.hpp>
#ifndef LIMIT_TESTING_FOR_CI
#include <boost/text/save_load_table.hpp>
#include <boost/filesystem.hpp>
#endif
#include <gtest/gtest.h>
using namespace boost::text;
... | 32.310635 | 74 | 0.564068 | [
"vector"
] |
315fd3e37d2d7d63d956a20b3d07d996c9d522bd | 4,089 | cpp | C++ | Computer Graphics Principles/tests/performanceTest.cpp | xstupi00/SchoolProject | 00e79c05105b48a64f918bd26da262516158572c | [
"MIT"
] | null | null | null | Computer Graphics Principles/tests/performanceTest.cpp | xstupi00/SchoolProject | 00e79c05105b48a64f918bd26da262516158572c | [
"MIT"
] | null | null | null | Computer Graphics Principles/tests/performanceTest.cpp | xstupi00/SchoolProject | 00e79c05105b48a64f918bd26da262516158572c | [
"MIT"
] | null | null | null | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <vector>
#include <student/linearAlgebra.h>
#include <student/mouseCamera.h>
#include <student/student_cpu.h>
#include <student/globals.h>
#include <tests/performanceTest.h>
void runPerformanceTest() {
int32_t windowWidth ... | 36.508929 | 80 | 0.686965 | [
"vector"
] |
31671e777b5f7b97714723b7257aa8635fc393d3 | 12,202 | cpp | C++ | src/ui/selection/SelectionControl.cpp | danielroth1/CAE | 7eaa096e45fd32f55bd6de94c30dcf706c6f2093 | [
"MIT"
] | 5 | 2019-04-20T17:48:10.000Z | 2022-01-06T01:39:33.000Z | src/ui/selection/SelectionControl.cpp | danielroth1/CAE | 7eaa096e45fd32f55bd6de94c30dcf706c6f2093 | [
"MIT"
] | null | null | null | src/ui/selection/SelectionControl.cpp | danielroth1/CAE | 7eaa096e45fd32f55bd6de94c30dcf706c6f2093 | [
"MIT"
] | 2 | 2020-08-04T20:21:00.000Z | 2022-03-16T15:01:04.000Z | #include "SelectionControl.h"
#include "Selection.h"
#include "SelectionRectangle.h"
#include "SelectionRectangleModel.h"
#include "SelectionSceneData.h"
#include "SelectionSceneDataModel.h"
#include "SelectionVertices.h"
#include "SelectionVerticesModel.h"
#include "SelectionListener.h"
#include <rendering/ViewFrustu... | 26.184549 | 95 | 0.634814 | [
"vector"
] |
3167a18897db0cb3f08abe861554157d59390c9e | 6,521 | cpp | C++ | source/game/OLDGameView.cpp | WarzesProject/2dgame | 7c398505bd02f9c519f2968bceb3ba87ac26a6a5 | [
"MIT"
] | null | null | null | source/game/OLDGameView.cpp | WarzesProject/2dgame | 7c398505bd02f9c519f2968bceb3ba87ac26a6a5 | [
"MIT"
] | null | null | null | source/game/OLDGameView.cpp | WarzesProject/2dgame | 7c398505bd02f9c519f2968bceb3ba87ac26a6a5 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "OLDGameView.h"
#include "Application.h"
#include "TileSheet.h"
#include "GLSLProgram.h"
#include "SpriteBatch.h"
//-----------------------------------------------------------------------------
void OLDGameView::OnEntry()
{
const int screenWidth = m_app->GetScreenWidth();
const int screen... | 27.058091 | 105 | 0.611103 | [
"render"
] |
3178d3deaa6551e7b3715cffd52ae4923f812914 | 15,493 | cc | C++ | core/common/src/common/rss/rss_checker.cc | GallopWind/epsilon-learn | 74dc723fbc9797f3bd05bee30f6f9b9acceeec17 | [
"MIT"
] | 186 | 2020-09-22T10:57:57.000Z | 2022-03-30T15:52:15.000Z | core/common/src/common/rss/rss_checker.cc | Yufei-Wei/EPSILON | 155f1b1c4dae3ae29287d5b0b967d7d6ce230c73 | [
"MIT"
] | 16 | 2020-10-19T02:55:49.000Z | 2022-01-14T08:17:06.000Z | core/common/src/common/rss/rss_checker.cc | Yufei-Wei/EPSILON | 155f1b1c4dae3ae29287d5b0b967d7d6ce230c73 | [
"MIT"
] | 66 | 2020-09-28T01:51:57.000Z | 2022-03-25T08:39:04.000Z | #include "common/rss/rss_checker.h"
namespace common {
ErrorType RssChecker::CalculateSafeLongitudinalDistance(
const decimal_t ego_vel, const decimal_t other_vel,
const LongitudinalDirection& direction, const RssConfig& config,
decimal_t* distance) {
decimal_t ret = 0.0;
decimal_t ego_vel_abs = fabs(... | 39.222785 | 84 | 0.575421 | [
"vector"
] |
317ebdde987b6f629816b864d5b4e965548eefde | 589 | cpp | C++ | leetcode/34. Search for a Range/s1.cpp | joycse06/LeetCode-1 | ad105bd8c5de4a659c2bbe6b19f400b926c82d93 | [
"Fair"
] | 1 | 2021-02-11T01:23:10.000Z | 2021-02-11T01:23:10.000Z | leetcode/34. Search for a Range/s1.cpp | aerlokesh494/LeetCode | 0f2cbb28d5a9825b51a8d3b3a0ae0c30d7ff155f | [
"Fair"
] | null | null | null | leetcode/34. Search for a Range/s1.cpp | aerlokesh494/LeetCode | 0f2cbb28d5a9825b51a8d3b3a0ae0c30d7ff155f | [
"Fair"
] | 1 | 2021-03-25T17:11:14.000Z | 2021-03-25T17:11:14.000Z | // OJ: https://leetcode.com/problems/search-for-a-range
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int L = 0, R = nums.size() - 1;
while (L <= R) {
int M = (L + R) / 2;
if (nums[M] < target) ++L;
... | 24.541667 | 63 | 0.478778 | [
"vector"
] |
31859873fbadf6c5003540ed767a8647143ae6c5 | 1,431 | cpp | C++ | lib/assets/main.cpp | Honeyman-Applications/commandline_or_gui_windows | ee4ff70bbaadafee8c00f74a482a0f50db71141b | [
"MIT"
] | null | null | null | lib/assets/main.cpp | Honeyman-Applications/commandline_or_gui_windows | ee4ff70bbaadafee8c00f74a482a0f50db71141b | [
"MIT"
] | null | null | null | lib/assets/main.cpp | Honeyman-Applications/commandline_or_gui_windows | ee4ff70bbaadafee8c00f74a482a0f50db71141b | [
"MIT"
] | null | null | null | #include <flutter/dart_project.h>
#include <flutter/flutter_view_controller.h>
#include <windows.h>
#include "flutter_window.h"
#include "utils.h"
// ******* ADDED *******
#include "win32_window.h" // where flag to hide gui is added
#pragma comment(linker, "/subsystem:console") // tells the linker... | 24.254237 | 90 | 0.686932 | [
"vector"
] |
31950184abe5252ec4cb9d706fe6dc3143359d43 | 12,544 | cpp | C++ | melodic/src/orocos_kinematics_dynamics/orocos_kdl/tests/jacobiandottest.cpp | disorn-inc/ROS-melodic-python3-Opencv-4.1.1-CUDA | 3d265bb64712e3cd7dfa0ad56d78fcdebafdb4b0 | [
"BSD-3-Clause"
] | 2 | 2021-07-14T12:33:55.000Z | 2021-11-21T07:14:13.000Z | melodic/src/orocos_kinematics_dynamics/orocos_kdl/tests/jacobiandottest.cpp | disorn-inc/ROS-melodic-python3-Opencv-4.1.1-CUDA | 3d265bb64712e3cd7dfa0ad56d78fcdebafdb4b0 | [
"BSD-3-Clause"
] | null | null | null | melodic/src/orocos_kinematics_dynamics/orocos_kdl/tests/jacobiandottest.cpp | disorn-inc/ROS-melodic-python3-Opencv-4.1.1-CUDA | 3d265bb64712e3cd7dfa0ad56d78fcdebafdb4b0 | [
"BSD-3-Clause"
] | null | null | null | #include "jacobiandottest.hpp"
CPPUNIT_TEST_SUITE_REGISTRATION(JacobianDotTest);
using namespace KDL;
void JacobianDotTest::setUp(){}
void JacobianDotTest::tearDown(){}
namespace KDL{
static const double L0 = 1.0;
static const double L1 = 0.5;
static const double L2 = 0.4;
static const double L3 = ... | 38.012121 | 172 | 0.527583 | [
"vector"
] |
31981e6b6ddf792605ccc4073719c6ec06954cd7 | 813 | cpp | C++ | C++/n-ary-tree-postorder-traversal.cpp | jaiskid/LeetCode-Solutions | a8075fd69087c5463f02d74e6cea2488fdd4efd1 | [
"MIT"
] | 3,269 | 2018-10-12T01:29:40.000Z | 2022-03-31T17:58:41.000Z | C++/n-ary-tree-postorder-traversal.cpp | jaiskid/LeetCode-Solutions | a8075fd69087c5463f02d74e6cea2488fdd4efd1 | [
"MIT"
] | 53 | 2018-12-16T22:54:20.000Z | 2022-02-25T08:31:20.000Z | C++/n-ary-tree-postorder-traversal.cpp | jaiskid/LeetCode-Solutions | a8075fd69087c5463f02d74e6cea2488fdd4efd1 | [
"MIT"
] | 1,236 | 2018-10-12T02:51:40.000Z | 2022-03-30T13:30:37.000Z | // Time: O(n)
// Space: O(h)
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<int> postorder(Node* root) {
i... | 20.325 | 55 | 0.474785 | [
"vector"
] |
31a0f6e8d8b8e6bd53088b5585069bbc6d2a6645 | 1,549 | cpp | C++ | mergesort.cpp | bjadamson/jobprep | d1a155e89b64ef6763fa800159fa4311eb1fc219 | [
"Unlicense"
] | null | null | null | mergesort.cpp | bjadamson/jobprep | d1a155e89b64ef6763fa800159fa4311eb1fc219 | [
"Unlicense"
] | null | null | null | mergesort.cpp | bjadamson/jobprep | d1a155e89b64ef6763fa800159fa4311eb1fc219 | [
"Unlicense"
] | null | null | null | #include <iostream>
#include <algorithm>
#include <vector>
void print(int const*const a, int n)
{
int i = 0;
while(i < n){
std::cout << a[i] << ",";
i++;
}
std::cout << "\ndone\n";
}
// uses twice the space to implement
std::vector<int> merge(std::vector<int> left, std::vector<int> ri... | 23.830769 | 74 | 0.535184 | [
"vector"
] |
b3b67ca7d9f2979b517dfdf7fc389a71545f001a | 30,383 | hpp | C++ | pr2_cartesian_controllers/include/pr2_cartesian_controllers/controller_template.hpp | diogoalmeida/pr2_controller_framework | 852240638d8da439485d69fb1f627db5845c6820 | [
"MIT"
] | null | null | null | pr2_cartesian_controllers/include/pr2_cartesian_controllers/controller_template.hpp | diogoalmeida/pr2_controller_framework | 852240638d8da439485d69fb1f627db5845c6820 | [
"MIT"
] | null | null | null | pr2_cartesian_controllers/include/pr2_cartesian_controllers/controller_template.hpp | diogoalmeida/pr2_controller_framework | 852240638d8da439485d69fb1f627db5845c6820 | [
"MIT"
] | null | null | null | #ifndef __CONTROLLER_TEMPLATE__
#define __CONTROLLER_TEMPLATE__
#include <ros/ros.h>
#include <sensor_msgs/JointState.h>
#include <boost/thread.hpp>
#include <urdf/model.h>
#include <tf/transform_listener.h>
#include <tf/transform_broadcaster.h>
#include <eigen_conversions/eigen_msg.h>
#include <eigen_conversions/eige... | 35.370198 | 396 | 0.738768 | [
"geometry",
"object",
"vector",
"model",
"transform"
] |
b3b752a718215f4bdcab343556f9c9fbf6923b81 | 9,312 | cpp | C++ | objects.cpp | finley03/glTests | 18baf0572ef876cd70b35fda7de61dffa423c319 | [
"MIT"
] | null | null | null | objects.cpp | finley03/glTests | 18baf0572ef876cd70b35fda7de61dffa423c319 | [
"MIT"
] | null | null | null | objects.cpp | finley03/glTests | 18baf0572ef876cd70b35fda7de61dffa423c319 | [
"MIT"
] | null | null | null | //#define _CRTDBG_MAP_ALLOC
#include <glad/glad.h>
#include <iostream>
#include <vector>
#include <chrono>
#include <ctime>
#include <ratio>
#include <iomanip>
#include "terminalColors.h""
#include "objects.h"
#include "obj.h"
Objects::Objects() {
glGenVertexArrays(1, &VAO); // generate vertex arra... | 39.291139 | 145 | 0.679553 | [
"mesh",
"object",
"shape",
"vector"
] |
b3bb86875d8698048cc9d5a82ec0a0061630e277 | 6,440 | cpp | C++ | tiny.cpp | chisaipete/gamedev | 437684e858d24891ecd982001fed461631487b4d | [
"MIT"
] | null | null | null | tiny.cpp | chisaipete/gamedev | 437684e858d24891ecd982001fed461631487b4d | [
"MIT"
] | null | null | null | tiny.cpp | chisaipete/gamedev | 437684e858d24891ecd982001fed461631487b4d | [
"MIT"
] | null | null | null | #include "tiny.h"
SDL_Window* window = NULL;
SDL_Renderer* renderer = NULL;
Timer fps_timer;
std::stringstream fpsText;
Texture t_fps;
RawTexture image;
Model* model = NULL;
const int SCREEN_WIDTH = 200;
const int SCREEN_HEIGHT = 200;
bool init() {
bool success = true;
if (SDL_Init(SDL_INIT_VIDEO) != 0){
... | 30.666667 | 150 | 0.489441 | [
"render",
"vector",
"model"
] |
b3be3892cf2e8fcb1722d94e15ba420813a44912 | 2,513 | cpp | C++ | CodingTool/examples/search.cpp | Deadlyelder/Crypto-Tools | 6529d800dd10e291e1453fc7909bf830d62240a0 | [
"Unlicense"
] | 158 | 2017-05-14T00:03:16.000Z | 2022-03-30T07:13:49.000Z | CodingTool/examples/search.cpp | hadipourh/Tools-for-Cryptanalysis | 6a93eb92794d6176e6d6a2802a86735634107315 | [
"Unlicense"
] | 2 | 2019-10-13T12:06:54.000Z | 2020-06-24T19:39:15.000Z | CodingTool/examples/search.cpp | hadipourh/Tools-for-Cryptanalysis | 6a93eb92794d6176e6d6a2802a86735634107315 | [
"Unlicense"
] | 41 | 2017-07-04T10:00:22.000Z | 2022-03-30T07:13:50.000Z | /*!
\file search.cpp
\author Tomislav Nad, Tomislav.Nad@iaik.tugraz.at
\version 0.9
\brief Example for finding low Hamming weight words.
*/
// Copyright (c) 2010 Graz University of Technology (IAIK) <http://www.iaik.tugraz.at>
//
// This file is part of the CodingTool.
//
// The CodingTool is free s... | 30.277108 | 87 | 0.71548 | [
"object"
] |
b3c71bc0f3afb8930b85754e9c1a957c99bed8c2 | 1,320 | cpp | C++ | icpcarchive.ecs.baylor.edu/Sums.cpp | facug91/OJ-Solutions | 9aa55be066ce5596e4e64737c28cd3ff84e092fe | [
"Apache-2.0"
] | 6 | 2016-09-10T03:16:34.000Z | 2020-04-07T14:45:32.000Z | icpcarchive.ecs.baylor.edu/Sums.cpp | facug91/OJ-Solutions | 9aa55be066ce5596e4e64737c28cd3ff84e092fe | [
"Apache-2.0"
] | null | null | null | icpcarchive.ecs.baylor.edu/Sums.cpp | facug91/OJ-Solutions | 9aa55be066ce5596e4e64737c28cd3ff84e092fe | [
"Apache-2.0"
] | 2 | 2018-08-11T20:55:35.000Z | 2020-01-15T23:23:11.000Z | /*
By: facug91
From: https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4941
Name: Sums
Date: 20/02/2015
*/
#include <bits/stdc++.h>
#define MAX_INT 2147483647
#define MAX_LONG 9223372036854775807ll
#define MAX_DBL 1.79769313... | 22.372881 | 122 | 0.556061 | [
"vector"
] |
b3c7540b739aa34199e1ac5b9fbe80a9067b953a | 1,441 | cpp | C++ | platform/nutekt-digital/osc_template/kick.cpp | roybossofpesto/nts1 | 492dcc8908247d7fc06a34ec9e7713b7e084eb83 | [
"BSD-3-Clause"
] | null | null | null | platform/nutekt-digital/osc_template/kick.cpp | roybossofpesto/nts1 | 492dcc8908247d7fc06a34ec9e7713b7e084eb83 | [
"BSD-3-Clause"
] | null | null | null | platform/nutekt-digital/osc_template/kick.cpp | roybossofpesto/nts1 | 492dcc8908247d7fc06a34ec9e7713b7e084eb83 | [
"BSD-3-Clause"
] | null | null | null | #include "userosc.h"
#include <array>
#include <chrono>
#include <vector>
#include <cstdlib>
#include <tuple>
using namespace std::literals::chrono_literals;
using Note = uint8_t;
struct Osc {
float phi = 0.f;
void update(const float ww);
};
void Osc::update(const float ww)
{
phi += ww;
phi -= static_cast<... | 16.563218 | 54 | 0.646079 | [
"vector"
] |
b3c972be2f7eaced743f514fbf0efc039c525d5a | 1,371 | cpp | C++ | 126/wordLadderII.cpp | Lixu518/leetcode | f8e868ef6963da92237e6dc6888d7dda0b9bdd19 | [
"MIT"
] | 1 | 2018-06-24T13:58:07.000Z | 2018-06-24T13:58:07.000Z | 126/wordLadderII.cpp | Lixu518/leetcode | f8e868ef6963da92237e6dc6888d7dda0b9bdd19 | [
"MIT"
] | null | null | null | 126/wordLadderII.cpp | Lixu518/leetcode | f8e868ef6963da92237e6dc6888d7dda0b9bdd19 | [
"MIT"
] | null | null | null | #include <string>
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_set>
#include <climits>
using namespace std;
vector<vector<string>> findLadders(string beginWord, string endWord, vector<string>& wordList) {
vector<vector<string>> res;
unordered_set<string>dict(wordList.begin(), wordList.en... | 25.388889 | 96 | 0.639679 | [
"vector"
] |
b3ca416f5a8c2511a76c13f38e0a6cb3b17accaf | 3,386 | hh | C++ | Kaskade/utilities/factory2.hh | chenzongxiong/streambox | 76f95780d1bf6c02731e39d8ac73937cea352b95 | [
"Unlicense"
] | 3 | 2019-07-03T14:03:31.000Z | 2021-12-19T10:18:49.000Z | Kaskade/utilities/factory2.hh | chenzongxiong/streambox | 76f95780d1bf6c02731e39d8ac73937cea352b95 | [
"Unlicense"
] | 6 | 2020-02-17T12:01:30.000Z | 2021-12-09T22:02:33.000Z | Kaskade/utilities/factory2.hh | chenzongxiong/streambox | 76f95780d1bf6c02731e39d8ac73937cea352b95 | [
"Unlicense"
] | 2 | 2020-12-03T04:41:18.000Z | 2021-01-11T21:44:42.000Z | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* */
/* This file is part of the library KASKADE 7 */
/* see http://www.zib.de/projects/kaskade7-finite-element-toolbox */
... | 31.351852 | 96 | 0.548435 | [
"object"
] |
b3d2785bf1ede2a6f9c13baf3564bf160947e492 | 4,868 | cc | C++ | Geometry/CaloGeometry/src/IdealZPrism.cc | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 852 | 2015-01-11T21:03:51.000Z | 2022-03-25T21:14:00.000Z | Geometry/CaloGeometry/src/IdealZPrism.cc | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 30,371 | 2015-01-02T00:14:40.000Z | 2022-03-31T23:26:05.000Z | Geometry/CaloGeometry/src/IdealZPrism.cc | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 3,240 | 2015-01-02T05:53:18.000Z | 2022-03-31T17:24:21.000Z | #include "Geometry/CaloGeometry/interface/IdealZPrism.h"
#include <cmath>
#include <memory>
typedef IdealZPrism::CCGFloat CCGFloat;
typedef IdealZPrism::Pt3D Pt3D;
typedef IdealZPrism::Pt3DVec Pt3DVec;
IdealZPrism::IdealZPrism() : CaloCellGeometry() {}
namespace {
// magic numbers determined by ParticleFlow
con... | 37.160305 | 120 | 0.624281 | [
"geometry",
"vector"
] |
b3dee0885a23c2667d8f963570aa0a1c33d03276 | 13,899 | hpp | C++ | src/search_engine/relja_retrival/external/dkmeans_relja/dkmeans_relja/jp_nn_kdtree.hpp | kaloyan13/vise2 | 833a8510c7cbac3cbb8ac4569fd51448906e62f3 | [
"BSD-2-Clause"
] | null | null | null | src/search_engine/relja_retrival/external/dkmeans_relja/dkmeans_relja/jp_nn_kdtree.hpp | kaloyan13/vise2 | 833a8510c7cbac3cbb8ac4569fd51448906e62f3 | [
"BSD-2-Clause"
] | null | null | null | src/search_engine/relja_retrival/external/dkmeans_relja/dkmeans_relja/jp_nn_kdtree.hpp | kaloyan13/vise2 | 833a8510c7cbac3cbb8ac4569fd51448906e62f3 | [
"BSD-2-Clause"
] | 5 | 2019-09-02T14:54:16.000Z | 2021-01-13T17:36:01.000Z | /**
* James Philbin <philbinj@gmail.com>
* Engineering Department
* University of Oxford
* Copyright (C) 2006. All rights reserved.
*
* Use and modify all you like, but do NOT redistribute. No warranty is
* expressed or implied. No liability or responsibility is assumed.
*/
/**
* Implementation of randomized... | 28.022177 | 131 | 0.58184 | [
"vector"
] |
b3efeffa7e5dba3d7c1b9734e714a19c17565feb | 36,583 | cpp | C++ | thirdparty/AngelCode/sdk/angelscript/source/as_module.cpp | kcat/XLEngine | 0e735ad67fa40632add3872e0cbe5a244689cbe5 | [
"MIT"
] | 1 | 2021-07-25T15:10:39.000Z | 2021-07-25T15:10:39.000Z | thirdparty/AngelCode/sdk/angelscript/source/as_module.cpp | kcat/XLEngine | 0e735ad67fa40632add3872e0cbe5a244689cbe5 | [
"MIT"
] | null | null | null | thirdparty/AngelCode/sdk/angelscript/source/as_module.cpp | kcat/XLEngine | 0e735ad67fa40632add3872e0cbe5a244689cbe5 | [
"MIT"
] | null | null | null | /*
AngelCode Scripting Library
Copyright (c) 2003-2011 Andreas Jonsson
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any
damages arising from the use of this software.
Permission is granted to anyone to use this ... | 25.690309 | 299 | 0.662357 | [
"object"
] |
b3fc4ee58f8daa1b1191399b86b7f56bf1151a70 | 1,147 | cpp | C++ | source/lib/oglplus/text.cpp | matus-chochlik/oglplus | 76dd964e590967ff13ddff8945e9dcf355e0c952 | [
"BSL-1.0"
] | 364 | 2015-01-01T09:38:23.000Z | 2022-03-22T05:32:00.000Z | source/lib/oglplus/text.cpp | matus-chochlik/oglplus | 76dd964e590967ff13ddff8945e9dcf355e0c952 | [
"BSL-1.0"
] | 55 | 2015-01-06T16:42:55.000Z | 2020-07-09T04:21:41.000Z | source/lib/oglplus/text.cpp | matus-chochlik/oglplus | 76dd964e590967ff13ddff8945e9dcf355e0c952 | [
"BSL-1.0"
] | 57 | 2015-01-07T18:35:49.000Z | 2022-03-22T05:32:04.000Z | /**
* .file lib/oglplus/text.cpp
* .brief Text rendering utility functions
*
* @author Matus Chochlik
*
* Copyright 2010-2019 Matus Chochlik. Distributed under the Boost
* Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*/
#include... | 26.674419 | 68 | 0.76286 | [
"object"
] |
b3fefc971657930abccf0d5b7480c18741601b31 | 9,613 | cpp | C++ | src/vision_methods.cpp | derpicated/articated_research | 86d82a07df20f991f407a0ac3347bf6a8bd8bc9a | [
"MIT"
] | 1 | 2018-10-07T21:42:55.000Z | 2018-10-07T21:42:55.000Z | src/vision_methods.cpp | derpicated/articated_research | 86d82a07df20f991f407a0ac3347bf6a8bd8bc9a | [
"MIT"
] | null | null | null | src/vision_methods.cpp | derpicated/articated_research | 86d82a07df20f991f407a0ac3347bf6a8bd8bc9a | [
"MIT"
] | null | null | null | #include "vision_methods.hpp"
#include "movement3d.hpp"
#include <opencv2/opencv.hpp>
#include <string>
namespace cv {
// needed for map usage
bool operator< (const KeyPoint& point, const KeyPoint& other_point) {
bool ans = false;
if (point.pt.x < other_point.pt.x) {
ans = true;
} else if (point.pt... | 33.262976 | 96 | 0.62249 | [
"vector"
] |
b601646a583f17cf1255a119008f6f689539f402 | 3,854 | cpp | C++ | plugins/dirlist.cpp | xinhaoyuan/dlauncher | 2a5295d2c2408fc28bb8effe6753cb3c14fb4117 | [
"MIT"
] | null | null | null | plugins/dirlist.cpp | xinhaoyuan/dlauncher | 2a5295d2c2408fc28bb8effe6753cb3c14fb4117 | [
"MIT"
] | null | null | null | plugins/dirlist.cpp | xinhaoyuan/dlauncher | 2a5295d2c2408fc28bb8effe6753cb3c14fb4117 | [
"MIT"
] | null | null | null | #include "dirlist.hpp"
#include <spawn.h>
#include <stdio.h>
#include <unistd.h>
#include <cstring>
#include <cstdio>
#include <dirent.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <utime.h>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#define CACHE_HEAD "DIRLIST_CACHE"
us... | 23.937888 | 94 | 0.502854 | [
"vector"
] |
b6023fcb43dcf8fdef7db5ecd0a062e464d5bdca | 13,788 | cpp | C++ | src/apps/feature_performance/main.cpp | JonasToth/depth-conversions | 5c8338276565d846c07673e83f94f6841006872b | [
"BSD-3-Clause"
] | 2 | 2021-09-30T07:09:49.000Z | 2022-03-14T09:14:35.000Z | src/apps/feature_performance/main.cpp | JonasToth/depth-conversions | 5c8338276565d846c07673e83f94f6841006872b | [
"BSD-3-Clause"
] | null | null | null | src/apps/feature_performance/main.cpp | JonasToth/depth-conversions | 5c8338276565d846c07673e83f94f6841006872b | [
"BSD-3-Clause"
] | null | null | null | #include "keypoint_distribution.h"
#include "matching.h"
#include "min_dist.h"
#include "recognition_performance.h"
#include <CLI/CLI.hpp>
#include <boost/histogram.hpp>
#include <opencv2/core/base.hpp>
#include <sens_loc/util/console.h>
#include <sens_loc/util/correctness_util.h>
#include <stdexcept>
#include <string... | 44.766234 | 80 | 0.615753 | [
"vector"
] |
b603a2ddd5fe7cf81fcaf66c0b700924b25adef7 | 6,788 | cpp | C++ | Sources/HelloWindow/MainWindow.cpp | maxagon/dx12-sandbox | 88bdfa59e23bb637043694af9f42256b0559f233 | [
"MIT"
] | null | null | null | Sources/HelloWindow/MainWindow.cpp | maxagon/dx12-sandbox | 88bdfa59e23bb637043694af9f42256b0559f233 | [
"MIT"
] | null | null | null | Sources/HelloWindow/MainWindow.cpp | maxagon/dx12-sandbox | 88bdfa59e23bb637043694af9f42256b0559f233 | [
"MIT"
] | null | null | null | #include <memory>
#include <DebugCheck.h>
#include <ShaderCompiler.h>
#include <DeviceConfig.h>
#include <ResourceUploader.h>
#include <CmdListRecording.h>
#include <SDL.h>
#include <d3d12.h>
#include <d3dx12.h>
#include "WindowDX12.h"
class TriangleRenderer : public ICmdListSubRecorder
{
private:
CComPtr<ID3D1... | 39.929412 | 119 | 0.712876 | [
"vector"
] |
b60b57eea8c8f34902b832724c7c725c3f12382f | 4,661 | cc | C++ | CondFormats/DTObjects/src/DTRangeT0.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 3 | 2018-08-24T19:10:26.000Z | 2019-02-19T11:45:32.000Z | CondFormats/DTObjects/src/DTRangeT0.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 3 | 2018-08-23T13:40:24.000Z | 2019-12-05T21:16:03.000Z | CondFormats/DTObjects/src/DTRangeT0.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b | [
"Apache-2.0"
] | 5 | 2018-08-21T16:37:52.000Z | 2020-01-09T13:33:17.000Z | /*
* See header file for a description of this class.
*
* \author Paolo Ronchese INFN Padova
*
*/
//----------------------
// This Class' Header --
//----------------------
#include "CondFormats/DTObjects/interface/DTRangeT0.h"
//-------------------------------
// Collaborating Class Headers --
//-------------... | 20.353712 | 79 | 0.552457 | [
"vector"
] |
b60dba68514a44caccc323a78127cf330cbdeb6a | 1,198 | hpp | C++ | engine/source/gom/source/src/Creator.hpp | mateusgondim/Demos | 6aa5da3a6c0e960d10811c9e71e9a0a746e8d6ab | [
"MIT"
] | 5 | 2019-02-12T07:23:55.000Z | 2020-06-22T15:03:36.000Z | engine/source/gom/source/src/Creator.hpp | mateusgondim/Demos | 6aa5da3a6c0e960d10811c9e71e9a0a746e8d6ab | [
"MIT"
] | null | null | null | engine/source/gom/source/src/Creator.hpp | mateusgondim/Demos | 6aa5da3a6c0e960d10811c9e71e9a0a746e8d6ab | [
"MIT"
] | 2 | 2019-06-17T05:04:21.000Z | 2020-04-22T09:05:57.000Z | #ifndef _CREATOR_HPP
#define _CREATOR_HPP
#include <cstddef>
#include <stdint.h>
/* Creator: this class is used with the Game_object_factory class, to be able to dynamically create objects at runtime
* Every class that wants to register itself with the factory, should have a correspoding Creator class, i.e
* the Z... | 34.228571 | 119 | 0.710351 | [
"object"
] |
b6131dc71990f64d726363414cc47bcc5dfe5069 | 15,742 | cpp | C++ | src/typeset_text.cpp | JohnDTill/Forscape | dbbab01f30597af00f87527a8a3d7b468c04b67b | [
"MIT"
] | 10 | 2021-11-13T12:39:06.000Z | 2022-03-19T13:40:05.000Z | src/typeset_text.cpp | JohnDTill/Forscape | dbbab01f30597af00f87527a8a3d7b468c04b67b | [
"MIT"
] | 22 | 2021-11-13T12:57:10.000Z | 2022-03-15T21:42:05.000Z | src/typeset_text.cpp | JohnDTill/Forscape | dbbab01f30597af00f87527a8a3d7b468c04b67b | [
"MIT"
] | null | null | null | #include "typeset_text.h"
#include "hope_unicode.h"
#include "typeset_construct.h"
#include "typeset_line.h"
#include "typeset_selection.h"
#include "typeset_subphrase.h"
#ifndef HOPE_TYPESET_HEADLESS
#include "typeset_painter.h"
#endif
#include <algorithm>
#include <cassert>
namespace Hope {
namespace Typeset {
... | 29.424299 | 127 | 0.633846 | [
"vector",
"model"
] |
b6164990179220110c52b736dc63765074cbb1bd | 6,387 | hpp | C++ | inference-engine/tests_deprecated/unit/shape_infer/built_in_shape_infer_general_test.hpp | fujunwei/dldt | 09497b7724de4be92629f7799b8538b483d809a2 | [
"Apache-2.0"
] | null | null | null | inference-engine/tests_deprecated/unit/shape_infer/built_in_shape_infer_general_test.hpp | fujunwei/dldt | 09497b7724de4be92629f7799b8538b483d809a2 | [
"Apache-2.0"
] | null | null | null | inference-engine/tests_deprecated/unit/shape_infer/built_in_shape_infer_general_test.hpp | fujunwei/dldt | 09497b7724de4be92629f7799b8538b483d809a2 | [
"Apache-2.0"
] | null | null | null | // Copyright (C) 2018-2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#pragma once
#include <gtest/gtest.h>
#include <blob_factory.hpp>
#include <shape_infer/built-in/ie_built_in_holder.hpp>
#include <utility>
#include <ie_format_parser.h>
#include <xml_helper.hpp>
#include <single_layer_common.hpp>
... | 30.706731 | 137 | 0.626585 | [
"vector"
] |
b6171780da69093c8a15c4e08e34e3a3e4ebde64 | 1,678 | hpp | C++ | code/source/util/arrayview.hpp | crafn/clover | 586acdbcdb34c3550858af125e9bb4a6300343fe | [
"MIT"
] | 12 | 2015-01-12T00:19:20.000Z | 2021-08-05T10:47:20.000Z | code/source/util/arrayview.hpp | crafn/clover | 586acdbcdb34c3550858af125e9bb4a6300343fe | [
"MIT"
] | null | null | null | code/source/util/arrayview.hpp | crafn/clover | 586acdbcdb34c3550858af125e9bb4a6300343fe | [
"MIT"
] | null | null | null | #ifndef CLOVER_UTIL_ARRAYVIEW_HPP
#define CLOVER_UTIL_ARRAYVIEW_HPP
#include "build.hpp"
#include "util/class_preproc.hpp"
#include "util/ensure.hpp"
#include "util/traits.hpp"
namespace clover {
namespace util {
/// Non-owning slice of contiguous data
/// Use this instead of 'const std::vector<T>&', because
/// tha... | 23.633803 | 72 | 0.689511 | [
"vector"
] |
b620a0f1380e663617e3b6e3b8fb21809f3a3019 | 1,982 | ipp | C++ | implement/oglplus/enums/hint_option_class.ipp | matus-chochlik/oglplus | 76dd964e590967ff13ddff8945e9dcf355e0c952 | [
"BSL-1.0"
] | 364 | 2015-01-01T09:38:23.000Z | 2022-03-22T05:32:00.000Z | implement/oglplus/enums/hint_option_class.ipp | matus-chochlik/oglplus | 76dd964e590967ff13ddff8945e9dcf355e0c952 | [
"BSL-1.0"
] | 55 | 2015-01-06T16:42:55.000Z | 2020-07-09T04:21:41.000Z | implement/oglplus/enums/hint_option_class.ipp | matus-chochlik/oglplus | 76dd964e590967ff13ddff8945e9dcf355e0c952 | [
"BSL-1.0"
] | 57 | 2015-01-07T18:35:49.000Z | 2022-03-22T05:32:04.000Z | // File implement/oglplus/enums/hint_option_class.ipp
//
// Automatically generated file, DO NOT modify manually.
// Edit the source 'source/enums/oglplus/hint_option.txt'
// or the 'source/enums/make_enum.py' script instead.
//
// Copyright 2010-2019 Matus Chochlik.
// Distributed under the Boost Software Licens... | 22.022222 | 62 | 0.725025 | [
"transform"
] |
b62a5a771cec53cdb6323d4de3ea638122980d01 | 2,401 | cpp | C++ | src/engine/video/vulkan/sdl_window.cpp | spencer-melnick/subspace | db91e0c93aeab8053eecddeb70396c6831990013 | [
"MIT"
] | null | null | null | src/engine/video/vulkan/sdl_window.cpp | spencer-melnick/subspace | db91e0c93aeab8053eecddeb70396c6831990013 | [
"MIT"
] | 3 | 2018-06-15T02:57:39.000Z | 2018-06-16T04:37:21.000Z | src/engine/video/vulkan/sdl_window.cpp | spencer-melnick/subspace | db91e0c93aeab8053eecddeb70396c6831990013 | [
"MIT"
] | null | null | null | #include "sdl_window.hpp"
// STL includes
#include <exception>
// Project includes
#include "engine/util/logger.hpp"
using namespace std;
using namespace subspace;
SdlVulkanWindow::SdlVulkanWindow(const std::string& name, unsigned displayNum, unsigned width,
unsigned height, uint32_t flags) :
name_(name), ... | 29.280488 | 99 | 0.702624 | [
"vector"
] |
b62a9cba9f668d61961c0330371497e4a70973f3 | 624 | cc | C++ | cses/1653.cc | kamal1316/competitive-programming | 1443fb4bd1c92c2acff64ba2828abb21b067e6e0 | [
"WTFPL"
] | 506 | 2018-08-22T10:30:38.000Z | 2022-03-31T10:01:49.000Z | cses/1653.cc | diegordzr/competitive-programming | 1443fb4bd1c92c2acff64ba2828abb21b067e6e0 | [
"WTFPL"
] | 13 | 2019-08-07T18:31:18.000Z | 2020-12-15T21:54:41.000Z | cses/1653.cc | diegordzr/competitive-programming | 1443fb4bd1c92c2acff64ba2828abb21b067e6e0 | [
"WTFPL"
] | 234 | 2018-08-06T17:11:41.000Z | 2022-03-26T10:56:42.000Z | // https://cses.fi/problemset/task/1653
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(0);
int n, x;
cin >> n >> x;
vector<int> w(n);
for (int i = 0; i < n; i++) cin >> w[i];
vector<pair<int, int>> best(1 << n, {n + 1, 0});
best[0] = {1, 0};
for (int s = 1;... | 24.96 | 51 | 0.432692 | [
"vector"
] |
b62b79e74edd7c52bc925617ef54b7db6c6e8c22 | 9,755 | cpp | C++ | src/modules/socket/server/handler.cpp | DerangedMonkeyNinja/openperf | cde4dc6bf3687f0663c11e9e856e26a0dc2b1d16 | [
"Apache-2.0"
] | 20 | 2019-12-04T01:28:52.000Z | 2022-03-17T14:09:34.000Z | src/modules/socket/server/handler.cpp | DerangedMonkeyNinja/openperf | cde4dc6bf3687f0663c11e9e856e26a0dc2b1d16 | [
"Apache-2.0"
] | 115 | 2020-02-04T21:29:54.000Z | 2022-02-17T13:33:51.000Z | src/modules/socket/server/handler.cpp | DerangedMonkeyNinja/openperf | cde4dc6bf3687f0663c11e9e856e26a0dc2b1d16 | [
"Apache-2.0"
] | 16 | 2019-12-03T16:41:18.000Z | 2021-11-06T04:44:11.000Z | #include "api/api_route_handler.hpp"
#include "api/api_utils.hpp"
#include "config/op_config_utils.hpp"
#include "core/op_core.h"
#include "core/op_uuid.hpp"
#include "framework/utils/overloaded_visitor.hpp"
#include "socket/server/lwip_utils.hpp"
#include "socket/server/pcb_utils.hpp"
#include "lwip/tcpbase.h"
#inclu... | 38.710317 | 80 | 0.489493 | [
"vector",
"model",
"transform"
] |
b630d9f51c1a079e5ccbc0ef39f4e025db2e1676 | 582 | hpp | C++ | include/libderp/prime1/MREA.hpp | Pwootage/libderp | b6568766dea7509266b0baa34cc96de47c804bfe | [
"MIT"
] | 1 | 2022-03-19T02:44:21.000Z | 2022-03-19T02:44:21.000Z | include/libderp/prime1/MREA.hpp | Pwootage/libderp | b6568766dea7509266b0baa34cc96de47c804bfe | [
"MIT"
] | null | null | null | include/libderp/prime1/MREA.hpp | Pwootage/libderp | b6568766dea7509266b0baa34cc96de47c804bfe | [
"MIT"
] | null | null | null | #ifndef LIBDERP_PRIME1MREA_HPP_HPP
#define LIBDERP_PRIME1MREA_HPP_HPP
#include <libderp/IBinarySerializable.hpp>
#include <libderp/IDataStream.hpp>
#include <cstdint>
#include <glm/mat4x3.hpp>
#include <glm/vec3.hpp>
namespace libderp {
namespace prime1 {
class MREA : public IBinarySerializable {
public:
static ... | 17.636364 | 49 | 0.750859 | [
"transform"
] |
ac0e697d09c0328d7f2e24e86bcb6605a180a2ff | 10,807 | cpp | C++ | runtime/src/atn/SemanticContext.cpp | BlockLink/link-antlr-cpp | 287014e8f51a9243b2ec6de7c89b92cc474a4802 | [
"MIT"
] | null | null | null | runtime/src/atn/SemanticContext.cpp | BlockLink/link-antlr-cpp | 287014e8f51a9243b2ec6de7c89b92cc474a4802 | [
"MIT"
] | null | null | null | runtime/src/atn/SemanticContext.cpp | BlockLink/link-antlr-cpp | 287014e8f51a9243b2ec6de7c89b92cc474a4802 | [
"MIT"
] | null | null | null | /* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
* Use of this file is governed by the BSD 3-clause license that
* can be found in the LICENSE.txt file in the project root.
*/
#include "misc/MurmurHash.h"
#include "support/CPPUtils.h"
#include "support/Arrays.h"
#include "SemanticContext.h"
usi... | 29.287263 | 123 | 0.658185 | [
"vector"
] |
ac1768d2b3942daba1cdd8221bdc9ca1c55b1c30 | 37,698 | cxx | C++ | main/slideshow/source/engine/slideview.cxx | Alan-love/openoffice | 09be380f1ebba053dbf269468ff884f5d26ce1e4 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/slideshow/source/engine/slideview.cxx | Alan-love/openoffice | 09be380f1ebba053dbf269468ff884f5d26ce1e4 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/slideshow/source/engine/slideview.cxx | Alan-love/openoffice | 09be380f1ebba053dbf269468ff884f5d26ce1e4 | [
"Apache-2.0"
] | 331 | 2015-01-06T11:40:55.000Z | 2022-03-14T04:07:51.000Z | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to yo... | 31.572864 | 111 | 0.594673 | [
"geometry",
"render",
"vector",
"transform"
] |
ac213eef6644eab76f5f1df6f81e9a74db20b94e | 7,909 | cpp | C++ | src/Plugins/OpenGL/Window/GLWindow.cpp | MemoryDealer/LORE | 2ce0c6cf03c119e5d1b0b90f3ee044901353283a | [
"MIT"
] | 2 | 2021-07-14T06:05:48.000Z | 2021-07-14T18:07:18.000Z | src/Plugins/OpenGL/Window/GLWindow.cpp | MemoryDealer/LORE | 2ce0c6cf03c119e5d1b0b90f3ee044901353283a | [
"MIT"
] | null | null | null | src/Plugins/OpenGL/Window/GLWindow.cpp | MemoryDealer/LORE | 2ce0c6cf03c119e5d1b0b90f3ee044901353283a | [
"MIT"
] | null | null | null | // ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: //
// The MIT License (MIT)
// This source file is part of LORE
// ( Lightweight Object-oriented Rendering Engine )
//
// Copyright (c) 2017-2021 Jordan Sparks
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
... | 34.688596 | 109 | 0.616386 | [
"render",
"object"
] |
ac2c3dac56719c2aefe17c7ffcba54834b0163c7 | 2,217 | hpp | C++ | modules/tracking/src/trackerCSRTSegmentation.hpp | Nondzu/opencv_contrib | 0b0616a25d4239ee81fda965818b49b721620f56 | [
"BSD-3-Clause"
] | 7,158 | 2016-07-04T22:19:27.000Z | 2022-03-31T07:54:32.000Z | modules/tracking/src/trackerCSRTSegmentation.hpp | Nondzu/opencv_contrib | 0b0616a25d4239ee81fda965818b49b721620f56 | [
"BSD-3-Clause"
] | 2,184 | 2016-07-05T12:04:14.000Z | 2022-03-30T19:10:12.000Z | modules/tracking/src/trackerCSRTSegmentation.hpp | Nondzu/opencv_contrib | 0b0616a25d4239ee81fda965818b49b721620f56 | [
"BSD-3-Clause"
] | 5,535 | 2016-07-06T12:01:10.000Z | 2022-03-31T03:13:24.000Z | // This file is part of OpenCV project.
// It is subject to the license terms in the LICENSE file found in the top-level directory
// of this distribution and at http://opencv.org/license.html.
#ifndef OPENCV_TRACKER_CSRT_SEGMENTATION
#define OPENCV_TRACKER_CSRT_SEGMENTATION
namespace cv
{
class Histogram
{
public:
... | 36.95 | 96 | 0.67659 | [
"vector"
] |
ac301f440058e636f913117bdd518c6895d47dc7 | 4,677 | hpp | C++ | src/util.hpp | ChrisPattison/SYK | f62b1e9519daf804409790d01316749d010c0db2 | [
"BSD-2-Clause"
] | null | null | null | src/util.hpp | ChrisPattison/SYK | f62b1e9519daf804409790d01316749d010c0db2 | [
"BSD-2-Clause"
] | null | null | null | src/util.hpp | ChrisPattison/SYK | f62b1e9519daf804409790d01316749d010c0db2 | [
"BSD-2-Clause"
] | null | null | null | /* Copyright (c) 2020 C. Pattison
* All rights reserved.
*
* 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 co... | 38.336066 | 123 | 0.665598 | [
"vector",
"transform"
] |
ac45eede896d26b7981f419da8a3ba78ed7094d5 | 9,133 | cpp | C++ | RPGPrototype/Intermediate/Build/Win64/UE4Editor/Inc/RPGPrototype/RPGPrototypeCharacter.gen.cpp | JiaqiJin/RPGPrototype_ue4 | e328798e880089841c0bfea1e25abee045dbf447 | [
"MIT"
] | 1 | 2022-01-07T11:48:03.000Z | 2022-01-07T11:48:03.000Z | RPGPrototype/Intermediate/Build/Win64/UE4Editor/Inc/RPGPrototype/RPGPrototypeCharacter.gen.cpp | JiaqiJin/RPGPrototype_ue4 | e328798e880089841c0bfea1e25abee045dbf447 | [
"MIT"
] | null | null | null | RPGPrototype/Intermediate/Build/Win64/UE4Editor/Inc/RPGPrototype/RPGPrototypeCharacter.gen.cpp | JiaqiJin/RPGPrototype_ue4 | e328798e880089841c0bfea1e25abee045dbf447 | [
"MIT"
] | null | null | null | // Copyright Epic Games, Inc. All Rights Reserved.
/*===========================================================================
Generated code exported from UnrealHeaderTool.
DO NOT modify this manually! Edit the corresponding .h files instead!
========================================================================... | 60.483444 | 575 | 0.820431 | [
"object"
] |
ac53b1be6b7a856f2fbe392ce76c1062f03bd171 | 5,921 | cpp | C++ | src/train/svm_train.cpp | hxl1990/new416 | f4962fddba6ce0b0e1805503d7c376352bd0e91d | [
"Apache-2.0"
] | null | null | null | src/train/svm_train.cpp | hxl1990/new416 | f4962fddba6ce0b0e1805503d7c376352bd0e91d | [
"Apache-2.0"
] | null | null | null | src/train/svm_train.cpp | hxl1990/new416 | f4962fddba6ce0b0e1805503d7c376352bd0e91d | [
"Apache-2.0"
] | 1 | 2020-01-17T09:53:22.000Z | 2020-01-17T09:53:22.000Z | #include "easypr/train/svm_train.h"
#include "easypr/core/feature.h"
#include "easypr/util/util.h"
#ifdef OS_WINDOWS
#include <ctime>
#endif
using namespace cv::ml;
namespace easypr {
SvmTrain::SvmTrain(const char* plates_folder, const char* xml)
: plates_folder_(plates_folder), svm_xml_(xml) {
assert(plates_... | 29.90404 | 81 | 0.634859 | [
"vector",
"model"
] |
ac5da6d15e1c0b4c03d028f899a68c9ba87d52a2 | 963 | cpp | C++ | boboleetcode/Play-Leetcode-master/0199-Binary-Tree-Right-Side-View/cpp-0199/main.cpp | yaominzh/CodeLrn2019 | adc727d92904c5c5d445a2621813dfa99474206d | [
"Apache-2.0"
] | 2 | 2021-03-25T05:26:55.000Z | 2021-04-20T03:33:24.000Z | boboleetcode/Play-Leetcode-master/0199-Binary-Tree-Right-Side-View/cpp-0199/main.cpp | mcuallen/CodeLrn2019 | adc727d92904c5c5d445a2621813dfa99474206d | [
"Apache-2.0"
] | 6 | 2019-12-04T06:08:32.000Z | 2021-05-10T20:22:47.000Z | boboleetcode/Play-Leetcode-master/0199-Binary-Tree-Right-Side-View/cpp-0199/main.cpp | mcuallen/CodeLrn2019 | adc727d92904c5c5d445a2621813dfa99474206d | [
"Apache-2.0"
] | null | null | null | /// Source : https://leetcode.com/problems/binary-tree-right-side-view/
/// Author : liuyubobobo
/// Time : 2019-09-26
#include <iostream>
#include <vector>
using namespace std;
/// BFS
/// Time Complexity: O(n)
/// Space Complexity: O(n)
/// Definition for a binary tree node.
struct TreeNode {
int val;
... | 19.26 | 71 | 0.554517 | [
"vector"
] |
ac5e9087bf4bef80515bce751851939d0b46bcde | 530 | cpp | C++ | src/413.cpp | MoRunChang2015/LeetCode | d046083b952811dfbf5f8fb646060836a3e937ce | [
"Apache-2.0"
] | null | null | null | src/413.cpp | MoRunChang2015/LeetCode | d046083b952811dfbf5f8fb646060836a3e937ce | [
"Apache-2.0"
] | null | null | null | src/413.cpp | MoRunChang2015/LeetCode | d046083b952811dfbf5f8fb646060836a3e937ce | [
"Apache-2.0"
] | null | null | null | class Solution {
public:
int numberOfArithmeticSlices(vector<int>& A) {
int ans = 0;
if (A.size() < 3)
return ans;
for (int i = 0; i <= A.size() - 3; i++) {
if (A[i + 1] * 2 == A[i] + A[i + 2]) {
ans++;
int d = A[i + 1] - A[i];
... | 25.238095 | 62 | 0.292453 | [
"vector"
] |
ac63b17191833d866e1130ac21b7ee2df58e2620 | 20,276 | cpp | C++ | cppForSwig/DecryptedDataContainer.cpp | RomanValov/ArmoryDB | 625eff9712161676ad83deb03616e6edb48283ca | [
"MIT"
] | null | null | null | cppForSwig/DecryptedDataContainer.cpp | RomanValov/ArmoryDB | 625eff9712161676ad83deb03616e6edb48283ca | [
"MIT"
] | null | null | null | cppForSwig/DecryptedDataContainer.cpp | RomanValov/ArmoryDB | 625eff9712161676ad83deb03616e6edb48283ca | [
"MIT"
] | null | null | null | ////////////////////////////////////////////////////////////////////////////////
// //
// Copyright (C) 2017, goatpig //
// Distributed under the MIT license ... | 33.906355 | 84 | 0.629217 | [
"object"
] |
ac6d2d3157e0fedaf167a8456a20c22b0943b126 | 11,468 | cc | C++ | cc/dual_net/dual_net_test.cc | VonRosenchild/minigo | 18d43c0950d3623ad33b9035ab91952b79f8c89c | [
"Apache-2.0"
] | 1 | 2019-10-10T06:09:32.000Z | 2019-10-10T06:09:32.000Z | cc/dual_net/dual_net_test.cc | VonRosenchild/minigo | 18d43c0950d3623ad33b9035ab91952b79f8c89c | [
"Apache-2.0"
] | null | null | null | cc/dual_net/dual_net_test.cc | VonRosenchild/minigo | 18d43c0950d3623ad33b9035ab91952b79f8c89c | [
"Apache-2.0"
] | 1 | 2019-10-10T06:09:19.000Z | 2019-10-10T06:09:19.000Z | // Copyright 2018 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in ... | 34.646526 | 80 | 0.60429 | [
"vector",
"model"
] |
ac770afbb947becd151e5df274a12c2c28ea083d | 1,455 | cc | C++ | Chapter01/dlib_samples/linreg_dlib.cc | bdonkey/Hands-On-Machine-Learning-with-CPP | d2b17abeb48db3d45369fdb1be806682ab9819ed | [
"MIT"
] | 201 | 2020-05-13T12:50:50.000Z | 2022-03-27T20:56:11.000Z | Chapter01/dlib_samples/linreg_dlib.cc | bdonkey/Hands-On-Machine-Learning-with-CPP | d2b17abeb48db3d45369fdb1be806682ab9819ed | [
"MIT"
] | 1 | 2021-05-12T10:01:40.000Z | 2021-05-14T19:35:05.000Z | Chapter01/dlib_samples/linreg_dlib.cc | bdonkey/Hands-On-Machine-Learning-with-CPP | d2b17abeb48db3d45369fdb1be806682ab9819ed | [
"MIT"
] | 63 | 2020-06-05T15:03:39.000Z | 2022-02-22T02:07:09.000Z | #include <dlib/matrix.h>
#include <dlib/svm.h>
#include <iostream>
#include <random>
float func(float x) {
return 4.f + 0.3f * x; // line coeficients
}
using SampleType = dlib::matrix<double, 1, 1>;
using KernelType = dlib::linear_kernel<SampleType>;
int main() {
using namespace dlib;
size_t n = 1000;
std:... | 23.095238 | 76 | 0.613058 | [
"vector"
] |
ac7ca21b61fba992077eda8dfe3de65043a5b7a6 | 12,590 | hpp | C++ | src/problems/distance_barrier_rb_problem.hpp | ipc-sim/rigid-ipc | d839af457236e7363b14c2e482a01d8160fa447e | [
"MIT"
] | 71 | 2021-09-08T13:16:43.000Z | 2022-03-27T10:23:33.000Z | src/problems/distance_barrier_rb_problem.hpp | ipc-sim/rigid-ipc | d839af457236e7363b14c2e482a01d8160fa447e | [
"MIT"
] | 4 | 2021-09-08T00:16:20.000Z | 2022-01-05T17:44:08.000Z | src/problems/distance_barrier_rb_problem.hpp | ipc-sim/rigid-ipc | d839af457236e7363b14c2e482a01d8160fa447e | [
"MIT"
] | 2 | 2021-09-18T15:15:38.000Z | 2021-09-21T15:15:38.000Z | #pragma once
#include <tbb/concurrent_vector.h>
#include <ipc/collision_constraint.hpp>
#include <ipc/friction/friction_constraint.hpp>
#include <autodiff/autodiff_types.hpp>
#include <opt/distance_barrier_constraint.hpp>
#include <opt/optimization_problem.hpp>
#include <physics/rigid_body_problem.hpp>
#include <pro... | 34.027027 | 80 | 0.685703 | [
"geometry",
"vector"
] |
ac80f1b02ced911f93c71c0dfd784b7b69bd7a46 | 1,420 | hpp | C++ | meta/include/mgs/meta/concepts/forward_iterator.hpp | theodelrieu/mgs | 965a95e3d539447cc482e915f9c44b3439168a4e | [
"BSL-1.0"
] | 24 | 2020-07-01T13:45:50.000Z | 2021-11-04T19:54:47.000Z | meta/include/mgs/meta/concepts/forward_iterator.hpp | theodelrieu/mgs | 965a95e3d539447cc482e915f9c44b3439168a4e | [
"BSL-1.0"
] | null | null | null | meta/include/mgs/meta/concepts/forward_iterator.hpp | theodelrieu/mgs | 965a95e3d539447cc482e915f9c44b3439168a4e | [
"BSL-1.0"
] | null | null | null | #pragma once
#include <iterator>
#include <tuple>
#include <type_traits>
#include <mgs/meta/concepts/derived_from.hpp>
#include <mgs/meta/concepts/incrementable.hpp>
#include <mgs/meta/concepts/input_iterator.hpp>
#include <mgs/meta/concepts/sentinel_for.hpp>
#include <mgs/meta/detected.hpp>
#include <mgs/meta/detect... | 26.296296 | 83 | 0.734507 | [
"model"
] |
ac83c2ba34d6ee2ef936366d4501459b68877f9d | 1,086 | cpp | C++ | Assignments/Week2 Solution - Talha Tariq/Binary Search/P4 - Find Peak Element.cpp | TT-talhatariq/DSA-Bootcamp-Cpp | 823e8d8e3e01803667636f9c2be8f3e520214df3 | [
"MIT"
] | null | null | null | Assignments/Week2 Solution - Talha Tariq/Binary Search/P4 - Find Peak Element.cpp | TT-talhatariq/DSA-Bootcamp-Cpp | 823e8d8e3e01803667636f9c2be8f3e520214df3 | [
"MIT"
] | null | null | null | Assignments/Week2 Solution - Talha Tariq/Binary Search/P4 - Find Peak Element.cpp | TT-talhatariq/DSA-Bootcamp-Cpp | 823e8d8e3e01803667636f9c2be8f3e520214df3 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
#include <string.h>
using namespace std;
int findPeakBruteForce(vector<int> &arr) {
for(int i=1; i<arr.size()-1; i++){
if(arr[i] > arr[i-1] && arr[i] > arr[i+1] )
return arr[i];
}
if(arr[0] < arr[1] && arr[1] < arr[2])
return arr[arr.size()-1];
... | 20.111111 | 64 | 0.446593 | [
"vector"
] |
ac85e802d9c056489a55aef57bf8f2c4ccdaf1cd | 2,878 | cpp | C++ | LeetCode/C++/Companies/Google/Medium/FindAndReplaceInString/solution.cpp | busebd12/InterviewPreparation | e68c41f16f7790e44b10a229548186e13edb5998 | [
"MIT"
] | null | null | null | LeetCode/C++/Companies/Google/Medium/FindAndReplaceInString/solution.cpp | busebd12/InterviewPreparation | e68c41f16f7790e44b10a229548186e13edb5998 | [
"MIT"
] | null | null | null | LeetCode/C++/Companies/Google/Medium/FindAndReplaceInString/solution.cpp | busebd12/InterviewPreparation | e68c41f16f7790e44b10a229548186e13edb5998 | [
"MIT"
] | null | null | null | #include <iostream>
#include <iterator>
#include <map>
#include <string>
#include <utility>
#include <vector>
/*
Solution: see comments for details
Time complexity: O((n log n) + n) [where n is the number of indices in the indices vector]
Space complexity: O(n)
*/
class Solution
{
public:
string findRepl... | 32.337079 | 245 | 0.552814 | [
"vector"
] |
ac866a6d0474260d3d3ff2d5b5b6893ffe4945ca | 5,066 | cpp | C++ | core/src/ceps_interpreter_eval_id.cpp | cepsdev/ceps | badd1ac7582034f9b4f000ee93828bd584cf858b | [
"MIT"
] | 3 | 2018-09-11T11:40:24.000Z | 2021-07-02T10:24:36.000Z | core/src/ceps_interpreter_eval_id.cpp | cepsdev/ceps | badd1ac7582034f9b4f000ee93828bd584cf858b | [
"MIT"
] | null | null | null | core/src/ceps_interpreter_eval_id.cpp | cepsdev/ceps | badd1ac7582034f9b4f000ee93828bd584cf858b | [
"MIT"
] | null | null | null | /*
(C) 2021 Tomas Prerovsky (cepsdev@hotmail.com).
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.elete
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable la... | 36.185714 | 122 | 0.680418 | [
"vector"
] |
12c63d367673c7fe75cf49d3d246255fe553e74b | 1,124 | cpp | C++ | Leetcode Daily Challenge/December-2020/05. Can Place Flowers.cpp | Akshad7829/DataStructures-Algorithms | 439822c6a374672d1734e2389d3fce581a35007d | [
"MIT"
] | 5 | 2021-08-10T18:47:49.000Z | 2021-08-21T15:42:58.000Z | Leetcode Daily Challenge/December-2020/05. Can Place Flowers.cpp | Akshad7829/DataStructures-Algorithms | 439822c6a374672d1734e2389d3fce581a35007d | [
"MIT"
] | 2 | 2022-02-25T13:36:46.000Z | 2022-02-25T14:06:44.000Z | Leetcode Daily Challenge/December-2020/05. Can Place Flowers.cpp | Akshad7829/DataStructures-Algorithms | 439822c6a374672d1734e2389d3fce581a35007d | [
"MIT"
] | 1 | 2021-08-11T06:36:42.000Z | 2021-08-11T06:36:42.000Z | /*
Can Place Flowers
=================
You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.
Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return if n new flowers... | 23.416667 | 221 | 0.592527 | [
"vector"
] |
12c864cb00f70349d3ec680ab8ef91c3e19da9bb | 7,399 | cpp | C++ | test/ServerFifoPathTest.cpp | MisterTea/EternalTCP | 113fb23133eabce3d11681392d75ba4772814b44 | [
"Apache-2.0"
] | 568 | 2016-11-20T07:19:40.000Z | 2018-02-24T20:08:47.000Z | test/ServerFifoPathTest.cpp | MisterTea/EternalTCP | 113fb23133eabce3d11681392d75ba4772814b44 | [
"Apache-2.0"
] | 83 | 2016-12-02T19:04:32.000Z | 2018-02-27T01:30:32.000Z | test/ServerFifoPathTest.cpp | MisterTea/EternalTCP | 113fb23133eabce3d11681392d75ba4772814b44 | [
"Apache-2.0"
] | 35 | 2016-12-12T19:07:17.000Z | 2018-02-18T18:23:19.000Z | #include <ftw.h>
#include <filesystem>
#include <optional>
#include "ServerFifoPath.hpp"
#include "TestHeaders.hpp"
using namespace et;
namespace {
struct FileInfo {
bool exists = false;
mode_t mode = 0;
mode_t fileMode() const { return mode & 0777; }
// Codespaces and similar environments may enforce ad... | 32.030303 | 80 | 0.679822 | [
"vector"
] |
12ce9e04f11561e56e74f77bff632e465ee740e4 | 3,312 | cpp | C++ | Shiny_Engine/ComponentGraphScript.cpp | AleixCas95/Shiny_Engine | a5dca52725ed20c11f929a581e1b442988ec3237 | [
"MIT"
] | null | null | null | Shiny_Engine/ComponentGraphScript.cpp | AleixCas95/Shiny_Engine | a5dca52725ed20c11f929a581e1b442988ec3237 | [
"MIT"
] | null | null | null | Shiny_Engine/ComponentGraphScript.cpp | AleixCas95/Shiny_Engine | a5dca52725ed20c11f929a581e1b442988ec3237 | [
"MIT"
] | null | null | null | #include "Application.h"
#include "ComponentGraphScript.h"
#include "ResourceGraphManager.h"
#include "Component.h"
#include "imgui/imgui.h"
ComponentGraphScript::ComponentGraphScript(Application* app_parent, GameObject* parent, uint scriptNum) : Component(app_parent, parent, CompGraphScript)
{
type = Object_Type::C... | 21.933775 | 152 | 0.746377 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.