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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
26df3844f0936e1407ae04e0c5390627e214a375 | e12376aadfc081042c5df6eeb9954091b8801493 | /vcf/src/vcf/ApplicationKit/Containers.h | e7fba1029756bc5fe56f12154d2b0df5474bb8ee | [] | no_license | jimcrafton/visualcomponentframework | 65d5c4a72309884477089ce102ebc44f3eb28e27 | 87d7f44ad15bbf42fac6c8cd5fba3c6ecc51eb45 | refs/heads/master | 2022-11-30T05:44:27.210513 | 2022-11-19T01:29:35 | 2022-11-19T01:29:35 | 181,391,567 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,560 | h | Containers.h | #ifndef _VCF_CONTAINERS_H__
#define _VCF_CONTAINERS_H__
//Containers.h
/*
Copyright 2000-2004 The VCF Project.
Please see License.txt in the top level directory
where you installed the VCF.
*/
#if _MSC_VER > 1000
# pragma once
#endif
#ifndef _VCF_ABSTRACTCONTAINER_H__
#include "vcf/ApplicationKit/AbstractContain... |
c7d45599a94c4bdc26465be3ce2fa15249e99ac3 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_6404600001200128_1/C++/fidels/a.cpp | 59b194473da78dc03fb33464d60b4e22c95f294f | [] | 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 | 478 | cpp | a.cpp | #include <iostream>
using namespace std;
#define MAXN 1024
int main() {
int T, t, i, N, n[MAXN], RES1, RES2, tmp;
cin >> T;
for (t=1; t<=T; t++) {
cin >> N;
for (i=0; i<N; i++) cin >> n[i];
RES1 = RES2 = tmp = 0;
for (i=1; i<N; i++) if (n[i] < n[i-1]) { RES1 += n[i-1]-n[i]; tmp = max(tmp... |
0a8142cde56f7ada28d1e117e7425ac24bb5fed0 | a38f0bdc1eee30eb2147ea38f2f6373872828672 | /test/test_nvim_eval.cpp | a6300d40bdf357b84d693bb2c59e829abb495fd8 | [
"MIT"
] | permissive | nightcat85/nvui | e23529045b3f58692dfb5cac270f493f97eed706 | 1069bfe34346f748ae8623327f29f9fde5f836a5 | refs/heads/main | 2023-08-27T00:58:33.405444 | 2021-11-01T20:11:04 | 2021-11-01T20:11:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,162 | cpp | test_nvim_eval.cpp | #include "nvim.hpp"
#include "utils.hpp"
#include <catch2/catch.hpp>
#include <atomic>
#include <iostream>
#include <memory>
#include <string>
#include <utility>
#include "object.hpp"
using namespace std::chrono_literals;
TEST_CASE("nvim_eval callbacks work", "[eval_cb]")
{
Nvim nvim;
REQUIRE(nvim.running());
S... |
894b99ddce2f095f2dfb2ad55e13e8be49bf0fa4 | 0d8fec925f144e1133607dd07b3b36e803c81926 | /Project1/Project1/UnitTests.cpp | d6a58a21d06c5056ec965e0117eda65b1e2cb839 | [] | no_license | Xydrel/UdemyDataAndAlg | d771746161938af0b857d15d7255aa44f6ef5249 | 3cdb9e8b0bc0b29b170d122cf24e8af83fe8925a | refs/heads/master | 2022-12-15T09:41:57.437211 | 2020-09-09T22:43:38 | 2020-09-09T22:43:38 | 198,282,160 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,654 | cpp | UnitTests.cpp | #include <iostream>
#include "UnitTests.h"
#include "Includes.h"
namespace utests
{
UnitTests::UnitTests()
{
}
UnitTests::~UnitTests()
{
}
std::string UnitTests::GetUserInputStringFromConsole()
{
std::string input;
printf("Please enter a response y/n: ");
getline(std::cin, input);
return input;
}
int UnitTes... |
d48b12d367a00f279fa4515750c514902b05396c | dfbe2e3f04e29dd30f67af8caf73aba4e4f97345 | /include/libfoundation/AEKeyboard.hpp | 6433148eb3be7acbadf1422009e32ec6e36023e4 | [] | no_license | rossomathieu/Ipsum | a0e236c87b27324bf5eebfc8a9ffc6904f0a139d | d2b3dc9864a197de7be034dc5189adc477096cfd | refs/heads/master | 2021-01-13T02:44:38.199626 | 2014-05-21T00:35:54 | 2014-05-21T00:35:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 161 | hpp | AEKeyboard.hpp | /*
* AEKeyboard.hpp
*
* Created on: Apr 29, 2014
* Author: ross
*/
#ifndef AEKEYBOARD_HPP_
#define AEKEYBOARD_HPP_
#endif /* AEKEYBOARD_HPP_ */
|
39100bc851500e36ba2f53ef39c89d967d3929e9 | 3c355838cb81b2427b3b7fc7d8fc047940b4147e | /set7/blocks/keyframe_block.hh | a5e4f9f26864349de4f6d203427c53387a1858c4 | [] | no_license | abjose/CS171 | 0878bec569906fb46025dcfa09a9f3be17e7dd55 | 0bd9f861b371948295f96a94eed31d8a989374e4 | refs/heads/master | 2016-09-06T03:43:14.190167 | 2014-02-08T19:58:05 | 2014-02-08T19:58:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,085 | hh | keyframe_block.hh | #ifndef __KEYFRAME_BLOCK_H_GUARD__
#define __KEYFRAME_BLOCK_H_GUARD__
#include <memory>
#include <math.h>
#include <algorithm>
#include "../matrix/matrix.hh"
#include "../matrix/transform.hh"
#define PI 3.14159265
class KeyframeBlock {
public:
//private:
Matrix<float,4,1> rotation;
Matrix<float,4,1> quat;
Ma... |
89e1dceced805fa3528947b2f6b116a49ad8779a | 39e348a6cfdc365a49b03695a3a86f92aa72fd2b | /C++/StackandMatch/stack.cpp | 5a68c70e3c6eec4786367aac6d701c259224fdb8 | [] | no_license | qiuyongchen/code_saver | fd646e969774b190d764f709c4233e6283af84f1 | afbec799e72901e85e9434bbe3cc745d9735fc6f | refs/heads/master | 2021-01-10T04:48:00.349287 | 2016-02-21T04:18:52 | 2016-02-21T04:18:52 | 45,052,084 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 588 | cpp | stack.cpp | #include "stack.h"
#include <iostream>
#include <string>
using namespace std;
Stack::Stack() {
for (int i = 0; i < 200; i++) {
base[i] = -1;
}
size = 0;
}
void Stack::push(char c) {
base[size] = c;
size++;
}
char Stack::pop() {
char c;
c = base[size - 1];
size--;
return c;
}
char Stack::top()... |
82e838458b4bb157148c044b8503d3233759d399 | 15ccb7ec378269cb7e1f78578ee979f352ba28c8 | /src/engine/utils.hpp | 57d0731154a06822fc7f8aea06b9497938546e44 | [] | no_license | coudam/Fractal_engine_Course_project | e030fa9207f89e38f17cc98e42d058c0e321bf0c | 2b754e0e207efc5f8e36dafcfdc9b543aba08d44 | refs/heads/main | 2023-03-31T16:45:56.036428 | 2021-04-05T12:35:17 | 2021-04-05T12:35:17 | 323,935,860 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 511 | hpp | utils.hpp | #pragma once
#include <vector>
template<typename T>
struct safe_vec_ptr{
safe_vec_ptr() {}
safe_vec_ptr(const safe_vec_ptr<T> &&t): it(t.it), id(t.id) {}
safe_vec_ptr(const safe_vec_ptr<T> &t): it(t.it), id(t.id) {}
safe_vec_ptr(std::vector<T> &v, int i): it(&v), id(i) {}
T *operator ->() {return &((*it)[id]);}... |
5326e24194846c89c3ed307a19e734536fee9432 | 42bdf0843dff8f892bc0b77507686436efdca391 | /include/SMCE/SketchConf.hpp | 877e9d6dcba2423d566ef8302227a96bc46641d2 | [
"Apache-2.0"
] | permissive | ItJustWorksTM/libSMCE | 08e89413595944babf5cd3bc3836806473a24e55 | bbe3bb390a43971d242998299c367eb1d7facf85 | refs/heads/master | 2022-11-10T20:48:34.452546 | 2022-11-05T23:25:55 | 2022-11-05T23:27:40 | 330,171,147 | 7 | 35 | Apache-2.0 | 2022-06-07T10:47:30 | 2021-01-16T13:40:11 | C++ | UTF-8 | C++ | false | false | 1,777 | hpp | SketchConf.hpp | /*
* SketchConf.hpp
* Copyright 2021-2022 ItJustWorksTM
*
* 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... |
075fdbd8e8bff030badb72ef0b2f74348ba2e0dd | b2773b26091468ca05bef1507ebb9d7f9dc64eaf | /src/MicroZedHCC.cpp | b0d4a35d485fd8e77d38f26179d6a8eb02ce8105 | [] | no_license | kkrizka/chister | c8f4eac519b567fd760a68c8dad13ef0086040ba | 910d98ae5f5255a2bc281ad7c936603873f7f598 | refs/heads/master | 2021-01-20T18:33:00.452273 | 2018-08-17T22:44:47 | 2018-08-17T22:44:47 | 90,922,600 | 0 | 1 | null | 2017-09-29T20:20:39 | 2017-05-11T01:12:05 | Jupyter Notebook | UTF-8 | C++ | false | false | 849 | cpp | MicroZedHCC.cpp | #include "MicroZedHCC.h"
#include <QDebug>
MicroZedHCC::MicroZedHCC(QObject *parent)
: SerialDevice("COM4", parent),
m_testRunning(true)
{
setLineEnd("\n\r");
}
void MicroZedHCC::interpretData(const QByteArray& data)
{
if(data.startsWith("ZYNQ_REPORT: Start HCC Test"))
{
... |
85d8c79579ef308dc18f5e7e7c8614bfb43cac29 | bc84c328d1cc2a318160d42ed1faa1961bdf1e87 | /windows/VC++/DLL/DLL_var_func_class/call.cpp | e7878ac71f5642d5e92fb06b1ab2509bfc532750 | [
"MIT"
] | permissive | liangjisheng/C-Cpp | 25d07580b5dd1ff364087c3cf8e13cebdc9280a5 | 8b33ba1f43580a7bdded8bb4ce3d92983ccedb81 | refs/heads/master | 2021-07-10T14:40:20.006051 | 2019-01-26T09:24:04 | 2019-01-26T09:24:04 | 136,299,205 | 7 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 337 | cpp | call.cpp | #include"stdio.h"
#include"..\\1095.h" // 类声明
#pragma comment(lib,"..\\Debug\\1095.lib")
int __declspec(dllimport) nMy1095;
int __declspec(dllimport) fnMy1095();
class __declspec(dllimport) CMy1095;
int main()
{
printf("nMy1095=%d\n",nMy1095);
printf("fnMy1095=%d\n",fnMy1095());
CMy1095 A;
A.print();
getchar();
... |
6285cc8335cc922c6e6b621b1a65cbbcbd0fe342 | f2b1a0eb2c9bb452eba10136f1854c14099f3f36 | /Arduino_uno_klon/Genel_kod.ino | f6205347dd83e171f8bfee0b60f5fdf19c7ff421 | [
"Unlicense"
] | permissive | HuseyinOzlu/Robocop | 84f76322a1d594056a05b29b42b28b098f516efb | 046759d577afe2345f82dacae81aa78c0d940241 | refs/heads/main | 2023-03-06T02:33:46.842694 | 2021-02-20T14:00:35 | 2021-02-20T14:00:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,672 | ino | Genel_kod.ino | #include <LiquidCrystal.h>
#define Wifi_ismi "WiFi_Ismi"
#define Wifi_sifresi "WiFi_Sifresi"
#define IP "184.106.153.149" //thingspeak.com IP adresi
int ToprakPin = 6;
int veri;
int trigPin = 7; //Ultrasonik sensör trig pini değişkeni
int echoPin = 6; ... |
bb207e07d0f5317f76213b8a5173dc19fe7caef0 | 7343924e48a713dba2982cc9d195ecadc81fda60 | /csd_parser/LotteryRecordNode.cpp | caaafb338a5640cc4c918922606d950cc2065a49 | [] | no_license | pjvslx/django_test | 1383f0f00fff6cca6bee8f0560f9f39a2719e18a | 294db9e8265f4026496b48dda57be31136ef4a16 | refs/heads/master | 2020-05-22T01:19:27.003295 | 2016-09-14T09:30:36 | 2016-09-14T09:30:36 | 56,908,753 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,346 | cpp | LotteryRecordNode.cpp | #include "LotteryRecordNode.h"
#include "ComponentManager.h"
#include "ResourceManager.h"
#include "ui/CocosGUI.h"
#include "OS.h"
#include "UIHelperHydra.h"
#include "Localization.h"
USING_NS_CC;
using namespace hydra;
using namespace ui;
using namespace std;
LotteryRecordNode::LotteryRecordNode()
: m_Image_back(n... |
0e231eb090721adb7209b4b8628a816a817ff423 | c3158c987fbd27437a8d22e1789648a373ac263c | /corona.cpp | 2ee7c701534f834f81f92690eb3eb3cc4a5f6a77 | [] | no_license | paulmathai01/VIRUS-DNA-VISULAISATION-OPENCV | cfa0d7c04af17174d00b743de78ec1b75efbec6d | 2a0b9fdb160d5058f39f31d6f4f74ed8542a9729 | refs/heads/master | 2022-07-17T21:42:50.930828 | 2020-05-07T05:29:36 | 2020-05-07T05:29:36 | 261,957,345 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,142 | cpp | corona.cpp | #include "pch.h"
#include "corona.h"
string corona::getmeta()
{
return meta_file_path;
}
void corona::openfile(vector <string>& file_names, ifstream& in)
{
//for loop runs till the number of images mentioned at the start of the meta file
string file_path;
in >> file_path;
//file names are read and... |
ec300956031ac6482d04c95402accb0d60e20ec3 | 3b105fc8398d9c5308c1585f17b922e9df124929 | /src/vm/CodeWriter.h | 6b71f7367d9bf4abd394d4030ef61da8a22a316c | [] | no_license | cbebe/computer-from-scratch | 2f05894fffe77e2907bb8c721bcb69e7450a7a94 | 3a26d5b90f28c20cf60e80373bf50abf7f7793f7 | refs/heads/master | 2023-01-08T08:25:53.662062 | 2020-11-07T00:38:06 | 2020-11-07T00:38:06 | 294,025,097 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 414 | h | CodeWriter.h | #ifndef _CODE_WRITER_H_
#define _CODE_WRITER_H_
#include <fstream>
#include <string>
#include "commands.h"
class CodeWriter {
public:
CodeWriter(const std::string &filename);
void setFileName(std::string &filename);
void writeArithmetic(std::string &command);
void writePushPop(command command, std... |
b7e26eb27d54bb2629e9d14b481afc4bbe7c149e | c22c1aed75252533bb5de8ce9ff3c0f5ac9814bc | /secure_tunneling/source/SecureTunnel.cpp | abcf4cb6d89567690c6715391c961af20df35a7b | [
"Apache-2.0"
] | permissive | QPC-database/aws-iot-device-sdk-cpp-v2 | d141caef6916646967dff1bb48e661bccc6f45f3 | 163fdf3bff9cc2a51f5d0aeca3d9356f665583a3 | refs/heads/main | 2023-06-15T00:33:28.643390 | 2021-06-22T21:02:05 | 2021-06-22T21:02:05 | 384,712,786 | 1 | 0 | Apache-2.0 | 2021-07-10T14:07:43 | 2021-07-10T14:07:43 | null | UTF-8 | C++ | false | false | 6,927 | cpp | SecureTunnel.cpp | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/iotsecuretunneling/SecureTunnel.h>
namespace Aws
{
namespace Iotsecuretunneling
{
SecureTunnel::SecureTunnel(
Crt::Allocator *allocator,
Aws::Crt:... |
de8a7e731a924cf2b7c7b95447eb92e79da8e40b | 3f77efa59b547516d00f41e90860ccc79b120454 | /OIG/Dwa słowa.cpp | a274f7fb5cd30653a7ef15c42aedac290951f346 | [] | no_license | markowanga/OI-OIG | 59c5dd5d5e4e37708351b68816a32874e720e10e | d66430730cbe965792ffbb5cb32cc96ee1de5e9d | refs/heads/master | 2022-10-15T13:02:57.082077 | 2022-10-14T12:47:45 | 2022-10-14T12:47:45 | 92,228,816 | 4 | 5 | null | 2022-10-14T12:47:47 | 2017-05-23T23:16:07 | C++ | UTF-8 | C++ | false | false | 2,072 | cpp | Dwa słowa.cpp | /**
* VI Olimpiada Informatyczna Gimnazjalistów
* Zadanie: Dwa słowa
* Wynik 100/100
* Wykonał: Marcin Wątroba
* http://main.edu.pl/pl/archive/oig/6/dwa
*/
#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
struct zn {
char z1;
char z2;
int por;
};
int ... |
14e97dc547c1d9d6536bb41b1b7717e668a65d5f | 1a2ea32fb375743e4c4c1dfce5411c569c8e4fd3 | /hgraph_to_graph.cpp | ac32022f356a2f56ebb2a74f7ee3022d18d140ad | [] | no_license | rostam/graph-exact-coloring-heuristic | f66b4cf114ec80da35ad49794478d67c06734c69 | 296535c2ea09b064af6fc34e0df2d679663bef10 | refs/heads/master | 2023-08-30T23:03:14.658658 | 2023-08-24T19:51:07 | 2023-08-24T19:51:07 | 165,992,255 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,978 | cpp | hgraph_to_graph.cpp | //
// Created by rostam on 14.05.17.
//
#include <fstream>
#include <iostream>
#include <sstream>
#include <vector>
#include <iterator>
#include <map>
#include <algorithm>
#include <omp.h>
#include <chrono>
using namespace std;
vector<string> split(string s) {
vector<string> tokens;
istringstream iss(s);
... |
2a5fb3240644b02b0b053f16249e7dabf9cb9735 | 9b1639af63f7fc82f0e488b452dee0cb7ae22a3b | /SolarisNAVScanner/heur/ba.cpp | 2f14b838fa8fb7a5e493d8de4cd5cf4d7a0d3a58 | [] | no_license | ExpLife/Norton_AntiVirus_SourceCode | af7cd446efb2f3a10bba04db8e7438092c7299c0 | b90225233fa7930d2ef7922080ed975b7abfae8c | refs/heads/master | 2017-12-19T09:15:25.150463 | 2016-10-03T02:33:34 | 2016-10-03T02:33:34 | 76,859,815 | 2 | 4 | null | 2016-12-19T12:21:02 | 2016-12-19T12:21:01 | null | UTF-8 | C++ | false | false | 1,590 | cpp | ba.cpp | // Copyright 1995 Symantec, Peter Norton Product Group
//************************************************************************
//
// $Header: S:/HEUR/VCS/ba.cpv 1.1 04 Jun 1997 16:35:40 CNACHEN $
//
// Description:
//
// Contains code for the bloodhound behavior analyzer (boy is it simple!)
//
// ... |
5ff9662720346424ebf0263a3d2e94c0a8ec826e | 95911dced9620fadcb26c64eae26b2cb98eb37b4 | /Algorithms/towersofHanoi.cpp | 55115ed54efb51331b85788529a2be8083c02233 | [
"MIT"
] | permissive | 890popbox/cpp-data-structs-algos | 4f692eed02011c295482760155ad0da50dfff75c | d9b28b16b5b2ea9e3960c53f9d4dad76933ddb91 | refs/heads/master | 2020-11-29T22:29:41.115737 | 2020-02-29T04:23:35 | 2020-02-29T04:23:35 | 230,230,341 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 641 | cpp | towersofHanoi.cpp | //The minimum number of moves for the towers of hanoi problem.
//This will display the moves to take as well
//Technically A can end up at B or C, but we want it to move from A to C..
//2^n − 1
#include <iostream>
#include <string>
using std::string;
using std::cout;
using std::endl;
//hanoi recurs.. DEFAULT VALUES ... |
bd53227b1254c8054590dfd899f5892f1d731657 | 3580743a70dea62c838bcace0234cf1b57b11f1b | /visualizer/include/visualizer/EntityContainer.hpp | 6ec997abca2f3ea4e383e98ece6629a48e557366 | [] | no_license | GabeRealB/visualizer-bachelor | b9c37272a95abc33ee886544c3959a54c2cbfcae | 8684c39918f6441ce5cc7676bbcd186115442a2c | refs/heads/master | 2023-04-13T05:40:25.038042 | 2020-12-22T15:58:49 | 2021-01-12T13:42:37 | 309,766,412 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,033 | hpp | EntityContainer.hpp | #pragma once
#include <array>
#include <functional>
#include <memory>
#include <span>
#include <unordered_map>
#include <vector>
#include <visualizer/AlignedMemory.hpp>
#include <visualizer/Entity.hpp>
#include <visualizer/EntityArchetype.hpp>
namespace Visualizer {
constexpr std::size_t ENTITY_CHUNK_SIZE{ 32 };
co... |
964d994341a9f35f9352298db5cd40732624a78f | a8fb0b60223be2506361b721e76394756b25a42f | /NetSlash/src/GameObjects/GameObject.cpp | 5441be69dc671cc4bf4c1531bb1ee7a7d3706422 | [] | no_license | jcordial/NetSlash | 2763d8cf81990687315c61d02913f804456bce08 | a74298e87674bc432e52a13efd8a2cf2b7a1cd75 | refs/heads/master | 2021-06-01T13:11:09.622357 | 2018-10-04T02:51:28 | 2018-10-04T02:51:28 | 9,219,096 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 601 | cpp | GameObject.cpp | //
// GameObject.cpp
// NetSlash
//
// Created by Jason Cordial on 10/17/12.
// Copyright (c) 2012 Jason Cordial. All rights reserved.
//
#include "GameObject.h"
#include "../Core/NetSlashCore.h"
using namespace cordial;
cordial::GameObject::GameObject():cordial::BaseObject(){
firstComponent = 0;
//register o... |
18ad49fbcc7db9892a77cb8d02924efe9e63bbeb | 7c2420e0a7c8b28a425a7ed5466b527cb4f27d9b | /sources/kern/include/J4VMField.hh | 114bf9ca5f74e80882caa208cd3ddce1f03ff124 | [] | no_license | nobuchiba1006/DOUMEKI | d1705054b95b79f9089ec5cff427513bd9fd5745 | 7c17ba485b616df5e15764d148d4fec358d7b480 | refs/heads/main_woroot | 2023-07-30T15:16:59.589294 | 2021-09-30T02:52:06 | 2021-09-30T02:52:06 | 411,891,541 | 0 | 0 | null | 2021-09-30T02:52:06 | 2021-09-30T02:07:10 | C++ | UTF-8 | C++ | false | false | 999 | hh | J4VMField.hh | // $Id: J4VMField.hh,v 1.1.1.1 2004/08/26 07:04:26 hoshina Exp $
#ifndef __J4VMFIELD__
#define __J4VMFIELD__
//*************************************************************************
//* --------------------
//* J4VMField
//* --------------------
//* (Description)
//* This class applies magnetic field.
//* Mothe... |
fc1452d3bb11dcf3c6fd4890663ed24abfee14fe | 5b24f3f1010c85d31c709be432b7f9122ed28389 | /src/xmlreader.cpp | 6ea4aa1b57e524645b17e899d89b37cfc67d1024 | [] | no_license | mazbrili/colin | ce3219fdb57476d0b9b2cf1093a80274ae0e0fd5 | dbb4e348018d2335aebfc62357fbfe57f14798ac | refs/heads/master | 2020-06-12T03:49:53.328571 | 2020-04-08T09:38:21 | 2020-04-08T09:38:21 | 188,362,792 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,441 | cpp | xmlreader.cpp | /***********************************************************
* $Id$
*
* Colin
*
* Copyright (C) 2011 Matthias Rauter (matthias.rauter@student.uibk.ac.at)
*
* 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 So... |
731fa1a761b4ca25fed2c02a5fce7e4c0c2ac41f | fc19902d085aea760b373da0fdc32e46913e6530 | /CS 355 - Data Structures & Algorithms/Beaver Projects Portfolio/Assignment 1/Project/fractions/Fraction.h | 87b12f9e78580b838a1328e89fb49042ea1f04ea | [] | no_license | mbeaver502/Undergraduate-CS-Work | b0e9bf9042132aabcd1f1c8b15b4939854354b30 | e821869e80c444de04a133e9f2be9eb47894bcca | refs/heads/master | 2020-07-13T02:35:29.216054 | 2016-08-24T18:03:43 | 2016-08-24T18:03:43 | 66,487,518 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,786 | h | Fraction.h | /*
Michael Beaver
CS355 Fall 2012
Assignment: Homework 1
Description: This program implements and demonstrates the usage and functionality of a Fraction class. The
Fraction class is made up of two integers (numerator and denominator). Fractions may be instantiated
as 1/1, a whole number, a custom fracti... |
b5cb10985e0d31b3067cd46ab67341cbc8a84359 | 481cf5223927b5918684cd77dc12b96101242bda | /include/State_SplashScreen.hpp | 986bcc925d39f31ce814a57a37093a93127f472b | [] | no_license | daanhenkek/Savior | bb6712f9f67e4d196a15e458ff90bb09fa3499a5 | 607153439927dd641a2b01ab91fd814cf211ab98 | refs/heads/master | 2020-03-19T23:51:10.538943 | 2018-06-12T05:42:12 | 2018-06-12T05:42:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 919 | hpp | State_SplashScreen.hpp | #pragma once
#include <string.h>
#include <stdio.h>
#include <switch.h>
#include "StateMachine.hpp"
class SplashScreenState : public State {
public:
inline SplashScreenState() {
this->Name = "SplashScreen";
};
inline void Start(StateMachine* machine) {
printf(CONSOLE_ESC(2J));
printf(... |
faaceefec2c5e5c24938c0e25732cb66a20ce604 | c16035bcc6fb68466cade2a138ab20814c55af8a | /Cpp/zad8/main.cpp | 17b67783fba715511de1084317a4e63072ecc209 | [] | no_license | kbudaj/university | 0e20f4ab87a69d7c4e168db67cd42fdccf957ee1 | 2c5c8f65d098a7524bb28639d079a7cb6cb3e942 | refs/heads/master | 2021-05-31T22:02:53.899518 | 2016-05-18T15:53:18 | 2016-05-18T15:53:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 737 | cpp | main.cpp | #include <iostream>
#include "bst.h"
using namespace std;
using namespace structures;
int main() {
BST<int> b;
b.insert(10);
b.insert(12);
b.insert(1);
b.insert(-1);
b.insert(30);
b.print();
cout << endl << "search 10: ";
cout << b.search(10) << endl;
cout << "search 12: ";
... |
cd962373321375fbc51ee77ddeff7d43605989b6 | 1d928c3f90d4a0a9a3919a804597aa0a4aab19a3 | /c++/cppcheck/2016/12/project.cpp | 03cfdb92568ff6d43132acb5d4e53823c7446b05 | [] | no_license | rosoareslv/SED99 | d8b2ff5811e7f0ffc59be066a5a0349a92cbb845 | a062c118f12b93172e31e8ca115ce3f871b64461 | refs/heads/main | 2023-02-22T21:59:02.703005 | 2021-01-28T19:40:51 | 2021-01-28T19:40:51 | 306,497,459 | 1 | 1 | null | 2020-11-24T20:56:18 | 2020-10-23T01:18:07 | null | UTF-8 | C++ | false | false | 2,688 | cpp | project.cpp | /*
* Cppcheck - A tool for static C/C++ code analysis
* Copyright (C) 2007-2016 Cppcheck team.
*
* 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
* (at ... |
d2191589824f3a99121f80d25de666738aa0e7b0 | 1ebe74309461b3b5893c39792bae7660c661ddb5 | /Examples/ESP32_TouchDown_Battery_Demo/ESP32_TouchDown_Battery_Demo.ino | b350a65477dd95b982578a0d0aa91106ae9a8444 | [
"MIT"
] | permissive | louisguan/esp32-touchdown | 0134ec85b92346d57942e94661d647da686f7d2d | 8b1302553e294cb28392cd262a51a713fdeda2bb | refs/heads/main | 2023-08-10T06:38:18.698391 | 2021-09-10T08:33:46 | 2021-09-10T08:33:46 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,056 | ino | ESP32_TouchDown_Battery_Demo.ino | /* ESP32 TouchDown Battery Monitoring Demo
* by: Dustin Watts
* date: 29-10-2020
*
* !WARNING Be careful when it comes to LiPo batteries. Always use a protected cell!
*
* This demo uses the BATT_DIV pin (GPIO35) which uses the ADC that is connected to
* a 100K/100K voltage divider. It takes a number ... |
e5c951cc41fc252e935f07a980c59d7bf031254e | 78315453fa344c1dad4d39a6884b9d91b21c2847 | /uvanew/uva_10924_slf.cpp | bc375079c8c999565b8b5b3042a7ce7fb247d715 | [] | no_license | shunno021/hello-world | d59c3cc0f0b997f9f4140881064a9dee365350ce | d1177da26cb8130a6212751cc8f21292925bd193 | refs/heads/master | 2020-08-14T06:52:31.938115 | 2019-10-14T19:03:09 | 2019-10-14T19:03:09 | 215,117,059 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 756 | cpp | uva_10924_slf.cpp | #include<bits/stdc++.h>
using namespace std;
bool IsPrime(int n)
{
if(n<1) return 0;
for(int i=2;i*i<=n;i++) {
if(n%i==0) {
return 0;
}
}
return 1;
}
int main()
{
char s[25];
int l,sm;
while(scanf("%s",s)!=EOF) {
l=strl... |
49e30c8e057ae5686cf3c2dc47bd15639f76e772 | 70607ac8e7cb765e6ad04113af9aa0ed5b5bcac5 | /prototypes/include/asm.hpp | 6073347edb19638f2159478b543572c48a360ef4 | [
"MIT"
] | permissive | MasterQ32/DasOS | ba8e5e6e977068e2c093f31c9055a971dcf3ed97 | 349afd89488d5e4aecc652c9f5935ea6ea0277d6 | refs/heads/master | 2020-12-21T17:52:48.400295 | 2016-08-10T22:21:01 | 2016-08-10T22:21:01 | 58,045,947 | 1 | 1 | null | 2016-06-05T14:03:05 | 2016-05-04T11:09:20 | C++ | UTF-8 | C++ | false | false | 1,068 | hpp | asm.hpp | #pragma once
#include <stddef.h>
#include <stdint.h>
#define ASM_READ_REG(reg, var) asm volatile("mov %%" #reg ", %0" : "=r" (var));
#define ASM_WRITE_REG(reg, var) asm volatile("mov %0, %%" #reg : : "r" (var));
namespace ASM
{
static inline void sti()
{
__asm__ volatile ("sti");
}
static inline void cli()
... |
ed525180f1543542556faf3c08d6743e0a25972d | a93bb0f268cf5e2de2dd745c86a160ca60fada86 | /源代码/Thirdparty/UGC/inc/Scene/UG3DLayers.h | 8d9c53ad47985360ac8cf3900c2a27b4d9520fa9 | [
"Apache-2.0"
] | permissive | 15831944/Fdo_SuperMap | ea22b74ecfc5f983f2decefe4c2cf29007b85bf6 | 3d4309d0f45fa63abcde188825a997077dd444f4 | refs/heads/master | 2021-05-29T09:57:19.433966 | 2015-05-22T09:03:56 | 2015-05-22T09:03:56 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 838 | h | UG3DLayers.h | // UG3DLayers.h: interface for the UG3DLayers class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_UG3DLAYERS_H__86588036_022C_4645_8565_81526067529E__INCLUDED_)
#define AFX_UG3DLAYERS_H__86588036_022C_4645_8565_81526067529E__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#end... |
3e1c0d8ac51a2054441ecf7f882c543cc94074d8 | fb3fc3ed733c2417de4e7c96c94649ec68483bb6 | /DataStructures/HeighOfBinaryTree/Source.cpp | 8260af167bc795831edfba4f365a9979e2763c44 | [] | no_license | tedkx/HackerRankChallenges | c0bdb7612ae3dbab68413e442c08dd15a44f5532 | b3a21ea87eb96201a08fd354901b0d84499d7b3d | refs/heads/master | 2020-12-23T02:39:09.127683 | 2016-08-03T11:27:10 | 2016-08-03T11:27:10 | 15,845,810 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,055 | cpp | Source.cpp | /*
* Height of a Binary Tree
* https://www.hackerrank.com/challenges/tree-height-of-a-binary-tree
*/
#include <iostream>
using namespace std;
struct node
{
int data;
node* left;
node* right;
};
int checkHeight(node * node, int currentHeight) {
int maxHeight = currentHeight;
int tempHeight = 0;
if (node->left ... |
0f98d76e93fcb72c9be88fc72707dc703f176716 | 98b94eae33267a88fc0b743126f750af37c95e39 | /Chapter-5-Loops-and-Files/Review Questions and Exercises/Find the Errors/67.cpp | eeaeaead11dde6a66f7f8723962c6a5c2ce65d12 | [
"MIT"
] | permissive | ahuertaalberca/C-Plus-Plus | 003c75b7e70cc7eb326236706eaef2b04718497c | bbff921460ac4267af48558f040c7d82ccf42d5e | refs/heads/master | 2023-06-02T17:29:25.141650 | 2021-06-13T23:31:18 | 2021-06-13T23:31:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,254 | cpp | 67.cpp | /********************************************************************
*
* 00. Find as many errors as you can.
* // This program uses a loop to raise a number to a power.
*
* Jesus Hilario Hernandez
* March 12th 2018
*
********************************************************************/
#include <iostream>
... |
854787fdba89a5f1ed5a4c7df03ca99bf21ab7f2 | 1bc768c36fcc27e3d8d38a488d21bd4d04d6ca94 | /1. VERY EASY/Luke, I Am Your/Solution.h | 1a8f0b33d62b8b4252540344577eb5312c47fec6 | [] | no_license | ernikus/Edabit-Challenges-Cpp | 5232a370f281419a89f5205479c4b8c30bb91242 | 2a40fa3b7f87fbbc2c07b0d8ba485d0e0905269a | refs/heads/main | 2023-08-28T13:11:53.687141 | 2021-10-16T12:45:22 | 2021-10-16T12:45:22 | 374,112,331 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 546 | h | Solution.h | //Title: Luke, I Am Your ...
//Difficulty: Very Easy
//Source: https://edabit.com/challenge/fZBR6hjwAZhspyTx3
//Soln Author: ernikus
#pragma once
#include <iostream>
#include <vector>
#include <cstdlib>
std::string relationToLuke(const std::string name)
{
std::string text = "Luke, I am your ";
if (... |
cee34736d2c18af3fd400bd16cbf750125aff6c2 | 4e7760bff454ea97b3ae4f6091f145cd377bf888 | /source/WebKit2-7601.1.46.140/UIProcess/Plugins/PlugInAutoStartProvider.cpp | 34842d87df3230cbf49fd89f4de1bd9696370992 | [
"Unlicense"
] | permissive | extratone/i | 774f878ae5550e7ffeebd2d2408a17075ccaf5f7 | bf415b3d9ed120d9128379b2da2c5d83c5e9da0f | refs/heads/main | 2023-08-17T10:26:27.509227 | 2023-08-15T00:27:11 | 2023-08-15T00:27:11 | 333,582,739 | 20 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,091 | cpp | PlugInAutoStartProvider.cpp | /*
* Copyright (C) 2012-2014 Apple 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditi... |
0f448310b504e5cd4c9a9308866109eba400bdba | 49eec294aa7a9fbaad9e87fbdb6f992c529f985e | /Tree/Buildable.cpp | 49e18c55c9b171daa2326359f74bb75596ed8b09 | [] | no_license | chumingzhang/DataStructure | 1928aa3f605f9e01eaa7d9d4adcf2f0d5a5eb5fd | c35d9c2b6a9c30325f24074de94c762ec273bd46 | refs/heads/master | 2020-12-10T07:01:24.094677 | 2020-01-13T07:02:42 | 2020-01-13T07:02:42 | 233,530,359 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,863 | cpp | Buildable.cpp | #include "Buildable.hpp"
template<class Entry>
Result_code Buildable_tree<Entry>::build_tree(const list<Entry> &supply) {
Result_code ordered_data = success;
int count = 0;
Entry x, last_x;
list<Binary_node<Entry>*>last_node;
Binary_node<Entry> *none = NULL;
last_node.insert(0, none);
while(supply.ret... |
e26f7f981d4d607f22328a95f59074fca2a3bf2b | 4352b5c9e6719d762e6a80e7a7799630d819bca3 | /tutorials/eulerVortex.twitch/eulerVortex.cyclic.twitch.test.test/processor1/3.46/rho | 5a3d8f4c6386469bb0a1bd05ca3a3fc55c9e0b80 | [] | no_license | dashqua/epicProject | d6214b57c545110d08ad053e68bc095f1d4dc725 | 54afca50a61c20c541ef43e3d96408ef72f0bcbc | refs/heads/master | 2022-02-28T17:20:20.291864 | 2019-10-28T13:33:16 | 2019-10-28T13:33:16 | 184,294,390 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 45,328 | rho | /*--------------------------------*- C++ -*----------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Version: 6
\\/ M anipulation |
\*-------... | |
843415068d04b228118f10c5da4b9f1c945cc2e7 | 6b22c22b2de14d5c5069cc8530a746dea9f1b9b7 | /Scott_Sidoli Level 8 HW Submission/Section 5.1/Exercise511/Exercise511/main.cpp | 1e96ef7b201339ca0cc1fecf8271060b3e409cb6 | [
"MIT"
] | permissive | scottsidoli/CPP-Applications-for-Financial-Engineering-Pre-MFE | 68be095c15d85868c66e18b6b79588edf8afcce1 | 79c2fb297a85c914d5f0b8671bb17636801e3ce7 | refs/heads/master | 2020-06-08T19:49:38.332228 | 2019-06-23T17:27:42 | 2019-06-23T17:27:42 | 193,296,240 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,851 | cpp | main.cpp | // Exercise 5.1.1 - Smart Pointers
//
// by Scott Sidoli
//
// Main.cpp
//
// In this exercise, we store different types of shapes in the array template class
// that we created earlier. We store pointers to shapes in the array, Shapes1. The
// boost::shared_ptr<T> class stores a pointer an will delete the obje... |
cd5e6ce8f5129fc24043908526e7967b00bd642d | 806b2a94df2b5699449f8b77a298cab45ee14978 | /cs8Components/cs8ProgramComponent/common/versionInfo.h | c1b19bc71c628d882f7e322cb7e7343ac676d7cb | [] | no_license | vdg1/cs8-components | 4dd502282fce5f4f60a3d4ba45a65dbb485e1686 | b4f7ee125c6d282e3b766e50ec2b2c6bed0b9591 | refs/heads/master | 2023-06-22T18:36:35.147557 | 2022-07-30T14:15:44 | 2022-07-30T14:15:44 | 41,633,666 | 1 | 0 | null | 2021-07-18T16:30:04 | 2015-08-30T15:36:56 | C++ | UTF-8 | C++ | false | false | 390 | h | versionInfo.h | #ifndef VERSIONINFO_H
#define VERSIONINFO_H
#include <QObject>
#include <QString>
class VersionInfo : public QObject
{
Q_OBJECT
public:
static QString GetFileDescription(const QString& filePath);
static QString GetVersionString(const QString& filePath);
};
bool getProductName(const QString & fileName, ... |
ab14c157ce5ff70e2355cebdf0fec9e28faa5248 | 45ddcd4f3c051af5701a636e7a495fa44cbb0a73 | /Estudo Dirigido/src/Fontes/banco.cpp | 5c5ad4077a39de3983697d74e00ae9446fd8e0d0 | [
"MIT"
] | permissive | BrunoDalI/Simulador-de-Banco-programacao-avancada- | ca1cb5b25903262b55c8ebad3f90e1fcfad21893 | dd33e0a8ceae72601bae7c4c9b6b490f04c5c45f | refs/heads/main | 2023-08-07T17:55:36.614996 | 2021-09-16T23:12:32 | 2021-09-16T23:12:32 | 365,855,698 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,152 | cpp | banco.cpp |
#include "../Bibliotecas/Banco.h"
#include "../Bibliotecas/ContaCorrente.h"
#include "../Bibliotecas/ContaPoupanca.h"
#include "../Bibliotecas/Conta.h"
// Inicia o programa
void Banco::inicio(){
_resposta = _op.menu(_resposta);
system("cls");
switch(_resposta){
case 0:{
cout << "---... |
b9ca71e26471c7cc4db77d9dc44073215b295de9 | ec519440da1f339ddc97c10e1fc9559fcbd2b185 | /Code/File Format/DB/CDBManager.cpp | a8baf00c4a776dd83849ad6adbd61a5f2ea15852 | [] | no_license | MexUK/Old-IMGF-Issues | b7d72b2bff768bb2a49801d591559e9d887b7522 | 30d62e3135954bd24bdb9cdc1505c0fba1b48b4c | refs/heads/master | 2021-06-08T14:05:06.448069 | 2016-12-06T17:29:24 | 2016-12-06T17:29:24 | 59,851,114 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,977 | cpp | CDBManager.cpp | #include "CDBManager.h"
#include "CDBFormat.h"
#include "CDBEntry.h"
#include "Format/RockstarGames/IMG/CIMGFormat.h"
#include "Format/RockstarGames/IMG/CIMGEntry.h"
#include "Type/String/CString2.h"
#include "Stream/CDataReader.h"
#include "Debug/CDebug.h"
using namespace std;
using namespace mcore;
CDBManager::CDBM... |
a916414ba6e9aed8e237f9e893ebbace8c560339 | c40719298c41131a24ba0a31c0c0edad1ee37059 | /src/ASTM/VirtualSpecification.cpp | ec203c355afdcf697606c59851f2978a7bd5c6f1 | [] | no_license | zitmen/bachelor-thesis--sw-metrics | 3cb543ee09d1bd4f3ccf77df84e9a074e7feb0d5 | 8fc88b4d4de6a87974a179727d5204a0f3058798 | refs/heads/master | 2021-01-25T05:22:10.131182 | 2013-07-04T18:04:40 | 2013-07-04T18:04:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 312 | cpp | VirtualSpecification.cpp | #include "NodeId.h"
#include "VirtualSpecification.h"
VirtualSpecification::VirtualSpecification()
{
//
}
VirtualSpecification::~VirtualSpecification()
{
//
}
void
VirtualSpecification::identify(std::vector<int> &id) const
{
id.push_back(NodeId::VIRTUAL_SPECIFICATION);
OtherSyntaxObject::identify(id);
}
|
b5a6b34a74f22b315e41f378af4800eb451b79a3 | ecd574142155d4eefa7366db0035aedef589f622 | /Source/FBoxModel.cpp | 0bc76d58dba27b900a2a51a2e9b0029dd6cc6315 | [] | no_license | framefactory/trackme | b1cb6c3c4cb06749cc0eb4944ee56f03f6b488db | 68187aee20612dca3d1e0dfc1b26d24b5f745e0c | refs/heads/master | 2021-01-03T05:55:20.216752 | 2020-02-12T07:24:31 | 2020-02-12T07:24:31 | 239,951,215 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,633 | cpp | FBoxModel.cpp | // ----------------------------------------------------------------------------------------------------
// Title FBoxModel.cpp
// Description Implementation of class FBoxModel
// ----------------------------------------------------------------------------------------------------
// $Author: ralphw $
// $Revision... |
36f0c2d8af9b52da8367982291647506c34ba2a9 | a243534aa5ab5490b94087fa5ad5513503db4a53 | /Platformer 1/obj_treadmill_left.cpp | 41acb77c2f363f3ab345a5c515387debb07da74e | [] | no_license | Lijmer/platformer_1 | 1ecdd0cb67c2432148c042bb25bdb2913cbeeddc | bde7287e253316b1080f571ef341fc135228dc1a | refs/heads/master | 2020-05-17T01:22:41.154110 | 2013-07-03T10:16:06 | 2013-07-03T10:16:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 804 | cpp | obj_treadmill_left.cpp | #include "obj_treadmill_left.h"
obj_Treadmill_Left::obj_Treadmill_Left(void)
{
/* EASTEREGG
* .-"-.
* .'=^=^='.
* /=^=^=^=^=\
* :^= HAPPY =^;
* |^ EASTER! ^|
* :^=^=^=^=^=^:
* \=^=^=^=^=/
* `.=^=^=.'
* `~~~`
*/
SetID(TREADMILL_LEFT);
boundUp = 0;
boundDown = 32;
boundLeft = ... |
19141149b43d4aa739bcedef68e56f3dbc50e3fd | a11a124d48a94acb42ee750d03108c37a8e0aabd | /Hospitalizado.h | 2e9869e02634f1fe892c6de7d61b97be1d7861d8 | [] | no_license | naominietov/project-tc1030 | be2df390361b165230344dd401ffd4c2187b41f0 | 3e3aaba764ac5ea7d7fe3cdf08d6175a4590cbe1 | refs/heads/master | 2022-11-01T14:45:32.753089 | 2020-06-05T15:12:38 | 2020-06-05T15:12:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 806 | h | Hospitalizado.h | #ifndef HOSPITALIZADO_H
#define HOSPITALIZADO_H
#include <iostream>
#include "Paciente.h"
using namespace std;
// Clase hospitalizado que hereda de clase paciente
class Hospitalizado: public Paciente {
private:
int diasEstancia;
string fechaIngreso;
public:
// Declaración del constructor 1
Hospit... |
64bbcd2f5c608ca415a7a0486c049165b0bf536d | 0610ca2cac669b37ad6c40233439868a3e752ee0 | /modules/control/chassis_component.h | 6ace74aa474c3ee989221f8179c6a5ae7346c898 | [
"MIT"
] | permissive | mr-d-self-driving/geek-car | 1300293de10dd256bb7ecf815b3c04a46c2ab16e | 719620c8a1676565e18bc4f4420027385720dc3e | refs/heads/master | 2022-11-30T07:22:43.636336 | 2020-08-18T10:33:55 | 2020-08-18T10:33:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,404 | h | chassis_component.h | /******************************************************************************
* MIT License
* Copyright (c) 2019 Geekstyle
* 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 res... |
9ef53c146b97c7b142d492a040bce08ac1e14d93 | 7683210b686df4754753ccb2245173cd03d780a4 | /1337 - The Crystal Maze/1337 - The Crystal Maze.cpp | 2b863b47c80fa5c3abf4aa6c7e2e69cd8d9cf883 | [] | no_license | prachisen/LightOJ | 758e5dd97291e56a762ab694ca5c77aec2d8096a | 7b60625f75ded5c40c303381f98e36205d37c1c7 | refs/heads/master | 2023-02-21T11:23:19.542088 | 2021-01-10T13:28:46 | 2021-01-10T13:28:46 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,380 | cpp | 1337 - The Crystal Maze.cpp | #include <bits/stdc++.h>
using namespace std;
const int sz = 1005;
const int lim = 1e9 + 1;
const int inf = 1 << 20;
int t, n, m, q, cs;
int vis[505][505];
int ans[505 * 505];
char s[505][505];
void dfs( int x, int y, int c ) {
if( x < 0 || y < 0 || x >= n || y >= m || vis[x][y] || s[x][y] == '#' ) return;
... |
1c722903a3956894a28ceaf31a36731df1f35cb7 | ff541b27056578207cb99a286c4fb9c7a0c59577 | /First term/Лабораторная работа № 2/Двоичные вектора/Vectors.cpp | 7162cf0363e6e27c664c6965f5ad7f639638b9f7 | [] | no_license | MaximSlyusarenko/Discrete-math-lab | dcd398de4841807bc09429f5ae9229f382437fda | 2e84ae2c0d501387e11a766081b6313558f72031 | refs/heads/master | 2021-01-17T13:11:52.779642 | 2016-06-18T15:15:59 | 2016-06-18T15:15:59 | 29,737,849 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 601 | cpp | Vectors.cpp | #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
string s;
int n;
vector <string> a;
void gen(string s)
{
if (s.size() == n)
a.push_back(s);
else
{
string s1 = s + "0";
gen(s1);
if (s[s.size() - 1] != '1')
{
strin... |
ab5dfe4865f5634234cd78b0071cd6e57040d768 | b9264aa2552272b19ca393ba818f9dcb8d91da10 | /hashmap/lib/seqan3/test/performance/range/gap_decorator_seq_write_benchmark.cpp | 2e8b1a6eb00d6a7ab16d7c89d677c2661787f4d8 | [
"BSD-3-Clause",
"LicenseRef-scancode-free-unknown",
"LicenseRef-scancode-public-domain",
"CC0-1.0",
"CC-BY-4.0",
"MIT"
] | permissive | eaasna/low-memory-prefilter | c29b3aeb76f70afc4f26da3d9f063b0bc2e251e0 | efa20dc8a95ce688d2a9d08773d120dff4cccbb6 | refs/heads/master | 2023-07-04T16:45:05.817237 | 2021-08-12T12:01:11 | 2021-08-12T12:01:11 | 383,427,746 | 0 | 0 | BSD-3-Clause | 2021-07-06T13:24:31 | 2021-07-06T10:22:54 | C++ | UTF-8 | C++ | false | false | 5,268 | cpp | gap_decorator_seq_write_benchmark.cpp | // -----------------------------------------------------------------------------------------------------
// Copyright (c) 2006-2020, Knut Reinert & Freie Universität Berlin
// Copyright (c) 2016-2020, Knut Reinert & MPI für molekulare Genetik
// This file may be used, modified and/or redistributed under the terms of th... |
c2db8ca0fc03a5a4e559fbd4821c773c281ef2b9 | 42adcf7fee2ea59ae403fcf05239923de4ad2936 | /chef_and_mean.cpp | faaa66ad817bef6cb500f34e995c9c116f8b72b1 | [] | no_license | Kushagrakmr/code_nuts | 0ab16b57103d7008a0699f5f28026fafca7d42d0 | a003ce286d615ec66932247846de78459bfdb768 | refs/heads/master | 2020-07-10T18:42:12.305832 | 2019-09-15T21:16:13 | 2019-09-15T21:16:13 | 204,338,136 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 633 | cpp | chef_and_mean.cpp | #include<iostream>
using namespace std;
int main() {
long long T,no_of_coins;
long long int arr[200000000],i;
long double sum_of_coins=0, avg;
cin>>T;
while(T--) {
cin>>no_of_coins;
double mean;
sum_of_coins = 0;
for(i=0; i<no_of_coins; i++) {
cin>>arr[i];
sum_of_coins += arr[i... |
450af13eb04770623c4f074d1f6aa4e014878807 | 209bd94caa54ad6aeb9f6f208199608da8eeeb58 | /src/utils.cpp | 4f987cbf1692d039d6ed365d237733df87334811 | [
"Apache-2.0"
] | permissive | PuceBaboon/ESP_Zork | d966915e3eeaa85565ba55011170d7418fcb1def | 6eb26cac03f112b9c7cd1c28013a4784d1308017 | refs/heads/master | 2021-01-19T10:26:47.419698 | 2018-02-18T00:33:54 | 2018-02-18T00:33:54 | 87,866,958 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 616 | cpp | utils.cpp | /*
* $Id: utils.cpp,v 1.1 2017/04/04 09:03:28 gaijin Exp $
*
*/
#include "utils.h"
/*
* Add a "yield()" into non-critical delay loops to
* give the ESP some time for housekeeping operations
* (just use the normal, unmodified delay() call when
* you have very specific timing requirements).
*/
void Ydelay(ulo... |
65d6bc734c316c5dca1b7f1fe2fa7f9934c3835b | a5f79579e599af8fbeadc7d4f8d8f20a2de06403 | /java/jni/JniTest.cpp | 6d8f341777e71d8ad7c0f2fe3019e88b3a44013c | [] | no_license | zll5267/save-daily-exercise | a0c3cfcb41f1bcee1d5041aab7ad4593a424259e | 795710c325700ea44b931c4da13b7205b5206f20 | refs/heads/master | 2021-06-28T13:16:15.866235 | 2020-11-29T15:45:06 | 2020-11-29T15:45:06 | 5,635,788 | 0 | 0 | null | 2020-11-29T15:45:07 | 2012-09-01T01:07:22 | Jupyter Notebook | UTF-8 | C++ | false | false | 1,021 | cpp | JniTest.cpp | #include "JniTest.h"
#include <iostream>
JNIEXPORT void JNICALL Java_JniTest_native_1helloworld
(JNIEnv *, jclass)
{
std::cout << "native Hello World" << std::endl;
}
JNIEXPORT jint JNI_OnLoad(JavaVM* vm, void* reserved)
{
JNIEnv* env = NULL;
if (vm->GetEnv(reinterpret_cast<void**>(&env), JNI_VERSION_1... |
c6a01fc149ba8368ffd266a368ad4dbdcd144b8f | 19164bf117ecb486c94311cb8b2936309b363514 | /Leetcode/Shortest_distance_to_a_character.cpp | a54336d0fd22782363900d14cf6b11330c7310b1 | [] | no_license | geekyanurag/Coding-Interview-Preparation | 10a3b5d9c2a9b71483846c0f51751cef24baa2e4 | 24f11e8ddc9c7c573aa961a9ebb3afd16234a27b | refs/heads/master | 2021-05-25T13:01:20.680206 | 2021-04-27T06:41:28 | 2021-04-27T06:41:28 | 253,764,719 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 643 | cpp | Shortest_distance_to_a_character.cpp | class Solution {
public:
vector<int> shortestToChar(string S, char C) {
vector<int>res(S.length());
int z = count(S.begin(), S.end(), C);
vector<int>ch(z);
int a = 0;
for(int i =0; i<S.length(); i++){
if(S[i] == C){
ch[a] = i;
a++;
... |
2146330cfde84d4d9134c5f908caea842c66a43a | 0cd8bbc974b822c46b64712d3be53e9808a5c246 | /10420.cpp | 009017449dc041ed567b0b49c9eb12fd89bc791e | [] | no_license | limon2009/ACM-UVA-Online-Judge-solution | b78e8f709c88e5db6fdac83a7bd5ec71f7ab00b0 | 0f86718d3c609e654a3c16a29e0f91620ac40cd1 | refs/heads/master | 2021-08-11T04:58:42.829356 | 2017-11-13T06:14:09 | 2017-11-13T06:14:09 | 110,505,263 | 1 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 612 | cpp | 10420.cpp | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
char name[2009][80];
int n;
int sort_function(const void *a,const void *s)
{
return ( strcmp( (char *)a, (char *)s ) );
}
int count() {
int i,c;
char inter[80];
qsort((void *)name,n,sizeof(name[0]),sort_function);
for(i = 0; i<n; ) {
c = 1;
s... |
44f2a484ceb95647d335740407fad47ba0494790 | 9b3c9c46a50986df99ec92edd312088f0738d6cf | /common/rtmp_broadcaster.cpp | 8d208334624add6a0a69f6b599db62d13382ff3b | [
"MIT"
] | permissive | nathanjahnke/norichan | 504b121ba01ded35a7c7e421dd75e4abf5c0098a | af3b434b7606e8e3e4a7a62520ac2eb9bd36d1b5 | refs/heads/master | 2020-12-25T14:13:44.509098 | 2016-08-20T21:25:19 | 2016-08-20T21:25:19 | 66,168,289 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 30,951 | cpp | rtmp_broadcaster.cpp | #include "rtmp_broadcaster.h"
RTMP_Broadcaster::RTMP_Broadcaster(QObject *parent) :
QObject(parent)
,mutex(NULL)
,sws_ctx(NULL)
,currently_streaming(false)
,broadcast_timer(this)
,input_avpicture(NULL)
,output_avframe(NULL)
,audio_frame(NULL)
,input_pixel_format(... |
510f2604e08448a02e5806de0affb6752d5e6f91 | 8bc5d618f57de78ab72db052f8316d14f147f4dd | /chat_linux/src/str_echo.cpp | 4c13aeb8dc002d6ecfd7f3b63f4e6eafeea5814e | [] | no_license | fuwaandhuluwa/network-programing | b7ba1a28b352ab29800d9a95a68cef2e3063b734 | 32f5016eb72bf63c18681d0d4fbad71d9aa3cec9 | refs/heads/master | 2021-09-05T22:05:57.058121 | 2018-01-31T07:52:03 | 2018-01-31T07:52:03 | 118,699,698 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 420 | cpp | str_echo.cpp | #include "../include/network.h"
#include "../include/Sock_rw.h"
#include <iostream>
void str_echo(int sockfd)
{
ssize_t n;
char buff[MAX];
again:
while( ( n = read(sockfd, buff, MAX)) > 0)
{
writen(sockfd, buff , n);
}
if( n < 0 && errno == EINTR)
goto again;
if( n < 0)
... |
baaa1ed60b4d05a43f1b6ba9abed3dbb9dc8bb76 | 08de604a6e08dd7804e0f18beb170466ef5c5535 | /trees/Connect Nodes at Same Level.cpp | 6eb17c0986db571063e258fe6d5d23c1169d4aa1 | [] | no_license | Ritesh25696/geeksforgeeks | d0aef5a8506bf0ca67fc6191e71a0844996345b8 | 95abe5f13cad2af9db5d71a212701435078541fd | refs/heads/master | 2021-01-22T13:51:36.832979 | 2017-11-14T19:01:21 | 2017-11-14T19:01:21 | 100,684,634 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,926 | cpp | Connect Nodes at Same Level.cpp | Write a function to connect all the adjacent nodes at the same level in a binary tree. Structure of the given Binary Tree node is like following.
struct Node{
int data;
Node* left;
Node* right;
Node* nextRight;
}
Initially, all the nextRight pointers point to garbage values. Your function should set ... |
07518253a5788e2e142654d58215f75f61e733aa | 66eaafba92160b7b66381c04ccb7f2552a1af866 | /intro/arraySort.cpp | 9985446554bd5579af66586ae7ddd7713c7cfba0 | [] | no_license | jk78346/CS_161_summer_2021 | 47b8d1ad17444842df3ba32a873951f71e8e27eb | 59d12fc3ae62189f7cc2d6ec8a362e08a64b2ae2 | refs/heads/main | 2023-06-06T22:22:16.840782 | 2021-07-16T18:27:29 | 2021-07-16T18:27:29 | 381,244,268 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 808 | cpp | arraySort.cpp | #include <algorithm>
#include <ctime>
#include <iostream>
#include <climits>
long long calculate_sum(int *data, unsigned int size);
int main(int argc, char **argv)
{
// generate data
const unsigned arraySize = 32768;
int data[arraySize];
int option = atoi(argv[1]);
long long sum = 0;
for (uns... |
4b853a50265d258099cddc231a59dd2eb23cf1e6 | ec69b0093887ee6723001e15cb250f9abf4b1f8a | /src/physics/ycolshape.cpp | 554761e1a836a0c8b0f900513094b1f845556219 | [
"MIT"
] | permissive | sivarajankumar/smoothernity | b1562ac3e9a36a9a4d9803622f1768a758c94ba5 | a4c7d290ca601bddf680ef040f3235dc7b029a6b | refs/heads/master | 2021-01-10T03:19:13.912364 | 2014-09-20T02:58:10 | 2014-09-20T02:58:10 | 49,218,282 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,192 | cpp | ycolshape.cpp | #include "yphysres.h"
#include "ycolshape.hpp"
#include "pmem.hpp"
struct ycolshapes_t {
int count;
ycolshape_t *pool;
};
static ycolshapes_t g_ycolshapes;
int ycolshape_init(int count) {
size_t size_max, align_max;
ycolshape_t *cs;
#define FIND_SIZES(t) \
if (sizeof(t) > size_max) size_... |
bcfeb3d6dd2fe2d4cd35a90555a4bf1c71a022f0 | 2ca3035754817668e094be49a646c6d5c94d67b2 | /Cooing/Core/Include/Xmpp_core/XmppRoomChatAdapter.h | 5e7e7b6cbe9ce7632d89fb7c03a135970dd8e7c3 | [] | no_license | Cooing/CooingWindows | 24f51251371ddc15a3c6a12fec294b3ac3b6b092 | d445651e913315b0b1405092a5a2d0ab558b26ae | refs/heads/master | 2020-05-27T02:34:42.347809 | 2014-11-27T04:58:59 | 2014-11-27T04:58:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 490 | h | XmppRoomChatAdapter.h | #ifndef _XMPP_ROOM_CHAT_ADAPTER
#define _XMPP_ROOM_CHAT_ADAPTER
#include "XmppGeneralChatAdapter.h"
namespace SecureChat
{
class XmppRoomChatAdapter : public XmppGeneralChatAdapter
{
public:
XmppRoomChatAdapter(){};
~XmppRoomChatAdapter(){};
virtual void handleMUCParticipantPresence(string jid, int status, ... |
26302cdd3184f71bd41dfcd3583a6c5a56d4b3c0 | 1f9fba78b57f7abda0261ae346822397f30d6369 | /plots/scripts_root/detectorPlots/scripts/macro.cpp | aeafe3898234419105ae9d51989ad4e85eac264e | [] | no_license | martinosal/root_selector | 6ebf36bed8934db8ae914ee35b0405ab2266afbd | a9340c05cb2616d6d5e6298ee433e97ae65052fd | refs/heads/master | 2023-03-31T02:16:38.565721 | 2021-03-12T17:07:34 | 2021-03-12T17:07:34 | 248,818,740 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 704 | cpp | macro.cpp | #include "plots.cpp"
#include "plots_2.cpp"
#define N_alg 3
void macro(TFile* fData=_file0){
std::vector<std::string> alg{"JF","IP3D","SV1"};
std::vector<std::string> det{"d0sig","z0sinthsig","logpTfrac","logDR","IBLhits","NextToIBLhits","sharedIBLhits","splitIBLhits","nPixhits","sharedPixhits","splitPixhits","nSCTh... |
9464d5d54488ddeedac86ebd33a546c9a0afedd3 | eb87da665fbd8443287d9be4093c2e16fff04969 | /a1141.cpp | 0c4a2949c3b220347689be9f206e6e0c871a26cb | [] | no_license | northmachine/pat_test | 84fe679163ba74c45d515b1745a43ee850530b2a | 79534c79f8da168c43f87b789a2f52c4227dfacc | refs/heads/master | 2020-08-01T05:09:35.401003 | 2019-09-25T15:17:02 | 2019-09-25T15:17:02 | 210,875,072 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,060 | cpp | a1141.cpp | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
map<string,int> sc;
int n,scn;
struct node{
string name;
int stn;
double score;
}sclist[maxn];
bool cmp(node a,node b){
if((int)a.score!=(int)b.score)return a.score>b.score;
else if(a.stn!=b.stn) return a.stn<b.stn;
else return a.name<b.name;... |
1833c53e47b0c3298371736e2a75cc5dcbddfd17 | d778525e7823854ee35d92164d1e2f8c8a689f07 | /array/3_SUM_~1.CPP | af2f5999a5299b4a7ba8330891e9aca5cef0feb8 | [] | no_license | manojmansukh/C | b695afeb55b56839cb2ea30a056dae4dcd4f5ce1 | bfce00c64df084557f4dad864928116d2c69ed69 | refs/heads/master | 2020-09-04T16:25:22.817196 | 2019-11-05T17:17:51 | 2019-11-05T17:17:51 | 219,801,176 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 515 | cpp | 3_SUM_~1.CPP | #include <stdio.h>
#include<conio.h>
#define size 1000
int addarray(int arr[], int start, int len);
int main()
{
int i ,sum,arr[size],n;
printf("enter the no of array element:");
scanf("%d",&n);
printf("enter the array element:");
for(i=0;i<n;i++)
scanf("%d\t",&arr[i]);
sum=addarray(arr,0... |
7256937efe47f18fbeb23361f4580c64fc7f860e | 85b6a39ff07ac0eac7701b6b0e45f5e424fbe9a1 | /cardfighter/InputManager.h | b600fbcffc1f7b5a6f1fd24d1fea463b3cc382c6 | [] | no_license | LyonsMatthew/cardfight | 3092cc8b0151dc5361474a2704eda25b57ba582f | 2c070a33d88d2c1d10d81906eb8cf9b5adc17a1f | refs/heads/master | 2020-04-13T16:12:44.915159 | 2018-12-27T15:52:52 | 2018-12-27T15:52:52 | 163,315,398 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 453 | h | InputManager.h | #pragma once
#include <vector>
#include "InputObserver.h"
class InputManager
{
public:
InputManager();
~InputManager();
void register_observer(InputObserver& observer);
void unregister_observer(InputObserver& observer);
virtual bool delegate(sf::Event& event) = 0;
virtual bool input_mouse_button_pressed(sf::E... |
d6fa985d1163bfd8545bacb74e983190585be768 | 6709677823021ab4b23b56dd725a6e96aaa72796 | /include/space.hpp | 8f0bf59132c17239bdd1941a84b79aa05294cf46 | [] | no_license | rekeshali/sod-shocktube-cfd | ca05bcf2391fe73f854b1bee68e57c2316505bab | 2f227433af684f42945eadf808f9e61089aa303a | refs/heads/master | 2020-04-28T02:20:35.414505 | 2019-04-02T18:55:34 | 2019-04-02T18:55:34 | 174,894,829 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,026 | hpp | space.hpp | #ifndef SPACE
#define SPACE
#include "matrix.hpp"
#include "shocktube.hpp"
class Space {
protected:
ShockTube * Sod;
const char * method;
static int dof;
Mat q, qp, qm;
Mat A, Ap, Am;
Mat T, L, Ti;
Mat f, fp, fm, fb;
// Vars for Roe average
Mat qroe;
double sql, sqr;
// Vars for HLL
Mat fl, fr;... |
259d95060c74e506eea4d82a1cb19dc992c8af14 | e26abc5004fbdcda3d36b7250f7c95f2010512c5 | /example2/test14d/constant/triSurface/femur_left_front.eMesh | 6ad6b28647c00341edc9bceb14e8317d1d60bbcf | [] | no_license | rtafds/openfoam-example | aa2e218895bfe224edb2f49d901027fd096789a6 | d118a36b18c9362c0405396306d9553a71b5b1ce | refs/heads/master | 2020-09-07T00:15:31.949125 | 2019-11-09T06:20:02 | 2019-11-09T06:20:02 | 220,599,371 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,654 | emesh | femur_left_front.eMesh | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.2.x |
... |
561048943a359502a7a24d7c24a954e19db6ec5e | 97207114d47e8b26c3388ce814c01448025b0565 | /PeGaSys/AI/Path.cpp | e1364b384590db1701933cb57afd5237f1b6a7bd | [] | no_license | akshay-k/Game-Engines | 2a4aaf3aa86a9ba1e36813d887acc052524eb6fe | 18212773b3eb961a6dcd073ac98d737604e58e99 | refs/heads/master | 2021-08-29T10:43:17.466892 | 2017-12-13T18:50:12 | 2017-12-13T18:50:12 | 103,973,008 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 699 | cpp | Path.cpp | #pragma once
#include "stdafx.h"
#include "Path.h"
std::list<Math3D::Vector4> Path::CreateRandomPath(int NumWaypoints, double MinX, double MinY, double MaxX, double MaxY)
{
m_WayPoints.clear();
double midX = (MaxX + MinX) / 2.0;
double midY = (MaxY + MinY) / 2.0;
double smaller = min(midX, midY);
double spacing =... |
598277abda34e1b5a218f4772a2349de4f32a64a | c0caed81b5b3e1498cbca4c1627513c456908e38 | /src/core/pack/task/operation/ResFilterFactory.hh | b51da26b72b098b34145a47498b000da01ef49ed | [] | no_license | malaifa/source | 5b34ac0a4e7777265b291fc824da8837ecc3ee84 | fc0af245885de0fb82e0a1144422796a6674aeae | refs/heads/master | 2021-01-19T22:10:22.942155 | 2017-04-19T14:13:07 | 2017-04-19T14:13:07 | 88,761,668 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 3,861 | hh | ResFilterFactory.hh | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... |
71f10589d657bfc989f9fe9272c081cc6bb91485 | f529bbd46e068ed57ea518468dc515b4e4e082d6 | /src/components/Waynet.cpp | 3305e88877c36cdc54955b2d58cfd5951ba77a67 | [
"MIT"
] | permissive | Szmyk/REGoth-bs | 4b76bc847f01550147d9334f983b53f538c8958d | f953739f96a6441457287417d23812853675fb6e | refs/heads/master | 2020-05-23T09:43:23.466888 | 2019-05-14T19:11:17 | 2019-05-14T19:11:17 | 186,711,827 | 4 | 0 | MIT | 2019-05-14T22:52:09 | 2019-05-14T22:52:08 | null | UTF-8 | C++ | false | false | 1,219 | cpp | Waynet.cpp | #include "Waynet.hpp"
#include <Debug/BsDebugDraw.h>
#include <RTTI/RTTI_Waynet.hpp>
#include <Scene/BsSceneObject.h>
#include <components/AnchoredTextLabels.h>
#include <components/Waypoint.hpp>
namespace REGoth
{
Waynet::Waynet(const bs::HSceneObject& parent)
: bs::Component(parent)
{
}
HWaypoint Wayn... |
7f1cb4d0cf6a790728059b9d6a0b3574bc5e1d0c | 50fc2a6f64b5b2b352e9948ffe6772c05712287e | /Examples/main.cpp | acc8fef0089a024af96fa71432f634f9fb331b4d | [
"MIT"
] | permissive | juantresde/Vortex2D | 92cb8a81752409eba5a14c91981fd02c7273af66 | ec37b98ad258ac5b68ee1caf9de3d50831f063a8 | refs/heads/master | 2021-01-12T01:10:19.433176 | 2017-01-03T21:00:50 | 2017-01-03T21:00:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,358 | cpp | main.cpp | #include "Common.h"
#include "RenderWindow.h"
#include "SmokeExample.h"
#include "ObstacleSmokeExample.h"
#include "WaterExample.h"
#include "VelocitySmokeExample.h"
#include "ScaleWaterExample.h"
#include "LineIntegralConvolution.h"
#include <iostream>
#include <memory>
#include <GLFW/glfw3.h>
std::unique_ptr<BaseEx... |
1f1610b9f87471280f66e1edadd5f15df6b9bb1f | f57c624e42ff546df2ad89acef9d3ea5a73bb43c | /csci2270/assignments/01_cpp_refresher/unit_tests.cc | 25848b04b59c56b8a83189e47afb610b9a215eff | [] | no_license | AThilenius/external | a2c026552d8624fb373252fb24c4e5c8f3490cee | 96176b8aed6dbb67d9431eafb2884540200d033e | refs/heads/master | 2021-06-07T21:47:44.397494 | 2017-09-11T01:20:20 | 2017-09-24T03:37:35 | 42,087,629 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,065 | cc | unit_tests.cc | // Copyright 2015 Alec Thilenius
// All rights reserved.
#include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <memory>
#include <sstream>
#include <string>
#include <typeinfo>
#include <unordered_set>
#include "cpp_refresher.h"
#include "test_runner.h"
namespace {
bool other_ub... |
20224ba0dd8fef9c100a6b47205429ce4d1fd270 | 6bb55109d41437bd4325dc61277ab11d33248dda | /chap3/ratios.cc | d190acabc3b70bd635368d161a858f59bf792683 | [] | no_license | yzliang/usaco | aaddc9fbcb026d1042d197557a9bd659a488d9fe | 6b981cabba792af87e46ffe7165072f81c3be1dc | refs/heads/master | 2021-01-17T13:28:06.314758 | 2018-06-03T21:02:38 | 2018-06-03T21:02:38 | 11,219,468 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,792 | cc | ratios.cc | /*
ID: liangyi1
PROG: ratios
LANG: C++
*/
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int a[4], b[4], c[4];
ifstream fin("ratios.in");
for (int i = 0; i < 4; ++i) {
fin >> a[i] >> b[... |
33a0f4f97c315481882c9693816808f71d46cec5 | 5fe9fb23e5df770cd15ead80cb48808288d6da75 | /x_con.cpp | 865eea0f8f5b5b0dffbd5905fb0d88ec7c12c556 | [] | no_license | DennisStanistan/stevens | bd3788f2ae74815036794a53e15e92edbacbe54b | caf92c4bf3cfce0f5461e3f22f60753593cec410 | refs/heads/master | 2022-04-06T21:27:03.051608 | 2020-02-26T09:55:46 | 2020-02-26T09:55:46 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,110 | cpp | x_con.cpp | #include "xentax.h"
#include "x_con.h"
void test_map_deque(void)
{
// Test #1
// Basic Usage
typedef map_deque<uint32, std::string> map_type;
map_deque<uint32, std::string> m1;
m1.insert(map_type::value_type(15, "15 - 1"));
m1.insert(map_type::value_type(15, "15 - 2"));
m1.insert(map_type::value_type... |
505fb16844a7c1e7f98ce6b7b7667eaee33ed963 | 59e533ca95cae49fb0e75e20e7d18c66cb1b14d6 | /Exceptions/BadHttpResponseException.h | 5e11c6e412c2c4d58561e947f21232af4ea50509 | [] | no_license | AstarProxy/server-qt | 323e9920d186d9a753e69ccdb01ec6b9d4a68be7 | 69d1c6e271e45ec095450a6ff15383d66b54f9e2 | refs/heads/master | 2020-03-17T23:43:09.485227 | 2018-05-19T11:52:32 | 2018-05-19T11:52:32 | 134,057,215 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 251 | h | BadHttpResponseException.h | #ifndef BADHTTPRESPONSEEXCEPTION_H
#define BADHTTPRESPONSEEXCEPTION_H
#include "./Exception.h"
class BadHttpResponseException : public Exception
{
public:
BadHttpResponseException(const QString &message);
};
#endif // BADHTTPRESPONSEEXCEPTION_H
|
4484bc8f18ad015e31637658d17cdcb3ac3b443b | 7aa1743c918b482a27dc843173b6bab05b511e21 | /C++_5/3_qualifier.cpp | 7372168850b2a29491e169699114e3f784ec04a0 | [] | no_license | RealChaser/Cpp_Lecture | 7021be1b1f02c9f62f83db5a14885b8d8f34ebbb | b947bb6defdad4bb1c598c2c39a4d7f05cfc50de | refs/heads/master | 2021-06-24T18:20:14.247040 | 2020-02-22T14:11:24 | 2020-02-22T14:11:24 | 91,180,286 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 734 | cpp | 3_qualifier.cpp | // 3_qualifier
#include <iostream>
using namespace std;
class Test
{
public:
/*
// C++98 의 예외 표시
//void goo() throw(int) // int 예외가 나올수 있다.
//void goo() throw() // 예외가 없다.
void goo() // 어떤 종류의 예외라도 나올수 있다.
{
}
// C++11 : 예외의 종류가 중요하지 않고, 예외가 있다/없다는 사실이 중요하다
// 그래서 noexcept 키워드가 생김
// ... |
14293ef95093fc6eae3b6894c4243e674a484ba5 | 774ed33284b868da6d2837c64e63eefa116fc130 | /CCLogic.cpp | d7267b50f48eb60e262817dc5bb7a711ce51f098 | [] | no_license | SimulationEverywhere-Models/CDPP-ALFA1 | 6a34f87dcc4fd1f4b5ca629c99c8d1f839a5cdc2 | c82388e8a44632fd2fd913ea229ec5e51e0fabbe | refs/heads/master | 2022-12-29T15:06:33.545485 | 2020-09-30T19:24:18 | 2020-09-30T19:24:18 | 300,035,339 | 0 | 0 | null | null | null | null | WINDOWS-1250 | C++ | false | false | 4,845 | cpp | CCLogic.cpp | /*******************************************************************
*
* DESCRIPTION: Atomic Model CCLogic
*
* AUTHOR: Deborah Grinberg & Marcos Nu¤ez Cort‚s
*
* EMAIL: mailto://dgrinber@dc.uba.ar
* mailto://jnuniez@dc.uba.ar
*
* DATE: 27/9/1998
*
*
*
*
* MODIFICADO POR: Pablo L. Cremona
* ... |
f7bd4e5295b492ce19c341d6686f3fb76ac50662 | 935bce4bdacd68c4c7bf32917775b18138fa3886 | /bresenham.h | a36a4682bd38bf71a3a0af601e6c0f63c0be0931 | [] | no_license | Jitesh-Khuttan/Computer-Graphics | c42e87dd221c08ae8ea932f72354eec4ed2e6417 | ccc60bf4afc01d5e6001c3fbd906b5e15f5810db | refs/heads/master | 2021-08-11T04:58:04.096060 | 2017-11-13T06:11:23 | 2017-11-13T06:11:23 | 103,011,024 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 572 | h | bresenham.h | #ifndef BRESENHAM
#define BRESENHAM
#include<bits/stdc++.h>
#include<GL/glut.h>
#include "object.h"
using namespace std;
class Bresenham : public Object
{
public:
Bresenham(GLubyte* color,int thickness,string pattern);
void BslopeGT1(int steps, int x, int y, int dx, int dy,int startX,int endX,int startY,int e... |
0c8164fa55ab9c9a52e3dc6093c2c38387064463 | 7993f562d912c37c8d419622793d732c567df8d2 | /user_search_book.h | 7861260761ca480d4e8d6c1ad0370787ac8d247c | [] | no_license | tazbid/OnlineBookStore | e71fc2dd148d52fc69f7470d2a5e66af09666f4b | 56f0a3d701be2f25099c8e37a005e1de71548cca | refs/heads/master | 2022-09-16T16:50:37.386849 | 2020-06-01T07:12:38 | 2020-06-01T07:12:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 440 | h | user_search_book.h | #ifndef USER_SEARCH_BOOK_H
#define USER_SEARCH_BOOK_H
#include <QDialog>
#include<QtSql>
#include<QFileInfo>
namespace Ui {
class user_search_book;
}
class user_search_book : public QDialog
{
Q_OBJECT
public:
explicit user_search_book(QWidget *parent = nullptr);
~user_search_book();
private slots:
... |
efccb0b187dc14f014438b83003aa63c39603bad | 6c2a2cb3884310a84b675327db107208d7067f83 | /Orz3D/PointLight.h | 275c33f8937779cf1788033dd2184cedf94f5d2c | [
"MIT"
] | permissive | bzhou830/Orz3D | 6a9456bd593b3ea66b86ba730f2f355f5f852891 | 95d419446811e837c56bbed48d215b181edd4bfa | refs/heads/main | 2023-08-27T21:17:15.585821 | 2021-11-11T03:18:19 | 2021-11-11T03:18:19 | 397,168,013 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 474 | h | PointLight.h | #pragma once
#include "Graphics.h"
#include "./Bindable/ConstantBuffers.h"
#include "./Drawable/SolidSphere.h"
class PointLight
{
public:
PointLight(Graphics& gfx, float radius = 0.5f);
void SpawnControlWindow();
void Reset();
void Draw(Graphics& gfx);
void Bind(Graphics& gfx);
private:
struct PointLightCBuf
{
... |
3f5ef02f655aa3cc8b4874b51ce981cd689b7247 | 9c5178db121dc5a27c1f81907a4794ede0a187c0 | /contest5/6.6.cpp | d9e367fa388ec476fa871704db1dc7ffc5c1d33a | [] | no_license | huynguyen1212/contest | 63dbfc70078d8c1cf37cd9d46d2a8590d38d4a35 | 7d3fff7f65b10c83cc6f1151d4c7873f0001027d | refs/heads/master | 2023-01-06T14:18:51.220264 | 2020-11-01T19:06:50 | 2020-11-01T19:06:50 | 272,675,836 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 917 | cpp | 6.6.cpp | #include <bits/stdc++.h>
using namespace std;
// thuat toan
int dp[1005][1005];
void Solve() {
string s;
cin >> s;
int n = s.size();
memset(dp, 0, sizeof(dp));
int ans = 1;
for (int i = 0; i < n; i++) {
dp[i][i] = 1; // cho duong cheo chinh cua dp bang 1
}
// neu s co hai phan tu
for... |
1206ed7e3c1ad611921362a7461a9221d241401f | ac344c0e1f4af8491f59ab3de42dcde37bc09867 | /Astero/AsteroMath.h | 5267b86b9507eaf2f0dc8a9dd4401eb5eba1d0b6 | [] | no_license | izewang/Astero | 1f5f994201a47d917659955a3818ccb03f42c403 | 9e8e13b5c5d3b69076e5f511bd9ac0f9d627e83e | refs/heads/master | 2021-07-21T07:00:16.285519 | 2017-10-30T05:08:30 | 2017-10-30T05:08:30 | 107,758,680 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 260 | h | AsteroMath.h | //
// AsteroMath.h
// Astero
//
// Created by Yuzhe Wang on 8/10/17.
// Copyright © 2017 Yuzhe Wang. All rights reserved.
//
#ifndef AsteroMath_h
#define AsteroMath_h
#include <cmath>
namespace Astero {
} // namespace Astero
#endif // AsteroMath_h
|
390a819d559567e601ca55c298369807e1e7cf5d | 7bb0597bbf095bafec5d44d72957b109a2be92cf | /CS2028Sec4Lab5Grp11/tasks1To3/GameShelf.h | 998a0af1ae5c9e2d88e4d69a644a9d603d806913 | [] | no_license | nathandraper/DSLabs | d0fa887522f69ecea740924a48ea8ab4255c23f5 | e045a96dda196c146fd61d30db6e04d2e406e648 | refs/heads/master | 2020-07-25T01:20:07.309301 | 2019-10-21T01:40:12 | 2019-10-21T01:40:12 | 208,110,035 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 552 | h | GameShelf.h | #pragma once
#include "BoardGame.h"
#include "FullShelf.h"
#include "EmptyShelf.h"
#define shelfsize 10
class GameShelf
{
private:
int size;
BoardGame* shelf[shelfsize];
public:
int getSize() {
return size;
}
void addGame(BoardGame* g) {
if (size >= shelfsize) {
throw FullShelf();
}
shelf[size] = g;
... |
5599ed2fe6e8b71230b3e8e93fd9cf3a66d07f91 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir7941/dir29315/dir29712/dir30926/dir32551/dir32552/file33079.cpp | 93709bd01991150ba1124e34d4c7fadf627b4a66 | [] | 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 | file33079.cpp | #ifndef file33079
#error "macro file33079 must be defined"
#endif
static const char* file33079String = "file33079"; |
b19d7187b71bc49924338f37c252cc33067a3296 | ca3a1b0eeb988a911a260f848ab26b501bce26dd | /Source_Code/general.h | 3c5df770c35f968befa2e2ae4fa4dd0a629e4979 | [] | no_license | wyjwl/Winter_Homework | 1474c0d5dde1e7a1e32a7aab9b6216fe54cd62af | b7f1065a04568c2f3e664497b46480e251e2950a | refs/heads/master | 2016-08-08T20:39:44.157300 | 2016-02-12T05:28:05 | 2016-02-12T05:28:05 | 51,195,706 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 593 | h | general.h | #ifndef GENERAL_H
#define GENERAL_H
#include <QString>
#include "city.h"
#include "player.h"
class Player;
class City;
class General
{
public:
General(QString n, int a=10);
void setAttack(int a);
int getSelfAttack();
int getTotalAttack();
QString getName();
void setHoldCity(City *city);
... |
d8fbe17360645fc03d775ba6a164eddf0439a701 | fd911fe124408f4f6e300b084b6f1d30f5da30ba | /libs/opengl/include/mrpt/opengl/CCylinder.h | f2b3454ce7335e9bde2ee0ebe5272d8ecc17900a | [
"BSD-3-Clause"
] | permissive | tg1716/SLAM | 5710024e34f83687c6524cfb947479951d67941e | b8583fb98a4241d87ae08ac78b0420c154f5e1a5 | refs/heads/master | 2021-01-02T09:11:41.110755 | 2017-07-30T16:04:31 | 2017-07-30T16:04:31 | 99,160,224 | 5 | 2 | null | 2017-08-02T21:13:21 | 2017-08-02T20:57:07 | null | UTF-8 | C++ | false | false | 5,838 | h | CCylinder.h | /* +------------------------------------------------------------------------+
| Mobile Robot Programming Toolkit (MRPT) |
| http://www.mrpt.org/ |
| |
| Cop... |
489a316f81861907f53bc6280db90ee067f99951 | 23d8c808af687ef3952c2d607243506d48b52c3e | /Meeting_13/Meeting_14/vectoranalysis.cpp | ab590fdf4426125a3ef75fbdb5411a9ceddef25c | [] | no_license | AlonzoRon/EEE-121 | 574203bd7dd4b72957960b92e06da6bf2004cc1a | 9f83b1760a315afd1bf87bb20c2a703a062c5094 | refs/heads/master | 2022-04-12T01:33:37.261137 | 2020-03-01T02:48:25 | 2020-03-01T02:48:25 | 166,696,811 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 359 | cpp | vectoranalysis.cpp | #include<iostream>
#include<vector>
#include<fstream>
using namespace std;
int main(){
vector<int> v;
ofstream csv_file("vector_mem.csv");
csv_file << "i,v.size(),v.capacity()" << endl;
for(int i = 1;i <= 100000; i++){
csv_file << i << "," << v.size() << "," << v.capacity() << endl;
... |
99d948927a753eb06e6d85f2d0c0880de193a3e8 | 199f13316e98f990874dbae179170f5cb6eb6dd3 | /cs235 - Data Structures/lesson11/hash.h | ce4c1e3caee41b4aa9d827d4d0ac233e199dba20 | [] | no_license | drrezeau/School-Projects | 7144abf442e7ca8c3259abacb15147bfe366f1f9 | 4a4ba8314b3de9342bed7139a6bc6ec3c6d009e7 | refs/heads/master | 2021-01-21T04:26:13.468680 | 2016-08-03T00:32:53 | 2016-08-03T00:32:53 | 45,993,344 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,222 | h | hash.h | /***********************************************************************
* Program:
* Lesson 11, Hash
* Brother Helfrich, CS 235
* Author:
* David Lambertson and Derek Calkins
* Summary:
* This is the class structure and functions for our hash abstract class.
* It then is used in creating another class ... |
affede9764ce16b3b015e57ef40394c4619cbf4b | 29fea13266b11bb33de502407065665077213466 | /mainwindow.cpp | ab9426323407b411f451e2a6da122e682340f540 | [] | no_license | Skau/OpenSky | e10ddc6c0ecdf2e582fd3b0f44b49408689c4676 | 5072c137748e2907f6546f9a9f720613f525cdfc | refs/heads/master | 2022-04-02T21:45:23.242372 | 2020-02-03T19:46:03 | 2020-02-03T19:46:03 | 162,043,847 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,124 | cpp | mainwindow.cpp | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <QDebug>
#include <QUrl>
#include <QDesktopServices>
#include <QtNetwork/qnetworkaccessmanager.h>
#include <QtNetwork/qnetworkrequest.h>
#include <QtNetwork/QNetworkReply>
#include <qjsondocument.h>
#include <qjsonobject.h>
#include <qjsonarray.h>
#include <... |
067de62587ccbced6b030ef65ac4c5e7b67032f0 | f465a1592674213da50606597073124fcf80c1cc | /src/c_socket.cpp | 3201a2ce72cb9be62117a33fb59d2b4b8ac933bc | [
"MIT"
] | permissive | tricktux/assistant | 854525d452d1ff8da2f8462adfac4b5b246701f0 | a7a12b5d32e6b4e237e0f6b3564ce523983290ea | refs/heads/master | 2022-12-30T06:35:55.717308 | 2020-10-22T04:04:31 | 2020-10-22T04:04:31 | 306,211,902 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,190 | cpp | c_socket.cpp | #include <errno.h>
#include <glog/logging.h>
#include <iostream>
#include <unordered_map>
#include <string.h>
#include <string>
#include "c_socket.hpp"
int c_socket_server::connect(int port) {
int rc, yes = 1, sock_fd;
if (descriptor > -1) {
DLOG(WARNING) << "Socket already initialized and connected";
re... |
0eef2b4cf0321a1216c953d3e258a0a88b502814 | 8d782214cc09f43db64c49d5d646509de3e86b64 | /Pc/nodes/CallNode.h | 564f624852df6bcc42b92929bdcbe6ee9e09ad5e | [] | no_license | Aardvajk/OPx | f8c39a9b3d2a3c7edae8d48d29480cee01aaf9f6 | 1f450602a5f0e69c1956e48e915c0a893a31aa29 | refs/heads/master | 2022-03-26T08:28:14.561146 | 2019-12-14T08:31:43 | 2019-12-14T08:31:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 397 | h | CallNode.h | #ifndef CALLNODE_H
#define CALLNODE_H
#include "nodes/Node.h"
class CallNode : public Node
{
public:
CallNode(Location location, NodePtr target) : Node(location), target(target) { }
virtual void accept(Visitor &v) override;
virtual std::string classname() const override;
virtual Node *clone() const ... |
b8258f413193caed35137e60f76f15739c474b3c | 3a39b41a8f76d7d51b48be3c956a357cc183ffae | /Codeforces/RegularRound/R585_D2/D.cpp | dbc3314fc718341161efea76c56405201900682f | [] | no_license | Acka1357/ProblemSolving | 411facce03d6bf7fd4597dfe99ef58eb7724ac65 | 17ef7606af8386fbd8ecefcc490a336998a90b86 | refs/heads/master | 2020-05-05T10:27:43.356584 | 2019-11-07T06:23:11 | 2019-11-07T06:23:11 | 179,933,949 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 731 | cpp | D.cpp | #include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <utility>
#include <functional>
#include <cstdlib>
#include <cmath>
#include <string>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
char s[200005];
int main()
{
int L; scanf("%d %s", &L, ... |
80919fe07a8a069133c6f43e93c9c2473a4f7aa7 | ddf55d47a8761c4216f9a010c837431c1e932944 | /Unidad3/otrosejercicios/PracticaLab5.cpp | fd557174c4a8b92bde973ab396ba6d4587fee7e8 | [] | no_license | santy10e/CProject | 7ba9cef2900890e79e201421b83b3ba81c70d899 | b25ff22de83306992c556f797fbb75594ef7eb6c | refs/heads/main | 2023-06-20T18:32:26.627019 | 2021-07-21T05:36:58 | 2021-07-21T05:36:58 | 388,004,756 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,834 | cpp | PracticaLab5.cpp |
//Autor: Santiago Tene
#include <iostream>
#include <cstdlib>
#include<ctime>
using namespace std;
using std::rand;
using std::srand;
int tirarDados(){//no me funciona con class
int dado1= 1+rand()%6;
int dado2= 1+rand()%6;
int suma=dado1+dado2;
cout<<"El jugador tiro "<<dado1<<" + "<<da... |
3c5efaf66256c1175fb123c7144221e25a311af4 | 8a4f1bc7eef8879ccfc5efb5963c088aad8761f7 | /engine/base2/xml/xml_parser_module.cc | 3f1a28e3db7d2be0863a4a174d4adb5399a9b669 | [
"Apache-2.0"
] | permissive | live0717/zengine | dad07be0e0f8b634b80c3d6681b8a11591d53f5c | 11619d5923f4a52dee8dc252f0fe64a4d882678c | refs/heads/master | 2020-12-11T07:45:10.834924 | 2014-01-06T14:46:25 | 2014-01-06T14:46:25 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,452 | cc | xml_parser_module.cc | // Copyright (C) 2012 by wubenqi
// Distributable under the terms of either the Apache License (Version 2.0) or
// the GNU Lesser General Public License, as specified in the COPYING file.
//
// By: wubenqi<wubenqi@gmail.com>
//
// 参考CEGUI的部分代码
//
#define USE_TINYXML_PARSER
//#define USE_EXPAT_PARSER
//#define USE_MA... |
f42c5ed771d90c0985c1cfc018d82b616e2dcd15 | da79e4e4e5ea2cf6d0e8b9dbfd3d22d13723a4ee | /middleware/bodyParser.h | bc2046319f7480b545d6f5368691de3da8403200 | [] | no_license | blkshdw/BooShelf-API | f9e044902d930302fe0ac4facebe1c2c0376cb72 | be0f8b554fe3267efbf11460bee1919e1241ada1 | refs/heads/master | 2021-01-12T13:26:17.566961 | 2016-05-11T21:12:50 | 2016-05-11T21:12:50 | 54,849,309 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 683 | h | bodyParser.h | //
// Created by tetofag on 11.04.16.
//
#include "../crow_all.h"
#include <rapidjson/stringbuffer.h>
#include <rapidjson/document.h>
#ifndef BOOSHELF_SERVER_MIDDLEWARE_BODYPARSER_H
#define BOOSHELF_SERVER_MIDDLEWARE_BODYPARSER_H
namespace BooShelf {
namespace Middleware {
struct bodyParser {
public... |
5dda4edd05d5b12c57adfe26d2e30e7fd948612b | 56b8b3eb6011e54c16b7211224b79f8daa33139a | /Algorithms/Tasks.0001.0500/0111.MinimumDepthOfBinaryTree/solution.cpp | 5f25a3b8699df486c21ff176d66f8ec1e5c6fc35 | [
"MIT"
] | permissive | stdstring/leetcode | 98aee82bc080705935d4ce01ff1d4c2f530a766c | 60000e9144b04a2341996419bee51ba53ad879e6 | refs/heads/master | 2023-08-16T16:19:09.269345 | 2023-08-16T05:31:46 | 2023-08-16T05:31:46 | 127,088,029 | 0 | 0 | MIT | 2023-02-25T08:46:17 | 2018-03-28T05:24:34 | C++ | UTF-8 | C++ | false | false | 964 | cpp | solution.cpp | #include <algorithm>
#include "TreeNode.h"
#include "TreeNodeUtils.h"
#include "gtest/gtest.h"
using CommonLib::TreeNode;
namespace
{
class Solution
{
public:
int minDepth(TreeNode* root) const
{
if (root == nullptr)
return 0;
if (root->left == nullptr && root->right != nullptr)... |
2a0860788d53ff9cea6e582a64fa12b216962a1d | 8cb7d2f82a5a6876a4ce16c79618170e453d89b3 | /UI/hackrf_controller.h | 3b1087071711d592ae97268c9760bc12e35a9a2d | [] | no_license | serebbb/GBN_SDR | 20c8357e1dfd86b9b6c6851f3632924f71925f7b | 76c8ec9bdc74c5421a357fe58e703184d64a7ce1 | refs/heads/master | 2023-03-17T18:23:51.284346 | 2021-03-05T18:53:05 | 2021-03-05T18:53:05 | 344,865,237 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 916 | h | hackrf_controller.h | #ifndef HACKRF_CONTROLLER_H
#define HACKRF_CONTROLLER_H
#include <QWidget>
namespace Ui {
class HackRF_Controller;
}
class HackRF_Controller : public QWidget
{
Q_OBJECT
public:
explicit HackRF_Controller(QWidget *parent = nullptr);
~HackRF_Controller();
void addItemToSampleRateList(double val);
... |
f8351176c952d5e1ca69d34c7011beb7262e0e70 | 0f0b2c5e9095ba273992ab0b74a82f986b4f941e | /opengl/libs/EGL/egl_layers.cpp | ea86c9a05bd67bc1ee7e356f7d367988c85b8f72 | [
"LicenseRef-scancode-unicode",
"Apache-2.0"
] | permissive | LineageOS/android_frameworks_native | 28274a8a6a3d2b16150702e0a34434bc45090b9a | c25b27db855a0a6d749bfd45d05322939d2ad39a | refs/heads/lineage-18.1 | 2023-08-04T11:18:47.942921 | 2023-05-05T12:54:26 | 2023-05-05T12:54:26 | 75,639,913 | 21 | 626 | NOASSERTION | 2021-06-11T19:11:21 | 2016-12-05T15:41:33 | C++ | UTF-8 | C++ | false | false | 17,839 | cpp | egl_layers.cpp | /*
** Copyright 2018, The Android Open Source Project
**
** 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... |
6b18204172d09fd548be328cb8220d1f52c9591b | 6714d57d3f5f1706dba8236e4e884245db05dc00 | /scheduler.h | 3e3e2036b967d348db5139d654598574de33faea | [] | no_license | WCTP/CSI-240-06-PA5 | dd05226c1faccf1986ea2e9c14a864d06101ff40 | 0da1f5eaa3207daa0ce90a0815d4a16f2caff2fb | refs/heads/master | 2021-01-19T03:31:29.967819 | 2017-04-13T15:01:47 | 2017-04-13T15:01:47 | 87,322,474 | 0 | 1 | null | 2017-04-13T15:01:48 | 2017-04-05T14:56:44 | C++ | UTF-8 | C++ | false | false | 1,154 | h | scheduler.h | #ifndef SCHEDULER_H
#define SCHEDULER_H
#include <iostream>
#include <iomanip>
#include <string>
#include "doctor.h"
#include "patient.h"
#include "doctorOperations.h"
#include "patientOperations.h"
#include "constants.h"
using namespace std;
void addAppointment(Patient **&patients, Doctor doctors[], i... |
3708bc21fa85a183c204c23362bf1406509c8326 | f2ea17efcc1be929ef692369551e25f55fe3a05b | /exp_value.cpp | e4e693b5077275d760dde760060c274a09c1af8a | [] | no_license | HugoAhoy/Algorithm | 36ecf22538044e6ad1029565073704722141f5bd | e5b08eeb525b438da36b282a1fbbb622fc919626 | refs/heads/master | 2020-04-20T01:42:00.239143 | 2019-03-13T01:11:53 | 2019-03-13T01:11:53 | 150,076,231 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,978 | cpp | exp_value.cpp | //using stack to calculate the
//value of arithmatic expression
#include"stack"
#include"algorithm"
#include"iostream"
#include"string"
#include"map"
#include"cmath"
using namespace std;
stack<char> ops;
stack<int> oprands;
map<char,int> prior;
inline void calculation(char op, int left , int right, stack<int> &oprand)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.