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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4985409388a19c19a5b305455c4721e422144505 | fa1b082268e8f6d7db795d856f5bd852329069b9 | /src/zstd.cc | b8a0c4a1c45e214be06f4c743835a4285d905f32 | [] | no_license | tkuminecz/node-zstandard | 77b817bca3808d94cd39cb97e7db2d27ca087cdd | 69dbaec2c4a7a9a41883ecaa4e795d7ea313b4a8 | refs/heads/master | 2020-09-18T21:18:30.741309 | 2016-09-02T17:29:34 | 2016-09-02T17:29:34 | 67,178,637 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,524 | cc | zstd.cc | #include <cstdlib>
#include <node.h>
#include <node_buffer.h>
extern "C" {
#include "zstd.h"
}
#define ZSTDJS_BLOCK_SIZE 128 * (1U<<10) //128 KB
#define throwError(i,type,msg) (i->ThrowException(type( String::NewFromUtf8(i, msg) )))
const int compLevel = 3;
namespace zstandard {
using v8::Exception;
using v8:... |
82d9d0ae123432d0959c412659c6363c0553c6d8 | a6a395070e8f5b415ff76267b5a2e8057b6cb4d8 | /inc/Engine.h | 809ec37306bfe5abb2e4f23cbda3f3d037590252 | [] | no_license | manjot-b/cpsc587-asgn4 | 463f029987f2a4ac9da7a14c91a11965f579f1f4 | 5a831a08a8e2e4b3803d91aece911677efa8f7e4 | refs/heads/master | 2020-03-08T12:46:31.138534 | 2018-04-08T05:07:08 | 2018-04-08T05:07:08 | 128,136,460 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,860 | h | Engine.h | #pragma once
#define GLFW_INCLUDE_NONE
#include <GLFW/glfw3.h>
#include <glm/glm.hpp>
#include <memory>
#include <vector>
#include "Spring.h"
#include "Shader.h"
#include "VertexArray.h"
#include "Camera.h"
#include "TriangleMesh.h"
#include "Boid.h"
struct Cage
{
glm::vec3 origin = glm::vec3(-0.2f, -0.1f, 0.1f... |
e7599c3a8c692deb3fff35aaa4e909d50fe958ef | 16e9d2211de25e5aafc8f90280758df4368c0376 | /REVISED Card.cpp | e4b291eead7adf94e35c0ad315fed39278fc4fc3 | [] | no_license | scienceiscool/PlayingCards | 87250f86016231ff8fcd55c344c4ab24b6f48a7f | 7525b03fae03170a12b57ba31cc15ca66be422cb | refs/heads/master | 2021-01-02T22:38:18.128026 | 2015-03-23T20:01:36 | 2015-03-23T20:01:36 | 18,344,328 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,998 | cpp | REVISED Card.cpp | //Kathy Saad
//CPSC 131 - Section 01
//Assignment 02 - Playing Card
//March 5, 2013
//REVISED
#include "REVISED Card.h"
int Card::getRank (int Rank)
{
rank = Rank;
return Rank;
}
Card::Card(void)
{
rank = 1;
suit = CLUB;
}
Card::Card(int initRank, Suits initSuit)
{
rank = initRank;
suit... |
217e291fe89e3d07a715b07bf9fa6bb90b9ce8e1 | 464d6cb42fb8981595cbf7260069cd1e6a67fe2f | /Binary Search/Tricky and Important Binary Search/Search in a Sorted Array of Unknown Size.cpp | feab04980faa21090d2bebc37113147f7220ef45 | [] | no_license | rahul799/leetcode_problems | fd42276f85dc881b869072b74654f5811c6618ea | cc7f086eb9ac9bbd20ea004c46d89aa84df10d36 | refs/heads/main | 2023-04-14T05:09:31.016878 | 2021-04-20T19:46:52 | 2021-04-20T19:46:52 | 359,933,382 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,592 | cpp | Search in a Sorted Array of Unknown Size.cpp |
702. Search in a Sorted Array of Unknown Size
Medium
Given an integer array sorted in ascending order, write a function to search target in nums. If target exists, then return its index, otherwise return -1. However, the array size is unknown to you. You may only access the array using an ArrayReader interface,... |
d34ef69eef942b7a075dfb119e558eb71b177d88 | 51003f6af36ce7adaa753eb910d1bc33354be26a | /picture.cpp | bda2917cc82f66f70bbc03b90d69bba32ae2ee9f | [] | no_license | bluegr/scummvm-picture | c58d45273180b593980fbcd04d6856e5f105e3ce | 3b73be498868b2983a7387c04a51a9b2c4feda2b | refs/heads/master | 2020-05-17T17:14:31.683213 | 2011-11-03T21:30:54 | 2011-11-03T21:30:54 | 2,769,341 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,773 | cpp | picture.cpp | /* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of ... |
614e745e04b61a4855a644f5b89d3877a200c593 | fa82f81ee373fe417af217bc24e27333bfd34484 | /src/image_subscriber.cpp | 23478b47222758ae2c36440b0a8f3ceb9ac06565 | [] | no_license | QianYC/calculation_node | ada201e8415b1ef97516b9f6d4416a24142fbdc5 | ecbbd60b0ef7057116176f4efac1905e76e42f28 | refs/heads/master | 2021-01-25T22:28:47.725608 | 2020-05-31T09:12:38 | 2020-05-31T09:12:38 | 243,206,949 | 0 | 0 | null | 2020-06-06T09:38:18 | 2020-02-26T08:17:03 | C++ | UTF-8 | C++ | false | false | 6,048 | cpp | image_subscriber.cpp | //
// Created by yc_qian on 20-2-6.
//
#include "photoComposer.hpp"
ThreadPool pool(1);
STATE state = STATIC, last_state;
MOTION motion = STOP;
bool change_state = false;
cv::Mat image;
vector<FaceInfo> faces;
DETECT_RESULT detect_result = NO_FACE;
COMPOSE_RESULT compose_result, dynamic_compose_result;
CHECK_ERROR_RES... |
c56f73f9628fc1d99e2291affc1dc2455c7e45d0 | 5438f43d20f7ddb471068b81c70b75ba70ae27e1 | /getchar_unlocked/main.cpp | da83029ab2b709bac01597d6169bf3f474a307b2 | [] | no_license | dheerajkhatri/usinggit | 5ff287ad9f7f827217747a6c2ea3c3be67c2cb72 | 57f28765f7850da6baf8b6f1897e02447cff5322 | refs/heads/master | 2021-01-01T17:01:05.902492 | 2020-01-15T07:56:57 | 2020-01-15T07:56:57 | 20,534,077 | 2 | 0 | null | 2017-02-17T07:28:02 | 2014-06-05T17:15:38 | C++ | UTF-8 | C++ | false | false | 342 | cpp | main.cpp | #include <iostream>
#include <cstdio>
#define gc getchar_unlocked
using namespace std;
inline int scan( ) {
int n=0;
int ch=getchar_unlocked();
while( ch <48 )ch=getchar_unlocked();
while( ch >47 )
n = (n<<3)+(n<<1) + ch-'0', ch=getchar_unlocked();
return n;
}
int main()
{
int n;
n=scan();
cout<<n<... |
1c73ea9cdc86014b54c5be939aba51f68478271f | 90539b70388259470debec076acc5a1e3c327ec7 | /cast/dynamic.cpp | c72b1c09849d11ada29ed81a2629afa7dfd812bc | [] | no_license | shresthalucky/Cpping | 2347720ec01a57baccc55e129e36db8954055d72 | a3cd4fc6c0c20e71bd7bb945278fea1e20d69226 | refs/heads/master | 2021-06-27T22:49:44.168717 | 2020-09-07T17:29:30 | 2020-09-07T17:29:30 | 131,850,251 | 0 | 0 | null | 2018-05-02T12:53:46 | 2018-05-02T12:53:45 | null | UTF-8 | C++ | false | false | 292 | cpp | dynamic.cpp | #include <iostream>
#include <typeinfo>
using namespace std;
class A{
public:
virtual void f(){}
};
class B: public A{
};
int main(){
A* a;
B b1, *b2;
a = &b1;
if(typeid(dynamic_cast<B*>(a)) == typeid(b2)){
cout << "true" << endl;
}
return 0;
} |
2e150443ac8bbb28cda0c4ed68b786e087ec805d | bae3cce507524b9d5b1f5fc5d3a3bb489f95b8df | /Upsolves/Codeforces/1438D.cpp | 7bce544520152a3cb40d200d91bcafc62c778454 | [] | no_license | tauhrick/Competitive-Programming | 487e0221e29e8f28f1d5b65db06271f585541df8 | abcdb18c3e0c48ea576c8b37f7db80c7807cd04c | refs/heads/master | 2023-07-11T05:37:28.700431 | 2021-08-30T15:40:12 | 2021-08-30T15:40:12 | 193,487,394 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,395 | cpp | 1438D.cpp | #ifndef LOCAL
#include <bits/stdc++.h>
using namespace std;
#define debug(...) 42
#else
#include "Debug.hpp"
#endif
class Task {
public:
void Perform() {
Read();
Solve();
}
private:
int n;
vector<int> a;
vector<array<int, 3>> moves;
void Read() {
cin >> n;
a.resize(n);
for (auto ... |
a577b1e3ab171496c9ae944fb33d37c0b1a1f940 | beb77aece047a98449c16bb8152c9d5d5f073dab | /test cpp/main.cpp | 60a5615b3976bf5a10b3388cfed8d5b6d1817be5 | [] | no_license | dev-jb-007/Data-Structure | 65effa497facd2682bb8e66eb7cd82c95d562ec4 | d439a09c53430f6f96ef9c34fa2bf83457ed93ba | refs/heads/main | 2023-07-09T08:03:18.532213 | 2021-08-12T11:11:22 | 2021-08-12T11:11:22 | 395,220,207 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 169 | cpp | main.cpp | #include<iostream>
using namespace std;
#include "Header.h"
int main(){
Queue<int> q;
q.push(1);
q.push(2);
q.pop();
q.pop();
cout<<q.empty();
}
|
c1f405c53a9602f7d2ea9fb9c02378a2b426ca35 | c18e3cba4f445613b2ed7503061cdfe088d46da5 | /docs/atl/codesnippet/CPP/csimplearray-class_3.cpp | deb53230bfbfcc10fb859fa86383e96baa039eb2 | [
"CC-BY-4.0",
"MIT"
] | permissive | MicrosoftDocs/cpp-docs | dad03e548e13ca6a6e978df3ba84c4858c77d4bd | 87bacc85d5a1e9118a69122d84c43d70f6893f72 | refs/heads/main | 2023-09-01T00:19:22.423787 | 2023-08-28T17:27:40 | 2023-08-28T17:27:40 | 73,740,405 | 1,354 | 1,213 | CC-BY-4.0 | 2023-09-08T21:27:46 | 2016-11-14T19:38:32 | PowerShell | UTF-8 | C++ | false | false | 342 | cpp | csimplearray-class_3.cpp | // Create an array of floats and search for a particular element
CSimpleArray<float> fMyArray;
for (int i = 0; i < 10; i++)
fMyArray.Add((float)i * 100);
int e = fMyArray.Find(200);
if (e == -1)
_tprintf_s(_T("Could not find element\n"));
else
_tprintf_s(_T("Found the element at l... |
462bb8bdfa392a20f888a06308e7486818da7811 | ef1c9f3ff8e03dbc9d01d7292746068af8fa6214 | /MFC_Lab6/MFC_Lab6/MFC_Lab6Dlg.cpp | dd494b61dd6be83acd5248ff4fb18cd6d19963b4 | [] | no_license | BloodyRainRage/spb.stu_oop_mfc | 4dd05860d20b50ccca676a4431c9114730a76611 | cafb904362cea9bd9aa9915bc26183126d938892 | refs/heads/master | 2021-02-26T18:44:51.207388 | 2020-05-02T20:06:43 | 2020-05-02T20:06:43 | 245,546,575 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,239 | cpp | MFC_Lab6Dlg.cpp |
// MFC_Lab6Dlg.cpp: файл реализации
//
#include "pch.h"
#include "framework.h"
#include "MFC_Lab6.h"
#include "MFC_Lab6Dlg.h"
#include "afxdialogex.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// Диалоговое окно CAboutDlg используется для описания сведений о приложении
class CAboutDlg : public CDialogEx
{
publi... |
8c2648a20d562f89f76d67a1113456ab690e0434 | 5fec989297cce17539214eb0839f069dd8f07b08 | /hospital/main.cpp | 2bad8d88f3d4b1f40821bad3c68aa7dd9ae8128a | [] | no_license | Xesian/QtHospital | 40cffa63ac9c5b44b17c44f18cef1e2d73ca0a97 | b33e115552b25db8042342742e76ad3576aea7f4 | refs/heads/master | 2021-01-19T06:36:27.580804 | 2015-07-31T02:35:48 | 2015-07-31T02:35:48 | 39,982,557 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 548 | cpp | main.cpp | #include "hos_main.h"
#include <QApplication>
#include<QtSql/QSqlDatabase>
#include"login.h"
QSqlDatabase db=QSqlDatabase::addDatabase("QMYSQL");
int main(int argc, char *argv[])
{
db.setHostName("localhost");//设置数据库主机名
db.setDatabaseName("hos");//设置数据库名
db.setUserName("root");//设置账号
db.setPassword("240... |
f2eebec813add69b05169c3d03248dbb5ec9fbf7 | d9472d42295f8096dbf40d26868dfce7ae4fae05 | /src/FPChasingBall.cpp | a69700e7757e0186e2a933517566203e0a0d19bb | [] | no_license | chouqiu/FootballAI | 75782bf73f4867d78b2ab73a5af1a0d531800743 | a5ce1d87632ef29ebd9a2f3ef0137827e7e7d59a | refs/heads/master | 2020-06-25T08:30:18.811982 | 2013-05-05T12:40:34 | 2013-05-05T12:40:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 892 | cpp | FPChasingBall.cpp | #include "FieldPlayerState.h"
#include "Ball.h"
#include "Team.h"
// ChasingBall
ChasingBall* ChasingBall::get()
{
static ChasingBall instance;
return &instance;
}
void ChasingBall::enter(FieldPlayer* player)
{
player->getSteering()->setSeekOn();
}
void ChasingBall::execute(FieldPlayer* player)
{
//player->getSt... |
8cbcfd22b03bd0b8ac5ee12efb6ba10596a8191b | 9ada6ca9bd5e669eb3e903f900bae306bf7fd75e | /case3/ddtFoam_Tutorial/0.004300000/fH | 435123da6234838202529fe1b250e9f3f1af9397 | [] | no_license | ptroyen/DDT | a6c8747f3a924a7039b71c96ee7d4a1618ad4197 | 6e6ddc7937324b04b22fbfcf974f9c9ea24e48bf | refs/heads/master | 2020-05-24T15:04:39.786689 | 2018-01-28T21:36:40 | 2018-01-28T21:36:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 123,602 | fH | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.1.1 |
... | |
5c52abba203ecf1d7bad2eb7579fc950709b61ff | ba80a4bdda1d58df8c0e34cdeea14eebeadffdbe | /src/image_object_renderer.cpp | eacff4b614bb96ed8e85bd98db1aaba8beddea3c | [] | no_license | lms-org/image_object_renderer | abe51f637557d0e49fb19bad2bf4f16f6f7bc34b | fa0d47b3b77d7aba3bdf91d7d5a5e28e062cab66 | refs/heads/master | 2021-03-19T08:22:22.692707 | 2017-02-03T19:31:06 | 2017-02-03T19:31:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,377 | cpp | image_object_renderer.cpp | #include "image_object_renderer.h"
#include "street_environment/start_line.h"
#include <math.h>
bool ImageObjectRenderer::initialize() {
int imageWidth = config().get<int>("imageWidth", 512);
int imageHeight = config().get<int>("imageHeight", 512);
image = writeChannel<lms::imaging::Image>("IMAGE");
i... |
f47952fb9ed36373b1b6a987c00bd333b1c02f0d | 4cae422afc5224db8846d9c454a12ef627fd4909 | /MyRenderer/Grid.cpp | e527707fc78e766f5174401a35c9ebbd38d3cd2b | [] | no_license | EternalWind/MyRenderer | 90adcbd79e68634c225532018e6507f756ac22fa | 973e9090470d4992a97ab7c1caf708ec314638fd | refs/heads/master | 2016-09-10T01:03:30.824093 | 2014-06-07T06:06:13 | 2014-06-07T06:06:13 | 20,586,847 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,502 | cpp | Grid.cpp | #include "Grid.h"
Grid::Grid(float resolution_parameter, unsigned max_resolution) :
m_BoundingBox(new AABB()),
m_ResolutionParameter(resolution_parameter),
m_MaxResolution(max_resolution)
{
}
void Grid::Initialize(const List(Object)& objects)
{
unsigned total_triangle_number = 0;
for (auto iter = objects.begin... |
ae0c7968936823bc089d5006b0cf755e45eab5d6 | 71cbc64910807ceab826a6c54e0fea8d96104506 | /Cool3D/RenderMtl/MConstColor.cpp | 9fe09059f8b5c7d9f45deed2bf36e2e0c5aec001 | [] | no_license | adrianolls/ll | 385580143dfc2365428469a51c220da08bfea8ec | 9c7d480036b1e6f1e3bdffe93b44bd5c70bd944a | refs/heads/master | 2022-12-26T07:06:13.260844 | 2020-09-16T04:36:17 | 2020-09-16T04:36:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 751 | cpp | MConstColor.cpp | #include "StdAfx.h"
#include ".\mconstcolor.h"
#include "..\RenderSys\RenderSys.h"
namespace Cool3D
{
IMP_RTTI_DYNC(MConstColor,IRenderMtl);
MConstColor::MConstColor(void)
{
m_color=RenderSys::WhiteRenderColor;
m_bUsingVertColor=false;
}
MConstColor::~MConstColor(void)
{
}
void MConstColor::Serialize(FA... |
f47ac8affd9eb8956367e99fe744e8ad990afb55 | ba7ceccb3a9606dae22000eab8384fd000132977 | /Inheritance/Polymorphism.cpp | 71f70198ee75e7e8ffab51fa183f6e2895732623 | [] | no_license | hitman699/C-Code | 02c44cfc6c1f8d4b6218dae47bccb6bba072a027 | 45d029c6b89230d6ddc86e0bde7811054e6919b3 | refs/heads/master | 2020-09-01T19:19:00.567764 | 2019-12-04T18:30:21 | 2019-12-04T18:30:21 | 219,035,615 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 559 | cpp | Polymorphism.cpp | #include<bits/stdc++.h>
using namespace std;
class Person
{
public:
virtual void intro()
{
cout<<"Called from Person"<<endl;
}
};
class Student : public Person
{
public:
void intro()
{
cout<<"Called from Student"<<endl;
}
};
class Farmer : public Person
{
public:
... |
24b6de89831f8397f1d177c1e218492883126ec0 | 8262a782e189aed545a805ac67809a141f75a669 | /NICEDAY (segment tree).cpp | e2683e419de261e13598f4f5bf1b0cd500c5c3ad | [] | no_license | rjrks/Spoj | 7e245e877a9924a0bb4661be39121832ddda1fc7 | a3236ee6a773d08078f13e46f5eee40b638d461b | refs/heads/master | 2020-04-06T04:55:36.584359 | 2015-07-13T19:23:55 | 2015-07-13T19:24:17 | 35,376,048 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,024 | cpp | NICEDAY (segment tree).cpp | //
// Created by Rohan on 23/12/14.
// Copyright (c) 2014 Rohan. All rights reserved.
//
#include <math.h>
#include <iostream>
#include <vector>
#include <string.h>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <cmath>
#include <list>
#include <stack>
#include <map>
#include <string.h>
#inc... |
c10929d8d9193946147111f0e80af0b24476dc18 | a5b55a2379f0e260330642ffff7ca8ca86e7eb5a | /test/testAccuracy.cpp | 8b4a886a635ad24acd995a62d6e6f0f20c23387e | [] | no_license | Jonaslinderoth/MasterThesis | 0a3d0c4dfeb05029906f87dd2817c804862a810c | 145a0ce42c17761b505f8dc34f1a1e2d23dd82bd | refs/heads/master | 2022-10-08T09:29:12.129778 | 2020-06-11T20:02:55 | 2020-06-11T20:02:55 | 238,170,716 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,931 | cpp | testAccuracy.cpp | #include <gtest/gtest.h>
#include <vector>
#include <math.h>
#include "../src/testingTools/DataGeneratorBuilder.h"
#include "../src/dataReader/Cluster.h"
#include "../src/dataReader/DataReader.h"
#include "../src/testingTools/MetaDataFileReader.h"
#include "../src/testingTools/RandomFunction.h"
#include "../src/DOC_GPU... |
1c87895a6046ca80e2a8457c0146ba59ba838767 | b6f935468dde02c112b1e81bc3bc8219ba95ef86 | /Trie/SPOJ PHONELST.cpp | cab237bdfab9e65ade44b6d1445e53f6de1183ff | [] | no_license | shashank0107/CP-Solutions | fe15bae919529846de78e6218edd14c643d8027d | e9933a8611bdb3581d59d12136c88c319331118b | refs/heads/master | 2020-04-13T01:24:38.998644 | 2019-05-30T17:52:31 | 2019-05-30T17:52:31 | 162,873,528 | 7 | 1 | null | 2019-03-16T13:42:11 | 2018-12-23T08:11:09 | C++ | UTF-8 | C++ | false | false | 2,721 | cpp | SPOJ PHONELST.cpp | #include <bits/stdc++.h>
using namespace std;
/*** Template Begins ***/
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<ll, pair<int, int> > PIII;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define endl '\n'
#define pb ... |
72243e182d7b82471ff741a092c3e68f9f898eb1 | dab0cb3770232ddb0104fc5d00fc8fd7b14e69e5 | /LSTMLayer/LSTMNeuroNetworkError.h | 969d2d2ff8984695a3c82a977be9336de95382e9 | [] | no_license | yfz912/LSTM_Layer | f8adbd65c538535a1cd9e3fe9fda5ec80bc1a578 | 92dba78f88aaae694bb12029f45fb88f5194b052 | refs/heads/master | 2020-04-28T01:46:39.739104 | 2017-04-06T05:59:21 | 2017-04-06T05:59:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 431 | h | LSTMNeuroNetworkError.h | #pragma once
#include "NeuroNetworkError.h"
class LSTMNeuroNetworkError : public NeuroNetworkError
{
public:
MatrixD cError;
LSTMNeuroNetworkError( const MatrixD &inputError ) :NeuroNetworkError( inputError )
{
cError = MatrixD( inputError.Rows() , inputError.Columns(), 0.0 );
}
LSTMNeuroNetworkError( const M... |
85562ef25492b7af20af19b0fef628b627c7663d | 01bcef56ade123623725ca78d233ac8653a91ece | /materialsystem/stdshaders/lightmapped_4wayblend_dx9_helper.cpp | 39e46b2800dbc329e8943ddb5bfe9255ded22dce | [
"LicenseRef-scancode-public-domain",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | SwagSoftware/Kisak-Strike | 1085ba3c6003e622dac5ebc0c9424cb16ef58467 | 4c2fdc31432b4f5b911546c8c0d499a9cff68a85 | refs/heads/master | 2023-09-01T02:06:59.187775 | 2022-09-05T00:51:46 | 2022-09-05T00:51:46 | 266,676,410 | 921 | 123 | null | 2022-10-01T16:26:41 | 2020-05-25T03:41:35 | C++ | UTF-8 | C++ | false | false | 51,046 | cpp | lightmapped_4wayblend_dx9_helper.cpp | //========= Copyright (c) 1996-2014, Valve LLC, All rights reserved. ============
//
// Purpose: Lightmapped_4WayBlend shader
//
// $Header: $
// $NoKeywords: $
//=============================================================================
#include "lightmapped_4wayblend_dx9_helper.h"
#include "BaseVSShader.h"
#inclu... |
313609f69749181e88753d6e1247168dc74ca77c | 51e8ee2b409440bcca1c7c6eefc08dcb2f71c875 | /Dictionary.h | 69523cb85fac8c8d9d0bc0da610be1700983863e | [] | no_license | TheTipTapTyper/Dictionary | 70e22c247c7d600bb20de0f5734a8889e56dc3fb | 4f7b38e57a6be39edd224a67f175ab41aaa9f947 | refs/heads/master | 2020-04-02T20:21:57.937113 | 2018-10-26T03:17:57 | 2018-10-26T03:17:57 | 154,766,565 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 718 | h | Dictionary.h | #ifndef _DICTIONARY_H_
#define _DICTIONARY_H_
#include <string>
#include "WordNode.h"
using namespace std;
class Dictionary{
private:
WordNode * binTree; //binary search tree of words
public:
int isWord(string word_input); //check if word is a word in the english language. return 1 if yes, 0 if no
Diction... |
130565ba97bfefa40e88a3092c4f271b8d6ee145 | 6cf5c6be4bc03f6f8d6e5c162efda887f52d9c61 | /section_12/list_in_STL.cpp | bbd03e5894876933e683bd3d80259777d277c67e | [] | no_license | Rishabhchauhan30/Cpp-Stuff-- | a167b69f437947350e8647305db555ea4bfc2332 | d2acc0bebed2ac8de817c31f054f51be6a3437d1 | refs/heads/master | 2023-01-30T17:46:01.965579 | 2020-12-14T13:52:28 | 2020-12-14T13:52:28 | 298,875,470 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 754 | cpp | list_in_STL.cpp | #include <iostream>
#include <algorithm>
#include <list>
using namespace std;
int main(){
list <int> mylist;
for(int i = 3; i <= 10; ++i){
mylist.push_back(i);
}
cout << mylist.front() << endl; // just to see the front values
cout << mylist.back() << endl; // just to see the back v... |
9e576fa4eb5a5d0d4b8af402072e1b2764113e55 | a79f0d471709c947ad267f803ebbbef8b019feba | /summer/summerdlg.cpp | c1f2b8c66a9c09c4e43f1cbe50c676544019ceb7 | [] | no_license | gazlan/Summer | ac305e791d4aa4f3671372336dbc12daf13ee571 | 70ff3b5207d70e55fdd7bbeb28b1595c618ac0a1 | refs/heads/master | 2021-05-04T15:33:11.304565 | 2018-02-04T23:01:58 | 2018-02-04T23:01:58 | 120,231,082 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,854 | cpp | summerdlg.cpp | #include "stdafx.h"
#include "..\shared\mmf.h"
#include "..\shared\file.h"
#include "Summer.h"
#include "SummerDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
CSummerDlg::CSummerDlg(CWnd* pParent /*=NULL*/)
: CDialog(CSummerDlg::IDD, pParent)
{
//{{AFX_DATA... |
109bd0a1192ab30b52d05645cd6390ced6f67037 | ebb70744ee7a500b6bdace13274eee3954832f7b | /commandLineWeek21/commandLineWeek21.cpp | 2b8c6458aeba4e7cae549a62fe7a1d03b43014f5 | [] | no_license | FruitJuice/commandLineWeek21 | 03bb87fe30c80ce9c12be4105574c5b499275782 | 728cbe404d30d7ed770be755de334d0e14ab4937 | refs/heads/master | 2021-01-17T23:05:13.178886 | 2017-03-07T15:58:53 | 2017-03-07T15:58:53 | 84,212,252 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 771 | cpp | commandLineWeek21.cpp | #include "stdafx.h"
#include <stdio.h>
#include <stdarg.h>
#include <cstdlib>
struct patient
{
int patientID;
double temperature;
int pulseRate;
int respRate;
int bldSystolic;
int bldDiastolic;
};
void main(int argc,char *argv[])
{
FILE *ptr;
ptr = fopen("log.txt", "a");
struct patient patients;
patients.... |
d84264579500ed36e429f290ae5cfd64ec5eb44a | 76f9883f6447abff33798572dc254c02af8451d1 | /mz1.cpp | a8139b48c072cd5451e999b25078deede1a5619b | [] | no_license | jammer312/cpp_random_code_without_context | 23728972312af85cfad1ad6411493870bc145500 | c9eeefa4c4e3ccdc0eaca8fbbc3480f3546e2d0d | refs/heads/master | 2022-12-21T08:01:30.741559 | 2020-10-05T12:09:02 | 2020-10-05T12:09:02 | 301,395,666 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 659 | cpp | mz1.cpp | #include <iterator>
constexpr int second_addendum_rindex = 2;
constexpr int third_addendum_rindex = 4;
template<typename T>
auto process(const T &container)
{
typename T::value_type ret{};
auto size = container.size();
if (size == 0) {
return ret;
}
auto rev_it = container.rbegin();
... |
525c143d30bd232b00b8e808efafc820450716ae | d41983a1f22fdb13497068c000cd77bc04953753 | /Projetos/Gerenciador de Tarefas/gerenciador.cpp | e2473bef5da610623def2aa11ef896634a0e687c | [] | no_license | Cleiton366/ED-2020.1 | 3d53ce4ab8013b33cbc9b5075b8ba492e86ea3f8 | 5f5199b09374f91b566dbba83d2a13aa978d10f1 | refs/heads/main | 2023-01-06T19:09:56.953830 | 2020-11-07T22:58:17 | 2020-11-07T22:58:17 | 310,944,282 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,309 | cpp | gerenciador.cpp | #include "gerenciador.hpp"
#include <string>
#include <iostream>
#include <time.h>
using namespace std;
//construtores
gerenciador::gerenciador(int tamanho){
this->vetor = new tarefa[tamanho];
this->tamanho = tamanho;
qtd = 0;
filtro = 1;
}
gerenciador::tarefa::tarefa(){}
gerenciador:... |
aee9cf76bd825adedec32a8859d9ad9144bbf37e | 318b737f3fe69171f706d2d990c818090ee6afce | /src/nameserver/cluster_info.h | 31cd0b038152bf8fa21385276b8eb18740bbedc6 | [
"Apache-2.0"
] | permissive | 4paradigm/OpenMLDB | e884c33f62177a70749749bd3b67e401c135f645 | a013ba33e4ce131353edc71e27053b1801ffb8f7 | refs/heads/main | 2023-09-01T02:15:28.821235 | 2023-08-31T11:42:02 | 2023-08-31T11:42:02 | 346,976,717 | 3,323 | 699 | Apache-2.0 | 2023-09-14T09:55:44 | 2021-03-12T07:18:31 | C++ | UTF-8 | C++ | false | false | 2,618 | h | cluster_info.h | /*
* Copyright 2021 4Paradigm
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in w... |
4bc4a42041f9fba6ebea1a79e6b2aa0a6db343b0 | fc9e04fc6d9dae294c909124f294ce2b16d0cc0f | /FrameTL/biharmonic_equation.cpp | b001ab1a1c809dcb3691aba336db4601bdea4529 | [
"MIT"
] | permissive | vogeldor/Marburg_Software_Library | 07c5546b5f6222f4ad3855c0667a185a7b710d34 | fe53c3ae9db23fc3cb260a735b13a1c6d2329c17 | refs/heads/master | 2022-11-15T13:14:37.053345 | 2020-07-16T11:23:47 | 2020-07-16T11:23:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,270 | cpp | biharmonic_equation.cpp | // implementation for biharmonic_equation.h
#include <list>
#include <numerics/gauss_data.h>
#include <numerics/eigenvalues.h>
#include <algebra/sparse_matrix.h>
#include <frame_index.h>
#include <frame_support.h>
//#include <cuba.h>
//#include <cube/cube_support.h>
using WaveletTL::CubeBasis;
namespace FrameTL
{
... |
4a6155f833ebbc90302940bfc69c438f7f6b75bc | 9a3dc95619df0487be6228ba628ba4ce97a139de | /SEUYac/LR1.h | e1792aa686f8336d61cab3d30a2b96ae48457d71 | [] | no_license | five-20/SEUYacc-1 | bcdd923417ea9ef509f0437f05c469c63d75720a | d35562fefdb2fe7319024d2cf2d317c33dfa627a | refs/heads/master | 2023-03-22T23:52:06.356313 | 2017-05-25T13:00:06 | 2017-05-25T13:00:06 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 3,498 | h | LR1.h | #pragma once
#ifndef LR1_H
#define LR1_H
#include<vector>
#include<map>
#include<set>
using namespace std;
struct producer {//解析后的产生式
string left;
vector<string> right;
};
struct LrItem
{
string left;
vector<string> right;
int dotpos;
vector<string>predict;
bool &operator<=(const LrItem &item) {/*和==差不多，但没有要求... |
e5b74c4fcd5b84539fb6d7b46be8b6ba24da63fb | bb6e8fdef91c4616848527bed7735cc9c7023451 | /bee/nonstd/dynarray.h | 8eff0b32f625182b32a86934194d34eeac5c6586 | [
"MIT"
] | permissive | Xiaobin0860/bee.lua | 655db594bddd5f60c1d103f771565a619c8526ad | 2b2e3ac9b5cbb66dbf71bd33a1609f4b289fc6a5 | refs/heads/master | 2020-09-14T01:42:13.149141 | 2019-11-25T06:47:39 | 2019-11-25T06:47:39 | 222,972,203 | 2 | 0 | MIT | 2019-11-20T15:46:07 | 2019-11-20T15:46:06 | null | UTF-8 | C++ | false | false | 4,091 | h | dynarray.h | #pragma once
#include <bee/nonstd/span.h>
namespace std {
template <class T>
class dynarray : public nonstd::span<T> {
public:
typedef nonstd::span<T> mybase;
typedef T value_type;
typedef T& ... |
082a5c52eba69dec474ba9c694783a1a22b7648f | 795000f575aebcc0f1993194ce4e54c9d0096248 | /1-D Array/problem3.cpp | cc834d39bed6e77a9fc3263d28fb1358073088d1 | [] | no_license | nayalchitra/P3_Program | fb94329bf658cecda487249dc8cb96a1bd1b80af | 06f3436f863e87a7b77f3bf74ca556bc1afac7a1 | refs/heads/master | 2023-03-09T09:24:45.189517 | 2023-02-21T16:45:45 | 2023-02-21T16:45:45 | 191,009,535 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 246 | cpp | problem3.cpp | #include<iostream>
using namespace std;
int main()
{
int n,i,c=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
int sum=0;
for(i=0;i<n;i++)
sum+=a[i];
sum=sum/n;
for(i=0;i<n;i++)
if(a[i]>sum)
c++;
cout<<c;
}
|
6a8d486af59ff9c1c2e66fae9cf1f24d4c8fb6a1 | 309d1a5116bbc43133b95591b476b507a0d5f400 | /src/trash/try_catch.cpp | 1d71a140ecff80fc425d2c69ce80acc63bac71bb | [] | no_license | supercaracal/study-of-cpp | ff65863f72ac4f5559f4ab22a7436b74cb4b62e9 | 6e81543457f12da8c546a10775b5c2a1466743d6 | refs/heads/master | 2021-05-14T06:54:39.877667 | 2018-02-14T14:12:27 | 2018-02-14T14:12:27 | 116,251,503 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 413 | cpp | try_catch.cpp | #include <iostream>
#include <string>
class Exception {
public:
explicit Exception(std::string str) : m_str(str) { }
~Exception() { delete m_str.c_str(); }
std::string message() const { return m_str; }
private:
std::string m_str;
};
int main(int argc, char *argv[]) {
try {
throw new Exception("Oops!")... |
5fef3b084c29acc08103b62220d81069e261d8d3 | 2aad21460b2aa836721bc211ef9b1e7727dcf824 | /IE_Command/ImgSelectRelease/ImgSelectRelease.cpp | 7fc503377cfd03d68b5a864f30d6d85a9cce6394 | [
"BSD-3-Clause"
] | permissive | chazix/frayer | 4b38c9d378ce8b3b50d66d1e90426792b2196e5b | ec0a671bc6df3c5f0fe3a94d07b6748a14a8ba91 | refs/heads/master | 2020-03-16T20:28:34.440698 | 2018-01-09T15:13:03 | 2018-01-09T15:13:03 | null | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 2,050 | cpp | ImgSelectRelease.cpp | // ImgSelectRelease.cpp : DLL アプリケーションのエントリ ポイントを定義します。
//
#include "stdafx.h"
#include "ImgSelectRelease.h"
#ifdef _MANAGED
#pragma managed(push, off)
#endif
BOOL APIENTRY DllMain( HMODULE hModule,
DWORD ul_reason_for_call,
LPVOID lpReserved
)
{
return TRUE;
... |
5a5db6fa53e649bf7b600e8170544bdcce365092 | 3501288a559c3996eedda7d91609d2afc74af351 | /uri/strings/1287.cpp | 1356bf8ad5f766d89216c2d348bf3ecf713f1271 | [] | no_license | josecleiton/contest | 9b76035025943067bf7b1eedc40e9aa03b209d12 | 6e35bbda0f739782536fb6837194a86e7f52e89f | refs/heads/master | 2023-06-22T20:10:06.980694 | 2023-06-18T13:50:07 | 2023-06-18T13:50:07 | 137,649,792 | 23 | 9 | null | null | null | null | UTF-8 | C++ | false | false | 2,499 | cpp | 1287.cpp | //TEMPLATE COM MACROS PARA OS CONTESTS
//compile usando: g++ -std=c++11 -lm -O3 arquivo.cpp
#include <bits/stdc++.h>
#define FOR(x) for(int i=0;i<x;i++)
#define ROF(x) for(int i=x-1;i>=0;i--)
#define ROFJ(x) for(int j=x-1;j>=0;j--)
#define FORJ(x) for(int j=0;j<x;j++)
#define FORQ(Q) for(int i=0;Q;i++)
#define FORM(x,y... |
1dea0b734c8706c9c9c3ac20211a72d41293715c | cf576ef1dff2d24defde1bc5e66c32b1c4adeb9e | /FroggerSource/Frogger/Phases/LineNoPhase.h | c67fec0659726c327c1027615fe0f8dc40f24164 | [] | no_license | higgsch/Frogger | 4395b5aafdd367c0c5e2cb934d27bf4f3262bce5 | 40b00316560c6a8a98bea3d9e4d3063b11cb872b | refs/heads/master | 2020-12-25T18:43:03.578398 | 2017-08-04T14:08:56 | 2017-08-04T14:08:56 | 93,980,664 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,420 | h | LineNoPhase.h | // -----------------------------------------------------------------
// This is the header for the LineNoPhase class.
// -----------------------------------------------------------------
#pragma once
#include "phase.h"
#include "..\DataStructures\Nodes\nodes.h"
using namespace std;
// --------------------------------... |
96e9cc10dd5c48e6610855edf62765539d01574a | fbead5635dee647e6fd57fa1b307c3639b4d895c | /Week5/Word_Break_II/solution.cpp | 4b1879cd56d99dedcc64139431f4e94129b23f77 | [
"MIT"
] | permissive | AkashRajpurohit/leetcode-july-2020-challenge | c26300036a62f8fd7e928ee2c07fec2207067b0e | 27665ef0776b028fba588a6899a4abafa5e4afff | refs/heads/master | 2023-01-04T00:10:49.057931 | 2020-11-01T05:56:46 | 2020-11-01T05:56:46 | 276,367,685 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,181 | cpp | solution.cpp | class Solution {
private:
vector<string> wordBreakHelper(string s, unordered_set<string>& wordSet, unordered_map<string,vector<string>>& map) {
if(map.find(s) != map.end()) return map[s];
vector<string> result;
if(s.empty()) {
result.push_back("");
... |
08198cbb61bba9c0c2dd44f1c68fde2356b90da8 | 5d253c51099f386dd5d25a3752fec65f9511d265 | /T - Binary Treee/NJNUxzl.cpp | 6f82b14fb06b2746da34036a5de8332adb4ee956 | [] | no_license | NJUwuxiaotong/NJNU-CS-20 | 6f43db90cbf3ce895bd8bbeb41ed883634ae5b05 | 2cc14afc3d7ae3e055efe9d370afa0e86fffed79 | refs/heads/main | 2023-03-21T04:57:16.600970 | 2021-03-19T06:22:35 | 2021-03-19T06:22:35 | 319,336,533 | 1 | 5 | null | 2021-03-19T06:22:36 | 2020-12-07T13:58:23 | C++ | GB18030 | C++ | false | false | 1,395 | cpp | NJNUxzl.cpp | #include<stdio.h>
#include<stdlib.h>
#include<ctype.h>
typedef struct BiTNode
{
int data;
struct BiTNode *lchild,*rchild;
}Node;
Node *CreateBiTree()
{
Node *p;
int a;
scanf("%d",&a);
if(a==0)
{
p=NULL;
}
else
{
p=(BiTNode *)malloc(sizeof(BiTNode));
p->data=a;
p->lchild=CreateBiTree();
p->rc... |
9f57047c96d1181f14c9f5eab9d0d37699375410 | b34e6d6acf20e5e8b2edf1985ec6cbdfc74f574c | /src/PSO2TestPlugin.cpp | 1f935e3de43068ce0fd3d2afd5a15ee519ffe6a1 | [
"MIT"
] | permissive | karashiiro/PSO2TestPlugin | c883aa1a9980b3e6c5e90f8b7328f2fa9019d685 | a80d33566f931f2551fc43534a2701c778dc496e | refs/heads/main | 2023-03-20T03:21:20.294745 | 2021-03-17T23:18:50 | 2021-03-17T23:18:50 | 331,432,903 | 0 | 0 | MIT | 2021-03-17T23:16:30 | 2021-01-20T21:09:14 | C++ | UTF-8 | C++ | false | false | 6,859 | cpp | PSO2TestPlugin.cpp | #include "PSO2TestPlugin.h"
#include "resources.h"
#include "Util.h"
#include "Web.h"
#include "backends/imgui_impl_dx11.h"
#include "backends/imgui_impl_win32.h"
#include "d3d11.h"
#include "detours.h"
#include "imgui.h"
#include "nlohmann/json.hpp"
using namespace PSO2TestPlugin;
typedef HRESULT(WINAPI *CreateDev... |
1874341cf7028e8605356c62c0ef6343f40da4ea | 069cd61631f8870162807d511ee9eea4a8a35f20 | /src/solvers/flattening/boolbv_let.cpp | d14aa8487c6ad9dc976dacc37b93e1e9bba15b0b | [
"BSD-2-Clause",
"LicenseRef-scancode-unknown-license-reference",
"BSD-4-Clause"
] | permissive | angelhof/cbmc | 6ba1ff59525e8eb8b88f4dd0cb3729f27dea7d4e | 5c49b127da1658eb5413ce981fb4049d6d39e8be | refs/heads/develop | 2020-06-08T04:15:24.437252 | 2019-06-21T12:07:45 | 2019-06-21T12:07:45 | 193,155,011 | 0 | 0 | NOASSERTION | 2019-07-10T15:17:42 | 2019-06-21T20:13:34 | C++ | UTF-8 | C++ | false | false | 908 | cpp | boolbv_let.cpp | /*******************************************************************\
Module:
Author: Daniel Kroening, kroening@kroening.com
\*******************************************************************/
#include "boolbv.h"
#include <util/std_expr.h>
#include <util/std_types.h>
bvt boolbvt::convert_let(const let_exprt &ex... |
915331a8586726ba4a36300561629909258c76e8 | 8f8ede2d240cafa0b17f135c553a2ae64e6ea1bd | /voice/tts/ttslib/engine/TTS_Engine.cpp | 9f8695b3787f6c5c926f9ac1cb589850e1804568 | [] | no_license | hyCpp/MyDemo | 176d86b720fbc9619807c2497fadb781f5dc4295 | 150c77ebe54fe7b7f60063e6488319d804a07d03 | refs/heads/master | 2020-03-18T05:33:37.338743 | 2019-03-10T04:21:01 | 2019-03-10T04:21:01 | 134,348,743 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,633 | cpp | TTS_Engine.cpp | /**
* Copyright @ 2014 - 2017 Suntec Software(Shanghai) Co., Ltd.
* All Rights Reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are NOT permitted except as agreed by
* Suntec Software(Shanghai) Co., Ltd.
*
* Unless required by applicable law or agreed to in writ... |
b74ed89b744ce36b211e63254a023c1a8392a7b5 | cee5be19cff7fd682235e8c059e7a6afe29b3001 | /sprint00/t07/src/inventory.h | 215f3604c122a6b46be5281e46851f326f67a236 | [] | no_license | nsubbotin/Cpp_Marathon | d61de8508a23d620218ddaf355d3d54564991d94 | 676c6bbd40abf59af3649ffb2af4aef38af383ed | refs/heads/master | 2023-08-19T20:51:35.075266 | 2021-10-19T09:08:29 | 2021-10-19T09:08:29 | 413,491,380 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 716 | h | inventory.h | #include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <vector>
#include <algorithm>
void CheckEnd(std::stringstream &ss);
void CheckEnd(std::stringstream &ss, std::string &type);
void CheckItemType(const std::string &type);
void CheckItemOccurrence(const std::string &type, std::vector<std... |
e58b3630ca4a640a57b84959046e44aeafe939c7 | 25c9caacb5220e2bc34b5a1bc4934e602c11c9fe | /Classes/GameCommon/GameData.cpp | 281ba4f96e0b8f37856051946a3d7e63c18ca284 | [] | no_license | EasonGan/CocosPlane1.0 | 20b9870b1ddafa9aebbdaa63034d1de86e3fe18b | e19f1a1b538c5b1c2e746b929406cb80955cda41 | refs/heads/master | 2016-08-13T00:03:05.610683 | 2015-12-04T02:41:12 | 2015-12-04T02:41:12 | 46,762,770 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 9,784 | cpp | GameData.cpp | #include "GameData.h"
#include "AudioEngine.h"
#include "../GamePlaying/Bullet/BulletFactory.h"
#include "../GamePlaying/Weapon/WeaponFactory.h"
#include "../GamePlaying/BasePlane/BasePlane.h"
#include "../GamePlaying/BasePlane/PlaneAction.h"
#include "../GamePlaying/DropGoods.h"
#include "../GamePlaying/BasePla... |
85d9b825e51ddf58dd897da2d1bcf134565fdae1 | 6a07acb66e5471519110eb1136474fe3006c94d8 | /src/rendering/nodes/DiffuseGIProbeDebug.cpp | d4428365ddd982f690b2d0fd8e6cbe277589c0a1 | [
"MIT"
] | permissive | liuyangvspu/ArkoseRenderer | df49bcbbcfcacf358b8ab6ac0dcdfaf2ab9880cb | 609c99aa899e5f5b10f21f0d9aba54599128fff2 | refs/heads/master | 2023-07-17T14:22:15.156644 | 2021-08-31T22:43:30 | 2021-08-31T22:43:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,735 | cpp | DiffuseGIProbeDebug.cpp | #include "DiffuseGIProbeDebug.h"
#include "CameraState.h"
#include "ProbeDebug.h"
#include "utility/Logging.h"
#include "utility/Profiling.h"
#include <imgui.h>
std::string DiffuseGIProbeDebug::name()
{
return "diffuse-gi-probe-debug";
}
DiffuseGIProbeDebug::DiffuseGIProbeDebug(Scene& scene)
: RenderGraphNod... |
175154cc27ce8d627432c9b4ed868f81f385189d | 95a19dc766385127568ffb16e1a85ac751634003 | /picam/libs/core/src/picam_camera_dummy.hpp | eb0dd422c01a8225085017ce7b41792c9e207404 | [
"MIT"
] | permissive | avribacki/neato-pi | bc90710fc04f08e356a1a956162d305f65a886ad | dd415f0f6ab82492468fedcafc85f18277fc7c06 | refs/heads/master | 2021-01-02T08:35:03.627973 | 2017-08-04T00:48:02 | 2017-08-04T01:30:30 | 99,021,824 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,585 | hpp | picam_camera_dummy.hpp | #ifndef PICAM_CAMERA_IMPL_H
#define PICAM_CAMERA_IMPL_H
#include "picam_camera.hpp"
#include <thread>
#include <mutex>
#include <atomic>
namespace PiCam {
/*************************************************************************************************/
// Dummy camera implementation to use when MMAL... |
673ee06b584302b8be8917c9b2947c125c74cda5 | a66fc6dc89d73dc2973c5ec175ac26369d013edd | /VulkanLerning/src/firstApp.h | c0bebf6c619d55c05332ce9e3aa84bf91ada12fd | [] | no_license | herniklanger/VulkanLearning | ad653feb6e3fceb6467ded8f481c5789232fcbf9 | 3e98930dad80bb69004260abe92e42d8c16399c9 | refs/heads/main | 2023-07-02T05:28:21.810835 | 2021-08-05T21:34:14 | 2021-08-05T21:34:14 | 391,289,236 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 618 | h | firstApp.h | #pragma once
#include "window.h"
#include "device.h"
#include "Model.h"
#include "GaneObject.h"
#include "Renderer.h"
#include <memory>
#include <vector>
namespace VulkanTest
{
class FirstApp
{
public:
static constexpr int WIDTH = 800;
static constexpr int HEIGHT = 600;
FirstApp();
~FirstApp();
Fir... |
64dd7b199027c6ac5c3b58cd5e4ca5b131b8f2ff | 34e2954b6b31d2213593fdbc989788055dd10891 | /fish/fish.ino | cf8b83c021ff3fcad99342556f5559e1f1ceb098 | [] | no_license | alemolinata/ArduinoFishServo | 77f7a902d68bf5d7bde24c53dca664a566f160ee | a00783e5bc40f4f42c71e8b72585f0165d0a7d7d | refs/heads/master | 2021-01-01T17:15:45.529448 | 2015-03-18T11:36:37 | 2015-03-18T11:36:37 | 32,455,181 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,696 | ino | fish.ino | #include <Servo.h>
#define myFish 9
#define sensorPin A0
#define numSensorReadings 10
Servo fishServo;
int fishDirection = 45;
int lightLimit = 800;
unsigned long prevTimeFish;
unsigned long prevTimeWater;
unsigned long prevTimeSensor;
unsigned int fishDelay = 200;
unsigned int waterDelay = 50;
unsigned int senso... |
ab6d4f61e641b8f44371f34e8df9f722f68aadbe | fbe61d48fada2102c4baf3c368398b47bea60654 | /baekjoon/DP/2193.cpp | 8d76a7a011bb1dba2da4592d17ee3daf460521e7 | [] | no_license | tjdgus3537/algorithm | 44be894a0bd24f75062c3a40c9eb84afa6a29212 | 78c8a7aa714f4edefac252b60622bfbd2eb08069 | refs/heads/master | 2020-03-19T10:02:44.868336 | 2019-02-07T09:52:31 | 2019-02-07T09:52:31 | 136,338,645 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 814 | cpp | 2193.cpp | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
//int를 쓰니까 오답이 나옴. long long을 써야 함
//90을 넣으면 정답이 880067194370816120
void solution();
int main() {
#ifdef _DEBUG
freopen("/home/ubuntu/workspace/input", "r", stdin);
#endif
solution();
return 0;
}
void ... |
88240f46e7c9429d601bbab4642a88ebb0af0312 | 9b727ccbf91d12bbe10adb050784c04b4753758c | /UVA/10054 - The Necklace.cc | 1aceb6bd832d1bf8887ae258c8853c3a3e62b488 | [] | no_license | codeAligned/acm-icpc-1 | b57ab179228f2acebaef01082fe6b67b0cae6403 | 090acaeb3705b6cf48790b977514965b22f6d43f | refs/heads/master | 2020-09-19T19:39:30.929711 | 2015-10-06T15:13:12 | 2015-10-06T15:13:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 959 | cc | 10054 - The Necklace.cc | #include <cstdio>
#include <cstring>
const int MAXN=55;
const int MAXM=1005;
int map[MAXN][MAXN];
int deg[MAXN];
int ans[MAXM];
int n,m,cnt;
int root;
void find(int u)
{
for (int v=1; v<=n; v++)
if (map[u][v]>0)
{
map[u][v]--;
map[v][u]--;
find(v);
}
ans[cnt++]=u;
}
int main()
{
int te... |
ed9791f1d727eb4896a56d7f8447e5bbf8d26d43 | 93718ec4ba75e3871768d6f142a13e1cc6adac4e | /cell/network.h | 5e6c36e0bd09b1e12062b5394414fbf306b6c1bc | [] | no_license | dunnker/cell | aa6d236593c0d791056b9375ba03d22c8412f4a7 | cb75125a9d96480bf93e17f7f66494bbdce887eb | refs/heads/master | 2021-01-10T12:21:19.783844 | 2016-02-21T02:02:52 | 2016-02-21T02:02:52 | 49,540,430 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,237 | h | network.h | #pragma once
#include <vector>
namespace NeuralNetwork
{
struct Network
{
static const unsigned short int MAX_HIDDEN_COUNT = 100;
static const unsigned short int MAX_HIDDEN_LAYERS = 5;
const unsigned short int _inputCount;
const unsigned short int _hiddenCount;
... |
b60d2a91fdf4a278a3123168eea640fc5aeb0a0f | a75910ca28c9f70f46e8a0f31f114660ba8575f6 | /homework_showdown/pixelParticlesSequencerLeap2/src/testApp.cpp | 903602b9b5d56c12134be09b5f68041878838c52 | [] | no_license | bschorr/schorr_algo_2013_CLEAN | 77069b12991cb1815fe1e64f91aa55c637cf0c2b | 4fab3252c4cf89baee28cf9685b28ce59a30e2b0 | refs/heads/master | 2020-12-24T17:54:49.748388 | 2013-12-16T23:37:41 | 2013-12-16T23:37:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,957 | cpp | testApp.cpp | #include "testApp.h"
//--------------------------------------------------------------
void testApp::setup(){
ofSetFrameRate(60);
ofSetVerticalSync(true);
ofSetLogLevel(OF_LOG_VERBOSE);
leap.open();
leap.setupGestures(); // we enable our gesture detection here
//sequencer setup
//of... |
79b3a52dcf681d88ad74d8d695bc5c4be52346c5 | 02541cc23351b013278c1ba4b4c5301b71e597cb | /HOJ/107.cpp | f77587d34332d51505307a344a5a5a8a30a6ce01 | [] | no_license | austin880625/problem_solving | d5ac0865405df6d613e408c996c8b875b500a85a | b76cfabcea6e750b9e97c2a66961760fe8d70cf9 | refs/heads/master | 2021-05-04T11:01:03.178708 | 2018-07-14T14:14:04 | 2018-07-14T14:14:04 | 43,396,070 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,183 | cpp | 107.cpp | #include<iostream>
#include<stdio.h>
#include<queue>
#define MAXN 1000005
#define ll long long int
using namespace std;
int C[MAXN];
int X[MAXN];
int F[MAXN];
int nxt[MAXN];
int prev[MAXN];
int N,M,A,B;
int T;
int ran()
{
static int x=20151103;
return x=x*0xdefaced+1;
}
struct Node
{
... |
ab5bd46256144386b9e493143478eda64a8134e7 | 80cc56f6063132eb9a76f8b9207426226d3d7b28 | /Labs9_1.cpp | 90c4f83fdac89d7f8a22d9ed29defb6e4f7d9e2c | [] | no_license | hoatq-fptaptech/T2009M_LBEP | 56417dfcd2453a0392daeda4687bdff362c21b81 | cf2052c198e183c5eac24fba54932d90b3720488 | refs/heads/master | 2022-12-25T13:12:56.460903 | 2020-10-03T07:42:56 | 2020-10-03T07:42:56 | 294,846,229 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 444 | cpp | Labs9_1.cpp | #include <stdio.h>
#include <string.h>
int main(){
char s[20];
printf("Nhap chuoi: ");
scanf("%s",s);
int a=0,e=0,i=0,o=0,u=0;
for(int j=0;j<strlen(s);j++){
if(s[j] == 'A'|| s[j]=='a')
a++;
else if(s[j]== 'E' || s[j] == 'e')
e++;
else if(s[j]== 'I' || s[j] == 'i')
i++;
else if(s[j]== 'O' || s[j] =... |
ab30b5cb02fa4803a216fc3f4a33273d9fc9ef2f | e58389168cc5e49b6377a5e7716c1a6a870616b1 | /examples/simple.cpp | 26622c4ac1249f7335a910e3c53f2983c1082c99 | [] | no_license | tafoca/lockfree-bdd | 8b71de516cfb69b709960568d3a43ace066b8588 | e0f8672fa03a510900edfa79b76659e79f314a36 | refs/heads/master | 2020-08-27T17:55:21.444009 | 2016-05-09T14:24:59 | 2016-05-09T14:24:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 523 | cpp | simple.cpp | #include <iostream>
#include "bdd.h"
#include "visualize.h"
int main() {
bdd_init(100, 100, 3);
bdd_ptr a = ithvar(0);
bdd_ptr b = ithvar(1);
/* bdd_ptr c = ithvar(2); */
bdd_ptr result = bdd_or(a, b);
/* bdd_ptr result = bdd_or(a, bdd_and(b, c)); */
/* bdd_node *result = bdd_or(a,b); */
bdd_graphvi... |
31d5782a23d2d0cf5d3b27716d61829f16c216bf | 6f154afa302efeac5256e82c973616c0a428d3d5 | /src/main/strategy_engine_common/Math/ProbDistrnFunc.h | 7991c88ad592861db04faea41a6e8cb1609c0de0 | [] | no_license | clhongooo/trading_engine | 2ff58cc5d6cf7bef0a619549a4b4d63f923483dd | d4d74ad7ba21caa01f49054d63cdd8b2317d1702 | refs/heads/master | 2020-06-03T21:38:44.509346 | 2019-07-05T10:16:24 | 2019-07-05T10:16:24 | 191,741,370 | 0 | 1 | null | 2019-06-13T10:23:32 | 2019-06-13T10:23:32 | null | UTF-8 | C++ | false | false | 3,428 | h | ProbDistrnFunc.h | #ifndef PROBDISTRNFUNC_H_
#define PROBDISTRNFUNC_H_
#include "PCH.h"
#include "Constants.h"
#include "SDateTime.h"
#include "STool.h"
using namespace std;
using namespace boost;
class ProbDistrnFunc {
public:
enum { PRECISION = 3 };
ProbDistrnFunc();
virtual ~ProbDistrnFunc();
//------------------... |
d00399db68034f2607ee8a65acb177fdbc3908a2 | aa619e3ed85030cba9ff3ec4837da948f4883907 | /ShadyTreeEngine/Components/PhysicsComponent.h | f827226e8febe6776a500500291dd74c529e93a6 | [] | no_license | Cody-Duncan/ShadyTreeEngine2 | 6c5fb5d016cfdaab1b5007d2020589b12ed5c31d | 5ace6a2e99c4cc3186c2cbf36d6c8bfd5c05d5bb | refs/heads/master | 2020-04-06T05:20:28.272360 | 2019-07-17T06:16:03 | 2019-07-17T06:16:03 | 16,856,421 | 1 | 1 | null | 2019-07-17T06:16:08 | 2014-02-15T04:19:42 | C++ | UTF-8 | C++ | false | false | 1,166 | h | PhysicsComponent.h | #pragma once
#include "GameObject\Component.h"
#include "Resources\GraphicsResourceHandles.h"
#include "Math\MathLib.h"
#include "GameObject\ComponentTypeID.h"
#include "Physics\BB.h"
#include "DelegateFunc.h"
#include "Messaging\ContactMessage.h"
class PhysicsComponent : public Component
{
public:
ST_API PhysicsC... |
bab968c1a43cfb9ead683dbfa8ba8605814572df | 2960167ca6fba5c49fcdf7fa4353017e1566246f | /Programming/Vladislav_Pustovoitenko/1/Individyalka1/CFraction.h | f068f1e8ef80bfa4c5cd9bd8331d2ede16597e94 | [] | no_license | FriedrichFrankenstein/A.19-Green | ed95e28a0e6bbaa48d24db372642ad97d6b42772 | 1444c54e0400bbc3ab4ed4eac058691d4407421d | refs/heads/master | 2020-07-29T20:37:21.584748 | 2019-10-16T13:39:42 | 2019-10-16T13:39:42 | 209,950,683 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 635 | h | CFraction.h | #ifndef CFRACTION_H_INCLUDED
#define CFRACTION_H_INCLUDED
#include <iostream>
using namespace std;
class CFraction
{
public:
CFraction(){};
CFraction(unsigned long int,unsigned long int);
void operator=(const CFraction&);
CFraction operator+(const CFraction&);
CFraction operator-(const CFraction&);
CFraction operato... |
35800901086e96c3e50d2958236e8d17f2b96e2c | 81919bd66da74363bc064fd88ef31fd4c33bcd2d | /thread_counter.h | 0e6c2b6d148aa741f2064af8ef94587291c796b2 | [] | no_license | jussimaki/Sequencer-2017 | 0e88e010fc0af6ac5a90e38ab6ee609fc4705b82 | 031f3a7de01791c1ce7e09eb141eb934f4276469 | refs/heads/master | 2022-10-13T13:27:49.779023 | 2020-06-08T18:00:41 | 2020-06-08T18:00:41 | 270,768,781 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 773 | h | thread_counter.h | #ifndef THREAD_COUNTER_H
#define THREAD_COUNTER_H
class ThreadCounter
{
public:
ThreadCounter(std::atomic <int> *pointer) : pointer_(pointer)
{
std::cout << "thread++";
int oldValue, newValue;
do
{
oldValue = (*pointer_).load();
newValue = oldValue + 1;
} while(!(*pointer_).comp... |
c28af7dc24c8d9b8c83cfffe22c71cda5ab7df06 | b8a3aa80928d647c88fde7bc47cb50b4f5406855 | /ckdgus0505/ACM/9372.cpp | 38bc18fd2f721c9037663d0445be66b16d553cd7 | [] | no_license | ckdgus0505/ACM | 9eded656a0703d39ed8cb4f48e450df88fc25268 | 03a78f5018242f9e06dc681711540c1daed8ee52 | refs/heads/master | 2021-07-10T18:22:50.530584 | 2020-08-01T19:43:28 | 2020-08-01T19:43:28 | 176,450,497 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 291 | cpp | 9372.cpp | #include<iostream>
using namespace std;
int T;
int N, M;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> T;
for (int i = 0; i < T; i++) {
cin >> N >> M;
for (int j = 0; j < M; j++)
{
int a, b;
cin >> a >> b;
}
cout << N - 1 << '\n';
}
return 0;
} |
511d2fa3bead5ece743ad92cceb55150d454e39c | a24a0fd51c5e98e93355acf1adf5bccacc3e94b8 | /src/SerialModbusClient.cpp | aff052c78a70b1a5ab777793f7b8559bdc61baff | [
"MIT"
] | permissive | legicore/SerialModbus | 0258eba015c00debb6c4a16fb4c6ebf1f2e875d5 | 0c854a54df519aab5eb37bbec75640b2cd43d89c | refs/heads/master | 2023-08-07T07:22:38.730989 | 2023-08-06T13:54:36 | 2023-08-06T13:54:36 | 147,487,345 | 6 | 1 | MIT | 2018-09-14T03:58:35 | 2018-09-05T08:44:13 | C++ | UTF-8 | C++ | false | false | 27,958 | cpp | SerialModbusClient.cpp | ////////////////////////////////////////////////////////////////////////////////
/**
* @file SerialModbusClient.cpp
*
* @author Martin Legleiter
*
* @brief TODO
*
* @copyright (c) 2023 Martin Legleiter
*
* @license Use of this source code is governed by an MIT-style
* ... |
18d33394fc7662aa10f6420ded4cbf67fe685bf8 | a33aac97878b2cb15677be26e308cbc46e2862d2 | /program_data/PKU_raw/86/82.c | 82f16bf56764c8988f46a6aeeb2a29b8f0649adb | [] | no_license | GabeOchieng/ggnn.tensorflow | f5d7d0bca52258336fc12c9de6ae38223f28f786 | 7c62c0e8427bea6c8bec2cebf157b6f1ea70a213 | refs/heads/master | 2022-05-30T11:17:42.278048 | 2020-05-02T11:33:31 | 2020-05-02T11:33:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 422 | c | 82.c |
int main()
{
int n;
scanf("%d",&n);
int i,m,j,p;
for(i=0;i<n;i++)
{
scanf("%d",&m);
int time=0;
for(j=1;j<=m;j++)
{
if(time<60)
{
scanf("%d",&p);
time=p+3*j;
}
if(time>=60){break;}
}
if(time<=60)printf("%d\n",60-3*m);
if(time>60)
{
if( p < ( 60-3*(j-2) ... |
08b6e2bc1a4a0c8b6953674fb6f03df1feffc86d | e6cd01e382e985c72908240dde5987091b3f7dad | /src/main.cpp | 5a93eec3d944295d0ee4ac3e190620bfd3da77d6 | [] | no_license | andrei-herdt/goldfarb_idnani | 2417a504e39acfd165c8fd3b7d34cab0467b1916 | 5fad0e8c72fbfee792a50979b6d05aeed5a3a65d | refs/heads/main | 2023-04-28T11:29:22.367592 | 2021-05-18T22:01:31 | 2021-05-18T22:01:31 | 359,102,004 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 452 | cpp | main.cpp | #include <iostream>
#include <Eigen/Dense>
int main()
{
// Step 0: Assume that some S-pair (x,A) is given
// Step 1: Repeat until all constraints are satisfied
// (a): Choose a violated constraint within the set of non-active
// constraints
// (b): check for infeasibility,
// Stof if infeasibl... |
229170ab83d6047ae9f05fa7a9158bd5bf237c64 | 54db5404783bbaaef8bdd6b152be17b67f8ceee3 | /SwitchButton.cpp | ea46966d8cf92e2f3eb4f2a5c059541d77103f31 | [
"Apache-2.0"
] | permissive | pneumaticdeath/switchbox | 23c9f0d646ecd8051131b9f21a5fc73e7a23bd94 | aa129cf422217ad4dd61620902f513702152d3d9 | refs/heads/master | 2020-12-24T13:28:25.408699 | 2019-02-24T21:32:17 | 2019-02-24T21:32:17 | 38,138,056 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,851 | cpp | SwitchButton.cpp | /* Copyright 2015, Mitch Patenaude patenaude@gmail.com */
#include "SwitchButton.h"
SwitchButton::SwitchButton(uint8_t pin, uint32_t long_press_time, uint32_t debouce_time,
uint8_t speaker_pin, uint16_t down_tone, uint16_t down_tone_duration,
uint16_t up_tone, uint16_t up_tone_duration) {
th... |
eeabdcf187336c33d3395d9a7bac0419ba4bb4a0 | aa59edc791efa1eea8bb477689e5ae227f7621b2 | /source/NanairoGui/Renderer/scene_value.hpp | 5979ced4eabe6daaad7d9d95d6f1840feab6c50e | [
"MIT"
] | permissive | byzin/Nanairo | e5f30fb8fae8d65c45c768c8560524ac41f57d21 | 23fb6deeec73509c538a9c21009e12be63e8d0e4 | refs/heads/master | 2020-12-25T17:58:18.361872 | 2019-05-05T06:05:34 | 2019-05-05T06:05:34 | 18,831,971 | 32 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 4,620 | hpp | scene_value.hpp | /*!
\file scene_value.hpp
\author Sho Ikeda
Copyright (c) 2015-2018 Sho Ikeda
This software is released under the MIT License.
http://opensource.org/licenses/mit-license.php
*/
#ifndef NANAIRO_SCENE_VALUE_HPP
#define NANAIRO_SCENE_VALUE_HPP
// Standard C++ library
#include <memory>
// Qt
#include <QJso... |
dfa77683dc77da1b98ffba79c098f62cef1a6e55 | b5d5aee773b6892e137692a8209127bb900de96d | /CPU Scheduler/process.h | 871a78fc3d615c1b95016726346e10e7ba7e853b | [] | no_license | AkivaGreen/CPU-Scheduler | 6c6ba5f7d9590ea547cfb383b47949a21efcd8c2 | 5b950b8153b96dd763fd21887a589ce1aef7a6de | refs/heads/master | 2020-12-31T21:30:28.366784 | 2020-02-07T22:07:20 | 2020-02-07T22:07:20 | 239,031,325 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,987 | h | process.h | #pragma once
#ifndef PROCESS_H
#define PROCESS_H
#include <iostream>
using namespace std;
class process {
public:
process();
process(const process & org);
~process();
string name;
int getData(int loc);
int getCount();
void setCount(int new_count);
int getSize();
void setSize(int new_size);
int getCPU(); //... |
c33bcbb20b72f110958224f858c0f5140985c551 | f07433ee47bbed403874a5d9232adcc746b20df3 | /p8/complex.cpp | 798010ce6fd31a2a4b584453a9d511bc09a8a113 | [] | no_license | YihuiAndre/csc103-projects | 013ccc4936dc831affb62e16e07032b70c556cad | 1b155aab2f6fe3daf826ca8bdc97d753ccb80565 | refs/heads/master | 2021-07-03T07:29:56.080923 | 2020-09-30T16:21:47 | 2020-09-30T16:21:47 | 168,990,130 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,023 | cpp | complex.cpp | /*
* file: complex.cpp
* This is the implementation of our complex number
* class whose interface resides in the file complex.h
*/
#include "complex.h"
#include <cmath> // for the square root function needed for norm()
complex::complex(double re, double im)
{
//initialize the real and imaginary parts:
real = r... |
b6e0409684af234cec336a52ebc1721eda672f26 | dba68ca53ce02985ed1b49f6813d578d24e94b27 | /ProjectsServer/GameServer/FieldServer/MonthlyArmorManager.h | c174955444a30c07b68acb95fbce313bff3c974c | [] | no_license | DeathRivals/OpenAo | afd6c1fe6ddc00e3765c290f485805a7b3e0db59 | bf6be4ee29b1f08588fe7fd12c02c8df94d705f5 | refs/heads/master | 2021-02-15T18:23:37.814569 | 2020-03-04T14:39:38 | 2020-03-04T14:39:38 | 244,919,960 | 2 | 2 | null | 2020-03-04T14:22:07 | 2020-03-04T14:22:07 | null | UHC | C++ | false | false | 1,529 | h | MonthlyArmorManager.h | // MonthlyArmorManager.h: interface for the CMonthlyArmorManager class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_MonthlyArmorManager_H__587F770B_FAA0_45E0_9EBB_556823A0EC7F__INCLUDED_)
#define AFX_MonthlyArmorManager_H__587F770B_FAA0_45E0_9EBB_556823A0EC7F__INCLUDED_
... |
92db7eb3ca2ac3bed9220ddb0c4b97bf0c558284 | 8f11b828a75180161963f082a772e410ad1d95c6 | /packages/estimation/include/modules/RangeAveragingModule.h | b5d01ad14613ee4eba40efa1bd43c9bb1f77c333 | [] | no_license | venkatarajasekhar/tortuga | c0d61703d90a6f4e84d57f6750c01786ad21d214 | f6336fb4d58b11ddfda62ce114097703340e9abd | refs/heads/master | 2020-12-25T23:57:25.036347 | 2017-02-17T05:01:47 | 2017-02-17T05:01:47 | 43,284,285 | 0 | 0 | null | 2017-02-17T05:01:48 | 2015-09-28T06:39:21 | C++ | UTF-8 | C++ | false | false | 1,197 | h | RangeAveragingModule.h | /*
* Copyright (C) 2011 Robotics at Maryland
* Copyright (C) 2011 Eliot Rudnick-Cohen <erudnick@umd.edu>
* All rights reserved.
*
* Author: Eliot Rudnick-Cohen <erudnick@umd.edu>
* File: packages/estimation/include/modules/RangeAveraging.h
*/
#ifndef RAM_ESTIMATION_RANGEAVERAGINGMODULE
#define RAM_ESTIMATION_R... |
4e5f050f07560c909464dc9468a684b540831d39 | c6bddd88916e6c8697a9e02485bd22c58d76bcec | /GeneratedPlaceholders/Engine/AudioComponent.h | 943dc2e94dacf7aa678e1a811f191187ae85ae6c | [] | no_license | GIRU-GIRU/Mordhau-Unofficial-SDK | 18d13d62d746a838820e387907d13b0a37aed654 | f831d7355cf553b81fb6e82468b3abf68f7955aa | refs/heads/master | 2020-07-06T03:36:48.908227 | 2020-04-22T13:54:00 | 2020-04-22T13:54:00 | 202,872,898 | 7 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 6,360 | h | AudioComponent.h | #pragma once
#include "CoreMinimal.h"
#include "AudioComponent.generated.h"
UCLASS()
class UAudioComponent : public USceneComponent
{
GENERATED_BODY()
public:
UPROPERTY(Replicated, EditAnywhere, BlueprintReadWrite)
TArray<struct FAudioComponentParam> InstanceParameters;
UPROPERTY(Replicated, EditAnywhere, Bluepri... |
59ee5071bfc066743c23f78dd4e5977d6e0ac47e | fb0f9abad373cd635c2635bbdf491ea0f32da5ff | /src/coreclr/debug/createdump/dumpwritermacho.cpp | 79b71132f3a3a8c1038ad950823a8aaea44970a2 | [
"MIT"
] | permissive | dotnet/runtime | f6fd23936752e202f8e4d6d94f3a4f3b0e77f58f | 47bb554d298e1e34c4e3895d7731e18ad1c47d02 | refs/heads/main | 2023-09-03T15:35:46.493337 | 2023-09-03T08:13:23 | 2023-09-03T08:13:23 | 210,716,005 | 13,765 | 5,179 | MIT | 2023-09-14T21:58:52 | 2019-09-24T23:36:39 | C# | UTF-8 | C++ | false | false | 10,093 | cpp | dumpwritermacho.cpp | // Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
#include "createdump.h"
#include "specialthreadinfo.h"
extern int g_readProcessMemoryResult;
//
// Write the core dump file
//
bool
DumpWriter::WriteDump()
{
BuildSegmentLoadCo... |
6a1c6d14230705781bc4303904f77eb72c1518db | 9680d30e967bcda5e07c278d42adbd4a3d09e72d | /static_list/Lista.cpp | d625fa81d2aa6cba077436a35252fb17b9c56360 | [] | no_license | MatheusGobetti/data_structures | 06407af06d76c31582731d8302fb5b378f6180fb | 54f7bfe609f219b8af72067a2286422289b05264 | refs/heads/main | 2023-06-09T10:04:33.576434 | 2021-06-22T12:45:04 | 2021-06-22T12:45:04 | 350,571,248 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,345 | cpp | Lista.cpp | #include "Lista.h"
Lista::Lista() {
contador = 0;
for (int i = 0 ; i < capacidade ; i ++) {
elementos[i] = 0;
}
}
bool Lista::vazia() {
return contador == 0;
}
bool Lista::cheia() {
return contador == capacidade;
}
string Lista::listar() {
string ret = "";
for (int i = 0 ; i <... |
1161de0d2a325185e8b27c6461d679aeb2acf904 | 21b70522929f9cb99caec4e81af59a1359bf1447 | /src/tools/main.cpp | 60eb4fcb08d9d4c22f9157577624fcf581019a68 | [] | no_license | psionic12/mycc | 01c52b1214f41bb15dd8fece03d2ba313a648201 | 4b851fe956b5174b0655e2046bffb8ea44183a98 | refs/heads/master | 2021-08-07T05:17:12.434763 | 2020-05-14T10:04:52 | 2020-05-14T10:04:52 | 175,815,823 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,454 | cpp | main.cpp | #include <iostream>
#include <fstream>
#include <lex/lex.h>
#include "first_set_generator.h"
int main() {
std::ifstream BNF;
BNF.open("BNF");
std::unordered_map<std::string, mycc_first_set::NoneTerminalId> none_terminal_map;
mycc_first_set::Productions productions = mycc_first_set::FirstSetGenerator::ToProduct... |
946b29e12151425e4eae3be9d88369b9adc5978d | b7e47dc1586ddee0acdca9a1d476126ac5aebe28 | /OptimiserLib/Optimiser/include/OptimiserFactory.h | acafaa448ccb712c4bc0cd484580f73a7f410c07 | [] | no_license | ajpenner/OptimiserLibrary | 02b505cc7d49610623f4b4dff9afdb423f1e4469 | 04c8e263def27d52a9b9e431920125b375908643 | refs/heads/master | 2020-09-07T11:38:12.955064 | 2019-11-15T06:44:28 | 2019-11-15T06:44:28 | 220,767,682 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,526 | h | OptimiserFactory.h | // OptimiserFactory.h
//
// 2017
//////////////////////////////////////////////////
#pragma once
//////////////////////////////////////////////////
// Constrained
#include "OptimiserEllipsoid.h"
#include "OptimiserGRG.h"
#include "OptimiserPenalty.h"
#include "OptimiserMOM.h"
#include "OptimiserComplex.h"
#include "... |
6e0eb6d358586a83957168b381e52d01d4b9b165 | bee03b7a62dd76d965b0cdf95df69bdf9fee7e64 | /src/ValueDialog/valuecalc_1106.h | f150d839805b882d6eaed8a3ee3429c9364e3419 | [] | no_license | mildrock/QuickTest | 586f0479462988806acfa6834af4876df0a21773 | 137d3d50fec9864917d1d2beffa89daed1327160 | refs/heads/master | 2020-03-05T09:55:00.772030 | 2014-12-25T09:19:03 | 2014-12-25T09:19:03 | 29,772,936 | 0 | 1 | null | 2015-01-24T10:22:46 | 2015-01-24T10:22:45 | null | UTF-8 | C++ | false | false | 439 | h | valuecalc_1106.h | #ifndef VALUECALC_1106_H
#define VALUECALC_1106_H
#include <QDialog>
#include <QPushButton>
namespace Ui {
class ValueCalc_1106;
}
class ValueCalc_1106 : public QDialog
{
Q_OBJECT
public:
explicit ValueCalc_1106(QWidget *parent = 0);
~ValueCalc_1106();
private slots:
void slot_calc(QAbstractButton*)... |
9a48a28dfafb38429ea8d84541c2b5a78ba32e80 | 60c173e62b3511dc2dfc4d0c3e56c7ee1255a2ad | /RRT/rrtImpl.h | b42703db45423b0cc243557d7c59b4125ac5e8f5 | [
"MIT"
] | permissive | mfkiwl/Fast_RRT-ROS | d8e8177b5a90901e8e5f64445c5e3dd2667e811d | daa6a4a92557ca4bba5108c969f10f335236f7b9 | refs/heads/master | 2023-01-01T07:09:26.772834 | 2020-10-27T12:14:05 | 2020-10-27T12:14:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,049 | h | rrtImpl.h | //
The code was partly adapted from https://ompl.kavrakilab.org/classompl_1_1geometric_1_1RRT.html
//
#ifndef PROJECT_RRTIMPL_H
#define PROJECT_RRTIMPL_H
#endif
#pragma once
#include <iostream>
#include <geometry_msgs/Point.h>
#include <eigen3/Eigen/Dense>
#include <random>
struct Node {
public:
Node() {}
... |
b78b0c22738a406bdb00845f90f9fc87398a75aa | 0eb5062cf88cab9a1361162f6bb2f2fef2f561bf | /16MulticastConfiable/16MulticastConfiable/PaqueteDatagrama.cpp | e234b9b7f8ae4bf56fdc4e7fe0e6dd914eb7cf8a | [] | no_license | abiisnn/DistributedSystems | 7461c37a094d1274ce97ca3087dfa05bb60cea2f | 5f022d6152c13377466297a6ac7e81953cd082c1 | refs/heads/master | 2020-07-07T06:29:30.711298 | 2019-11-25T17:44:01 | 2019-11-25T17:44:01 | 203,277,802 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 945 | cpp | PaqueteDatagrama.cpp | #include <bits/stdc++.h>
#include "PaqueteDatagrama.h"
using namespace std;
PaqueteDatagrama::PaqueteDatagrama(char* data, unsigned int longi,char* ip_envio, int puerto_envio){
datos = new char[longi];
strcpy(ip, ip_envio);
memcpy(datos, data,longi);
puerto = puerto_envio;
longitud = longi;
}
PaqueteDatagram... |
b08c3101459e4abed0c8179c1851e9e3a8e21788 | 93478c3082ebbd464bcee1b08e3ea5df7beb0839 | /elements.hpp | 49c7041c3bcb858bf487a1fd3c45d8925ccbe67a | [
"MIT"
] | permissive | 5cript/cppdom | da59ff2e4c646fd2cd8e5f06ef42b0e159f64eb0 | 03e257d62f2b939544c5d1c2d8718e58f2d71e34 | refs/heads/main | 2023-02-15T16:07:22.829662 | 2021-01-10T14:39:25 | 2021-01-10T14:39:25 | 310,899,282 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 469 | hpp | elements.hpp | #pragma once
#include "elements/div.hpp"
#include "elements/button.hpp"
#include "elements/text.hpp"
#include "elements/a.hpp"
#include "elements/sectioning.hpp"
#include "elements/content.hpp"
#include "elements/embedded.hpp"
#include "elements/forms.hpp"
#include "elements/interactive.hpp"
#include "eleme... |
088d4e5c2b9d7be2361e621df035db199b67c482 | 8bf42e92730710e49e79f67d9efcf755a3bdf58f | /CPP/D04/ex01/Character.hpp | 994c2bab51f3e9a875467b8795c03e96d25ec2f7 | [] | no_license | tlepeche/Piscines | 6d3565ffdd02906d019081151c614a22cffff9e5 | abe7260f948aa2dbb7d3037cf688b997562ae725 | refs/heads/master | 2020-12-31T05:55:36.685193 | 2016-04-28T15:19:05 | 2016-04-28T15:19:05 | 57,311,133 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,474 | hpp | Character.hpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Character.hpp :+: :+: :+: ... |
81e2652110ccb57f704753ee54d8eed9a99173e7 | 36c00fe2afff4818c937e312ce0c6a79f35e2a77 | /8-kyu/invert-values/c++/solution.cpp | b3f0f62a30fb3066f41455e690e0e95e51205058 | [] | no_license | p-lots/codewars | 0a67b6ee4c91180ff78c648421b9d2d64463ddc3 | 535faeee475c6b398124d6f5002b0e111406e8bb | refs/heads/master | 2023-08-23T22:14:33.635011 | 2023-08-23T13:30:37 | 2023-08-23T13:30:37 | 195,320,309 | 0 | 0 | null | 2023-05-09T19:25:50 | 2019-07-05T01:40:15 | Python | UTF-8 | C++ | false | false | 263 | cpp | solution.cpp | #include <algorithm>
#include <vector>
std::vector<int> invert(std::vector<int> values)
{
if (values.empty()) return std::vector<int>();
std::transform(values.begin(), values.end(), values.begin(), [](int &n) { return -n; });
return values;
} |
cd1ba7df0683fd62673fc9f2c4f026068cb4c07a | d41d5a4944f83c363b624e050d68c4ded1d656d0 | /Wireframe/homogeneous_point3D.h | 0b7d3b4c081a3b51ccf891f39c1c4d31d7701b3c | [] | no_license | ALikhachev/Computer-graphics | 140e434115617e541016e5dbd39bb56f688a258a | f5e26ccd0f030d43f69f507dbc2ba8bbc3ab2752 | refs/heads/master | 2021-01-24T06:43:26.766854 | 2017-04-13T16:26:51 | 2017-06-04T13:56:04 | 93,315,613 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 549 | h | homogeneous_point3D.h | #ifndef HOMOGENEOUS_POINT3D_H
#define HOMOGENEOUS_POINT3D_H
#include <QVector3D>
#include <QVector4D>
#include <QSharedPointer>
#include "transform.h"
class Transform;
class HomogeneousPoint3D
{
public:
HomogeneousPoint3D(float x, float y, float z);
const QVector3D to3D() const;
QVector4D &to4D();
Ho... |
9e901d57bc795ddefadfb4c4f7b4f36ac29fc6cc | d007578440d72dbb3a354cef461c935e8dc64c44 | /src/world/world.hpp | b4939d7eab46e271d676d9af1a93e9bf4d9bc555 | [] | no_license | brendanfh/webassembly-game | 4b26ae7eb29857a96e8af8a7f6f0e809f9a5b2a7 | da1e6a45f47f4013fd84f9b1a83a6708bf5b28b3 | refs/heads/master | 2021-09-03T23:24:48.320656 | 2018-01-12T19:39:49 | 2018-01-12T19:39:49 | 109,322,459 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,489 | hpp | world.hpp | #ifndef __WORLD_H_
#define __WORLD_H_
#include "../gfx.hpp"
#include "../utils/rect.hpp"
#include "tilemap.hpp"
#include "../utils/idmanager.hpp"
#include <iostream>
#include <vector>
#include <algorithm>
class World;
class Entity;
using namespace std;
enum class EntityType {
Unknown,
Pl... |
010f04ff13518ecd10f301b0bea58d6133ac35a2 | f765ce50ed9c80eb0c43275291f39bde062d8994 | /Globals.h | 657c2c899894fe645dcb09a595bf125afe3f4aab | [] | no_license | NeilOsbaldeston/Hover-Racing | 059d15da1f9b6f61b0244a22b3310ac378dd6644 | 8703729f1ce4a090b01d899735a39a27d6124d73 | refs/heads/master | 2020-06-11T11:40:34.789008 | 2016-12-05T23:40:45 | 2016-12-05T23:40:45 | 75,676,053 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,715 | h | Globals.h | // Neil Osbaldeston
#pragma once
#include <TL-Engine.h>
using namespace tle;
//////////////
// States //
//////////////
enum class GameStates
{
PLAYING,
PAUSED,
MENU
};
enum class RaceStates
{
NOT_STARTED,
IN_PROGRESS,
FINISHED
};
enum class MenuStates
{
MAIN_MENU,
RACE_SETUP... |
a2398397e87e78556bae57b8f9a9435370ec301e | ee493d77d764534fd616de3954bfac816dc882ed | /mordor/socket.cpp | a17bdc39ad53f367171cf4aeaa6ab12c9638fdd4 | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | cgaebel/mordor | 576854738d1da4fbfc8a66e7b04f644d27c65333 | 726c63d2f015071aea656dd0b979cdfe7e2ab534 | refs/heads/master | 2021-01-19T02:35:43.083599 | 2010-10-20T21:23:05 | 2010-10-21T14:30:33 | 1,015,107 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 58,236 | cpp | socket.cpp | // Copyright (c) 2009 - Mozy, Inc.
#include "mordor/pch.h"
#include "socket.h"
#include <boost/bind.hpp>
#include "assert.h"
#include "exception.h"
#include "log.h"
#include "mordor/string.h"
#include "version.h"
#ifdef WINDOWS
#include <mswsock.h>
#include "eventloop.h"
#include "runtime_linking.h"
#pragma comm... |
ae0eead4ffe3fff473e72c15cd389b57a442d348 | c499d5015f2cd2cb920a543435253c71a8e8f4ad | /lab1/main.cpp | 8fec2f5e6ba6464d2fc2a6691343a181fd3004e8 | [] | no_license | NewblyAaron/csdc103-serrano | f22007bbad5fc923429965118eaef72cb5da9048 | c39a9c713d0904927d40bab54dace29d8cd9a3b8 | refs/heads/master | 2023-08-04T05:23:03.619794 | 2021-10-02T10:49:10 | 2021-10-02T10:49:10 | 398,978,743 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 681 | cpp | main.cpp | // Filename : main.cpp
// Description : This program tests the implementation of the
// function to approximate the value of PI.
// Author : Aaron Serrano
// Honor Code : I have not asked nor given any aunthorized help
// in completing this exercise.
#define FIXED_FLOAT(x) st... |
de3fbd9cef33ee0cda5815ee2b074e975bab5b24 | 0ee311e7cdb1108fbbd3b7fc8a3077dac9c12821 | /include/geometry/linesegment.h | 29bed4312e47cb49156b2991952d67f693662637 | [
"MIT"
] | permissive | robinlzw/cs5237-VoronoiArt | f38543fbafa09658fda4258afdbc647458a8e449 | f8b91fd386f5a04aea483ed4f2964e697322a882 | refs/heads/master | 2022-03-27T12:09:00.275909 | 2019-12-23T15:43:09 | 2019-12-23T15:43:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,336 | h | linesegment.h | #ifndef GEOMETRY_LINESEGMENTH
#define GEOMETRY_LINESEGMENTH
#include <utility>
#include "point.h"
namespace geometry {
/// Abstraction for referring to (directed) line segments
template<typename I>
using LineSegment = std::pair<Point<I>, Point<I>>;
enum class Orientation { CounterClockwise = 1,
... |
03e62a0f0b03f87589616cd82d5bbe45aabdefbc | 3ca020d9bb180e49bd40de71fc2240a36fa7ac34 | /Graph/Graph_traversal/280/280.cpp | f71447092fdc7e919ebb8373cb75630f48fcf2de | [] | no_license | arpit23697/For-Uva-solutions | b20bdc8acf341bb0a997e8ef29ad8181fbdd3a05 | a268e0794029288d25b2d36b35112f500fa41c37 | refs/heads/master | 2021-05-14T08:30:30.006235 | 2020-06-25T09:57:44 | 2020-06-25T09:57:44 | 116,299,950 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,764 | cpp | 280.cpp | #include <bits/stdc++.h>
using namespace std;
vector <vector <int> > graph;
bool visited[105];
int counter;
int n;
void DFS (int start)
{
// cout << start << "hi " <<endl;
for (int i = 0 ; i < graph[start].size() ; i++)
{
int v = graph[start][i];
if (visited[v] == false)
{
... |
1651f571da0656afbf738e5a45c459ea05f63b9d | c50a92029877fa3ef3f5c18e8d88506b7eee1c7f | /SPOJ/ITRIX12E - R Numbers.cpp | 301b93eae754defe92affbf8b430d63d13403464 | [
"Unlicense"
] | permissive | phoemur/competitive-programming | 4025995b7904ed431e03316ecf5270e976fa9275 | 8963e450352aac660287551c28c113e2bf1ba38c | refs/heads/master | 2023-08-09T23:43:03.237312 | 2023-08-06T22:45:50 | 2023-08-06T22:45:50 | 145,256,889 | 8 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 3,339 | cpp | ITRIX12E - R Numbers.cpp | /*ITRIX12E - R Numbers
#matrix #linear-recurrence #digit-dp-1
R - Numbers
R-numbers are numbers which have the property that they do not have the digit '0 ' and sum of every two adjacent digits of the number is prime. 123 is a R-number because 1+2 =3 and 2+3 =5 and 3 , 5 are primes.
How many R-numbers can be formed ... |
ff1023bbbcb1ec75a27855e134a8fcd976a8cdac | dc0bcfde42279eff6a3e76eb653de3c72e2c1616 | /main.cpp | 38c6e938abe88e1111f2ecb8f13cd2827530e6d7 | [] | no_license | Chargui-Med-Amine/Demineur-cplusplus | 25fb819add2f58a5b9d1e9d562c250c4082bfb98 | dab00026aa7fba4a0576b089e486b1f6638ee5ef | refs/heads/master | 2022-06-28T04:54:19.962342 | 2020-05-12T01:31:53 | 2020-05-12T01:31:53 | 259,491,311 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,638 | cpp | main.cpp | #include <iostream>
#include <cstdlib>
#include <ctime>
#include "carreau.h"
#include "champdesmines.h"
#include "mini_game.h"
#include <iomanip>
#include <chrono>
#include <fstream>
#include <vector>
using namespace std;
//test
int main()
{
string type_jeu;
string decision;
cout<<"\n\t\t\t\t\t**Bienvenue a... |
f0f7f3b830c1540f69361bec6168e7cc851b391d | 42bd33837ce950a7fd1021e04d97da65c7b00f55 | /Line2D.cpp | 1954f9a7f4f4b3a00e89978ed1aa78c85f8d1096 | [] | no_license | ayrahisham/data-processing-program | f092e93bb06d7469327b8b62fd211c1755b20140 | f443b4908ebefa6b16874d479c623b746af62dec | refs/heads/master | 2020-09-20T23:52:22.177293 | 2019-11-28T09:50:36 | 2019-11-28T09:50:36 | 224,621,089 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,207 | cpp | Line2D.cpp | #include "Line2D.h"
int Line2D::id = 0;
ostream& operator<< (ostream& os, Line2D& l2d)
{
os << l2d.print ();
return os;
}
bool operator== (const Line2D& l1, const Line2D& l2)
{
if ((l1.pt1 == l2.pt1) &&
(l1.pt2 == l2.pt2))
{
return true;
}
return false;
}
// if pt1 and pt2 are the same points already m... |
7881f4de357ce919344e2a54b85c81f2cdf2a759 | 83791905a74b72b8c18175916a7e193ddccbd7e0 | /BaymaxMini_1_0/MotorControl.ino | 7b3b740d2b629daa19ed5846845b95c824c2ac68 | [] | no_license | hambone53/baymax_mini_base | 7a3a77ca10427b194f2ede0fb4995d8da23996df | a1a0393bcab4741912ff65555b153dd51445b15d | refs/heads/master | 2020-12-01T04:59:37.448990 | 2017-05-21T02:04:21 | 2017-05-21T02:04:21 | 67,905,314 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,778 | ino | MotorControl.ino | #include <Arduino.h>
/*********************************************************
* Motor control software to drive front end and calculate position and velocity
* information from quad encoders.
*
* By: Ryan Hamor
* Data: 1/5/2016
***********************************************************/
//Includes
#include "Mo... |
652259f92eaed6b14432500c6f1bc9932e6ae3c0 | 447260501e673d85654ff77371ef02806e64fbe9 | /cf/cf#172/B.cpp | aaffbcd347a04927014fc40e91f2e1c7b909a183 | [] | no_license | keroro520/ACM | 2fe36bd70e48c63eef0f1db73fcd244dcc78795d | d538e96f46aebec8c58448f3d936ba81a1643ea3 | refs/heads/master | 2016-09-07T18:54:27.379026 | 2014-05-19T13:44:25 | 2014-05-19T13:44:25 | 18,795,719 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 563 | cpp | B.cpp | /*
WA 不想做了
大体思路是枚举b，算出a，就是细节神马的比较麻烦，不想弄。
*/
#include <stdio.h>
#include <math.h>
int main()
{
int x,y,n;
scanf("%d%d%d", &x, &y, &n);
int demo, nume;
double ans = 9999999.99999;
for(int b = 1; b <= n; b++) {
int a = (int)round(fabs(b * x*1.0 / y-0.000001));
double tmp = fa... |
61d55746a0e386dfbe8ae3c2b59a196249d2e446 | 931209925ff404c20ca2aa9090b0587bd9674aa2 | /lab_processing_arduino/arduino/readval/readval.ino | cbe17e446a185fc6345749e232203cf2e7ea8d9e | [] | no_license | markupartist/arduinolab | de69f0cffd08779e6dd59a21145b3dffe0a4c390 | 41a1b4ff24c6586c301cdda2e1cc16e7503930ac | refs/heads/master | 2021-01-10T07:12:06.592407 | 2014-02-15T15:48:35 | 2014-02-15T15:48:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 607 | ino | readval.ino | // Read a value sent from Processing.
// Use this demo with the Processing app "sendval".
int ledPin = 13;
int val = 0;
void setup() {
startSerial();
pinMode(ledPin, OUTPUT);
}
void loop() {
loopSerial();
// Volume is sent as 0 to 100, we need to map this to 0 to 255.
int brightness = map(val, 0, 100,... |
250c579e4ac4776276357d0f5dd798108525485e | e541d2bc575eb68818c0b2eeeeeabe0de209574f | /src/YouMeCommon/opus-1.1/celt/celt_encoder.cpp | 105280e8f7ef42acc5aec05f5a435e1da14f8212 | [] | no_license | wangscript007/dev | 0d673981718993df0b971a5cd7a262cc217c6d9d | e47da659aadc220883b5e8067b25dc80108876b9 | refs/heads/master | 2022-08-05T00:53:31.844228 | 2020-05-24T05:20:44 | 2020-05-24T05:20:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 76,855 | cpp | celt_encoder.cpp | /* Copyright (c) 2007-2008 CSIRO
Copyright (c) 2007-2010 Xiph.Org Foundation
Copyright (c) 2008 Gregory Maxwell
Written by Jean-Marc Valin and Gregory Maxwell */
/*
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are... |
a0e64a0639db86dd10c5d16841342fe42efe56bf | a34ac1d315fb5916752d0c3e3bdde0fbf876c08d | /testpack/wen/2017.11.9/src/杨宇飞/prime.cpp | 8ba74f020071a192c10188f5181eb23cde01ca7c | [] | no_license | RiverHamster/OI-Works | ae9f7543bb75501552042dc3d4346ff83dfd47df | 7828a21183c49dde173e355a8d20ca7cebb4cd56 | refs/heads/master | 2021-05-14T11:46:57.198588 | 2018-01-06T09:29:35 | 2018-01-06T09:29:35 | 116,372,561 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 734 | cpp | prime.cpp | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int ans=0;
int a[10000];
bool zs(int i)
{
for(int j=2;j<i;j++)
if(i%j==0)
return false;
return true;
}
int biao()
{
int ans=0;
for(int i=2;i<10000;i++)
{
if(zs(i))
{
a[ans]=i;
ans++;
}
}
}
int main()
{
biao();
freopen... |
8f9b7cffe208b449fd85311f405dcf26c6ab3240 | aa6d60423cbbec0c567c97748e130f11559ebbf0 | /player/src/main/jni/compose/mycv.cpp | a7aca50f7e969d97627e80439a417f3d2035daa4 | [] | no_license | weller0/PlayerDemo | d7ea97b4617cd1f05447d8ed6a0c46a19c2e85f6 | 441f16a0b4960156e372c234551180be6ac70e9f | refs/heads/master | 2021-06-18T06:08:40.514813 | 2017-06-20T02:24:43 | 2017-06-20T02:24:43 | 87,904,124 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,186 | cpp | mycv.cpp | /*
* mycv.cpp
*
* Created on: 2017-2-15
* Author: lyz1900
*/
#include"mycv.h"
#define IWSHOW_DEBUG 0
/* 外切法找圆心半径************************************************************************************************/
void Circumscribe(Mat src, //输入 原图
int T, //输入 亮... |
ad11ca5385a79a7e3ac641f95219021748fae6d7 | 81c6ba4a12f30f8adf7d98dcac54bbba864122d2 | /fibsum.cpp | 2a374dd3d863e22f9d86042367e0697d4c1b6907 | [] | no_license | SharmaManish/Spoj | a158881c059e20444e333841549df28169a3be41 | 5342e1c8ed87ef052983cbcc587c371cb876e758 | refs/heads/master | 2021-01-23T06:44:04.635579 | 2013-01-04T06:30:50 | 2013-01-04T06:30:50 | 7,436,084 | 10 | 17 | null | null | null | null | UTF-8 | C++ | false | false | 1,919 | cpp | fibsum.cpp | #include<iostream>
#include<stdio.h>
int main()
{
long long int a[100001];
long long int b[100001];
int t,n,m;
a[0]=0; a[1]=1;
for(int i=2;i<100001;i++)
a[i]=a[i-1]+a[i-2];
b[0]=a[100000]+a[99999];
b[1]=a[100000]+b[0];
for(int i=2;i<100001;i++)
... |
2163c5fd7784889032f4df3c8a0defe455541d10 | ac6b3297e505b2fec2ad465b6260309a00fed914 | /src/trigger_on_load.hpp | 8271dc1cc0f0ad9305bb0eea9c5a745582830ebd | [
"WTFPL",
"BSD-3-Clause"
] | permissive | RagBillySandstone/BogaudioModules | d43836d351b7ff1c7309efaab5cf2b84acacc9c8 | c221b53171a3603e48551f1c8f644e3020b69398 | refs/heads/master | 2020-06-26T01:16:06.427826 | 2019-07-17T02:58:39 | 2019-07-17T02:58:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,024 | hpp | trigger_on_load.hpp | #pragma once
#include "rack.hpp"
using namespace rack;
namespace bogaudio {
struct TriggerOnLoadModule : Module {
bool _triggerOnLoad = true;
bool _shouldTriggerOnLoad = true;
json_t* dataToJson() override;
void dataFromJson(json_t* root) override;
virtual bool shouldTriggerOnNextLoad() = 0;
};
struct Trigg... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.