blob_id stringlengths 40 40 | language stringclasses 1
value | repo_name stringlengths 5 117 | path stringlengths 3 268 | src_encoding stringclasses 34
values | length_bytes int64 6 4.23M | score float64 2.52 5.19 | int_score int64 3 5 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | text stringlengths 13 4.23M | download_success bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|
b8d5dd9be57bd0b04783bb80ea655fa507cf74ce | C++ | apache/openoffice | /main/comphelper/inc/comphelper/InlineContainer.hxx | UTF-8 | 3,650 | 2.625 | 3 | [
"Apache-2.0",
"CPL-1.0",
"bzip2-1.0.6",
"LicenseRef-scancode-other-permissive",
"Zlib",
"LZMA-exception",
"LGPL-2.0-or-later",
"LicenseRef-scancode-free-unknown",
"LicenseRef-scancode-philippe-de-muyter",
"OFL-1.1",
"LGPL-2.1-only",
"MPL-1.1",
"X11",
"LGPL-2.1-or-later",
"GPL-2.0-only",
... | permissive | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to y... | true |
aea3a605fbc5fdc7003d82e20d3d49bc52e7c64e | C++ | jeow9028/SummerProject | /sensor.c/test.c.ino | UTF-8 | 701 | 3.046875 | 3 | [] | no_license | /* Ultrasonic Sensor V3.3 test
* Created by Jean-Christophe Owens
* May 15th 2017
*/
//Defines the outpin to the Robot
const int x = 3;
const int y = 3;
// Global Variables
long duration;
int distance;
void setup() {
// Finds the pin of the suject and enters values for that specific port
pinMode(x, INPUT)... | true |
49a5a7f12b515359c50acd3f19d93a6b13c5cef1 | C++ | paaqwazi/algorithms | /competitive_programming/programming_contests/spoj_br/saldo13.cpp | UTF-8 | 297 | 2.96875 | 3 | [
"MIT"
] | permissive | // SALDO13
#include <iostream>
using namespace std;
int main() {
int n, s, menor_saldo, total, temp;
cin >> n;
cin >> s;
menor_saldo = s;
total = s;
while(n--) {
cin >> temp;
total += temp;
if (total < menor_saldo)
menor_saldo = total;
}
cout << menor_saldo;
return 0;
}
| true |
f0986d0e0f9c9d2b0294b628c63737581f99c7aa | C++ | TomasKimer/RetroSpace | /src/Color.h | UTF-8 | 4,047 | 2.984375 | 3 | [] | no_license | // +------------------------------------------------------------+
// | RetroSpace v1.0 |
// | Retrospektivni hra pro dva hrace s vesmirnou tematikou |
// | Bakalarska prace, FIT VUT v Brne, 2011 |
// +----------------------------------------------------... | true |
960d7564c76ded4ca9d09b7f840c8ef06bb6bc1e | C++ | wangtss/leetcodePractice | /source/108ConvertSortedArraytoBinarySearchTree.cpp | UTF-8 | 426 | 3.203125 | 3 | [] | no_license | TreeNode * helper_sortedArrayToBST(vector<int>& nums, int start, int end) {
if (start > end) return NULL;
int mid = (start + end) >> 1;
TreeNode *node = new TreeNode(nums[mid]);
node->left = helper_sortedArrayToBST(nums, start, mid - 1);
node->right = helper_sortedArrayToBST(nums, mid + 1, end);
return node;
}
Tr... | true |
5fbd70c7a6617ab2cf4ba767d61355d5eb8a9e3c | C++ | Cr4zySheep/Tankmania | /Core/CollisionManager.hpp | UTF-8 | 1,066 | 2.8125 | 3 | [] | no_license | #ifndef COLLISIONMANAGER_HPP_INCLUDED
#define COLLISIONMANAGER_HPP_INCLUDED
#include <SFML/Graphics.hpp>
#include <math.h>
typedef unsigned int uint;
struct Point {
float x;
float y;
Point()
{}
Point(sf::Vector2f pos) : x(pos.x), y(pos.y)
{}
//Distance euclidienne
static float dist... | true |
9029afb24d02c5b3f1aa57db1d57fce634edd436 | C++ | gurusarath1/Algorithms_2 | /LeetCode_Problems/Graph/Course_Schedule_II.cpp | UTF-8 | 1,414 | 2.796875 | 3 | [] | no_license | class Solution {
public:
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
vector<int> inDegrees(numCourses, 0);
map<int, vector<int>> graph;
vector<int> result;
for(vector<int> course_preqs : prerequisites) {
inDegrees[cou... | true |
ccde622ebabed90d1a4eb468d48bcfb77d16da99 | C++ | ZivDrukker/MagshiTrivia | /Server/server/Question.h | UTF-8 | 348 | 2.765625 | 3 | [] | no_license | #pragma once
#include <string>
#include <iostream>
using std::string;
class Question
{
public:
Question(int, string, string, string, string, string, int);
~Question();
string getQuestion();
string* getAnswers();
int getCorrectAnswerIndex();
int getId();
private:
string _question;
string* _answers;
int _corr... | true |
55d7f16a4d2b06f1b69e4094d1a077ffd5f1e59f | C++ | JSDupre/NeuroneVS | /main.cpp | UTF-8 | 2,450 | 2.84375 | 3 | [] | no_license | #include <iostream>
#include "Neurone.hpp"
#include <fstream>
#include <iomanip>
#include <vector>
#include "Connection.hpp"
using namespace std;
bool isInIntervalle(double ToTest,double Inf,double Sup){
bool x(ToTest>=Inf && ToTest<Sup);
return x;
}
void recordValue(Neurone const& n,double time,ofstream& out)
{
ou... | true |
52a76b442aa931f21698aebc94ad256e500b181f | C++ | Salomon-mtz/estructura-de-datos-agosto-diciembre-2021 | /ListaDeAdyacecnias/ListaDeAdyacencias.cpp | UTF-8 | 895 | 3.15625 | 3 | [] | no_license | #ifndef LISTA_DEFINED
#define LISTA_DEFINED
#include <list>
#include <iostream>
using namespace std;
class ListaDeAdyacencias{
private:
int numeroVertices;
list<int> *adyacencias;
public:
ListaDeAdyacencias(int numeroVertices){
this->numeroVertices=numeroVertices;
... | true |
c638f4a994c6d40ee94ca6f8b7551aebab982d15 | C++ | baptistemeunier/Tetris | /Source/AppEngine.cpp | UTF-8 | 1,120 | 3.0625 | 3 | [] | no_license | #include "AppEngine.h"
#include <iostream>
void AppEngine::init(std::string name) {
display.init(name);
}
void AppEngine::clean() {
display.clean();
for(int i=0; i < states.size(); i++){
states[i]->clean();
}
}
sf::RenderWindow* AppEngine::getWindow() {
return display.getWindow();
}
void ... | true |
f7fc8ef29cca8f1f39c7b4ff0b137591b6787c5b | C++ | Tanmay-Tiwari88/Snake | /Engine/snake.h | UTF-8 | 724 | 2.734375 | 3 | [] | no_license | #pragma once
#include "board.h"
#include "location.h"
#include"fruit.h"
class snake {
private:
class segment
{
private:
location l;
Color c;
public:
void inithead(location& l);
void initsegment();
void follow(segment &segnext);
void movebydelta(location delta);
bool comp(segment seg1, segment seg2);
... | true |
8a4963c189d4385976241faf95785668f953e531 | C++ | kabrate/lanqiao | /homework/radix.cpp | GB18030 | 725 | 2.796875 | 3 | [] | no_license | #include<cstdio>
using namespace std;
long a;
int p,c,m=0,s[100];
void trans()
{
while (a!=0)//תs[m]
{
c=a%16;
a=a/16;
m++;s[m]=c; //˳s[m]
}
for(int k=m;k>=1;k--)//ת
{
if(s[k]>=10) //ΪʮƵӦĸ
//cout<<(char)(s[k]+55);
printf... | true |
7f44ddd6de86e3a4e6165b9f395b8074a518ff9e | C++ | uneap/algorithm | /2020/200104.cpp | UTF-8 | 433 | 2.921875 | 3 | [] | no_license | #include <string>
#include <vector>
#include <unordered_map>
using namespace std;
int solution(vector<vector<string>> clothes) {
int answer = 1;
unordered_map<string, int> clothMap;
for (int i = 0; i < clothes.size(); i++)
clothMap[clothes[i][1]]++;
for (unordered_map<string, int> ::iterator clothIter = cloth... | true |
cb84777d34fec855522c422c2a07eaa5a925f508 | C++ | rjtsdl/CPlusPlus | /Interview Play CPP/a527WordAbbreviation.cpp | UTF-8 | 2,009 | 3.265625 | 3 | [] | no_license | //
// a527WordAbbreviation.cpp
// Interview Play CPP
//
// Created by Jingtao Ren on 9/20/20.
// Copyright © 2020 Jingtao Ren. All rights reserved.
//
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
struct Trie
{
Trie() : children(26, shared_ptr<Trie>())
{
}
void ... | true |
56231d934ccdcfe7265a6a843b7640ee73daaba7 | C++ | plinx/CodePractices | /CppPrimer/Unit5/E520/E520/Source.cpp | UTF-8 | 351 | 3.046875 | 3 | [] | no_license | #include <iostream>
#include <string>
using std::string;
using std::cin;
using std::cout;
using std::endl;
int main()
{
string str, tmp;
int dflag = 1;
while (cin >> str) {
if (tmp == str) {
cout << "str " << str << " appear twice." << endl;
dflag = 0;
}
tmp = str;
}
if (dflag) cout << "no str appear... | true |
4c8248519e2f093e8331428f5a45288d2de849eb | C++ | pritikmshaw/Algorithms | /cpp/longest_increasing_subsequence.cpp | UTF-8 | 545 | 2.875 | 3 | [] | no_license | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, i, j;
cin >> n;
vector <int> arr(n), lis(n);
for(i=0;i<n;i++)
{
cin >> arr[i];
}
for(i=0;i<n;i++)
{
lis[i] = 1;
}
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
... | true |
2e41f4eb44f873d92042188df3477ee27e03dca1 | C++ | kenanking/CS106BHW | /7Trailblazer/src/trailblazer.cpp | UTF-8 | 2,414 | 2.59375 | 3 | [] | no_license | // This is the CPP file you will edit and turn in.
// Also remove these comments here and add your own, along with
// comments on every function and on complex code sections.
// TODO: write comment header for this file; remove this comment
#include "trailblazer.h"
// TODO: include any other headers you need; remove th... | true |
8f1782489a222081b1238926998085e08fc291de | C++ | orbulant/Hardware-Store-DAS | /modules/ProductController.cpp | UTF-8 | 9,147 | 2.890625 | 3 | [
"MIT"
] | permissive | #include "Product.h"
#include "LinkedList.h"
#include "Utils.h"
#include "ProductController.h"
// CONSTRUCTOR
ProductController::ProductController(InputHelper inputHelper) {
setInputHelper(inputHelper);
}
// SETTERS
void ProductController::setInputHelper(InputHelper inputHelper) {
this->inputHelpe... | true |
c26c46ea571963e02b9079d4a2f9707aafbfaa7b | C++ | heboyuan/BruinNav | /BruinNav/main.cpp | UTF-8 | 2,453 | 2.953125 | 3 | [] | no_license | #include"provided.h"
#include<iostream>
using namespace std;
int main()
{
cout << "Loading the map..." << endl <<endl;
Navigator Nav;
Nav.loadMapData("mapdata.txt");
vector<NavSegment> directions;
cout << "instructions===================================================" << endl
<< "Map data is in mapdata.txt"... | true |
3dbb11db4b926df685469a0000540bf41857e4cf | C++ | attugit/archie | /include/archie/fused/fold.hpp | UTF-8 | 2,949 | 2.890625 | 3 | [
"MIT"
] | permissive | #pragma once
#include <utility>
#include <archie/meta/static_constexpr_storage.hpp>
#include <archie/fused/static_if.hpp>
#include <archie/boolean.hpp>
namespace archie::fused
{
namespace detail
{
struct fold_ {
template <typename F, typename S, typename... Xs>
constexpr decltype(auto) operator()(... | true |
b86a15ad76ffa8c2ec6e01934e3fef3b62470633 | C++ | ondal1997/online-game-demo-of-my-component-game-engine | /main/참고용.cpp | UTF-8 | 15,565 | 2.671875 | 3 | [] | no_license | #include "engine.h"
class Direction : public Component
{
public:
Direction(int value = 1) : value(value)
{
}
int value;
};
class Position : public Component
{
public:
Position(float x = 0.0f, float y = 0.0f) : x(x), y(y)
{
}
float x;
float y;
};
class Velocity : public Component
{
public:
Velocity(float ... | true |
678d65d023c75a5604e1801a53df1274520c1166 | C++ | c0untzer0/CppClasses | /CppBasics/ch01/ch01w01.cpp | UTF-8 | 268 | 2.609375 | 3 | [] | no_license | //
// Created by pjcabrer on 8/19/15.
//
#include "ch01w01.h"
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int x = 5;
int y = 7;
std::cout << "\n";
std::cout << x + y << " " << x * y;
std::cout << "\n";
return 0;
} | true |
f10c6ad0566e09cdfd6569741ec2c075dcbd834c | C++ | Relickus/Chess2016 | /CQueen.h | UTF-8 | 943 | 3.015625 | 3 | [] | no_license | #ifndef CQUEEN_H
#define CQUEEN_H
#include "CPiece.h"
#include "COLOR.h"
/**
* Class representing queen piece
*/
class CQueen : public CPiece {
public:
CQueen();
/**
* Initiates a queen with given parameters
* @param color A color of the queen
* @param row A row of the queen on a chessboa... | true |
5684097dcf728933d3008049a1af0554df955982 | C++ | sork777/PortFolio | /Framework/Viewer/Camera.cpp | UHC | 2,117 | 3.046875 | 3 | [] | no_license | #include "Framework.h"
#include "Camera.h"
Camera::Camera()
:position(0, 0, 0)
, up(0, 1, 0), right(1, 0, 0), forward(0, 0, 1)
, rotation(0, 0, 0)
{
// ̼ 켱?
D3DXMatrixIdentity(&matRotation);
D3DXMatrixIdentity(&matView);
Rotation();
Move();
}
Camera::~Camera()
{
}
void Camera::Position(float x, float y... | true |
2e0e5c8062451b03a6015fac5f74213d8a819283 | C++ | LDEchoTeam/ld38 | /Projects/PestControl/Source/PestControl/PestBase.cpp | UTF-8 | 1,616 | 2.578125 | 3 | [
"MIT"
] | permissive | // Copyright Echo Team 2017
#include "PestControl.h"
#include "PestBase.h"
// Sets default values
APestBase::APestBase()
{
// Set this actor to call Tick() every frame. You can turn this off to improve performance if you don't need it.
PrimaryActorTick.bCanEverTick = true;
}
// Called when the game starts or w... | true |
7fb01f894d3f0638e7285cae851072d219bc5308 | C++ | stuhops/cs5500-hw9-rotate-puzzle | /main.cpp | UTF-8 | 10,175 | 2.78125 | 3 | [] | no_license | /* Project 1 Rotation Puzzle.cpp : Defines the entry point for the console application.
*
* Author: Stuart Hopkins (A02080107)
* Last updated: 1/24/2018
*/
#include <mpi.h>
#include <iostream>
#include <string>
#include <vector>
#include "Board.h"
#include "Board.cpp"
using namespace std;
#define MCW MPI_COMM_WO... | true |
9adeef20699848b2c72947fa5326d1762d6f6a36 | C++ | Suhailkhn/Leetcode | /Easy/CountPrimes/main.cpp | UTF-8 | 594 | 3.078125 | 3 | [] | no_license | #include <stdio.h>
class Solution {
public:
int countPrimes(int n) {
std::vector<bool> isPrime(n + 1, true);
for(long i = 2; i < n; ++i) {
if(i != 2 && i % 2 == 0)
continue;
for(long j = i*i; j <= n; j += i) {
isPrime[j] = false;
... | true |
448edb2d53739bd3e4430eff21c6ecd316247022 | C++ | TIYASARIT/Basic-C- | /Pointers_1/main.cpp | UTF-8 | 456 | 3.453125 | 3 | [] | no_license | #include <iostream>
using namespace std;
int main()
{
int *pt, var1;
var1 = 10;
pt = &var1;
cout << "Address of var1 = " << &var1 << endl;
cout << "The value of pointer variable = " << pt<< endl; /* You have already declared pointer variable ,
just the pointer variable will indic... | true |
eee23d9e93236af67caa2c86ef08c9bab87afd27 | C++ | kosekitau/aizu | /1_4_d.cpp | UTF-8 | 351 | 2.78125 | 3 | [] | no_license | #include <iostream>
#include <cstdio>
int main(){
int n,tmp;
int min=1000000;
int max=-1000000;
long long sum=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d", &tmp);
sum+=tmp;
if(min > tmp) min=tmp;
if(max < tmp) max=tmp;
}
std::cout <<min<<' '<<max<<... | true |
64a3fbde882ab7bb856716a5ed2c33083cb366ea | C++ | GiovanniDicanio/ReadStringsFromRegistry | /ReadStringFromRegistry/RegistryReadString.cpp | UTF-8 | 2,732 | 2.890625 | 3 | [
"MIT"
] | permissive | ////////////////////////////////////////////////////////////////////////////////
//
// FILE: RegistryReadString.cpp
//
// DESC: Implementation of the RegistryGetString() function
//
// Copyright (C) by Giovanni Dicanio. All Rights Reserved.
//
////////////////////////////////////////////////////////////////////... | true |
2d8c57a714dda28ffbc0a1bf776e0d6032c40acb | C++ | billpwchan/COMP-2012-Programs | /adt-program/Program/btree.h | UTF-8 | 709 | 3.65625 | 4 | [] | no_license | #include <iostream> /* File: btree.h */
using namespace std;
template <typename T>
class btree
{
private:
struct btree_node // A node in a binary tree
{
T data;
btree_node* left; // Left sub-tree or called left child
btree_node* right; // Right sub-tree or called right chi... | true |
eecddd8df42294f76c093da5698f3bbf26a67b87 | C++ | Ahtisham-Shakir/DS_With_CPP | /Strings/Length.cpp | UTF-8 | 378 | 3.671875 | 4 | [
"MIT"
] | permissive | #include <iostream>
using namespace std;
class temp
{
private:
char str[20], i;
public:
void in()
{
cout << "Enter String: ";
cin >> str;
}
int len()
{
for (i = 0; str[i] != '\0'; i++)
;
return i;
}
};
int main()
{
temp obj;
obj.in();
... | true |
88d7ecf20c5a0b71a1e35c384c627c624c1f37d7 | C++ | Thalesgm/Projeto_les_v1.0 | /drive_les_v1.cpp | UTF-8 | 975 | 2.90625 | 3 | [] | no_license | // Para compilar: g++ -Wall -pedantic drive_les_v1.cpp les_v1.cpp -o drive_les_v1
#include "les_v1.h"
#include <iostream>
using std::cout;
int main ( void ) {
SNPtr pHead = NULL;// nullptr;
bool _empty = empty( pHead);
if(_empty){
cout << "Empty List\n";
}
else{
cout << "Not Empty List\... | true |
f20b0f26d7db99a9fa0df60b8410f153b8fdb5bc | C++ | asengsaragih/PBS-ASSESMENT-2 | /5/5.ino | UTF-8 | 3,439 | 2.71875 | 3 | [] | no_license | #include <Keypad.h>
const byte ROWS = 4; //four rows
const byte COLS = 3; //three columns
char keys[ROWS][COLS] = {
{'1', '2', '3'},
{'4', '5', '6'},
{'7', '8', '9'},
{'*', '0', '#'}
};
byte rowPins[ROWS] = {A1, A2, A3, A4}; //connect to the row pinouts of the keypad
byte colPins[COLS] = {11, 12, 13}; //connec... | true |
e780ad445964667b861eac131130b4aa81662cd2 | C++ | lijingpeng/ac | /icpcscore_p3325.cc | UTF-8 | 408 | 2.84375 | 3 | [] | no_license | #include <iostream>
using namespace std;
int main()
{
int n;
while(cin >> n && n)
{
int min = 2000, max = 0, t, sum = 0;
for(int i = 0; i < n; i++)
{
cin >> t;
if(t > max)
max = t;
if(t < min)
min = t;
sum += ... | true |
89afe102754401f7069e6c495976d3d33185ec96 | C++ | dickynovanto1103/CP | /Online Judges/SPOJ/Graph/LCA/lca.cpp | UTF-8 | 5,022 | 2.671875 | 3 | [] | no_license | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define unvisited -1
#define visited 1
#define eps 1e-9
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int maxn = 100010;
vector<vi> AdjList;
int L[2*maxn], H[2*maxn], E[2*... | true |
2dad6498ed08254897ddaaa8964cc236c9e92dca | C++ | monkeydminh49/JackAdventure | /JackAdventure/Sources/GameObjects/Animation2.cpp | UTF-8 | 968 | 2.609375 | 3 | [] | no_license | #include "Animation2.h"
Animation2::Animation2(sf::Texture& texture, sf::Vector2i frameNum, float frameTime, int frameTotals): Animation(texture,frameNum,frameTime)
{
m_frameTotals = frameTotals;
m_currentFrameCount = 0;
this->setScale(-1, 1);
}
void Animation2::Update(float deltaTime)
{
if ((m_currentFrame.x == ... | true |
27e86fb7581632372c6b26e2545e7c356be2d0d6 | C++ | leodelmas/csia_car_park | /project/src/model/Seller.h | UTF-8 | 586 | 2.859375 | 3 | [] | no_license | ///////////////////////////////////////////////////////////
// Author: Sorlin Sylvain
// Class: Seller
// Brief: Header file
///////////////////////////////////////////////////////////
#pragma once
#include <string>
class Seller
{
public:
Seller();
~Seller();
//Id
int& getId();
void setId(int... | true |
2a0df54112e135d64af6e5f2ae9e73198146928b | C++ | Alakia/Retinax | /retinex.cpp | GB18030 | 11,837 | 2.671875 | 3 | [] | no_license |
#include"stdafx.h"
#include "retinex.h"
#include <opencv2\core\core.hpp>
#include <opencv2\opencv.hpp>
#include <opencv2\highgui\highgui.hpp>
#include <imgproc\imgproc_c.h>
#include <imgproc\imgproc.hpp>
#include <math.h>
using namespace cv;
#define USE_EXACT_SIGMA
#define pc(image, x, y, c) image->ima... | true |
62af90b916b6b37e97b2460b2e78326610b3716e | C++ | herox25000/oathx-ogrex-editor | /YouLe/You_系统模块/系统模块/辅助工具/机器人添加/Include/DataStorage.h | GB18030 | 1,669 | 2.71875 | 3 | [] | no_license | #ifndef DATA_STORAGE_HEAD_FILE
#define DATA_STORAGE_HEAD_FILE
#include "ComService.h"
#pragma once
//////////////////////////////////////////////////////////////////////////
//ṹ嶨
//ݶͷ
struct tagDataHead
{
WORD wDataSize; //ݴС
WORD wIdentifier; //ͱʶ
DWORD dwInsertTime; ... | true |
c7ee7e02f6d842467057169221255972e7eb0468 | C++ | 53730512/chess_server | /server_changsha/src/majhong/hongzhong/zhong_algo.h | UTF-8 | 2,969 | 2.515625 | 3 | [] | no_license |
#ifndef __MJ_ZHONG_H_
#define __MJ_ZHONG_H_
////////////////////////////////////////////////////////////////////////////////
#include "../base/algo_base.h"
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////... | true |
a45a33604d7f02d61b550ad2ae411891fb730598 | C++ | capacitypp/GLCraft | /BlockWood.cpp | UTF-8 | 1,419 | 2.65625 | 3 | [] | no_license | #include "BlockWood.h"
#include "DisplayListManager.h"
#include "TextureManager.h"
#include <GL/glut.h>
using namespace std;
void BlockWood::readTextures(void)
{
texture1 = Image("texture/block/blockWood1.ppm");
texture2 = Image("texture/block/blockWood2.ppm");
}
void BlockWood::registerTextures(void)
{
textureI... | true |
cd0a35462e581e09534f4ae9ac8b3dd7242ef2b7 | C++ | Ahiganbana/leetcode | /spiralOrder.cpp | UTF-8 | 1,150 | 3.0625 | 3 | [] | no_license | #include <iostream>
#include <vector>
using namespace std;
//螺旋顺时针输出二维数组
class Solution {
static constexpr int directions[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> result;
int row = matrix.size();
if(row == 0)... | true |
84e61ff400840ffda84cbb0e7ec148481190cf15 | C++ | nicholasbishop/vadem | /src/color.h | UTF-8 | 1,351 | 2.890625 | 3 | [] | no_license | // Copyright 2017 Neverware
#ifndef COLOR_H_
#define COLOR_H_
#include "png.hpp"
#include "util.h"
namespace vadem {
// Adapted from "YCbCr and YCCK Color Models",
// https://software.intel.com/en-us/node/503873
class YCbCr {
public:
using T = float;
YCbCr() : Y(0), Cb(0), Cr(0) {}
YCbCr(const T Y, const T... | true |
474bf6206119b6af3b83bf38ffa9e6db8a00f246 | C++ | maxFullmer/MARIMBA | /Buoys/Desktop/DAQ_Sampler/libgps-master/src/nmea.c | UTF-8 | 2,833 | 2.84375 | 3 | [
"MIT"
] | permissive | #include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <string.h>
#include <math.h>
#include "nmea.h"
void nmea_parse_gpgga(char *nmea, gpgga_t *loc)
{
char *p = nmea;
p = strchr(p, ',')+1; //skip time
p = strchr(p, ',')+1;
loc->latitude = atof(p);
p = strchr(p, ',')+1;
switc... | true |
77377b8d1e19c03f5e3549fdf5c0568e22a0e701 | C++ | hyongti/42cursus | /CppModule/03/ex04/main.cpp | UTF-8 | 1,325 | 2.859375 | 3 | [] | no_license | #include "FragTrap.hpp"
#include "ScavTrap.hpp"
#include "NinjaTrap.hpp"
#include "SuperTrap.hpp"
int main(void)
{
SuperTrap anonymous;
std::cout<<"============================\n";
SuperTrap hyeonkim("hyeonkim");
SuperTrap hyopark("hyopark");
SuperTrap kilee1("kilee");
SuperTrap kilee2(kilee1);
std::cout<<"==... | true |
65e72df65ede0f099b7571240d3d36507f0e8b27 | C++ | ckjeter/ADA2019 | /hw2/prob4.cpp | UTF-8 | 6,127 | 3.03125 | 3 | [] | no_license | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
int N;
void printvec(vector<int>& v)
{
for (int i = 0; i < v.size(); i++) {
cout<<v[i]<<" ";
}
cout<<endl;
}
int bsearch(int left, int right, int value, const vector<int>& v)
{
/*
if (left > right... | true |
0861aadeddc5467b44dd76c413c64a6db06a5763 | C++ | chauhan0707/CodingPractice | /Vectors3.cpp | UTF-8 | 167 | 2.875 | 3 | [] | no_license | #include<iostream>
#include<vector>
using namespace std;
int main()
{
vector<int> v{10,20,30,40,50};
for(auto x:v)
{
cout<<x<<" ";
}
return 0;
}
| true |
ff3d3fdc83db9d19014b2d7f4f191ebcc17846ff | C++ | tanvirtanjum/InfixToPostfix-Compiler_Design | /infix_to_postfix(17-35860-3).cpp | UTF-8 | 1,987 | 3.359375 | 3 | [] | no_license | ///SHOURAV, TANVIR TANJUM
///17-35860-3
///COMPILER DESIGN [A]
#include<iostream>
using namespace std;
char input[]="";
char *la=input;
void expr();
void exprP();
void term();
void termP();
void factor();
void match(char optr);
void expr()
{
term();
exprP();
}
void term()
{
factor();
termP();
}
v... | true |
59ec365b485cc4111bd23f87cd470fada67e025c | C++ | ehei1/pytempl | /unit_test/enumerate_test.cpp | UTF-8 | 1,694 | 2.84375 | 3 | [] | no_license | #include "stdafx.h"
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <vector>
#include "CppUnitTest.h"
#include "pytempl\enumerate.h"
#include "pytempl\zip.h"
using namespace Microsoft::VisualStudio::CppUnitTestFramework;
namespace test
{
TEST_CLASS( EnumerateTest )
{
publ... | true |
55b81236479619639125f240f4e079bf4711d22f | C++ | madhok/Craftsmanship | /Strings/EditDistance.cpp | UTF-8 | 1,110 | 3.609375 | 4 | [] | no_license | // Dynamic Programming implementation of edit distance
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
// Change these strings to test the program
#define STRING_X "SUNDAY"
#define STRING_Y "SATURDAY"
// Recursive implementation
inline
int min(int a, int b) {
return a < b ? a : b;
}
// Returns Minimum amo... | true |
26d0d38556ddd77390638617eb0e6b7288483789 | C++ | xGreat/CppNotes | /src/algorithms/data_structures/nodes_deep_copy.hpp | UTF-8 | 1,029 | 3.5625 | 4 | [
"MIT"
] | permissive | #ifndef NODES_DEEP_COPY_HPP_
#define NODES_DEEP_COPY_HPP_
// Write a method that takes a pointer to a Node structure as a parameter and
// returns a complete copy of the passed in data structure. The Node data
// structure contains two pointers to other Nodes.
namespace Algo::DS {
class Node {
public:
Node(const... | true |
b1bcab7405d1532494e281d160655fa1d5f2c0a1 | C++ | saeedutsha/Fuzzy-System | /FuzzySystem/main.cpp | UTF-8 | 3,823 | 3.515625 | 4 | [] | no_license | #include <iostream>
using namespace std;
int main()
{
double attendance,ttime;
/**< Two inputs */
cout<<"Total attendance in class(%) : ";
cin>>attendance;
cout<<"Total time in class(%) : ";
cin>>ttime;
/**< Fuzzification of total time in class */
/**< Let's ass... | true |
91fb7bf47370e152f1be2bd6d0646f5524e4a57c | C++ | Aryan5744/DSA_Programs | /4.Searching_Sorting_90_124/94_Middle.cpp | UTF-8 | 328 | 3 | 3 | [] | no_license | #include<bits/stdc++.h>
using namespace std;
int min(int A, int B){return A > B ? B : A;}
int max(int A, int B){return A > B ? A : B;}
int middle(int A, int B, int C){
return max(min(A,B),min(B,C));
}
// Driver program
int main()
{
int A,B,C;
cin >> A >> B >> C;
cout << middle(A,B,C) << endl;
return... | true |
af64650042a643f26e99fdc8d2ed6a3d24765713 | C++ | lazytiger/apib | /apib/status.cc | UTF-8 | 1,625 | 2.796875 | 3 | [
"Apache-2.0"
] | permissive | /*
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.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
dis... | true |
309950f1bf7c709eeeef5bdb9a2014dfc4563a4e | C++ | matprophet/dungeonbuilder | /DungeonBuilderC/headers/dungeon_data.h | UTF-8 | 2,347 | 2.859375 | 3 | [
"MIT"
] | permissive | #ifndef DUNGEON_DATA
#define DUNGEON_DATA
#include <string>
#include <vector>
using namespace std;
struct DungeonExit;
struct DungeonObject;
struct DungeonCreature;
struct DungeonRoom;
struct DungeonPlayer;
struct DungeonAction;
extern vector<DungeonRoom*> g_roomList;
struct DungeonEntity
{
private:
vector ... | true |
c338d56eb037df789af6a8844feadd6757d15f22 | C++ | ffaawgh/University | /OOP/2/Vector.hpp | UTF-8 | 6,620 | 3.234375 | 3 | [
"Unlicense"
] | permissive | //
// Created by ed on 18.04.17.
//
#ifndef LAB2_VECTOR_HPP
#define LAB2_VECTOR_HPP
#include <ostream>
#include <iomanip>
#include <initializer_list>
#include "BaseVector.hpp"
#include "Iterator.hpp"
#include "Errors.hpp"
template<class T>
class Vector : public BaseVector {
public:
Vector() = default;
Vector(c... | true |
1387313ea4b05fcb58e61833d2507d6991fb1f03 | C++ | gyokkoo/SDA-FMI-2018 | /Data-Structures/Dynamic-Array-Example/main.cpp | UTF-8 | 602 | 3.34375 | 3 | [] | no_license | #include <iostream>
#include "DynamicArray.h"
int main()
{
DynamicArray myArray;
const int COUNT = 10;
for (int i = 0; i < COUNT; i++)
{
myArray.add(i);
}
for (size_t i = 0; i < myArray.getLength(); i++)
{
myArray[i] = myArray[i] * 10;
}
myArray.print();
std::cout << "\n";
cons... | true |
2b6dcf261a91d05c1ee9bcf4da110bfa82a58f5a | C++ | BlenderCN-Org/3dPrintRef | /raytracingDraw/SORT/src/accel/octree.h | UTF-8 | 5,107 | 2.875 | 3 | [] | no_license | /*
This file is a part of SORT(Simple Open Ray Tracing), an open-source cross
platform physically based renderer.
Copyright (c) 2011-2018 by Cao Jiayin - All rights reserved.
SORT is a free software written for educational purpose. Anyone can distribute
or modify it under the the terms of the GN... | true |
20e27f86bc6b10a17e91c303637b9d54c796c4b0 | C++ | Raboni/SummonEngine | /SummonEngine/Script/NodeInstance.h | UTF-8 | 1,738 | 2.640625 | 3 | [
"MIT"
] | permissive | #pragma once
#include "NodeScript.h"
#include "NodeConnection.h"
#include <OpaqueDictionary.hpp>
#include <vector>
#include <string>
#include <any>
class NodeInstance
{
public:
NodeInstance();
NodeInstance(NodeScript* aNodeScript);
~NodeInstance();
void Run();
void Run(const std::vector<std::any>& aArguments);
... | true |
178f7fb9fbad5069d41dd1f57ffa9d6a007d1795 | C++ | lam267/BenhVien | /BenhVien/DateTime.cpp | UTF-8 | 1,667 | 3.203125 | 3 | [] | no_license | #pragma once
#include <iostream>
#include <ctime>
#include <vector>
using namespace std;
class DateTime {
public:
int ngay, thang, nam;
int gio=0, phut=0, giay=0;
DateTime(){
}
DateTime(int _ngay, int _thang, int _nam){
ngay = _ngay;
thang = _thang;
nam = _nam;
}
DateTime (int _ngay, int _thang, int _n... | true |
cbe7d70e91308cda1eef5481518d47e9a55a49f9 | C++ | BoiseState/CS117-resources | /Chapter7_Objects_and_Classes/Student/Student.h | UTF-8 | 3,426 | 3.46875 | 3 | [] | no_license | //
// Created by DA on 12/31/2016.
//
#ifndef PERSON_STUDENT_H
#define PERSON_STUDENT_H
#include <iostream>
using namespace std;
class Student
{
public:
/*
Constructors...
Note: There is no default constructor for Student, it wouldn't make sense in
this implementation.
*/
Student(string fn... | true |
1e2d79d86ec22b50c9ae51710d7a7e62246bbddd | C++ | iskorotkov/kitchenware | /src/kitchen/electric_stove.h | UTF-8 | 435 | 2.78125 | 3 | [] | no_license | #pragma once
#include "stove.h"
namespace kitchen
{
class electric_stove : public stove
{
public:
using power_t = double;
electric_stove() = default;
void power(power_t p);
[[nodiscard]] power_t power() const;
void print(std::ostream& out, bool full_output = true)... | true |
4061d173edb0d8c0eca21b1bf62204120e84bd67 | C++ | anboqing/design_patter_practice | /Proxy/Test/Base.hpp | UTF-8 | 534 | 3.046875 | 3 | [] | no_license | #include <iostream>
using namespace std;
class Base{
public:
Base(){
cout << "Base constructor"<<endl;
}
virtual void func(){
cout << "Base virtual function"<<endl;
}
void function(){
cout << "Base common function " << endl;
}
};
class Extend:public Base{
public:
Ext... | true |
1c44bf91616ce0a8206fd3f21b91bbc3cd9e6076 | C++ | nickredmond/CSC190Nick_Redmond | /GameSkeleton/GameSolution/Engine/Debug.h | UTF-8 | 1,886 | 3.15625 | 3 | [] | no_license | #ifndef DEBUG_H
#define DEBUG_H
#include "Core.h"
#include "Matrix3.h"
#include <sstream>
using std::stringstream;
using std::ceil;
using std::floor;
namespace Debug{
float Debug_RoundValue(float val){
int normalized = (int)(val * 1000.0f);
return normalized / 1000.0f;
}
void DrawValue( Core::Graphics& grap... | true |
ead912d45776aeea4b8b603858ecef1ec40a9279 | C++ | brandonleitch/sudoku | /lib/Grid.h | UTF-8 | 375 | 2.5625 | 3 | [] | no_license | #ifndef GRID_H
#define GRID_H
#include <string>
class Grid {
private:
std::string puzzle;
std::string solution;
char grid[9][9];
bool check_cell(int row, int col);
public:
Grid(std::string p, std::string s);
void init();
void set(int row, int col, char num);
int get(int row, int col);
bool is_puzz... | true |
97c25398904e1aca6c73d8eaf9e7aea01b54a630 | C++ | wusiyan11/CC3K | /a5/game.h | UTF-8 | 691 | 2.609375 | 3 | [] | no_license | #ifndef __GAME_H__
#define __GAME_H__
#include <iostream>
#include <string>
class Cell;
class TextDisplay;
class Chamber;
class GameObject;
using namespace std;
class Game {
int player_count;
int stair_count[5],potion_count[5],gold_count[5],enemy_count[5];
Cell*** grid;
int floorlevel;
TextDisplay* display;... | true |
373fb63dcba93af1c53ea9ee8610ab68c7343d0c | C++ | lingqtan/myLeetcode | /1Array/283. Move Zeroes.cpp | UTF-8 | 1,408 | 2.71875 | 3 | [
"Apache-2.0"
] | permissive | class Solution {
public:
void moveZeroes(vector<int>& nums) {
// // slow version (16ms, 12.13%)
// int cur_pos = 0, i = 0;
// while (cur_pos < nums.size() && i < nums.size()) {
// while (nums[cur_pos] != 0 && cur_pos < nums.size()) cur_pos++;
// i = cur_pos;
/... | true |
925bae6e3e5a29a92008e9f36d320e22b544bc37 | C++ | andylinpersonal/OpenCG3 | /src/main.cpp | UTF-8 | 1,040 | 2.8125 | 3 | [] | no_license | #include "main.hpp"
using namespace std;
using namespace OpenCG3;
int main(int argc, char** argv)
{
// parse some args...
int arg;
string icon_filename;
while ((arg = getopt(argc, argv, "h")) != -1) {
switch (arg)
{
case 'h':
puts("\nSimple 3D Viewer\nMade by KVD the PIG and ADL the sweet potato in 2017\... | true |
0785ab7c378e6cf7176ead78fff462a3b6170d39 | C++ | vinith-123/datastructures | /stacks/reverse with recur.cpp | UTF-8 | 1,200 | 3.53125 | 4 | [] | no_license | #include<iostream>
using namespace std;
struct stack{
int size;
int top;
int elements[50];
};
bool isfull(stack &s)
{
if(s.top==s.size-1)
return true;
else
return false;
}
bool isempty(stack &s)
{
if(s.top==-1)
return true;
else
return false;
}
void push(stack &s,int x)
{
if(isfull(s)... | true |
9636fb405e16d59c1c8ab72b1fb88778d67cf367 | C++ | enzohorquin/SAT | /FormulaProposicional.h | UTF-8 | 925 | 2.65625 | 3 | [] | no_license | #ifndef FORMULAPROPOSICIONAL_H
#define FORMULAPROPOSICIONAL_H
#include "Clausula.h"
class FormulaProposicional
{
public:
FormulaProposicional();
FormulaProposicional(const FormulaProposicional & c);
void operator= (const FormulaProposicional & c);
void agregarClausula(const Clausula & c);
Clausula ... | true |
b8ab16c9a0618afa7dcc07c037694938c2fb7be3 | C++ | Raghav-Bajaj/HacktoberFest-2 | /cpp/circular_linked_list.cpp | UTF-8 | 2,503 | 3.828125 | 4 | [] | no_license | #include <stdio.h>
#include <stdlib.h>
struct node {
int num;
struct node * nextptr;
}*stnode;
void ClListcreation(int n);
void ClLinsertNodeAtBeginning(int num);
void displayClList(int a);
int main()
{
int n,num1,a;
stnode = NULL;
printf("\n\n Circular Linked List : Insert a node at the beginning of a c... | true |
60c979556b2a15d1e33a134cb23d919ec356bd77 | C++ | LaVestima/tcs-oop-ex2a | /mainwindow.cpp | UTF-8 | 4,122 | 2.875 | 3 | [] | no_license | #include "mainwindow.h"
#include "student.h"
#include "studentlist.h"
#include "ui_mainwindow.h"
MainWindow::MainWindow(QWidget *parent) : QMainWindow(parent), ui(new Ui::MainWindow) {
ui->setupUi(this);
student = new Student;
studentList = new StudentList;
}
MainWindow::~MainWindow() {
delete ui;
}
... | true |
ec02e083cdd1e34c050e9c838ee65c8004fbf04a | C++ | Linzecong/My-ACM-Code | /HDU/1864/10395699_AC_421ms_13280kB.cpp | UTF-8 | 1,464 | 2.53125 | 3 | [] | no_license | #include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int dp[3000050];//由于每张发票不超过1000，最多30张，扩大100倍数后开这么大即可
int main()
{
char ch;
double x,y;
int sum,a,b,c,money[35],v;
int t,i,j,k;
while(~scanf("%lf%d",&x,&t),t)
{
sum = (int)(x*1... | true |
c8010d2a6f03c5983c6e0cad3bf80115f958043e | C++ | shreysingla11/ssl-project | /Backend/Parser/submissions/Assignment 6/12.cpp | UTF-8 | 433 | 2.671875 | 3 | [] | no_license | #include<iostream>
#include<string>
using namespace std;
int main()
{
string A; int Count=0;
cin>>A;
int n=A.length();
double l;
for(l=1;l<n;l++)
{
for(double i=0.0;i<((n*1.0)/l);i++)
{
if(A.substr(i,l)==A.substr(i+l,l))
{
Count=Count+1;
cout<<l<<" "<<i<<e... | true |
926b1aaae7b67c6beed0a652b12f4e1eb57cb2da | C++ | alextac98/RBE-2001 | /Robot/Arm.h | UTF-8 | 651 | 2.59375 | 3 | [] | no_license | // Arm.h
#ifndef _ARM_h
#define _ARM_h
#include "Servo.h"
typedef enum {
down,
mid,
up
} armPos;
class Arm {
public:
Arm();
void armSetup();
void setArmPosition(armPos);
bool isArmPosition(armPos);
bool closeGripper();
bool openGripper();
int getArmPosition();
private:
Servo jxServo;
Servo gripper;
l... | true |
b20930db7e7d8286b69e8e1c5d55d617e4b9d105 | C++ | torresmateo/vector-racer | /source/draw/pathSection.hpp | UTF-8 | 4,226 | 3.484375 | 3 | [] | no_license | #ifndef PATH_SECTION_H
#define PATH_SECTION_H
//clase que reprsenta una sección del túnel
class PathSection {
//radio de la sección
float radius;
//número de segmentos que componen la sección
int numberOfSegments;
//posición inicial del centro de la sección
Vector3D positionIni;
//normal inicial... | true |
17913c9ee867e034396b56dc705c4da578eb669b | C++ | harshbhandari7/CPP | /Basic/stringReverse1.cpp | UTF-8 | 236 | 2.9375 | 3 | [] | no_license | #include<iostream>
int main(){
int n;
std::cin>>n;
char str[n];
gets(str);
std::cout<<"\n";
int i=sizeof(str)/sizeof(char);
std::cout<<i;
for(i-1;i>-1;i--){
std::cout<<str[i];
}
} | true |
a1e66a63d7a729c2738005458671d54d66f39016 | C++ | linsallyzhao/earlyobjects-exercises | /2015/chapter_13/examples/13_5.cpp | UTF-8 | 403 | 2.859375 | 3 | [] | no_license | #include <iostream>
#include <string>
#include <fstream>
int main()
{
std::fstream file;
std::string input;
file.open("murphy.txt", std::ios::in);
if (!file)
{
std::cout << "File open error! " << std::endl;
return 0;
}
file >> input;
while (!file.fail())
{
... | true |
3b3b585fd56e2707916bcb0bb475cc11a55d00ec | C++ | keitaroooo/atcoder-studying | /atcoder-regular-contest/114/A.cpp | UTF-8 | 2,274 | 3.078125 | 3 | [] | no_license | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
const vector<int> PRIME = {2, 3, 5, 7, 11, 13, 17, 19,
23, 29, 31, 37, 41, 43, 47};
const int PRIME_SIZE = PRIME.size();
ve... | true |
4ed98b60198e27e2438926ad4973a3f23bdc27a2 | C++ | opendarkeden/server | /src/server/gameserver/skill/Concealment.h | UTF-8 | 1,036 | 2.65625 | 3 | [] | no_license | //////////////////////////////////////////////////////////////////////////////
// Filename : Concealment.h
// Written By :
// Description :
//////////////////////////////////////////////////////////////////////////////
#ifndef __SKILL_CONCEALMENT_HANDLER_H__
#define __SKILL_CONCEALMENT_HANDLER_H__
#include "Sk... | true |
a817ab4bcefd0ad6fb53c6b4d9686c6bd0665c3d | C++ | atmikajoy/CodingPractice | /CodingPractice/main.cpp | UTF-8 | 562 | 2.71875 | 3 | [] | no_license | #include<iostream>
#include"leastLetterCount.h"
#include"arrEqual.h"
#include"eggDrop.h"
#include"wavesort.h"
int main()
{
std::cout<<"letter with least frequency = " <<
llc::low_letter_freq("geeksforgeeks")<<'\n';
std::cout << "The arrays are equal : " << std::boolalpha <<
arreq::are_arra... | true |
970b226e55ae2625e0ae7d55f1527b65d063d20d | C++ | icushman/tsp-heuristics | /heur2.cc | UTF-8 | 2,303 | 2.5625 | 3 | [] | no_license | #include <config.h>
#include "heur2.h" // class header file
#include <util/nainf.h> // provides na and inf functions
#include <cmath> // basic math operations
#include <iostream>
#include <typeinfo>
#include <algorithm>
#include <util/dim.h>
#include <util/logical.h>
using std::vector; // vector is used in the code... | true |
0a85d3946e51dddc1d80a1261cd11d8c8e6ea3e0 | C++ | AYOKINYA/CPP_MODULE | /CPP_MODULE_05/ex03/PresidentialPardonForm.cpp | UTF-8 | 1,731 | 2.546875 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* PresidentialPardonForm.cpp :+: :+: :+: ... | true |
fde77ac22fbdc04113becac905c4a71c66837e08 | C++ | PierrickLP/ObEngine | /src/Core/Script/ViliLuaBridge.cpp | UTF-8 | 3,917 | 2.625 | 3 | [
"MIT",
"BSD-2-Clause",
"Zlib"
] | permissive | #include <Script/ViliLuaBridge.hpp>
#include <Utils/StringUtils.hpp>
#include <Utils/VectorUtils.hpp>
#include <sol/sol.hpp>
namespace obe::Script::ViliLuaBridge
{
sol::lua_value viliToLua(vili::node& convert)
{
if (convert.is<vili::array>())
{
return viliArrayToLuaTable(convert);
... | true |
00240883fbbee4570c904ff995aaf32a7aec937f | C++ | Dreamgoing/MySTL | /Iterator.hpp | UTF-8 | 1,584 | 2.953125 | 3 | [] | no_license | //
// Created by 王若璇 on 17/5/7.
//
#ifndef MYSTL_ITERATOR_HPP
#define MYSTL_ITERATOR_HPP
#include <stddef.h>
///设计迭代器模式
///@brief 迭代器的设计与萃取实践
///@note
namespace MySTL{
///@brief iterator_category 根据移动特性与施行操作，迭代器被分为五类：
struct input_iterator_tag{};
struct output_iterator_tag{};
struct forward_iterat... | true |
64c856c23acd8f3097ebf0c531bfd5aa3fcc4c5c | C++ | SausageTaste/VulkanPractice | /apps/semaphore.h | UTF-8 | 1,961 | 2.59375 | 3 | [
"MIT"
] | permissive | #pragma once
#include <array>
#include <vector>
#include <utility>
#include <vulkan/vulkan.h>
#include "konst.h"
namespace dal {
class Semaphore {
private:
VkSemaphore m_handle = VK_NULL_HANDLE;
public:
void init(VkDevice device);
void destroy(VkDevice device);
auto ... | true |
9877f437aa84208c9d537812de63d9cc200dd467 | C++ | gbarne2/catanbaton | /Project2/player.h | UTF-8 | 2,410 | 2.625 | 3 | [] | no_license | #pragma once
#include <vector>
#include <algorithm>
#include <string>
#include <iostream>
#include <WinSock2.h>
#include <WS2tcpip.h>
#ifndef START_CARD_VALUES
#define START_CARD_VALUES
#define START_ORE 50
#define START_SHEEP 50
#define START_BRICK 50
#define START_WHEAT 50
#define START_WOOD 50
#define STA... | true |
03540d771918e7e17ec3d9ffaf3dcf34a4e3f75f | C++ | PercentEquals/CLL | /CLL/include/utils/search.hpp | UTF-8 | 470 | 3.171875 | 3 | [
"MIT"
] | permissive | #pragma once
#include <string>
#include <vector>
namespace cll
{
template<typename T>
size_t search(const std::vector<T>& vec, const std::string& name, const size_t& l, const size_t& r)
{
if (r >= l)
{
size_t mid = l + (r - l) / 2;
if (mid >= vec.size()) return vec.size();
if (vec[mid].name == name) ... | true |
bbd80eec43db74ef759f5336f0596dce7fcc6a28 | C++ | SachiSakurane/owle | /test/range/mock.hpp | UTF-8 | 291 | 2.609375 | 3 | [
"BSL-1.0"
] | permissive | #pragma once
#include <owle/utility/convertible_to.hpp>
template <class From, class To>
requires owle::convertible_to<From, To>
struct Connection {
To apply(From v) { return static_cast<To>(v); }
};
template <class Type, Type Value>
struct Applier {
Type apply() { return Value; }
};
| true |
85210030d56b60e914d2e7b0793c40be5e2b6456 | C++ | lighttransport/nanosnap | /tests/test_convolve.cc | UTF-8 | 1,406 | 2.671875 | 3 | [
"BSD-3-Clause",
"MIT",
"LicenseRef-scancode-public-domain"
] | permissive | #include "doctest/doctest.h"
#include "nanosnap/nanosnap.h"
#include <complex>
#include <iostream>
using namespace doctest;
TEST_CASE("convolve1d_full") {
#include "testvector/convolve_full.inc"
std::vector<float> result(k_outnum);
bool ret =
nanosnap::convolve(g_a, k_n, g_v, k_m, &result, /* mode 0 = fu... | true |
f89eabc77585db8ca56f11ce3372601e75c82507 | C++ | vtrej003/cs100Fall19 | /src/command.cpp | UTF-8 | 805 | 2.875 | 3 | [] | no_license | #include "../header/command.h"
bool Command::mExToken = true;
bool Command::mParenToken = false;
std::string Command::mConnector = "NULL";
int Command::mExitStatus = 255;
Command::Command(){}
void Command::execute(){}
void Command::setToken(bool token){
mExToken = token;
// std::cout<<"Executable token had been calle... | true |
2975d29fbf14bea2d3c378350f83d994c64b67af | C++ | nishantkj911/codes | /knapsack01.cpp | UTF-8 | 1,098 | 3.0625 | 3 | [] | no_license | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int knapsackValue(vector<pair<int, int>> items, int W)
{
vector<vector<int>> m(items.size() + 1, vector<int>(W + 1, 0));
for (int i = 1; i <= items.size(); i++)
{
for (int j = 1; j <= W; j++)
{
m[... | true |
ec82317028422f4b4c7ee5452f0ad52493c1e561 | C++ | demian2435/42-CPP_Module_05 | /CPP_Module_05/ex02/main.cpp | UTF-8 | 2,534 | 2.703125 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main.cpp :+: :+: :+: ... | true |
e1c3a22a00a33c7e42a346160abd38ef59d6f5aa | C++ | su6i/master-imagina | /S3/HMIN322 - Codage et compression multimedia/TDs-TPs/lib/test/old/static_multidim.hpp | UTF-8 | 5,557 | 3.296875 | 3 | [
"MIT"
] | permissive | #ifndef __STATIC_MULTIDIM_ARRAY__
#define __STATIC_MULTIDIM_ARRAY__
#include <array>
#include <vector>
#include <utility>
#include <iostream>
/*
template<typename T, size_t dim>
struct getTypeAtDim { using type = T; };
template<typename T, size_t N>
struct getTypeAtDim<T[N], 1> { using type = T; };
template<typenam... | true |
d29bdcd55f135d3b29a437315dbadde4a9053af1 | C++ | ths-rwth/carl | /src/carl-common/datastructures/carlTree.h | UTF-8 | 31,757 | 3.171875 | 3 | [
"MIT"
] | permissive | /**
* @file carlTree.h
* @author Gereon Kremer <gereon.kremer@cs.rwth-aachen.de>
*/
#pragma once
#include <cassert>
#include <iterator>
#include <list>
#include <limits>
#include <stack>
#include <type_traits>
#include <vector>
#include <carl-common/util/streamingOperators.h>
namespace carl {
template<typename... | true |
41ac1d1282edda14a86684a9e424dac70fa765d0 | C++ | ablondal/comp-prog | /Practice/Club_Prac_3/a.cpp | UTF-8 | 394 | 2.578125 | 3 | [] | no_license | #include <vector>
#include <queue>
#include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a<b)?a:b)
#define inf 1e9
typedef pair <int, int> pt;
typedef long long ll;
int main(){
string s;
cin >> s;
string S;
for(auto ss: s){
if (ss >= 'A'... | true |
9b02db6925550350f0f4f9d7c18da5fd52267520 | C++ | beyzaerdogaan/huffman-algorithm | /BinaryTree.h | UTF-8 | 904 | 2.6875 | 3 | [] | no_license | //
// Created by Beyza on 23.12.2020.
//
#ifndef ASSIGNMENT_4_LAST_BINARYTREE_H
#define ASSIGNMENT_4_LAST_BINARYTREE_H
#include <string>
#include <iostream>
#include <unordered_map>
#include <map>
#include <vector>
#include <fstream>
class BinaryTree {
private:
struct TreeNode {
char ite... | true |
bb6da6f8bcb9231baed87cd2256fdc0fd85654e7 | C++ | Curpiq/ood_labs | /lab1/CRectangle.h | UTF-8 | 468 | 3.171875 | 3 | [] | no_license | #pragma once
#include "IShape.h"
class CRectange : public IShape
{
private:
RectangleShape m_rectangle;
public:
CRectange(RectangleShape&& rectangle)
: m_rectangle(std::move(rectangle))
{
}
double GetPerimeter()const override
{
return (static_cast<double>(m_rectangle.getSize().x) + m_rectangle.get... | true |