blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 4 201 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 7 100 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 260
values | visit_date timestamp[us] | revision_date timestamp[us] | committer_date timestamp[us] | github_id int64 11.4k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 17
values | gha_event_created_at timestamp[us] | gha_created_at timestamp[us] | gha_language stringclasses 80
values | src_encoding stringclasses 28
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 8 9.86M | extension stringclasses 52
values | content stringlengths 8 9.86M | authors listlengths 1 1 | author stringlengths 0 119 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a97ad7d1fd4ce8da8027e166a17e62a2e43695d1 | 0d687dfd08842515405a40bef6a8d2720d9d669d | /arduinocode/xy-precision-z-dvddrive-geometron-coin/xy-precision-z-dvddrive-geometron-coin.ino | ff83404788ac6bb2fdbf6aff5bf60d95299369fc | [] | no_license | LafeLabs/trashrobot5 | 437bc63102294d3ef1da5d11ebee463e3269af71 | 4a05d54a38d9acddf8d18efb0422502e05485c53 | refs/heads/master | 2022-05-07T23:52:01.128144 | 2022-04-21T01:25:55 | 2022-04-21T01:25:55 | 221,334,408 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,348 | ino | char coin[] = "GGGGGGGGGGGGGGGEEEEHEEEEEADDDDGGBBBBBBHHHHFAAAAAAADDDHBBFCCCHBFDFDHHFAAAAAAHADDFDBBBBBEEECCCHHHHFFFHAFDDDHAAECCCGAAHADDHBFFFFFHHFAAAAAAAFFFDDDDAAAFFFBBBHFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHFAAAAAAADDDHBBFCCCHBFDFDHHAAAAAHADDFDBBBBFCCCHHHHHFAAAAAAADDDHBBFCCCHHHBBFCCCHHHHHAAAAAHADDFDBBBBFCCCHHHHHEE... | [
"lafelabs@gmail.com"
] | lafelabs@gmail.com |
7845fe0ffde7d37111e566371db25f49ba9ddb83 | 6508210ebef183ddbef9792d99abe8b9b4289e4b | /HuiReversi.h | 0da5d27014389ff3878a7e2f4bf785d90d4dbe5f | [] | no_license | JohnnyXiaoYang/huiReversi | 20ed2e6fd34f58ac85239375e87aa3fc83b3911e | 5b9da91817fe9f00ed1886559c4ea6a7562a4cce | refs/heads/master | 2021-05-30T07:14:28.343502 | 2015-12-30T08:44:57 | 2015-12-30T08:44:57 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,516 | h | // HuiReversi.h : main header file for the HUIREVERSI application
//
#if !defined(_HUIREVERSI_H_INCLUDED_)
#define _HUIREVERSI_H_INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#ifndef __AFXWIN_H__
#error include 'stdafx.h' before including this file for PCH
#endif
#include "reso... | [
"6545823@qq.com"
] | 6545823@qq.com |
2917db7880838ed11fa3032dbb6b537fc208c63e | c887211fe4bf7d838b0db3a6be62470cda8a2dff | /LinkList.cpp | 255a26029339ccb893aa3059452e4f2f1fe92ea2 | [] | no_license | rong5690001/datastructstudy | 383b77229874f427ec315beece1e91275975d594 | 2f30fba42dedd9ed1765066b3150c0d5c8b839d6 | refs/heads/master | 2021-05-17T22:53:33.959889 | 2020-03-29T10:24:21 | 2020-03-29T10:24:21 | 250,989,495 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,168 | cpp | //
// Created by user on 2020/1/30.
//
#include <cstdlib>
#include <iostream>
#include "LinkList.h"
using namespace std;
Status GetElem(LinkList L, int i, ElemType *e) {
int j = 0; /* j为计数器 */
LinkList p; /* 声明一指针p */
p = L->next; /* 让p指向链表L的第1个结点 */
/* p不为空且计数器j还没有等于i时... | [
"chen.huarong@chinaredstar.com"
] | chen.huarong@chinaredstar.com |
527fb4a1e95bea57ba9d3f7583608748685ddba8 | ac1c9fbc1f1019efb19d0a8f3a088e8889f1e83c | /out/release/gen/third_party/blink/renderer/bindings/modules/v8/document_timeline_or_scroll_timeline.h | 71cb77c372c841c9110d0b53f93042ebeb21859d | [
"BSD-3-Clause"
] | permissive | xueqiya/chromium_src | 5d20b4d3a2a0251c063a7fb9952195cda6d29e34 | d4aa7a8f0e07cfaa448fcad8c12b29242a615103 | refs/heads/main | 2022-07-30T03:15:14.818330 | 2021-01-16T16:47:22 | 2021-01-16T16:47:22 | 330,115,551 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,212 | h | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// This file has been auto-generated from the Jinja2 template
// third_party/blink/renderer/bindings/templates/union_container.h.tmpl
// by the script cod... | [
"xueqi@zjmedia.net"
] | xueqi@zjmedia.net |
8c269ced8dc94fbe2d1ffd2bb889638bb7e52fa9 | d9c9095e837a6f22377a89bd8b88e1ba8ac79ca6 | /luogu/P1000 超级玛丽游戏.cpp | acf96fbedc00eecab57c55ccc03e80c65e67b906 | [] | no_license | alexcui03/luogu-test | 3ade46adb43adf50a8f2b40dfde83d399116f0fa | 7614ce64adcf5399181b113bcc571cdc84092f0f | refs/heads/master | 2021-06-28T02:08:33.365736 | 2020-12-02T14:47:01 | 2020-12-02T14:47:01 | 177,288,367 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,332 | cpp | #include <string>
#include <iostream>
std::string prt = "\
********\n\
************\n\
####....#.\n\
#..###.....##....\n\
###.......###### ### ###\n\
........... #...# #...#\n... | [
"cuizhihui030925@outlook.com"
] | cuizhihui030925@outlook.com |
0b083a53c391c33ee6dc94ec8239776a3f5a033f | 0de72d530d147475b478ca2088313a151b1efd4d | /splitgate/core/sdk/sdk/MagicLeapARPin_parameters.h | c319804fae4bce2f657d80a96d1609fd23043d74 | [] | no_license | gamefortech123/splitgate-cheat | aca411678799ea3d316197acbde3ee1775b1ca76 | bf935f5b3c0dfc5d618298e76e474b1c8b3cea4b | refs/heads/master | 2023-07-15T00:56:45.222698 | 2021-08-22T03:26:21 | 2021-08-22T03:26:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,258 | h | #pragma once
#include "..\..\pch.h"
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Parameters
//-----------------------------------------------------------------... | [
"nickmantini01@gmail.com"
] | nickmantini01@gmail.com |
c0a344b1cb7e0ac8b2dc72e3879888549aed234e | 9eb2245869dcc3abd3a28c6064396542869dab60 | /benchspec/CPU/520.omnetpp_r/src/simulator/nedsaxhandler.cc | cd0b1a7008606efe28301373f8d037521d35abbf | [] | no_license | lapnd/CPU2017 | 882b18d50bd88e0a87500484a9d6678143e58582 | 42dac4b76117b1ba4a08e41b54ad9cfd3db50317 | refs/heads/master | 2023-03-23T23:34:58.350363 | 2021-03-24T10:01:03 | 2021-03-24T10:01:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,530 | cc | //==========================================================================
// NEDSAXHANDLER.CC - part of
//
// OMNeT++/OMNEST
// Discrete System Simulation in C++
//
//==========================================================================
/*----------------------------------------... | [
"cuda@hp-arm64-09-02.nvidia.com"
] | cuda@hp-arm64-09-02.nvidia.com |
65b2141e8c9da5d7aeac74a42e2d9905928e16c9 | 5b643ff15ffa0f7f09206dd738cf672fa323a9be | /Query/Query_main.cpp | b3d50eac966897c360fb450c52b47e4754c39b20 | [] | no_license | chenweigis/Querytext | 0fdd24e82ac4bac8006e9929c9fc030e4e46e25e | ac1e452cf061f38a020024b9a12689e69074b3fa | refs/heads/master | 2021-01-19T19:31:26.416345 | 2017-05-07T02:30:32 | 2017-05-07T02:30:32 | 88,421,320 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,725 | cpp | // Query.cpp : 定义控制台应用程序的入口点。
//
/************************************************************************/
/* 需求：文本查询程序
（1）读取一个给定的文件
（2）在文件中查询一个单词，返回单词出现的次数以及所在行的列表（展示单词所在行的内容）
（3）要求如果一个单词在某行出现多次，此行只出现一次，行按照升序排列
*/
/************************************************************************/
/***************************... | [
"chenweigis@163.com"
] | chenweigis@163.com |
09eb042fe7760c68e07985ce567765c42ea310aa | fac932922e8ec9cb03529a7a1d7395b94938a81e | /common/utils/daemon.cpp | 9a40208023b90a0db2ed1d2867b397f969be65b2 | [
"Apache-2.0"
] | permissive | wanhongbo/cargo | f22d63dc935c3585c7051095ead90fc70c0401c9 | a96848e803fe8277c3b21e8c172afa9a99e364d7 | refs/heads/master | 2021-01-15T10:53:56.928644 | 2016-03-09T10:39:48 | 2016-03-09T10:39:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,381 | cpp | /*
* Copyright (c) 2015 Samsung Electronics Co., Ltd All Rights Reserved
*
* Contact: Dariusz Michaluk <d.michaluk@samsung.com>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
... | [
"d.michaluk@samsung.com"
] | d.michaluk@samsung.com |
39b362fac9f565a3100183af5bbbbfdd830c6282 | 6e6fd14fa254a484ddd80aa4ed74002e2b0d6522 | /51NOD刷题/归并函数逆序.cpp | 1fd837b5a3975ec2572e2377211a98b8fbb89261 | [] | no_license | derekzhang79/Algorithm-Training | 852af331b8409bb1520f4aed9e9304d1ae58107c | 7257df097c2f69a68f9478ef29e6c9a9cc3500dc | refs/heads/master | 2020-04-29T14:33:47.490091 | 2018-05-26T11:15:17 | 2018-05-26T11:15:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,299 | cpp | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;... | [
"chenmengyang_2016@hotmail.com"
] | chenmengyang_2016@hotmail.com |
8f8f1c824de27e8e4732e380db1404c62b691619 | 9e90259c170e7c5ff413b83bb10e6ede0cdbb15f | /UtilisationUI/ui_utilisationui.h | 4ef7dc97ee9b1bd3383c1fec86d51ce29ed47758 | [] | no_license | elisangelayumi/Gestion-d-immatriculation-de-vehicules | c3b9089804ba3b0e57d4bf5082281348c08fa55e | 9507091a0c8988eca8037707d76af75fc6777ae5 | refs/heads/master | 2020-12-29T10:12:20.240663 | 2020-02-05T23:40:51 | 2020-02-05T23:40:51 | 238,568,659 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,402 | h | /********************************************************************************
** Form generated from reading UI file 'utilisationui.ui'
**
** Created by: Qt User Interface Compiler version 4.8.7
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
*************************************... | [
"elisangela-yumi.jinno-pinho.1@ulaval.ca"
] | elisangela-yumi.jinno-pinho.1@ulaval.ca |
b84be6397ce78f4a126648050cc0f279c2216737 | 167c8395b592fef9332436e5898303f9a8586c3d | /script/hello.cpp | 43807756b6058596b9dc1e324daadf1a767a746b | [] | no_license | syediu/Udacity-RSE-ND-Project-1-BuildMyWorld | a0a421d8763d5eabbd14b70272d6c148da0d228e | 5aa24a8e3d6626284f4f6ae090c989cd8b7c011a | refs/heads/master | 2022-11-01T02:30:58.034870 | 2020-06-09T16:32:18 | 2020-06-09T16:32:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 379 | cpp | #include <gazebo/gazebo.hh>
namespace gazebo
{
class WorldPluginMyRobot : public WorldPlugin
{
public: WorldPluginMyRobot() : WorldPlugin()
{
printf("Welcome to Our World!\n");
}
public: void Load(physics::WorldPtr _world, sdf::ElementPtr _sdf)
{
... | [
"syedizzatullah@gmail.com"
] | syedizzatullah@gmail.com |
1183b98cfa2ac6038a4ad6650ff9f0ba65877031 | 967085e58cd85996d603ba2e55b0be53309eae80 | /CodeForces/CF1013-D2-E.cpp | 01f9827632897576077279a8356e23d691c9aad2 | [] | no_license | Ahmed-Zaher/CompetitiveProgramming | 4c4f8718251cbf45d73e074664cf856daf67047a | 4531541e03b961a6af70d11a700e106d6e707516 | refs/heads/master | 2021-07-06T23:52:20.258408 | 2021-05-07T23:29:43 | 2021-05-07T23:29:43 | 236,213,267 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,409 | cpp | /*
* We note that:
* 1. We can't have 2 adjacent hills on which we can build houses
* 2. The positions where houses will end up don't need to decrease
* 3. If a position is chosen for a house, we only need to decrease the adjacent hills
* to be at most the height of the current hill - 1
* 4. If 2 houses at posit... | [
"ahmedzaher1080@gmail.com"
] | ahmedzaher1080@gmail.com |
94e988a8610f19dbd4f50e7290d6f77a822f6f33 | 45ab1e397b5fc69ba84c8f5dfb66c09b79bca4c6 | /Course_I/Алгоритмы Python/Part2/семинары/pract5/task21/timeit.cpp | 38a80dd978e916fbce34aa9c5a9ca605b8553756 | [
"WTFPL"
] | permissive | GeorgiyDemo/FA | 926016727afa1ce0ee49e6ca9c9a3c60c755b35f | 9575c43fa01c261ea1ed573df9b5686b5a6f4211 | refs/heads/master | 2023-06-28T00:35:43.166167 | 2023-06-16T14:45:00 | 2023-06-16T14:45:00 | 203,040,913 | 46 | 65 | WTFPL | 2022-04-09T21:16:39 | 2019-08-18T18:19:32 | Jupyter Notebook | UTF-8 | C++ | false | false | 446 | cpp | #include "timeit.h"
#if __cplusplus <= 199711L
void Timer::reset()
{
clock_gettime(CLOCK_REALTIME, &beg_);
}
double Timer::elapsed()
{
clock_gettime(CLOCK_REALTIME, &end_);
return end_.tv_sec - beg_.tv_sec +
(end_.tv_nsec - beg_.tv_nsec) / 1000000000.;
}
#else
void Timer::reset()
{
beg_ = clock_::now... | [
"demenchuk.george@protonmail.com"
] | demenchuk.george@protonmail.com |
96362969b002397936dde32d6b13d154f4642718 | 5bd2afeded6a39311403641533f9a8798582b5c6 | /codeforces/1359/E.cpp | 84efb1c693a0787df0624df75011735bbdd15ee4 | [] | no_license | ShahjalalShohag/ProblemSolving | 19109c35fc1a38b7a895dbc4d95cbb89385b895b | 3df122f13808681506839f81b06d507ae7fc17e0 | refs/heads/master | 2023-02-06T09:28:43.118420 | 2019-01-06T11:09:00 | 2020-12-27T14:35:25 | 323,168,270 | 31 | 16 | null | null | null | null | UTF-8 | C++ | false | false | 3,288 | cpp | #include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 9, mod = 998244353;
template <const int32_t MOD>
struct modint {
int32_t value;
modint() = default;
modint(int32_t value_) : value(value_) {}
inline modint<MOD> operator + (modint<MOD> other) const { int32_t c = this->value + other.value... | [
"shahjalalshohag2014@gmail.com"
] | shahjalalshohag2014@gmail.com |
9a238d16d2c721f0d2452accc6c7b79b9a748cf4 | c2153dcfa8bcf5b6d7f187e5a337b904ad9f91ac | /depends/ClanLib/src/Core/Math/base64_encoder.cpp | 3c2b845a2bd9d25a3240f99d4538941883965057 | [] | no_license | ptrefall/smn6200fluidmechanics | 841541a26023f72aa53d214fe4787ed7f5db88e1 | 77e5f919982116a6cdee59f58ca929313dfbb3f7 | refs/heads/master | 2020-08-09T17:03:59.726027 | 2011-01-13T22:39:03 | 2011-01-13T22:39:03 | 32,448,422 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,912 | cpp | /*
** ClanLib SDK
** Copyright (c) 1997-2010 The ClanLib 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 softwa... | [
"PTrefall@gmail.com@c628178a-a759-096a-d0f3-7c7507b30227"
] | PTrefall@gmail.com@c628178a-a759-096a-d0f3-7c7507b30227 |
ef6b3aa3c11858d75a8aa966759d5a4da70b9f5e | 8d705d8d3fb123cc4ec7e84e52821c5c1883d380 | /ICPC.Regional/2009.Dhaka/4493.cpp | 4b2cc0de26354d6bf4045b1000618ca2d872e50c | [] | no_license | ailyanlu1/ACM-ICPC-OJ-Code | 446ceff5ad94d64391ce4d86bb706023323cb1f1 | 344b2c92f75b428d0241ba732c43de780d08df40 | refs/heads/master | 2020-03-22T21:09:01.656511 | 2015-03-11T00:10:27 | 2015-03-11T00:10:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 674 | cpp | // CII 4493
// 2009 Dhaka: That is Your Queue
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int Q[5000];
int main() {
int ca = 1, n, q, x;
char cmd[3];
while (scanf("%d%d", &n, &q) && n + q) {
printf("Case %d:\n", ca++);
int qh = 2000, qe = 2000, i;
for (i = 1; i <= min(1000, n... | [
"gz.pkkj@gmail.com"
] | gz.pkkj@gmail.com |
927f0a9e3a3ef16f00144bbcb3ca7622aa0f0db9 | 708411bb427239c8bc33bcd019d1c99c60adc572 | /LoliDrive2/solutions/ac.cpp | d5a6e6b32f2ff9f1add042672f84a3d302d48774 | [] | no_license | TNFSH-Programming-Contest/2019NHSPC-TNFSH-Final | 6386a67001696aa027b8e38b3519169ced4a9cd7 | 7c0677cb8193f441c3913d7b30c4b1a1ae014697 | refs/heads/master | 2022-09-30T17:40:15.530620 | 2020-01-30T13:35:51 | 2020-01-30T13:35:51 | 211,501,295 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 691 | cpp | #include<bits/stdc++.h>
#define endl '\n'
using namespace std;
struct Node{
vector<int> to;
long long num;
} tree[1000010];
bool share[1000010];
long long dfs(int id,int p){
if(share[id])return tree[id].num;
long long sum=0,vn=0;
for(int t:tree[id].to){
if(t==p)continue;
sum+=dfs(t,id);
vn++;
}
if(vn==0)r... | [
"lys900829@gmail.com"
] | lys900829@gmail.com |
672eafe18cdd80d9c50c3f08a3afafa59dfd6a7c | 3febdac3fbc009bbf2e5912e55f59efd4dc45a9f | /GamePlay/GameLogicProduct.h | 8b4cd8aaa5d4300f5061cd00149f8f9c115d43a3 | [
"MIT"
] | permissive | TaylorClark/PrimeTime | 95f440451434ded07c5dbd6008f03a3c21fcf66f | 3c62f6c53e0494146a95be1412273de3cf05bcd2 | refs/heads/master | 2021-01-01T17:20:56.420438 | 2017-07-23T01:30:49 | 2017-07-23T01:30:49 | 98,057,599 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,981 | h | //=================================================================================================
/*!
\file GameLogicProduct.h
Game Play Library
Product Mode Game Logic Header
\author Taylor Clark
\date June 22, 2006
This header contains the definition for the product mode game logic manager.
*/
//============... | [
"taylor@taylorclarksoftware.com"
] | taylor@taylorclarksoftware.com |
4d0a9861f40e095575d2ae8fca4d32e0e1f94984 | ce8fd2f2ad50cbf0252ee422a35ff171228cb235 | /TSPSolver/include/TSPRandom.h | b613f9d4b0660bb503a37dc68481e829bf88dceb | [
"MIT"
] | permissive | andreshp/TSPSolver | e85d6bbe1d9d61f9dedc280c9341bff601ab247d | e052111b88833f103342fd43977124e50aedfb0f | refs/heads/master | 2021-01-10T19:24:55.096713 | 2015-06-23T10:39:20 | 2015-06-23T10:39:20 | 31,011,027 | 7 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,520 | h | # ifndef TSPRANDOM_H
# define TSPRANDOM_H
# include "TSPProblema.h"
# include "TSPSolucion.h"
/**
* @brief Clase que contiene los métodos necesarios para calcular solución aleatoria al probema del Viajante de Comercio.
*/
class TSPRandom{
private:
/* DATOS ... | [
"andreshp9@gmail.com"
] | andreshp9@gmail.com |
f94b3c68618d90238bd670849711a5e988231c02 | 89e78209b2557e3b9627876b654200759c2b24dd | /source/virtualmachine.cc | b64202c78977f137d7a0a7c760130e68fe463199 | [] | no_license | ixtli/vm | f4f5f3f7b888ea73e7528700680093b4b55ec70b | c13d83dbfa153ae0ae59c7a7ff465fce63f63750 | refs/heads/master | 2020-04-10T00:02:54.861659 | 2010-12-14T01:29:44 | 2010-12-14T01:29:44 | 931,739 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 37,068 | cc | #include "includes/virtualmachine.h"
#include <errno.h>>
#include <signal.h>
#include <string.h>
#include <iostream>
#include "includes/server.h"
#include "includes/interrupt.h"
#include "includes/mmu.h"
#include "includes/alu.h"
#include "includes/fpu.h"
#include "includes/util.h"
#include "includes/luavm.h"
#includ... | [
"cg@325i.org"
] | cg@325i.org |
61d63cb4f03cfd51bf5b744e3589c1ef665e2f6e | 7c4e5e105e81036c40ea1c6104331b87b78862d2 | /ovs_sdk2.0win/libraries/sonixcamera(20200902)/SNDLL_Demo/SNDLL_DemoDlg.h | 6d43fc735d0e75f98615cc296d6ff6d5151c57e3 | [] | no_license | jameshilliard/MFCOVS | 6f1cecac89f8ffc90e806a72f943a831da3c5402 | 73e6edb08b485201d436f49dafb78eec53670247 | refs/heads/main | 2023-06-26T13:45:13.326719 | 2021-07-24T12:53:33 | 2021-07-24T12:53:33 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,992 | h |
// SNDLL_DemoDlg.h : 头文件
//
#pragma once
#include <functional>
#define SAFE_RELEASE(x) { if (x) x->Release(); x = NULL; }
#define SAFE_DELETE(x) { if (x) delete x; x = NULL; }
#define SAFE_DELETE_ARRAY(x) { if (x) delete []x; x = NULL; }
#include <string>
#include "afxwin.h"
using std::string;
static const GUID PR... | [
"jirenze@hotmail.com"
] | jirenze@hotmail.com |
641174b9a7ff32d6307f1716db4266c79c776ca0 | 2470a4b370ee2790a5e42614cd2328a322d7ae0b | /Lista6/fibonacci.cpp | 90590d16cd4c13ca87b71ebcb8c0c99eda87c4f8 | [] | no_license | silvagal/paa | 55256438b3b4e4bdc5ad4bf413c4e6cafd942180 | 1071bd7a29f14e81b9c659eb0bfd354b292c398c | refs/heads/main | 2023-06-23T02:29:15.739822 | 2021-07-13T11:46:00 | 2021-07-13T11:46:00 | 346,726,890 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 310 | cpp | #include <iostream>
int fibonacci(int n){
int f;
if (n == 0)
return 0;
if (n == 1)
return 1;
f = fibonacci(n - 1) + fibonacci(n - 2);
return f;
}
int main() {
int n = 10;
for (int i = 0; i < n; ++i) {
std::cout << fibonacci(i) << " ";
}
return 0;
} | [
"noreply@github.com"
] | noreply@github.com |
5677ed9ce25d186c7e47d5bb0dbc835147c1b1b7 | 627d4d432c86ad98f669214d9966ae2db1600b31 | /src/scripttools/debugging/qscriptdebuggerjob.cpp | 07c9b4d2200f2c3eeb795ed910e684e11ad9d6dc | [] | no_license | fluxer/copperspice | 6dbab905f71843b8a3f52c844b841cef17f71f3f | 07e7d1315d212a4568589b0ab1bd6c29c06d70a1 | refs/heads/cs-1.1 | 2021-01-17T21:21:54.176319 | 2015-08-26T15:25:29 | 2015-08-26T15:25:29 | 39,802,091 | 6 | 0 | null | 2015-07-27T23:04:01 | 2015-07-27T23:04:00 | null | UTF-8 | C++ | false | false | 2,453 | cpp | /***********************************************************************
*
* Copyright (c) 2012-2015 Barbara Geller
* Copyright (c) 2012-2015 Ansel Sermersheim
* Copyright (c) 2012-2014 Digia Plc and/or its subsidiary(-ies).
* Copyright (c) 2008-2012 Nokia Corporation and/or its subsidiary(-ies).
* All rights reserved.... | [
"ansel@copperspice.com"
] | ansel@copperspice.com |
384193896ab11392267baf873563a43a960516b4 | 38c10c01007624cd2056884f25e0d6ab85442194 | /ui/message_center/notification_list.h | 7b49994dd483c0397d0dd3b6eea53428d5fc0a34 | [
"BSD-3-Clause"
] | permissive | zenoalbisser/chromium | 6ecf37b6c030c84f1b26282bc4ef95769c62a9b2 | e71f21b9b4b9b839f5093301974a45545dad2691 | refs/heads/master | 2022-12-25T14:23:18.568575 | 2016-07-14T21:49:52 | 2016-07-23T08:02:51 | 63,980,627 | 0 | 2 | BSD-3-Clause | 2022-12-12T12:43:41 | 2016-07-22T20:14:04 | null | UTF-8 | C++ | false | false | 5,807 | h | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef UI_MESSAGE_CENTER_NOTIFICATION_LIST_H_
#define UI_MESSAGE_CENTER_NOTIFICATION_LIST_H_
#include <list>
#include <set>
#include <string>
#incl... | [
"zeno.albisser@hemispherian.com"
] | zeno.albisser@hemispherian.com |
119cf1b488fc19ca15acf801bac84b6881fc64cb | 1203c8aa543696764e6dab9ead5f3b69fe1bd318 | /draemcia/Task_Field.h | 4c965ebd79fdf4612d0da845fe8e985ed5fc611d | [] | no_license | feveleK5563/draemcia | 4d929f6350df3d15605f04122251b6805f4004b6 | 6b276132a81bbaed0872bba8dae3654eddbfc4a7 | refs/heads/master | 2021-09-03T15:59:17.179175 | 2018-01-10T08:25:39 | 2018-01-10T08:25:39 | 114,894,741 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 1,927 | h | #pragma warning(disable:4996)
#pragma once
//-------------------------------------------------------------------
//
//-------------------------------------------------------------------
#include "GameEngine_Ver3_7.h"
namespace Field
{
//タスクに割り当てるグループ名と固有名
const string defGroupName("フィールド"); //グループ名
const string... | [
"buncha102828@gmail.com"
] | buncha102828@gmail.com |
5d78e8914fe78667da4aef160cfb09baf6aba990 | 3cb55fcec0c65f340df5f71b56bd886797bef567 | /dcc/src/ir/IrCommon.cpp | 3a5d5a2a9c736459d74f9dc4e2a68ab44b41cf92 | [] | no_license | rweyrauch/Compiler | ba3acec94d192d3ec59582bf187a54245b17da9a | 9abd541313504aae9b4ed27c6b4e578e9fc476ea | refs/heads/master | 2020-05-20T01:37:07.483902 | 2016-04-22T14:42:44 | 2016-04-22T14:42:44 | 185,315,003 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,133 | cpp | //
// The MIT License (MIT)
//
// Copyright (c) 2015 Rick Weyrauch (rpweyrauch@gmail.com)
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitati... | [
"rpweyrauch@gmail.com"
] | rpweyrauch@gmail.com |
b5de6e78f63e9f1f0b7f5a5973766e59859ce685 | 86b503314c1984a7ad83dae62dd8565fb79f4741 | /Nhapxuatfile/bai5.cpp | 7dc960f8b2390834acebc9b3f6be1461e54e8acf | [] | no_license | 20021423/on-basic-bec-17 | 9b61b63a65e967cfde816b0deea724e922ce44af | b6716079023aed5bd37c78ccb8f98228e00d6360 | refs/heads/main | 2023-09-01T08:39:14.547293 | 2021-10-18T12:01:31 | 2021-10-18T12:01:31 | 350,401,371 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 827 | cpp | #include<iostream>
#include<cmath>
using namespace std;
int giaithua(int n)
{ int tich = 1;
for (int i = 1; i <=n; i++)
{
tich = tich* i;
}
return tich;
}
int main(){
int n, k, C;
int x ;
do
{
cin >> n >> k;
if(n <= 0 || k <= 0 )
{
cout ... | [
"80799030+20021423@users.noreply.github.com"
] | 80799030+20021423@users.noreply.github.com |
1e0c2894967c092d0f4e3cda62dd98180178312c | 4db165b7859b4db00b3a6bbe174ad286f9b23813 | /C++ Tasks/A12P8/Square.h | 1ee5406c7a58671c440cb4c445bfc83bbb6b6b78 | [] | no_license | osobiehl/C-and-C- | 1461d947fe5375cf05d546699e76b5deb9fc20b9 | 69a934a62052ca8541339eaa5092a697e8205c87 | refs/heads/master | 2022-12-16T11:33:15.357872 | 2020-09-10T14:44:59 | 2020-09-10T14:44:59 | 294,438,857 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 202 | h | #include "Rectangle.h"
class Square : public Rectangle{
public:
Square(const char *n, double a);
~Square(){}
double calcArea() const;
double calcPerimeter() const;
private:
double side;
};
| [
"osobiehl@me.com"
] | osobiehl@me.com |
63b39040df9ea0abd73b6820cafa9b356311fcf5 | aff5c16fa27944171c764b33b7f681143d0db1ed | /UVa/Emoogle_Balance.cpp | d026398c052bf146fd7ab1cd6ebc8a2847e4dc3a | [] | no_license | sahirboghani/Code | 3de61acd539dbaffa554e709f7f0db60e9893f32 | a108850fb1387a7fb4a24819acbe9bb00bdd2794 | refs/heads/master | 2016-09-06T00:22:09.268272 | 2015-10-13T21:51:37 | 2015-10-13T21:51:37 | 38,544,450 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 295 | cpp | #include <stdio.h>
int main() {
int N = 1, n = 0, Emoogle = 0, temp;
while(true) {
scanf("%i", &N);
if(N == 0)
return 0;
Emoogle = 0;
while(N--) {
scanf("%i", &temp);
Emoogle = temp == 0 ? Emoogle-1 : Emoogle+1;
}
printf("Case %i: %i\n", ++n, Emoogle);
}
return 0;
} | [
"sahirboghani@gmail.com"
] | sahirboghani@gmail.com |
f40d664e5c8be680d319e6e4c79c0bab5ec0a53d | 80149474d446df105af08a50310ac2acb3c55df5 | /1609_Team1/1609_Team1/InputManager.h | 1252ae21172ab8935a56daf157531da2e18ae0c8 | [] | no_license | LimCHBunkerDefense/BunkerDefense | 39f6ac90594bc40af0d16ec8c8aa91cf25d9bea7 | c929e41a8322fca35da94b7d6bea28dc3068acb8 | refs/heads/master | 2021-01-09T05:29:38.862838 | 2017-02-20T04:25:40 | 2017-02-20T04:25:40 | 80,777,212 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,251 | h | #pragma once
#include "Singleton.h"
#include "Common.h"
#include <Windows.h>
#define INPUT InputManager::Instance()
class InputManager : public Singleton<InputManager>
{
HWND m_hWnd;
KEY_STATE m_keyStates[KEY_COUNT];
MOUSE_STATE m_mouseStates[MOUSE_COUNT];
POINT m_mousePrevPos;
POINT m_mouseCurrentPos;
POINT m... | [
"gnwmapf@naver.com"
] | gnwmapf@naver.com |
ab8e4491c784245e0c8598eecfc868d986edde1f | f67b83eaea2999c89bab8819ec252ec4f2e21884 | /interface/Producers/TagAndProbePairProducer.h | 0cd05418847a0941813a78d3e0406b39cca36529 | [] | no_license | KIT-CMS/KITHiggsToTauTau | c2ef71b5e25ec9c2734c754939c03486a44548c1 | 140415158182562432715c38f783ba3dd5a5a3ce | refs/heads/reduced_trigger_objects | 2021-12-22T17:20:00.221747 | 2021-12-17T14:14:06 | 2021-12-17T14:14:06 | 99,792,165 | 1 | 7 | null | 2021-05-25T06:25:07 | 2017-08-09T09:45:59 | Python | UTF-8 | C++ | false | false | 17,341 | h | #pragma once
#include "../HttTypes.h"
#include <boost/algorithm/string.hpp>
#include <boost/algorithm/string/trim.hpp>
class TagAndProbeMuonPairProducer: public ProducerBase<HttTypes> {
public:
typedef typename HttTypes::event_type event_type;
typedef typename HttTypes::product_type product_type;
... | [
"sebastian.wozniewski@student.kit.edu"
] | sebastian.wozniewski@student.kit.edu |
f31cbba93d374e525422aeb799b9b52192523a06 | ec8f6238a89045c4420b19fe662abc8754a33ead | /luogu/1897.cpp | 1b9e4021e509819b9390c41e00b38dc8c8286b0d | [] | no_license | hajbw/OICodeStorage | 9fe4748a13ec799aed8c21f67c576f8cfd47d3c6 | c4c1bbee4c2e0d5c5af792ce6cfb42a7ef5294b0 | refs/heads/master | 2021-07-23T22:51:23.816998 | 2018-11-09T13:58:34 | 2018-11-09T13:58:34 | 113,634,410 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 291 | cpp | #include <iostream>
using std::cin;
int main()
{
int* men;
int amount_of_men,result;
cin>>amount_of_men;
men = new int[amount_of_men];
for(int i = 0;i < amount_of_men;++i)
{
cin>>men[i];
}
std::cout<<result<<std::endl;
return 0;
} | [
"hajbw10@126.com"
] | hajbw10@126.com |
3f6ee3daeccbc0503af31c54d0b16396edab700a | 5c5fd0651610eba8615fbd1452a8aa9b86f023fc | /src/draw.cpp | 44a65d29a6f2743e67ba23e7d921d98a0e41fd69 | [] | no_license | Grinshpon/Feldunor-old- | 4d42603fccbb87d4a1c9cc70180c9370ca5ad860 | a4c0b18cbad281d2c63efb3aadfe8278f4e24bc2 | refs/heads/master | 2021-10-28T01:09:56.894197 | 2019-04-21T06:52:11 | 2019-04-21T06:52:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,072 | cpp | //all ncurses code to draw the game goes here
#include<ncurses.h>
#include<iostream>
#include<vector>
using std::string;
using std::vector;
int MAXROWS;
int MAXCOLS;
int clearScreen() {
//printf("\033[H\033[J");
clear();
return 0;
}
int initScreen() {
initscr();
cbreak();
noecho();
clear();
MAXROWS =... | [
"noreply@github.com"
] | noreply@github.com |
cfafc4af36878462e7eba765a54ca3a311c4d644 | c69e81086606a72d5fb43f0ca084513661d64f3e | /lib/lazybox/lazybox.h | c2a53688f9ef3e1edcbccc6bd2719744d724f0d9 | [] | no_license | fulf/lazybox | a5de0e86f2054609fd661b84b017a355b788e5c1 | d35c470d6d330837def027330b85f498f0496dc9 | refs/heads/master | 2020-03-16T23:08:23.895253 | 2018-10-12T16:08:32 | 2018-10-12T16:08:32 | 133,066,680 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 447 | h | #ifndef LAZYBOX_H
#define LAZYBOX_H
#include <Arduino.h>
#include <ESP8266WiFi.h>
#include <lazybox-webserver.h>
#include <lazybox-poller.h>
#include <map>
class LazyBox
{
private:
LazyBoxCore* _core;
LazyBoxWebServer* _web_server;
LazyBoxPoller* _poller;
std::map<const char*, LazyBoxPin> _pins;
... | [
"sorin.guga@gmail.com"
] | sorin.guga@gmail.com |
4811be62695715103cc675df8eb578f5e685d12c | a689db842a1a451d75612d2768e47786ba4d5af6 | /프로그래머스/프로그래머스_신규아이디추천.cpp | 164e1bc873ae7f5f33202797b2c0b39f1d4e8092 | [] | no_license | LeeYunSung/Algorithm | 3f3deea64629f1e250e73cf6d7762a55b6f8c447 | d37991da94ebcd9e368ee537429b0f60f016229a | refs/heads/master | 2023-08-18T19:23:42.392862 | 2023-08-12T15:40:12 | 2023-08-12T15:40:12 | 175,958,029 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 1,660 | cpp | #include <iostream>
#include <string>
#include <cctype>
#include <vector>
using namespace std;
int main() {
string id = "";
cin >> id;
cout << solution(id);
}
string solution(string id) {
string new_id = "";
//1단계: 대문자->소문자로 변환
for (int i = 0; i < id.size(); i++) {
id[i] = tolower(id[i]);
}
//2단계: ~!@#$%^&... | [
"dldbstjd6350@naver.com"
] | dldbstjd6350@naver.com |
0a50d49b5261c11c4e9e73493137e994c28a1009 | 334815c36b3c22211b9e98a4e197f71082930a48 | /Source/DataServer/Header Files/Database.h | 585a7a49bea3409901589e0ac0158e27f9a08857 | [] | no_license | sonnickoo/mu-server-ex | 3e8c181acc7ce1aa3e2bce3a9dd99cde500d580e | bfb5e089de504fef83bca8bed5e14cc5abb97100 | refs/heads/master | 2021-01-19T00:43:16.625249 | 2015-09-14T13:10:37 | 2015-09-14T13:10:37 | 42,448,734 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,235 | h | #ifndef _DATABASE_H_
#define _DATABASE_H_
#include "StdAfx.H"
#include "Database.H"
#include "LogProc.H"
class CDataBase
{
public:
CDataBase();
virtual ~CDataBase();
// ----
bool Initialize();
bool Connect(const char * szHost, const char * szDataBase, const char * szUser, const char * szPasswor... | [
"krisis521@inbox.lv"
] | krisis521@inbox.lv |
49110c84dcdff9d2fd12aec5775e00ed441d8159 | 90047daeb462598a924d76ddf4288e832e86417c | /media/blink/webmediaplayer_params.cc | 3cd835f5dc536aa25393a484efbb118fabc4404c | [
"BSD-3-Clause"
] | permissive | massbrowser/android | 99b8c21fa4552a13c06bbedd0f9c88dd4a4ad080 | a9c4371682c9443d6e1d66005d4db61a24a9617c | refs/heads/master | 2022-11-04T21:15:50.656802 | 2017-06-08T12:31:39 | 2017-06-08T12:31:39 | 93,747,579 | 2 | 2 | BSD-3-Clause | 2022-10-31T10:34:25 | 2017-06-08T12:36:07 | null | UTF-8 | C++ | false | false | 2,257 | cc | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "media/blink/webmediaplayer_params.h"
#include "base/single_thread_task_runner.h"
#include "base/task_runner.h"
#include "media/base/audio_rende... | [
"xElvis89x@gmail.com"
] | xElvis89x@gmail.com |
b239c35a8ffc6408d9b3492ff48da0a52c74b818 | c5926d298295d62cb1571bb21cc2ce164b38babd | /src/qt/bitcoingui.cpp | e8e22c7b75799698b43638d6f84376254f9493a4 | [
"MIT"
] | permissive | MasternodeXchange/MNXCV2 | 59c1702c482ab74747faacb3b9e58d12c8d063cc | df8c1999b354bc4673b729447ea56ee95a09482d | refs/heads/master | 2021-09-03T05:05:44.018429 | 2018-01-05T20:59:45 | 2018-01-05T20:59:45 | 116,422,346 | 2 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 47,865 | cpp | /*
* Qt4 bitcoin GUI.
*
* W.J. van der Laan 2011-2012
* The Bitcoin Developers 2011-2012
*/
#include <QApplication>
#include "bitcoingui.h"
#include "transactiontablemodel.h"
#include "addressbookpage.h"
#include "sendcoinsdialog.h"
#include "signverifymessagedialog.h"
#include "optionsdialog.h"
#include "about... | [
"mnxchane@gmail.com"
] | mnxchane@gmail.com |
5e91107b3cc3f3ef50874ae2d279a53d8aa1d8d0 | 7e206171aff10918b71adf2ed7c85d68558d6b39 | /examples/ME/W_4j/P0_Sigma_sm_ds_mumvmxusssx_W_4j.cc | 6aa5029b39e32cb26c9725cc9ac1f21b3308ba48 | [] | no_license | matt-komm/momenta | 934d62f407abcce25e7c813c0ae9002d308f09cf | c52c63fad5ab38dc54e71636f3182d5fbcd308bc | refs/heads/master | 2021-01-01T05:31:11.499532 | 2014-04-01T20:01:29 | 2014-04-01T20:01:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,475 | cc | //==========================================================================
// This file has been automatically generated for C++ Standalone by
// MadGraph 5 v. 2.0.0.beta3, 2013-02-14
// By the MadGraph Development Team
// Please visit us at https://launchpad.net/madgraph5
//==========================================... | [
"Matthias.Komm@cern.ch"
] | Matthias.Komm@cern.ch |
783d054229a3be63c9755ba1c5e37759cb5781b8 | d45993f95238e4d56a9b6ad2294db40ad1aee799 | /eclipse-plugins/edu.wpi.first.wpilib.plugins.cpp/resources/templates/examples/PotentiometerPID/src/Robot.cpp | 14a6d31abead097cb0dae8a596978fd5a3c1d899 | [] | no_license | Talos4757/allwpilib | d47d0aa71ae6ccc685029f9193d13ad420fe90d9 | f0e3bb51642acae7e7a002c0072538dd94743432 | refs/heads/master | 2021-01-16T18:02:13.606677 | 2015-07-15T00:01:42 | 2015-07-30T15:55:28 | 40,710,547 | 1 | 0 | null | 2015-08-14T10:52:26 | 2015-08-14T10:52:25 | null | UTF-8 | C++ | false | false | 2,710 | cpp | #include "WPILib.h"
/**
* This is a sample program to demonstrate how to use a soft potentiometer and a PID
* Controller to reach and maintain position setpoints on an elevator mechanism.
*
* WARNING: While it may look like a good choice to use for your code if you're inexperienced,
* don't. Unless you know wha... | [
"jagresta2@gmail.com"
] | jagresta2@gmail.com |
6e449d413682a6c2b21a0fece5656600761af5ae | 7380cbd4efa56bfc3aa63d373916d98b2f205a5e | /w1_shaper_fireflies copy/src/Firefly.h | b65955529c38a9e08b3443ad0abb7f79af1fdfcd | [] | no_license | friej715/jane_algo2012 | 3ecf7fd028f4ffa6b3dc3262ac86d26449403ea8 | a9bd5284499b1360d02a6aa933491e1243ba54c8 | refs/heads/master | 2016-09-06T16:23:00.441598 | 2012-12-18T20:07:51 | 2012-12-18T20:07:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 756 | h | //
// Firefly.h
// emptyExample
//
// Created by Jane Friedhoff on 9/15/12.
// Copyright (c) 2012 __MyCompanyName__. All rights reserved.
//
#ifndef emptyExample_Firefly_h
#define emptyExample_Firefly_h
#include "ofMain.h"
class Firefly {
public:
ofPoint pos;
ofColor col;
int w;
int h;
... | [
"friej715@newschool.edu"
] | friej715@newschool.edu |
b4b2855cc7594bbb15889e6025c51ecd4828a747 | 75ad6ead84fe8e853c4431458fcb165559fe3e1c | /QuanLiCanBo.h | d1113423ab6c190e171f295ba487b5f8def6f8d5 | [] | no_license | ScraggyDuck/OOP-Officer | e89381447be4e242dcf77ca80a14c1c8272f3ffc | c4f146119244f34d6ca5f2d53b11547b5a6c2665 | refs/heads/master | 2020-05-30T11:04:01.641584 | 2019-06-01T05:54:57 | 2019-06-01T05:54:57 | 189,689,862 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 271 | h | #pragma once
#include "GiangVien.h"
#include "NhanVienHanhChinh.h"
#include <vector>
class QuanLiCanBo
{
private:
vector<CanBo*> list;
public:
QuanLiCanBo();
~QuanLiCanBo();
void menu();
void nhap();
void xuat();
int tongLuong();
void canBoLuongThapNhat();
};
| [
"Quocvietcoi2000@gmail.com"
] | Quocvietcoi2000@gmail.com |
cbaa5fa4b279bf37e45e39256ccc921f5e7ee959 | e3e314f0d3d45fd98784f7aa9fc108a31b8e9ff9 | /server/router.h | c7a6f1255cae63663f95a9ba6b621006bb50ebf6 | [] | no_license | anhptvolga/a2stp | 63c35c6ab8a1601d2009d810a86ff011febf4868 | 44be22dadd0fabcc01b6661f6d74fbe60481ce14 | refs/heads/master | 2021-01-16T00:49:53.361814 | 2017-08-17T01:13:42 | 2017-08-17T01:13:42 | 99,983,440 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 320 | h | #ifndef __router_h__
#define __router_h__
#include <iostream>
#include <fstream>
#include <string>
#include <ctime>
#include <utility>
#include "bitlib/bitlib.h"
#include "utils/su.h"
#include "utils/const.h"
#include "validator.h"
/**
* route message
*/
void route_message(signal_unit signal, time_t time);
#endif
| [
"anhptvolga@yandex.ru"
] | anhptvolga@yandex.ru |
b472fb39ef64700120dc1a7113d0ce62a8e60260 | 0cb85cd0c88a9b9f0cca4472742c2bf9febef2d8 | /ParentalControl/UrlFlt/task.h | f135d26c0bff2bc845305c566acc978b1f7a59ed | [] | no_license | seth1002/antivirus-1 | 9dfbadc68e16e51f141ac8b3bb283c1d25792572 | 3752a3b20e1a8390f0889f6192ee6b851e99e8a4 | refs/heads/master | 2020-07-15T00:30:19.131934 | 2016-07-21T13:59:11 | 2016-07-21T13:59:11 | null | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 19,424 | h | // AVP Prague stamp begin( Interface header, )
// -------- ANSI C++ Code Generator 1.0 --------
// -------- Wednesday, 04 April 2007, 19:51 --------
// -------------------------------------------
// Copyright © Kaspersky Lab 1996-2006.
// -------------------------------------------
// Project -- Kaspersky ... | [
"idrez.mochamad@gmail.com"
] | idrez.mochamad@gmail.com |
37e1c80c487142dd7f63b2f2f9a55b8f96b42db1 | d99ab6e8586f76c6e6bdec1b2fba73e7d892f5e8 | /STL/bitset.cpp | df3136a6f9e61ac00eb111ee600eac27c3ead124 | [] | no_license | jindalshivam09/cppcodes | 661d368c77793a0c8170397711c1eec9eeff1e27 | c2913c4d3e144de7a0a60749b675e2f661d5b07b | refs/heads/master | 2021-05-16T02:39:47.452998 | 2020-07-26T18:45:42 | 2020-07-26T18:45:42 | 23,185,118 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 315 | cpp | #include<iostream>
#include<bitset>
using namespace std;
main() {
bitset<8> b(string("10011"));
cout << b.to_ulong() << endl;
cout << b.to_string() << endl;
cout << boolalpha << b.any();
cout << endl;
bitset<8> v = b <<1;
cout << v << endl;
//b <<= 1;
cout << b << endl;
b=b|v;
cout << b << endl;
}
| [
"jindalshivam09@gmail.com"
] | jindalshivam09@gmail.com |
9b91eac6a1b5c7c2596ae0ce68a92d42923e7e5f | 80b70f2b7fc6898f49049810781c6afda00868c7 | /No Category/Medium/Triple-Sum.cpp | 6e90fb4a173cc6a0d97d0eef654fb82b22381bf5 | [
"MIT"
] | permissive | Justin-Teng/HackerRank | b41552a35c611fa6b1687ade5b21d4afb8007d59 | bb501715d4fb0322ccffa70b75c4d6df1463a334 | refs/heads/master | 2020-03-25T00:47:38.140314 | 2019-06-13T15:24:33 | 2019-06-13T15:24:33 | 143,206,178 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,919 | cpp | #include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Complete the triplets function below.
long triplets(vector<int> a, vector<int> b, vector<int> c) {
sort(a.begin(), a.end());
sort(b.begin(), b.end());
sort(c.begin(), c.end());
// Remove duplicates
a.erase(uniq... | [
"noreply@github.com"
] | noreply@github.com |
dcce6afe8b49215f01e4268d9194bcbf57a6e8fa | 5fe634e7327f5f62bcafa356e76d46f07b794b36 | /CPPPrimer/src/06-function/6-1.cpp | fc8a1973811419e454da6e0ce6fcdfa790a2b985 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | MarsonShine/Books | 8433bc1a5757e6d85e9cd649347926cfac59af08 | 7265c8a6226408ae687c796f604b35320926ed79 | refs/heads/master | 2023-08-31T05:32:35.202491 | 2023-08-30T10:29:26 | 2023-08-30T10:29:26 | 131,323,678 | 29 | 3 | Apache-2.0 | 2022-12-07T13:01:31 | 2018-04-27T17:00:17 | C# | UTF-8 | C++ | false | false | 1,310 | cpp | #include<stdio.h>
#include<iostream>
// 局部静态变量
// 其生命周期是跟随程序的终止而结束（销毁）
size_t count_calls() {
static size_t ctr = 0;
return ++ctr;
}
size_t count_calls2() {
size_t ctr = 0;
return ++ctr;
}
// 函数申明
// 与函数定义不同，函数申明只需要定义名称和签名，无需函数体。
// 一般是在头文件.h中函数申明，这样能确保同一函数名一致。
// 详见 ./head/example.h
// 分离式编译（separat... | [
"ms27946@outlook.com"
] | ms27946@outlook.com |
24912d6f810e7fdc99cbb94c7d894bfa9f07db95 | 4ff5cb35b392e8f17d99c2f395fc054b583b7b6c | /multipleFiles/multipleFiles.ino | 0f1ce39bb01f967fc70f30adabc015c8aae0ea60 | [] | no_license | brjathu/arduino_codes | f07518ce16cb358a3d0f7ed6e2874e122198f6e8 | f6ae7e20918a645282137e38b04982c3515b0695 | refs/heads/master | 2021-07-09T14:50:58.047403 | 2017-10-10T07:41:20 | 2017-10-10T07:41:20 | 106,384,433 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 191 | ino | #include "support.h"
int x=5;
void setup() {
// put your setup code here, to run once:
Serial.begin(9600);
}
void loop() {
// put your main code here, to run repeatedly:
printFun();
}
| [
"brjathu@gmail.com"
] | brjathu@gmail.com |
8d4002157c8a1a42a714a92a46ced5345c204e23 | 068505e9db9c96e2bb5768cf503fd5a0308e2c79 | /CrackingTheCodingInterview/Version6/LinkedLists/PalindromeList.cpp | d43652811295f66dffe62f17761df6dfe214bd41 | [
"MIT"
] | permissive | naruse/challenges | 1cdbf31a33a57e0de1f99f918c560619176b2ecc | 52baab6c5ad95c4774f737034073149efa3fa613 | refs/heads/master | 2021-05-06T21:40:06.265852 | 2020-07-23T20:03:13 | 2020-07-23T20:03:13 | 112,553,120 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,096 | cpp | // Implement a function to check if a linked list is a palindrome.
//APPROACH:
//have 2 pointers one move 1 node the other moves 2 nodes each time and start
//storing values on a stack for the 1rst node. When the 2nd pointer reaches
//the end start popping from the stack and compare.
#include <iostream>
#include <st... | [
"naruse@gmail.com"
] | naruse@gmail.com |
38e82f9b6344c821e844309ce642dccc583cc8ea | 63b780d4f90e6c7c051d516bf380f596809161a1 | /FreeEarthSDK/src/FeKits/cockPit/meter/MeterManager.cpp | c20527a2fb7dbb4005293f502f4772e8634b9b72 | [] | no_license | hewuhun/OSG | 44f4a0665b4a20756303be21e71f0e026e384486 | cfea9a84711ed29c0ca0d0bfec633ec41d8b8cec | refs/heads/master | 2022-09-05T00:44:54.244525 | 2020-05-26T14:44:03 | 2020-05-26T14:44:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,622 | cpp | #include <FeKits/cockPit/meter/MeterManager.h>
#include <cstring>
CMeterManager::CMeterManager(void) :
FeUtil::TiXmlDocument()
{
}
CMeterManager::CMeterManager( const char* cDocumentName ) :
FeUtil::TiXmlDocument(cDocumentName)
{
if (LoadFile(cDocumentName))
{
InitializeMeters();
}
}
CMeterManager::~CMeterMan... | [
"Wang_123456"
] | Wang_123456 |
61271f2ad590e49ec4726a08880e02be66129e08 | ba929abc82b0553dfd6b624407fd6f1e02108b50 | /Matrice/include/Matrice/algs/similarity/_icgn_impl.h | 895932f8977db40978947dbbef51f3e6f9784da1 | [] | no_license | sdongem/matrice_preview | d8d5b02a82694249bec58bbfa2b84be82061cb17 | 6c41e1be9484c54e9998aba8126b341cb9da09d5 | refs/heads/master | 2020-04-08T04:40:48.898925 | 2018-11-25T07:52:36 | 2018-11-25T07:52:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,396 | h | /*********************************************************************
This file is part of Matrice, an effcient and elegant C++ library.
Copyright(C) 2018, Zhilong(Dgelom) Su, all rights reserved.
This program is free software : you can redistribute it and/or modify
it under the terms of the GNU General Public Licens... | [
"su-zl@seu.edu.cn"
] | su-zl@seu.edu.cn |
35acb1074ed0440b0dcc9209e8b4467095a0dfbc | d91272f7ce1549b1e08f4d7dd05ecc2ce85bab96 | /841/B.cpp | b5445f754776d98357798079d9d67de20f653a0b | [] | no_license | Ar-Sibi/Competitive-Programming | 81672229d870763292b2e010b62b899952bdc6dc | df4ed257140909755d8b639649e19c325f4619f6 | refs/heads/master | 2022-04-16T13:31:26.989506 | 2020-04-12T16:24:46 | 2020-04-12T16:24:46 | 159,475,953 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 445 | cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio( false );
int x;
long long sum=0;
cin>>x;
bool oddpresent = false;
while(x--){
int y;
cin>>y;
if(y%2==1)
oddpresent=true;
sum+=y;
}
if(sum%2==0){... | [
"getgoingwithsibi@gmail.com"
] | getgoingwithsibi@gmail.com |
6ba15e2d73462aec61b7f4d723728f4c9dd11931 | 21d31bd5be404b5507b5b06c7cd1c2a961589891 | /dmaps/diffusion_map.cpp | d4f7d20d77ce614a1d7d10ce7f82ff07c2cacf91 | [
"MIT"
] | permissive | Markusjsommer/dmaps | 7448f2a11404a2da12027112737599575ffb32e6 | e260724727cc14423b7ef09975649e274c004fc0 | refs/heads/master | 2020-04-26T05:46:33.112065 | 2018-08-28T17:42:40 | 2018-08-28T17:42:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,434 | cpp | #include <stdexcept>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <Eigen/Core>
#include <spectra/GenEigsSolver.h>
#include "diffusion_map.h"
#include "distance_matrix.h"
#ifdef _OPENMP
#include <omp.h>
#endif
using namespace Spectra;
namespace dmaps
{
diffusion_map::diffus... | [
"sidky@outlook.com"
] | sidky@outlook.com |
d10bde1b6a492d06b5b86bc59939a162e96cebfc | 003d8fea3077ede86e4785411424a5acf622252f | /example/txpl/vm/scope1.cpp | edb0f0d91dac8189a184cac6f181b525ba22f843 | [
"BSL-1.0"
] | permissive | ptomulik/txpl | c43f961f160dcdee968fc214b5196b934a4ca514 | 109b5847abe0d46c598ada46f411f98ebe8dc4c8 | refs/heads/master | 2021-06-20T02:01:54.072229 | 2015-05-19T07:14:38 | 2015-05-19T07:14:38 | 31,542,106 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,444 | cpp | // Copyright (C) 2015, Pawel Tomulik <ptomulik@meil.pw.edu.pl>
//
// 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)
/** // doc: txpl/vm/scope1.cpp {{{
* \file txpl/vm/scope1.cpp
* \example txpl/vm/scope1.cpp
*... | [
"ptomulik@meil.pw.edu.pl"
] | ptomulik@meil.pw.edu.pl |
901a421feb8ddb3566a32394ef2b35e37d06e202 | 76d02d9f63c90f36a74f0c9fb2ee00d7838001c2 | /src/ias/network/util.h | 2c1f0e2955f87aee9059a1833f57e1d68d8bb119 | [
"Apache-2.0"
] | permissive | JoeriHermans/Intelligent-Automation-System | 7630d33922fbef87ee3a673282da0b7809643c19 | b09c9f2b0c018ac5d12ab01d25297a0a92724e4c | refs/heads/master | 2020-12-20T07:42:22.062147 | 2016-04-12T09:31:39 | 2016-04-12T09:31:39 | 22,039,895 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 3,145 | h | /**
* A set of network utility functions.
*
* @date December 13, 2014
* @author Joeri HERMANS
* @version 0.1
*
* Copyright 2014 Joeri HERMANS
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance... | [
"joeri@joerihermans.com"
] | joeri@joerihermans.com |
690b0a0a97aef2c1e688b9a2cc9d2ce101333699 | 27f401a4b87f164e11c881251121084762c60ee6 | /DataStructures/Model/Structures/Linear/Array.hpp | ee7116b98076e3035c1b4e48bada21bab1390d00 | [] | no_license | brandonwreich/DataStructures | 7ce08e92b8353926818da13dd939e606471c98d1 | 288e6588c9cd33c2bd1d126cee0586251ce5fef5 | refs/heads/master | 2021-05-08T23:11:07.753884 | 2018-05-29T14:53:08 | 2018-05-29T14:53:08 | 119,700,122 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,896 | hpp | //
// Array.hpp
// DataStructures
//
// Created by Reich, Brandon on 2/2/18.
// Copyright © 2018 CTEC. All rights reserved.
//
#ifndef Array_hpp
#define Array_hpp
#include <assert.h>
#include <iostream>
using namespace std;
template <class Type>
class Array
{
private:
Type * internalArray;
int size;
pub... | [
"31513789+brandonwreich@users.noreply.github.com"
] | 31513789+brandonwreich@users.noreply.github.com |
232913d01d432668ff62c8f640d3c8de2511a115 | 911ac8c14ca8cb114fad7b24a5b39616d89e540b | /week-01/day-04/Increment element/main.cpp | c247ac051cb78aac8bb8522722d4dd99fd071a3e | [] | no_license | green-fox-academy/Hordon13 | 2dc9a299754e18185ce3b20f0726248c23181177 | 3f56f0274883e3b99f6683f7dbb7dc02278973c1 | refs/heads/master | 2020-05-04T10:44:55.216285 | 2019-06-21T14:39:31 | 2019-06-21T14:39:31 | 179,094,370 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 341 | cpp | #include <iostream>
#include <string>
int main(int argc, char *args[]) {
// - Create an array variable named `t`
// with the following content: `[1, 2, 3, 4, 5]`
// - Increment the third element
// - Print the third element
int t[] = {1, 2, 3, 4, 5};
t[2]++;
std::cout << t[2] << std::e... | [
"hordonandron@gmail.com"
] | hordonandron@gmail.com |
c821b09ee5abc09640dd7ca2c86ab5d82d0929bd | db7148c33aabad259c9e1acafdf6e5c49b627d46 | /Tests/Armory/build_test_game/osx-build/Sources/src/armory/logicnode/ApplyForceNode.cpp | 65a61d0f16f304cc65ee26919ee0b71eded18197 | [] | no_license | templeblock/Animations | 18472430af796d32e3f0c9dd2df1058fdb241846 | e986fa2249b998889fad78cac6ff3cc70ad196f0 | refs/heads/master | 2020-04-23T01:23:44.200377 | 2018-06-07T14:33:43 | 2018-06-07T14:33:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 5,049 | cpp | // Generated by Haxe 3.4.4
#include <hxcpp.h>
#ifndef INCLUDED_armory_logicnode_ApplyForceNode
#include <armory/logicnode/ApplyForceNode.h>
#endif
#ifndef INCLUDED_armory_logicnode_LogicNode
#include <armory/logicnode/LogicNode.h>
#endif
#ifndef INCLUDED_armory_logicnode_LogicNodeInput
#include <armory/logicnode/Logic... | [
"neverliberty@gmail.com"
] | neverliberty@gmail.com |
38cb1e25c8383d1d021889e87458e46e6904ca9a | 460455e7990de7257aa223a58e73069f3ef7ff43 | /src/server/game/Combat/ThreatManager.h | 5f9047defccf8f31eb7f6a138855669ab21d3791 | [] | no_license | Shkipper/wmane | 2ce69adea1eedf866921c857cbc5bd1bc6d037f0 | 2da37e1e758f17b61efb6aae8fa7343b234f3dcd | refs/heads/master | 2020-04-24T19:51:51.897587 | 2019-02-25T06:14:18 | 2019-02-25T06:14:18 | 172,225,859 | 0 | 0 | null | 2019-02-23T14:49:31 | 2019-02-23T14:49:31 | null | UTF-8 | C++ | false | false | 9,506 | h | /*
* Copyright (C) 2008-2013 TrinityCore <http://www.trinitycore.org/>
* Copyright (C) 2005-2009 MaNGOS <http://getmangos.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 by the
* Free Software Foundation; either ver... | [
"felianther15@gmail.com"
] | felianther15@gmail.com |
016efa20537a9fdc6231d95205660e7c2557fab9 | 3296cab14de3ba88ba01637c634f213f2345da55 | /HSDF/ExternalLibs/GeoTools/Mathematics/ContLozenge3.h | 4b8eed7e99674420165c278038ea2fa0d492ffb0 | [] | no_license | teshaTe/HybridFrep | 63b2fe47a6ce49927309743e1f708658c2f2f18d | ded2bbb917bd1f8bc22e28b35bdf86cf6b0340a7 | refs/heads/master | 2023-03-04T01:35:36.054376 | 2021-02-18T21:36:13 | 2021-02-18T21:36:13 | 158,251,562 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,964 | h | // David Eberly, Geometric Tools, Redmond WA 98052
// Copyright (c) 1998-2020
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
// https://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
// Version: 4.0.2019.08.13
#pragma once
#include <Mathematics/Ap... | [
"tereshin.tesha@gmail.com"
] | tereshin.tesha@gmail.com |
033c89b56ca0e95b2871cd43c05f6ef87e553ee5 | 95a4aaa86b716a643a9ad3ebf069697a48a0f9a8 | /c.cpp | 601d560751fbf58762c8177c371d8e1312e43e8f | [] | no_license | LGuillermoUH/Estructura-de-datos | 41edad89e3bbb81ad5b4aca18e9f7142f8d269b0 | 2ec951278ed2245ba7d7e1b0094bddf0c4122022 | refs/heads/master | 2020-05-22T17:44:00.336790 | 2019-05-13T16:24:41 | 2019-05-13T16:24:41 | null | 0 | 0 | null | null | null | null | ISO-8859-10 | C++ | false | false | 1,782 | cpp | #include <cstdlib>
#include <iostream>
#include <cstdlib>
#define max 10
typedef char tipodato;
struct Pila{
int tope;
tipodato Elementos[max];
};
typedef struct Pila TipoPila;
void inicializar(TipoPila &P){
P.tope=-1;
}
bool Vacio(TipoPila P){
return(P.tope==-1);
}
bool pilallena(TipoPila P){
... | [
"luisg1.luis@gmail.com"
] | luisg1.luis@gmail.com |
8789c78692fde8fd903151ca8dbd4c6b8b5de497 | 2e4dd073e5567b157501781965695b3e47386b17 | /shared/vkRenderers/VulkanModelRenderer.h | 4e7d07b87fc04a73fdb041c7778cc6ccfc82e97a | [
"MIT"
] | permissive | LuisAllegri/3D-Graphics-Rendering-Cookbook | e83ec09932401915ab591dadcc98a7ef6abac24e | f4343a712c8637eafad4bbc22649e0d232072a32 | refs/heads/master | 2023-08-25T20:42:16.070897 | 2021-11-07T18:36:18 | 2021-11-07T18:36:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,435 | h | #pragma once
#include "shared/vkRenderers/VulkanRendererBase.h"
class ModelRenderer: public RendererBase
{
public:
ModelRenderer(VulkanRenderDevice& vkDev, const char* modelFile, const char* textureFile, uint32_t uniformDataSize);
ModelRenderer(VulkanRenderDevice& vkDev, bool useDepth, VkBuffer storageBuffer, VkDev... | [
"sk@linderdaum.com"
] | sk@linderdaum.com |
ee4aedf97b5b467917bfae26f22b77e0696f44f3 | 1fcdb2bc2c7f75f6aed466119a4b1c53777f0b7a | /holly_inlet_kappaepsilon_noturbulence/22/U | a66cdf60fb7a76ddd46fedb6e3be8970711a10b6 | [] | no_license | bshambaugh/openfoam-experiments3 | b32549e80836eee9fc6062873fc737155168f919 | 4bd90a951845a4bc5dda7063e91f6cc0ba730e48 | refs/heads/master | 2020-04-15T08:17:15.156512 | 2019-01-15T04:31:23 | 2019-01-15T04:31:23 | 164,518,405 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,181 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 4.1 |
... | [
"brent.shambaugh@gmail.com"
] | brent.shambaugh@gmail.com | |
246e7a11d9a9a38bc26515c5352658fc877573c2 | 88ae8695987ada722184307301e221e1ba3cc2fa | /third_party/pdfium/fxjs/cjs_console.h | 5608d55a4356c9eb90dc97e6481029fbe656b59f | [
"Apache-2.0",
"LGPL-2.0-or-later",
"MIT",
"GPL-1.0-or-later",
"BSD-3-Clause"
] | permissive | iridium-browser/iridium-browser | 71d9c5ff76e014e6900b825f67389ab0ccd01329 | 5ee297f53dc7f8e70183031cff62f37b0f19d25f | refs/heads/master | 2023-08-03T16:44:16.844552 | 2023-07-20T15:17:00 | 2023-07-23T16:09:30 | 220,016,632 | 341 | 40 | BSD-3-Clause | 2021-08-13T13:54:45 | 2019-11-06T14:32:31 | null | UTF-8 | C++ | false | false | 1,347 | h | // Copyright 2014 The PDFium Authors
// 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 FXJS_CJS_CONSOLE_H_
#define FXJS_CJS_CONSOLE_H_
#include <vector>
#include "fxjs/cjs_o... | [
"jengelh@inai.de"
] | jengelh@inai.de |
fe03b3310651a18f5b230e44569f4eb2b4e9d0a9 | 5d0b1b638b1348c09dea4d8feeb59b42044f934c | /subms/Dastan Nurgumarov_90432_assignsubmission_file_/Dastan_Nurgumarov.cpp | 2a6fcdab1c4e07a5b7cbd5101b14d314bff3be14 | [] | no_license | Ondassyn/AutoClock | 84e361c20d55deb7bbd60f53c0fdfa564620dc8a | 635a501dc8cb77d9d38265c80bc6198dcc060bec | refs/heads/master | 2022-06-06T07:34:06.617595 | 2019-06-13T07:27:47 | 2019-06-13T07:27:47 | 191,712,766 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,144 | cpp | #include <iostream>
using namespace std;
class am_pm_clock {
unsigned int hours, minutes, seconds;
bool am;
public:
am_pm_clock() {
hours=12;
minutes=00;
seconds=00;
am=true;
}
am_pm_clock(unsigned int hrs, unsigned int mins,
unsigned int secs, bool am_val... | [
"oabdrakhmanov@nu.edu.kz"
] | oabdrakhmanov@nu.edu.kz |
fe2bbdbbf9008dbeabe382d3c48e552d37b589a3 | ab1c643f224197ca8c44ebd562953f0984df321e | /cys/win32/decisionpage.cpp | 94a980e92aa5f490a564a9d2658164128e83734d | [] | no_license | KernelPanic-OpenSource/Win2K3_NT_admin | e162e0452fb2067f0675745f2273d5c569798709 | d36e522f16bd866384bec440517f954a1a5c4a4d | refs/heads/master | 2023-04-12T13:25:45.807158 | 2021-04-13T16:33:59 | 2021-04-13T16:33:59 | 357,613,696 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,772 | cpp | // Copyright (c) 2001 Microsoft Corporation
//
// File: DecisionPage.cpp
//
// Synopsis: Defines Decision Page for the CYS
// Wizard. This page lets the user choose
// between the custom and express paths
//
// History: 02/08/2001 JeffJon Created
#include "pch.h"
#include "resource.h"
... | [
"polarisdp@gmail.com"
] | polarisdp@gmail.com |
ea7657bc80948ec47dc7ef5d1d468663b8cc94d2 | d0fb46aecc3b69983e7f6244331a81dff42d9595 | /opensearch/src/model/PushInterventionDictionaryEntriesRequest.cc | 15c5a5ad28acf47446d690aaf5c3fb4ba1f2944c | [
"Apache-2.0"
] | permissive | aliyun/aliyun-openapi-cpp-sdk | 3d8d051d44ad00753a429817dd03957614c0c66a | e862bd03c844bcb7ccaa90571bceaa2802c7f135 | refs/heads/master | 2023-08-29T11:54:00.525102 | 2023-08-29T03:32:48 | 2023-08-29T03:32:48 | 115,379,460 | 104 | 82 | NOASSERTION | 2023-09-14T06:13:33 | 2017-12-26T02:53:27 | C++ | UTF-8 | C++ | false | false | 1,410 | cc | /*
* Copyright 2009-2017 Alibaba Cloud All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by... | [
"sdk-team@alibabacloud.com"
] | sdk-team@alibabacloud.com |
71cf115db8989f664bc152a11992ce543884fd49 | d41b247175c739f2cfe4ac60bcc6be1effe82238 | /programming03/client/CliDirFuncs.cpp | be2ee44fb097762fa6406db8eb94a836e17e5e99 | [] | no_license | bdalgarn/networks-hw | 423c88382f78a28968cebb6a2cd9a5e0bd32eed8 | 0fcf5079bf7cc229243407f6cf96c785398775cc | refs/heads/master | 2021-08-26T04:42:02.629105 | 2017-11-21T16:05:25 | 2017-11-21T16:05:25 | 105,486,387 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,069 | cpp | #include <stdint.h>
void mdir(char *name, int32_t size){
// char buf[MAXSIZE];
// if ((size!=recv(new_s,buf,sizeof(buf),0))<0){
// fprintf(stderr,"[recv] : %s",strerror(errno));
// return -1;
// }
//
char *size = atoi(size);
char *init_msg = "";
sprintf(init_msg,"%s %s",size,name);
if (... | [
"adifalco@nd.edu"
] | adifalco@nd.edu |
f189240242dc57d7b40ea816c6fa942ace2c9975 | c1c2bd1c9ea641b2bb947a033ae5f70f82861013 | /chap 14/eBook Collection/eBook Collection/eBook.cpp | f2d317eb5cc80a67da3530024ae3bea55a18024e | [] | no_license | mir-mirsodikov/An-Introduction-to-Programming-with-CPP | b5016b308981b08a9fb2f7d64ec33b515ecc3d2f | 0e6db865a32a0a324d1a0048b817b285e4309666 | refs/heads/master | 2020-05-28T07:14:34.611350 | 2019-05-27T22:54:44 | 2019-05-27T22:54:44 | 188,918,208 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,279 | cpp | //Mukhammad Mirsodikov - P2
#include <iostream>
#include <string>
#include <fstream>
using namespace std;
void saveInfo();
void displayInfo();
int main() {
saveInfo();
displayInfo();
system("pause");
return 0;
}
void saveInfo() {
string title = "";
string author = "";
ofstream outFile... | [
"mirsodikov.mir@gmail.com"
] | mirsodikov.mir@gmail.com |
79a9ed7aad8e4a287e6d90948d5f31cf80f96028 | e2bba937bbd064bc75216e7d4f5d1a0d72a2a34c | /lab2var2/queue.h | b548b682d2dbae0541df539cddc2388ba43c4a1b | [] | no_license | FalconCanCoding/lab3 | f91bf29e42e242030e2d04bc5d5dc93627758bcb | aca1d4d34f3dfd399bd2527da2043ca42b15d61c | refs/heads/master | 2020-06-15T10:49:17.767507 | 2016-12-01T14:47:26 | 2016-12-01T14:47:26 | 75,301,226 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 287 | h | #ifndef QUEUE_H
#define QUEUE_H
#include "element.h"
class Queue
{
Element* first;
Element* last;
int count;
public:
Queue();
~Queue();
void Put(Element* e);
Element* Get();
int Sum();
void Print();
};
#endif // QUEUE_H
| [
"Sokolik_97@mail.com"
] | Sokolik_97@mail.com |
2289cc455de007edb05cf82c03042620ab447f5f | 551d15d28066bc3c56045ff2009423f147ef0d9c | /cpp/1013_canThreePartsEqualSum.cpp | fd9ccfd5cec1177e201a54a491fe109f41dc0440 | [] | no_license | tesion99/LeetCode | 6d393dcb5721f2e9df7a239b8f8823fcfba95c49 | 823d3b7d298bbbb2d72a1b0e96c8e6a20bb84e40 | refs/heads/master | 2021-07-11T12:34:11.243119 | 2020-08-22T14:51:10 | 2020-08-22T14:51:10 | 171,787,201 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,767 | cpp | /*
给你一个整数数组 A，只有可以将其划分为三个和相等的非空部分时才返回 true，否则返回 false。
形式上，如果可以找出索引 i+1 < j 且满足 (A[0] + A[1] + ... + A[i] == A[i+1] + A[i+2] + ... + A[j-1] == A[j] + A[j-1] + ... + A[A.length - 1]) 就可以将数组三等分。
示例 1：
输出：[0,2,1,-6,6,-7,9,1,2,0,1]
输出：true
解释：0 + 2 + 1 = -6 + 6 - 7 + 9 + 1 = 2 + 0 + 1
示例 2：
输入：[0,2,1,-6,6,7,9,-1,2,0... | [
"tesion@sina.cn"
] | tesion@sina.cn |
0c2980f1ac2caace21146aa3c5e41f22ce2abbca | 441876a078a3b4c6d49831b8eeadfe45fca94b75 | /PalindromicSubstringLinear.cpp | 613726ef468b6e146a0e47a3a052445b1b7a53f8 | [] | no_license | iamblizzard/CppProgramming | 0ad9fa28d71bbebe1455fe41587ee9de52d9a03d | f4a8af9acf6743226d00e6c6e17795206f9ec30a | refs/heads/master | 2021-07-14T04:17:10.515690 | 2021-06-25T04:13:29 | 2021-06-25T04:13:29 | 137,169,151 | 7 | 0 | null | 2018-06-14T16:33:23 | 2018-06-13T05:59:43 | C++ | UTF-8 | C++ | false | false | 1,157 | cpp | #include<bits/stdc++.h>
using namespace std;
// Credits: https://github.com/mission-peace
int main()
{
string s;
cout << "Enter input string:\n";
cin >> s;
string temp = "$";
for(auto x : s) {
temp += x;
temp += '$';
}
s = temp;
int n = s.size();
int palindrome_length[n] = {0};
int start = 0, end = 0... | [
"nipunmittal15@gmail.com"
] | nipunmittal15@gmail.com |
0e122601727d7fcfbd125839c262d254f967f8ee | 7f77cc07625a2ec85243112ad0349c7a54683900 | /src/cost.cpp | 0dfc21a0a5d479d37d115c950c515893ada89344 | [] | no_license | wy193777/CarND-Path-Planning-Project | 3e472699539ff5b500a414301563ef20df55d3ea | 0ae98e769b5a00e96a0615881cb9d720280433a9 | refs/heads/master | 2021-09-05T18:21:35.139084 | 2018-01-30T07:08:32 | 2018-01-30T07:08:32 | 117,603,491 | 0 | 0 | null | 2018-01-15T22:46:28 | 2018-01-15T22:46:28 | null | UTF-8 | C++ | false | false | 4,984 | cpp | #include "cost.h"
#include "vehicle.h"
#include <functional>
#include <iterator>
#include <map>
#include <math.h>
//TODO: change weights for cost functions.
const float REACH_GOAL = 1;
const float EFFICIENCY = 1;
const double BUFFER = 50;
/*
Here we have provided two possible suggestions for cost functions, but feel ... | [
"gaoshenghan199123@gmail.com"
] | gaoshenghan199123@gmail.com |
e41d644ea148ab59cd441e7571010916bb4910a3 | 0d5eb5bf9178f6dd6bad291f793d1ee6de364fd3 | /hip/kernel.cudafe1.cpp | 69a46b1237a7237c2e28c03423750b1ef47e8bf1 | [] | no_license | tutzr/intermediate-test | 57adecee7fe6b1e548b961dd1b406f459372445b | ab2c476c3d7e3f0f62905bdcec27cc0b46cb66d0 | refs/heads/master | 2022-12-02T04:03:58.433136 | 2020-08-21T06:01:23 | 2020-08-21T06:01:23 | 287,793,285 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 608,339 | cpp | # 1 "kernel.c"
#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
# 1
#pragma GCC diagnostic push
# 1
#pragma GCC diagnostic ignored "-Wunused-variable"
# 1
#pragma GCC diagnostic ignored "-Wunused-function"
# 1
static char __nv_inited_managed_rt = 0; static void **__nv_fatbinhandle_for_managed_rt; static void __... | [
"s2002958@ed.ac.uk"
] | s2002958@ed.ac.uk |
4d368cb7465dcee465914e70a0c0b61dd33abdea | b7b7924b0aea91c2fb4d59aac56927f9a578fac8 | /src/triangle_app.hpp | 67a0eafe4878784fa3d98a1aa6e8b63494e38924 | [] | no_license | sfod/vulkan-test | ea4e6179be9f75921489a809e6f079deb71dfdd7 | 4c6612338a69208ca37a7e61d01fb148114f6edb | refs/heads/master | 2020-08-04T15:45:55.408608 | 2019-10-01T20:08:38 | 2019-10-01T20:08:38 | 212,190,093 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 476 | hpp | #pragma once
/// GLFW will initialize vulkan.
#define GLFW_INCLUDE_VULKAN
#include <GLFW/glfw3.h>
namespace vkt {
class TriangleApp {
public:
void run();
private:
void init_window();
void print_extensions();
void create_vulkan_instance();
void init_vulkan();
void main_loop();
void cl... | [
"octosyllabic@gmail.com"
] | octosyllabic@gmail.com |
a239c0989fb44348f56893b53869a182aabac133 | 6c99fc5e18259393584843570f3da9edc1209e89 | /ArduinoMorseDecoder.ino | 5b8c9a3b5d837259b60e2e7e92346d485356568c | [] | no_license | PaulKnauer/ArduinoMorseDecoder | 180e54f8651c4831ed2a18db5e9c0bdc10c8b656 | 6bee4e895fdf073903bf9f50cddcabba649c02e2 | refs/heads/master | 2021-01-12T13:22:13.206962 | 2016-10-30T11:47:55 | 2016-10-30T11:47:55 | 72,213,549 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 325 | ino | #include "MorseDecoder.h"
#include "Arduino.h"
#define BAUD_RATE 115200
MorseDecoder decoder;
void setup() {
Serial.begin(BAUD_RATE);
delay(3000);
}
void loop() {
String *morse = new String("-.- \n- .... .. ... \n.. ... \n.- \n- . ... - \n-- . ... ... .- --. . \n");
decoder.decodeMorse(morse);
delay(3000... | [
"paul.knauer@gmail.com"
] | paul.knauer@gmail.com |
422d32b6dc51cde6c78748a906300ef332a42580 | 64388f92c7a7cf523f0f40ffd2c0baab68b67ee2 | /WEEk1/5_CARVANS.cpp | e25d806dd5493138346359976500b396db58bfc3 | [] | no_license | shivampapat/CODECHEF_DSA | 41bb24ab93e131e79a0d210bf7996f497e0a5309 | 299d68e8750b9eeba51ac599acdf573ee75b942b | refs/heads/master | 2022-11-05T11:07:26.965065 | 2020-06-19T12:49:23 | 2020-06-19T12:49:23 | 272,254,909 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 661 | cpp | #include<iostream>
#include<stdio.h>
using namespace std;
typedef long long ll;
int main(){
int test;
cin>>test;
while(test--){
int n;
cin>>n;
ll* arr = new ll[n];
for(ll i=0;i<n;i++){
cin>>arr[i];
... | [
"noreply@github.com"
] | noreply@github.com |
370184c5691f8b716a02d98d95b8138d5a3ae00e | bc7e02aad355e7791adce1d85ca86a1b0a968b59 | /libraries/sensors_actors/HLW8012_auf_eis_gelegt/src/HLW8012.cpp | c53d2d9cc51199c6d860c1a5eb54ab28aec130ea | [] | no_license | gkoe/myiot21 | b703f444550efe7e13bd765f06e6dde6e96ed82e | 9cd9abf6a1cdb5d5dff4ca30d327bf44cdbd2323 | refs/heads/master | 2023-02-06T03:42:48.071835 | 2020-12-29T19:05:40 | 2020-12-29T19:05:40 | 325,366,661 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,656 | cpp | #include "HLW8012.h"
#include <freertos/FreeRTOS.h>
#include <freertos/task.h>
#include <sys/time.h>
#include <Logger.h>
#include "driver/gpio.h"
#include "driver/adc.h"
#include "esp_adc_cal.h"
#define DEFAULT_VREF 1100 //Use adc2_vref_to_gpio() to obtain a better estimate
#define NO_OF_SAMPLES 64 //Multisampling
... | [
"gkoe@gmx.at"
] | gkoe@gmx.at |
83a321b5f6e37815df23679fa11992c4458518a5 | 3ab307b0fdf9601ff59a071691cecf9949184741 | /CodingQ/Tree/TreeTraversals.cpp | 86c2eb1141268f43c5e60cce51f150663af4dafa | [] | no_license | srinivas-github/DataStructures | 37a60fa1fe75c5ca6d41fd5e60c9a3222666cbec | ec67b347995546375c98569379e251df0b3d5914 | refs/heads/master | 2021-01-17T13:53:13.673994 | 2018-08-17T04:35:46 | 2018-08-17T04:35:46 | 42,156,025 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,805 | cpp | #include <cstdio>
#include <cstdlib>
#include <queue>
using namespace std;
struct Node
{
int data;
struct Node* left;
struct Node* right;
};
struct Node* getNewNode(int data)
{
struct Node* temp = (struct Node*)malloc(sizeof(struct Node));
temp->data = data;
temp->left = temp->right = NULL;
... | [
"srinvasreddy.j@gmail.com"
] | srinvasreddy.j@gmail.com |
81e24bacaf2c280dcb53e0d5d489bd25c5fcbc29 | 9bbd219ea1adc510b482360dcc858046b986b4c9 | /Nearby Points/Nearby Points/vec.h | fd031f7a99d722dbc79ae0d10aa5dad0a257de82 | [] | no_license | nikhilsh/Tribilizer | 6b160988000cc15e161613e7bd8b92100ca63664 | ddfadf79af5466e0b700596a2e53bde7faa4c759 | refs/heads/master | 2021-01-17T19:52:28.349969 | 2016-07-31T18:25:28 | 2016-07-31T18:25:28 | 63,764,885 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 70,842 | h | #ifndef DF_VEC
#define DF_VEC
#if defined(__SSE2__) || defined(_M_IX86_FP)
#include <emmintrin.h>
#endif
#include <cmath>
#include <iostream>
#pragma push_macro("DI")
#pragma push_macro("DEF_SQ_MAT_BLOCK_COMMON")
#pragma push_macro("DEF_MAT_SINGLE_OP")
#pragma push_macro("DEF_SIMPLE_MAT_MAT_OP")
#pragma push_macro("... | [
"me@nikhil.sh"
] | me@nikhil.sh |
ae23262f6be105101085c4dd2edc75763c7d1a5d | a9f5f6b6d436eead6dd4864eceae00c8fa478a8f | /CustomerOrder.h | ef0a9ed190a2c8cc83c37418062e0e790475b140 | [] | no_license | ODAVING/BTP305 | 1fd5945b669e85df3f2c88f05cfd661b7232c2b6 | ea8625dfa902f06dcd2befb90d281f6f012fcd67 | refs/heads/master | 2020-04-11T05:36:54.854816 | 2018-03-08T02:58:29 | 2018-03-08T02:58:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,055 | h | //Sina Lahsaee
//129948162
#pragma once
// CustomerOrder Milestone - CustomerOrder Interface
// CustomerOrder.h
// Chris Szalwinski
// v1.0 - 9/11/2015
// v2.0 - 23/02/2016
#include <iostream>
#include <string>
#ifndef _MSC_VER
#define NOEXCEPT noexcept
#else
#define NOEXCEPT
#endif
class Item;
class CustomerItem;
cl... | [
"slahsaee1990@gmail.com"
] | slahsaee1990@gmail.com |
ce5db0b1ba4edb93cee12e39d3337e2dc7a8f443 | b635e59e795fc53b05903de09f4fbe1e1616b652 | /src/unknown_objects.h | aab454bfbf14fb72b1ad1300f23a8cba5c304e70 | [] | no_license | stevevista/qia | d4b0505434e5290462b8bab6cd615570a0b84aa9 | b3201c1187b1b4c109a2d5282d47bfd8654b1952 | refs/heads/master | 2020-04-01T03:22:34.111920 | 2018-10-20T02:03:20 | 2018-10-20T02:03:20 | 152,819,380 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,321 | h | #pragma once
#include <SDKDDKVer.h>
// Windows Header Files:
#define WIN32_LEAN_AND_MEAN // Exclude rarely-used stuff from Windows headers
#define _ATL_CSTRING_EXPLICIT_CONSTRUCTORS // some CString constructors will be explicit
#include <windows.h>
#include <ole2.h>
#include <ocidl... | [
"stevevista@gmail.com"
] | stevevista@gmail.com |
40626ef49c059eb1e65aa49e550702b984777a58 | b2e5311f2aa0608a7da6d9a7a9f6b7e8f900f2d6 | /InteractiveMandelbrot/Includes.h | 66e69649adf53f389e41882e6730ed06624102ce | [] | no_license | Shorte240/DSaA-Submission | 9653401bbd7323fc9cd58cb8f0a85672e744b9ed | f018185c4142fded96127f141ed42f5f83a8aa6f | refs/heads/master | 2020-03-11T16:49:29.830135 | 2018-04-28T10:49:04 | 2018-04-28T10:49:04 | 130,129,151 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 904 | h | #pragma once
// Include glut, opengl libraries and custom classes
#include "glut.h"
#include <gl/GL.h>
#include <gl/GLU.h>
#include "Input.h"
#include <stdio.h>
// Further includes should go here:
#include "SOIL.h"
#include <vector>
// Mandelbrot specific includes
#include <chrono>
#include <iostream>
#include <ioma... | [
"fraserbarker@hotmail.com"
] | fraserbarker@hotmail.com |
798979b1759a5ef34814fbf6895c3704c0041e89 | 52e2ef423ca1a8d57c32e4aa79466b710c2691c6 | /LimbEscape/Sources/jeu.cpp | 3c97f012c6d9098994358fd8ce5113c4b4fba9b1 | [] | no_license | jimoniak/LimbStudio | bfdd09bc1277383f56e36edfb1a911eb84013d17 | 2d35d06e05832e775bc9af8f639f36f2b7dbc2e4 | refs/heads/master | 2021-01-02T09:27:20.878423 | 2015-01-27T07:59:00 | 2015-01-27T07:59:24 | 29,106,019 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 35,188 | cpp | /*
LimbEscape,
Crée par Jimmy PEAULT sous le nom de LimbStudio
Jeu sokoban en 2d isometrique
utilisant la technologie de la SFML 2.1.
LimbEscape de Limb'Studio est mis à disposition selon les termes de la licence Creative Commons Attribution - Pas d’Utilisation Commerciale 4.0 International.
Les aut... | [
"mail.limbstudio@gmail.com"
] | mail.limbstudio@gmail.com |
c67cde69e06f364d69cf428da976a16cec6aacac | b30b65994865ce9212da5b30834b15ea9dbb9103 | /CODEFORCES/Avulso/Implementacao/200B.cpp | c4a6eebc5c7ded6e154b8004487d4fc47e4fba34 | [] | no_license | uthantvicentin/Competitive-Programming | 3d06b9cac1bf76a166f8009b7898fafdbca726bf | 6072753df64da0fa76a95fd30c9c65d89cd30a73 | refs/heads/master | 2021-09-08T19:54:18.510359 | 2021-09-05T13:14:12 | 2021-09-05T13:14:12 | 178,067,690 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 212 | cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,x,soma = 0;
scanf("%d",&n);
for(int i = 0 ; i < n ; ++i){
scanf("%d",&x);
soma += x;
}
printf("%.12lf\n",(double)soma/n);
return 0;
}
| [
"uthantvicentin@gmail.com"
] | uthantvicentin@gmail.com |
8d2067da777936b941a0aa5d87d79ffab3b965df | e733f50ae42ba2684688e82d374e485fada0c353 | /slam3d/sensor/pcl/RegistrationParameters.hpp | 6f91865a8b237c40f801347d0bf157c36ddb0f41 | [
"BSD-3-Clause"
] | permissive | dfki-ric/slam3d | 61414c9dbb7eca62d5f30ab69cbf3cb0bae696e4 | 9f06d1a6768b3a22a6e164ceea529767f5e99ea6 | refs/heads/master | 2023-06-22T14:22:24.209551 | 2023-03-09T10:29:09 | 2023-03-09T10:29:09 | 126,174,814 | 18 | 5 | BSD-3-Clause | 2023-05-08T12:53:17 | 2018-03-21T12:25:13 | C++ | UTF-8 | C++ | false | false | 4,121 | hpp | // slam3d - Frontend for graph-based SLAM
// Copyright (C) 2017 S. Kasperski
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright notice,
// this... | [
"sebastian.kasperski@dfki.de"
] | sebastian.kasperski@dfki.de |
d24ac5a34d04fcf55361c95725f7d88dce6c5b90 | 0912b580cfdc8ac4e0a2d42c807204d8c4203646 | /Sandbox/src/Sandbox.cpp | bf00a959b486f3a180599512b632305c89117582 | [] | no_license | MengxuanHUANG/NewEngine | 323dfba9586f4942a0f4569779086c0e58dfe868 | 32ba46760360454b4c2e2172d739a72d8b0edd78 | refs/heads/main | 2023-02-21T13:45:34.866015 | 2021-01-28T14:05:36 | 2021-01-28T14:05:36 | 326,305,677 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 361 | cpp | #include "NewEngine.h"
#include "NewEngine/Core/EntryPoint.h"
#include "ExampleLayer.h"
#include "AssimpLayer.h"
class SandboxApp :public engine::Application
{
public:
SandboxApp()
{
//PushLayer(new ExampleLayer());
PushLayer(new AssimpLayer());
}
~SandboxApp()
{
}
};
engine::Application* engine::CreateAp... | [
"18082628d@connect.polyu.hk"
] | 18082628d@connect.polyu.hk |
3d9dc7c5ca8c000259bc06b7cf2a647e63cedb35 | 9851a075ce800fb1156711fd128d1619134bc2f4 | /Programa2/Suarez Adrian Marcelo A01197108 Programa 2/1prg1_Logger.h | 312e270acd657936c27aacdf5a5230e3caa5a070 | [] | no_license | amsuarez99/lab-calidad | 6624840052a8df65ba8e3a2e782017b47c2955c6 | 7ea0c2cb14289e11b6d92d572e398f455855141b | refs/heads/main | 2023-04-14T15:53:03.925983 | 2021-05-05T06:21:17 | 2021-05-05T06:21:17 | 352,393,081 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,334 | h | #pragma once
class Logger {
public:
Logger();
void log(string msg);
void logErrMess(string errMsg);
void logResult(string fileName, int (&lineCount)[3]);
};
// Constructor de la clase
Logger :: Logger() {
}
// Función: Imprime mensaje de error en consola
// Parámetros: El mensaje a imprimir
// Valor... | [
"amsuarez99@gmail.com"
] | amsuarez99@gmail.com |
3effa6495f94155a0aed471058fa51e39e67cce7 | 059868ce51af78f838fe2b563f616a549a28ea74 | /1.cpp | 1409feebfa90bd85fa2bfe330f5d2f04138f09a4 | [] | no_license | sajithkp/lab-6 | 9693f7f2d90aaec813c0de1059f3f55fd9cb69ad | 4bbe46a0e687646781d2056d1107c3a9408970aa | refs/heads/master | 2021-01-25T13:41:56.382681 | 2018-03-02T17:10:05 | 2018-03-02T17:10:05 | 123,607,442 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 966 | cpp | #include<iostream>
using namespace std;
// declaring function Search
void Search(int arr[],int lsize, int rsize, int key){
// Make a variable which is to make our array into two parts and find it's middle
int mid = (lsize +rsize)/2;
// assuming the array to be sorted
if (key <= arr[rsize] && key >= arr[lsize]){
... | [
"noreply@github.com"
] | noreply@github.com |
4fe74b909dff58bb6a56338a8c3f8fec5fdaf2f5 | 99aa550a737e662bac5c33ab9cf10bfa20795558 | /midgard/libmagus/Typen.cc | e1c1dbd3c5cc907da0ca6695fcc34cea4da5a47c | [] | no_license | cpetig/midgard | a55b05f4f17fdb6b7dbf407282d510b3e9a21e8c | 045adc87666aab10f2f33133300d108a482d78cf | refs/heads/master | 2021-05-29T23:08:59.819983 | 2007-04-13T09:27:27 | 2007-04-13T09:27:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,604 | cc | /* Midgard Character Generator
* Copyright (C) 2001 Malte Thoma
* Copyright (C) 2003-2004 Christof Petig
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the Lic... | [
"christof"
] | christof |
fafe18e88f6310cbffdf9f869027c6d3a7931c08 | 57d30906de95e20fb45216925791cb809a11b7f1 | /ase/gtcpp/resolver.hpp | ff5f700a7b15b0c38e1cf20fc709f52a2d9979ea | [
"MIT"
] | permissive | ahiguti/ase | ad782902ca3a8713b155769413fc5d9fd537c347 | f6bc5f337fe7df6eabf676660d9189d3c474150d | refs/heads/main | 2021-06-13T17:39:25.280776 | 2012-06-15T21:01:17 | 2012-06-15T21:01:17 | 4,680,010 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 807 | hpp |
/*
* This file is part of ASE, the abstract script engines.
* Copyright (C) 2006 A.Higuchi. All rights reserved.
* See COPYRIGHT.txt for details.
*/
#ifndef GTCPP_RESOLVER_HPP
#define GTCPP_RESOLVER_HPP
#include <boost/scoped_ptr.hpp>
#include <boost/noncopyable.hpp>
#include <vector>
#include <string>
names... | [
"ahiguti100@gmail.com"
] | ahiguti100@gmail.com |
ad356e4cd5e5d5774638ea7c0cc9cb250ce0e4e7 | af7b4493f8aa0a4893ce4c5b96256b78ed3078b2 | /Models/computerswithpeople.cpp | 0b72e6de65e049dbe322e019411a21a6303b1280 | [] | no_license | valdimarHR/hisCompRepo | 3f6b0c4d80f77c806cf36f23f1aeb7cb3d453ab9 | e0bed82a75e76afd0ee8a72faf27c7b9373b97dd | refs/heads/master | 2021-01-10T02:08:07.246465 | 2015-12-16T14:46:32 | 2015-12-16T14:46:32 | 46,974,705 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 83 | cpp | #include "computerswithpeople.h"
computersWithPeople::computersWithPeople()
{
}
| [
"huldah15@ru.is"
] | huldah15@ru.is |
424e500ba2d175df0d0dd9f9ab0b43441d0775e7 | a96bdfb2829f508c3c1115918f644cbb10fbca71 | /2014/f1-carteiro.cc | 1455b5009346b928cb1823d6501b2f357360feb3 | [] | no_license | alequisk/resolucoes-obi | 5509296d877c52074fcc0e02e10fdbbc6fecd254 | 3230debba83cc82ad326401728f0f5c6ae696e7f | refs/heads/master | 2023-01-28T12:56:46.205815 | 2023-01-14T14:40:09 | 2023-01-14T14:40:09 | 270,109,643 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 477 | cc | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> arr(N);
for (auto& x: arr) {
cin >> x;
}
int64_t cost = 0;
int pos = 0;
for (int i = 0; i < M; i++) {
int w; cin >> w;
int pp = lower_b... | [
"alexsousa1435@gmail.com"
] | alexsousa1435@gmail.com |
4e6d6732f82408b9cb523e388a35dc7148b037d9 | 26c6862bfd3ccc75cb114619d2a7b76061db9ead | /soui_20171208/SOUI/src/control/STabCtrl.cpp | 2f79757eaa84a92a58300710c91c0d11be112812 | [
"MIT"
] | permissive | Honkhat/UISOSO | 80f68d343a01c1cf14abadb2bf4e3e3ee7216b5b | 3b06f261b8c3e40662d7081052d046bb1cab9a6c | refs/heads/master | 2020-03-08T09:51:58.246144 | 2018-04-21T15:05:19 | 2018-04-21T15:05:19 | 128,057,409 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,574 | cpp | #include "souistd.h"
#include "control/Stabctrl.h"
#include "animator/SInterpolatorImpl.h"
#include <algorithm>
namespace SOUI
{
class STabSlider : public SWindow, public ITimelineHandler
{
SOUI_CLASS_NAME(STabSlider, L"tabslider")
public:
STabSlider(STabCtrl *pTabCtrl, int iFrom, int iTo, int nSteps, int nT... | [
"tup17x@gmail.com"
] | tup17x@gmail.com |
8c2aee5f192862a128765e6c3a40f131f3e60eb9 | e9edf6bddfbd84747f7611f54df379a327404907 | /oglplus/enums/buffer_indexed_target_class.ipp | b25b459d98a54451c117583e79c5bbe095764345 | [] | no_license | MaikKlein/OglplusGen | cb804b192121ca0c408d97f0b5fe6e2470a8c2da | 9d416f0551c795473fcfe74b4c431354f815c93f | refs/heads/master | 2021-01-20T11:31:05.478534 | 2014-12-19T17:10:20 | 2014-12-19T17:10:20 | 28,238,420 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,928 | ipp | // File implement/oglplus/enums/buffer_indexed_target_class.ipp
//
// Automatically generated file, DO NOT modify manually.
// Edit the source 'source/enums/oglplus/buffer_indexed_target.txt'
// or the 'source/enums/make_enum.py' script instead.
//
// Copyright 2010-2014 Matus Chochlik.
// Distributed under the B... | [
"maikklein@googlemail.com"
] | maikklein@googlemail.com |
5f676a3be5f23d1f9e2ec2c6b430f5615dcb1011 | 95ae6fa9cc64bc2f537753475c1b84ae526391b1 | /source/tm/bide/bide.hpp | 93d886cafaec57facbe83b54e2bdf9ff2138cd63 | [
"BSL-1.0"
] | permissive | OctalMicrobe/technical-machine | 7deeb30cf1ff2eb730bc0ad9efc4794b30c6cf5c | bffa259bd4d069ce104efa21fef34a5342ee0755 | refs/heads/master | 2023-02-04T00:43:19.534781 | 2020-12-20T17:21:50 | 2020-12-20T17:21:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 971 | hpp | // Handles bide damage and when it activates
// Copyright David Stone 2020.
// 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)
#pragma once
#include <tm/bide/damage.hpp>
#include <tm/bide/duration.hpp>
#include <... | [
"david@doublewise.net"
] | david@doublewise.net |
8a4a52754282ace209fa52c6b2fa68d5704c9bba | 6bd42a00296bd1f710e52ae890a9abe2e2917d44 | /MTL/rpipico/MTL/Pins.h | 1994b575300d9f5acf60c3c1b8e22aad2b5760ce | [
"MIT"
] | permissive | AnotherJohnH/Platform | c460f516f3c606280b04aaf1a6c5f4bdc61f8404 | 93043bd6d530e46ed22bd0e9817c3f3cf67d7337 | refs/heads/master | 2023-08-13T23:19:09.768905 | 2023-08-02T15:43:31 | 2023-08-02T15:43:31 | 96,465,068 | 6 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,777 | h | //------------------------------------------------------------------------------
// Copyright (c) 2021 John D. Haughton
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restricti... | [
"anotherjohnh@gmail.com"
] | anotherjohnh@gmail.com |
5f00e02f6ac3b2b0fca937662fcf3ce915ecda1e | 704bc998854b57d140bccab8e16a27c79c419a9a | /BIT_Shadows/sebg.cpp | 80a070efbaa6f5d5b67808efce9980a24756b4ae | [] | no_license | annsimon/bit_shadows | 50250b343f07d15133a46f73025e8705594b4351 | 909e529ac77326c2efa0462add26e2085975d01a | refs/heads/master | 2021-01-18T13:54:30.997244 | 2014-06-14T01:45:06 | 2014-06-14T01:45:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,761 | cpp | #include "sebg.h"
Sebg::Sebg():m_sebg(), m_sebgDialog()
{
m_sebgDialog.setSebg(&m_sebg);
}
bool Sebg::run(QStringList* originals)
{
m_originals = originals;
cv::Mat currentFrame = cv::imread(m_originals->at(0).toStdString());
if(currentFrame.empty())
return false;
if( !findShadowParams... | [
"sbexten@web.de"
] | sbexten@web.de |
db84389771857150d76e9d30103fce1969b620c0 | d0cfe73a42bac335a9c2fb3bb1f1196cdfa0a0c3 | /C++/numthory/prime_generate/prime_gen.cpp | 828df28b4957ab68eb1496fd251dd3c898f8d0d5 | [] | no_license | Kei-phi/GitAOJ | c586aceb672c651009c975a00b878ebf921a430b | 914ad03717e05f5391978cb0528f4e892dc64356 | refs/heads/master | 2021-05-09T07:58:47.359245 | 2018-01-29T12:03:38 | 2018-01-29T12:03:38 | 119,377,237 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,266 | cpp | /*
#include <iostream>
using namespace std;
struct prime prime_generator(int);
int div_prime(int, int);
int *num;
struct prime{
int counter;
int *p;
};
int main(){
int n;
cin >> n;
struct prime ans = prime_generator(n);
for(int k = 0; k <= ans.counter; k++){
cout << ans.p[k] << " ";
}
cout <... | [
"okku125@gmail.com"
] | okku125@gmail.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.