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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
23edbb26a26cff4b9109f3ae75199b84dbcf42f3 | 9,280 | cpp | C++ | Matrix.cpp | JSebastianZ/RayTracer | e720bd00811d01d28fab8ad9e295623c7a9bc284 | [
"MIT"
] | null | null | null | Matrix.cpp | JSebastianZ/RayTracer | e720bd00811d01d28fab8ad9e295623c7a9bc284 | [
"MIT"
] | 1 | 2020-06-17T05:08:30.000Z | 2020-06-17T05:08:30.000Z | Matrix.cpp | JSebastianZ/RayTracer | e720bd00811d01d28fab8ad9e295623c7a9bc284 | [
"MIT"
] | null | null | null | #include "Matrix.h"
using namespace rt;
// Matrix dimension parameters.
int m_rows{ 0 };
int m_columns{ 0 };
int size{ 0 };
// A matrix is implemented as a two dimensional array of real numbers.
void Matrix::create_matrix(int rows, int columns) {
this->matrix = new real * [rows]();
for (int i = 0; i ... | 30.326797 | 108 | 0.586207 | [
"vector",
"3d"
] |
23eee6dea3863513b31fdebb434b4977bac6a6d4 | 455 | cpp | C++ | opt/sloop_2.cpp | aki-ph-chem/rot_const | 7f05e252d15e4b30bfd9ec0627a239154f7fb468 | [
"MIT"
] | null | null | null | opt/sloop_2.cpp | aki-ph-chem/rot_const | 7f05e252d15e4b30bfd9ec0627a239154f7fb468 | [
"MIT"
] | null | null | null | opt/sloop_2.cpp | aki-ph-chem/rot_const | 7f05e252d15e4b30bfd9ec0627a239154f7fb468 | [
"MIT"
] | null | null | null | #include<iostream>
#include<vector>
#include"sloop_2.h"
void sloop::set(double sign_h,double x_0,double h_0){
h = h_0;
h = sign_h*h;
x_now = x_0 + h;
}
void sloop::forward(){
//h = 2*h;
x_now = x_now + h;
}
void sloop::Memo(std::vector<std::vector<double>>& Result,
... | 16.25 | 59 | 0.564835 | [
"vector"
] |
23f42337e28e6a748b0a27e4613c2f2e5167c9f7 | 448 | cpp | C++ | Streams/InputUntilFail/main.cpp | ilyayunkin/CppSandbox | b03fd84462faa16b6c3ca03c1639fcbe0be361cf | [
"MIT"
] | null | null | null | Streams/InputUntilFail/main.cpp | ilyayunkin/CppSandbox | b03fd84462faa16b6c3ca03c1639fcbe0be361cf | [
"MIT"
] | null | null | null | Streams/InputUntilFail/main.cpp | ilyayunkin/CppSandbox | b03fd84462faa16b6c3ca03c1639fcbe0be361cf | [
"MIT"
] | null | null | null | #include <QCoreApplication>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
std::vector<double> v;
double value;
cout << "Input values:";
while(cin >> value){
v.push_back(value);
}
aut... | 21.333333 | 65 | 0.611607 | [
"vector"
] |
6712402a21e53f4a50bf560fcc797fd8035bd8ff | 1,258 | cpp | C++ | Cpp/ConnectedComponents.cpp | akshat-6397/hacktoberfest2021-easy | 4e71ab3cfc5e5514d81ca3eaacd8c6e2483cb703 | [
"MIT"
] | 15 | 2021-10-05T08:12:12.000Z | 2021-10-20T07:54:23.000Z | Cpp/ConnectedComponents.cpp | akshat-6397/hacktoberfest2021-easy | 4e71ab3cfc5e5514d81ca3eaacd8c6e2483cb703 | [
"MIT"
] | 18 | 2021-10-05T08:09:12.000Z | 2021-10-20T07:47:43.000Z | Cpp/ConnectedComponents.cpp | akshat-6397/hacktoberfest2021-easy | 4e71ab3cfc5e5514d81ca3eaacd8c6e2483cb703 | [
"MIT"
] | 54 | 2021-10-05T07:49:59.000Z | 2021-12-07T17:18:07.000Z | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define f(n) for (int i = 0; i < n; i++)
#define inf 1e18
#define mid(l, r) (l + (r - l) / 2)
typedef vector<int> vi;
typedef vector<string> vs;
typedef map<int, int> mii;
typedef unordered_map<int, int> ump;
//#define... | 22.464286 | 79 | 0.544515 | [
"vector"
] |
671cfaa4073bc8066a019ddd96ac053f4a07c103 | 7,070 | cpp | C++ | main.cpp | vlee489/AC21009-Coursework-2 | 2b32dbc5405408fc5a7173cd43490ec21c388555 | [
"MIT"
] | null | null | null | main.cpp | vlee489/AC21009-Coursework-2 | 2b32dbc5405408fc5a7173cd43490ec21c388555 | [
"MIT"
] | null | null | null | main.cpp | vlee489/AC21009-Coursework-2 | 2b32dbc5405408fc5a7173cd43490ec21c388555 | [
"MIT"
] | null | null | null | // Imports the header file for this individual source file
#include "main.hpp"
// Imports error codes
#include "error.hpp"
// Imports game of life
#include "gameOfLife.hpp"
// Imports methods which allows the user to set their own generation
#include "generation.hpp"
// Imports methods to handle user input and output
#... | 31.846847 | 80 | 0.691655 | [
"object",
"vector"
] |
6725287b0650f3c50ada7bce1a02df7b651ebca6 | 629 | cpp | C++ | 155-min-stack/155-min-stack.cpp | champmaniac/LeetCode | 65810e0123e0ceaefb76d0a223436d1525dac0d4 | [
"MIT"
] | 1 | 2022-02-27T09:01:07.000Z | 2022-02-27T09:01:07.000Z | 155-min-stack/155-min-stack.cpp | champmaniac/LeetCode | 65810e0123e0ceaefb76d0a223436d1525dac0d4 | [
"MIT"
] | null | null | null | 155-min-stack/155-min-stack.cpp | champmaniac/LeetCode | 65810e0123e0ceaefb76d0a223436d1525dac0d4 | [
"MIT"
] | null | null | null | class MinStack {
public:
stack<int> st1;
stack<int> st2;
MinStack() {
}
void push(int val) {
st1.push(val);
if(st2.empty() || val<=getMin())
st2.push(val);
}
void pop() {
if(st1.top()==getMin()) st2.pop();
st1.pop();
}
... | 17.472222 | 64 | 0.473768 | [
"object"
] |
67317b5b4312ef5789b98789ab16105b1a285f8a | 5,717 | cpp | C++ | src/windraw/graphics/canvas.cpp | kosinw/windraw | 84958dc2225bc026e80a74e1767065b1264bb4f9 | [
"MIT"
] | null | null | null | src/windraw/graphics/canvas.cpp | kosinw/windraw | 84958dc2225bc026e80a74e1767065b1264bb4f9 | [
"MIT"
] | 8 | 2018-06-23T02:43:10.000Z | 2018-06-29T06:10:00.000Z | src/windraw/graphics/canvas.cpp | kosinw/windraw | 84958dc2225bc026e80a74e1767065b1264bb4f9 | [
"MIT"
] | null | null | null | // Copyright (c) 2018 Kosi Nwabueze
//
// This software is released under the MIT License.
// https://opensource.org/licenses/MIT
#include <Windows.h>
#include <d2d1.h>
#include <windraw/graphics/canvas.hpp>
#include <windraw/graphics/shapes.hpp>
#include <windraw/util/color.hpp>
namespace
{
template <class Inte... | 24.431624 | 134 | 0.542767 | [
"shape"
] |
673b59b8fd64259d1452926a2ffcae77178d08d6 | 4,060 | hpp | C++ | include/Aether/types/ImageData.hpp | 3096/Aether | bc547ec192d8a973a63a97eda2994b3c2bdfeef7 | [
"MIT"
] | 9 | 2020-05-06T20:23:22.000Z | 2022-01-19T10:37:46.000Z | include/Aether/types/ImageData.hpp | 3096/Aether | bc547ec192d8a973a63a97eda2994b3c2bdfeef7 | [
"MIT"
] | 11 | 2020-03-22T03:40:50.000Z | 2020-06-09T00:53:13.000Z | include/Aether/types/ImageData.hpp | 3096/Aether | bc547ec192d8a973a63a97eda2994b3c2bdfeef7 | [
"MIT"
] | 6 | 2020-05-03T06:59:36.000Z | 2020-07-15T04:21:59.000Z | #ifndef AETHER_IMAGEDATA_HPP
#define AETHER_IMAGEDATA_HPP
#include "Aether/types/Colour.hpp"
#include <cstddef>
#include <cstdint>
#include <vector>
namespace Aether {
/**
* @brief Represents an object containing the raw pixel data for an image/texture
* as an array, along with required metad... | 38.666667 | 124 | 0.520443 | [
"object",
"vector"
] |
673e65d369d8d89f79351c57241aa090956aa700 | 1,165 | cpp | C++ | LeetCode/cpp/684.cpp | ZintrulCre/LeetCode_Archiver | de23e16ead29336b5ee7aa1898a392a5d6463d27 | [
"MIT"
] | 279 | 2019-02-19T16:00:32.000Z | 2022-03-23T12:16:30.000Z | LeetCode/cpp/684.cpp | ZintrulCre/LeetCode_Archiver | de23e16ead29336b5ee7aa1898a392a5d6463d27 | [
"MIT"
] | 2 | 2019-03-31T08:03:06.000Z | 2021-03-07T04:54:32.000Z | LeetCode/cpp/684.cpp | ZintrulCre/LeetCode_Crawler | de23e16ead29336b5ee7aa1898a392a5d6463d27 | [
"MIT"
] | 12 | 2019-01-29T11:45:32.000Z | 2019-02-04T16:31:46.000Z | class Solution {
vector<int> disjoint;
public:
vector<int> findRedundantConnection(vector<vector<int>> &edges) {
vector<int> ret(2, 0);
unordered_map<int, int> rank;
disjoint = vector<int>(1001, 0);
for (int i = 0; i < edges.size(); ++i) {
auto e = edges[i];
... | 29.125 | 69 | 0.387124 | [
"vector"
] |
6745e7e673793abb227b45d9e7f7f0b35eb5a36c | 4,495 | cpp | C++ | engine/core/graphics/common/spritesheet.cpp | warnwar/KestrelEngine | 985d1664b71aad62dd51721e0f81d5937d8ae9d4 | [
"MIT"
] | 47 | 2020-09-14T04:11:09.000Z | 2022-01-21T03:15:35.000Z | engine/core/graphics/common/spritesheet.cpp | warnwar/KestrelEngine | 985d1664b71aad62dd51721e0f81d5937d8ae9d4 | [
"MIT"
] | 19 | 2020-09-30T19:04:19.000Z | 2021-12-21T03:41:22.000Z | engine/core/graphics/common/spritesheet.cpp | warnwar/KestrelEngine | 985d1664b71aad62dd51721e0f81d5937d8ae9d4 | [
"MIT"
] | 3 | 2020-09-30T19:00:09.000Z | 2021-03-08T08:41:02.000Z | // Copyright (c) 2020 Tom Hancocks
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, ... | 31.65493 | 131 | 0.712792 | [
"vector"
] |
6746120f5b7597c8a391428b2f77ffbceef321b6 | 46,653 | cpp | C++ | homework2/solve.cpp | charleslucas/cs510 | 9515c1f236093db3287a018e4bfcf215b40bb67a | [
"MIT"
] | null | null | null | homework2/solve.cpp | charleslucas/cs510 | 9515c1f236093db3287a018e4bfcf215b40bb67a | [
"MIT"
] | null | null | null | homework2/solve.cpp | charleslucas/cs510 | 9515c1f236093db3287a018e4bfcf215b40bb67a | [
"MIT"
] | null | null | null | #include "maze.h"
#include "path.h"
#include<queue>
#include<vector>
#include<list>
#include<tuple>
#include<utility>
#include<iostream>
#include<climits>
#include<sstream>
#include<map>
#include<iomanip>
#include<algorithm>
using namespace std;
path solve_left(Maze& m, int rows, int cols);
path solve_dfs(Maze& m, int... | 48.345078 | 319 | 0.585729 | [
"vector"
] |
67485848eeac280451e225b4db45556e730bd5a1 | 2,303 | cpp | C++ | src/app/ModalController.cpp | ezavada/pdg | c7260ede7efb2cba313b9413be57cb5bb222b716 | [
"BSD-2-Clause"
] | null | null | null | src/app/ModalController.cpp | ezavada/pdg | c7260ede7efb2cba313b9413be57cb5bb222b716 | [
"BSD-2-Clause"
] | null | null | null | src/app/ModalController.cpp | ezavada/pdg | c7260ede7efb2cba313b9413be57cb5bb222b716 | [
"BSD-2-Clause"
] | null | null | null | // -----------------------------------------------
// ModalController.cpp
//
// Implementation of a base class to manage views
// and handle events
//
// Written by Nick Laiacona and Ed Zavada, 2010-2012
// Copyright (c) 2012, Dream Rock Studios, LLC
//
// Permission is hereby granted, free of charge, to any person ob... | 34.893939 | 104 | 0.711246 | [
"render"
] |
67530d3c84e23738a5486b99923e811e2a04d890 | 712 | hpp | C++ | include/anserial/deserializer.hpp | mushrom/anserial | bc3fdbfeed5b1a74461b4326af19bca895811196 | [
"MIT"
] | null | null | null | include/anserial/deserializer.hpp | mushrom/anserial | bc3fdbfeed5b1a74461b4326af19bca895811196 | [
"MIT"
] | null | null | null | include/anserial/deserializer.hpp | mushrom/anserial | bc3fdbfeed5b1a74461b4326af19bca895811196 | [
"MIT"
] | null | null | null | #pragma once
#include <anserial/base_ent.hpp>
#include <anserial/s_node.hpp>
#include <stdint.h>
#include <vector>
namespace anserial {
class deserializer {
public:
deserializer() {};
deserializer(uint32_t *datas, size_t entities) {
deserialize(datas, entities);
}
deserializer(std::vector<uint32_t> data... | 19.243243 | 56 | 0.710674 | [
"vector"
] |
67565ee01168054c384d94adab46d779b2ba9284 | 1,831 | hpp | C++ | importer/polygonidentifyer.hpp | kcwu/osm-history-renderer | ead3e533e142586ba51a8c991d186c68e9b682fe | [
"BSD-2-Clause"
] | 42 | 2015-05-05T05:02:45.000Z | 2022-01-08T17:27:12.000Z | importer/polygonidentifyer.hpp | kcwu/osm-history-renderer | ead3e533e142586ba51a8c991d186c68e9b682fe | [
"BSD-2-Clause"
] | 10 | 2015-02-08T21:34:09.000Z | 2019-10-18T06:56:22.000Z | importer/polygonidentifyer.hpp | kcwu/osm-history-renderer | ead3e533e142586ba51a8c991d186c68e9b682fe | [
"BSD-2-Clause"
] | 16 | 2015-02-08T20:54:29.000Z | 2021-02-01T19:30:25.000Z | /**
* In OpenStreetMaps a closed way (a way with the sae start- and end-node)
* can be either a polygon or linestring. If it's the one or the other
* needs to be decided by looking at the tags. This class provides a list
* of tags that indicate a way looks like a polygon. This decision is only
* made based on the ... | 24.413333 | 93 | 0.59148 | [
"geometry"
] |
67570badf6a59e619b19a0ed1d0de6cc341bc705 | 15,416 | cpp | C++ | src/metadata/metadata1.cpp | melchor629/node-flac-bindings | 584bd52ef12de4562dca0f198220f2c136666ce2 | [
"0BSD"
] | 13 | 2017-01-07T07:48:54.000Z | 2021-09-29T05:33:38.000Z | src/metadata/metadata1.cpp | melchor629/node-flac-bindings | 584bd52ef12de4562dca0f198220f2c136666ce2 | [
"0BSD"
] | 27 | 2016-11-24T11:35:22.000Z | 2022-02-14T14:38:09.000Z | src/metadata/metadata1.cpp | melchor629/node-flac-bindings | 584bd52ef12de4562dca0f198220f2c136666ce2 | [
"0BSD"
] | 3 | 2017-10-19T10:12:11.000Z | 2019-10-11T16:21:09.000Z | #include "../mappings/mappings.hpp"
#include "../mappings/native_async_iterator.hpp"
#include "../mappings/native_iterator.hpp"
#include "../utils/async.hpp"
#include "../utils/enum.hpp"
#include <FLAC/metadata.h>
#include <memory>
namespace flac_bindings {
using namespace Napi;
class SimpleIterator: public Obje... | 35.520737 | 97 | 0.645887 | [
"object"
] |
67622ccf7b46b7dca6bb40deffa72589c945e6b8 | 14,934 | cpp | C++ | src/slaggy-engine/slaggy-engine/programs/HelloTriangleProgram.cpp | SlaggyWolfie/slaggy-engine | 846235c93a52a96be85c5274a1372bc09c16f144 | [
"MIT"
] | 1 | 2021-09-24T23:13:13.000Z | 2021-09-24T23:13:13.000Z | src/slaggy-engine/slaggy-engine/programs/HelloTriangleProgram.cpp | SlaggyWolfie/slaggy-engine | 846235c93a52a96be85c5274a1372bc09c16f144 | [
"MIT"
] | null | null | null | src/slaggy-engine/slaggy-engine/programs/HelloTriangleProgram.cpp | SlaggyWolfie/slaggy-engine | 846235c93a52a96be85c5274a1372bc09c16f144 | [
"MIT"
] | 2 | 2020-06-24T07:10:13.000Z | 2022-03-08T17:19:12.000Z | #include "HelloTriangleProgram.hpp"
#include <glad/glad.h>
#include <GLFW/glfw3.h>
#include <iostream>
namespace slaggy
{
int HelloTriangleProgram::run()
{
// Initialize GLFW context with OpenGL version 3.3 using the Core OpenGL profile
glfwInit();
glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);
glfwWindowHi... | 27.604436 | 124 | 0.685282 | [
"render",
"object",
"shape"
] |
6763f7192f6550646badca5a63b5cda4178e42ea | 8,213 | cpp | C++ | mods/bbsutils/telnetserver.cpp | lmorchard/apone | 1fa82927a9fbcbe953976ac9796f32092ad52ac2 | [
"MIT"
] | 8 | 2015-04-30T07:53:21.000Z | 2018-09-13T22:06:40.000Z | mods/bbsutils/telnetserver.cpp | lmorchard/apone | 1fa82927a9fbcbe953976ac9796f32092ad52ac2 | [
"MIT"
] | 5 | 2015-12-02T09:01:00.000Z | 2018-10-12T16:06:33.000Z | mods/bbsutils/telnetserver.cpp | lmorchard/apone | 1fa82927a9fbcbe953976ac9796f32092ad52ac2 | [
"MIT"
] | 2 | 2018-09-13T15:48:29.000Z | 2021-05-04T15:31:10.000Z | #include <coreutils/log.h>
#include "telnetserver.h"
#include <coreutils/utils.h>
#include <algorithm>
LOGSPACE("utils");
namespace bbs {
using namespace std;
using namespace utils;
// TELNETSERVER
void TelnetServer::OnAccept::exec(NL::Socket* socket, NL::SocketGroup* group, void* reference) {
auto *ts = static_... | 21.613158 | 119 | 0.652502 | [
"vector"
] |
676918da4475cc0ddb5e3bdfadf71314c938f511 | 1,972 | cpp | C++ | src/brew/video/gl/GLShaderProgram.cpp | grrrrunz/brew | 13e17e2f6c9fb0f612c3a0bcabd233085ca15867 | [
"MIT"
] | 1 | 2018-02-09T16:20:50.000Z | 2018-02-09T16:20:50.000Z | src/brew/video/gl/GLShaderProgram.cpp | grrrrunz/brew | 13e17e2f6c9fb0f612c3a0bcabd233085ca15867 | [
"MIT"
] | null | null | null | src/brew/video/gl/GLShaderProgram.cpp | grrrrunz/brew | 13e17e2f6c9fb0f612c3a0bcabd233085ca15867 | [
"MIT"
] | null | null | null | /**
*
* |_ _ _
* |_)| (/_VV
*
* Copyright 2015-2018 Marcus v. Keil
*
* Created on: 03.01.18
*
*/
#include <brew/video/gl/GLShaderProgram.h>
#include <brew/video/gl/GLShader.h>
#include <brew/video/gl/GLExtensions.h>
namespace brew {
using gl = GL20;
GLShaderProgramContextHandle::GLShaderProgramContext... | 26.293333 | 108 | 0.679006 | [
"vector"
] |
6773136059f3469e8b602f92b863910e74a601d1 | 5,651 | cc | C++ | src/restore_driver.cc | darkstar62/tribble-backup | 4a50a641684b25a6ff9c2850cad2ede0fa487a00 | [
"BSD-3-Clause"
] | null | null | null | src/restore_driver.cc | darkstar62/tribble-backup | 4a50a641684b25a6ff9c2850cad2ede0fa487a00 | [
"BSD-3-Clause"
] | null | null | null | src/restore_driver.cc | darkstar62/tribble-backup | 4a50a641684b25a6ff9c2850cad2ede0fa487a00 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (C) 2013, All Rights Reserved.
// Author: Cory Maccarrone <darkstar6262@gmail.com>
#include "src/restore_driver.h"
#include <memory>
#include <string>
#include <utility>
#include <vector>
#include "boost/filesystem.hpp"
#include "gflags/gflags.h"
#include "glog/logging.h"
#include "src/backup_library.h"... | 32.477011 | 80 | 0.654574 | [
"vector"
] |
6778ac183798f2ad800fb13e588f7e456f15e131 | 88,720 | cpp | C++ | Engine/Code/engine.cpp | MarcRosellH/Advanced_Graphics_Programming | a7c9a3a968dfe9bb068c673de41e855fd969a220 | [
"MIT"
] | null | null | null | Engine/Code/engine.cpp | MarcRosellH/Advanced_Graphics_Programming | a7c9a3a968dfe9bb068c673de41e855fd969a220 | [
"MIT"
] | null | null | null | Engine/Code/engine.cpp | MarcRosellH/Advanced_Graphics_Programming | a7c9a3a968dfe9bb068c673de41e855fd969a220 | [
"MIT"
] | null | null | null | //
// engine.cpp : Put all your graphics stuff in this file. This is kind of the graphics module.
// In here, you should type all your OpenGL commands, and you can also type code to handle
// input platform events (e.g to move the camera or react to certain shortcuts), writing some
// graphics related GUI options, and ... | 42.694899 | 204 | 0.656954 | [
"mesh",
"geometry",
"render",
"vector",
"model"
] |
678283179560d339c3a9614bb58832408a04f7cf | 12,831 | hpp | C++ | cplus/libcfsec/cfsec/CFSecISOTZoneBuff.hpp | msobkow/cfsec_2_13 | 4f5b2d82d4265e1373955a63bea4d1a9fc35a64e | [
"Apache-2.0"
] | null | null | null | cplus/libcfsec/cfsec/CFSecISOTZoneBuff.hpp | msobkow/cfsec_2_13 | 4f5b2d82d4265e1373955a63bea4d1a9fc35a64e | [
"Apache-2.0"
] | null | null | null | cplus/libcfsec/cfsec/CFSecISOTZoneBuff.hpp | msobkow/cfsec_2_13 | 4f5b2d82d4265e1373955a63bea4d1a9fc35a64e | [
"Apache-2.0"
] | null | null | null | #pragma once
// Description: C++18 specification for a ISOTZone buffer object.
/*
* org.msscf.msscf.CFSec
*
* Copyright (c) 2020 Mark Stephen Sobkow
*
* MSS Code Factory CFSec 2.13 Security Essentials
*
* Copyright 2020-2021 Mark Stephen Sobkow
*
* This file is part of MSS Code Factory.
*
* MSS Code ... | 47.876866 | 105 | 0.766971 | [
"object"
] |
678b05ce6d1046cafa86e310eda697d59450c40d | 960 | cpp | C++ | src/luogu/P1007/23690813_ac_100_25ms_808k_noO2.cpp | lnkkerst/oj-codes | d778489182d644370b2a690aa92c3df6542cc306 | [
"MIT"
] | null | null | null | src/luogu/P1007/23690813_ac_100_25ms_808k_noO2.cpp | lnkkerst/oj-codes | d778489182d644370b2a690aa92c3df6542cc306 | [
"MIT"
] | null | null | null | src/luogu/P1007/23690813_ac_100_25ms_808k_noO2.cpp | lnkkerst/oj-codes | d778489182d644370b2a690aa92c3df6542cc306 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <cctype>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <iostream>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <iomanip>
#include <map>
using namespace std;
int read() {
int ret;
bool f = 0;
c... | 20 | 77 | 0.50625 | [
"vector"
] |
096b468f9bfcc08291e5d14b88e2f4dd9ca8a9f9 | 15,674 | cpp | C++ | src/wire/core/detail/reference_resolver.cpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | 5 | 2016-04-07T19:49:39.000Z | 2021-08-03T05:24:11.000Z | src/wire/core/detail/reference_resolver.cpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | null | null | null | src/wire/core/detail/reference_resolver.cpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | 1 | 2020-12-27T11:47:31.000Z | 2020-12-27T11:47:31.000Z | /*
* reference_resolver.cpp
*
* Created on: Oct 3, 2016
* Author: zmij
*/
#include <wire/core/detail/reference_resolver.hpp>
#include <wire/core/detail/configuration_options.hpp>
#include <wire/core/connector.hpp>
#include <wire/core/reference.hpp>
#include <wire/core/proxy.hpp>
#include <wire/core/locator.... | 35.461538 | 105 | 0.508613 | [
"object"
] |
09727b13eb64d0956730b84c4a8ed0d41957d7c1 | 842 | cc | C++ | solutions/kattis/molekule.cc | zwliew/ctci | 871f4fc957be96c6d0749d205549b7b35dc53d9e | [
"MIT"
] | 4 | 2020-11-07T14:38:02.000Z | 2022-01-03T19:02:36.000Z | solutions/kattis/molekule.cc | zwliew/ctci | 871f4fc957be96c6d0749d205549b7b35dc53d9e | [
"MIT"
] | 1 | 2019-04-17T06:55:14.000Z | 2019-04-17T06:55:14.000Z | solutions/kattis/molekule.cc | zwliew/ctci | 871f4fc957be96c6d0749d205549b7b35dc53d9e | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
#define debug(...) 0
#ifdef LOCAL
#include "../../_library/cc/debug.h"
#endif
void dfs(vector<vector<int>>& adj, vector<int>& col, int u, int c) {
col[u] = c;
for (int v : adj[u]) {
if (!col[v])
dfs(adj, col, v, c == 1 ? 2 : 1);
}
}
int main() {
cin.tie(... | 20.047619 | 69 | 0.515439 | [
"vector"
] |
097af6c4bf124660e76b1842a4a1416b17adb6fa | 3,579 | cpp | C++ | Sample/LTest.cpp | dora-BYR/MemoryPool | 6cb25ad205523436deef6b156e0ba43952453bac | [
"MIT"
] | 11 | 2016-05-21T22:00:14.000Z | 2021-08-07T02:34:23.000Z | Sample/LTest.cpp | dora-BYR/MemoryPool | 6cb25ad205523436deef6b156e0ba43952453bac | [
"MIT"
] | 1 | 2016-05-21T22:00:39.000Z | 2016-05-21T22:00:39.000Z | Sample/LTest.cpp | dora-BYR/MemoryPool | 6cb25ad205523436deef6b156e0ba43952453bac | [
"MIT"
] | 2 | 2016-10-13T09:32:08.000Z | 2017-07-15T09:31:35.000Z | //
// Created by 龙辉 on 16/4/12.
// Copyright (c) 2016 yuemo studio. All rights reserved.
//
#include "LTest.h"
#include "LMemoryPool.h"
#include <string>
void LTest::test_memPool() {
printf("//////////////////////////////// 内存池功能测试 ////////////////////////////////\n");
LTestObject1 * pObject = nullptr;
au... | 33.448598 | 146 | 0.583962 | [
"object"
] |
0980e05dc787f4ace8473c898945ac68871aa38a | 574,919 | cpp | C++ | Source/Rhi/Private/Direct3D12Rhi/Direct3D12Rhi.cpp | cofenberg/unrimp | 90310657f106eb83f3a9688329b78619255a1042 | [
"MIT"
] | 187 | 2015-11-02T21:27:57.000Z | 2022-02-17T21:39:17.000Z | Source/Rhi/Private/Direct3D12Rhi/Direct3D12Rhi.cpp | cofenberg/unrimp | 90310657f106eb83f3a9688329b78619255a1042 | [
"MIT"
] | null | null | null | Source/Rhi/Private/Direct3D12Rhi/Direct3D12Rhi.cpp | cofenberg/unrimp | 90310657f106eb83f3a9688329b78619255a1042 | [
"MIT"
] | 20 | 2015-11-04T19:17:01.000Z | 2021-11-18T11:23:25.000Z | /*********************************************************\
* Copyright (c) 2012-2021 The Unrimp Team
*
* 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 wit... | 40.246342 | 569 | 0.692816 | [
"mesh",
"geometry",
"render",
"object",
"model",
"3d"
] |
09821833cbc90d5eb889c09f95d6be8836709e74 | 4,157 | cc | C++ | chrome/browser/feedback/feedback_uploader_unittest.cc | hokein/chromium | 69328672dd0c5b93e0b65fc344feb11bbdc37b6b | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2019-04-27T20:21:55.000Z | 2019-04-27T20:21:55.000Z | chrome/browser/feedback/feedback_uploader_unittest.cc | hokein/chromium | 69328672dd0c5b93e0b65fc344feb11bbdc37b6b | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | chrome/browser/feedback/feedback_uploader_unittest.cc | hokein/chromium | 69328672dd0c5b93e0b65fc344feb11bbdc37b6b | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | // Copyright 2013 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 "chrome/browser/feedback/feedback_uploader.h"
#include "base/bind.h"
#include "base/message_loop/message_loop.h"
#include "base/run_loop.h"
#inc... | 30.123188 | 78 | 0.752706 | [
"vector"
] |
0989959d97924d7ec6fee3320b1a37a8f8b62165 | 16,105 | hpp | C++ | Example/MoyaComparison/Pods/Realm/include/core/realm/util/shunting_yard_parser.hpp | QuentinArnault/NetworkStack | c4d4f2a1d6a4a35ee9b7d42f47606b1ccfd87591 | [
"Apache-2.0"
] | 36 | 2017-01-26T15:54:50.000Z | 2021-06-17T03:15:17.000Z | Example/MoyaComparison/Pods/Realm/include/core/realm/util/shunting_yard_parser.hpp | QuentinArnault/NetworkStack | c4d4f2a1d6a4a35ee9b7d42f47606b1ccfd87591 | [
"Apache-2.0"
] | 24 | 2017-02-07T20:52:11.000Z | 2021-06-10T07:26:18.000Z | Example/MoyaComparison/Pods/Realm/include/core/realm/util/shunting_yard_parser.hpp | QuentinArnault/NetworkStack | c4d4f2a1d6a4a35ee9b7d42f47606b1ccfd87591 | [
"Apache-2.0"
] | 11 | 2017-10-25T14:51:51.000Z | 2021-03-26T10:52:49.000Z | /*************************************************************************
*
* REALM CONFIDENTIAL
* __________________
*
* [2011] - [2015] Realm Inc
* All Rights Reserved.
*
* NOTICE: All information contained herein is, and remains
* the property of Realm Incorporated and its suppliers,
* if any. The int... | 36.602273 | 114 | 0.598013 | [
"vector"
] |
098efd956ec007ba7cfd5334f3842dd4982678d1 | 3,922 | cpp | C++ | src/CommandLineOptions.cpp | Sourin-chatterjee/SpinParser | 23fa90c327b8a4543e5afac1b64d18df40975182 | [
"MIT"
] | 18 | 2021-06-03T16:03:02.000Z | 2022-02-28T00:48:53.000Z | src/CommandLineOptions.cpp | Sourin-chatterjee/SpinParser | 23fa90c327b8a4543e5afac1b64d18df40975182 | [
"MIT"
] | 3 | 2021-10-08T15:51:51.000Z | 2022-03-31T22:20:01.000Z | src/CommandLineOptions.cpp | Sourin-chatterjee/SpinParser | 23fa90c327b8a4543e5afac1b64d18df40975182 | [
"MIT"
] | 2 | 2022-02-10T17:15:05.000Z | 2022-02-11T19:54:27.000Z | /**
* @file CommandLineOptions.cpp
* @author Finn Lasse Buessen
* @brief Parser for command line arguments.
*
* @copyright Copyright (c) 2020
*/
#include <iostream>
#include <boost/program_options.hpp>
#include <boost/filesystem.hpp>
#include "CommandLineOptions.hpp"
CommandLineOptions::CommandLineOptions(int... | 34.104348 | 232 | 0.722845 | [
"model"
] |
0991fb0ce7dce2dbc991441215928c256362a1bf | 31,863 | cpp | C++ | aspects/fluid/potential/GunnsGasFan.cpp | nasa/gunns | 248323939a476abe5178538cd7a3512b5f42675c | [
"NASA-1.3"
] | 18 | 2020-01-23T12:14:09.000Z | 2022-02-27T22:11:35.000Z | aspects/fluid/potential/GunnsGasFan.cpp | nasa/gunns | 248323939a476abe5178538cd7a3512b5f42675c | [
"NASA-1.3"
] | 39 | 2020-11-20T12:19:35.000Z | 2022-02-22T18:45:55.000Z | aspects/fluid/potential/GunnsGasFan.cpp | nasa/gunns | 248323939a476abe5178538cd7a3512b5f42675c | [
"NASA-1.3"
] | 7 | 2020-02-10T19:25:43.000Z | 2022-03-16T01:10:00.000Z | /************************** TRICK HEADER ***********************************************************
@copyright Copyright 2019 United States Government as represented by the Administrator of the
National Aeronautics and Space Administration. All Rights Reserved.
PURPOSE:
(Classes for the GUNNS Gas Fan M... | 47.986446 | 122 | 0.550545 | [
"object",
"vector",
"model"
] |
0998da8a6f1a885859d54707d46a8cdd6df6a6c8 | 9,972 | cpp | C++ | inetsrv/iis/svcs/staxcore/fcache2/sdcache/sdcache.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | inetsrv/iis/svcs/staxcore/fcache2/sdcache/sdcache.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | inetsrv/iis/svcs/staxcore/fcache2/sdcache/sdcache.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | /*++
SDCACHE.CPP
This file implements the security descriptor cache.
Our goal is to enable the file handle cache to consume less memory
representing security descriptors, by enabling duplicate
security descriptors to be detected and referenced in here.
--*/
#include <windows.h>
#include <dbgtrace.... | 21.307692 | 84 | 0.622543 | [
"object"
] |
09bf794ed0a66c807f03641f161c78cc09ffc592 | 12,896 | hpp | C++ | include/Zenject/FactoryFromBinderBase.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/Zenject/FactoryFromBinderBase.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/Zenject/FactoryFromBinderBase.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: Zenject.ScopeConcreteIdArgConditionCopyNonLazyBinder
#include "Zenject... | 58.618182 | 299 | 0.76326 | [
"object",
"vector"
] |
09bfc4bbc2d16f9725690502a8f66d0c0ed60761 | 689 | cpp | C++ | DESIRE-Engine/src/Engine/Script/ScriptComponent.cpp | nyaki-HUN/DESIRE | dd579bffa77bc6999266c8011bc389bb96dee01d | [
"BSD-2-Clause"
] | 1 | 2020-10-04T18:50:01.000Z | 2020-10-04T18:50:01.000Z | DESIRE-Engine/src/Engine/Script/ScriptComponent.cpp | nyaki-HUN/DESIRE | dd579bffa77bc6999266c8011bc389bb96dee01d | [
"BSD-2-Clause"
] | null | null | null | DESIRE-Engine/src/Engine/Script/ScriptComponent.cpp | nyaki-HUN/DESIRE | dd579bffa77bc6999266c8011bc389bb96dee01d | [
"BSD-2-Clause"
] | 1 | 2018-09-18T08:03:33.000Z | 2018-09-18T08:03:33.000Z | #include "Engine/stdafx.h"
#include "Engine/Script/ScriptComponent.h"
#include "Engine/Core/String/String.h"
#include "Engine/Script/ScriptSystem.h"
ScriptComponent::ScriptComponent(GameObject& object)
: Component(object)
{
Modules::ScriptSystem->OnScriptComponentCreated(this);
}
ScriptComponent::~ScriptComponent... | 25.518519 | 108 | 0.793904 | [
"object"
] |
09c13e8cb9d5245a0239cbdb7c60a8a81141c9d6 | 7,646 | hpp | C++ | src/core/engine/engine.hpp | SJTU-IPADS/wukong-cube | ccabf1b754978322277dc881a43cedfd2687070f | [
"Apache-2.0"
] | 7 | 2021-06-22T06:24:21.000Z | 2022-02-16T02:48:38.000Z | src/core/engine/engine.hpp | SJTU-IPADS/wukong-cube | ccabf1b754978322277dc881a43cedfd2687070f | [
"Apache-2.0"
] | 4 | 2021-12-22T15:11:02.000Z | 2021-12-22T15:27:50.000Z | src/core/engine/engine.hpp | SJTU-IPADS/wukong-cube | ccabf1b754978322277dc881a43cedfd2687070f | [
"Apache-2.0"
] | 1 | 2022-01-19T04:23:18.000Z | 2022-01-19T04:23:18.000Z | /*
* Copyright (c) 2016 Shanghai Jiao Tong University.
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.... | 32.53617 | 107 | 0.567486 | [
"vector"
] |
09c75ba08483285f6b733ad42ab17313fdc1c489 | 17,146 | cpp | C++ | avs/vis_avs/r_water.cpp | czeskij/vis_avs | 10cbc47adbc128f17505c695535d8cbec243410e | [
"Unlicense"
] | null | null | null | avs/vis_avs/r_water.cpp | czeskij/vis_avs | 10cbc47adbc128f17505c695535d8cbec243410e | [
"Unlicense"
] | null | null | null | avs/vis_avs/r_water.cpp | czeskij/vis_avs | 10cbc47adbc128f17505c695535d8cbec243410e | [
"Unlicense"
] | null | null | null | /*
LICENSE
-------
Copyright 2005 Nullsoft, Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditio... | 27.129747 | 160 | 0.38353 | [
"render"
] |
09cccf8987534982c55b57ecbe7616780889d54a | 2,713 | cpp | C++ | day02/day02.cpp | adrn/advent-of-code | d36c274b5e8ed872ea302113bf8f772b666fb694 | [
"MIT"
] | 2 | 2021-12-01T17:42:56.000Z | 2021-12-02T02:26:26.000Z | day02/day02.cpp | adrn/advent-of-code | d36c274b5e8ed872ea302113bf8f772b666fb694 | [
"MIT"
] | null | null | null | day02/day02.cpp | adrn/advent-of-code | d36c274b5e8ed872ea302113bf8f772b666fb694 | [
"MIT"
] | null | null | null | #include <string>
#include <iostream>
#include <fstream>
#include <vector>
#include <charconv>
#include <stdexcept>
std::vector<std::string> split(std::string text, char sep) {
std::vector<std::string> tokens = {};
std::string token = "";
for (unsigned int i = 0; i < text.size(); i++) {
if ((char)... | 25.35514 | 93 | 0.526723 | [
"vector"
] |
09e09097f0192c0f8665d093006afdc9bd0f0adb | 3,038 | cpp | C++ | test/algorithm/variable_length_encoding.cpp | lastfm/libmoost | 895db7cc5468626f520971648741488c373c5cff | [
"MIT"
] | 37 | 2015-02-22T17:15:44.000Z | 2022-02-24T02:24:41.000Z | test/algorithm/variable_length_encoding.cpp | lastfm/libmoost | 895db7cc5468626f520971648741488c373c5cff | [
"MIT"
] | null | null | null | test/algorithm/variable_length_encoding.cpp | lastfm/libmoost | 895db7cc5468626f520971648741488c373c5cff | [
"MIT"
] | 11 | 2015-02-12T04:35:06.000Z | 2022-01-19T12:46:32.000Z | /* vim:set ts=3 sw=3 sts=3 et: */
/**
* Copyright © 2008-2013 Last.fm Limited
*
* This file is part of libmoost.
*
* 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,
... | 29.784314 | 77 | 0.731731 | [
"vector"
] |
09e57fe8e0b6187c7da48e9eb6d907a27a0c406d | 10,529 | cpp | C++ | source/xpe/internal.XPressoEffector.cpp | youdiaozi/c4d-nr-toolbox | ca6c5f737c901e2f74aeb0bc7aa477387d1a5cd6 | [
"BSD-3-Clause"
] | 16 | 2018-09-12T10:38:26.000Z | 2021-06-28T22:57:30.000Z | source/xpe/internal.XPressoEffector.cpp | youdiaozi/c4d-nr-toolbox | ca6c5f737c901e2f74aeb0bc7aa477387d1a5cd6 | [
"BSD-3-Clause"
] | 10 | 2018-09-11T17:20:09.000Z | 2020-06-02T04:11:01.000Z | source/xpe/internal.XPressoEffector.cpp | NiklasRosenstein/c4d-nr-toolbox | 28197ea7fcf396b5941277b049168d7faf00bfbf | [
"BSD-3-Clause"
] | 6 | 2018-11-30T23:34:49.000Z | 2021-04-02T15:03:23.000Z | /**
* Copyright (C) 2013-2015 Niklas Rosenstein
*
* 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 o... | 34.074434 | 127 | 0.596638 | [
"object",
"vector"
] |
09e6ef5881e42a6c8a93213356f81c33fd149dd9 | 72,568 | cpp | C++ | MaxCommon/hoa.process_tilde.cpp | CICM/HoaLibrary-Max | cfe110ff040cfda0dd3547ee7e9ec7c11d6dd3b6 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 71 | 2015-02-23T12:24:05.000Z | 2022-02-15T00:18:30.000Z | MaxCommon/hoa.process_tilde.cpp | pb5/HoaLibrary-Max | cfe110ff040cfda0dd3547ee7e9ec7c11d6dd3b6 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 13 | 2015-04-22T17:13:53.000Z | 2020-11-12T10:54:29.000Z | MaxCommon/hoa.process_tilde.cpp | pb5/HoaLibrary-Max | cfe110ff040cfda0dd3547ee7e9ec7c11d6dd3b6 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 8 | 2015-04-11T21:34:51.000Z | 2020-02-29T14:37:53.000Z | /*
// Copyright (c) 2012-2015 Eliott Paris, Julien Colafrancesco & Pierre Guillot, CICM, Universite Paris 8.
// For information on usage and redistribution, and for a DISCLAIMER OF ALL
// WARRANTIES, see the file, "LICENSE.txt," in this distribution.
*/
// based on dynamicdsp~ Copyright 2010 Alex Harker. All rights re... | 34.45774 | 342 | 0.640613 | [
"object",
"3d"
] |
09ec83c8d7203a59113641a05f5b24fe69a47dff | 3,108 | hh | C++ | include/libport/weak-ptr.hh | jcbaillie/libport | b8192b177ae0ae63979c17ea7685a8617b03e11f | [
"BSD-3-Clause"
] | 3 | 2015-05-29T09:35:32.000Z | 2021-02-23T07:45:01.000Z | include/libport/weak-ptr.hh | jcbaillie/libport | b8192b177ae0ae63979c17ea7685a8617b03e11f | [
"BSD-3-Clause"
] | 2 | 2019-01-31T10:23:47.000Z | 2019-01-31T10:35:06.000Z | include/libport/weak-ptr.hh | jcbaillie/libport | b8192b177ae0ae63979c17ea7685a8617b03e11f | [
"BSD-3-Clause"
] | 7 | 2015-01-29T20:49:06.000Z | 2019-04-24T04:06:22.000Z | /*
* Copyright (C) 2008-2010, Gostai S.A.S.
*
* This software is provided "as is" without warranty of any kind,
* either expressed or implied, including but not limited to the
* implied warranties of fitness for a particular purpose.
*
* See the LICENSE file for more information.
*/
#ifndef LIBPORT_WEAK_PTR_HH... | 27.75 | 79 | 0.648005 | [
"object"
] |
09f431a6032dc6a1408ad8cecd6ba774c05684ff | 44,865 | cpp | C++ | RobotRaconteurCore/src/HardwareTransport_win.cpp | robotraconteur/robotraconteur | ff997351761a687be364234684202e3348c4083c | [
"Apache-2.0"
] | 37 | 2019-01-31T06:05:17.000Z | 2022-03-21T06:56:18.000Z | RobotRaconteurCore/src/HardwareTransport_win.cpp | robotraconteur/robotraconteur | ff997351761a687be364234684202e3348c4083c | [
"Apache-2.0"
] | 14 | 2019-07-18T04:09:45.000Z | 2021-08-31T02:04:22.000Z | RobotRaconteurCore/src/HardwareTransport_win.cpp | robotraconteur/robotraconteur | ff997351761a687be364234684202e3348c4083c | [
"Apache-2.0"
] | 3 | 2018-11-23T22:03:22.000Z | 2021-11-02T10:03:39.000Z | // Copyright 2011-2020 Wason Technology, 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... | 26.084302 | 356 | 0.745369 | [
"vector"
] |
09feb5724fc75011e5d1b07e05440b33df178abe | 8,231 | cpp | C++ | build/soccerwindow2-prefix/src/soccerwindow2-build/soccerwindow2_autogen/26NLMM5NFG/moc_main_window.cpp | temporaryforijcai/hfo-plus | b9f860c2cff48bea4a906609148710f9bea41792 | [
"MIT"
] | 1 | 2022-01-21T08:03:46.000Z | 2022-01-21T08:03:46.000Z | build/soccerwindow2-prefix/src/soccerwindow2-build/soccerwindow2_autogen/26NLMM5NFG/moc_main_window.cpp | temporaryforijcai/hfo-plus | b9f860c2cff48bea4a906609148710f9bea41792 | [
"MIT"
] | null | null | null | build/soccerwindow2-prefix/src/soccerwindow2-build/soccerwindow2_autogen/26NLMM5NFG/moc_main_window.cpp | temporaryforijcai/hfo-plus | b9f860c2cff48bea4a906609148710f9bea41792 | [
"MIT"
] | null | null | null | /****************************************************************************
** Meta object code from reading C++ file 'main_window.h'
**
** Created by: The Qt Meta Object Compiler version 63 (Qt 4.8.7)
**
** WARNING! All changes made in this file will be lost!
*********************************************************... | 38.106481 | 125 | 0.585227 | [
"object"
] |
6708eef7de2e9539c5f88437eeddb3f29cccf4f5 | 17,635 | cpp | C++ | tests/MeshCostFunction.cpp | arpg/torch | 601ec64854008d97e39d2ca86ef4a93f79930967 | [
"Apache-2.0"
] | 1 | 2018-05-29T03:08:54.000Z | 2018-05-29T03:08:54.000Z | tests/MeshCostFunction.cpp | arpg/torch | 601ec64854008d97e39d2ca86ef4a93f79930967 | [
"Apache-2.0"
] | null | null | null | tests/MeshCostFunction.cpp | arpg/torch | 601ec64854008d97e39d2ca86ef4a93f79930967 | [
"Apache-2.0"
] | 1 | 2017-07-24T11:58:52.000Z | 2017-07-24T11:58:52.000Z | #include <gtest/gtest.h>
#include <torch/Torch.h>
namespace torch
{
namespace testing
{
TEST(MeshCostFunction, General)
{
std::shared_ptr<Scene> scene;
scene = std::make_shared<Scene>();
std::vector<Spectrum> albedos;
albedos.push_back(Spectrum::FromRGB(1, 1, 1));
albedos.push_back(Spectrum::FromRGB(1, 1, ... | 28.628247 | 90 | 0.62858 | [
"mesh",
"geometry",
"vector"
] |
e24dd5d911cb6a4a5a5524ab69d0fd51b05800bf | 10,245 | cpp | C++ | Firmware/PGR Telemetry Master/src/main.cpp | BOJIT/Greenpower-Datalogging-System | 7be925d2f3b5051376bcb11a48a87c1a57786016 | [
"MIT"
] | null | null | null | Firmware/PGR Telemetry Master/src/main.cpp | BOJIT/Greenpower-Datalogging-System | 7be925d2f3b5051376bcb11a48a87c1a57786016 | [
"MIT"
] | null | null | null | Firmware/PGR Telemetry Master/src/main.cpp | BOJIT/Greenpower-Datalogging-System | 7be925d2f3b5051376bcb11a48a87c1a57786016 | [
"MIT"
] | null | null | null | #include <Arduino.h>
#include "main.h"
#include <Wire.h>
#include "RTCLib.h"
#include <SPI.h>
#include <SD.h>
// this system uses a delimited text file system where data entries are separated by tabs (ASCII 009)
// define packet lengths for each variable
#define Voltage1_LEN 1
#define Voltage2_LEN 1
#define Current_... | 29.105114 | 123 | 0.615227 | [
"object"
] |
e253ff7c85add6ec552ccd2a35fc2b5615b7a6ae | 871 | cpp | C++ | src/quadrature/triangle_quadrature.cpp | annierhea/neon | 4eb51a06bda6bbf32c54fff8f39c9e02d429cfd1 | [
"MIT"
] | null | null | null | src/quadrature/triangle_quadrature.cpp | annierhea/neon | 4eb51a06bda6bbf32c54fff8f39c9e02d429cfd1 | [
"MIT"
] | null | null | null | src/quadrature/triangle_quadrature.cpp | annierhea/neon | 4eb51a06bda6bbf32c54fff8f39c9e02d429cfd1 | [
"MIT"
] | null | null | null |
#include "triangle_quadrature.hpp"
#include <algorithm>
namespace neon
{
triangle_quadrature::triangle_quadrature(point const p)
{
switch (p)
{
case point::one:
{
w = {1.0};
clist = {{0, 1.0 / 3.0, 1.0 / 3.0}};
break;
}
case point::three:
... | 25.617647 | 104 | 0.437428 | [
"transform"
] |
e25625736301d19aa665f39e0daf335570331594 | 605 | cpp | C++ | Cube.cpp | PeterZhizhin/OpenGL3DShooter | 15e1160699c032307e82a965988f8c8550749b65 | [
"Apache-2.0"
] | null | null | null | Cube.cpp | PeterZhizhin/OpenGL3DShooter | 15e1160699c032307e82a965988f8c8550749b65 | [
"Apache-2.0"
] | 1 | 2015-07-07T15:29:06.000Z | 2015-07-07T15:29:06.000Z | Cube.cpp | PeterZhizhin/OpenGL3DShooter | 15e1160699c032307e82a965988f8c8550749b65 | [
"Apache-2.0"
] | null | null | null | #include "Cube.h"
#include <vector>
#include <iostream>
const std::vector<VertexData> Cube::getVertecies()
{
std::cout << "Creating vertecies" << std::endl;
std::vector<VertexData> result;
VertexData vertex;
result.reserve(3);
vertex.setVertex(-1.0f,-1.0f,0.0f);
vertex.print();
result.push_back(vertex);
ver... | 18.333333 | 52 | 0.68595 | [
"vector"
] |
e25ea3d804e900b4e36b1a6d810ab3a794fce816 | 1,519 | cpp | C++ | hackerrank/components-in-graph.cpp | btjanaka/competitive-programming-solutions | e3df47c18451802b8521ebe61ca71ee348e5ced7 | [
"MIT"
] | 3 | 2020-06-25T21:04:02.000Z | 2021-05-12T03:33:19.000Z | hackerrank/components-in-graph.cpp | btjanaka/competitive-programming-solutions | e3df47c18451802b8521ebe61ca71ee348e5ced7 | [
"MIT"
] | null | null | null | hackerrank/components-in-graph.cpp | btjanaka/competitive-programming-solutions | e3df47c18451802b8521ebe61ca71ee348e5ced7 | [
"MIT"
] | 1 | 2020-06-25T21:04:06.000Z | 2020-06-25T21:04:06.000Z | // Author: btjanaka (Bryon Tjanaka)
// Problem: (HackerRank) components-in-graph
// Title: Components in a Graph
// Link: https://www.hackerrank.com/challenges/components-in-graph/problem
// Idea: Use a union find to figure out which nodes get connected, then count
// the sizes of all the components.
// Difficulty: med... | 22.671642 | 80 | 0.529954 | [
"vector"
] |
e2645a5f46209c59669a72ae9a1aad9c2075fb35 | 11,056 | cc | C++ | third_party/blink/renderer/core/paint/svg_paint_context.cc | zipated/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 2,151 | 2020-04-18T07:31:17.000Z | 2022-03-31T08:39:18.000Z | third_party/blink/renderer/core/paint/svg_paint_context.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 395 | 2020-04-18T08:22:18.000Z | 2021-12-08T13:04:49.000Z | third_party/blink/renderer/core/paint/svg_paint_context.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 338 | 2020-04-18T08:03:10.000Z | 2022-03-29T12:33:22.000Z | /*
* Copyright (C) 2007, 2008 Rob Buis <buis@kde.org>
* Copyright (C) 2007 Nikolas Zimmermann <zimmermann@kde.org>
* Copyright (C) 2007 Eric Seidel <eric@webkit.org>
* Copyright (C) 2009 Google, Inc. All rights reserved.
* Copyright (C) 2009 Dirk Schulze <krit@webkit.org>
* Copyright (C) Research In Motion Limit... | 38.124138 | 82 | 0.72974 | [
"shape"
] |
e265638c714213253694a4714f540b26ff06d5e1 | 8,494 | cpp | C++ | core/es/graphics/image/png/PngFileDecoder.cpp | eaglesakura/protoground | 2cd7eaf93eaab9a34619b7ded91d3a2b89e9d5d6 | [
"MIT"
] | null | null | null | core/es/graphics/image/png/PngFileDecoder.cpp | eaglesakura/protoground | 2cd7eaf93eaab9a34619b7ded91d3a2b89e9d5d6 | [
"MIT"
] | 1 | 2016-10-25T02:09:00.000Z | 2016-11-10T02:07:59.000Z | core/es/graphics/image/png/PngFileDecoder.cpp | eaglesakura/protoground | 2cd7eaf93eaab9a34619b7ded91d3a2b89e9d5d6 | [
"MIT"
] | null | null | null | #include "PngFileDecoder.h"
#include <png.h>
#include "es/internal/protoground-internal.hpp"
#include "es/graphics/image/IImageDecodeCallback.hpp"
#include "es/math/Math.hpp"
namespace es {
PngFileDecoder::PngFileDecoder() {
}
PngFileDecoder::~PngFileDecoder() {
}
namespace internal {
struct ImageBufferReader {
... | 33.840637 | 142 | 0.615493 | [
"vector"
] |
e292f3e0ee00bdf7857f22c7287e2171c410d568 | 3,472 | cc | C++ | chrome/browser/ui/search/search_model_unittest.cc | metux/chromium-deb | 3c08e9b89a1b6f95f103a61ff4f528dbcd57fc42 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | chrome/browser/ui/search/search_model_unittest.cc | metux/chromium-deb | 3c08e9b89a1b6f95f103a61ff4f528dbcd57fc42 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | chrome/browser/ui/search/search_model_unittest.cc | metux/chromium-deb | 3c08e9b89a1b6f95f103a61ff4f528dbcd57fc42 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | // Copyright 2013 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 "chrome/browser/ui/search/search_model.h"
#include "base/command_line.h"
#include "base/macros.h"
#include "chrome/browser/ui/search/search_mode... | 32.148148 | 78 | 0.78197 | [
"model"
] |
e297724bf2dff5361f914f249b88cfbc4f7a780e | 1,706 | hpp | C++ | src/libs/ast/factory.hpp | jdmclark/gorc | a03d6a38ab7684860c418dd3d2e77cbe6a6d9fc8 | [
"Apache-2.0"
] | 97 | 2015-02-24T05:09:24.000Z | 2022-01-23T12:08:22.000Z | src/libs/ast/factory.hpp | annnoo/gorc | 1889b4de6380c30af6c58a8af60ecd9c816db91d | [
"Apache-2.0"
] | 8 | 2015-03-27T23:03:23.000Z | 2020-12-21T02:34:33.000Z | src/libs/ast/factory.hpp | annnoo/gorc | 1889b4de6380c30af6c58a8af60ecd9c816db91d | [
"Apache-2.0"
] | 10 | 2016-03-24T14:32:50.000Z | 2021-11-13T02:38:53.000Z | #pragma once
#include "node.hpp"
#include <memory>
#include <typeindex>
#include <unordered_map>
#include <vector>
namespace gorc {
class ast_factory {
private:
class factory_factory {
public:
virtual ~factory_factory();
};
template <typename NodeT>
class ... | 27.967213 | 94 | 0.552169 | [
"vector"
] |
e29a7bce3518a6f0754787a10ecbf481ca34cfc3 | 10,572 | cc | C++ | content/renderer/browser_plugin/browser_plugin_bindings.cc | tmpsantos/chromium | 802d4aeeb33af25c01ee5994037bbf14086d4ac0 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | content/renderer/browser_plugin/browser_plugin_bindings.cc | tmpsantos/chromium | 802d4aeeb33af25c01ee5994037bbf14086d4ac0 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | content/renderer/browser_plugin/browser_plugin_bindings.cc | tmpsantos/chromium | 802d4aeeb33af25c01ee5994037bbf14086d4ac0 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2020-11-04T07:23:37.000Z | 2020-11-04T07:23:37.000Z | // Copyright (c) 2012 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 "content/renderer/browser_plugin/browser_plugin_bindings.h"
#include <cstdlib>
#include <string>
#include "base/bind.h"
#include "base/mess... | 33.350158 | 80 | 0.687476 | [
"object"
] |
e2a0ca2531f7832ac8ea39fbe0d46d2bd8a294ba | 3,024 | cpp | C++ | Visual Studio 2010/Projects/bjarneStroustrupC++PartI/object_oriented_examples/Chapter9Exercise13.cpp | Ziezi/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | 9 | 2018-10-24T15:16:47.000Z | 2021-12-14T13:53:50.000Z | Visual Studio 2010/Projects/bjarneStroustrupC++PartI/object_oriented_examples/Chapter9Exercise13.cpp | ChrisBKirov/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | null | null | null | Visual Studio 2010/Projects/bjarneStroustrupC++PartI/object_oriented_examples/Chapter9Exercise13.cpp | ChrisBKirov/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | 7 | 2018-10-29T15:30:37.000Z | 2021-01-18T15:15:09.000Z | /*
TITLE Class Rational Chapter9Exercise13.cpp
Bjarne Stroustrup "Programming: Principles and Practice Using C++"
COMMENT
Objective: Implement a class Rational representing a rational number.
Data members: Member functions: Overloaded operators: Helper Function:
numerator... | 28.8 | 119 | 0.518849 | [
"object"
] |
e2acdf03f3c73cd0e669c7abc3eaac3f71ed37c2 | 1,127 | cpp | C++ | FGbTest.cpp | pichtj/groebner | 38e8fb8df9977ffa120ca21a35cac0b0ee3d5afe | [
"MIT"
] | 2 | 2019-09-05T15:32:33.000Z | 2021-07-25T08:32:00.000Z | FGbTest.cpp | pichtj/groebner | 38e8fb8df9977ffa120ca21a35cac0b0ee3d5afe | [
"MIT"
] | null | null | null | FGbTest.cpp | pichtj/groebner | 38e8fb8df9977ffa120ca21a35cac0b0ee3d5afe | [
"MIT"
] | 1 | 2018-02-20T16:34:55.000Z | 2018-02-20T16:34:55.000Z | #include <gtest/gtest.h>
#include <mpirxx.h>
#include "FGb.h"
#include "ImmutablePolynomial.h"
#include "CachedMonomial.h"
using namespace std;
TEST(FGbTest, FGb) {
use_abc_var_names in_this_scope;
FGbRunner<char, 4> runner;
typedef FGbRunner<char, 4>::P P;
typedef typename P::TermType T;
typedef typename... | 20.125 | 86 | 0.589175 | [
"vector"
] |
e2b57d12b1e4d5eb497a59b871e801a7e7a6f93a | 8,915 | cpp | C++ | rubis_ws/src/rubis_pkg/src/fake_object_generator.cpp | rubis-lab/Autoware_NDT | b12dbd0100b7323c773f3cb399344986145702a4 | [
"MIT"
] | 2 | 2021-07-12T06:44:37.000Z | 2021-07-20T07:50:33.000Z | rubis_ws/src/rubis_pkg/src/fake_object_generator.cpp | rubis-lab/Autoware_NDT | b12dbd0100b7323c773f3cb399344986145702a4 | [
"MIT"
] | null | null | null | rubis_ws/src/rubis_pkg/src/fake_object_generator.cpp | rubis-lab/Autoware_NDT | b12dbd0100b7323c773f3cb399344986145702a4 | [
"MIT"
] | 3 | 2021-07-12T06:38:00.000Z | 2022-03-21T07:27:17.000Z | #include <iostream>
#include <algorithm>
#include <ros/ros.h>
#include <ros/time.h>
#include <std_msgs/Header.h>
#include <geometry_msgs/Pose.h>
#include <geometry_msgs/Vector3.h>
#include <geometry_msgs/PolygonStamped.h>
#include <jsk_recognition_msgs/PolygonArray.h>
#include <geometry_msgs/Point32.h>
#include <autow... | 39.100877 | 183 | 0.670107 | [
"object",
"vector"
] |
e2b82b1c260cdd1befd79a621b3bc6489290c6ae | 12,905 | cpp | C++ | transx/c_codes/test.cpp | IsaacChanghau/AmusingPythonCodes | 013ecaaafe62696866b47b0910e1db00cca9ea37 | [
"MIT"
] | 26 | 2018-01-30T09:02:39.000Z | 2021-12-09T05:14:53.000Z | test.cpp | davidie/TensorFlow-TransX | 41302d7a68d4880c1634b81c19639c72d4e3c65e | [
"MIT"
] | 1 | 2019-12-28T04:09:45.000Z | 2019-12-28T04:09:45.000Z | test.cpp | davidie/TensorFlow-TransX | 41302d7a68d4880c1634b81c19639c72d4e3c65e | [
"MIT"
] | 26 | 2017-09-29T08:59:35.000Z | 2021-11-15T03:23:02.000Z | #include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
#include <vector>
#include <string>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <cstdlib>
using namespace std;
string inPath = "./wiki50k/";
extern "C"
void setInPath(char *path) {
int len = strlen(path);
inPath = "";... | 31.785714 | 201 | 0.559706 | [
"vector"
] |
e2c0adf33fb656fd12d15b113e08c98e78c83bc4 | 370 | cpp | C++ | leetcode/215. Kth Largest Element in an Array/s4.cpp | contacttoakhil/LeetCode-1 | 9bb9b5aa9ace836b86a752eb796b3dfcb21ee44c | [
"Fair"
] | 1 | 2021-02-09T11:38:51.000Z | 2021-02-09T11:38:51.000Z | leetcode/215. Kth Largest Element in an Array/s4.cpp | contacttoakhil/LeetCode-1 | 9bb9b5aa9ace836b86a752eb796b3dfcb21ee44c | [
"Fair"
] | null | null | null | leetcode/215. Kth Largest Element in an Array/s4.cpp | contacttoakhil/LeetCode-1 | 9bb9b5aa9ace836b86a752eb796b3dfcb21ee44c | [
"Fair"
] | null | null | null | // Author: github.com/lzl124631x
// Time: O(k + (N - k)logk)
// Space: O(k)
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
priority_queue<int, vector<int>, greater<int>> q;
for (int n : nums) {
if (q.size() < k) q.push(n);
else if (q.top() < n) {
q.pop();
q... | 21.764706 | 53 | 0.513514 | [
"vector"
] |
e2c704d36c3c1e17ace42519297d6a5a18456815 | 26,537 | hh | C++ | graph-tool-2.27/src/graph/graph_selectors.hh | Znigneering/CSCI-3154 | bc318efc73d2a80025b98f5b3e4f7e4819e952e4 | [
"MIT"
] | null | null | null | graph-tool-2.27/src/graph/graph_selectors.hh | Znigneering/CSCI-3154 | bc318efc73d2a80025b98f5b3e4f7e4819e952e4 | [
"MIT"
] | null | null | null | graph-tool-2.27/src/graph/graph_selectors.hh | Znigneering/CSCI-3154 | bc318efc73d2a80025b98f5b3e4f7e4819e952e4 | [
"MIT"
] | null | null | null | // graph-tool -- a general graph modification and manipulation thingy
//
// Copyright (C) 2006-2018 Tiago de Paula Peixoto <tiago@skewed.de>
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation;... | 34.508453 | 111 | 0.649734 | [
"vector",
"transform"
] |
e2c79f5494b07869238ddd9afbba460db2797093 | 3,309 | cpp | C++ | lib/cfganalyzer-2007-12-03/zchaff-src/cnf_stats.cpp | akiezun/hampi | de62cc822f927399ea0260be75185f723acf9839 | [
"MIT"
] | 1 | 2022-03-17T07:16:42.000Z | 2022-03-17T07:16:42.000Z | lib/cfganalyzer-2007-12-03/zchaff-src/cnf_stats.cpp | akiezun/hampi | de62cc822f927399ea0260be75185f723acf9839 | [
"MIT"
] | null | null | null | lib/cfganalyzer-2007-12-03/zchaff-src/cnf_stats.cpp | akiezun/hampi | de62cc822f927399ea0260be75185f723acf9839 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <set>
#include <vector>
#include <assert.h>
using namespace std;
const int MAX_WORD_LENGTH = 64;
const int MAX_LINE_LENGTH = 256000;
int main(int argc, char** argv) {
assert(argc == 2);
char * fi... | 29.283186 | 77 | 0.481414 | [
"vector"
] |
e2c990adcc200718cf2f06fd2c36df5a0250366a | 16,213 | cxx | C++ | xp_comm_proj/draw/sup_draw.cxx | avs/express-community | c699a68330d3b678b7e6bcea823e0891b874049c | [
"Apache-2.0"
] | 3 | 2020-08-03T08:52:20.000Z | 2021-04-10T11:55:49.000Z | xp_comm_proj/draw/sup_draw.cxx | avs/express-community | c699a68330d3b678b7e6bcea823e0891b874049c | [
"Apache-2.0"
] | null | null | null | xp_comm_proj/draw/sup_draw.cxx | avs/express-community | c699a68330d3b678b7e6bcea823e0891b874049c | [
"Apache-2.0"
] | 1 | 2021-06-08T18:16:45.000Z | 2021-06-08T18:16:45.000Z | //
// Super polyline editor for AVS/Express
//
// Provides more control and speed compared to Click Sketch.
//
// command:
// 0 no op
// 1 add point at the end of the polyline
// 2 add point between
// 3 move point
// 4 delete point
// 5 delete all points
// 6 translate the whole line
//
//
// Author: Mar... | 23.161429 | 132 | 0.599519 | [
"object",
"transform"
] |
e2d20ca1f4ae1c5477a0ffa5e2b33743944c1cba | 39,994 | cpp | C++ | MarkerFinderLib/MarkerFinderLib.cpp | hunsteve/RobotNavigation | 880b7b168a5267e740503011cef466216d7e5706 | [
"MIT"
] | 1 | 2017-09-13T23:04:23.000Z | 2017-09-13T23:04:23.000Z | MarkerFinderLib/MarkerFinderLib.cpp | hunsteve/RobotNavigation | 880b7b168a5267e740503011cef466216d7e5706 | [
"MIT"
] | null | null | null | MarkerFinderLib/MarkerFinderLib.cpp | hunsteve/RobotNavigation | 880b7b168a5267e740503011cef466216d7e5706 | [
"MIT"
] | null | null | null | // MarkerFinderLib.cpp : Defines the exported functions for the DLL application.
//
#include "MarkerFinderLib.h"
#include <list>
#include <queue>
#include <vector>
#include <math.h>
#include <iostream>
#include <fstream>
using namespace std;
MyShapeListElement *globalMarkerShapeList;
void create_im... | 23.637116 | 151 | 0.53348 | [
"shape",
"vector"
] |
e2dc38be420622e1138ecf313395d43cbd80eaf0 | 12,486 | cpp | C++ | ds2/qt_demonsaw/model/client/client_upload_model.cpp | demonsaw/Code | b036d455e9e034d7fd178e63d5e992242d62989a | [
"MIT"
] | 132 | 2017-03-22T03:46:38.000Z | 2022-03-08T15:08:16.000Z | ds2/qt_demonsaw/model/client/client_upload_model.cpp | demonsaw/Code | b036d455e9e034d7fd178e63d5e992242d62989a | [
"MIT"
] | 4 | 2017-04-06T17:46:10.000Z | 2018-08-08T18:27:59.000Z | ds2/qt_demonsaw/model/client/client_upload_model.cpp | demonsaw/Code | b036d455e9e034d7fd178e63d5e992242d62989a | [
"MIT"
] | 30 | 2017-03-26T22:38:17.000Z | 2021-11-21T20:50:17.000Z | //
// The MIT License(MIT)
//
// Copyright(c) 2014 Demonsaw LLC
//
// 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, c... | 24.339181 | 104 | 0.652971 | [
"model"
] |
e2dea264b3d220178434d9975a94f14c198542fe | 23,579 | cpp | C++ | SDDLViewerDlg.cpp | HiraokaHyperTools/SDDLViewer | 37def4b8cedf2d3398662dbcf9afe3929754a15e | [
"BSD-2-Clause"
] | 1 | 2021-06-25T09:58:02.000Z | 2021-06-25T09:58:02.000Z | SDDLViewerDlg.cpp | HiraokaHyperTools/SDDLViewer | 37def4b8cedf2d3398662dbcf9afe3929754a15e | [
"BSD-2-Clause"
] | null | null | null | SDDLViewerDlg.cpp | HiraokaHyperTools/SDDLViewer | 37def4b8cedf2d3398662dbcf9afe3929754a15e | [
"BSD-2-Clause"
] | null | null | null | // SDDLViewerDlg.cpp : implementation file
//
#include "Stdafx.h"
#include "SDDLViewer.h"
#include "SDDLViewerDlg.h"
#pragma comment(lib, "Version.lib")
#pragma comment(lib, "Aclui.lib")
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// CAboutDlg dialog used for App About
class CAboutDlg : public CDialog
{
public:
... | 30.307198 | 160 | 0.741083 | [
"model"
] |
e2e5ed899a5faf29533e9b3b526de7db1f2643ea | 2,865 | cpp | C++ | TAO/tests/Bug_1495_Regression/Server_Task.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 36 | 2015-01-10T07:27:33.000Z | 2022-03-07T03:32:08.000Z | TAO/tests/Bug_1495_Regression/Server_Task.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 2 | 2018-08-13T07:30:51.000Z | 2019-02-25T03:04:31.000Z | TAO/tests/Bug_1495_Regression/Server_Task.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 38 | 2015-01-08T14:12:06.000Z | 2022-01-19T08:33:00.000Z | /**
* @file Server_Task.cpp
* @author Will Otte <wotte@dre.vanderbilt.edu>
*
* $Id: Server_Task.cpp 84563 2009-02-23 08:13:54Z johnnyw $
*
* Implements the Server_Task class which acts as the process colocated
* corba server for Bug_1495_Regression test.
*/
#include "Server_Task.h"
#include "ace/OS_NS_unistd.h... | 25.353982 | 72 | 0.572775 | [
"object"
] |
e2efed27f77f0cc5ecc6976caddddd1321ede5ad | 1,607 | hpp | C++ | Viewer/ecflowUI/src/VLimiterAttr.hpp | mpartio/ecflow | ea4b89399d1e7b897ff48c59b1e885e6d53cc8d6 | [
"Apache-2.0"
] | 11 | 2020-08-07T14:42:45.000Z | 2021-10-21T01:59:59.000Z | Viewer/ecflowUI/src/VLimiterAttr.hpp | CoollRock/ecflow | db61dddc84d3d2c7dd6af95fd799d717c6bc2a6d | [
"Apache-2.0"
] | 10 | 2020-08-07T14:36:27.000Z | 2022-02-22T06:51:24.000Z | Viewer/ecflowUI/src/VLimiterAttr.hpp | CoollRock/ecflow | db61dddc84d3d2c7dd6af95fd799d717c6bc2a6d | [
"Apache-2.0"
] | 6 | 2020-08-07T14:34:38.000Z | 2022-01-10T12:06:27.000Z | //============================================================================
// Copyright 2017 ECMWF.
// This software is licensed under the terms of the Apache Licence version 2.0
// which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
// In applying this licence, ECMWF does not waive the privileges ... | 28.192982 | 79 | 0.670193 | [
"vector"
] |
e2f25ec9960e493c3afb5b422b66bf0cd3eecc0b | 32,720 | cpp | C++ | src/demo/PandoraPillarExperiment.cpp | KCL-Planning/strategic-tactical-pandora | aa609af26a59e756b25212fa57fa72be937766e7 | [
"BSD-2-Clause"
] | 2 | 2019-01-27T05:17:06.000Z | 2020-10-06T15:25:31.000Z | src/demo/PandoraPillarExperiment.cpp | KCL-Planning/strategic-tactical-pandora | aa609af26a59e756b25212fa57fa72be937766e7 | [
"BSD-2-Clause"
] | null | null | null | src/demo/PandoraPillarExperiment.cpp | KCL-Planning/strategic-tactical-pandora | aa609af26a59e756b25212fa57fa72be937766e7 | [
"BSD-2-Clause"
] | null | null | null | #include "PandoraPillarExperiment.h"
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <fstream>
#define _USE_MATH_DEFINES
#include <math.h>
#ifndef _WIN32
#include <ros/ros.h>
#endif
#include <glm/gtc/matrix_transform.hpp>
#include <GL/glew.h>
#include "../core/loaders/targa.h"
#i... | 41.734694 | 257 | 0.696608 | [
"render",
"object",
"vector",
"solid"
] |
e2fcb5b65b4206d13487bf9ef9394bcf13feb1c2 | 18,717 | cpp | C++ | GUI/mainwindow.cpp | beldmitr/i4004 | f090bc91acbf88be119d72a80301cdcf57a8c159 | [
"MIT"
] | 7 | 2017-04-07T01:17:26.000Z | 2021-11-02T06:08:45.000Z | GUI/mainwindow.cpp | beldmitr/i4004 | f090bc91acbf88be119d72a80301cdcf57a8c159 | [
"MIT"
] | null | null | null | GUI/mainwindow.cpp | beldmitr/i4004 | f090bc91acbf88be119d72a80301cdcf57a8c159 | [
"MIT"
] | 1 | 2018-12-13T10:47:08.000Z | 2018-12-13T10:47:08.000Z | #include "mainwindow.h"
void MainWindow::createActions()
{
// Actions File
actNew = std::shared_ptr<QAction>(new QAction(tr("&New"), this));
actNew->setIcon(QIcon(":/Resources/icons/new.png"));
actNew->setShortcut(QKeySequence::New);
connect(actNew.get(), &QAction::triggered, [=](){
this->e... | 34.854749 | 131 | 0.665064 | [
"vector"
] |
c3b3be5cd2adc4088e9ecd430f15c3160699246a | 5,697 | cpp | C++ | src/projects/geometry_shader_normal_viewer/src/main.cpp | computersarecool/opengl_examples | 658196529420dcdded5436ef4a118cb4a3bc9b2c | [
"MIT"
] | 8 | 2020-01-09T13:19:12.000Z | 2022-02-10T02:44:21.000Z | src/projects/geometry_shader_normal_viewer/src/main.cpp | computersarecool/opengl_examples | 658196529420dcdded5436ef4a118cb4a3bc9b2c | [
"MIT"
] | null | null | null | src/projects/geometry_shader_normal_viewer/src/main.cpp | computersarecool/opengl_examples | 658196529420dcdded5436ef4a118cb4a3bc9b2c | [
"MIT"
] | 1 | 2021-03-16T03:54:39.000Z | 2021-03-16T03:54:39.000Z | // This is a cube geometry shader which converts faces to lines to show normals
#include <memory>
#include <vector>
#include "glm/glm/gtc/matrix_transform.hpp"
#include "base_app.h"
#include "glsl_program.h"
#include "camera.h"
// Cube
const GLfloat cube_vertices[] {
// Positions // Normals
-0.5f, -0.5f, ... | 34.113772 | 218 | 0.654555 | [
"geometry",
"render",
"vector"
] |
c3b6658cc2c44cfaa361af6799e6e373019cb2a1 | 3,335 | hpp | C++ | include/MIPTPFrame.hpp | SaivNator/MIPTP_cpp | c830b875c47cad742f0e0ed07649e9322865b02e | [
"MIT"
] | 1 | 2018-07-29T17:53:50.000Z | 2018-07-29T17:53:50.000Z | include/MIPTPFrame.hpp | SaivNator/MIPTP_cpp | c830b875c47cad742f0e0ed07649e9322865b02e | [
"MIT"
] | null | null | null | include/MIPTPFrame.hpp | SaivNator/MIPTP_cpp | c830b875c47cad742f0e0ed07649e9322865b02e | [
"MIT"
] | null | null | null | //MIPTPFrame.hpp
//Author: Sivert Andresen Cubedo
#pragma once
#ifndef MIPTPFrame_HEADER
#define MIPTPFrame_HEADER
//C++
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <bitset>
//Local
#include "AddressT... | 14.191489 | 134 | 0.668066 | [
"vector"
] |
c3b685539a5be5df99c48e85dfa40e896288d3d3 | 1,800 | cpp | C++ | Train/Sheet/Sheet-B/base/40-60/41-50/43.Strategic Defense Initiative.cpp | mohamedGamalAbuGalala/Practice | 2a5fa3bdaf995d0c304f04231e1a69e6960f72c8 | [
"MIT"
] | 1 | 2019-12-19T06:51:20.000Z | 2019-12-19T06:51:20.000Z | Train/Sheet/Sheet-B/base/40-60/41-50/43.Strategic Defense Initiative.cpp | mohamedGamalAbuGalala/Practice | 2a5fa3bdaf995d0c304f04231e1a69e6960f72c8 | [
"MIT"
] | null | null | null | Train/Sheet/Sheet-B/base/40-60/41-50/43.Strategic Defense Initiative.cpp | mohamedGamalAbuGalala/Practice | 2a5fa3bdaf995d0c304f04231e1a69e6960f72c8 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
void file() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
}
/* Finds longest strictly increasing subsequence. O(n log k) algorithm. */
void find_lis(vector<int> &a, vector<int> &b) {
vector<int> p(a.size());
int u, v;
if (a.empty())
return;
b.push_... | 22.78481 | 94 | 0.551111 | [
"vector"
] |
c3b933fc38391b2a5915f9bed395f16a4e10eff4 | 539 | cpp | C++ | Source/Engine/ING/Source/ING/Scripting/Method/OuternalMethod/OuternalMethod.cpp | ING-Game-Devs/ing-engine | 7379e96433f47c005fb677cb303686e628d41bfe | [
"MIT"
] | 12 | 2022-01-17T13:25:03.000Z | 2022-03-19T08:53:56.000Z | Source/Engine/ING/Source/ING/Scripting/Method/OuternalMethod/OuternalMethod.cpp | ING-Game-Devs/ing | 829611b16a324d1ba0f8fbbd5fdc418e2b9d6aa4 | [
"MIT"
] | null | null | null | Source/Engine/ING/Source/ING/Scripting/Method/OuternalMethod/OuternalMethod.cpp | ING-Game-Devs/ing | 829611b16a324d1ba0f8fbbd5fdc418e2b9d6aa4 | [
"MIT"
] | 7 | 2022-01-21T03:50:09.000Z | 2022-03-25T14:30:29.000Z |
/**
* Include Header
*/
#include "OuternalMethod.h"
namespace ING {
namespace Scripting {
/**
* Constructors And Destructor
*/
IOuternalMethod::IOuternalMethod(IContext* context, IMethodContainer* container) :
IMethod(context, container)
{
}
IOuternalMethod::~IOuternalMethod()
{
}... | 9.625 | 84 | 0.604824 | [
"object"
] |
c3bd4d759c47828da9990c4d668d3e4f0589340e | 5,018 | cpp | C++ | keychain_win/secmodlib/src/SecureModuleWrapper.cpp | jokefor300/array-io-keychain | 1c281b76332af339f0456de51caf65cae9950c91 | [
"MIT"
] | 29 | 2018-03-21T09:21:18.000Z | 2020-09-22T16:31:03.000Z | keychain_win/secmodlib/src/SecureModuleWrapper.cpp | jokefor300/array-io-keychain | 1c281b76332af339f0456de51caf65cae9950c91 | [
"MIT"
] | 119 | 2018-03-16T14:02:04.000Z | 2019-04-16T21:16:32.000Z | keychain_win/secmodlib/src/SecureModuleWrapper.cpp | jokefor300/array-io-keychain | 1c281b76332af339f0456de51caf65cae9950c91 | [
"MIT"
] | 3 | 2018-03-21T15:00:16.000Z | 2019-12-25T09:03:58.000Z |
#include "SecureModuleWrapper.h"
#include "NamedPipeServer.h"
#include <keychain_lib/secmod_parser_cmd.hpp>
#include <sddl.h>
#include <algorithm>
#pragma comment(lib, "advapi32.lib")
namespace sm_cmd = keychain_app::secmod_commands;
SecurityManager _secman;
SecureModuleWrapper::~SecureModuleWrapper()
{
//TODO: n... | 30.228916 | 168 | 0.662615 | [
"vector"
] |
c3c1d4f52c057a755992b0e2dd0e92b910ad19e2 | 2,029 | cpp | C++ | problems/uva/uva988.cpp | phogbinh/cp | 41a86550e14571c8f54bbec9579060647e77209c | [
"MIT"
] | null | null | null | problems/uva/uva988.cpp | phogbinh/cp | 41a86550e14571c8f54bbec9579060647e77209c | [
"MIT"
] | null | null | null | problems/uva/uva988.cpp | phogbinh/cp | 41a86550e14571c8f54bbec9579060647e77209c | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
enum {UNVISITED = 0, VISITED};
#define LOCAL
#define MAX_V 100050
#define DUMP_INT 0
int V;
vector<vii> AL; // [A]djacency [L]ist
vi topoR; // [t]opological order [R]eversed
int visited[MAX_V];
... | 20.29 | 72 | 0.437161 | [
"vector"
] |
c3cdff46355cb57fc7756f3810de23636d521ee8 | 387 | cpp | C++ | samples/use_precompiled_headers/src/s0.cpp | Dylan95/dcg_build_system | 98febea3fdeef21be5847d5573032314d02ae843 | [
"MIT"
] | 1 | 2016-11-04T17:16:20.000Z | 2016-11-04T17:16:20.000Z | samples/use_precompiled_headers/src/s0.cpp | Dylan95/dcg_build_system | 98febea3fdeef21be5847d5573032314d02ae843 | [
"MIT"
] | null | null | null | samples/use_precompiled_headers/src/s0.cpp | Dylan95/dcg_build_system | 98febea3fdeef21be5847d5573032314d02ae843 | [
"MIT"
] | null | null | null | //a precompiled header that is meant to be used specifically for s0.cpp
#include "s0_pch.hpp"
//this was already included in the precompiled header.
//including it again won't cause any problem. the include gaurd will have already
//been defined, so including it again will have no effect whatsoever.
#include <vector>... | 22.764706 | 82 | 0.751938 | [
"vector"
] |
c3d03d27f58731549c14e9107eba2d61d92b416a | 8,543 | cc | C++ | osp/impl/quic/quic_connection_factory_impl.cc | gtalis/openscreen | 9b28b9695df98d310c2271eaa65d20cc6d224203 | [
"BSD-3-Clause"
] | 1 | 2020-09-22T05:59:36.000Z | 2020-09-22T05:59:36.000Z | osp/impl/quic/quic_connection_factory_impl.cc | gtalis/openscreen | 9b28b9695df98d310c2271eaa65d20cc6d224203 | [
"BSD-3-Clause"
] | null | null | null | osp/impl/quic/quic_connection_factory_impl.cc | gtalis/openscreen | 9b28b9695df98d310c2271eaa65d20cc6d224203 | [
"BSD-3-Clause"
] | 1 | 2022-02-03T11:05:44.000Z | 2022-02-03T11:05:44.000Z | // Copyright 2018 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 "osp/impl/quic/quic_connection_factory_impl.h"
#include <algorithm>
#include <memory>
#include "osp/impl/quic/quic_connection_impl.h"
#include ... | 39.009132 | 97 | 0.692614 | [
"vector"
] |
c3d4f7d8ac2c3a817e85c9ba31fb334dca9c1aa6 | 1,225 | cpp | C++ | tests/test_mpi.cpp | kingang1986/purine2 | e53447da173e83fb62bae8cf50bde17f75723203 | [
"BSD-2-Clause"
] | 312 | 2015-03-16T15:29:38.000Z | 2021-09-16T22:48:41.000Z | tests/test_mpi.cpp | zuiwufenghua/purine2 | e53447da173e83fb62bae8cf50bde17f75723203 | [
"BSD-2-Clause"
] | 19 | 2015-03-17T16:20:19.000Z | 2015-10-03T03:34:09.000Z | tests/test_mpi.cpp | zuiwufenghua/purine2 | e53447da173e83fb62bae8cf50bde17f75723203 | [
"BSD-2-Clause"
] | 108 | 2015-03-16T07:07:30.000Z | 2021-08-22T07:32:13.000Z | // Copyright Lin Min 2014
#include "catch/catch.hpp"
#include <vector>
#include "operations/include/random.hpp"
#include "operations/operation.hpp"
#include "operations/include/mpi.hpp"
#include "dispatch/op_template.hpp"
#include "dispatch/graph_template.hpp"
#include "dispatch/runnable.hpp"
#include "dispatch/blob.hp... | 28.488372 | 67 | 0.582857 | [
"vector"
] |
c3d5f1258b20ddc16d83a19f34466b9d3729c7fc | 3,175 | hh | C++ | Original Geant4 code/include/ExN03DetectorConstruction.hh | ArtistMonkey83/MEGALib_SSGX | b1493cef112c06621322a5d2d21eb504bd9ef8e1 | [
"Apache-2.0"
] | null | null | null | Original Geant4 code/include/ExN03DetectorConstruction.hh | ArtistMonkey83/MEGALib_SSGX | b1493cef112c06621322a5d2d21eb504bd9ef8e1 | [
"Apache-2.0"
] | null | null | null | Original Geant4 code/include/ExN03DetectorConstruction.hh | ArtistMonkey83/MEGALib_SSGX | b1493cef112c06621322a5d2d21eb504bd9ef8e1 | [
"Apache-2.0"
] | 1 | 2018-04-09T00:10:04.000Z | 2018-04-09T00:10:04.000Z | // This code implementation is the intellectual property of
// the GEANT4 collaboration.
//
// By copying, distributing or modifying the Program (or any work
// based on the Program) you indicate your acceptance of this statement,
// and all its terms.
//
// $Id: ExN03DetectorConstruction.hh,v 1.1.10.1 1999/12/07 20:47... | 29.12844 | 80 | 0.672126 | [
"solid"
] |
c3d725481f7e55bb0670f58a56796e08e51729b7 | 173 | cpp | C++ | rotate_array.cpp | spencercjh/sync-leetcode-today-problem-cpp-example | 178a974e5848e3a620f4565170b459d50ecfdd6b | [
"Apache-2.0"
] | null | null | null | rotate_array.cpp | spencercjh/sync-leetcode-today-problem-cpp-example | 178a974e5848e3a620f4565170b459d50ecfdd6b | [
"Apache-2.0"
] | 1 | 2020-12-17T07:54:03.000Z | 2020-12-17T08:00:22.000Z | rotate_array.cpp | spencercjh/sync-leetcode-today-problem-cpp-example | 178a974e5848e3a620f4565170b459d50ecfdd6b | [
"Apache-2.0"
] | null | null | null | /**
* https://leetcode-cn.com/problems/rotate-array/
*
* @author spencercjh
*/
class RotateArray {
public:
void rotate(vector<int>& nums, int k) {
}
}
| 13.307692 | 49 | 0.589595 | [
"vector"
] |
c3d80f3a32d15d5d92492365fe48693dffeb4caa | 1,359 | cc | C++ | Tools/GenCC.cc | zhmz90/Lan | d7bb1b38ecb5a082276efaafdadca8d9700fbc27 | [
"MIT"
] | null | null | null | Tools/GenCC.cc | zhmz90/Lan | d7bb1b38ecb5a082276efaafdadca8d9700fbc27 | [
"MIT"
] | null | null | null | Tools/GenCC.cc | zhmz90/Lan | d7bb1b38ecb5a082276efaafdadca8d9700fbc27 | [
"MIT"
] | null | null | null | // copyright 2017 Lanting Guo
/** GenCC is to be used to generate a cc file which will be consistent
with google-cpp-style guide.
*/
#include <ctime>
#include <iostream>
#include <string>
#include <fstream>
using string = std::string;
string getYear() {
time_t t = time(0);
struct tm now;
localtime_r(&t, ... | 18.364865 | 70 | 0.607064 | [
"vector"
] |
c3daa4724b8e7664ce9ea1eb1e1df558db3c6f3b | 2,612 | hpp | C++ | ThirdParty-mod/java2cpp/android/hardware/SensorListener.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 | [
"MIT"
] | 1 | 2019-04-03T01:53:28.000Z | 2019-04-03T01:53:28.000Z | ThirdParty-mod/java2cpp/android/hardware/SensorListener.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 | [
"MIT"
] | null | null | null | ThirdParty-mod/java2cpp/android/hardware/SensorListener.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 | [
"MIT"
] | null | null | null | /*================================================================================
code generated by: java2cpp
author: Zoran Angelov, mailto://baldzar@gmail.com
class: android.hardware.SensorListener
================================================================================*/
#ifndef J2CPP_INCLUDE_... | 26.653061 | 105 | 0.705972 | [
"object"
] |
c3e3cc70e10a3897004ecf294eafd603ce9e32fd | 1,231 | cc | C++ | 2021/d4s1.cc | danielrayali/adventofcode | 29bfd54013a4ba832b7c846d2770eb03692d67de | [
"MIT"
] | null | null | null | 2021/d4s1.cc | danielrayali/adventofcode | 29bfd54013a4ba832b7c846d2770eb03692d67de | [
"MIT"
] | null | null | null | 2021/d4s1.cc | danielrayali/adventofcode | 29bfd54013a4ba832b7c846d2770eb03692d67de | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include <vector>
using namespace std;
vector<string> Split(string& input) {
vector<string> values;
ssize_t prev = 0, cur = 0;
for (int i = 0; i < 5; ++i) {
cur = input.find_first_of(' ', prev);
if (cur != std::string::npos) {
values.push_... | 23.226415 | 62 | 0.502031 | [
"vector"
] |
c3ec9dc6e9cf0cf05758aac78c9cd6c420511727 | 1,008 | cpp | C++ | aws-cpp-sdk-appflow/source/model/DescribeConnectorResult.cpp | truthiswill/aws-sdk-cpp | 6e854b6a8bc7945f150c3a11551196bda341962a | [
"Apache-2.0"
] | 1 | 2022-02-12T08:09:30.000Z | 2022-02-12T08:09:30.000Z | aws-cpp-sdk-appflow/source/model/DescribeConnectorResult.cpp | truthiswill/aws-sdk-cpp | 6e854b6a8bc7945f150c3a11551196bda341962a | [
"Apache-2.0"
] | 1 | 2021-10-14T16:57:00.000Z | 2021-10-18T10:47:24.000Z | aws-cpp-sdk-appflow/source/model/DescribeConnectorResult.cpp | truthiswill/aws-sdk-cpp | 6e854b6a8bc7945f150c3a11551196bda341962a | [
"Apache-2.0"
] | 1 | 2021-11-09T11:58:03.000Z | 2021-11-09T11:58:03.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/appflow/model/DescribeConnectorResult.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <aws/core/AmazonWebServiceResult.h>
#include <aws/core/utils/StringUtils.h>
#include <aw... | 24.585366 | 114 | 0.77381 | [
"model"
] |
c3fb1b352b3e95546ac4e7daec395409d3ca25ae | 2,450 | cpp | C++ | main.cpp | MattiaSarti/neural-network-in-cpp | 4839ccbb68dea6068fc92c29e24ead0a236b5133 | [
"MIT"
] | null | null | null | main.cpp | MattiaSarti/neural-network-in-cpp | 4839ccbb68dea6068fc92c29e24ead0a236b5133 | [
"MIT"
] | null | null | null | main.cpp | MattiaSarti/neural-network-in-cpp | 4839ccbb68dea6068fc92c29e24ead0a236b5133 | [
"MIT"
] | null | null | null | /*
Script loading the training and validation sets from the file system,
training the model on the training set and evaluating it before and after
training on the validation set, saving results to the file system.
*/
#include "common.hpp"
#include "load_dataset.hpp"
#include "model.hpp"
// architecture hyperpara... | 33.561644 | 80 | 0.657959 | [
"vector",
"model"
] |
c3fe5487aa72d1de75d93a30b6409f20de2631a5 | 1,067 | cc | C++ | src/base/util/ranges/functional_unittest.cc | huanyifan/naiveproxy | f7691d7020a7f0c2de4e25e363f8766dfc46466f | [
"BSD-3-Clause"
] | null | null | null | src/base/util/ranges/functional_unittest.cc | huanyifan/naiveproxy | f7691d7020a7f0c2de4e25e363f8766dfc46466f | [
"BSD-3-Clause"
] | null | null | null | src/base/util/ranges/functional_unittest.cc | huanyifan/naiveproxy | f7691d7020a7f0c2de4e25e363f8766dfc46466f | [
"BSD-3-Clause"
] | null | null | null | // Copyright 2020 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/util/ranges/functional.h"
#include <vector>
#include "testing/gtest/include/gtest/gtest.h"
namespace util {
TEST(RangesTest, Identity) ... | 20.132075 | 73 | 0.656982 | [
"vector"
] |
7f067d639ce0820ed7344601cbc2258c7053f329 | 6,238 | hpp | C++ | boost/range_run_storage/algorithm/first_last.hpp | ericniebler/time_series | 4040119366cc21f25c7734bb355e4a647296a96d | [
"BSL-1.0"
] | 11 | 2015-02-21T11:23:44.000Z | 2021-08-15T03:39:29.000Z | boost/range_run_storage/algorithm/first_last.hpp | ericniebler/time_series | 4040119366cc21f25c7734bb355e4a647296a96d | [
"BSL-1.0"
] | null | null | null | boost/range_run_storage/algorithm/first_last.hpp | ericniebler/time_series | 4040119366cc21f25c7734bb355e4a647296a96d | [
"BSL-1.0"
] | 3 | 2015-05-09T02:25:42.000Z | 2019-11-02T13:39:29.000Z | ///////////////////////////////////////////////////////////////////////////////
/// \file first_last.hpp
/// Returns the first and last runs and values from an \c InfiniteRangeRunStorage
//
// Copyright 2006 Eric Niebler. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// L... | 35.850575 | 95 | 0.606925 | [
"model"
] |
7f0ec676398a500465efe245339bc871ce4852a3 | 2,737 | cpp | C++ | android/apps/framePlayer/src/main/cpp/PlayerWindow.cpp | Darlingnotin/Antisocial_VR | f1debafb784ed5a63a40fe9b80790fbaccfedfce | [
"Apache-2.0"
] | 272 | 2021-01-07T03:06:08.000Z | 2022-03-25T03:54:07.000Z | android/apps/framePlayer/src/main/cpp/PlayerWindow.cpp | Darlingnotin/Antisocial_VR | f1debafb784ed5a63a40fe9b80790fbaccfedfce | [
"Apache-2.0"
] | 1,021 | 2020-12-12T02:33:32.000Z | 2022-03-31T23:36:37.000Z | android/apps/framePlayer/src/main/cpp/PlayerWindow.cpp | Darlingnotin/Antisocial_VR | f1debafb784ed5a63a40fe9b80790fbaccfedfce | [
"Apache-2.0"
] | 77 | 2020-12-15T06:59:34.000Z | 2022-03-23T22:18:04.000Z | //
// Created by Bradley Austin Davis on 2018/10/21
// Copyright 2014 High Fidelity, Inc.
//
// Distributed under the Apache License, Version 2.0.
// See the accompanying file LICENSE or http://www.apache.org/licenses/LICENSE-2.0.html
//
#include "PlayerWindow.h"
#include <QtCore/QFileInfo>
#include <QtGui/QImage... | 29.75 | 112 | 0.659116 | [
"3d"
] |
7f122fdd80b8849a944369210cb26762c4996e9f | 32,983 | cpp | C++ | coast/foundation/base/cuteTest/AnythingConstructorsTest.cpp | zer0infinity/CuteForCoast | 37d933c5fe2e0ce9a801f51b2aa27c7a18098511 | [
"BSD-3-Clause"
] | null | null | null | coast/foundation/base/cuteTest/AnythingConstructorsTest.cpp | zer0infinity/CuteForCoast | 37d933c5fe2e0ce9a801f51b2aa27c7a18098511 | [
"BSD-3-Clause"
] | null | null | null | coast/foundation/base/cuteTest/AnythingConstructorsTest.cpp | zer0infinity/CuteForCoast | 37d933c5fe2e0ce9a801f51b2aa27c7a18098511 | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (c) 2005, Peter Sommerlad and IFS Institute for Software at HSR Rapperswil, Switzerland
* Copyright (c) 2015, David Tran, Faculty of Computer Science,
* University of Applied Sciences Rapperswil (HSR),
* 8640 Rapperswil, Switzerland
* All rights reserved.
*
* This library/application is free softw... | 38.531542 | 176 | 0.70694 | [
"object"
] |
7f14a48e5c08487ef58ff6c73ef0286712057826 | 4,659 | cpp | C++ | include/cinolib/geometry/segment.cpp | bbrrck/cinolib | c7cceefd041646e1e1113339e681e212a9bba7e7 | [
"MIT"
] | 1 | 2019-06-22T00:23:45.000Z | 2019-06-22T00:23:45.000Z | include/cinolib/geometry/segment.cpp | snowfox1939/cinolib | 6017d9dd7461e7008df8198563d63526db3ed86a | [
"MIT"
] | null | null | null | include/cinolib/geometry/segment.cpp | snowfox1939/cinolib | 6017d9dd7461e7008df8198563d63526db3ed86a | [
"MIT"
] | null | null | null | /********************************************************************************
* This file is part of CinoLib *
* Copyright(C) 2016: Marco Livesu *
* ... | 35.030075 | 83 | 0.451599 | [
"geometry",
"vector"
] |
7f17df71b65a3eb7ef12f5cc902a158d799b339e | 1,140 | cpp | C++ | May2016/highways.cpp | AadityaJ/Spoj | 61664c1925ef5bb072a3fe78fb3dac4fb68d77a1 | [
"MIT"
] | null | null | null | May2016/highways.cpp | AadityaJ/Spoj | 61664c1925ef5bb072a3fe78fb3dac4fb68d77a1 | [
"MIT"
] | null | null | null | May2016/highways.cpp | AadityaJ/Spoj | 61664c1925ef5bb072a3fe78fb3dac4fb68d77a1 | [
"MIT"
] | null | null | null | //http://www.spoj.com/problems/HIGHWAYS/
#include <cstdio>
#include <queue>
using namespace std;
struct edge {
int v;
int w;
};
bool operator <( edge a, edge b ) {
return a.w < b.w;
}
#define INF 10000000
int dist[ 1000001 ];
void dijkstra( vector< edge > graph[], int N, int S, int T ) {
int i;
for ( i = 0; i <= N... | 19.655172 | 62 | 0.463158 | [
"vector"
] |
7f19ba322c5c1657004c3d3cfade3e8540d44c4f | 6,301 | cpp | C++ | src/CurvatureJetFit.cpp | Yusheng-cai/InstantaneousInterface | 42ec7c825c6424f0339b2443077bb3505819cde6 | [
"MIT"
] | null | null | null | src/CurvatureJetFit.cpp | Yusheng-cai/InstantaneousInterface | 42ec7c825c6424f0339b2443077bb3505819cde6 | [
"MIT"
] | null | null | null | src/CurvatureJetFit.cpp | Yusheng-cai/InstantaneousInterface | 42ec7c825c6424f0339b2443077bb3505819cde6 | [
"MIT"
] | null | null | null | #include "CurvatureJetFit.h"
namespace CurvatureRegistry
{
registry<CurvatureJetFit> registerJet("jetfit");
}
CurvatureJetFit::CurvatureJetFit(CurvatureInput& input)
:Curvature(input)
{
foundnumneighrs_ = input.pack.ReadNumber("neighbors", ParameterPack::KeyType::Optional, numneighbors_);
input.pack.ReadN... | 31.039409 | 160 | 0.556102 | [
"mesh",
"vector"
] |
7f1a218c7d539607d308d4e06af4b35d82fca601 | 1,346 | cpp | C++ | C++/problems/0181_maximum_distance_closest_person.cpp | raulhsant/algorithms | 1578a0dc0a34d63c74c28dd87b0873e0b725a0bd | [
"MIT"
] | 6 | 2019-03-20T22:23:26.000Z | 2020-08-28T03:10:27.000Z | C++/problems/0181_maximum_distance_closest_person.cpp | raulhsant/algorithms | 1578a0dc0a34d63c74c28dd87b0873e0b725a0bd | [
"MIT"
] | 15 | 2019-10-13T20:53:53.000Z | 2022-03-31T02:01:35.000Z | C++/problems/0181_maximum_distance_closest_person.cpp | raulhsant/algorithms | 1578a0dc0a34d63c74c28dd87b0873e0b725a0bd | [
"MIT"
] | 3 | 2019-03-11T10:57:46.000Z | 2020-02-26T21:13:21.000Z | // Problem Statement
// You are given an array representing a row of seats where seats[i] = 1
// represents a person sitting in the ith seat, and seats[i] = 0 represents that the ith seat is empty (0-indexed).
// There is at least one empty seat, and at least one person sitting.
// Alex wants to sit in the seat such... | 26.392157 | 115 | 0.557207 | [
"vector"
] |
7f1d4a83409d1dce08d6be0f46e672a82564ce53 | 2,428 | cpp | C++ | src/MandelApp.cpp | mhhollomon/mandel | 9c5658b5b5433d80474e13930a69cedf3574e802 | [
"MIT"
] | null | null | null | src/MandelApp.cpp | mhhollomon/mandel | 9c5658b5b5433d80474e13930a69cedf3574e802 | [
"MIT"
] | null | null | null | src/MandelApp.cpp | mhhollomon/mandel | 9c5658b5b5433d80474e13930a69cedf3574e802 | [
"MIT"
] | null | null | null | #include "MandelWin.hpp"
#include "MandelApp.hpp"
#include <gtkmm.h>
MandelApp::MandelApp(int& argc, char**& argv,
const Glib::ustring& application_id,
Gio::ApplicationFlags flags)
: Gtk::Application(application_id, flags),
clopts_{parse_commandline(argc, argv)}
{
Glib::set_application_name... | 26.681319 | 85 | 0.613262 | [
"object",
"vector"
] |
7f20904c5386f13857990873f4fb5df3339f8bad | 4,344 | cpp | C++ | libs/graph_parallel/test/distributed_async_bfs_test.cpp | thejkane/AGM | 4d5cfe9522461d207ceaef7d90c1cd10ce9b469c | [
"BSL-1.0"
] | 1 | 2021-09-03T10:22:04.000Z | 2021-09-03T10:22:04.000Z | libs/graph_parallel/test/distributed_async_bfs_test.cpp | thejkane/AGM | 4d5cfe9522461d207ceaef7d90c1cd10ce9b469c | [
"BSL-1.0"
] | null | null | null | libs/graph_parallel/test/distributed_async_bfs_test.cpp | thejkane/AGM | 4d5cfe9522461d207ceaef7d90c1cd10ce9b469c | [
"BSL-1.0"
] | null | null | null | // Copyright (C) 2011-2012 The Trustees of Indiana University.
// Use, modification and distribution is subject to 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)
// Authors: Nick Edmonds
// Simple asyncrhonous BFS implementation... | 32.661654 | 108 | 0.707643 | [
"vector"
] |
7f213b32747176698592b89f29f43af5deb73af9 | 952 | cpp | C++ | test/source/test_low_discr_seq_n.cpp | luk036/lds-cpp | d48f7c7b2848dd7dfa523b1da81a48801670717c | [
"Unlicense"
] | null | null | null | test/source/test_low_discr_seq_n.cpp | luk036/lds-cpp | d48f7c7b2848dd7dfa523b1da81a48801670717c | [
"Unlicense"
] | null | null | null | test/source/test_low_discr_seq_n.cpp | luk036/lds-cpp | d48f7c7b2848dd7dfa523b1da81a48801670717c | [
"Unlicense"
] | null | null | null | #include <doctest/doctest.h> // for Approx, ResultBuilder, TestCase
#include <gsl/span> // for span
#include <lds/low_discr_seq_n.hpp> // for cylin_n, halton_n, sphere3, sphere_n
#include <vector> // for vector
TEST_CASE("sphere3") {
unsigned base[] = {2, 3, 5, 7};
auto sp3... | 28 | 79 | 0.581933 | [
"vector"
] |
7f23ee5d6d84335ad36da8fef4b5498ed843f80a | 25,075 | cpp | C++ | metaCode/LUTCode2/Source.cpp | chenjiunfeng/openMaelstrom | 6dc6ffe3501f056eb83d1d6306d2ac5ec754c192 | [
"MIT"
] | 45 | 2019-11-07T13:51:50.000Z | 2022-02-11T01:51:14.000Z | metaCode/LUTCode2/Source.cpp | chenjiunfeng/openMaelstrom | 6dc6ffe3501f056eb83d1d6306d2ac5ec754c192 | [
"MIT"
] | 2 | 2020-03-06T20:25:02.000Z | 2021-02-07T21:45:39.000Z | metaCode/LUTCode2/Source.cpp | chenjiunfeng/openMaelstrom | 6dc6ffe3501f056eb83d1d6306d2ac5ec754c192 | [
"MIT"
] | 10 | 2019-08-22T09:11:23.000Z | 2022-02-07T07:04:55.000Z | #include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <tuple>
#include <utility/include_all.h>
#include <utility/iterator.h>
#include <utility/math.h>
#include <utility/unit_math.h>
#include <vector>
auto generateHexGrid(float h, float r, bool center = true, float scale = 1.0f) {
... | 39.426101 | 213 | 0.601157 | [
"vector"
] |
7f27ed12ce94017531315d9cd9d5a1d009186a30 | 85,138 | cpp | C++ | src/DumpNAL.cpp | MMT-TLVassociation/DumpTS | c884656196b29790064bb09ad455a6f7470431a8 | [
"MIT"
] | 1 | 2021-12-22T05:25:56.000Z | 2021-12-22T05:25:56.000Z | src/DumpNAL.cpp | MMT-TLVassociation/DumpTS | c884656196b29790064bb09ad455a6f7470431a8 | [
"MIT"
] | null | null | null | src/DumpNAL.cpp | MMT-TLVassociation/DumpTS | c884656196b29790064bb09ad455a6f7470431a8 | [
"MIT"
] | 1 | 2022-02-08T01:18:29.000Z | 2022-02-08T01:18:29.000Z | /*
MIT License
Copyright (c) 2021 Ravin.Wang(wangf1978@hotmail.com)
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, mod... | 36.936226 | 247 | 0.720019 | [
"object",
"vector"
] |
b52b1d42418b8f1b6e7988c6d492780c1ab5e533 | 2,440 | hh | C++ | src/structured-interface/input_state.hh | project-arcana/structured-interface | 56054310e08a3ae98f8065a90b454e23a36d60d9 | [
"MIT"
] | 1 | 2020-12-09T13:55:07.000Z | 2020-12-09T13:55:07.000Z | src/structured-interface/input_state.hh | project-arcana/structured-interface | 56054310e08a3ae98f8065a90b454e23a36d60d9 | [
"MIT"
] | 1 | 2019-09-29T09:02:03.000Z | 2019-09-29T09:02:03.000Z | src/structured-interface/input_state.hh | project-arcana/structured-interface | 56054310e08a3ae98f8065a90b454e23a36d60d9 | [
"MIT"
] | null | null | null | #pragma once
#include <clean-core/vector.hh>
#include <typed-geometry/tg-lean.hh>
#include <structured-interface/handles.hh>
namespace si
{
/// a helper struct that contains the input state of an element_tree
/// used for answering user-space queries such as "is_hovered" or "was_clicked"
/// (without querying into ... | 40 | 120 | 0.729098 | [
"geometry",
"vector"
] |
b52bf4fd8c5faf00f9b23114a80633e8ec71385d | 2,114 | cpp | C++ | database.cpp | guilhermota/Projeto_Robotica | 9a7e30332dd161b50e5b352f10c7319865ac5f7e | [
"MIT"
] | null | null | null | database.cpp | guilhermota/Projeto_Robotica | 9a7e30332dd161b50e5b352f10c7319865ac5f7e | [
"MIT"
] | null | null | null | database.cpp | guilhermota/Projeto_Robotica | 9a7e30332dd161b50e5b352f10c7319865ac5f7e | [
"MIT"
] | null | null | null | #include "database.h"
/**
* @brief database::database
* Abre conexão com o banco de dados
*/
database::database(QString hostname, QString dbname, QString username, QString password)
{
QSqlDatabase db = QSqlDatabase::addDatabase("QMYSQL");
db.setHostName(hostname);
db.setPort(3307);
db.setDatabaseNam... | 26.425 | 119 | 0.620624 | [
"vector"
] |
b5303e04729687253a0088c61bae0e17b2928a83 | 1,064 | cpp | C++ | Leetcode/Hashing/make-two-arrays-equal-by-reversing-sub-arrays.cpp | susantabiswas/competitive_coding | 49163ecdc81b68f5c1bd90988cc0dfac34ad5a31 | [
"MIT"
] | 2 | 2021-04-29T14:44:17.000Z | 2021-10-01T17:33:22.000Z | Leetcode/Hashing/make-two-arrays-equal-by-reversing-sub-arrays.cpp | adibyte95/competitive_coding | a6f084d71644606c21840875bad78d99f678a89d | [
"MIT"
] | null | null | null | Leetcode/Hashing/make-two-arrays-equal-by-reversing-sub-arrays.cpp | adibyte95/competitive_coding | a6f084d71644606c21840875bad78d99f678a89d | [
"MIT"
] | 1 | 2021-10-01T17:33:29.000Z | 2021-10-01T17:33:29.000Z | /*
https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/
Since reversal can be done any number of times, so in base case if we have 2 elements,
we can reverse them. So we only need to ensure that both are having same element frequency,
since in worst case we can always rever... | 30.4 | 96 | 0.548872 | [
"vector"
] |
b5331bb509dffc83ee05d0747c8da6f0eff88940 | 10,865 | hpp | C++ | include/AudioEngine.hpp | Dinahmoe/dm-audioengine | c6b4712ee889e5e15125f86d73bfaad7f6d73088 | [
"BSD-3-Clause"
] | null | null | null | include/AudioEngine.hpp | Dinahmoe/dm-audioengine | c6b4712ee889e5e15125f86d73bfaad7f6d73088 | [
"BSD-3-Clause"
] | null | null | null | include/AudioEngine.hpp | Dinahmoe/dm-audioengine | c6b4712ee889e5e15125f86d73bfaad7f6d73088 | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (c) 2015, Dinahmoe. 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... | 34.492063 | 161 | 0.71468 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.