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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e3324eb282818966c1caff6ed5cbca1b15a6ce5a | 5399d919f33bca564bd309c448f1151e7fb6aa27 | /modules/gzip/Gzip.cpp | 7bee12362f6caf06730e2d5a6887d7c8b26da334 | [] | no_license | hotgloupi/zhttpd | bcbc37283ebf0fb401417fa1799f7f7bb286f0d5 | 0437ac2e34dde89abab26665df9cbee1777f1d44 | refs/heads/master | 2021-01-25T05:57:49.958146 | 2011-01-03T14:22:05 | 2011-01-03T14:22:05 | 963,056 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,766 | cpp | Gzip.cpp | #include <string.h> // memcpy
#include "api/constants.hpp"
#include "api/IBuffer.hpp"
#include "api/IRequest.hpp"
#include "api/IModule.hpp"
#include "utils/Logger.hpp"
#include "Gzip.hpp"
Gzip::Gzip(zhttpd::api::IModuleManager*) :
_initialized(false)
{
}
Gzip::~Gzip()
{
if (this->_initialized)
this... |
e9ac22f4ab2d3223c07aab6dc62066689b9e848f | 785df77400157c058a934069298568e47950e40b | /TnbCad2d/TnbLib/Cad2d/Length/Adaptive/Info/Cad2d_CurveLength_Adaptive_Info.cxx | 24dcbcba5f213b3a07c4d05f97c44f15bf651db1 | [] | no_license | amir5200fx/Tonb | cb108de09bf59c5c7e139435e0be008a888d99d5 | ed679923dc4b2e69b12ffe621fc5a6c8e3652465 | refs/heads/master | 2023-08-31T08:59:00.366903 | 2023-08-31T07:42:24 | 2023-08-31T07:42:24 | 230,028,961 | 9 | 3 | null | 2023-07-20T16:53:31 | 2019-12-25T02:29:32 | C++ | UTF-8 | C++ | false | false | 48 | cxx | Cad2d_CurveLength_Adaptive_Info.cxx | #include <Cad2d_CurveLength_Adaptive_Info.hxx>
|
b756cd3dc0c162a206a622e3de13d5f1bc467e48 | 79be97302e0d1195aaa01f52e5fa1da540ea112f | /core/lib/hermes/hermes_internal.hpp | 9407e7bdd4120798191b74c4f7215a637b15fe3e | [
"Apache-2.0"
] | permissive | victor-smirnov/memoria | 8df7430c89b83ff9c93706dcf6100b3830c5f83a | fd203b5b081849c1a1db2d7f26b75bfd1d760a18 | refs/heads/master | 2023-05-12T20:52:19.828284 | 2023-05-01T00:02:46 | 2023-05-01T00:02:46 | 245,055,297 | 11 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,020 | hpp | hermes_internal.hpp |
// Copyright 2022 Victor Smirnov
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to... |
aa5f2a31417fb4c13b31506e06e9707fbc7facee | 6880ba9f45d2e9a13a24dcacfa37113007b4c625 | /Includes/list/list.cpp | 96529054ec837570f547e203efe56768a42926c7 | [] | no_license | PatateDu609/projects | 706ed45b5b3696073adf006c9b959f46ff43238f | 56666a65fc23122267e5adb5883921681bbc991a | refs/heads/master | 2020-07-12T05:37:26.989258 | 2019-09-15T18:35:42 | 2019-09-15T18:35:42 | 204,731,877 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,197 | cpp | list.cpp | #ifndef LIST_CPP
#define LIST_CPP
#include "list.h"
template <class type>
List<type>::List() : _size(0), _begin(NULL)
{}
template <class type>
List<type>::List(const List &other) : _size(other.getsize()), _begin(NULL)
{
if (!_size)
return ;
Element<type> *temp = other._begin, *begin;
while (temp)
{
createEl... |
2cd914b63d1e49665a4f51cef8c838d51ea64253 | e47ebafd139ab4763d2ddac0d71784c92a7e6d8d | /thtfit/MediaPlayer/libNexusExt/LedScrGpioCtrl.h | 135f3e6a5b650aae5ac6fa8426f70c3f665d0773 | [] | no_license | franzluo/codeCap | 7362f61c3bab6dfb32d43c3e36e37ae8a7fac8a8 | 4d2bdb48750593a88545de2bf425b2bd60100fe8 | refs/heads/master | 2021-01-11T01:42:36.327163 | 2020-02-17T05:45:00 | 2020-02-17T05:45:00 | 70,659,058 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 853 | h | LedScrGpioCtrl.h | #if !defined(_LedScrGpioCtrl_h_)
#define _LedScrGpioCtrl_h_
#include <BaseTypeDef.h>
#include <LedScrGpioCtrlApi.h>
#include <nexus_base_types.h>
#include <nexus_gpio.h>
class CLedScrGpioCtrl : public CLedScrGpioCtrlIf
{
public:
enum tagBrcmGpioNo {
BrcmGpioNo_Data = 45,
BrcmGpioNo_Clk = 43,
Brcm... |
9b8e1a68a9d142e16284feb5d23ae10438efbd0c | 6cecdbbe6eb721a0e43c07ed2b31bdcc9e553c55 | /Sail2D/Runs/first_flatplate_150_8/case/1000/nuTilda | 28ced42fdd4f53fe9ff819ee52b9a263abffcc7b | [] | no_license | kiranhegde/Gmsh | 799d8cbefb7dd3f3d35ded15b40292fd3ede6468 | fefa906dabfddd9b87cc1f0256df81b4735420e1 | refs/heads/master | 2021-01-19T23:21:57.414954 | 2015-01-21T02:02:37 | 2015-01-21T02:02:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 144,790 | nuTilda | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.3.0 |
... | |
ab0c904c438380e2ec0180bf6fa664f89bad9d83 | b1cd7e1bebabf7c11d5786d35a944906a12c30f4 | /include/ShmConstants.h | fad23ef0e98a6ee0dd562603dde6706fa9b95c44 | [
"MIT"
] | permissive | b51/ShmNode | c7694e202d34ea8cde415cde91595d00098f81d7 | dea0401eca332cbc3a0897d3c85a4c95a6313c20 | refs/heads/master | 2020-04-09T03:11:51.968214 | 2018-12-01T18:35:33 | 2018-12-01T18:35:33 | 159,973,245 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,699 | h | ShmConstants.h | /*************************************************************************
*
* Author: b51
* Mail: b51live@gmail.com
* FileName: ShmConstants.h
*
* Created On: Fri 14 Sep 2018 08:31:56 PM CST
* Licensed under The MIT License [see LICENSE for details]
*
***************... |
c294c17d09fce026ee008d2261c543700176a846 | 7d4200ffe5a19ac24cea00ee272a7ada0d95fac6 | /model/directoryNode.h | 7dfbd99e4e5924ed076df634cea59b8c46548540 | [
"Apache-2.0"
] | permissive | micheleantonazzi/progettoProgrammazioneAdOggetti | 6d74fce40a768ea8c838a57100d7c85361e98285 | 6a28730a217bd7fac5291745ca34374a32fb27b2 | refs/heads/master | 2020-03-13T20:03:26.613759 | 2018-04-27T08:16:50 | 2018-04-27T08:16:50 | 131,264,694 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,495 | h | directoryNode.h | //
// Created by michele on 27/02/17.
//
#ifndef CLOUD_2_0_DIRECTORYNODE_H
#define CLOUD_2_0_DIRECTORYNODE_H
#include "fileSystemNode.h"
#include <iostream>
#include <list>
#include "feedback.h"
using std::list;
class directoryNode : public virtual fileSystemNode{
private:
list<fileSystemNode*> subNodes;
stat... |
d6b80816a9394462065d2799a8a10511fc1b5f98 | 363590c82e8ede64b64e213eac540f21c09e1cbf | /AStart/asnode.h | 77cd76191213789a207b0c2e4219f1613a49a73f | [] | no_license | zlbruce/nrciz | 73d6b3ac298f4e7fa922890c4c78b4c6ee16493b | af8343d57f806dd46ea12cb0d763767d6e4a8ee3 | refs/heads/master | 2021-01-19T07:56:38.128938 | 2012-10-10T09:43:52 | 2012-10-10T09:43:52 | 33,296,537 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,289 | h | asnode.h | /*
*
* Portions Copyright (C) 2009 wind (xihels@gmail.com)
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.... |
a82b0479d3cb4f6ccba42efe34ab402182089606 | 4fa415885f76e3091b291b741393c49999dff6d0 | /hexen/p_user.c | 9f4e285c964846c41ab616c3414aca9367617f54 | [] | no_license | mheyer32/chocolate-heretic | ce840479e4bd1626997c6b5eba4a496dda4bbf11 | 21f01fe3de1f9b569f06a348ad3ad5f6b67f2043 | refs/heads/master | 2022-12-18T09:11:01.786226 | 2020-09-28T06:04:18 | 2020-09-28T06:08:07 | 299,207,020 | 1 | 0 | null | 2020-09-28T06:13:37 | 2020-09-28T06:13:37 | null | UTF-8 | C++ | false | false | 46,869 | c | p_user.c | // Emacs style mode select -*- C++ -*-
//-----------------------------------------------------------------------------
//
// Copyright(C) 1993-1996 Id Software, Inc.
// Copyright(C) 1993-2008 Raven Software
// Copyright(C) 2008 Simon Howard
//
// This program is free software; you can redistribute it and/or
// modif... |
dcb31dfab4153506d1d5fc42686ea5e393103fde | 2756cd4094c18a2d9cf6d22e8719f85ae7c1a542 | /maolan/midi/io.hpp | ba7ffec2f4c4c5602bb74940f112c115329e080d | [
"BSD-2-Clause"
] | permissive | maolan/libmaolan | 4d45fa5bb6d1647f600d3b06471fec6bd7223d33 | cc1c3a872baf65f645902b2c2ce9db68ebe66ef2 | refs/heads/master | 2023-08-08T12:06:23.903278 | 2023-07-30T03:54:30 | 2023-07-30T03:54:30 | 115,933,918 | 6 | 3 | BSD-2-Clause | 2021-05-16T12:24:33 | 2018-01-01T17:19:55 | C++ | UTF-8 | C++ | false | false | 453 | hpp | io.hpp | #pragma once
#include <maolan/io.hpp>
#include <maolan/midi/buffer.hpp>
namespace maolan::midi {
class Input;
class IO : public maolan::IO {
public:
IO(const std::string &name = "", const bool ® = false);
virtual void fetch();
virtual void process();
virtual midi::Buffer pull();
virtual nlohmann::json co... |
1082a0e6fa1d69a19eeb24bf08181e7cf79c4395 | e5b25b2d4b7f0e61a651230bbe91f4af8e3ff42c | /授業/Src/GameSystem/GameSystem.cpp | b777082d21b1266e930432104b25302d27c52a7f | [] | no_license | Hrk-Ogs/3DGameProgramming2 | 44ee8c1875493c3eba02ced34093d3fd5e9827fb | 784bdf590d7c4d0d6bf71a1148a5c1dadba47b6c | refs/heads/master | 2023-02-14T18:32:46.188274 | 2021-01-06T03:48:02 | 2021-01-06T03:48:02 | 269,535,232 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 18,063 | cpp | GameSystem.cpp | #include "GameSystem.h"
void GameSystem::Init()
{
m_editorData.LogWindow.AddLog(u8"GameSystem起動...");
// システムコンポーネント登録
ComponentClassMaker::GetInstance().Register<TransformComponent>();
ComponentClassMaker::GetInstance().Register<ModelComponent>();
ComponentClassMaker::GetInstance().Register<InputComponent>();
... |
f8b4a942e2f5c4f4802e9d0bef4f8c8f70bfad6e | f7694374aa6f94751e092b2655fdfbaab2b77096 | /URI/INICIANTE/uri1004.cpp | dd9c5d4180733f4ea5f62417382ab509e356e039 | [
"MIT"
] | permissive | marlloncsoares/C_plus_plus | 05b2709ede3c5753bb3330ab66ae58259fe6dca3 | b42027d68349b714556bf0a3d0fd3882b7dd6ac4 | refs/heads/master | 2022-04-10T01:36:26.670964 | 2020-04-01T01:33:55 | 2020-04-01T01:33:55 | 250,143,634 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 375 | cpp | uri1004.cpp | #include <iostream>
using namespace std;
// Algoritmo para calcular o produto entre dois números inteiros.
int main() {
// Declara as variáveis que serão utilizadas
int x, y, p;
// Faz a leitura dos dados.
cin >> x >> y;
// Realiza o processamento.
p = x * y;
// Mostra o resultado.
... |
d6226ae3168e7d6dc5499330cbe5cad7692058a5 | d9b1c78c5c0f15a91d7b4db7136567a9ec470a2e | /libs/numeric/mtl/test/vector_type_generator_test.cpp | 24b46761718ca032b52f10bbe2823015bbe99ece | [
"MTLL"
] | permissive | simunova/mtl4 | eff9f8c0dca66cd2a3a2573b24a287be38f9f02a | 09d8523d59baf5fdec29f3509a63babc2763af4a | refs/heads/master | 2021-06-19T08:36:42.145155 | 2021-03-05T20:58:21 | 2021-03-05T20:58:21 | 177,810,098 | 28 | 18 | null | 2021-03-05T20:58:21 | 2019-03-26T14:53:13 | C++ | UTF-8 | C++ | false | false | 2,012 | cpp | vector_type_generator_test.cpp | // Software License for MTL
//
// Copyright (c) 2007 The Trustees of Indiana University.
// 2008 Dresden University of Technology and the Trustees of Indiana University.
// 2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
// All rights reserved.
// Authors: Peter Gottschling and And... |
939ca811fe2be239599fcc47b10b64cd8ea327a7 | dcb236f4fe8d15c97661404b297016d877ebf0c8 | /MMVII/include/MMVII_FormDer_BinaryOp.h | 926337d9608ad4e19e4b41d1fc3782b6fd510fa8 | [
"LicenseRef-scancode-cecill-b-en"
] | permissive | luckyfish888/micmac | 021a91cc6897f7d3e8d6d54dfeb0070d4afceef1 | 483c8823f34827691a5823d529fe6dcc1a7f573e | refs/heads/master | 2021-06-13T20:55:12.171864 | 2020-04-06T18:28:21 | 2020-04-06T18:28:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,292 | h | MMVII_FormDer_BinaryOp.h | #ifndef _MMVII_FormDer_BinaryOp_H_
#define _MMVII_FormDer_BinaryOp_H_
/** \file MMVII_FormDer_BinaryOp.h
\brief File for definition of binary operators inside formula
*/
namespace NS_MMVII_FormalDerivative
{
/* *************************************************** */
/* ****************************************... |
9d55c6c4e70241f54165280887bce42489525b26 | 4492f861179922eacb86e59c83f189f544fd749b | /Code/PolishUtilities.hpp | 4f0fa2c38e2bb74381efb2f7447d92779f045098 | [] | no_license | gupta409/Floorplanner | 41cbe69b60f86502c79a04ab78ae1a380d840fb7 | 6c2ac6c9816738a77471d34e07cd3a3c263d08e5 | refs/heads/master | 2021-05-05T09:50:32.662251 | 2019-09-18T18:19:47 | 2019-09-18T18:19:47 | 117,876,674 | 9 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,041 | hpp | PolishUtilities.hpp | /*
* PolishUtilities.h
*
* Created on: Nov 2, 2017
* Author: Anish Gupta
*/
#ifndef POLISHUTILITIES_HPP_
#define POLISHUTILITIES_HPP_
#include <string>
#include <vector>
using namespace std;
void polishUtilitesUnitTest();
class PolishUtilities {
private:
PolishUtilities();
public:
static bool isVerticalCu... |
baba3357a84d3ecaedcc5a66b51d3cba2c51df13 | ab3122ba99ae0c8fb654503776f3fff38c4bfe72 | /src/data/types/symbol_name.h | ff138d47ef05e46b448a54153cd77f38427c0b3a | [] | no_license | TriangleMouse/parts_Trading_arbitrage_bot | 28586cf7a6f1a4c922da6821dcd68ace0d16e27e | c3168db75c372849530e2ba7df95ba7d3be0c3d6 | refs/heads/master | 2023-08-15T09:03:46.196766 | 2021-10-17T17:16:40 | 2021-10-17T17:16:40 | 418,202,802 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 637 | h | symbol_name.h | //
// Created by Артем Белявский on 8/12/21.
//
#ifndef TRADEBOT_SYMBOL_NAME_H
#define TRADEBOT_SYMBOL_NAME_H
#include <string>
namespace DATA {
namespace TYPES {
struct SymbolName {
std::string moscow_name;
std::string binance_name;
std::string binance_base_cur;
... |
c1e354c5fb87432523eb567b93b1b88b78769c4f | 3c3f900dadf850dc7720656a986b3d3db60b14d5 | /plugins/messageviewer/bodypartformatter/autotests/diffhighlightertest.h | e4cecfcff7927f85c037fdc3e53a92921437fef6 | [
"BSD-3-Clause"
] | permissive | KDE/kdepim-addons | 680602d3b8dd1bfecd6e5c5423412cc5bf1b7cbf | d0bff1924db427aae0b6cf40dda52e998293b906 | refs/heads/master | 2023-09-04T05:08:51.218761 | 2023-09-04T01:49:13 | 2023-09-04T01:49:13 | 46,991,984 | 11 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 417 | h | diffhighlightertest.h | /*
SPDX-FileCopyrightText: 2017-2023 Laurent Montel <montel@kde.org>
SPDX-License-Identifier: GPL-2.0-or-later
*/
#pragma once
#include <QObject>
class DiffHighlighterTest : public QObject
{
Q_OBJECT
public:
explicit DiffHighlighterTest(QObject *parent = nullptr);
~DiffHighlighterTest() override =... |
12370bf0979265fb923b78607b5f32e235c7d2d3 | 34e69e7a0a52e5ca08f49389a8c1ab12980862a2 | /lib/frame_sorter_impl.cc | 28c31c2a6e1a6283093b88a289700d251e0ba0cc | [] | no_license | muccc/gr-iridium | 86e765a49b7212247895bf0bad0e0aa375a5dd79 | d578cbc46eadfefe8362d79621d4888d1a660b99 | refs/heads/master | 2023-08-29T03:46:00.280905 | 2023-08-07T22:12:39 | 2023-08-07T22:12:39 | 56,373,673 | 300 | 76 | null | 2023-01-13T22:29:42 | 2016-04-16T08:30:58 | C++ | UTF-8 | C++ | false | false | 2,973 | cc | frame_sorter_impl.cc | /* -*- c++ -*- */
/*
* Copyright 2021 gr-iridium author.
*
* SPDX-License-Identifier: GPL-3.0-or-later
*/
#include "frame_sorter_impl.h"
#include <gnuradio/io_signature.h>
namespace gr {
namespace iridium {
frame_sorter::sptr frame_sorter::make()
{
return gnuradio::make_block_sptr<frame_sorter_impl>();
}
/... |
eb847ece494df537c2f75151b42925330a29610c | 3e6c08b23d23cd6e234c5a2ea96abe64c3b3b9b2 | /Homeworks. First term/9/1/file.cpp | 6814ec8c9b0e3e613db5232df02ddc1c362876cf | [] | no_license | AnnaSkachkauskaite/Homeworks | 3e25e137864233e13e7285916c06f6d3112bf780 | 50ab8410eac071c08a4179f98201915ecb0917c7 | refs/heads/master | 2021-01-10T20:04:48.461402 | 2015-05-28T15:49:13 | 2015-05-28T15:49:13 | 15,389,248 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 459 | cpp | file.cpp | #include <stdio.h>
#include "stringUnit.h"
#include "file.h"
FILE *open ()
{
printf("Enter file adress ");
char fileAdress[maxFileAdressLength];
gets(fileAdress);
return fopen(fileAdress, "r");
}
int fileToStringArray (FILE *file1, String *strFile1[maxLinesNumber])
{
int strNumb1 = 0;
char buf = 0;
while (!f... |
a82830615bd5a143b5a982bdf2747ee3eff88da0 | 40162e0e3b2a991c1a462f352ace0f430ece7b55 | /huffman/main.cpp | da82a0bc0be7645bd2f0f6dc78caa3e925e7076a | [] | no_license | AThings/C | dd084cdbea91c9df4384907025b23582af4afe32 | 18054b41bd82456c2dc6a08777d7a9581bc8cd9a | refs/heads/master | 2020-04-08T07:11:53.990654 | 2019-04-13T15:39:26 | 2019-04-13T15:39:26 | 159,130,762 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,214 | cpp | main.cpp | #include <iostream>
using namespace std;
//数组插入排序
void insertSort(int a[],int index,int willcha,int start)
{
while(a[index-1]<=willcha && index >start)
{
a[index] = a[index-1];
index--;
}
a[index] = willcha;/*
cout<<"------------------------\n";
f... |
5cd79f5c675f27c8c8771b1a4eac031cb98801cc | 2828f5714aae75fab60bba431105890d4e17ef89 | /XPlaneConnectClient.h | 400c03dea6617257865efbf7884609303cc93d8a | [] | no_license | iot-crazy/xpc | 51b0f967574bd01babc6daf46a939e20ea764238 | 732fa5b229507756e013d83c5b5fa8a8cf0164a2 | refs/heads/master | 2022-06-30T10:00:05.641953 | 2020-05-06T09:57:08 | 2020-05-06T09:57:08 | 261,709,566 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,034 | h | XPlaneConnectClient.h | //
// A attempt at an arduino port of the XPlaneClient
// https://github.com/nasa/XPlaneConnect
//
//
// This is a work in progress and only a very limited set of features have been proted so far
//
// Huge thanks to all those involved with XPlaneConnect for this amazinh opprotunity!
// Please bear with me, I'm leanin... |
6e1c35f768e8d71c03090ea9223e2b861ff7f947 | 4d60a17a65fd6d433de66a675f87535493bf639c | /src/panda_util.cpp | f07422e1f093873e838d3eae8cab98f41ff1b2bc | [] | no_license | zhaomasha/panda_new | bdf9106ee8f04557e87ca9f88ee16c36f7267ec4 | b61de3c2fb1d4ad24ffc92bce67782c1c86f062e | refs/heads/master | 2021-01-10T01:45:59.777487 | 2015-11-16T04:57:27 | 2015-11-16T04:57:27 | 43,105,484 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,228 | cpp | panda_util.cpp | #include "panda_util.hpp"
long getTime(){
struct timeval tv;
gettimeofday(&tv,NULL);
return tv.tv_sec*1000+tv.tv_usec/1000;
}
//解析字符串，取出一个集合
void parse_strings(string params,vector<string>& v,string delims){
char* result;
char* p=(char*)params.c_str();
char* ptr=NULL;
while((result=strtok_r(p,delims.c_str(),&pt... |
c887a2ab03fb6b4456155784c9a2a54dd53fbaae | c01a0248ffd3e8e6c1b2eae4a014e38641d59aae | /CodingTest/4386_'별자리 만들기'.cpp | 981c55cfd733fa4a958c725a65fc4c4458166867 | [] | no_license | SeoWJ/CodingTest | f8dbbe83b6200e780998b1979ba0a064f930bd71 | f2c4923cc4c5e53abc7cfbbef76087c9db99e390 | refs/heads/master | 2023-04-24T01:50:18.654084 | 2021-05-11T08:12:27 | 2021-05-11T08:12:27 | 293,422,619 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,039 | cpp | 4386_'별자리 만들기'.cpp | #include <iostream>
#include <vector>
#include <queue>
#include <tuple>
#include <cmath>
#define endl '\n'
using namespace std;
class Constellation {
protected:
int N;
vector<pair<double, double>> stars;
priority_queue<tuple<double, int, int>, vector<tuple<double, int, int>>, greater<tuple<double, int, int>>> PQ;... |
7ea834cf4dabe7f96615b919298b7c668484b1b3 | eb14a6433becb725b01217f5af57db433c970407 | /code/ACE/manager_thread.cpp | f6a192f62b312afd80af0fe5c4f4427502865c89 | [] | no_license | csj561/c_plusplus | 77376418c6d51489579ec122eea8d308748e3b2b | 49c5075acb238b41341583a13b32f51a0d26d9d3 | refs/heads/master | 2021-01-17T00:08:43.451813 | 2017-04-07T08:00:54 | 2017-04-07T08:00:54 | 26,589,766 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,766 | cpp | manager_thread.cpp | #include "ace/OS.h"
#include "ace/Task.h"
#include <ace/Future.h>
#include <ace/Activation_Queue.h>
#include <ace/Method_Request.h>
#include <ace/Time_Value.h>
#include "ace/Thread_Manager.h"
#include "ace/Get_Opt.h"
static void *taskone (void *)
{
ACE_DEBUG ((LM_DEBUG, "Thread:(%t)started Task one! \n... |
50afffce16dc8b4cd4f20ba5a2a0f74a9971761e | 23c38fe74b52456693a4f51a8de29739910bfbfe | /bestTimeByAndSell.cpp | 7379f2429147ed87afeeb1355e2b7d2449c999bd | [] | no_license | momoliu88/leetCodePoj | 892ccd046ab51192abb66d3d3392ebbfb0010dea | b30b635dd6fdb88348bae880274bd9c834e24813 | refs/heads/master | 2021-01-25T08:37:30.092903 | 2014-01-06T09:12:24 | 2014-01-06T09:12:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,812 | cpp | bestTimeByAndSell.cpp | #include <iostream>
#include <vector>
#include <algorithm>
/*
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
prices里面存储... |
5c8d082403dc913fe4afef977ddd4c78f0d2c850 | 7b8db19c3024d0632a04eef7b727f3f4c1a0c8a9 | /include/Chikpi.h | 981aeb1080f8bb38a51c2d52bb0ed496d17b0ca0 | [] | no_license | samfan0429/chipi | 3f6ff2d012cd984d72f2722639d313138a6bc302 | 685ca42f4c668bb5d5b056625f4e672a3407afbd | refs/heads/master | 2023-03-07T03:09:02.477421 | 2021-02-18T04:43:37 | 2021-02-18T04:43:37 | 338,062,189 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 655 | h | Chikpi.h | #ifndef CHIKPI_H
#define CHIKPI_H
# include <vector>
# include <memory>
# include <SFML/Graphics.hpp>
# include <SFML/Audio.hpp>
# include <SFML/Network.hpp>
# include <SFML/Window.hpp>
# include <SFML/System.hpp>
# include "Chikorita.h"
// Main Application
class Chikpi
{
private:
sf::RenderWindow* window;
... |
366b1203bd543b906cf186e7033c926014812bf2 | bc7c7edb89c1ee4eb29ef076bfd6daeed09b5540 | /IVideoCall.h | 5ab88e56348e6577083955820bfdb12822b17143 | [] | no_license | FKLam/XPlay2 | 6f1327aa372717bb4463e37bffac435ed834e9f1 | d2acd20904ea4ea6a273f43a2d3cdf5c63f99e60 | refs/heads/main | 2023-01-13T04:45:26.546089 | 2020-11-04T11:19:45 | 2020-11-04T11:19:45 | 309,979,650 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 210 | h | IVideoCall.h | #ifndef IVIDEOCALL_H
#define IVIDEOCALL_H
struct AVFrame;
class IVideoCall
{
public:
virtual void init(int width, int height) = 0;
virtual void repaint(AVFrame *frame) = 0;
};
#endif // IVIDEOCALL_H
|
4368d0c4923d06140c13fb40a07bdcb4441ab000 | ec64118889b66820893a51e3bd62c9af651a0bae | /100827/F.cpp | 7bcb949b923fe52be0b0573f530f6df180227d75 | [] | no_license | ferambot/Heuristics-CodeForces-GYM | e237309bb84bc09afbefefe408985e8a9dfa8a0b | 6600d929b24d4d540c921a2995a138c180b2acdf | refs/heads/master | 2018-05-18T22:14:29.665971 | 2016-06-13T05:52:41 | 2016-06-13T05:52:41 | 61,010,468 | 0 | 0 | null | 2016-06-13T05:52:42 | 2016-06-13T05:52:42 | null | UTF-8 | C++ | false | false | 3,645 | cpp | F.cpp | #include<bits/stdc++.h>
#define assn(n,a,b) assert(n<=b and n>=a)
#define pb push_back
#define mp make_pair
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define SET(a,b) memset(a,b,sizeof(a))
#define LET(x,a) __typeof(a) x(a)
#define TR(v,it) for( LET(it,v.beg... |
a636b13ec6567746a0b27e9c7a0d9aea1fb53adc | 064be87af31f133ce7dcaebffe6c123316722c8f | /main.cpp | 6ec684b17f2586479b271a9ec0c03a655368a7e7 | [] | no_license | ablaylock/flexFun | 04fd16a540c4e98dace93bdeb268551b281ee188 | c876b4111e918129876634c3efb7470126303eb4 | refs/heads/master | 2021-01-23T20:18:49.253398 | 2015-08-05T22:02:28 | 2015-08-05T22:02:28 | 40,193,737 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 514 | cpp | main.cpp | #include <QCoreApplication>
#define YY_NO_UNISTD_H
#include "pcl-hpgl.lexer.h"
int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
yyscan_t scanner;
FILE * inputFile = 0;
if (argc > 1)
inputFile = fopen(argv[1], "rb");
yylex_init( &scanner );
if(argc > 1 && inputFile)
... |
66886ec09a806756eff4fc30b303c541cee0b57e | 7b023901b432d348ca546c2be778959f821a9f2b | /Debug code/encoder_test/encoder_test.ino | 6c7115672abe05d486bcc43828e3d3ac3ea9cc37 | [] | no_license | lws803/vincentthebot_02-02-01 | 5787721b7b1e9771ce5c718181b98122f9aeff71 | 32eb196c80ff903476ddcb67ceab6bcebb868e4e | refs/heads/master | 2021-03-19T17:08:07.591954 | 2018-04-21T08:07:09 | 2018-04-21T08:07:09 | 118,619,983 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 599 | ino | encoder_test.ino | int encoderValue_A = 0; // LEFT ENCODER TICKS
int encoderValue_B = 0; // RIGHT ENCODER TICKS
ISR(INT0_vect) {
encoderValue_A++;
Serial.print("LEFT TICKS: ");
Serial.println(encoderValue_A);
}
ISR(INT1_vect) {
encoderValue_B++;
Serial.print("RIGHT TICKS: ");
Serial.println(encoderValue_B);
}
void setupEINT() {
... |
5abed2c7be2ce44944c261f41327671fa98a4d29 | e59bdf0a80632fe25a3ef7bd09ed3f45feb406f8 | /src/stats/http/ConnectionManager.h | d950bf98eef015354394b930e9bc48ef1b70c730 | [
"Apache-2.0"
] | permissive | neogenie/iqlogger | 45e8798e31906d767be3b31b4bf446c5821327fe | 7a3866046dd30282a35ce954dc4fd301452aa924 | refs/heads/master | 2020-12-13T23:29:59.358375 | 2020-07-01T19:21:33 | 2020-07-01T19:21:33 | 234,562,522 | 4 | 0 | Apache-2.0 | 2020-07-01T19:21:35 | 2020-01-17T14:16:05 | C++ | UTF-8 | C++ | false | false | 541 | h | ConnectionManager.h | //
// Connection.h
// ~~~~~~~~~~~~~~~~
//
// Copyright (C) 2018 IQOption Software, Inc.
//
//
#pragma once
#include <set>
#include "Connection.h"
namespace iqlogger::stats::http {
class ConnectionManager
{
public:
ConnectionManager(const ConnectionManager&) = delete;
ConnectionManager& operator=(const Connecti... |
4520020351b9b7b9cf1e57fdb6580f10e90ae01f | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_1485490_0/C++/kouri128/C.cpp | 862559943cc64afe588335b72a99f2a278f25894 | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 1,237 | cpp | C.cpp | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll solve(int ai, int bi, const vector<pair<ll, ll> > &a, vector<pair<ll, ll> > &b)
{
int N = a.size();
int M = b.size();
if (ai >= N)
{
return 0;
}
ll sum = 0;
ll ret = 0;
for (int i = bi; i < M;... |
ec4b6a0dba631cc1d9ef2edb2d794f1cbfde923e | 69c3a9292a8b76696695712329cd68b56a5ba2c8 | /Volume 1/0188.cpp | bc06bca9b7f3d7611597358b88139427324f920d | [] | no_license | yuta1024/aoj | ebbf7ccc03d1adf00c2301559a8d835fba5e4003 | da24890eaf199f7eb2cb98bfed1bf7e1c533b586 | refs/heads/master | 2021-01-02T22:37:55.372004 | 2012-09-18T11:36:43 | 2012-09-18T11:36:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 560 | cpp | 0188.cpp | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
while (cin >> n) {
if (n == 0)
break;
vector<int> array(n);
for (int i = 0; i < n; ++i)
cin >> array[i];
int target;
cin >> target;
int ans = 0, low = 0, high = n-1;
while (l... |
34f42128e51b94b557c55042f2719813b082bdc8 | fffb0b9756b71ae1548dc483552f04e09e9d5851 | /cc/STRS.cpp | 82f5b89c7181a8a36fb7ffac59f77e3dca90b737 | [] | no_license | nandu6177/code-amrita | 93ea5046f798253e4fb217c598af6f0b84f3ae7a | cb3cca21da7035fcd7262bf52b5058405c16998c | refs/heads/master | 2021-05-11T04:31:12.764411 | 2018-05-06T11:51:17 | 2018-05-06T11:51:17 | 117,941,803 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 673 | cpp | STRS.cpp | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
typedef long long ll;
using namespace std;
const ll mod=1000000007;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
str... |
0632bae60019440119c992a25291c55515388716 | 64f0c704da6a2855de79505bb93cdbaa26d29c91 | /benchmark/benchmark.ino | 248338352a14359e631aa35e43277e875c72b66b | [] | no_license | ITstreet1/Arduino-Benchmark | 622711bde5f38a2fc4b796aeb639a3469cc1c68d | 82e28d3470badcadfe56875d9b220cd9a7749506 | refs/heads/master | 2021-05-14T08:30:53.340172 | 2018-01-04T19:47:43 | 2018-01-04T19:47:43 | 116,300,658 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,731 | ino | benchmark.ino | //
// Pi_2
//
// Steve Curd
// December 2012
//
// This program approximates pi utilizing the Newton's approximation. It quickly
// converges on the first 5-6 digits of precision, but converges verrrry slowly
// after that. For example, it takes over a million iterations to get to 7-8
// significant digits.
//
// I ... |
7d5fb648ea18ef3dcbe7e1461faeefa5d6825c62 | 45de2d5cd1750df0c0c8b473637960b733dc8858 | /src/Model/Model.cpp | d5d43f2f1c7410f61c014900dd394afb7480fe25 | [
"MIT"
] | permissive | MericLuc/ModelGenerator | 51ab5a8feb859b6c7e1db382002501defa5ef50e | 2610909eed0c3aafcf0a43d11eb867e0f0863fa5 | refs/heads/main | 2023-01-30T09:05:06.227283 | 2020-12-18T13:33:21 | 2020-12-18T13:33:21 | 322,583,110 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 25,016 | cpp | Model.cpp | /*!
* @file Model.cpp
* @brief Implementations of the functions defined in \a Model.h
* @author lhm
* @date 16/07/2019
*/
#include <errno.h>
#include <limits>
#include "Logger.h"
#include "Model.h"
#include "Exception.h"
#include "Conf_format.h"
#include "Message.h"
#include "Header.h"
#include "State.h"
#i... |
3bd4837a2700ecd6a0432ee516ad16fcb9f9812e | 053bbaca722485b50c0fb766e9b7badd1a4b7757 | /native/recog/src/coins.cpp | 64107ae76ab1b3145048986c9ec8ca4d5b0e1d79 | [] | no_license | jfmwz/scaladays2013 | b7bb48534dba31e26ff291186240128088b80de0 | dc1ee95e03d971eef1f33a543742a618d7fa9ce2 | refs/heads/master | 2020-12-25T09:28:08.931588 | 2013-06-12T19:12:12 | 2013-06-12T19:12:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,394 | cpp | coins.cpp | #include "coins.h"
#include <opencv2/gpu/gpu.hpp>
using namespace eigengo::akka;
std::vector<Coin> CoinCounter::countCpu(const cv::Mat &image) {
using namespace cv;
std::vector<Coin> coins;
Mat dst;
std::vector<Vec3f> circles;
cvtColor(image, dst, CV_BGR2GRAY);
GaussianBlur(dst, dst, Size(9, 9), 3, 3);
t... |
71dfb72cf836b7792ffc69f94c91d9f1eaaabb95 | 3355e6cfe368490bdacdacb153cc8bea0b3a807d | /02-CPP/Leetcode/Leetcode/栈_队列/_0239_滑动窗口最大值.hpp | 9b6f4627f841eb08fd3d42c381a4b87375bfc78c | [] | no_license | CoderLiLe/DataStructureAlgorithm | 1ecf077efbf19f3f08ee05879c9e2c1fa48dd736 | f552e8d5e2f2b531e5b90dd0f16fd9208f0feadb | refs/heads/master | 2021-11-19T09:27:15.688142 | 2021-10-12T12:10:47 | 2021-10-12T12:10:47 | 187,794,975 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 478 | hpp | _0239_滑动窗口最大值.hpp | //
// _0239_滑动窗口最大值.hpp
// Leetcode
//
// Created by LiLe on 2021/7/22.
//
#ifndef _0239_________hpp
#define _0239_________hpp
#include <stdio.h>
#include <vector>
using namespace std;
/**
方法一：优先队列
*/
vector<int> maxSlidingWindow1(vector<int>& nums, int k);
/**
方法二：单调队列
*/
vector<int> maxSlidingWindow2(vecto... |
da45bc677fba79bf661adaab43dcf837e3e4cb57 | 4fd74bb075e42bb91f99714c9fcddeedaaaad9db | /BST-Class-Implementation.cpp | eeac707130bd7b750653c16192c1ef05c7089517 | [] | no_license | rudrashisgorai/Random-Codes-in-Cpp | 1a5f0f7bb27489cbf692929c2f92c00ae4794800 | 3c39d3607fb90aba72db65ed670c7e66e5301e3d | refs/heads/master | 2023-03-13T22:24:33.167179 | 2021-03-07T15:46:08 | 2021-03-07T15:46:08 | 270,800,059 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,206 | cpp | BST-Class-Implementation.cpp | /**************
* Following is BinaryTreeNode class -
template <typename T>
class BinaryTreeNode {
public:
T data;
BinaryTreeNode<T> *left;
BinaryTreeNode<T> *right;
BinaryTreeNode(T data) {
this->data = data;
this->left = NULL;
this->right = NULL;
}
};
* Foloowi... |
2851c58cd7cae4de28d1f190c093633a1927880d | 28a4804ff4937dd1e3a8640505ede7cdb8de9428 | /src/ast/return.cpp | 503a7830ef2db0ad902857d8290061b8e2da8ce0 | [] | no_license | peteb/thesis | ada448f9c25066581a496366e32efcdfc94babd4 | ebd49859b2e3505f6cca9c8c333e55c8679f8be5 | refs/heads/master | 2021-01-10T06:15:17.607586 | 2018-12-17T20:53:29 | 2018-12-17T20:53:29 | 47,706,338 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,117 | cpp | return.cpp | /*
* $Id: return.cpp 1091 2010-04-18 23:07:50Z ptr $
* thorn-llvm
*
* (c) Copyright 2010 Peter Backman. All Rights Reserved.
*/
#include "return.h"
#include "lexscope.h"
#include "lexentry.h"
#include "builder.h"
#include "visitor.h"
#include <llvm/IR/Module.h>
using namespace llvm;
AST::Return::Return(AST::Ex... |
4caca3560fd1467c5776419d40df8c9d240c4c15 | b04636f31f716c21a6c0d77bc49b876bc496fff7 | /Olympiad/CST 2019/Thầy Vận/QG07/samac.cpp | cd79f4af99cfed33d65f87348a8721c886ffa85a | [] | no_license | khanhvu207/competitiveprogramming | 736b15d46a24b93829f47e5a7dbcf461f4c30e9e | ae104488ec605a3d197740a270058401bc9c83df | refs/heads/master | 2021-12-01T00:52:43.729734 | 2021-11-23T23:29:31 | 2021-11-23T23:29:31 | 158,355,181 | 19 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,223 | cpp | samac.cpp | #include <iostream>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
#define x first
#define y second
typedef pair<int, int> island;
typedef pair<double, pair<double, int> > SNode;
const double eps=1e-9;
int n;
island a[6555];
double d;
map<double, double> t;
m... |
64d5cea314c805754db7889623e2ce137a09e335 | 3487f249665f096de6c42eda99bc3da3398bb547 | /old/mixed/cpp/monkandmatchmakingmemcmp.cpp | 42f25d158a6d4da5fa854735f1cb61ca2ec19b4c | [] | no_license | hthuwal/competitive-programming | 74489181774b4746234a62fe217ac539b2e1704e | 65efdd8b90afd3895f734e204b9a4689de3eb810 | refs/heads/master | 2023-08-31T04:18:37.525826 | 2023-08-30T20:28:10 | 2023-08-30T20:28:10 | 133,988,036 | 5 | 2 | null | 2020-10-15T17:58:15 | 2018-05-18T18:02:05 | C++ | UTF-8 | C++ | false | false | 338 | cpp | monkandmatchmakingmemcmp.cpp | #include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main(){
char a[110000];
int q,l,m,n,o;
gets(a);
scanf("%d",&q);
while(q--){
scanf("%d %d %d %d",&l,&m,&n,&o);
if(m-l == o-n){
if(memcmp(&a[l-1],&a[n-1],m-l+1)==0)
printf("Yes\n");
else
printf("No\n");
}
else
pri... |
6b46ecd24f1e266f26e8986c0cd3f1ab3876d219 | 37a28974ba563aa5189e11df93dd19c649762634 | /XMLWriter.h | 3a9401c9b4c89c72b3b67d268580b2fddb15d1cb | [] | no_license | zjucsxxd/eyeTrackingAnalysis | acf0d256e886048db2d8ff8dbc10500387d21dc5 | 1e1a186a5b30fe5096c937c1e785c0f224c7446a | refs/heads/master | 2020-12-24T15:05:23.666204 | 2015-02-24T12:42:09 | 2015-02-24T12:42:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 607 | h | XMLWriter.h | /*
* File: XMLWriter.h
* Author: chili
*
* Created on February 10, 2014, 9:19 AM
*/
#ifndef XMLWRITER_H
#define XMLWRITER_H
#include <string>
#include <iostream>
#include <fstream>
#include <opencv2/core/core.hpp>
using namespace std;
class XMLWriter {
public:
XMLWriter();
XMLWriter(const XMLWriter... |
6411fe6125b7fcc5d0a1510e251afed5045b489e | 89dc733e887f311d93031c57d68ced787fa1d67d | /src/simulation_reader/simulation_geometry.cpp | d7f6a73e35252c30a11333ad289a513d4d38bb20 | [
"Unlicense"
] | permissive | c-white/blacklight | 242fd9e5ae24130dce1692cc141328197b11816c | 9024a4bd74dc670f0d57278da31b73eb83d30693 | refs/heads/master | 2023-09-03T02:14:12.464682 | 2023-08-09T23:36:47 | 2023-08-09T23:36:47 | 187,455,357 | 7 | 3 | Unlicense | 2023-09-01T17:58:02 | 2019-05-19T09:06:45 | C++ | UTF-8 | C++ | false | false | 9,813 | cpp | simulation_geometry.cpp | // Blacklight simulation reader - conversion functions for different coordinate systems
// C++ headers
#include <cmath> // cos, exp, sin, sqrt
// Library headers
#include <omp.h> // pragmas
// Blacklight headers
#include "simulation_reader.hpp"
#include "../blacklight.hpp" // Math
#include "../utils/array.hpp... |
e1ee88ac829240c19f8ea5355a3e9814326ed736 | 82b65070be95e121ce4eea2abdddcfbc7872baa9 | /rendererCpp/light.h | 10313bb64ecf5d8cb4f20f3c515bc9e4af1b20a1 | [] | no_license | michcio12174/rendererCpp | ab7bc1e933f381f2264ae3ff45223690dcb90d70 | b9d0564647a214606590638e6b8a8623d6193c78 | refs/heads/master | 2020-04-17T10:02:03.277059 | 2019-01-22T18:13:51 | 2019-01-22T18:13:51 | 124,757,245 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 497 | h | light.h | #pragma once
class light
{
public:
//directional light constructor
light(vector3 color, vector3 direction);
//point light constructor
light(vector3 color, float intensity, vector3 origin);
virtual vector3 getLight(vector3 position);
virtual vector3 getVectorToLight(vector3 position);
//origin is used as origi... |
ebbe86a6d0bbf2895591fa5913a2476783143281 | 102ce1e423a0279c98023847337ac39077f23678 | /articles/2018/Cpp-Reference-in-Functional/functional-iostream.cpp | bad12bf24752321e5c3e506c8856ec9c3369859c | [
"MIT"
] | permissive | BOT-Man-JL/BOT-Man-JL.github.io | 50e40858a37c6c5b1ea9e3151c51310529fdb325 | e5e851d43d761808639b67eedd75ed58ae87ce9b | refs/heads/master | 2023-08-25T22:23:21.942407 | 2023-08-20T07:00:20 | 2023-08-21T04:13:02 | 82,437,872 | 36 | 13 | null | null | null | null | UTF-8 | C++ | false | false | 1,286 | cpp | functional-iostream.cpp | // Functional Transpose by BOT Man, 2018
// clang++ functional-iostream.cpp -std=c++11 -Wall -o iostream && ./iostream
#include <fstream>
#include <iostream>
#include <iterator>
#include <string>
int main(int argc, char* argv[]) {
std::ifstream ifs = argc >= 2 ? std::ifstream(argv[1]) : std::ifstream();
std::ofst... |
2a217242fd780bf8a42995d3163969057c5c944e | 83ef40e396dc8ffdc14e9f6d64a42bae61f8c9e3 | /Chaine/main.cpp | f8cf250e1487b17ff8318a2cb75e48f1557c2540 | [] | no_license | Banezi/CPP | cb08815d0b00d5723b8d9569841b213edff4b884 | 3031c3a43732022587c839f6cb18ccaea53325cd | refs/heads/master | 2020-04-01T14:43:55.975459 | 2019-04-09T19:20:06 | 2019-04-09T19:20:06 | 153,305,763 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 259 | cpp | main.cpp | #include <iostream>
#include "Chaine.hpp"
using namespace std;
void afficherParValeur(Chaine) {}
void afficherParReference(Chaine &) {}
int main()
{
Chaine c("une petite chaine");
//afficherParValeur(c);
//afficherParReference(c);
return 0;
}
|
d4cc5d258ca0cb9265f16263953289d9836babe2 | 24c263f2d5cb4f35e8d2757b0f2eb335c87c5bf4 | /OOP/OOP8_string search/S0454028_Search.cpp | 47c4eb7a31de30f757cdaf0332870d7be6aca43e | [] | no_license | smallweii/NCUE | e78b511486ec91a7f4357fcf4da98ef34ca95dea | 4e276cc08a263e963a1ae44e7119c2f9598df84c | refs/heads/master | 2021-05-17T03:12:28.452181 | 2020-03-28T13:19:11 | 2020-03-28T13:19:11 | 250,591,985 | 2 | 0 | null | null | null | null | BIG5 | C++ | false | false | 1,981 | cpp | S0454028_Search.cpp | #include<iostream>
#include<fstream>
#include<string.h>
#include<ctype.h>
#include "S0454028_Search.h"
using namespace std;
Search::Search(char *filename, string s) // constructor用來開檔
{
file.open(filename);
str = s; // 把使用者輸入的字串 s assign給 str
if (!file) { // 檢查檔案是否成功開啟
cout << "Can't open the file!" << endl;
... |
01850d0b0150710983d5e59b9b09e51c9c4e521f | c8700a08e903322385a8c53485a43377da0ce37e | /jni/libil2cpp-v24/debugger/protocol/commands/type.cpp | 1ebafe2c9dfae45b43fbbae2881dad2a08a73685 | [
"MIT"
] | permissive | battlesteed/IL2CPPDumper-1 | 73e20e8c1a45f9d7c2ef78af44ce11fd17bff16f | 877d21fbb82f08d64287e27e96491772c0b35e60 | refs/heads/master | 2023-08-07T00:18:59.652455 | 2021-10-01T01:58:12 | 2021-10-01T01:58:12 | 266,036,140 | 0 | 0 | MIT | 2020-05-22T06:31:40 | 2020-05-22T06:31:39 | null | UTF-8 | C++ | false | false | 301 | cpp | type.cpp | #if IL2CPP_DEBUGGER_ENABLED
#include "type.h"
using namespace il2cpp::debugger;
void TypeGetValuesCommand::Reply::WriteContentTo(Buffer &out) const
{
for (std::vector<Variant>::const_iterator it = _values.begin(); it != _values.end(); ++it)
{
out.WriteVariant(*it);
}
}
#endif
|
2b9ef2c6eec0911d566bbc8af210a69bd1e8a4d8 | cd5a78371196427bf258abe6386296cb2e57b72c | /out/include/octopus/HtmlNode.h | 76ce44a5a693aa51433efab7c25f984134bfded0 | [] | no_license | Grabli66/Octopus | 8ec86eb55d3ee27347d463147e2daed83e5abc64 | 22db97cdebfeee0b4e61e25ef2ad99f58aad7489 | refs/heads/master | 2020-04-14T02:58:10.950728 | 2019-01-07T16:53:29 | 2019-01-07T16:53:29 | 163,596,573 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 2,871 | h | HtmlNode.h | // Generated by Haxe 4.0.0-preview.5+7eb789f
#ifndef INCLUDED_octopus_HtmlNode
#define INCLUDED_octopus_HtmlNode
#ifndef HXCPP_H
#include <hxcpp.h>
#endif
#ifndef INCLUDED_a524558151a8a5a0
#define INCLUDED_a524558151a8a5a0
#include "myhtml/myhtml.h"
#endif
HX_DECLARE_CLASS1(octopus,HtmlNode)
HX_DECLARE_CLASS1(octopus... |
5a0971b72c3308578dc88ac9193f7dd5b7b19a6a | aa095611e30d7e61c1bfdca88a22e0981d272641 | /Leetcode/Leetcode Daily/May/27thMay21.cpp | 11be4284f3226f06821751e901e60b833d2be726 | [] | no_license | hmnt007/CPP-Pogramming | de6787728a5786d6548c6db8b6d3c68a57c0c7c4 | b691a5b88dd1f291fa191c2d84535d1e2d62e11a | refs/heads/master | 2023-08-24T04:54:17.166172 | 2021-10-03T06:22:06 | 2021-10-03T06:22:06 | 209,529,589 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,482 | cpp | 27thMay21.cpp | // https://leetcode.com/explore/challenge/card/may-leetcoding-challenge-2021/601/week-4-may-22nd-may-28th/3757/
/**
Maximum Product of Word Lengths
Solution
Given a string array words, return the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. If no such two words e... |
bf9267461f820d0a3fe7a25fd6d516c3e21aaa15 | 44f4d2c9285bf3a388e3019f50dd0ed1efd019c3 | /src/Simulation.hpp | 873aa77714f70a426e318c910d995578218a42ab | [
"MIT"
] | permissive | MrMagne/position-based-fluids | 2dcd414fbe1176534886e5ff020ee82014b5307a | 529b0d44bff842a964771a77d92136196dca45d7 | refs/heads/master | 2021-01-10T20:06:34.505876 | 2013-07-21T12:22:40 | 2013-07-21T12:22:40 | 12,558,684 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,242 | hpp | Simulation.hpp | #ifndef __SIMULATION_HPP
#define __SIMULATION_HPP
#include <vector>
#include <map>
#include <string>
#include <iostream>
#include <cmath>
#include <stdexcept>
#include <assert.h>
#include <algorithm>
#include "hesp.hpp"
#include "Parameters.hpp"
#include "Particle.hpp"
#include <GLFW/glfw3.h>
// Macro used for the ... |
1f62edc98c5eb0c7a642a1b608f2c3192b4a249a | 7b9d17f6f2a07ebf7eb52bdbad99d627d6a9aeb1 | /XLCTextEx/PLib/PFilePath.h | e9cce8a7d4e98d9cd3c081ff752bdbaefa9c928a | [
"MS-PL"
] | permissive | hirano567/XLCTextEx | 8c5fcc3de709ea344246e40ea6229416d31a1bf9 | 1ac7f13eb8b3f11c4551c87096dc1081a9bd820f | refs/heads/master | 2021-01-21T14:57:07.277418 | 2017-06-27T05:42:23 | 2017-06-27T05:42:23 | 95,358,232 | 1 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 11,357 | h | PFilePath.h | // XLCTextEx_1.0x : PLib
// PFilePath.h
//
#pragma once
NS_PLIB_BEGIN
#define IS_PATH_SEPARATOR(c) \
(((c) == t_Char<T_CHAR>('/', L'/')) || ((c) == t_Char<T_CHAR>('\\', L'\\')))
//======================================================================
// SplitPath
// パスからファイル名を取り出す。
//=============================... |
054b959f296ffdd2dcd2427e892949e309fcbfd5 | d15ac6bfccf66137aad793e1fa8295eb218437d0 | /Game1/Main.cpp | 796f77044687e0806a69667f20cd0223e927314b | [] | no_license | Irfan6220c/Learning-SFML | b22dfaa5c26a1e08f53d728106cf21a5f7fd594f | 1ea78a86cc013aa76676abc5d4152ffbf1988187 | refs/heads/master | 2023-02-16T22:43:17.614572 | 2021-01-17T04:17:42 | 2021-01-17T04:17:42 | 327,773,991 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 78 | cpp | Main.cpp | #include "Header.h"
int main() {
GameClass game;
//game.CreateWindow();
} |
f604ffdad08dff2a0e4115667884f9e1912721c9 | ca73854188b13289cbe368a28074e82861b78e37 | /pro62.cpp | 93a8f76640f6b525c69f7ca3a739c060e6ea545e | [] | no_license | kiran2000/Lab-3 | 2fa966407309ff100660e8986627dd7215eb681e | 415a8b58aceb4be36d2571dd18773a714a65cac2 | refs/heads/master | 2021-01-21T01:15:51.631620 | 2017-09-15T19:11:11 | 2017-09-15T19:11:11 | 101,871,657 | 0 | 0 | null | 2017-08-30T11:06:42 | 2017-08-30T11:06:42 | null | UTF-8 | C++ | false | false | 165 | cpp | pro62.cpp | base = base * 2;
num = num / 10;
}
+ //CONVERTING DECIMAL TO HEXADECIMAL
long int quo;
int i=1,j,temp;
char hexa[100]
|
5b17507204e64c307802a6ae62c70ff0d8160bd1 | 26bc19b4ffa67b4ca7a86da210e14b07f332f1bb | /StochasticDiff/StochasticDiff/main.cpp | c5a57b97b8439c53fff0754c9f49f9501dc033fb | [] | no_license | Edvard-Hagerup-Grieg/UNN-StochasticDiff | a674ba7af81bbb99ca8b6f35f505664766eeea6b | 674bc98caac577b4be6e8ee9d7367df00ec80039 | refs/heads/master | 2020-04-22T17:16:28.406165 | 2019-04-20T08:17:39 | 2019-04-20T08:17:39 | 170,535,184 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 905 | cpp | main.cpp | #pragma once
#include <stdlib.h>
#include "nummeth.h"
#include "omp.h"
#include <time.h>
using namespace std;
int main(int argc, char* argv[])
{
double time = 0.0;
//Euler
if (argv[1][0] == '0')
time = Euler(atof(argv[2]), atof(argv[3]), atof(argv[4]), atof(argv[5]), atoi(argv[6]), atof(argv[7]));
//Heun
els... |
b676ff72d4b93cc623e6867fe9538227a6885adf | bb7dffa0fdbe6263ad5c114b459d3e8288ce9953 | /randomgenerator.cpp | fc1b21170b2bcb2d7e448d991db2bb4ff63ab0ab | [] | no_license | alexreinking/MarkovAnalysis | 99ed9d360a6d4cc36ef7a247261c6b10fc10c8e3 | 12ae87e9c82fa83e5907e52a3cbb5ae9d97f95bb | refs/heads/master | 2020-04-18T21:25:25.478684 | 2011-03-29T20:18:08 | 2011-03-29T20:18:08 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,022 | cpp | randomgenerator.cpp | #include <QtCore>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <sys/stat.h>
#include <fcntl.h>
#include "randomgenerator.h"
RandomGenerator* RandomGenerator::m_instance = NULL;
RandomGenerator::RandomGenerator()
{
reseed();
}
RandomGenerator* RandomGenerator::instance()
{
if(m_instance == NU... |
9e7e50074b4bdcc77f51370992f8b51c3febeb74 | e0b4448b4d86e312c555452572af26e4f2b7e0ce | /cpp_example/src/ryft_odbc_cpp_sdk/wrapper.h | 6795c2496ee3545a67b97fb3a5b83024f561a67d | [
"MIT"
] | permissive | juripero/ryft-odbc-api | 1be000518285212d8e13d42ba096200b20fc512f | 53ae1098902b98994511ae077eaaba29d1f73e38 | refs/heads/master | 2020-07-09T17:50:28.194386 | 2017-05-04T01:14:34 | 2017-05-04T01:14:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,014 | h | wrapper.h | // Copyright(c) 2015 - 2017, Ryft Systems, 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 source code must retain the above copyright notice, this list of condit... |
a415d43c4ebc6070a83450e903e795e49804e204 | be5f4d79910e4a93201664270916dcea51d3b9ee | /fastdownward/src/search/pdbs/zero_one_pdbs_heuristic.h | 403fd8a6fa71624ffe33eefa635a6504bb881ccf | [
"MIT",
"GPL-1.0-or-later",
"GPL-3.0-or-later"
] | permissive | mehrdadzakershahrak/Online-Explanation-Generation | 17c3ab727c2a4a60381402ff44e95c0d5fd0e283 | e41ad9b5a390abdaf271562a56105c191e33b74d | refs/heads/master | 2022-12-09T15:49:45.709080 | 2019-12-04T10:23:23 | 2019-12-04T10:23:23 | 184,834,004 | 0 | 0 | MIT | 2022-12-08T17:42:50 | 2019-05-04T00:04:59 | Python | UTF-8 | C++ | false | false | 773 | h | zero_one_pdbs_heuristic.h | #ifndef PDBS_ZERO_ONE_PDBS_HEURISTIC_H
#define PDBS_ZERO_ONE_PDBS_HEURISTIC_H
#include "zero_one_pdbs.h"
#include "../heuristic.h"
namespace pdbs {
class PatternDatabase;
class ZeroOnePDBsHeuristic : public Heuristic {
ZeroOnePDBs zero_one_pdbs;
protected:
virtual int compute_heuristic(const GlobalState &gl... |
2e7f02249e9f8799b852bee003eba54d44c35b08 | 31b18f7458f924928cc5acf942a9afc5149099f3 | /shell.cpp | 1c9d5d638fb2adb1831f182639a4c437b1329f01 | [] | no_license | keepCrashing/posd | dccc4432d979d78f6354013cfe42a6563d7c4ada | 6ae5b4bed87e48bf05998705b2590151438b3930 | refs/heads/master | 2021-09-03T04:30:04.347750 | 2018-01-05T15:13:07 | 2018-01-05T15:13:07 | 103,396,885 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 928 | cpp | shell.cpp | #include <gtest/gtest.h>
#include <iostream>
//#include "scanner.h"
#include "parser.h"
#include "shell.h"
using std::cout;
using std::endl;
using std::cin;
int main(int argc, char **argv)
{
string input, context = "", result = "";
while(true){
do{
if(context == ""){
cout << "?- ";
}... |
7e0d7ab75665ed7f56e662edb03023e2e9bd6bae | d754ba23c8ff391ce9dcefcfae3b90cef16ecde0 | /DMOJ/bf2.cpp | af46d7893ad54701999544489a776939777965a8 | [] | no_license | TruVortex/Competitive-Programming | 3edc0838aef41128a27fdc7f47d704adbf2c3f38 | 3812ff630488d7589754ff25a3eefd8898226301 | refs/heads/master | 2023-05-10T01:48:00.996120 | 2021-06-02T03:36:35 | 2021-06-02T03:36:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 552 | cpp | bf2.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int k;
cin>>a;
scanf("%i", &k);
vector<string> aa;
char e = 'z';
for (int x = 0; x < a.size()-k; x++)
{
if (a[x] <= e)
{
if (a[x] < e)
{
aa.clear();
... |
5583a98017b6dc4c06f1fb92b6622e5321cec0cc | 65247e6391cf93c651bdb2e069ca22a0eb631bf1 | /PlayerBase.h | ddd3bfae4ad8b40eb3e41caad40cfd66e1783f1c | [] | no_license | linofex/Machiavelli | 71ba9c6d1f7711fa8e87e206e8f6dc3b37db1caf | 1fbb759d4e6a565bcd245b36d14e6cf3ec63db08 | refs/heads/master | 2020-05-21T20:58:07.058034 | 2019-06-08T09:25:18 | 2019-06-08T09:25:18 | 63,788,772 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,567 | h | PlayerBase.h | #ifndef PLAYERBASE_H
#define PLAYERBASE_H
/* Questa classe realizza un giocatore base, cioe' una classe astratta che e' padre
di una classe giocatore umano e una classe giocatore CPU. Un giocatore ha un nome
e le carte nella propria mano. E' possibile inserire, rimuovere, mesolarle, vederle */
#include <string>
#incl... |
dc2eb553e35f9da8c7899fda91fa85e0262987c4 | bdd21e1066aae2bcbfbce66964bfdb779f57d5d4 | /examples/example_win32_directx11/Flask.cpp | e706172a6ad0475892d342dace4604fc158f7fc4 | [
"MIT"
] | permissive | FacelessMartyr/ImGui_rpggame | 82bc41b6b603fe2deb19c13f9dbff478788d1f25 | c5b3ab227a3c1afded1b0427b6e5c4d34d95a2a0 | refs/heads/main | 2023-06-16T00:12:04.134740 | 2021-07-17T09:33:28 | 2021-07-17T09:33:28 | 341,504,251 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 491 | cpp | Flask.cpp | #include "Flask.h"
Game_Flask::Game_Flask(const Game_Flask& a):Game_Item(a)
{
this->heal_type = a.heal_type;
this->healing = a.healing;
this->charges = a.charges;
this->healtype_enum = a.healtype_enum;
}
Game_Flask& Game_Flask::operator=(const Game_Flask& a)
{
this->heal_type = a.heal_type;
this... |
6e4dd6f027bf846d97de5ddb9520020dc11f4564 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir7941/dir7942/dir8062/dir8063/dir12766/dir12767/dir13029/dir13714/file15022.cpp | 051eaa6345715bab6c568efdb041dfa90d37e309 | [] | no_license | tgeng/HugeProject | 829c3bdfb7cbaf57727c41263212d4a67e3eb93d | 4488d3b765e8827636ce5e878baacdf388710ef2 | refs/heads/master | 2022-08-21T16:58:54.161627 | 2020-05-28T01:54:03 | 2020-05-28T01:54:03 | 267,468,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 115 | cpp | file15022.cpp | #ifndef file15022
#error "macro file15022 must be defined"
#endif
static const char* file15022String = "file15022"; |
16d5f5298429a473387a05d98d807f1d588a7dad | 792e697ba0f9c11ef10b7de81edb1161a5580cfb | /unittests/Transforms/Utils/ModuleUtilsTest.cpp | e1bc58fda0e38fefe474be87b5bad7e6cd9d492c | [
"NCSA",
"LLVM-exception",
"Apache-2.0"
] | permissive | opencor/llvmclang | 9eb76cb6529b6a3aab2e6cd266ef9751b644f753 | 63b45a7928f2a8ff823db51648102ea4822b74a6 | refs/heads/master | 2023-08-26T04:52:56.472505 | 2022-11-02T04:35:46 | 2022-11-03T03:55:06 | 115,094,625 | 0 | 1 | Apache-2.0 | 2021-08-12T22:29:21 | 2017-12-22T08:29:14 | LLVM | UTF-8 | C++ | false | false | 2,223 | cpp | ModuleUtilsTest.cpp | //===- ModuleUtilsTest.cpp - Unit tests for Module utility ----===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------------------... |
28b4f7165831ce6046b7e5a6e441c55f273de9c1 | 9640e621c6814d08ac4b243a2cfb5d6ed6fa1496 | /ChatClient/ChatClient/ChatClient.cpp | 828c118e3f64843dca3a73110091cabc570a5d94 | [
"MIT"
] | permissive | Sarytobi/Death-March | d4b90dc00c28e47c00ce45eb7d9a7b58dbe5a3e3 | 937a8688bd8a83a200473f69d8418ab00ed7b68a | refs/heads/master | 2020-12-19T19:32:47.328059 | 2020-02-12T17:38:25 | 2020-02-12T17:38:25 | 235,829,975 | 0 | 0 | MIT | 2020-02-12T11:57:55 | 2020-01-23T15:57:19 | null | UTF-8 | C++ | false | false | 4,297 | cpp | ChatClient.cpp | #pragma comment(lib, "ws2_32.lib")
#include <winsock2.h>
#include <iostream>
#include "conio.h"
#include <string>
#include "NetworksComnuliti.h"
#pragma warning(disable: 4996)
SOCKET Connection;
using namespace std;
bool flagMenu = false;
string answers[10];
int answerCounter;
string upperMessage;
voi... |
f190358e97afcbb30bdfa9b4ac9bf4cb645d24b9 | 427c7d54f1c4d2b3b09ec9d8de40fb601437592d | /code/SalaryCalculator/Classes/Salary.cpp | 397369adc768298d713314cc5f544fb209851f90 | [] | no_license | loveleon/AzureSky | 4c1427ce2b1c507eacb09275355e9c4660c5e1d4 | 205725f4c9c988bbb919ce3e9caed149a557483a | refs/heads/master | 2021-06-23T14:47:19.348244 | 2017-08-14T16:42:23 | 2017-08-14T16:42:23 | 100,288,915 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,760 | cpp | Salary.cpp | #include "Salary.h"
#include "Tax.h"
#include "Welfare.h"
bool Calculator::Pre2Suf(Salary& salary, int version)
{
float pre = salary.Pre - salary.Det;
if (pre < 0 || pre > ULONG_MAX)
{
return false;
}
Tax* tax = TaxManager::Instance()->getTax(version);
if (!tax)
{
return false;
}
float line = tax->Li... |
c1e3b0f6624f18692bd6b32bc5a95134565e9756 | 05db8a70a2134afc5c830b7f2af779647f643202 | /src/constant/EzyConnectionFailedReason.cpp | ea5ecc04273959e983adf9e14856d52a3ccaa83a | [] | no_license | youngmonkeys/ezyfox-server-cpp-client | a97699cb6494380e75d86c86ee4493471f52f986 | 1d55695eaaf855b01464604cd205ae6861e1bbf2 | refs/heads/master | 2023-07-21T19:36:32.775174 | 2023-07-09T06:58:55 | 2023-07-09T06:58:55 | 112,422,375 | 6 | 6 | null | 2023-07-10T15:02:37 | 2017-11-29T03:36:27 | C++ | UTF-8 | C++ | false | false | 586 | cpp | EzyConnectionFailedReason.cpp | #include <map>
#include "EzyConnectionFailedReason.h"
EZY_NAMESPACE_START_WITH_ONLY(constant)
static std::map<int, std::string> sConnectionFailedReasonNames = {
{TimeOut, "TimeOut"},
{NetworkUnreachable, "NetworkUnreachable"},
{UnknownHost, "UnknownHost"},
{ConnectionRefused, "ConnectionRefused"},
... |
e90aa0b75f8433f3027c50d5e7c62554c0162efc | cee96e0cecdd9cd783ad567fe5faa04dc0d8ba08 | /src/mpx_raw.ino | a76d208430d4cedb9c92d7c03d471fcdebd6e49f | [] | no_license | gnkarn/mpx_raw | 22167a96ea1e18dd3e899944bbb21a846f55d4e4 | 63fe963cc9e2e7b7253e8ed081ea479eef3c12a7 | refs/heads/master | 2021-05-09T23:57:12.805185 | 2018-01-27T13:56:57 | 2018-01-27T13:56:57 | 118,816,555 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,859 | ino | mpx_raw.ino | /*
Author: AnalysIR
Revision: 1.0
This code is provided to overcome an issue with Arduino IR libraries
It allows you to capture raw timings for signals longer than 255 marks & spaces.
Typical use case is for long Air conditioner signals.
You can use the output to plug back into IRremote, to resend the signal.
This S... |
668052fd565f97facb6a35805dce726daf2c048a | cf4edc2a34c4627d45c47feeacf2acf079aa596f | /source/QSystemSemaphore.cpp | 2b0bf7faef1c3820d2fae28f05af2bbc99251903 | [
"MIT"
] | permissive | diegopego/Qt4xHb | eeb7c3e33b570193469bfca47d7d1835c2efbc38 | 5f96614f794cc8392b4d97f7dcd80b2fbf46ab65 | refs/heads/master | 2021-01-09T05:55:50.167467 | 2017-02-01T22:44:30 | 2017-02-01T22:44:30 | null | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 3,515 | cpp | QSystemSemaphore.cpp | /*
Qt4xHb - bibliotecas de ligação entre Harbour/xHarbour e Qt Framework 4
Copyright (C) 2012-2017 Marcos Antonio Gambeta <marcosgambeta@uol.com.br>
*/
#include <QSystemSemaphore>
#include "hbapi.h"
#include "hbapiitm.h"
#include "hbapierr.h"
#include "hbvm.h"
#include "hbstack.h"
#ifndef __XHARBOUR__
#include... |
1f65219f1e0fc41009852b8c091b100804a81a19 | e3d3d65fbded93e08791ea08e2b5e49d1a1782cf | /basic/health.cpp | d0b567fa297c7f6e6319f7fb4a8aa44e8221aa21 | [] | no_license | luuuwang/BugFight | 76c5ed06d6d06059f4b0fa4f72f021d4e441d8f8 | db5456c8c24d6d776bfd49a2d7edfb089e1dd9b0 | refs/heads/master | 2020-12-20T15:56:19.101260 | 2016-07-04T00:00:09 | 2016-07-04T00:00:09 | 62,516,828 | 0 | 0 | null | 2016-07-03T22:12:13 | 2016-07-03T22:01:02 | null | UTF-8 | C++ | false | false | 2,229 | cpp | health.cpp | #include "health.h"
Health::Health() :
screen(IOManager::getInstance().getScreen()),
start(Vector2f(Gamedata::getInstance().getXmlInt("health/startLoc/x"),
Gamedata::getInstance().getXmlInt("health/startLoc/y"))),
totalLength(Gamedata::getInstance().getXmlInt("health/length")),
currentLength(totalLengt... |
287b85752e862d426a226e91c6dfa0226df6805c | 211857ea633218010fbd6a9ce7e8210002c95ffe | /stl/algorithm/generate_copy.cpp | 39ac12f2dfadabb0ec9f925fd4292b5573e26af1 | [] | no_license | mettasri/cpp | 6fdcd1c5fc120277d9ecaf26692d2dfdf521474a | ab2800de215999576c3bc9604dce0254e45a1388 | refs/heads/master | 2022-11-18T22:26:47.562834 | 2020-02-05T18:24:38 | 2020-02-05T18:24:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 347 | cpp | generate_copy.cpp | #include <iostream>
#include <algorithm>
#include <iterator>
using namespace std;
struct g
{
g():n(0){}
int operator()() { return n++; }
int n;
};
int main()
{
int a[10];
generate(a, a+10, g());
// copy(a, a+10, ostream_iterator<int>(cout, " "));
ostream_iterator<int> out_it(cout, " ");
... |
1733d2a49e5054cfd7cf1fde458d5d49be01ac82 | 464d6cb42fb8981595cbf7260069cd1e6a67fe2f | /HashMap/Count distinct elements in every window of size k.cpp | 57e8f9d0b5f2add7ad9527eb1b4a39f7381fbba7 | [] | no_license | rahul799/leetcode_problems | fd42276f85dc881b869072b74654f5811c6618ea | cc7f086eb9ac9bbd20ea004c46d89aa84df10d36 | refs/heads/main | 2023-04-14T05:09:31.016878 | 2021-04-20T19:46:52 | 2021-04-20T19:46:52 | 359,933,382 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,500 | cpp | Count distinct elements in every window of size k.cpp | Count distinct elements in every window of size k
Last Updated: 27-06-2020
Given an array of size n and an integer k, return the count of distinct numbers in all windows of size k.
Example:
Input: arr[] = {1, 2, 1, 3, 4, 2, 3};
k = 4
Output: 3 4 4 3
Explanation:
First window is {1, 2, 1, 3}, count of distinct ... |
e749e69fb4cf1d9fd5f404174214715843331ca3 | 8a182aefb1c5298098d925f44202040fecc2b45e | /main.cpp | de4cc3a79dded076896675d9d8ba76f9a4610705 | [] | no_license | matthill/tesseract_z_issue | 598cb4296ed4e80d72f1558fe0ad9ce58df873f7 | d60f350c76b9106e14a3ec836d82c864e3cadc3d | refs/heads/master | 2021-01-10T07:24:51.914679 | 2016-03-06T14:46:28 | 2016-03-06T14:46:39 | 53,259,193 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,994 | cpp | main.cpp |
#include "tesseract/baseapi.h"
#include <iostream>
#include <leptonica/allheaders.h>
using namespace std;
using namespace tesseract;
int main( int argc, const char** argv )
{
tesseract::TessBaseAPI tesseract;
tesseract.Init("./", "leu" );
tesseract.SetVariable("save_blob_choices", "T");
tesseract.S... |
844628afe35ed2bfc603f752235e41f4dbb19e9e | 5401293f149bd72f35aa85f02d5efb52647c02e7 | /src/Utils/Graphics/ImageUtils.cpp | 53fa17909070cf393dd0215f513df08c28076240 | [] | no_license | thorhunter1/Tactics-Ogre-2 | 6d15c2792c2d6500858e448a89abf2f4384215f2 | f7caaeb63afdc1bdc2d96360c083d611530a69fd | refs/heads/master | 2021-01-01T06:33:02.816405 | 2015-07-31T09:08:00 | 2015-07-31T09:08:00 | 38,154,110 | 4 | 1 | null | 2015-07-26T12:27:36 | 2015-06-27T09:07:44 | C++ | UTF-8 | C++ | false | false | 1,760 | cpp | ImageUtils.cpp | #include "ImageUtils.hpp"
#include "Utils/Game/TeamColorEnum.hpp"
#include "SFML.hpp"
namespace Graphics
{
int teamColor( sf::Image& image, TeamColor color )
{
float red_paint = 1.0;
float green_paint = 1.0;
float blue_paint = 1.0;
//float alpha_paint = 1.0;
if( color... |
3c79a1b1c2bfb0e8b30a4096636e8f7a1798bb9b | 7694e64aa2b72d58eb740465a0c8c010744c59a4 | /doc/Script/lua1/main.cpp | 913270be2e027c676af849c9db57d00ff7b28547 | [] | no_license | tlegorju/Escape_prototype | 44a6bb55dfca4c996f6c3d3085ba83a43fc7ea7e | ad2a9e6d0a2cce5e255bcb6b41d8739200940a68 | refs/heads/master | 2021-06-10T00:21:33.026412 | 2016-12-07T16:44:30 | 2016-12-07T16:44:30 | null | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 4,631 | cpp | main.cpp | #include <stdio.h>
#include <stdlib.h>
#include <lua/lua.hpp>
int helloWorld(lua_State* L)
{
printf("hello world/n");
return 0;
}
int affichage(lua_State* L)
{
int nbArguments = lua_gettop(L);
if (nbArguments != 1)
{
fprintf(stderr,"nombre d'arguments invalide");
return 0;
}
printf("param... |
c1d865fb2ce9491256ab93fba218445de5b8fc6f | 9af092bcc5b061841c10b2b6ee0a29d9ab06b0ed | /mgr.h | 45d82cf9bd300ffe3e663f64af0333697121f3b3 | [] | no_license | angeltears/minloadblance | 5c2e074a071e456bf27641c8683a3becdd749f8b | 9f115b3e792f9dfd6efbde331068a5ff8e6c1002 | refs/heads/master | 2020-03-19T13:30:12.556700 | 2018-07-30T05:27:14 | 2018-07-30T05:27:14 | 136,582,355 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,912 | h | mgr.h | //
// Created by solitude on 18-6-8.
//
#ifndef MINLOADBLANCE_MGR_HPP
#define MINLOADBLANCE_MGR_HPP
#include <map>
#include "conn.h"
using std::map;
using std::pair;
const unsigned int hostname_size = 1024;
class host
{
public:
char m_hostname[1024];
int m_port;
int m_connect;
};
class mgr
{
public:
... |
1b61007528a09704a8d84022142448053ce92610 | d6b4bdf418ae6ab89b721a79f198de812311c783 | /apigateway/include/tencentcloud/apigateway/v20180808/model/BindApiAppRequest.h | 47eb00fc963ab0c604ea6ac3a9cc4908b913609c | [
"Apache-2.0"
] | permissive | TencentCloud/tencentcloud-sdk-cpp-intl-en | d0781d461e84eb81775c2145bacae13084561c15 | d403a6b1cf3456322bbdfb462b63e77b1e71f3dc | refs/heads/master | 2023-08-21T12:29:54.125071 | 2023-08-21T01:12:39 | 2023-08-21T01:12:39 | 277,769,407 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,462 | h | BindApiAppRequest.h | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
... |
ba57be35c964ec6cb48f409ada81492f35e5fc6b | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/git/gumtree/git_repos_function_1721_git-2.7.6.cpp | e1339f188514d23e0402459333fabbfa2224e9c5 | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 152 | cpp | git_repos_function_1721_git-2.7.6.cpp | int unsorted_string_list_has_string(struct string_list *list,
const char *string)
{
return unsorted_string_list_lookup(list, string) != NULL;
} |
35c7cbe1e689aaa0a6c35040ff90cc6d75f118c1 | 1f93e0e27bc369e79cc44e9adcc2d321eb19e8f5 | /samples/calculator/calculator.cpp | 73c466af3d1832eacd32b7fede6ca4392487b7f2 | [
"MIT"
] | permissive | king-mampreh/apply | 60790b6437fc966a0ad524e682c1584958a8ff59 | 9b3eb14af0b2b5cddb12ea5f4986631213a2fc80 | refs/heads/master | 2020-05-19T20:24:12.382382 | 2019-05-17T21:01:04 | 2019-05-17T21:01:04 | 185,201,076 | 3 | 0 | MIT | 2019-05-17T21:01:05 | 2019-05-06T13:21:28 | C++ | UTF-8 | C++ | false | false | 1,611 | cpp | calculator.cpp | // Copyright (c) King Mampreh. All rights reserved.
// Licensed under the MIT License.
#include <xt/apply.h>
#include <iostream>
#include <map>
template <typename F, typename G>
auto operator | (F&& f, G&& g) {
return [=] (auto... args) {
return f(args...) || g(args...);
};
}
const auto pred = std:... |
4a55798912e7e8f0ef2604a8e8de7337bf68e289 | 65a03ca4c6532445ca9de827669c876383b3b821 | /ISMK.77257.Lectures/meters-sensors/W06T02.I2C.2x16-LCD.Printing/W06T02.I2C.2x16-LCD.Printing.ino | 82fae17ae09a8f2521d0884d936dbae28c8d8771 | [
"MIT"
] | permissive | coshkun/Arduino | 518c5a7c9d31d38011b6ac26fdb0e863b17eac07 | 6954fac75dfb634ec6eb7fa01af9231cb1a9bdc1 | refs/heads/master | 2020-04-04T22:50:22.885908 | 2017-07-29T17:31:04 | 2017-07-29T17:31:04 | 82,003,951 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 839 | ino | W06T02.I2C.2x16-LCD.Printing.ino | // #include <Wire.h> // Comes with Arduino IDE
// Get the LCD I2C Library here:
// https://bitbucket.org/fmalpartida/new-liquidcrystal/downloads
#include <LiquidCrystal_I2C.h>
LiquidCrystal_I2C lcd(0x27, 2, 1, 0, 4, 5, 6, 7, 3, POSITIVE);
String mesaj = "iyi gunler!";
void setup() {
// put your setup code here, ... |
d16cda8cd674e13ce1b9731056fb2d22eda17a78 | 75ee79b8abdd9512f6357a814e1cde5b537012f7 | /ClientTests/InputTest.cpp | 806c16a52e879826bfb6afe1bf17b88243ec85cf | [] | no_license | BlindAnguis/Shooterman | 418aa8624719bd0ffa99cfdf29439b0303fb7cc0 | 166cab7df5a05fd4b506c6acf3f9748bcb4d0996 | refs/heads/master | 2020-04-21T17:35:51.915001 | 2020-01-31T15:42:53 | 2020-01-31T15:42:53 | 169,740,884 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 956 | cpp | InputTest.cpp | #include "InputTest.h"
#include "../Shooterman/Common/Messages/MouseMessage.cpp"
#include "../Shooterman/Common/Messages/InputMessage.cpp"
InputTest::InputTest() {}
InputTest::~InputTest() {}
void InputTest::SetUp() {
mMessageHandlerMock = std::make_shared<MessageHandlerMock>();
mKeyboardMock = std::make_share... |
9bffa6e0d8177d490b4c06c80e05f6053c142b29 | 773f615ca7f3111f33c9ee34c23359df0f7dd3e0 | /UnitTesting/UtilsTest.cpp | 578861117cbaef39db38e1c258d90a1c9141145b | [] | no_license | keloysiusmak/cs3201-group6-spa | 9b97df28accf5187b61b110ac4c4bb5545dda02a | 6cb4f849c9c59edb82661d51bc579b0df3338732 | refs/heads/master | 2021-09-12T08:20:51.849978 | 2018-04-15T15:37:32 | 2018-04-15T15:37:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,877 | cpp | UtilsTest.cpp | #include "stdafx.h"
#include "CppUnitTest.h"
#include "../SPA/PKB.h"
#include "../SPA/PatternObject.h"
#include "../SPA/Parser.h"
using namespace Microsoft::VisualStudio::CppUnitTestFramework;
using namespace std;
namespace UtilsTest
{
TEST_CLASS(UtilsTest)
{
public:
TEST_METHOD(UtilsSanitise) {
string testS... |
10d39b57b80da6802b4d83527c15800517a8004e | a00aee39f3ea46b370177fcc6b7bc703d153bbd0 | /Tracers/SingleSphere.h | 7afd394d696fb763f22afd5039ce6069b477afbd | [] | no_license | Crystal521/RayTracer | 9253c605a85f9adad5ee28ab9dbddf8d1ecbf005 | 34b455dc30346fb80b6c734b5dc67903ee9e06d6 | refs/heads/master | 2020-06-20T02:06:00.382323 | 2016-05-08T02:45:09 | 2016-05-08T02:45:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 296 | h | SingleSphere.h | #ifndef _SINGLESPHERE_H_
#define _SINGLESPHERE_H_
#include "Tracer.h"
class SingleSphere:public Tracer
{
public:
SingleSphere();
SingleSphere(World* pWorld);
virtual ~SingleSphere();
virtual RGBColor TraceRay(const Ray& ray) const;
protected:
private:
};
#endif // !_SINGLESPHERE_H_
|
7e467ff1b81ec0f0971da28b46e7f00d33bf6aa6 | f6a8c46fed9988802e1d58bce865964c2efd63f7 | /cpp_05/ex03/Intern.cpp | 6e10ba754cb41aa6360efd6a8d26ef96ed027e3e | [] | no_license | aquinoa-nba/Cpp_modules | adedf7e955f56e01d3bde5643e3cb0512deee7a8 | dd36891f15b4d7a91dbeef5b850eea4f8257307b | refs/heads/master | 2023-08-19T02:27:54.814411 | 2021-10-08T16:02:55 | 2021-10-08T16:02:55 | 372,608,645 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,035 | cpp | Intern.cpp | #include "Intern.hpp"
Intern::FormsGenerator::FormsGenerator(std::string const &formName, Form *(func)(std::string const &))
: _formName(formName), _func(func) {}
Intern::FormsGenerator::FormsGenerator(FormsGenerator const &other) { *this = other; }
bool Intern::FormsGenerator::checkName(std::string const &formName... |
e516d3d7506f4b36a08fabbe2e3b91489b99d80c | 44c0913601ce2bb10674682b77fc47dc5b0a7601 | /Chapter_7/Lectures/Recursion/Reverse_String/Iterative_Version/reverse_string_iterative.cpp | 8a55dcdf31bbb576b6f4bd7070904dcf57f8dde5 | [] | no_license | justin-nguyen-1996/Learn_CPP | ca11ff151be47ce25976ed73e6e19e6a0f4966c5 | 05f9a95943914ac37adba6e20d3dd9d037d89d6c | refs/heads/master | 2020-04-12T06:22:05.834288 | 2017-05-18T02:52:08 | 2017-05-18T02:52:08 | 59,640,823 | 2 | 1 | null | 2016-06-05T19:11:57 | 2016-05-25T07:29:43 | C++ | UTF-8 | C++ | false | false | 588 | cpp | reverse_string_iterative.cpp | /*
Author: Justin Nguyen
Created: 7/7/2016
*/
#include <iostream>
#include <string>
#include <vector>
void swap(char &a, char &b) {
char temp = a;
a = b;
b = temp;
}
void reverseString(std::string &str) {
int length = str.length();
for(int i = 0; i < length / 2; i += 1) {
swap(str[i], str[length - 1 - i]);... |
5362963ecfa113e08f25f3c771aad61be68dfe7e | 2d42a50f7f3b4a864ee19a42ea88a79be4320069 | /source/system/input/keymap.cpp | 7421f90e83d2887b4630062d5a5faa254add53c3 | [] | no_license | Mikalai/punk_project_a | 8a4f55e49e2ad478fdeefa68293012af4b64f5d4 | 8829eb077f84d4fd7b476fd951c93377a3073e48 | refs/heads/master | 2016-09-06T05:58:53.039941 | 2015-01-24T11:56:49 | 2015-01-24T11:56:49 | 14,536,431 | 1 | 0 | null | 2014-06-26T06:40:50 | 2013-11-19T20:03:46 | C | UTF-8 | C++ | false | false | 1,527 | cpp | keymap.cpp | #include "system/errors/module.h"
#include "system/events/key_event.h"
#include "keymap.h"
PUNK_ENGINE_BEGIN
namespace System
{
struct KeyMapImpl
{
~KeyMapImpl()
{}
KeyboardActionsCollection m_actions;
};
void KeyMap::Add(Key key, KeyboardAction action)
{
impl->m_actions[key].insert(action);
}
void K... |
0e34579423aafdc2aa3c889356730c17dccaf95a | 0301361c8677d9d24703a8ad73eb8c8c90f09736 | /src/engine/version.h | 41d3e69a408bf1ef76b908d2b99bccf2105cff2a | [
"MIT"
] | permissive | dj2/Elysian | a2b57593f5a6c57d9f9547336e6fb47c0ee7184f | 02d35946774ec144edee848eddb85efa01b86d33 | refs/heads/main | 2023-07-18T01:40:28.450710 | 2021-08-28T02:54:08 | 2021-08-28T02:54:08 | 397,942,528 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 950 | h | version.h | #pragma once
#include <cstdint>
namespace el::engine {
// Shift values for creating a Vulkan Version.
constexpr auto kVkVariantShift = 29;
constexpr auto kVkMajorShift = 22;
constexpr auto kVkMinorShift = 12;
class VersionInfo {
public:
VersionInfo() = default;
// NOLINTNEXTLINE(bugprone-easily-swappable-param... |
e8b83af2d0f3be0115bdc38db5a5c5b50b85e95f | b775e61080e749f8441c8cadc030bc33ed5290f1 | /daemon/monitor.cpp | edaff7607a5ef717252fcc2d11d1c87e5362090f | [] | no_license | sunny-val/gps_server | f790ea8a42b2273f561df8ffad92643df08a0b65 | b56f3dce0d65344095e9d4daf9a714fddb84e154 | refs/heads/master | 2020-04-11T10:46:00.733378 | 2018-11-27T05:20:39 | 2018-11-27T05:20:39 | 161,725,510 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,641 | cpp | monitor.cpp | /*
* monitor.cpp
*
* Created on: 30.05.2016
* Author: sunny
*/
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/file.h>
#include <execinfo.h>
#include <unistd.h>
#include <errno.h>
#include <wait.h>
#include "monitor.h"
#include "log.h"
#include "work.h"
//#defin... |
43228cabc328c24936790533ad1579f6446832e9 | 43d677cc0296e9d00d43d2c984d44492ad022aa0 | /TestPlayerMain/TestPlayerMain.cpp | d43fd6794c03b9c8e034d33ed2abb4c573a60d0f | [] | no_license | mustafadincer/TestPlayerMain | 0fae5ac5eb90e257f09ed31a4b265be3f28312ed | 484a21c212e2ac8b5d72c82bde3a476a5a9dd32c | refs/heads/master | 2023-04-09T05:09:29.854552 | 2021-04-14T01:49:50 | 2021-04-14T01:49:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,367 | cpp | TestPlayerMain.cpp | // TestPlayerMain.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
// Program tests out Player class by reading input from console, calling Player functions to store data
//
#include <iostream>
#include <string>
#include "player.h"
using namespace std;
#define MAX_NAME_SIZE 2... |
255396ac594d461a335f46a6c1e26a63bfcb81d7 | c920079b644668fcea120937ec7bec392d2029bd | /B4---C++-Programming/cpp_bomberman/src/save/XmlSave.cpp | 5e7bb374d3ba6cca9ee0b4ddc7858f69e32e9385 | [] | no_license | Ankirama/Epitech | d23fc8912d19ef657b925496ce0ffcc58dc51d3b | 3690ab3ec0c8325edee1802b6b0ce6952e3ae182 | refs/heads/master | 2021-01-19T08:11:27.374033 | 2018-01-03T10:06:20 | 2018-01-03T10:06:20 | 105,794,978 | 0 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 5,027 | cpp | XmlSave.cpp | #include "XmlSave.hh"
#include "GameState.hh"
XmlSave::XmlSave(std::string const &filename, int nbPlayers, int nbAIs): m_ofs(filename.c_str()),
m_xmlWrite(this->m_ofs) {
this->m_nbPlayers = nbPlayers;
this->m_nbAIs = nbAIs;
this->m_playersDone = false;
this->m_AIDone = false;
this->m_playersStarted = false;
... |
390c5d1e3a5c5088c0227837f7cbe1df387efb58 | 8f0cb1228b109ce976c9228153b405a23118dc71 | /swarm_ws/src/contour_node/src/level_description.cpp | 094587dd1137be3b0ef6abc3d349f55b8a29cc99 | [
"BSD-3-Clause"
] | permissive | wvu-irl/reu-swarm-ros | f57124eec12011c19d367e881cf5903e6d1b44be | d63c9c4435cd22d8eca5414bf1a4602dd892c3af | refs/heads/master | 2020-05-26T13:18:24.620892 | 2019-09-01T02:13:23 | 2019-09-01T02:13:23 | 188,242,415 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,280 | cpp | level_description.cpp | /*********************************************************************
* Software License Agreement (BSD License)
*
* Copyright (c) 2019, WVU Interactive Robotics Laboratory
* https://web.statler.wvu.edu/~irl/
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or w... |
f25bb56a7f81c50fe3609905386613f563215eae | 59a53ffbfe19eb84ba310e66889462ce67451318 | /463.islandPerimeter.cpp | 5118819ffc790efef80b79cf513386e14d8788d8 | [] | no_license | wfnuser/leetcode | 0877e03fed6617836a8c4dd695f62868d00c0f05 | 3202104983b4b68272766a3285ffe8683e9b1712 | refs/heads/master | 2022-06-29T04:16:12.874513 | 2022-05-25T05:52:03 | 2022-05-25T05:52:03 | 142,956,247 | 42 | 14 | null | null | null | null | UTF-8 | C++ | false | false | 954 | cpp | 463.islandPerimeter.cpp | class Solution {
public:
int ans = 0;
int islandPerimeter(vector<vector<int>>& grid) {
if (grid.size() == 0) return 0;
if (grid[0].size() == 0) return 0;
int m = grid.size();
int n = grid[0].size();
int i = 0;
int j = 0;
int ans = 0;
for (i = 0; i ... |
a4f4ca7cbf270bc146aec73db94bfa2c31fb053a | ffd784337744c75a386ac073bab5306b00c5b3bd | /zerojudge/d401.cpp | 877d2966be0b0310f608782d051766aad9ecde85 | [] | no_license | jimmyhealer/Competitive-Programming | b93ff0397cef7076b98f711f8a270151891a9233 | 7a6cc7f942b956784998fe0573e6ba8e0d572544 | refs/heads/master | 2022-02-15T00:48:12.289354 | 2019-09-08T03:41:08 | 2019-09-08T04:20:54 | 284,256,471 | 2 | 0 | null | 2020-08-01T12:34:13 | 2020-08-01T12:34:12 | null | UTF-8 | C++ | false | false | 875 | cpp | d401.cpp | #include<stdio.h>
#include<queue>
#include<vector>
using namespace std ;
vector<int> a[2] ;
priority_queue<int,vector<int>,greater<int> > que[2] ;
int main(){
int N ;
while (~scanf("%d",&N)){
a[0].clear() ;
a[1].clear() ;
//input -------------
for (int i=0 ,p ,h ;i<N ;i++ ){
scanf("... |
34dc15c2f8468d70cf0233e9ae69f710d07b2049 | c30e51031f62074ba0741920e385ed2fd9416e5a | /Semaphore.cpp | e9d4ebe5fb0b900620c84c26ba5e55a8ab74b50b | [] | no_license | tectronics/outcall | f3ddb3fbeffe47262a0edd0416afbf21714accd9 | 094ddd7863a3fab152d76d3d90536bb415e9a6b5 | refs/heads/master | 2018-01-11T15:00:15.774271 | 2008-07-02T08:43:18 | 2008-07-02T08:43:18 | 45,312,847 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,464 | cpp | Semaphore.cpp | /*
* Copyright (c) 2003-2007, Bicom Systems Ltd.
*
* 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 source code must retain the above copyright notice,
... |
c99044f4545f2b1d8530e4e6908895c6197182bc | b66715c97e48731ebba2afb8d81d02beb695c691 | /TopCoder/9824 - CorporationSalary (SRM 407 [Div1 easy - Div2 medium]).cpp | 63d662b0aa5bdeb9b517b764779c6aaaef85956d | [] | no_license | justHusam/Competitive-Programming | c105b982108db914d80c759741302a9828b123b4 | 4c86037370774dc18beb1f2b302a59f2e84979d4 | refs/heads/master | 2020-03-19T10:26:12.874772 | 2018-09-14T12:24:41 | 2018-09-14T12:24:41 | 136,369,844 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 674 | cpp | 9824 - CorporationSalary (SRM 407 [Div1 easy - Div2 medium]).cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
class CorporationSalary {
public:
vector<int> g[50];
ll dp[50];
long long totalSalary(vector<string> relations) {
int n = relations.size();
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (relations[i][j] == 'Y')
g[i].p... |
9e5ea2471e26110420a3dfb200d0d5b63c4d2936 | 22e0fe422b202f43f22466ea093784bbe5781575 | /circular_queue_cpp98/test3_circular_queue.cpp | 479c581e334c61d1368092f89c9f593e758b68aa | [] | no_license | ClarkSims/AlgosInC- | 7f05f405a1f154275e316e9d5feb4713734a93fa | 14d16cee499d78f90916e65a25f7279305e6a659 | refs/heads/master | 2020-05-15T19:42:50.030611 | 2019-06-06T22:02:46 | 2019-06-06T22:02:46 | 182,461,426 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,481 | cpp | test3_circular_queue.cpp | /// \file test3_circular_queue.cpp
/// \brief This program test the major interface functions of circular_queue, begin(), end(), push_back() and
/// pop_front. It test the boundary conditions where the buffer is full and is empty also.
#include "circular_queue.h"
#include "CustomRand.h"
#include <iostream>
using n... |
c65093278cae6a63b9e8d65eede56f91585642c4 | e3b67db8b0ea9af2ba890dc4e119ff22876a2232 | /extensions/aws/s3/S3Wrapper.h | 4bce76217112e74dd48deb32eefe4474f854bb49 | [
"MPL-2.0",
"Apache-2.0",
"BSD-3-Clause",
"curl",
"OpenSSL",
"libtiff",
"bzip2-1.0.6",
"MIT",
"LicenseRef-scancode-public-domain-disclaimer",
"MIT-0",
"Beerware",
"Zlib",
"NCSA",
"ISC",
"CC0-1.0",
"LicenseRef-scancode-object-form-exception-to-mit",
"BSL-1.0",
"LicenseRef-scancode-pu... | permissive | apache/nifi-minifi-cpp | 90919e880bf7ac1ce51b8ad0f173cc4e3aded7fe | 9b55dc0c0f17a190f3e9ade87070a28faf542c25 | refs/heads/main | 2023-08-29T22:29:02.420503 | 2023-08-25T17:21:53 | 2023-08-25T17:21:53 | 56,750,161 | 131 | 114 | Apache-2.0 | 2023-09-14T05:53:30 | 2016-04-21T07:00:06 | C++ | UTF-8 | C++ | false | false | 15,191 | h | S3Wrapper.h | /**
* @file S3Wrapper.h
* S3Wrapper class declaration
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the ... |
248caefd9877edbf3ecb84c7c2ca2aeda63d57b0 | d1cae7eb03865040994e629c8b9cc456dd129e8d | /main.cpp | f0b11cc0ab451fb176ed47caf069b193451b6335 | [] | no_license | kalaharileeu/TestSDL2 | 3375e8c5750c5937457d4004c4eaa0fa0d71e09a | d7ec508526c3e774678dc8597e6c59523b9256cc | refs/heads/master | 2021-01-13T02:42:10.232041 | 2017-01-03T22:56:51 | 2017-01-03T22:56:51 | 77,181,275 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 870 | cpp | main.cpp | #include<SDL.h>
SDL_Window* _gWindow = 0;
SDL_Renderer* _gRenderer = 0;
int main(int argc, char* args[])
{
// initialize SDL
if (SDL_Init(SDL_INIT_EVERYTHING) >= 0)
{
// if succeeded create our window
_gWindow = SDL_CreateWindow("Hello SDL2",
SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED,
640, 480, SDL_... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.