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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
12ef049e05095877590362e3fab8b1c05301c2c0 | 7276439b533f4874955c872f478627a243631728 | /EU4toV2/Source/EU4World/EU4Leader.h | 98fcd3a003f5165a9f8c4c5c1ada08891ff088dc | [
"MIT"
] | permissive | ParadoxGameConverters/paradoxGameConverters | 406ff200abad3d43e7f4ad57a88311b2074ccacc | a994edeb4618c2e60bc1b1e26327fe504f94aa06 | refs/heads/master | 2021-06-03T15:31:51.717844 | 2020-03-28T21:18:56 | 2020-03-28T21:18:56 | 36,950,594 | 71 | 38 | MIT | 2018-12-23T17:15:26 | 2015-06-05T19:10:11 | C++ | UTF-8 | C++ | false | false | 1,930 | h | EU4Leader.h | /*Copyright(c) 2018 The Paradox Game Converters Project
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, pub... |
63ff864aaa8773b1bb58b9d5dea4e44e64f3bafd | 7af7797004c2ca5df59d90e8653ac31a1c69e73b | /TicTacToe.cpp | ace21be6e1ddd9d008382d80cd0ac96b81b0bfe9 | [] | no_license | ruthsilcoff/TicTacToe | cc79bee5d536372df7999171799d3f9afa95a9fa | a5f7509a47a9e260850e3f5602a8b36bf393853e | refs/heads/master | 2022-05-26T01:12:15.235058 | 2020-05-02T20:55:27 | 2020-05-02T20:55:27 | 260,773,022 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,838 | cpp | TicTacToe.cpp | #include<iostream>
#include<string>
using namespace std;
void greetAndInstruct(); //Q1
void displayBoard(char board[]); //Q2
bool checkIfLegal(int cellNbre, char board[]); //Q3
bool checkWinner(char board[]); //Q3
void computerMove(char board[]); //Q4
char board[27];
string num[27] ={"1","2","3","10","11",... |
5197a2bc711e71a752353fa517da630aa51a6a2b | 57f30cfa36bdf2a679b8ba10df3bdb1d95e9e6a9 | /src/test.cpp | 535950469dd0c81a2da6b3235398e4a3bf5d625b | [] | no_license | squall1988/pythonStudy | 4d8b5928c4a4efe2f0cf43cd792a83699cae4389 | faebfcc9b0948ec813a117f48d41453a9be6f9cd | refs/heads/master | 2016-09-05T23:53:59.377244 | 2015-06-26T09:00:27 | 2015-06-26T09:00:27 | 38,099,906 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 608 | cpp | test.cpp | /*
* =====================================================================================
*
* Filename: test.cpp
*
* Description:
*
* Version: 1.0
* Created: 2015/06/26 16时45分05秒
* Revision: none
* Compiler: gcc
*
* Author: YOUR NAME (),
* Organization... |
cb718e9d117cf027981cef5ded18a03329f0c1c5 | 7afade08c4424a617f75f7bbc101d9caf9d3da31 | /asteroids/src/model.cpp | f7d64a8f07ad4560cb7b6aa1c6b30010ee80d8ab | [] | no_license | Small-Embedded-Systems/assignment-2-asteroids-W15016306 | 209709d0025705eef720d95aaaa201aa2ff02aec | cc1065f19a16e68f6b11445ddfd32ca2b6051488 | refs/heads/master | 2021-01-23T01:51:39.889798 | 2017-05-12T21:13:56 | 2017-05-12T21:13:56 | 85,941,142 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,131 | cpp | model.cpp |
//Joshua Higgins - W15016306
//Connor Moore - W15012760
/* Asteroids model */
#include <stdbool.h>
#include <stdint.h>
#include <stdlib.h>
#include <math.h>
#include "model.h"
#include "utils.h"
#include "asteroids.h"
#include "view.h"
//variable Decleration
static const int heapsize = 25;
static node_t heap[heap... |
cc85988368ba5142de3a63783d63d64a8c9341b8 | 49a497337f6892d9f2e3a32c07de88bd21734a54 | /labs/lab5/Editor/ConstDocumentItem.cpp | 3df40f2f598091d8fa4ab432c4825747fe9a352c | [] | no_license | AnyaGl/ood | f8b39bce34868d171e0e539338f13098e5c06e5e | ec0e7dff3300362dc091369c0319540ad17d9f3a | refs/heads/master | 2023-02-18T06:45:58.790351 | 2021-01-19T17:39:08 | 2021-01-19T17:39:08 | 293,276,494 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 543 | cpp | ConstDocumentItem.cpp | #include "ConstDocumentItem.h"
CConstDocumentItem::CConstDocumentItem(Item const& item)
: m_item(item)
{
}
std::shared_ptr<const IImage> CConstDocumentItem::GetImage() const
{
if (std::holds_alternative<std::shared_ptr<IImage>>(m_item))
{
return std::get<std::shared_ptr<IImage>>(m_item);
}
return nullptr;
}
s... |
2e6794fd5faf4f17008364e4ac17ddc9f2fee531 | 7283326c73c2de62935a6a4e986ffc935117974d | /Source/VSMan/VSManGameMode.h | 8c71cc7a856d04966c90b5a831f6823d3321e7be | [] | no_license | AmadoJunior/BatteryCollectorUnrealEngine | 635f94fb49b1834613a8fbc10d0bfc025f8f5902 | 785c3719ab8ab4e5768ca94dfd5a9bd5f7227e41 | refs/heads/master | 2023-03-28T10:49:25.133652 | 2021-03-24T06:15:53 | 2021-03-24T06:15:53 | 350,966,816 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 305 | h | VSManGameMode.h | // Copyright Epic Games, Inc. All Rights Reserved.
#pragma once
#include "CoreMinimal.h"
#include "GameFramework/GameModeBase.h"
#include "VSManGameMode.generated.h"
UCLASS(minimalapi)
class AVSManGameMode : public AGameModeBase
{
GENERATED_BODY()
public:
AVSManGameMode();
};
|
4832dd7f742a840c8a20d4d8facc8020d9843f46 | 7ea08b8f812f066518e7f2e8ca173ebb9062f3f0 | /font.hpp | 411d0b4fbf504c18c096a68627a888fd8a339989 | [
"MIT"
] | permissive | CobaltXII/boss | 7524d7d1e60077bc0480b397f8214219c2c36ae5 | e30a3364ab8b9318d59e69bb974cc5b840addfe3 | refs/heads/master | 2020-05-17T16:36:46.378671 | 2019-04-29T19:51:56 | 2019-04-29T19:51:56 | 183,823,496 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,334 | hpp | font.hpp | // Decompress a VGA text mode font.
unsigned char* decompress(unsigned char* font,
int glyph_x_res,
int glyph_y_res)
{
// Allocate memory for the uncompressed font.
unsigned char* out = (unsigned char*)malloc(
glyph_x_res *
glyph_y_res *
256
);
if (!out) {
barf("Could not allocate font memo... |
4ed622162337254797a7c65dc650688ad9754fa1 | ca21d49c807f7cd70200fdde200a55964861405f | /word_wrap_problem/main.cpp | 8d118ae49e43c21de2513277ad872113bf2a778b | [] | no_license | mohamed-elalem/Algorithms | cb7c015c8672a29d8024853a0c4218172ca7c002 | 8fef0901a9b8c3f6521d5d9788a43e0b70c52fbb | refs/heads/master | 2021-01-20T13:16:37.979543 | 2017-12-17T18:12:37 | 2017-12-17T18:12:37 | 82,684,100 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,556 | cpp | main.cpp | #include <iostream>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <cstdio>
using namespace std;
int dp[100000], p[100000];
string words[100000];
int window = 80;
int wordCount = 0;
int pow2(int n) {
return n * n;
}
void solve() {
dp[0] = 0;
for(int i = 1; i <= wordCount; i++) {
... |
c1efa2a59855f2e828205168a02293363885137d | ffc1e21c5fd16cc8424a2845a9cd1a741b12ccdb | /Project1_Starter_Code/MatcherAutomaton.cpp | bddc0ab672cf4caf1b77068c00c2fd90273087d8 | [] | no_license | fogoplayer/Creative1 | ea69da35433d350c40c93750a0690d1e6930622c | aa0d8c618a2947d83beb3c435675c056c3ab18fd | refs/heads/main | 2023-09-05T01:26:38.722179 | 2021-11-04T14:50:14 | 2021-11-04T14:50:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,768 | cpp | MatcherAutomaton.cpp | #include "MatcherAutomaton.h"
MatcherAutomaton::MatcherAutomaton(std::string toMatch, TokenType type) : Automaton(type) {
this->toMatch = toMatch;
this->type = type;
this->aType = "keyword";
}
//int MatcherAutomaton::Start(const std::string &input) {
//Don't need it because the base class has it implement... |
5302887e195cf66fec1ea2702fc2d1d362221af2 | 238d73e5f7ac2591b0c4d409d5522bf6eea1ec06 | /code/roomimage.cpp | 44edac78321c705b3d687442fa5949855073aa17 | [] | no_license | impulze/msc-robotik-projekt_ws_2014 | d9fab7e598a291e680b92bc411b3509ce5e976e0 | 3685cbd2d67a37c42c1dd3f1349468af1a2dfc23 | refs/heads/master | 2016-09-05T15:10:01.730760 | 2015-01-26T07:01:44 | 2015-01-26T07:01:44 | 27,522,471 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,428 | cpp | roomimage.cpp | #include "roomimage.h"
#include <cassert>
#include <map>
#include <set>
namespace
{
bool isBlack(unsigned char const *bytes)
{
return bytes[0] == 0 && bytes[1] == 0 && bytes[2] == 0;
}
bool isGray(unsigned char const *bytes)
{
return bytes[0] == 200 && bytes[1] == 200 && bytes[2] == 200;
}
bool isWhite(u... |
d012727c674833757211f326980f1456968049c5 | cea2b949a204f95c74b8769dfbb03054a13c28de | /src/bencode/bEncodeManager.cpp | b4b25294f131ea96cd9f82daf7c156d0e6f0ae0a | [
"MIT"
] | permissive | sebestindragos/uTorrent-Backup | f51be9f6e451909fa63fef1a2f27876fa0a4d3f7 | ffde87303d343f76d3981d7f538a086d1b851eb0 | refs/heads/master | 2020-08-03T00:08:05.354825 | 2016-11-12T16:21:27 | 2016-11-12T16:21:38 | 73,555,422 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,354 | cpp | bEncodeManager.cpp | #include "stdafx.h"
#include "bEncodeManager.h"
#include "common/util/StringUtil.h"
#define BENCODE_END_MARKER L'e'
#define BENCODE_LENGTH_SEPARATOR L':'
#define BENCODE_DICTIONARY_MARKER L'd'
#define BENCODE_LIST_MARKER L'l'
#define BENCODE_INTEGER_MARKER L'i'
bEncodeManager::bEncode... |
045b8882cc0e64f6c6d23e9fd3403d3f16f73f6b | bc6b4fddbfc101e5c31cfad9a788ce52e1fa7cb7 | /Laboratory Work 3: Iterator/main.cpp | 041888955e40c4d8bed5373d51ae34af8a7e6219 | [] | no_license | prometneus/Cpp-2020 | adb5b9fa64c1b3888dfb01b0473042dcb0a85723 | 01036cec831a83462547385372fc99c3864bdf56 | refs/heads/main | 2023-06-24T15:19:19.341699 | 2021-07-24T21:19:47 | 2021-07-24T21:19:47 | 387,269,150 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,956 | cpp | main.cpp | #include "Deque.h"
#include <ctime> // Чисто ради рандомчика добавил
int main() {
Deque<double> dq;
Deque<char> dva;
Iterator<Deque<char>> check = dva.begin();
cout << "Iterator empty() check with a spurious deque \"dva\" -- " << check.empty() << endl; // Через итераторы
dva.insertfirst('... |
00e26163d6e81513538da8975ad6a26a13216cfe | ac0041def3b7d513b68fa2db795b416372a5046d | /alchemy/src/infer/ss.h | 16f7cc4d24c720cbcbd310efd690650fef62acce | [] | no_license | yaorongge/pl-semantics | ffe4457611ee1960dbbbd1072904771ed96066db | 87112198b0eb5df25f7866ab0cbd1cd28ee2df39 | refs/heads/master | 2020-03-22T02:34:59.391763 | 2017-02-10T17:38:15 | 2017-02-10T17:38:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,110 | h | ss.h |
#ifndef SS_H_
#define SS_H_
#include "MAIN.h"
#include <stdlib.h>
#include <stdio.h>
#include "infer.h"
const int ssdebug = false;
extern char* aresultsFile;
struct SampleSearchParams
{
int maxSeconds;
int iBound;
int rbBound;
int numItr;
};
/**
* Calling SampleSearch
*/
class SampleSearchProxy: public Inf... |
7aa9c9c18ec7c580a373902d8237621c59eb473b | e55b544a1d0dd1709138adde894204d41a156b47 | /codechef/oct/fenWriter.cpp | e22adc95c1b8eb98db27711e04ef85ef1bf0e4f5 | [
"MIT"
] | permissive | AadityaJ/CP | 992255aef3237b62a21b7a8a4241a8b4450795fa | 61664c1925ef5bb072a3fe78fb3dac4fb68d77a1 | refs/heads/master | 2021-10-18T02:04:35.459182 | 2019-02-13T16:00:32 | 2019-02-13T16:00:32 | 49,662,989 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,209 | cpp | fenWriter.cpp | #include <iostream>
#include <string>
using namespace std;
long long int numones(string str){
long long int num=0;
for(long long int i=0;i<str.length();i++){
if(str[i]=='1') num++;
}
return num;
}
long long int trailones(string str){
long long int num=0;
for(long long int i=str.length()-... |
de00fde68a0a0f702a6e805eba21ed342ffd6012 | 720b266677c19fb4de8676b92bd9a52adc67633c | /final_DRONE.c.ino | 6b5a3e6616473a1dd8e1207c5db528d643826cbc | [] | no_license | sherryroot/Arudino | dde728f25940f60aa45f0a6fc5595c1bbe1dbe34 | a7165eba010f41ae778ffb7c4035a83cfcb0e180 | refs/heads/master | 2020-05-03T14:14:41.411090 | 2019-04-01T05:22:06 | 2019-04-01T05:22:06 | 178,672,045 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,391 | ino | final_DRONE.c.ino | #include <MPU6050.h>
#include "Wire.h"
#include "I2Cdev.h"
#include "MPU6050.h"
#include <Servo.h>
MPU6050 accelgyro;
#include <SoftwareSerial.h>
//libraries finish
//
float utrl1_dist;//distance in utrl
float utrl2_dist;
const int utrl1_Echo=3;
const int utrl1_Trig=2;
const int utrl2_Echo=7;
const int ... |
2d8f88d410a611f9e6e33cd37cbd8136d36d5c31 | bf573a7cd2b58187d76dd0851e4e96096cd70b55 | /2016/2.h | b878543be1aae5c8285303acd57794963686e048 | [] | no_license | nafur/adventofcode | a025b722470fb1e663ba6cb6846aa09f48f4f25a | 273292e15c25d6c45b04f5264e25aecc4053b9ab | refs/heads/master | 2021-10-09T12:06:08.029141 | 2018-12-27T17:28:25 | 2018-12-27T17:28:25 | 112,719,547 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,718 | h | 2.h | #pragma once
#include "../utils/parser.h"
#include <algorithm>
#include <string>
template<>
struct solve<2> {
static auto solution() {
return std::make_pair("74921"s, "A6B35"s);
}
const std::string input = "2016/2.input";
struct Keypad1 {
int current = 5;
void move(char c) {
switch (c) {
case 'U':... |
95e8beb99b758048b34113633cfe2adc17f234a0 | 2c45bf84d1cd00dcb50e0bc79447ad366a207074 | /Pincer Valley/source/event_receiver.h | d9fb4754e7fa854109dc29d6036254a7315e2c98 | [] | no_license | UserProgrammer/PincerValley | ebbb09c325be443ec7acea5c2b60d21b1e01e1d9 | 3bfcceceaa3c25eba75fb3596d63554ced1709d2 | refs/heads/master | 2021-01-12T17:23:16.009047 | 2016-10-21T11:03:01 | 2016-10-21T11:03:01 | 71,556,502 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,324 | h | event_receiver.h | #ifndef INCLUDE_EVENT_CLASS
#define INCLUDE_EVENT_CLASS
#include <iostream>
#include <irrlicht.h>
#include "dummy.h"
using namespace std;
using namespace irr;
enum Mouse_Button{M_LEFT=KEY_LBUTTON, M_RIGHT=KEY_RBUTTON};
struct SAppContext
{
irr::IrrlichtDevice *device;
};
class EventReceiver:public irr::IEventR... |
ad222ea332ae476c50213abeae64baa9f16b76ec | d41a11526e14bcfef8a85d1d2c19e6134e733756 | /cpp2/630-Knight-Shortest-Path-II.cpp | cecbbc753acbe198945f3a02b62e3267cb00221b | [] | no_license | ezhou2008/algorithm-basic | 7719abb9b984d8624f057de30d42b22ced45c3a3 | 6e47f9246013e1b1668f70f6e921a81c68b1f7d6 | refs/heads/master | 2021-01-22T18:34:23.359864 | 2017-03-15T16:53:40 | 2017-03-15T16:53:40 | 85,096,380 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,870 | cpp | 630-Knight-Shortest-Path-II.cpp | /*Knight Shortest Path II
Description
Given a knight in a chessboard n * m (a binary matrix with 0 as empty
and 1 as barrier). the knight initialze position is (0, 0) and he wants
to reach position (n - 1, m - 1), Knight can only be from left to right.
Find the shortest path to the destination position, return the len... |
15be72398ef74c60c57a08e118a64b2620f4a2a3 | 4889e30d514ba1d9071140511df30f7989a94e71 | /GuerraDeCartasV1/GuerraDeCartasV1/Nodo.h | 26c97fb66db9cb2e40e443a6374536d7689f8f7f | [] | no_license | DennisLy1995/GuerraCartas | ecec623ba43594af99b6c8de691a9301395cf3e7 | 32e37535ab7b931546e8414137455a62ee638b38 | refs/heads/master | 2020-05-07T00:53:36.290353 | 2019-04-29T23:54:01 | 2019-04-29T23:54:01 | 180,248,392 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 241 | h | Nodo.h | #pragma once
#ifndef NODO_H
#define NODO_H
#include "Carta.h"
class Nodo
{
private:
Carta carta;
Nodo * sig;
public:
Nodo();
Nodo(Carta);
void setCarta(Carta);
Carta getCarta(void);
void setSig(Nodo*);
Nodo * getSig(void);
};
#endif |
cfde80e957fc89a64d0431a4dbc8fd82b6cdd99c | 78b0701b311cd2ee4cb6364ee9c077d8d7543ab8 | /ogsNumerics/SolutionLib/Fem/FemIC.h | 0a372e929b52d48b2c9469fcdef858fb7c424ec4 | [
"BSD-2-Clause"
] | permissive | Yonghui56/ComponentialMultiphase | 9fc04527561ce101b1bd2118b9badf8e13014d3f | 47c019ac50e1a182eb7d3912776795f71ac2963a | refs/heads/master | 2021-01-17T07:04:51.515688 | 2016-05-20T15:16:55 | 2016-05-20T15:16:55 | 42,857,468 | 0 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 1,349 | h | FemIC.h | /**
* Copyright (c) 2012, OpenGeoSys Community (http://www.opengeosys.com)
* Distributed under a Modified BSD License.
* See accompanying file LICENSE.txt or
* http://www.opengeosys.com/LICENSE.txt
*
*
* \file FemIC.h
*
* Created on 2012-09-22 by Norihiro Watanabe
*/
#pra... |
16418256bbe15a797d62439a7c2ce4782d592f58 | 53ec60e7fbb72c011f00decd8227b080ecd80bd5 | /src/el3d_module/3rd_party/carve/lib/csg_collector.cpp | af5efb2b101e92c1f6aca632b3f287a72fa200a2 | [] | no_license | mi6gan/elasticas-cad | fc45f91941d2725c3c4627c2bf5d7dbee6a8f22a | be0f17edd131d70c72f6ff3a7c3f848af8a45934 | refs/heads/master | 2020-03-24T21:48:01.911634 | 2019-08-09T16:38:18 | 2019-08-09T16:38:18 | 143,051,035 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,273 | cpp | csg_collector.cpp | // Begin License:
// Copyright (C) 2006-2008 Tobias Sargeant (tobias.sargeant@gmail.com).
// All rights reserved.
//
// This file is part of the Carve CSG Library (http://carve-csg.com/)
//
// This file may be used under the terms of the GNU General Public
// License version 2.0 as published by the Free Software Founda... |
ff3a3f643adcf049219c94f4fd57c17fe0e75572 | 502f2ff4dddc707b2ced51e3cd4058b5ad8f1502 | /codeforces/101055A.cpp | fcb4bc4e0c5342c3e17441413bb61e17f3ff3e97 | [] | no_license | miguelAlessandro/CompetitiveProgramming | 609a68a646f0976ed1c00fbcf861777844c7040d | 64ac15eafb9c62dc713ce3d4b679ba6a032e1d5f | refs/heads/master | 2021-06-01T11:02:22.439109 | 2020-10-08T06:26:27 | 2020-10-08T06:26:27 | 51,873,676 | 1 | 1 | null | 2020-10-08T06:26:28 | 2016-02-16T22:01:20 | C++ | UTF-8 | C++ | false | false | 1,578 | cpp | 101055A.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 54;
long long X[N], Y[N], Z[N];
int n;
bool same(int l, int r){
return X[l] == X[r] and Y[l] == Y[r] and Z[l] == Z[r];
}
bool proof(int i, int j, int k, int l){
return ((Y[j]-Y[i])*(Z[k]-Z[i]) - (Y[k]-Y[i])*(Z[j]-Z[i]))*(X[l]-X[i]) +
((Z[j]-Z[i])*(X[... |
2dae3c5832cb9beb88be1983af623c4837bb2752 | c66b76f4f537c34e38b7645a9bd3eb6018aabfb8 | /e7_tools_HRRT/libconvert/dift.cpp | 0e94cf458c8c35cd3b505eead080f61fd09da3a9 | [] | no_license | andrewcrabb/hrrt_reconstruction | 4a42ffb1e0dbc9e55c4c261b6e0bc9f3528f22da | 1a3f0e2fe2607b3860acfe8804932be4882a3581 | refs/heads/master | 2020-07-19T08:42:16.473462 | 2019-09-04T21:50:56 | 2019-09-04T21:50:56 | 206,412,167 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 30,276 | cpp | dift.cpp | /*! \class DIFT dift.h "dift.h"
\brief This class implements the DIFT (direct inverse fourier transform)
reconstruction of 2d sinograms.
\author Frank Kehren (frank.kehren@cpspet.com)
\date 2003/11/17 initial version
\date 2004/02/02 fixed the distortion-correction function, if the image
... |
130fa8fe2b29b94628504d80fd404ca4c78c7188 | 7c5ef5faf9b88e4c43d4e7403a176b939e68571e | /SatBoolValuesToInt/index.cpp | 98afb5a57958917f9082223004f3b1066872ffbf | [] | no_license | Nauchnik/utils | 60421a9bfae92a0ed023c96dbd70b88783d65294 | 5f2818e4af543670e4cff29bf776e1e4c69623fd | refs/heads/master | 2022-07-21T09:15:27.217845 | 2022-07-07T18:09:38 | 2022-07-07T18:09:38 | 13,406,116 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 827 | cpp | index.cpp | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <boost/dynamic_bitset.hpp>
#include "../../pdsat/src_common/addit_func.h"
int main() {
std::ifstream ifile("in.txt");
std::vector<int> vars;
int val;
while ( ifile >> val )
vars.push_back( ... |
3803ab1aee318c4a18d7eaebead8dc9d68c4ac70 | 4024dcc1dd142ef83a6f485a6187b064dbadac8a | /Assignment/Divide And Conquer/pivotElement.cpp | a7e0ad3e3639e5d513b981b942724744f8853b6f | [] | no_license | Devforlife07/Algorithms | 37b75c710614f81b2d7e8c6908561e98c4286daf | b191ae712ccc7e4bcb56f6d38eea62f7b8a1217e | refs/heads/master | 2023-04-14T23:32:03.830844 | 2021-04-09T18:13:27 | 2021-04-09T18:13:27 | 268,325,882 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 659 | cpp | pivotElement.cpp | #include <iostream>
using namespace std;
int getResult(int *a, int n, int s, int e)
{
if (s > e)
return -1;
if (s == e)
return s;
int mid = (s + e) / 2;
if (mid < e and a[mid] > a[mid + 1])
return mid;
if (mid > s and a[mid - 1] > a[mid])
return mid - 1;
if (a[s] ... |
ad0e491a1e8778443ce75b2394ca4c8a3a3f14d9 | cfc52a796e8ad10c8d78274a1efe2d1ec47f38aa | /Quadroped.h | 1817bb754501f2880f49cc7b37d6367eab00c0f6 | [] | no_license | Auk0105/Satoko | 25e1d775d07397a4112aeb300a47636834bb76d2 | f7895202467f9e886086de4332bd8768889c06b6 | refs/heads/master | 2016-09-01T09:16:53.177040 | 2016-03-24T04:07:28 | 2016-03-24T04:07:28 | 54,613,913 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,319 | h | Quadroped.h | #ifndef _QUADROPED_H_
#define _QUADROPED_H_
#include "mbed.h"
#include "leg.h"
// http://marupeke296.com/TIPS_No13_ClassArrayInitialize.html
// 引数付きコンストラクタを持つメンバクラス配列の初期化
#include <new>
#include <math.h>
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
#define servo_tx p13
#define servo_rx ... |
a54a4a9860cb498500acc3afb2145edba44b3ed1 | 184cca2b088d0577ecae7ec9873f8ce50eb5c971 | /src/ZoneServer/GroupManager.h | 082586fae50d9b7a5042a524566ac232a827dadd | [] | no_license | ferrin/mmoserver | b4cee672f725b768ef095f2f2af3f7eaf08acdcc | 0d31607c60d879737752541a6c007fa9d316aa4e | refs/heads/master | 2021-01-17T09:35:29.647731 | 2010-04-20T03:43:33 | 2010-04-20T03:43:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,621 | h | GroupManager.h | /*
---------------------------------------------------------------------------------------
This source file is part of swgANH (Star Wars Galaxies - A New Hope - Server Emulator)
For more information, see http://www.swganh.org
Copyright (c) 2006 - 2010 The swgANH Team
-------------------------------------------------... |
3ff29a5129446689891cb6e8270672b2d0190d25 | ade4c266442afa5656695f8c148f8a52697523c6 | /srccode/6276/20401413_AC_46ms_3744kB.cpp | 8da9ccfbcead04bdc2796dcac2c0f25df351ed3a | [
"MIT"
] | permissive | VaalaCat/hdu-auto-ac | ccfd88a0fba9f1d0cba1052e1f66940169bf342d | bb40ea61fc294dba20472b8e37a1fdd1d197c3e6 | refs/heads/main | 2023-02-04T03:26:03.659199 | 2020-12-30T06:11:24 | 2020-12-30T06:11:24 | 325,469,509 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 885 | cpp | 20401413_AC_46ms_3744kB.cpp | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <vector>
#include <set>
#define ls id<<1
#define rs id<<1|1
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mod=1... |
db5fae0e0ace25fd6a1f0ba77eb490c751f7f74f | 0fcb83f50a6bdec74882f3648a4c17d5d82c1707 | /Trie.cpp | a9f24300815ef23d0db9f35d2c3f47649d0af8e5 | [] | no_license | vaibhav1865/HacktoberCodes | 3cd29bf2ae5c12f26dd1bdff8a4a8555e6d2922c | d9afbcaf67119534ff15fa56a9b209d6bb9be782 | refs/heads/main | 2023-08-15T16:38:46.721158 | 2021-10-03T11:06:42 | 2021-10-03T11:06:42 | 413,052,557 | 0 | 0 | null | 2021-10-03T11:03:22 | 2021-10-03T11:03:21 | null | UTF-8 | C++ | false | false | 1,347 | cpp | Trie.cpp | #include <bits/stdc++.h>
using namespace std;
typedef struct node
{
struct node* children[26];
bool isEndOfWord=false;
node()
{
for(int i=0; i<26; i++)
children[i] = NULL;
}
}node;
void insert(node* root, string newStr)
{
node* curr = root;
... |
98095908b398bc372df9c29947dea0eb025610fa | e9c0ffba62f5bd0c7bc1b3ca6173b40f3ab488f6 | /LeetCode/Insert-Interval.cpp | 08fe641c46d965425b815537bd838bc5d8329802 | [] | no_license | iiison/technical-interview-prep | 501f15877feef3b6b6e1bf3c1ba8b06b894a923b | 55b91267cdeeb45756fe47e1817cb5f80ed6d368 | refs/heads/master | 2022-11-24T11:21:22.526093 | 2020-08-04T13:49:32 | 2020-08-04T13:49:32 | 285,201,793 | 1 | 0 | null | 2020-08-05T06:33:34 | 2020-08-05T06:33:33 | null | UTF-8 | C++ | false | false | 1,177 | cpp | Insert-Interval.cpp | // Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).
// You may assume that the intervals were initially sorted according to their start times.
/* Example 1:
Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]
Example 2:
Input: intervals... |
23f3dafc45aa648b3f45c299e4ba69eb49eee6d0 | caa9c82b8127856aa035ca77a205bb0f7adfd14f | /EBYTE.h | 52b5c1bb2524dae192ff9571c03159a5a692d220 | [
"MIT"
] | permissive | MxFxM/EBYTE | 2d5029d8875087f3883bfcee6317b358eaff5957 | 5628efee248669aacbbeb3aba545e2dc6ace6810 | refs/heads/master | 2023-04-18T16:10:07.178394 | 2021-05-15T09:59:18 | 2021-05-15T09:59:18 | 286,521,357 | 0 | 0 | null | 2020-08-10T16:09:13 | 2020-08-10T16:09:12 | null | UTF-8 | C++ | false | false | 8,001 | h | EBYTE.h | /*
Original code by: Kris Kasprzak kris.kasprzak@yahoo.com
Modified by: Max-Felix Mueller mxfxmmueller@gmail.com
This library is intended to be used with EBYTE transcievers, small wireless units for MCU's such as
Teensy and Arduino. This library let's users program the operating parameters and both send ... |
9bdc7d43fea19d791f187632f271d6f6fe0be569 | 25a31b58ca87b807db450021fd1150166b7d5d29 | /直接插入排序.h | 788d7ffa74b24b68944b90d4522a828618119ba5 | [] | no_license | yefuyi/hello_world | f47e3fbd9eacc6f48447dc7ae8b778a34ee37e35 | cd67bd6c4b959088d3f4dab4eebd11f08b7c02ba | refs/heads/master | 2021-01-17T18:18:49.222466 | 2020-06-29T12:28:34 | 2020-06-29T12:28:34 | 61,782,725 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 581 | h | 直接插入排序.h | #ifndef HEADER
#define HEADR 1
//用直接插入排序对数组a中的元素进行升序排序
template<class T>
void insertionSort(T a[], int n)
{
int i,j;
T temp;
//将下标从1 ~ n - 1的元素逐个插入到已排序的序列中的适当位置
for(int i = 1; i < n; i++)//从a[i-1]开始向a[0]方向扫描各个元素，寻找合适的位置插入a[i]
{
int j = i;
T temp = a[i];
while( j > 0 && temp < a[j - 1])//逐个比较直到... |
4652d1e9116e260894fdad85a7f2701c66ee8fbc | 6d6f30e25560e05c62d39e6a1e81a12b67cc954a | /ssilki.cpp | f0cccec671f512aad0cdd804b449bc7478d524cb | [] | no_license | FrolovaOlga/Olga-labs | 7253b05b2e07e02503c9efc2b42896a741f1695e | 7c926754c8468856ad582a030e3f074c5f5806f1 | refs/heads/master | 2016-08-12T23:06:23.464644 | 2016-03-30T13:19:30 | 2016-03-30T13:19:30 | 55,064,722 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 449 | cpp | ssilki.cpp | #include <iostream>
using namespace std;
class MyClass{
public:
int a;
int b;
int c;
void show() {
cout<<"a= "<<a<<endl;
cout<<"b= "<<b<<endl;
cout<<"c= "<<c<<endl;
}
};
int main() {
sas a,b,c;
sas *p,*q,*x;
p=&a;
q=&b;
x=&c... |
2c80aa78360affeaaed853a131f804cfe7269f6d | 13da34a8bb7a182626a8bc0c769a734f5f925a9f | /cpp_solutions/hamming_distance.cpp | cbd60bf5ac87ab6c025b09b4a4527b49a1cd25d2 | [] | no_license | dhruv-jain/leetcode | e7bdc0b78fb2260c0f47162c3b82c17597d6c39b | a10b926b0db383a976b283f00a3ce2b21bba1d2c | refs/heads/master | 2022-02-13T13:18:12.923259 | 2022-02-03T20:42:40 | 2022-02-03T20:42:40 | 79,752,469 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 556 | cpp | hamming_distance.cpp | //The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
//Given two integers x and y, calculate the Hamming distance.
//Example:
//Input: x = 1, y = 4
//Output: 2
//Author - Dhruv Jain
class Solution {
public:
int hammingDistance(int x, int y) {
... |
e71798218cb93699ca8477139496625e6acb7928 | 8c8e31263c3f1ca6984754a4580ec7a6091ac843 | /example-code/arduino-bt/do_command/WString.cpp | 15f7afac566000377b2fbdfe1af3e72fff65d38a | [] | no_license | reenberg/wobot | 4a696ad9af37e0aac74ff67f3782ff2910d8f681 | ce7f112096ba1abd43b8d29da7e8944c2a004125 | refs/heads/master | 2020-05-17T14:48:26.506669 | 2010-10-26T15:06:28 | 2010-10-26T15:06:28 | 130,731 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,927 | cpp | WString.cpp | /*
WString.cpp - String library for Wiring & Arduino
version 0.4
Based on Tom Igoe's TextString original C++ implementation
Copyright (c) 2006-08 Hernando Barragan. All right reserved.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Publ... |
280603ee460137baa1c9638bfdcf40694667d7d6 | b120b6a7dc4b4fecda47b72b745a976c71adf6c3 | /OPT/bool_vector.h | 1668de86a91c4da95ff22f617540cd51a8d762ac | [] | no_license | ankifor/dualization-OPT | 89f442c125a0ac74f8ee8a6face4f535464197b3 | e7c44fd6422e1dbb6783d004e78596274776fed7 | refs/heads/master | 2020-12-30T10:12:47.981704 | 2015-02-26T22:05:33 | 2015-02-26T22:05:33 | 30,719,000 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,487 | h | bool_vector.h | #pragma once
#include "my_int.h"
class Bool_Vector {
public:
ui32 find_next(ui32 bit) const throw();
ui32 popcount() const throw();
bool any() const throw();
bool all() const throw();
ui32 at(ui32 bit) const throw();
void set(ui32 bit) throw();
void reset(ui32 bit) throw();
void setall() throw();
void rese... |
7aa96b1a296de6ed54945ca470d38a219028dd89 | 35becd680f26ba95b04104329406a13a3bd4bc0b | /Lab9_1/src/Lab9_1.cpp | 18d03cca5e48b44dc389fb431e037e7581a27982 | [] | no_license | Stjowa/CS1 | 9765fbf0dbd1488c4dbdfc2658d595de1c2616c3 | aaff3b4be8584f61d6293cc3806186f0fdccea89 | refs/heads/master | 2021-01-22T02:39:22.315857 | 2012-03-03T03:00:26 | 2012-03-03T03:00:26 | 2,432,735 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 563 | cpp | Lab9_1.cpp | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
typedef char* charPtr;
charPtr p;
p = new char[64];
int pSize;
string tempString;
bool test=true;
char temp;
cout << "Please enter your sentence: ";
getline(cin, tempString);
for (int count=0;count < tempString.size();... |
ce0810606d8754699ca6b84e12eeedd89830b802 | 46ea1f05a06d7c8ee7323d47d3d249e9853236db | /src/cgi/txproj_list.cpp | 86a292ec8f71657255879efd34dfdeacefbe6013 | [] | no_license | strangeroad/internship-2014 | 5a770e5977f2ac68093a2e4ecf921b0406585c4c | 06f69490f7fb405f1fbe25af839d9b085253273d | refs/heads/master | 2020-09-21T14:50:28.478152 | 2014-09-29T12:39:38 | 2014-09-29T12:39:38 | 224,822,353 | 1 | 0 | null | 2019-11-29T09:34:44 | 2019-11-29T09:34:44 | null | UTF-8 | C++ | false | false | 2,350 | cpp | txproj_list.cpp | /*
* =====================================================================================
*
*
* Filename: txproj_list.cpp
*
* Description: 返回json
*
* Version: 1.0
* Created: 2014年08月17日 10时53分30秒
* Revision: none
* Compiler: gcc
*
* Author: pythonwood (wws... |
436dea78c7369c8ac97c0659c1df0511cc550b5f | 20d024bd04ace59987ba05f864d6d9dece72fbab | /CQU Summer/7-17 A/C - 小孩报数问题.cpp | 37f274490659e05571ca5cd7a642a3dafacf4f48 | [] | no_license | Yeluorag/ACM-ICPC-Code-Library | 8837688c23bf487d4374a76cf0656cb7adc751b0 | 77751c79549ea8ab6f790d55fac3738d5b615488 | refs/heads/master | 2021-01-20T20:18:43.366920 | 2016-08-12T08:08:38 | 2016-08-12T08:08:38 | 64,487,659 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 778 | cpp | C - 小孩报数问题.cpp | #include <iostream>
#include <cstdio>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
int n, w, s, vis[105];
char str[105][105];
int main(){
// freopen("/Users/apple/input.txt","r",stdin);
// freopen("/Users/apple/out.txt","w",stdout);
cin >> n;
for(int i = ... |
ce6aa3f0706f4588d158d7a28961b779a4ff2c10 | c68f791005359cfec81af712aae0276c70b512b0 | /Regionals 2015 Asia - Jakarta/c.cpp | c98d68fe75f53a2a230675955d42e4a20eb44593 | [] | no_license | luqmanarifin/cp | 83b3435ba2fdd7e4a9db33ab47c409adb088eb90 | 08c2d6b6dd8c4eb80278ec34dc64fd4db5878f9f | refs/heads/master | 2022-10-16T14:30:09.683632 | 2022-10-08T20:35:42 | 2022-10-08T20:35:42 | 51,346,488 | 106 | 46 | null | 2017-04-16T11:06:18 | 2016-02-09T04:26:58 | C++ | UTF-8 | C++ | false | false | 1,718 | cpp | c.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> all, pos[N];
map<pair<int, int>, int> cache;
int a[N], b[N];
int id(int val) {
return lower_bound(all.begin(), all.end(), val) - all.begin();
}
bool ada(int v) {
return binary_search(all.begin(), all.end(), v);
}
int main() {
... |
bac9a809e1adb4411d5e2793a6735568016ee189 | 27227bb903ff04c93f532325f148e539990278a2 | /assignment-5/SkipList.cpp | 1d2aa8dbed9564555dc66aed371a15638004ca61 | [] | no_license | MrFlyingPizza/cmpt-225-projects | 1cfe2c37981f63bdbc2a5a7f4504a96f1dcfae41 | 498699ecefa4945dd9c91322e97bb0dbbf1c35ec | refs/heads/master | 2023-01-21T05:19:03.560911 | 2020-12-03T07:35:28 | 2020-12-03T07:35:28 | 309,770,856 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,651 | cpp | SkipList.cpp | #include <string>
#include <iostream>
#include "Entry.h"
#include "QuadNode.h"
#include "SkipList.h"
SkipList::SkipList()
: size_(0), max_level_(0)
{
lnode_ = new QuadNode(new Entry(Entry::MINUS));
lnode_->next_= new QuadNode(new Entry(Entry::PLUS));
rnode_ = lnode_->next_;
base_node_ = lnode_;
}
Sk... |
e5639281ff830a8f09e50c5ae6548481c007432c | 32bfc176a5db0d59129f3c39381c46b0a520eb86 | /demos/QMPlay/src/plugins/mp3/build/ui/ui_formMp3.h | 7e1d5e5fbe6605d40c7ee02f61c9361dccd7baf1 | [] | no_license | varzhou/Hifi-Pod | 2fb4c6bd3172720f8813fbbdf48375a10598a834 | eec4e27e37bc5d99b9fddb65be06ef5978da2eee | refs/heads/master | 2021-05-28T18:26:14.507496 | 2012-09-16T05:45:28 | 2012-09-16T05:45:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,773 | h | ui_formMp3.h | /********************************************************************************
** Form generated from reading UI file 'formMp3.ui'
**
** Created: Tue Aug 21 20:18:27 2012
** by: Qt User Interface Compiler version 4.6.2
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
*********... |
f70a7795f7c8da9932d72185bd33b1c3c563d57d | 2045ab194dccdf69ca312589cf968278248e9a27 | /ts-messages/messages/Part43ATCRBS.h | 03460916e5f25f31e021f8de60eaa95269829806 | [] | no_license | manish-drake/ts-wrap | 427d1e7cf2e1cfa3d63b4bde576eead9a06d0c04 | c165024102985aea9942f6ca2f217acdaf737ce5 | refs/heads/master | 2020-08-28T04:10:03.493253 | 2020-01-29T15:48:04 | 2020-01-29T15:48:04 | 217,583,116 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,217 | h | Part43ATCRBS.h | #ifndef __Part43ATCRBS_h
#define __Part43ATCRBS_h
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include "TServerMessage.h"
class CPart43ATCRBS:public TServerMessage
{
const int mFormatVersion = 0;
char* json_string;
public:
static const unsigned int mCmdID=0xc;
CPart43ATCRBS(void)
... |
6397bf723fd06360c9f0a607ab159937d01ed98a | e1b592074c550149f43c1dce0a4d4ece26bce92c | /Strings/orderly queue - GOOD.cpp | d3c4ebb254e1322b943a5dffec81b1888ccf49a0 | [] | no_license | taruvar-mittal/DSA-Solutions | 2155ccc170c372f92c60fa5acd3676ec4891baf9 | 2a23a688fc553d28d9beb7965c5b2b1db2f8f266 | refs/heads/master | 2023-08-17T07:14:46.680402 | 2021-09-25T15:57:04 | 2021-09-25T15:57:04 | 358,480,177 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,264 | cpp | orderly queue - GOOD.cpp | /*
Leetcode 899. Orderly Queue
ques:-
You are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string..
Return the lexicographically smallest string you could have after applying the mentioned step any number of moves.
Example 1:
Input: s = "cba", k = ... |
36552f5d9bda9d2a159991d29e9800fcb56c49f7 | a89efb0fd45e057b8c1ef6de49b2b7a8254164b1 | /FastCG/include/FastCG/Rendering/MaterialDefinition.h | 4fa479f1efd29f49e0c9c69327af10bf11e2508d | [] | no_license | pboechat/FastCG | cd5760b94cee7be760c5b267f64b20ba7b87a42e | 663272da3a45656ce5590e5d9c317b92200c9e47 | refs/heads/master | 2023-08-31T20:57:32.259089 | 2023-08-10T10:13:08 | 2023-08-10T10:13:08 | 9,269,509 | 6 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,064 | h | MaterialDefinition.h | #ifndef FASTCG_MATERIAL_DEFINITION_H
#define FASTCG_MATERIAL_DEFINITION_H
#include <FastCG/Graphics/GraphicsSystem.h>
#include <FastCG/Graphics/GraphicsContextState.h>
#include <FastCG/Graphics/ConstantBuffer.h>
#include <vector>
#include <unordered_map>
#include <cassert>
namespace FastCG
{
struct MaterialDefin... |
4a094f984d69567af9f2837a467b5a4b7d59d884 | dc466cedcd1d328e75d59ad4c044b8bcd1061b06 | /src/Client.cpp | 23679cd18ad8a7547233c0597056c84cc0efe075 | [] | no_license | whztt07/RampageRacing-Ogre | 3299118e3b3bf299e5f45c00d054c51304ff0838 | 3f77e8bd7d4d78e49f00ae5668690f0818ed7b76 | refs/heads/master | 2021-01-18T18:14:24.022966 | 2015-04-11T21:25:36 | 2015-04-11T21:25:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,082 | cpp | Client.cpp | #include "Client.h"
Client::Client()
{
Ogre::String basename, path;
Ogre::StringUtil::splitFilename("network.settings", basename, path);
Ogre::DataStreamPtr pStream = Ogre::ResourceGroupManager::getSingleton().openResource(basename, "General");
while (!pStream->eof())
{
Ogre::String data = pStream->getLine... |
c35d368a2ba212d1d808fbcea920bc25717b4d99 | 87257c3ce00d00b9cf4105f9ab507b13ae2237ff | /src/Options.cpp | fda8e6e37be40d0c19d64ddf0275d0f7c40f4624 | [] | no_license | redavids/wASTRAL | 5588a038b0fb5da0356c3511bcd746fc93a657d7 | 294775d3c0adb7fe819281d6bb520bb62e6dde9b | refs/heads/master | 2022-08-22T09:24:05.942611 | 2016-02-08T19:17:45 | 2016-02-08T19:17:45 | 51,416,931 | 0 | 1 | null | 2022-08-09T21:22:37 | 2016-02-10T02:41:48 | C++ | UTF-8 | C++ | false | false | 2,828 | cpp | Options.cpp | #include "Options.hpp"
#include "Logger.hpp"
#include <cassert>
#include <iostream>
#include <iterator>
#include <sstream>
bool Options::inited = false;
vector<string> Options::argv;
map<string, string> Options::opts_map;
string Options::input;
enum option_type {SHORT, LONG, ARG, END, EMPTY};
option_type get_option... |
02ad0b429554eb40f822a4edc139800e69f0f102 | f45847f670577df3b47dd3f3f18f31d2dafcab97 | /Classes/Sprite/Enemy/Enemy02.cpp | 2f5b1e72617568abb4faa63bf1b7a775ffb0d18b | [] | no_license | noguchi999/shooting2 | 0aec3924158ef4375f4cc47c4bd1f3a82173f6be | 35275a5b5496928b5bf564a0e60d24cf55a3d081 | refs/heads/master | 2016-09-06T03:22:28.928167 | 2014-02-23T06:13:41 | 2014-02-23T06:13:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,512 | cpp | Enemy02.cpp | #include "Enemy02.h"
USING_NS_CC;
Enemy02::Enemy02()
{
score = 50;
}
Enemy02::~Enemy02()
{
}
const char* Enemy02::getImageFileName()
{
return "enemy02.png";
}
void Enemy02::update(float delta)
{
Enemy::update(delta);
if (getStatus() == Status::Captured)
{
auto t... |
f6c410c72c51dd4edb21648f87e9b09a091e2188 | 93f81597e6d8bfb69084d4a2f56a0420305103ea | /topcoder/SRM/0723/b.cc | 594859c283230dcb6b3c2a3b83baf16cefa26fb4 | [] | no_license | himkt/problems.2019 | 94405abc8301ab60d6240219219cf741ce10827e | e2c9cda0199df37cc9cbac55ca10fe4092fa82d2 | refs/heads/master | 2022-11-26T03:49:46.262568 | 2020-08-03T14:29:57 | 2020-08-03T14:29:57 | 30,968,278 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 585 | cc | b.cc | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
# define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
class TopXorerEasy {
public:
int maximalRating(int, int, int);
};
int TopXorerEasy::maximalRating(int A, int B, int C) {
int k = max(A, max(B, C));
int d = 0;
while(true) {
if... |
0354a35d6f7f8cf79abbc19a48b134e3154f139f | 30ef8f12fdd857ee56030ca22b240554e7c02406 | /authwidget.h | 89517ea83f9b315bb00aa6dc6814b6c8f4dd03c3 | [] | no_license | ypaaxx/Debtor | 854be2748dd5206e2198a0189f8892f33d22acd9 | f5b5b389f1fca521d5af8b0927a60781661ed1a0 | refs/heads/master | 2020-03-12T04:58:50.392060 | 2018-06-12T08:26:45 | 2018-06-12T08:26:45 | 130,455,136 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 223 | h | authwidget.h | #ifndef AUTHWIDGET_H
#define AUTHWIDGET_H
#include <QWidget>
class AuthWidget : public QWidget
{
Q_OBJECT
public:
explicit AuthWidget(QWidget *parent = nullptr);
signals:
public slots:
};
#endif // AUTHWIDGET_H |
d4963fa92e0712df03eb0de94b0356e5b7c98dc0 | 050c5121ae9240d3912f1529dd569f8c15e702f4 | /include/file_systems/inode_system.h | 65b66ce0425f18fd4e2a6c85e6c207a1ef694542 | [] | no_license | renantarouco/file_system | 685deb09870b2f1d17f42df50ef53da928e3e5c9 | 8b573a4723ed789e9f66d81a35604e2459613e2d | refs/heads/master | 2020-04-09T08:14:04.717489 | 2018-12-13T05:10:40 | 2018-12-13T05:10:40 | 160,186,759 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 593 | h | inode_system.h | #include <file_systems/file_system.h>
#include <chrono>
class INodeSystem : public FileSystem {
private:
std::vector<int> _get_block_stream(int);
std::vector<int> _get_block_stream(std::vector<std::string> path, char file_type);
public:
INodeSystem();
INodeSystem(int, int);
bool mkdir(std::vector<s... |
0316c00b13620a7db57f26b570be6dc3bf0ca035 | fedfa36451c39e7dbbbd34029634ab1c78ff4c25 | /sequence2/Client/RegDialog.h | 8d17cf8e24fadd1de0c6e6c9fff3756fec5a024d | [] | no_license | DiceMaster/dudge | 9532304a0a6ff0e77fd71101ef39c82b6d4f9969 | a65f5cde671b63e22b07fe53026b8cfd047c5a8d | refs/heads/master | 2021-05-16T03:19:51.511110 | 2016-11-20T18:25:10 | 2016-11-20T18:25:10 | 32,222,886 | 5 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 414 | h | RegDialog.h | #pragma once
#include <windows.h>
#include <string>
class RegDialog
{
public:
RegDialog(HWND hParent);
~RegDialog();
bool ShowModal();
std::string GetLogin();
std::string GetPassword();
private:
static int WINAPI RegProc(HWND hWnd, UINT msg, WPARAM wParam, LPARAM lParam);
private:
bool ... |
bac541b1f5fc26e8a31552432e6e46ad03a01749 | 06bed8ad5fd60e5bba6297e9870a264bfa91a71d | /libPr3/Signal/virtualsignalmast.h | 4a7171d5567634c7a649f6c11e848eeec1d077a9 | [] | no_license | allenck/DecoderPro_app | 43aeb9561fe3fe9753684f7d6d76146097d78e88 | 226c7f245aeb6951528d970f773776d50ae2c1dc | refs/heads/master | 2023-05-12T07:36:18.153909 | 2023-05-10T21:17:40 | 2023-05-10T21:17:40 | 61,044,197 | 4 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 760 | h | virtualsignalmast.h | #ifndef VIRTUALSIGNALMAST_H
#define VIRTUALSIGNALMAST_H
#include "abstractsignalmast.h"
class LIBPR3SHARED_EXPORT VirtualSignalMast : public AbstractSignalMast
{
Q_OBJECT
public:
//explicit VirtualSignalMast(QObject *parent = 0);
/*public*/ VirtualSignalMast(QString systemName, QString userName = "", QObje... |
50ac168d4d95e40866d3fc63de2f1ab58a49481e | 0dbfd5628e193b4a6ae1b61de9b8578c35678a2a | /MonsterChase/FloatHelperTest.cpp | 800f46714f4144b6c37c579a457f8224f7058f7d | [] | no_license | JerryZhangJingyi/MonsterChase | 82eac09b47d5f16095d4a556739e50680cfe76e8 | d67bffaa99c5b0aedeafa10a19b89118cefcef8a | refs/heads/main | 2023-07-07T03:51:03.728452 | 2021-08-02T19:14:47 | 2021-08-02T19:14:47 | 392,064,139 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,024 | cpp | FloatHelperTest.cpp | #include "FloatHelperTest.h"
#include <xlocinfo>
#include <windows.h>
void _FloatHelperTest::test()
{
const size_t lenBuffer = 65;
char Buffer[lenBuffer];
sprintf_s(Buffer, lenBuffer, "float test 1 %s\n", _FloatHelper::IsNaN(3.0f) ? "true" : "false"); //false
OutputDebugStringA(Buffer);
sprintf_s(Buffer, lenB... |
c29dd1f2bb12ce6d98262788c1f137951fe4c39d | e0c3ab98fd1c1afb4f1ffe1ea649c9a0df084c63 | /ZephyrSharp.Input/JoyStick.h | 9218a8ad465efd173f9f36f5ee406db132c25f58 | [] | no_license | s059ff/ZephyrEngine | 6b9e28fb3cb0f8d90e0cba73b758c33ce77a0137 | b484258119ecff0f51a785fa02e9c4d4594ddf2a | refs/heads/master | 2020-03-22T14:20:23.452845 | 2018-07-08T23:44:42 | 2018-07-08T23:44:42 | 110,549,395 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 3,659 | h | JoyStick.h | #pragma once
#include "common.h"
#include "ButtonState.h"
namespace ZephyrSharp
{
namespace Input
{
/// <summary>
/// ジョイスティックコントローラを表します。
/// </summary>
public ref class JoyStick
: public INativeWrapper<zephyr::input::JoyStick>
{
public:
... |
0cc30dfd92b3c6f55f41732d1bad82f3ad89f38f | 12d705b7bfa7f49e058049dc2ffae93b8f7c6b4a | /Engine/OpenSceneGraph-3.4.1/src/osgPlugins/rbm/DataInputStream.h | bc2b98fe5bb7e09cb4060f451707d04f070bdef7 | [] | no_license | lzjee147/osg | 1a23a48aae8fec8e2f92351ecc83b005a4c446ab | 53004ed58f4a7d8e12d286e920cdab4b48bab042 | refs/heads/master | 2020-09-21T23:26:05.475842 | 2019-11-25T13:42:49 | 2019-11-25T13:42:49 | 224,970,980 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,564 | h | DataInputStream.h | #ifndef IVE_DATAINPUTSTREAM
#define IVE_DATAINPUTSTREAM 1
#include <iostream> // for ifstream
#include <string>
#include <map>
#include <vector>
#include <osgGe/Vec2>
#include <osgGe/Vec3>
#include <osgGe/Vec4>
#include <osgGe/Vec2d>
#include <osgGe/Vec3d>
#include <osgGe/Vec4d>
#include <osg/Quat>
#include... |
937410e42c56d517eeb8e5611815c8cfc088b3dd | 3f157e39c9d90fc0dfbfcb4e0e36641fd99a9a75 | /ccc/44_files.cpp | a496515098fc2d67738e160522f2a35f37405963 | [
"BSD-3-Clause"
] | permissive | admantium-sg/learning-cpp | 87ce5528ce059fca45a8037b5de8f4f5deb4b4f4 | cc827a8d7eabceac32069bb7f5a64b3c0fe488f4 | refs/heads/main | 2023-04-22T00:27:23.851983 | 2021-03-21T08:39:40 | 2021-03-21T08:39:40 | 349,941,441 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,004 | cpp | 44_files.cpp | /*
* ---------------------------------------
* Copyright (c) Sebastian Günther 2021 |
* |
* devcon@admantium.com |
* |
* SPDX-License-Identifier: BSD-3-Clause |
* ---------------------------------------
*/
#include ... |
e6533b9fef5398fc2df60e88479a58feb8766242 | 18919b4e9708ae890c2efc6f7c987f2a88218406 | /dune/stuff/test/grid_walker.cc | dde3285f730f99e4d64dc71dde9b01053baadb54 | [
"BSD-2-Clause"
] | permissive | BarbaraV/dune-stuff | 7aab5165475708b42ef159d3dde838b790705656 | f6297fed873f5e640354508eb927c875b60724a9 | refs/heads/master | 2021-01-15T09:24:15.852069 | 2018-02-21T15:06:59 | 2018-02-21T15:06:59 | 35,220,334 | 0 | 0 | null | 2015-05-07T13:02:58 | 2015-05-07T13:02:58 | null | UTF-8 | C++ | false | false | 3,303 | cc | grid_walker.cc | // This file is part of the dune-stuff project:
// https://github.com/wwu-numerik/dune-stuff
// Copyright holders: Rene Milk, Felix Schindler
// License: BSD 2-Clause License (http://opensource.org/licenses/BSD-2-Clause)
#include "main.hxx"
#if HAVE_DUNE_GRID
# include <dune/stuff/grid/walker.hh>
# include <dune/s... |
9775faa0f41a79a3348c9f1d19eeec89daec4017 | 788cfa8d89ab6f8aacd84fb5587ae41aeef33e44 | /src/benchmark.cpp | 334bef289f58155c0a64cb35f7a7a68226835287 | [
"LicenseRef-scancode-boost-original",
"MIT",
"BSL-1.0"
] | permissive | vgteam/vg | 5064ca0996db9c54c9642cc4d63d2fef2cefcdb0 | e173d0a81c6aa0e5b93a863f19b73ee4200177dc | refs/heads/master | 2023-08-31T04:08:13.862938 | 2023-08-25T00:35:47 | 2023-08-25T00:35:47 | 24,727,800 | 886 | 202 | NOASSERTION | 2023-09-08T11:33:30 | 2014-10-02T16:54:27 | C++ | UTF-8 | C++ | false | false | 6,478 | cpp | benchmark.cpp | #include "benchmark.hpp"
#include <vector>
#include <iostream>
#include <cassert>
#include <numeric>
#include <cmath>
#include <iomanip>
/**
* \file benchmark.hpp: implementations of benchmarking functions
*/
namespace vg {
using namespace std;
double BenchmarkResult::score() const {
// We comnpute a score in... |
92a90ec6f0f57b3886c678f70697f4ee0ba934fd | 46fda2ea47f311ee7fefc6f6210811c7f4bd74ad | /databases/mysql-connector-odbc/files/patch-driver_dll.cc | b69ce6b9e812f934b9d5e6ab273b9b749afa8794 | [
"BSD-2-Clause"
] | permissive | truenas/ports | ad560a8adde884dc0cfc4b292bbbcad91903b287 | da4ed13ad08a6af5c54361f45964fa1177367c68 | refs/heads/truenas/13.0-stable | 2023-09-02T03:00:28.652837 | 2023-08-16T16:05:00 | 2023-08-16T16:05:00 | 8,656,293 | 18 | 9 | NOASSERTION | 2023-09-12T15:15:34 | 2013-03-08T17:35:37 | null | UTF-8 | C++ | false | false | 327 | cc | patch-driver_dll.cc | --- driver/dll.cc.orig 2019-04-15 16:56:34 UTC
+++ driver/dll.cc
@@ -125,7 +125,7 @@ void myodbc_end()
This eliminates the delay when mysys_end() is called and other threads
have been initialized but not ended.
*/
- my_thread_end_wait_time= 0;
+ static uint my_thread_end_wait_time= 0;
#endif... |
0193f2fa7e6f7964e1837f6bd1763ff275d82234 | c1e10ac7a355a39067954918d62dc5f28df3f8f8 | /tutorial/ruud_van_der_pass_openmp/04_omp_methods/10_omp_get_wtime.cpp | 518643a807af63b728a727ec7ea662674a5636f5 | [] | no_license | grayasm/git-main | be46c568c3b9edcfe9d583bac8aba1302932b0d1 | 88ef1393b241383a75ade3e8677238536fe95afa | refs/heads/master | 2023-08-05T03:49:36.674748 | 2023-08-03T14:57:55 | 2023-08-03T14:57:55 | 32,255,990 | 12 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 1,028 | cpp | 10_omp_get_wtime.cpp | /* double omp_get_wtime(void);
Elapsed wall clock time in seconds. The time is measured per thread,
no guarantee can be made that two distinct threads measure the same time.
Time is measured from some "time in the past", which is an arbitrary time
guaranteed not to change during the execution of the p... |
055b952467c7592d39c5de91d21528ffe5bb2a19 | 8715867ccf09f502a6725b80355042ea99008bae | /[C++] Freelance/FREELANCE6/OB4/OB4/Source.cpp | 3634f455f1e4b1592ed45820d138c8f773491af5 | [] | no_license | MaxRev-Dev/My-Labs | 0ef1f07313e0eb5bd23ce01c2bd012ed389858d8 | 0ac8c7570985701606fe65277ad58c7590895912 | refs/heads/master | 2022-12-11T12:04:45.121156 | 2021-11-05T02:18:20 | 2021-11-05T02:18:20 | 148,040,090 | 0 | 0 | null | 2022-12-08T01:16:43 | 2018-09-09T15:42:32 | C++ | UTF-8 | C++ | false | false | 609 | cpp | Source.cpp | #include <iostream>
#include <Windows.h>
#include <algorithm>
#include <string>
#include <conio.h>
using namespace std;
int main() {
SetConsoleCP(1251);
SetConsoleOutputCP(1251);
string str;
cout << "Введіть текст (АБ): ";
getline(cin, str);
size_t n1 = count(str.begin(), str.end(), 'А'); // просто функція пош... |
09bebc0865fab7ae7bf782a50561dbe242ae1ad6 | ea4edc2884fc719b201663c853bf4ba921ad640a | /source/wrapper/WrapperCo.h | b03c5c35518a51be6687146efb54bfb9dd876765 | [
"MIT"
] | permissive | Jde-cpp/MarketLibrary | 69b55be9b5b4860d505dadc2d750140f1a9c9879 | bd4b68a0106a92b7b2e0864b8e0b9aedf1772791 | refs/heads/master | 2022-08-13T14:58:13.891313 | 2022-08-01T09:11:27 | 2022-08-01T09:11:27 | 218,258,652 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,772 | h | WrapperCo.h | #include <jde/markets/Exports.h>
#include "../../../Framework/source/coroutine/Coroutine.h"
#include "./WrapperLog.h"
#include "../../../Framework/source/collections/UnorderedMapValue.h"
//#include <jde/markets/types/proto/results.pb.h>
namespace Jde::Markets
{
struct Contract;struct TwsClientCo; struct HistoryAwait... |
ff15c45d15cbf2056c688dada8351a8ce3c04df3 | 56a4cb943d085a672f8b0d08a8c047f772e6a45e | /code/Johnson_Engine/Runtime/world_particle_blocker_data.h | b4389aa9310de67ed931a838be57863e92139bbc | [] | no_license | robertveloso/suddenattack_legacy | 2016fa21640d9a97227337ac8b2513af7b0ce00b | 05ff49cced2ba651c25c18379fed156c58a577d7 | refs/heads/master | 2022-06-20T05:00:10.375695 | 2020-05-08T01:46:02 | 2020-05-08T01:46:02 | 262,199,345 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 790 | h | world_particle_blocker_data.h | //////////////////////////////////////////////////////////////////////////////
// Polygons that block particle movement.
#ifndef __WORLD_PARTICLE_BLOCKER_DATA_H__
#define __WORLD_PARTICLE_BLOCKER_DATA_H__
#include "ltmodule.h"
#include "loadstatus.h"
#include <vector>
class IWorldParticleBlockerData : public IBase
... |
0b4d8959310983ce1f3eddb65e260fbf31b89b33 | 1fe464d4a0e50caa0314307a41eda5a618e08027 | /brianna-and-yu-ambient-telepresence.ino | 1a16549bf9ae2ffb69d19fbac83aa9ae8ed68c14 | [] | no_license | Jyu0927/Triangular-Walking-Sensor | 12fc3e1da8f7b0341cfbc3d1bccd9116a0df396b | 6a1607067e49169982e176132998dca4519a2277 | refs/heads/main | 2023-01-09T00:12:59.800098 | 2020-10-31T16:36:06 | 2020-10-31T16:36:06 | 308,925,443 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,901 | ino | brianna-and-yu-ambient-telepresence.ino |
#include <Servo.h>
//================================================================
// Hardware definitions. You will need to customize this for your specific hardware.
const int SONAR_TRIGGER_PIN = 8; // Specify a pin for a sonar trigger output.
const int SONAR_ECHO_PIN = 7; // Specify a pin for a sonar ec... |
a74be62d110eab000adb3656d4fe8eb22913b8f0 | 9a4b0866d77722718576a37bb97fa50c725b9b79 | /ConnectedComponents.cpp | d20021d906f538674d52af218aceae4f969f0220 | [] | no_license | kartikeya72001/GraphsCpp | 149da0f409bec86d2ed6ad72f03652beb77b8fc0 | 0edc93b2e77286180df6cabe7966cf85e2ebf518 | refs/heads/master | 2022-12-28T09:39:24.844309 | 2020-10-15T11:34:51 | 2020-10-15T11:34:51 | 262,566,092 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,229 | cpp | ConnectedComponents.cpp | #include <iostream>
#include<queue>
#include<map>
#include<list>
using namespace std;
template<typename T>
class Graph{
map<T,list<T>> l;
public:
void addEdge(T x, T y)
{
l[x].push_back(y);
l[y].push_back(x);
}
void dfshelper(T src, map<T,bool> &visited){
cout<<src<<" ";
... |
13f2d4f99233d941f9fc993859e99e7643d937b0 | 8b04e0aad840452c0a674e62f21060289bed0b9c | /src/core/config.hpp | 7916c3a028809deda606cc78a8b485003c3fc2a8 | [
"MIT",
"BSL-1.0"
] | permissive | bradosia/BookFiler-Module-HTTP | 220a2ab085037654e8fa90f6f47cbff13992dfc2 | 7a4b81badb32391a9f640babd676cdf81d6e1f39 | refs/heads/main | 2023-01-22T06:43:58.959804 | 2020-11-29T16:08:52 | 2020-11-29T16:08:52 | 302,550,989 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 960 | hpp | config.hpp | /*
* @name BookFiler Module - HTTP w/ Curl
* @author Branden Lee
* @version 1.00
* @license MIT
* @brief HTTP module for BookFiler™ applications.
*/
#ifndef BOOKFILER_MODULE_HTTP_CONFIG_H
#define BOOKFILER_MODULE_HTTP_CONFIG_H
#define HTTPS_GET_JSON_DEBUG 1
#define HTTPS_GET_JSON_ENABLE 1
#define BOOKFILER_HTTP... |
db4bea7762c1b551f920f8346faf5d0d8cb2933a | ffea6219dc14e6515c199acb4fbb84db0cd65225 | /autonomous.cpp | d11b38f232e919d1abc7e1b131ce55b92717fb13 | [] | no_license | Andrew929H/Competition12-7 | cdcaf382390f98663bc5d95e450fe423b624dc96 | c8d362a00c3dd2b9f93d609a06ec6ef9bf10e09c | refs/heads/master | 2020-04-10T08:19:49.180941 | 2018-12-08T04:19:07 | 2018-12-08T04:19:07 | 160,903,244 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,867 | cpp | autonomous.cpp | #include "main.h"
#include "globals.h"
#include <cmath>
#include "okapi/api.hpp"
using namespace okapi;
inline int auton = 0;
pros::Motor intake(3, true);
pros::Motor indexRoller(5, true);
pros::Motor flywheel(9, true);
pros::Motor descore(11);
pros::Motor rightFront(19, true);
pros::Motor rightRear(20, true);
pros:... |
4248b3ec2db952f4cd9d9815999dc845e3fac1e1 | 599d32cdc9dbd15806b0e7d2bb77e8fd904b5caf | /c++/0076.cpp | b608c1ff31590a41492d491f473a365d45040e4d | [] | no_license | maximusyoung007/LeetCode | 03776bc6191864469a9a30a391cf49a909b9b9a8 | fe4a6186d4e039c271efda0ddb05965bdde1f172 | refs/heads/master | 2023-07-15T23:21:05.796959 | 2023-07-02T15:18:12 | 2023-07-02T15:18:12 | 176,424,589 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,634 | cpp | 0076.cpp | #include<string>
#include<vector>
#include<map>
using namespace std;
class Solution0076 {
public:
string minWindow(string s, string t) {
if(s == "" || t == "") return "";
if(s.size() < t.size()) return "";
if(s == t) return s;
int left = 0, right = 0, minLeft = 0, minRight = 0;
... |
67f8796edfaaba39036fa7e607a41d301954f102 | d9aa48b214225ea3f2e39234a0d7859678ddb83a | /serial/serial.h | 0aaed23ffaffe571a5630283ae061c2ddb2f886c | [] | no_license | Spuu/QRfpClient | 142e90c83fa6c163273d4cf21f6caf70e46f01b6 | 79ac59bdd5f44e6053cf454ab4bc93aad23d59df | refs/heads/master | 2021-01-12T12:06:43.520491 | 2016-11-08T17:46:47 | 2016-11-08T17:46:47 | 72,303,495 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 789 | h | serial.h | #ifndef SERIAL_H
#define SERIAL_H
#include <QByteArray>
namespace Serial {
enum RESULT {
SUCCESS,
FAIL
};
enum PACKET {
ENQ = 0x05,
ACK = 0x06,
NAK = 0x15,
STX = 0x02,
ETX = 0x03,
ETB = 0x17,
EOT = 0x04,
WACK = 0x09,
... |
799b080d659fc82e898f660479fc8cdc0d31ccd8 | 4d625beedb31d9a19c57cf892dd501ef126f6c9c | /ros_controllers/joint_trajectory_controller/test/joint_trajectory_controller_adapter_test.cpp | 8ae6a4fd8003f30ac1f805d1229f2188aa1fe6ca | [] | no_license | CureThomas/Palbator_simulation | f65d31ef6aed28436a7aaf79eee6157a3d261c89 | 42748e47a03ea3a40593b0b43908bb7b239c7ed7 | refs/heads/master | 2023-04-03T23:46:33.977864 | 2020-07-16T08:55:35 | 2020-07-16T08:55:35 | 261,386,414 | 0 | 3 | null | 2021-04-06T13:14:42 | 2020-05-05T07:14:25 | C++ | UTF-8 | C++ | false | false | 2,262 | cpp | joint_trajectory_controller_adapter_test.cpp | /*
* Copyright 2020 PAL Robotics SL. All Rights Reserved
*
* Unauthorized copying of this file, via any medium is strictly prohibited,
* unless it was supplied under the terms of a license agreement or
* nondisclosure agreement with PAL Robotics SL. In this case it may not be
* copied or disclosed except in accor... |
1c63ca32f56a5cec39a37c134b2e7393cbba5d1a | 279324a6c345135f77f718ca0af4fc4f1ea7e6e8 | /src/exceptions/Exception.h | c071c8a8d17a653f47158b16698fdb5d5951f0d5 | [] | no_license | latufla/BRenderer | 8ec47be04cf73978c76d5a005f5dbde1dce4712e | 7b890f1ab7ef87c22f6eee1db4b3f49eeca903c7 | refs/heads/master | 2021-01-01T06:04:47.030970 | 2015-02-27T09:46:38 | 2015-02-27T12:56:11 | 26,016,340 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,750 | h | Exception.h | #pragma once
#include "../utils/SharedHeaders.h"
#define EXCEPTION_INFO __FUNCTION__,__LINE__
namespace br {
class Exception : public std::exception {
public:
Exception(std::string func, uint32_t line, std::string reason) : func(func), line(line), reason(reason) {}
~Exception() = default;
virtual std::string... |
118ca6e13878f2ac8762fe992b428327fe4f0dac | 1dca551611e643f5692f726f6f3e90c6c00eb7f7 | /DatabaseBrowser/Views/memoryviewcontrol.h | fd33bd012a0b882df30822d595dd3f863a153df4 | [
"MIT"
] | permissive | HowCanidothis/DevLib | d47b977dfa01999e4fd8f26cad7ef2c9c77471fa | 58fb0fa099cc6cb5f58ad2e8481bc4ca3758cdfb | refs/heads/master | 2023-08-22T21:21:47.705274 | 2023-08-16T09:41:32 | 2023-08-21T15:40:18 | 282,774,252 | 0 | 1 | MIT | 2022-12-22T05:17:14 | 2020-07-27T02:23:37 | C++ | UTF-8 | C++ | false | false | 553 | h | memoryviewcontrol.h | #ifndef MEMORYVIEWCONTROL_H
#define MEMORYVIEWCONTROL_H
#include <QWidget>
#include <PropertiesModule/internal.hpp>
namespace Ui {
class MemoryViewControl;
}
class MemoryViewControl : public QWidget
{
Q_OBJECT
public:
explicit MemoryViewControl(QWidget *parent = nullptr);
~MemoryViewControl();
public ... |
558b68117b056abf7d7dea24b8fdb447bbd28b3f | fa82a6fe381ebf75f3b107d8d53bb25e3821f5b8 | /system/include/s_system_files.h | 3cf56d2cb6d102046aa20d4e27a13ed88a8f7454 | [] | no_license | motriuc/sasha-noob-engine | 30a005b2c45cdfe41124cd6bfc93447c31e2760d | 91266dda425f533667568bca4eba7315daa357ed | refs/heads/master | 2016-09-06T14:36:58.961996 | 2013-11-02T20:54:03 | 2013-11-02T20:54:03 | 33,181,907 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 865 | h | s_system_files.h | /////////////////////////////////////////////////////////////////////
// File Name : s_system_files.h
// Created : 28 6 2007 17:25
// File path : SLibF\system\Include
// Author : Alexandru Motriuc
// Platform Independent : 0%
// Library ... |
53044749e077926829117b1a212cee8a1d5ca7dd | cae0243512e1614fc9ef945713c9499d1a56d389 | /src/packing/posl_uncoder.h | 0ff5224aff705ade66a214986eaf4cab561eb0ed | [] | no_license | alejandro-reyesamaro/POSL | 15b5b58a9649234fa9bedbca4393550d38a69e7d | 0b3b7cf01a0392fc76394bbc04c52070637b3009 | refs/heads/master | 2021-04-15T11:10:24.998562 | 2016-09-06T15:10:54 | 2016-09-06T15:10:54 | 33,991,084 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 760 | h | posl_uncoder.h | #pragma once
#include "../solver/posl_solver.h"
#include "../tools/hash_map.h"
#include "../connections/connections_declaration.h"
class PoslUncoder
{
public:
PoslUncoder();
HashMap<std::string, std::shared_ptr<POSL_Solver> > uncode_declarations(std::vector<std::string> code,
... |
9b096e562791b18f0ade0d9959f0d2be01014d24 | f98e3c238ecf5ee0281c2b26cc122455cf8ab810 | /src/common/utilFunction.h | 26c2a6c9588f5123e74e9211e4d3d42818d04d08 | [
"Apache-2.0"
] | permissive | Wlain/rasterizer | 2130f9579bd36bf5535bd62490e1ff94cc91267c | 5fc3f377b3afadd52467da46976824a7f5e809b9 | refs/heads/master | 2023-04-18T18:46:51.059520 | 2021-05-07T14:27:04 | 2021-05-07T14:27:04 | 363,450,632 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 587 | h | utilFunction.h | //
// Created by william on 2021/5/4.
//
#ifndef RASTERIZER_UTILFUNCTION_H
#define RASTERIZER_UTILFUNCTION_H
#include "commonDefine.h"
#include "vector3.h"
#include "vector4.h"
#define MATRIX_SIZE (sizeof(float) * 16)
/**
* 判断当前点是否在三角形内部
* @param point 当前点坐标
* @param vertexes 三角形顶点坐标
* @param barycentric... |
aa4fc80d2e019ce8ae3d5c7dcae4d3a14e1ac8c0 | bed3ac926beac0f4e0293303d7b2a6031ee476c9 | /Modules/Filtering/DistanceMap/test/itkApproximateSignedDistanceMapImageFilterTest.cxx | 48afee17b8659bd40c8a3150dae0972fc02f0e76 | [
"IJG",
"Zlib",
"LicenseRef-scancode-proprietary-license",
"SMLNJ",
"BSD-3-Clause",
"BSD-4.3TAHOE",
"LicenseRef-scancode-free-unknown",
"Spencer-86",
"LicenseRef-scancode-llnl",
"FSFUL",
"Libpng",
"libtiff",
"LicenseRef-scancode-warranty-disclaimer",
"LicenseRef-scancode-other-permissive",
... | permissive | InsightSoftwareConsortium/ITK | ed9dbbc5b8b3f7511f007c0fc0eebb3ad37b88eb | 3eb8fd7cdfbc5ac2d0c2e5e776848a4cbab3d7e1 | refs/heads/master | 2023-08-31T17:21:47.754304 | 2023-08-31T00:58:51 | 2023-08-31T14:12:21 | 800,928 | 1,229 | 656 | Apache-2.0 | 2023-09-14T17:54:00 | 2010-07-27T15:48:04 | C++ | UTF-8 | C++ | false | false | 5,798 | cxx | itkApproximateSignedDistanceMapImageFilterTest.cxx | /*=========================================================================
*
* Copyright NumFOCUS
*
* 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
*
* https://www.apache.o... |
2e029ec7999322897f556ad78425568ec2331465 | 8b2fcb4cc471e9c6c45052cb381b2d66d85f8415 | /State_Design/State.cpp | 2f4ecbd0e29f944dca58ae80790c32eb89d49fb6 | [] | no_license | mrwangcheng/DesignPatterns | 7de2fdc327727ca3f48faa57303c5ef41332c582 | f6c778b8b2237de3c37d988b9ff701a1e80053d7 | refs/heads/master | 2020-04-05T17:17:15.177463 | 2019-06-16T16:21:06 | 2019-06-16T16:21:06 | 157,053,188 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,081 | cpp | State.cpp | #include "stdafx.h"
#include "State.h"
#include "ContextEx.h"
#include <iostream>
using namespace std;
State::State()
{
}
State::~State()
{
}
void State::OperationInterface(ContextEx* con)
{
cout << "State::.." << endl;
}
bool State::ChangeState(ContextEx* con, State* st)
{
con->ChangeState(st);
re... |
6ba34ba43fdf146fd77840b7b2c7bcd708e347e6 | fb6251837c15a0ee0b28b15d214599165e11de83 | /Algorithms and Data Structures/pollard_rho.cpp | a6b7699a5edb40b156397fe9691a63f5d7bfbaf2 | [] | no_license | CDPS/Competitive-Programming | de72288b8dc02ca2a45ed40491ce1839e983b765 | 24c046cbde7fea04a6c0f22518a688faf7521e2e | refs/heads/master | 2023-08-09T09:57:15.368959 | 2023-08-05T00:44:41 | 2023-08-05T00:44:41 | 104,966,014 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,053 | cpp | pollard_rho.cpp | #include <bits/stdc++.h>
using namespace std;
const int rounds=10;
typedef unsigned long long ull;
typedef long long ll;
ll gcd(ll a, ll b) {
if(b==0) return a;
else return gcd(b,a%b);
}
ll mul(ull a, ull b, ull mod) {
ull ret = 0;
for (a %= mod, b %= mod; b != 0; b >>= 1, a <<= 1, a = a >= mod ... |
b02cca67769db454adf7f2dec191dd6a43287c68 | 9808c0970f80c3260d1b91a226580aba3e52e2d5 | /valdes-engineering/src/thermal/model/tbc2009/dimensionless/b.cpp | b6d0f4d3d7ed53f71f2f8e944f2960b9afeed0f4 | [] | no_license | raymondvaldes/tat | 5d519732efb5ed379be1ac2579a6dbf7ac67e52f | 0fa3a1902cf81682d741fe0063435c6b61bac148 | refs/heads/master | 2021-01-18T15:42:09.009818 | 2015-10-30T16:55:23 | 2015-10-30T16:55:23 | 13,633,268 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 530 | cpp | b.cpp | //
// b.cpp
// tat
//
// Created by Raymond Valdes on 3/26/15.
// Copyright (c) 2015 Raymond Valdes. All rights reserved.
//
#include "b.h"
namespace thermal {
namespace model {
namespace tbc2009 {
namespace dimensionless{
auto b
(
units::quantity< units::si::length > const beam_radius,
units::quantity< unit... |
4a4e2ae1f98f50af53d0ab2c20be013463f9901c | 1292fa3e2d2f680b6b7941d1af02d598a44bf7cd | /1028ListSorting.cpp | a498062c1f922188be21e823bddc8c895651867c | [] | no_license | hedejing/PAT | f05a7746cc3c6f04b2c44a947eee852731a824a2 | afea5e8682ca554213b54b593d654499f0c220bf | refs/heads/master | 2021-01-10T10:39:30.209502 | 2016-03-02T05:33:04 | 2016-03-02T05:33:04 | 52,936,435 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 918 | cpp | 1028ListSorting.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
struct Data {
string id;
string name;
int grade;
};
int main()
{
int N, C;
cin >> N >> C;
vector<Data> datas(N);
for (int i = 0; i < N; i++)
cin >> datas[i].id >> datas[i].name >> datas[i].grade;
switch (C) {
... |
e0d92f9046b7b04f30eb9ebf0f97ac7b15361358 | ae7ba9c83692cfcb39e95483d84610715930fe9e | /yubinbai/pcuva-problems/UVa 11172 - Relational Operator/sol.cpp | ec8a24f35ba09b47f2bed14b9b08a6eac61c32b0 | [] | no_license | xenron/sandbox-github-clone | 364721769ea0784fb82827b07196eaa32190126b | 5eccdd8631f8bad78eb88bb89144972dbabc109c | refs/heads/master | 2022-05-01T21:18:43.101664 | 2016-09-12T12:38:32 | 2016-09-12T12:38:32 | 65,951,766 | 5 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 320 | cpp | sol.cpp | #include<stdio.h>
int main()
{
long int c, a, b, i;
while (scanf("%ld", &c) == 1)
{
for (i = 1; i <= c; i++)
{
scanf("%ld%ld", &a, &b);
if (a > b) printf(">\n");
else if (a < b) printf("<\n");
else printf("=\n");
}
}
return 0;
} |
5cf9820bda1701c453c547a6bd4087ef547feddd | e8543c451443b4aecab96412dbb3419bfdefc54c | /src/test.cpp | 4508a0710391f07c1cdc693b7fb895f44ae107f1 | [] | no_license | fisherleeyhl77/Dijkstra_heap | 52b21debbb56e6ec77a2472c3de16f5415e06e2f | c88823c647b8b3f1288b04a05097c20cc2c40fd9 | refs/heads/master | 2021-05-13T21:07:12.031389 | 2018-01-05T21:22:34 | 2018-01-05T21:22:34 | 116,454,499 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 989 | cpp | test.cpp | /*
* test.cpp
* Author: Huili Yu
*/
#include <iostream>
#include <climits>
#include <cstdlib>
#include <string>
#include "../include/graph.h"
#include "../include/dijkstra.h"
int main(int argc, char **argv)
{
if (argc != 2) {
std::cerr << "Please input the file for specifying "
"the graph co... |
e02b56d71ba1fc68175fc21a7ecd822fa68cc9f2 | 16e130599e881b7c1782ae822f3c52d88eac5892 | /leetcode/movingStonesUntilConsecutive/q1.cpp | 00b2ab5a4bdedfcf99868c59240d0bf458ad043d | [] | no_license | knightzf/review | 9b40221a908d8197a3288ba3774651aa31aef338 | 8c716b13b5bfba7eafc218f29e4f240700ae3707 | refs/heads/master | 2023-04-27T04:43:36.840289 | 2023-04-22T22:15:26 | 2023-04-22T22:15:26 | 10,069,788 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 470 | cpp | q1.cpp | #include "header.h"
class Solution {
public:
vector<int> numMovesStones(int a, int b, int c) {
vector<int> v{a, b, c};
sort(v.begin(), v.end());
int x = v[1] - v[0] - 1;
int y = v[2] - v[1] - 1;
int minMove = 2;
if(x == 0 && y == 0) minMove = 0;
... |
bb97b5680bbbb3cfcda958b2f031cc8fef0f23d3 | 94d912f1cd5844f6c118e805e416e9f1da4f38a3 | /SPTetris2.0/source/TetisPiece.cpp | f6beb92c924fbec2b31b2bcd624fd09056ae7a2e | [] | no_license | Svampen/SPTetris2.0 | 7b500d98701a2f8425b9794b617e5a70f79b1218 | c4f60e7711ca52355a195cf3161c8229337559b3 | refs/heads/master | 2020-05-20T15:38:48.795549 | 2013-07-28T14:47:57 | 2013-07-28T14:47:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 773 | cpp | TetisPiece.cpp | /* TetrisPiece class
** Super class to all tetris pieces
**
** Created by Stefan Hagdahl
*/
#include "TetrisPiece.h"
TetrisPiece::TetrisPiece()
{
}
TetrisPiece::~TetrisPiece()
{
}
void TetrisPiece::move(Block::DIR Dir)
{
mBlock0->move(Dir);
mBlock1->move(Dir);
mBlock2->move(Dir);
mBlock3->move(Dir);
}
void Tetri... |
4d19b04530c7a3ddd7c3f09cfbae83a566c6a2ab | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5630113748090880_1/C++/haoranxu510/B.cpp | 50ec7e31e7baeb1f0a30634c6b795af30225a203 | [] | 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,052 | cpp | B.cpp | #include <cstdlib>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <cassert>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SIZE(x) (int((x).size()))
#define rep(i,l,r) for (int... |
d0a478b1853ccf0e49ad795e9422d3bf4761fd04 | 2f557f60fc609c03fbb42badf2c4f41ef2e60227 | /RecoJets/JetAlgorithms/interface/CompoundPseudoJet.h | 3e898a97e975bfa9bfed91e8307e9862b90f7642 | [
"Apache-2.0"
] | permissive | CMS-TMTT/cmssw | 91d70fc40a7110832a2ceb2dc08c15b5a299bd3b | 80cb3a25c0d63594fe6455b837f7c3cbe3cf42d7 | refs/heads/TMTT_1060 | 2020-03-24T07:49:39.440996 | 2020-03-04T17:21:36 | 2020-03-04T17:21:36 | 142,576,342 | 3 | 5 | Apache-2.0 | 2019-12-05T21:16:34 | 2018-07-27T12:48:13 | C++ | UTF-8 | C++ | false | false | 3,187 | h | CompoundPseudoJet.h | #ifndef RecoJets_JetAlgorithms_CompoundPseudoJet_h
#define RecoJets_JetAlgorithms_CompoundPseudoJet_h
// -*- C++ -*-
//// -*- C++ -*-
//
// Package: CompoundPseudoJet
// Class: CompoundPseudoJet
//
/**
*/
//-------------------------------------------------------------------------------------
//!\class Comp... |
68f4588b6fa6e137d0d5c1337cc515097c3776c3 | 7999462d6d68dcab0b140a1fef33149b4ae6f0a6 | /include/VISAGE/_mensurium.hpp | bfcd38a4757e4e8f2d2e43d9b46ce03d41f74d08 | [] | no_license | gabrieljt/VisAGE | 43ad10e15ca2c52053864adbe1ddd940b4ead637 | 4d63f8b889612c2322ef447a1d1771240e9eda3d | refs/heads/master | 2019-01-02T04:55:15.886674 | 2014-12-10T19:56:48 | 2014-12-10T19:56:48 | 20,076,682 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,700 | hpp | _mensurium.hpp | #ifndef VISAGE_MENSURIUMAGE_HPP
#define VISAGE_MENSURIUMAGE_HPP
#include <opencv/cv.h>
#include <opencv2/opencv.hpp>
#include <queue>
#include <mutex>
class Marcador{
public:
void Inic(int x, int y,float dx,float dy);
Marcador();
CvPoint* CentroTab(std::vector<cv::Point2f> pontos);
void calcCantosDi... |
8d8db0aacf44fca5c50ea4fd98e77dd594df97d0 | 657d32e17cc206b5635fa84e19917b62f2f30977 | /src/Shader.h | 0d2bc58de1b06b95a1c0231456a1bdc776a6f033 | [
"MIT"
] | permissive | lpalozzi/rxp | 59af9e45321b7c73983d1fd55baa4997f09a31e2 | edf3ef3c0627fb6107427bd23d71f902b1acebbb | refs/heads/master | 2020-07-07T21:21:42.774855 | 2019-08-21T02:54:03 | 2019-08-21T02:54:03 | 203,481,027 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 418 | h | Shader.h | /*
* Shader.h
*
* Author: leo
*/
#ifndef SHADER_H_
#define SHADER_H_
#include <SDL2/SDL.h>
#include <SDL2/SDL_opengles2.h>
class Shader
{
public:
~Shader();
GLuint id;
static Shader *load (const char *name);
private:
Shader (GLuint id);
static GLuint compile (const char *name, GLenum shader_t... |
c4cd6ee7a39ab794f51554f56176f09fc8a74c0a | 6b62b0d9727ad3da3d266649086cc3444ae0d9d5 | /src/ECS/Systems/entityDestroying.hpp | d35f665ac8e5eec52d4ba1ee1e30490dff85a356 | [
"MIT"
] | permissive | dualword/PopHead | 55079a30bf7099b74d6c83e9f1a85ddea0774574 | 2bce21b1a6b3d16a2ccecf0d15faeebf6a486c81 | refs/heads/master | 2023-03-15T21:28:48.545172 | 2020-11-12T16:54:59 | 2020-11-12T16:54:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 181 | hpp | entityDestroying.hpp | #pragma once
#include "ECS/system.hpp"
namespace ph::system {
class EntityDestroying : public System
{
public:
using System::System;
void update(float dt) override;
};
} |
7a8d02e910e363b80eca2a922a5c7d5c51427c9f | 29af718d33105bceddd488326e53dab24e1014ef | /ComputerAlgebra/Hypergraphs/Lisp/Generators/plans/milestones.hpp | 962d98546c3cb08d1430ed53d528489a00c43f3f | [] | no_license | OKullmann/oklibrary | d0f422847f134705c0cd1eebf295434fe5ffe7ed | c578d0460c507f23b97329549a874aa0c0b0541b | refs/heads/master | 2023-09-04T02:38:14.642785 | 2023-09-01T11:38:31 | 2023-09-01T11:38:31 | 38,629 | 21 | 64 | null | 2020-10-30T17:13:04 | 2008-07-30T18:20:06 | C++ | UTF-8 | C++ | false | false | 2,120 | hpp | milestones.hpp | // Oliver Kullmann, 23.1.2010 (Swansea)
/* Copyright 2010, 2012 Oliver Kullmann
This file is part of the OKlibrary. OKlibrary 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 and included in this library; either ver... |
e80b9b48b14f91e2793a818e8522e0e2e671d80b | 0f0526a16f5749ff5d45a0b0c565e9f9447c93a9 | /Nodes/NodesHeaders/Expressions/MethodInvocation.h | d1fb8bcb3f6c93aa74947dcfc097ea57bc6145ec | [] | no_license | Pikassik/minijava-compiler | c1f4a0b88ddca6e01f7264e417356969afd64256 | 7f413fc984fab32c015903590ad43b2d70a2dfc5 | refs/heads/master | 2022-12-18T12:27:00.012886 | 2020-04-17T01:51:43 | 2020-04-17T01:51:43 | 252,119,447 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 598 | h | MethodInvocation.h | #pragma once
#include <Nodes/NodesHeaders/Expressions/Expression.h>
#include <Nodes/NodesHeaders/Statements/Statement.h>
#include <vector>
namespace node {
struct MethodInvocation : Expression, Statement {
std::shared_ptr<Expression> class_expression;
std::string method_identifier;
std::vector<std::shared_ptr... |
d8bc740e58d518fef2a5ff17d1b5cdd655c831aa | 543a165f7a18b7a874273f918f13a4cdad758ccf | /IECacheCatcher-VS2010/IECacheThread.cpp | c174e56ee23fc380b61fd702fa0509d4968985f4 | [] | no_license | DTTKillASmallScale/cocoshun | 1ba2c18bfdb68c93f59e4dd9201da923500599d4 | e7a2700353db896d94e3528c95af287f667ea75b | refs/heads/master | 2021-01-22T19:31:08.859894 | 2012-11-09T01:29:00 | 2012-11-09T01:29:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,066 | cpp | IECacheThread.cpp | // IECacheThread.cpp: implementation of the CIECacheThread class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "IECacheCatcher.h"
#include "IECacheThread.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#end... |
5b076575a8f8e736a81fe7b0dc915712cda9085d | 64178ab5958c36c4582e69b6689359f169dc6f0d | /vscode/wg/sdk/UMaterialInstance.hpp | c3c1abf3c126179b9faa292f9dad5506724c3bf1 | [] | no_license | c-ber/cber | 47bc1362f180c9e8f0638e40bf716d8ec582e074 | 3cb5c85abd8a6be09e0283d136c87761925072de | refs/heads/master | 2023-06-07T20:07:44.813723 | 2023-02-28T07:43:29 | 2023-02-28T07:43:29 | 40,457,301 | 5 | 5 | null | 2023-05-30T19:14:51 | 2015-08-10T01:37:22 | C++ | UTF-8 | C++ | false | false | 5,999 | hpp | UMaterialInstance.hpp | #pragma once
#include "UMaterialInterface.hpp"
#include "FMaterialInstanceBasePropertyOverrides.hpp"
#ifdef _MSC_VER
#pragma pack(push, 1)
#endif
namespace PUBGSDK {
struct alignas(1) UMaterialInstance // Size: 0x1B8
: public UMaterialInterface // Size: 0x78
{
private:
typedef UMaterialInstance t_... |
f22a092b619aa566e4b589487fff15410f79b2fa | 347334f675bc31ecab5d74ca6388827b13097ed9 | /src/lib/src/commands/sql-worker.cpp | 560fb5509ee10c7e8f81bc88161d4b8e8e14a47d | [
"Apache-2.0",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | Bionus/imgbrd-grabber | 442108d9663a06a848ef49837943d5950bca9d8c | 4ab008d5d0f62ab2bc34aff7de02e05d598e058a | refs/heads/master | 2023-08-20T21:50:37.649081 | 2023-08-17T22:54:55 | 2023-08-17T22:54:55 | 32,276,615 | 2,226 | 301 | Apache-2.0 | 2023-08-12T16:31:57 | 2015-03-15T18:26:31 | HTML | UTF-8 | C++ | false | false | 1,885 | cpp | sql-worker.cpp | #include "commands/sql-worker.h"
#include <QtSql/QSqlDatabase>
#include <QtSql/QSqlDriver>
#include <QtSql/QSqlError>
#include <QtSql/QSqlField>
#include <QtSql/QSqlQuery>
#include <utility>
#include "logger.h"
SqlWorker::SqlWorker(QString driver, QString host, QString user, QString password, QString database, bool d... |
13587ef22fa6ce657bfaebc3072b7ba5fc4f77f6 | 158065b59fea05fa61a31ce400becd29106d70ca | /FastBlur/FastBlur.cpp | 5b6ded56c025f374e80fe88b0955a57ba8bb0140 | [
"Apache-2.0"
] | permissive | nullptr-0/FastBlur | 7c4e54761b0cd0db3c4908fefcaeb47f01d2031a | f90c17a630defd337fff38d974dbb4043a2bce69 | refs/heads/main | 2023-07-09T05:36:08.809588 | 2021-08-25T03:12:55 | 2021-08-25T03:12:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,577 | cpp | FastBlur.cpp | // FastBlur.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
#include "pch.h"
#include "framework.h"
#include "FastBlur.h"
#include "EasyBMP.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
using namespace std;
#define COLOR_RED 1
#define COLOR_GREEN 2
#define COLOR_BLUE 3
#define COLOR_PURPLE 4
#define COLO... |
b760256512ed9b4f50aa83a4045879f5df782d10 | cd9d5422bfab6f6e7c573af09a16626d0a738916 | /accepted/291.WordPatternII.cpp | 36855568a0486215aaa4b731caafce37a73c19e0 | [] | no_license | Lingfei-Li/leetcode | dd4bd8365a25ca279b51fc8cc546f44c02c5d7ef | 36bd3b2a9e679c61962e946901f995142b85efaa | refs/heads/master | 2021-01-19T06:58:57.783787 | 2016-06-21T04:37:58 | 2016-06-21T04:37:58 | 59,934,535 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,586 | cpp | 291.WordPatternII.cpp | #include"mytest.h"
class Solution {
public:
unordered_map<char, string> dict;
unordered_set<string> st;
bool match(string& s1, string& s2, int p2) {
if(s2.length()-p2 < s1.length()) return false;
for(unsigned int i = 0; i < s1.length(); i ++) {
if(s1[i] != s2[p2... |
cc4b62f45cd1a11aad32de3caed37dd9963d6109 | aee37b130e559780722394117a7acffe89a2d2b5 | /src/RectanguLand.Graphics/Objects/Texture.h | bab2ed6345a7e4cf36a49f160b6998b2c017c3db | [] | no_license | Craftrect/rectangu.land | 8b240d4038caba4e5a130837701aff4ea426621c | a2db3b79fe9324b207a91dfe9bc7da9b3aba3c29 | refs/heads/master | 2021-01-18T14:34:12.434823 | 2013-09-28T20:16:12 | 2013-09-28T20:16:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 562 | h | Texture.h | #pragma once
#include "ApiObject.h"
namespace Graphics
{
SHARED_FORWARD(Texture);
class Texture : public ApiObject
{
protected:
static TexturePtr gDefaultTexture;
Texture(ApiType type) : ApiObject(type) {
}
virtual void updateData(const void* memory, uint32 size) = 0;
public:
static TexturePtr get... |
9e1c830fcd19719f20ee9a2658877b44a309b028 | 69d1fafb6d949401d57009cbf196c797f607fabf | /movingobject.cpp | 943cd54ba1dac82c4a95c7ca14b9d73eb1e5c358 | [] | no_license | chvatma2/test-game | fc7ac06006f5d27ccd9bdf5b3c73536a3a1bd173 | eba156803b5f85a1676238e99048d0f3d1a7129e | refs/heads/master | 2020-03-26T18:32:42.568098 | 2015-05-16T16:17:11 | 2015-05-16T16:17:11 | 35,066,104 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 478 | cpp | movingobject.cpp | #include "movingobject.h"
MovingObject::MovingObject(const QVector2D &position, GLuint texture, float speed)
: GameObject(position, texture), m_Speed(speed)
{
}
MovingObject::~MovingObject()
{
}
void MovingObject::update(const std::vector<std::string> &levelData, std::vector<GameObject *> objects)
{
}
void M... |
2cacc16e357662fc77ab2653ac55813899212116 | 23d7b35f9c613af0fa059f04694368bf9c48728f | /ObjectsTraining/OOP.cpp | da1a8fb8a17f769605d00dc483429f7544b23788 | [] | no_license | PetroniusIsAlive/Projects_uni | 7eb216e7ad5e3312d8a2af7c4d15b8979ababe3e | 03a7a8febb9a6aefcffd80daeb123229404f8988 | refs/heads/master | 2023-04-09T13:01:15.946257 | 2021-04-03T07:47:51 | 2021-04-03T07:47:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,749 | cpp | OOP.cpp | #include <iostream>
#include <cstring>
class BankAccount {
private:
char memberName[20];
char bankNum[10] = "BG";
char subArray[8];
size_t balance = 0;
size_t arrLength(char* arr) {
return strlen(arr);
}
public:
char getMemberName() {
return *memberName;
}
void setMemberName(char data , size_t lo... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.