blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 2 247 | content_id stringlengths 40 40 | detected_licenses listlengths 0 57 | license_type stringclasses 2
values | repo_name stringlengths 4 111 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringlengths 4 58 | visit_date timestamp[ns]date 2015-07-25 18:16:41 2023-09-06 10:45:08 | revision_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | committer_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | github_id int64 3.89k 689M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 25
values | gha_event_created_at timestamp[ns]date 2012-06-07 00:51:45 2023-09-14 21:58:52 ⌀ | gha_created_at timestamp[ns]date 2008-03-27 23:40:48 2023-08-24 19:49:39 ⌀ | gha_language stringclasses 159
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 7 10.5M | extension stringclasses 111
values | filename stringlengths 1 195 | text stringlengths 7 10.5M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
26c401a49d61120bd574708fb859ecae70389c82 | 65fbebdbb29f5cb9fcd455c52441c7d7291c0178 | /2014.2/source/rotationanimation.h | 7a86abfe4b14a664c421a32784d9250aa1303e4c | [
"CC0-1.0"
] | permissive | DataBeaver/skrolli_gl | 4cbdb62a646a6b7bb199c2837674bf4eee2c8a44 | e95bb33d15fc2255804dd3714d73bdef60b67241 | refs/heads/master | 2020-06-05T07:43:46.074184 | 2014-10-29T11:15:12 | 2014-10-29T11:15:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 808 | h | rotationanimation.h | #ifndef SKROLLIGL_ROTATIONANIMATION_H_
#define SKROLLIGL_ROTATIONANIMATION_H_
#include "animation.h"
namespace SkrolliGL {
/*
Animates an Instance by rotating it around an axis.
*/
class RotationAnimation: public Animation
{
private:
Matrix base_translation;
Matrix base_rotation;
char axis;
float angle;
public:... |
3056c335d9b747473a76d1d390cb752766716e71 | a243534aa5ab5490b94087fa5ad5513503db4a53 | /Platformer 1/LevelManager.cpp | e3b3969096132881e632c096f4c902056ffa2c2d | [] | no_license | Lijmer/platformer_1 | 1ecdd0cb67c2432148c042bb25bdb2913cbeeddc | bde7287e253316b1080f571ef341fc135228dc1a | refs/heads/master | 2020-05-17T01:22:41.154110 | 2013-07-03T10:16:06 | 2013-07-03T10:16:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,318 | cpp | LevelManager.cpp | #pragma region Includes
#include "LevelManager.h"
#include <allegro5/allegro_native_dialog.h>
#include "GameObjectManager.h"
#include "FileManager.h"
#include "DisplayManager.h"
#include "ImageManager.h"
#include "SoundManager.h"
#include "Background.h"
#include <iostream>
#include <sstream>
#pragma endregion
//Publi... |
e7bfd0e7d929850353466bfe4b4ac9246dd6c298 | bef56ea19df6f3e540c101b8517a2114675b804a | /APIGame_base/ColliderOfMapSC.h | 2497e87f2324906d5c2d9e7c4360bdbf1e89d47f | [] | no_license | kwt1326/2DProject | 2b0b829dd7331ca4ad3aa87e5c529fe157e23fb3 | 940f0721ac5e4e216ef9b763ac888260aad34fb0 | refs/heads/master | 2022-01-27T23:41:33.703150 | 2022-01-17T00:31:28 | 2022-01-17T00:31:28 | 149,836,434 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 326 | h | ColliderOfMapSC.h | #ifndef _COLLIDEROFMAPSC_H_
#define _COLLIDEROFMAPSC_H_
#include "Component.h"
#include "Vector2.h"
#include "Transform.h"
class ColliderOfMapSC : public Component
{
public:
ColliderOfMapSC();
~ColliderOfMapSC();
public:
virtual void Update(float dt);
virtual void Init();
virtual void Release();
public:
};
... |
be6a325fb1abe5404f27f1edb54cc46494d664b7 | 9aa174f735d3450a8c8f653c07731a6d498f89f0 | /source/itk/vs-convert.cxx | 3d1c249f1c7b73082becab9ed7e5d265e0f4ae60 | [] | no_license | cha63506/rdi-reader | b5b69f3b17113297f4d37bb67e0bf25b099fb6fc | 62e0113feaaf3a929fb752a9f4fd288df3d8a365 | refs/heads/master | 2017-12-03T18:14:16.215159 | 2015-07-20T02:51:04 | 2015-07-20T02:51:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,644 | cxx | vs-convert.cxx | /**
* @file vs-convert.cpp
* @brief command line converter
* @date 2009-07-23
*/
#include <exception>
#include <fstream>
#include <memory>
using namespace std;
#include "itkArchetypeSeriesFileNames.h"
#include "itkExtractImageFilter.h"
#include "itkImage.h"
#include "itkImageFileReader.h"
#include "itkImageFileWr... |
72063178f1127629a052e94331e5f8a4c2319afa | 101b8f5ec4936e2aa1cb06e6315df63bf0293e3a | /LTMT_Final_Round/DoiTien.cpp | 04576f1a8179288cf4597b19aa0f8ea26daab145 | [] | no_license | VincentTr4n/Cpp | 69075ef51e50499784c67b1f362eb1116e94a542 | d9874accc67ba2cc807ecb14caa6b4af1124aad0 | refs/heads/master | 2020-03-12T13:19:21.781223 | 2019-09-16T15:58:04 | 2019-09-16T15:58:04 | 130,639,446 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 850 | cpp | DoiTien.cpp | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <map>
#include <numeric>
#include <vector>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define FORD(i,a,b) for(i=b;i>=a;i--)
#define ford(i,n) FORD(i,0,n-1)
#define sqr(x) ((x)*(x))
#define ll lo... |
1d7982a51270d4e76e455baa98cd96f253bc4646 | 559a00d4367374b367d4999167743ec6d7387640 | /algorithms/numbers/prime numbers/primality test/Chinese Primality Test/chinese_primality_test.cpp | 83b12d6133de7bab191648e33f354ee54c40eb4f | [] | no_license | michal367/Algorithms-and-Data-Structures | 0cd0787393ebefaef19d5d1056b6d9de321e05d7 | 4aee40daac9c3292f3e5ac36010cf789354c26c7 | refs/heads/master | 2023-01-02T18:46:24.144935 | 2020-10-28T10:42:06 | 2020-10-28T10:42:06 | 307,850,924 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,243 | cpp | chinese_primality_test.cpp | #include <iostream>
#include <cstdlib>
using namespace std;
typedef unsigned long long ulong;
ulong multiply_modulo(ulong a, ulong b, ulong n)
{
ulong sum = 0;
while(b != 0)
{
if(b & 1)
sum = (sum + a) % n;
a = (2*a) % n;
b = b >> 1;
}
return sum;
}
ulong powe... |
5cb24245abe4ce87bccf1990bd22d94069a644c9 | 417e7a2b5d53feef67b6464fbc18c40613b9c411 | /src/main.cpp | 0b7a2e114e25b3b95d4c6ecf6428c817df002a3f | [] | no_license | rodolphoess/Laboratorio-01 | 6dbe0d14d335c2b0ed6ba65fbf55486fee54adf0 | 918d46952520161838647b4fd1b0e3d47918b88e | refs/heads/master | 2020-05-22T06:31:00.414486 | 2017-04-02T20:45:00 | 2017-04-02T20:45:00 | 84,679,080 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 630 | cpp | main.cpp | /**
* @file main.cpp
* @brief Programa que calcula a área e perímetro para figuras geométricas planas e a área e volume para figuras geométricas espaciais.
* @author Nicolas Ghirello e Rodolpho Erick.
* @since 09/03/2017
* @data 11/03/2017
*/
#include <iostream>
#include "menu.h"
using std::cin;
using std... |
12c98387baa1812221ffefd0a74463e05277e71b | 4013c4b81a54d615067b2faa7e8ca278132b7fe5 | /Quickhull.h | 3ba38bfc0457832c9852b7093f9c9b5932e3c3f0 | [] | no_license | vuehrjer/Quickhull_Marius | fcdd40ec1b4701f2e6108f97cefc19cbaf88f3d5 | 1104e5b5fa66cfea1330d2b49a3806e47832c0e9 | refs/heads/master | 2020-09-23T00:28:50.152553 | 2019-12-02T18:00:37 | 2019-12-02T18:00:37 | 225,353,449 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 582 | h | Quickhull.h | #pragma once
#include <vector>
#include "Point.h"
class Quickhull
{
public:
Quickhull(std::vector<Point> p, bool render);
std::vector<Point> findExtremes(std::vector<Point> p);
std::vector<std::vector<Point> >getAllHulls();
std::vector<Point> GetHull();
private:
std::vector<std::vector<Point> > allHulls;
void Fi... |
0e2159486520269d8c34455d539dc9921ae1b3f1 | 75d3b0272ce6e615d99d89faed5ee993305d35df | /第十二题_矩阵中的路径/solution.cpp | 1e6d1fb648743159ff08014d57eb25f18b08a584 | [] | no_license | yukaizhou/CodeInterview | efa88a20352fc8abaeca1287d0a3ab820f1eed66 | 3397b607c28ecae07e9a98b6ab7da6d8c5c5f361 | refs/heads/master | 2021-10-25T00:48:31.670655 | 2019-03-30T23:54:40 | 2019-03-30T23:54:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,187 | cpp | solution.cpp | class Solution {
public:
bool hasPath(char* matrix, int rows, int cols, char* str)
{
for(int row = 0; row < rows; row++)
for(int col = 0; col < cols; col++)
if(found(matrix, row, col, str, rows, cols))
return true;
return false;
}
... |
d362709d23aadcb59195ca1391f7f57992da18a6 | b04a481521d3fd679254035f4bf751a29a6393cd | /Coktel/chefcito.h | f8c3e69a833048d690defc6b848abbce99deee02 | [] | no_license | Igneel-san/cocktel | 349242485e627a1bb5c45e86ac04b89ff6542546 | 44d6d6426815dc6fa2c94e9654982402844f859f | refs/heads/master | 2021-05-19T00:20:47.197001 | 2020-03-31T03:45:05 | 2020-03-31T03:45:05 | 251,491,688 | 0 | 0 | null | 2020-03-31T03:45:06 | 2020-03-31T03:32:12 | C++ | UTF-8 | C++ | false | false | 208 | h | chefcito.h | #pragma once
/*
* Chefcito.h
*
* Created on: Mar 23, 2020
* Author: curso
*/
#ifndef CHEFCITO_H_
#define CHEFCITO_H_
class Chefcito {
public:
Chefcito();
virtual ~Chefcito();
};
#endif /* CHEFCITO_H_ */
|
edd50ba9fd4cd06bd5c907bc7080cd70f912a2ed | 94cd871620957138dbdbe5a0c5416f0e9757a4ff | /parser/ast/antlr_tree_walker.cpp | 302c22e5ba33ffb7d783315dadc30fb14408366f | [
"Apache-2.0"
] | permissive | perbone/luascript | 39cb96372986561894cc154fefd2eedbdd01ed80 | bc156cd60959060323d1f70578e38aa9813588d1 | refs/heads/master | 2023-07-20T01:10:22.984438 | 2023-07-11T00:30:07 | 2023-07-11T00:30:07 | 101,610,955 | 559 | 52 | Apache-2.0 | 2022-10-11T02:43:56 | 2017-08-28T06:27:19 | C++ | UTF-8 | C++ | false | false | 1,964 | cpp | antlr_tree_walker.cpp | /*
* This file is part of LuaScript
* https://github.com/perbone/luascrip/
*
* Copyright 2017-2023 Paulo Perbone
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apac... |
8bedc1333e75733b75c833301a792aaa6baf05c7 | 8c89782663a343f7c3d362573620f79d275a6142 | /src/2000/2581.cpp14.cpp | 4d9c5cf342210c2c0ba5c95adcf096a8fbe836ed | [
"MIT"
] | permissive | upple/BOJ | 14a8c8e372131b9a50ba7c1e7428ba7e57b4702d | e6dbf9fd17fa2b458c6a781d803123b14c18e6f1 | refs/heads/master | 2021-06-21T07:17:57.974279 | 2019-06-28T17:56:30 | 2019-06-28T17:56:30 | 128,779,781 | 13 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 449 | cpp | 2581.cpp14.cpp | #include<cstdio>
#include<vector>
#include<cmath>
#define INF 1010101010
#define min(x, y) (x<y?x:y)
using namespace std;
int main()
{
int a, b, m=INF, ans=0;
vector<int> prime;
scanf("%d %d", &a, &b);
if (a < 2)
a = 2;
for (int i = a; i <= b; i++)
{
int j;
for (j = 2; j <= sqrt(i); j++)
if (!(i%j))
... |
6fa035c081c19142608bb3c6de10c66261f2e366 | 2c37015795f9d3a731998602e763788d2a2086f6 | /Tigger/Resources.h | 2c6ecc94c307c7c815b5eeaa470097c8e959c7d0 | [] | no_license | ApostaC/MiniC | 8e4ac32ad47826394226a0083249138e2825dce3 | 0d950b331d510e624406af4364bf5456b906176c | refs/heads/master | 2020-04-14T01:33:38.866294 | 2018-12-31T07:44:48 | 2018-12-31T07:44:48 | 163,563,025 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,289 | h | Resources.h | #ifndef _RESOURCE_HH_
#define _RESOURCE_HH_
#include <string>
#include <vector>
#include <set>
#include <map>
namespace res
{
class RightVariable; /* imm-value or eeyore-var */
class ImmediateVal; /* imm-value */
class EeyoreVariable; /* eeyore-var */
class VarPool; /* Pool for eeyore-var */
//class... |
53fbfd239dec15de381a2cbdcff5c8b08667133f | 3bbc63175bbff8163b5f6b6af94a4499db10a581 | /MyPCHunter/bk/MyTaskmgr/MyCMDDlg.cpp | d8c8cdbf9a4dc5a83b0054151649e43b48409d2d | [] | no_license | chancelee/MyProject | 76f8eb642544a969efbb10fa4e468daeba5b88ef | 62f5825b244f36ed50f6c88868e13670e37281d5 | refs/heads/master | 2021-09-16T01:31:00.158096 | 2018-06-14T10:08:42 | 2018-06-14T10:08:42 | null | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 7,194 | cpp | MyCMDDlg.cpp | // MyCMDDlg.cpp : implementation file
//
#include "stdafx.h"
#include "MyTaskmgr.h"
#include "MyCMDDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// CMyCMDDlg dialog
CMyCMDDlg::CMyC... |
82189790d60fa05bb4c053b2bd2868762c1f0230 | 0b872963054916ea22c4155b704d66ca56ea42ef | /shadow/operators/shuffle_channel_op.hpp | d12243e258cba5dcb7d3260265e11f42f1036c45 | [
"Apache-2.0"
] | permissive | Arui1/shadow | 2be651e4e1010e5184d4e20cc94a759c505849d4 | af0c8c6c350bb11a3f4eeec9fd8affe9439ddc00 | refs/heads/master | 2022-04-12T23:51:09.184471 | 2020-03-27T03:13:20 | 2020-03-27T03:13:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 753 | hpp | shuffle_channel_op.hpp | #ifndef SHADOW_OPERATORS_SHUFFLE_CHANNEL_OP_HPP
#define SHADOW_OPERATORS_SHUFFLE_CHANNEL_OP_HPP
#include "core/operator.hpp"
namespace Shadow {
class ShuffleChannelOp : public Operator {
public:
ShuffleChannelOp(const shadow::OpParam &op_param, Workspace *ws)
: Operator(op_param, ws) {
group_ = get_sing... |
407947904be460708dc00a3486f7ce4dd6011af0 | 35e4fc20590772d39caf36d9eb84aa697a4292aa | /gr-capture_tools/lib/annotated_to_msg_f_impl.cc | da43ef7c8f2c45e08259f2a3f473f6b9b69b6e7c | [] | no_license | rubund/capture-tools | f991bc0906a28d119e5f28e43e5df8e2c1ca55f3 | 6e9ba6faebf1e99afb159ef7ee7bcbd3910f2aaf | refs/heads/master | 2022-07-28T16:42:30.429650 | 2022-03-31T12:43:01 | 2022-03-31T12:43:01 | 62,948,019 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,798 | cc | annotated_to_msg_f_impl.cc | /* -*- c++ -*- */
/*
* Copyright 2017 <+YOU OR YOUR COMPANY+>.
*
* This is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3, or (at your option)
* any later version.
*
* This software i... |
7f0a1e5da88a8bd5351d47bd44a6629de756c09b | 2e9dd6d2fa156cfc0edbdcc66979870f3a5aca14 | /EdgeEffect.cxx | ffaa2c5c7dc570dd330b62fea1533595b397442b | [] | no_license | awiles/DanceWall | 025b31931a60cef8302e4af9c94432d824e5d714 | 87c7767a5d07edff27de3d1cc01dbe3259a56f32 | refs/heads/master | 2020-06-18T09:23:08.346542 | 2017-06-10T17:20:40 | 2017-06-10T17:20:40 | 75,146,970 | 0 | 0 | null | 2017-06-09T18:34:43 | 2016-11-30T03:21:32 | C++ | UTF-8 | C++ | false | false | 1,060 | cxx | EdgeEffect.cxx | #include "EdgeEffect.h"
EdgeEffect::EdgeEffect()
{
// constructor.
this->init();
}
void EdgeEffect::init()
{
this->m_blurKernelSize = 3;
this->m_cannyThreshold1 = 10;
this->m_cannyThreshold2 = 30;
this->m_cannyApertureSize = 3;
return;
}
void EdgeEffect::drawEffect()
{
if( this->m_lastFrame.empty() )
{
... |
bf9aec72f03b95b5c5c659714fcbb7e55aa7d686 | a4be3081b577829057680252a34abd5e79419a04 | /TuringMachine.cpp | 02beac24824450bf6f45abb7897a2daf58264c7f | [] | no_license | minad/turing | 4cfe077077f05b460298d8af30dc607c6346dc98 | cbc8a46c8f223d0edc9e26618c26913817841b28 | refs/heads/master | 2023-08-22T18:13:43.861763 | 2017-03-06T20:58:40 | 2017-03-06T20:58:40 | 84,120,275 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,196 | cpp | TuringMachine.cpp | #include "TuringMachine.h"
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
const char TuringMachine::Tape::BLANK = '#';
TuringMachine::TuringMachine(const char *program)
: state("INIT"), halted(false)
{
readProgram(program);
}
TuringMachine::TuringMachine(... |
d3ab6967e59f520d9a74ef98ca7db096f2adc0d0 | a2d74f1929768f584593080f660285b9be34b74b | /week6/kwon/2017_02_14_BAEKJOON_11399.cpp | f9276e78cd9af4f68fc1c32953e9b3238c68ed00 | [] | no_license | eubnaraAlgorithmStudy/400617 | c66091db2106de92dfeacdf10701032a2b888aa3 | 56aef7894e23d64e37efa7b789f3c0da47e98451 | refs/heads/master | 2021-01-13T12:17:20.544944 | 2018-02-25T04:35:02 | 2018-02-25T04:35:02 | 78,322,588 | 4 | 0 | null | null | null | null | UHC | C++ | false | false | 829 | cpp | 2017_02_14_BAEKJOON_11399.cpp | #include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int N;
int temp;
vector<int> input;
vector<int> result;
void ATM()
{
for (int i = 0; i < N; i++)
{
if (i == 0)
{
result[i] = input[i];
}
else
{
result[i] = result[i - 1] + input[i];
}
}
// 정렬, greedy algorithm에 의해, 앞에... |
58063095ae22adb05e6fbfed7bad302f582252e9 | 917e551cb9cbc4a1222369e9e826ac4532400e25 | /100-199/101/141D/c++.cpp | 2e1acf224b1f651ad2a0c8d1f8ad6687c461d92b | [] | no_license | mkut/cf | 3463329a212b43e1f09a8a68c999793d78026da2 | cc0876c2047fdabd154748025da3ecef12cfea64 | refs/heads/master | 2016-09-01T23:52:59.308588 | 2013-11-19T19:14:40 | 2013-11-19T19:16:17 | 2,326,614 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,155 | cpp | c++.cpp | #include <milib/template/aoj>
#include <set>
#include <map>
#include <queue>
#include <vector>
struct state {
int cost;
int pos;
int prev;
int ramp;
state(int cost, int pos, int prev, int ramp) : cost(cost), pos(pos), prev(prev), ramp(ramp) {}
bool operator<(const state& b) const {
return cost > b.cost;
}
};
... |
cadc60a62ce7b7aca87417f29a28a895dd49f4c5 | 9b2d99b47ab7b29f71e90ba595b7247f5aa0b14a | /week10/poker_chips/main.cpp | 24745d596771c304df1012aa7aa06e2723584362 | [] | no_license | hiddely/eth-algolab | 19204345a99a960aa0d62aad87bc74471f9d6ccf | e6633f9c7128f8664c1cacd80783d09de80dabec | refs/heads/master | 2021-10-12T01:09:42.414207 | 2019-01-31T11:41:16 | 2019-01-31T11:41:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,149 | cpp | main.cpp | //
// Created by Hidde Lycklama on 1/6/19.
//
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
const bool VERBOSE = false;
struct DefaultMinusOne {
int val = -1;
};
//int combiFour[4][4] = {
// {
// 1, 1, 1, 1
// },
// {
// ... |
35baa6db4166df5e1640040c5425237672fbb61f | 4736440cd0d243d85fba9baa01d8bccb06982e41 | /AksKMap/KMapExp.h | 97c9a3c0778089eb6afde34860cf8294bbcd2c5d | [] | no_license | google-code/aksharamala | 409b4e9f4d45a95836d44519ce9a003e6c9493eb | edc6acdf69e4ca0462132a6e8f602cfce720eb24 | refs/heads/master | 2016-08-07T04:04:12.736351 | 2015-03-14T12:50:03 | 2015-03-14T12:50:03 | 32,211,538 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 8,366 | h | KMapExp.h | // ==================================================================
// Copyright © 2001-2005 Srinivas Annam
//
// History:
// Jan 13, 2001: Increased the ambiguity length (for Chanakya).
// Oct 21, 2002: Added new features - paste bmp, pastelit bmp.
// ==========================================================... |
d2c399aed910195c61c972aefca41ed69ed0cd0e | 5f0a95d0a3cef2fdab8570fa8171d735c8270940 | /packet-collector/packet-collector.cc | 5fce824d2480a68ecb1eee9b5096ae5790ba39d2 | [] | no_license | dtnaylor/cuda-router | 33fed63c40a79fe1b65d3990523ba4879cb0483d | 53cfb1c51480561582dce214c68f9ccf3bcee683 | refs/heads/master | 2021-01-19T06:58:24.988828 | 2012-12-04T16:42:55 | 2012-12-04T16:42:55 | 6,459,239 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,034 | cc | packet-collector.cc | #include "packet-collector.hh"
int batch_size = DEFAULT_BATCH_SIZE;
int batch_wait = DEFAULT_BATCH_WAIT;
#ifdef RETURN_PACKETS_IMMEDIATELY
packet *random_buf = NULL;
#endif
int init_server_socket() {
int sockfd;
struct sockaddr_in servaddr;
if ((sockfd = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP)) < 0) {
pe... |
2a937cdd4c0912d85fc2163b09f729d5b40896ea | cfeac52f970e8901871bd02d9acb7de66b9fb6b4 | /generated/src/aws-cpp-sdk-ssm/include/aws/ssm/model/InstancePatchStateFilter.h | 36e3e88b1c7cf40212952169daa2ec5184f67680 | [
"Apache-2.0",
"MIT",
"JSON"
] | permissive | aws/aws-sdk-cpp | aff116ddf9ca2b41e45c47dba1c2b7754935c585 | 9a7606a6c98e13c759032c2e920c7c64a6a35264 | refs/heads/main | 2023-08-25T11:16:55.982089 | 2023-08-24T18:14:53 | 2023-08-24T18:14:53 | 35,440,404 | 1,681 | 1,133 | Apache-2.0 | 2023-09-12T15:59:33 | 2015-05-11T17:57:32 | null | UTF-8 | C++ | false | false | 10,406 | h | InstancePatchStateFilter.h | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#pragma once
#include <aws/ssm/SSM_EXPORTS.h>
#include <aws/core/utils/memory/stl/AWSString.h>
#include <aws/core/utils/memory/stl/AWSVector.h>
#include <aws/ssm/model/InstancePatchStateOperatorType.h... |
24a480b23d7e3aedd14080a04a01c2eed80d0ee9 | b49c432c23f9fc0e88bba6bc12438e3f56b497be | /app/src/main/cpp/io/include/block-inl.h | bf6538fdb943baceae8bcb5d36fd36710e30c676 | [] | no_license | skyformat99/EncryptedIO | 39bf277bd2f048d4a9cd2ea856ab000b0d186d41 | 9887f3b7652337f8c6911d0305871e4754b3280d | refs/heads/master | 2021-01-20T07:41:12.310428 | 2017-01-06T02:07:51 | 2017-01-06T02:07:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 479 | h | block-inl.h | /*
* Author: wangyun
* Date: 2016-12-30
* Email: yun.wang@vmplay.com
* LastUpdateTime: 2017-01-03
* LastUpdateBy: wangyun
*/
#ifndef ENCRYPTED_BLOCK_INL_H
#define ENCRYPTED_BLOCK_INL_H
#include "block.h"
namespace tools {
inline const char* Block::getConstData() const {
return (const char *)mData_;
}
inline cha... |
81677a734f56693c845405fae8794aa5e412466b | 03d4e39d8fda4d1b8b70628e95b0ca3f6034dd17 | /Code/mcApp/CmcMvcs.cpp | 5d92a1177f8998bd7c641f85fbb6bdc607c50fd8 | [] | no_license | hbdlyao/HVDC-MT | ab464e68645f2aae3881bc27547ef5643a55f63d | d7ee695d2b136b46402fcf298ffecd18ee662e3a | refs/heads/master | 2021-01-21T20:56:39.518812 | 2017-06-02T03:03:17 | 2017-06-02T03:03:17 | 92,291,963 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 3,091 | cpp | CmcMvcs.cpp | ///////////////////////////////////////////////////////////
// CHvdcMvcs.cpp
// Implementation of the Class CHvdcMvcs
// Created on: 24-3月-2017 20:58:52
// Original author: Administrator
///////////////////////////////////////////////////////////
#include "CmcMvcs.h"
#include "CmcParams.h"
#include "CmcVars.h... |
2465baac215e2e533438c072d6308d6de97dd735 | c17cc8590ecd54b6466b0f10ad965c87c616845b | /engine/core/clock/RealTimeClock.h | a1558329354a67c730777f7311a437152a124a9b | [] | no_license | andreduvoisin/CompositeEngine | a497d23b01aee18e8dec306a3197da66721da218 | 1370399421980b2d17c4544a982101d4ac2264bd | refs/heads/master | 2023-03-18T19:43:36.573531 | 2020-07-03T06:52:03 | 2020-07-03T06:52:03 | 173,540,984 | 17 | 3 | null | 2021-03-12T01:08:50 | 2019-03-03T06:46:51 | C++ | UTF-8 | C++ | false | false | 237 | h | RealTimeClock.h | #ifndef _CE_REAL_TIME_CLOCK_H_
#define _CE_REAL_TIME_CLOCK_H_
#include "Clock.h"
#include "common/Singleton.h"
namespace CE
{
class RealTimeClock : public Clock, public Singleton<RealTimeClock> { };
}
#endif // _CE_REAL_TIME_CLOCK_H_ |
893239600039453d77776229c43f12f68b738784 | b5394dc0bca6410a6b789385eac2cdaacacd92c8 | /a4/q2tallyVotesMC.cc | dc274f013354a0e0f91b67a6a60240bb47208f35 | [] | no_license | deerishi/CS343-assignments | abcc228e90fc0e04371ac4598e919df46262c9b4 | 1e8d9c3046284face3c493656d340d1ca12ade6c | refs/heads/master | 2020-12-03T04:18:10.689139 | 2017-06-30T04:23:55 | 2017-06-30T04:23:55 | 95,847,713 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,002 | cc | q2tallyVotesMC.cc |
#ifndef PRINT_H
#include "q2printer.h"
#define PRINT_H
#endif
#ifndef STD
#include<iostream>
using namespace std;
#define STD
#endif
#ifndef MPRNG_H
#define MPRNG_H
#include "MPRNG.h"
#endif
//Defining the constructor for the type MC. This has a barging flag
TallyVotes::TallyVotes( unsigned int group, Printer &... |
cd38557f7788fe4659f93fc2a6698c5d8995c7ed | 5bb92ef8c91d26e1b3369f6ba4862e71ffb79aa2 | /src/Card.cpp | 5037eaf181868898a854dacb2c541e4aa01d9601 | [] | no_license | adrienruault/pokerbot | 18b23cdef684b15333cb0b4b646cbd09c1fc74f4 | 5ec43b8c38b7c84fe33d04f5ceff014cd6a5778c | refs/heads/master | 2021-08-22T04:51:11.917337 | 2017-06-23T15:02:23 | 2017-06-23T15:02:23 | 112,459,384 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,661 | cpp | Card.cpp | /*
* card.cpp
*
* Created on: Mar 5, 2017
* Author: adrien
*/
#include "Card.hpp"
// Default constructor that initializes an empty card (0,0)
Card::Card()
{
mrank=0;
msuit=0;
}
// Constructor that initializes an card with the provided rank and suit
Card::Card(const int rank, const int suit)
{
if... |
37f39f682af50d1be115080022612de1a48ed446 | 91942c619314962ed3aabce39a2437e40a1096c6 | /cpp/binarytrees.gpp-9.c++ | 454496c3a19425d904ddb4541a6b93a324d0c5eb | [] | no_license | adenzhang/benchmarksgame | e545d95bbf6c385da4bf282dce3b7e6c4b2cf093 | 87377a142988d2576cb9289097cb0625f1792e10 | refs/heads/master | 2020-03-29T23:50:19.821578 | 2020-02-07T23:00:57 | 2020-02-07T23:00:57 | 150,491,513 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,097 | binarytrees.gpp-9.c++ | /* The Computer Language Benchmarks Game
* https://salsa.debian.org/benchmarksgame-team/benchmarksgame/
*
* contributed by Jon Harrop
* modified by Alex Mizrahi
* modified by Andreas Schäfer
* very minor omp tweak by The Anh Tran
* modified to use apr_pools by Dave Compton
* *reset*
*/
#include <iostream>
#i... | |
c17f9e58df97263a9e2ed3c540929dd2d683a70a | 5acf48b516af6ba29cb2208ff47a7491f6fd758e | /src/shapes/curve.h | 822bc1411bf6cc9baae649ef5cc0b1bfcb0be401 | [
"BSD-2-Clause",
"BSD-3-Clause"
] | permissive | mmp/pbrt-v3 | 1342e48431beb32dba2abdee17adfe47c5d3c405 | 13d871faae88233b327d04cda24022b8bb0093ee | refs/heads/master | 2023-09-05T13:56:59.387502 | 2023-09-03T11:37:35 | 2023-09-03T11:37:35 | 37,482,419 | 5,006 | 1,494 | BSD-2-Clause | 2023-05-18T05:23:46 | 2015-06-15T18:13:08 | C++ | UTF-8 | C++ | false | false | 3,458 | h | curve.h |
/*
pbrt source code is Copyright(c) 1998-2016
Matt Pharr, Greg Humphreys, and Wenzel Jakob.
This file is part of pbrt.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
- Redi... |
9b18b3932bad3f8f5ab29068e0fb3ddc8270901d | 52c0949315583ba8898694cceacfaafaeab6f902 | /test/include/test_util/ssb/star_schema_query.h | 4a2de4df264757adede832502bf4d8fd3284d0be | [
"MIT"
] | permissive | cmu-db/noisepage | 97093adcc9474419e063fdd97a5aa7a7ea6f3150 | 79276e68fe83322f1249e8a8be96bd63c583ae56 | refs/heads/master | 2023-08-29T05:51:04.628704 | 2021-11-05T14:12:08 | 2021-11-05T14:12:08 | 140,325,970 | 1,245 | 287 | MIT | 2022-11-08T02:06:48 | 2018-07-09T18:22:34 | C++ | UTF-8 | C++ | false | false | 4,094 | h | star_schema_query.h | #include <memory>
#include <tuple>
#include "catalog/catalog_accessor.h"
#include "execution/compiler/executable_query.h"
namespace noisepage::ssb {
class SSBQuery {
public:
/// Static functions to generate executable queries for SSB benchmark. Query plans are hard coded.
static std::tuple<std::unique_ptr<execut... |
8f099262fc16010ec66d774194dd4a5e93bb16c6 | 74870e1d278f20027ea0213d9d87ee6128a01f65 | /Q6593 2.cpp | 643fadfbf0b406f7599719ca2309a85d9440f715 | [] | no_license | jleun1403/BOJ_CPP | 795816db9e8a2828ec48aaf9f8da9276d4b0abef | 415502a8fd7093f469a3b7bf1c5e756505ae0e76 | refs/heads/master | 2020-07-10T01:28:42.157301 | 2019-08-24T11:41:03 | 2019-08-24T11:41:03 | 204,131,610 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,098 | cpp | Q6593 2.cpp | #include <bits/stdc++.h>
using namespace std;
char a[33][33][33];
int dx[6] = { 0,1,0,-1,0,0 };
int dy[6] = { 1,0,-1,0,0,0 };
int dz[6] = { 0,0,0,0,1,-1 };
int d[31][31][31];
struct Escape{
int x, y, z;
};
queue <Escape> q;
int main(){
while(true){
int n, m, k;
scanf("%d %d %d", &k, &n, &m);
... |
689428858c48ee272cec7707a71dcf9d9273fa88 | b3280d68f0cd655e5237236a3834fadb3915fb6b | /hurdle race.cpp | 85c06731b1c90e19d8b9dc51ddd1e0969f9f391d | [] | no_license | shivani1singh/hacktoberfest2021 | fcbe336de6349534ce2e3ea5829e93007175384e | 1956b9e369c5d2068b4f3c822869c3504e5b7afa | refs/heads/main | 2023-08-28T13:55:20.505058 | 2021-10-20T13:19:49 | 2021-10-20T13:19:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 249 | cpp | hurdle race.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k,i,maxd=0;
cin>>n>>k;
int height[n];
for(i=0;i<n;i++)
{
cin>>height[i];
maxd=max(maxd,height[i]);
}
cout<<max(0,maxd-k);
return 0;
}
|
6e91b6d5b70871b5204f3b42aca9811b9e36ad9d | c2233581c9fcf627e3958ad351ccee10eb05ea7d | /Mini-FSU_Tool/src/product/DCD9500/ChannelSetDialog/ChannelItemWidget/SignalIdsEditDialog.cpp | 9f93086116ce8ae18bca05303cf5d80520fc3434 | [] | no_license | caiweijianGZ/Mygit | 3b796067f99e53440c581f7c20add0a659dd73ed | 90652195a04e360ed68c03a3d4b6ca8323b52021 | refs/heads/master | 2020-04-23T06:51:01.784298 | 2019-02-17T15:04:39 | 2019-02-17T15:04:39 | 170,987,737 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,012 | cpp | SignalIdsEditDialog.cpp | #include "SignalIdsEditDialog.h"
#include "ui_SignalIdsEditDialog.h"
SignalIdsEditDialog::SignalIdsEditDialog(QWidget *parent) :
SignalIdsEditDialog(QByteArray() ,parent)
{
}
SignalIdsEditDialog::SignalIdsEditDialog(const QByteArray &src, QWidget *parent) :
QDialog(parent),
ui(new Ui::SignalIdsEditDialog... |
224d4cbd5dd51ef9a4b2052eaab476c823b144a5 | b6f3cdbe8de6142f48ea5b6a0ef4a118bf300c15 | /FractalTree-master/FractalTree/Src/Server/UDPServer.h | 5ea1117e5772f1be7bd0a277bf5826fab89344ed | [] | no_license | jwang320/Engine | 182042cc2b5ea8bb71fe45022296aa00dbbc4e13 | 5fe1d23fc695f5b43f5a484297b6448c5a446f5a | refs/heads/master | 2023-01-01T12:25:18.545583 | 2020-10-28T00:45:05 | 2020-10-28T00:45:05 | 307,857,598 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 741 | h | UDPServer.h | #pragma once
#include <queue>
#include "Network\UDPNetworkBase.h"
namespace Network
{
class Client;
class UDPServer : public UDPNetworkBase
{
private:
std::map<std::string, Client*> clients;
protected:
std::string port;
public:
UDPServer(const std::string& port);
void Update();
int SendPacketToClie... |
9100804b0347b24f4b8867f8898e39baf09ac58e | b146c1380315515ad4c388231325294c5902c70f | /testGenerator.h | ccd01f0dd7995036ad4dfa6efc1964e23c442132 | [] | no_license | edgarshmavonyan/mergeable_heaps | 4eda51f0c8dc30943fee1bd0ce648eff2486eabf | 3422a9ca000fec4437d32f1657bb01e3b85b3f3f | refs/heads/master | 2021-08-30T10:58:03.762295 | 2017-12-17T15:44:42 | 2017-12-17T15:44:42 | 113,308,343 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,342 | h | testGenerator.h | #include <random>
#include <vector>
#include "heaplist.h"
void generateSomeValues(size_t size, std::vector<int>& arr) {
std::mt19937 generator(time(0));
arr.resize(size);
for (size_t i = 0; i < size; i++)
arr[i] = generator();
}
void generateHeapOrder(int size, int heapNumber, std::vector<int>& ... |
80ff50820c4dfa8a8ecb0b30f1f539f644fdb4e0 | d93fae13dd5019f9ddf89bd91c17893ccb832abd | /map.h | ebda9754dd8397d2612609841126cc3e1a79c9b9 | [] | no_license | tren97/No-Name-RPG | bdcd42240e0cee290c7a9793e68213a85d3d197e | 215d9707b8149fffe7991dc32337096448b976d3 | refs/heads/master | 2020-04-24T00:33:18.372895 | 2019-02-20T19:21:53 | 2019-02-20T19:21:53 | 171,569,981 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,965 | h | map.h | #include <iostream>
#include <vector>
#include "move.h"
using namespace std;
//variables describing the characters used in the map below
const char PLAYER = 'X';
const char MONSTER = 'M';
const char TREASURE = 'T';
const char WALL = '#';
const int REWARD = 25;
const int LOOTREWARD = 10;
bool on_monster = false;
bool o... |
d1f5f1265660b868c80304cac14b5b480be8db51 | b2d1f5d7637a2c2e7f9c8037748fabacf410c3a1 | /random.h | 33b84f401385798caad9da496ec9528b26b6e406 | [] | no_license | Mortal/opt | 51a68862110e0d77d12295f5a9a04268cbef7137 | 44e104c042bec496c1eb470677e9bf03a5495457 | refs/heads/master | 2021-01-20T10:38:51.040480 | 2012-03-24T20:28:49 | 2012-03-24T20:44:47 | 3,451,936 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 939 | h | random.h | #ifndef __RANDOM_H__
#define __RANDOM_H__
#include <vector>
#include <boost/random.hpp>
struct randutil {
inline randutil(uint32_t seed) : random_source(seed) {
}
inline randutil() {
}
boost::mt19937 random_source;
template <typename IT>
void shuffle(IT begin, IT end) {
const int n = end-begin;
for (int i... |
79a3598c58cf82db286645290a6646b2a75b951b | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/httpd/gumtree/httpd_new_log_4653.cpp | f8e5fbbf0535c91ae5ff6360391761d7b692caa0 | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 176 | cpp | httpd_new_log_4653.cpp | ap_log_error(APLOG_MARK, APLOG_EMERG, 0, s, APLOGNO(01888)
"Init: Failed to load Crypto Device API `%s'",
mc->szCryptoDevice); |
23237ebe2b7f218d961d62442d8840c1e3dc1756 | f21698a712ae2fde47e76acd6577e188bef84c49 | /tests/MaximumAPosterioriTest.cpp | 816f3ba4416ce9d6206ec29b4c5ef8e7c64ba8fa | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | agiger/GPR | 295e8e2cb6abd90a0f9203088229d6eecdd4b748 | e191cba96c281d9e69ec44fb6998b5d6ca3f3042 | refs/heads/master | 2021-06-24T23:40:36.693792 | 2020-11-01T17:13:36 | 2020-11-01T17:13:36 | 139,864,868 | 0 | 0 | null | 2018-07-05T14:58:23 | 2018-07-05T14:58:22 | null | UTF-8 | C++ | false | false | 21,159 | cpp | MaximumAPosterioriTest.cpp | /*
* Copyright 2015 Christoph Jud (christoph.jud@unibas.ch)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by ... |
cdb91c7cf5e573f2bc7b6e951400322de0542673 | ea7808e80a7febe6c758138f57e8525c754a3990 | /Assignments/Assignment 5: Priority Queue/Assignment 5/src/VectorPQueue.cpp | a7603b65b38d63310ca189d639b09d127ff59308 | [] | no_license | wenxinxu/CS106B-Programming-Abstractions-In-Cpp | cd1ddca45920efe6783f5484b55c2c53b5886cc6 | 11684d6492600ab82bce1d672a2ead6b072379db | refs/heads/master | 2020-09-29T06:30:07.144228 | 2019-12-04T12:09:42 | 2019-12-04T12:09:42 | 226,975,795 | 0 | 1 | null | 2019-12-09T21:57:21 | 2019-12-09T21:57:20 | null | UTF-8 | C++ | false | false | 1,335 | cpp | VectorPQueue.cpp | /*************************************************************
* File: VectorPQueue.cpp
*
* Implementation file for the VectorPriorityQueue
* class.
*/
#include "VectorPQueue.h"
#include "error.h"
using namespace std;
VectorPriorityQueue::VectorPriorityQueue() {
// TODO: Fill this in!
}
VectorPriorityQueue::~... |
02137df61a8d9ee1fb95c2bb1bbeb52e953276c6 | 98ec42398374ef91666550255e4958be69820cae | /tests/hash_test.cpp | d0306855183315036a3540cac22fda9a749562a2 | [
"LicenseRef-scancode-public-domain-disclaimer"
] | permissive | Zabrane/emilib | fde23b7e00f345db7c8a9b4e5b390f686885eff6 | 0d90f4c0cd44813f6898b417bf3f4ef574a5b136 | refs/heads/master | 2022-04-23T10:52:29.257760 | 2020-04-23T10:13:57 | 2020-04-23T10:13:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,785 | cpp | hash_test.cpp | #include <string>
#include <catch.hpp>
#include <emilib/hash_map.hpp>
#include <emilib/hash_set.hpp>
using namespace std;
TEST_CASE( "[int -> double]", "HashMap" ) {
emilib::HashMap<int, double> map;
REQUIRE(map.empty());
REQUIRE(map.size() == 0);
map.insert(1, 1.0);
REQUIRE(map.size() == 1);
REQUIRE(map[1] =... |
8e6fad9b9c5707d137b77127cf06db946a362c6f | f9d5cb4535d69d904cbcdfd2842e4912ebe1ae2e | /Ultrasonictest.ino/Ultrasonictest.ino.ino | 91e5b7cbf217af43458c2b326248ecfdb44de503 | [] | no_license | edwinsuubi/arduino-testing | 5120497cbb4cd72c2d1209ac6f5a36bf2b034f30 | 7d546c240b39e52210a644e66ad32f6b0f83d40e | refs/heads/master | 2020-05-31T17:05:44.591258 | 2019-06-06T08:04:41 | 2019-06-06T08:04:41 | 190,399,704 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 609 | ino | Ultrasonictest.ino.ino | int led = 6;
const int trig = 12;
const int echo = 10;
float duration;
int distance;
void setup() {
pinMode(trig, OUTPUT);
pinMode(echo, INPUT);
pinMode(led, OUTPUT);
Serial.begin(9600);
}
void loop() {
digitalWrite(trig, LOW);
delay(2);
digitalWrite(trig, HIGH);
delay(10);
digitalWrite(trig, LOW)... |
cfba44a4ab2e9c707f68a8c0e7b1fe09f20d8547 | fef750f91e71daa54ed4b7ccbb5274e77cab1d8f | /HDU/3400+/3433.cpp | 977f9de597d37157880ec5700db1994ce520c146 | [] | no_license | DongChengrong/ACM-Program | e46008371b5d4abb77c78d2b6ab7b2a8192d332b | a0991678302c8d8f4a7797c8d537eabd64c29204 | refs/heads/master | 2021-01-01T18:32:42.500303 | 2020-12-29T11:29:02 | 2020-12-29T11:29:02 | 98,361,821 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,107 | cpp | 3433.cpp | #include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
#define N 55
#define M 250
#define INF 0x3f3f3f3f
int vis[N];
int n, x, y;
int a[N], b[N], dp[N][M];
int check(int mid, int x, int y) {
memset(dp, -1, sizeof(dp));
for (int i = 0; i <= x && i * a[0] <= mid; ++i) dp[0][i] = (mid... |
1305335c7bad5ddda5b40a3900d2bc672131d192 | 3adcbbf0cf24668713315f930dd6c4c625514a5c | /src/common/ByteOrder.h | 7ac857b9d262270b7d0915bbeb10545e7737d379 | [
"BSD-3-Clause",
"Apache-2.0"
] | permissive | ifplusor/rocketmq-client-cpp | 292d3948f7c24bd5610765338a26b23f99b4a49d | 560f47145b39245890b2911bfcb52e1094ae609a | refs/heads/re_dev | 2022-07-09T19:28:44.245791 | 2022-03-17T10:01:18 | 2022-03-17T10:01:18 | 163,077,225 | 5 | 2 | Apache-2.0 | 2021-10-13T10:52:00 | 2018-12-25T11:35:31 | C++ | UTF-8 | C++ | false | false | 6,268 | h | ByteOrder.h | /*
* 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 You under the Apache License, Version 2.0
* (the "License"); you may ... |
cf9eb02105f5068567f84608a60f8edb4a22a80e | 96f88059d7eae38ab869d31099f4c974bd95a69b | /pruitt-igoe/pruitt-igoe/core/components/FPSCounter.h | 30fc60d72d9202bae14ef320cf6e9436150e8f9d | [
"MIT"
] | permissive | mmerchante/pruitt-igoe | 54e3151d7a608fd5f2489305c264fa5848480ec4 | 3b16b78e05fca18a64c51fc31160a41336b729be | refs/heads/master | 2021-01-23T03:42:58.535821 | 2017-05-03T23:51:29 | 2017-05-03T23:51:29 | 86,111,465 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 374 | h | FPSCounter.h | #pragma once
#include "../ui/uicomponent.h"
#include "../ui/uitext.h"
class FPSCounter : public UIComponent, public InputListener
{
public:
void Awake();
void Update();
virtual void OnKeyReleaseEvent(sf::Event::KeyEvent * e);
private:
UIText * text;
int currentFrame;
float currentFrameTimeAverage;
float minTi... |
f9a7a60028b749ef955a208e950ca9b87c3d8558 | 9e147a9dd159aee503f499e13f52665e414abad5 | /G3D/src/Engine/G3D_Mesh.h | d2f52e770d98a28324a68a7e439a3dc7a2d52002 | [
"Apache-2.0"
] | permissive | GunnDawg/Gunngine3D | ecd062d88c516435bacc0d782ecb2632447c134e | f10fa9ae34a537387fcddb4f2323632721a86739 | refs/heads/master | 2021-01-05T00:45:00.635126 | 2020-12-11T05:08:44 | 2020-12-11T05:08:44 | 240,815,984 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 682 | h | G3D_Mesh.h | #pragma once
#include "Engine/G3D_Shader.h"
#include "Engine/G3D_Texture.h"
#include "Engine/G3D_Light.h"
namespace G3D
{
struct Mesh
{
bool Load();
bool Load(const char* TextureName, const char* ShaderName, DirectX::XMFLOAT3 Position);
void Update(const AmbientLight& AmbientLightSource);
void Draw();
void... |
77c49d9fea50ceb9fd8456c4c313f2bda11031dd | d71147e42d2ca53d0137b6f113661d57d452256a | /uicontroller.h | 9bc15912a868efa90893d1495956270001166adc | [] | no_license | Kuttuna/QML-C- | 9190b54b2b306be1ff3c06cf9cdcb1db82aa048e | 5f27588be83c4ac8c35de97723e7f396446e0cc7 | refs/heads/master | 2020-04-13T13:26:46.047795 | 2018-12-27T01:10:15 | 2018-12-27T01:10:15 | 163,230,749 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 318 | h | uicontroller.h | #ifndef UICONTROLLER_H
#define UICONTROLLER_H
#include <QObject>
class UiController : public QObject
{
Q_OBJECT
public:
explicit UiController(QObject *parent = nullptr);
Q_INVOKABLE int increase(int value);
Q_INVOKABLE int decrease(int value);
signals:
public slots:
};
#endif // UICONTROLLER_H
|
2e50c3bc0e1ddeff3250d3530b50e1dd69c95f83 | 923354cb388e025d9b0ede222f69f2d4782c7bf1 | /pulsemover.h | 9700c7132706fc3ffa2ba7d7f63ec27ca7670484 | [
"MIT"
] | permissive | reinout/servomover | f9367f22dcb4e28d4b3a42e6bfcb604036b6640e | 4e887569b70001e366881bf609653d9f54e40d37 | refs/heads/master | 2021-01-21T13:25:36.430541 | 2016-05-09T20:21:18 | 2016-05-09T20:21:18 | 46,359,587 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 348 | h | pulsemover.h | #ifndef pulsemover_h
#define pulsemover_h
#include <arduino.h>
class PulseMover
{
public:
PulseMover(int pin_base,
int pin_actuated);
void init();
void move_to_base();
void move_to_actuated();
void perhaps_update();
private:
int pin_base;
int pin_actuated;
unsigned long stop_pulse_aga... |
e8771de117b66bed17cf26ac9f7c13ba44c88c0d | efb0d8e9d0111bb3c33b832041efcf18ebb9e923 | /3980.cpp | d6b917e4046c03bfc6659e0206037a06854a7473 | [] | no_license | sejinik/BOJ | f0307f8e9bee9d1210db47df309126b49bb1390b | 45cb123f073233d5cdec8bbca7b26dd5ae539f13 | refs/heads/master | 2020-03-18T12:42:01.694263 | 2018-05-24T17:04:19 | 2018-05-24T17:04:19 | 134,739,551 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 728 | cpp | 3980.cpp | #include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int d[(1 << 11)][11];
int arr[11][11];
int t;
int main() {
scanf("%d", &t);
while (t--) {
memset(d, -0x3f, sizeof(d));
memset(arr, 0, sizeof(arr));
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
scanf(" %d",... |
521c7ba07de2a88c94023e33ce341e9e81d95e45 | 2c6dac9af3257411725082c4a9d31e3f7cd3859d | /graph.h | 3708550f1e98890b9304052341721cd45519d0b8 | [] | no_license | oURMIo/VS_GL_Grafuk_Mas | 75bbd4ee1fe26eed0296409ae4f3362825ef8ee5 | ede54bf92b6833c9f44db23294b1762fc5d12707 | refs/heads/main | 2023-04-21T13:56:12.336291 | 2021-05-12T16:24:13 | 2021-05-12T16:24:13 | 366,777,148 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,887 | h | graph.h | #ifndef GRAPH_HH
#define GRAPH_HH
#include "alg1.h"
/** ГРАФ: ОПРЕДЕЛЕНИЯ *************************************************/
/** чётко определенные параметры *************************************************/
#define NMAX_VERT 64 // 1024 // graph MAX size (array is not dynamic)
#define NMAX_EDGES (NMAX_VERT*... |
d8e13627753ede674ba75ed3b8e25e26d4d62edb | aeb3600f0c74ea5ec9c42752531f1f8a9cf7a346 | /memory/include/GameController.hpp | 5b52a2ea9e1507b8cf175c4d3729a58318d9e94f | [
"MIT"
] | permissive | GPUWorks/OpenGL | 3e9efb0ef90edc3f8d228de6f9e022563165a01c | f80251f03fa65ae632cab3651378bf3b5a57fc84 | refs/heads/master | 2020-04-12T10:05:30.962456 | 2018-12-10T22:16:59 | 2018-12-10T22:16:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,021 | hpp | GameController.hpp | #ifndef _GAME_CONTROLLER_HPP_
#define _GAME_CONTROLLER_HPP_
#include <cstdlib>
#include <iostream>
#include <vector>
#include <GL/glew.h>
#include <GLFW/glfw3.h>
#include <glm/glm.hpp>
using namespace glm;
class GameController
{
private:
const GLfloat vbData[34];
GLuint vertexBuffer;
std::pair<int, int> ... |
233a6c04dc06a20192ae2c8b8c8214d30fe6a710 | e066f9a3b35a59526ff8b12522ec79a49d795b83 | /chromeos/update_applier.h | 7fa99a49249689f70f791be53b8447c0b7271693 | [] | no_license | BlissRoms-x86/vendor_bliss_priv | 88db4fc6e8aa76c8b32f730ac570ea0f25967fe1 | f63c12f0db53c6d36bfbd584b5f449d0c3d829bc | refs/heads/p9.0 | 2021-07-13T03:59:52.666429 | 2019-02-02T22:22:15 | 2019-02-02T22:22:15 | 155,762,681 | 7 | 4 | null | 2023-05-03T03:09:01 | 2018-11-01T19:05:16 | C++ | UTF-8 | C++ | false | false | 1,620 | h | update_applier.h | //
// Copyright (C) 2018 The Android Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by app... |
b493885010cc98dcdfb1e08bbbfd7d55d53b9598 | 756296ae51864e88e4c1a2ef58af43f85a6319f5 | /dominios.cpp | 7d7053a0d5c1bde65ad0147704ef90f82633e1f4 | [] | no_license | masathayde/unbtp1 | f26001b85c8a5ca3c921868d8fd19a569169f505 | e4a3ab4f171859041fd026233751e8078315a88b | refs/heads/master | 2020-09-15T10:59:44.700619 | 2019-11-23T05:07:41 | 2019-11-23T05:07:41 | 223,427,273 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,997 | cpp | dominios.cpp | #include "dominios.h"
void CodigoJogo::validar (string input) throw (invalid_argument)
{
if (input.size() != this->size)
throw invalid_argument("Erro: Tamanho incorreto");
for (auto it : input) {
if (it < '0' || it > '9')
throw invalid_argument("Erro: Carater invalido");
}
}
v... |
bd178f558485df4ea2e2aaf71e0fe40fe51097f6 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5639104758808576_0/C++/squeespoon/1.cpp | 2578ae070118e740c803e40e9098030242857320 | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 724 | cpp | 1.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <vector>
#include <deque>
using namespace std;
char str[1010];
int main(){
freopen("A-small-attempt0.in","r",stdin);
freopen("A-small-attempt0.out","w",stdo... |
4b87df1ef59bba3cbf0462f74848b4a8da57d335 | 642e07d31f88a5e68f83856d87774a4531733e51 | /Homework 4/ExtCalc/evaluate.hpp | 828052d8120ec4e95ba58ad056f815b5602f9b27 | [] | no_license | draganjovic/Compiler-Design | 0a9160ac1b02c2cac2862540906bd74f04eee6d0 | 29ad3b2a022e49708f78ca8a90131387e7eeeaa7 | refs/heads/master | 2021-01-22T08:02:59.244446 | 2019-12-03T02:26:41 | 2019-12-03T02:26:41 | 81,871,618 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,373 | hpp | evaluate.hpp | #ifndef EVALUATE_HPP
#define EVALUATE_HPP
#include "prelude.hpp"
#include "visitor.hpp"
#include "ast.hpp"
struct eval_visitor : expr_visitor
{
// Reference Types and Function Types
void visit(const ref_expr *);
void visit(const func_expr *);
// Literal Expressions
void visit(const int_... |
c09952701ab55a24299038e3e62b6377185b7374 | 58dd0fe196ccd2738603a03b992bb99816a562bc | /c++/a07q02/a07q02/testFib.cpp | 2dd64dde8cce8e4d957ee1fca7658f858a5c312d | [] | no_license | bdpoagdorado1/BrandyProjects | 3db999ff55d209ce14ff29008e7a74bfe63443e7 | 2182dddcfb85bbd4437989d7459cdb5ffbfff6e7 | refs/heads/master | 2021-01-10T21:17:11.410724 | 2014-05-19T15:04:30 | 2014-05-19T15:04:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 566 | cpp | testFib.cpp | // File: testFib.cpp
// Name: Brandy Poag
#include <iostream>
#include "Fib.h"
#include "Math.h"
int main()
{
int n1 = 0, n2 = 1, n3 = 0;
std::cout << "Testing Fib: \n";
int i;
int errors = 0;
for (i = 0; i < 10; ++i)
{
if ( i == 0 ) n3 = 1;
std::cout << "Test " << i + 1 << ": " << (Math::fi... |
8db02c5a514a082468e9eb65cbc3b42e3b03824e | 8f745d23fb5c305b2b79d369a24a573d64b3dc18 | /src/cdda.cpp | 0a7a486b371a5ad362b8f69944c141c6241f2cf3 | [] | no_license | ianmicheal/dreamcast-common | ab2323d1d78bfafb843fb6b138d28d689ab98b1d | 42153a864fb0f725d5f9b8916b2f919a8217dd7f | refs/heads/master | 2022-01-10T03:35:09.518648 | 2019-03-26T20:58:47 | 2019-03-26T20:58:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 304 | cpp | cdda.cpp | #include "dccommon/cdda.hpp"
CCdda::CCdda(void)
{
iRvol=250;
iLvol=250;
bPlay=false;
}
CCdda::~CCdda(void)
{
}
bool CCdda::IsPlaying()
{
int status(0), disc_type(0);
cdrom_reinit();
cdrom_get_status(&status, &disc_type);
if(status==CD_STATUS_PLAYING)
return(true);
else
return(false);
}
|
325802b207f45dcdf3dfd9b0012a7b271fdc6056 | a99f916b3f244a1ce743f94a57226f510342c0a3 | /Ch-2(Solution to Linked Lists)/Intersection/Intersection.cpp | d176818475ac562dfbc06347256913e08dfc74d2 | [] | no_license | Aman-Garg/cracking-the-coding-interview | d3d2ac9abdcb01160653c24fd0d6e40254c38048 | 3f08b0791712596e31f1534c3019af0c43d1b145 | refs/heads/master | 2020-05-04T23:32:24.942332 | 2019-04-13T21:33:20 | 2019-04-13T21:33:20 | 179,546,825 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,663 | cpp | Intersection.cpp | #include<iostream>
#include<set>
using namespace std;
//creating some nodes in Linked List
struct node* createNewNode(int *numberToAdd, int size);
void traverse(struct node*);
//function to find the addres of the same node so that i can add it to new list
struct node* findAddress(int n ,struct node *list);
//function... |
419ca0715b57389693266b4a171327b3caeb5811 | 0cbe1b1f25cb43b7a007558be47448e42dc4cbc6 | /P4/color.h | 9d6b977bf1f48543c2508983147fd5b34f099024 | [] | no_license | AlbertoLorente92/practicas-IG | 1d8455e76703b31ecab54b908579919b903adc0f | 1b6939fad116580dbeff599f3df657e744030ace | refs/heads/master | 2021-01-11T11:07:42.590604 | 2016-02-02T20:38:25 | 2016-02-02T20:38:25 | 50,950,114 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 1,934 | h | color.h | /* Práctica 4 - Informática Gráfica (IG)
Componentes del grupo:
Juan Deltell Mendicute.
Alberto Lorente Sánchez.
*/
#ifndef __COLOR_H
#define __COLOR_H
#define Black Color(0.0f,0.0f,0.0f)
#define Red Color(1.0f,0.0f,0.0f)
#define Blue Color(0.0f,0.0f,1.0f)
#define Green Color(0.0f,0.1f,0.0f)
#define Yellow Color(1.0... |
756ae27006822b55f95c46b26bd2edebaf06f4ae | e88816b0597e739cb9418cb2f5ae53c4be21d964 | /pouringWater.cpp | 92ce441819035c3e2f953afa7e545400f672f300 | [] | no_license | vaibhavjain2391/Spoj-Practise | e62a78f8f18a20d199905ba4753bece71ca488d0 | d068a209fe92994059890f617cb7b233d7943ccb | refs/heads/master | 2021-01-10T02:13:07.111346 | 2015-11-08T19:54:10 | 2015-11-08T19:54:10 | 45,796,166 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 930 | cpp | pouringWater.cpp | #include<iostream>
using namespace std;
int minSteps(int a, int b, int c);
int main()
{
int t,a,b,c,result;
cin>>t;
for(int i=0;i<t;i++)
{
cin>>a>>b>>c;
if(c==0)
cout<<0<<endl;
else
{
result= minSteps(a,b,c);
cout<<result<<endl;
}
}
return 0;
}
//some cases are not considered ..thats y get... |
20f346854d33d40b88c07610c61d06b3d7a0bd79 | 9915247be962868b70dff74ce423575bfb325512 | /Easy Problems/URI1080.cpp | 53e3ff3d937f3c02df2bdb6c6e97999e8fba9366 | [] | no_license | abdulahad2307/JudgeSite-Practice-Codes | 16b06fdb59d63dc2f9b86904a1d7e1f47e7ed276 | 9b2e401dc4571da5a8023edc8533d314b924636a | refs/heads/master | 2023-06-25T17:14:29.993088 | 2021-07-29T22:21:26 | 2021-07-29T22:21:26 | 167,986,236 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 240 | cpp | URI1080.cpp |
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
int n , tempmax , pos;
for (int i = 0 ; i < 100 ; i++)
{
scanf("%d", &n);
n = tempmax ;
if (n)
}
return 0;
}
|
d038a842bbf3be7bbd1b29264b35cdfa4a602d2d | d1650242d0749cd2aff3078a2591a188b0be3a58 | /Advanced-lost and found/A1001/A1001/main.cpp | 656ef866130e42bb456bff7a5f38d0b5efbac2cd | [
"MIT"
] | permissive | Eric-Ma-C/PAT-Advanced | d92e1503b4e14a7a62964df7afd3b098573daba3 | ea8b46a780a04b46ab35ebd06c4bf19c3a664380 | refs/heads/master | 2020-09-11T10:26:50.288469 | 2019-11-16T03:31:12 | 2019-11-16T03:33:45 | 222,035,114 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 856 | cpp | main.cpp | #include<stdio.h>
//60min
int gcd(int a,int b){
if(b==0)
return a;
return gcd(b,a%b);
}
void simple(int *a,int* b){
if(*a==0||*b==0)
return;
int g=gcd(*a,*b);
*a/=g;
*b/=g;
}
bool getSum(int a1,int b1,int a2,int b2,int* a3,int* b3){
*a3=a1*b2+a2*b1;
*b3=b1*b2;
bool positive=true;
if(*a3<0){
*a3=-*a3;... |
b8d56572ac3b275a3c3ac3743f2cbbbc4976edda | 9cdfe0725dc4e22b95a22352491ba7579f5ddab7 | /lab_1/src/core/action.hpp | 9ffa46d3bcc7489cfcc9e32f850988e1b96270fb | [] | no_license | RullDeef/cpp-lab | 16722062ec97351e66c75905634d3bb057b0d317 | 9473b22a68a42ed45a582a6624ea6b96548dd16e | refs/heads/master | 2023-06-18T22:35:57.794320 | 2021-07-20T08:58:36 | 2021-07-20T08:58:36 | 387,731,405 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 795 | hpp | action.hpp | #pragma once
#include "ext_math.hpp"
namespace core
{
enum class ActionType
{
Init, // initializes viewport
Destroy, // releases model resources
Load, // load model from file
Save, // saves model to file
ComputePr... |
67f1ab202d91af061ac53b42ecbf27dde15b3242 | 72b73e958eb174220ebaf3f8ebe3da4bf2f8e21b | /CodeChef/IIITHC14/1.cpp | 6c4ce70709bea83669ae1b47549cb019689caa4f | [] | no_license | AbhineetJain/Algorithmic-Programming | 147bf620073ecb37994b0466b1cd1f156c36da2c | 7980bd466118024c2aa0c4e982a70bc175171c49 | refs/heads/master | 2021-01-25T05:34:21.091342 | 2015-05-20T22:28:09 | 2015-05-20T22:28:09 | 26,182,801 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,698 | cpp | 1.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<LL> VLL;
#define SI(n) scanf("%d", &n)
#define SLL(n) scanf("%lld", &n)
#define SULL(n) scanf("%llu", &n)
#define sortv(v) sort(v.begin(), v.end())
#define pb(x) push_back(x)
#de... |
7e95469f2808c9955a2fb946baa8017b9ead4a98 | 8d32836a6c2e7e458a2a6d6f4d89f2e5c659673e | /src/ronin-world/Spell/SpellTarget.h | 9a9118957a0f81405413520099246f38f52a47d8 | [] | no_license | Sandshroud/Ronin | e92e53c81fdab4cefc0de964d2fb8cebc34ee41e | 94986c95e88abe6cedd240e0ce95f6f213b05d90 | refs/heads/master | 2023-05-10T21:58:29.115832 | 2023-04-29T04:26:34 | 2023-04-29T04:26:34 | 74,101,915 | 12 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 4,973 | h | SpellTarget.h |
#pragma once
class SpellTargetClass;
class MapTargetCallback { public: virtual void operator()(SpellTargetClass *spell, uint32 i, uint32 targetType, WorldObject *target) = 0; };
class FillAreaTargetsCallback : public MapTargetCallback { virtual void operator()(SpellTargetClass *spell, uint32 i, uint32 targetType, Wor... |
0bdd4caaa9a2c5c802c198cded69174a29c80174 | 316f9700e749be3fb7057cf5c657a0d82e1f73f5 | /Pong/Tetris/Window.cpp | 07ab1ac657eb4b2ca7639912e7477db239330da3 | [] | no_license | StillOP/Pong | e2a077a9d19b18fde0e53dee5c88f920b1dae04b | 31862079f1c764d902651c5dccab6bd54aa756d5 | refs/heads/master | 2021-01-20T17:40:04.507150 | 2017-05-10T15:42:32 | 2017-05-10T15:42:32 | 90,881,237 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,380 | cpp | Window.cpp | #include "Window.h"
Window::Window()
{
isFullscreen = false;
CreateWindow("Tetris", sf::Vector2u(800, 640));
}
Window::Window(const std::string winTitle, sf::Vector2u winSize)
{
isFullscreen = false;
CreateWindow(winTitle, winSize);
}
Window::~Window() { ShutDown(); }
void Window::CreateWindow(const std::strin... |
7db2fe05d50173b2eeaa7dfe142a13dcf0c9d36a | 30098fb8cb19aee196255ce42c7cedfe3fc087a6 | /headers/cCustomer.h | adbb46bb0c8e9ecd1da340364d747b1b21d3ece0 | [] | no_license | xrds6/Tring.Touch.POS | c9e6c0ccf6df2dc7c34dbedd62c2fe31dd3cba81 | cc30a17eb46dd9e0ab8c09a595aa77ebb350480d | refs/heads/master | 2021-06-30T19:18:39.177420 | 2017-09-20T09:55:51 | 2017-09-20T09:55:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,500 | h | cCustomer.h | #ifndef CUSTOMER_H
#define CUSTOMER_H
#include <QObject>
#include <QString>
#include <QDateTime>
#include <QDebug>
class cCustomer : public QObject
{
Q_OBJECT
Q_PROPERTY(qint32 id READ id WRITE setId
NOTIFY customerChanged)
Q_PROPERTY(QString idc READ idc WRITE setIdc
NOTIFY ... |
3e8efa07a0b66f0329390f70cfadde3830477ea9 | 96b101112ddad9f748686411b38202072d246a6e | /src/main.cpp | ced1108a3f6189bb4b2521e4e2121ef1225c14c0 | [] | no_license | cheshie/Croc-Remake-OpenGL | 40a4e5fb8176ed1ad503ad3e062c65841c62c154 | 939f72a523c47a85f3387416e2559d85edbb553f | refs/heads/master | 2022-01-28T19:41:15.878744 | 2019-07-16T09:37:51 | 2019-07-16T09:37:51 | 197,160,589 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 62,567 | cpp | main.cpp | #include "stdafx.h"
#include <string.h>
void OnRender();
void OnReshape(int, int);
void OnKeyPress(unsigned char, int, int);
void OnKeyDown(unsigned char, int, int);
void OnKeyUp(unsigned char, int, int);
void OnTimer(int);
void OnMouseMove(int, int);
void OnMouseClick(int, int, int, int);
void loadtextures();
void Re... |
c36778c5b99ebab239ec25290fe3bf43e4eaaefc | 424a7bf0be74de6f6c157b4f7f47e585d5f80711 | /CS-Banking simulation/Account-def.cpp | f699ace77afa64e4f9d723ffb601f68399d35996 | [] | no_license | utkarsh30singh/OOPs-Lab-program | 65e12403dfc62aa77459336da8f854397460a5d7 | 6b41625a1a64b236326638b45e2b1979554bb7da | refs/heads/master | 2022-12-25T15:36:06.910697 | 2019-10-30T19:13:12 | 2019-10-30T19:13:12 | 147,157,479 | 0 | 1 | null | 2020-10-02T16:42:27 | 2018-09-03T05:50:45 | C++ | UTF-8 | C++ | false | false | 1,472 | cpp | Account-def.cpp | #include"Account_dec.h"
int Account::ac_no=10012;
void Account :: deposit()
{
int amount;
cout<<"Enter deposit amount(minimum 1000 for current account initially ) :";
cin>>amount;
if(amount<0)
cout<<"You cannot deposit a negative amount."<<endl;
else
balance+=amount;
display();
}... |
0eb06b5f42c9b1a30204d26e66ff9db7b70c9284 | d66322fd0d1da3fb6ded8e1cd0ff429b59d9ccc5 | /SRC/RUSS.CPP | 57e989351742345acaa67c29383bd77097984e25 | [] | no_license | tolikk/blank | 4b796c0c141b5251420eff1e39c34db8f33bcff0 | 3aec7706559c0cdeaef2c6d0b98c2be1253c5a39 | refs/heads/master | 2021-01-17T09:12:16.611191 | 2016-04-10T21:43:45 | 2016-04-10T21:43:45 | 1,504,481 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 33,620 | cpp | RUSS.CPP | #include <owl.h>
#include <static.h>
#include <dialog.h>
#include <string.h>
#include <edit.h>
#include <stdio.h>
#include <array.h>
#include <window.h>
#pragma hdrfile
#include <pxengine.h>
#include <owl.h>
#include <dialog.h>
#include <edit.h>
#include <pxengine.h>
#include <pxtable.h>
#include <openbase.h>
#include ... |
581dbc77700089311028385810106213b6a4c0e6 | e7e2dea158b23da361adf8591e690691162ab342 | /ConsoleWindow/FileModule/FileButton.h | 10257b0cef8b7deb4fb8a14f1f21be0b4dfa82b4 | [] | no_license | 390031942/EasyVulkanFramework | bc00f7ac46a70becdba21b96e191907922869d97 | 099d5098c82612dc19c7ab9a84a3c2f991f67d66 | refs/heads/master | 2022-12-11T05:15:22.596158 | 2020-09-09T08:24:39 | 2020-09-09T08:24:39 | 294,052,201 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 748 | h | FileButton.h | #pragma once
#include <QPushButton>
#include <QLabel>
#include <qevent.h>
#include <qmenu.h>
#include <qmessagebox.h>
#include "FileLabel.h"
#include "Easy2DFileDefs.h"
#include <qtimer.h>
class QTimer;
class FileButton : public QPushButton
{
Q_OBJECT
public:
FileButton(QWidget *parent,const QString filename,const... |
111722246d9af82c4b59857e632414dbe815a038 | f754d089b9c88d4b62cb6b4b2cefe25257bb4cb3 | /Think Like a Programmer/Chapter2/Exercises/2.6/binaryToDecimal.cpp | 84ae5ac50c7d8b2ce59ef18048ae144f2d86a198 | [] | no_license | OscarSandoval21/Book-Exercises | 6e053f38405781d1cc7a98096e4b3ef4eba42d5a | 45d75c8dd8c9e35932741fef1ba6c7448cac9d4c | refs/heads/main | 2023-03-11T08:04:18.344929 | 2021-02-21T23:21:39 | 2021-02-21T23:21:39 | 332,649,750 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 676 | cpp | binaryToDecimal.cpp | #include <iostream>
#include <string>
using std::cout;
using std::cin;
using std::string;
int main() {
char digit;
int decimalNumber = 0;
string binaryNumber = "";
int position = 1;
cout << "Enter a binary number to convert to decimal: ";
digit = cin.get();
while (digit != 10)
{
... |
88fa2812bbc76dcd8c6c09077883526ba3c530e6 | 51ac1d301c8b42235782c0dbe85c262b63a9accf | /MissionRndOffline_Prob/Ascen_ofArray_0and1_method2.cpp | ac7cc95de08969b3c90bf725eb3f679f400a7579 | [] | no_license | vineethakagitha/Extra-problems | 4dc0e8abb3d2a8ec7173b678a01b2c3b9149b3ef | 86b09bc20f51c8996ec52ed13b1499154316d265 | refs/heads/master | 2021-01-18T12:45:09.051233 | 2015-12-24T14:28:27 | 2015-12-24T14:28:27 | 47,631,741 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 504 | cpp | Ascen_ofArray_0and1_method2.cpp | #include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void sort(int*, int);
void main()
{
int *a, n, i;
scanf_s("%d", &n);
a = (int*)malloc(sizeof(int)*n);
for (i = 0; i < n; i++)
scanf_s("%d", &a[i]);
sort(a, n);
for (i = 0; i < n; i++)
printf("%d\t", a[i]);
_getch();
}
void sort(int *a, int n)
{
int i, j... |
0c355ca1624968ea64f773e0b46bbacf9b4e408a | 96d9abc30c17993b565637d47e30197b9b7d3b5a | /joins/test/algorithms/nop_join_test.cpp | b9d1cc11c86344ba4d67cd585fe1ecdcc2b36e86 | [
"MIT"
] | permissive | wagjamin/HashJoins | ff9b0afd96b5d5955d95d50f31f76d2e51662d14 | 143ef7a90d8226ce26b8a5e2ec1be33af0f00d74 | refs/heads/master | 2022-02-28T13:37:06.230784 | 2022-02-20T16:45:25 | 2022-02-20T16:45:25 | 148,012,777 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,993 | cpp | nop_join_test.cpp | //
// Benjamin Wagner 2018
//
#include "generators/uniform_generator.h"
#include "algorithms/nop_join.h"
#include "gtest/gtest.h"
#include <iostream>
#include <chrono>
using namespace generators; // NOLINT
using namespace algorithms; // NOLINT
// Ensure proper creation of object and no return before execution
TEST(N... |
3f59a0192f977f0c9e45407f5be9e9d6b906a5a5 | 1bbd1440effb236b247e6f0e710afaf924a324e2 | /LambdaExpression/paramter.cpp | 8768b2d511d4d261a6dadf8a4e6d1ac4ed07909b | [] | no_license | theArcticOcean/CLib | 25fbd159936913fd7f0ecdcb7737baf8b20d4459 | 9384eff20febd718f903cc1a86cad730043ce639 | refs/heads/master | 2023-06-24T06:19:37.560274 | 2023-06-15T01:22:07 | 2023-06-15T01:22:22 | 111,999,296 | 24 | 26 | null | 2022-01-17T03:11:49 | 2017-11-25T11:44:19 | C++ | UTF-8 | C++ | false | false | 624 | cpp | paramter.cpp | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/*
Lambda Expression's Paramters:
1. 参数列表中不能有默认参数
2. 不支持可变参数
3. 所有参数必须有参数名
*/
int main()
{
vector<int> vec;
for( int i=0; i<10; ++i )
{
vec.push_back( i+1 );
}
auto fun = [](vector<int> &V) {
for( int i=0; i<V.size(); ++i )
{... |
aafc5679f828cb47c2a5ca933cd61f698bab169c | c42ecbc5bb6bc33acc9833b738996e537d092041 | /pothos-serialization/include/Pothos/serialization/impl/preprocessor/arithmetic/dec.hpp | 5b3438fb657d504436686870c76d7133f6432f06 | [
"BSL-1.0"
] | permissive | lrmodesgh/pothos | abd652bc9b880139fa9fb2016b88cb21e0be1f0a | 542c6cd19e1aa2ee1fda47fbc131431ed351ae31 | refs/heads/master | 2020-12-26T02:10:22.037019 | 2015-07-13T08:28:57 | 2015-07-13T08:28:57 | 39,064,513 | 1 | 0 | null | 2015-07-14T08:56:33 | 2015-07-14T08:56:33 | null | UTF-8 | C++ | false | false | 8,871 | hpp | dec.hpp | # /* Copyright (C) 2001
# * Housemarque Oy
# * http://www.housemarque.com
# *
# * Distributed under the Boost Software License, Version 1.0. (See
# * accompanying file LICENSE_1_0.txt or copy at
# * http://www.boost.org/LICENSE_1_0.txt)
# */
#
# /* Revised by Paul Mensonides (2002) */
#
# /* See http:... |
5c715b33ff5770aff1dcdd68b04ba9b6f2d798d8 | 2ed37eecee1472443d8b3ca6102f2b9e1bf63876 | /leetcode/79.cpp | ddb6d2a5baa91811159fc0525b9c9a629ebb1725 | [] | no_license | chloejiwon/algorithm | 441d9d3b007acb366370c1f5b59c73a804423ffc | 2c6380959f2c998adf811940cff16099a669e1fd | refs/heads/master | 2022-05-14T19:05:03.331467 | 2022-04-07T01:13:30 | 2022-04-07T01:13:30 | 114,375,453 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,002 | cpp | 79.cpp | // 이것은...디버깅의승리...?;;;
// 79. Minimum Window Substring
// Solution 1 - Sliding window --- Beat 20%
// need to work on simplifying methods..
// if s[start] is not substr in T, start++;
// if s[start~end] contains all chars in T
// if start-end+1 < min_len, min_len = start-end+1
// if not, start ++;
// if ... |
6b5a616637a6da54765c33a6ad52c5a8352d66f3 | 236f41f385d697957dd2301e46fa1f4bdb926cf6 | /URI/2871-TIMMY.cpp | 19a190e46d5c03f1137540f642105c9ab1121df0 | [] | no_license | LeonardoFassini/Competitive-Programming | a2bcc9ae6aa015e70c4d5cae6091e3133765a69c | 06bba6b4c2d10abc58e30f4ff8ea4d9ac1f535fc | refs/heads/master | 2020-04-05T22:32:57.288103 | 2018-11-12T18:52:21 | 2018-11-12T18:52:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 371 | cpp | 2871-TIMMY.cpp | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n, m, num, count = 0;
while(cin >> n >> m){
count = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
cin >> num;
count += num;
}
}
int saca = count/60;
int litro = count%60;
cout << saca << " saca(s)... |
68fdf8770c044a7ce7a52531d0f5922842872d25 | b76b2becfd8ac9feb76f014487f674dbb0110c8f | /matrix_impl/include/matrix_core/Matrix.h | bcbc87c0290a0d1ecb4747e329c0594edb55dd5c | [
"BSD-3-Clause"
] | permissive | cyang019/matrix | 2d141ad19d9b5b47f534534c7778f44bed82f746 | aa303e870e7a0ba0048839589e1676861c78bcc0 | refs/heads/main | 2023-05-31T06:44:15.019838 | 2021-06-08T03:54:47 | 2021-06-08T03:54:47 | 366,855,653 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,363 | h | Matrix.h | #ifndef _MATRIX_MATRIX_H
#define _MATRIX_MATRIX_H
#include <memory> // unique_ptr
#include <utility>
#include <exception>
#include <type_traits> // enable_if_t
#include <initializer_list>
#include <complex>
#include <random>
#include <cassert>
#include <cmath> // abs, max, min
#include <vector>
#include <unord... |
3349a27c20199158a0564926742faf62ed028e48 | f8083f1ac05ecb07b93c58af98eaf78e8eab9367 | /samples/0_1_MST.cpp | b9019f1eacaf89ae8c1007eecf65831e4a38b37c | [] | no_license | itohdak/AtCoder | 4f42ccc7b2b7f71d0d51069bd86503ee0f4b3dbf | 9ee89bac3ced919b94096ffd7b644d3716569762 | refs/heads/master | 2021-06-24T14:42:54.529474 | 2020-10-16T18:41:27 | 2020-10-16T18:41:27 | 134,136,836 | 2 | 1 | null | 2020-02-07T12:45:10 | 2018-05-20T09:26:13 | C++ | UTF-8 | C++ | false | false | 1,075 | cpp | 0_1_MST.cpp | #include "header.hpp"
set<int> se;
vector<set<int> > G;
void dfs(int v) {
se.erase(v);
int tmp = 0;
while(!se.empty()) {
auto itr = se.upper_bound(tmp);
if(itr == se.end()) break;
tmp = *itr;
if(!G[v].count(tmp)) {
se.erase(tmp);
dfs(tmp);
}
}
}
int main() {
int N, M;
cin >... |
9fa95fac7c056517b17bc5cf6d48afd3b4c5c629 | cb6092363d06df31d11cfc69fe073c0d5a1b4a89 | /include/svip/svip_interface.h | d1fd66dcf6e4fd758c4ee78f8e1ea936d08f2c99 | [] | no_license | ljh9999/DetTrkPosRec | 07f2fd91f2afe575c2475e0e2bb64c3e8e9f4bb9 | f5522243927780ffc41524708c8771e2f9248b7f | refs/heads/main | 2023-01-28T00:37:13.532222 | 2020-12-04T14:15:49 | 2020-12-04T14:15:49 | 318,535,466 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,738 | h | svip_interface.h | //
// Created by ljh on 2020/10/23.
//
#ifndef FINAL_YOLOV5_SVIP_INTERFACE_H
#define FINAL_YOLOV5_SVIP_INTERFACE_H
#pragma once
#include <fstream>
#include "track.h"
#include <detect/detect.h>
#include "ActRecognize.h"
#include <detect/crop_util.h>
#include "md5/md5.h"
#include "svipAISDK_V3.h"
#include "opencv2/open... |
4b16ab8d6918a9844e382196e9b5795f9fe4f2c1 | 70418d8faa76b41715c707c54a8b0cddfb393fb3 | /758.cpp | 69daf0de82b2fc2e9045acc58effb069dc7079ac | [] | no_license | evandrix/UVa | ca79c25c8bf28e9e05cae8414f52236dc5ac1c68 | 17a902ece2457c8cb0ee70c320bf0583c0f9a4ce | refs/heads/master | 2021-06-05T01:44:17.908960 | 2017-10-22T18:59:42 | 2017-10-22T18:59:42 | 107,893,680 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,957 | cpp | 758.cpp | #include <bits/stdc++.h>
using namespace std;
int wayx[4] = {0, 1, 0, -1};
int wayy[4] = {1, 0, -1, 0};
char map_[15][20];
int cnum, width, used[15][20], height[20];
int valid(int x, int y)
{
return y >= 0 && y < width && x >= 0 && x < height[y];
}
void counts(int x, int y, char c)
{
int i, tx, ty;
cnum++;
use... |
73070236ea0599f5fc0a3c6dd1a3e5f3808519f5 | c9cbdd19454ad19781435e1dd0fa1f1559042057 | /Demo/FollowerDemo.cpp | b6b16f19b03f01e0ee490fbc7a2d95ef180f567f | [
"MIT"
] | permissive | remicongee/Distributed-Lock | e15f185b1ff05bf3a270f7acb363900f62941946 | 0dabd63dbf81c43486d85a9438a54bec77c598fc | refs/heads/master | 2020-04-08T23:15:29.627705 | 2018-11-30T12:04:18 | 2018-11-30T12:04:18 | 159,817,764 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 172 | cpp | FollowerDemo.cpp | #include "../Headers/Follower.h"
using namespace std;
int main() {
// I'm blank
Follower* follower = new Follower();
follower->RunFollower();
return 0;
} |
b8a04fa2c9aab2884b0298e0a75299b8d0d48707 | fab3558facbc6d6f5f9ffba1d99d33963914027f | /include/fcppt/variant/not_equal.hpp | 0dd213314e834ee6158691d482a99645f3f6409c | [] | no_license | pmiddend/sgedoxy | 315aa941979a26c6f840c6ce6b3765c78613593b | 00b8a4aaf97c2c927a008929fb4892a1729853d7 | refs/heads/master | 2021-01-20T04:32:43.027585 | 2011-10-28T17:30:23 | 2011-10-28T17:30:23 | 2,666,694 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 565 | hpp | not_equal.hpp | // Copyright Carl Philipp Reh 2009 - 2011.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef FCPPT_VARIANT_NOT_EQUAL_HPP_INCLUDED
#define FCPPT_VARIANT_NOT_EQUAL_HPP_INCLUDED
#includ... |
21ca94331349d4e13e48ebc96120374f56959270 | b57585a9cadfeec84a22685e7f7f34c1e9d70009 | /langdata.cpp | 1bfd439f6d9152f467c617f451d49d2f9b4028ea | [] | no_license | Erreke/TranslationProcessor | 7cad5a36eea582faba1f2219cccef1a07e024c12 | 0f5d4395bf39924f2b8fc826928dbcfda479c000 | refs/heads/master | 2021-01-21T16:35:00.232392 | 2017-06-12T21:47:03 | 2017-06-12T21:47:03 | 91,896,248 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 136 | cpp | langdata.cpp | #include "langdata.h"
LangData::LangData(QString _key, QString _value, int _id)
{
key = _key;
value = _value;
id = _id;
};
|
5acaca76c6f9f4f9c119ad8853a3c2935f103c00 | 30bdd8ab897e056f0fb2f9937dcf2f608c1fd06a | /DP/629.cpp | e8aa9ced8891ef2e0a05dded7e8cc2138ab8a2cc | [] | no_license | thegamer1907/Code_Analysis | 0a2bb97a9fb5faf01d983c223d9715eb419b7519 | 48079e399321b585efc8a2c6a84c25e2e7a22a61 | refs/heads/master | 2020-05-27T01:20:55.921937 | 2019-11-20T11:15:11 | 2019-11-20T11:15:11 | 188,403,594 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 545 | cpp | 629.cpp | #include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
char c;
c=getchar();
int arr[100090]={0};
int k=1,count=0;
while(1)
{
char temp = c;
c=getchar();
if(c==10)break;
k++;
if(temp==c)
{
count++;
}
... |
045ade9d4e63304d9aee94c947e77d1d8020b544 | 48031a4b7a81c4b0bf01ee5532900059467600be | /SmallObjectAllocator/FixedAllocator.h | 43f079f9dd64bc5c29deb8db98b414c559e60dea | [] | no_license | pvmiseeffoC/Allocators | 72f87fa4d864023b6b926941949d0fbb4c46c1a8 | 1edd21e20efef80e1dbe57f89fbc68ed3cc06d28 | refs/heads/master | 2023-03-06T01:45:22.375329 | 2021-02-07T16:21:31 | 2021-02-07T16:21:31 | 291,521,957 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,479 | h | FixedAllocator.h | #pragma once
#include <limits>
#include <vector>
#include "Chunk.h"
namespace allocators
{
class FixedAllocator
{
public:
using ChunkType = DefaultChunk;
using Chunks = std::vector<ChunkType>;
private:
void deallocate( void* p );
bool makeChunk();
ChunkType* ... |
c6a955ed8485629d6f72c85e92387b12c511a38c | 80e17f421b3b1e11baa8c6860532b0803657789f | /demo/Chapter-11/033.Struct/VectorOperation.cpp | 617e4102fb31dedc9a5dc2a2e2b728afdab08210 | [] | no_license | TakeOver5/My-C-Notes | be26f2243cd6f5eb31c3e85e4e70f5ee1643405e | 8f5a8545288157ce4e5495d91738bbde1c306c94 | refs/heads/master | 2023-02-23T18:59:47.733031 | 2018-11-12T20:11:45 | 2018-11-12T20:11:45 | 126,676,278 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,850 | cpp | VectorOperation.cpp | /*
* 時間：2018/10/07
* 功能：
* 向量的運算。
* 目的：
* 使用結構傳遞結構進入函式。
*/
#include <stdio.h>
#include <stdlib.h>
typedef struct vector{
double x;
double y;
double z;
} V;
void enter(V*);
void vput(V*, V*, char);
V vadd(V*, V*);
double vdot(V*, V*);
V vcross(V*, V*);
int main(void){
double d;
... |
394cb81cade9343dd551631ea9154283e50fb2bc | 31c09851d83f56acbf86ecc4476a7a0a37b164cf | /include/classifier.hpp | 6d6212d9cee0bbcece0785a275c3f01ec1802ccc | [] | no_license | StephanXu/FireDetector | 8f5cfde7e46fc03c5455503ba1f1cd475b424c1b | e77d951ff7c88b648a67e76e6289e195b5858cb1 | refs/heads/master | 2022-04-11T20:01:10.976180 | 2020-03-10T08:16:31 | 2020-03-10T08:16:31 | 164,626,981 | 8 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 728 | hpp | classifier.hpp | #pragma once
#ifndef CLASSIFIER_HPP
#define CLASSIFIER_HPP
#include <string>
#include <vector>
#include <memory>
#include <opencv2/opencv.hpp>
#include <caffe/caffe.hpp>
class Cclassifier
{
public:
/*
Cclassifier:
*/
explicit Cclassifier(const std::string &deploy_file,
const std:... |
56e7d2dd9403b2e7cd9cd15746756497f5b964ac | 137e63892b98e84343b573415e0afa57a8188a6f | /src/OpenGLWindow.cpp | d9f97a01fb721778be9119ffdf4c845dab2c7186 | [] | no_license | Inamsorensen/Explosion | 7e5f868e2708696c9097487355c3f5309f10d4a0 | f77053c71ba33072d8e299148ac8ca254ab2db49 | refs/heads/master | 2021-01-17T10:19:01.893654 | 2016-06-13T08:58:56 | 2016-06-13T08:58:56 | 58,669,293 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,286 | cpp | OpenGLWindow.cpp | #include <QMouseEvent>
#include <QGuiApplication>
#include <ngl/Camera.h>
#include <ngl/Light.h>
#include <ngl/Material.h>
#include <ngl/NGLInit.h>
#include <ngl/VAOPrimitives.h>
#include <ngl/ShaderLib.h>
#include <ngl/Transformation.h>
#include "OpenGLWindow.h"
//---------------------------------------------------... |
212aa394291958bc2d9bb48b76d6ae214c646a57 | 78cffeb33be19a2232c67f0eca6b39dd8e0c4976 | /System.h | 86e25babbe68822de54c2d9e94c3a24991a0a6a8 | [] | no_license | Alburgerto/ECS | d37092279e63ea6159430f41c9bd9a1f96492072 | 46b24af56be40bc0416de633a8217a2cb67040df | refs/heads/master | 2020-04-09T05:33:06.459857 | 2019-01-21T16:38:35 | 2019-01-21T16:38:35 | 160,069,038 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 339 | h | System.h | #pragma once
#include <memory>
#include "Entity.h"
class Shared;
class System {
public:
System(Shared* l_shared);
virtual ~System();
Shared* getShared() { return m_shared; }
// virtual void addEntity(std::pair<std::shared_ptr<Entity>, std::shared_ptr<Component>> l_entity) = 0;
protected:
Shared... |
6f4616237abdfcbccbb2f8e05b4dd05911779541 | 2b721d0e6d9ada23668d02ee14e83219a1ee0f48 | /source/libguiex_core/guiutility.cpp | af5960ea072b24d894a4a17990e7c31092a0b23e | [] | no_license | lougithub/libguiex | fef2165e06f3adb66295aac2cf5f0be24dd47d46 | 30cf061a40a4c113b58765dc3aeacddc4521a034 | refs/heads/master | 2016-09-10T10:20:48.122440 | 2014-06-11T14:17:56 | 2014-06-11T14:17:56 | 2,423,027 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,068 | cpp | guiutility.cpp | /**
* @file guiutility.cpp
* @brief utility function for gui system
* @author ken
* @date 2006-06-01
*/
//============================================================================//
// include
//============================================================================//
#include "guiutility.h"
#i... |
23101ff74215818da99f13cac27bb275f7aa9054 | 3f3a42f429f8bcd769644148b24c3b0e6e2589ed | /GameProject/GameEngine/GameApp/Water/ocean_simulator.h | 59ddb4ce2661c82362bcb6298965bb194a10f28a | [] | no_license | DanielNeander/my-3d-engine | d10ad3e57a205f6148357f47467b550c7e0e0f33 | 7f0babbfdf0b719ea4b114a89997d3e52bcb2b6c | refs/heads/master | 2021-01-10T17:58:25.691360 | 2013-04-24T07:37:31 | 2013-04-24T07:37:31 | 53,236,587 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,244 | h | ocean_simulator.h | // Copyright (c) 2011 NVIDIA Corporation. All rights reserved.
//
// TO THE MAXIMUM EXTENT PERMITTED BY APPLICABLE LAW, THIS SOFTWARE IS PROVIDED
// *AS IS* AND NVIDIA AND ITS SUPPLIERS DISCLAIM ALL WARRANTIES, EITHER EXPRESS
// OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, NONINFRINGEMENT,IMPLIED WARRANTIE... |
d9b5e005186f7818753b884c1d7ceb5c7cc762d6 | 44e09af91487023f303bafbef064276ec257ea94 | /src/search.hpp | c521a3af1d14fb2f0ad3b3077580564651a3433e | [] | no_license | wanmiles/puzzle-search | c104f49e4d64b07a1c2bdfdc60391aabeea448a8 | d6d899d5fee4de3089f75a145e52fb33f620baf6 | refs/heads/master | 2020-05-17T22:34:38.933431 | 2012-07-02T17:25:00 | 2012-07-02T17:25:00 | 32,116,543 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,911 | hpp | search.hpp | /**
* Copyright (c) 2010-2012, Ken Anderson
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions a... |
7a08e125c041acb76b966a7f9bf21cb6d78de703 | 4d33c090428407d599a4c0a586e0341353bcf8d7 | /trunk/tutorial/Model_11_terrain_chunk_painter/renderImp.cpp | b030c0bc15e0573ff98bb25470fbdfc18b6ab362 | [] | no_license | yty/bud | f2c46d689be5dfca74e239f90570617b3471ea81 | a37348b77fb2722c73d972a77827056b0b2344f6 | refs/heads/master | 2020-12-11T06:07:55.915476 | 2012-07-22T21:48:05 | 2012-07-22T21:48:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 832 | cpp | renderImp.cpp | #include "renderImp.h"
RenderEngineImp::RenderEngineImp( HWND h )
{
_hwnd = h;
_render = NULL;
_initialized = false;
_width = 600;
_height = 800;
}
bool RenderEngineImp::create()
{
_initialized = true;
_render = Zen::createRenderEngine();
//
if (NULL == _render)
{
return false;
}
_re... |
03f26fe08ca270bea4d759759423d361a6d28e0a | fe6f1821c2b2a775bfb969b5c98b36cea6d0fe68 | /src/GameState.h | 77a69b12ae9e7be5f9604a40b3c8718bf9633fbe | [] | no_license | qxzcode/cpp-q-learning | 01da3af22fbd0b3c06558628f7db4d163c4651ba | aeddfc516a610732483e78d63432233a2944d740 | refs/heads/master | 2021-04-27T00:05:02.847729 | 2018-03-04T02:42:15 | 2018-03-04T02:42:15 | 123,748,112 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 500 | h | GameState.h | #pragma once
class GameState {
public:
double myPaddleY, yourPaddleY;
double ballX, ballY;
double ballVX, ballVY;
double normBallVX() const { return normV(ballVX); }
double normBallVY() const { return normV(ballVY); }
static constexpr double MAX_V = 1.0;
static constex... |
42fc4ad4609545a025d31139bbba4cf05ce2e476 | e24086db8ad3f89357b0c0dc480c9e723b3e4f5c | /알고리즘 스터디(C++)/여름방학 스터디/여름방학 스터디/사다리 조작.cpp | 444e5f8c1b392f6946925b15e93857f0613d7774 | [] | no_license | ckgusdh10/Portfolio | 5b381d6d361ee32ffbaed66acb1264e45db53852 | fdfb181d173344eee9f7b0c22901be2c1df310ff | refs/heads/master | 2023-02-10T05:39:56.212279 | 2021-01-05T08:47:34 | 2021-01-05T08:47:34 | 184,263,169 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 1,210 | cpp | 사다리 조작.cpp | #include "stdafx.h"
#include <iostream>
#include <vector>
using namespace std;
int N, M, H;
int base[50][50];
int answer = 99;
int Down()
{
int xpos;
int ypos;
for (int i = 1; i < N + 1; ++i)
{
xpos = i;
ypos = 0;
for (int j = 0; j < H + 1; ++j) // 세로로 내려가야 하는 횟수
{
if (base[j][xpos] ... |
8f6c6ecbc98a916ff3573a4d84cec52e0f0554c0 | d6b4bdf418ae6ab89b721a79f198de812311c783 | /mdp/include/tencentcloud/mdp/v20200527/model/UnbindCdnDomainWithChannelRequest.h | 914d4ed8d0f051d67c6213f1fb25d0e1a546b0d0 | [
"Apache-2.0"
] | permissive | TencentCloud/tencentcloud-sdk-cpp-intl-en | d0781d461e84eb81775c2145bacae13084561c15 | d403a6b1cf3456322bbdfb462b63e77b1e71f3dc | refs/heads/master | 2023-08-21T12:29:54.125071 | 2023-08-21T01:12:39 | 2023-08-21T01:12:39 | 277,769,407 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,419 | h | UnbindCdnDomainWithChannelRequest.h | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.