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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
398dab00ef8e33b8106f7c386504020ce57cd7ae | a1809f8abdb7d0d5bbf847b076df207400e7b08a | /Simpsons Hit&Run/game/libs/radcore/src/radmemory/memoryspaceps2.hpp | cf53bff3cfb92ab0ae325aafee2a276a967ce5a8 | [] | no_license | RolphWoggom/shr.tar | 556cca3ff89fff3ff46a77b32a16bebca85acabf | 147796d55e69f490fb001f8cbdb9bf7de9e556ad | refs/heads/master | 2023-07-03T19:15:13.649803 | 2021-08-27T22:24:13 | 2021-08-27T22:24:13 | 400,380,551 | 8 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,691 | hpp | memoryspaceps2.hpp | //=============================================================================
// Copyright (c) 2002 Radical Games Ltd. All rights reserved.
//=============================================================================
//=============================================================================
//
// Fi... |
e13be0410e4bfd2a17ec1f60a86e5205e448f65d | dbdc638b28c0bd2275a7b09cec5479e1fa6a6f6f | /matrix.cpp | becd6c30f805090d87e9c461b54b65705a5967ed | [] | no_license | shift4/ptrace | eed979931fb7e9f85c6cc664d3f611b6f6b6d46d | 03825c4dab745afe3b85523538af8a396c5a2cae | refs/heads/master | 2023-03-20T00:58:34.765510 | 2023-03-08T07:30:39 | 2023-03-08T07:30:39 | 110,398,370 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 304 | cpp | matrix.cpp | #include<iostream>
typedef int arrT[5];
arrT* makearray()
{
int a[5] = {1};
std::cout << &a << std::endl;
return &a;
}
int main()
{
arrT *p = makearray();
std::cout << p << std::endl;
for(int i = 0; i < 5; i++){
std::cout << (*p)[0] << std::endl;
}
return 0;
}
|
d2c6827ffc80a3330f639211beb8669916c584cf | 6c013d5d70b692e6b5250f3ab8405e1a1ef32055 | /UIWidgets/GeneralInformationWidgetR2D.cpp | 3c8a2e0a02388b2dcbae5b89a3663c57b4f040fb | [
"BSD-3-Clause",
"BSD-2-Clause"
] | permissive | NHERI-SimCenter/R2DTool | a667afb17a5ac6df07966ee5b98cf1975dfe6ddf | b3fa98e018bdf71caccd97277d81307ac051a1c1 | refs/heads/master | 2023-08-19T07:48:07.775861 | 2023-07-28T15:16:17 | 2023-07-28T15:16:17 | 329,111,097 | 5 | 18 | NOASSERTION | 2023-09-14T21:52:20 | 2021-01-12T21:00:33 | C++ | UTF-8 | C++ | false | false | 13,118 | cpp | GeneralInformationWidgetR2D.cpp | /* *****************************************************************************
Copyright (c) 2016-2021, The Regents of the University of California (Regents).
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are... |
ef29552e905a4985e29373c0cdad763b7a7b3f74 | f9b2b183bb2c1d621f36417fffd5d5c19b36cbd5 | /Code/WeSalon/ReplyDlg.cpp | 768700e4bd1814ec0be523d921faec65d8535712 | [
"MIT"
] | permissive | takuyara/WeSalon-Application | 33699fa87bb001e7aee45ac2fe11efaa3f85bffd | 31fbcaedf13d792f72f444fd4efbf68379f7d187 | refs/heads/master | 2023-05-14T14:43:01.495059 | 2021-06-01T05:35:11 | 2021-06-01T05:35:11 | 372,712,680 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,477 | cpp | ReplyDlg.cpp | //Pionniers du TJ, benissiez-moi par votre Esprits Saints!
//It rained on us at 4am.
#include "pch.h"
#include "WeSalon.h"
#include "ReplyDlg.h"
#include "afxdialogex.h"
#include "dbif.h"
// ReplyDlg 对话框
IMPLEMENT_DYNAMIC(ReplyDlg, CDialogEx)
ReplyDlg::ReplyDlg(CWnd* pParent /*=nullptr*/)
: CDialogEx(IDD_REPLY,... |
8072b8b19afc28d08dcd8b8fbb96495dced81849 | 1fa43a183a4ddb1458da1d6d8c63658b9e720230 | /黑马程序员/04 程序流程结构/04 程序流程结构/11 练习水仙花数.cpp | 835daefd84d8d60efde95bb11939afa90b47eeb0 | [] | no_license | Xgcczs/Cpp-Primer-Plus | 22ca68c1e3ef27b2d0032f4dda371aeb99de67b8 | 8ba80480156c4ce0e8dca2319508a37852db51ce | refs/heads/main | 2023-09-01T22:10:17.991329 | 2021-10-31T08:10:44 | 2021-10-31T08:10:44 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,394 | cpp | 11 练习水仙花数.cpp | #include<iostream>
using namespace std;
#include<math.h>
int main11()
{
// 水仙花数：是三位数，且每个位的数字的立方之和等于该数
// 例如： 1^3+5^3+3^3 = 153
// 使用do...while 结构
int num=100;
int num1, num2, num3;
int shuixian=0, Num=0;
//num1 = num / 100;
//num2 = (num % 100) / 10;
//num3 = (num % 100) % 10;
//Num = pow(n... |
0d320c491fcebdb71d603871c6bd429c4bcee2aa | 7e65b476c99f903b054b7517717cff58a036ab15 | /118. Pascal's Triangle.cpp | 29a4cc0c6ef304f41094c900fa3d0459541ef881 | [] | no_license | violet73/leetcode101 | a0a8120b4e3d7d891fad6a5dbaa96e21d8ce597e | bc5b9d803f6507c14d5a6129af6da347cf75abc9 | refs/heads/master | 2023-07-14T07:56:27.569860 | 2021-08-26T02:49:23 | 2021-08-26T02:49:23 | 368,235,085 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,260 | cpp | 118. Pascal's Triangle.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<vector<int>> gen(int numRows) {
vector<vector<int>> res;
if(numRows == 1) {
vector<int> nums;
nums.push_back(1);
res.push_back(nums);
return res;
... |
063c9fe93af03d619cff6676f8b5c6fe3f8d32d1 | 445d6fce837cacdf98444f69003b259702d4dee9 | /lab9/Source/Character.h | fd20d2b6a53921f1b443eed8736fd1be101f6eda | [] | no_license | jasonulloa/ITP485-2017 | 3a827f525c58917846f78a058092ad5539a796aa | a2b8509c1519c500d863a4eecd314fe6e9ce43c0 | refs/heads/master | 2020-03-12T03:32:54.382027 | 2018-04-21T02:05:21 | 2018-04-21T02:05:21 | 130,426,525 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 715 | h | Character.h | // Character.h
// Character actor
#pragma once
#include "Actor.h"
#include "Texture.h"
#include "CharacterMoveComponent.h"
#include "SkeletalMeshComponent.h"
#include "Skeleton.h"
class Character : public Actor
{
DECL_ACTOR(Character, Actor);
public:
Character(Game& game);
void BeginPlay() override;
void Tick(fl... |
d54ca9a174b59cfffc88d936efb1269863a4b427 | 03222be2d4e5fb8a8d57f8e4c5c77f94f4577e70 | /BubbleSort.cpp | 3a384cf2748625f0ee7ad59055e5c9e0c3746e8c | [] | no_license | sharmasubash/SortingInCpp | 6815b02f0807399af4280d829c8f0c1fff7572de | d456db15a9a91b3ab5de6d20f5b69e5b6c8b32c7 | refs/heads/master | 2020-04-11T22:37:01.443012 | 2018-12-17T14:27:55 | 2018-12-17T14:27:55 | 162,142,052 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,687 | cpp | BubbleSort.cpp | #include <iostream>
using namespace std;
// a[5] = [23,2,4,1,7];
void BubbleSort(int a[],int n){
// input passed BubbleSort(a[5],5)
for (int pass=n-1;pass>=0;pass--){
// 1st iteration starts with 4
// (pass = 4; 4 >0, pass = 4-1)
for (int i=0;i<=pass-1;i++){
//here pass = ... |
0a19a6ec15ee5ff11c150dd1cfbaacd7612d9cb4 | 6d36f647f5118d7170d5a6c0add13550870292f5 | /include/utils/TimeHelper.h | a347b7af8b8e2612d5a6355466f33759ba9cb55c | [] | no_license | MarkusWende/JnRMaker | 9b84368ee6e1a469b5b78e77a28a2e8e66326f1f | a8c8aac83c337c7d3c2b223b7f54786526c1ba05 | refs/heads/master | 2023-07-15T04:57:04.913746 | 2023-07-03T19:36:14 | 2023-07-03T19:36:14 | 240,896,758 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,546 | h | TimeHelper.h | /****************************************************************************
* Copyright (C) 2019 Kirsch-Audio GmbH <software@kirsch-audio.com>
* All rights reserved.
*
* This file is part of ANCMonitor
*
* SoundIMP is a software for creating sound immission predictions.
*
* Unauthorized copying of this file, ... |
508391eb465f9675c4bb485e26ee61c004e7fc43 | 373035950bdc8956cc0b74675aea2d1857263129 | /cpp/test-harness/ta3/pub-sub-gen/num-predicate-generators.cc | 254f5b6e9b1ba2a61ca167c560ac69f7f4673306 | [
"BSD-2-Clause",
"BSD-3-Clause"
] | permissive | limkokholefork/SPARTA | 5d122cd2e920775d61a5404688aabbafa164f22e | 6eeb28b2dd147088b6e851876b36eeba3e700f16 | refs/heads/master | 2021-11-11T21:09:38.366985 | 2017-06-02T16:21:48 | 2017-06-02T16:21:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,722 | cc | num-predicate-generators.cc | //*****************************************************************
// Copyright 2013 MIT Lincoln Laboratory
// Project: SPAR
// Authors: OMD
// Description: Implmentation of the num predicate generators
//
// Modifications:
// Date Name Modification
// ---- -... |
bf14f0c6f78fb3f1da07eb10ada5d34a49653dd2 | 7d1979a1638273fca2d8b3b6db570811dd0b8d66 | /src/Postprocess.cpp | 39ec1800732ca09c2c8a07ee60f605d6b6ce13b7 | [] | no_license | mkloczko/cube | 36c128186f1d6d1e65403015197ba4cd5f03cf0e | ce2ebda9728585cd7083064b1ab600b3263ffce8 | refs/heads/master | 2022-07-23T08:50:21.970891 | 2022-07-16T15:35:14 | 2022-07-16T15:35:14 | 131,104,620 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,668 | cpp | Postprocess.cpp | #include "Postprocess.hpp"
using std::function;
constexpr GLfloat canvas_vertices[6*2] = {
0.0, 0.0,
1.0, 0.0,
0.0, 1.0,
1.0, 0.0,
1.0, 1.0,
0.0, 1.0
};
constexpr char vertex_shader[] = "#version 300 es\n"
"in highp vec2 in_position;\n"
"out highp vec... |
7fcb62edc28d67bc88170fbfcefc71f62a007479 | 630e9438530e5b15353cc9b7c013889fa0f7e80d | /C++/CS1570/hw9/activist.h | 912dcc2608e86bf57a14c1fc244799690cabd4f2 | [] | no_license | dmgardiner25/CS-Classes | 0402c1d04c4d3cc50a91d7f1d27a7b7d291f0c5e | b6eaa2101db532ab986aefb48e531308d795d4bd | refs/heads/master | 2021-06-02T07:44:32.878122 | 2017-11-01T16:13:04 | 2017-11-01T16:13:04 | 80,837,900 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,826 | h | activist.h | //Programmer: DAVID GARDINER Date: 11/14/16
//File: activist.h Class: CS1570 A
//Purpose: Definition of the activist class.
#ifndef ACTIVIST_H
#define ACTIVIST_H
#include <string>
#include "town.h"
using namespace std;
//Min and max toxicity allowed
const float MIN_TOXICITY = 0.0;
const f... |
a985aefc3d4d700b3861ea4c58579cc2017b38e3 | a565eef51e8445b519288ac32affbd7adca874d3 | /libgringo/gringo/output/aggregates.hh | 2b14bb0316e1b0f514c80c6990ddb753723c24f5 | [
"MIT"
] | permissive | CaptainUnbrauchbar/clingo | b28a9b5218552240ea03444e157a21079fc77019 | 58cb702db83c23aedea28b26a617102fae9b557a | refs/heads/master | 2023-02-27T23:53:44.566739 | 2021-02-01T18:36:10 | 2021-02-01T18:36:10 | 290,831,881 | 1 | 0 | MIT | 2021-02-01T18:36:11 | 2020-08-27T16:53:18 | C++ | UTF-8 | C++ | false | false | 4,458 | hh | aggregates.hh | // {{{ MIT License
// Copyright 2017 Roland Kaminski
// 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,... |
b54a5675818808c62a9be922c94fed136db69646 | 53b9221c49c159beeddc62c79b034e1e55998003 | /Cyanide/Cyanide-Core/source/core/FSM.cpp | 66ba58bd829a799ee2bfc42d950d1e8bf2283586 | [] | no_license | Jukaio/CPP-Programming | 9879f53956393f4171f20e7d69911c4823354bce | 834074f646b62d88e8d927ebe7fb19f55fb647cf | refs/heads/master | 2023-01-28T21:58:25.498709 | 2023-01-24T19:34:45 | 2023-01-24T19:34:45 | 293,497,837 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,021 | cpp | FSM.cpp | // FSM.cpp
#include "core/FSM.h"
#include "core/state.h"
#include <SDL.h>
#include <assert.h>
FSM::FSM()
: m_current(nullptr)
{
}
FSM::~FSM()
{
}
void FSM::set_renderer(SDL_Renderer* p_renderer)
{
m_renderer = p_renderer;
}
void FSM::run(int p_ms)
{
if(!m_current)
return;
bool swap = !m_current->core_update... |
17e86de0be7c8305fefeaa127b9c79bf5bef61bb | a3cb407b74d87f8c15fb6f21710175ce37bbe2db | /LesPaulToUnoJoy.ino | b9a6d8d1e32566ce6f5fc7b7fc1dfe2f478a45fb | [] | no_license | laka3000/LesPaulToUnoJoy | f6b3e8013916fe40008794c6873dcdf5a07f7f13 | 961720fd1a0ed5192b13b7acca545789497d8273 | refs/heads/main | 2023-07-15T18:23:09.243042 | 2021-08-20T13:25:51 | 2021-08-20T13:25:51 | 398,094,157 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,001 | ino | LesPaulToUnoJoy.ino | #include "UnoJoy.h"
typedef void (* CallbackArray)(int);
const byte GreenPin = 2;
const byte RedPin = 3;
const byte YellowPin = 4;
const byte BluePin = 5;
const byte OrangePin = 6;
const byte DownPin = 7;
const byte UpPin = 8;
const byte SelectPin = 12;
const byte StartPin = 13;
const byte RedLed =... |
a55e85c9d7eef3b4bdf6a58fc8d11ec69c6ba54b | f4a0a9788e83ffd186d9520d4f8491e1183cd3b6 | /Assignment2_luint.cpp | 63ad43a53d97b559e4b7926c51f6fbe3010b8627 | [] | no_license | saikiranpalimpati/Algorithm-Analysis | a5d18bb9adecaf1bbe81f9795710f98a640fb02d | 1e38246ddbc57dd73d557dafc672af01447c4bc3 | refs/heads/master | 2020-04-02T15:02:33.313329 | 2018-10-24T18:49:40 | 2018-10-24T18:49:40 | 154,549,662 | 0 | 0 | null | 2018-10-31T17:22:09 | 2018-10-24T18:33:10 | C++ | UTF-8 | C++ | false | false | 2,728 | cpp | Assignment2_luint.cpp | #include "luint.h"
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
luint::luint()
{
}
luint::~luint()
{
}
//*******************************************************************
// Method:parameterized constructor
// Parameters: unsigned int
// Taking ... |
b8c48ff51032dc73e85841f21c6a07a87abf0a45 | 2fc013d8c5dbc5c36ab9135e2a03a49710bc29f1 | /main.cpp | 161d19131391773ae4d1a456cb9ec4cd43b74b10 | [] | no_license | arashparnia/GA | da6e012e995b07906aa41955e34d90e3ec3458d1 | 38df9e48f51350499edc257477570c3ef535dff3 | refs/heads/master | 2021-01-11T07:23:26.299454 | 2016-10-25T18:07:08 | 2016-10-25T18:07:08 | 71,832,208 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,024 | cpp | main.cpp | #include <iostream>
#include "Chromosome.h"
#include "Population.h"
int main() {
// float a1[] = {1.1,4.5,8.6,9.2};
// float a2[] = {4.2,6.7,2.8,5.3};
//
// Chromosome* c1 = new Chromosome(4);
// Chromosome* c2 = new Chromosome(4);
//
// c1->setChromosome(a1);
// c2->setChromosome(a2);
//
// for ... |
2eb33c98e4db2b0ee96a1a6dfbedc8f71b6d1465 | c2484df95f009d516bf042dca93857b43a292333 | /codeforces/round314/b/main.cpp | 15f139c6f4f21d27bcda75f3d30237d9ccb42245 | [
"Apache-2.0"
] | permissive | seirion/code | 545a78c1167ca92776070d61cd86c1c536cd109a | a59df98712c7eeceabc98f6535f7814d3a1c2c9f | refs/heads/master | 2022-12-09T19:48:50.444088 | 2022-12-06T05:25:38 | 2022-12-06T05:25:38 | 17,619,607 | 14 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 653 | cpp | main.cpp | // codeforces round314
// http://codeforces.com/contest/567/problem/B
#include <iostream>
#include <cstdio>
#include <set>
using namespace std;
int main() {
set<int> s;
char c;
int n, in, maxi = 0;
scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
scanf("%c %d\n", &c, &in);
if (c ==... |
55f15e83e9e254c4c49d9ce9e304030290868b7e | 1ee4d0cfe6d309cea35f0e658c7f1c31b4ec9669 | /Source/LabelledSlider.h | 5ab235598b4e8619217e2e59fd8c678152910c1d | [
"MIT"
] | permissive | iomeone/WeirdDrums | 53417416f4a0850af4bbe664a792623c5faeae69 | 6b2cd2525913109d05ab08bcaf559189b8ea529d | refs/heads/master | 2020-06-07T02:46:21.198856 | 2019-04-12T09:46:22 | 2019-04-12T09:46:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 800 | h | LabelledSlider.h | /*
==============================================================================
LabelledSlider.h
Created: 5 Mar 2019 8:38:02am
Author: dfila
==============================================================================
*/
#pragma once
#include "../JuceLibraryCode/JuceHeader.h"
class LabelledSli... |
461fd394329a67555f46a2173a99c3fe08b05bca | fa04d2f56c8d4ebfb931968392811a127a4cb46c | /trunk/Cities3D/src/StandardRules/DrawRobberObject.cpp | 0259a6376e0930098d59398d40fbbfc1f4430973 | [] | no_license | andrewlangemann/Cities3D | 9ea8b04eb8ec43d05145e0b91d1c542fa3163ab3 | 58c6510f609a0c8ef801c77f5be9ea622e338f9a | refs/heads/master | 2022-10-04T10:44:51.565770 | 2020-06-03T23:44:07 | 2020-06-03T23:44:07 | 268,979,591 | 0 | 0 | null | 2020-06-03T03:25:54 | 2020-06-03T03:25:53 | null | UTF-8 | C++ | false | false | 8,766 | cpp | DrawRobberObject.cpp | /*
* Cities3D - Copyright (C) 2001-2009 Jason Fugate (saladyears@gmail.com)
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the License, or (at your option)
*... |
7c9456ace5749557a5d3fffe7f1ad8775703aa09 | 88f1ecced6c151aa8f313db7d457ebd4aec5ec7f | /MultipleFileClass/MultipleFileClass/Graph.cpp | dc9e9ac4aa49e0486c59a2c1660cce6479402e67 | [] | no_license | kalyanramu/LocalGitRepo | a99f239a4d3bb71fe820f67064bf265fbbe47a53 | d73c4c95b07988ac1ba3b1093c24efd0c05b37cd | refs/heads/master | 2021-01-19T11:03:09.682042 | 2013-11-06T17:38:43 | 2013-11-06T17:38:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,092 | cpp | Graph.cpp | #include "Graph.h"
//Graph Building Functions
Graph::Graph()
{
numEdges = 0;
}
Graph::Graph(std::ifstream& infile)
{
//std::ifstream infile;
//Create vector of vertices
std::list<edge> temp;
G.push_back(temp); //Dummy Node at Index 0
numEdges =0;
std::string line;
while(getline(infile,line))
U... |
75ae0ca1d48e931be01950af9f418c2d2397a865 | bb136f87f824362abba620f5cb131f5ed77d7c3c | /Galactic Wars/Enemy.h | d30400418fb4912354d3ae96e2fcd4fa0690e5ac | [] | no_license | Matematyk0606/Galactic-Wars | 7f2d546af756d1f2d8968bb1534ccfe9339e34ac | 6009a5e18b59335146585b2a2cf63742a68b843d | refs/heads/master | 2021-06-24T12:00:27.411445 | 2020-10-16T15:26:53 | 2020-10-16T15:26:53 | 141,497,922 | 0 | 0 | null | null | null | null | WINDOWS-1250 | C++ | false | false | 591 | h | Enemy.h | #pragma once
#include <SFML/Graphics.hpp>
#include "GraphicsController.h"
#include "Animation.h"
#include "Weapon.h"
using namespace std;
using namespace sf;
class Enemy : public Sprite
{
public:
Enemy();
Enemy(string texturePath, unsigned int HP);
~Enemy();
int getHP();
float getSpeed();
void setHP(int newHP... |
280407e65af6f60e33ef2f54504d3cc25107e916 | 75db4c12f2fc91bbcb2e51ea570a51d2c4b411b1 | /448. Find All Numbers Disappeared in an Array.cpp | 432db385df616b69d1ebb2bdb30bf72bd7c7bb7b | [] | no_license | OnlyCaptain/leetcode | 1465a8400755faaa23543920ead1c4e439f9107e | 4726e9c5619f0972d82aabe73257a9af857f86e6 | refs/heads/master | 2021-06-14T03:47:04.660278 | 2021-03-30T13:26:33 | 2021-03-30T13:26:33 | 176,669,597 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 604 | cpp | 448. Find All Numbers Disappeared in an Array.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
for (int i = 0; i < nums.size(); i ++) {
if (nums[i] == 0) continue;
int last = nums[i], tmp;
while (last != 0) {
t... |
f23fdc09a5aef93a64091627891f2392fc51c04b | 6ea344a7d8a7daab89f78f60a12b2b6a9b338796 | /src/gc.cc | be91d100d62bab4a29bfb1bbaeba9996fa13d1bf | [
"MIT"
] | permissive | diogogmt/candor | f65cdcc27de00a724e6277ebb93897fabc2a2a35 | 3ed508733748287d2b28d7f7f5658194264b4177 | refs/heads/master | 2020-04-08T04:51:34.966423 | 2012-03-09T21:19:53 | 2012-03-09T21:19:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,716 | cc | gc.cc | #include "gc.h"
#include "heap.h"
#include "heap-inl.h"
#include <sys/types.h> // off_t
#include <stdlib.h> // NULL
#include <assert.h> // assert
namespace candor {
namespace internal {
void GC::GCValue::Relocate(char* address) {
if (slot_ != NULL) {
*slot_ = address;
}
if (!value()->IsGCMarked()) value()-... |
431bd61677d8420b33f3fcd953bb5b39ff4c9e48 | f198fa595f780616ca302c07a249009556e0795b | /2.adder/monitor.cpp | cad5435badc1674de47024df68b5cf22e8b88600 | [] | no_license | fluency03/SystemC | 8a71eaee4ac2f9fe464ad27b2293e7df57a6b923 | 6a546e4bc71e71051085a1241b82d8606dd16d4f | refs/heads/master | 2021-01-10T11:42:03.956221 | 2015-11-04T10:51:08 | 2015-11-04T10:51:08 | 41,821,236 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 197 | cpp | monitor.cpp | // monitor.cpp
#include "monitor.h"
void Monitor::printout(){
while (true) {
wait();
cout << "a = " << a << "; ";
cout << "b = " << b << "; ";
cout << "c = " << c << "; " << endl;
}
}
|
22cbe185b839999e425fbdd5fd85383e5d7e254a | 3fad361d88f16393b4688cb23ac894d1d72e958c | /Product/Implementation/product.cpp | 964548203cad72027abeb762e93e452a9aa0f8bc | [] | no_license | Gardahadi/Engisfarm | 86ed39813605587d8d6a9b91881acafc7fa77812 | b2d40bb3f5014d093d556af0ff44d2ccd0f2dc03 | refs/heads/master | 2020-05-07T14:36:27.047163 | 2019-04-10T14:45:29 | 2019-04-10T14:45:29 | 180,601,506 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 116 | cpp | product.cpp | #include "../Header/product.h"
int Product::getHarga(){
return harga;
}
int Product::getID(){
return id;
} |
535ae3d5d2d94dc9796d5433dcef459f921e7e63 | a0dce37339bf2e60d7ddff5b1b9346e364a04bc8 | /myq5.cpp | bcdcc2040bcdd343e70c9ed84696bbc6be3e8598 | [] | no_license | archiver/spoj | c0dfdc2bfea0c4d811ee0b95dce83c720bea3eae | ac78437594b4ff062db886d03db2a7192478b603 | refs/heads/master | 2020-05-18T00:58:53.697941 | 2013-01-18T22:00:38 | 2013-01-18T22:00:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 461 | cpp | myq5.cpp | #include <stdio.h>
using namespace std;
#define N 1001
#define PRIME 1000000007
typedef unsigned long long ull;
ull comb[N][N];
ull sumb[N][N];
void compute()
{
int i,j;
for(j=0;j<N;++j)
{
for(i=0;i<j;++i)
sumb[i][j]=1L;
}
for(j=1;j<N;++j) //value of k
{
for(i=j;i<N;++i) //value of n
... |
aa9645ba2f8371570fa3804fbd6f43e4e22edc86 | 66b72447770c0848f8f9b89c2d4c2473fb9a0581 | /0551.student_attendance_record_i_E.cpp | 771874c11ba5593b71ab66720dfcea086d9d55ed | [] | no_license | zvant/LeetCodeSolutions | 5d27a25dbc0ec522bde61d436f88e81c67e1367a | ca2c7959c3ea8912abc0be5575272479a5ef3cb0 | refs/heads/master | 2022-09-21T06:26:17.520429 | 2022-09-08T02:40:16 | 2022-09-08T02:40:16 | 140,584,965 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 703 | cpp | 0551.student_attendance_record_i_E.cpp | /**
* https://leetcode.com/problems/student-attendance-record-i/description/
* 2017/05
* 3 ms
*/
class Solution
{
public:
bool checkRecord(string s)
{
int len = s.length();
int absent = 0;
for(int idx = 0; idx < len; idx ++)
{
if(s[idx] == 'A')
{
... |
778ae2b340e6de5173bd8628e2dfc72cb42b3bd0 | d8dde07d7c9cf75f7f18a91ab1dd74a4a261a9e7 | /contest/TheWaySoFar-Training/2011-Daejeon/J.cpp | 7fb753101d62fc284e4da4b4bf70d41a4093ce9a | [] | no_license | tiankonguse/ACM | 349109d3804e5b1a1de109ec48a2cb3b0dceaafc | ef70b8794c560cb87a6ba8f267e0cc5e9d06c31b | refs/heads/master | 2022-10-09T19:58:38.805515 | 2022-09-30T06:59:53 | 2022-09-30T06:59:53 | 8,998,504 | 82 | 51 | null | 2020-11-09T05:17:09 | 2013-03-25T04:04:26 | C++ | UTF-8 | C++ | false | false | 1,469 | cpp | J.cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
map <int,int> m1,m2;
const int MAXN=1000002;
typedef map<int,int>::iterator IT;
typedef pair<int,int> point;
point c1[MAXN],c2[MAXN];
int main(){
int T;
//freopen("1.txt","r",stdin);
scanf("%d",&T... |
bbcdc982e143979daab18895cd3dfb89ebdbe3b6 | f5d86f2d06ef811a934b9d9d6d2b9a9ad0e59e76 | /src/Lattice/CSELatticeNode.cpp | 09d5c2d56e5a2ce79e97d0872ac92c6cd9db5b5f | [] | no_license | XavierWang/llvm | cc48e9f8ed61872286259c76bd8a85712020ce4c | 4dfe2781fe6f3368ad53321750b3d2657ae6e5d3 | refs/heads/master | 2021-01-14T08:54:48.855122 | 2015-12-13T03:30:49 | 2015-12-13T03:30:49 | 47,491,322 | 0 | 0 | null | 2015-12-06T09:55:06 | 2015-12-06T09:55:05 | null | UTF-8 | C++ | false | false | 1,955 | cpp | CSELatticeNode.cpp | #include "../../include/Lattice/CSELatticeNode.h"
LatticeNode* CSELatticeNode::join(LatticeNode* node){
if (node->isBottom){
return this;
}
if (this->isBottom){
return node;
}
CSELatticeNode* cseNode = dyn_cast<CSELatticeNode>(node);
map<Value*, Instruction*> statements1 = this->statements;
map<Value*, Inst... |
a68b5a3cac8f0f25d47831f47a03d86b2227170a | 8cdb51622a7f330968293dcd82db5e18cd376b9c | /include/CPVFramework/Http/ApiDocs.hpp | c71378eb8379c0c62bf033a434bfa501b3c9e04e | [
"MIT"
] | permissive | Lwelch45/cpv-framework | 90930d4ffc75bfe3e6f9f6271a2556fb750adcca | 11f3e882cd3bdec1c4a590f09148c21705b21f60 | refs/heads/master | 2020-03-18T23:11:31.042662 | 2018-05-16T00:58:43 | 2018-05-16T01:43:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 81 | hpp | ApiDocs.hpp | #pragma once
#include "./Server/api_docs.hpp"
#include "./Server/json_path.hpp"
|
bf49d7f6181b0d9d868378f6cadc48483856bc87 | 17e9a5bbf3f3500e90e305d98d4d49e46428c455 | /library/messageutils.cpp | be1da980c7570edfbd17e5578bc966dc1e5332eb | [] | no_license | thundercat/challenge0 | cc41491930d13f3a94dc51f0b998cabaf4d4a813 | 44f5047c1f44eb513262471f1ed84e5079c03f94 | refs/heads/master | 2021-05-17T23:10:35.036891 | 2020-03-29T09:36:19 | 2020-03-29T09:36:19 | 250,995,306 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 26 | cpp | messageutils.cpp | #include "messageutils.h"
|
f7a9c7e7b482d60b9e1b77c2e29d75b3944ac7f4 | bb92586c3accb07b99b5004d719434fd018bd135 | /Algorithm/sorting/radix_sort.hh | eedfcf0d902ebce6af0793c570d0c5176253dab6 | [] | no_license | lc19890306/Exercise | 4a6070296aadb021d35dfae54d9352c289b9c2db | 153f73c015a9c64aa35aa440fce926c1d26f76c8 | refs/heads/master | 2021-07-17T21:01:15.881080 | 2021-02-19T15:34:55 | 2021-02-19T15:34:55 | 40,798,802 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 932 | hh | radix_sort.hh | #ifndef RADIX_SORT_HH
#define RADIX_SORT_HH
#include "functions.hh"
#include <vector>
template <typename ForwardIt>
int
maxBit(ForwardIt first, ForwardIt last) {
auto it(max_element(first, last));
if (it != last) {
auto largest(*it);
auto max_bit(0);
while (largest > 0) {
largest /= 10;
+... |
b74b87d028918bf6e2dbd1fee1a94153d8bbb80a | 75510162401dd325cfd244049a710df7171edbe6 | /Message/Message/poruka.cpp | 706759e3abb5cfec546c0d81b543dad4549109d3 | [] | no_license | bornajelic/Cpp-Projects | 9e4131e3329c6fd281173226bb86df9ab7fabc50 | ae3831243fb2c8a29c365ffa53e2fdb86dc9fdd1 | refs/heads/master | 2020-04-09T00:34:41.375655 | 2019-07-17T13:13:15 | 2019-07-17T13:13:15 | 159,872,944 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,266 | cpp | poruka.cpp | #include "Poruka.h"
#include <iostream>
#include <algorithm>
#include <sstream>
Kategorija::Kategorija(std::string const &opis){
mOpis = opis;
}
Kategorija::~Kategorija()
{
}
void Kategorija::dodaj_poruku(Poruka *p) { //ova funkcija mora biti pozvana automatski sa funkcijojm Poruka::dodaj()
this -> mPo... |
da41eaa3e3be8e9769185a504079675cd7c6d0d4 | 7227c3ea8c7532fec6a0fdcddd280ca9c37e1ffb | /BaekJoon/2178_.cpp | bb6493e6da82fbd6eddbd1c8c846de3ccd10d821 | [] | no_license | Ju-nic2/Algorithm | e326a6ddde9a3a65d4b4d5617be46a39e1d9b65f | e7a1d3023f3a8eb1356475bfee77c9b7f5830d6a | refs/heads/master | 2023-07-11T20:52:41.002233 | 2021-08-23T15:05:23 | 2021-08-23T15:05:23 | 384,132,461 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,648 | cpp | 2178_.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
class maze_search
{
private:
vector<string> map;
vector<vector<int>> visit;
public:
maze_search(const int& x, const int& y)
{
for(int i = 0; i < y; i++)
... |
0ad1f1bf62ee86188a0ce8108513da9709aa339e | 7b4b7201bba88f886b07cb550288220a7d47fbb1 | /유기농 배추.cpp | 639dae2760f0e085907cdc0dcdb53d9de2919a6e | [] | no_license | blockyu/algorithm | 57db1fe5c9aef18b496207904acb7e7e6ff76fd4 | 481156db0961eb583c506c4ff5839caa8a1cb4b7 | refs/heads/master | 2022-09-30T14:18:00.319087 | 2020-06-06T07:41:34 | 2020-06-06T07:41:34 | 269,906,444 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,102 | cpp | 유기농 배추.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int N;
int ROW,COL,K, res;
int arr[51][51];
bool vis[51][51];
int moveR[] = {1,0,-1,0};
int moveC[] = {0,1,0,-1};
void check(int c, int r) {
if(r==ROW || c==COL) return ;
vis[c][r]=true;
for(int i=0; i<4; i++) {
int nextC=c+moveC[i];
... |
dff4324fb801f3e27d92acfadaada68127969a2b | 558b60baaa3379323f123cf784cd83e2c423ccab | /code/rotate.cpp | 48eecaddb13730cd95e3fd0dde1a0765a79680d5 | [] | no_license | RoseHuRan/Multi-functional-Image-Editing | acc7d733d019b111d65c19588b9d746247918880 | 8436198c349109b77c22a8a7636d7d467e70e4db | refs/heads/master | 2020-04-15T16:46:59.985813 | 2019-10-23T04:05:53 | 2019-10-23T04:05:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 842 | cpp | rotate.cpp | #include "rotate.h"
#include <opencv2/opencv.hpp>
#include <opencv2/highgui/highgui.hpp>
#include <stdio.h>
#include <iostream>
using namespace cv;
using namespace std;
Mat rotate(Mat src, int mode) {
Mat dst, dst2, dst3;
switch(mode){
case 1: // Left rotate.
transpose(src, dst);
... |
e2f571aa9c1aeb87b11a9ccf00ae24845ea36345 | f3d7f88c6d006a2cac39cc45c06fe70d6b3868d8 | /MockSensor.cpp | 73e20b60e2519e239a82c9c14cfe4ca173c550d7 | [] | no_license | supox/sprinkler_arm | 1ec45625ac9cda4a99b0d35ffc22e90f977a3a8e | dc4557fdd282c813b987f7e10b63568bb28193a2 | refs/heads/master | 2020-05-20T00:43:42.117886 | 2013-05-01T19:19:15 | 2013-05-01T19:19:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 415 | cpp | MockSensor.cpp | #include "MockSensor.h"
#include <stdlib.h>
MockSensor::MockSensor(const int id, const int port_index, const double sensor_value, ISensorListener* listener) : Sensor(id, port_index, sensor_value, listener)
{
}
MockSensor::~MockSensor()
{
}
SensorType MockSensor::GetType()
{
return MOCK;
}
bool MockSensor::ReadSens... |
48c8d2c0b569b16065c954ac12013e4072d2fc43 | e2629d6fa6060d99463710d6a2b3bdcf5aa8f0b3 | /Day 8 Handheld Halting/d8_2.cpp | a01c36cb0a4562b44c98be27813402e6d926578b | [] | no_license | zigmars/advent-of-code | 2bc5aa96aad48e72dfa3d6bb70eae3c96d62e606 | 4873b073aa81a8bdcfb118074a428ce3e1c9e68b | refs/heads/main | 2023-02-03T08:49:25.584224 | 2020-12-16T10:47:36 | 2020-12-16T10:53:36 | 320,833,119 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,265 | cpp | d8_2.cpp | #include <iostream>
#include <sstream>
#include <set>
#include <vector>
using namespace std;
struct instr {
char op;
int val;
};
using ull = unsigned long long;
struct state {
ull acc;
int pc;
};
vector<instr> program;
set<int> visited;
state s({.acc=0, .pc=0});
bool programTerminates(vector<instr... |
0a48bad96c8bafe220d98e4ed862a55fd1e388b1 | 19ccfd6806c5054679dab3f275822302206b222f | /src/game/shared/voice_status.cpp | 201425268a84631432848f7b2b32f3956a536702 | [
"Apache-2.0"
] | permissive | BenLubar/SwarmDirector2 | 425441d5ac3fd120c998379ddc96072b2c375109 | 78685d03eaa0d35e87c638ffa78f46f3aa8379a6 | refs/heads/master | 2021-01-17T22:14:37.146323 | 2015-07-09T19:18:03 | 2015-07-09T19:18:03 | 20,357,966 | 4 | 1 | Apache-2.0 | 2018-08-30T13:37:22 | 2014-05-31T15:00:51 | C++ | WINDOWS-1252 | C++ | false | false | 16,319 | cpp | voice_status.cpp | //========= Copyright © 1996-2005, Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
// $NoKeywords: $
//=============================================================================//
#include "cbase.h"
#include "basetypes.h"
#include "hud.h"
#include <string.h>
#include <stdio.h>
#include "voi... |
607dc75375bf0fec5548400d89f1e919ba55f56a | 147382a3cdeb93be8df2109cdce43095a7fbccf2 | /trees/958_check_completeness_of_a_binary_tree.cpp | 2dcdc38f25b1ea7b4324433104a5df26ba314ee1 | [
"MIT"
] | permissive | rspezialetti/leetcode | e41803c1e410e7e2327c3e41b935f43e5439b729 | 4614ffe2a4923aae02f93096b6200239e6f201c1 | refs/heads/master | 2020-05-05T00:09:22.753046 | 2019-05-13T14:31:06 | 2019-05-13T14:31:06 | 179,567,170 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 999 | cpp | 958_check_completeness_of_a_binary_tree.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isCompleteTree(TreeNode* root)
{
if(!root)
return false;
... |
e8969cd375e0cd4f6b556c7c68be0f327053561e | 4bcc9806152542ab43fc2cf47c499424f200896c | /tensorflow/tsl/platform/intrusive_ptr.h | 3793ba3e8610ee5f8a93e1a1c9329d1361c8eee1 | [
"Apache-2.0",
"LicenseRef-scancode-generic-cla",
"BSD-2-Clause"
] | permissive | tensorflow/tensorflow | 906276dbafcc70a941026aa5dc50425ef71ee282 | a7f3934a67900720af3d3b15389551483bee50b8 | refs/heads/master | 2023-08-25T04:24:41.611870 | 2023-08-25T04:06:24 | 2023-08-25T04:14:08 | 45,717,250 | 208,740 | 109,943 | Apache-2.0 | 2023-09-14T20:55:50 | 2015-11-07T01:19:20 | C++ | UTF-8 | C++ | false | false | 2,808 | h | intrusive_ptr.h | /* Copyright 2021 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
59167eeeb0f63de3ae5c20e38da4780ec9262ea0 | 79a634d9357a750cbd0efea04d932938e1b7f632 | /Contest/ACM/2010_bak/MULTIPLE_2010/MU Training Host by UESTC 2/MU Training Host by UESTC 2/Imaginary Date/sol_totalfrank.cpp | 9155193fff00c4182b8c18c4fd26716f761ed255 | [] | no_license | hphp/Algorithm | 5f42fe188422427a7762dbbe7af539b89fa796ed | ccbb368a37eed1b0cb37356026b299380f9c008b | refs/heads/master | 2016-09-06T02:24:43.141927 | 2014-05-27T00:49:44 | 2014-05-27T00:49:44 | 14,009,913 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 464 | cpp | sol_totalfrank.cpp | #include <stdio.h>
#include <string.h>
#define MAXN 1000
int a[MAXN];
int main(){
freopen("f:\\1.in", "r", stdin);
freopen("f:\\1.out", "w", stdout);
int t_case = 1, cases;
scanf("%d", &cases);
while(cases--){
int n, m, k, sum = 0;
scanf("%d%d%d", &n, &m, &k);
for(int i = 0; i < n; ++i){
... |
f9147a9d56ef46a52e68ca1e1210eea2b169f734 | 296cd54ecfc92b89799451fc7aae6064db2a2fc1 | /CInputHandle.cpp | 5fd4711434bd219c5d49b83b4e6fd1e6fa7ad30b | [] | no_license | Super-Karl/SDL_Practice | f8b739ad6e70331cce22fb2fbb18c6e2bae229f5 | f9001eff2d5143c971c386787c18696154865212 | refs/heads/master | 2022-12-22T19:05:24.590975 | 2020-09-23T08:15:17 | 2020-09-23T08:15:17 | 297,859,695 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 26 | cpp | CInputHandle.cpp | #include "CInputHandle.h"
|
7dcf65b997c668a352736165fa96bfe0f64c786d | 95e7032edd93613c860f2507f2f210bbf74db26e | /Algoritmos_Grafos/main.cpp | 68b62b3b71bd30c84b311ef4c955357f38bab74b | [] | no_license | Dchengg/Algoritmos_Grafos | 6fb938d54a9e26b760bab9f89cb26a3b4af9169e | c1e33e127f6612fb2411680dc475bfe37dabe4b5 | refs/heads/master | 2020-04-08T12:43:39.844424 | 2018-11-28T04:27:37 | 2018-11-28T04:27:37 | 159,359,046 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,822 | cpp | main.cpp | #include <QCoreApplication>
#include <algoritmos.cpp>
#include <QFile>
int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
while(1){
qDebug()<<"ingrese el path del archivo que contiene la matriz : ";
string input;
std::cin >> input;
QString path = QString::fromS... |
055ee327565287ed7edf53f9478438ae2b24fb88 | ff5b783d7dd6bc66345c119f091f60149e3dc283 | /pthreads/mutex.cc | e99ab16c660de91698f4af933d3bf92ed669cee2 | [] | no_license | wp4613/tests | 0faa85ebde5b58538c181f5f22c21fb6d738e1ec | 20489062e503c1162a23e1d1bed77d39e762905b | refs/heads/master | 2020-03-18T13:36:53.311579 | 2015-12-23T19:45:48 | 2015-12-23T19:45:48 | 134,795,700 | 1 | 0 | null | 2018-05-25T02:57:53 | 2018-05-25T02:57:53 | null | UTF-8 | C++ | false | false | 745 | cc | mutex.cc | #include <pthread.h>
#include <string.h>
#include <iostream>
pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
int main(int argc, char *argv[])
{
int rc = pthread_mutex_lock(&mutex);
if (rc != 0) {
std::cout << "error locking mutex: " << rc << "; system message: " << strerror(rc) << std::endl;
... |
301374eb7cf4f0c43b313cb9cabd5056311d9b7e | f61bb2133a9f149febae0dac34e00f7e627822a9 | /Graficos II/DLL/Shape.cpp | 8ab7e91318f10969f1c5b2a03798736895d631f3 | [] | no_license | Lithiot/Graficos-II | 35673d328693294462608414b01d1260c5dd90cc | 3330eefe5d9e362f4ec27dea5b8a24d5cc503c89 | refs/heads/master | 2021-06-29T18:15:48.682390 | 2019-08-06T03:54:22 | 2019-08-06T03:54:22 | 144,927,528 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 852 | cpp | Shape.cpp | #include "Shape.h"
Shape::Shape(Renderer* rend) : Entity(rend)
{
material = NULL;
vertexes = NULL;
vertexColors = NULL;
vertexUVTexture = NULL;
vertexBufferID = -1;
colorBufferID = -1;
textureBufferId = - 1;
textureUVBufferId = -1;
shouldDispose = true;
}
Shape::~Shape()
{
}
void Shape::S... |
5f148236ae046b5353132ddb4da2eeb5832110b7 | 78ad8daf752bde132b03ea25640a94a86bd212cf | /boiler.ino | 8ca5b943a10b79a765e44abe08adff66ce9acd81 | [
"MIT"
] | permissive | nsadovskiy/boiler | 69d7c244d5ffcc0da6416e0c7be9635854904559 | 24985e2759476c66d62597afdfb490436a541f0d | refs/heads/master | 2020-04-02T09:19:04.939006 | 2018-10-23T10:48:08 | 2018-10-23T10:48:08 | 154,287,152 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,095 | ino | boiler.ino | #include "LiquidCrystal_I2C.h"
#include "cactus_io_DS18B20.h"
#include "settings.h"
#include "heater_mode.h"
#include "temp_range.h"
#include "pipe.h"
#include "electro_regime.h"
#include "coal_regime.h"
#include "electro_heater.h"
volatile int wait_tick = 0;
DS18B20 ds(9);
LiquidCrystal_I2C lcd(0x27, 16, 2);
pipe_t ... |
9d7babbca0af49381c1fae166fd520cc65a1548d | 94ccd13d597dcdc844e6af80fd1ed5665bcbd059 | /Prophecy/Prophecy/src/Prophecy/Core/Base.h | ece7f7b62ba86592f52ae4b120f782ef8171a83d | [] | no_license | johnnymast/Prophecy | 4ec3796e9d82c75f64e7abf861bcf2531570107a | 3025faeeb0b3df216b05771bdc783e7246687caa | refs/heads/master | 2022-11-26T10:04:08.117201 | 2020-06-30T02:12:23 | 2020-06-30T02:12:23 | 272,237,842 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 643 | h | Base.h | #pragma once
#include <memory>
#define BIT(x) (1 << x)
#define HZ_BIND_EVENT_FN(fn) std::bind(&fn, this, std::placeholders::_1)
namespace Prophecy {
template<typename T>
using Scope = std::unique_ptr<T>;
template<typename T, typename ... Args>
constexpr Scope<T> CreateScope(Args&& ... args)
{
... |
3b72d457f8f1ac2e962bb03b13bb18a63c3d3166 | 10f91ad3a4b7f273ef7d981c113ad17c218745b7 | /src/placeable/placeable.h | 3b601f4c70716d72becc3d8a4ff76c0989f0b2f6 | [] | no_license | VictorCarlquist/RedMoon | 74a28a1e8b1273f89212e3852d23c8e5534da3b4 | ea1eddf3a29f68d760980c2a42c554afe32afbc8 | refs/heads/master | 2021-01-02T08:56:46.158397 | 2014-02-02T00:52:37 | 2014-02-02T00:52:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 847 | h | placeable.h | #include <lua5.2/lua.hpp>
#ifndef __placeable_H__
#define __placeable_H__
namespace red
{
class Rplaceable
{
public:
Rplaceable(){
this->lx = this->ly = this->lz = 0;
this->rx = this->ry = this->rz = 0;
}
void setLoc(float x,float y,float z);
void s... |
c83934ca90d3035097f0c2b85bfdd2143e9712f3 | e0548caf7bd8153f8d991b7d7c1bed487402f0bc | /semestr-2/Programowanie/2020/podstawy-programowania-5/ćwiczenia/zad01.cpp | 2bc126adbecd7f80f30079a7eac06e8f51fd91c1 | [] | no_license | Ch3shireDev/WIT-Zajecia | 58d9ca03617ba07bd25ce439aeeca79533f0bcb6 | 3cd4f7dea6abdf7126c44a1d856ca5b6002813ca | refs/heads/master | 2023-09-01T11:32:12.636305 | 2023-08-28T16:48:03 | 2023-08-28T16:48:03 | 224,985,239 | 19 | 24 | null | 2023-07-02T20:54:18 | 2019-11-30T08:57:27 | C | UTF-8 | C++ | false | false | 1,211 | cpp | zad01.cpp | // Zadanie 1
// Napisz program który sortuje bąbelkowo dowolną podaną ilość liczb rzeczywistych. podawanie liczb kończy naciśniecie klawisza "esc". Posortowane liczby zapisuje do pliku i dodatkowo wyświetla je na ekranie za pomocą printf.
#include <iostream>
#include <vector>
#include <string>
using namespace std;
te... |
918c89a3fd1318e697bd484cf64d1429fde1f26f | 6bcc59b991641987630b4b729d2ea86492e53854 | /vulkan-solar-system/src/engine/Application.h | b35ad7d08ca3d38d2bc5af0efcd59ab187dce6a4 | [
"MIT"
] | permissive | LucidSigma/vulkan-solar-system | 302d60fbc7c63cfd6a2a195e99ed17dd5b65ef4c | b30d36049be177575501d9d6274eb3b80241f7bd | refs/heads/master | 2022-10-08T20:56:51.869448 | 2020-06-02T08:36:26 | 2020-06-02T08:36:26 | 268,712,098 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,278 | h | Application.h | #pragma once
#include "utility/interfaces/INoncopyable.h"
#include "utility/interfaces/INonmovable.h"
#include <cstdint>
#include <json/json.hpp>
#include "graphics/renderer/Renderer.h"
#include "input/InputManager.h"
#include "scene/Scene.h"
#include "utility/Config.h"
#include "utility/SceneManager.h"
#include "w... |
b752d1647af03c376d1648433dff3a738e0b1b21 | 154170bb6acb3e17a863dfae5c6c4411665daec5 | /tests/runtime_tests/SExpressionTests.cpp | 2ff0ede11f6721d5c4773a51fa8ca82530f6e958 | [
"Apache-2.0"
] | permissive | smacdo/Shiny | 8d076824013d0fb7d94bdf351e10aee18013f61b | 580f8bb240b3ece72d7181288bacaba5ecd7071e | refs/heads/master | 2021-07-11T21:59:43.263042 | 2021-04-11T18:25:37 | 2021-04-11T18:25:37 | 23,687,447 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,254 | cpp | SExpressionTests.cpp | #include "runtime/SExpression.h"
#include <catch2/catch.hpp>
using namespace Shiny;
TEST_CASE("Default initialize atom S-Expression", "[SExpression]") {
SExprAtom a{};
REQUIRE(a.value().isEmptyList());
}
TEST_CASE("Create a atom S-Expression with a value", "[SExpression]") {
SExprAtom a{Value{23}};
REQUIRE(V... |
7e21294f5841bd6d7dd51d8bf31dcdcae77729e0 | d40cd56de69419989761e01255b868f36bcb5caa | /include/mapdrawer.h | 5dc698f8c55d637802f8a6e62de3f0780852e195 | [] | no_license | koval4/DarkAsteroids | 974f31ab1f382928ed6cff51ae4939e5d7392e0c | 62d09bae6cfba2f08a92cbff31a3abba0d4aa8ff | refs/heads/master | 2020-05-21T04:35:58.485559 | 2018-07-21T11:06:34 | 2018-07-21T11:06:34 | 56,937,818 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 339 | h | mapdrawer.h | #ifndef MAPDRAWER_H
#define MAPDRAWER_H
#include "ui/screen.h"
#include "ui/gui.h"
#include "tile.h"
#include "map.h"
class MapDrawer {
private:
const uint8_t tiles_horizntally;
const uint8_t tiles_vertically;
public:
MapDrawer();
void draw_map(Tile::ptr center) const;
};
#en... |
250d8bef6ff62ff0f794d67a5232948bcf15956a | fe6c1528174ee96ad662fbdf52fb2ebd072bc55c | /Turbo/Camera.cpp | 91fe6846fe672d13c893121bd33c8b74ec2a64c3 | [] | no_license | just3obad/Turbo-Final | ae8973bee1f5872df86e99c45e14a8090fcede68 | 5902206b515913d68665fc1e7f44190e6c3a0b0d | refs/heads/master | 2021-01-10T09:32:16.355090 | 2016-02-08T21:25:24 | 2016-02-08T21:25:24 | 51,302,618 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 951 | cpp | Camera.cpp | // #include "stdafx.h"
#include "Camera.h"
#include "gtc/matrix_transform.hpp"
Camera::Camera()
{
_position = glm::vec3(1, 0, 0);
_up = glm::vec3(0, 1, 0);
_look = glm::vec3(0, 0, 0);
_near = 0.1f;
_far = 5000.0f;
_xang = 0.5f;
_yang = 0.0f;
_fov = 45.f;
_aspect = 4.0f / 3.0f;
}
glm::mat4 Camera::getCamera()... |
26e0c7cf266c4538e1d80aa3f5f7218d30bd4de2 | dfd413672b1736044ae6ca2e288a69bf9de3cfda | /chrome/common/temp_scaffolding_stubs.cc | 936e35bf3306f5531dc1b3c2cecd57bc3c597bc3 | [
"BSD-3-Clause"
] | permissive | cha63506/chromium-capsicum | fb71128ba218fec097265908c2f41086cdb99892 | b03da8e897f897c6ad2cda03ceda217b760fd528 | HEAD | 2017-10-03T02:40:24.085668 | 2010-02-01T15:24:05 | 2010-02-01T15:24:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,871 | cc | temp_scaffolding_stubs.cc | // Copyright (c) 2009 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/common/temp_scaffolding_stubs.h"
#include <vector>
#include "base/gfx/rect.h"
#include "base/logging.h"
#include "chrome/browser/au... |
6f1c2228904ebab9741dee16d761de895bf52447 | 8097da7acfa8fb56dd8d4df9a68f6557a62821cc | /BACnet/ISO 8859-1.cpp | 6bdadab81d6ae0065628f035009713ef20dbba07 | [] | no_license | rtsking117/BACnet | 367453aac59721f0cafad77a5227f1a3c11031d2 | ff70361244a0d692ae3fd852d1290fd97d89070e | refs/heads/master | 2020-03-16T12:34:20.112602 | 2018-11-05T04:46:01 | 2018-11-05T04:46:01 | 132,669,956 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 789 | cpp | ISO 8859-1.cpp | #include "ISO 8859-1.h"
//This table is actually Windows-1252. We interpret C1 control
//characters as their Windows-1252 counterparts, as they are rarely
//used in text, and more commonly text labeled as 8859-1 is actually
//Windows 1252 (enough such that HTML 5 mandates Windows 1252 instead
//of ISO 8859-1, even wh... |
2eec45059be7b77b06ab82d0b19f3a467de85c3b | eda03521b87da8bdbef6339b5b252472a5be8d23 | /Meta/Lagom/Tools/CodeGenerators/JSSpecCompiler/AST/AST.h | 77df78963f64baabe102376a7464dbac38356ca2 | [
"GPL-1.0-or-later",
"BSD-2-Clause"
] | permissive | SerenityOS/serenity | 6ba3ffb242ed76c9f335bd2c3b9a928329cd7d98 | ef9b6c25fafcf4ef0b44a562ee07f6412aeb8561 | refs/heads/master | 2023-09-01T13:04:30.262106 | 2023-09-01T08:06:28 | 2023-09-01T10:45:38 | 160,083,795 | 27,256 | 3,929 | BSD-2-Clause | 2023-09-14T21:00:04 | 2018-12-02T19:28:41 | C++ | UTF-8 | C++ | false | false | 6,853 | h | AST.h | /*
* Copyright (c) 2023, Dan Klishch <danilklishch@gmail.com>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <AK/RefCounted.h>
#include <AK/RefPtr.h>
#include <AK/Vector.h>
#include "Forward.h"
namespace JSSpecCompiler {
template<typename T>
RefPtr<T> as(NullableTree const& tree)
{
retu... |
42c4847772ec2664316b0e3a9b8c49fa69c51eb2 | bcce0782e6f2d2ac2c9589370886d7e2d2fd4643 | /jump.h | ac5e61c3963efa3b8b49fc5daa783efcdd7e4aed | [] | no_license | janmal8359/practice_TeamMonster | d5b46916e88d6d01e3dd94ebd1bb0f1c9b7daf2a | 927633aeb50a6ad4151b8f7f88e5456e35b4e630 | refs/heads/master | 2023-07-05T06:57:14.154679 | 2021-07-29T08:41:59 | 2021-07-29T08:41:59 | 388,361,904 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 356 | h | jump.h | #pragma once
#include "stateManager.h"
#define JUMPPOWER 12.0f
#define GRAVITy 0.08f
class jump : public stateManager
{
private:
public:
virtual HRESULT init(); //초기화 함수
virtual void release(); //메모리 해제 함슈
virtual void update(); //연산하는 함수
virtual void render(); //그리기 함수
virtual void move();
}; |
8ce16008452bc72d943563b0534d2d729727d13d | 1472dcb5a3244a51154f798666d0330ff32c68f5 | /src/taSerializeHistogram.h | 7b10bfef655dc01de5ffe14a470aaff720db623e | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference",
"BSD-2-Clause"
] | permissive | Osprey-DPD/osprey-dpd | 3961ca5c0fe89514299812ded9c8c16a5f049987 | d6e9bb6771e36c36811ef2d9405f9e287bb5f1c5 | refs/heads/main | 2023-06-11T08:49:06.866378 | 2023-06-08T14:23:39 | 2023-06-08T14:23:39 | 308,352,022 | 22 | 3 | NOASSERTION | 2023-06-08T14:23:41 | 2020-10-29T14:23:30 | C++ | UTF-8 | C++ | false | false | 2,072 | h | taSerializeHistogram.h | // taSerializeHistogram.h: interface for the taSerializeHistogram class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_TASERIALIZEHISTOGRAM_H__C98CF226_94E1_4607_9670_655AF9E0EBDF__INCLUDED_)
#define AFX_TASERIALIZEHISTOGRAM_H__C98CF226_94E1_4607_9670_655AF9E0EBDF__INCLUDED... |
5339394bbec8b66c7075c8faadc174d377c201af | daf28dc6c26d812e0d0e36294390a3d33ac0afae | /src/libraries/serial_test_lisai.hpp | 85aafd23eaedbdaba0f67047b3afb54c26473ead | [] | no_license | Ashes17b/NIST_tests | 2dd8746cc367219305744f5aac2218a4d0d11700 | dfe9281dfeea5fc19da1ffa35346e585aa050b6a | refs/heads/master | 2020-05-25T17:01:18.487951 | 2019-06-08T17:12:54 | 2019-06-08T17:12:54 | 187,899,547 | 0 | 0 | null | 2019-06-08T16:55:57 | 2019-05-21T19:19:02 | C++ | UTF-8 | C++ | false | false | 972 | hpp | serial_test_lisai.hpp | #pragma once
#include "serial_test.hpp"
#include "cephes.h"
namespace serial_test {
using bytes = std::vector<uint8_t>;
class Serial_test_lisai : public Serial_test {
public:
Serial_test_lisai() = default;
Serial_test_lisai(const Serial_test_lisai &serial_test_lisai) = default;
... |
52576a0a1d9f1cd2915135fb2a158727fd8e4489 | 1c657691b0a0a7c871fb51ba1ed676aa7c2ac7b1 | /Allocator/Blod_test.cpp | 20d8e97474f3d146aa373b5fe65c6b07b17a06b4 | [] | no_license | chenyu1927/hello-world | d15fa125b08ec4c49219a8a91284c195f1302730 | 382556c394b4748836136d6bcbb7fa0c99229157 | refs/heads/master | 2021-03-19T11:22:58.154780 | 2016-09-28T07:36:40 | 2016-09-28T07:36:40 | 27,222,531 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 409 | cpp | Blod_test.cpp | #include <iostream>
#include "Blod.hpp"
using std::cout;
using std::endl;
int main(void)
{
Blod<int> i = {4, 6, 7, 8, 9};
cout << "size=" << i.size() << endl;
try
{
cout << i[5] << endl;
}
catch (std::out_of_range& e)
{
cout << e.what() << endl;
}
std::vector<int> vec(5, 6);
Blod<int> v(vec.begin(), v... |
444a32a70ea29b331b360c6a38648c2544c57044 | 4296ad62fc2d1c0111af5e9c9ef5b8336256674e | /src/dwango_2015_prelims3/c.cpp | 05420310705ed45a4021e2b2aa1cbaf16b18a90a | [] | no_license | emakryo/cmpro | 8aa50db1d84fb85e515546f37e675121be9de5c2 | 81db478cc7da06a9b99a7888e39952ddb82cdbe5 | refs/heads/master | 2023-02-09T12:36:47.893287 | 2023-01-23T12:07:03 | 2023-01-23T12:07:03 | 79,899,196 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,490 | cpp | c.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
#ifdef DBG
void debug_(){ cout << endl; }
template<typename T, typename..... |
e8bb15f8a6cb57114dfe97c178641c7a7223b3fa | 7c8f7ee315e10a719a39d90dd6b8b39978820049 | /globals.hpp | 99ceed9f18ccf136ed24645594b53d9d1e8bb58e | [] | no_license | wldarden/Auto | 9e7087f8696645b7899240bfa16e05aa8e6d39cf | 7dc34384bcd706f504059f6459abdf43cc8efde5 | refs/heads/master | 2020-05-21T10:12:25.540425 | 2016-11-22T19:36:03 | 2016-11-22T19:36:03 | 70,082,593 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 245 | hpp | globals.hpp | //
// globals.hpp
//
//
// Created by Will Darden on 10/3/16.
//
//
#ifndef globals_hpp
#define globals_hpp
enum Menu { MAIN, CREATE, REPORT, SAVE, LOAD };
enum Part_type { ARM, BATTERY, HEAD, LOCOMOTOR, TORSO };
#endif /* globals_hpp */
|
2e7f26d573751ea6425c278688570268b9eab56f | 1dbf007249acad6038d2aaa1751cbde7e7842c53 | /dds/include/huaweicloud/dds/v3/model/AddReadonlyNodeRequestBody.h | 36a6b320320183745a3b3c1e1885f8aeacae6d4f | [] | permissive | huaweicloud/huaweicloud-sdk-cpp-v3 | 24fc8d93c922598376bdb7d009e12378dff5dd20 | 71674f4afbb0cd5950f880ec516cfabcde71afe4 | refs/heads/master | 2023-08-04T19:37:47.187698 | 2023-08-03T08:25:43 | 2023-08-03T08:25:43 | 324,328,641 | 11 | 10 | Apache-2.0 | 2021-06-24T07:25:26 | 2020-12-25T09:11:43 | C++ | UTF-8 | C++ | false | false | 2,511 | h | AddReadonlyNodeRequestBody.h |
#ifndef HUAWEICLOUD_SDK_DDS_V3_MODEL_AddReadonlyNodeRequestBody_H_
#define HUAWEICLOUD_SDK_DDS_V3_MODEL_AddReadonlyNodeRequestBody_H_
#include <huaweicloud/dds/v3/DdsExport.h>
#include <huaweicloud/core/utils/ModelBase.h>
#include <huaweicloud/core/http/HttpResponse.h>
#include <string>
namespace HuaweiCloud {
nam... |
97ec5ae06e91273a1c5af3794362277315be6db5 | e9959db2910d129964a4c445acf03c3a029a3839 | /geakit/src/api/grepositoryapi.h | 6b23f85f6bc01240075baf4b148f68623e29cd9a | [] | no_license | ypvk/geakit | f5f6abc027d3e4cb99eaf8630d6900db2ad11ec5 | 664d78d1839f1b1d1a51a2f92d6d547bf8444701 | HEAD | 2016-09-05T14:15:59.239285 | 2012-09-28T08:06:00 | 2012-09-28T08:06:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 963 | h | grepositoryapi.h | #ifndef GREPOSITORYAPI_H
#define GREPOSITORYAPI_H
#include <QObject>
#include <QHash>
#include <parser.h>
#include <serializer.h>
class QNetworkAccessManager;
class QNetworkReply;
class QTimer;
class GRepositoryAPI : public QObject
{
Q_OBJECT
public:
typedef enum {SUCCESSFUL, ERROR, TIMEOUT} ResultCode;
pub... |
7b24ca0f496fabd0de769e26203d5612fdeac5b3 | 3d02679788bdcde3ad2ecfea7bb2f66e37c1e270 | /space Shooter/space Shooter/Player.cpp | cb58bb8205b89c91aca33d505fa8371d1077231d | [] | no_license | prabhs226c/space-shooter | f31fc21e60666fb2917cdfbb9096daecde95b3a5 | 8c8dd3a2866efb32e47f01b441aef19c3d4ebaa5 | refs/heads/master | 2020-07-23T17:41:00.676449 | 2019-09-10T20:02:32 | 2019-09-10T20:02:32 | 207,651,669 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 737 | cpp | Player.cpp | #include "Player.h"
Player::Player(int _score) :Ship(10, 3, "A",100, 100) {
int score = _score;
}
void Player::detectInput() {
int step = 1;
char key = ' ';
getInput(&key);
//x = UIKit::whereX();
//y = UIKit::whereY();
if (key == 'D' || key == 'd') { // move right
if (xPos < 210)... |
6d6416f4d120adbdbd63fe50931bd9d6d8b4c685 | 082b362705c6c23f5f29dacdff7aa8bc397b6e37 | /GeoTempCore/Source/GeoTempLoaders/Public/OSM/IParserOsm.h | b23a8434a0c472565612f9c4a565a77e3971a83c | [
"MIT"
] | permissive | interactivevislab/GeoTempPlugins | eeabb2728bedee96bd54fbfa75535e4fe1578794 | 5c650769cbdb22931fc0e221bd7a3233a56c202a | refs/heads/master | 2021-04-20T10:55:33.651759 | 2020-05-20T22:20:55 | 2020-05-20T22:20:55 | 249,676,605 | 9 | 0 | MIT | 2020-05-28T11:27:13 | 2020-03-24T10:21:23 | C++ | UTF-8 | C++ | false | false | 533 | h | IParserOsm.h | #pragma once
#include "CoreMinimal.h"
#include "UObject/Interface.h"
#include "OsmReader.h"
#include "IParserOsm.generated.h"
UINTERFACE(BlueprintType)
class GEOTEMPLOADERS_API UParserOsm : public UInterface
{
GENERATED_BODY()
};
/**
* \class IParserOsm
* \brief Interface for parsing OSM data.
*
* @see UOsmRea... |
c4a63afe46fd2ba4708a92c6b3e0e72e1f79fcc6 | 5fd2cc9da56f8645651f8a264aad0dc771998283 | /DroneSphere/Weather.h | 0a5d5ed1d128ae4ec40524108c0c1b03a81e51e4 | [
"MIT"
] | permissive | wamsai1096/DroneSphere | 5e388634be0a0c30adbf36d41c589681de598dad | f9c285424771b26f2f4a8b655d3c2904f80f8d7c | refs/heads/master | 2021-06-18T16:28:26.797833 | 2017-07-03T02:41:22 | 2017-07-03T02:41:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 483 | h | Weather.h | #pragma once
#include <iostream>
#include <string>
#include "thing.h"
using namespace std;
void Weather_Test();
class WeatherOperation
{
public:
virtual string GetName() = 0;
virtual void SetAlias(string alias) = 0;
virtual string GetAlias() = 0;
};
class Weather : public Thing, public WeatherOperation
{
publ... |
340585b87d571f748393e8c7508137eeded5caf9 | f73eca356aba8cbc5c0cbe7527c977f0e7d6a116 | /Glop/glop3d/Camera.h | efd0e665b1f9dad6c8722995944deda31f15d158 | [
"BSD-3-Clause"
] | permissive | zorbathut/glop | 40737587e880e557f1f69c3406094631e35e6bb5 | 762d4f1e070ce9c7180a161b521b05c45bde4a63 | refs/heads/master | 2016-08-06T22:58:18.240425 | 2011-10-20T04:22:20 | 2011-10-20T04:22:20 | 710,818 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,563 | h | Camera.h | // The most basic tools for rendering in 3d.
//
// Camera - A viewpoint combined with field of view and near+far planes.
// CameraFrame - A GlopFrame that executes the virtual function Render3d after setting up the
// view matrices for rendering a 3d scene.
#ifndef GLOP_GLOP3D_CAMERA_H__
#define GLOP_GLO... |
817ad22e8962d51a30e8ce32b6fd680757e192a5 | ac82758a30d9b440473209e35e40e3ccf364444f | /Übungsaufgaben/A08/Code/6_c.cpp | c18e7ce73491f917a178812596227c1a4645ffe1 | [] | no_license | PaulOxxx1/DSAL-Arbeitsverzeichnis | e2eacb68ec07e6a10f240b67aa595244eff52b77 | 72442f472f0505571e8fa1c65de27ed95bdf6f8c | refs/heads/master | 2021-11-11T05:40:45.426744 | 2021-10-28T12:33:07 | 2021-10-28T12:33:07 | 129,533,636 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 157 | cpp | 6_c.cpp | void function(int n) {
a = 1;
b = 1;
for (int i=0;i<n;i++) {
a = a*3;
b = b*n;
}
k = a + b;
for (int i=0;i<k;i++) {
print();
}
} |
43879c2570707d8b8c4ae647a40891cf1b40fd94 | 61d564820f8a0ee90aba330ceb26f11cca789004 | /367ValidPerfectSquare/main.cpp | 7dfae406df82e844931719f10dc8536b15df923a | [] | no_license | xiaoniaoyou/leetcode | 37bd48af36d29e1c8b01632bcf899b59245fcd11 | 56871a3eea53c85bfd892e87b268bf4535df3816 | refs/heads/master | 2020-04-29T03:58:12.807119 | 2019-03-26T09:26:11 | 2019-03-26T09:26:11 | 175,830,500 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 982 | cpp | main.cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
// bool isPerfectSquare(int num) {
// int left = 1;
// int right = num / 2 + 1;
// while (left <= right) {
// if (left * left == num || right * right == num) {
// return true;
// ... |
5d3a1e423ef92209f9c78cbc569b76b61f294dfc | eed8026f1f9d9f56c4d536b9403d1ff50567af8a | /JzOffer/栈的压入、弹出序列.cpp | 3354329c17ca79b9b338c651477d8180b864505d | [] | no_license | atmqq1990/JzOffer | f1ef36749e58f57b2e0159b3e9e697ce853bc0a0 | ba240e91b44f9473364d97f28863700622c3af8e | refs/heads/master | 2021-01-10T21:23:43.621669 | 2015-08-11T09:33:10 | 2015-08-11T09:33:10 | 40,455,544 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 755 | cpp | 栈的压入、弹出序列.cpp | #include<iostream>
#include<vector>
#include<stack>
using namespace std;
class Solution {
public:
bool IsPopOrder(vector<int> pushV, vector<int> popV) {
stack<int> st;
int len = pushV.size();
if (len == 0)
return false;
int pushindex = 0;
int popindex = 0;
while (popindex < len)
{
while (st.empty(... |
2a0e16386c02c12767814ae6cb991d1589e7f0dc | 2f2b6d74fff26bbecb37be2df79cae6c2e0a4650 | /PControl.h | 38ff658a71fbae7efd274ee2b6bd0bc977ddee80 | [] | no_license | Svalburg/OpenVPN-FuzzTool | 4f775f61e72e9a28706cda5002b110928f9793b3 | 233dac47c4a32f34605f03c42a47db7214fcf3dd | refs/heads/master | 2020-03-19T00:51:51.054528 | 2018-05-30T23:09:57 | 2018-05-30T23:09:57 | 135,506,372 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,389 | h | PControl.h | #ifndef PCONTROL_H
#define PCONTROL_H
#include <stdio.h>
using namespace std;
class PControl
{
public:
PControl(unsigned char packet[]);
void toPacket(unsigned char* buff);
int packetSize();
void setLength(unsigned short newLength);
unsigned short getLength();
void setOPcode(unsigned short newOPcode);
... |
443ee64d3e3dd015393dc927888ef4b975422c08 | 0ef2d152ff5d5ef919c4f918d595bd0b0139fdce | /src/loop011.cpp | f32f287bb635f9037f06d5e313db34d31b84728f | [
"MIT"
] | permissive | TannerRogalsky/Demoloops | db576caade9d59c33a1caa449a9f511eb2ae9700 | 13cb7c4b1bba892c24ddb8bbd78f4953b9c9a9d5 | refs/heads/master | 2021-01-11T01:02:11.887620 | 2018-03-18T19:11:58 | 2018-03-18T19:11:58 | 70,442,271 | 4 | 0 | MIT | 2018-03-18T15:38:48 | 2016-10-10T01:47:02 | C++ | UTF-8 | C++ | false | false | 1,735 | cpp | loop011.cpp | #include <numeric>
#include "demoloop.h"
#include "graphics/3d_primitives.h"
#include <glm/gtx/rotate_vector.hpp>
#include "hsl.h"
using namespace std;
using namespace demoloop;
static const uint16_t NUM_VERTS = 60;
const uint32_t CYCLE_LENGTH = 3;
static const float RADIUS = 0.3;
class Loop11 : public Demoloop {
pub... |
af97b527ca60baf63ae57913cdb09dda53dcf506 | 9e4a00de1ec07e7e88872ef60c42a49bf65dc2b0 | /Code/Projects/Eld/src/SDPs/sdpeldhudcalibration.h | d89906537168fd1a8286f9af4f24614867d08a4d | [
"Zlib"
] | permissive | ptitSeb/Eldritch | 6a5201949b13f6cd95d3d75928e375bdf785ffca | 3cd6831a4eebb11babec831e2fc59361411ad57f | refs/heads/master | 2021-07-10T18:45:05.892756 | 2021-04-25T14:16:19 | 2021-04-25T14:16:19 | 39,091,718 | 6 | 4 | NOASSERTION | 2021-04-25T14:16:20 | 2015-07-14T18:03:07 | C | UTF-8 | C++ | false | false | 403 | h | sdpeldhudcalibration.h | #ifndef SDPELDHUDCALIBRATION_H
#define SDPELDHUDCALIBRATION_H
#include "SDPs/sdpeldhud.h"
class SDPEldHUDCalibration : public SDPEldHUD
{
public:
SDPEldHUDCalibration();
virtual ~SDPEldHUDCalibration();
DEFINE_SDP_FACTORY( EldHUDCalibration );
virtual void SetShaderParameters( IRenderer* const pRenderer, Mesh* ... |
e94ed1eca0c4562f3583cfc56d21a9388424dda2 | 4b60702bd7494f3e818d80238449742696a440ae | /nbproject/classes/Market.h | 4dd6517abe87278574adea0568fbe5f339736ecb | [] | no_license | allada/BitcoinTradeEngine | ef06a38a575839bb31c44ae42d3aa28204c5acf3 | fc735645ef2e4a0344d8149a5a22c7970e8a59aa | refs/heads/master | 2021-01-13T01:46:09.598002 | 2014-06-21T21:46:25 | 2014-06-21T21:46:25 | 14,997,366 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 958 | h | Market.h | /*
* File: Market.h
* Author: allada
*
* Created on December 6, 2013, 5:44 PM
*/
#ifndef MARKET_H
#define MARKET_H
#define ORDER_SORT_GROUP_COUNT 20
class Market;
#include <vector>
#include <iostream>
#include <string>
//#include "ClassList.h"
#include "Currency.h"
#include "Transaction.h"
#include "Order.h"
... |
33deb2984a6389521d401fe53eaf5d407f0e796c | 8b0f051f8a3f01a9a0346cd25c509bd3dbf5c44d | /SGui/Color.h | 394aacede2617f6bff92dedae7e474620ea1b0af | [] | no_license | southor/torso-gui | feddcc599d85a5c012b6bb5e390a5c4102ad8c27 | 7cbce9266fbc81a30a2e3c14607a0066e6d79940 | refs/heads/master | 2021-06-06T06:38:20.678921 | 2020-04-26T20:14:52 | 2020-04-26T20:14:52 | 34,624,748 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,289 | h | Color.h | #ifndef _STATE_GUI_COLOR_H_
#define _STATE_GUI_COLOR_H_
#include "functions.h"
namespace SGui
{
template <typename T> struct Color3
{
typedef T value_type;
T r, g, b;
Color3();
Color3(const T& bw);
Color3(const T& r, const T& g, const T& b);
Color3(const char *str);
explicit Color... |
6beed9c52e4427b12cfbb4844ce057859cdb7b4e | 3af68b32aaa9b7522a1718b0fc50ef0cf4a704a9 | /cpp/C/D/A/A/C/ACDAAC.h | 5fee7d53f102a550d1fdbe5610a285248c1ca931 | [] | no_license | devsisters/2021-NDC-ICECREAM | 7cd09fa2794cbab1ab4702362a37f6ab62638d9b | ac6548f443a75b86d9e9151ff9c1b17c792b2afd | refs/heads/master | 2023-03-19T06:29:03.216461 | 2021-03-10T02:53:14 | 2021-03-10T02:53:14 | 341,872,233 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 67 | h | ACDAAC.h | #ifndef ACDAAC_H
namespace ACDAAC {
std::string run();
}
#endif |
3a33d334689ac5ba8e3955410d604f0cacd9ad0d | 81262b0a5975e4e63d431cfdf9946f8a6e12475a | /CodeFiles/CodeBank/TreeQuesAma.cpp | bdfa453ac661fafcb611dde6e48ed658f5f80700 | [] | no_license | IsCoelacanth/CodeBase | 90c9f129e45ea9e9450ac145a57176b2919f918d | b57baf87f0c2c02006b5b2d3d62dec8b8a007483 | refs/heads/master | 2021-01-18T13:16:36.240464 | 2017-09-13T14:48:21 | 2017-09-13T14:48:21 | 100,374,361 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,595 | cpp | TreeQuesAma.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<vector<ll> > vvll;
typedef pair<int,int> pint;
typedef map<int,int> mint;
#define MOD 1000000007
struct Node
{
int val;
Node *left, *right;
};
... |
fe8b87418177aba536c9a5dc2c5da83e07d65512 | 967cca660f2aa06f1cefff8f5696435a228d18ce | /NetworkInterface.cpp | 16136dcc208c37d0a9bba2d480863bec6efd1707 | [] | no_license | smjiang/server | 2b3e3f71c8c0ceccc8a9d0cfb093fa3e8a252c94 | bdee5cf03d9ed63f5f342bdfe565de4f3e6c242b | refs/heads/master | 2021-01-01T15:31:29.823350 | 2015-09-18T06:01:08 | 2015-09-18T06:01:08 | 38,676,972 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 34,696 | cpp | NetworkInterface.cpp | #include <unistd.h>
#include <errno.h>
#include "NetworkInterface.h"
#include "IniFileParser.h"
#include "Log.h"
#include "Tools.h"
#include "Json/json.h"
#include "PeerGroup.h"
#define MAXEVENT 100000
CNetworkInterface* CNetworkInterface::m_instance = NULL;
CNetworkInterface::CNetworkInterface()
{
}
C... |
9cb586a282244085afc37f338bf57cecf0466a22 | 5c87811a523d0b9e1ab968a3dcddf58af875fa84 | /engine/enginecode/include/platform/windows/winTimer.h | 31d461908e7819881e5726a568ebef7db71a4958 | [] | no_license | tinitis0/Game-Engine-Architecture | d548e314e0e37b7753227f457cdd10c0d8d65deb | 30339088ad7ac0c08acef4cb1fa6347bd5c9d06f | refs/heads/main | 2023-06-21T04:04:38.806144 | 2021-07-21T21:55:55 | 2021-07-21T21:55:55 | 388,253,458 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,026 | h | winTimer.h | /*! \file winTimer.h */
#pragma once
#include <Windows.h>
#include "core/timer.h"
namespace Engine
{
/** \file WinTimer.h
* Windows specific timer which use queryPerformanceCount
*/
class WinTimer : public Timer
{
public:
virtual void start() override
{
QueryPerformanceFrequency(&m_frequency);
QueryPe... |
95cbafd6e844b78ec14f208c261939a912848ef3 | 38a80dd6d1cc52c623d3ac05a113f181ca39611e | /engine/flyai.h | 8d2bebfdcf1d9ebd8145efdb328fc71c462a6881 | [] | no_license | StanislavKraev/fliezzz | cc374958e1f829e372d8ece037647d5262253b5b | 1cfbb95ed7ecf57d8bf657fe561b3df81f260ccc | refs/heads/master | 2020-05-18T11:30:26.876552 | 2015-05-22T21:17:37 | 2015-05-22T21:17:37 | 35,785,254 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,782 | h | flyai.h | #ifndef FLYAI_H
#define FLYAI_H
#include <QObject>
#include "engine/creatureai.h"
#include "engine/movedirection.h"
class QStateMachine;
class QState;
class QFinalState;
namespace engine
{
class IGameDataProvider;
class IMovesHolder;
class FlyAI: public QObject, public CreatureAI
{
Q_OBJECT
public:
const ... |
1e502e823311ac985e3bac1cac276a0fabdb0372 | dada0dd0f3004fe5178c752a633c8f027e92dec9 | /Codeforces/Ladder-A/1453a.cpp | ff92f6a588b09a0310fa07aea981bb28d8f04381 | [] | no_license | scortier/Snippets | 0a64d72a1ab1d3d2e15730b608f49c259b4dc6de | 51a3be8eb1cc3eb5688c431efe37bb6fd862b5e7 | refs/heads/master | 2023-06-29T00:38:59.232780 | 2021-08-04T13:26:25 | 2021-08-04T13:26:25 | 261,730,451 | 6 | 1 | null | 2020-09-30T19:15:57 | 2020-05-06T10:52:42 | C++ | UTF-8 | C++ | false | false | 1,576 | cpp | 1453a.cpp | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define test int tt;cin>>tt;while(tt--)
#define fl(i,a,b) for( int i=a;i<b;i++)
#define bfl(i,a,b) for( int i=b-1;i>=a;i--)
#define ll long long int
#define pb push_back
#define mp make_pair
#define f firs... |
9599229ee8a7266261651708e71f046fba6c7a32 | 433277e9e2599864ff6c0370b3c543dab92c478d | /C++/54_Spiral_matrix.cpp | a707d6db48090a868c45f2aa2aa77f8566e9f673 | [] | no_license | MihawkHu/leetcode | 1d0619624d9b0e9c8cf6320bc7763485e8610402 | 37e17b5b26b692214fe5b7660b19367c0876a461 | refs/heads/master | 2021-01-14T07:55:26.479252 | 2017-02-27T15:23:06 | 2017-02-27T15:23:06 | 81,967,938 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,359 | cpp | 54_Spiral_matrix.cpp | class Solution {
public:
void zyj(vector<vector<int>>& matrix, vector<int>& ans, int x, int y, int k) {
if (2*k == matrix.size() || 2*k == matrix[0].size()) return;
if (2*k+1 == matrix.size()) {
for (int i = 0; i < matrix[0].size() - 2*k; ++i) {
ans.push_back(matrix[x][y+... |
188197bad92f5cf9d921636d009fbc88b926ab80 | 30315827c02c257bc98407d61fcd0251fcea351c | /tinyserver/src/utils/common_tool.cpp | 9013b60f671ad417ec07db7e0d39d2baa94968ba | [] | no_license | aihao1007/tinyserver | 9b79f26bed002e8f84cdcedf48d9143b183812f0 | b91cc82e31748970e3182c7e8c38e9013ee91466 | refs/heads/master | 2022-01-10T12:55:57.612708 | 2019-05-05T12:47:39 | 2019-05-05T12:47:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 463 | cpp | common_tool.cpp | //
// Created by hhk on 18-12-19.
//
#include "utils/common_tool.h"
long WebServer::get_file_size(FILE *f) {
long size = -1;
long cur = ftell(f);
if (f != nullptr) {
fseek (f, 0, SEEK_END);
size = ftell (f);
fseek (f, cur, SEEK_SET);
}
return size;
}
long WebServer::get_fi... |
59fd4b577269869513bb2345922379bb5289c4fe | 7d048d2b11062bb016662ba4a8bf9646b471c7fc | /source_trunk/source/Algorithms/RandomForest/GPURandomForest/GPURandomForest.h | 29eb48413f21845468639fb8a649af55283bf99c | [
"MIT"
] | permissive | KarlJansson/GPU_tree-ensembles | d414f227ca5aea17dc4247b758d9eb61096360d5 | 531d0e49db7d4c0102a999314c172c722249d8e8 | refs/heads/master | 2021-01-02T08:33:07.284509 | 2017-06-14T08:06:42 | 2017-06-14T08:06:42 | 13,192,291 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 4,056 | h | GPURandomForest.h | #pragma once
#include "IAlgorithm.h"
namespace DataMiner{
class GPURandomForest : public IAlgorithm{
public:
GPURandomForest(GraphicsManagerPtr gfxMgr);
~GPURandomForest();
struct SharedBuffer{
unsigned int cb_numTrees;
unsigned int cb_numFeatures;
unsigned int cb_maxDepth;
unsigned int cb_curren... |
aeb32928ffb21b52ab02dbcc90b92f96165aa960 | 7aa75d5591937fc1e4bf10d3f676038bc9a77bb3 | /rsp/FileList.h | c5401eeee901c14d73c4ca27bedf492c13245f10 | [
"MIT"
] | permissive | lsycool/rsp | 45fbc90d1dc0c2e3070f83ebb8bc2dd15ac600a1 | b4bc62b19679291338fd7516709911c6fed23e5a | refs/heads/master | 2020-04-15T19:47:42.808615 | 2016-09-14T02:22:26 | 2016-09-14T02:22:26 | 68,163,290 | 3 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,134 | h | FileList.h | #pragma once
using namespace std;
// CFileList 对话框
class CFileList : public CDialogEx
{
DECLARE_DYNAMIC(CFileList)
public:
CFileList(CWnd* pParent = NULL); // 标准构造函数
virtual ~CFileList();
CString filename;//记录文件名
CString projection;//投影
int bandcount;//波段数
float pixel;//分辨率
BOOL isAdded;//是否已经添加
vector<C... |
8651caf2517a766499e7623c284b5b1f6b0415f6 | 56ea93b31bea2467a39b4814bd0a12b822797e9b | /common/src/combatnode.hpp | 2f1a7ad9fa17daa5f5f499de39f2f6231d9f1672 | [] | no_license | etorth/mir2x | 924ff4f76fec2bce502cd8cdc12c7a607b99c2f7 | f31ce2a12dfa3fc64fb8e002f30562f964cbd43e | refs/heads/master | 2023-08-08T11:44:08.509299 | 2023-07-24T04:54:17 | 2023-07-24T04:54:17 | 59,230,985 | 294 | 159 | null | 2022-06-09T21:55:56 | 2016-05-19T18:17:03 | C++ | UTF-8 | C++ | false | false | 1,537 | hpp | combatnode.hpp | #pragma once
#include <array>
#include <utility>
#include <cstdint>
#include <cstdlib>
#include <cinttypes>
#include "serdesmsg.hpp"
#include "protocoldef.hpp"
struct CombatNode
{
int dc[2] = {0, 0};
int mc[2] = {0, 0};
int sc[2] = {0, 0};
int ac[2] = {0, 0};
int mac[2] = {0, 0};
int dcHit =... |
fea63a8125b5f8f7e2ae0b6e42c315960ed6d962 | 20c86d7c831ab9c0fca389d494a1e15825b71160 | /C/syntax/SyntaxToken.cpp | 1223167d1c8a8b9ccad9804a33be4c69deaa0ef7 | [
"BSD-3-Clause"
] | permissive | ltcmelo/psychec | a747d0eb08806fcc6d054c91635b198d6c3ac25c | fe1dabb6e85c4cabf0c623721d82f665b7d94216 | refs/heads/master | 2022-07-28T03:20:15.250911 | 2022-07-23T19:38:16 | 2022-07-23T19:38:16 | 73,128,877 | 503 | 39 | BSD-3-Clause | 2022-07-23T19:33:29 | 2016-11-07T23:02:46 | C++ | UTF-8 | C++ | false | false | 10,071 | cpp | SyntaxToken.cpp | // Copyright (c) 2016/17/18/19/20/21/22 Leandro T. C. Melo <ltcmelo@gmail.com>
// Copyright (c) 2008 Roberto Raggi <roberto.raggi@gmail.com>
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Softw... |
a3f237577014df5187307c989c52930cd392b973 | 3f609d4009fdb13324ce2f8ae45dc2b81308a645 | /include/Motor.h | 0639d790bb0240a151797b5c9d32f57025dc3af6 | [] | no_license | milossekulic/Rent-A-Car | 71c707f9b47652923fa172c431e2122185da16f4 | 4247f0d9985e3f27930fe24aecf6d6f6318b721d | refs/heads/main | 2022-12-30T02:49:59.278616 | 2020-10-13T19:51:33 | 2020-10-13T19:51:33 | 303,813,233 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 256 | h | Motor.h | #pragma once
#include"Automobil.h"
class Motor : public Vozilo {
private:
int ubrzanje;
public:
Motor(string nazivVozila, string markaVozila, int ubrzanje, int cenaIzdavanja);
int getUbrzanje();
void setUbrzanje();
};
|
b5391c32fc64fb41a3d9582fd0a26e8d2f3fcad3 | a8aee5f44a2302da7109b456094b811e9b298b5d | /src/node_red.cpp | 5dbaf188fa516e1d7c3d4c8bf1a448fed9a338b0 | [] | no_license | AlexandreRio/garden-watering | f7d986cc77d97b6f1e66b222cd47accfe73fcbe8 | 9818e92f7da15383c1f86fda984fe87c73a352c2 | refs/heads/master | 2022-04-22T01:01:59.294329 | 2020-04-26T15:34:08 | 2020-04-26T15:34:08 | 259,067,113 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,602 | cpp | node_red.cpp | #include "node_red.h"
/**
* Water the plants for a given duration
* @param duration : Duration to water in second
*/
void water(unsigned long duration)
{
Serial.println("Begin to water");
digitalWrite(16, LOW);
digitalWrite(5, HIGH);
delay(duration*1000);
digitalWrite(16, HIGH);
digitalWrite(5, LOW);
... |
b951b136c6369747d07a3683c1e4bee604b9b207 | 9cef10603a76280976732d899773efc5f72bbda6 | /beaker/type.hpp | 41e83d6dead7d19493764d5411d771f398b15c76 | [
"Apache-2.0"
] | permissive | thehexia/beaker | f02be601aa22d50cc55456ed9fe37606adee4630 | ca6c563c51be4a08d78e4eda007967bc4ae812a2 | refs/heads/master | 2020-12-26T03:33:00.746911 | 2015-11-23T20:32:50 | 2015-11-23T20:32:50 | 45,311,808 | 0 | 0 | null | 2015-10-31T17:42:04 | 2015-10-31T17:42:04 | null | UTF-8 | C++ | false | false | 4,101 | hpp | type.hpp | // Copyright (c) 2015 Andrew Sutton
// All rights reserved
#ifndef BEAKER_TYPE_HPP
#define BEAKER_TYPE_HPP
#include "prelude.hpp"
// The Type class represents the set of all types in the
// language.
//
// t ::= bool -- boolean type
// int -- integer type
// (t1, ... |
1a265ec5d1548a6bf29d434a07d4780ea8b84652 | daa0e9d968884202e2d4cc6769a8a1fe060e5e84 | /GfG_Codes_C++/Searching/11_Two_Pointer2.cpp | ca8f292fe6b333144d981da6c7e6ccf2ed6d8370 | [] | no_license | Ankit1dubey/Hacktoberfest-Accepted | 03ecab59d10f934b8b5ed6f2d65c9a64692e2cff | cd2d8a55b7c62d8d56165a74e717ab4733bcdae7 | refs/heads/main | 2023-08-22T07:24:14.105087 | 2021-10-30T16:42:51 | 2021-10-30T16:42:51 | 422,935,434 | 2 | 0 | null | 2021-10-30T16:36:39 | 2021-10-30T16:36:39 | null | UTF-8 | C++ | false | false | 1,252 | cpp | 11_Two_Pointer2.cpp | #include <bits/stdc++.h>
using namespace std;
/* bool isPair(int arr[], int l, int r, int x)
{
while(l < r)
{
if(arr[l] + arr[r] == x)
return true;
else if(arr[l] + arr[r] > x)
r--;
else
l++;
}
return false;
}
bool find3Number(int arr[], int n... |
415434cab61cd25da2bb75912d3562af4c028fb3 | 346c0fa613484c9561f8f409b8640b6027b27ec8 | /Non_static_usual/include/maxmixture_factor.h | 44ba71c42775c8892356e373a992d6f1b88f1267 | [] | no_license | CSautier/SLAM | e845a8ff1edd2662db2fe7033a865b01c5b3d703 | da18e6a8446dd1d020ccdc45488026385418d53a | refs/heads/master | 2020-05-24T17:17:44.430271 | 2019-05-18T16:29:16 | 2019-05-18T16:29:16 | 187,380,451 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,348 | h | maxmixture_factor.h | /**
* Copyright 2019 Massachusetts Institute of Technology
*
* @file maxmixture_factor.h
* @author Kevin Doherty
*/
#pragma once
#include <vector>
#include <gtsam/nonlinear/NonlinearFactor.h>
#include <math.h>
#include <algorithm>
namespace maxmixture {
/**
* @brief GTSAM implementation of a max-mixture f... |
2a3b97dde96ffcc7d03a689dd25c4c61e0bb98f5 | 0e5e0239f8c0b7ccacc19fb746a046981952cc30 | /Render.UWP/EnumDescriptionCoverter.cpp | df4e0667d085ff125d000a9699b82cf7fa8ec469 | [] | no_license | vivekbhadra/Computational-Finance | 612948b003276f3b1e4cc7ff0e24850bc922b30c | b9f7103ccbdcc8a1971e32d8e1d83bf28aa10c7d | refs/heads/master | 2023-03-20T06:51:29.602424 | 2018-12-30T15:36:01 | 2018-12-30T15:36:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 646 | cpp | EnumDescriptionCoverter.cpp | #include "pch.h"
#include "EnumDescriptionCoverter.h"
using namespace Platform;
using namespace Windows::Foundation;
using namespace Windows::Foundation::Collections;
using namespace Windows::Globalization::NumberFormatting;
using namespace RenderEngine::Converters;
EnumDescriptionCoverter::EnumDescriptionCoverter(... |
eff5dc2831cb06455c85708ee8291921b1889c93 | 27c2e2a0e336f8918bc3b42340c1931366306ce5 | /plugins/agent_plan/Plan1.cpp | 4d49b4b9309656a1255c24a82c929f326fcc22ef | [] | no_license | jackbergus/socialsim | 0da12fdabeef77dffbc19d76d57452ed9a5cc628 | 3dffa1c360eed9698934153d64a7f4cf80e17915 | refs/heads/master | 2016-09-06T05:40:51.804313 | 2014-07-14T12:18:53 | 2014-07-14T12:18:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,596 | cpp | Plan1.cpp | /*
* Plan1.cpp
* This file is part of socialsim
*
* Copyright (C) 2014 - Giacomo Bergami, Elena Tea Russo
*
* socialsim is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, ... |
ce0fd2083bb0ec1dd3bbe3ff4cf1cdee57686036 | 2c5c5d92271e15cc203b999a7078496072277839 | /SDS011_DHTxx/SDS011_DHTxx.ino | 01b6fa48aee14d58371abc4dbd3f4467a8f0e84f | [] | no_license | Colkerr/Mobile-Air-Sensor | 7473126ce8124c4060002a7ff39f1d26fc7bc6c7 | 1e91ee566a0c80727e1d287218fbbc7d0fb99191 | refs/heads/master | 2020-06-26T16:31:51.718216 | 2019-08-20T16:28:11 | 2019-08-20T16:28:11 | 199,686,149 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,853 | ino | SDS011_DHTxx.ino |
//Save sensor readings to flash memory until reboot when broadcast wifi to allow ftp, deletion and date/time input
//Using Deep Sleep so wakes evey time into setup() and any only persistence is by using RTC memory
#define Sensor_User "sensor_user" //<<<<<<<<<<<<<<<<<<< NOTE change these and possibly others... |
396789e33fcd2bcbf91124064d825c406cc973c6 | 34b228253c19b156af54ed332daab7a24c20daf0 | /CString/CString.cpp | 247fa0d77ba0472b39b13c787073000f8ee96168 | [] | no_license | xTCry/CString | 83b35ed6275236f1da1eb4ffc4fa90b019db7524 | 641570f8103aae568a564e58a382cfc68883a4e0 | refs/heads/master | 2023-01-11T22:37:15.532742 | 2020-11-18T10:02:38 | 2020-11-18T10:02:38 | 313,891,149 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,243 | cpp | CString.cpp | #include "CString.h"
CString::CString() : pStr(new char[1]) {
pStr[0] = '\0';
}
CString::CString(char* str) {
pStr = new char[strlen(str) + 1];
if (str == nullptr) {
pStr[0] = '\0';
}
else {
// копируем символы в pStr из str[] используя strcpy_s
strcpy_s(pStr, strlen(str) ... |
dab318543d2c7fdbc2fbc792c1812d34c141ed18 | bc7651210ee5a59ba79f95e038185fe235418c4f | /um+younghan.cpp | 6bfd7368314869e7f65516a13d98853e2e74fcc1 | [] | no_license | seoyh0812/TeamLaunge2 | 3f81b2eed4ee32c771d979e77c84fdd6b9e6080f | e1498ee31dde3cfc8e853ca97f273b390551f009 | refs/heads/master | 2023-03-21T09:38:27.688056 | 2021-03-22T01:11:02 | 2021-03-22T01:11:02 | 332,584,817 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 85 | cpp | um+younghan.cpp | #include "stdafx.h"
#include "unitManager.h"
void unitManager::younghanUpdate()
{
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.