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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c7546e7e5b294bdff4eded06606d33fdd398fb20 | 260694ecb502c1b0768fbbe59b4a1a4796c250c3 | /archive/old_model_generation.cpp | ece8df4599e3f9d394b7c78a4bce2ae99f2465da | [] | no_license | nietup/Degree | 43a91950b48e2a160a9ddb80a570ccb310a6f278 | 54d3bdc557217a807c110217e82b3dba276916df | refs/heads/master | 2020-07-28T14:42:58.108131 | 2017-08-10T22:15:16 | 2017-08-10T22:15:16 | 73,409,619 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,444 | cpp | old_model_generation.cpp | //some old test case functions for constraints (these were bad fo new test
//because it assumes that lines are segmented in the "right" order
/* test case 2
* constraints = 3: c0, c1, c2
* atoms = 3
* parts = 3:
* MODEL
* 1 ? 1
* ? ? 1
* 1 ? ?
*
* positive samples:
* s... |
9e94a5c4ed55bde4bae0a895014856cb7d8c0efe | b4fd060b26bdeffd3b85e813d2ac9e4cdde4f0aa | /Camp/2018-1-2/problem/data/variable/data.cpp | 2d98b5852f563e287c542c728d6c978ba7c62298 | [] | no_license | UnnamedOrange/OI | d86d2cad3e9860b5ddcaf1d9888de8150bf3ac7f | c77abb40e0ca5b3e799c8773cf7cb7291b85dd25 | refs/heads/master | 2021-06-07T07:33:33.363572 | 2020-08-06T09:14:54 | 2020-08-06T09:14:54 | 111,210,109 | 6 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 847 | cpp | data.cpp | #include<bits/stdc++.h>
using namespace std;
int t,n,w,p,q,x[510],u;
inline int ran()
{
return (rand()<<15)+rand();
}
int main()
{
srand(time(0));
ran();
freopen("variable10.in","w",stdout);
int i,j,k,l;
t=10;
n=500;
p=1000;
q=1000;
u=100;
printf("%d\n",t);
while(t--)
{
w=ran()%1000000+1;
printf("%d... |
88338a7195b1e1028ee11d3018d57c6f4434caac | d572d695dce1db9d70ef75c36ae3525b32e6fdfc | /437.cpp | ae6b6e24e585f56c7de13deba162c39b10df3ea5 | [] | no_license | Ardh1999/cb-1483-question-answers | b25a9bc5837e73371947a785c95b26343afc8ae8 | 2fe954714c9ca997a31731d3dbc2ea82bda17f4b | refs/heads/master | 2023-01-10T06:38:03.507605 | 2020-10-13T20:49:09 | 2020-10-13T20:49:09 | 303,801,138 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,544 | cpp | 437.cpp | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 10000005
#define mod 1000000007
#define sp fixed<<setprecision(12)
using namespace std;
/*
vector<int> primes;
ll sumprime[MAX];
bool is_prime[MAX];
void sieve(){
is_prime[0]=is_prime[1]=true;
for(int i=4;i<MAX;i+=2){
is_prime[i]=true;
... |
70b6821755802675aa971f5764644f3a1c0ffc75 | 7a838b8fc2198a970f6ba690c2d672639eda35af | /dww.cpp | 8359a2e62ab475563e7a4ff0a46541305bf2f879 | [] | no_license | Belladonna993/Lionheart | 68550af1368e710fbff645a18389fb2bd5c915bb | c810ee883a8661e3275cadc9db7dd6f7b2889a51 | refs/heads/master | 2021-05-30T14:33:30.175184 | 2016-01-14T03:08:56 | 2016-01-14T03:08:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,866 | cpp | dww.cpp | #include "dww.h"
#include <cmath>
#include <iostream>
void dww::Place(int minR, int maxR, int minC, int maxC, SitRep sitrep) {
bool done = false;
int tr, tc;
Direction td;
/*
switch(rank){
case crown:cout << "crown\n";break;
case knight:cout << "knight\n";break;
case archer:cout << "archer\n";break... |
1be670cd4bc81f287ec0af949d787c09c8243a63 | 1fd9ba44839b254d41d3b4a7b170df5da80fd457 | /IncreasingArray_1094.cpp | f533ce5fe0f59a7dc34aaea58b5ca44ae7cf349e | [] | no_license | MkUtkarsh/CSES | 4f916209ecb26b1eebe5ca2ba3124057c9fd2ae9 | 7d9796c4da601403c63718ecc8b5632e4ab3d323 | refs/heads/master | 2022-12-11T06:27:30.392095 | 2020-08-29T17:07:42 | 2020-08-29T17:07:42 | 291,087,154 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 349 | cpp | IncreasingArray_1094.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ar[n];
for(int i=0;i<n;i++){
cin >> ar[i];
}
ll res = 0;
for(int i=1;i<n;i++){
if(ar[i-1]>ar[i]){
res += (ll)ar[i-1] - (ll)ar[i];
ar[i] = ar[i-1];
... |
e893f73b6da93c54e9597d4f0e29bd1cb3e5e3c0 | 999e0975d00bb6ae749fa68a27bbe2ea338422f8 | /src/diffpy/srreal/PDFCalculator.cpp | 41abe4a5f5bd309187586d0fc0d1fbff0b5b5880 | [] | no_license | cfarrow/libdiffpy | 09c6d4f719368eeecec353b2001d460c4091903d | 05f0bd9a8f362fbe2fb456c9e588cae282bdf35e | refs/heads/master | 2021-01-12T22:33:34.046371 | 2013-11-21T20:24:56 | 2013-11-21T20:24:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 20,733 | cpp | PDFCalculator.cpp | /*****************************************************************************
*
* diffpy.srreal by DANSE Diffraction group
* Simon J. L. Billinge
* (c) 2009 Trustees of the Columbia University
* in the City of New York. All rights reserved.
*
* File coded by: ... |
3db3dcfad6cc0b69c568ddb71b8376b89a3d4bef | f66e0c9c7e7a4e648fd95c9f9cb58d5ac0e2355d | /Game/Pong.h | 1b4378567ec56e63d445c4cbc720896d99ceb439 | [] | no_license | inirion/SFML-Game | 8682f19e6ae1196dd51029bdb2502c9b3df91666 | 6eb54b3c943fb9de42d9ff5a87def69d6f9e6175 | refs/heads/master | 2021-01-11T03:56:57.484588 | 2017-02-14T12:13:19 | 2017-02-14T12:13:19 | 71,269,814 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 697 | h | Pong.h | #pragma once
#include "SFML\Graphics.hpp"
#include "Sounds.h"
#include "Config.h"
#include "Positionable.h"
#include "pong_paddle.h"
#include "pong_ball.h"
class Pong : public sf::Drawable, Positionable
{
private:
bool freshGame;
pong_paddle *player;
pong_paddle *ai;
pong_ball *ball;
sf::Text score;
int playerPo... |
9a17ff5801eafcd0dce42e6fa75f31417ae6dadc | 0b02878f57f66576f2625d0536b294651c85388c | /idxs.hpp | 2f3492c5894574fe01858732928d2aba88cba71a | [] | no_license | bivase/idxs | 58462a8ac6d705f6a4edcb855f570ade42a98c52 | 2a19cee761d105e5503649f57835d22e885f0f14 | refs/heads/master | 2022-12-08T22:09:53.109923 | 2020-09-09T01:13:07 | 2020-09-09T01:17:55 | 291,434,117 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 607 | hpp | idxs.hpp | #include "stdafx/stdafx.h"
namespace idxs
{
template<class T = size_t>
struct dvbs2_mono
{
using value_type = T;
static constexpr T period{ 188 };
static constexpr T len{ 2 };
static constexpr T rows{ 8 };
static constexpr T cols{ period };
static constexpr auto get()noexcept
{
std::... |
39b531e201a49fb2206c3b56bdc06364b509f9da | a7764174fb0351ea666faa9f3b5dfe304390a011 | /src/AdvApp2Var/AdvApp2Var_SysBase_baseinit.cxx | 1ea6e981ac3e5d16f1072c9ae457d92f081dcc38 | [] | no_license | uel-dataexchange/Opencascade_uel | f7123943e9d8124f4fa67579e3cd3f85cfe52d91 | 06ec93d238d3e3ea2881ff44ba8c21cf870435cd | refs/heads/master | 2022-11-16T07:40:30.837854 | 2020-07-08T01:56:37 | 2020-07-08T01:56:37 | 276,290,778 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 485 | cxx | AdvApp2Var_SysBase_baseinit.cxx | // File: fdetlibinit.cxx
// Created: Tue May 21 11:49:45 1996
// Author: Philippe MANGIN
// <pmn@sgi29>
#include <AdvApp2Var_SysBase.hxx>
static int init_STBAS(void)
{
int ICODE = 0;
// Init du Tableau des allocs
AdvApp2Var_SysBase::mainial_();
// Init de LEC IBB IMP
AdvApp2Var_SysBase::maci... |
741869bb00aba30c25b57a16ee14ddcb876d2a6b | d2190cbb5ea5463410eb84ec8b4c6a660e4b3d0e | /hydra2-4.9w/shower/hshowerframe.cc | 838db1e3098938f17454c7c0f3c2143b536e7897 | [] | no_license | wesmail/hydra | 6c681572ff6db2c60c9e36ec864a3c0e83e6aa6a | ab934d4c7eff335cc2d25f212034121f050aadf1 | refs/heads/master | 2021-07-05T17:04:53.402387 | 2020-08-12T08:54:11 | 2020-08-12T08:54:11 | 149,625,232 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,979 | cc | hshowerframe.cc | #pragma implementation
using namespace std;
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include "hshowerframe.h"
ClassImp(HShowerFrameCorner)
ClassImp(HShowerFrame)
//_HADES_CLASS_DESCRIPTION
/////////////////////////////////////////////////////////////
// HShowerFrameCorner
// Class describe coordi... |
7107a21a76dbcc80dc83a54323d9cd16a798d065 | e94b96c57c7a9a4537d3fbc02cb8b2fc78aec2fd | /Day4.Q8.cpp | 26bb730474c8e05062f5e9d0dca36b49686f68e9 | [] | no_license | Saurabkr/albanero-sdp-hack-week | b313b52fbbcf84138840758e6f6835fb0aba825f | 66e0a9f6cf2113972bf083b91d0c42e6f7db4464 | refs/heads/main | 2023-04-06T13:20:16.755358 | 2021-04-09T15:07:15 | 2021-04-09T15:07:15 | 355,078,065 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 495 | cpp | Day4.Q8.cpp | #include <bits/stdc++.h>
using namespace std;
int minimumCost(int cost[], int n)
{
int dp[n];
if (n == 1)
return cost[0];
dp[0] = cost[0];
dp[1] = cost[1];
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1], dp[i - 2]) + cost[i];
}
return mi... |
20a26e4a96e911cc27e81e29de29ab83455307ac | 01dbe06e8ad0d7da2635604650edbbd8f1dd5cf8 | /cpp/src/rz/rz-kauvir/rz-graph-valuer/scope/rz-lisp-graph-scope-token.cpp | 3deaebe58b242aa2af1c134e858af16f29e23339 | [
"BSL-1.0",
"LicenseRef-scancode-proprietary-license"
] | permissive | scignscape/SubjectiveSpeechQualityMeasurement | ccfe93d4569d45d711eb6a92c842cac9ae4a5404 | ab68b91108f3f1d7086ea1ac9a8801c063dc9bff | refs/heads/master | 2020-04-04T11:24:26.062577 | 2018-12-02T04:44:44 | 2018-12-02T04:44:44 | 155,889,835 | 0 | 1 | BSL-1.0 | 2018-11-13T17:09:00 | 2018-11-02T16:02:47 | C++ | UTF-8 | C++ | false | false | 2,441 | cpp | rz-lisp-graph-scope-token.cpp |
// Copyright Nathaniel Christen 2018.
// 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)
#include "rz-lisp-graph-scope-token.h"
#include "token/rz-lisp-token.h"
USING_RZNS(GVal)
USING_RZ... |
a19418720b235497d8bb3474431815857c63070f | 8aed0e4b4e570e063b394e579cc850757ce66e71 | /Finish_it/Src/Entities/Animations/animation.cpp | 1c5527d64f7386df6e0d11038c6e7355ecd81cb7 | [] | no_license | Olxe/Finish_it | 2df1c53c0e4db096a6df8d300d93ac48b5b50e87 | 007e7a2fe303cb7d96bc79143fd22c7d066d04b0 | refs/heads/master | 2022-05-27T07:34:15.709510 | 2019-12-21T15:38:19 | 2019-12-21T15:38:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,468 | cpp | animation.cpp | #include "animation.h"
Animation::Animation(sf::Sprite* spriteSheet, std::vector<sf::Vector2i> framesPos, sf::Vector2i frameSize, float frameTime, std::string name, bool loop, bool cancelMovement, int priority)
: isActive(false)
, isCancelMovement(cancelMovement)
, isLoop(loop)
, m_spriteSheet(spriteSheet)
, m_fr... |
fcf290a320d2c0be6da9eadc70c74cbabb211ce6 | 2ce387d353c30b44eda56334554eea49c7697cd1 | /midori_engine/src/midori/renderer/camera/PerspectiveCamera.cpp | 48752efd86efa7a3a524163154d1b69f3cd07f1a | [
"MIT"
] | permissive | SzyJ/midori_engine | 2bd7651ed6a9073c4f2f024c90d06a0c334763af | c032354b53798af7e34dc0a8c852c83843df974d | refs/heads/master | 2021-08-25T18:05:55.657810 | 2020-02-05T11:59:43 | 2020-02-05T11:59:43 | 204,341,614 | 1 | 1 | MIT | 2019-11-25T22:39:15 | 2019-08-25T19:40:23 | C++ | UTF-8 | C++ | false | false | 3,966 | cpp | PerspectiveCamera.cpp | // Author: Szymon Jackiewicz
//
// Project: midori_engine
// File: PerspectiveCamera.cpp
// Date: 31/10/2019
#include "mdpch.h"
#include "PerspectiveCamera.h"
namespace midori {
PerspectiveCamera::PerspectiveCamera(float aspectRatio, glm::vec3 position, glm::vec3 up, float yaw, float pitch)
: m_AspectRat... |
ddb491c7bf401d27ca5f42481b91a5863579246d | 3edd809ff6e3ae940d0e2c538b3a047436c856dd | /cleetcode/headers/convert.h | ade790ff12a7b405d41e0b6534eb89c6da8f1b99 | [] | no_license | zhangyiwen5512/myleetcode | ee11f7c28b07b1474a627692f85429c89ef62782 | 7b6e45011b20985a231555a4d05243fb896c7922 | refs/heads/master | 2023-02-09T03:35:20.461919 | 2021-01-04T10:50:49 | 2021-01-04T10:50:49 | 313,602,841 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,772 | h | convert.h | //
// Created by zhangyiwen on 2020/11/25.
//
#ifndef CLEETCODE_CONVERT_H
#define CLEETCODE_CONVERT_H
#include <string>
/*
* 将一个给定字符串根据给定的行数，以从上往下、从左到右进行 Z 字形排列。
* 比如输入字符串为 "LEETCODEISHIRING" 行数为 3 时，排列如下：
* L C I R
* E T O E S I I G
* E D H N
* 之后，你的输出需要从左往右逐行读取，产生出一个新的字符串，比如："LCIRETOESIIGEDHN"。
*... |
e74e8dfd60f1c17a659077735ec9fa05f3d7e06d | 2227248f6735db6a8e8faa3ad1012054efd69809 | /615 a co/ان تا کلید و ام تالامب همه روشن میشود؟.cpp | 3bbaaabf95ca2d629725d840f252c4f5d93135d1 | [] | no_license | maryamBarmaky/AcmSolution | e39f49d327166ea7ff859ea57ba3c2b6fe78cea4 | 5005c6d68c90fbda4a327bb282f3799ae2e09a30 | refs/heads/master | 2021-01-19T03:10:37.225911 | 2017-04-07T11:33:45 | 2017-04-07T11:33:45 | 87,309,159 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 392 | cpp | ان تا کلید و ام تالامب همه روشن میشود؟.cpp | //615 b code forces
#include "iostream"
using namespace std;
int a[101], n, m, i, b, j, c;
int main()
{
cin >> n >> m;
for (i = 0; i<n; i++)
{
cin >> b;
for (j = 0;j<b; j++)
{
cin >> c;
a[c] = 1;
}
}
for (j = 1; j <= m; j++)
if (a[j] != ... |
ebd318f7995479d0aa4606bdeb5795a0a8752e86 | d93159d0784fc489a5066d3ee592e6c9563b228b | /HLTrigger/Timer/test/chrono/src/mach_clock_get_time.cc | f8f2e9cba7dcf2cab9211ab48d69d11372e8cbe4 | [] | permissive | simonecid/cmssw | 86396e31d41a003a179690f8c322e82e250e33b2 | 2559fdc9545b2c7e337f5113b231025106dd22ab | refs/heads/CAallInOne_81X | 2021-08-15T23:25:02.901905 | 2016-09-13T08:10:20 | 2016-09-13T08:53:42 | 176,462,898 | 0 | 1 | Apache-2.0 | 2019-03-19T08:30:28 | 2019-03-19T08:30:24 | null | UTF-8 | C++ | false | false | 908 | cc | mach_clock_get_time.cc | #if defined(__APPLE__) || defined(__MACH__)
// Darwin system headers
#include <mach/mach.h>
#include <mach/clock.h>
#include "interface/mach_clock_get_time.h"
#ifdef HAVE_MACH_SYSTEM_CLOCK
// based on host_get_clock_service(SYSTEM_CLOCK) and clock_get_time(...)
const clock_serv_t mach_system_clock::clock_port = mach... |
643193a3e35e1f1ba2e3b3797d3dc4a435b3207c | 1582f416a3a107463d7dd9faebca3ffd00ea1dcd | /src/Puppet.cpp | a1f53e0ddf52f85277d4938c24d1a5bfc9a8ef22 | [
"MIT"
] | permissive | Treagle350/Battleships | 28c18e850a9b6b57668697ca2f98772ab8ec7dcc | 65c4e565c91e5d1f9a6f1ca7752cf40141ac75b3 | refs/heads/master | 2021-03-13T03:31:15.201845 | 2017-05-30T13:19:34 | 2017-05-30T13:19:34 | 91,497,016 | 0 | 0 | null | 2017-05-28T17:23:45 | 2017-05-16T19:35:00 | C++ | UTF-8 | C++ | false | false | 3,025 | cpp | Puppet.cpp | #include "Puppet.h"
#include <vector>
#include <cstdlib>
#include <ctime>
Puppet::Puppet(int coordX, int coordY){
health = 100;
//attackingPower = 50;
blockSprite = "|^|";
std::vector<int> pathX;
std::vector<int> pathY;
set_coordinates(coordX/2,coordY/2,coordX,coordY);
}
Puppet::Pu... |
f7c099da714952a9fc5c74bc59e3956677737d4e | c96292f20e3e405715ce654ed25e9f0c7995bf71 | /QipaiServer/Extern/GameUser/UserManager.h | 9ee296b054c6196862bb416c2696f156a950f0c0 | [] | no_license | Aden2018/myQipai | c68498b77a61eb8e5840e74c68006cf9f0c55a8d | b6a7b2a91b5234f0f74c038f448fd2008347e332 | refs/heads/main | 2023-07-15T22:08:47.804029 | 2021-08-19T13:13:29 | 2021-08-19T13:13:29 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,861 | h | UserManager.h | #ifndef __USER_MANAGER_H__
#define __USER_MANAGER_H__
/*
玩家模型管理器
*/
#include <map>
#include <string>
#include "GameUser.h"
#include "TimerManager.h"
//延迟处理结构
struct SDelayDelData
{
int nDelayTime;
int nUid;
};
class UserManager : public TimerObject
{
private:
UserManager();
~UserManager();
public:
static UserM... |
2f8f6d0273bf61647fcaf71353f0589af076c445 | b71089fe17f39bbef6885758fa9da2f8070b656b | /project2/kernels/grad_case7.cc | 3a07990306cacb7897ea157687e9cf3760c71fc6 | [
"MIT"
] | permissive | QiliangLai/CompilerProject-2020Spring | dcffed21f9534239ac595055b5f289173e51ca21 | 3e09ce0c71ea4d1449fde0156aeb3f34d40969ac | refs/heads/master | 2022-10-24T04:25:22.743968 | 2020-05-29T07:06:38 | 2020-05-29T07:06:38 | 269,868,279 | 0 | 0 | MIT | 2020-06-06T04:33:29 | 2020-06-06T04:33:28 | null | UTF-8 | C++ | false | false | 82 | cc | grad_case7.cc | #include "../run2.h"
void grad_case7(float (&dB)[16][32], float (&dA)[32][16]) {} |
773940394e96234d527f1bec1bdfef1d6b51d305 | a68310fb079e4bdfa8f14e6d1990e9a5f13a1042 | /fpgrowth.cpp | f74097cfffe904568e6e68fabfcf4bb8dc5d8499 | [] | no_license | kamalnis/data-mining-algo | c0c590d443a1d5a02012ea9ab37cb1b1c771d8de | abefb7e81ec90bf347326a41c79fcf0d175453e0 | refs/heads/master | 2016-08-04T00:08:51.624498 | 2015-09-11T07:37:22 | 2015-09-11T07:37:22 | 42,293,936 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,241 | cpp | fpgrowth.cpp | #include<iostream>
#include<vector>
#include<set>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
using namespace std;
struct fptree{
char item;
int count;
struct fptree * links[100];
int linkcount;
struct fptree *parent;
struct fptree *next;
};
struct itemset{
char items;
... |
90f7b19bc5b86affd466ce027ade0b4b9582f0bb | 23c8d0f167823221dce3a0dbb8b4bee6dc7fce33 | /TouchGFX/generated/fonts/src/FontGetters.cpp | 0d188da790a02adc4ba469ce36bc590de2382ef3 | [] | no_license | koson/touchgfx_STM32F429I-DISCO_example | 54cf562f3e59558536ab5c27479a2c6e06a0d554 | 0d5cec3daa7819c9c527de9f62ea388a6ade29ae | refs/heads/master | 2022-01-19T12:46:05.405836 | 2019-07-08T21:19:51 | 2019-07-08T21:19:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,111 | cpp | FontGetters.cpp | // Autogenerated, do not edit
#include <touchgfx/InternalFlashFont.hpp>
#ifndef NO_USING_NAMESPACE_TOUCHGFX
using namespace touchgfx;
#endif
// verdana_15_4bpp
extern const touchgfx::GlyphNode glyphs_verdana_15_4bpp[];
extern const uint8_t unicodes_verdana_15_4bpp[];
extern const touchgfx::KerningNode kerning_verdan... |
3e901dba5525aaa9545dd1401780f443e4ed6e41 | 8f9ba5459fab4f32ec86621047d56171bf755e62 | /graficos por tortuga.cpp | e41422e7e484ca442039d3f95a18d93f30bb1613 | [] | no_license | CesarEMR/Cesar-Mu-oz-3-B | 6848c80efce2276c78c2e8add8abb13f67c1d8ea | 9dd11361aa65c598353949ef1868a9cc2a312a47 | refs/heads/master | 2020-03-27T19:58:23.361222 | 2018-11-21T07:16:23 | 2018-11-21T07:16:23 | 146,392,663 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,832 | cpp | graficos por tortuga.cpp | #include "stdafx.h"
#include <iostream>
#include <string>
#include <time.h>
#include <stdlib.h>
#include <math.h>
#include <fstream>
using namespace std;
int Menu();
void Mostrartablero(int piso[20][20], int largo, int ancho);
int main()
{
int piso[20][20] = {0}, salir = 0;
int poshori = 0, pos... |
5d66639bfa5004a8c4025fd496b71db507969fe9 | 29b4050f703705cc9102e6a9d8f2800caa8459e7 | /cpp/FoodChain/FoodChain/FoodChainEatInfo.cpp | 613d0e0d8d395f0dd04d663721fe6743bac056e5 | [] | no_license | bloodysnowx/ProgramContest | c1cf5ac2a843ed84772437557991ca1ceb519e1e | f954d4a35d1ba97f36f7deb258dc9fd179eaef2c | refs/heads/master | 2021-01-18T13:58:45.668409 | 2015-01-28T00:33:33 | 2015-01-28T00:33:33 | 6,904,456 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 725 | cpp | FoodChainEatInfo.cpp | //
// FoodChainEatInfo.cpp
// FoodChain
//
// Created by 岩佐 淳史 on 13/05/19.
// Copyright (c) 2013年 岩佐 淳史. All rights reserved.
//
#include "FoodChainEatInfo.h"
bool FoodChainEatInfo::isValid()
{
// xとyが同じ種類に存在しない、かつ、yがxを食べる関係ではない
return isValidAnimalNumbers() && !tree->findSet(x, y) && !tree->findSet(x, y... |
daa86709f7082bce16e7a631d6ac7a048dec1298 | 4bea57e631734f8cb1c230f521fd523a63c1ff23 | /projects/openfoam/rarefied-flows/impingment/sims/test/nozzle1/1.64/T | 985bb3378d9375fb7ab99693a3aa79a0f9d80143 | [] | no_license | andytorrestb/cfal | 76217f77dd43474f6b0a7eb430887e8775b78d7f | 730fb66a3070ccb3e0c52c03417e3b09140f3605 | refs/heads/master | 2023-07-04T01:22:01.990628 | 2021-08-01T15:36:17 | 2021-08-01T15:36:17 | 294,183,829 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,559 | T | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v1912 |
... | |
4d5e28a8b48840093ab46c2e7c1e2487d2282b9e | b55127be27f7de852cbbcce02d310289c6bf5a1f | /Volume.h | b8132b4fc2077f30245a2c416489ffd16906b138 | [] | no_license | thalesmonteiro/ProjetoLP1 | 366849ad934c03b5fb2ab2a655d8f7f33d176a12 | d5e6c4915572c7861dc4cbc682dd355499b1cdac | refs/heads/master | 2021-01-23T16:18:18.158765 | 2017-06-04T04:53:10 | 2017-06-04T04:53:10 | 93,290,904 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 210 | h | Volume.h | #ifndef Volume_h
#define Volume_h
#include <string>
class Volume {
private:
int volume;
public:
void setVolume(int);
int getVolume();
void AumentarVolume();
void BaixarVolume();
};
#endif |
a7db24739547ace8167f8f06283b2bf195f758f0 | f53200a6c5b375b0cbbe6f1e4f33bb55376ca0b0 | /cooling.cxx | 3907e3569ce7b4a14032fd3380cd8d858a0d23e3 | [] | no_license | agacz/beta-delayed-neutrons | 665db62b0c6e656dd3550112e50887875c236e41 | 3bcbfbc2c774db5c23db6e0da9eb7c22df46b9e8 | refs/heads/master | 2021-01-17T15:05:29.165049 | 2015-06-08T17:13:11 | 2015-06-08T17:13:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,479 | cxx | cooling.cxx | /*
2012-11-24 Shane Caldwell
For 135-Sb data, make trees for different times after capture.
*/
#include <unistd.h>
//#include "stat.h"
#include "stdio.h"
#include "TH1.h"
#include "TH2.h"
#include "TFile.h"
#include "TTree.h"
#include "TLeaf.h"
#include "bdn.h"
void cooling (const char*);
int main (int argc, char ... |
0436910aa2ca94c4a46bb78b652f3c1783300993 | 91a882547e393d4c4946a6c2c99186b5f72122dd | /Source/XPSP1/NT/ds/security/passport/include/passportcookiefunctions.h | 40dd6b52a4a815d284b8ac8020ebd9c727fe82b3 | [] | no_license | IAmAnubhavSaini/cryptoAlgorithm-nt5src | 94f9b46f101b983954ac6e453d0cf8d02aa76fc7 | d9e1cdeec650b9d6d3ce63f9f0abe50dabfaf9e2 | refs/heads/master | 2023-09-02T10:14:14.795579 | 2021-11-20T13:47:06 | 2021-11-20T13:47:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,211 | h | passportcookiefunctions.h | //-----------------------------------------------------------------------------
//
// @doc
//
// @module PassportCookieFunctions.h | Passport specific cookie
// routines.
//
// Author: Darren Anderson
//
// Date: 5/19/00
//
// Copyright <cp> 1999-2000 Microsoft Corporation.... |
48049e7b260e032f202e17c45d6521afd79bbce5 | ecb2595d223f2100752cdcb7a31a459ffbe5b3d6 | /CardLineage/Music.cpp | ed44d849a6ad03a44bb0f58c106ebd8338670aaf | [] | no_license | DeviSerene/CardLineage | 5d1e2b6a63f4babc2d24f43e440494b5938636d1 | 9646f701c8ca17f344f12078272099be8ac66d2d | refs/heads/master | 2020-03-30T21:41:20.307074 | 2018-10-09T15:53:25 | 2018-10-09T15:53:25 | 151,638,229 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 512 | cpp | Music.cpp | #include "Music.h"
Music::Music(std::string _name)
{
//Load music
m_name = _name;
m_music = (std::shared_ptr<Mix_Music>)Mix_LoadMUS(_name.c_str());
if (m_music == NULL)
{
printf("Failed to load music! SDL_mixer Error: %s\n", Mix_GetError());
}
}
Music::~Music()
{
Mix_FreeMusic(m_music.get());
m_music = NU... |
52a0ddbae70033cacfeb2fd4110aaef6bbfdb0fa | 2753608f87a1e8fa312feced7af20917ea9cc004 | /Sorting/Counting Sort/CPP/counting_sort.cpp | d77307fe8654a5ecabcbcfd1d5944f1c6ee0b553 | [
"MIT"
] | permissive | VAR-solutions/Algorithms | 76faed6515367b6f27638b910dbc07f340fae56f | 4ad6773e9675ef35aa858ca3969be5ddf6e3daea | refs/heads/dev | 2023-08-15T11:37:26.048316 | 2021-08-03T07:00:28 | 2021-08-03T07:00:28 | 151,157,582 | 794 | 1,249 | MIT | 2023-07-29T00:28:36 | 2018-10-01T20:50:24 | C++ | UTF-8 | C++ | false | false | 548 | cpp | counting_sort.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cout<<"Enter size of array:\n";
cin>>n;
vector<ll> a(n,0);
cout<<"enter the array:\n";
for(int i=0;i<n;i++){
cin>>a[i];
}
//frequency array:
ll m = *max_element(a.begin(),a.end());
vector<... |
d80034a5bdcc35c204ccbf5bcaa671941d71cca8 | d64737d31ae9caba2820ea1048be3f9bce708b42 | /cpp/least-number-of-unique-integers-after-k-removals.cpp | a7bd0640e66b6eb087311a8f7d95f2bdc81a794a | [] | no_license | ldcduc/leetcode-training | 2453ec13e69160bc29e8e516e19544c2b25bf945 | 40db37375372f14dd45d0a069c8b86fe36221f09 | refs/heads/master | 2023-08-05T01:46:52.993542 | 2021-09-18T16:47:54 | 2021-09-18T16:47:54 | 271,736,046 | 9 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,227 | cpp | least-number-of-unique-integers-after-k-removals.cpp | /* Problem url: https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals
* Code by: ldcduc
* */
/* Begin of Solution */
class Solution {
public:
int findLeastNumOfUniqueInts(vector<int>& arr, int k) {
sort(arr.begin(), arr.end());
vector<pair<int, int>> tmp;
int p... |
825f5dfae1af1944458c8900ca7bf76b367df4ab | d65af644a1e6cdad3b7d1e3766a394b1a0cb5cc0 | /DesktopMicro 3.0/Polygons.cp | 7bd201ba278123afab288cd2947d74b6f6bc44a8 | [] | no_license | jstanley70/dm_2_c_plus_plus | 39bd56494372bd9e3734feee126eeea8d8f6b8db | e557c20db9c1620f9179289e3e3e233701a05e38 | refs/heads/master | 2021-01-01T18:17:12.001514 | 2014-06-22T18:30:42 | 2014-06-22T18:30:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,864 | cp | Polygons.cp | #include "Polygons.h"
void Test(void);
void Test(void)
{
Polyhedral a(0);
double t;
vector<double> v(1,2,3);
vector<double> v1(v);
t = a.length();
if( v1 || v){return;}
}
void Polyhedral::DetermineVertices(void)
{
BTree<vector> face1,face2,face3;
face1 = faces;
face2 = faces;
face3 = faces;
while(face1){
... |
a45a8d8c8da14334c5ed5f88fdfefde1d18adfb3 | 0f2635f18d7b47323332ab733f34c9308888e851 | /LUOGU/[ZJOI2007]矩阵游戏.cpp | 797b7098bf40617d7802ac98c4fa30611871609a | [] | no_license | stevebraveman/Code | 2e48b3638272126653c5a2baabac3438db781157 | 4205dd6c4c2f87a8d8554a21efac39616672004e | refs/heads/master | 2020-06-30T21:55:41.313296 | 2019-11-13T22:57:51 | 2019-11-13T22:57:51 | 178,631,305 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,814 | cpp | [ZJOI2007]矩阵游戏.cpp | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 40010
namespace STman {
template <typename Tp>
inline void read(Tp &x) {
#define C getchar()
Tp f = 1;x = 0;
char k = C;
while (k < '0' || k > '9') {if (k == '-') f = -1; k = C;}
while (k >= '0' && k <= '9') {x = x * ... |
a0b6da4cb7aa8f6bae581af6ce2f741f0012e2ae | af2113881b0954e61fe2c9ed814046a0fe118fef | /debugger/src/gui_plugin/CpuWidgets/AsmArea.cpp | 56c9ee90fa4b1d7b5b402ed6ba5af3690937b5df | [
"BSD-2-Clause",
"BSD-3-Clause"
] | permissive | qshan/riscv_vhdl | 3ab29c262720b8a7e5cbb8cce87940604bea2e2f | ccf68cd3c685499356605cfc80f01454ee5b98e1 | refs/heads/master | 2021-01-19T12:04:31.701791 | 2017-02-15T20:00:19 | 2017-02-15T20:00:19 | 82,282,423 | 1 | 0 | null | 2017-02-17T09:49:24 | 2017-02-17T09:49:23 | null | UTF-8 | C++ | false | false | 14,863 | cpp | AsmArea.cpp | /**
* @file
* @copyright Copyright 2016 GNSS Sensor Ltd. All right reserved.
* @author Sergey Khabarov - sergeykhbr@gmail.com
* @brief Disassembler viewer area.
*/
#include "AsmArea.h"
#include "moc_AsmArea.h"
#include <memory>
#include <string.h>
#include <QtWidgets/QBoxLayout>
#include <QtWidgets/QLa... |
30ae118a699e109bcc6cff72d3c9018c60165bb3 | a4a6665b8e1e0971e9541f3c681856809ae861db | /Example/M5StickC/src/main.cpp | 89b3f20e795edb8462a775eaa33657e72e032283 | [] | no_license | walidamriou/ESP32_PWM_Generator_Arduino | 7f514bb07b4d5b78adaeaf3cae06b251df2e6fcf | 8a0fac8cb13ae9faf079f72752aafff9be3078f6 | refs/heads/main | 2022-12-26T14:37:23.148876 | 2020-10-11T09:22:55 | 2020-10-11T09:22:55 | 301,082,022 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,152 | cpp | main.cpp | /*
********************************************************************
ESP32_PWM_Generator_Arduino
Implement PWM generator for Espressif Systems ESP32 boards by Arduino framework
Github: https://github.com/walidamriou/ESP32_PWM_Generator_Arduino
Copyright © 2020 Walid Amriou
Last update: October 2020
**... |
d8853b5854fbf2649749004f04ca1662b3c577a3 | db798847ce02bbbdff7d779a81685bcf72741c87 | /schoolwork/spring2013/sysprog/sdltut11.cpp | d313312eb72581df92e6e195c5406d72d8d1243d | [] | no_license | Shawn5961/src | b301d276cfba987bff4a06fd5ab72ca0d220ec11 | 2d974036907114ceac9312babdb52eb4577203a8 | refs/heads/master | 2020-04-13T21:10:24.458967 | 2015-02-24T21:12:25 | 2015-02-24T21:12:25 | 9,043,364 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,326 | cpp | sdltut11.cpp | #include "SDL/SDL.h"
#include "SDL/SDL_image.h"
#include "SDL/SDL_ttf.h"
#include "SDL/SDL_mixer.h"
#include <string>
const int SCREEN_WIDTH = 640;
const int SCREEN_HEIGHT = 480;
const int SCREEN_BPP = 32;
SDL_Surface *background = NULL;
SDL_Surface *message = NULL;
SDL_Surface *screen = NULL;
SDL_Event event;
TTF_... |
c886b1248364075aa8c258c170d47768a515fcfe | 161dda44247a61118ea84fa40c485b5379b12ac5 | /module_04/ex01/RadScorpion.cpp | b491acf2e38307e53a79a430555d71b81d2846ad | [] | no_license | solaldunckel/piscine_cpp | d38c82f3a252e08c6731b67068ff4efb9105ddc2 | a9846cb70d402e14a57c488a7ed58a3b0fd91373 | refs/heads/master | 2022-12-13T20:18:16.487737 | 2020-09-21T08:24:40 | 2020-09-21T08:24:40 | 224,680,394 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,376 | cpp | RadScorpion.cpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* RadScorpion.cpp :+: :+: :+: ... |
5887ac61a57917b1f4f6d5080d75e25e5c966423 | 3a23a1275eec8468d5d99652a8f98e467aa1a70b | /Player.cpp | 46833d29d3b5b1cc07517f2709e3b73c22a71588 | [] | no_license | Kilometerr/BattleshipOpenGL | 75fa5d6e49bc2781eda76748a5ea0a23081284a5 | 864607d198d747b0ad86b68ac6f20b68d7beb26d | refs/heads/master | 2020-03-17T17:16:06.674237 | 2018-06-05T22:18:05 | 2018-06-05T22:18:05 | 133,781,500 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,246 | cpp | Player.cpp | //
// Created by barno on 30.05.2018.
//
#include "Player.h"
Player::Player(int _id) {
life = 14;
id = _id;
myMap = new int *[10];
enemyMap = new int *[10];
//Inicjalizacja map
for(int i = 0; i < 10; i++) {
myMap[i] = new int[10];
enemyMap[i] = new int[10];
... |
662a2adde08c021d8cd90959b56e6e968b629f7f | dc8824afa322f30d0cb0ce1a4bd120ba4ae719fa | /skiros_lib_skill_dummy/src/drive.cpp | 6153b27da78d87994cc97639eed9c56f20cb1296 | [] | no_license | frovida/skiros_std_lib | f17f5ef85c813e69f6a324c634f5ace0f688783f | a6c95bc678819c82a823302922978c65b43dff0c | refs/heads/master | 2020-12-24T20:42:46.874221 | 2017-09-28T16:44:24 | 2017-09-28T16:44:24 | 59,300,265 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 3,093 | cpp | drive.cpp | #include <skiros_lib_skill_dummy/drive.h>
namespace skiros_skill
{
using namespace skiros_config::owl;
using namespace skiros_wm;
Drive::Drive()
{
////////////////////////////////////////////////////////
// Specify the skill description constants
////////////////////////////////////////////////////////
... |
b902748b76c8e70cff59d492a59b84e18d249261 | fe0e6329d1f173742a07cfa444b81c2b6abaaa2c | /shell.cc | 2eb26cf5bb317f06d230d0fe56e9f12cea2ee41b | [] | no_license | XiaoyiHu1998/EOsLevelProgramming | 814055d83a35a1751c56ccc5673347e6ff364795 | 142f0f4319e622997f666eeb60ee60eb0284dc51 | refs/heads/master | 2020-05-03T05:10:57.638039 | 2019-03-29T16:36:56 | 2019-03-29T16:36:56 | 178,441,570 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,877 | cc | shell.cc | #include "shell.hh"
#include <fstream>
using std::ifstream;
using std::ofstream;
int main(){
std::string input;
char buf[2];
int fd = open("promptInput.txt", O_RDONLY);
if(fd == -1){
cout << "Error reading promptInput.txt";
exit(1);
}
std::string prompt = read(fd, buf, 1);
... |
6d9bdbcb1fd84855f114888b8494865c77c451d8 | f57610ce330076f2ba95041bbf5f295a9ef40dfe | /Solution/847-shortest-path-visiting-all-nodes/shortest-path-visiting-all-nodes.cpp | e083d114c7c2dde0581c566122dcee3d782a19e9 | [] | no_license | derek-zr/leetcode | 095df86dd00c85b98a3f3ef51e784a65ab75c13d | ec7edcca6a63648d87bed6dd557738b89511368d | refs/heads/master | 2021-01-21T21:07:07.114659 | 2020-11-27T09:29:35 | 2020-11-27T09:29:35 | 92,308,067 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,043 | cpp | shortest-path-visiting-all-nodes.cpp | // An undirected, connected graph of N nodes (labeled 0, 1, 2, ..., N-1) is given as graph.
//
// graph.length = N, and j != i is in the list graph[i] exactly once, if and only if nodes i and j are connected.
//
// Return the length of the shortest path that visits every node. You may start and stop at any node, you ma... |
79481a564b44e8c7f2d84eb7c8f5d77d057e77f1 | 45dfd61ae02c0e6a7b0bed2eb23230f0d7b10689 | /Lab 1 Q-3(b).cpp | b8bd73b81d06a51cf127a43338badd5faf04573b | [] | no_license | jayesh-685/ComputerLab | 35c79950552bbe853727bd57fa0a9a7a40ebd49d | 472f8cb3625cf35d9d6d6b21b6f1b6861a9d7861 | refs/heads/main | 2023-03-20T15:43:27.576911 | 2021-03-08T04:05:28 | 2021-03-08T04:05:28 | 345,526,122 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 186 | cpp | Lab 1 Q-3(b).cpp | #include <iostream>
using namespace std;
namespace first_val
{
int val = 200;
}
int val = 100;
int main () {
int val = 50;
cout << first_val::val;
return 0;
}
|
64c926d4510aba2aaf84e02b76b62e29a852c93d | 1bb9a93e1e3346d263c22a9e467f703d3497b2f8 | /files.cpp | 7fcb5eda5b299634bc5512dd90f8f5c585edae7c | [] | no_license | k-kashapov/sortPoem | 5ca7afb9c8f666ea74087c8e779660fb547d8283 | 8c4200fd3d13bcd8ff92bb8477c9ca9420d7b0cf | refs/heads/master | 2023-08-01T05:11:49.433312 | 2021-09-16T08:31:12 | 2021-09-16T08:31:12 | 399,575,549 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,580 | cpp | files.cpp | /*****************************************************************//**
* \file files.cpp
* \brief В файле собраны все функции, связанные с работой с файловой системой
*********************************************************************/
#include "files.h"
// Убирает предупреждение о функциях библиотеки s... |
429a2c19309abd7608c8bdb34e73c29902d45fcf | 60a02e8649dc5a1446e5dada5e17bcb80a741b59 | /src/memoize.h | 282854688f9ff101b092f99ab870b7325a9cfcdc | [] | no_license | vivekgautham/Templates | cef0a32f4f60a146bdefabd8f9fe7356ff7eee65 | 63408d81efecf46915af316c5d34a6baf9614922 | refs/heads/master | 2021-01-23T04:40:46.599393 | 2018-09-30T02:45:09 | 2018-09-30T02:45:09 | 80,370,356 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 912 | h | memoize.h | #ifndef MEMOIZE_H
#define MEMOIZE_H
#include "header.h"
template < typename T >
class Memoize
{
template < typename... Args >
static auto memoizeFunc(Args&&... args) -> decltype(T::memoizeFunc(std::forward(Args)(args)...))
{
{
/* Create a static map variable with
key type = type of tuple o... |
cc48958f64d3f3aabbb96fd2b050812223ac16db | dd567db2ebc714cc48f4af46febfbb0e8642de88 | /tests/testing.cpp | afa36a0b67b31da3a6e8a186e9e6591071d8549d | [] | no_license | mikeTerentev/megaFinder | 2f4d58ea1bf038eaba59b05fa834decf3bcf0451 | 96fa6fe816bf404fe720cdac9b33597c69a970f9 | refs/heads/master | 2020-04-11T05:49:35.434621 | 2019-01-12T08:19:30 | 2019-01-12T08:19:30 | 161,560,963 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,349 | cpp | testing.cpp | //
// Created by Михаил Терентьев on 2018-12-21.
//
#include <tests/gtest/gtest.h>
#include <QObject>
#include <fileindexer.h>
#include <trigramsrepository.h>
#include <trigramssearcher.h>
const QString dir = "/Users/miketerentyev/itmo/2-year/MegaFinder/tests/test_dir/";
TEST(file_count_correctness, empty) {
Trig... |
357e7f00c61b0db031b904ddb88491d630522fb7 | ee80ddf7d1de919847f1072f83c9ee3e3deeae02 | /gwell/source/vi-kernel/vielemepolyhfaceedge.hh | 2389f0e5e2e81db11947ee489b16b42aead71502 | [] | no_license | pjakwert/gwell3d | 8bef1d3616810e6a79aff12869f164cdff0ac8b5 | 798b928d91864ba7f2ed5b9ccd46b3d6a693908c | refs/heads/master | 2020-03-26T00:42:58.091397 | 2018-08-10T21:48:12 | 2018-08-10T21:48:12 | 144,333,776 | 0 | 0 | null | null | null | null | ISO-8859-2 | C++ | false | false | 3,948 | hh | vielemepolyhfaceedge.hh | #ifndef VIELMEPOLYHFACEEDGE_HH
#define VIELMEPOLYHFACEEDGE_HH
/*!
* \file vielemepolyhfaceedge.hh
* \author Bogdan Kreczmer
* \date 2003.03.23
*
* Plik zawiera definicję klasy ViElemePolyhFaceEdge
* modelującej krawędzie związane z daną ścianką i mające właściwą
* orientację względem tej ścianki. Czego nie gwa... |
a3ee367dfef22781e4dd5fef097fd1ca3701d05d | 16f335f8182e899ba3569baf613e299f6261ead6 | /server/msfs/FileManager.cpp | fa184cac334e8479be82d7ee57e1374d0fee3498 | [] | no_license | Praying/Puppy | ac4593cf9f20b5a87874c2d2a319b91951c63072 | f8b8cc9391f106f34322ae12d1ca633e2b4b5418 | refs/heads/master | 2020-03-16T03:33:23.704628 | 2018-09-09T06:31:57 | 2018-09-09T06:31:57 | 132,489,712 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,454 | cpp | FileManager.cpp | //
// Created by quran on 2018/8/25.
//
#include "FileManager.hpp"
#include "File.hpp"
#include <glog/logging.h>
#include <glog/raw_logging.h>
#include <sys/time.h>
#include <sys/stat.h>
#include "CriticalSection.hpp"
namespace Flow::MsfsServer {
int FileManager::initDir() {
bool isExist = File::isExist(... |
46dc419b3f370e89c8d85e52071c48a8d0f14409 | 61bfe506ead460fc3896fd16001ffd1250977fde | /Qt/calculator/qt_calculator.cpp | 8a1be89646f619ba9157a0a509294db82231b6f5 | [] | no_license | jasonleakey/CrapCodes | 9de63eb033a25dd2e6f288c3e293861d4fabf130 | 8ea109c242356a020c9c9d094f90632b6a7e98af | refs/heads/master | 2021-01-20T06:57:03.907537 | 2013-03-18T05:48:44 | 2013-03-18T05:48:44 | 8,847,779 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,457 | cpp | qt_calculator.cpp | /*
* CPP_practice - TODO
*
* Feb 6, 2010
* Copyleft(R) by jasonleakey
* <jasonleakey@gmail.com>
* --------------------------------------------------------------------
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published... |
5820852b50b62a73685c46fb1b4af2c0dd146547 | de80268cf13a3acae311984d49c26ba34ac3e571 | /Sources/UICore/Display/Window/display_window_provider.h | b1b5621c6fbdd3c4efa9471d8ad0e8dc45ed48c2 | [
"Zlib"
] | permissive | rombust/UICore | f5930fa133d13101b3e9ea5ae68d37d59c30f795 | e643b83147b7818eb5d34d311676fde6ddf54abe | refs/heads/master | 2021-01-24T01:22:16.232890 | 2019-05-29T11:52:22 | 2019-05-29T11:52:22 | 44,157,623 | 1 | 0 | null | 2015-10-13T06:51:27 | 2015-10-13T06:51:27 | null | UTF-8 | C++ | false | false | 8,949 | h | display_window_provider.h | /*
** UICore
** Copyright (c) 1997-2015 The UICore Team
**
** This software is provided 'as-is', without any express or implied
** warranty. In no event will the authors be held liable for any damages
** arising from the use of this software.
**
** Permission is granted to anyone to use this software for any pur... |
4d4efb553b755aa26ed17254f32890a35e6149ef | 91a882547e393d4c4946a6c2c99186b5f72122dd | /Source/XPSP1/NT/admin/wmi/wbem/sdk/samples/nondistrib/servev/servlist.h | a034e9b0566f0eda8cc02cd6e2b592598e1569d9 | [] | no_license | IAmAnubhavSaini/cryptoAlgorithm-nt5src | 94f9b46f101b983954ac6e453d0cf8d02aa76fc7 | d9e1cdeec650b9d6d3ce63f9f0abe50dabfaf9e2 | refs/heads/master | 2023-09-02T10:14:14.795579 | 2021-11-20T13:47:06 | 2021-11-20T13:47:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 459 | h | servlist.h | // Copyright (c) 1997-2001 Microsoft Corporation, All Rights Reserved
#ifndef __SERV_LIST__H_
#define __SERV_LIST__H_
#include <windows.h>
class CServiceList
{
public:
CServiceList();
~CServiceList();
void AddService(LPCWSTR wszService);
int GetSize();
LPCWSTR GetService(int nIndex);
void Sort... |
2b3786b1add930939bb0a5f45a8e8ae93c50cb11 | 1821098f7d9a73490d02b6cf586f902fced8271b | /HW8 5.cpp | 0e4ac1eeef98de786d5b09da63bb3ba92ef841e9 | [] | no_license | savinduharith-SDL/Homework-8 | 34d2a54bb78b8a785037e756dbbb6a0eaf0c133a | df6fe2f979ff449b7f17860711927e23bda5664a | refs/heads/main | 2023-08-14T12:20:55.869512 | 2021-10-03T12:24:02 | 2021-10-03T12:24:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 250 | cpp | HW8 5.cpp | #include<iostream>
using namespace std;
//function to print pointer
void pointerPrinter(int *a)
{
cout << *a << endl;
}
int main()
{
int x;
//user input
cout << "Enter number: ";
cin >> x;
//function call
pointerPrinter(&x);
return 0;
}
|
453d9154f15452b1488fa2139232f35e60632380 | a2dacbcedd956acfdad0957ecf0497cfad7d1f80 | /GlutSpielfeld.h | 09d3b2e8247cf31389185e320bfe31a3fc4b9eed | [] | no_license | google-code/3d4wins | da60c2d6ab3d487c7424c7b19a01c28ff8c7ee5e | da16835c6bcb226086bc1405e1893f8193e2888a | refs/heads/master | 2016-09-05T09:51:34.226542 | 2015-03-13T15:19:43 | 2015-03-13T15:19:43 | 32,163,339 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 704 | h | GlutSpielfeld.h | #ifndef SPIELFELD_H
#define SPIELFELD_H
#include "GlutObjekt.h"
#include "RGB.h"
#include "RGBA.h"
/**
Dieser Experte stellt ein Spielfeld da. Dieses ist ein reines Brett ohne Muster und ohne Stäbe.
*/
class GlutSpielfeld : public GlutObjekt {
private:
int anzahlSpielfeldPunkte;
public:
GlutSp... |
5c56b907dda76d2daea6e1bfc2bffb661e786073 | a8fa56874784c26ee268b0a0d14c69ee27bf2905 | /source/apps/quadwar/view/camera.h | b0c2fa99765b57fe62a948c7a143c5f30cb360d5 | [
"MIT"
] | permissive | ogryzko/laplace | 00d89ee0b68153d1470781298009dc7fc61165aa | be63caa0c6d1c4fceab02ab5b41b6d307ef7baaf | refs/heads/main | 2023-08-27T13:36:27.634379 | 2021-09-21T06:17:02 | 2021-09-21T06:17:02 | 416,058,413 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,470 | h | camera.h | /* apps/quadwar/view/camera.h
*
* Copyright (c) 2021 Mitya Selivanov
*
* This file is part of the Laplace project.
*
* Laplace is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
* ... |
5be4233dad473aff77c5a7541fb2064d6068eb54 | be5deeb6b3c353591d414926b3470b9db1023983 | /serial/Function.h | d93183863bc9536ed9a2bf8dd4835cab2bb5fae2 | [] | no_license | m-rahimi/Liquid-Crystal | 55f8637177506d28ee78f775f1e5ac5311844b32 | cc2feba2a1743f02238420b3a8fd688785b8568e | refs/heads/master | 2021-01-11T19:52:37.693813 | 2017-02-14T05:09:04 | 2017-02-14T05:09:04 | 79,413,472 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 920 | h | Function.h | /*
* File: Function.h
* Author: amin
*
* Created on May 4, 2015, 9:05 AM
*/
#ifndef FUNCTION_H
#define FUNCTION_H
#include "Points_bulk.h"
#include "Parameter.h"
class Function {
public:
float Q2[6];
float tr1,tr2,tr3;
float grad[18];
float doubledot;
float dotd[6];
float dLdG[6], dE... |
6b4bf4020f1bb673819c92ce3148488636188e8d | 33fa13fe1708415802e1e5d0876359ee06f5d8f7 | /FCFS_priority.cpp | 27d1a4d71849f4882f70c4f594230e915909216d | [] | no_license | Nayeem123/OS_PROJECT | 4ff2edb90273f743da085c9e15743c9674b4e7fc | ce3bee3dc6b7cdab36f1ca813e00e02dd8213ad6 | refs/heads/master | 2020-03-07T14:15:45.516308 | 2018-04-09T23:02:23 | 2018-04-09T23:02:23 | 127,522,357 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 965 | cpp | FCFS_priority.cpp |
//sorting in arrivaltime ||||||||||||||||||||||||||
void swap(int id[],int at[],int bt[],int n){
int ind,min,k,f,i,j,m;
for(i=0;i<n;i++){
m=at[i];
ind=i;
for(int j=i+1;j<n;j++){
if(at[j]<m){
ind=j;
m=at[j];
}
}
//printf("%d\t",m);
min=at[i];
at[i]=at[ind];
at[in... |
4b753521ba5e677d8e6443b0a2e343b0eb9e0617 | 516e6cf51c197363deb861a0c02654857aa69e33 | /Spark/include/Transition/DoubleValueInterpreter.hpp | c37dba0c36aa8ff1e5461c5fd3c47e1adee65a75 | [] | no_license | MyFriendTames/Spark-0.0.1 | a2f6117ac8eb38b9161703e4c18db04a331aa272 | d1895a9c8426e824abd9d0e509cd34efd1d93c84 | refs/heads/master | 2023-02-09T14:44:12.687537 | 2021-01-06T16:40:11 | 2021-01-06T16:40:11 | 273,329,726 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 493 | hpp | DoubleValueInterpreter.hpp | #ifndef DOUBLE_VALUE_INTERPRETER_HPP
#define DOUBLE_VALUE_INTERPRETER_HPP
#include "Transition/Transition.hpp"
class DoubleValueInterpreter{
private:
double v1;
double v2;
public:
DoubleValueInterpreter( const double &v1 = 0, const double &v2 = 1 );
void setValue1( const double... |
a581ee14fdb5c85ac8ad1b0c2b29efa434c5ffd6 | 0a55ecd43e9b1220a0dee704f090a2dff4ee95d0 | /main.cpp | 016becd09240f809fc9c77d925dd4d0ccec2ca00 | [] | no_license | xxvms/ReadingFileYT | f2847bab07d86d8ab61408535ffb06f2538145de | 37073f538e3d7ec143997be7b7f935bddd58e77a | refs/heads/master | 2020-06-27T22:54:35.543680 | 2017-06-13T20:19:20 | 2017-06-13T20:19:20 | 94,254,060 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 344 | cpp | main.cpp | #include <iostream>
#include <fstream>
int main() {
std::ifstream object("test.txt");
int a, b;
if(object.is_open())
{
object >> a >> b;
std::cout << "Total: " << a + b;
}
object.close();
std::ofstream object1("test.txt");
std::string abc{"hello world"};
object1 ... |
f51c1ceb8f3118172c4c4cf4ec103048100c5b1f | c78c926155760aa63d24ad26b3356f6d19398f69 | /NEUQOJ/实验班/双周练/第3次双周练(华东师范校赛)/黑心啤酒厂.cpp | 11c2359d66c8df33287aea3122ae7c4cd561740b | [] | no_license | fhyPayaso/ACM | 34c26aff0697ef0e7956cd03e30f13739a286466 | 0c7f4bf298e9a164f8a5ae140f30f441ccc226dc | refs/heads/master | 2021-08-30T05:04:53.518780 | 2017-12-16T03:39:10 | 2017-12-16T03:39:10 | 114,429,801 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 261 | cpp | 黑心啤酒厂.cpp | #include<iostream>
using namespace std;
int gcd(int a,int b)
{
int t;
while(b)
{
int t=a%b;
a=b;
b=t;
}
return a;
}
int main()
{
int x,n;
scanf("%d%d",&x,&n);
for(int p=2;p<=n;p++)
{
int t=gcd(x,p);
cout<<p/t<<endl;
}
return 0;
}
|
d52948d9901919737484faf8fac52b9db5829102 | b7fe23d660cc9154f32758d9f897412b3ad5d90c | /src/PileupInfo.cc | 67ab7df2a0f0930fef9696f48b28def68362150c | [] | no_license | ICHiggsInv/ICHiggsTauTau | d0574ab67f74183beb041088695bb0ad27f91042 | 80f1f311906c693f526e00d54b716a526759333c | refs/heads/master | 2021-01-18T01:25:30.589341 | 2015-04-16T10:40:29 | 2015-04-16T10:40:29 | 23,577,742 | 0 | 1 | null | 2014-09-25T14:08:26 | 2014-09-02T12:28:21 | C++ | UTF-8 | C++ | false | false | 302 | cc | PileupInfo.cc | #include "UserCode/ICHiggsTauTau/interface/PileupInfo.hh"
namespace ic {
//Constructors/Destructors
PileupInfo::PileupInfo() {
num_interactions_ = 0;
bunch_crossing_ = 0;
true_num_interactions_ = 0;
}
PileupInfo::~PileupInfo() {
}
void PileupInfo::Print() const {
}
}
|
3159894e576f19fdd0f0ba0a3346a7b9ddbb9d51 | d50b3cf185f19206cc04657efb39e441f8e5ac59 | /GameTemplate/Game/Archer/State/ArcherIdleState.h | e3341781a2ada8077b11f64a42e8b25a9d29c730 | [] | no_license | kaito1111/GameTemplete | bf908fe837c7777dd8e6b34dc9a2399f8e044646 | b752228adae4913c831c32270a9a700e72b597fd | refs/heads/master | 2023-08-24T21:10:48.896577 | 2021-10-14T05:21:51 | 2021-10-14T05:21:51 | 278,224,007 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 556 | h | ArcherIdleState.h | #pragma once
#include "Archer/Archer.h"
/// <summary>
/// アーチャーが待機状態に呼ばれる関数
/// 継承を使って利用する
/// </summary>
class ArcherIdleState : public IArcherState
{
public:
/// <summary>
/// コンストラクタ
/// IArcherStateにArcherのポインタを渡している
/// </summary>
/// <param name="a">アーチャーポインタ</param>
ArcherIdleState(Archer* a) :
IArcherS... |
e7838284d8421382908232e1cb50cc29d16bd0b2 | a57549946f0425d1fd0ca9825a62e78a953b771f | /src/CRationalNumber/Rational.cpp | ce4019dd8e5ee13229ed1fc2aafd18b2d6317f43 | [] | no_license | DolgushevEvgeny/Lab5 | e9941917f0e55e7a4e71f5d3b4519bcc2c6797fa | 6f0a056104824e2a3c3a075157c767510c029d81 | refs/heads/master | 2020-06-02T09:24:05.777464 | 2015-04-24T19:37:24 | 2015-04-24T19:37:24 | 34,537,977 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,660 | cpp | Rational.cpp | #include "stdafx.h"
#include "Rational.h"
#include <algorithm>
#include <iostream>
#include <string>
CRational::CRational()
: m_numerator(0)
, m_denominator(1)
{
}
CRational::CRational(int numerator)
: m_numerator(numerator)
, m_denominator(1)
{
}
CRational::CRational(int numerator, int denominator)
: m_numer... |
0078d25ec03341832dae90b76086f8f2d4918a2a | b03b9303eb038cc5948901c1383bf8c69dcfb2b2 | /A_Helpful_Maths.cpp | edf00b992aec0c46499351a498168afc3d9a252f | [] | no_license | Amit-45/code-forces | 5829b4b5cb739b2922a027de3a9adf70d07ca195 | 748cf9a61da2464a701a3f5f8a0ad22cc6e6e10c | refs/heads/main | 2023-07-17T07:23:05.588078 | 2021-09-02T17:22:25 | 2021-09-02T17:22:25 | 362,148,897 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 845 | cpp | A_Helpful_Maths.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
string x;
cin >> x;
int c1 = 0;
int c2 = 0;
int c3 = 0;
string resultString = "";
for (int i = 0; i < x.length(); i++)
{
if (x[i] == '1')
{
c1++;
}
if (x[i] == '2')
... |
e9927bc71247b122ad86fa41424c3abdf7ec8373 | c81a121bca0dbe68d41ef183f72b2d9f99623adf | /src/offb_node.cpp | 7cc1559cc0db361692f661abe50b7a6a202f6167 | [] | no_license | ch-jwoo/pathmaker | 0f679c24d492b390c2720565be3dd02dd93ec871 | bf68c21ef02d6f6a6ac6fd4a204804ddc7504a60 | refs/heads/master | 2022-04-11T22:58:58.241700 | 2020-02-08T07:53:01 | 2020-02-08T07:53:01 | 236,493,657 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,429 | cpp | offb_node.cpp | /**
* @file offb_node.cpp
* @brief Offboard control example node, written with MAVROS version 0.19.x, PX4 Pro Flight
* Stack and tested in Gazebo SITL
*/
#include <ros/ros.h>
#include <geometry_msgs/PoseStamped.h>
#include <geometry_msgs/Twist.h>
#include <mavros_msgs/CommandBool.h>
#include <mavros_msgs/SetMode.h>... |
02ab41c41810b25a6d7546fdad82aff314d8c4e5 | c32ee8ade268240a8064e9b8efdbebfbaa46ddfa | /Libraries/m2sdk/game/ai/C_SQM_CarCrew_S2T_SpeechWingmanKnockedDownHuman.h | 9291aa0a801c8831c58b6ac78bb7cbbbb5001783 | [] | no_license | hopk1nz/maf2mp | 6f65bd4f8114fdeb42f9407a4d158ad97f8d1789 | 814cab57dc713d9ff791dfb2a2abeb6af0e2f5a8 | refs/heads/master | 2021-03-12T23:56:24.336057 | 2015-08-22T13:53:10 | 2015-08-22T13:53:10 | 41,209,355 | 19 | 21 | null | 2015-08-31T05:28:13 | 2015-08-22T13:56:04 | C++ | UTF-8 | C++ | false | false | 479 | h | C_SQM_CarCrew_S2T_SpeechWingmanKnockedDownHuman.h | // auto-generated file (rttidump-exporter by h0pk1nz)
#pragma once
#include <game/ai/C_SQM_CarCrew_S2T.h>
namespace game
{
namespace ai
{
/** game::ai::C_SQM_CarCrew_S2T_SpeechWingmanKnockedDownHuman (VTable=0x01E45A30) */
class C_SQM_CarCrew_S2T_SpeechWingmanKnockedDownHuman : public C_SQM_CarCrew_S2T
{
public:
... |
acd2a1bdde4552056cfe6b43b843039fd63eca86 | 27f43caebb71cbcbfffd741534a545a46ff66546 | /databaseReader.hpp | 4b35ecce847617225855896c9ef9d6d3278f1699 | [] | no_license | modIronhide/sqlDoc | eb53b8ec6be3c4d32aa982fa027607778e3d1dee | 36701a4db8c0af00e6da57b2b399f6cfe3d87275 | refs/heads/master | 2020-03-27T07:23:40.398795 | 2016-06-16T07:19:08 | 2016-06-16T07:19:08 | 61,270,728 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,306 | hpp | databaseReader.hpp | #include "TableStructure.hpp"
#include <stdlib.h>
#include <iostream>
#include "cmdline.h"
#include "printdata.h"
#include "mysql++.h"
//#define CPPCONN_DONT_TYPEDEF_MS_TYPES_TO_C99_TYPES
//#include <mysql_connection.h>
//#include <mysql_driver.h>
//#include <cppconn/driver.h>
//#include <cppconn/exception... |
4b144941e6fcb9f18105fdbf34bdd1d453cf017d | 4d9c6253a620c6ed84b5e2824a60585b91502632 | /Note.h | e8928e9d615b26e21ca7592f2f47e63418883fd4 | [] | no_license | Honion/Arche22 | 6c9dc42b47dc7e71ddd789b78906c00d699fb5c6 | 0128f20d599e32d71fd715b17c132db296b1ab15 | refs/heads/master | 2020-05-31T07:40:40.308739 | 2015-01-05T09:44:02 | 2015-01-05T09:44:02 | 28,648,720 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 219 | h | Note.h | #ifndef __Note_H__
#define __Note_H__
class Note{
public:
Note(int n);
~Note();
void setNote(int n);
int getNote();
protected:
int note;
};
#endif
|
88b952e9a692cf34ebd2f822e16bbd6cdae2001e | 204bc4e90ceef6cd0374e2607c7a3ae5239cd608 | /GameEngine/src/System/Collide.cpp | 37509bfc41a515e05d17991b6cba2c4028fb5b78 | [] | no_license | Ericriminal/R-Type-Epitech-Tech-3 | 7bde5244bfb96243356d26183a557ce93e017280 | c2983def1bad5baa8fe8993a006313e4dc53aca6 | refs/heads/master | 2023-02-17T06:55:44.907398 | 2021-01-18T11:11:31 | 2021-01-18T11:11:31 | 329,395,424 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,870 | cpp | Collide.cpp | /*
** EPITECH PROJECT, 2020
** Collide.cpp
** File description:
** Collide
*/
#include "System/Collide.hpp"
#include "Core/Coordinator.hpp"
void Collide::init(std::shared_ptr<Coordinator> _coordinator)
{
coordinator = _coordinator;
}
void Collide::checkBullet(const sf::Sprite &bullet, int id)
{
for (int ano... |
2ee95d42970c852e4f84c98c0d2d4685d26ddee0 | a69de224762d0f9378344f17c209964bb21463d2 | /Filter/spuc/comm/modulator.h | 00f2bbbe972220ee06ee608bdacc6aa328c35831 | [] | no_license | slacker247/MoCap | 7659e644edac5b3bdb4b9df97000f56cb4233380 | d37d066d625df56147b72b645f129f267aa1e0d2 | refs/heads/master | 2021-01-01T05:09:46.355723 | 2016-05-08T13:45:16 | 2016-05-08T13:45:16 | 58,313,858 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 24,673 | h | modulator.h | //
// SPUC - Signal processing using C++ - A DSP library
/*---------------------------------------------------------------------------*
* IT++ *
*---------------------------------------------------------------------------*
* Copyright (c) 1995-2002 by Tony Ottosson, ... |
a9c9da45c50ca439a5d6bacca5cb9f94db182577 | 70a1e4e6b8d0f97ecabbc1b4b5b52a47da0520a5 | /sources/ReadWriteShortcuts.h | 583cb12daf53f1fef18a2c6cf49040a9cef3b6f1 | [
"MIT"
] | permissive | podgorskiy/fsal | 18ad725158ac83ad49a0e9aedc9454f20ad60d88 | 43a10daf07a641b7be64c6a837393d4334c4b543 | refs/heads/master | 2022-06-15T03:49:53.466233 | 2020-05-05T09:11:40 | 2020-05-05T09:11:40 | 141,553,188 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 862 | h | ReadWriteShortcuts.h | #pragma once
#include "FileStream.h"
#include <cstdint>
#include <cstring>
namespace fsal
{
template<typename T>
inline void operator << (File& f, const T& d)
{
::fsal::FileStream(f) << d;
};
template<typename T>
inline void operator >> (File& f, T& d)
{
::fsal::FileStream(f) >> d;
};
/*
template<>
i... |
ebe69377876d45d9bdb090a48b88e347bddea305 | 37c9a4c87319d33910db75f3c7c0d8356c3b433a | /.vscode/lab3/lab3.cpp | f6da246e636353001b00d324e9012b7c70ccbd02 | [] | no_license | alikhan2002/PP1 | 614dbc134f80370ededc1a2dba3c84328321a8ec | db333ef8bc6577f748a33c2208e381e9c55ed1b9 | refs/heads/main | 2023-03-04T15:54:50.829087 | 2021-02-16T08:14:30 | 2021-02-16T08:14:30 | 334,682,190 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 203 | cpp | lab3.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,max=-1e9;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]>max) max=a[i];
}
cout<<max<<endl;
return 0;
} |
9868758e380353963867fa17b3e4d636e52b6fa4 | 8c8658cd6bbd5368c14f29c38258bff58f988c5b | /ProjektFAP(myHope)/AI.h | 691ceae14ab7b09d16cb4d9a8cfc7ae00301355a | [] | no_license | SebKasch/ProjektFAP-myHope- | 7c3b76f0e04acc1a931bff2f61923126e4225b4b | 9ba9566d436bff7c71889efbb2ecf4ee7ffe5a2d | refs/heads/master | 2020-06-09T06:19:33.354739 | 2019-06-24T13:00:45 | 2019-06-24T13:00:45 | 193,389,438 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 280 | h | AI.h | #pragma once
#include "Player.h"
#include <list>
#include "Insel.h"
#include <random>
class AI :
public Player
{
public:
Insel *target();
AI(const std::list<Node*> ©Insel, Insel &startinsel, int startguthaben);
~AI();
//private:
std::list<Insel*> m_besuchteInseln;
};
|
6023af61c187619a148a3e98c02dd8ae54d8b264 | 740af44094400a92ce2c7fb14d9def6771eacbfe | /src/libaten/deformable/DeformMeshSet.h | 804d2107b9875e86ecb23700e23d5a553c21c2bf | [
"MIT"
] | permissive | nackdai/aten | 86f2de6b6e5d7931388bd7cbb466ae18f981de7a | a3c8c818be8d72a2267ed4c933ac60b4eb1c4ef4 | refs/heads/main | 2023-09-01T11:02:40.201933 | 2023-08-29T17:23:32 | 2023-08-30T10:02:59 | 81,186,981 | 57 | 4 | MIT | 2023-08-30T10:03:01 | 2017-02-07T08:51:24 | C++ | UTF-8 | C++ | false | false | 1,269 | h | DeformMeshSet.h | #pragma once
#include "deformable/DeformPrimitives.h"
#include "deformable/Skeleton.h"
#include "misc/stream.h"
#include "geometry/NoHitableMesh.h"
#include "scene/host_scene_context.h"
namespace aten
{
/**
* @brief メッシュセット.
* マテリアルごとのプリミティブセットの集まり
*/
class DeformMeshSet : public NoHitableMesh ... |
d1c10fe45103258be72cabdfba2ef5b2374dd964 | 7441179ac1a2f9273f3783646f2f87d961fb2dc8 | /Code/EX1/StereoPanorama.cpp | 2eab0be283b6ff72e29a20d20d36aad3c32cae4f | [] | no_license | GalZaidman/3D-StereoPanoramaCreator | 4a4e0a5f5512e1c77ac1de3381888eea0c59658a | 172313537364c5d0f470c5e19c071dbb29ee25bc | refs/heads/master | 2020-03-10T06:03:45.448739 | 2018-04-12T11:30:31 | 2018-04-12T11:30:31 | 129,230,885 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,834 | cpp | StereoPanorama.cpp | //Stereo Panorama Program
//©All rights reserved to Avia Maza, Sabina Aledort and Gal Zaidman
//includes
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <opencv/cv.h>
#include <opencv/highgui.h>
#include "opencv2/core.hpp"
#include "opencv2/imgproc.hpp"
#include "openc... |
e1a072c895e217010ad1812bb964b651b6f199d1 | c01252097566681a17f0a6aecf76a2e47e1a491e | /province.cc | 1e23a8bfac82b0ac8f0dce1ddd0f99fb134d5ab4 | [] | no_license | jordanhunt20/cps222-project5 | a60463f21d564ee767992592dcfa6aed0b526563 | 8511e31d4b15a57a853a4cd43e136923467bb5e0 | refs/heads/master | 2020-12-24T20:43:12.481216 | 2016-05-05T05:05:07 | 2016-05-05T05:05:07 | 56,542,877 | 0 | 0 | null | 2017-07-07T14:02:09 | 2016-04-18T21:17:56 | C++ | UTF-8 | C++ | false | false | 17,386 | cc | province.cc | /*
* Implentation of Province.h
* Copyright 2016 Adam Vigneaux and Jordan Hunt
* Based on algorithms by Dr. Bjork
*/
#include "./province.h"
#include <algorithm>
#include <stack>
#include <cfloat>
/*
* Constructor
* @param source File containing province:
* 1. One line: number of towns (n), number of ro... |
4bff190f6eb18f530c5afa1f431bbdd34f508932 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir7941/dir7942/dir8062/dir8063/dir12766/dir12767/dir19789/dir19799/file19906.cpp | 16e4599572e23982da6649575d6ca1865478c502 | [] | no_license | tgeng/HugeProject | 829c3bdfb7cbaf57727c41263212d4a67e3eb93d | 4488d3b765e8827636ce5e878baacdf388710ef2 | refs/heads/master | 2022-08-21T16:58:54.161627 | 2020-05-28T01:54:03 | 2020-05-28T01:54:03 | 267,468,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 115 | cpp | file19906.cpp | #ifndef file19906
#error "macro file19906 must be defined"
#endif
static const char* file19906String = "file19906"; |
d83793ac4a689b53b7e6fc6489d0cfe11e0d59b5 | 31c31345946b3526ffe3f1eafbc9dd7cdb48e03a | /URI Online Judge/Paradigmas/uri2920.cpp | 6077d64e6d2e1f12745c110ca91897664e0251cb | [] | no_license | felipefoschiera/Competitive-Programming | 84967cb7c6b82df5990cccea5d5b6862b9e63f65 | fe664046d0161fd6a15d4b8d8f983e77c6dc3dcb | refs/heads/master | 2022-02-23T16:07:04.326089 | 2019-10-04T19:22:22 | 2019-10-04T19:22:22 | 198,893,046 | 0 | 0 | null | 2019-07-25T19:53:36 | 2019-07-25T19:53:36 | null | UTF-8 | C++ | false | false | 549 | cpp | uri2920.cpp | // URI 2920 - Número Pequeno
// Felipe G. Foschiera
#include <iostream>
using namespace std;
int main(){
string s;
int K;
while(cin >> s >> K){
string ans = "";
for(int i = 0; i < (int)s.length(); i++){
while(!ans.empty() && K > 0 && ans.back() > s[i]){
ans.pop_b... |
2253c6bfc9d341fb829249c20a5d8c859a6cbbee | d204eaf9449b2d03fc72bce1680904f5a18f6dc1 | /560.subarray-sum-equals-k.cpp | d594d3be383e9b9c5b33f0fe24b2474adbd3cfd2 | [] | no_license | AkshatParihar/LeetCode-1 | 2b2e4455744d12ef56d7ff800a53ae88df80a50d | bf632201ea61aa0092ed538d13fbf28265bc5358 | refs/heads/master | 2023-03-22T02:55:51.622174 | 2020-08-24T19:46:32 | 2020-08-24T19:46:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 773 | cpp | 560.subarray-sum-equals-k.cpp | class Solution {
public:
int subarraySum(vector<int>& nums, int k) {
int n=nums.size();
if(n==0)return 0;
unordered_map<int,int>map;
vector<int>prefix(n);
prefix[0]=nums[0];
for(int i=1;i<n;i++)
{
prefix[i]=prefix[i-1]+nu... |
a9282b53d397511a7db6c4ca1bb9fdfe9f11cdb7 | 2242466612d9a31e63bb913111d8b9843ecc8d77 | /build/msvs2017/apps/vulkan_glfw_app/vulkan_material.hpp | 23144a483285b1332c28f81097dbb8138a3cd06e | [
"MIT"
] | permissive | SergeyLebedkin/VulkanPlayground | e14cd76bb6d873448e1d0b595b36d560873721a3 | db90a0272efdc1dc6f164ce7c22ac36bb65e1280 | refs/heads/master | 2020-04-20T00:32:38.597127 | 2020-04-11T09:35:36 | 2020-04-11T09:35:36 | 168,523,902 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,084 | hpp | vulkan_material.hpp | #pragma once
#include "vulkan_descriptors.hpp"
#include "vulkan_context.hpp"
#include <glm/vec4.hpp>
// VulkanMaterialUsage
enum VulkanMaterialUsage {
VULKAN_MATERIAL_USAGE_COLOR = 0,
VULKAN_MATERIAL_USAGE_COLOR_LIGHT = 1,
VULKAN_MATERIAL_USAGE_COLOR_TEXTURE = 2,
VULKAN_MATERIAL_USAGE_COLOR_TEXTURE_LIGHT = 3,
VUL... |
90cc37ebff15c024e01687f97997b69bad379278 | bb705eea53fccdb9fad5cdae1190d19c6249918c | /Compute_nCr___p_Set_2_Lucas_Theorem.cpp | bbc98536d235411be17beac903e5e8e19e12a5f5 | [] | no_license | niteshcse14/geeksforgeeks | f1e4e935f7d420caed1c0a142798dae5d09e0dd8 | 99fbfcc6294ff8e148bc8a1f921c0a5ee7e87590 | refs/heads/master | 2020-03-29T13:49:21.000669 | 2018-09-23T12:50:34 | 2018-09-23T12:50:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 525 | cpp | Compute_nCr___p_Set_2_Lucas_Theorem.cpp | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int nCrDP(int N, int R){
int dp[R + 1];
memset(dp, 0, sizeof(dp));
dp[0] = 1;
for(int i = 1; i <= N; ++i){
for(int j = min(i, R); j > 0; --j){
dp[j] = (dp[j] + dp[j - 1]) % MOD;
}
}
return dp[R];
}
int nCrLucas(int N, int R){
if(R == 0... |
5d9355c510336cfc35197bd395550b281e670007 | 573f60accd206a468729457976abe4e3b805edd8 | /дз 25.11.18/10..cpp | 1340f3e7dc752a7c74870376c34ad1593dc62bee | [] | no_license | Le0nA/Informatika | d64865563a7412b2614016dccf6beab53dec3957 | 9d8fcc8c188ff49960b93ac0e807bb76cbce41f3 | refs/heads/master | 2021-06-11T20:14:39.026628 | 2019-12-25T18:02:52 | 2019-12-25T18:02:52 | 152,994,103 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 405 | cpp | 10..cpp | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> arr(n);
arr.assign(n, 1);
for (int i = 2; i < n; i++)
if (arr[i] == 1) {
for (int j = i * 2; j < n; j += i) {
arr[j] = 0;
}
}
int primorial = 1;
for (int i = 2; i < n; i++) {
if (a... |
969644b1878162f9fe456304251584df3b8f9e8c | 59418b5794f251391650d8593704190606fa2b41 | /sample_plugins/original_snippets/em5/logic/local/gangsters/GangsterKillerAllLogic.cpp | f160b731ce331ed5299e48598cf35fff460f30db | [] | no_license | JeveruBerry/emergency5_sdk | 8e5726f28123962541f7e9e4d70b2d8d5cc76cff | e5b23d905c356aab6f8b26432c72d18e5838ccf6 | refs/heads/master | 2023-08-25T12:25:19.117165 | 2018-12-18T16:55:16 | 2018-12-18T17:09:54 | null | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 10,831 | cpp | GangsterKillerAllLogic.cpp | // Copyright (C) 2012-2018 Promotion Software GmbH
//[-------------------------------------------------------]
//[ Includes ]
//[-------------------------------------------------------]
#include "em5/PrecompiledHeader.h"
#include "em5/logic/local/gangsters/GangsterKillerAl... |
c79c9c629ce5d1f950de1371dc191ceae34f17f3 | 88e96058fe40cd571e03bd7c6ecea398f20b9caf | /Ratha.h | a76de2d0299beb58fc8a9a82ea21cf8ef8d182db | [] | no_license | agreyest/P3Lab7_AlessandroReyes | 4fe9b85ad3a392ed219b057864f2535cb36cb2b2 | f5d72a11bdef37ef4fbaf3f7bd63b2777bc9a40c | refs/heads/master | 2022-10-20T19:29:57.494300 | 2020-06-13T00:52:13 | 2020-06-13T00:52:13 | 271,874,806 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 193 | h | Ratha.h | #ifndef RATHA_H
#define RATHA_H
#include "Pieza.h"
//torre
class Ratha: public Pieza{
public:
Ratha(int, int, bool, char);
bool valido(int, int, Tablero*);
protected:
};
#endif
|
4f567cb776f13def968bbe44ad0c867a225d76fa | ceed8ee18ab314b40b3e5b170dceb9adedc39b1e | /android/external/pdfium/xfa/src/fxfa/src/common/xfa_localemgr.h | 8dda6d0dffd316e7a9c72ddc32f97a660b3b895a | [
"BSD-3-Clause"
] | permissive | BPI-SINOVOIP/BPI-H3-New-Android7 | c9906db06010ed6b86df53afb6e25f506ad3917c | 111cb59a0770d080de7b30eb8b6398a545497080 | refs/heads/master | 2023-02-28T20:15:21.191551 | 2018-10-08T06:51:44 | 2018-10-08T06:51:44 | 132,708,249 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,132 | h | xfa_localemgr.h | // Copyright 2014 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
#ifndef _FXFA_LOCALEMGR_H
#define _FXFA_LOCALEMGR_H
class CXFA_Node;
... |
fe4499980e7b9b0eabbbe64ae74f783e63228127 | a4cbda2fc1b5a019562315300347ed4dbcf6ec1b | /Other/merge_sort.cpp | a92ec2dde379267b63e2be25f9291eb02ce79ff4 | [] | no_license | dshamany/Cpp | 0a64026c932a7066ae81c209a29eb98fc0e2fe57 | c1e551e89a5cd63a0a81eeb5b683fcb143f79c0b | refs/heads/main | 2021-06-24T23:38:20.564510 | 2020-12-07T03:09:57 | 2020-12-07T03:09:57 | 159,065,473 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,665 | cpp | merge_sort.cpp | #include <iostream>
#include <algorithm>
#include <iterator>
#include <vector>
using namespace std;
void printVector(std::vector<int> v){
cout << "[ ";
for (auto i : v){
cout << i;
if (i != v[v.size() - 1]){ cout << ", "; }
}
cout << " ]";
}
void mergeSort(std::vector<int>& vec){
if (vec.size() > ... |
ec9b93a3ccc7ca14ade0df9691dbbb1b5280caf5 | ec76c1297252070d72fd194baebca3146bafac59 | /damBreak_turbulence/damBreak/2.8/nut | 4df8f65ab81e10f0795eb921d79e0826f8243073 | [] | no_license | Shivam-IITKGP/CFD_InterFoam_BottleFill | 413cdb5536cf71d95da882821fa36c7bd138e17e | be711e0f19a5331bb1094b8e54982c9ad101da5c | refs/heads/main | 2023-04-13T12:58:09.332312 | 2021-04-15T16:24:42 | 2021-04-15T16:24:42 | 358,315,309 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 113,862 | nut | /*--------------------------------*- C++ -*----------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Version: 8
\\/ M anipulation |
\*-------... | |
a35186c52f24590d088b5afe0fb35961aebc2da5 | d7a0d17211724bead2866fc17e1a02501a6fe79b | /include/FedTree/Tree/hist_tree_builder.h | 843bb87380692d8154a849f74a0709271f3cb140 | [
"Apache-2.0"
] | permissive | tojhe/FedTree | f3cedaa33392703758256c6263a8806ce6555808 | 0544e6ac98c05da7e83d0db957fd93bf3bdf6ebf | refs/heads/main | 2023-07-01T00:18:25.689832 | 2021-06-30T02:07:36 | 2021-06-30T02:07:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,853 | h | hist_tree_builder.h | //
// Created by liqinbin on 11/3/20.
//
#ifndef FEDTREE_HIST_TREE_BUILDER_H
#define FEDTREE_HIST_TREE_BUILDER_H
#include "tree_builder.h"
#include "hist_cut.h"
#include <thrust/copy.h>
#include <thrust/execution_policy.h>
class HistTreeBuilder : public TreeBuilder {
public:
HistCut cut;
void init(DataSet ... |
054cd64a48fccf5edab3e7433a2f115e2bca7187 | 08648c46598cda277e8231950746daf6ef863517 | /TESTS/stress/network-https-range/main.cpp | aa84765ea35b34d546f9a344ee9ae9edee1c84c8 | [] | no_license | ARMmbed/mbed-stress-test | 845fba227aa8ac9f2a174af06a83f79b423c9d12 | 8e8724407cf9a00869be0d317123c3c3c4c9420d | refs/heads/master | 2023-03-16T14:57:07.424981 | 2020-07-28T03:48:10 | 2020-07-28T03:48:10 | 111,034,738 | 2 | 8 | null | 2019-05-07T14:23:53 | 2017-11-16T23:41:51 | C | UTF-8 | C++ | false | false | 4,337 | cpp | main.cpp | /*
* mbed Microcontroller Library
* Copyright (c) 2006-2016 ARM Limited
*
* 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... |
b46012645994c6e655f719c2ce541869120ad2a2 | de8f9ebeb5dfdf9ad9b6e03f9ab726d117642de3 | /mock_libep11/ep11grpc.cc | ba16f472ee4693b17d21d3326eac70f5b9225b70 | [] | no_license | jamesgua/tls_conn_test | 335576168e9774caeea6677b800c15979a032be8 | cdf99fce17b92a598614c5e8d8819ef3d213011a | refs/heads/master | 2021-01-20T02:25:23.109709 | 2019-06-17T22:16:01 | 2019-06-17T22:16:01 | 101,321,238 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,055 | cc | ep11grpc.cc |
#include "ep11grpc.h"
#include <iostream>
using std::cout;
using std::endl;
bool Grep11ManagerClient::loaded_ = false;
bool Grep11ManagerClient::isLoaded(void) {
return loaded_;
}
bool Grep11ManagerClient::Load(const LoadInfo& info, LoadStatus* status) {
if(loaded_) {
return loaded_;
}
cout ... |
3e68fb9fe9f518916657d502723afcb913e315b3 | 4b430686ae824c78604e15818c4b864778468ca1 | /Library/Sources/Stroika/Foundation/Streams/iostream/Utilities.cpp | 7e07a6a887d0a104aae4161752ad9ff02dd8bcdb | [] | no_license | kjax/Stroika | 59d559cbbcfb9fbd619155daaf39f6805fa79e02 | 3994269f67cd9029b9adf62e93ec0a3bfae60b5f | refs/heads/master | 2021-01-17T23:05:33.441132 | 2012-07-22T04:32:58 | 2012-07-22T04:32:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,196 | cpp | Utilities.cpp | /*
* Copyright(c) Sophist Solutions, Inc. 1990-2012. All rights reserved
*/
#include "../../Containers/Common.h"
#include "../../Execution/Exceptions.h"
#include "../../Execution/ErrNoException.h"
#include "../../Memory/SmallStackBuffer.h"
#include "Utilities.h"
using namespace Stroika::Found... |
e1fd40a4a06277ce3ca15c38b7ee601f4c6ac7f0 | 4cc998877a0df5e766554af806f94a79419a0178 | /Longest K unique characters substring.cpp | ea7a3832fdb38882f8553b7a26b157217b99ea99 | [] | no_license | greeshma0601/Arrays | 521ecb189b0c0ce0b4fcb1244d62a02386620c54 | 6b69562519663bc07706410d8e4c4c73cbe606b5 | refs/heads/master | 2020-04-13T20:43:18.904015 | 2019-06-25T05:32:55 | 2019-06-25T05:32:55 | 163,437,158 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,832 | cpp | Longest K unique characters substring.cpp | /*
https://www.geeksforgeeks.org/find-the-longest-substring-with-k-unique-characters-in-a-given-string/
Longest K unique characters substring
Given a string you need to print the size of the longest possible substring that has exactly k unique characters. If there is no possible substring print -1.
Example
For the str... |
56f460a16412c9fb1708d3d346351938fab65bce | 1e987bd8b8be0dc1c139fa6bf92e8229eb51da27 | /maker/arduino/hopper/HttpUtil.h | 8afc7f0f164594be4d0abaf27afa62471be48181 | [] | no_license | tszdanger/phd | c97091b4f1d7712a836f0c8e3c6f819d53bd0dd5 | aab7f16bd1f3546f81e349fc6e2325fb17beb851 | refs/heads/master | 2023-01-01T00:54:20.136122 | 2020-10-21T18:07:42 | 2020-10-21T18:09:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,363 | h | HttpUtil.h | #pragma once
#include <Arduino.h>
namespace http {
// Simple container for HTTP responses. I have to define it in a separate
// header file because Arduino toolchain doesn't let you return custom classes
// from functions, unless they are defined in libraries.
class HttpResponse {
public:
HttpResponse(const Strin... |
ba70399746a07d688e3c69d63d320fd34d8bcec6 | d9f4fe7a677c1d97446d523d4fa22b0fa4696cad | /Source/HalfLifeExperiment/DoorScript.cpp | 94196eaf05e5523bc70612e60d3d364c8388043a | [] | no_license | einsolihin/HalfLifeExperiment | 1b2f9fc98bda2999d23efe3646842e5d555ede41 | ec121dfd5c0761222c1056ac6ca7913526d2ef32 | refs/heads/main | 2023-06-04T19:34:06.925377 | 2021-06-27T03:38:18 | 2021-06-27T03:38:18 | 380,627,716 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,362 | cpp | DoorScript.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "DoorScript.h"
#include "Components/StaticMeshComponent.h"
#include "Components/SceneComponent.h"
#include "HalfLifeExperimentCharacter.h"
#include "Components/InstancedStaticMeshComponent.h"
#include "Components/TimelineComponent... |
2a2f5f195c7184a50c0bbadf590b952185db7f63 | a1b5d12d91c8f1b2875841ef0e1779d6ed8721a3 | /src/sortingAlgo/mergeSort.cpp | 94f9ad6898776b4647a67ae17564a7acc9470168 | [] | no_license | DishenMakwana/DataStructures-And-Algorithms | 8d1504f5d4cae29a0409e40882823ff21cb7452f | 66cddc702667e85bf9b429b3888dc4e458e80777 | refs/heads/master | 2023-04-28T01:48:41.440434 | 2021-05-19T14:26:49 | 2021-05-19T14:26:49 | 300,151,840 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,202 | cpp | mergeSort.cpp | #include<bits/stdc++.h>
#include<iostream>
#include<array>
using namespace std;
void merge(int *a,int *l,int L,int *r,int R)
{
int i=0,j=0,k=0;
while(i<L && j<R)
{
if(l[i]<r[j])
{
a[k++]=l[i++];
}
else
{
a[k++]=r[j++];
... |
37bfc08300b9a825f11d2aa869e1f314332b61e3 | 612252bef1d47b5d5bfe2d94e8de0a318db4fc8e | /3.6/MazeJump/Classes/PopUp/GroundGiveUpPopUpUI.cpp | c3f5eff2d3783d84a7b483269524710dce442568 | [] | no_license | dingjunyong/MyCocos2dxGame | 78cf0727b85f8d57c7c575e05766c84b9fa726c1 | c8ca9a65cd6f54857fc8f6c445bd6226f2f5409d | refs/heads/master | 2020-06-05T08:32:45.776325 | 2016-10-08T16:09:38 | 2016-10-08T16:09:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,646 | cpp | GroundGiveUpPopUpUI.cpp | //
// GroundGiveUpPopUpUI.cpp
//
//
//
//
#include "GroundGiveUpPopUpUI.h"
#include "UtilityHelper.h"
#include "GameConst.h"
#include "UIManager.h"
#include "MainScene.h"
#include "ShopPopUpUI.h"
#include "GameController.h"
#include "SdkBoxManager.h"
#include "NativeBridge.h"
#include "storage/local-storage/LocalStor... |
8b2186d6b66d531b37d590ff0913dd8bb3b3cbb4 | 5999d1dddd8b7ede44388d91b00b1d8713f3fc3e | /OBJObject.cpp | 89cd28af11a412ccf2115c517513a38752c9ea43 | [] | no_license | khalidsalata/167Final | 5c8868a622eeafbb7c8b919c5de9af5a9b6060e8 | 26e7ac7b13c296d3fa024d8f23d93d4571070ac8 | refs/heads/master | 2021-01-17T20:36:20.324373 | 2016-06-07T21:26:14 | 2016-06-07T21:26:14 | 59,914,599 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 16,097 | cpp | OBJObject.cpp | #include "OBJObject.h"
#include "Window.h"
#include "Cube.h"
#include <fstream>
#include <string>
#include <sstream>
#include <errno.h>
#include <iostream>
using namespace std;
std::map<const char*, std::vector< std::vector<glm::vec3> > > OBJObject::perstV = std::map<const char*, std::vector< std::vector<glm::vec3> > ... |
3a4b76508288904c748e23a31cf8c2985a0b65e3 | e46e6784b70b46c177267b18f7822bdd0b3e85ea | /Exercicios/Exercicios_extras/Rserie/main.cpp | 13b1e03903bc2c20e726c91b5becc7edc35ced9a | [] | no_license | Frannb/C-Plus-Plus | 56b2518fa87a7f58a4f9399d26f1d04c6c372994 | a793e28d0e150abca15404a8f7be69d439ef15e4 | refs/heads/main | 2023-08-15T12:26:40.178502 | 2021-10-07T19:35:15 | 2021-10-07T19:35:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 215 | cpp | main.cpp | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char * argv[]) {
int n;
cout << "Quantos resistores serão calculados?";
cin >> n;
for (n = 0, n < )
return 0;
} |
9cd39727a5bc96981000b9efd24dd9910794cc76 | 97e24508d15913f8f4b9fee9bfb2297bf92f58f6 | /101-200/142 Linked List Cycle II.cpp | 5cf9ed70c521561897bb9ef6ce7cc187c6bf808a | [] | no_license | patrickwang96/lc-lib | 9936b2015fe5ca1bf35a682817ee497d195c5609 | 278e85b88a11ab4cacc20c1db09f0b67cf74dc32 | refs/heads/master | 2023-01-29T00:03:02.392876 | 2020-12-14T15:09:15 | 2020-12-14T15:09:15 | 242,113,334 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,442 | cpp | 142 Linked List Cycle II.cpp | #include "header.h"
// https://leetcode.com/problems/linked-list-cycle-ii/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* stepForward(int step, ListNode* mover) {
... |
8b7351915569b776bdb7f74936340a6ac2608574 | 602fa7d7aaaa1486a6f3129d538ec2d8c0afa5e9 | /Olimpíadas.cpp | 2c92b9456248e19fb0d3f1dc1aa1e5cab55cacf6 | [] | no_license | MrCubble/Programas | 94afc2950f366b2ba5c7ea0aac4129ac36854aff | be3b3d2fc52178857cbc54ac48bf25ac5b501d72 | refs/heads/master | 2020-03-22T18:22:46.971432 | 2018-07-10T15:38:02 | 2018-07-10T15:38:02 | 140,456,289 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 932 | cpp | Olimpíadas.cpp | #include <iostream>
#include <algorithm>
using namespace std;
struct Medalhas
{
int pais;
int o;
int p;
int b;
};
bool comparaMedalhas(Medalhas a, Medalhas b){
if(a.o == b.o && a.p == b.p && a.b == b.b)
return a.pais < b.pais;
if(a.o == b.o && a.p == b.p)
return a.b > b.b;
... |
bd4eb72d2026ab5fb36bce567493d696ddbf0960 | 86c11a70213da6fbac05cc09bfcd032c488d4584 | /mausa18D.cpp | 2130b20bc60a08ca06f44cf0dd05dd4ab2dd4287 | [] | no_license | R-penguins/Kattis-Solutions | 3803449c665ca89585c8827e8564b0f4ab7d00ea | ca16ac19d3f0f4d8706b4c90268d6340fdeb7dd7 | refs/heads/master | 2023-04-10T09:56:49.273281 | 2021-04-22T13:45:50 | 2021-04-22T13:45:50 | 336,283,787 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,567 | cpp | mausa18D.cpp | #include <bits/stdc++.h>
using namespace std;
using Pt = pair<int, int>;
map<Pt, int> toID;
vector<vector<int>> adjs;
int id(const Pt &pt)
{
if (toID.count(pt))
return toID[pt];
adjs.push_back(vector<int>());
return toID[pt] = toID.size();
}
int main()
{
regex r("\\s*\\(\\s*(\\d*)\\s*,\\s*(\\d*)... |
155dd9f47cb67be0639486022bba46d4c33bbc80 | 04ba30f9a64c4d884a873d567dfa04be6bb5bfb2 | /src/hawkeye/CoverageRectCanvasItem.hh | a74adccdfa2cc12f6fac81a72ce83269c85112ee | [
"Artistic-1.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | sagrudd/amos | c87e369cd0f65aa6290ae26d873c6e7ab52f8cb1 | 47643a1d238bff83421892cb74daaf6fff8d9548 | refs/heads/master | 2021-03-29T05:04:20.824500 | 2020-06-18T09:40:06 | 2020-06-18T09:40:06 | 247,921,470 | 0 | 0 | NOASSERTION | 2020-03-17T08:52:26 | 2020-03-17T08:52:25 | null | UTF-8 | C++ | false | false | 949 | hh | CoverageRectCanvasItem.hh | #ifndef COVERAGE_RECT_CANVAS_ITEM_HH_
#define COVERAGE_RECT_CANVAS_ITEM_HH_ 1
#include <q3canvas.h>
//Added by qt3to4:
#include <Q3PointArray>
#include <vector>
class CoverageRectCanvasItem : public Q3CanvasRectangle
{
public:
CoverageRectCanvasItem(int x, int y,
int width, int height,
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.