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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
128a1b4607246cdce6fa0778114a0623e98b22ce | C++ | plops/Arduino_fastSIMplayingaround | /main_programm_control_exposureRH3/main_programm_control_exposureRH3.ino | UTF-8 | 8,338 | 2.828125 | 3 | [] | no_license | /*
Trigger for the Hamamatsu C11440
Trigger Mode: External Level Trigger
Set exposure time and exposure length
*/
// define all variables
int slm_ext_run=10; // starts hardware, activate running orders
int slm_trigger=11; // if high start showing image
int slm_out=9; // SLM LED enable signal,... | true |
0ff3e38beb728a279507f729bd7edbc0d5fa5938 | C++ | HHHKKKHHH/chi-dou-dou | /hkh-poj/1163.cpp | GB18030 | 937 | 3.0625 | 3 | [] | no_license | #include <iostream>
using namespace std;
#define max(a, b) (((a) > (b)) ? (a) : (b))
int row = 0; //
int num[50000] = {}; //
int res[50000] = {}; //DP
int main()
{
cin >> row;
int max = row * (row + 1) / 2 - 1; //±;
for (int i = 0; i <= max; i++)
{
cin >> num[i];
}
for (int i = ... | true |
b670daec76f8f1c99dceb2f7983febcef1a0f72e | C++ | daviddoria/Helpers | /ParallelSort.hpp | UTF-8 | 1,731 | 2.765625 | 3 | [] | no_license | /*=========================================================================
*
* Copyright David Doria 2012 daviddoria@gmail.com
*
* 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
*
*... | true |
a430f5bf2e01fd3ec4dab1f6ed1d6b2ce1802c07 | C++ | iriszero48/HttpServer | /HttpServer/Convert.h | UTF-8 | 2,907 | 3.203125 | 3 | [
"MIT"
] | permissive | #pragma once
#include <string>
#include <charconv>
#define __Convert_ToStringFunc__(x) #x
#define __Convert_ToString__(x) __Convert_ToStringFunc__(x)
#define __Convert_Line__ __Convert_ToString__(__LINE__)
template<typename...Args>
std::string __Convert_Combine__(Args&&... args)
{
std::string res;
(res.append(args... | true |
219e1c0bf9957ed81eb786573ce802ce450210b2 | C++ | TeamCOMPAS/COMPAS | /src/Remnants.cpp | UTF-8 | 2,099 | 2.859375 | 3 | [
"MIT"
] | permissive | #include "Remnants.h"
/*
* Calculate:
*
* (a) the maximum mass acceptance rate of this star, as the accretor, during mass transfer, and
* (b) the accretion efficiency parameter
*
*
* The maximum acceptance rate of the accretor star during mass transfer is based on stellar type: this function
* is for ... | true |
2bdae44096380be33d61aa82c8f94a983efb71be | C++ | matthewchiborak/SudsyHD | /Model/BoardObjectInteractSenders/BoardObjectInteractSender.cpp | UTF-8 | 549 | 2.59375 | 3 | [] | no_license | #include "BoardObjectInteractSender.h"
BoardObjectInteractSender::BoardObjectInteractSender()
: hasChild(false)
{
}
bool BoardObjectInteractSender::execute(BoardObject& me, Level& level)
{
if (senderTemplateMethod(me, level))
return true;
if (hasChild)
return child.get()->execute(me, level);
return false;
}... | true |
35c15def092f3a657c5d1b9e292050311ea0820d | C++ | fade4j/FragmentaryDemosC | /DemosC/DemosC/cpp/ImoocPart4/Circle.cpp | UTF-8 | 159 | 2.765625 | 3 | [] | no_license | #include "Circle.h"
Circle::Circle(double radius) {
m_dRadius = radius;
}
double Circle::calcArea() {
return 3.14 * m_dRadius * m_dRadius;
}
| true |
1a6f5a33a6c9540cb15dd72555b6a7240c98e8cd | C++ | hxbc01/petruk_aritmatika | /infix2posfix.cpp | UTF-8 | 3,173 | 3.046875 | 3 | [] | no_license | #include <iostream>
#include <stack>
#include <vector>
using namespace std;
// nama kelompok :
//Muhammad Arif A.F - 1907051020
//Muhammad Rasyid Singgih - 1907051014
//Muhammad Zulfikar - 2017051052
vector <string> realInfix;
vector <string> postfix;
bool isOperator(char checkOp);
int prcd(char check... | true |
6f4887748684a7a21ca92cea1e8d5b35c9ec8d61 | C++ | koalaa13/Comp-Graphics | /Dithering/Dither.h | UTF-8 | 1,717 | 2.65625 | 3 | [] | no_license | //
// Created by koalaa13 on 6/22/20.
//
#ifndef HW3_DITHER_H
#define HW3_DITHER_H
#include "PNMImage.h"
#include "random"
#include "algorithm"
#include "cmath"
#include "string"
#include "vector"
struct Dither {
static void randomDithering(PNMImage const &image, bool grad, std::string const &output, int bit, do... | true |
7f84659fefe10128cf26845ac6dda1cb4269e4c7 | C++ | FroxCode/Portfolio-VTA | /src/Item.h | UTF-8 | 831 | 2.84375 | 3 | [
"MIT"
] | permissive | //Created by Dale Sinnott
#ifndef _ITEM_H_
#define _ITEM_H_
////////////////////////////////////////////////////////////
// Headers
////////////////////////////////////////////////////////////
#include <memory>
#include "SDL_image.h"
class Item {
public:
enum LootType //lootTable
{
AK,
SHOTGUN,
GREEN,
YELLO... | true |
0759636fa3cba8d5f116934dd4fc5f9410f38971 | C++ | smartjinyu/LeetCode_2018 | /150_Evaluate_Reverse_Polish_Notation.cpp | UTF-8 | 1,471 | 3.546875 | 4 | [] | no_license | #include <iostream>
#include <vector>
#include <stack>
#include <string>
using namespace std;
int evalRPN(vector<string>& tokens) {
stack<int> nums;
for(string str : tokens){
if(str.size() == 1 && str[0] == '+'){
if(!nums.empty()){
int num1 = nums.top(); nums.pop();
... | true |
f7fefc0d0190b1c4c0b70e22ab5a5e7da3d0b360 | C++ | AbyssAbbeba/MDS-picoblaze-AVR-ide | /IDE/compiler/core/CompilerExpr.cxx | UTF-8 | 13,964 | 2.71875 | 3 | [] | no_license | // =============================================================================
/**
* @brief
* C++ Implementation: ...
*
* ...
*
* (C) copyright 2013, 2014 Moravia Microsystems, s.r.o.
*
* @author Martin Ošmera <martin.osmera@moravia-microsystems.com>
* @ingroup Compiler
* @file CompilerExpr.cxx
*/
// =====... | true |
8497a4f3b719dd343ee67851b01138f3c68ea99a | C++ | Khodii/SyntheticTestCases | /CWE20/example1.cpp | UTF-8 | 577 | 3.171875 | 3 | [] | no_license | #include <iostream>
using namespace std;
int berechneKontostand(int kontostand, int geldabnahme){
kontostand = kontostand - geldabnahme;
return kontostand;
}
int main() {
int kontostand = 1000;
int abgehoben;
cout << "Wie viel Geld wollen sie abheben?" << endl;
cin >> abgehoben;
/* Eingabe wird nicht auf Korr... | true |
b6924b9704b4802c6a5b41b36f9bf8dcd4bf5965 | C++ | ssanupam24/Practice-Code | /cpp-examples/min-increment-decrement.cpp | UTF-8 | 770 | 2.90625 | 3 | [] | no_license | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> arr = {1, 100, 50, 100};
int small = *min_element(arr.begin(), arr.end());
int large = *max_element(arr.begin(), arr.end());
vector<vector<int>> dp(arr.size(), vector<int>(large+1, 0));
for (int i = small; i <= large; i++) {
... | true |
1f73c300cb9b8465e5864f7c473f950c765ff949 | C++ | Aenohe/WAVM | /Include/Core/SExpressions.h | UTF-8 | 7,132 | 3.03125 | 3 | [
"Apache-2.0",
"BSD-3-Clause"
] | permissive | #pragma once
#include "Core/Core.h"
#include "Core/MemoryArena.h"
#ifdef _WIN32
#pragma warning (disable:4512) // assignment operator could not be generated
#endif
namespace SExp
{
// The type of a S-expression node.
enum class SNodeType : uint8
{
Symbol,
String,
UnindexedSymbol,
Name,
SignedInt,
Uns... | true |
b9d47fc6f460ece4b5fdecbb1d5cff6440c48181 | C++ | watrick/HelloWorld.cpp | /HelloWorld.cpp | UTF-8 | 218 | 2.71875 | 3 | [] | no_license | /* My first C++ program
Author: Patrick Fedigan
Date: 8/21/2013 */
#include <iostream>
int main() {
std::cout << "Hello, World!\n\n";
std::cout << "Press Enter to Continue";
std::cin.get();
return 0;
}
| true |
a09343b77b5f02da23fd678445a1783e2992508e | C++ | JerryZhou/opensc | /3rd/n3/code/extlibs/bullet/src/Physics/RigidBody/common/vec_utils.h | UTF-8 | 3,127 | 2.515625 | 3 | [] | no_license | /* [SCE CONFIDENTIAL DOCUMENT]
* $PSLibId$
* Copyright (C) 2006 Sony Computer Entertainment Inc.
* All Rights Reserved.
*/
#ifndef __VEC_UTILS_H__
#define __VEC_UTILS_H__
#include <stdlib.h>
#include <vectormath_aos.h>
using namespace Vect... | true |
3801c6d17a50b24bc448554d7812c3443d5138c1 | C++ | mcopik/cxx-langstat | /test/unit/constexpr/ConstexprFac.cpp | UTF-8 | 709 | 2.65625 | 3 | [
"Apache-2.0",
"LLVM-exception"
] | permissive | // RUN: rm %t1.ast.json || true
// RUN: %clangxx %s -emit-ast -o %t1.ast
// RUN: %cxx-langstat --analyses=cea -emit-features -in %t1.ast -out %t1.ast.json --
// RUN: diff %t1.ast.json %s.json
// Don't ever use this code.
//
//
#include<iostream>
struct Fac{
constexpr Fac() : res(1){}
constexpr Fac(const int ... | true |
b8e118b4451da51907c50d9fc0e1c12e724c605b | C++ | kush0603/Single-instance-share | /hac/HackKMP.cpp | UTF-8 | 782 | 2.640625 | 3 | [] | no_license | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int sum=0;
int a[26],min=999999;
for(int i=0;i<26;i++)
{
cin>>a[i];
sum = sum+a[i];
if(min>a[i] && a[i]>0)
min = a[i];
}
string s=""... | true |
2cbc2868d36667ed9fe11269a8873ac1e073fa63 | C++ | bazsodombiandras/StreamSearcher | /StreamSearcher/src/StreamSearch/StreamSearcher.h | UTF-8 | 2,675 | 3.296875 | 3 | [] | no_license | #pragma once
#include "../InputDataHandling/IInputDataSource.h"
#include <istream>
#include <set>
using namespace InputDataHandling;
using namespace std;
namespace StreamSearch
{
/// <summary>
/// Searches streams of data for multiple search terms.
/// </summary>
class StreamSearcher
{
private:
/// <summary... | true |
a6707dd70e6c6745607cd0e0a2852dc3e30f809a | C++ | casen330/Design-Pattern | /命令模式/命令模式.cpp | GB18030 | 2,821 | 3.796875 | 4 | [] | no_license | //࣬ʵһһķ
#include<iostream>
#include<list>
using namespace std;
class Doctor
{
public:
void treat_eye(){
cout << "ҽ ۿƲ" << endl;
}
void treat_nose(){
cout << "ҽ ǿƲ" << endl;
}
};
//һ
class CommandTreat
{
public:
virtual void treat() = 0;
};
//
class CommandTreatEye:public CommandTreat
{
public:
CommandTrea... | true |
021676583a372aeffd804b1e35bc216d83d3ee88 | C++ | funtalex/first_task | /Solver_of_Square_Equation.cpp | UTF-8 | 1,953 | 3.6875 | 4 | [] | no_license | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>
#include <assert.h>
const int INF_NUM_OF_ROOTS = 3;
/*!
\author Alex Sergeechev aka funtalex
\version 2.0
\brief This function solves an equation ax^2 + bx + c = 0
\param[in] a - coefficient for x^2
\param[in] b - coefficient ... | true |
8b54889a658358dadcb8a9f037207c147e9d85d7 | C++ | BenoitConstantin/CoursRenduMinecraft | /Cours de rendu -Levieux/moteurcraft/Exercice 1/_minecraft/base/my_physics.h | ISO-8859-1 | 2,200 | 2.71875 | 3 | [] | no_license | #pragma once
#include "engine/utils/types_3d.h"
#include "engine/render/camera.h"
class My_Physics
{
public :
static bool SegmentPlanIntersect(NYVert3Df segPoint1, NYVert3Df segPoint2, NYVert3Df vecteurPlan, NYVert3Df pointPlan, NYVert3Df* intersectPos)
{
NYVert3Df dirSegment = segPoint2 - segPoint1;
float deno... | true |
f84b98f9b1dbcf5c855147cff68b45d54f6a230e | C++ | greschd/exercises | /hpcse/week02/diffusion/src/threaded_v2.hpp | UTF-8 | 4,472 | 2.625 | 3 | [] | no_license | // Author: Dominik Gresch <greschd@ethz.ch>
// Date: 06.10.2014 03:31:53 CEST
// File: threaded_v2.hpp
#ifndef __THREADED_V2_HEADER
#define __THREADED_V2_HEADER
#include "common.hpp"
#include "../../barrier/barrier.hpp"
#include <cmath>
#include <vector>
#include <thread>
#include <iostream>
using namespace... | true |
ebce309f901361a213d3119384fd1f814aef9d0b | C++ | danielkenwahlau/CSE-471 | /Step5/Synthie/AR.cpp | UTF-8 | 845 | 2.6875 | 3 | [] | no_license | /**
* \file AR.cpp
*
* \author Daniel Ken-Wah Lau
*/
#include "stdafx.h"
#include "AR.h"
#include "ToneInstrument.h"
/**
* constructor
*/
CAR::CAR()
{
m_duration = 0.1;
m_bpm = 120;
}
/**
* destructor
*/
CAR::~CAR()
{
}
/**
* sets the source
* \param source
*/
void CAR::SetSource(CAudioN... | true |
3eb0afbee67b81154938a6be7ce5d9627cd876a9 | C++ | fjsxy/leetcodeKiller | /Symmetric Tree/101.cpp | UTF-8 | 1,864 | 3.34375 | 3 | [] | no_license | /**
* @date: 19-6-10
* @author: fjsxy
* @type: leetcode
*/
#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <list>
#include <stack>
#include <algorithm>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val... | true |
60ded36e4e0efb32dea5f1c551d2ae0c2c301c78 | C++ | purebluee/Leetcode | /cpp/15-3Sum.cpp | UTF-8 | 1,249 | 3.15625 | 3 | [] | no_license | //[-1, 0, 1, 2, -1, -4]
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<vector<int>> res;
if (nums.size() < 3)
return res;
int first = 0, second = 1, third = nums.size() - 1;
for (; first < nums.siz... | true |
a54b125d6777670b4a09fce90e956712f5f143d7 | C++ | dailongchen/InterviewQuestions | /Interview/Interview/reversePolishNotation.hpp | UTF-8 | 1,772 | 2.953125 | 3 | [] | no_license | //
// reversePolishNotation.hpp
// Interview
//
// Created by Solon Chen on 13/03/2018.
// Copyright © 2018 Solon. All rights reserved.
//
#ifndef reversePolishNotation_hpp
#define reversePolishNotation_hpp
#include <cassert>
#include <functional>
#include <memory>
#include <stdexcept>
#include <vector>
class Re... | true |
d951d639bff7d1a91fdd041a0bfe0c295a32489c | C++ | eddiehoyle/concussion | /src/CEngine/Timer.cc | UTF-8 | 366 | 2.546875 | 3 | [] | no_license | #include "Timer.hh"
namespace concussion {
Timer::Timer() : m_elapsed( 0 ) {}
void Timer::tick( float ms ) {
m_elapsed += std::chrono::duration< float, std::ratio< 1, 1000>>( ms );
}
void Timer::reset() {
m_elapsed = Elapsed::zero();
}
TimeStamp Timer::getTimeStamp() const {
return TimeStamp( this->m_e... | true |
0ae54f50455e58fb6056f5cbc734b47a4f0863b5 | C++ | AjaXsb/Leetcode | /Middle of Linked List.cpp | UTF-8 | 451 | 3.375 | 3 | [] | no_license | /* https://leetcode.com/problems/middle-of-the-linked-list/ */
class Solution {
public:
ListNode* middleNode(ListNode* head) {
ListNode* p1 = head;
ListNode* p2 = head;
if (head != NULL)
{
while (p2 != NULL && p2->next != NULL)
{
p2 = p2->next->next;
... | true |
600d9e6feba0ebc27adf4333551272c229243251 | C++ | bog2k3/bugs | /bugs/serialization/ChromosomeSerialization.cpp | UTF-8 | 1,323 | 2.90625 | 3 | [] | no_license | /*
* ChromosomeSerialization.cpp
*
* Created on: Mar 31, 2015
* Author: bog
*/
#include "BinaryStream.h"
#include "GeneSerialization.h"
#include "../genetics/Genome.h"
BinaryStream& operator << (BinaryStream &stream, Chromosome::insertion const& ins) {
stream << ins.age << ins.index;
return stream;
}
Bi... | true |
0a288ee27b654c6682d82c5d8d0f573380cb71f5 | C++ | stArl23/onlineJudgeExam | /牛客网上交/数字反转.cpp | UTF-8 | 459 | 2.921875 | 3 | [] | no_license | #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main(){
string a,b;
while(cin>>a>>b){
string sum=to_string(atoi(a.c_str())+atoi(b.c_str()));
reverse(sum.begin(),sum.end());
reverse(a.begin(),a.end());
reverse(b.begin(),b.end());
string sum1=to_string(atoi(a.c_str())+atoi... | true |
0f901703a12fdeba7a12b8ac474f7858167b434d | C++ | CloseRange/AmyWare | /AmyWare/src/AmyWare/Utility/OrthographicCameraController.h | UTF-8 | 1,331 | 2.546875 | 3 | [
"Apache-2.0"
] | permissive | #pragma once
#include "AmyWare/Renderer/OrthographicCamera.h"
#include "AmyWare/Utility/Timestep.h"
#include "AmyWare/Events/ApplicationEvent.h"
#include "AmyWare/Events/MouseEvent.h"
namespace AmyWare {
struct OrthographicCameraBounds {
float Left, Right, Bottom, Top;
float GetWidth() { return Right - Left; ... | true |
f55a6224f10946eca0981271a32b895183bfac5b | C++ | mutexbunnie/master | /entitysource.h | UTF-8 | 543 | 2.546875 | 3 | [] | no_license | #ifndef ENTITYSOURCE_H
#define ENTITYSOURCE_H
#include <QString>
#include <QAbstractItemModel>
#include <QSqlQueryModel>
class EntitySource
{
public:
EntitySource(QString _name, QString _entityType, QString _query, QString _dataSourceName);
QString getName() { return name;}
QString getEntityType() { return... | true |
1ef79fb3d82b8478eeca4841172319ce80b39d60 | C++ | VipulKhandelwal1999/Coding_Blocks | /20.Challenges_Sorting_And_Searching/10.Arrays_Insertion_Sort_II.cpp | UTF-8 | 1,927 | 4.4375 | 4 | [] | no_license | /*
Given an array A of size N , write a function that implements insertion sort on the array. Print the elements of sorted array.
Input Format
First line contains a single integer N denoting the size of the array. Next line contains N space seperated integers where ith integer is the ith element of the array.
Constra... | true |
517f524f14222396cf3dc17270e7ef55cec64d18 | C++ | kovalexius/legacy_cpp_wrappers | /common/smart_ptr.h | UTF-8 | 2,230 | 3.125 | 3 | [] | no_license | #pragma once
template <class T> class smart_ptr
{
public:
smart_ptr(T* pValue = NULL) : m_pValue(pValue), m_pnPtrCnt(pValue ? new int : NULL) {
if (pValue) *m_pnPtrCnt = 1;
}
~smart_ptr(void) {
free();
}
smart_ptr(const smart_ptr& rRight) : m_pValue(NULL), m_pnPtrCnt(NULL) {
*this = rRight;
}
smart_ptr& o... | true |
1cdfb669efdc86d54711c8a56c84b428ba6e6f5b | C++ | datnguyen51/DataStructure | /Library/list.h | UTF-8 | 4,543 | 3.453125 | 3 | [] | no_license | #ifndef LIST_H
#define LIST_H
#include <algorithm>
#include "book.h"
template <class T>
struct Node
{
T data;
Node<T> *next;
};
template <class T>
class List
{
private:
Node<T> *head;
Node<T> *tail;
int count;
public:
List()
{
head = 0;
tail = 0;
count = 0;
};
void Add(T value)
{
Node<T> *n= Creat_Nod... | true |
d5b106bb24de3a2a38ef0f6bfa13ab7e831bc3fb | C++ | vivekmyers/Math-Seminar-Project | /gpu/newton_gpu.cpp | UTF-8 | 8,656 | 2.640625 | 3 | [] | no_license | #define GLEW_STATIC
#include <GL/glew.h>
#include <GLFW/glfw3.h>
#include <cstdio>
#include <fstream>
const int WINDOW_WIDTH = 900;
const int WINDOW_HEIGHT = 900;
const char *WINDOW_TITLE = "Newton GPU";
void glfw_debug_callback(int error, const char *description)
{
printf("[GLFW] %d: %s\n", error, description);... | true |
1a54313f3574593e1ea6a5756e6bf129689daabb | C++ | Nhrkr/Language-Processors-Algos | /que2.cpp | UTF-8 | 1,509 | 2.5625 | 3 | [] | no_license | #include<iostream>
#include<string>
#include<fstream>
using namespace std;
int main()
{
ifstream fin;
ofstream fout;
fin.open("i1.txt");
fout.open("generated1.c");
char lhs,t;
int i;
fin>>t;
fin.close();
fin.open("i1.txt");
string rhs,text,text1,text2,line,term;
fout<<"#include<stdio.h>\nint ... | true |
287dcb58a1fafc5344c79b27e2c1d52ad61d5a8c | C++ | iuyoy/basicCSKnowledge | /leetcode/882. Reachable Nodes In Subdivided Graph/RNiSG.cpp | UTF-8 | 2,880 | 3.484375 | 3 | [] | no_license | /*
Starting with an undirected graph (the "original graph") with nodes from 0 to N-1, subdivisions are made to some of the edges.
The graph is given as follows: edges[k] is a list of integer pairs (i, j, n) such that (i, j) is an edge of the original graph,
and n is the total number of new nodes on that edge.
Then,... | true |
403d49f8266aa7b314459bdccffc9a66ee54689a | C++ | rutuja-patil923/Data-Structures-and-Algorithms | /BST/populateSuccessor.cpp | UTF-8 | 177 | 2.609375 | 3 | [] | no_license | node *pre=NULL;
void populateNext(struct node* root)
{
if(root==NULL)
return;
populateNext(root->left);
if(pre)
pre->next=root;
pre=root;
populateNext(root->right);
} | true |
4e3b2179fffa23f5d441c074b01c85a736be6d6c | C++ | Kpure1000/3DViewer | /3DViewer/graph/Sprite.h | UTF-8 | 4,979 | 2.546875 | 3 | [] | no_license | #ifndef SPRITE_H
#define SPRITE_H
#include"RenderStates.h"
#include"RenderTarget.h"
#include"Drawable.h"
namespace rtx
{
namespace graph
{
class Sprite : public Drawable
{
public:
Sprite() :VAO(0), VBO(0), EBO(0)
{
Vertex a;
a.position = glm::vec3(0.0f, 0.0f, 0.0f);
... | true |
9087c21b2ff180747aaca3d3b4aa88afc883a965 | C++ | VARTIOMIES/ohjelmointi-2-cplusplus | /student/06/network/main.cpp | UTF-8 | 4,698 | 3.203125 | 3 | [] | no_license | #include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <set>
const std::string HELP_TEXT = "S = store id1 i2\nP = print id\n"
"C = count id\nD = depth id\n";
std::vector<std::string> split(const std::string& s, const char delimiter, bool ignor... | true |
6bcd87cc20c89b19ccf7332fd72123b4028cf31f | C++ | tmuttaqueen/MyCodes | /Online Judge Code/[Other] Online-Judge-Solutions-master_from github/Project Euler/346.cpp | UTF-8 | 555 | 2.8125 | 3 | [] | no_license | #include <iostream>
#include <set>
using namespace std;
int main(){
const long long MAX_VAL = 1000000000000LL;
set<long long> S;
S.insert(1);
for(long long b = 2;;++b){
long long aux = b*b + b + 1;
if(aux >= MAX_VAL) break;
while(aux < MAX_VAL){
S... | true |
baff7ebc1bfad6bae3e7dbf2cd58e3f2b31557fb | C++ | 1091390146/algorithm | /查找/binSearch.cpp | UTF-8 | 2,326 | 3.96875 | 4 | [] | no_license | # include<iostream>
using namespace std;
int binary_search(int arr[],int low , int high, int key)
{
// 通过递归二分查找 查找元素
if(low<=high){
int mid = (high+low) >> 1;
//若元素在中间
if(arr[mid] == key)
return mid;
// 若元素比中间的数小 那么它只可能在左边的子数组中 则可另high = mid -1
else if (arr[mid] > key)
return binary_search(arr,low,m... | true |
b15a316bb30d5d249b3eddcae3f13f09d65dd989 | C++ | tmolcard/PluriNotes | /relations.cpp | UTF-8 | 10,843 | 2.75 | 3 | [] | no_license | #include "relations.h"
#include "Notes.h"
#include <QDebug>
RelationManager* RelationManager::instance = nullptr;
RelationManager::RelationManager(): tabRelations(nullptr), nbRelations(0), nbMaxRelations(0){}
RelationManager::~RelationManager(){
for(unsigned int i=0; i<nbRelations; i++) delete tabRelations[i];
... | true |
3374566320d278efb32426c667cb44f103d7b975 | C++ | ankithans/Data-structures-algorithms | /Graph/08. cycle-detection-in-directed-graph-using-kahn's-algorithm.cpp | UTF-8 | 696 | 3.015625 | 3 | [] | no_license | #include <bits/stdc++.h>
using namespace std;
void inputOutput() {
#ifndef ONLINE_JUDGE
freopen("../input.txt", "r", stdin);
freopen("../output.txt", "w", stdout);
#endif
}
/*
Cycle Detection in Directed Graph using Kahn's Algorithm
I/p: 0------>1
<\ /
\ /
\ </
2------>3
Yes
1. Sto... | true |
2b967c1b1a3818be70c4afb7bbe63a95cf239ebe | C++ | JamesBoer/Jinx | /Source/JxScript.h | UTF-8 | 4,577 | 2.546875 | 3 | [
"MIT"
] | permissive | /*
The Jinx library is distributed under the MIT License (MIT)
https://opensource.org/licenses/MIT
See LICENSE.TXT or Jinx.h for license details.
Copyright (c) 2016 James Boer
*/
#pragma once
#ifndef JX_SCRIPT_H__
#define JX_SCRIPT_H__
namespace Jinx::Impl
{
class Script;
using ScriptIPtr = std::shared_ptr<Script>... | true |
0ffb650ff2cd0a386f8165ee83b2495ddee2fb2e | C++ | younies/unieativeTaxonomer | /unieativeTaxonomer/CoreTaxonomer.cpp | UTF-8 | 6,410 | 2.796875 | 3 | [] | no_license | //
// CorseTaxonomer.cpp
// unieativeTaxonomer
//
// Created by Younies Mahmoud on 8/8/16.
// Copyright © 2016 Younies Mahmoud. All rights reserved.
//
#include "CoreTaxonomer.hpp"
CoreTaxonomer::CoreTaxonomer(vector<YRJObject *> yrjVector , Hash * hash)
{
//setting up the hash
this->theHash = hash;
... | true |
2081fc6f148a0a023de54ef51fd40d51faddb99d | C++ | dumppool/mazerts | /trunk/Model/Tests/DebugAssetCollectionListener.h | UTF-8 | 1,185 | 2.8125 | 3 | [] | no_license | /**
* Demonstrate & test IAssetCollectionListener -interface
*/
#ifndef __DEBUGASSETCOLLECTIONLISTNER_H__
#define __DEBUGASSETCOLLECTIONLISTNER_H__
#include "../Asset/IAsset.h"
#include "../Asset/IAssetCollectionListener.h"
#include <iostream>
using namespace std;
class DebugAssetCollectionListener : p... | true |
4c0f4621f913a913c9c0e1137b670023f5e3081e | C++ | anassaeed72/CodeEval | /PrimePalindrome.cpp | UTF-8 | 910 | 3.375 | 3 | [] | no_license | //
// main.cpp
// PrimePalindrome
//
// Created by Anas Saeed on 16/03/2015.
// Copyright (c) 2015 Anas Saeed. All rights reserved.
// https://www.codeeval.com/open_challenges/3/
#include <iostream>
bool isPalindrome(std::string input){
int length = input.length();
for (int i = 0; i < length/2; i++) {
... | true |
e699699230d818bb8bcb54d0193b0e0c57670767 | C++ | Wyder7PL/Project_Demo | /src/abilities/GenericAbility.hpp | UTF-8 | 628 | 2.71875 | 3 | [] | no_license | #pragma once
#include "../Ability.hpp"
#include <vector>
namespace Demo
{
class GenericAbility : public Ability
{
public:
GenericAbility();
virtual ~GenericAbility();
public:
virtual Ability* Clone() override;
virtual Action ConstructAction(const Location& destination, bool targetingEnemy) override;
void Ad... | true |
200b242760b1a9e87f5e3d4fb2ce8afda60d88dc | C++ | moevm/oop | /6383/KaramyshevAO/lab1.2/Shape.cpp | UTF-8 | 502 | 3.15625 | 3 | [] | no_license | #include "Shape.h"
Shape::Shape(Point cntr, Color clr) : cntr(cntr), clr(clr) {
static int next_ID = 0;
ID = next_ID++;
}
const Color& Shape::Get_Color() const { return clr; }
const Point& Shape::Get_Point() const { return cntr; }
const int Shape::Get_ID() const { return ID; }
ostream& operator <<(ostream &os, ... | true |
91c2442c5aa549e6b703e53d537cdec7c054e290 | C++ | lineCode/Straights | /StraightsController.cc | UTF-8 | 3,798 | 2.890625 | 3 | [] | no_license | #include "StraightsController.h"
#include "HumanPlayer.h"
#include "ComputerPlayer.h"
#include "Card.h"
#include "Table.h"
#include "Command.h"
#include <iostream> //TODO: remove
using namespace std;
StraightsController::StraightsController(int seed): seed{seed} {
gameState = make_shared<GameState>();
deck = ... | true |
e7ebfb72379e36021419dab79c3d7fb54aea798f | C++ | sheMnapion/http-server | /src/httpServer.cc | UTF-8 | 2,230 | 2.875 | 3 | [] | no_license | #include "httpServer.h"
static httpInfo innerHttpInfo;
void clear(httpInfo *information)
{
for(int i=0;i<100;i++){
information->getInfo[i]=0;
information->hostInfo[i]=0;
}
for(int i=0;i<1000;i++)
information->userAgentInfo[i]=0;
}
httpInfo analyzeExplorer(char *buf)
{
strPointer httpEditionPointer,hostPointer... | true |
47159ad3962ff78ebac13493f7bb5d0872146fb8 | C++ | fameowner99/AbstractVM | /inc/Wrapper.hpp | UTF-8 | 304 | 2.9375 | 3 | [] | no_license | #ifndef WRAPPER_HPP
# define WRAPPER_HPP
template <typename T>
class Wrapper_around
{
public:
Wrapper_around(T value)
: _value(value)
{ }
T operator *()
{
return _value;
}
virtual ~Wrapper_around()
{
delete _value;
}
T getValue()
{
return (_value);
}
private:
T _value;
};
#endif | true |
ad03d70c1290265da4408270bc0ed5d4cd870187 | C++ | Pnayaka/CPP-Working-Examples | /Distlib.cpp | UTF-8 | 769 | 3.296875 | 3 | [] | no_license |
class Distance
{
int iFeet;
float fInches;
public:
void setFeet(int);
int getFeet() const; //constant function
void setInches(float);
float getInches() const; //constant function
Distance add(Distance) const; //constant function
};
void Distance::setFeet(int x)
{
iFeet=x;
}
int Distan... | true |
522dbd3014ad3bdbfdde05891d5f6d46764a4b41 | C++ | shrimpboyho/combo | /combo/combo/main.cpp | UTF-8 | 346 | 2.515625 | 3 | [] | no_license | #include "stdafx.h"
#include "std_lib_facilities.h"
#include "combo.h"
int main(){
cout << "Hello world!" << endl;
int hello [4];
hello[0] = 1;
hello[1] = 16;
int goodbye [2];
goodbye[0] = 3;
goodbye[1] = 9;
combo objectification;
objectification.concat(hello, goodbye);
cout << concat[3];
keep_wi... | true |
ffd25deb51c0ccdbacf919a3094b860cc5ed6b34 | C++ | PJ-Finlay/Game-Room-App | /ui/views/gameplay.cpp | UTF-8 | 6,468 | 2.578125 | 3 | [
"MIT"
] | permissive | #include "gameplay.h"
#include <QPushButton>
#include <QLabel>
#include <QHBoxLayout>
#include <QMessageBox>
#include <QTime>
#include <QCoreApplication>
#include "../widgets/pushbuttonwithid.h"
#include <QDebug>
GamePlay::GamePlay(std::shared_ptr<Game> game, QWidget* parent) : View(parent)
{
//Initialize PIV's... | true |
b85640260d8d358bfd0d58056b33a3e925f777ba | C++ | kevinnguyeneng/c-simple-console | /Chapter1/ex1_4.cc | UTF-8 | 1,182 | 3.9375 | 4 | [] | no_license | #include<stdio.h>
int main(int argc, char *argv[]){
// create two arrays we care about
int ages[]= {23, 43, 12, 89, 2};
char *names[]={
"Alan", "Frank", "Marry",
"John", "Lisa"
};
// safely get the size of ages
int count = sizeof(ages)/sizeof(int);
int i =0;... | true |
9c97a0b0a56ba06e5b87f243e1c3c73c618c7aa1 | C++ | WolfieGo-Pro/C-Starterbook-2 | /switch_condition.cpp | UTF-8 | 1,569 | 3.5 | 4 | [] | no_license | /*
SWITCH IS LIKE 'ELSE IF' BUT HAS BEEN HIGHLY OPTIMIZED TO RUN CONDITIONAL STATEMENTS A BIT FASTER
IT ALSO LET'S THE PROGRAMMER 'CHOOSE BETWEEN VARIOUS POSSIBLE VALUES/CASES'
*/
#include "pch.h"
using namespace std;
// THIS IS WHERE I ALSO LEARNED ABOUT FUNCTIONS (AT O LEVEL)
int switch_condition... | true |
05947532f350ac7d621337b47cd3896a41ccb2a0 | C++ | Aleks-Ada/advanced-programming-2 | /src/board-renderer/board-renderer.cc | UTF-8 | 3,418 | 3.0625 | 3 | [] | no_license | #include <memory>
#include "board-renderer.h"
#include "shared.h"
void BoardRenderer::SetMode(const RenderMode render_mode) {
this->render_mode = render_mode;
}
std::string_view NewLine() {
return "\n";
}
std::string_view CellSeparator() {
return " ";
}
std::string_view BlankCell() {
return " ";
}
std::st... | true |
6f2a4d29760cddc3da6bb3e5b3a4ca48e486ff93 | C++ | Blackstar699/Warped | /game/environment.cpp | UTF-8 | 2,605 | 3.21875 | 3 | [] | no_license | #include "environment.h"
///affiche le background du jeu
void background(sf::RenderWindow& window, sf::Texture& texture){
sf::Sprite sprite(texture);
sprite.setPosition(0,0);
window.draw(sprite);
}
///affiche l'environnement correspondant aux données de la map en paramètre
void environment(sf::RenderWind... | true |
acb20c8c0af616dddb68b50d270b43465be3d500 | C++ | dmingn/AOJ | /ALDS1/ALDS1_3_D.cpp | UTF-8 | 992 | 3.203125 | 3 | [] | no_license | #include <iostream>
#include <string>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main() {
string str;
cin >> str;
stack<uint32_t> s;
vector<pair<uint32_t, uint32_t>> v;
for (uint32_t i = 0; i < str.length(); i++) {
i... | true |
f011abc1de87381d1624c36e79f08f74a0de5e7a | C++ | aduxbury0/C-UniModule | /Week 3/Week 3 Task 1/Week 3 Task 1/Source.cpp | UTF-8 | 2,564 | 4.21875 | 4 | [] | no_license | /* Week 3 Task 1 - Program that prints words mirrored from a single sentence input, the complexity being O(1^n) as the function calls only a single copy of itself for every iteration */
#include "stdafx.h"
#include "Source.h"
int main() {
string wordListInput;
string wordCount;
// Getting the sentence and the nu... | true |
225302dc63962fa4961bac6ad03e140285c03224 | C++ | akhileshs/oj-solutions | /antiblot.cpp | UTF-8 | 1,219 | 3.09375 | 3 | [] | no_license | #include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cstdlib>
#include<sstream>
#include<vector>
using namespace std;
vector<string> split(string s, string del = " "){
char *word, *buf, *delim;
vector<string> res;
delim=strdup(del.c_str());
buf = strdup(s.c_str());
for(wo... | true |
93d9131593b1a5ae25a54cd70c3a569bb5d058a0 | C++ | lia-univali/ImageEvolution | /ImageEvolution/evolver.h | UTF-8 | 1,515 | 2.78125 | 3 | [] | no_license | #ifndef EVOLVER_H
#define EVOLVER_H
#include <cstdlib>
#include <vector>
#include <SFML/Graphics.hpp>
#include "solution.h"
#include <utility>
#include <functional>
class Evolver
{
public:
using ParentPair = std::pair<std::reference_wrapper<Solution>, std::reference_wrapper<Solution>>;
using Population = std:... | true |
9c749c13ea9ca6dc2af6bda56bfa59ff432d10bf | C++ | tarang98/turtle_ROS | /solution.cpp | UTF-8 | 1,895 | 2.71875 | 3 | [] | no_license | #include "ros/ros.h"
#include "geometry_msgs/Twist.h"
const double PI = 3.14159265359;
// Initialize the node
int main(int argc, char **argv)
{
ros::init(argc, argv, "move_turtle");
ros::Rate rate(3);
//void move(double distance, int turn);
move(1.0, 1);
move(1.0, 3);
move(2... | true |
6d3533e736bcca624e9ac208b754fd422928beec | C++ | Deividy/lab | /cc/rpg/game.h | UTF-8 | 672 | 2.796875 | 3 | [] | no_license | #include <vector>
#include <string>
namespace rpg {
using namespace std;
class Player {
public:
Player (string name): m_name{name} {};
string name () const { return m_name; };
void name (string newName) { m_name = newName; };
private:
string m_n... | true |
468ed6ea273e50e8e633cfd3f3dbf20ecb43e820 | C++ | funny07/leet-src | /linear_table/removeDuplicatesArrays.cpp | UTF-8 | 1,243 | 3.359375 | 3 | [] | no_license | #include <stdio.h>
#include <vector>
using namespace std;
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.size() == 0)
return 0;
bool same = false;
vector<int>::iterator iter_cur = nums.begin();
vector<int>::iterator iter = nums.begin();
... | true |
526f630ff693868f2e0d3050c651378ac2e4fa31 | C++ | EliottPal/CCP_Plazza_2019 | /src/Process.cpp | UTF-8 | 1,177 | 2.75 | 3 | [] | no_license | /*
** EPITECH PROJECT, 2020
** CCP_plazza_2019
** File description:
** Process
*/
#include "Process.hpp"
Process::Process(SharedMemory &mems, float multiplier, int maxCooks, int restock)
{
this->_mems = mems;
this->_multiplier = multiplier;
this->_maxCooks = maxCooks;
this->_restockTime = restock;
... | true |
684b4d375e27d7f234a1d40a9984ea8a16b72a10 | C++ | vishu9266/DDUC-Work-c- | /array.cpp | UTF-8 | 1,351 | 3.59375 | 4 | [] | no_license | #include<iostream>
using namespace std;
int number_of_students, avg;
int marks[0];
int max1, max2, sum = 0;
void marks_storage(int number_of_students);
void show_me_marks(int number_of_students);
int average_marks(int number_of_students);
int highest_marks(int number_of_students);
int main() {
cout << "Enter tot... | true |
1cacda66991c3b971fc24a7a6248048fc67d9945 | C++ | johnnyVR/cpv-framework | /include/CPVFramework/Stream/BuffersInputStream.hpp | UTF-8 | 770 | 2.640625 | 3 | [
"MIT"
] | permissive | #pragma once
#include <vector>
#include <seastar/core/temporary_buffer.hh>
#include "./InputStreamBase.hpp"
namespace cpv {
/** Input stream that use given temporary buffers as data source */
class BuffersInputStream : public InputStreamBase {
public:
/** Read data from stream */
seastar::future<InputStreamRead... | true |
b2f81c424db560a61a5e0b8ffdbe59928488d183 | C++ | shamanDevel/cuMat | /cuMat/src/Errors.h | UTF-8 | 4,828 | 2.515625 | 3 | [
"MIT"
] | permissive | #ifndef __CUMAT_ERRORS_H__
#define __CUMAT_ERRORS_H__
#include <cuda_runtime.h>
#include <exception>
#include <string>
#include <cstdarg>
#include <vector>
#include <stdexcept>
#include <stdio.h>
#include "Macros.h"
#include "Logging.h"
CUMAT_NAMESPACE_BEGIN
class cuda_error : public std::exception
{
private:
std:... | true |
95a506b31602e1abc2dc4728b34fdcb6681f5eb6 | C++ | dongfusong/TlvProject | /TestByteOrder.cpp | WINDOWS-1252 | 676 | 2.640625 | 3 | [] | no_license | /*
* TestByteOrder.cpp
*
* Created on: 2014924
* Author: Thoughtworks
*/
#include <gtest/gtest.h>
#include "ByteOrder.h"
#include <iostream>
using namespace std;
class TestByteOrder: public testing::Test {
public:
void SetUp() {
}
void TearDown() {
}
protected:
};
TEST_F(TestByteOrder, can_byte_order_... | true |
ab59f1ac638ce16dbad7f0ae5bc2b814643b3ede | C++ | dayuyuhai/Haizei_class | /OJ/193.是否可以求和.cpp | UTF-8 | 697 | 2.796875 | 3 | [] | no_license | /*************************************************************************
> File Name: 193.是否可以求和.cpp
> Author: 北海望谷堆
> Mail: dayuyuhai@outlook.com
> Created Time: Wed 13 May 2020 03:00:48 PM CST
************************************************************************/
#include<iostream>
using namespace std;
in... | true |
8fa764eb442ed8c3305057931388182aed4db0c4 | C++ | mradwan80/Multithreads | /conditions.cpp | UTF-8 | 840 | 3.328125 | 3 | [] | no_license | //thread sleeps, until notified//
#include <thread>
#include <mutex>
#include <vector>
#include <stack>
#include <iostream>
using namespace std;
stack<int> S;
mutex mtx_push;
mutex mtx_pop;
mutex mtx;
condition_variable cond;
void stack_pop()
{
unique_lock<mutex> ulk(mtx);
cond.wait(ulk); //automatically... | true |
7637f8650d81808f1490ce3264f584aec83cc7e4 | C++ | RaphAbb/peercode | /hw0/Graph_1787.hpp | UTF-8 | 13,198 | 3.5 | 4 | [] | no_license | #ifndef CME212_GRAPH_HPP
#define CME212_GRAPH_HPP
/** @file Graph.hpp
* @brief An undirected graph type
*/
#include <algorithm>
#include <map>
#include <unordered_map>
// For the moment I am using a convenient Boost hashing function, but no Boost containers.
// I was told that this will be OK for HW0 although I wi... | true |
14d48a3d3388399d21d21f0543610d8d47de4ab9 | C++ | isaysthat/DrumTriggerModule | /UIArrayElement.h | UTF-8 | 1,148 | 3.109375 | 3 | [] | no_license | /*
UIArrayElement
This class is derived from UIElement. It stores a String and when updateLCD is called will print that String to the rowOccupied.
This element should not be selectable as it does not explicitly override the execute method.
Created by: Justin Read
11/19/2014
*/
#ifndef UIARRAYELEMENT_H
#define UIARRAYEL... | true |
c37d0cf4fbe5ed80348926fc7755cae320fd645c | C++ | pacman-project/gaussian-object-modelling | /include/gp/CovThinPlate.h | UTF-8 | 3,255 | 2.859375 | 3 | [] | no_license | /** @file CovThinPlate.h
*
*
* @author Claudio Zito
*
* @copyright Copyright (C) 2015 Claudio, University of Birmingham, UK
*
* @license This file copy is licensed to you under the terms described in
* the License.txt file included in this distribution.
*
* Refer to Gaussian process library for ... | true |
281a49c186a7031744d94874df139a416603b812 | C++ | fcoury/mechpad | /arduino/pedal/pedal.ino | UTF-8 | 2,289 | 3.15625 | 3 | [] | no_license | const int SWITCH_PIN = 8;
const long HOLD_WAIT = 700;
int clicks = 0;
int switchPressed = 0;
long firstPressed = -1;
long lastPressed;
bool isHeld = false;
void setup() {
Serial.begin(9600);
// sets pin to Input mode and activates the pullup resistor
// since the switch is wired on an active high fashion
pin... | true |
d8d642c0126c6184dc0c95b0f29bc6ce060911d7 | C++ | noahdelongpre/CS3331-ConcurrentComputing | /Program 5: Missionaries and Cannibals (Monitors)/boat-monitor.cpp | UTF-8 | 9,387 | 2.984375 | 3 | [] | no_license | //--------------------------------------------------------
// NAME: Noah de Longpre' User ID: nkdelong
// DUE DATE: 12/8/2017
// PROGRAM ASSIGNMENT 5
// FILE NAME: boat-monitor.cpp
// PROGRAM PURPOSE:
// Boat-monitor.cpp is the brains of the whole boat operation happens.
// This controls the Cannibals a... | true |
a22e27c0d430c448de19d38c9247ae772a32d807 | C++ | OzkanTopcan/Open_Ruche | /main.cpp | UTF-8 | 7,095 | 2.609375 | 3 | [] | no_license | /*--------------Librairies--------------*/
#include "mbed.h"
#include "platform/mbed_thread.h"
#include "DHT22.h"
#include "DS1820.h"
#include "Anemometer.h"
#include "HX711.h"
#include "message_1.h"
/*---------Prototypes fonctions---------*/
bool MesureDHT22();
bool MesureDS18B20();
bool MesureLumi();
bool MesureDi... | true |
f526f5cd6ef6725405c913e325384eb981b49888 | C++ | vshymanskyy/O_oRT | /src/Core/File.h | UTF-8 | 2,998 | 3.21875 | 3 | [] | no_license | #pragma once
class File{
private:
FILE* mFile;
const char* mName;
bool mWrite, mOpened;
void Close() {
assert(mOpened);
mOpened = false;
fclose(mFile);
}
void Open() {
const char* mode = (mWrite)? "w+" : "r";
mFile = fopen(mName, mode);
mOpened = (mFile!=NULL);
assert(mOpened);
... | true |
10c0daa6841acbf763ece68b1bfb566f94eb324c | C++ | yefim/cis190 | /hw4/test.cpp | UTF-8 | 612 | 3.171875 | 3 | [] | no_license | #include <iostream>
#include <string>
#include "bigint.h"
using namespace std;
int main()
{
bool test[11];
BigInt a;
BigInt b(1);
BigInt c(1L);
BigInt d(a);
// unary
test[0] = a == +a;
test[1] = a == -a;
// arithmetic
test[2] = a + b == b;
test[3] = a - b == -b;
test[4] = a * b == a;
// ass... | true |
928a49f8605a71b1965e5ae3c1a8d434c5b65cb1 | C++ | brliron/135tk | /th145arc/TFPKArchive.cpp | UTF-8 | 12,234 | 2.734375 | 3 | [] | no_license | #include <windows.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <time.h>
#include <unordered_map>
#include <list>
#include <forward_list>
#include <random>
#include <ctype.h>
#include "tasofroCrypt.h"
#include "TFPKArchive.h"
BOOL CreateDirectoryForPath(wchar_t* Path)
{
BOO... | true |
590d2bfea846cd75f857a7b4ea0518a196ee1da0 | C++ | VaibhavVerma16113108/A2OJ-Ladders-Div2.A | /Watermelon.cpp | UTF-8 | 212 | 2.53125 | 3 | [] | no_license | #include<iostream>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
if(n&1 or n==2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | true |
1f9e83f59c90242ada905d599b76994e061daf7c | C++ | mhk1436658453/Connect4 | /constant.h | UTF-8 | 2,048 | 2.703125 | 3 | [] | no_license | #ifndef CONSTANTS_H
#define CONSTANTS_H
#include <iostream>
#include <vector>
using std::string;
using std::vector;
using std::cout;
using std::cin;
using namespace std::string_view_literals;
namespace constants
{
constexpr int b_h{ 6 }; // board height
constexpr int b_w{ 7 }; // board width
constexpr char empt... | true |
676df3c6499ee47d58669d3bfe88f2a056aebb4d | C++ | rezwan4029/UVA-CODES | /10321 - Polygon Intersection.cpp | UTF-8 | 7,606 | 2.640625 | 3 | [] | no_license | /*
AUST_royal.flush
*/
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(),x.end()
#define ms(a,v) memset(a,v,sizeof a)
#define II ({int a; scanf("%d", &a); a;})
#define LL ({Long a; scanf("%lld", &a); a;})
#define DD ({double a; scanf("%lf", &a); a;})
#define EPS 1e-10
#define pi 3.1415926535897... | true |
63a93c472f2e97307d98d793bfed9a80929055a5 | C++ | rainingapple/algorithm-competition-code | /CCF-CSP/CCF-CSP/18-03-1.cpp | UTF-8 | 328 | 2.5625 | 3 | [] | no_license | //#include<iostream>
//using namespace std;
//int main() {
// int flag, point = 0, ans = 0;
// while (cin >> flag) {
// if (flag == 0) {
// break;
// }
// else if (flag == 1) {
// point = 0;
// ans += 1;
// }
// else {
// point += 2;
// ans += point;
// }
// }
// cout << ans;
// return... | true |
d3f70a553c9fa7afce456bf2f0bb81a9d8907551 | C++ | szqh97/test | /cpp/c11/shared_weak_ptr.cpp | UTF-8 | 430 | 2.6875 | 3 | [] | no_license | #include <iostream>
#include <memory>
using namespace std;
struct Linker
{
weak_ptr<Linker> link;
// shared_ptr<Linker> link; // error while use shared_ptr,
};
void Dowork()
{
shared_ptr<Linker> l1(new Linker());
shared_ptr<Linker> l2(new Linker());
l1->link = l2;
l2->link = l1;
}
int main ( i... | true |
741655a5a7f9e06b866740472033856a8e860793 | C++ | forkingpath/snowdevice | /extern/PCG-BSPDungeonGen/include/PCG-BSPDungeonGen/Dungeon.h | UTF-8 | 1,397 | 2.671875 | 3 | [
"MIT"
] | permissive | #ifndef PCG_DUNGEON_H
#define PCG_DUNGEON_H
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <random>
#include <string>
#include "AABB.h"
#include "Node.h"
typedef AABB Room;
typedef std::vector<Vec2> Path;
typedef std::vector<unsigned int> GridLine;
typedef std::vector<std::vector<u... | true |
e438e10fae47c06b52aa57dc9f52756022f6ded5 | C++ | prakhar-agarwal/SemGen-cpp | /include/semsim/annotation/Ontology.h | UTF-8 | 2,579 | 2.984375 | 3 | [] | no_license | #include "../definitions/ReferenceOntologies.h"
#include <string>
#include <vector>
namespace semsim { namespace definitions { class ReferenceOntologies; } }
namespace semsim
{
namespace annotation
{
using ReferenceOntology = semsim::definitions::ReferenceOntologies::ReferenceOntology;
/**
... | true |
bc246b801d02e5c44f9de6763b4f527c123ae057 | C++ | TommyTeaVee/HelixGame | /project/helix.cpp | UTF-8 | 7,522 | 2.546875 | 3 | [] | no_license | // helix.cpp
// implementazione dei metodi definiti in helix.h
#include <stdio.h>
#include <math.h>
#include <GL/gl.h>
#include <GL/glu.h>
#include <vector>
#include <stdlib.h>
#include <time.h>
#include "helix.h"
#include "point3.h"
#include "mesh.h"
#include "objects.h"
// variabili globali di tipo mesh
Mesh ca... | true |
6e3628fb25a74669107b8dcdf45197871018bed6 | C++ | bahmad30/Blackjack-AI | /tests/test_deck.cc | UTF-8 | 3,506 | 3.59375 | 4 | [] | no_license | #include <catch2/catch.hpp>
#include "deck.h"
namespace blackjack {
TEST_CASE("Deck constructor") {
Deck deck;
std::vector<Card> cards = deck.GetCardsInDeck();
SECTION("52 cards") {
REQUIRE(cards.size() == 52);
}
SECTION("No cards in table") {
REQUIRE(deck.GetCardsOnTable(... | true |
c143a3b50e595caa6a67caa4fbdac7c84ed2f746 | C++ | niuxu18/logTracker-old | /second/download/mutt/gumtree/mutt_repos_function_60_last_repos.cpp | UTF-8 | 215 | 2.578125 | 3 | [] | no_license | static int pad (FILE *f, int col, int i)
{
char fmt[8];
if (col < i)
{
snprintf (fmt, sizeof(fmt), "%%-%ds", i - col);
fprintf (f, fmt, "");
return (i);
}
fputc (' ', f);
return (col + 1);
} | true |
d72d47b09f8c27dae98719df69fe8de602996729 | C++ | 6Kwecky6/Cpp2020 | /Oving4/Part2.h | UTF-8 | 1,538 | 2.828125 | 3 | [] | no_license | //
// Created by Kwecky on 13/09/2020.
//
#ifndef OVING4_PART2_H
#define OVING4_PART2_H
#include <gtkmm.h>
class Window : public Gtk::Window {
public:
Gtk::VBox vbox;
Gtk::Entry firstNameEntry;
Gtk::Entry lastNameEntry;
Gtk::Button button;
Gtk::Label resultText;
Gtk::Label firstNameText;
G... | true |
65871e86d1ec5f8a9dd61e80696ef0109fd34d1e | C++ | Antoniano1963/vscode_cpp | /Week2/Test8.cpp | UTF-8 | 289 | 2.6875 | 3 | [] | no_license | #include<iostream>
#include<string>
#include "big_operation.h"
using namespace std;
int main(){
string str1;
cin >> str1;
string str2;
cin >> str2;
big number1 = big(str1);
big number2 = big(str2);
big result = number1 + number2;
cout << result.print();
} | true |
f14529d4832f01b00e434d1b253995fbbaa83a36 | C++ | alumican/ofxCommand | /src/command/Serial.h | UTF-8 | 884 | 2.671875 | 3 | [
"MIT"
] | permissive | #pragma once
#include "CommandList.h"
namespace cmd {
class Serial : public CommandList {
// ----------------------------------------
//
// MEMBER
//
// ----------------------------------------
public:
protected:
private:
Command* currentCommand;
int position;
// ------------------------... | true |
b089101484e18eecd4395f8f5c63bfebd9f50bae | C++ | y2kiah/icarus | /Icarus/source/Resource/Impl/ResHandle.inl | UTF-8 | 2,930 | 2.875 | 3 | [] | no_license | /* ResHandle.inl
Author: Jeff Kiah
Orig.Date: 06/01/2012
*/
#pragma once
#include "Resource/ResCache.h"
// class ResHandle
///// TEMPLATE FUNCTIONS /////
/*---------------------------------------------------------------------
load is used to retrieve a resource from disk or the cache (if
available) in a sychronou... | true |