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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5a164e16ee45920f15896b25587d36628b2362a5 | 877 | cpp | C++ | Gates/LogicalGates/XorGate.cpp | clement-gresh/M1-portes_logiques | e034219ac1377602e33aaf1341dd79721bd67317 | [
"MIT"
] | null | null | null | Gates/LogicalGates/XorGate.cpp | clement-gresh/M1-portes_logiques | e034219ac1377602e33aaf1341dd79721bd67317 | [
"MIT"
] | null | null | null | Gates/LogicalGates/XorGate.cpp | clement-gresh/M1-portes_logiques | e034219ac1377602e33aaf1341dd79721bd67317 | [
"MIT"
] | null | null | null | #include "XorGate.hpp"
// CONSTRUCTORS
// private
XorGate::XorGate() : LogicalGate{ std::vector<Gate*>{} } {}
//public
XorGate::XorGate(Gate* const a, Gate* const b) : LogicalGate{ {a, b} } {}
XorGate::XorGate(const XorGate& clone) : XorGate{ clone.getGates().at(0), clone.getGates().at(1) } {}
XorGate::XorGate(const ... | 33.730769 | 103 | 0.663626 | [
"vector"
] |
5a1765d752946e470ca80ce9067567248ff935ce | 2,765 | cpp | C++ | leetcode/binary_tree/balanced_binary_tree.cpp | chachaxw/data-structure-and-algorithm | 343a72f9bd4d78aa69305bf5c58f4aab74979705 | [
"MIT"
] | 91 | 2018-11-21T15:29:56.000Z | 2022-01-29T12:24:56.000Z | leetcode/binary_tree/balanced_binary_tree.cpp | chachaxw/data-structure-and-algorithm | 343a72f9bd4d78aa69305bf5c58f4aab74979705 | [
"MIT"
] | null | null | null | leetcode/binary_tree/balanced_binary_tree.cpp | chachaxw/data-structure-and-algorithm | 343a72f9bd4d78aa69305bf5c58f4aab74979705 | [
"MIT"
] | 22 | 2018-12-08T01:51:59.000Z | 2021-03-15T10:07:37.000Z | /**
* @Author: Chacha
* @Date: 2019-01-03 17:07:54
* @Last Modified by: Chacha
* @Last Modified time: 2021-03-30 15:47:16
*/
#include <iostream>
#include <vector>
using namespace std;
/**
* 题目：
* 给定一个二叉树，判断它是否是高度平衡的二叉树
*
* 平衡二叉树的定义：一个二叉树每个节点的左右两个子树的高度差的绝对值不超过1。
*
* 来源: https://leetcode-cn.com/problems/bala... | 20.036232 | 123 | 0.55226 | [
"vector"
] |
5a2228a51dbee3ba98c7e349862fae2f91a79416 | 828 | cpp | C++ | viterbi_decoder_712/main.cpp | Andrew-Montgomery/viterbi_decoder_712 | 09200c98fab5eda84460abfc11127982dc9042fb | [
"MIT"
] | 1 | 2022-03-03T20:24:55.000Z | 2022-03-03T20:24:55.000Z | viterbi_decoder_712/main.cpp | Andrew-Montgomery/viterbi_decoder_712 | 09200c98fab5eda84460abfc11127982dc9042fb | [
"MIT"
] | null | null | null | viterbi_decoder_712/main.cpp | Andrew-Montgomery/viterbi_decoder_712 | 09200c98fab5eda84460abfc11127982dc9042fb | [
"MIT"
] | null | null | null | #include <iostream>
#include <random>
#include "src/viterbi_decoder_712.h"
int main()
{
BitVector input, encoded, decoded;
// Create encoder and decoder. Match puncture patterns.
ConvolutionalEncoder712 encoder;
encoder.SetPuncturePattern(PuncturePattern712_56);
ViterbiDecoder712H decoder;
d... | 23 | 59 | 0.664251 | [
"vector"
] |
5a3414a2614aaafa4d69df5f5abe19cd539ed3ad | 1,221 | cpp | C++ | 1094.cpp | ispobock/PAT_code | 1426a80ff4a8b0ddba97d9014e10b50a9cff16d6 | [
"MIT"
] | 1 | 2020-08-29T03:49:57.000Z | 2020-08-29T03:49:57.000Z | 1094.cpp | ispobock/PAT_code | 1426a80ff4a8b0ddba97d9014e10b50a9cff16d6 | [
"MIT"
] | null | null | null | 1094.cpp | ispobock/PAT_code | 1426a80ff4a8b0ddba97d9014e10b50a9cff16d6 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int n, m;
struct node{
int generation;
vector<int> child;
}Node[105];
int generation[105];
int highest = 0;
void BFS(int root){
queue<int> q;
q.push(root);
while(!q.empty()){
int top = q.front();
q.pop();
... | 22.2 | 75 | 0.486486 | [
"vector"
] |
5a35aacf2ef14663bb159d1f5c86180c4f372ca5 | 5,520 | cpp | C++ | docs/api/4.1/api/axoverlay/example/opengles_objectloader/loaders.cpp | mattias-kindborg-at-work/acap-documentation | 2826b4c493a1813827fc116beebce21dd06bfbd0 | [
"FSFAP"
] | 4 | 2021-09-30T10:03:16.000Z | 2021-11-17T13:58:08.000Z | docs/api/4.1/api/axoverlay/example/opengles_objectloader/loaders.cpp | mattias-kindborg-at-work/acap-documentation | 2826b4c493a1813827fc116beebce21dd06bfbd0 | [
"FSFAP"
] | 16 | 2021-11-17T09:30:19.000Z | 2022-03-30T15:22:51.000Z | docs/api/4.1/api/axoverlay/example/opengles_objectloader/loaders.cpp | mattias-kindborg-at-work/acap-documentation | 2826b4c493a1813827fc116beebce21dd06bfbd0 | [
"FSFAP"
] | 2 | 2021-11-17T09:09:06.000Z | 2022-02-28T12:56:35.000Z | /*
* Copyright (c) 2018 Axis Communications AB.
*/
#include <stdio.h>
#include <string>
#include <cmath>
#include <stdlib.h>
#include <libgen.h>
#include "loaders.h"
#define TINYOBJLOADER_IMPLEMENTATION
#include <tiny_obj_loader.h>
#include <syslog.h>
#include "gl_example_errors.h"
#include <glm/gtx/normal.hpp>
... | 27.738693 | 129 | 0.595471 | [
"mesh",
"shape",
"vector"
] |
5a3d216a68b6611bcab0f2248554546f6d204ab7 | 4,818 | cpp | C++ | CppP4rhSln/16/overcomp.cpp | blacop/CppPR | a76574ee83000d898d989aab96eac4ac746244fa | [
"MIT"
] | 1 | 2017-04-01T06:57:30.000Z | 2017-04-01T06:57:30.000Z | gnu_files/16/overcomp.cc | hongmi/cpp-primer-4-exercises | 98ddb98b41d457a1caa525d246dfb7453be0c8d2 | [
"MIT"
] | null | null | null | gnu_files/16/overcomp.cc | hongmi/cpp-primer-4-exercises | 98ddb98b41d457a1caa525d246dfb7453be0c8d2 | [
"MIT"
] | null | null | null | /*
* This file contains code from "C++ Primer, Fourth Edition", by Stanley B.
* Lippman, Jose Lajoie, and Barbara E. Moo, and is covered under the
* copyright and warranty notices given in that book:
*
* "Copyright (c) 2005 by Objectwrite, Inc., Jose Lajoie, and Barbara E. Moo."
*
*
* "The authors and publis... | 29.558282 | 79 | 0.684101 | [
"vector"
] |
5a3e5b5885e3869890aaa16b3b191f7885a06c25 | 10,185 | cpp | C++ | tensorflow_graphics/projects/point_convolutions/custom_ops/tfg_custom_ops/sampling/cc/ops/sampling_ops.cpp | schellmi42/graphics | 2e705622c2a6b0007347d2db154ccdf5a0eb73d4 | [
"Apache-2.0"
] | 3 | 2020-07-10T12:07:02.000Z | 2022-03-21T09:28:55.000Z | custom_ops/tfg_custom_ops/sampling/cc/ops/sampling_ops.cpp | schellmi42/tensorflow_graphics_point_clouds | c8e2dc2963c3eecfb27542449603f81d78494783 | [
"Apache-2.0"
] | null | null | null | custom_ops/tfg_custom_ops/sampling/cc/ops/sampling_ops.cpp | schellmi42/tensorflow_graphics_point_clouds | c8e2dc2963c3eecfb27542449603f81d78494783 | [
"Apache-2.0"
] | 1 | 2021-10-11T08:27:44.000Z | 2021-10-11T08:27:44.000Z | /////////////////////////////////////////////////////////////////////////////
/// Copyright 2020 Google LLC
///
/// Licensed under the Apache License, Version 2.0 (the "License");
/// you may not use this file except in compliance with the License.
/// You may obtain a copy of the License at
///
/// https://www.apac... | 49.926471 | 123 | 0.580265 | [
"shape"
] |
5a3e8f5bcd053ad9f07507ea2a12e90cb57836f3 | 1,227 | hpp | C++ | bofrak.hpp | supudo/bofrak | 0a94a2cffea24bf84193fd6ba039cff0cc17b7fb | [
"Unlicense"
] | null | null | null | bofrak.hpp | supudo/bofrak | 0a94a2cffea24bf84193fd6ba039cff0cc17b7fb | [
"Unlicense"
] | null | null | null | bofrak.hpp | supudo/bofrak | 0a94a2cffea24bf84193fd6ba039cff0cc17b7fb | [
"Unlicense"
] | null | null | null | #ifndef Bofrak_hpp
#define Bofrak_hpp
#include <thread>
#include <glm/glm.hpp>
#include "utilities/gl/glincludes.hpp"
#include "utilities/input/controls.hpp"
#include "settings/settings.hpp"
#include "objects/camera.hpp"
#include "ui/uimanager.hpp"
#include "objects/fractal.hpp"
class Bofrak {
public:
Bofrak();
~B... | 22.309091 | 64 | 0.727791 | [
"3d"
] |
5a44d9b3edce364c1f09dbafcf228478197dc996 | 11,732 | hpp | C++ | pennylane_lightning_gpu/src/simulator/StateVectorCudaBase.hpp | PennyLaneAI/pennylane-lightning-gpu | 1b2a361f68c8580457e61cc706d644c4cbfe04ad | [
"Apache-2.0"
] | 9 | 2022-03-14T15:18:08.000Z | 2022-03-30T03:05:36.000Z | pennylane_lightning_gpu/src/simulator/StateVectorCudaBase.hpp | PennyLaneAI/pennylane-lightning-gpu | 1b2a361f68c8580457e61cc706d644c4cbfe04ad | [
"Apache-2.0"
] | 6 | 2022-03-18T13:44:10.000Z | 2022-03-31T22:07:25.000Z | pennylane_lightning_gpu/src/simulator/StateVectorCudaBase.hpp | PennyLaneAI/pennylane-lightning-gpu | 1b2a361f68c8580457e61cc706d644c4cbfe04ad | [
"Apache-2.0"
] | null | null | null | // Copyright 2022 Xanadu Quantum Technologies Inc.
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law o... | 36.098462 | 80 | 0.568701 | [
"object",
"vector"
] |
5a4f306f2e9be3fd9e1e261b6c3c47b605b6b303 | 18,360 | cpp | C++ | source/guise/font.cpp | jimmiebergmann/Guise | b6b16de961f4299e2384980db11a0a811f01eaf4 | [
"MIT"
] | 1 | 2020-09-06T10:35:58.000Z | 2020-09-06T10:35:58.000Z | source/guise/font.cpp | jimmiebergmann/Guise | b6b16de961f4299e2384980db11a0a811f01eaf4 | [
"MIT"
] | null | null | null | source/guise/font.cpp | jimmiebergmann/Guise | b6b16de961f4299e2384980db11a0a811f01eaf4 | [
"MIT"
] | null | null | null | /*
* MIT License
*
* Copyright (c) 2019 Jimmie Bergmann
*
* 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, m... | 30.347107 | 188 | 0.527015 | [
"render",
"vector"
] |
9900d235fe22596f1e7a4e5753e19f3c23b8c404 | 21,683 | cpp | C++ | Embarcadero/OpenGL/MD2 ray picking/Main.cpp | Jeanmilost/Demos | 2b71f6edc85948540660d290183530fd846262ad | [
"MIT"
] | 1 | 2022-03-22T14:41:15.000Z | 2022-03-22T14:41:15.000Z | Embarcadero/OpenGL/MD2 ray picking/Main.cpp | Jeanmilost/Demos | 2b71f6edc85948540660d290183530fd846262ad | [
"MIT"
] | null | null | null | Embarcadero/OpenGL/MD2 ray picking/Main.cpp | Jeanmilost/Demos | 2b71f6edc85948540660d290183530fd846262ad | [
"MIT"
] | null | null | null | /******************************************************************************
* ==> Main ------------------------------------------------------------------*
******************************************************************************
* Description : MD2 demo main form *
... | 37.320138 | 100 | 0.569248 | [
"mesh",
"model",
"transform",
"3d"
] |
990a0769ffb1c701aba96bf2c74344ee9bcab961 | 93,755 | cpp | C++ | inetsrv/iis/svcs/smtp/aqueue/cat/src/ccatrecip.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | inetsrv/iis/svcs/smtp/aqueue/cat/src/ccatrecip.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | inetsrv/iis/svcs/smtp/aqueue/cat/src/ccatrecip.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | //+------------------------------------------------------------
//
// Copyright (C) 1998, Microsoft Corporation
//
// File: ccatrecip.cpp
//
// Contents: Implementation of classes:
//
// Classes:
// CIMsgRecipListAddr
// CCatRecip
//
// Functions:
// CIMsgRecipListAddr::CIMsgRecipListAddr
// CIMsg... | 28.264998 | 129 | 0.544024 | [
"object"
] |
99118ac9b1152659576efe40ad791ed406ba0829 | 4,577 | cpp | C++ | Engine/ac/roomobject.cpp | proteanblank/ags | 025640c60dbf77d84d213d3994ebcc6600979476 | [
"Artistic-2.0"
] | null | null | null | Engine/ac/roomobject.cpp | proteanblank/ags | 025640c60dbf77d84d213d3994ebcc6600979476 | [
"Artistic-2.0"
] | null | null | null | Engine/ac/roomobject.cpp | proteanblank/ags | 025640c60dbf77d84d213d3994ebcc6600979476 | [
"Artistic-2.0"
] | null | null | null | //=============================================================================
//
// Adventure Game Studio (AGS)
//
// Copyright (C) 1999-2011 Chris Jones and 2011-20xx others
// The full list of copyright holders can be found in the Copyright.txt
// file, which is part of this source code distribution.
//
// The AGS ... | 27.572289 | 110 | 0.614813 | [
"object",
"vector"
] |
9912a9b4bb694f220a363321b77d95abdf098636 | 979 | cpp | C++ | Graph/allpathfromsourcetotarget.cpp | thisisnitish/cp-dsa- | 9ae94930b65f8dc293d088e9148960939b9f6fa4 | [
"MIT"
] | null | null | null | Graph/allpathfromsourcetotarget.cpp | thisisnitish/cp-dsa- | 9ae94930b65f8dc293d088e9148960939b9f6fa4 | [
"MIT"
] | null | null | null | Graph/allpathfromsourcetotarget.cpp | thisisnitish/cp-dsa- | 9ae94930b65f8dc293d088e9148960939b9f6fa4 | [
"MIT"
] | null | null | null | /*
Leetcode Question 797. All Paths From Source to Target
https://leetcode.com/problems/all-paths-from-source-to-target/
*/
class Solution
{
public:
// Time: O(2^n), Space: O(n)
vector<vector<int> > result;
vector<vector<int> > allPathsSourceTarget(vector<vector<int> > &graph)
{
int source = 0;... | 23.309524 | 82 | 0.539326 | [
"vector"
] |
99208c1c41bc99d9239c9c6bbfd2a85e30c38559 | 881 | cpp | C++ | main.cpp | beckylum0216/testMNIST | 366574af2a8213e890eaa20576f4579ffea04584 | [
"MIT"
] | null | null | null | main.cpp | beckylum0216/testMNIST | 366574af2a8213e890eaa20576f4579ffea04584 | [
"MIT"
] | null | null | null | main.cpp | beckylum0216/testMNIST | 366574af2a8213e890eaa20576f4579ffea04584 | [
"MIT"
] | null | null | null | #include <iostream>
#include <opencv2/core/core.hpp>
#include <opencv2/highgui/highgui.hpp>
#include "UtilityFunctions.h"
void DisplayImage()
{
std::string imgFile = "../mnist/train-images.idx3-ubyte";
std::string lblFile = "../mnist/train-labels.idx1-ubyte";
ImageHeader imgHdr;
LabelHeader lblHdr;
... | 20.022727 | 61 | 0.639047 | [
"vector"
] |
99272d7b51f05f1c23750323861214008d0369f6 | 270 | cpp | C++ | cpp/main.cpp | dacozai/algorithm-diary | 8ed5e119e4450e92e63276047ef19bbf422c2770 | [
"MIT"
] | 1 | 2019-10-17T08:34:55.000Z | 2019-10-17T08:34:55.000Z | cpp/main.cpp | dacozai/algorithm-diary | 8ed5e119e4450e92e63276047ef19bbf422c2770 | [
"MIT"
] | 1 | 2020-05-24T08:32:13.000Z | 2020-05-24T08:32:13.000Z | cpp/main.cpp | dacozai/algorithm-diary | 8ed5e119e4450e92e63276047ef19bbf422c2770 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdlib>
#include "select.h"
#include <vector>
int main (int argc, char *argv[]) {
int question_number = atoi(argv[argc-1]);
run(question_number);
std::cout << "Congratulations, you pass the examination!" << std::endl;
return 0;
} | 24.545455 | 74 | 0.681481 | [
"vector"
] |
99360c2ded4fbe6c1b92b8a0141a2ce6d7f95d52 | 1,171 | cpp | C++ | tree/postorder(ilterative)IMP.cpp | ishan0805/gfg_must_do | 10af0a6d37d0ac338c7bd235e7aa6190abc9d750 | [
"MIT"
] | null | null | null | tree/postorder(ilterative)IMP.cpp | ishan0805/gfg_must_do | 10af0a6d37d0ac338c7bd235e7aa6190abc9d750 | [
"MIT"
] | null | null | null | tree/postorder(ilterative)IMP.cpp | ishan0805/gfg_must_do | 10af0a6d37d0ac338c7bd235e7aa6190abc9d750 | [
"MIT"
] | null | null | null | class Solution
{
public:
vector<int> postOrder(Node *root)
{
stack<Node *> st;
vector<int> ans;
while (root != NULL || (!st.empty()))
{
while (root != nullptr)
{
st.push(root);
root = root->left;
}
r... | 26.613636 | 85 | 0.353544 | [
"vector"
] |
993b3ebad5b0186adbe18a8467b74170b3a0108a | 1,889 | cpp | C++ | UVa Online Judge/v1/154.cpp | mjenrungrot/algorithm | e0e8174eb133ba20931c2c7f5c67732e4cb2b703 | [
"MIT"
] | 1 | 2021-12-08T08:58:43.000Z | 2021-12-08T08:58:43.000Z | UVa Online Judge/v1/154.cpp | mjenrungrot/algorithm | e0e8174eb133ba20931c2c7f5c67732e4cb2b703 | [
"MIT"
] | null | null | null | UVa Online Judge/v1/154.cpp | mjenrungrot/algorithm | e0e8174eb133ba20931c2c7f5c67732e4cb2b703 | [
"MIT"
] | null | null | null | /*=============================================================================
# Author: Teerapat Jenrungrot - https://github.com/mjenrungrot/
# FileName: 154.cpp
# Description: UVa Online Judge - 154
=============================================================================*/
#include <cstdi... | 29.515625 | 79 | 0.404976 | [
"vector"
] |
993c06b548875ee4e973ac9ed4901a8d38d3f15e | 804 | hpp | C++ | include/pieces/queen.hpp | Creris/chess | e668ae29697df6a4674d9be3c8f57d9b965030a4 | [
"MIT"
] | null | null | null | include/pieces/queen.hpp | Creris/chess | e668ae29697df6a4674d9be3c8f57d9b965030a4 | [
"MIT"
] | 7 | 2019-05-28T21:53:11.000Z | 2019-06-06T23:48:44.000Z | include/pieces/queen.hpp | Creris/chess | e668ae29697df6a4674d9be3c8f57d9b965030a4 | [
"MIT"
] | null | null | null | #pragma once
#ifndef PIECE_QUEEN_HEADER_H_
#define PIECE_QUEEN_HEADER_H_
/*
This file contains:
- Definition of PieceQueen which derives from a generic piece.
*/
#include "generic.hpp"
class PieceQueen : public PieceGeneric {
public:
PieceQueen(Color c) : PieceGeneric(c) {}
~PieceQueen() = default;
PieceQueen... | 27.724138 | 102 | 0.7699 | [
"vector"
] |
993da4d4f714320c12db7c88057850817c1dd893 | 16,130 | cpp | C++ | GP/PPieces.cpp | wsu-cb/cbwindows | 55d3797ed0c639b36fe3f677777fcc31e3449360 | [
"MIT"
] | 4 | 2020-06-22T16:59:51.000Z | 2020-06-28T19:35:23.000Z | GP/PPieces.cpp | wsu-cb/cbwindows | 55d3797ed0c639b36fe3f677777fcc31e3449360 | [
"MIT"
] | 59 | 2020-09-12T23:54:16.000Z | 2022-03-24T18:51:43.000Z | GP/PPieces.cpp | wsu-cb/cbwindows | 55d3797ed0c639b36fe3f677777fcc31e3449360 | [
"MIT"
] | 4 | 2020-06-22T13:37:40.000Z | 2021-01-29T12:42:54.000Z | // PPieces.cpp
//
// Copyright (c) 1994-2020 By Dale L. Larson, All Rights Reserved.
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation... | 28.701068 | 104 | 0.577309 | [
"render",
"vector"
] |
9947a50c69ee901f7c7bbfddbc708d3d2d84be76 | 1,262 | cpp | C++ | CODECHEF/codechef345.cpp | IUC4801/HactoberFest21 | ad52dee669deba54630584435b77a6ab07dc67b2 | [
"Unlicense"
] | 1 | 2021-10-04T14:39:02.000Z | 2021-10-04T14:39:02.000Z | CODECHEF/codechef345.cpp | IUC4801/HactoberFest21 | ad52dee669deba54630584435b77a6ab07dc67b2 | [
"Unlicense"
] | 1 | 2021-10-06T04:41:55.000Z | 2021-10-06T04:41:55.000Z | CODECHEF/codechef345.cpp | IUC4801/HactoberFest21 | ad52dee669deba54630584435b77a6ab07dc67b2 | [
"Unlicense"
] | 1 | 2021-10-08T12:31:04.000Z | 2021-10-08T12:31:04.000Z | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 13.145833 | 35 | 0.542789 | [
"vector"
] |
994a963fb5c94941e7f3b6405cb386b92944203e | 10,046 | cpp | C++ | src/pool/PoolSwitcher.cpp | DavHau/Riner | f9e9815b713572f03497f0e4e66c3f82a0241b66 | [
"MIT"
] | 4 | 2019-07-24T03:24:08.000Z | 2022-03-04T07:41:08.000Z | src/pool/PoolSwitcher.cpp | DavHau/Riner | f9e9815b713572f03497f0e4e66c3f82a0241b66 | [
"MIT"
] | 3 | 2019-07-30T22:10:39.000Z | 2020-06-15T15:57:08.000Z | src/pool/PoolSwitcher.cpp | DavHau/Riner | f9e9815b713572f03497f0e4e66c3f82a0241b66 | [
"MIT"
] | 6 | 2019-07-30T21:33:07.000Z | 2022-03-21T20:53:11.000Z | //
//
#include "PoolSwitcher.h"
#include "WorkQueue.h"
#include <src/common/Assert.h>
#include <src/algorithm/Algorithm.h>
namespace riner {
PoolSwitcher::PoolSwitcher(std::string powType, clock::duration checkInterval, clock::duration durUntilDeclaredDead)
: Pool(PoolConstructionArgs{})
... | 40.672065 | 163 | 0.536631 | [
"vector"
] |
994b87ce34a608165b56b8fc91d8821b46b3c00a | 2,370 | hpp | C++ | libs/core/include/fcppt/math/matrix/vector.hpp | freundlich/fcppt | 17df1b1ad08bf2435f6902d5465e3bc3fe5e3022 | [
"BSL-1.0"
] | 13 | 2015-02-21T18:35:14.000Z | 2019-12-29T14:08:29.000Z | libs/core/include/fcppt/math/matrix/vector.hpp | cpreh/fcppt | 17df1b1ad08bf2435f6902d5465e3bc3fe5e3022 | [
"BSL-1.0"
] | 5 | 2016-08-27T07:35:47.000Z | 2019-04-21T10:55:34.000Z | libs/core/include/fcppt/math/matrix/vector.hpp | freundlich/fcppt | 17df1b1ad08bf2435f6902d5465e3bc3fe5e3022 | [
"BSL-1.0"
] | 8 | 2015-01-10T09:22:37.000Z | 2019-12-01T08:31:12.000Z | // Copyright Carl Philipp Reh 2009 - 2021.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef FCPPT_MATH_MATRIX_VECTOR_HPP_INCLUDED
#define FCPPT_MATH_MATRIX_VECTOR_HPP_INCLUDED
#inclu... | 33.380282 | 89 | 0.687342 | [
"object",
"vector"
] |
995a5083ff2aae93c608d7c95ddacb708237c2db | 1,325 | cc | C++ | src/catkin_ws/src/failsafe_nodelets/initialisation/src/initialisation.cc | JakobThumm/safe_rl_manipulators | 1724aee2ec4cbbd8fecfbf1653991e182d4ca48b | [
"MIT"
] | null | null | null | src/catkin_ws/src/failsafe_nodelets/initialisation/src/initialisation.cc | JakobThumm/safe_rl_manipulators | 1724aee2ec4cbbd8fecfbf1653991e182d4ca48b | [
"MIT"
] | null | null | null | src/catkin_ws/src/failsafe_nodelets/initialisation/src/initialisation.cc | JakobThumm/safe_rl_manipulators | 1724aee2ec4cbbd8fecfbf1653991e182d4ca48b | [
"MIT"
] | null | null | null | // -*- lsst-c++ -*/
/**
* @file initialisation.cc
* @brief Main function for sending the init signal to online verification.
* @version 0.1
* @copyright MIT License. Please see package.xml for further detail.
*/
#include <string>
#include <chrono>
#include <thread>
#include <ros/ros.h>
#include <std_msgs/Empty.h... | 30.113636 | 112 | 0.720755 | [
"object"
] |
995ae4ccba10577ed769b13d39eed595c50d0847 | 2,448 | cpp | C++ | c++/day_17/day_17.cpp | gbroll/AoC-2021 | 862d89b3f3eeed732d4bfd2854cb805327445345 | [
"MIT"
] | 1 | 2022-01-07T09:38:15.000Z | 2022-01-07T09:38:15.000Z | c++/day_17/day_17.cpp | gbroll/AoC-2021 | 862d89b3f3eeed732d4bfd2854cb805327445345 | [
"MIT"
] | null | null | null | c++/day_17/day_17.cpp | gbroll/AoC-2021 | 862d89b3f3eeed732d4bfd2854cb805327445345 | [
"MIT"
] | null | null | null | #include <regex>
#include <math.h>
#include "../utils/file_reader.cpp"
#include "../utils/result_printer.cpp"
struct area
{
int xmin,xmax,ymin,ymax;
};
area parse(vector<string> str_data)
{
area target;
string regex_str = "x=(-?[0-9]+)..(-?[0-9]+), y=(-?[0-9]+)..(-?[0-9]+)$";
regex regex_obj(regex_st... | 22.878505 | 93 | 0.496732 | [
"vector"
] |
995fab6cbe6c08654a6ad9ef8fb27528da36a236 | 7,247 | cpp | C++ | src/org/apache/poi/util/HexRead.cpp | pebble2015/cpoi | 6dcc0c5e13e3e722b4ef9fd0baffbf62bf71ead6 | [
"Apache-2.0"
] | null | null | null | src/org/apache/poi/util/HexRead.cpp | pebble2015/cpoi | 6dcc0c5e13e3e722b4ef9fd0baffbf62bf71ead6 | [
"Apache-2.0"
] | null | null | null | src/org/apache/poi/util/HexRead.cpp | pebble2015/cpoi | 6dcc0c5e13e3e722b4ef9fd0baffbf62bf71ead6 | [
"Apache-2.0"
] | null | null | null | // Generated from /POI/java/org/apache/poi/util/HexRead.java
#include <org/apache/poi/util/HexRead.hpp>
#include <java/io/ByteArrayInputStream.hpp>
#include <java/io/File.hpp>
#include <java/io/FileInputStream.hpp>
#include <java/io/IOException.hpp>
#include <java/io/InputStream.hpp>
#include <java/io/Serializable.hpp... | 31.92511 | 172 | 0.57817 | [
"object"
] |
99610d5dac7fc1e782cc2823d7c808e005bf6f14 | 806 | hpp | C++ | module/src/torrent_status.hpp | JoyStream/libtorrent-node | 95966c620a8b41f491db77b2ba4dd89ed13f480f | [
"MIT"
] | 1 | 2018-07-04T07:45:06.000Z | 2018-07-04T07:45:06.000Z | module/src/torrent_status.hpp | JoystreamClassic/libtorrent-node | 95966c620a8b41f491db77b2ba4dd89ed13f480f | [
"MIT"
] | 1 | 2017-11-28T08:58:12.000Z | 2017-11-28T08:58:12.000Z | module/src/torrent_status.hpp | JoystreamClassic/libtorrent-node | 95966c620a8b41f491db77b2ba4dd89ed13f480f | [
"MIT"
] | 3 | 2017-11-10T14:50:45.000Z | 2018-08-24T07:41:02.000Z | /**
* Copyright (C) JoyStream - All Rights Reserved
* Unauthorized copying of this file, via any medium is strictly prohibited
* Proprietary and confidential
* Written by Bedeho Mender <bedeho.mender@gmail.com>, Januar 16 2017
*/
#ifndef LIBTORRENT_NODE_TORRENT_STATUS_HPP
#define LIBTORRENT_NODE_TORRENT_STATUS_HP... | 21.210526 | 75 | 0.709677 | [
"object"
] |
9966d6987788e70044172bce5acec6eb26c8c0db | 546 | hpp | C++ | wrtstat/aggregator/api/types.hpp | mambaru/wrtstat | d97bf5376c14181974d6eb4632053710bb75cca8 | [
"MIT"
] | 1 | 2018-03-16T21:21:23.000Z | 2018-03-16T21:21:23.000Z | wrtstat/aggregator/api/types.hpp | mambaru/wrtstat | d97bf5376c14181974d6eb4632053710bb75cca8 | [
"MIT"
] | 10 | 2019-12-04T20:44:19.000Z | 2021-04-20T21:51:50.000Z | wrtstat/aggregator/api/types.hpp | mambaru/wrtstat | d97bf5376c14181974d6eb4632053710bb75cca8 | [
"MIT"
] | null | null | null | #pragma once
#include <cstddef>
#include <vector>
#include <memory>
#include <ctime>
namespace wrtstat {
typedef std::size_t size_type;
typedef std::time_t time_type;
typedef std::time_t value_type;
typedef std::size_t id_t;
typedef std::vector<value_type> data_type;
typedef std::unique_ptr<data_type> data_ptr;
cons... | 18.827586 | 46 | 0.741758 | [
"vector"
] |
996801fff2057bd68a13c540cac61aae306e97c9 | 8,780 | hpp | C++ | gtracr/lib/include/uTrajectoryTracer.hpp | kwat0308/gtracr | c7a4967f8e127daa732fd6515b61f13a4fb2b900 | [
"BSD-3-Clause"
] | 3 | 2020-08-30T19:47:26.000Z | 2022-03-15T01:52:58.000Z | gtracr/lib/include/uTrajectoryTracer.hpp | kwat0308/gtracr | c7a4967f8e127daa732fd6515b61f13a4fb2b900 | [
"BSD-3-Clause"
] | 3 | 2020-09-02T00:05:05.000Z | 2021-02-04T22:16:39.000Z | gtracr/lib/include/uTrajectoryTracer.hpp | kwat0308/gtracr | c7a4967f8e127daa732fd6515b61f13a4fb2b900 | [
"BSD-3-Clause"
] | null | null | null | // header file for Runge Kutta Integrator
#ifndef __UTRAJECTORYTRACER_HPP_
#define __UTRAJECTORYTRACER_HPP_
#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#include "MagneticField.hpp"
#include "const... | 39.022222 | 83 | 0.692141 | [
"object",
"vector",
"model"
] |
996aea2245afee3bef1ec88361a7605daa421847 | 64,704 | cxx | C++ | panda/src/physx/physxActor.cxx | kestred/panda3d | 16bfd3750f726a8831771b81649d18d087917fd5 | [
"PHP-3.01",
"PHP-3.0"
] | 3 | 2018-03-09T12:07:29.000Z | 2021-02-25T06:50:25.000Z | panda/src/physx/physxActor.cxx | Sinkay/panda3d | 16bfd3750f726a8831771b81649d18d087917fd5 | [
"PHP-3.01",
"PHP-3.0"
] | null | null | null | panda/src/physx/physxActor.cxx | Sinkay/panda3d | 16bfd3750f726a8831771b81649d18d087917fd5 | [
"PHP-3.01",
"PHP-3.0"
] | null | null | null | // Filename: physxActor.cxx
// Created by: enn0x (14Sep09)
//
////////////////////////////////////////////////////////////////////
//
// PANDA 3D SOFTWARE
// Copyright (c) Carnegie Mellon University. All rights reserved.
//
// All use of this software is subject to the terms of the revised BSD
// license. You should... | 37.186207 | 133 | 0.526923 | [
"object",
"shape",
"transform",
"3d"
] |
5f5a1f9226e707c1437e09c01cb7398f020dda35 | 10,711 | cpp | C++ | Tudat/Mathematics/GeometricShapes/sphereSegment.cpp | JPelamatti/ThesisTUDAT | b94ce35fb7c8fa44ae83238e296a979dfa3adfe8 | [
"BSD-3-Clause"
] | null | null | null | Tudat/Mathematics/GeometricShapes/sphereSegment.cpp | JPelamatti/ThesisTUDAT | b94ce35fb7c8fa44ae83238e296a979dfa3adfe8 | [
"BSD-3-Clause"
] | null | null | null | Tudat/Mathematics/GeometricShapes/sphereSegment.cpp | JPelamatti/ThesisTUDAT | b94ce35fb7c8fa44ae83238e296a979dfa3adfe8 | [
"BSD-3-Clause"
] | 1 | 2019-05-30T03:42:22.000Z | 2019-05-30T03:42:22.000Z | /* Copyright (c) 2010-2015, Delft University of Technology
* 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 ... | 38.949091 | 100 | 0.624592 | [
"geometry",
"vector"
] |
5f64b79456e20b6ead43249c6749f217945605b0 | 6,527 | cpp | C++ | NeuralCells/Mouth.cpp | CrishNate/NeuralCells | b55c8396a73cadfbf0b02192c07a62cdc752a399 | [
"MIT"
] | null | null | null | NeuralCells/Mouth.cpp | CrishNate/NeuralCells | b55c8396a73cadfbf0b02192c07a62cdc752a399 | [
"MIT"
] | null | null | null | NeuralCells/Mouth.cpp | CrishNate/NeuralCells | b55c8396a73cadfbf0b02192c07a62cdc752a399 | [
"MIT"
] | null | null | null | #include "Mouth.h"
#include "Plant.h"
#include "CellCreature.h"
#include "World.h"
void Mouth::Draw(RGBColor color, float angle, const Camera& camera)
{
angle += m_AngleOffset - M_PI / 2;
if (m_ConsumeCooldown > clock())
{
m_Chum += 0.25;
if (m_Chum > M_2PI)
m_Chum -= M_2PI;
}
else
{
m_Chum = 0;
}
i... | 25.496094 | 177 | 0.656504 | [
"vector"
] |
5f755fafd56ac07a661208b400cafb91c7eacf1d | 15,313 | cpp | C++ | Source/DX11/Objects/DX11GameObject.cpp | AlexScapillati/RenderingEngine | a0315ca054db555b56ca4ff84bc2ae42d16440c6 | [
"MIT"
] | 1 | 2022-03-11T18:12:09.000Z | 2022-03-11T18:12:09.000Z | Source/DX11/Objects/DX11GameObject.cpp | AlexScapillati/RenderingEngine | a0315ca054db555b56ca4ff84bc2ae42d16440c6 | [
"MIT"
] | null | null | null | Source/DX11/Objects/DX11GameObject.cpp | AlexScapillati/RenderingEngine | a0315ca054db555b56ca4ff84bc2ae42d16440c6 | [
"MIT"
] | null | null | null | //--------------------------------------------------------------------------------------
// Class encapsulating a model
//--------------------------------------------------------------------------------------
// Holds a pointer to a mesh as well as position, rotation and scaling, which are converted to a world matrix w... | 33.073434 | 193 | 0.665905 | [
"mesh",
"geometry",
"render",
"object",
"vector",
"model"
] |
5f7b6ec24ecb523cd87f2110d7146e43471d5976 | 2,707 | cpp | C++ | Exercise7/4/main.cpp | jtrillos/LabBasicGraphicsSol | 5487e568a332d8ee37ad064da0dd5ceddf35f5eb | [
"Apache-2.0"
] | 2 | 2018-01-15T13:39:56.000Z | 2018-04-25T14:27:31.000Z | Exercise7/4/main.cpp | jtrillos/LabBasicGraphicsSol | 5487e568a332d8ee37ad064da0dd5ceddf35f5eb | [
"Apache-2.0"
] | null | null | null | Exercise7/4/main.cpp | jtrillos/LabBasicGraphicsSol | 5487e568a332d8ee37ad064da0dd5ceddf35f5eb | [
"Apache-2.0"
] | null | null | null |
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
void print_vec(vector<double> vec){
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
cout << endl;
}
double getMin(vector<double> vec){
double min = vec[0];
for (int i = 1; i < vec... | 25.064815 | 68 | 0.493535 | [
"vector"
] |
5f80ff5ee6c2dfb95478d6a1fa7835765c1d41e3 | 6,852 | cc | C++ | src/bin/compare-int-vector.cc | shuipi100/kaldi | 8e30fddb300a87e7c79ef2c0b9c731a8a9fd23f0 | [
"Apache-2.0"
] | 116 | 2016-10-25T06:04:49.000Z | 2022-03-13T02:30:52.000Z | src/bin/compare-int-vector.cc | shuipi100/kaldi | 8e30fddb300a87e7c79ef2c0b9c731a8a9fd23f0 | [
"Apache-2.0"
] | 38 | 2018-04-03T14:25:35.000Z | 2022-02-19T21:03:11.000Z | src/bin/compare-int-vector.cc | shuipi100/kaldi | 8e30fddb300a87e7c79ef2c0b9c731a8a9fd23f0 | [
"Apache-2.0"
] | 52 | 2016-04-21T13:38:21.000Z | 2022-02-16T08:33:13.000Z | // bin/compare-int-vector.cc
// Copyright 2018 Johns Hopkins University (Author: Daniel Povey)
// See ../../COPYING for clarification regarding multiple authors
//
// 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 ... | 37.037838 | 89 | 0.624051 | [
"vector",
"transform"
] |
5f92477dca87eac37d266428e7a32d0849829189 | 9,074 | cpp | C++ | src/metadata/async-io-metadata2.cpp | melchor629/node-flac-bindings | 584bd52ef12de4562dca0f198220f2c136666ce2 | [
"0BSD"
] | 13 | 2017-01-07T07:48:54.000Z | 2021-09-29T05:33:38.000Z | src/metadata/async-io-metadata2.cpp | melchor629/node-flac-bindings | 584bd52ef12de4562dca0f198220f2c136666ce2 | [
"0BSD"
] | 27 | 2016-11-24T11:35:22.000Z | 2022-02-14T14:38:09.000Z | src/metadata/async-io-metadata2.cpp | melchor629/node-flac-bindings | 584bd52ef12de4562dca0f198220f2c136666ce2 | [
"0BSD"
] | 3 | 2017-10-19T10:12:11.000Z | 2019-10-11T16:21:09.000Z | #include "metadata2.hpp"
namespace flac_bindings {
using namespace Napi;
using namespace std::placeholders;
AsyncFlacIOWork::AsyncFlacIOWork(
std::function<bool(FLAC__IOHandle, FLAC__IOCallbacks)> f,
const char* name,
const Object& obj,
std::function<void(const Napi::Env&, bool)> checkStatus):
... | 30.655405 | 98 | 0.603593 | [
"object"
] |
5faa5d37d500a41c6bba63fc7264afcfd08acea2 | 10,851 | cpp | C++ | ultra96/ROOT_FS/app/fad/src/fad/StateEstimator/ParticleFilter/ParticleFilter.cpp | rits-drsl/ZybotR2-96-fpt19 | bed374a70fc6bad637770532244b20002f8e8a28 | [
"MIT"
] | 14 | 2019-12-25T10:17:11.000Z | 2022-01-18T09:35:05.000Z | ultra96/ROOT_FS/app/fad/src/fad/StateEstimator/ParticleFilter/ParticleFilter.cpp | rits-drsl/ZybotR2-96-fpt19 | bed374a70fc6bad637770532244b20002f8e8a28 | [
"MIT"
] | null | null | null | ultra96/ROOT_FS/app/fad/src/fad/StateEstimator/ParticleFilter/ParticleFilter.cpp | rits-drsl/ZybotR2-96-fpt19 | bed374a70fc6bad637770532244b20002f8e8a28 | [
"MIT"
] | 2 | 2020-02-02T03:12:37.000Z | 2020-09-02T00:25:21.000Z | /**
* ParticleFilter: パーティクルフィルタを用いて
* 現状態を推定するクラス
*
* Copyright (C) 2019 Yuya Kudo.
* Copyright (C) 2019 Atsushi Takada.
* Authors:
* Yuya Kudo <ri0049ee@ed.ritsumei.ac.jp>
* Atsushi Takada <ri0051rr@ed.ritsumei.ac.jp>
*
*/
#include "ParticleFilter.h"
namespace fad {
... | 48.013274 | 138 | 0.487236 | [
"vector"
] |
5fad94745a0771835cbc109af54b3ee3dcd0daaf | 928 | cpp | C++ | modules/task_1/kolesin_a_radix_sort/main.cpp | stasyurin/pp_2021_spring_informatics | dd9136c28cca4c538c5ecc82512fd78ad1fa7bd3 | [
"BSD-3-Clause"
] | null | null | null | modules/task_1/kolesin_a_radix_sort/main.cpp | stasyurin/pp_2021_spring_informatics | dd9136c28cca4c538c5ecc82512fd78ad1fa7bd3 | [
"BSD-3-Clause"
] | null | null | null | modules/task_1/kolesin_a_radix_sort/main.cpp | stasyurin/pp_2021_spring_informatics | dd9136c28cca4c538c5ecc82512fd78ad1fa7bd3 | [
"BSD-3-Clause"
] | 1 | 2021-12-02T22:38:53.000Z | 2021-12-02T22:38:53.000Z | // Copyright 2021 Kolesin Andrey
#include <gtest/gtest.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include "./radix.h"
TEST(RadixSort, 321) {
std::vector<int> a = {3, 2, 1};
radixSort(&a[0], a.size());
ASSERT_EQ(a, std::vector<int>({1, 2, 3}));
}
TEST(RadixSort, 1) {
std::vector<int> a = {1... | 23.794872 | 59 | 0.572198 | [
"vector"
] |
5fb42b3b53b6c50eb76d924593fcc166a4d0e8b7 | 11,339 | cpp | C++ | src/vlVolume/RaycastVolume.cpp | zpc930/visualizationlibrary | c81fa75c720a3d04d295b977a1f5dc4624428b53 | [
"BSD-2-Clause"
] | null | null | null | src/vlVolume/RaycastVolume.cpp | zpc930/visualizationlibrary | c81fa75c720a3d04d295b977a1f5dc4624428b53 | [
"BSD-2-Clause"
] | null | null | null | src/vlVolume/RaycastVolume.cpp | zpc930/visualizationlibrary | c81fa75c720a3d04d295b977a1f5dc4624428b53 | [
"BSD-2-Clause"
] | null | null | null | /**************************************************************************************/
/* */
/* Visualization Library */
/* http://www.visualizationlibrary.org ... | 41.996296 | 147 | 0.536202 | [
"geometry",
"render",
"object",
"vector",
"transform",
"3d"
] |
5fbddc33cc119045629e8783c43b89e048790a22 | 1,797 | cpp | C++ | Library/Geometry/src/Topology_Based_Geometry/Tetrahedralized_Volume_2D.cpp | OrionQuest/Nova | 473a4df24191097c6542c3ec935b3d1bdd2cf13a | [
"Apache-2.0"
] | 23 | 2018-08-24T01:40:56.000Z | 2021-01-14T06:58:44.000Z | Library/Geometry/src/Topology_Based_Geometry/Tetrahedralized_Volume_2D.cpp | SoldierDown/Nova | d2da3ee316687316d5a858cd2b95605c483859db | [
"Apache-2.0"
] | 2 | 2017-07-04T11:25:17.000Z | 2020-10-10T12:31:01.000Z | Library/Geometry/src/Topology_Based_Geometry/Tetrahedralized_Volume_2D.cpp | SoldierDown/Nova | d2da3ee316687316d5a858cd2b95605c483859db | [
"Apache-2.0"
] | 7 | 2017-07-02T01:10:05.000Z | 2020-01-29T17:59:31.000Z | //!#####################################################################
//! \file Tetrahedralized_Volume_2D.cpp
//!#####################################################################
#include <nova/Geometry/Topology_Based_Geometry/Tetrahedralized_Volume.h>
using namespace Nova;
//####################################... | 47.289474 | 120 | 0.481358 | [
"geometry"
] |
5fc662caa6122506e5be13b9964194794951e85b | 26,116 | cpp | C++ | lib/Cinder/src/cinder/gl/Vbo.cpp | timmb/HarmonicMotion | 4ddf8ce98377260e57b6293d093a144a25ce3132 | [
"MIT"
] | 1 | 2018-07-20T03:56:15.000Z | 2018-07-20T03:56:15.000Z | lib/Cinder/src/cinder/gl/Vbo.cpp | timmb/HarmonicMotion | 4ddf8ce98377260e57b6293d093a144a25ce3132 | [
"MIT"
] | null | null | null | lib/Cinder/src/cinder/gl/Vbo.cpp | timmb/HarmonicMotion | 4ddf8ce98377260e57b6293d093a144a25ce3132 | [
"MIT"
] | null | null | null | /*
Copyright (c) 2010, The Barbarian Group
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 conditions... | 34.453826 | 263 | 0.67541 | [
"mesh",
"vector"
] |
5fc91437bc815763d74eb4f9de602c27e0326a0f | 1,578 | cpp | C++ | src/Rendering/Images/ImageLoadingScheduler.cpp | Frostie314159/FrostEngine | bb7781c5c90baf77ca836d69d6c38a4a5381e27f | [
"MIT"
] | null | null | null | src/Rendering/Images/ImageLoadingScheduler.cpp | Frostie314159/FrostEngine | bb7781c5c90baf77ca836d69d6c38a4a5381e27f | [
"MIT"
] | null | null | null | src/Rendering/Images/ImageLoadingScheduler.cpp | Frostie314159/FrostEngine | bb7781c5c90baf77ca836d69d6c38a4a5381e27f | [
"MIT"
] | null | null | null | #include "ImageLoadingScheduler.hpp"
ImageLoadingScheduler::ImageLoadingScheduler(Config t_config){
this->m_threads = std::vector<std::pair<std::thread,std::atomic_bool>>();
this->m_threads.reserve(std::thread::hardware_concurrency() - std::stoi(t_config.getConfigEntry("ReservedThreads").value));
this->m_i... | 42.648649 | 127 | 0.61597 | [
"vector"
] |
5fcc7353cef75ec49776d50a34d8c158a25fbf3b | 4,371 | cpp | C++ | BSenseApp/moc_bsenseprobe.cpp | mino98/bsense | 22081c5f708489129374a839502363abb877ab42 | [
"MIT"
] | null | null | null | BSenseApp/moc_bsenseprobe.cpp | mino98/bsense | 22081c5f708489129374a839502363abb877ab42 | [
"MIT"
] | null | null | null | BSenseApp/moc_bsenseprobe.cpp | mino98/bsense | 22081c5f708489129374a839502363abb877ab42 | [
"MIT"
] | null | null | null | /****************************************************************************
** Meta object code from reading C++ file 'bsenseprobe.h'
**
** Created: Wed Aug 25 14:18:47 2010
** by: The Qt Meta Object Compiler version 62 (Qt 4.6.3)
**
** WARNING! All changes made in this file will be lost!
***********************... | 36.425 | 133 | 0.60421 | [
"object"
] |
5fcf895b181fbb0c6531bd19ed3efb645e85246c | 23,427 | cpp | C++ | es3/connection.cpp | Cyberax/extremes3 | dc95b65a84778defc8fcc6d55554de2670cef6fc | [
"BSD-3-Clause"
] | null | null | null | es3/connection.cpp | Cyberax/extremes3 | dc95b65a84778defc8fcc6d55554de2670cef6fc | [
"BSD-3-Clause"
] | null | null | null | es3/connection.cpp | Cyberax/extremes3 | dc95b65a84778defc8fcc6d55554de2670cef6fc | [
"BSD-3-Clause"
] | null | null | null | /*
Copyright (c) 2013, Illumina 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 conditions and the following ... | 28.88656 | 120 | 0.684424 | [
"vector",
"transform"
] |
5fd3d4a08943f42a3abc65cc9f38e8164eec21e3 | 5,228 | cpp | C++ | components/loopp/src/drivers/BLEScannerDriver.cpp | PleXone2019/esp32-beacon-scanner | 83944402a48a47327bde1ec173160275fb3db6e3 | [
"MIT"
] | 110 | 2017-09-05T03:28:42.000Z | 2022-03-13T10:06:36.000Z | components/loopp/src/drivers/BLEScannerDriver.cpp | PleXone2019/esp32-beacon-scanner | 83944402a48a47327bde1ec173160275fb3db6e3 | [
"MIT"
] | 6 | 2017-12-14T22:01:46.000Z | 2019-05-31T15:16:26.000Z | components/loopp/src/drivers/BLEScannerDriver.cpp | PleXone2019/esp32-beacon-scanner | 83944402a48a47327bde1ec173160275fb3db6e3 | [
"MIT"
] | 21 | 2017-09-05T03:29:00.000Z | 2022-03-09T13:28:59.000Z | // Copyright (C) 2018 Rob Caelers <rob.caelers@gmail.com>
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, m... | 28.107527 | 141 | 0.652257 | [
"vector"
] |
5fd496c4e174aa62e15715dd00a2d2d983bf7715 | 75,935 | cpp | C++ | OpenNN/opennn/adaptive_moment_estimation.cpp | wagnrd/Pong | 0c50b22e0805b2ae19ff07d25859a6358217b377 | [
"MIT"
] | 4 | 2019-03-06T16:53:27.000Z | 2021-07-28T03:05:08.000Z | OpenNN/opennn/adaptive_moment_estimation.cpp | wagnrd/Pong | 0c50b22e0805b2ae19ff07d25859a6358217b377 | [
"MIT"
] | 1 | 2021-02-11T17:10:29.000Z | 2021-02-11T20:54:03.000Z | OpenNN/opennn/adaptive_moment_estimation.cpp | wagnrd/Pong | 0c50b22e0805b2ae19ff07d25859a6358217b377 | [
"MIT"
] | null | null | null | /****************************************************************************************************************/
/* */
/* OpenNN: Open Neural Networks Library ... | 27.512681 | 162 | 0.667176 | [
"object",
"vector",
"model"
] |
5fdf1a56fafe991ee44da692b24830099945f1b8 | 2,001 | hpp | C++ | src/third-party/spoa/simd_alignment_engine.hpp | PacificBiosciences/c3s | 01974dda9addc67744d5d4880d921588ed1e2a08 | [
"BSD-3-Clause-Clear"
] | 6 | 2019-11-14T16:40:36.000Z | 2020-06-12T10:06:57.000Z | src/third-party/spoa/simd_alignment_engine.hpp | armintoepfer/c3s | 01974dda9addc67744d5d4880d921588ed1e2a08 | [
"BSD-3-Clause-Clear"
] | 2 | 2020-08-15T18:45:25.000Z | 2020-11-26T13:46:42.000Z | src/third-party/spoa/simd_alignment_engine.hpp | armintoepfer/c3s | 01974dda9addc67744d5d4880d921588ed1e2a08 | [
"BSD-3-Clause-Clear"
] | 3 | 2020-12-28T10:34:08.000Z | 2020-12-28T10:34:31.000Z | /*!
* @file simd_alignment_engine.hpp
*
* @brief SimdAlignmentEngine class header file
*/
#pragma once
#include <stdint.h>
#include <memory>
#include <string>
#include <utility>
#include <vector>
#include "alignment_engine.hpp"
namespace spoa {
class Graph;
class SimdAlignmentEngine;
std::unique_ptr<Alignment... | 32.803279 | 100 | 0.642179 | [
"vector"
] |
5fe31c37f6d558b3e066bfb2face2e0d09c46f2d | 2,152 | cpp | C++ | src/Swoose/Swoose/QMMM/QmRegionSelection/SymmetryScores.cpp | qcscine/swoose | 55a74259153845ade607784f26455fd96dddce07 | [
"BSD-3-Clause"
] | 2 | 2021-12-15T09:31:36.000Z | 2021-12-15T09:35:36.000Z | src/Swoose/Swoose/QMMM/QmRegionSelection/SymmetryScores.cpp | qcscine/swoose | 55a74259153845ade607784f26455fd96dddce07 | [
"BSD-3-Clause"
] | null | null | null | src/Swoose/Swoose/QMMM/QmRegionSelection/SymmetryScores.cpp | qcscine/swoose | 55a74259153845ade607784f26455fd96dddce07 | [
"BSD-3-Clause"
] | null | null | null | /**
* @file
* @copyright This code is licensed under the 3-clause BSD license.\n
* Copyright ETH Zurich, Laboratory of Physical Chemistry, Reiher Group.\n
* See LICENSE.txt for details.
*/
#include "SymmetryScores.h"
#include "QmRegionSelector.h"
#include "QmRegionSelectorSettings.h"
#includ... | 36.474576 | 131 | 0.725836 | [
"vector",
"model"
] |
5fe86d5c5eaeec5e878a55c6099b06e9eb45db7c | 7,763 | cxx | C++ | ZScoreMapping/ZScoreMapping.cxx | CSIM-Toolkits/ImageFeatureExtraction | ea121dce0e511b5e6d4bede9e03c4fc053ed01b2 | [
"Apache-2.0"
] | null | null | null | ZScoreMapping/ZScoreMapping.cxx | CSIM-Toolkits/ImageFeatureExtraction | ea121dce0e511b5e6d4bede9e03c4fc053ed01b2 | [
"Apache-2.0"
] | null | null | null | ZScoreMapping/ZScoreMapping.cxx | CSIM-Toolkits/ImageFeatureExtraction | ea121dce0e511b5e6d4bede9e03c4fc053ed01b2 | [
"Apache-2.0"
] | null | null | null | #include "itkImageFileWriter.h"
#include "itkImageRegionIterator.h"
#include "itkHistogramMatchingImageFilter.h"
#include <math.h>
#include "itkPluginUtilities.h"
#include "ZScoreMappingCLP.h"
// Use an anonymous namespace to keep class types and function names
// from colliding when module is used as shared object ... | 37.322115 | 139 | 0.636481 | [
"object"
] |
5fe9ac12894fc5a31966c2908c231776375967dd | 7,292 | hpp | C++ | ThirdParty-mod/java2cpp/android/util/SparseIntArray.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 | [
"MIT"
] | 1 | 2019-04-03T01:53:28.000Z | 2019-04-03T01:53:28.000Z | ThirdParty-mod/java2cpp/android/util/SparseIntArray.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 | [
"MIT"
] | null | null | null | ThirdParty-mod/java2cpp/android/util/SparseIntArray.hpp | kakashidinho/HQEngine | 8125b290afa7c62db6cc6eac14e964d8138c7fd0 | [
"MIT"
] | null | null | null | /*================================================================================
code generated by: java2cpp
author: Zoran Angelov, mailto://baldzar@gmail.com
class: android.util.SparseIntArray
================================================================================*/
#ifndef J2CPP_INCLUDE_IMPL... | 28.046154 | 83 | 0.716402 | [
"object"
] |
5feba7889da00c25277af9a3462c03ef3da11973 | 892 | cpp | C++ | ECF/tree/Node.cpp | KarlaSalamun/ECF | 4bd21cf43d09435f034259a6b59129b1df6ad1b3 | [
"MIT"
] | null | null | null | ECF/tree/Node.cpp | KarlaSalamun/ECF | 4bd21cf43d09435f034259a6b59129b1df6ad1b3 | [
"MIT"
] | null | null | null | ECF/tree/Node.cpp | KarlaSalamun/ECF | 4bd21cf43d09435f034259a6b59129b1df6ad1b3 | [
"MIT"
] | null | null | null | #include "../ECF_base.h"
#include "Node.h"
#include <iostream>
namespace Tree
{
Node::Node(void)
{
size_ = 1;
}
/**
* \brief Create a copy of an existing Node.
* The associated primitive (pointer) is copied.
*/
Node::Node(NodeP node)
{
size_ = node->size_;
depth_ = node->depth_;
primitive_ = node->primitive... | 17.490196 | 87 | 0.701794 | [
"object"
] |
5ffc280ed9983008b7038fd10894cc947698c529 | 840 | cc | C++ | BOJ/1655.cc | Yaminyam/Algorithm | fe49b37b4b310f03273864bcd193fe88139f1c01 | [
"MIT"
] | 1 | 2019-05-18T00:02:12.000Z | 2019-05-18T00:02:12.000Z | BOJ/1655.cc | siontama/Algorithm | bb419e0d4dd09682bd4542f90038b492ee232bd2 | [
"MIT"
] | null | null | null | BOJ/1655.cc | siontama/Algorithm | bb419e0d4dd09682bd4542f90038b492ee232bd2 | [
"MIT"
] | null | null | null | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
#include<string>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
const int INF = numeric_limits<int>::max();
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
priority_queue<int, vector<int>, less<int>> ... | 17.142857 | 56 | 0.611905 | [
"vector"
] |
27032791592605ecaef3efe93c8c3b28920a88b0 | 4,073 | cpp | C++ | src/idonethdeepkin/Volturnos.cpp | rweyrauch/AoSSimulator | d2bfbbe0fab904cc543f1a01e62e0b82cf67c27b | [
"MIT"
] | 5 | 2019-02-01T01:41:19.000Z | 2021-06-17T02:16:13.000Z | src/idonethdeepkin/Volturnos.cpp | rweyrauch/AoSSimulator | d2bfbbe0fab904cc543f1a01e62e0b82cf67c27b | [
"MIT"
] | 2 | 2020-01-14T16:57:42.000Z | 2021-04-01T00:53:18.000Z | src/idonethdeepkin/Volturnos.cpp | rweyrauch/AoSSimulator | d2bfbbe0fab904cc543f1a01e62e0b82cf67c27b | [
"MIT"
] | 1 | 2019-03-02T20:03:51.000Z | 2019-03-02T20:03:51.000Z | /*
* Warhammer Age of Sigmar battle simulator.
*
* Copyright (C) 2019 by Rick Weyrauch - rpweyrauch@gmail.com
*
* This code is licensed under the MIT license (MIT) (http://opensource.org/licenses/MIT)
*/
#include <idonethdeepkin/Volturnos.h>
#include <UnitFactory.h>
#include <Board.h>
#include "IdonethDeepkinPriv... | 37.027273 | 136 | 0.606433 | [
"model"
] |
dfd4af745a37931ebb04f7f56cb2bd6e7723ea4b | 7,250 | cpp | C++ | proteus/MeshAdaptPUMI/DumpMesh.cpp | acatwithacomputer/proteus | 80dfad95da6ab4d18a88a035f55c26b03540a864 | [
"MIT"
] | null | null | null | proteus/MeshAdaptPUMI/DumpMesh.cpp | acatwithacomputer/proteus | 80dfad95da6ab4d18a88a035f55c26b03540a864 | [
"MIT"
] | 13 | 2018-02-08T23:22:59.000Z | 2020-12-06T19:40:32.000Z | proteus/MeshAdaptPUMI/DumpMesh.cpp | acatwithacomputer/proteus | 80dfad95da6ab4d18a88a035f55c26b03540a864 | [
"MIT"
] | 1 | 2020-02-17T03:25:34.000Z | 2020-02-17T03:25:34.000Z | #include "DumpMesh.h"
#include <PCU.h>
/* see flcbdfWrappersModule.cpp:
flcbdfWrappersConvertPUMIPartitionToPython
and cmeshToolsModule.cpp:
cmeshToolsBuildPythonMeshInterface */
static void print_int_2d(int* a, int h, int w, FILE* f)
{
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j)
fp... | 40.960452 | 81 | 0.662345 | [
"mesh"
] |
dfd995f50449143c03cb20071e13af433f3f418e | 7,476 | cpp | C++ | src/main/graph.cpp | kazuibasou/KDD2020 | fc327ffc745c0cedbce85cfbffb606ac46df9a85 | [
"MIT"
] | 2 | 2020-11-07T05:50:39.000Z | 2022-01-29T14:03:25.000Z | src/main/graph.cpp | kazuibasou/KDD2020 | fc327ffc745c0cedbce85cfbffb606ac46df9a85 | [
"MIT"
] | null | null | null | src/main/graph.cpp | kazuibasou/KDD2020 | fc327ffc745c0cedbce85cfbffb606ac46df9a85 | [
"MIT"
] | 1 | 2021-05-12T04:51:52.000Z | 2021-05-12T04:51:52.000Z | #include <iostream>
#include <vector>
#include <deque>
#include <numeric>
#include <random>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include "graph.h"
//Sampled data for node v
SampledData::SampledData(const int v){
index = v;
ndata = std::vector<int>();
pubd = 0.0;
d = 0.0;... | 22.183976 | 110 | 0.616774 | [
"vector",
"model"
] |
dfdde3ffa605214cff1536a4fb31ef395e4fc324 | 10,914 | cpp | C++ | rt_manipulators_lib/src/hardware_joints.cpp | rt-net/rt_manipulators_cpp | 311276d9f3a2cbdeb853947dd40b7d5a3700a633 | [
"Apache-2.0"
] | 7 | 2022-01-05T04:53:24.000Z | 2022-03-10T05:28:28.000Z | rt_manipulators_lib/src/hardware_joints.cpp | rt-net/rt_manipulators_cpp | 311276d9f3a2cbdeb853947dd40b7d5a3700a633 | [
"Apache-2.0"
] | 8 | 2022-02-07T02:57:25.000Z | 2022-03-30T04:28:55.000Z | rt_manipulators_lib/src/hardware_joints.cpp | rt-net/rt_manipulators_cpp | 311276d9f3a2cbdeb853947dd40b7d5a3700a633 | [
"Apache-2.0"
] | null | null | null | // Copyright 2021 RT Corporation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to ... | 30.917847 | 100 | 0.683434 | [
"vector"
] |
dfdf29baa8424943e64db9978493c1926ec0aa0d | 4,278 | cpp | C++ | 07_Project/CutFirewood/Source/Game/Combo/Combo.cpp | mcodegeeks/OpenKODE-Framework | d4382d781da7f488a0e7667362a89e8e389468dd | [
"MIT"
] | 2 | 2017-08-03T07:15:00.000Z | 2018-06-18T10:32:53.000Z | 07_Project/CutFirewood/Source/Game/Combo/Combo.cpp | mcodegeeks/OpenKODE-Framework | d4382d781da7f488a0e7667362a89e8e389468dd | [
"MIT"
] | null | null | null | 07_Project/CutFirewood/Source/Game/Combo/Combo.cpp | mcodegeeks/OpenKODE-Framework | d4382d781da7f488a0e7667362a89e8e389468dd | [
"MIT"
] | 2 | 2019-03-04T22:57:42.000Z | 2020-03-06T01:32:26.000Z | /* -----------------------------------------------------------------------------------
*
* File Combo.cpp
* Ported By Young-Hwan Mun
* Contact xmsoft77@gmail.com
*
* -----------------------------------------------------------------------------------
*
* Copyrigh... | 28.711409 | 132 | 0.585554 | [
"object"
] |
dfe958859e64d2ff167b214a7104957ed50ac188 | 1,106 | hpp | C++ | libs/core/include/fcppt/mpl/map/keys.hpp | freundlich/fcppt | 17df1b1ad08bf2435f6902d5465e3bc3fe5e3022 | [
"BSL-1.0"
] | 13 | 2015-02-21T18:35:14.000Z | 2019-12-29T14:08:29.000Z | libs/core/include/fcppt/mpl/map/keys.hpp | cpreh/fcppt | 17df1b1ad08bf2435f6902d5465e3bc3fe5e3022 | [
"BSL-1.0"
] | 5 | 2016-08-27T07:35:47.000Z | 2019-04-21T10:55:34.000Z | libs/core/include/fcppt/mpl/map/keys.hpp | freundlich/fcppt | 17df1b1ad08bf2435f6902d5465e3bc3fe5e3022 | [
"BSL-1.0"
] | 8 | 2015-01-10T09:22:37.000Z | 2019-12-01T08:31:12.000Z | // Copyright Carl Philipp Reh 2009 - 2021.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef FCPPT_MPL_MAP_KEYS_HPP_INCLUDED
#define FCPPT_MPL_MAP_KEYS_HPP_INCLUDED
#include <fcppt/mp... | 26.97561 | 82 | 0.724231 | [
"object"
] |
5f0236e4701a10bcdce76c37b273612d25ee1b72 | 6,659 | cc | C++ | chrome/browser/autocomplete/autocomplete_edit_unittest.cc | SlimKatLegacy/android_external_chromium | bc611cda58cc18d0dbaa8a7aee05eb3c0742e573 | [
"BSD-3-Clause"
] | 2 | 2017-02-20T14:25:04.000Z | 2019-12-13T13:58:28.000Z | chrome/browser/autocomplete/autocomplete_edit_unittest.cc | SlimKatLegacy/android_external_chromium | bc611cda58cc18d0dbaa8a7aee05eb3c0742e573 | [
"BSD-3-Clause"
] | 2 | 2017-07-25T09:37:22.000Z | 2017-08-04T07:18:56.000Z | chrome/browser/autocomplete/autocomplete_edit_unittest.cc | SlimKatLegacy/android_external_chromium | bc611cda58cc18d0dbaa8a7aee05eb3c0742e573 | [
"BSD-3-Clause"
] | 2 | 2017-08-09T09:03:23.000Z | 2020-05-26T09:14:49.000Z | // Copyright (c) 2011 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/utf_string_conversions.h"
#include "chrome/browser/autocomplete/autocomplete_edit.h"
#include "chrome/browser/autocomplete/autocomplete... | 41.61875 | 78 | 0.664664 | [
"model"
] |
5f138f652ee3499d537984b9820669f1092ccd1f | 2,055 | cc | C++ | alidns/src/model/CopyGtmConfigRequest.cc | iamzken/aliyun-openapi-cpp-sdk | 3c991c9ca949b6003c8f498ce7a672ea88162bf1 | [
"Apache-2.0"
] | 89 | 2018-02-02T03:54:39.000Z | 2021-12-13T01:32:55.000Z | alidns/src/model/CopyGtmConfigRequest.cc | iamzken/aliyun-openapi-cpp-sdk | 3c991c9ca949b6003c8f498ce7a672ea88162bf1 | [
"Apache-2.0"
] | 89 | 2018-03-14T07:44:54.000Z | 2021-11-26T07:43:25.000Z | alidns/src/model/CopyGtmConfigRequest.cc | aliyun/aliyun-openapi-cpp-sdk | 0cf5861ece17dfb0bb251f13bf3fbdb39c0c6e36 | [
"Apache-2.0"
] | 69 | 2018-01-22T09:45:52.000Z | 2022-03-28T07:58:38.000Z | /*
* Copyright 2009-2017 Alibaba Cloud All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required... | 24.176471 | 76 | 0.742092 | [
"model"
] |
5f13c42dd9980ac28de27d0fe8000b2beb2ed8b4 | 4,160 | cpp | C++ | BLEEPlib/src/BL2_peer_connectivity/AddrManager.cpp | kaistshadow/blockchain-sim | e0dbd23916b9a7ef24c3db6f43e969a63ad6b1f3 | [
"MIT"
] | 1 | 2021-09-17T14:18:11.000Z | 2021-09-17T14:18:11.000Z | BLEEPlib/src/BL2_peer_connectivity/AddrManager.cpp | kaistshadow/blockchain-sim | e0dbd23916b9a7ef24c3db6f43e969a63ad6b1f3 | [
"MIT"
] | 12 | 2018-06-01T12:29:51.000Z | 2021-12-11T06:58:01.000Z | BLEEPlib/src/BL2_peer_connectivity/AddrManager.cpp | kaistshadow/blockchain-sim | e0dbd23916b9a7ef24c3db6f43e969a63ad6b1f3 | [
"MIT"
] | null | null | null | // "Copyright [2021] <kaistshadow>"
#include <string>
#include <memory>
#include "AddrManager.h"
using namespace libBLEEP_BL;
#include "utility/UInt256.h"
#include "utility/GlobalClock.h"
#include "utility/Random.h"
#include "crypto/SHA256.h"
// private methods
int AddrManager::GetNewBucket(Address& addr) {
// ... | 30.814815 | 83 | 0.625962 | [
"vector"
] |
5f1c8255772dcfebfed282a7ac57e518f08e0761 | 37,983 | cpp | C++ | aten/src/ATen/native/GridSampler.cpp | DavidKo3/mctorch | 53ffe61763059677978b4592c8b2153b0c15428f | [
"BSD-3-Clause"
] | 1 | 2019-07-21T02:13:22.000Z | 2019-07-21T02:13:22.000Z | aten/src/ATen/native/GridSampler.cpp | DavidKo3/mctorch | 53ffe61763059677978b4592c8b2153b0c15428f | [
"BSD-3-Clause"
] | null | null | null | aten/src/ATen/native/GridSampler.cpp | DavidKo3/mctorch | 53ffe61763059677978b4592c8b2153b0c15428f | [
"BSD-3-Clause"
] | null | null | null | #include "ATen/ATen.h"
#include "ATen/NativeFunctions.h"
#include "ATen/detail/CUDAHooksInterface.h"
#include "ATen/native/GridSampler.h"
#ifdef _OPENMP
#include <omp.h>
#endif
namespace at { namespace native {
using at::native::detail::GridSamplerInterpolation;
using at::native::detail::GridSamplerPadding;
namespa... | 48.633803 | 136 | 0.57631 | [
"shape"
] |
5f23adba701d171d3025b23e6bfc3f3350a06cf5 | 49,351 | cpp | C++ | imap/src/client/ImapSession.cpp | webOS-ports/mojomail | 49358ac2878e010f5c6e3bd962f047c476c11fc3 | [
"Apache-2.0"
] | 6 | 2015-01-09T02:20:27.000Z | 2021-01-02T08:14:23.000Z | mojomail/imap/src/client/ImapSession.cpp | openwebos/app-services | 021d509d609fce0cb41a0e562650bdd1f3bf4e32 | [
"Apache-2.0"
] | 3 | 2019-05-11T19:17:56.000Z | 2021-11-24T16:04:36.000Z | mojomail/imap/src/client/ImapSession.cpp | openwebos/app-services | 021d509d609fce0cb41a0e562650bdd1f3bf4e32 | [
"Apache-2.0"
] | 6 | 2015-01-09T02:21:13.000Z | 2021-01-02T02:37:10.000Z | // @@@LICENSE
//
// Copyright (c) 2010-2013 LG Electronics, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless require... | 27.850451 | 188 | 0.746429 | [
"object",
"vector"
] |
5f25b96291a27364280a4fb019395bc508a6e7e8 | 2,222 | cpp | C++ | aws-cpp-sdk-fsx/source/model/DataRepositoryTaskStatus.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-fsx/source/model/DataRepositoryTaskStatus.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2021-10-14T16:57:00.000Z | 2021-10-18T10:47:24.000Z | aws-cpp-sdk-fsx/source/model/DataRepositoryTaskStatus.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2022-03-23T15:17:18.000Z | 2022-03-23T15:17:18.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/fsx/model/DataRepositoryTaskStatus.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws
{
... | 20.2 | 85 | 0.737174 | [
"model"
] |
5f2aaffb60bd8edecb6d89eb3f4fa563d7c05098 | 10,885 | cpp | C++ | test/src/test_iterators.cpp | fecjanky/transform | 8eaf0d034307d968fc3fb0f299568a9fc4e6d92d | [
"MIT"
] | 1 | 2019-04-13T09:18:52.000Z | 2019-04-13T09:18:52.000Z | test/src/test_iterators.cpp | fecjanky/transform | 8eaf0d034307d968fc3fb0f299568a9fc4e6d92d | [
"MIT"
] | null | null | null | test/src/test_iterators.cpp | fecjanky/transform | 8eaf0d034307d968fc3fb0f299568a9fc4e6d92d | [
"MIT"
] | null | null | null | #include <catch2/catch.hpp>
#include <lranges.h>
#include <forward_list>
#include <list>
#include <sstream>
#include <string>
#include <vector>
TEST_CASE("Transform iterator on input iterator", "[transform][iterator][input]")
{
std::istringstream iss("a b c");
std::istream_iterator<char> begin { iss... | 32.492537 | 100 | 0.602664 | [
"vector",
"transform"
] |
5f2cd3ea2ab936487c3757c2651024136e53fdc7 | 5,618 | cpp | C++ | enigma/rotor.cpp | JKalash/enigma | 1219c9a2a149d885db329a77597eaa921c2fa0e6 | [
"MIT"
] | 1 | 2017-11-27T16:18:10.000Z | 2017-11-27T16:18:10.000Z | enigma/rotor.cpp | JKalash/enigma | 1219c9a2a149d885db329a77597eaa921c2fa0e6 | [
"MIT"
] | null | null | null | enigma/rotor.cpp | JKalash/enigma | 1219c9a2a149d885db329a77597eaa921c2fa0e6 | [
"MIT"
] | null | null | null | //
// Rotor.cpp
// enigma
//
// Created by Joseph Kalash on 11/18/17.
// Copyright © 2017 Joseph Kalash. All rights reserved.
//
#include <fstream>
#include "rotor.hpp"
#define ROTOR_SIZE 26
Rotor::Rotor(EnigmaTypes::path rotFile, EnigmaTypes::path posFile, EnigmaTypes::location rotorIndex) {
//Check an... | 32.102857 | 163 | 0.610716 | [
"vector"
] |
5f3110d31741ccad9cd0de140f8a0336614b5c0a | 1,385 | cc | C++ | Parameters.cc | filakhtov/qemu-wrapper | 38d8cb6ed0e33519ef60d5430640d3847be1e212 | [
"Unlicense"
] | 1 | 2022-02-14T14:43:45.000Z | 2022-02-14T14:43:45.000Z | Parameters.cc | filakhtov/qemu-wrapper | 38d8cb6ed0e33519ef60d5430640d3847be1e212 | [
"Unlicense"
] | null | null | null | Parameters.cc | filakhtov/qemu-wrapper | 38d8cb6ed0e33519ef60d5430640d3847be1e212 | [
"Unlicense"
] | null | null | null | #include "Parameters.hh"
Modifier::Modifier(const std::string& n) : name{n}, value{}
{
}
Modifier::Modifier(const std::string& n, const std::string& v) : name{n}, value{v}
{
}
Modifier::operator std::string(void) const
{
if (this->value.size()) {
return std::move(this->name + "=" + this->value);
}
... | 19.236111 | 98 | 0.640433 | [
"vector"
] |
5f38405156c0a9469f0d18b676d44fa594596d99 | 12,120 | hh | C++ | src/mem/ruby/network/garnet2.0/GarnetNetwork.hh | wjwyyjr/Gem5_task_graph | 0e233b5053d6dcd518a2ad6fddd23eaeb9c3a8ee | [
"BSD-3-Clause"
] | null | null | null | src/mem/ruby/network/garnet2.0/GarnetNetwork.hh | wjwyyjr/Gem5_task_graph | 0e233b5053d6dcd518a2ad6fddd23eaeb9c3a8ee | [
"BSD-3-Clause"
] | null | null | null | src/mem/ruby/network/garnet2.0/GarnetNetwork.hh | wjwyyjr/Gem5_task_graph | 0e233b5053d6dcd518a2ad6fddd23eaeb9c3a8ee | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (c) 2008 Princeton University
* Copyright (c) 2016 Georgia Institute of Technology
* 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 retai... | 34.628571 | 93 | 0.723102 | [
"vector"
] |
5f4e3161816965da064945ab859d6dd7b8ef8f84 | 86,270 | cxx | C++ | src/AspNetCore/Src/forwardinghandler.cxx | mimiagaj/aspnetCore | bce531f61a051c09c9fc2b38a7e72cee6123c95f | [
"MIT"
] | 1 | 2020-08-25T22:41:04.000Z | 2020-08-25T22:41:04.000Z | src/AspNetCore/Src/forwardinghandler.cxx | mimiagaj/ASPNETCORE | bce531f61a051c09c9fc2b38a7e72cee6123c95f | [
"MIT"
] | null | null | null | src/AspNetCore/Src/forwardinghandler.cxx | mimiagaj/ASPNETCORE | bce531f61a051c09c9fc2b38a7e72cee6123c95f | [
"MIT"
] | null | null | null | // Copyright (c) .NET Foundation. All rights reserved.
// Licensed under the MIT License. See License.txt in the project root for license information.
#include "precomp.hxx"
// Just to be aware of the FORWARDING_HANDLER object size.
C_ASSERT(sizeof(FORWARDING_HANDLER) <= 632);
#define DEF_MAX_FORWARDS 32
#def... | 27.439567 | 126 | 0.571091 | [
"object"
] |
5f4f4414965471a1c939131acfb1551dffbf92b5 | 601 | cpp | C++ | aws-cpp-sdk-customer-profiles/source/model/GetIdentityResolutionJobRequest.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-customer-profiles/source/model/GetIdentityResolutionJobRequest.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2021-10-14T16:57:00.000Z | 2021-10-18T10:47:24.000Z | aws-cpp-sdk-customer-profiles/source/model/GetIdentityResolutionJobRequest.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"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/customer-profiles/model/GetIdentityResolutionJobRequest.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::CustomerProfiles::Model;
using namesp... | 20.724138 | 72 | 0.767055 | [
"model"
] |
5f4fa964a75060c08d4aabf74dde3e33cffa238f | 32,788 | cpp | C++ | Engine/Script/Bindings/BSFBind.cpp | hhyyrylainen/Leviathan | 0a0d2ea004a153f9b17c6230da029e8160716f71 | [
"BSL-1.0"
] | 16 | 2018-12-22T02:09:05.000Z | 2022-03-09T20:38:59.000Z | Engine/Script/Bindings/BSFBind.cpp | hhyyrylainen/Leviathan | 0a0d2ea004a153f9b17c6230da029e8160716f71 | [
"BSL-1.0"
] | 46 | 2018-04-02T11:06:01.000Z | 2019-12-14T11:16:04.000Z | Engine/Script/Bindings/BSFBind.cpp | hhyyrylainen/Leviathan | 0a0d2ea004a153f9b17c6230da029e8160716f71 | [
"BSL-1.0"
] | 14 | 2018-04-09T02:26:15.000Z | 2021-09-11T03:12:15.000Z | // ------------------------------------ //
#include "BSFBind.h"
#include "Define.h"
#include "Logger.h"
// For Float type conversions
#include "Common/Types.h"
#include "Engine.h"
#include "Exceptions.h"
#include "Rendering/Graphics.h"
#include "BsApplication.h"
#include "bsfCore/Material/BsMaterial.h"
#include "bs... | 30.080734 | 95 | 0.641973 | [
"mesh",
"object",
"vector"
] |
5f507da4832caa0d0ed400c3e6027ff551dc12c9 | 732 | cpp | C++ | lib/generator/overworld/populators/MegaTaigaPopulator.cpp | NetherGamesMC/noiselib | 56fc48ea1367e1d08b228dfa580b513fbec8ca31 | [
"MIT"
] | 14 | 2021-08-16T18:58:30.000Z | 2022-02-13T01:12:31.000Z | lib/generator/overworld/populators/MegaTaigaPopulator.cpp | NetherGamesMC/ext-vanillagenerator | 56fc48ea1367e1d08b228dfa580b513fbec8ca31 | [
"MIT"
] | 2 | 2021-06-21T15:10:01.000Z | 2021-07-19T01:48:00.000Z | lib/generator/overworld/populators/MegaTaigaPopulator.cpp | NetherGamesMC/ext-vanillagenerator | 56fc48ea1367e1d08b228dfa580b513fbec8ca31 | [
"MIT"
] | 3 | 2021-06-21T02:10:39.000Z | 2021-08-04T01:36:08.000Z | #include <lib/objects/constants/BiomeList.h>
#include "MegaTaigaPopulator.h"
void MegaTaigaPopulator::InitPopulators() {
treeDecorator_.SetAmount(10);
treeDecorator_.SetTrees({{52, redwoodTree}, {26, tallRedwoodTree}, {36, megaPineTree}, {3, megaSpruceTree}});
deadBushDecorator_.SetAmount(0);
taigaBrownMushroo... | 38.526316 | 111 | 0.793716 | [
"vector"
] |
34ffee58596608c5f48725b3e40594f845cc8e34 | 404 | cpp | C++ | src/Object.cpp | beckylum0216/temp3dgame | 0cf45aaa1fae6e4762840dcc9c5a044c9a37e4f7 | [
"MIT"
] | 1 | 2019-11-28T08:45:27.000Z | 2019-11-28T08:45:27.000Z | src/Object.cpp | beckylum0216/temp3dgame | 0cf45aaa1fae6e4762840dcc9c5a044c9a37e4f7 | [
"MIT"
] | null | null | null | src/Object.cpp | beckylum0216/temp3dgame | 0cf45aaa1fae6e4762840dcc9c5a044c9a37e4f7 | [
"MIT"
] | null | null | null | //
// Created by becky on 27/11/2019.
//
#include "Object.h"
bool Object::Import(std::string path)
{
Assimp::Importer import;
const aiScene *scene;
scene = import.ReadFile(path, aiProcessPreset_TargetRealtime_Quality);
if(!scene)
{
std::cout << import.GetErrorString() << std::endl;
}
... | 19.238095 | 74 | 0.616337 | [
"object"
] |
550cb9c34ea82faa07b1d21b25f1f386cde2a0e8 | 7,032 | cc | C++ | test/test_discrete_weights.cc | snsinfu/cxx-distr | 0ceafc9b34064dafdc70b61da84f3c936a10b892 | [
"BSL-1.0"
] | null | null | null | test/test_discrete_weights.cc | snsinfu/cxx-distr | 0ceafc9b34064dafdc70b61da84f3c936a10b892 | [
"BSL-1.0"
] | 4 | 2020-12-27T17:10:03.000Z | 2020-12-28T18:42:40.000Z | test/test_discrete_weights.cc | snsinfu/cxx-distr | 0ceafc9b34064dafdc70b61da84f3c936a10b892 | [
"BSL-1.0"
] | null | null | null | // Copyright snsinfu 2020.
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <algorithm>
#include <initializer_list>
#include <numeric>
#include <sstream>
#include <string>
#include <catch.hpp>
#include <discre... | 27.794466 | 81 | 0.597696 | [
"vector"
] |
551039c1c37da082b40535d8e52d1b3cd0ef33c4 | 1,841 | cc | C++ | src/base/event.cc | likilli/MyServer | 1d2fe6339e2c1afc4c3ded0ff0d8f9dc747d61fc | [
"MIT"
] | 2 | 2021-12-10T06:44:02.000Z | 2021-12-17T02:38:19.000Z | src/base/event.cc | likilli/MyServer | 1d2fe6339e2c1afc4c3ded0ff0d8f9dc747d61fc | [
"MIT"
] | 1 | 2021-12-21T16:28:49.000Z | 2021-12-21T16:28:49.000Z | src/base/event.cc | likilli/MyServer | 1d2fe6339e2c1afc4c3ded0ff0d8f9dc747d61fc | [
"MIT"
] | null | null | null | #include "event.h"
// condition implementation
#if defined(USE_SELECT)
#include <sys/select.h>
#include <vector>
#include <algorithm>
#include <cassert>
fd_set rfds{};
fd_set wfds{};
int fd_max{-1};
std::vector<Event> events{};
static bool isLoopRunning{false};
/**
*
* @param socket
* @param event_type
* ... | 17.046296 | 72 | 0.560022 | [
"vector"
] |
55138e7f4cf22b35a63b06a8d175daffdf37e977 | 2,272 | cpp | C++ | USACOcontests/gold/2020.01/boards.cpp | eyangch/competitive-programming | 59839efcec72cb792e61b7d316f83ad54f16a166 | [
"MIT"
] | 14 | 2019-08-14T00:43:10.000Z | 2021-12-16T05:43:31.000Z | USACOcontests/gold/2020.01/boards.cpp | eyangch/competitive-programming | 59839efcec72cb792e61b7d316f83ad54f16a166 | [
"MIT"
] | null | null | null | USACOcontests/gold/2020.01/boards.cpp | eyangch/competitive-programming | 59839efcec72cb792e61b7d316f83ad54f16a166 | [
"MIT"
] | 6 | 2020-12-30T03:30:17.000Z | 2022-03-11T03:40:02.000Z | /*
Solution: O(P logP)
Sort springboards by x1 value (decreasing) and another one by x2 value (decreasing)
Iterate through the x2 sorted array and add viable starting points from the x1 array to a strictly increasing map
Query the starting point with greater or equal y value than the current x2 y2 point (dist = x-val +... | 27.047619 | 117 | 0.495599 | [
"vector"
] |
5517768324ce5ade04ede16ae4a34e21813efe51 | 2,294 | cpp | C++ | src/RequestHandler/CommandRequestHandler.cpp | eiji-shimizu/laravel_sample_queue | b5fd66a56c32f7893856e5ac344137e7d6f63648 | [
"MIT"
] | null | null | null | src/RequestHandler/CommandRequestHandler.cpp | eiji-shimizu/laravel_sample_queue | b5fd66a56c32f7893856e5ac344137e7d6f63648 | [
"MIT"
] | null | null | null | src/RequestHandler/CommandRequestHandler.cpp | eiji-shimizu/laravel_sample_queue | b5fd66a56c32f7893856e5ac344137e7d6f63648 | [
"MIT"
] | null | null | null | #include "LSQ.h"
#include "ServerApplication/Subsystems/LSQSubsystem.h"
#include "ServerApplication/Subsystems/LSQQueue.h"
#include "RequestHandler/CommandRequestHandler.h"
#include "Poco/URI.h"
#include <sstream>
namespace LSQ
{
const std::string HELP = "help";
const std::string COUNT = "count";
const std::string ... | 29.037975 | 117 | 0.543156 | [
"vector"
] |
551cd51801c60fea9994a90254abc256b577e11b | 51,926 | cpp | C++ | SheepShaver/src/BeOS/main_beos.cpp | jvernet/macemu | c616a0dae0f451fc15016765c896175fae3f46cf | [
"Intel",
"X11"
] | 940 | 2015-01-04T12:20:10.000Z | 2022-03-29T12:35:27.000Z | SheepShaver/src/BeOS/main_beos.cpp | Seanpm2001-virtual-machines/macemu | c616a0dae0f451fc15016765c896175fae3f46cf | [
"Intel",
"X11"
] | 163 | 2015-02-10T09:08:10.000Z | 2022-03-13T05:48:10.000Z | SheepShaver/src/BeOS/main_beos.cpp | Seanpm2001-virtual-machines/macemu | c616a0dae0f451fc15016765c896175fae3f46cf | [
"Intel",
"X11"
] | 188 | 2015-01-07T19:46:11.000Z | 2022-03-26T19:06:00.000Z | /*
* main_beos.cpp - Emulation core, BeOS implementation
*
* SheepShaver (C) 1997-2008 Christian Bauer and Marc Hellwig
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either versi... | 25.756944 | 271 | 0.678754 | [
"object"
] |
552218e9cd63588131b2e4eedcd8df580ef4f162 | 5,842 | cpp | C++ | src/scene/joint.cpp | Sangeun44/Half-Edge-Mesh | 0ab055fd5aee275c64167ac2b5ae75278e9dc488 | [
"MIT"
] | null | null | null | src/scene/joint.cpp | Sangeun44/Half-Edge-Mesh | 0ab055fd5aee275c64167ac2b5ae75278e9dc488 | [
"MIT"
] | null | null | null | src/scene/joint.cpp | Sangeun44/Half-Edge-Mesh | 0ab055fd5aee275c64167ac2b5ae75278e9dc488 | [
"MIT"
] | null | null | null | #include "joint.h"
int Joint::id = -1;
Joint::Joint(GLWidget277 *context): Drawable(context), thisID(), name(), parent(nullptr), children(std::vector<Joint*>()), position(), rotation(), joint_bindMatrix(), selected(false)
{
}
GLenum Joint::drawMode()
{
return GL_LINES;
}
void Joint::setSelected(bool select) {
... | 25.510917 | 182 | 0.623074 | [
"vector"
] |
552a992ea001aadcfb37c7fa30c88431142d5417 | 646 | cpp | C++ | 0264. Ugly Number II/solution.cpp | Pluto-Zy/LeetCode | 3bb39fc5c000b344fd8727883b095943bd29c247 | [
"MIT"
] | null | null | null | 0264. Ugly Number II/solution.cpp | Pluto-Zy/LeetCode | 3bb39fc5c000b344fd8727883b095943bd29c247 | [
"MIT"
] | null | null | null | 0264. Ugly Number II/solution.cpp | Pluto-Zy/LeetCode | 3bb39fc5c000b344fd8727883b095943bd29c247 | [
"MIT"
] | null | null | null | class Solution {
public:
int nthUglyNumber(int n) {
// 从已经生成的丑数中 *2 *3 *5 得到后续丑数
// 每个丑数都应乘 3 次
// 重点是对结果排序
// 使用 3 个指针，分别指向 3 种乘法当前工作到的整数
std::vector<int> dp(n);
dp[0] = 1;
auto _ptr_2 = 0, _ptr_3 = _ptr_2, _ptr_5 = _ptr_2;
for (int i = 1; i < n; ++i) {
int _temp_2 = dp[_ptr_2] ... | 26.916667 | 87 | 0.50774 | [
"vector"
] |
552c1fcf9dff7f6b7b0a1321925f2a0aea7952e0 | 6,259 | cpp | C++ | src/qnoesiswindow.cpp | ZeroPass/NoesisGui-Qt-Binding | 4d8c6615d3e1578bbd77ba789416a5d5f72b043f | [
"MIT"
] | 2 | 2018-01-15T15:24:10.000Z | 2020-06-26T20:30:09.000Z | src/qnoesiswindow.cpp | ZeroPass/NoesisGui-Qt-Binding | 4d8c6615d3e1578bbd77ba789416a5d5f72b043f | [
"MIT"
] | null | null | null | src/qnoesiswindow.cpp | ZeroPass/NoesisGui-Qt-Binding | 4d8c6615d3e1578bbd77ba789416a5d5f72b043f | [
"MIT"
] | 2 | 2018-08-28T08:45:47.000Z | 2020-06-26T20:30:11.000Z | #include "qnoesiswindow.h"
#include "qnsrenderdevice.h"
#include <QDebug>
#include <QTimer>
#include <NsCore/PtrForward.h>
#include <NsCore/HashMap.h>
#include <NsCore/Ptr.h>
using namespace Noesis;
using namespace Noesis::Core;
using namespace Noesis::Gui;
using namespace Noesis::GUI;
using namespace Noesis::Rend... | 23.530075 | 90 | 0.628215 | [
"render"
] |
55300edddab3eed65b4a2da09843c2cb5159ad8d | 1,610 | cpp | C++ | src/MsgSaver.cpp | whunmr/msgtest | 0ada56dce0c23d78018b5667ea3ccf6a7ea3bae0 | [
"Apache-2.0"
] | 2 | 2017-03-09T07:22:38.000Z | 2020-03-31T00:42:22.000Z | src/MsgSaver.cpp | whunmr/msgtest | 0ada56dce0c23d78018b5667ea3ccf6a7ea3bae0 | [
"Apache-2.0"
] | 1 | 2017-04-11T06:29:33.000Z | 2017-04-11T06:29:33.000Z | src/MsgSaver.cpp | whunmr/msgtest | 0ada56dce0c23d78018b5667ea3ccf6a7ea3bae0 | [
"Apache-2.0"
] | 2 | 2017-10-26T11:49:20.000Z | 2018-09-12T01:54:11.000Z | #include <msgtest/MsgSaver.h>
MSGTEST_NS_START
const void* PayloadAddressTempHolder::payloadAddr_;
////////////////////////////////////////////////////////////////////////////
MsgSaverBase::MsgSaverBase()
: payload_(nullptr)
, len_(0)
, payload_mem_addr_(&payload_)
... | 35.777778 | 153 | 0.554658 | [
"object"
] |
553601b412c3f56bb88589a7c789d9c1b5284617 | 959 | cpp | C++ | src/Bridge.cpp | luka1199/bridges | 117c91d714aa19fa4c5138b032583e3efe93d142 | [
"MIT"
] | null | null | null | src/Bridge.cpp | luka1199/bridges | 117c91d714aa19fa4c5138b032583e3efe93d142 | [
"MIT"
] | 1 | 2019-08-14T13:36:33.000Z | 2019-08-14T13:36:33.000Z | src/Bridge.cpp | luka1199/bridges | 117c91d714aa19fa4c5138b032583e3efe93d142 | [
"MIT"
] | null | null | null | // Copyright 2018,
// Author: Luka Steinbach <luka.steinbach@gmx.de>
#include "./Bridge.h"
#include <string>
#include <vector>
// _____________________________________________________________________________
Bridge::Bridge(int x, int y) : Field(x, y) {
_weight = 0;
_directionHor = false;
_symbol = _symbolsHor[0... | 25.918919 | 80 | 0.773723 | [
"vector"
] |
5537b7f928531126affd7601c46438543581d6d0 | 167 | cpp | C++ | tests/priority_queue.cpp | justcppdev/priority_queue | a9ec169417162a559afabc1ef04dd72e010f9504 | [
"MIT"
] | null | null | null | tests/priority_queue.cpp | justcppdev/priority_queue | a9ec169417162a559afabc1ef04dd72e010f9504 | [
"MIT"
] | null | null | null | tests/priority_queue.cpp | justcppdev/priority_queue | a9ec169417162a559afabc1ef04dd72e010f9504 | [
"MIT"
] | null | null | null | #include <catch.hpp>
#include <vector>
#include "priority_queue.hpp"
TEST_CASE("simple test", "")
{
priority_queue_t<int> queue;
REQUIRE( queue.empty() );
}
| 15.181818 | 32 | 0.670659 | [
"vector"
] |
554036fffe3111e6179f49e5252bde2935e394a8 | 828 | cc | C++ | leet_code/Shortest_Unsorted_Continuous_Subarray/solve.cc | ldy121/algorithm | 7939cb4c15e2bc655219c934f00c2bb74ddb4eec | [
"Apache-2.0"
] | 1 | 2020-04-11T22:04:23.000Z | 2020-04-11T22:04:23.000Z | leet_code/Shortest_Unsorted_Continuous_Subarray/solve.cc | ldy121/algorithm | 7939cb4c15e2bc655219c934f00c2bb74ddb4eec | [
"Apache-2.0"
] | null | null | null | leet_code/Shortest_Unsorted_Continuous_Subarray/solve.cc | ldy121/algorithm | 7939cb4c15e2bc655219c934f00c2bb74ddb4eec | [
"Apache-2.0"
] | null | null | null | class Solution {
private :
const int invalid = -1;
public:
int findUnsortedSubarray(vector<int>& nums) {
auto min = *nums.rbegin(), max = *nums.begin();
auto idx = 0;
auto left = invalid, right = invalid;
idx = 0;
for_each(nums.begin(), nums.end(), [&max, &right, &idx](a... | 25.090909 | 76 | 0.396135 | [
"vector"
] |
55468443aa54fa06eb2345702e44bc83ee5ed866 | 65,800 | cpp | C++ | source/Lib/TLibDecoder/SEIread.cpp | AjayKumarSahu20/SHVC_2 | 2ce6fe131ab12eadf8d51b3408081529b5ad9366 | [
"BSD-3-Clause"
] | 2 | 2019-12-25T07:41:29.000Z | 2021-11-25T11:50:12.000Z | source/Lib/TLibDecoder/SEIread.cpp | AjayKumarSahu20/SHVC_2 | 2ce6fe131ab12eadf8d51b3408081529b5ad9366 | [
"BSD-3-Clause"
] | null | null | null | source/Lib/TLibDecoder/SEIread.cpp | AjayKumarSahu20/SHVC_2 | 2ce6fe131ab12eadf8d51b3408081529b5ad9366 | [
"BSD-3-Clause"
] | null | null | null | /* The copyright in this software is being made available under the BSD
* License, included below. This software may be subject to other third party
* and contributor rights, including patent rights, and no such rights are
* granted under this license.
*
* Copyright (c) 2010-2014, ITU/ISO/IEC
* All rights reserve... | 38.012709 | 191 | 0.666505 | [
"vector",
"model"
] |
55490522903414bbf024f3532ad51946c949950b | 3,872 | cpp | C++ | kittycat/PWCatsApi.cpp | siilky/catomania | cb3a05cbef523d16b8929b390e190e0cd5924ee9 | [
"MIT"
] | 1 | 2021-02-05T23:20:07.000Z | 2021-02-05T23:20:07.000Z | kittycat/PWCatsApi.cpp | siilky/catomania | cb3a05cbef523d16b8929b390e190e0cd5924ee9 | [
"MIT"
] | null | null | null | kittycat/PWCatsApi.cpp | siilky/catomania | cb3a05cbef523d16b8929b390e190e0cd5924ee9 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "PWCatsApi.h"
#include "version.h"
#include "util.h"
void PWCatsRequest::reset(QNetworkReply *r)
{
if (reply_)
{
delete reply_;
}
reply_ = r;
isParsed_ = false;
error_.clear();
}
//
PWCatsPriceHistoryRequest::PriceElement::PriceElement(const QJsonObject ... | 26.162162 | 105 | 0.582903 | [
"object"
] |
554b9a7972a9dc157181a52aa4bcf256fa97abeb | 458 | cpp | C++ | Leetcode/Day015/reshape_matrix.cpp | SujalAhrodia/Practice_2020 | 59b371ada245ed8253d12327f18deee3e47f31d6 | [
"MIT"
] | null | null | null | Leetcode/Day015/reshape_matrix.cpp | SujalAhrodia/Practice_2020 | 59b371ada245ed8253d12327f18deee3e47f31d6 | [
"MIT"
] | null | null | null | Leetcode/Day015/reshape_matrix.cpp | SujalAhrodia/Practice_2020 | 59b371ada245ed8253d12327f18deee3e47f31d6 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c)
{
int el = nums.size()*nums[0].size();
int n = nums[0].size();
if(el != (r*c))
return nums;
vector<vector<int>> ans(r, vector<int> (c,0));
... | 22.9 | 79 | 0.436681 | [
"vector"
] |
554c80df8ac046b1dab70531fc57e39f149592e7 | 3,108 | cpp | C++ | source/muilib/gui/MWndNamespace.cpp | MRoc/MSynth | 3eb5c6cf0ad6a3d12f555ebca5fbe84c1b255829 | [
"MIT"
] | 1 | 2022-01-30T07:40:31.000Z | 2022-01-30T07:40:31.000Z | source/muilib/gui/MWndNamespace.cpp | MRoc/MSynth | 3eb5c6cf0ad6a3d12f555ebca5fbe84c1b255829 | [
"MIT"
] | null | null | null | source/muilib/gui/MWndNamespace.cpp | MRoc/MSynth | 3eb5c6cf0ad6a3d12f555ebca5fbe84c1b255829 | [
"MIT"
] | null | null | null | #include "MWndNamespace.h"
#include "MWndcollection.h"
/** constructor */
MWndNamespace::MWndNamespace( MWndCollection* pOwner ) :
ivPtOwner( pOwner )
{
}
/** destructor */
MWndNamespace::~MWndNamespace()
{
ivId2Wnd.clear();
ivWnd2Id.clear();
ivPtOwner = 0;
}
/** registers a object at the contex... | 25.064516 | 86 | 0.656049 | [
"object"
] |
554fb5fd4fca39812b82eefe3389d928911cfe21 | 38,137 | cpp | C++ | tests/model/model.cpp | nickerso/libcellml | 9fe5ecabc3e63c49d5ee8539ed2c8ce572a9712a | [
"Apache-2.0"
] | 1 | 2021-02-15T01:09:04.000Z | 2021-02-15T01:09:04.000Z | tests/model/model.cpp | nickerso/libcellml | 9fe5ecabc3e63c49d5ee8539ed2c8ce572a9712a | [
"Apache-2.0"
] | 8 | 2019-09-01T23:37:50.000Z | 2021-05-27T21:20:34.000Z | tests/model/model.cpp | nickerso/libcellml | 9fe5ecabc3e63c49d5ee8539ed2c8ce572a9712a | [
"Apache-2.0"
] | 1 | 2022-02-04T06:11:40.000Z | 2022-02-04T06:11:40.000Z | /*
Copyright libCellML Contributors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, softwa... | 32.707547 | 125 | 0.641398 | [
"model"
] |
5550509b051f01f5f513249220731d66fa07b98b | 387 | cpp | C++ | source/scene_graph/scene_graph.cpp | burz/tap | 61f8f2cf2022db99e02992340735e342f4a8394d | [
"MIT"
] | 1 | 2016-10-07T01:52:57.000Z | 2016-10-07T01:52:57.000Z | source/scene_graph/scene_graph.cpp | burz/tap | 61f8f2cf2022db99e02992340735e342f4a8394d | [
"MIT"
] | null | null | null | source/scene_graph/scene_graph.cpp | burz/tap | 61f8f2cf2022db99e02992340735e342f4a8394d | [
"MIT"
] | null | null | null | #include "scene_graph.h"
Scene_graph::Scene_graph()
: head()
{
}
Scene_graph::~Scene_graph()
{
}
void Scene_graph::add(Geometry *geometry)
{
int position = 0;
while(position < head.number_of_children) {
}
head.add_child(geometry);
}
void Scene_graph::add(Scene_graph_node *node)
{
}
void Scene_grap... | 12.09375 | 46 | 0.692506 | [
"geometry",
"render"
] |
556186e8454cb74976c07059dfde3050d29032f5 | 8,985 | cpp | C++ | src/example_filters.cpp | dringakn/ROSExamples | f4f19d21fab3630c112148e198f117f0466032c4 | [
"MIT"
] | 2 | 2020-07-14T19:37:43.000Z | 2020-07-15T04:38:09.000Z | src/example_filters.cpp | dringakn/ROSExamples | f4f19d21fab3630c112148e198f117f0466032c4 | [
"MIT"
] | null | null | null | src/example_filters.cpp | dringakn/ROSExamples | f4f19d21fab3630c112148e198f117f0466032c4 | [
"MIT"
] | null | null | null | /**
* Author: Dr. Ing. Ahmad Kamal Nasir
* Email: dringakn@gmail.com
* Description:
* The following example shows how to create mean/median/digital
* filters (single/multi channels). Furthermore, how to concatenate
* different filters (e.g. increment filter) using chain.
* ... | 41.40553 | 80 | 0.648859 | [
"vector"
] |
55654904fb7ef127170b196e614fc8acef3f4cf3 | 3,530 | cpp | C++ | tc 160+/FoxProgression.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 3 | 2015-05-25T06:24:37.000Z | 2016-09-10T07:58:00.000Z | tc 160+/FoxProgression.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | null | null | null | tc 160+/FoxProgression.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 5 | 2015-05-25T06:24:40.000Z | 2021-08-19T19:22:29.000Z | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
class FoxProgression {
public:
int theCount(vector <int> seq) {
if (seq.size() == 1) {
return ... | 42.53012 | 365 | 0.516714 | [
"vector"
] |
5565b37187eca8a73a6b8cbdc6cf33e416c7909b | 9,239 | cpp | C++ | src/puzzles/sudoku/board.cpp | huwlloyd-mmu/jpop | 8a749ec5d92b3a6d67ea898a5b4282113dc7ea4b | [
"MIT"
] | null | null | null | src/puzzles/sudoku/board.cpp | huwlloyd-mmu/jpop | 8a749ec5d92b3a6d67ea898a5b4282113dc7ea4b | [
"MIT"
] | null | null | null | src/puzzles/sudoku/board.cpp | huwlloyd-mmu/jpop | 8a749ec5d92b3a6d67ea898a5b4282113dc7ea4b | [
"MIT"
] | null | null | null | #include "board.h"
#include <iostream>
#include <iomanip>
#include <inttypes.h>
#include <string>
#include <sstream>
#include <fstream>
//
// description of a sudoku board, with functions for setting cells and propagating constraints
//
Board::Board(const string &fileOrPuzzleString, bool fromFile)
{
string puzzleStrin... | 21.738824 | 119 | 0.625392 | [
"vector"
] |
5569ba91d6192b8cd9e991b309a131d7b7685be6 | 4,619 | cc | C++ | ai/DeepCoder/docker/DeepCoder/test/find-program-test.cc | quanpan302/test | 313c6e310be0ef608543c23bd52a5466047cd378 | [
"Apache-2.0"
] | null | null | null | ai/DeepCoder/docker/DeepCoder/test/find-program-test.cc | quanpan302/test | 313c6e310be0ef608543c23bd52a5466047cd378 | [
"Apache-2.0"
] | null | null | null | ai/DeepCoder/docker/DeepCoder/test/find-program-test.cc | quanpan302/test | 313c6e310be0ef608543c23bd52a5466047cd378 | [
"Apache-2.0"
] | null | null | null | #include <gtest/gtest.h>
#include "find-program.h"
using namespace std;
using namespace dsl;
TEST(DfsTest, FindProgramTest1) {
vector<Example> examples = {
{{Value({2, 1, 5})}, Value(1)},
{{Value({-1, 1, 5})}, Value(-1)}
};
Attribute attr({Statement(0, Function::ReadList, {}), Sta... | 39.478632 | 97 | 0.564841 | [
"vector"
] |
556d88f7f7a31a42df5f823601a1fdcc3fbbe544 | 2,058 | cc | C++ | nipah/readdata.cc | sarabjeet29/Nipah | cc198157f8727bf79224ea679c98672b140b786c | [
"MIT"
] | null | null | null | nipah/readdata.cc | sarabjeet29/Nipah | cc198157f8727bf79224ea679c98672b140b786c | [
"MIT"
] | null | null | null | nipah/readdata.cc | sarabjeet29/Nipah | cc198157f8727bf79224ea679c98672b140b786c | [
"MIT"
] | null | null | null | #include "readdata.h"
void read_cached_Gxy(double alpha, double nu, int M, int N, vector<cdouble>& Gxy)
{
ostringstream dirStringStream, fileStringStream;
ifstream inputFile;
const char * filepath;
const char * dirpath;
string line;
double realval, imagval;
dirStringStream << "./results/al... | 32.666667 | 156 | 0.592323 | [
"vector"
] |
535c7ba30495fe00afd3b652822e3aae568e496b | 1,639 | cpp | C++ | server/sources/bullet.cpp | Lukasz98/2D-Shooter-LAN-Game | 714e25494e92359982bcfa71a31be3254ff256ce | [
"MIT"
] | 5 | 2018-01-20T19:04:53.000Z | 2020-04-09T09:35:02.000Z | server/sources/bullet.cpp | Lukasz98/Sfml-Test | 714e25494e92359982bcfa71a31be3254ff256ce | [
"MIT"
] | null | null | null | server/sources/bullet.cpp | Lukasz98/Sfml-Test | 714e25494e92359982bcfa71a31be3254ff256ce | [
"MIT"
] | null | null | null | #include "../headers/bullet.h"
Bullet::Bullet(sf::Vector2f pos, sf::Vector2f speedRatio, int ownerId, int bulletId)
{
position = pos;
this->ownerId = ownerId;
this->bulletId = bulletId;
speed = 1000.0f;
power = 2.0f;
this->speedRatio = speedRatio;
size = sf::Vector2f(7.0f, 7.0f)... | 21.285714 | 85 | 0.574741 | [
"object"
] |
53656f8fc4139bd6d778c2db39361cd41c329570 | 2,560 | cpp | C++ | algo-0126.cpp | jasson15/leetcode-cpp | f20efb521d7cc8405e83c95faf4d45fba2f6d93c | [
"MIT"
] | null | null | null | algo-0126.cpp | jasson15/leetcode-cpp | f20efb521d7cc8405e83c95faf4d45fba2f6d93c | [
"MIT"
] | null | null | null | algo-0126.cpp | jasson15/leetcode-cpp | f20efb521d7cc8405e83c95faf4d45fba2f6d93c | [
"MIT"
] | null | null | null | class Solution {
public:
int findShortestPath(string& beginWord, string& endWord, unordered_set<string>& dict,
unordered_map<string, vector<string>>& graph) {
int ret = 2, wlen = beginWord.size();
dict.erase(beginWord); dict.erase(endWord);
unordered_set<string> head = { beginWord },... | 38.208955 | 146 | 0.448047 | [
"vector"
] |
536663c371d7f0b1528844a66feb110510c9db07 | 270 | cpp | C++ | Cpp_primer_5th/code_part3/prog3_36.cpp | Links789/Cpp_primer_5th | 18a60b75c358a79fdf006f8cb978c9be6e6aedd5 | [
"MIT"
] | null | null | null | Cpp_primer_5th/code_part3/prog3_36.cpp | Links789/Cpp_primer_5th | 18a60b75c358a79fdf006f8cb978c9be6e6aedd5 | [
"MIT"
] | null | null | null | Cpp_primer_5th/code_part3/prog3_36.cpp | Links789/Cpp_primer_5th | 18a60b75c358a79fdf006f8cb978c9be6e6aedd5 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
int sc1[5] = {1,2,3,4,5};
int sc2[5] = {2,3,4,5,6};
for(int i = 0; i <5 ; i++){
if(sc1[i] == sc2[i])
cout << "y" << endl;
else
cout << "n" << endl;
}
return 0;
}
| 13.5 | 28 | 0.514815 | [
"vector"
] |
536a08c3ad5fb700d72c3ae54d1bbb304859d8c2 | 984 | cpp | C++ | MFC++/SourceCodes/Chapter7/LambdaExpression.cpp | CoodingPenguin/StudyMaterial | b6d8084fc38673ad6ffb54bc0bc60b2471168810 | [
"MIT"
] | 9 | 2019-02-21T20:20:25.000Z | 2020-04-14T15:18:59.000Z | MFC++/SourceCodes/Chapter7/LambdaExpression.cpp | CoodingPenguin/StudyMaterial | b6d8084fc38673ad6ffb54bc0bc60b2471168810 | [
"MIT"
] | null | null | null | MFC++/SourceCodes/Chapter7/LambdaExpression.cpp | CoodingPenguin/StudyMaterial | b6d8084fc38673ad6ffb54bc0bc60b2471168810 | [
"MIT"
] | 2 | 2019-07-09T02:01:37.000Z | 2020-01-07T18:45:25.000Z | /* Written by @nErumin (Github)
* 2017-01-03
*
* Topic - 람다 표현식의 형식을 살펴보자.
*/
#include <algorithm>
#include <numeric>
#include <vector>
#include <list>
#include <deque>
#include <string>
#include <iostream>
#include <forward_list>
using namespace std;
template <typename Iter, typename Value>
Iter findFirstBigge... | 19.294118 | 73 | 0.64126 | [
"vector"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.