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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e086176a9ea787f17e4b952677e2418877586daa | d6f690f2e32b73056e7c429dd070fdd68d34f3e0 | /C++/剑指Offer算法题/42_1_ReverseSentence.cpp | f62e459737b7afe32f45f81a1ab8fb714386c828 | [] | no_license | ccc013/DataStructe-Algorithms_Study | 13da51c72bbccfc7ca117b6925f57fc5d04bc1f7 | 8987859c4c3faedf7159b5a6ec3155609689760e | refs/heads/master | 2021-06-22T16:28:09.438171 | 2021-03-06T01:48:24 | 2021-03-06T01:48:24 | 60,660,281 | 15 | 11 | null | null | null | null | GB18030 | C++ | false | false | 1,758 | cpp | 42_1_ReverseSentence.cpp | #include<iostream>
#include<string>
using std::string;
using std::cout;
using std::endl;
using std::cin;
/*输入一个英文句子，翻转句子中单词的顺序，但单词内字符的顺序不变。*/
// 翻转字符串中的一段
void Reverse(string &pStr, int pBegin, int pEnd){
if (pStr.size() <= 0)
return;
char temp;
int j = (pEnd - pBegin) / 2;
for (int i = 0; i <= j... |
1c2dd969b0895c1e0c327e883da8694eb7129206 | 9f9ac37f22333569ae3bec78075d0918c3ad2742 | /include/tab_completion.hxx | 9b2ee6d8b3dafdd8560f27baf8f996a44bc8f56d | [
"MIT"
] | permissive | credativ/pg_backup_ctl-plus | 602bcd0ce2bcce1653dd340e7b134c3b8f92973d | d1655f9791be9227e17b60731829bbd8572e850b | refs/heads/master | 2023-03-20T22:15:21.159701 | 2021-03-16T18:08:53 | 2021-03-16T18:08:53 | 348,447,804 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 442 | hxx | tab_completion.hxx | #include <rtconfig.hxx>
/*
* Helper functions/callbacks for readline support.
*
* See tab_completion.cxx for details.
*/
char **keyword_completion(const char *input, int start, int end);
/*
* Initializes readline machinery.
*/
void init_readline(std::string catalog_name,
std::shared_ptr<pgbck... |
5029f4bbb00465f6dc0bc64925b59efb2dff4c7e | bfb8b16cf73137018cd39c03f3aa87c5efe59c28 | /PCR.ino | 69d3ce650a8e05988a5075824d8b00320807c87f | [
"BSD-3-Clause",
"BSD-2-Clause"
] | permissive | opensourcelabsdotca/PCR | cc55ada341ebac98285f7dc8e703fb7697cd5428 | a28eaf78d66790b9404e2cd2a13cf21bfe21ca16 | refs/heads/master | 2016-09-06T07:30:54.142899 | 2014-08-21T04:02:54 | 2014-08-21T04:02:54 | 23,168,029 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,789 | ino | PCR.ino | #include <Adafruit_GFX.h> // https://github.com/adafruit/Adafruit-GFX-Library
#include <Adafruit_PCD8544.h> // https://github.com/adafruit/Adafruit-PCD8544-Nokia-5110-LCD-library
#include "Adafruit_MAX31855.h" // https://github.com/adafruit/Adafruit-MAX31855-library
#define Relay1 8
#define Relay2 12
#define ther... |
8a72bc92bc8d999470b5da63737135f99b93d9c9 | d322446df7dc61a83c9e4cd4a25f32a6bef10e30 | /Banking Management System/Banking Management System/User.cpp | 94916f581df0cb6ef7ac138af2292152f2b93d4a | [] | no_license | SirenLX/CPlusPlus-Banking-Management-System | 1666aadcabd7f51e82d42f95cf717b00539a9563 | a61ada489fdf0ff5b22f295c5fec033a881b915e | refs/heads/master | 2020-03-30T03:56:33.603433 | 2018-10-01T08:22:13 | 2018-10-01T08:22:13 | 150,716,231 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,306 | cpp | User.cpp | #include "User.h"
#include <iostream>
#include <vector>
// ----- Getters ----- //
// Function to get the userID of the user
int User::GetUserID() { return userID; }
// Function to get the username of the user
std::string User::GetUsername() { return username; }
// Function to get the account number of the user
int U... |
9787190ec2e27241f3b73aaac035b640ee21662c | a5e05718b6f8b402141e6cfd963b340c613200bc | /Submodules/mxml/src/mxml/parsing/MeasureHandler.h | d2b54fd515b235f85255370cf2584467c5dd27a9 | [
"MIT"
] | permissive | yk81708090/musitkit | 8617699d49da9ddea0dc28897c0f6a0895fac9de | 7d57e4dd3a21df2dc82f6725accdd89a8560d7d2 | refs/heads/master | 2022-04-07T08:23:46.894850 | 2019-12-20T19:25:29 | 2019-12-20T19:25:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,647 | h | MeasureHandler.h | // Copyright © 2016 Venture Media Labs.
//
// This file is part of mxml. The full mxml copyright notice, including
// terms governing use, modification, and redistribution, is contained in the
// file LICENSE at the root of the source code distribution tree.
#pragma once
#include <lxml/BaseRecursiveHandler.h>
#include... |
0d624751a06c54715a4860f1c7f3ca543d0bf1ba | e013ec787e57af5c8c798f5714d9f930b76dfd32 | /Solutions/Codeforces Solutions/101020-D_Sequences.cpp | dea1ad6dd082fbdfc8bf27c8c5260726604c28cf | [] | no_license | omaryasser/Competitive-Programming | da66cb75bf6ed5495454d2f57333b02fe30a5b68 | ba71b23ae3d0c4ef8bbdeff0cd12c3daca19d809 | refs/heads/master | 2021-04-29T00:39:29.663196 | 2019-02-19T04:20:56 | 2019-02-19T04:20:56 | 121,832,844 | 17 | 8 | null | null | null | null | UTF-8 | C++ | false | false | 53 | cpp | 101020-D_Sequences.cpp | https://codeforces.com/gym/101020/submission/20176490 |
de5e8180c38a45895457f3f7a6c0dd02b182210b | ffff723a6c8527b45299a7e6aec3044c9b00e923 | /PS/BOJ/11005/11005.cc | ea7fffe4ddd777f8510acbf44686121b2eb071e9 | [] | no_license | JSYoo5B/TIL | 8e3395a106656e090eeb0260fa0b0dba985d3beb | 3f9ce4c65451512cfa2279625e44a844d476b68f | refs/heads/master | 2022-03-14T09:15:59.828223 | 2022-02-26T01:30:41 | 2022-02-26T01:30:41 | 231,383,838 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 456 | cc | 11005.cc | #include <iostream>
#include <stack>
using namespace std;
int main(void) {
stack<char> base_nums;
int number;
cin >> number;
int base;
cin >> base;
while(number > 0) {
int new_num = number % base;
char conv_num;
if (new_num < 10)
conv_num = new_num + '0';
else
conv_num = new_num - 10 + 'A';
... |
698fe30e6bbb95e74c57e0327013c2a0d6b87475 | a83378a11aa6b7f766374b50bd5082a2acb7ae54 | /Xtreme/DX11/DX11Renderer.cpp | 53b792fb0e9249dae996401ca7f75582940cd42f | [] | no_license | Spritutu/Common | 5e21579fa767621b6d3e487bdd9f12209d8f0948 | 311e512d896f563a9353c743bb0878dafcca1b5b | refs/heads/master | 2022-12-25T16:36:40.449491 | 2020-09-27T09:48:18 | 2020-09-27T09:50:10 | null | 0 | 0 | null | null | null | null | ISO-8859-2 | C++ | false | false | 124,923 | cpp | DX11Renderer.cpp | #include "DX11Font.h"
#include "DX11Renderer.h"
#include "DX11PixelShader.h"
#include "DX11Texture.h"
#include "DX11VertexShader.h"
#include "DX11VertexBuffer.h"
#include <Xtreme/XAsset/XAssetLoader.h>
#include <Xtreme/XAsset/XAssetImage.h>
#include <Xtreme/XAsset/XAssetImageSection.h>
#include <Xtreme/XAsse... |
bb043c18c2858eccaf0da3b3cc0ed00dc9e31322 | 5ecd8d226de41603f9d179c4f5255bec1c7cb81b | /morse/main.cpp | 3dfc189c1cc9cff2bd0a31aaf50e114e0ab2a30c | [] | no_license | hanganflorin/Sources-and-Algorithms | 902d249a6796323696bc81be0b18c1edf8a2ab9c | c5099b451a21ac18f944c709271754fa145e8bc5 | refs/heads/master | 2020-12-25T18:33:51.942506 | 2017-06-11T00:08:37 | 2017-06-11T00:08:37 | 93,971,485 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 404 | cpp | main.cpp | #include <fstream>
#include <cstring>
using namespace std;
ifstream is("a.in");
ofstream os("a.out");
int n, cnt = 1;
void Morse(string x );
int main()
{
is >> n;
Morse("");
is.close();
os.close();
return 0;
}
void Morse(string x )
{
if ( x.size() == n )
{
... |
05eff46118dac28eb0694b66ad4d01e6174cd068 | 5c799690bcd76010484af134132056a04ae855a0 | /src/WiFiManagerHandler.h | 2a1c8e4207b299b4a1c9b74da457539837e59141 | [
"MIT"
] | permissive | PedroDiogo/ESP8266SensorNode | f4cfb2efafe64d12b2c20a4bf89d6fb0201c01c4 | 52d9c063ccf65153e400a399c62b7444aac50d15 | refs/heads/master | 2020-03-19T18:59:08.826506 | 2018-07-07T20:18:10 | 2018-07-07T20:18:10 | 136,834,803 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 683 | h | WiFiManagerHandler.h | #ifndef WIFIMANAGERHANDLER_H
#define WIFIMANAGERHANDLER_H
#include <WiFiManager.h>
#include "ConfigManager.h"
#define CONFIGURATION_AP_SSID "HomeSensorsConfig"
class WifiManagerHandler
{
public:
WifiManagerHandler(ConfigManager *config);
void connectAndSetConfigs();
void reset();
private:
WiFiManagerParamet... |
941377092d2ef023298526edb5124ff048e3dd62 | 7591757b8897fbd664972374dfcee63b95ef7b59 | /Cpp11/function<ClassMemberObject>.cpp | dea477267c2cb6e708d115d854c632257b61501c | [] | no_license | StevenHD/LearnCSWithCpp | 02f8c6719c3285f21277bbd044742bd78fe8ce28 | bb2d0397bdeeb1c3fc3b257ac67db28082eb38cb | refs/heads/master | 2023-06-01T16:47:51.699152 | 2021-06-16T07:18:16 | 2021-06-16T07:18:16 | 365,490,841 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 910 | cpp | function<ClassMemberObject>.cpp | //
// Created by helianhaodong on 2021/4/25.
//
// fucntion 作类成员实现回调
// 类似于观察者模式
#include "../all.h"
class FunctorA
{
public:
void operator()()
{
std::cout << "class FunctorA" << std::endl;
}
};
class FunctorB
{
public:
void operator()()
{
std::cout << "class FunctorB" << std::en... |
474bdb535a56a938e6ff0fe69af12c3733cf366c | f6996face7fdbe49b73e90ecf3cc287dada9e247 | /src/plugins/phonevendors/ezx/ezxmodempinmanager.cpp | 5f8ad77aaf0c2ffdee2d1bc6cc62595867fd7b9a | [] | no_license | trollsid/qtextended-device-ezx | 56dba940ed345f668dcd882d01deede75fb828dd | 4368db50f4ea6ecc7893963a30fca138e2ce32f6 | refs/heads/master | 2021-01-23T08:04:22.572080 | 2010-03-06T14:10:18 | 2010-03-06T14:10:18 | 549,802 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,819 | cpp | ezxmodempinmanager.cpp | /****************************************************************************
**
** Copyright (C) 2000-2008 TROLLTECH ASA. All rights reserved.
**
** This file is part of the Opensource Edition of the Qtopia Toolkit.
**
** This software is licensed under the terms of the GNU General Public
** License (GPL) version 2.
*... |
a13f7157d1c7865c0f5e130a37407aaea953933b | 485779519ff79e52e5da2a0953cdb6d4f44e5abb | /ex2/meshModel.cpp | b98237fd6ab1a413c62fb0a5e08486b61aaf5cd7 | [] | no_license | huajian1069/Geo3D-ex | 6de1d2c53d03e01cb35d0a22e93da8b9fc3ab1e4 | e1f6efc2c8c75f94810225b9ac0ab87f9063028d | refs/heads/master | 2021-03-26T17:39:11.469625 | 2020-05-04T22:42:41 | 2020-05-04T22:42:41 | 247,727,266 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,816 | cpp | meshModel.cpp | #include "meshModel.h"
#include <QString>
#include <QtCore/QDebug>
#include <QtCore/QString>
#include <QtWidgets/QCommandLinkButton>
#include <Qt3DRender/QObjectPicker>
#include <Qt3DExtras/QTorusMesh>
#include <Qt3DRender/QPickingSettings>
extern QCommandLinkButton *info;
SceneModifier::SceneModifier(Qt3DCore::QEnti... |
a9a79f3d496238bc4a246769e9a89fbd35f4b037 | 25a8e519ed58b22655ac0fc744dd5ff5e3060288 | /code/threads/BoundedBuffer.cc | 47ceb7459d85d56ed42bfe7899c54b2a73a44749 | [
"MIT-Modern-Variant"
] | permissive | a123wyn/Nachos | 44632a37564018cf8f229eb6c45c1474c45590dc | f795e72acb7dae7b9f5f5c20baad252f8562ada3 | refs/heads/master | 2022-12-02T18:32:07.972659 | 2020-08-21T15:25:15 | 2020-08-21T15:25:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,722 | cc | BoundedBuffer.cc | #include "synch.h"
#include "system.h"
#include "BoundedBuffer.h"
BoundedBuffer::BoundedBuffer(int size)
{
// 初始化
this->maxsize = size;
head = 0;
tail = 0;
n = 0;
buffer = new char[size]();
lock = new Lock("buffer's lock");
bufferempty = new Condition("buffer is empty");
bufferfull = new Condition("buffer is ... |
c51e61ea599dd73576b88455f326d2f635f2afde | 0e074ec3c2e39eca7d40c2fd6f4470ca2f5c9748 | /ESP32-SensorBoard/lib/JSUtilities/scr/jsutilities.cpp | f879b53378758d5271be58f265e886f22447a460 | [] | no_license | MrFlexi/ESP32-SensorBoard | cf2ac00ea915211828776c9609a181a244004edb | d88df15d0c8fc90466b99511d73c1f450344826d | refs/heads/master | 2023-02-25T02:11:56.968793 | 2023-02-07T07:37:12 | 2023-02-07T07:37:12 | 267,228,567 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,219 | cpp | jsutilities.cpp |
#include "jsutilities.h"
// Local logging tag
static const char TAG[] = __FILE__;
#define SSD1306_PRIMARY_ADDRESS (0x3D)
#define SSD1306_SECONDARY_ADDRESS (0x3C)
#define BME_PRIMARY_ADDRESS (0x77)
#define BME_SECONDARY_ADDRESS (0x76)
#define AXP192_PRIMARY_ADDRESS (0x34)
#define MCP_24AA02E64_PRIMARY_ADDRESS (0x50)
... |
e9cc66e13667b5c7e994de03c8e6528b858134ec | 6edba1daadb561a52e023042a1efa63d278e5061 | /common/febird/febird-0.21/include/febird/util/throw.hpp | edcb9b91c80887bc649724f9c7f5bd298611aacb | [] | no_license | career-tankles/scrawl | 86ccaf62683ae651a0e7c21408593852c35fa1ce | 680b2d71e844d19f9537629d4be9bc655eb321f1 | refs/heads/master | 2021-01-18T18:55:28.360442 | 2014-05-15T02:44:58 | 2014-05-15T02:44:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 568 | hpp | throw.hpp | #ifndef __febird_util_throw_hpp__
#define __febird_util_throw_hpp__
#include "autofree.hpp"
#include <boost/current_function.hpp>
#define FEBIRD_THROW(Except, fmt, ...) \
do { \
febird::AutoFree<char> msg; \
int len = asprintf(&msg.p, "%s:%d: %s: " fmt, \
__FILE__, __LINE__, BOOST_CURRENT_FUNCTION, \
##__V... |
b704eff7594ba43a06105227c72b654698b84e5e | d2bb671cef1678f8e6370da97f5e9ae161ef1c86 | /suil/file.h | 4fa698e89d166a87b94373ecf5e83ce53c900400 | [
"LicenseRef-scancode-other-permissive",
"MIT"
] | permissive | suilteam/suil | f964539566d5dd5138e828e2631f2c08511c14dd | 5cc143891147cb9bec1448d3f319cead9b4ccad9 | refs/heads/master | 2021-09-28T10:48:00.736081 | 2021-09-17T19:28:37 | 2021-09-17T19:28:37 | 283,538,168 | 0 | 0 | MIT | 2021-09-17T19:28:38 | 2020-07-29T15:39:37 | C++ | UTF-8 | C++ | false | false | 9,746 | h | file.h | //
// Created by dc on 12/11/18.
//
#ifndef SUIL_FILE_H
#define SUIL_FILE_H
#include <fcntl.h>
#include <libmill/libmill.h>
#include <suil/zstring.h>
#include <suil/buffer.h>
#include <suil/logging.h>
namespace suil {
/**
* File provides asynchronous operations for writing
* and reading from files. I... |
8b64843cbfeebb6216bf86e55fc122aa04ba87fe | ea6c500b2f82f889d10ae4c2a9f54359f210c4b3 | /src/string/missingCharsforPangram.cpp | 00df48f2cf81b8f5f977f21b7262ed047b8abfca | [] | no_license | ranjithtamil/cplusplus | 8de4a28c6f49a6991548fb676c28ef1fec828ebe | 69ad0f4cf42ccc47f4346ec9095d08e884a95863 | refs/heads/master | 2021-06-20T07:29:29.427222 | 2021-01-29T03:32:40 | 2021-01-29T03:32:40 | 174,779,654 | 0 | 2 | null | 2021-01-04T23:24:32 | 2019-03-10T04:57:34 | C++ | UTF-8 | C++ | false | false | 1,225 | cpp | missingCharsforPangram.cpp |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
void missingCharsForPangram(char a[],vector<char> &b)
{
map<int,int> chrmap;
chrmap.clear(); //Very important too.
b.clear(); //Very Important to clear Vector. Else you get inconsistent output.
for(int i=0;a[i]!='\0';i++)... |
6c6281dea324d78292faea405d034978c0d80586 | ce7e834bb8f610828324f9eaa782f2b51bd9d3cf | /Classes/Role.h | c1d1ba680ee7a40da8572a039655e09a010afcbe | [] | no_license | fungamescn/ProjectX | a5b6cc4c07c8327f3892176513ebdbc228fcbbe0 | 7e9288de9e146dd9f9d5c66912a3fe9636b2e05a | refs/heads/master | 2021-01-01T04:56:43.191666 | 2016-04-24T13:49:31 | 2016-04-24T13:49:31 | 56,973,903 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,166 | h | Role.h | #ifndef __ROLE_H__
#define __ROLE_H__
#include <list>
#include "cocos2d.h"
#include "Base.h"
#include "RoleAI.h"
#include "Attribute.h"
#include "HpBarBase.h"
#include "Config.h"
#include "cocostudio/CocoStudio.h"
using namespace cocostudio;
enum ROLE_STATE
{
ROLE_STATE_STAND,
ROLE_STATE_MOVE,
ROLE... |
f97f11c9e1b5366d90dd856b438dbc88db4c9530 | 7d8e61d16c33f38504552aef72468a7ab5258fb0 | /A1 - Counting Inversions/Source.cpp | 886a3a71ff5ca359ba632fd68a906290c000573f | [] | no_license | kaczorrrro/Stanford-Algorithms-1 | 08ece35ed461a01496acd7a68ca16698e9293f23 | 8b2ed79400948750bef2faa2990ed2f0c21963c3 | refs/heads/master | 2021-01-21T10:20:01.943909 | 2017-02-28T09:13:44 | 2017-02-28T09:13:44 | 83,412,334 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,830 | cpp | Source.cpp | #include<iostream>
#include<fstream>
#include<vector>
#include<string>
#include<ctime>
using namespace std;
vector<int> countInversions(vector<int> v, long long &invSum) {
if (v.size() == 1)
return v;
int totalElements = v.size();
int middle = totalElements / 2;
vector<int> left = countInversions(vector<int>... |
d9f4a5c27ed7f2d3a4e00fad39859235dc6ff237 | c5a0d8d899238fcfcbde91e6bd05872441ce93d6 | /LRUCache/LRUCache/LRUCache.cpp | e9430e3c056265339248315562816a3a926b10f6 | [] | no_license | jatbains/Code-Samples | 239a7f83086030d30daddefe98fa0cd33c93f1bb | 92b6819b5a40608fe5ecf037198efd74d5404cb6 | refs/heads/master | 2023-05-14T15:31:48.814836 | 2021-06-06T01:28:36 | 2021-06-06T01:28:36 | 212,496,929 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,644 | cpp | LRUCache.cpp | // LRUCache.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
#include <vector>
#include <list>
#include <unordered_map>
using namespace std;
typedef pair<int, int> val;
class LRUCache {
private:
int csize;
list<val> cache;
unordered_map<int, l... |
38705e9ae14d35b274cb590c0a91f79dc7df4493 | cbf21a42a47eca7b4ed61c17be218e99d5338558 | /ss.cpp | 0f7dd7eee39e136e3c3211a87c4918cfe89fa2ea | [] | no_license | exgsan/syntax-check | 04773d339cc8ad5d48482e80d4f582cc580bd4ec | 84eb916e830fb425865e5571cfab980f805e0efa | refs/heads/master | 2016-09-10T20:11:43.762963 | 2015-06-19T05:09:55 | 2015-06-19T05:09:55 | 37,701,417 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,171 | cpp | ss.cpp | #include "StdAfx.h"
int symbol[][4]=
{
1, 1, 1, 0,
1, 0, 0, 1,
0, 1, 1, 0,
1, 0, 0, 1
};
int symbol_type( char s)
{
if( s>='0' && s<='9')
return 0;
else if ( s=='+' || s=='-' || s=='*' || s=='/')
return 1;
else if ( s=='(')
return 2;
else if ( s==')')
return 3;
else
return 4;
}
void process(char *exp... |
dbf11a2f5487199cf34b5840cd3c5bbd833702a3 | ceb020fee45a01645f0b2adc118483c6cf296226 | /RemoveDuplicatesFromSortedList2.cpp | 0748987a8c370281f19e1eb73f9e60fae7439fa3 | [] | no_license | anaypaul/LeetCode | 6423c4ca1b0d147206c06ebb86c9e558a85077f2 | 667825d32df2499301184d486e3a674291c0ca0b | refs/heads/master | 2021-09-28T06:05:21.256702 | 2020-10-12T04:01:46 | 2020-10-12T04:01:46 | 153,226,092 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,377 | cpp | RemoveDuplicatesFromSortedList2.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if(head == NULL || head->next == NULL){
return head;
}
... |
f3c318464e6dfa127b07e1199a4a8d54094eeadf | c1737c2e3d1d91b0ac29a7885e536c09ed75f43c | /src/image.cpp | 074d01541699c190088115c7866e869574fc068b | [] | no_license | SethKasmann/sdlx | 8e0fe786ee398107fe9db17dc0e0a85d890fdb6f | 704c4db59214de1493caf8f14cd42953b88def6c | refs/heads/master | 2021-01-20T21:19:35.568742 | 2017-08-29T18:46:17 | 2017-08-29T18:46:17 | 101,763,947 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,654 | cpp | image.cpp | /*
* SDLX, a SDL graphics library for CS students.
* Copyright (C) 2017, Yihsiang Liow, Seth Kasmann
*
* 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 3 of the License, or (... |
357b6760ae267b27873143579822e9b269d6b9bc | 3d26e9deaf7cdeae9b682cc2fb71a83b786bb1a4 | /pedestrian/source/test/diffEvoTest.cpp | 9e51938b5eec694f34e21353ae9f95399284fdaa | [] | no_license | peiyongxia/diploma-thesis | 1779cda6cba670013bf09fd12c97de8413c51bf0 | 82c95a6a47c5d4744255c7cca95d49d9021eda14 | refs/heads/master | 2020-03-19T15:49:55.303968 | 2018-04-29T12:14:14 | 2018-04-29T12:14:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 681 | cpp | diffEvoTest.cpp | #include "diffEvoTest.h"
double DiffEvoTest::EvaluteCost(std::vector<double> inputs) const
{
SvmTest st;
st.preprocessing();
st.setParams((int) inputs[0] * 1000, inputs[1], inputs[2], inputs[3]);
return (1 - st.process());
}
unsigned int DiffEvoTest::NumberOfParameters() const
{
return m_dim;
}
std::vector<de... |
9f15e7d94bb86c0c9ee9389ce7ebed531bc723c3 | 3ae7e15a25e872391f720a44ed0fec682af88d34 | /Code/CommonUtil/FileUtils.cpp | aab0a17a6178b46ff89612ea12e4da8c48ea83f3 | [] | no_license | petersbingham/Brainer | 486193ed63f3daa6574e22c933f4b0d2c5707688 | 77797146b7091da654c3d6c0ef46f316b9dbd56b | refs/heads/master | 2018-10-30T23:47:34.185279 | 2018-08-23T22:07:24 | 2018-08-23T22:07:24 | 100,266,976 | 0 | 0 | null | 2018-08-23T22:07:25 | 2017-08-14T12:49:27 | C++ | UTF-8 | C++ | false | false | 5,003 | cpp | FileUtils.cpp | //---------------------------------------------------------------------------
#include "stdafx.h"
#include "AppException.h"
#include "FileUtils.h"
#include <stdio.h>
#include <direct.h>
TFileNames::TFileNames()
{
next = NULL;
mpc_FileName = NULL;
}
TFileNames::~TFileNames()
{
if(mpc_FileName) {
delete mpc_FileNa... |
22196c7510657b9e634cf032f29e2d78011eac7d | ae31542273a142210a1ff30fb76ed9d45d38eba9 | /src/backend/gpopt/translate/CQueryMutators.cpp | 2c96a6cdb8ee6e28445a37b37baa548f138af745 | [
"Apache-2.0",
"LicenseRef-scancode-generic-cla",
"PostgreSQL",
"OpenSSL",
"LicenseRef-scancode-stream-benchmark",
"ISC",
"LicenseRef-scancode-openssl",
"LicenseRef-scancode-other-copyleft",
"LicenseRef-scancode-ssleay-windows",
"BSD-2-Clause",
"Python-2.0"
] | permissive | greenplum-db/gpdb | 8334837bceb2d5d51a684500793d11b190117c6a | 2c0f8f0fb24a2d7a7da114dc80f5f5a2712fca50 | refs/heads/main | 2023-08-22T02:03:03.806269 | 2023-08-21T22:59:53 | 2023-08-22T01:17:10 | 44,781,140 | 6,417 | 2,082 | Apache-2.0 | 2023-09-14T20:33:42 | 2015-10-23T00:25:17 | C | UTF-8 | C++ | false | false | 53,087 | cpp | CQueryMutators.cpp | //---------------------------------------------------------------------------
// Greenplum Database
// Copyright (C) 2012 EMC Corp.
//
// @filename:
// CQueryMutators.cpp
//
// @doc:
// Implementation of methods used during translating a GPDB Query object into a
// DXL Tree
//
// @test:
//
//------------------------... |
c0c86d0bba0c76addb1237b0fa17c4dcac107e6e | ea7434d4d17149932d14c79f2f59dc2cc4aa05b3 | /HE1.7.cpp | c5f9069a0b3d623f8a571e1c56e26e25ff390036 | [] | no_license | siddharthsaumya/OOP-Ass-1 | da94c274be3cf5fe86da4a97e45a8e47607b408d | d6c16bec9a977aed1c270e2435bcb6a8acb51b47 | refs/heads/master | 2022-12-02T17:17:17.347940 | 2020-08-04T14:17:21 | 2020-08-04T14:17:21 | 285,001,125 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,226 | cpp | HE1.7.cpp | #include<iostream>
using namespace std;
// Returns maximum repeating element in arr[0..n-1].
// The array elements are in range from 0 to k-1
int maxRepeating(int* arr, int n, int k)
{
// Iterate though input array, for every element
// arr[i], increment arr[arr[i]%k] by k
for (int i = 0... |
349c453b452492f21aafdcec8679f9fd29792d40 | dfd64f551a3d6a9e6626518a15e28b14e45a3f4f | /leetcode_c/frequent_element.h | e6b12828dd3c885b844296ca6eef3eb9294dc6fb | [] | no_license | shadowwalker2718/data_structure_algorithm | 36bce2394be42f527b28a224f4e5cb49a56c08f6 | c40ef3212e3f12aee414c7bbd31feb62105853c0 | refs/heads/master | 2021-05-01T11:52:29.290761 | 2018-01-23T01:29:25 | 2018-01-23T01:29:25 | 74,696,374 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 802 | h | frequent_element.h | #pragma once
#include "henry.h"
namespace _frequent_element {
void frequent_element(vector<int> nums, int k) {
map<int, int> m;
for (int i : nums) {
if (m.size() < k-1)
m[i]++;
else
for (auto it = m.begin(); it != m.end();)
if (--m[it->first] == 0)
... |
2e7da48dc8b23f33538b3c1c6dce1773f00cdb82 | a54188c3302fce4372c30c9fa973394614c2ca33 | /src/misc/netstorage/object.hpp | 99fcadab1a2450873b4937f566e402b758a354ac | [] | no_license | DmitrySigaev/ncbi | 5747f36076a80bf4080c09315ab3e95a4ea0dc58 | 088aa1b09693e1b6241582f017f859b8e5600e8a | refs/heads/master | 2021-01-01T05:07:57.992119 | 2016-05-10T18:23:57 | 2016-05-10T18:23:57 | 58,489,985 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,352 | hpp | object.hpp | #ifndef MISC_NETSTORAGE___OBJECT__HPP
#define MISC_NETSTORAGE___OBJECT__HPP
/* $Id$
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "Un... |
d64331bc5d8b6d4a32a7427d6ae8ad9559fdce0a | dec6eb1e04c123c932be1fe6d1fde095177b866b | /ghost/src/3d/TT_Box.cpp | 9734473a459f8e1b6ec6199a5edb402123c2bad7 | [] | no_license | yty/ghost | 62c82dc0c8e4aae40ad15efa342172b62bc84eac | fa06d1ec54759a3f2bc72c9a7397484156ec0257 | refs/heads/master | 2021-01-22T15:50:48.624059 | 2012-06-18T00:35:27 | 2012-06-18T00:35:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,986 | cpp | TT_Box.cpp | //
// TT_Box.cpp
// ghost
//
// Created by Thomas Eberwein on 24/04/2012.
// Copyright 2012 __MyCompanyName__. All rights reserved.
//
#include "TT_Box.h"
void TT_Box::build()
{
float h = 1;
mesh.clear();
ofVec3f vertices[] = {
ofVec3f(+h,-h,+h), ofVec3f(+h,-h,-h), ofVec3f(+h,+h,-h),... |
f3184dc3bfeae9b0a72945b05e8e7494062201c3 | c24fd3736a20c701a8ebe5a5656240a4f49949c7 | /Source/Teme/Tema2/Obstacle.h | 27545a4e60aa8244eb1930f03909ba3fdfa4fc6c | [
"MIT"
] | permissive | adinasm/EGC | 546ef2536a2e2623d109633cb53d6cf3da9c9e7b | 01b51ed98790635bcec723253a771d8b98c09b4b | refs/heads/master | 2021-01-01T02:40:13.477791 | 2020-02-08T15:10:39 | 2020-02-08T15:10:39 | 239,145,456 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 638 | h | Obstacle.h | #pragma once
#include <Component/SimpleScene.h>
#include <Core/Engine.h>
class Obstacle
{
public:
Obstacle();
~Obstacle();
int getObstacleCount();
float getObstacleDistanceAngle();
float getRadiusX(int index);
float getRadiusY(int index);
float getAngle(int index);
void setAngle(int index, float value);
fl... |
b20bccf22c335cf9e420a93d8b5594247b1fe6b5 | cb233ee8ca1c0bf530bb00c4edf1cbc7426ba326 | /vetor3.cpp | 72517d0d01a6c791b83a0c17c0a635ee9c8f879d | [] | no_license | MykeDrn/exercicios-vetor | a27c203dd6d2917dd30953abf2df7b8c9b8b9902 | a8cd1a3e7c670d2b59483d5dbddc483d584c502f | refs/heads/main | 2023-01-22T21:08:23.520509 | 2020-11-22T16:03:30 | 2020-11-22T16:03:30 | 315,076,049 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 401 | cpp | vetor3.cpp | #include <iostream>
using namespace std;
int main(){
int n[20] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 2, 3, 4, 5, 6, 7, 8, 9, 10}, a, cont = 0, eq = 0;
cout << "informe o numero: ";
cin >> a;
for(cont; cont < 20; cont++){
if(n[cont]==a){
eq++;
}
}
... |
ab4d4e9f100d9d20693764e556b30b7f8de8fb06 | 48d13d5b04dd6f94d67ca68196d778897c71be77 | /src/rophy/vk/vk_command_buffer_allocator.cc | 958034f78f43b4a4479f3733a3981c744d0a3145 | [] | no_license | jaesung-cs/rophy | 15ca806b1a537cc955ee64eec64b45f0b86200b6 | 29d8f9011ef8a3511e4ecf1f22960130634d01ec | refs/heads/master | 2022-12-09T17:58:11.356417 | 2020-09-06T03:46:08 | 2020-09-06T03:46:08 | 292,987,768 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,532 | cc | vk_command_buffer_allocator.cc | #include <rophy/vk/vk_command_buffer_allocator.h>
#include <iostream>
#include <rophy/vk/vk_exception.h>
namespace rophy
{
namespace vk
{
CommandBufferAllocator::CommandBufferAllocator(Device device, CommandPool command_pool)
: device_(device)
, command_pool_(command_pool)
{
allocate_info_.sType = VK_STRUCTURE... |
816d3e0d599b147b2831237a9f336023181e54fa | 1b73c418ede5b941aac33e986e251ebe9683af6a | /competitive/Graph 2/djikstra.cpp | 7e6f1223f48e2d70c171b1f2e74097357c64baae | [] | no_license | gauravengine/CPP_Freak | 492e7478c5e3bcb08e641b160c69e247b21f5503 | 0f98c2cd943d062578cc30839524d1814af0efa3 | refs/heads/main | 2023-08-02T04:10:32.720437 | 2021-09-22T09:21:04 | 2021-09-22T09:21:04 | 313,554,738 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,433 | cpp | djikstra.cpp | #include<bits/stdc++.h>
using namespace std;
int min_distance(int* distance , bool* visited , int v){
// returns min distance from unvisiteds
int min=-1;
for(int i=0;i<v;i++){
if(!visited[i] && ( min==-1 || distance[i] < distance[min] ) ){
min = i;
}
}
return min;
}
void djikstra(int** edges , int v... |
b9e055749b688f29ecb5132a631092e98447e0d9 | edab58696afb07657232f17490b24c8e1e11b6c2 | /miscellanious/bfs_weighted_faster.cpp | 6d6782b44bef50731af0bef59a02717e08ce25e6 | [] | no_license | mhcayan/competitive-programming | cd8e08da67138cfbdcd2d47cd70572a7fc6435fd | f80ab6929a5d2eb780d35679688ea39138cf9e8a | refs/heads/master | 2022-05-27T15:03:46.147224 | 2022-05-22T00:21:29 | 2022-05-22T00:21:29 | 161,851,714 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,063 | cpp | bfs_weighted_faster.cpp | #include<cstdio>
#include<vector>
#include<queue>
using namespace std;
//#define push_back pb
#define SIZE 200
const int inf=2000000000;
long count1,count2;
vector<long>edge[SIZE],cost[SIZE];
long bfs(long s,long d,long n)
{
long dis[10000],status[10000],i,u,v;
for(i=0;i<=n;i++)
{
status[i]=0;
dis[i]=inf;
}
qu... |
3a02a5c0ca847b8729e1294e0c56265b2f392da6 | 66b3ef6a474b25487b52c28d6ab777c4bff82431 | /old/v2/src/mouse/mackAlgoTwo/Maze.cpp | fe84ba7068cfbc36be45b3b179570b8d17ddf3a8 | [
"MIT"
] | permissive | mackorone/mms | 63127b1aa27658e4d6ee88d3aefc9969b11497de | 9ec759a32b4ff882f71ad4315cf9abbc575b30a1 | refs/heads/main | 2023-07-20T06:10:47.377682 | 2023-07-17T01:08:53 | 2023-07-17T01:29:31 | 14,811,400 | 281 | 73 | MIT | 2023-07-08T09:59:59 | 2013-11-29T22:36:30 | C++ | UTF-8 | C++ | false | false | 2,255 | cpp | Maze.cpp | #include "Maze.h"
namespace mackAlgoTwo {
byte Maze::m_data[] = {0};
Info Maze::m_info[] = {0};
byte Maze::getX(byte cell) {
return cell / HEIGHT;
}
byte Maze::getY(byte cell) {
return cell % HEIGHT;
}
byte Maze::getCell(byte x, byte y) {
return x * HEIGHT + y;
}
bool Maze::isKnown(byte x, byte y, byt... |
c381c71e23d37787980747da412f0a2676951e62 | fe05f22c9e6be4ab8d7e1e3971c1b69102f31d1c | /lib/vfs/zdos.cc | aa47bb7ae89ca4b016c47fd5a61d7076dd79b83d | [
"MIT",
"GPL-2.0-only",
"LicenseRef-scancode-public-domain",
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference",
"Unlicense"
] | permissive | davidgiven/fluxengine | 53b3d5447c69b8fa9d04ccc5481f662e2554dc5a | 9e61670116f6ececa3e51acfc50b196f74df5bb3 | refs/heads/master | 2023-09-01T08:05:34.560835 | 2023-08-20T20:00:51 | 2023-08-20T20:00:51 | 149,908,319 | 309 | 70 | MIT | 2023-08-20T20:01:44 | 2018-09-22T19:05:57 | C++ | UTF-8 | C++ | false | false | 9,115 | cc | zdos.cc | #include "lib/globals.h"
#include "lib/vfs/vfs.h"
#include "lib/config.pb.h"
#include "lib/layout.h"
#include <iomanip>
/* See
* https://oldcomputers.dyndns.org/public/pub/rechner/zilog/zds/manuals/z80-rio_os_userman.pdf,
* page 116. */
enum
{
ZDOS_TYPE_DATA = 0x10,
ZDOS_TYPE_ASCII = 0x20,
ZDOS_TYPE_DIR... |
f30bc114a946a41740fcfdbd523e18c36f799c54 | cb80a8562d90eb969272a7ff2cf52c1fa7aeb084 | /inletTest10/0.028/k | 6d39c0f74b766b95c428072cda86cd287cdfbda4 | [] | no_license | mahoep/inletCFD | eb516145fad17408f018f51e32aa0604871eaa95 | 0df91e3fbfa60d5db9d52739e212ca6d3f0a28b2 | refs/heads/main | 2023-08-30T22:07:41.314690 | 2021-10-14T19:23:51 | 2021-10-14T19:23:51 | 314,657,843 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 96,201 | k | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v2006 |
... | |
b8ab38c5eab89ce15baabde3ed458784962a9466 | e9bfd0de76a01de74baf3c7b993c1e1b91095cd1 | /apps/DirectMemoryAccess/Demo/Effect.h | 5febdbdfc8e8f15f776573a254337c9bb91f3470 | [] | no_license | UIKit0/mowa.cc | 95ea22c88aff4f893614ec0deb6016bc3476677a | 91ec92a6345148a41b2df7c3f126d2048e43f2ba | refs/heads/master | 2020-04-06T04:38:53.029613 | 2010-01-15T15:29:49 | 2010-01-15T15:29:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 475 | h | Effect.h | /*
* Effect.h
* DMA
*
* Created by vorg on 2009-10-17.
* Copyright 2009 Vorg. All rights reserved.
*
*/
#ifndef EFFECT_H
#define EFFECT_H
#include "Utils.h"
using namespace flow;
class Effect {
public:
Effect() {}
virtual ~Effect() {};
virtual void draw() {};
virtual void onMouseDown(int x, int ... |
93502c1bf689d5a0373f685fc67134309a156ec7 | eeb014a48d22e38bb4f866838c06f64ac2b4f4c6 | /recursion/findPath.cpp | 6245b353b7de08c4eca46f5ee1c4f5014f3671a0 | [] | no_license | oumkale/Geeks-For-Geeks-Work | 8cb2b7948fe1afc4dfa18d6d30f9ca1fc83db9cf | 96893a593b8e1dc03e0d8d3d23c279cd7968e1e6 | refs/heads/master | 2021-03-02T18:24:41.660387 | 2020-03-08T21:55:02 | 2020-03-08T21:55:02 | 245,893,402 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 409 | cpp | findPath.cpp | #include<iostream>
using namespace std;
int countway(int i,int j, int n, int m)
{
if(n==i && m==j)
return 1;
if(i>n || j>m)
return 0;
int c1 = countway(i+1,j,n,m);
int c2 = countway(i,j+1,n,m);
return (c1+c2);
}
int main()
{
//code
int t;
cin>>t;
while(t--)
{
int n,m;
ci... |
d850124283812390d4cb0944e8169a44737f0eab | 7e69c1476e8a8a46ba0a0a72b5ec2f0b6bfb23f1 | /analyscep.cc | f6eb95d0a4a7a2f29662167c2b42244d410376a0 | [
"MIT"
] | permissive | mieskolainen/DREM-PID | 9e1be57f700e6bb2704d3018ebeb6e3789714478 | d6594ea0e7b21a1ec55785bd8e26c5b27702b033 | refs/heads/master | 2021-09-06T21:30:35.474592 | 2018-02-11T19:47:25 | 2018-02-11T19:47:25 | 115,795,780 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 46,655 | cc | analyscep.cc | // Multichannel Double Recursive Frequentist-Bayesian Particle Identification (pion, kaon, proton, electron etc.)
//
// COMPILE with: root analyscep.cc+ -b -q
//
// TODO: write down a C++ class of this.
//
//
// mikael.mieskolainen@cern.ch, 2018
// C++
#include <iostream>
#include <cmath>
#include <vector>
#include <... |
54c348bd31ffc712992cf9cb6d8a7f89e0da2127 | 04b9e26e4036465ea1038e4ad42406fe95eb9079 | /transaction.hpp | 495cf99d6429115232d35383b9f457cf95d78006 | [] | no_license | prakhar-gupta/cryptocurrency-simulator | 402a057ee7cdbea9af9292f827415bb79afb8a1b | eb4867cfc0c29868f8c7ff41e2b6ab6f4bf82cbf | refs/heads/master | 2021-03-24T12:43:31.843636 | 2018-02-14T18:03:36 | 2018-02-14T18:03:36 | 120,280,634 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 79 | hpp | transaction.hpp | struct Transaction {
int id;
int from;
int to;
float value;
};
|
b04a76df3c0ad95d8c33410061c6f3ffac1a7349 | 271a57344dcb49a80feae682ecc1d39f991eec81 | /src/providerifcs/oop/OW_OOPProtocolCPP1.cpp | 384692b3204cce85601d5ba0770556c5442de752 | [
"BSD-3-Clause"
] | permissive | kkaempf/openwbem | b16f7b8f0db6c1dbe1ee0467f7ab1b543253ea35 | b923c1fffd0e7f5489843c8c3b3850c50880ab9b | refs/heads/main | 2023-03-16T00:41:34.967003 | 2023-02-21T06:59:50 | 2023-02-21T06:59:50 | 5,981,070 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 34,596 | cpp | OW_OOPProtocolCPP1.cpp | /*******************************************************************************
* Copyright (C) 2005 Quest Software, Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of s... |
a0e92a1f54f6d4299a2c4f1d71d159bc0b8b71b9 | 1075f2ad320c48a245c8f2b795621b773c3375db | /module_1/ex00/Pony.hpp | 69a6f82b8bfdb7f725b6645eca8b0372fe6417f1 | [
"MIT"
] | permissive | cgriceld/42-cpp-piscine | 59d1f197a620a12605e5326aeabdcccdeff2b343 | 2d07a886f0eca3216b50a17da807c721d6684e5d | refs/heads/main | 2023-07-02T17:36:59.044027 | 2021-08-16T10:54:04 | 2021-08-16T10:54:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 286 | hpp | Pony.hpp | #ifndef PONY_HPP
# define PONY_HPP
#include <string>
#include <iostream>
class Pony
{
public:
Pony(std::string type);
Pony(int age, std::string name, std::string type);
~Pony();
void introduce(void) const;
private:
int _age;
std::string _name;
std::string _type;
};
#endif |
2ce13270f0e5d31f817cb1efc3b9891986b7f894 | de6984e84538181a52521796ad568fd11583ad1a | /src/Input_Output/Input_Output_SEDP.h | 878dc972eea184adcc0c79ae34541168921a3ed9 | [
"BSD-2-Clause",
"MIT"
] | permissive | athenarc/SCALE-MAMBA | fd75e2173319dba3227511cadd4b76f4f3c80096 | 18fa886d820bec7e441448357b8f09e2be0e7c9e | refs/heads/master | 2020-06-01T10:22:47.681564 | 2019-07-15T16:31:26 | 2019-07-15T16:31:26 | 190,745,488 | 3 | 0 | NOASSERTION | 2019-07-23T13:10:27 | 2019-06-07T13:10:57 | C++ | UTF-8 | C++ | false | false | 1,875 | h | Input_Output_SEDP.h | /*
Copyright (c) 2017, The University of Bristol, Senate House, Tyndall Avenue, Bristol, BS8 1TH, United Kingdom.
Copyright (c) 2018, COSIC-KU Leuven, Kasteelpark Arenberg 10, bus 2452, B-3001 Leuven-Heverlee, Belgium.
All rights reserved
*/
#ifndef _InputOutputSEDP
#define _InputOutputSEDP
/* A simple IO class which... |
ad11808d4579740692a50456032626ebc53c901b | 35cf83cc04635d42fcff66db499d05fd4ffb8dd1 | /src/geosick/sampler.cpp | 9119cc5854a094c4f7888edd726eaf235169c732 | [] | no_license | honzasp/geosick | 41e7da15e35679d3e061f2c12737e3eed7be2b8d | 97cd363400f1378c4a7e3bd3008d7af3e0a040b3 | refs/heads/master | 2021-03-29T06:16:33.648289 | 2020-04-04T19:08:27 | 2020-04-04T19:08:27 | 247,925,478 | 12 | 2 | null | 2020-03-28T16:22:46 | 2020-03-17T09:12:21 | C++ | UTF-8 | C++ | false | false | 3,870 | cpp | sampler.cpp | #include "geosick/sampler.hpp"
#include "geosick/geo_distance.hpp"
#include <algorithm>
#include <cassert>
namespace geosick {
// Maximum allowable time duration for interpolation between two points
static constexpr int32_t MAX_DELTA_TIME = 5*60;
// Maximum allowable distance for interpolation in meters
static const... |
b992547b419ba7bb3eda8111c771fac5ebcd526e | 87e1c219cca80d51e750bd074b6d4e6da6cd0cba | /dm/fullham.cpp | a73dead89de8582d9d74e1b7316b75f925e4c7ae | [] | no_license | olegfafurin/tasks | 645d71bf371ce07019812b4d37368650c0c22da7 | b9b1336d668095b9478f21bfb045305c4180a6d8 | refs/heads/master | 2021-08-25T09:27:52.477237 | 2021-08-04T22:57:13 | 2021-08-04T22:57:13 | 190,817,603 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,046 | cpp | fullham.cpp | //
// Created by imd on 11/2/2018.
//
#include <fstream>
#include <vector>
#include <algorithm>
#include <iostream>
#include <deque>
using namespace std;
int main() {
ifstream fin("fullham.in");
ofstream fout("fullham.out");
int n;
char a;
vector<int> b;
fin >> n;
vector<vector<char>> con... |
1971acec999357b6968b941f397c1aac2c8272de | 1491a0e10d2a7b301b07fa0d192424e54cf83013 | /ivoldual_query.cxx | 9bcb0a58faa60c95e3bbd2e133a4945c29ef429c | [] | no_license | rafewenger/ivoldual2 | 0ba82f5887a460295327753c93e1adbb9a3e0527 | 136ef8c562f6c9d4f88861092918c95910e712ed | refs/heads/master | 2020-04-01T15:12:20.434157 | 2018-10-16T17:50:33 | 2018-10-16T17:50:33 | 153,326,671 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,071 | cxx | ivoldual_query.cxx | /// \file ivoldual_query.cxx
/// Query routines for ivoldual.
/*
IJK: Isosurface Jeneration Kode
Copyright (C) 2017 Rephael Wenger
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public License
(LGPL) as published by the Free Software Founda... |
c0c611d0f514343c915162b633e0128c57d85c22 | 7e0ec0e32282307dd5bf051602cc6c2ea268452c | /src/rads/chomp/include/capd/auxil/stringOstream.h | d3ae5c7aa6727111fa20e02645a22ff85311d7f0 | [] | no_license | caosuomo/rads | 03a31936715da2a9131a73ae80304680c5c3db7e | 71cab0d6f0711cfab67e8277e1e025b0fc2d8346 | refs/heads/master | 2021-01-20T10:18:58.222894 | 2018-05-24T02:18:58 | 2018-05-24T02:18:58 | 1,039,029 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 718 | h | stringOstream.h | /// @addtogroup auxil
/// @{
/////////////////////////////////////////////////////////////////////////////
/// @file stringOstream.h
///
/// @author Marian Mrozek
/////////////////////////////////////////////////////////////////////////////
// Copyright (C) 2000-2006 by the CAPD Group.
//
// This file constitutes a p... |
39a522bbfd13ded33ac86cbadba916b54f435778 | 835a27ad699d0aa27eec37c83e8c8628b4d26ac0 | /meida/src/main/cpp/mediarecord-jni/jni/ijkmedia/ycmedia/x264/x264Encoder.h | ab5ed6f2945c8c4d4462b644fade24f498695f14 | [] | no_license | dengV/RealX | 463bd0df13ce67f8ec2957a13a3e829e59b1d87d | 6951923989b70df59c4cd35cc6fa592601de1ca2 | refs/heads/master | 2020-04-08T06:15:14.500929 | 2018-11-22T09:33:34 | 2018-11-22T09:33:34 | 159,090,711 | 2 | 0 | null | 2018-11-26T01:01:49 | 2018-11-26T01:01:49 | null | UTF-8 | C++ | false | false | 1,940 | h | x264Encoder.h | //
// Created by Administrator on 2016/9/13.
//
#ifndef TRUNK_X264ENCODER_H
#define TRUNK_X264ENCODER_H
#include "IVideoCodec.h"
#include "Mediabase.h"
#include "Macros.h"
#include <list>
NAMESPACE_YYMFW_BEGIN
class AdaptivePicBuffer;
NAMESPACE_YYMFW_END
struct X264Encoder;
class CX264Encoder : public IVideoCodec
{... |
a4c71e52997d7cb70024a18acca9a3978b41cfdc | e429ad2481bb272c9f6173474423522f5598aa94 | /include/sg14/auxiliary/safe_integer.h | 3a741fb37e0e98ecee2326bbff3dc53a820998d3 | [] | no_license | lewisgit/caffe-fixedpoint | 1b4681cd4bbe442234e0b4004f64162154aa146d | 0cfb006a18f31f7d44d6ae7bdffaa4483f85acbe | refs/heads/master | 2021-01-12T09:05:08.860277 | 2018-08-16T02:01:19 | 2018-08-16T02:01:19 | 76,762,918 | 6 | 4 | null | 2018-08-16T02:01:20 | 2016-12-18T04:39:39 | C++ | UTF-8 | C++ | false | false | 1,729 | h | safe_integer.h |
// Copyright John McFarlane 2015 - 2016.
// 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)
/// \file
/// \brief definitions and specializations that adapt boost::numeric::safe<> for use w... |
dab092d3e1726df9a26b0c4fa03ca7ca75659921 | 62642bdd1f5d3ba90064591254afe3f807986349 | /chatClient/controller.cpp | d0ec7a11678bf81eaf57e21098a5fdbc3fcd07b0 | [] | no_license | marcustedesco/ServerClientIM | cdd4441b91f65077f31824eab713e286fbb4da54 | 6c6e74267476bea9a864f6f8b532352f4af91aad | refs/heads/master | 2016-09-03T06:33:53.504381 | 2012-12-11T09:17:56 | 2012-12-11T09:17:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,205 | cpp | controller.cpp | //Marcus Tedesco and Amre Kebaish
//HW7 Group Project
//ECE 3574
//Due: Dec. 9, 2012
//controller.cpp
#include "controller.h"
controller::controller(QObject *parent) :
QObject(parent)
{
wid1 = new clientWid1();
wid2 = new clientWid2();
myClient = new client();
}
void controller::init()
{
//if co... |
feeddd1c4e865908696f0cc80c379a040375e842 | 6782c237ec6ca60ca265a9d09a6b2935f3a96b0e | /StarState.TransitionStep.cpp | ad066fe9fe7046f16fc6b676da6500d233257954 | [] | no_license | olafollgaard/Starscape | a9ca0b029954b638d0fb575e493fade50dc5f2f4 | ea7a41424b3c03b35070e5030e854d2943c6d6b0 | refs/heads/master | 2021-08-22T17:17:50.931112 | 2017-11-30T19:12:17 | 2017-11-30T19:12:17 | 112,652,225 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,202 | cpp | StarState.TransitionStep.cpp | #include "Arduino.h"
#include "StarState.h"
#define MIN_MS_BETWEEN_STEPS 10
bool StarState::TransitionStep(color_t& current)
{
float nowPct = CalcElapsedPct();
hbr_t &origin = _transition.origin;
hbr_t &target = _transition.target;
hbr_t next;
next.bri = InterpolateByte(nowPct, origin.bri, target.bri);
next.hue... |
4999c9d6c280beef3329589fa2d1bbc48fbfcd23 | d1959a86215dafeabc5ca287464e3436bbb71938 | /demo-a_declarations.ino | 573aa67ddaa9c3edd4186456e22d8ea600ff66be | [] | no_license | Faber-smythe/esp32-triple-sensor | 513628f37a8e004a7bac5612fb96ac3d27a0a538 | 94c64af71e3c768936ca837f0223ddeb1bbcaf98 | refs/heads/main | 2023-05-29T09:09:42.623021 | 2021-06-11T12:24:39 | 2021-06-11T12:24:39 | 356,995,570 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,068 | ino | demo-a_declarations.ino | /* Temperature sensor DS18B20 uses 'OneWire' instead of I2C */
#include <OneWire.h>
#include <DallasTemperature.h>
/* Light sensor BH1750 uses I2C (so 'Wire' lib) */
#include <Wire.h>
#include <ErriezBH1750.h>
/* These lib are needed to send http request to the API */
#include <WiFi.h>
#include <HTTPClient... |
500e1561a117b098e8523cd063ed13361d03576a | 2a3e204a9fd9c25c91dbe9dcb1e7e4804d493c95 | /src/server/scripts/OutdoorPvP/Ashran/AshranNPCHorde.cpp | 902ef3c6fe1fdd45d0fb0370acb97cde7ee8f9df | [] | no_license | TheGhostGroup/DynastyCore | e724ecb09ecd1ac11531b9be4e8e5de39bd4e074 | d2596357e6fad5778b4688b8d84bd3bd073a873c | refs/heads/master | 2020-07-26T05:36:59.831552 | 2019-11-06T00:26:00 | 2019-11-06T00:26:00 | 208,549,658 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 127,622 | cpp | AshranNPCHorde.cpp | ////////////////////////////////////////////////////////////////////////////////
//
// MILLENIUM-STUDIO
// Copyright 2016 Millenium-studio SARL
// All Rights Reserved.
//
////////////////////////////////////////////////////////////////////////////////
#include "AshranMgr.hpp"
/// Jeron Emberfall <Warspear Tower Gu... |
6fb2ad4c19ba478c2dadcf57125172c860b29331 | d312d534036de17b5dad24a26bf710c9fbf102f5 | /src/modules/persistence/LongCounter.h | 50101b306a74648d8d785db9aace5bf36960c968 | [] | no_license | wshmaple/engine | e9f3964e7210125b71fa0294c33df35494abb9e2 | f4ae34f9600ba0004af953a7d2447fd835ad85c4 | refs/heads/master | 2021-05-04T12:27:11.545596 | 2018-01-30T17:01:05 | 2018-01-30T18:44:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 835 | h | LongCounter.h | /**
* @file
*/
#pragma once
namespace persistence {
/**
* @brief This counter maintains a state between the value that is known in the database and the
* value that is current in the memory.
*
* @c update() will deliver the delta value that should be used to do a relative update on the database.
* Just to per... |
4fd29bd4eec178e1c0a6403963c6f8e5007e6a5d | 5918cb61b1232b9bfdedca3236a921433c89dc4b | /hydra/algorithms/time_evolution/time_evolution.cpp | 094f2edc5748d7e2f064fba6f75f81c92ca478b6 | [
"Apache-2.0"
] | permissive | awietek/hydra | 589d490fb149c18e299aa5e7589a7acbb82d4e0a | cce1bfe9c8365b03daeccaf46da4fd59c602f07a | refs/heads/master | 2023-09-01T05:41:18.135264 | 2023-08-22T08:53:38 | 2023-08-22T08:53:38 | 169,422,780 | 24 | 5 | Apache-2.0 | 2023-06-21T16:17:44 | 2019-02-06T14:55:19 | C++ | UTF-8 | C++ | false | false | 2,846 | cpp | time_evolution.cpp | #include "time_evolution.h"
#include <hydra/algebra/algebra.h>
#include <hydra/algorithms/time_evolution/exp_sym_v.h>
#include <hydra/algorithms/time_evolution/zahexpv.h>
#include <hydra/utils/timing.h>
namespace hydra {
std::tuple<double, double> time_evolve_inplace(BondList const &bonds,
... |
1326e518b37b934d85cef95740d1733e1cfeb50a | 5cbd610dd14c24ba6f2f5e8163d731126543e02d | /src/projectors/SbCylinderPlaneProjector.cpp | 56eba0da225bb6a13cd23db08785bc65b4defaed | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference",
"GPL-1.0-or-later",
"LGPL-2.0-or-later"
] | permissive | roboticslibrary/coin | f2a3ae787d85f54d41f31c596e9f7a83b72dd13d | aab30f147b2a07c252dbf94d1a59b18f576b8ce5 | refs/heads/master | 2021-08-04T18:53:04.087811 | 2021-01-13T21:33:01 | 2021-01-13T21:33:01 | 237,409,873 | 1 | 2 | BSD-3-Clause | 2020-01-31T10:42:22 | 2020-01-31T10:42:22 | null | UTF-8 | C++ | false | false | 7,158 | cpp | SbCylinderPlaneProjector.cpp | /**************************************************************************\
* Copyright (c) Kongsberg Oil & Gas Technologies AS
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* Red... |
803755c34e4fa5dfb2e7b8d28f519cbf2ffcb184 | 6dafcf4033c387e8166317db331e6dbfdede53e6 | /zmq/zhelpers.hpp | 3dbd893b8c09eb6be459c0f99fd73d6a5833b19d | [] | no_license | hungptit/experiments | fafb3519de5d47285ffda84a22a239a4148d5e79 | 9f317f90623bff638dd80864e81f663326be35c2 | refs/heads/master | 2020-04-12T08:09:37.297465 | 2018-04-03T03:56:59 | 2018-04-03T03:56:59 | 65,752,945 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,417 | hpp | zhelpers.hpp | #pragma once
// Include a bunch of headers that we will need in the examples
#include <zmq.hpp> // https://github.com/zeromq/cppzmq
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <assert.h>
#include <signal.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h> // rando... |
487b977ee1e6120dbbf09160b5f32f3ec09c43f3 | 511589c7e8141d54feb45903d18cc35a57d06380 | /Stora Spel/Network API/src/NetAPI/socket/server.cpp | a4796dd6d4c2ec8335754888bf9d3a4ac5802eac | [] | no_license | Trisslotten/robotligan | 0616f0977ceb791b1482e53953613f76059e42ff | ca1165e2d66b67d3b88087de3775316a7d2bf05a | refs/heads/master | 2021-10-13T02:03:24.256759 | 2021-10-11T20:18:24 | 2021-10-11T20:18:24 | 227,684,184 | 14 | 2 | null | null | null | null | ISO-8859-1 | C++ | false | false | 7,491 | cpp | server.cpp | #include <NetAPI/socket/server.hpp>
#include <iostream>
#include <string>
using namespace std::chrono_literals;
void NetAPI::Socket::Server::ClearPackets(NetAPI::Socket::ClientData* data) {
data->packets.clear();
}
void NetAPI::Socket::Server::SendPing() {
NetAPI::Common::Packet to_send;
to_send.GetHeader()->pac... |
88b0c2dd64ca8d0c5744f8c320917daa8b4e3141 | 5c18374f3f2fd48fa0f029183910eec54373b63c | /Geometry/Line/IsTwoSegmentsIntersect.cpp | 3921220b6a2a4d0d11891dc883cb8c151290367a | [] | no_license | nguyenchiemminhvu/Algorithms | f65984e903a8ebd64fad5ad2069d2a6a019440df | 88359a31097ebea7e76588b0c2a42880c64d1aba | refs/heads/master | 2021-08-17T00:20:26.661854 | 2021-07-03T00:46:51 | 2021-07-03T00:46:51 | 274,611,559 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,721 | cpp | IsTwoSegmentsIntersect.cpp | /*
https://www.geeksforgeeks.org/check-if-two-given-line-segments-intersect/
Given two line segments (p1, q1) and (p2, q2), find if the given line segments intersect with each other.
*/
#include <iostream>
using namespace std;
struct Point
{
float _x;
float _y;
Point(float x = 0, float y = 0)
: ... |
fa29d2646ed9072f63b27aa29c81b098c37f604e | a19ec1048939a9b06617ea52a516bfc230abdc72 | /EventHandler.h | 7a8af5688031f3488d1922ad8409b8e495374b3d | [] | no_license | natelearnscode/FPSGame | c77a50a02b77e971b91ceea233d3031c5c5220fe | d260f7e3b4aaf8e9aeafa9d26a24b395ba90fd3a | refs/heads/master | 2023-03-30T18:19:52.868835 | 2021-04-17T04:01:54 | 2021-04-17T04:01:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,732 | h | EventHandler.h | #include <SDL.h>
#ifndef EVENTHANDLER_H
#define EVENTHANDLER_H
//An event handler to handle SDL Events such as keyboard and mouse inputs
class EventHandler {
public:
bool moveForward;
bool moveBackward;
bool moveLeft;
bool moveRight;
bool isJumping;
int mouseXPos;
int mouseYPos;
EventHandler() : moveForward(f... |
132f7e52e9fd1bccf1c1db2db9437433395eb94d | 5238164634278e5b4866de0381387ebab907932b | /src/render/software_device.h | 456108ed2a09673ea212e8b60a5c2b8bfd24737b | [] | no_license | mimir-d/qkamber | dfaf96af7ebe7fc0a26f794776facd906f907d39 | 0467309923910118b280db2c7810d08b9ae75302 | refs/heads/master | 2021-12-01T02:24:35.949486 | 2021-11-24T01:36:57 | 2021-11-24T01:39:56 | 88,165,162 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,800 | h | software_device.h | #pragma once
#include "render_system.h"
#include "material.h"
#include "scene/light.h"
#include "math3.h"
#include "misc.h"
struct RenderPrimitive;
class VertexDecl;
class VertexBuffer;
class IndexBuffer;
namespace detail
{
struct make_mvp
{
mat4 operator()(const mat4& world, const mat4& view, const ... |
5dceb54e162616c04c40339231144be89d8880f0 | c62a32d47681e5a915df4f697d31d34e083e24b5 | /app/src/main/jni/sumOf.cpp | aca4c8f5778346a1dbb98886492007bc62e15c18 | [] | no_license | Belife2012/MyApplication | 0e3f1ca07bb72513300b168241c046b4ee2376e4 | 270eb9ae22f1803aaeac12c57a475a8eeb33b7bb | refs/heads/master | 2020-04-08T13:10:21.225452 | 2018-11-27T18:15:40 | 2018-11-27T18:15:40 | 159,378,527 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 452 | cpp | sumOf.cpp | #include <jni.h>
#include <string>
#include <sstream>
extern "C"
JNIEXPORT jstring JNICALL
Java_com_example_administrator_myapplication_MainActivity_sumof(
JNIEnv* env,
jobject, /* this */
jint x,
jint y) {
std::ostringstream sumChar;
int sum;
sum = x + y;
sumChar << sum... |
ba5c2837906042461cf79a1fa11e3b800e1e5570 | 5cbe916d73a7543f55b05668887d5b12cb479c17 | /src/UnscentedTransform.h | e55eccdc4f55e389e3c6a48b80cffaf88ec43ce8 | [] | no_license | jcesic/cooperation_server | da8fa42cc151a687cdc18536952ce43c73300873 | c2828922e005a7426b6d5e968a1cd42b195532f1 | refs/heads/master | 2021-01-18T08:52:23.474962 | 2017-08-15T10:42:05 | 2017-08-15T10:42:05 | 100,357,319 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,481 | h | UnscentedTransform.h | /*
* UnscentedTransform.h
*
* Created on: Nov 17, 2009
* Author: andreja
*/
#ifndef UNSCENTEDTRANSFORM_H_
#define UNSCENTEDTRANSFORM_H_
#include <Eigen/Eigen>
#include <Eigen/Cholesky>
#include <ProcessDefinitions.h>
using namespace Eigen;
class UT {
public:
SE3Mappings SEMap;
int UTCovTranAnglesToAxis(S... |
dd76115455ddcfcef484643cedda6343f05f9aa4 | 19b4aea6c829b272ae29692ccc51f9ab8dcf573f | /src/winrt/impl/Windows.UI.Input.Spatial.0.h | ab8b892be30d22d887331f11a9aad806d9260f18 | [
"MIT"
] | permissive | liquidboy/X | 9665573b6e30dff8912ab64a8daf08f9f3176628 | bf94a0af4dd06ab6c66027afdcda88eda0b4ae47 | refs/heads/master | 2022-12-10T17:41:15.490231 | 2021-12-07T01:31:38 | 2021-12-07T01:31:38 | 51,222,325 | 29 | 9 | null | 2021-08-04T21:30:44 | 2016-02-06T21:16:04 | C++ | UTF-8 | C++ | false | false | 90,182 | h | Windows.UI.Input.Spatial.0.h | // C++/WinRT v1.0.170906.1
// Copyright (c) 2017 Microsoft Corporation. All rights reserved.
#pragma once
WINRT_EXPORT namespace winrt::Windows::Devices::Haptics {
struct SimpleHapticsController;
}
WINRT_EXPORT namespace winrt::Windows::Perception {
struct PerceptionTimestamp;
}
WINRT_EXPORT namespace winrt::W... |
c78e9e6eef308986269a47e96d517b819796d5b2 | 8a1ab43a7179929fc55fcb2d5d15adb3c5e2eaed | /tst/xercesguardtest.cpp | acc04cc5c9f087802fa34cbc7cf8d11c4a3353e1 | [] | no_license | freesurfer-rge/sbexperimental | 61a7546f00d144a97729bf76d2efbf47efaf5b77 | 1c80f145b07965ac803f1ad3f9cc67128d22dcd6 | refs/heads/master | 2020-04-07T06:06:40.439568 | 2019-06-16T20:17:07 | 2019-06-16T20:17:07 | 158,122,656 | 0 | 0 | null | 2019-06-16T00:26:58 | 2018-11-18T20:11:48 | C++ | UTF-8 | C++ | false | false | 312 | cpp | xercesguardtest.cpp | #include <boost/test/unit_test.hpp>
#include "configuration/xercesguard.hpp"
BOOST_AUTO_TEST_SUITE( XercesGuard )
BOOST_AUTO_TEST_CASE( ConstructAndDestruct )
{
Signalbox::Configuration::XercesGuard g;
BOOST_CHECK( (&g) != nullptr );
BOOST_TEST_CHECKPOINT("Constructed");
}
BOOST_AUTO_TEST_SUITE_END()
|
406cc2a64aa3815bddf9800821e1086e9c0fc165 | e5cd80fd89480cbc27a177b9608ec93359cca5f8 | /799.cpp | 5d00d73b0067761c61523a4f739392f8560f320d | [] | no_license | higsyuhing/leetcode_middle | c5db8dd2e64f1b0a879b54dbd140117a8616c973 | 405c4fabd82ed1188d89851b4df35b28c5cb0fa6 | refs/heads/master | 2023-01-28T20:40:52.865658 | 2023-01-12T06:15:28 | 2023-01-12T06:15:28 | 139,873,993 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 958 | cpp | 799.cpp | class Solution {
public:
double champagneTower(int poured, int query_row, int query_glass) {
double state[query_row+1];
for(int i = 0; i < (query_row+1); i++) state[i] = 0;
state[0] = poured;
for(int curr = 0; curr < query_row; curr++){
// we will compute form... |
9cb768c295abe4a21429de184276cc95d486b252 | 3d5e0c66c32b3dd6cac8ef22529020d1380d9cda | /main.cpp | 6b4b441e6e8a1e43fb7034fb1774db0e2c311d18 | [] | no_license | cniculae/IntelligentPuzzleSolver | 8c39b2711d382af92b941c1219a072b6359bafe3 | 93a7cc8eb2d9956d02abd732a08b322d37a2172d | refs/heads/master | 2021-01-20T08:38:00.471967 | 2017-05-03T17:06:21 | 2017-05-03T17:06:21 | 90,171,813 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,481 | cpp | main.cpp | #include <iostream>
#include <vector>
#include <map>
#include <stdlib.h>
#include <time.h>
#include "State.h"
#include "TreeSearcher.h"
using namespace std;
int N;
int newX,newY;
char type;
char srch;
char rev;
char ranBr;
bool ranBool;
bool revBool;
map<pair<int,int>, char> mp;
vector<block> blocks;
int main()
{
... |
a2bc5b910b15ea146824ff29753192a00c737378 | 94a5ed13426e71a0df84ae877ec6e19d3921b853 | /lib/ofpmonitor/ServerTableSorter.h | b5e17db7c4e82f9ee62bf9b6754f47a81bce1154 | [] | no_license | Poweruser/OFPMonitor | 27aa0ce0d4d689773aeb67aadb7793aa6919666f | 7034e205996b6f548a421a34f7f586025cfec0cf | refs/heads/ooprewrite | 2021-07-22T22:11:16.426585 | 2016-01-17T15:41:08 | 2016-01-17T15:41:08 | 567,191 | 18 | 5 | null | 2020-02-10T11:21:48 | 2010-03-17T20:23:52 | C++ | UTF-8 | C++ | false | false | 1,223 | h | ServerTableSorter.h | //---------------------------------------------------------------------------
#ifndef ServerTableSorterH
#define ServerTableSorterH
#include <vcl.h>
/**
This object keeps track of how the server table is currently sorted
*/
enum ServerTableColumn { STC_ID=0, STC_NAME=1, STC_PLAYERS=2, STC_STATE=3, STC_ISLAND=4,... |
0a00ddf4bae4bdd89b25c9c41b89904b906c09a9 | 5ddab10d40231c4e187eda0bf4c8836fc876cbd8 | /codec/cplusplus/proto/query.pb.h | 9cff5ba4b5481efd1e401bc2046fdf967ab04e2b | [] | no_license | wlijie/recipes | f6c588e37a367f2a760095d3cf81ed393dc357b5 | 8e18b437e02c0ce9e16c882f28bf287569917f37 | refs/heads/master | 2020-12-16T22:18:34.335208 | 2019-03-20T09:01:33 | 2019-03-20T09:01:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 27,147 | h | query.pb.h | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: proto/query.proto
#ifndef PROTOBUF_proto_2fquery_2eproto__INCLUDED
#define PROTOBUF_proto_2fquery_2eproto__INCLUDED
#include <string>
#include <google/protobuf/stubs/common.h>
#if GOOGLE_PROTOBUF_VERSION < 3005000
#error This file was generated ... |
5e0f16ec83d7ae332ea075c372402020dcb263f3 | 009a15f3a5927ef12d2b40fda61d52774cde9fea | /router_proxy/router_proxy.h | c7d90598bc727cdc704155e44689e7240fce0a44 | [] | no_license | huixiaoke2009/router | 24d81c13393f4e9ae75c7e7bcb8b39a412f8ea8e | 6067b42513d599edf2909b17a7aeccbb50466aaf | refs/heads/master | 2021-01-10T10:06:50.545240 | 2018-05-08T12:05:58 | 2018-05-08T12:05:58 | 52,494,866 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,176 | h | router_proxy.h | /**
*note: m_ProxyReqQueue过来的数据必须封好了包头
m_ProxyRspQueue发出去的数据已经去掉包头
*/
#ifndef _ROUTER_PROXY_H_
#define _ROUTER_PROXY_H_
#include <stdint.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <string>
#include <map>
#include <string.h>
#include <vector>
#include <google/protobuf/message.h>
#includ... |
87683007e57d2b88ca2f46364d399a807e178ffb | af34bdb4de223f1f667fdbe51e096f4a8fd0a4d7 | /cbec.cpp | 8269882222f4bd36a10f985c63f09d0359007aa6 | [] | no_license | ptoyoohri/lexyacc | 4f3a4f5c87dd9928bcb8578c0b194cb75832cd4c | 022757a0c2ec1dc25829ac10eeb78d2bd7d82282 | refs/heads/master | 2022-12-18T16:58:04.546096 | 2020-09-18T10:14:10 | 2020-09-18T10:14:10 | 295,987,041 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,117 | cpp | cbec.cpp | /* *****************************************************************************
// [cbec.cpp]
//
// Copyright 2004-2004 SPRINGSOFT. All Rights Reserved.
//
// Except as specified in the license terms of SPRINGSOFT, this material may not be copied, modified,
// re-published, uploaded, executed, or distributed in any w... |
d4aef3194c9d85a2e1e2d7ac07fc615820932e82 | 3f43bd002547a363669f6dccbde4e9d4bb449b8a | /GFG/Trees/is-tree-foldable.cpp | e2a4dd2adddef9685c122ef2338142a4f664fecd | [] | no_license | Ad1tyaV/Coding-Problems | 0203ee46d9b119beaac4b0c11106f18d4e80e160 | 7423eeb790afc5a2d5ddb5cd1fa4a0a58e15a78d | refs/heads/main | 2023-07-24T10:28:47.587493 | 2021-09-08T19:54:10 | 2021-09-08T19:54:10 | 351,480,597 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,081 | cpp | is-tree-foldable.cpp | /*
$ g++ -std=c++0x foldable-tree.cpp -o isFoldable
$ ./isFoldable
Tree is foldable
*/
#include<iostream>
using namespace std;
struct Node{
int data;
Node* left;
Node* right;
Node(int data){
this->data = data;
this->left = NULL;
this->right = NULL;
}
};
Node* invert(... |
272249c257fd258a05b678eb3b271135d9b1b970 | ec4adcef06ca6aee2887d922396da7ee7a039da1 | /football/UIItemScore.cpp | 6c58dd66efb5a96323b29858921866f550fffec7 | [] | no_license | tjakubowski/sfml-football | d439e3924eecb445f3105e7662e4faa1c3468e94 | 2d9a43c064a0b170615f32d5076c2d6b5bd23985 | refs/heads/master | 2022-04-08T19:21:16.482929 | 2020-03-23T01:20:28 | 2020-03-23T01:20:28 | 176,612,792 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 916 | cpp | UIItemScore.cpp | #include "UIItemScore.hpp"
namespace Football
{
UIItemScore::UIItemScore(sf::Vector2f centerAnchor, Score score, unsigned fontSize, sf::Color color, std::string fontName, float bgPadding, sf::Color bgColor) : UIItem(centerAnchor, "", fontSize, color, fontName, bgPadding, bgColor)
{
clickable = false;
stringStre... |
9b89ad55e1612266a6ad2b0770fdb4c33ecdc93a | ed8e87a2a6829f470338c29245aa73067ea08690 | /Zork/Zork/Inventory.cpp | 4e84e5a0e05e65d20441b7c913a027e57cee2a00 | [] | no_license | SirGauci/GamesProgrammingRepo | e8b2db10e79fd910db948055988cc3b1d3dee8e9 | bbf7744ac613cd03f6cea3d99a38202aeea2b930 | refs/heads/master | 2020-09-24T21:43:28.971706 | 2016-10-17T23:44:15 | 2016-10-17T23:44:15 | 66,178,555 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 765 | cpp | Inventory.cpp | #include "stdafx.h"
#include "Inventory.h"
#include <iostream>
Inventory::Inventory(){}
Inventory::~Inventory(){}
void Inventory::Add(Item* item)
{
prInventory.push_back(item);
}
Item* Inventory::Access(std::string item)
{
for each (Item* i in prInventory)
{
if (i->getName() == item)
{
... |
30a3a98ad93bde19993a306f8e9fccbe6fc91749 | bbdce094abc58e47269117a78b61d85243b353e4 | /Maze.cpp | 190ca8b63b8c8f022429420f56657702497e1b08 | [] | no_license | nathansmith11170/MazesWithSFML | 40da7b06b49cb892fe58ec80cc664100e221edc8 | 1a2f2ff5a2405cc73beb7bbd6370e5b9a2efc21f | refs/heads/master | 2020-03-29T16:39:50.854821 | 2018-10-02T15:38:30 | 2018-10-02T15:38:30 | 150,123,719 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,633 | cpp | Maze.cpp | #include <SFML/Graphics.hpp>
#include "MatrixGraph.h"
#include <cstdio>
#include <vector>
#include <unordered_set>
#include <cstdlib>
#define WINDOW_WIDTH 800
#define WINDOW_HEIGHT 600
#define NODES 20
#define STROKE 5
/*This function returns the next vertex of the graph given by depth first
search with a recursive... |
1553b1e4dfef2459fcddc15497cb8bcb639917cc | 590ad531651d7f5f5f73baa1b3ac36866877104b | /tuxbox/neutrino/src/driver/file.h | 75de80c9cd109cc44218a9ffd6a12cd5c869da2b | [] | no_license | ChakaZulu/tuxbox_apps | 1217f53e3adc27227e0ed07de4778120e294f574 | 1a28fedaecef864ecc7d696b739795321ea3bdb1 | refs/heads/master | 2021-01-23T17:20:36.229379 | 2009-12-30T13:38:15 | 2009-12-30T13:38:15 | 129,129 | 10 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,978 | h | file.h | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: non-nil; c-basic-offset: 4 -*- */
/*
Neutrino-GUI - DBoxII-Project
Copyright (C) 2001 Steffen Hehn 'McClean'
Homepage: http://dbox.cyberphoria.org/
Kommentar:
Diese GUI wurde von Grund auf neu programmiert und sollte nun vom
Aufbau und auch den Ausbaumoeglic... |
5137ab200ebfbf4a1a3ded64950f89e6561f94bf | 54eb1f4846bd2f74b213e5c48816e523dec17b7f | /Auxiliary.h | b683eb66c84b0801c4eb3248dd2be1fff967a1e7 | [] | no_license | karvandi/KeyMgr | d91ba512ee1ef0b46e737c51e71bef506d274890 | a1e3073cc7b4afb54c73bd4a4f800e1c78be9cf2 | refs/heads/master | 2021-01-19T04:33:10.017717 | 2017-04-12T17:32:07 | 2017-04-12T17:32:07 | 87,380,516 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,139 | h | Auxiliary.h | //
// Auxilary.h
// KeyMgr
//
// part of "an example programon using the Openssl library"
//
// Created by Babak Karvandi on 04/06/2017.
// Copyright (C) Geeks Dominion LLC 2017. All rights reserved.
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will ... |
b19000c76c659d775c78e212e67dc6103cd3a1fb | 004e499a6dbbd363555b3134ac015c7374ad33a5 | /AcWing/13.4.1111. 字母 .cpp | 77a8c69bc2d99a345ba9f0010d76471bd752297c | [] | no_license | wwwkkkp/Algorithm | c8721eae64d15d60beb9ef6ce37c70b9e78e8f6d | fc4d103700212264d3d84cb374353b0476f371af | refs/heads/master | 2022-11-24T13:45:29.845925 | 2020-07-14T03:24:39 | 2020-07-14T03:24:39 | 279,460,886 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,449 | cpp | 13.4.1111. 字母 .cpp |
//13.4.1111. 字母
给定一个R×S的大写字母矩阵，你的起始位置位于左上角，你可以向上下左右四个方向进行移动，但是不能移出边界，或者移动到曾经经过的字母（左上角字母看作第一个经过的字母）。
请问，你最多可以经过几个字母。
输入格式
第一行包含两个整数 R和 S，表示字母矩阵的行和列。
接下来 R行，每行包含一个长度为 S的大写字母构成的字符串，共同构成字母矩阵。
输出格式
输出一个整数，表示最多能够经过的字母个数。
数据范围
1≤R,S≤20
输入样例：
3 6
HFDFFB
AJHGDH
DGAGEH
输出样例：
6
//dfs 自己的写法有点笨拙
#include<iostream>
using namesp... |
bbfcb5a6614c41079cd6a4504b0c52393028e459 | 8b1f827d1ae87ad9ac82fdc4f75869ec6ea75eb3 | /IO/ReadingTextFile.cpp | 86b3c6b56e236eb50f28463c3f644e31ddfce854 | [] | no_license | ByVictorrr/Beginning-Cpp-Programming-From-Beginner-to-Beyond | 0934f78c457760618dbdd2a0fdd16dc643218eb7 | 1a9a87a2f91c7d0431a9ef8d8dd2d8395e1b7425 | refs/heads/master | 2020-11-24T09:34:22.752713 | 2019-12-31T21:05:38 | 2019-12-31T21:05:38 | 228,081,587 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 463 | cpp | ReadingTextFile.cpp | #include <iostream>
#include <fstream>
void read_file(std::string file_name) {
//---- YOU WRITE YOUR CODE BELOW THIS LINE----
std::string name;
std::ifstream i_file(file_name);
if(!i_file.is_open()){
std::cerr << "Error opening file" << std::endl;
}else{
while(!i_file.eof()){
... |
68365e7199033bdf275b4666fc6c30ec80e70f0e | e98db42b7dd6f1bfffe684b976402bbce1b615f7 | /1109 false ordering.cpp | 4352ff096507e8597f6d52aa2d14a621c9207eba | [] | no_license | Shaykat/LightOJ | 274506393bb43d48cbc3b3d314f6149cbe4f13d3 | cbd62054629b0a482a14cfc49400ac6909ace03b | refs/heads/master | 2021-01-11T02:09:17.514424 | 2017-11-27T21:49:34 | 2017-11-27T21:49:34 | 70,826,832 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,377 | cpp | 1109 false ordering.cpp | #include<bits/stdc++.h>
using namespace std;
#define a 1500
vector< pair<int,int> >v;
int arr[a];
int prime[1005],k,f[20],p[20],l,t;
bool compare(const pair<int,int>&i,const pair<int,int>&j){
if(i.second == j.second) return i.first > j.first;
return i.second < j.second;
}
void sieve(){
int i,j;
k = 1;
... |
bedf2f6812b100861a5a26691579cd3d9cb418bf | f21c5df2b9a9f32913c617bf173ec4f33d48460a | /S6086643_CDodds_GPP_Server/S6086643_CDodds_GPP_Server/Card.h | 0fb79322706cdb4ae3a3b4bac7c483f7d05d36b5 | [] | no_license | Chris-Dodds-s6086643/GPP | 6588d27263bb622c0745de484cedc5655ae01923 | c6d73292e2a40f07a42b65c8ac84a178a47a99f1 | refs/heads/master | 2020-12-27T22:04:43.257493 | 2020-05-24T11:28:30 | 2020-05-24T11:28:30 | 238,075,522 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 549 | h | Card.h | #pragma once
#include <string>
#include <iostream>
enum CardSuit
{
spades = 0,
diamonds = 1,
clubs = 2,
hearts = 3
};
enum CardValue
{
ace = 1,
two = 2,
three = 3,
four = 4,
five = 5,
six = 6,
seven = 7,
eight = 8,
nine = 9,
ten = 10,
jack = 11,
queen = 12,
king = 13
};
class Card
{
public:
Card() {
... |
fd44deea886c3c2fd1da43f2ef15515b7bb94c5e | 92a575f0e26fe49806b3c490d2a870598fa5c372 | /MscAssignmentCpp/binarytodecimal.cpp | 2e7621359be5a1071cbfb3cab61dfa2e9c8c4da4 | [] | no_license | bluesaiyancodes/Basic-Computer-Conversions | 47dc81c193d32358b2da0157f01c4be9797c6a1d | 71eda9443c89c8762aac00ebe159f659ee1fef32 | refs/heads/master | 2020-04-05T20:58:53.435313 | 2018-11-12T11:01:53 | 2018-11-12T11:01:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 762 | cpp | binarytodecimal.cpp | //
// binarytodecimal.cpp
// MscAssignmentCpp
//
// Created by Bishal Blue on 01/10/18.
// Copyright © 2018 Bishal Blue. All rights reserved.
//
#include "binarytodecimal.hpp"
#include <iostream>
#include <math.h>
#define SIZE 8
using namespace std;
void binarytodecimal::initialize(){
for(int i=0;i<SIZE;i++){... |
4d91119b249d1502e24ac0c6e17d64c2a13d9c0f | db4a6991ad018a7887a59f0fa3a629320c400967 | /Tests/ClosestApproachTest.hh | 79b868c8460bc707da531d2c7950c5d0cc210f1f | [
"Apache-2.0"
] | permissive | KFTrack/KinKal | f19e195db5470b26fe01e7b9ec6a939181d4aa69 | 7533898608d8a921d689904a5de18baebe751c9d | refs/heads/main | 2023-09-01T08:43:01.205448 | 2023-08-15T21:47:09 | 2023-08-15T21:47:09 | 241,995,258 | 3 | 17 | null | 2023-09-01T21:24:06 | 2020-02-20T21:36:41 | C++ | UTF-8 | C++ | false | false | 10,209 | hh | ClosestApproachTest.hh | //
// test basic functions of ClosestApproach using KTraj and Line
//
#include "KinKal/Trajectory/Line.hh"
#include "KinKal/Trajectory/ClosestApproach.hh"
#include "KinKal/Trajectory/PointClosestApproach.hh"
#include "KinKal/Trajectory/PiecewiseClosestApproach.hh"
#include "KinKal/Trajectory/ParticleTrajectory.hh"
#inc... |
1ab595beb048a4ab48d8c5c74bc3cc3c7d793624 | 8213a319bbe4532875faa01539cc4f1e77bf78af | /btree.cpp | a8a3cba1ec9ea5b8d9f1e631bcea5cb097ab6b65 | [] | no_license | wawila/B-Tree | f93fbffe5e633bb5a33f94fa487137b8e87895c8 | e17c73e64993769ff3a8d358ed3a034418a4ff8a | refs/heads/master | 2020-05-31T21:18:28.584891 | 2015-09-20T00:53:42 | 2015-09-20T00:53:42 | 42,378,404 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 9,785 | cpp | btree.cpp | #include "btree.h"
bool Btree::insert(dtype x)
{ node *pNew;
dtype xNew;
status code = ins(root, x, xNew, pNew);
if (code == DuplicateKey)
cout << "Duplicate key ignored.\n";
if (code == InsertNotComplete)
{ node *root0 = root;
root = new node;
root->n = 1; root->k[0] = xN... |
3a96a31376c7825ab93fe14c7a6d0d52e6b9fbe9 | cb8c337a790b62905ad3b30f7891a4dff0ae7b6d | /st-ericsson/tools/platform/flash_kit/loader_communication/source/CEH/ProtromRpcInterface.h | f4c83093c31adef7a893036f696d5d721828230c | [
"Apache-1.1",
"SMLNJ",
"BSD-3-Clause",
"LicenseRef-scancode-other-permissive",
"W3C",
"Apache-2.0",
"BSD-2-Clause",
"LicenseRef-scancode-public-domain-disclaimer"
] | permissive | CustomROMs/android_vendor | 67a2a096bfaa805d47e7d72b0c7a0d7e4830fa31 | 295e660547846f90ac7ebe42a952e613dbe1b2c3 | refs/heads/master | 2020-04-27T15:01:52.612258 | 2019-03-11T13:26:23 | 2019-03-12T11:23:02 | 174,429,381 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,337 | h | ProtromRpcInterface.h | /*******************************************************************************
* Copyright (C) ST-Ericsson SA 2011
* License terms: 3-clause BSD license
******************************************************************************/
#ifndef _PROTROMRPCINTERFACE_H_
#define _PROTROMRPCINTERFACE_H_
#include "CmdRes... |
522e98160acd1f90e594278144e2188e5b6a6a03 | 1c38b1403f0024b7eaf583db01836d1bd2a1d62c | /GameEngine/Include/Component/Light.cpp | 229f856bb67753aaef3bb69e1d20c54aa13a9f30 | [] | no_license | chimec153/DirectX11-2D-Game | 46f349418fae2e4420d0eb6e768b57b0a3f4d990 | fbedaad9bc0fd33666393480be041f9fc8f89e19 | refs/heads/master | 2023-06-13T23:28:51.831499 | 2021-06-11T16:19:25 | 2021-06-11T16:19:25 | 295,000,343 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,658 | cpp | Light.cpp | #include "Light.h"
#include "../Resource/ShaderManager.h"
#include "../Camera/CameraManager.h"
#include "../Component/Camera.h"
#include "../Device.h"
std::unordered_map<std::string, Light*> Light::m_mapLight = {};
Light* Light::m_pMainLight = nullptr;
Light::Light() :
m_tCBuffer()
, m_matView()
, m_matProj()
, m... |
2f83f3363b17998830abcdc34f5d53021c563c7c | 886bf2d5c9b956fd402c351e8de15ae7f5c5ecaf | /dhruvil_11/1183/A [Nearest Interesting Number].cpp | 3226407fd94af9f42bf82cd2e04e1a2af4599b2b | [] | no_license | dhruwill/Codeforces | 7656d6013c29c25b9312ce021cd2ce8ce7f8c798 | d034a19562291dc84fe5ed914b6c0f66782708c8 | refs/heads/master | 2020-06-17T02:55:04.521369 | 2019-07-08T08:50:53 | 2019-07-08T08:50:53 | 195,772,744 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 758 | cpp | A [Nearest Interesting Number].cpp | #pragma GCC optimize ("-O3")
#include<bits/stdc++.h>
using namespace std;
#define testcase(t) int t;cin>>t;while(t--)
#define pb push_back
#define eb emplace_back
#define ll long long int
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define endl "\n"
#define imax INT_MAX
#define im... |
d81c11088476a4ad2593e3f1f7b435cdd1cb5291 | 4d78001ee2b4bafb3e7f1435e7a082fc6f634d55 | /BaseUtil/source/TaskLoop.cpp | 66c64d5f6adc1f4c35dd5e53e8c7dbdfb356d04d | [] | no_license | tanxinhua/BaseUtil | 94c751fbc23ead4f8f3346820955fc90c2d768bd | f4f59da1c5a8692b75604e9ee3220a7f97656a7f | refs/heads/master | 2020-12-09T17:12:53.627170 | 2020-01-12T11:13:03 | 2020-01-12T11:13:03 | 233,367,863 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,005 | cpp | TaskLoop.cpp | #include <deque>
#include <mutex>
#include <uv.h>
//#include "log\i_local_logger_helper.h"
#include <TaskLoop.h>
namespace BaseUtil
{
using FlowFlag = enum FlowFlag
{
FlowNone,
FlowRuning,
FlowEnd
};
}
class BaseUtil::PrivateTaskLoop {
public:
PrivateTaskLoop();
~PrivateTaskLoop();
static void WakeUp(u... |
0b5ffaca0fef8f4197dbd639a8e137e33d7f0a11 | c36e0e07b1cb968e34e894598cefec0d7b78f532 | /c/unrealpkts_generated.h | e4830153ed2ba45f88568a23d3cc62540bca21fa | [] | no_license | drFerg/ArdanFlatbuffers | db045d115739122ca55cf02c6e9969dceefb70a0 | 8fc235e0e763308f72572f572f7efd721bf33fc9 | refs/heads/master | 2023-01-11T18:26:13.941426 | 2019-12-14T22:03:06 | 2019-12-14T22:03:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,199 | h | unrealpkts_generated.h | // automatically generated by the FlatBuffers compiler, do not modify
#ifndef FLATBUFFERS_GENERATED_UNREALPKTS_UNREALCOOJAMSG_H_
#define FLATBUFFERS_GENERATED_UNREALPKTS_UNREALCOOJAMSG_H_
#include "flatbuffers/flatbuffers.h"
namespace UnrealCoojaMsg {
struct Vec3;
struct RadioDuty;
struct RadioState;
struct Mes... |
792eb8f3140bb42fde017c6154023572859809c3 | 1dca729b7bde6e6ab56a0e65f34b6498da8bc30a | /cse576_sp20_hw1-master/src/Source.cpp | 479dc4534cb2bc257a86d4b00994778651f72ea5 | [] | no_license | hua19971997/Computer-vision | 22818c5551674693a94fe3ed6af2365d3bf3439b | cf52837ff1ebd26e81a79d5cf39e8c99bfaebc41 | refs/heads/master | 2022-11-15T10:29:55.332182 | 2020-07-09T07:06:26 | 2020-07-09T07:06:26 | 275,074,155 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 397 | cpp | Source.cpp |
#include <string>
#include "image.h"
using namespace std;
int main(int argc, char** argv)
{
Image im = load_image("C:/Users/24078/Desktop/576Cv/cse576_sp20_hw1-master/data/dog.jpg");
Image gray = rgb_to_grayscale(im);
Image g = load_image("C:/Users/24078/Desktop/576Cv/cse576_sp20_hw1-master/output/... |
1e36b5d594ad41bfb7a12212f00f51fdd1621ca0 | d7e7b9f295454b916e3f47ba32c1d4558c0bcd4b | /IsolationChamber.ino | 9334e83604fbeba7da21a467a895ca5270764b6a | [] | no_license | Advik007/Luna_Iter | c116182ca537285d19c55a7fd7a3de7f719dc446 | bc644b9a695e1c40f97eecdf26e05856c4bb2bac | refs/heads/master | 2020-09-14T13:38:03.837422 | 2019-12-03T04:49:34 | 2019-12-03T04:49:34 | 223,143,111 | 0 | 0 | null | 2019-12-17T13:37:36 | 2019-11-21T09:59:53 | C++ | UTF-8 | C++ | false | false | 2,834 | ino | IsolationChamber.ino | #include <Wire.h>
#include <LiquidCrystal_I2C.h>
#include <K30_I2C.h>
const int O2Sensor = A0; //Attachment of Grove - Gas Sensor (O2) to A0
const float VRefer = 3.3; //O2 Sensor Voltage - Reference
float temp; //Temperature - Variable
int temperaturePin = A3; //Temperature Sensor (LM-35) to A3
int co2 = 0; //CO2 - Va... |
cda89baad92a0aa37219be322d3d984b62c5b68d | 6729e41cb16603032de731c434fa203924105d41 | /sudoku_solver.cpp | 9f75f39247d2f00c7781f61645457cbb7a825c7e | [] | no_license | hemantgarg923/SudokuSolver | 01e04dca7872954968a952ebd817fff5a56fc867 | 217727c5a6b4963e963b1e05aae7db5fa5b139fb | refs/heads/master | 2023-04-16T09:58:05.435102 | 2021-04-21T07:12:13 | 2021-04-21T07:12:13 | 360,067,929 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,460 | cpp | sudoku_solver.cpp | #include<iostream>
using namespace std;
// check if any cell is unassigned
bool unassignedCell(int grid[9][9], int& row, int& col){
for(row=0; row<9; row++){
for(col=0; col<9; col++){
if(grid[row][col]==0){
return true;
}
}
}
return false;
}
// che... |
baa89d4cb072fc7734087ecf9dbd2abee920482d | 4172a3e2199b324781b0ca5e9c7a35e4f3418bca | /MP6/sources/student/running_processes/process_1.cpp | f235e6f98ea6242b7ed83b02a9c1ff66516fcfe6 | [] | no_license | astro-nat/Random_Project_3_1_3 | 0707bdb3e549e755224590477652a1c641fce40d | 8adf841567c66b7b773337dd3e6d62e062769a51 | refs/heads/master | 2021-01-20T04:09:44.962564 | 2017-01-12T20:17:24 | 2017-01-12T20:17:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,772 | cpp | process_1.cpp | /* --------------------------------------------------------------------------- */
/* Developer: Andrew Kirfman, Margaret Baxter */
/* Project: CSCE-313 Machine Problem #1 */
/* ... |
07b20b96a18ed57d5b3ba1589d101a99f082760b | 401c85904267e7b8f398ba843b31d708856e015f | /benchmark/demo_benchmark.cpp | c8984d333677f29c9b68c8bc5b80ebfab52c6c75 | [
"MIT"
] | permissive | puumbaa/semester-work-graham-scan | 56a345f7d083870180c786f15b1b97abbd9f9018 | da4cc0bf94ce135a0a24e576c29576279e960796 | refs/heads/main | 2023-04-11T17:11:03.508276 | 2021-05-18T03:52:31 | 2021-05-18T03:52:31 | 365,040,538 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,398 | cpp | demo_benchmark.cpp | #include <fstream> // ifstream
#include <iostream> // cout
#include <string> // string, stoi
#include <string_view> // string_view
#include <chrono> // high_resolution_clock, duration_cast, nanoseconds
#include <vector>
#include <graham_scan.hpp>
#include "point.hpp"
using namespace std;
// абсо... |
72b828eec1049853348b0a4e4b0a123520d3f8f9 | dddf5597142861a38d3fe4bb3f3886e46ae7119e | /autoware_map/include/autoware_map/util.h | 48387062841078782cab0ee539b691addd2c8ef7 | [
"Apache-2.0"
] | permissive | neophack/utilities | 9bf7ca0011b2462cce53f8c57fff4b9f6a0c32bc | a6ce6d7c1b407e555955491874d66e7ef263d52d | refs/heads/master | 2023-09-05T07:06:30.871140 | 2019-06-27T01:22:27 | 2019-06-27T01:22:27 | 415,839,489 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,959 | h | util.h | /*
* Copyright 2019 Autoware Foundation. 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 b... |
7dac8dfc56bfa59fea21c91101438a40817a696a | dc0ec6048d18b55956b143ea1b6511f066b26bb3 | /OpenGLTest/source/renderer.cpp | 17d9e751c8fc2609e1caab968c07bc69db8d9bb8 | [
"Apache-2.0"
] | permissive | urieken/Galen | b042da7ba32550570b27ad0966ed1fb8f43fd2fb | 61fb306eace45af136456e610b02608822174aa8 | refs/heads/master | 2020-04-06T13:26:27.212163 | 2018-12-13T19:54:40 | 2018-12-13T19:54:40 | 157,500,206 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 999 | cpp | renderer.cpp | #include "renderer.h"
Renderer::Renderer()
: m_drawingMode{GL_TRIANGLES}
{
}
Renderer::~Renderer()
{
}
const unsigned int Renderer::GetDrawingMode() const
{
return m_drawingMode;
}
void Renderer::SetDrawingMode(const unsigned int drawingMode)
{
m_drawingMode = drawingMode;
}
void Renderer::SetPolygonMode(unsi... |
ce4bada44d32c760072fb35227dadcae263af482 | a1ce1c416e8cd75b51fc0a05e8483dfbc8eab79e | /Engine/source/T3D/tsPathShape.h | 942fae468d654592534bddc49f206544817c392f | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | wwhitehead/OmniEngine.Net | 238da56998ac5473c3d3b9f0da705c7c08c0ee17 | b52de3ca5e15a18a6320ced6cbabc41d6fa6be86 | refs/heads/master | 2020-12-26T04:16:46.475080 | 2015-06-18T00:16:45 | 2015-06-18T00:16:45 | 34,730,441 | 0 | 0 | null | 2015-04-28T12:57:08 | 2015-04-28T12:57:08 | null | UTF-8 | C++ | false | false | 4,537 | h | tsPathShape.h | //-----------------------------------------------------------------------------
// Copyright (c) 2012 GarageGames, LLC
//
// 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 restrictio... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.