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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cc422acda0dca587f4f1930417bd0c57132034d8 | f608a08bb7a238e26e6335335fa8b1e065d8d7ef | /Open62541CppWrapper/MVC/AbstractModelObserver.hh | 8a47d221bb732d1c5068f29ce4ba6d6eafa28438 | [
"BSD-3-Clause"
] | permissive | Servicerobotics-Ulm/Open62541CppWrapper | fb93c612b322bb658e5f0fb749e45b536a0cf421 | 710d3bb76c82d6ae3d4707a2785236eb6924770f | refs/heads/master | 2021-07-05T18:42:19.616089 | 2020-10-30T08:55:28 | 2020-10-30T08:55:28 | 200,660,396 | 5 | 4 | BSD-3-Clause | 2019-09-09T07:41:57 | 2019-08-05T13:26:27 | C++ | UTF-8 | C++ | false | false | 1,556 | hh | AbstractModelObserver.hh | //--------------------------------------------------------------------------
// Code generated by the SmartSoft MDSD Toolchain
// The SmartSoft Toolchain has been developed by:
//
// Service Robotics Research Center
// University of Applied Sciences Ulm
// Prittwitzstr. 10
// 89075 Ulm (Germany)
//
// Information abo... |
a76ed9d9c78e9484c3db4562cc93c827ad798581 | 630e9438530e5b15353cc9b7c013889fa0f7e80d | /C++/CS1580/Lab10/lab10_functions.cpp | 9e3e7702679cd5e61d5a0483634219d8241a91da | [] | 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 | 1,107 | cpp | lab10_functions.cpp | /*
Programmer: David Gardiner, 12447993
Instructor: Rushiraj
Section: E
Date: 10/26/16
File: lab10_functions.cpp
Description: Function defintions to encrypt a given name using an NTCA.
*/
#include <iostream>
#include <cctype>
#include "lab10.h"
using namespace std;
void greeting()
{
cout << "Welcome to the Enigma M... |
cd80f42b9bca7630bc5a37d38c3c05ccb050344c | 88bb5d5d01507cdab698087f03b669ec2f336663 | /base/queue/queue_dic_comm.h | 6c30cfc2d054e9047480c8bcd79ddda9f1e7da8b | [] | no_license | flaght/mylib | 419d246e2d8e9b8acbc9a607d236cb2c2c32eb2c | 389d61e76ee8a9ca4eaad86421bed86a6bc8a97f | refs/heads/master | 2021-06-18T17:21:00.207043 | 2019-07-14T06:16:21 | 2019-07-14T06:16:21 | 51,120,734 | 0 | 3 | null | 2017-08-21T08:41:12 | 2016-02-05T02:21:52 | C++ | UTF-8 | C++ | false | false | 678 | h | queue_dic_comm.h | /*
* queue_dic_comm.h
*
* Created on: 2015年1月3日
* Author: kerry
*/
#ifndef QUEUE_DIC_COMM_H_
#define QUEUE_DIC_COMM_H_
#include "config/config_info.h"
#include <list>
namespace base_queue{
class QueueDicComm{
public:
QueueDicComm();
~QueueDicComm();
public:
static void Init(std::list<base::ConnAddr>& a... |
2f68729d1f5ac17fa588c0dc2ce4115ba7e466a7 | d8f7532fea9ccc4276cd22544b6da28d769d1158 | /Relay.h | a05aa66c2ee8b29d47c793554f8c3c5d696666e0 | [] | no_license | nikuz/ivy-esp32 | 58cbc2859c19a6c2a7d59418bec0122bbb6eeb20 | 9d68469a6b42be4c3aabcca08028401780bddaba | refs/heads/master | 2020-05-30T17:56:54.156892 | 2020-05-17T16:49:46 | 2020-05-17T16:49:46 | 189,886,805 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 439 | h | Relay.h | #ifndef Relay_h
#define Relay_h
#include <Arduino.h>
class Relay {
public:
Relay();
~Relay();
static void parseSerialCommand(const char *command, const char *param);
// heating
static bool isHeatingEnabled();
static void heatingOn();
static void heatingOff();
// watering
st... |
66e450438705d7aafdd08a735c8c9355300d8b50 | a49df76344a106c8e6cf7badf3d2ee5d0f203c05 | /oldone/client/getViewer.cpp | d3cf33bf161afdcf2f5b263d6631cdd183721575 | [] | no_license | wangfeilong321/osgSystem | a5c2b5e08660255087cd4da5464c9b3ad7e07071 | c47e2be610353545e167ad8c043adcf7b661c22a | refs/heads/master | 2020-06-20T20:59:14.731227 | 2016-09-19T07:55:22 | 2016-09-19T07:55:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,970 | cpp | getViewer.cpp | #include "client.h"
using namespace std;
bool return_flag = false;
PickHandler::PickHandler(int *sockfd) {
client_sockfd = sockfd;
}
float * PickHandler::getpickArray() {
return pickArray;
}
void PickHandler::getMessage()
{
/*if(pickArray[0] != 16) {
for(int i=0;i<5;i++) {
cout<<pickArray[i]<< " "... |
ba381dcd0cf1cb171f85c5b2315370f3c69c380a | 6ea1329f30ec0a8cdea9f33314e0757a7565d65d | /src/ArduScan.cpp | b01334f2b5f3c0661b87ca9cbdd9be0837f5c1bf | [] | no_license | arduino/arduino-usb-scanner | 7d2ae6d65dd287ecdc5c6942032564a806b602eb | 06f9749c22e15926541a89bcc39ab811bc6d8efc | refs/heads/master | 2021-01-22T19:21:50.870657 | 2011-09-26T16:16:39 | 2011-09-26T16:16:39 | 2,461,504 | 20 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 6,790 | cpp | ArduScan.cpp | /*
* ArduScan
* Sept 2011 by Bill Westfield ("WestfW")
*
* Scan a windows system and try to figure out which COM ports
* look like they might be Arduinos.
*
* This is based on the article here:
* http://www.codeproject.com/KB/system/serial_portsenum_fifo.aspx
* by Vladimir Afanasyev, which explains ... |
17a88a9ba68f409072fc1941bdb056b28dfd7d6c | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5738606668808192_0/C++/FrozenWinters/coin.cc | b34a7bf9dc8565b4c6b64fff56501a42a8985193 | [] | 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,944 | cc | coin.cc | #include <fstream>
using namespace std;
// Methedology: if the sum of digits is divisible by 6, then 2, 3, or 6 is a
// divisor in bases 10, 9, 7, 5, 4, 3. It remains to check bases 8, 6, and 2.
// We check composite-ness by dividing by the first 2000 primes.
int primes[2000];
__int128 expan = 0;
__int128 pow(int A... |
4337534aa9f4039dc7c8f785b0fa11ec67f5606b | 1673134fde1cfe01edb8101638954ccb2e889e63 | /Desc.cpp | 25f6f2da23baa6d4089535823cc3c1a4965f550e | [] | no_license | LordSputnik/opengrow | b6452e4a88d257a182b568913261c3ea8996a835 | 4fee1779df3994bd5b5c0d4186a6c0b44af3b1a0 | refs/heads/master | 2016-09-05T21:31:02.409808 | 2012-10-31T10:35:41 | 2012-10-31T10:35:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,822 | cpp | Desc.cpp | #include "og_pch.hpp"
#include "Desc.hpp"
namespace og
{
void BranchDesc::SetFromNode(const pugi::xml_node & level)
{
pugi::xml_node attrib_set = level.child("mid");
for( pugi::xml_node node = attrib_set.first_child(); node; node = node.next_sibling() )
{
if( strcmp( node.name(), "geotropism" ) =... |
ffea8e3d239ac123a18f2ceacab0cada28cebc25 | a387c9fa08abba6089a09e511765c3e8d5ad61df | /Lab/大三（上）/算法分析与设计_2013/贪心法/Greed/Greed/mapcolor.cpp | 519b72b788e94631785305fb0ae3209b875ddd6f | [] | no_license | linjinze999/BUPTSSE2013 | ab5153a8a544a8e1f3337bbc8c89b3bf23788d05 | 00abfac8c51cbca4cfcc936d6441424e15d656fd | refs/heads/master | 2021-01-19T01:12:17.275203 | 2019-11-28T01:57:03 | 2019-11-28T02:00:11 | 63,605,859 | 4 | 3 | null | 2019-11-28T02:00:12 | 2016-07-18T13:36:01 | JavaScript | GB18030 | C++ | false | false | 941 | cpp | mapcolor.cpp | #include"mapcolor.h"
#include<iostream>
#include<vector>
#include<time.h>
bool MapColor(int number,int *map,int *result,int count,int color,int max_color)//着色图
{
bool can=false;
for(int n=0;n<number;n++)
result[n]=-1;
for(int i=0;i<max_color;i++){//遍历所有颜色
for(int j=0;j<number;j++){//遍历所有顶点
if(result[j]==-1){/... |
6ef2e0ed0a12e6584e9d4edee590aadf2349b368 | b089c1a7b787cc27bb0512b3ac40d9590d95d3ef | /uint_custom.h | d04d8d46d8b32a1beca954498c7c3ffcc63e6ab5 | [] | no_license | NunchuckBradley/btm | e388f1adfddf2bb451b32c65a48e38ca6263387a | fa1301acd0ab16b7655488be4a3290425899335b | refs/heads/master | 2023-03-15T02:56:14.341155 | 2021-03-01T21:42:34 | 2021-03-01T21:42:34 | 343,564,691 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,112 | h | uint_custom.h | // code influenced from bitcoin source code
#ifndef UINT_CUSTOM_H
#define UINT_CUSTOM_H
#include <cstring>
#include <sstream>
#include "crypto.h"
//#include <cryptopp/filters.h>
//#include <cryptopp/hex.h>
template<unsigned int BITS>
class uint256 {
protected:
static constexpr int WIDTH = BITS / 8;
uint8_t... |
e4b385412b526dd2e161e1bd6f6d33daa209b749 | 5d8e8a7d2c54d35d104c752d4cee27932758fde5 | /cdt/CTcpClient.h | 698189952b179d4af49ff12cad8373275c9b3a6f | [] | no_license | MWjie/RemoteWITH_3AnalogScreen | c05baac93db788ac58458e48d7f5ff34f937b7ca | 78d8ae1eca58a1f043200873398157fa71c709a7 | refs/heads/master | 2020-03-09T16:14:44.793981 | 2018-04-17T13:43:33 | 2018-04-17T13:43:33 | 128,879,532 | 1 | 0 | null | null | null | null | WINDOWS-1250 | C++ | false | false | 437 | h | CTcpClient.h | #ifndef NET_H
#define NET_H
#include <iostream>
#include <windows.h>
#include <winsock2.h>
#include "type.h"
using namespace std;
class CTcpClient {
private:
SOCKET m_sock; //socketĚ×˝Ó×Ö
public:
char* m_host;
ushort m_port;
public:
int open(char* host, ushort port);
... |
3332d4f651bf9195df50d0e58c3d61a3f76732a7 | 279d3947563bcba72f4effe293a0b0e62dfc1051 | /Understanding_the_RGB_LED.cpp | bbdbc5229fefe02318d86107b545b04a7f335854 | [] | no_license | SRCinVA/Arduino | ee0ed5470cb556372f8e7ba6afe03a416f9cd894 | ba0650e2edb2133f5457f283ccada3e158fe29b8 | refs/heads/main | 2023-08-20T14:24:31.954548 | 2021-09-27T00:55:54 | 2021-09-27T00:55:54 | 318,236,680 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,466 | cpp | Understanding_the_RGB_LED.cpp | // Understanding the RGB LED
int redPin=8;
int greenPin=9;
int bluePin=10;
String myColor;
String msg="Which color would you like?";
void setup() {
Serial.begin(9600);
pinMode(redPin, OUTPUT);
pinMode(greenPin, OUTPUT);
pinMode(bluePin, OUTPUT);
}
void loop() {
//ask
Serial.println(msg);
//wait
while (Serial.ava... |
c7c9f52c3d0ae74c1fed64490f8deb69ce2dd890 | e2a07d08787f6bcc37267648e8d176248282d913 | /will/DataPreparer.h | 0978e1618b27552717a367dbaeeed6fdf452d888 | [] | no_license | willdla/cccc-lite | 3d7bdfdf5dc7df653c875c85495df78da84c1174 | 9f809fa2c87320007e52adb754a3707db8a7386f | refs/heads/master | 2023-08-19T14:37:43.377302 | 2021-10-29T16:31:38 | 2021-10-29T16:31:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,647 | h | DataPreparer.h | #pragma once
#include "Matrix.h"
#include "Neural.h"
#include "Option.h"
#include "Random.h"
namespace cccc
{
class DataPreparer : public Neural
{
public:
friend class DataPreparerFactory;
public:
DataPreparer();
virtual ~DataPreparer();
protected:
void init();
virtual void init2() {}
int ge... |
8e9a1e4d2dcd259e6bb489a1b33478966bc49bb0 | cd37631e066e69f87883b41bbfaaf7a2e3e3a914 | /server/Server.cpp | 9dcd902d68847296666bf72b7be812831786525d | [] | no_license | ballinhuang/CSAAS | a8906c4f16fb20d63ecee7a9567fcf66711a9b41 | 041c59db7e93e87318b501e7f00b5ae41ccfb145 | refs/heads/master | 2021-01-21T17:09:41.483838 | 2018-06-06T08:40:23 | 2018-06-06T08:40:23 | 91,935,329 | 1 | 1 | null | 2017-10-05T14:30:25 | 2017-05-21T05:29:48 | C++ | UTF-8 | C++ | false | false | 10,708 | cpp | Server.cpp | #include "Server.hpp"
#include <iostream>
#include <json.hpp>
#include "c_socket.hpp"
#include "Message.hpp"
#include <unistd.h>
#include "s_nbsocket.hpp"
#include "s_socket.hpp"
using json = nlohmann::json;
using namespace std;
#include <fstream>
extern int debug;
extern ofstream *debug_file;
Server::Server()
{
}
... |
df10759cffa694b384bf8daad4679a7993ac0ef8 | 79cd3aed34bdff83575ea0b5973812e396fc089b | /TehnikeProgramiranja/Tutorijali/T7/Z7.cpp | 8834aaef0dc21ef17bef0be9989c5d50ce9bc110 | [] | no_license | lmujic1/CppCode | 42be834f9e170d00a8843f316dce9205637e5c1a | 628a21c3b16e3906160589b97cec25c46af654e8 | refs/heads/master | 2023-08-14T03:49:38.149481 | 2021-09-20T23:56:51 | 2021-09-20T23:56:51 | 407,698,782 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,032 | cpp | Z7.cpp | //
// Created by 38760 on 18. 9. 2021..
//
/*
TP 16/17 (Tutorijal 7, Zadatak 7)
Autotestove pisao Elmir Hodzic. Sva pitanja,
prijave gresaka i sugestije slati na mail
ehodzic3@etf.unsa.ba
Vrsit ce se provjera na prepisivanje tutorijala.
*/
#include <iostream>
#include <set>
template <typename t>
std::set<t> ... |
aa45003332b5d1d198509fb3f0ea6793f0d6b6d1 | 0abdd25bc1b6456765344da544e1c3b768203314 | /dependency/DataServerEngine/src/utils/variant.cpp | 96f4938ae1e6f97d18b6c73a63214393a1b6d267 | [] | no_license | fahram/DataServer | 351d938d386a2c6c415433897c1b28b039b5ab18 | 1183cb7462bd95d3152262073e137d327e093df5 | refs/heads/master | 2021-01-21T19:45:12.884077 | 2011-12-02T09:01:29 | 2011-12-02T09:01:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,191 | cpp | variant.cpp | #include "utils/variant.h"
#include "utils/string_algorithm.h"
#include <boost/assert.hpp>
#include <../../opc_foundation/opcda.h>
string_t TypeAsString(VARTYPE vt)
{
switch (vt)
{
case VT_EMPTY:
return "VT_EMPTY";
case VT_NULL:
return "VT_NULL";
case VT_I2:
return "VT_I2";
case ... |
6524e4d64aa39d44b2068ef882dee846ae3fb265 | 9b755c63514867f4d6c47a061db180d99c83b7d9 | /src/homework/tic_tac_toe/tic_tac_toe_manager.h | 02837ace385f4593a935906e2da0b3a88adad3f8 | [
"MIT"
] | permissive | acc-cosc-1337-spring-2020/acc-cosc-1337-spring-2020-connorstack1891 | 6e95f9b714c48fd4bbbdc5e613c4f4c7b42c32dc | ba03e746a61491a43e7483e95ddf8435d19b67ae | refs/heads/master | 2020-12-20T01:12:19.997261 | 2020-05-12T23:39:35 | 2020-05-12T23:39:35 | 235,910,226 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 626 | h | tic_tac_toe_manager.h | //h
#include "tic_tac_toe.h"
//include <iostream>
#ifndef MANAGER_H
#define MANAGER_H
#include <memory>
#include "tic_tac_toe_data.h"
class TicTacToeManager
{
public:
TicTacToeManager() = default;
void save_game(std::unique_ptr<Game> &b);
friend std::ostream& operator<<(std::ostream& out, const TicTacToeManager... |
0c109994aa85425f88c3263571255cae9a7a922e | 94143c13148e4124575b4525fbb12719e5071a4e | /src/sequential_heap.cpp | 5ff52c40ec940639ceecde88427df738e55cbd22 | [] | no_license | shubhammitt/Accelerating-Concurrent-Heap-On-GPU | eb94365671a159449336ef924f68e56ccff8fa78 | 345a2b6f7761ace807b671ebbf7bd0d641a4f103 | refs/heads/master | 2023-08-21T22:17:41.514785 | 2021-10-21T13:05:40 | 2021-10-21T13:05:40 | 399,451,022 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,741 | cpp | sequential_heap.cpp | /*
* Author: Shubham Mittal
* IIITD, 2018101
* GPU Project: Accelerating Concurrent Heap on GPUs
*/
#include "sequential_heap.h"
CPU_Heap::CPU_Heap(int _capacity) {
capacity = _capacity + 1;
arr = new int[capacity];
size = 0;
}
bool CPU_Heap::is_full() {
return size + 1 == capacity;
}
bool CPU_Hea... |
25564125252c152dce5a444001efa9daf612fe6c | 102beccb4a386876dfeaea493209537c9a0db742 | /TelepathyIMModule/TelepathyIM/GMainLoopThread.cpp | 04b5f55172ef87e6df869dad941e5a28b39a257a | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | Chiru/naali | cc4150241d37849dde1b9a1df983e41a53bfdab1 | b0fb756f6802ac09a7cd9733e24e4db37d5c1b7e | refs/heads/master | 2020-12-25T05:03:47.606650 | 2010-09-16T14:08:42 | 2010-09-17T08:34:19 | 1,290,932 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 751 | cpp | GMainLoopThread.cpp | // For conditions of distribution and use, see copyright notice in license.txt
#include "StableHeaders.h"
#include "DebugOperatorNew.h"
#include "GMainLoopThread.h"
#include "MemoryLeakCheck.h"
namespace TelepathyIM
{
GMainLoopThread::GMainLoopThread()
{
g_main_loop_ = g_main_loop_new (NULL, FALSE);
... |
181c1902969a481d1291081084a375af0469d71d | 8f0c928a727c2b287a76a0e6fd107d4080a4cf39 | /generic-ros-catkin-cplusplus-services-cmake-example/src/server.cpp | 1cf7d683591e10ed55da2eb8b58f94964b87ecae | [
"MIT"
] | permissive | nikolausmayer/cmake-templates | d3194a108334ff89ef9b13df015f7d2bdd6fde9d | 50f4253d3a72a24084a7bfbf3de0d7e3c11af860 | refs/heads/master | 2020-12-24T17:35:24.296994 | 2019-09-12T08:39:45 | 2019-09-12T08:39:45 | 31,466,186 | 53 | 18 | null | null | null | null | UTF-8 | C++ | false | false | 907 | cpp | server.cpp | #include <string>
// ROS
#include <ros/ros.h>
#include <std_msgs/String.h>
// THIS PACKAGE'S SERVICES
#include "generic_package/GenericService.h"
bool genericServiceCallback(generic_package::GenericService::Request &request,
generic_package::GenericService::Response &response)
{
ROS_INFO(... |
9e486d0f4b723b8b6226a2e3fea059ba1876b470 | 0af8311127fad8d854b2e4b9c80f2a20d95663d1 | /map2.cpp | 1182f2d12e6b933fcffcba06935af9220e7aeb2f | [] | no_license | RakibulIslamRakib/Data_Structure_in_c- | 2a8bc35b4685447e12ee75b2762cb9d61b98b873 | 61e4803e47921e4fc59357b9d053399ebbe04580 | refs/heads/master | 2021-06-25T04:21:51.081608 | 2021-04-11T09:28:27 | 2021-04-11T09:28:27 | 215,605,728 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 670 | cpp | map2.cpp | #include <bits/stdc++.h>
using namespace std;
map<string,string>mp;
vector<string>v;
map<string,string>::iterator it;
bool isvalid(string email){
int len = email.size(),indx=0;
bool valid = true;
string s="@gmail.com";
for(int i=len-10;i<len;i++){
if(email[i]!=s[indx++]){
valid = fal... |
bb657a899f77dd5b0a67b0d17c0485dc9c578c58 | 3580c727e8845175dee5feee9fa82fabeaea91d0 | /direct/Transceivers/GenomeTransceiver.h | cfeb13140f94f6f1c162a5be55d36d39e65d4a6b | [] | no_license | karinemiras/evolvable_morphologies | 51b187f63061baff9d91c155501058d89d1a130e | 1a63eb614ea7f7e3e18184bc2f545400b2049eb2 | refs/heads/master | 2021-01-20T02:33:42.057479 | 2018-01-04T13:28:18 | 2018-01-04T13:28:18 | 83,816,888 | 1 | 1 | null | 2017-05-16T12:57:19 | 2017-03-03T16:11:28 | C++ | UTF-8 | C++ | false | false | 456 | h | GenomeTransceiver.h | //
// GenomeTransceiver.h
// RobotController
//
// Created by Berend Weel on 10/04/15.
// Copyright (c) 2015 Berend Weel. All rights reserved.
//
#ifndef __RobotController__GenomeTransceiver__
#define __RobotController__GenomeTransceiver__
class GenomeTransceiver {
public:
virtual void broadcastGenome() = 0;
... |
2f881121aa90fde3464d958c7a8d3970d54f1353 | 70dac8aa405f41a2ec46b9317307ef7df850c233 | /CuentaLargoPlazo.h | 2fc04e4d4196a025f32b71544f576ca4f824cba8 | [] | no_license | 6abriel1chiro/cpp-oop-bank-system | 77879563d0d12e76bab9a0e59ed643b819e17ae4 | 3e8db761668e8473dbc24a3bf1a7fed88ba9a70a | refs/heads/main | 2023-03-30T10:45:33.600650 | 2021-03-30T04:59:23 | 2021-03-30T04:59:23 | 352,874,873 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 395 | h | CuentaLargoPlazo.h | #pragma once
#include "Cuenta.h"
class CuentaLargoPlazo :
public Cuenta
{
private:
string fechaIni;
string fechaFin;
float interesAnual;
public:
CuentaLargoPlazo(string id, float saldo,string moneda, string fechaIni, string fechaFin, float interesAnual);
~CuentaLargoPlazo();
v... |
5f2f14b9251ab5c20c867df85cf38824189b6053 | 0cfb43cd7ead4fefa9babc41b5b0c49b857134e5 | /Game.cpp | a01c6d374ca93365d01bb3dac87a4db8d44bc824 | [] | no_license | GaliaGrayevsky/OOD-Final-Project | 1b7877673362aa0015464723dab221e5d15d2dcc | b8b16e2eded97671cd501d7515432bd348bf0bd9 | refs/heads/master | 2022-11-19T05:14:31.589944 | 2020-07-18T04:24:08 | 2020-07-18T04:24:08 | 280,105,624 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,428 | cpp | Game.cpp | #include "Game.h"
#include <iostream>
#include "InitGameState.h"
#include "PlayTurnGameState.h"
#include "CheckGameState.h"
#include "EndGameState.h"
CGame::CGame()
{
m_semaphore = new CSemaphore();
m_gameState[INIT_STATE] = new CInitGameState();
m_gameState[PLAY_TURN_STATE] = new CPlayTurnGameState()... |
13316404a867296464b84e141f5390832bf72750 | 8b9d62f665770666e11079cbfcaf133f4ad4e19c | /hazelcast/include/hazelcast/client/internal/nearcache/impl/store/HeapNearCacheRecordMap.h | 9945883138a42ce7d47a63a4661f1266d37a150f | [
"Apache-2.0"
] | permissive | ihsandemir/hazelcast-cpp-client | d30fee3a8f421d50f3f3e1cffbcd60d014c6e418 | cef6d68e47afb9ab91a3c73d2c8da9c08bf5d868 | refs/heads/master | 2023-08-17T15:27:35.847711 | 2023-08-14T17:56:02 | 2023-08-14T17:56:02 | 45,042,631 | 0 | 1 | Apache-2.0 | 2020-03-26T13:12:22 | 2015-10-27T13:25:02 | C++ | UTF-8 | C++ | false | false | 8,869 | h | HeapNearCacheRecordMap.h | /*
* Copyright (c) 2008-2023, Hazelcast, Inc. 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 ... |
1615d104f84a4f4887e7251fabdba09aa2e8ef4c | 6ae89591b5498836415b6389cbd7c2705896d012 | /GeeksForGeeks/Graph/Graph_and_its_representations/Graph_and_its_representations/main.cpp | 49df7f761db53117ee6ecb7b3e31b8f9f5a5986e | [] | no_license | Developer199239/C-Programming | 7ba2858ad2d447d72a7cc1e142f602b766ec1f9b | 0ee8bdf63b47880d5c34a6f5716545637cc76952 | refs/heads/master | 2020-03-27T19:47:27.570650 | 2019-09-03T18:54:40 | 2019-09-03T18:54:40 | 147,011,482 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 886 | cpp | main.cpp | //
// main.cpp
// Graph_and_its_representations
//
// Created by MURTUZA on 26/4/19.
// Copyright © 2019 MURTUZA. All rights reserved.
//
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
void addEdge(vector<int>adj[],int u, int v) {
adj[u].push_back(v);
adj[v].push_back(u);
}
... |
d79e5e89eb7e96a200bd56accaf84769ec79e4f5 | d932716790743d0e2ae7db7218fa6d24f9bc85dc | /chrome/browser/ui/views/omnibox/omnibox_result_view.cc | aff68fc9c801574b0e5d4e3d531f17d431fe392f | [
"BSD-3-Clause"
] | permissive | vade/chromium | c43f0c92fdede38e8a9b858abd4fd7c2bb679d9c | 35c8a0b1c1a76210ae000a946a17d8979b7d81eb | refs/heads/Syphon | 2023-02-28T00:10:11.977720 | 2017-05-24T16:38:21 | 2017-05-24T16:38:21 | 80,049,719 | 19 | 3 | null | 2017-05-24T19:05:34 | 2017-01-25T19:31:53 | null | UTF-8 | C++ | false | false | 33,270 | cc | omnibox_result_view.cc | // Copyright (c) 2012 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.
// For WinDDK ATL compatibility, these ATL headers must come first.
#include "build/build_config.h"
#if defined(OS_WIN)
#include <atlbase.h> // NOLI... |
fe53527bade934774eef27abcaca8bb444cf74b1 | a157e49f1abae34fb2ce8cb99342a05682726ebf | /src/bot/Malware/SharedKernel/Systems/Windows/windowsmodulerepository.cpp | 642cb51e9f2fcdc3c40acb61bada3daf25ebcec5 | [
"MIT"
] | permissive | jsdelivrbot/eductional-botnet | 05c5e1b40e967221d12e96bf4f0e66036a8ad70a | 7cd021c176331cc0642f4b92a5a7b598df610c37 | refs/heads/master | 2020-04-10T09:22:25.918455 | 2018-12-08T07:26:51 | 2018-12-08T07:26:51 | 160,934,522 | 0 | 0 | MIT | 2018-12-08T11:57:08 | 2018-12-08T11:57:07 | null | UTF-8 | C++ | false | false | 1,308 | cpp | windowsmodulerepository.cpp | #include <windows.h>
#include <tlhelp32.h>
#include <tchar.h>
#include "windowsmodulerepository.h"
using namespace std;
namespace systems { namespace windows
{
vector<QString> WindowsModuleRepository::getAllModulesForProcess(Process process)
{
vector<QString> modules;
HANDLE hModuleSnap = IN... |
0aa018d18e65b4bcf62c92cac3465940081efa35 | 4cb210dad55139d4d2db787524beba685a39ff65 | /CodeChef/src/y2015/m03/challenge/SignWave.cpp | 457a71dda3682879afdb20d3bf4a064250a3b7ba | [] | no_license | pavel-zeman/CodeChef | 7e0d4b97d9032647a922bc5991a33e66ce8d5483 | a8a6b7638d3af4ed9fe7f64843a86e218882194a | refs/heads/master | 2021-04-12T02:49:21.699583 | 2018-11-03T19:03:04 | 2018-11-03T19:03:04 | 9,584,588 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,380 | cpp | SignWave.cpp | // Cosine functions never intersect each other at x-axis, so they can add up to 1 intersection. The number of intersections of l sine functions is 2^(s-l) (+ 2 points (0, 2*pi) with exactly s intersections).
// http://www.codechef.com/MARCH15/problems/SIGNWAVE
#include <stdio.h>
#include <string.h>
#include <limits.h>
... |
71856763f85e3ec4cdcce23be33af4e83a8f00bf | d0daf29f2fb5ff8630694b129aaac51bcdbbd50e | /aoapc_uva/aoapc-code/ch03/UVa10340-2.cpp | ab396944db60eb0402d1749af0980f98e3d6e84b | [] | no_license | fengshen024/Algorithm | 9ce95258ef8e4a20b298d0c476c0c67aa8e3e56e | 4d5c99f5a91d4a8dfcededa9d2da4b375080fb4e | refs/heads/master | 2021-01-26T02:47:25.033358 | 2020-02-21T15:06:51 | 2020-02-21T15:06:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 618 | cpp | UVa10340-2.cpp | #include<bits/stdc++.h>
using namespace std;
string s, t;
int main() {
while(cin >>s && cin >>t) {
bool isSub = false; // 记录是否为子序列
int i = 0, j = 0; // 双指针
while (i < s.size() && j < t.size()) { // 以s为参照，遍历s，t
if (s[i] == t[j]) { // 找到相等
if (i == s.size() - 1) {
... |
0052ed501e8d93e6b7bb7f070bc2fa028fdaef35 | 3f11bd61f282e161fa062c54a7d5d0be0c245e20 | /treaning0410.cpp | 68205f5290f94171b2c61139df240a4d476613e6 | [] | no_license | Satoru830624/Traning | dd72d0931abd1e7e3d8ec82b3cf2730f1deda4a9 | 516ac8e1503a8e7ed868f157d8b4af1d428ac0d7 | refs/heads/master | 2020-03-07T13:54:03.073755 | 2018-04-25T11:08:58 | 2018-04-25T11:08:58 | 127,513,202 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 757 | cpp | treaning0410.cpp | #include <iostream>
#include <vector>
void g1(std::vector<int> v){
v[0] = 100; //パラメータの変更
}
int g2(const std::vector<int>& v) {
//v[0] = 1000; //error(v is const)
return v[0];
}
void g3(std::vector<int> v) {
v[0] = 1000;
}
auto h(){
std::vector<int> v{11,13,17,19};
return v;
}
int main(){
... |
7a3a632a5284d730aaa6d9e06be65137e5bbaa0b | 6ebb505b3d9beff9a81304c74dc4cfff7dd3cb0a | /structure-2/src/Path.cpp | a34fbb14ae7ed106788a7caf10e546b36b098992 | [] | no_license | mathieu-reymond/structure-of-computer-programs-2 | dd55365a9d94cff532c274af776efe08908e732c | be4fa080cf022f7ff577a9cd8c96140003cb9c07 | refs/heads/master | 2016-09-06T07:09:53.931330 | 2014-01-17T11:35:39 | 2014-01-17T11:35:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,500 | cpp | Path.cpp | /*
* Path.cpp
*
* Created on: Dec 6, 2013
* Author: Mathieu
*/
#include "Path.h"
#include <iostream>
#include <sstream>
#include <string>
#include <sstream>
/**
* Makes a new, empty Path
*/
Path::Path() {
}
Path::~Path() {
}
/**
* Checks if this Path is on the same level as path.
* The Path must be th... |
e6454c76e317216d9bd95e8d0cb5e004a5bed543 | e5f4f37d941ceb8145d65f92028cc54658b1ac01 | /Code/Engine/Core/World/Implementation/SettingsComponentManager_inl.h | 2e708747c302dc701abe97767e48432d44617cb4 | [
"MIT"
] | permissive | ezEngine/ezEngine | 19983d2733a5409fb2665c6c3a0a575dadcefb50 | c46e3b4b2cd46798e4abb4938fbca281c054b039 | refs/heads/dev | 2023-09-06T02:17:28.152665 | 2023-09-05T18:25:43 | 2023-09-05T18:25:43 | 18,179,848 | 1,050 | 165 | MIT | 2023-09-14T21:44:39 | 2014-03-27T15:02:16 | C++ | UTF-8 | C++ | false | false | 2,706 | h | SettingsComponentManager_inl.h |
template <typename ComponentType>
ezSettingsComponentManager<ComponentType>::ezSettingsComponentManager(ezWorld* pWorld)
: ezComponentManagerBase(pWorld)
{
}
template <typename ComponentType>
ezSettingsComponentManager<ComponentType>::~ezSettingsComponentManager()
{
for (auto& component : m_Components)
{
De... |
d535ce116f01b33b320e064e60b18b7f8b9cbefb | 4f74a1d00e8253d229907d5c640e1a2eb5fd589a | /Accepted Code/UVA/336 - A Node Too Far.cpp | dc272397d5e63584f2b75034d199f156d50e7b40 | [] | no_license | sunkuet02/problem-solving | 012ea9d94412bf0400223e2af73c95bff049d0c9 | 49b24477acdf2bdffa9c78a907c9e06532403d40 | refs/heads/master | 2022-02-20T12:39:54.573009 | 2019-09-29T03:58:59 | 2019-09-29T03:58:59 | 63,452,400 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,107 | cpp | 336 - A Node Too Far.cpp | #include<iostream>
#include<map>
#include<vector>
#include<queue>
#include<set>
using namespace std;
vector<int>node[500];
map<int,int>mp;
int bfs(int source,int ttl)
{
queue<int>qu;
qu.push(source);
int taken[100]={0},distance[100];
distance[source]=0;
taken[source]=1;
int reac... |
afc631ac7c945473b6ecd995f8bcb3aca7c115b1 | 5095bbe94f3af8dc3b14a331519cfee887f4c07e | /Shared/general/test/TestIniFile.h | 727332473a019cc611eb63232c9461b4d0d608c0 | [] | no_license | sativa/apsim_development | efc2b584459b43c89e841abf93830db8d523b07a | a90ffef3b4ed8a7d0cce1c169c65364be6e93797 | refs/heads/master | 2020-12-24T06:53:59.364336 | 2008-09-17T05:31:07 | 2008-09-17T05:31:07 | 64,154,433 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,303 | h | TestIniFile.h | //---------------------------------------------------------------------------
#ifndef TestIniFileH
#define TestIniFileH
#include <cppunit\testcase.h>
#include <cppunit\extensions\HelperMacros.h>
#include <string>
#include <general\inifile.h>
//---------------------------------------------------------------------------... |
541e944ef6655affd3aae1dedd34ce569aac5555 | 974d04d2ea27b1bba1c01015a98112d2afb78fe5 | /paddle/fluid/framework/ir/xpu/multi_encoder_xpu_fuse_pass.h | 7c7595a8564cde592273a72b42a7bf37e8c9e5c0 | [
"Apache-2.0"
] | permissive | PaddlePaddle/Paddle | b3d2583119082c8e4b74331dacc4d39ed4d7cff0 | 22a11a60e0e3d10a3cf610077a3d9942a6f964cb | refs/heads/develop | 2023-08-17T21:27:30.568889 | 2023-08-17T12:38:22 | 2023-08-17T12:38:22 | 65,711,522 | 20,414 | 5,891 | Apache-2.0 | 2023-09-14T19:20:51 | 2016-08-15T06:59:08 | C++ | UTF-8 | C++ | false | false | 6,027 | h | multi_encoder_xpu_fuse_pass.h | // Copyright (c) 2023 PaddlePaddle 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... |
c8d6c26897c1c02c86b5302888c1a9c9f1cecb79 | 6a3a50538c544c9f8d65bcb8f96d4e3b68a4e848 | /Sources/Pattern/Factory.hpp | 20e1492d0975c752c9602dea2c6e0b01d6ed8a40 | [] | no_license | lejard-h/cpp_bomberman | 8f2d7eabebc1b872e189f066caeee78bc2550569 | 3ba7dcbc77ac87fb47be006446c537da7055b2dc | refs/heads/master | 2016-09-06T08:57:09.230787 | 2014-07-11T08:55:12 | 2014-07-11T08:55:12 | 21,691,750 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,049 | hpp | Factory.hpp | /*
** Factory.hpp for Bomberman in /home/lejard_h/rendu/cpp_bomberman/Pattern
**
** Made by hadrien lejard
** Login <lejard_h@epitech.net>
**
** Started on mar. mai 20 14:50:49 2014 hadrien lejard
** Last update mar. mai 20 14:50:49 2014 hadrien lejard
*/
#ifndef __FACTORY_HPP__
# defin... |
49e611571b4e7da77bc48847d933a5c12c17d79f | 9e87545cf914b6951badf7d7a8e4124c76427f2e | /main.cpp | b7624a962db0bf953b6d4d389818e1fc4982c593 | [] | no_license | marktube/Simple-Sudoku | 210ecb341ebe8a697a0829ce68277e7cab32cf4e | e5cbd688423fec139560944eb603246b937209ae | refs/heads/master | 2020-09-21T13:34:43.759268 | 2015-04-02T03:04:26 | 2015-04-02T03:04:26 | 33,286,221 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,452 | cpp | main.cpp | //
// main.cpp
// Sudoku
//
// Created by 刘彦超 on 14/11/1.
// Copyright (c) 2014年 刘彦超. All rights reserved.
//
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string.h>
#include <algorithm>
//#define MYDEBUG
using namespace std;
int grid[9][9];
int solutionCnt = 0;
int record[9][9];
int rowch... |
c1a3ed31ba63fea259cc02768b08444ea1e12064 | 2812bd3736fb271f0c62f7e8beeed4958d5971e5 | /examples/service/AndroidServiceTest/testservice.h | 47f51677761a2de74dd177d858942c19d0e27544 | [
"BSD-3-Clause"
] | permissive | Skycoder42/QtService | 1c44fb6404e13e2db6c752e19e908ad45843ff57 | b8f3862fda6c7d58bc21e03060ecee099668ab89 | refs/heads/master | 2022-11-05T01:17:18.424736 | 2022-10-27T05:18:31 | 2022-10-27T05:18:31 | 134,629,576 | 138 | 52 | BSD-3-Clause | 2022-08-01T05:40:14 | 2018-05-23T21:56:29 | C++ | UTF-8 | C++ | false | false | 599 | h | testservice.h | #ifndef TESTSERVICE_H
#define TESTSERVICE_H
#include <QtService/Service>
#include <QAndroidIntent>
#include <QAndroidBinder>
class TestService : public QtService::Service
{
Q_OBJECT
public:
explicit TestService(int &argc, char **argv);
protected:
CommandResult onStart() override;
CommandResult onStop(int &exitC... |
cd15ca8fa9eeef64ec059d94c1023996df90f852 | 2bd30e0416979e2c1e6c6fd6af4eec0a8ff80fdf | /media/MediaManagement.h | 290d553120cbca2102d1b2c7ca1817505406eaa8 | [] | no_license | mutex42/kirjasto | edef77acdcf6f2c8a97448349e241d67c53522ac | 67fc3c6a648cf0739f18219e7a3a69985a074cc0 | refs/heads/master | 2021-01-11T12:09:28.305945 | 2017-04-08T03:02:03 | 2017-04-08T03:02:03 | 79,385,084 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,379 | h | MediaManagement.h | #ifndef MEDIAMANAGEMENT_H
#define MEDIAMANAGEMENT_H
#include <stdlib.h>
#include <stdio.h>
#include <string>
#include <sqlite3.h>
#include <iostream>
#include "Person.h"
#include "Article.h"
using namespace std;
class MediaManagement
{
public:
static MediaManagement& getMM(){
static MediaManagement ... |
b1153661d4d545f4e9693a4bdab08b6f94f1b95f | 451270b39c078f40f6c0a099e26318920be16949 | /12/单独数字.cpp | 87c5fe18562ceccda98dcc101fbc6382b713271c | [] | no_license | Lethe0616/w.x | e659848527753095718b4beb799fec6428999606 | 53f0a954204f0e12f03c777d867861110c278afe | refs/heads/master | 2020-05-19T20:07:36.735167 | 2019-07-30T11:47:40 | 2019-07-30T11:47:40 | 185,195,885 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 323 | cpp | 单独数字.cpp | #include <stdio.h>
#include <stdlib.h>
int main()
{
int one = 0, i = 0;
int arr[] = { 1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1 };
one = arr[0];
for (i = 1; i < sizeof(arr) / sizeof(arr[0]); i++)
{
one = one ^ arr[i]; //遍历数组将元素异或，留下单一数字
}
printf("%d\n", one);
system("pause");
return 0;
}
|
7a5dfa3166d426b355b7c6bca6b0b941d8cf1786 | 5583acfa0fac2f29ebd6615ad7a101ff6b74f4b9 | /SteampunkFriends/CPPGameWorld/PlayerCollision.h | 3d523cbd132d45a39c0b5286c942df65e160f952 | [] | no_license | Roarw/SteampunkFriends | aaa1edb1df415a243b06fafc71f6f46c5fb168e4 | ca3b9a39daed782edf9d238d1737b4745860f8e8 | refs/heads/master | 2021-01-19T12:14:44.148541 | 2017-02-24T15:29:58 | 2017-02-24T15:29:58 | 82,297,439 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 580 | h | PlayerCollision.h | #ifndef PLAYERCOLLISION_H
#define PLAYERCOLLISION_H
#include "Component.h"
#include "Vector2.h"
#include "RectangleF.h"
class Transform;
class Collider;
class Physics;
class PlayerCollision :
public Component
{
private:
Transform * transform;
Collider * collider;
Physics * physics;
bool CollidingAt(Collider *... |
303bf98913d63e506b3da404d6028d01ef3e5b71 | bbe6faa8c616ccf5e7c9733ff3f9e20494b4c066 | /cmake-3.12.20181002-g18d20/Tests/QtAutogen/RerunMocPlugin/MocPlugin/StyleD.cpp | 0529426fe6e80fac146f303f479e06dba7387ae4 | [
"BSD-3-Clause"
] | permissive | helinyu/source_view | 7d685f11dbd192b654188edf8ca132d7d5ad519c | 6799043f6df66e6f491756c7b28c05f3e31064b6 | refs/heads/master | 2020-04-24T23:19:16.431516 | 2019-02-25T14:11:36 | 2019-02-25T14:11:36 | 172,340,220 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 88 | cpp | StyleD.cpp | #include "StyleD.hpp"
QStyle* StyleD::create(const QString& key)
{
return 0;
}
|
4c7b0e9ddf315b1a3f8f86be7af5b88b1522c239 | c8b39acfd4a857dc15ed3375e0d93e75fa3f1f64 | /Engine/Plugins/Editor/AudioCapture/Source/AudioCapture/Private/AudioRecordingManager.h | e48aedab32c5d76b86c754b1b19423a45a44a4ab | [
"MIT",
"LicenseRef-scancode-proprietary-license"
] | permissive | windystrife/UnrealEngine_NVIDIAGameWorks | c3c7863083653caf1bc67d3ef104fb4b9f302e2a | b50e6338a7c5b26374d66306ebc7807541ff815e | refs/heads/4.18-GameWorks | 2023-03-11T02:50:08.471040 | 2022-01-13T20:50:29 | 2022-01-13T20:50:29 | 124,100,479 | 262 | 179 | MIT | 2022-12-16T05:36:38 | 2018-03-06T15:44:09 | C++ | UTF-8 | C++ | false | false | 3,202 | h | AudioRecordingManager.h | // Copyright 1998-2017 Epic Games, Inc. All Rights Reserved.
#pragma once
#include "CoreMinimal.h"
#include "HAL/ThreadSafeBool.h"
#include "Engine/EngineTypes.h"
#if PLATFORM_WINDOWS
#include "WindowsHWrapper.h"
#endif
THIRD_PARTY_INCLUDES_START
#include "RtAudio.h"
THIRD_PARTY_INCLUDES_END
class USoundWave;
DEC... |
18fd38896c515e59348ee7fefc6e3aaef8de8829 | c34aab07030a058bf6cc2dc4f20874737e37a775 | /src/renderer/TextureCache.cpp | 66535423ffcb273ffe74fbd77fdf1dab8a89ebbf | [
"LicenseRef-scancode-khronos",
"MIT"
] | permissive | appelsdev/bouteagle-rewrite | 6d905c52c89f5d9d1ac3ec4dcfb9a7726b21bb24 | a557867babbf43d635ff0e93f0937985b0a022ec | refs/heads/master | 2020-12-23T10:14:35.481052 | 2020-01-29T23:36:16 | 2020-01-29T23:36:16 | 237,110,568 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 766 | cpp | TextureCache.cpp | #define WIN32_LEAN_AND_MEAN
#include <Windows.h>
#include <GL/gl.h>
#include "Log.h"
#include "resource/ResourceManager.h"
#include "renderer/TextureCache.h"
namespace TextureCache {
void Init() {
glPixelStorei(GL_UNPACK_ALIGNMENT, 1);
Build();
}
void Build() {
for (auto const& it ... |
10d81e4bfd3be601bc3166561ca5f9fc1f709c20 | 0f3032e4ecb5e0518bda8027cc9ba164f37ebfef | /src/Shader.cpp | 0cd1519292f7cd909ff9c4fdfe525aaaabe68bf4 | [] | no_license | mijara/MokaEngine | c573bc52858cc762be45a7b6a8ef37e022063450 | fb7a7bd755499c94a28fdea1e4e0f8e85f2c3eee | refs/heads/master | 2021-01-15T10:58:49.967804 | 2015-01-20T17:53:00 | 2015-01-20T17:53:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,201 | cpp | Shader.cpp | #include "Shader.h"
namespace util {
std::string LoadFileText(const std::string& filePath) {
std::ifstream file(filePath);
std::string output;
std::string line;
if(file.is_open())
while(file.good()) {
std::getline(file, line);
output.append(line + "\n");
}
return output;
}
static void Ch... |
4e54e093efccbb08919edde22f7a1e379fc5d463 | 45f28d1eb69a471161328f2218a8a833f823184a | /CodeBook_code/Graph/minimum_mean_cycle.cpp | d004dbb79486fed759a1e0496ee0e58c8529b2d9 | [] | no_license | johntsung/Programming-Contest | eb0566fe6619d3eb4d2155fcbe6f692e502755aa | c273408405cf5f5cb951125b7e8924c1cb184378 | refs/heads/master | 2022-02-20T06:38:38.490508 | 2022-02-13T13:48:21 | 2022-02-13T13:48:21 | 231,524,210 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,463 | cpp | minimum_mean_cycle.cpp | # include <stdio.h>
# include <vector>
# include <queue>
# include <algorithm>
using namespace std ;
struct edge{
int to,w;
edge(int a=0,int b=0):
to(a),w(b){}
};
vector<edge> g[1024];
int dp[1024][1024], inq[1024][1024];
const int MAXE=1000 ;
void solve(int source,int N){
for(int i=0;i<N;i++... |
12c959319c29b5adeab2c31daab4e5d2232a536e | 5b41e312db8aeb5532ba59498c93e2ec1dccd4ff | /SMC_DBClasses/CGC_DELAY_GROUP.cpp | 67fc4ce6ae2ec4ee566087816b828c57e06c857c | [] | no_license | frankilfrancis/KPO_HMI_vs17 | 10d96c6cb4aebffb83254e6ca38fe6d1033eba79 | de49aa55eccd8a7abc165f6057088a28426a1ceb | refs/heads/master | 2020-04-15T16:40:14.366351 | 2019-11-14T15:33:25 | 2019-11-14T15:33:25 | 164,845,188 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,373 | cpp | CGC_DELAY_GROUP.cpp | //## Copyright (C) 2009 SMS Siemag AG, Germany
//## Version generated by DBClassCodeUtility BETA 0.6.3
//## ALL METHODS MARKED AS - //##DBClassCodeUtility - WILL BE OVERWRITTEN, IF DB CLASS RE-GENERATED
//## MANUALLY IMPLEMENTED METHODS MUST BE LOCATED BELOW THE MARK - "YOUR-CODE" -
#include "CGC_DELAY_GROUP.h"
... |
4393e43862591b91be7b37561da42979d78bae7b | 9e548d7b078c187d9ec04797a9eeb0dd1e4e9aa5 | /Highly_Important_Backup/JPEG_Thesis_2/Final_PR/HUFFMAN_SYSTEM_SDK/HUFFMAN_SYSTEM_SDK.sdk/HUFFMAN_REV2_IP_TEST/src/main.cc | 5dacbe2e5d41e5a61b132e58bcb1cf18a99ce856 | [] | no_license | yisea123/FPGA_Research | b4d7912806da6f44cc5cb51e296e093f119bec2d | 5e018ab1d1168c2a0d275cc93cb72e1e747338c4 | refs/heads/master | 2020-08-27T16:40:40.128967 | 2017-11-28T10:37:16 | 2017-11-28T10:37:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,777 | cc | main.cc | #include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <time.h>
#include "xparameters.h"
#include "xil_printf.h"
#include "xil_cache.h"
#include "ff.h"
#include "xdevcfg.h"
#include "xil_io.h"
#include "xil_types.h"
#include "xbasic_types.h"
#include "xil_exception.h"
#include "xsdps.h"
#include "math.h"
... |
1ae6f239ddb8c2606627230093e3a9dfd97fe7f9 | 45a27173885387e89f9a5a22390229ec93b512ff | /PhysUtils/interface/TrackVertex.hpp | 4b2ee9908af196abf568e2e0266c603b00418049 | [
"MIT"
] | permissive | yimuchen/UserUtils | a15c53c1d364bb0a40774584cd293449cf4aeb11 | 041030abbf4f1fb65d12d1c76f021713f7059fe1 | refs/heads/master | 2022-07-22T16:41:36.622119 | 2022-07-07T16:41:02 | 2022-07-07T16:41:02 | 134,058,566 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 485 | hpp | TrackVertex.hpp | /**
* @file ObjectExtendedVars.hpp
* @author [Yi-Mu "Enoch" Chen](https://github.com/yimuchen/)
* @brief additional calculation of track and vertex related values
*/
#ifndef USERUTILS_PHYSUTILS_TRACKVERTEX_HPP
#define USERUTILS_PHYSUTILS_TRACKVERTEX_HPP
#include "RecoVertex/VertexPrimitives/interface/TransientVert... |
67299d5341f3d4affd5c2dc860c021fb70690283 | e48a40b19ebe1ca64d877885f9f19e9a78b192c3 | /Examples/Cxx/WidgetsTour/Widgets/vtkKWRadioButton.cxx | f2b26890eae2d932c2cfbbcfbf18846fdefe2b91 | [] | no_license | SIVICLab/KWWidgets | dbe2034caf065c30eafed92d73e9df9ff60a6565 | f5a3e16063db773eaf79736ec31314d392fa934d | refs/heads/master | 2021-01-18T20:08:02.372034 | 2017-04-01T20:57:19 | 2017-04-01T20:57:19 | 86,941,196 | 1 | 0 | null | 2017-04-01T20:34:24 | 2017-04-01T20:34:23 | null | UTF-8 | C++ | false | false | 5,120 | cxx | vtkKWRadioButton.cxx | #include "vtkKWRadioButton.h"
#include "vtkKWRadioButtonSet.h"
#include "vtkKWApplication.h"
#include "vtkKWWindow.h"
#include "vtkKWIcon.h"
#include <vtksys/stl/string>
#include "vtkKWWidgetsTourExample.h"
class vtkKWRadioButtonItem : public KWWidgetsTourItem
{
public:
virtual int GetType();
virtual void Create(... |
e1734ffae4561ab83aa82685ddd36e4dfe5069b8 | b7461a64f31f5d556863b572c31693e98474132f | /Pipelined-IF.h | 4475af5b10ec046d6d240c66b351c420f4b0e1de | [
"MIT"
] | permissive | dirkcgrunwald/dirkdlx-systemc | a55e5b050c26c903801bcc18f31051fe9da75bb0 | e07f3c183bdd1afff18ef3971b94ba75601ad260 | refs/heads/master | 2021-01-10T12:05:57.393031 | 2015-10-13T18:09:40 | 2015-10-13T18:09:40 | 44,195,250 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 577 | h | Pipelined-IF.h | //-*-c++-*-
#ifndef _Pipelined_IF_h_
#define _Pipelined_IF_h_
#include "systemc.h"
#include "Pipelined.h"
#include "DLXMemory.h"
#include "DLXMachineState.h"
struct Pipelined_IF : public sc_module {
//
// Define ports
//
sc_out<StateIF2ID> to_decode;
sc_out<bool> decode_ready;
sc_in<State2IF> from_wb;
... |
36f65558b15a1b15989badb280f4fd1aa29ffbb2 | 1076f51d61d68609af23cde5145d6a7a5b80d175 | /scene.h | 651c61484e6b9ca10c8c951e50e0ff79d94ad9f5 | [] | no_license | TheZino/DistributedRayTracer | f488d84ac70adee3270452767bee803fa165267a | 91eec6777cf41bd478f697510826bbd0676bb766 | refs/heads/master | 2021-01-23T17:35:57.321202 | 2018-03-01T14:51:57 | 2018-03-01T14:51:57 | 102,768,369 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,022 | h | scene.h | #ifndef SCENE_H
#define SCENE_H
#include <opencv2/opencv.hpp>
#include <vector>
#include <glm/glm.hpp>
#include <typeinfo>
#include <math.h>
#include <random>
#include <cmath>
#include <chrono>
#include "objects.h"
#include "elements.h"
#include "utils.h"
class Scene {
public:
std::vector<Object*> objs;
std::vec... |
039b77cce01c2c488f777d1649e8f530ca317f69 | 94e952fb11e9724dadc83cc0b25386748a782e83 | /audio/Music.cpp | 39e8bafcefffe0f97c8386576ff37a427dbd51fd | [] | no_license | Towerthousand/VoxelGame | 1dc1fdb000192df52ff62a8b1045a8344b448f18 | 607f2987adeda36d8527e2b2fceb8cc8e9f8cbbe | refs/heads/master | 2020-05-17T07:48:51.750442 | 2014-11-04T23:44:45 | 2014-11-04T23:44:45 | 8,186,861 | 1 | 0 | null | 2013-05-20T22:08:51 | 2013-02-13T20:12:33 | C | UTF-8 | C++ | false | false | 242 | cpp | Music.cpp | #include "Music.hpp"
Music::Music() {
}
Music::~Music() {
}
bool Music::loadFromFile(const std::string& filePath) {
if (!track.openFromFile(filePath)) {
return false;
}
return true;
}
sf::Music& Music::getTrack() {
return track;
}
|
0bd2916fc8a6f8abdd308fe7c440aa02bc8f9a55 | f45e5c33352cc17420226b13a542c60234232663 | /DevSprint3/CharacterMovement.h | 4cd54830abbeaf195d362ec56e8e12c0d0e3f4cc | [] | no_license | theisen1337/LogicCapStone | 3509e0a65c407dba4ae5f7a31dd2b712f4705f7f | b37c8461d22433b85fcbfceb050d99c45f939e7a | refs/heads/master | 2021-05-05T09:26:52.132853 | 2018-05-02T19:21:35 | 2018-05-02T19:21:35 | 119,344,162 | 3 | 0 | null | 2018-02-23T22:55:33 | 2018-01-29T06:56:34 | C++ | UTF-8 | C++ | false | false | 1,233 | h | CharacterMovement.h | #pragma once
// Standard Includes
#include <vector>
#include <math.h>
// Custom Includes
#include "GlobalStatics.h"
#include "World.h"
#include "Tile.h"
//! Directional Structure
struct Compass {
bool N;
bool E;
bool S;
bool W;
};
class CharacterMovement
{
public:
//! Default Constructor
CharacterMovement();
//... |
b08fbfad308b9e2b8657c8356839a67bd0c99045 | 95675b15b654f66bbb1a2ff94b2aeda1edecd84d | /C++_Pro/STL/Hello_STL.cpp | 6243ce25cced012bb299436240a54279a776ac5c | [] | no_license | CooperXJ/VScode | ba1a4545438a6ee306d6bc0e5f7793b2e1ebbda5 | ef014b1be87ccadd9fee6c28c7ee0013f8b6a835 | refs/heads/master | 2020-12-28T03:31:00.803698 | 2020-05-30T13:09:12 | 2020-05-30T13:09:12 | 238,139,254 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 652 | cpp | Hello_STL.cpp | #include <iostream>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
void print_vector(int val)
{
cout<<val<<" ";
}
void test()
{
vector<int> v;
v.push_back(10);
v.push_back(20);
v.push_back(30);
//容器的迭代器 这里指定类型是因为每种数据类型++或者--不同
vector<int>::iterator pBegin =... |
231cfc64c5b6405295474df56505514ff3105d30 | 0e01a7797a99638f6a9b4db9df06a5c8d94aa7f7 | /src/morgana/fmk/resources/images/imagedecoder.h | 293d3c5c4101fbd7aa788d0826475b792277a860 | [] | no_license | cslobodeanu/hits | c0310a4e0cfa308b353d38e301187e7bc5063555 | 1cb6663b59cb6c8ee5576d5db276c3828490a110 | refs/heads/master | 2021-05-11T15:29:42.300945 | 2018-02-01T19:43:32 | 2018-02-01T19:43:32 | 117,730,282 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 863 | h | imagedecoder.h | #ifndef __MORGANA_FMK_RESOURCES_IMAGES_IMAGE_DECODER_H__
#define __MORGANA_FMK_RESOURCES_IMAGES_IMAGE_DECODER_H__
#include "reflection.h"
#include "meio.h"
namespace MorganaEngine
{
namespace Framework
{
namespace Resources
{
namespace Images
{
class ImageFile;
class ImageDecoder : public MEObject... |
c352dc56a194ea7e28249cd847c2dec85172ef2d | 2e6b32a56b8f6e09d91d80f88b0a4062b7e51a77 | /include/nxsimd/nx_avx_float.hpp | 5f11db6eb0d3200a70f5ce6e2868767af642491a | [
"BSD-3-Clause"
] | permissive | mywoodstock/nxsimd | fe99ef05f3ba7a9d77c8b24d133d7a5b6656d92a | ad2c7d73f99f24beee3f00c7176b49f50045777f | refs/heads/master | 2021-01-17T07:24:59.271754 | 2016-03-04T00:20:55 | 2016-03-04T00:20:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,821 | hpp | nx_avx_float.hpp | //
// Copyright (c) 2016 Johan Mabille
//
// All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.
//
#ifndef NX_AVX_FLOAT_HPP
#define NX_AVX_FLOAT_HPP
#include "nx_simd_base.hpp"
namespace nxsimd
{
class vector8fb : public simd_vector_bool<vec... |
ac7e38730934211626e1d18392d7cea0ca6c0a46 | 3c085d6386aa79de4c1b94cbddba5552761c6714 | /Fin/src/fin/audio/iaudio.h | d78ae0d0e0391fe2b456aefb50a318cab4e66699 | [] | no_license | MeltyPlayer/FinRpg | 971840c5ab8fed746f9a293b4e2140d8ae241830 | d147067840f97166c5310952457cce4099835010 | refs/heads/master | 2021-04-26T04:15:44.448591 | 2018-11-04T02:58:57 | 2018-11-04T02:58:57 | 106,984,049 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 218 | h | iaudio.h | #pragma once
#include "fin/app/iservice.h"
#include "ilistener.h"
namespace fin::audio {
class IAudio : public app::IService {
public:
virtual ~IAudio() {}
virtual IListener* get_listener() = 0;
};
} |
a2b9975438837c9dbb2c071447b25e5056f3fdb6 | 6257c3de3420e452585365bc86cdd5692935505b | /arrayQuestions/PermutationOfTheOthers.cpp | f56a7a61a0aeae770196a7bd991099555d836898 | [] | no_license | VNgwazini/Interview-Prep | f0b4861487afaa420bde84316553363947868f04 | 839830c5c6b7cfb78ebbaee977635320d911b052 | refs/heads/master | 2023-06-07T03:04:32.986308 | 2021-06-30T18:25:52 | 2021-06-30T18:25:52 | 380,136,984 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,050 | cpp | PermutationOfTheOthers.cpp | // Given two strings, check if one is a permutiation of the other
// i.e cba is permutation of abc
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
bool isPermutation(std::string &str1, std::string &str2){
if(str1.size() != str2.size()){
return false;
}
std::sort(str1.begin(), s... |
91769e03db01dc1b6ffb7f4813650928286460a7 | 7685e9822983b65187fba2ca6c269cc0f8a88890 | /clang/Power/Power.cpp | 0054a83197f3ec65ed607e14d7aaefb92bbe0e34 | [] | no_license | eush77/mix-examples | 1e13b0eb272a3e9d5c60959516877f8b70cf4e69 | 309fa8f6bbef7dfbcb74688b519c9bc3f60d2d54 | refs/heads/main | 2023-08-22T14:19:30.342708 | 2021-09-25T23:41:38 | 2021-09-25T23:41:38 | 167,862,084 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,128 | cpp | Power.cpp | #include "../Compiler.h"
#include "PowerLin.h"
#include "PowerLog.h"
#include "benchmark/benchmark.h"
#include <string>
namespace {
void BM_PowerLin(benchmark::State &S) {
unsigned N = S.range(0);
for (auto _ : S)
benchmark::DoNotOptimize(powerLin(2, N));
}
void BM_PowerLinMix(benchmark::State &S) {
uns... |
efcc83ff6d9e63f0867d4c5f96237e6f5e6e3414 | 5a1d3819eb0179b8571868216fbf7c35fe163c9a | /09_10_strings_dynamic_memory/01/01.cpp | 82a8f77491eb5c73637c5c2fb44ecc38524836e4 | [
"MIT"
] | permissive | SurPichuk/intro-to-programming-labs | 2aa60b9694c9cef4cb170fa64f07fd0487633db9 | 083bfaad1fdb423c0d8320b3e882316fa56c0bf8 | refs/heads/main | 2023-02-27T19:08:00.379893 | 2021-02-07T17:14:39 | 2021-02-07T17:14:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 236 | cpp | 01.cpp | #include <iostream>
const int MAX_LEN = 129;
int main()
{
char first_name[MAX_LEN];
char last_name[MAX_LEN];
std::cin >> first_name;
std::cin >> last_name;
std::cout << last_name << ", " << first_name << "\n";
}
|
16d62141b9061daa7a3d9eb69fcb02ffd2e4a128 | a4a158161808c77cdd4dd5a992b93a6e4ca6894c | /check_files.cpp | 6d608497019bd0538949cbcd474ac24ccc7c128c | [] | no_license | clmello/dropbox | 472b2ef1b80e6ead6f4667861e9257e2ef00b826 | 90aeaf4d0a82c4f685d14cc68616aeaf82705ec7 | refs/heads/master | 2020-05-14T22:56:31.522002 | 2019-07-01T11:20:52 | 2019-07-01T11:20:52 | 181,987,400 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,830 | cpp | check_files.cpp | #include <iostream>
#include <unistd.h>
#include <string.h>
#include <dirent.h>
#include <sys/stat.h>
#include <vector>
using namespace std;
int time_between_checks = 10;
struct file{time_t mtime; string name;};
vector<file> watched_files;
string path = "/home/alack/alack_syncdir";
void check_files()
{
int err =... |
667ad7d9c51873c80582f4e5a9c9345cb8966254 | 63935269eb5ebc37b63255aaa90cbd9798f3fcc9 | /CSC17A SPR14/Assignment 033114/CSC17A_Chap11_Prob5_032614/main.cpp | f1aa50a62f1d79e3f20d7fbe2431cb51ccfbdffc | [] | no_license | ttendohv/vh2436779 | 13f1ae76f2d2bd0a356515358f5207034d9f09e6 | 54bf58fbde45b087acf565f2f3bd65995f401bc4 | refs/heads/master | 2021-04-09T17:19:55.086782 | 2014-06-09T19:39:16 | 2014-06-09T19:39:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,268 | cpp | main.cpp | /*
* File: main.cpp
* Author: Victoria Hodnett
* Created on March 26, 2014, 1:44 PM
* Gaddis Chapter 11 Problem 5
* Weather Statistics
*/
//System Libraries
#include <iostream>
#include <iomanip>
using namespace std;
//User-Defined Libraries
#include "WthrStats.h"
//Global Constants
//Function Prototypes
v... |
3f73da50686ea375e568dafa6457bd01cd0b7716 | eca2965b6f3c9b887acf4842b7c4a5437ebbef6e | /1/wallFilmRegion/deltaf | c4668e0db2763d7518ae917c0d06b8b5c680f9f4 | [] | no_license | canesin/CasoSuperficiePlana | 9c2fa7a7c73bffa2b18d9647618178c38d85ea03 | bbfa4013c702ae7f2e895867297b096c9015b4d5 | refs/heads/master | 2016-09-05T23:07:15.957094 | 2012-06-27T21:37:21 | 2012-06-27T21:37:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 46,111 | deltaf | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.1.x |
... | |
04e3ae9cd6028cc4232dcfcd2baba16ef7cfeb26 | fc9ec32670150cce44432b6b43dca6ae7e9a56bc | /codeforces/364/3-3.cc | a339ba95738e469000ca871769b988285067e937 | [] | no_license | ArthurEmidio/programming-problems | e3efc16ad826a6f4b43277b72ef90189aec868c7 | 16a8c3883649efaf1ab0475036f017638bfe343f | refs/heads/master | 2020-12-04T12:37:06.643514 | 2017-06-27T07:49:10 | 2017-06-27T07:49:10 | 65,958,563 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,308 | cc | 3-3.cc | #include <iostream>
#include <limits>
#include <cmath>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define ll long long
int main()
{
int n;
cin >> n;
vector<char> seq;
set<char> pokemons;
for (int i = 0; i < n; i++) {
char c;
cin >> c;
se... |
9a5f5c149ba5d3165a72cb446ae33f5de6459a4d | c7c70c3177c7724be8775da5e85c5cb62f02e262 | /src/DgLocList.cpp | 3e53853304b686a98b8a6d89c1837c0862b5ca7c | [
"LGPL-2.0-or-later",
"MIT",
"LicenseRef-scancode-public-domain",
"AGPL-3.0-only"
] | permissive | pieterprovoost/dggridR | 190c658ac2284169d4006b82aceb70fc53a2d738 | c99eb5f97f90b919984a61815823266528372e19 | refs/heads/master | 2022-05-02T04:40:18.765693 | 2022-03-18T04:56:41 | 2022-03-18T04:56:41 | 239,110,945 | 0 | 0 | MIT | 2020-02-08T10:38:56 | 2020-02-08T10:38:56 | null | UTF-8 | C++ | false | false | 6,789 | cpp | DgLocList.cpp | #ifndef DGGRIDR
#define DGGRIDR
#endif
/*******************************************************************************
Copyright (C) 2021 Kevin Sahr
This file is part of DGGRID.
DGGRID is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License ... |
ead7200c9aa80c20a0a5aecfdb79b706d67136bf | 7f5b70e077be31580c729e552adab3d706b5c5db | /CFile.cpp | d26dfee82b55476a0b75e8f2d2cdd2bf2c3e730a | [] | no_license | Rubberbandits/1337io | af25b3f9c159f794d02848ccf80fb48e2f6425ec | 859bbb94222e8a5e4cf91fa6b049a66820190c36 | refs/heads/master | 2021-01-11T19:46:33.244719 | 2017-01-18T23:05:23 | 2017-01-18T23:05:23 | 79,393,725 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,875 | cpp | CFile.cpp | #include "CFile.h"
//note: i got lazy in the end
// will fix soon
CFile::CFile(lua_State* state) {
CreateNewInstance(state);
}
CFile::~CFile() {
}
int CFile::gcDeleteWrapper(lua_State* state) {
using namespace GarrysMod::Lua;
UserData* pUserData = static_cast<UserData*>(LUA->GetUserdata(1)... |
bd8ac32eab57ab919ff97658869e7044377f924b | 675ad919b372939fcc4cd2ccffd62817522caaad | /source/base/math/fourier/dft.hpp | aa604331bffcbf880051eda0a2640d9ee6e169d8 | [] | no_license | lineCode/sprout | 2308ff7de515c6499ffb5bf6889bf9ccebc6b2bd | ffaefc1c6ffd5f8fb6da3acbe98d05555586791e | refs/heads/master | 2020-04-05T06:15:25.954312 | 2018-11-07T09:41:57 | 2018-11-07T09:41:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 705 | hpp | dft.hpp | #ifndef SU_BASE_MATH_FOURIER_DFT_HPP
#define SU_BASE_MATH_FOURIER_DFT_HPP
#include "math/vector.hpp"
namespace thread {
class Pool;
}
namespace math {
int32_t dft_size(int32_t num);
void dft_1d(float2* result, float const* source, int32_t num);
void idft_1d(float* result, float2 const* source, int32_t num);
void... |
ed5831a94fef39e435cc022761fe148def0cc135 | f17ea5ae47d234dda1232b3e24a7c10cde9f69a5 | /Homework1/MaximumElem.cpp | 3bf920c4bd07801c4b41e9e121b933d7db00dc91 | [] | no_license | georgiharak/SDA-Homeworks | f6614ca702b418e087d1ab0cadfeafe4035bef2a | 130d5d75a1762b9f77a64420c76020030f1974c8 | refs/heads/master | 2021-08-10T17:46:13.578970 | 2017-11-12T21:10:29 | 2017-11-12T21:10:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,172 | cpp | MaximumElem.cpp | <<<<<<< HEAD
#include <iostream>
#include <cassert>
#include <queue>
using namespace std;
template <typename T>
struct node
{
T data;
node* next;
};
template <typename T>
class LStack
{
private:
node<T>* topNode;
void copy(node<T>* toCopy);
void eraseStack();
void copyStack(LStack const&);
pu... |
93eea9c928cbb07b2da730f9c7343bb1abe2253c | 98157b3124db71ca0ffe4e77060f25503aa7617f | /icpc/acpc2015/dna-evolution.cpp | 23c4500e8ad21818dcad0026bc1cafebf051a11c | [] | no_license | wiwitrifai/competitive-programming | c4130004cd32ae857a7a1e8d670484e236073741 | f4b0044182f1d9280841c01e7eca4ad882875bca | refs/heads/master | 2022-10-24T05:31:46.176752 | 2022-09-02T07:08:05 | 2022-09-02T07:08:35 | 59,357,984 | 37 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 1,560 | cpp | dna-evolution.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int a[N], b[N];
char s[N], cset[] = {'A', 'C', 'G', 'T'};
int idx[256];
bool isnot[N][5];
int main() {
for(int i = 0; i<4; i++)
idx[cset[i]] = i;
int t;
scanf("%d", &t);
while(t--) {
int n;
scanf("%d", &n);
for(int i = 0; i... |
f0da228ddbef5adf3c9ffa0f0a8d3fbc74ca05c9 | c8c31755a952e8fb424922cdd2b1cd59e0c3e9dd | /sessie_0/include/Labo1.h | c236592004eb153da027ed142010e85e83b57159 | [] | no_license | BramObbels/2018_LaboBeeldinterpretatie_BramObbels | 5237f1c04e17e8c3e79ba94d6beb5b5c6417e1ee | 964e5d2d04d7bbbca8a65697c84de7dce9943937 | refs/heads/master | 2020-04-01T23:05:35.955430 | 2019-01-07T21:35:26 | 2019-01-07T21:35:26 | 153,741,435 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 155 | h | Labo1.h | #ifndef LABO1_H
#define LABO1_H
class Labo1
{
public:
Labo1();
virtual ~Labo1();
protected:
private:
};
#endif // LABO1_H
|
21957334e13bcae2cb33b90eb71c19588efdceed | fb190dbcf224654567091f3e4bcb513d83343333 | /1035.cpp | 8a8aca5c5993a61afaba3a3bae8d16993c323ab9 | [] | no_license | SakhawatCoU/My-LightOJ-code | eb282729e15d49d24f42549f2d7450fed477d8ba | 797096c8ac2e771638d24b3638ef450a42d90b8b | refs/heads/master | 2020-04-05T04:08:51.951941 | 2019-04-19T06:53:44 | 2019-04-19T06:53:44 | 156,539,423 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,960 | cpp | 1035.cpp | #include<bits/stdc++.h>
#define lli long long int
#define scf(n) scanf("%lld",&n)
#define rep1(n) for(int i=1;i<=n;i++)
#define prf(n) printf("%lld",n)
#define sci(n) scanf("%d",&n)
#define pri(n) printf("%d",n)
#define prl(n) printf("%lld",n)
#define scl(n) scanf("%lld",&n)
#define nl printf("\n")
#define spc printf("... |
d622c2bb50bf8c38d0d03939be7a6074a094621c | 9e3c7efe760da59c53095cbfa264ad2b35112e44 | /videos/037_50_million_primes_in_5_seconds_segmented_sieve_of_eratosthenes/sieve_erat.cpp | 5a690e4e8208a4492a0f0ab7d4f936b1340d92ed | [
"MIT"
] | permissive | omerkulahci/VideosSampleCode | ea95272f7e9d9982691b3ed9b085798f16179d05 | 666f1e7aca47c1dc3b5445ab5b79746247bf3040 | refs/heads/master | 2023-08-28T12:06:42.982336 | 2021-10-23T14:28:30 | 2021-10-23T14:28:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,812 | cpp | sieve_erat.cpp | #include <string>
#include <vector>
#include <iostream>
#include <fstream>
#include <exception>
#include <cstdlib>
#include <algorithm>
using Int = uint64_t;
template <typename T, typename = std::enable_if_t<std::is_integral_v<T> && std::is_unsigned_v<T>>>
constexpr T largest_squarable()
{
return (static_cast<T>(... |
1f1e98a28d48a640f2efff979838a5f17da6909a | 31ef5e4afc9f3392e3110a2fb62e1a5d5032e119 | /src/moaicore/MOAITextLayout.h | 5461db85081419840f7eb2fa2532a422487f2277 | [] | no_license | kengonakajima/moai-dev | f16597c6369ff8846b50141da684d7278d8e153f | f1995014a9f30e1c9bf23a3823d9bbf8bd30a608 | refs/heads/master | 2021-01-16T22:52:14.755836 | 2012-01-20T21:31:48 | 2012-01-20T21:31:48 | 3,116,345 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,357 | h | MOAITextLayout.h | // Copyright (c) 2010-2011 Zipline Games, Inc. All Rights Reserved.
// http://getmoai.com
#ifndef MOAITEXTLAYOUT_H
#define MOAITEXTLAYOUT_H
class MOAIGlyph;
//================================================================//
// MOAITextSprite
//=============================================================... |
3ccb811b521551e17d6340ddf617f9b1aca91928 | 8ec52fb474c6f754c548cb99bd2e389213443ef5 | /include/http/HttpClientBase.hpp | 89d7452056df596891132d84fa0bc8a1896a8d0f | [
"MIT"
] | permissive | sroycode/identt | 443cb55ad43f5903e1d06543ded28864cbaa6bf8 | 40bffa3d8db69c810c4d6707b9eb32f983539c99 | refs/heads/master | 2022-03-08T09:52:07.487528 | 2019-11-16T12:46:03 | 2019-11-16T12:46:03 | 105,420,001 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,215 | hpp | HttpClientBase.hpp | /**
* @project identt
* @file include/http/HttpClientBase.hpp
* @author S Roychowdhury <sroycode AT gmail DOT com>
* @version 1.0.0
*
* @section LICENSE
*
* Copyright (c) 2017 S Roychowdhury.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated d... |
0838b6efb91d9275405c6a9570c36630a499a3d3 | 4781859a7843d1cf3f29b735971759b298dca4f1 | /test.cpp | a5d87fc6ad013e8a0629541669c577456d0041d3 | [] | no_license | Nipuna-Sankalpa/concurrent_lab_4_5 | 5cac3edc5cd072d26b5ed6d361bd9688c62b27b3 | 5c8f2fe3bc4695f8fbaeb2c7ef833fd7c9acc66b | refs/heads/master | 2020-02-26T17:08:15.887964 | 2016-10-09T02:20:59 | 2016-10-09T02:20:59 | 69,781,647 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,855 | cpp | test.cpp | //#include <iostream>
//#include <vector>
//#include <omp.h>
//#include <emmintrin.h>
//#include <immintrin.h>
//
//
//#define size 1000
////#define block_size 100
//
//
//double a[size][size];
//double b[size][size];
//double transpose[size][size];
//double output[size][size];
//double count_1 = 0;
//
//int main() {
/... |
2a6b43bfde1b3640c1670fe7444419f38320751e | 0f2b08b31fab269c77d4b14240b8746a3ba17d5e | /onnxruntime/core/providers/cpu/math/top_k.cc | 96d1f7a7578cf3a1358ab93f004deb4d1450cabb | [
"MIT"
] | permissive | microsoft/onnxruntime | f75aa499496f4d0a07ab68ffa589d06f83b7db1d | 5e747071be882efd6b54d7a7421042e68dcd6aff | refs/heads/main | 2023-09-04T03:14:50.888927 | 2023-09-02T07:16:28 | 2023-09-02T07:16:28 | 156,939,672 | 9,912 | 2,451 | MIT | 2023-09-14T21:22:46 | 2018-11-10T02:22:53 | C++ | UTF-8 | C++ | false | false | 27,416 | cc | top_k.cc | /**
* Copyright (c) 2016-present, Facebook, Inc.
*
* 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 ... |
2953a26cdc5a02d83ecd07ce4460d5c534f76ace | dffe85dc3aa2ba6bc3f71ff37ed0b9258f95c56d | /WordCounts/WordCounts.cpp | a760d63562e6f18d3aa5cb36107f006e7c55655e | [] | no_license | assuntad23/COMP302 | c3919e497437abdeca003f11c8afec07e773ee9c | 97faceff2aea89739aa5144b8f1d27a7be33fd5f | refs/heads/master | 2020-11-24T03:09:47.603964 | 2019-12-14T00:06:48 | 2019-12-14T00:06:48 | 227,940,543 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 609 | cpp | WordCounts.cpp | /*
* WordCounts.cpp
*
* Created on: Nov 12, 2017
* Author: Assunta
*/
#include <map>
#include <string>
#include "IOFile.h"
#include "EditingAndCounting.h"
#include <fstream>
int main(int argc, char **argv) {
//creating instances of each class
IOFile newFile;
EditingAndCounting changingFi... |
3b7fb076f66aec54ec6471bf2bda33da2ca3ebfb | 24624d31f20eb22aafbf8b2e7a6941438d4f511d | /TG/SHA-3/keccak_tests.cpp | 8634ed693f19de87fa4403d88c68e9f47609a45d | [] | no_license | quenio/INE5429 | 360bb4754a86e1227af0010bf3c25e99f180cddc | bc4dc2306b796fffb256187a178b1391400bfb94 | refs/heads/master | 2021-03-30T17:32:51.731737 | 2016-07-10T22:59:15 | 2016-07-10T22:59:15 | 56,092,006 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,244 | cpp | keccak_tests.cpp | // Copyright (c) 2016 Quenio Cesar Machado dos Santos. All rights reserved.
#include "min_unit.h"
#include "keccak.h"
#include "samples.h"
const char * rnd_SA2()
{
using SA2 = StateArray<2>;
using BS50 = BitString<50>;
const char *s1 = "01100110011001100110011001100110011001100110011001";
const char ... |
bea9352474c82daaf4f75b5416fe67c0286532db | 089a304d34a65c8411ffcae8326bfe5efa7599e5 | /lab1/Class_Truba.cpp | 8f94119523ec79070a78f249a39542895d1dc0d4 | [] | no_license | Kirill0077/lab1 | fb796efb388ce4b58db5c591015f701232eb959a | 510e7ce754e69d14d5b3fc99a4a776c272c6e80e | refs/heads/master | 2023-02-22T13:10:09.411464 | 2021-01-18T09:55:57 | 2021-01-18T09:55:57 | 296,062,923 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 1,701 | cpp | Class_Truba.cpp | #include "Class_Truba.h"
#include "utils.h"
using namespace std;
int Class_Truba::MaxID = 0;
Class_Truba::Class_Truba()
{
id = ++MaxID;
Length = 0.0;
Diameter = 0;
repair = false;
start = -1;
finish = -1;
wt = 0.0;
}
int Class_Truba::getid() const
{
return id;
}
int Class_Truba::getMaxID()
{
return MaxID;... |
81ff5bd226c05d66bcdb9a13e9cda082b1d5e5cd | 17a8158b5f01f9a2389528a6a8987ea582f34255 | /project_graph/network.h | ff379f51e6d7493c3b4d63755b6ac62ad0bac1b4 | [] | no_license | HaoPai/my_algorithm | 2d272e971912fcdb73bf1e78b878531ab1684008 | 75fedf03db6fdbb07590a857deee17ca3f71f7b6 | refs/heads/master | 2020-04-25T14:10:56.504341 | 2019-08-03T11:36:16 | 2019-08-03T11:36:16 | 172,832,735 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,683 | h | network.h | #ifndef _GRAGH_H_
#define _GRAGH_H_
#define N 100
#define COMMAND_N 20
#include <iostream>
#include <string>
#include "extended_queue.h"
#include "linked_list.h"
struct Edge_node{
int node_one;
int node_two;
int weight;
Edge_node *link_one;
Edge_node *link_two;
Edge_node();... |
e2ab4e651bf2aec4d11f7f2f7b7d03e328cf11bd | f512c5399ebdee530c0afd353a3ba60e485005bc | /DataLink-20210102T112455Z-001/DataLink/DLFIT.CPP | 3bc296362eb84e6ac9307bcdb922e289fc045039 | [] | no_license | AlexShu88/DieboldEmbedded | 4714d919c290a8e49d6dec79f970220d54ddd831 | 38430dd4c9553770c7dbb988f6de9cc52477cc29 | refs/heads/master | 2023-02-06T07:25:07.442766 | 2021-01-02T11:31:25 | 2021-01-02T11:31:25 | 326,168,748 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,384 | cpp | DLFIT.CPP | /******************************************************************************
* *
* DLfit.cpp: Defines the variables access from fit.ini *
* ... |
300646049ecc5b9bb12e66d615e3638df9a445a5 | 3b135513722e6c9ce54e20cf90567b3215256686 | /PingPongBuffer.cpp | e70206a69464bfe41042e01c14988371510aaf53 | [] | no_license | frozenbanana/simpleComputeShader | de83b956cc7d5071ef23467eb35582896f816d07 | e17b99b70d628d686fded374bbb26a684a552eff | refs/heads/master | 2021-01-25T11:55:53.367565 | 2018-03-30T11:37:28 | 2018-03-30T11:37:28 | 123,443,214 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,379 | cpp | PingPongBuffer.cpp | #include "PingPongBuffer.hpp"
#include "GLOBALS.hpp"
//Private
void PingPongBuffer::createBuffer(GLuint buffer_id) {
//Bind2DTextureTo(buffer_id, COMPUTE_TEX);
//glBindTexture(GL_TEXTURE_2D, buffer_id);
glTexImage2D(
GL_TEXTURE_2D,
0, //Mipmaps
GL_RGBA, //Internal format //GL_RGB16F
... |
7de85f689df638ae15a3a2c90e6eaea27d9f97af | c3753013b2cca01be0e4d099258316a54fb753b7 | /src/surqueue.cpp | dea49c3d2a159839832aa25e1e989f2062c5bfd6 | [] | no_license | gamedolphin/Sur | 18d713205f64b183d2678ba6c06efcc7659e0b2e | ef67808fd0dd9a025a2e248c744eca893a977d14 | refs/heads/master | 2021-01-10T11:13:23.335996 | 2015-11-17T19:57:49 | 2015-11-17T19:57:49 | 46,120,060 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,047 | cpp | surqueue.cpp | #include "surqueue.h"
int num = 0;
void Sur::thread_ChangeQueue(Sur::Queue *q, AVPacket *packet, Sur::queue_modify state) {
std::lock_guard<std::mutex> guard(q->lockQueue);
switch(state) {
case Sur::INSERT:
q->packetList.push_back(packet);
break;
case Sur::REMOVE:
if(q->packetList.empty()) {
... |
9e9d571cc10824d8b8e09544bb282da5df481f15 | eb7f2f5953dfd0d066ed6727df3a554b705ce8cc | /sw/src/uquad/control/blocks/pe/ekf2/RingBuffer.h | 8387a97c952011b7761baa810b7431eb5b5e97e7 | [] | no_license | zangel/uquad | 3de785a04ad9bd6e5a146caf1eefa186ba58efd4 | 7a314f1a2f2a0db549251c48aba991c5cce4d585 | refs/heads/master | 2021-01-21T12:58:12.805486 | 2016-06-02T22:21:35 | 2016-06-02T22:21:35 | 51,906,573 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,092 | h | RingBuffer.h | #ifndef UQUAD_CONTROL_EKF2_RING_BUFFER_H
#define UQUAD_CONTROL_EKF2_RING_BUFFER_H
#include "../Config.h"
#include "../../base/Time.h"
namespace uquad
{
namespace control
{
namespace ekf2
{
template <typename T, int N>
class RingBuffer
{
public:
RingBuffer()
: m_Head(N - 1)
... |
814103a98900ce4a8c116ac75d86f0530f72c78f | ea401c3e792a50364fe11f7cea0f35f99e8f4bde | /hackathon/itk_vaa3d_plugins/examples/Segmentation/DeformableModel2.cxx | b59b6e5712fd8ef2fb323f0189b47192ecd82d6d | [
"MIT"
] | permissive | Vaa3D/vaa3d_tools | edb696aa3b9b59acaf83d6d27c6ae0a14bf75fe9 | e6974d5223ae70474efaa85e1253f5df1814fae8 | refs/heads/master | 2023-08-03T06:12:01.013752 | 2023-08-02T07:26:01 | 2023-08-02T07:26:01 | 50,527,925 | 107 | 86 | MIT | 2023-05-22T23:43:48 | 2016-01-27T18:19:17 | C++ | UTF-8 | C++ | false | false | 5,664 | cxx | DeformableModel2.cxx | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* 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
*
* h... |
0951da6a418456a39af556c7ee609616c8a1991c | e6979549bf0f2af86b5bdd52a1e25853f2506e8a | /1085/Main.cpp | 2ad10b9572f3ae5b1955897bc723086f7cf2c2df | [] | no_license | guithin/BOJ | 9a3becbbae58c03130c1545cdb0985efd2563f63 | d525f441e864fc07a21649d39273f0ac1e3158ac | refs/heads/master | 2021-07-05T19:25:18.547317 | 2020-08-03T01:47:34 | 2020-08-03T01:47:34 | 144,382,439 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 166 | cpp | Main.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
printf("%d\n", min({a, b, c-a, d-b}));
return 0;
} |
102d85d2ecb34a4baf67500d2e4363485459e091 | 91ab2d7a747ceb93a0345af6de1b1a4a1075d095 | /Assignment 2 CK/Student.h | eb6127f092c6f8c4e4b5ff340a9863b74b0d5bbd | [] | no_license | kimballc/Assignment-4-CK | 3355fa2eb99a0a70596f0d6723af7ffe3a9bd3d3 | 3589cde4f598d3ef40134f553d9b86df3d0ea8d4 | refs/heads/master | 2021-07-25T20:41:28.798556 | 2017-11-07T23:21:33 | 2017-11-07T23:21:33 | 109,900,303 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 714 | h | Student.h | #ifndef STUDENT_H
#define STUDENT_H
#include <string>
using std::string;
class Student
{
public:
//Default Constructor
Student();
//Initializer Constructor
Student(int, const string &, int, const string &, const string &);
~Student();
//Getters
string getName() { return name; }
int getYear() { return year; }... |
ea6074573bfed3bf28dc04206a4c2f3ad6b53e31 | 6ce049ad0073d7d5e14efde081c94d9432a15d35 | /Gi/codeforces/546A.cpp | 6bb08cdc6576730135d531a3039cd7bfa697b557 | [] | no_license | yancouto/maratona-sua-mae | 0f1377c2902375dc3157e6895624e198f52151e0 | 75f5788f981b3baeb6488bbf3483062fa355c394 | refs/heads/master | 2020-05-31T03:26:21.233601 | 2016-08-19T03:28:22 | 2016-08-19T03:28:37 | 38,175,020 | 6 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 443 | cpp | 546A.cpp | #include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include <map>
#include <string>
#include <algorithm>
#include <climits>
#include <queue>
using namespace std;
int main () {
long long n, k, m;
scanf("%lld %lld %lld", &k, &m, &n);
long long cost = (1 + n)*n/2;
m-= k*cos... |
102e20a940876e08ee5f61694edc692d8977d220 | 52650478ba94d5d693953eefa896b56fc3b62523 | /squirrel_tracer/Squirrel tracer.h | c16116c5dfc5c5d8f540636501f0a86921f6e5e0 | [] | no_license | brliron/Thcrap-patches | 418e591202ef6e80f06aadedc6178523288279be | d7177a0b7d0e83ef025dd409759463529a49f031 | refs/heads/master | 2021-04-28T10:42:06.422832 | 2018-04-20T14:30:44 | 2018-04-23T06:55:26 | 122,072,203 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,615 | h | Squirrel tracer.h | /**
* Touhou Community Reliant Automatic Patcher
* Squirrel tracing plugin
*
* ----
*
* Main include file.
*/
#pragma once
#include <thcrap.h>
#include <stdio.h>
#ifdef Yield
# undef Yield
#endif
#include <new>
#define private public
#include "squirrel\include\squirrel.h"
#include "squirrel\squirrel\s... |
230eb70221c6e58a4e0ba8470ee4f87f21e6839c | 3f7028cc89a79582266a19acbde0d6b066a568de | /source/extensions/filters/http/on_demand/on_demand_update.cc | 2325f81d47f3d5eb9da685227704b8fd4bd5dc4a | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | envoyproxy/envoy | 882d3c7f316bf755889fb628bee514bb2f6f66f0 | 72f129d273fa32f49581db3abbaf4b62e3e3703c | refs/heads/main | 2023-08-31T09:20:01.278000 | 2023-08-31T08:58:36 | 2023-08-31T08:58:36 | 65,214,191 | 21,404 | 4,756 | Apache-2.0 | 2023-09-14T21:56:37 | 2016-08-08T15:07:24 | C++ | UTF-8 | C++ | false | false | 9,305 | cc | on_demand_update.cc | #include "source/extensions/filters/http/on_demand/on_demand_update.h"
#include "source/common/common/assert.h"
#include "source/common/common/enum_to_int.h"
#include "source/common/common/logger.h"
#include "source/common/config/xds_resource.h"
#include "source/common/http/codes.h"
#include "source/common/http/utilit... |
ee46be100c49250a2aa1886330d364ce32c7f8c6 | 9eb6dc0cf2553b29bba51ab8143081f6175c5c10 | /Arduino/UDOOGrove01bis_irDistance/UDOOGrove01bis_irDistance.ino | 866df0d3d2d59cebc4d2fedc1ae3b6696ee4b819 | [] | no_license | gionji/UDOOGroveLamp | fc1f095a6c91b3699a8b7681c7684a4b78a9a644 | fd57e78a613dda65f7c6d5c496653373cb8e1824 | refs/heads/master | 2021-03-12T21:18:12.764405 | 2017-06-28T16:54:28 | 2017-06-28T16:54:28 | 91,459,258 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,063 | ino | UDOOGrove01bis_irDistance.ino | #define IR_DISTANCE_PIN A0
#define DIST_IN_TH 100
#define CYCLES_TH 4
#define IR_CLOSEST_VALUE 775
#define IR_FAREST_VALUE 200
void setup() {
Serial.begin(9600);
Serial.println("UDOO Grove Happy Lamp! Step O1: IR distance sensor");
}
int cyclesUnderTh = 0;
int lightIntensity = 255;
void loop() ... |
7ee879333c7e159f8d11198f4621c545a5a42c51 | 6d427c7b04cb92cee6cc8d37df07cf8b129fdada | /100 - 999/495.cpp | 252d20bd1120e548b058b7c2a165f23e831c53ac | [] | no_license | FForhad/Online-Judge-Ex.-Uva-Solutions | 3c5851d72614274cafac644bcdbc9e065fd5d8d8 | b7fdf62d274a80333dec260f5a420f9d6efdbdaf | refs/heads/master | 2023-03-20T23:47:30.116053 | 2021-03-10T02:07:49 | 2021-03-10T02:07:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 963 | cpp | 495.cpp | #include<bits/stdc++.h>
using namespace std;
vector < string > fi;
string s="1";
string s2="1";
void fibo(int n);
int main()
{
fi.push_back("0");
fi.push_back(s);
fi.push_back(s2);
fibo(3);
int t;
while(scanf("%d",&t)==1)cout<<"The Fibonacci number for "<<t<<" is "<<fi[t]<<endl;
return 0;
}
... |
c5cd0995cf5ec5bb823115a13da83a7a17555c4c | 287f3f626f6df4a9ca7ce0b2525709287598d021 | /lab3/MyData.h | 16cd852b992aa462dad2a5b75b65d87660cfd333 | [] | no_license | OlegFilatovS/Cpp_C20 | 709447bf3104c8bc8e14d08aacc52d4c1dad21e0 | a00179662d1e26aa4e31f2aee5cba57642227d71 | refs/heads/master | 2021-01-19T23:57:47.457028 | 2017-04-23T20:12:43 | 2017-04-23T20:12:43 | 89,057,442 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 557 | h | MyData.h | #pragma once
#include "MyString.h"
#include <iostream>
enum Sex { MALE, FMALE };
class MyData {
Sex m_sex;
size_t m_age;
MyString m_job;
float m_salary;
public:
MyData():m_sex(MALE), m_age(0), m_job("Homeless"), m_salary(0) {}
MyData(Sex s, size_t age, const char* job, float sal):m_sex(s), m_age(age), m_jo... |
42ab9d0cb3e536b7a2fb43fee86353d7134b0f89 | 078a91271cee72c9bdee5c15adcc995164d51cc4 | /coinChangingMinimumCoin.CPP | f87ea71a1c5cf96ff0512c7bb826e0f83597e573 | [] | no_license | PurushottamParakh/DynamicProgramming | 854a33b28c0def7cdbee80e8179408dd501149e0 | 6fdb4f6758221e28571218b45b43ccf98c88daa1 | refs/heads/master | 2020-03-06T23:05:39.024907 | 2018-04-03T14:44:41 | 2018-04-03T14:44:41 | 127,123,305 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,351 | cpp | coinChangingMinimumCoin.CPP | // Example program
// Example program
#include <iostream>
#include <string>
#include <vector>
#include <climits>
using namespace std;
int minimumCoinBottomUp(const vector<int> &coins, int total, vector<int> &R){
vector<int> T(total+1,INT_MAX-1); // INT_MAX - 1 is very important because of comparison T[i] > 1 + T[... |
3667c2d8c7431ae618b6173de81982ac1c8aee55 | da5ef784a276d243b57027b6bb4872059baff110 | /oop_eng/e1/sub1/sub1/task1.cpp | 3ed5eedc41ce3244416d98e3e97c1424d0172a22 | [] | no_license | xlujiax/ii | 485999a432dff0ab02b3486205de6be113655dde | e5d788c6fc2fbcc2f74838354b10bb5aa33574a3 | refs/heads/master | 2021-01-16T21:41:32.691493 | 2012-04-30T14:56:21 | 2012-04-30T14:56:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 229 | cpp | task1.cpp | // This program is made by Maciej Pacut
#include <iostream>
#include <string>
int main( unsigned int nrargs, char* args [] )
{
std::string name = "Maciej Pacut";
std::cout << "good morning, " << name << "\n";
return 0;
}
|
836098dfccfd3c0b41c3e5ed9dcbdda1bfa0e939 | b6d354b56e62b32223a928c515366af3eee7ecc8 | /E.T. Phone Home/E.T. Phone Home/Movable.cpp | 362735ca5a7271e4f68d28983b102972c4343d31 | [
"MIT"
] | permissive | SamuelKnox/Galaxa | b38b48ce74cccb465dabc31d7a9639d35ea60785 | 7c775708a2472d77daae3004d9d76ec80d8a8585 | refs/heads/master | 2021-01-22T02:59:05.587288 | 2015-12-05T06:11:31 | 2015-12-05T06:11:31 | 46,824,809 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 327 | cpp | Movable.cpp | #include "Movable.h"
Movable::Movable()
{
}
Movable::~Movable()
{
}
void Movable::Update() {
Collidable::Update();
UpdatePosition();
}
void Movable::UpdatePosition() {
Vector2D oldPosition = GetPosition();
float newX = oldPosition.x + velocity.x;
float newY = oldPosition.y + velocity.y;
SetPosition(newX, ne... |
c66f4f1d99e16234bcfe0e55e88ded0b2ef11492 | 236af97167b740004b9264505f4ac4b720910bcd | /GameManager.h | 5f7b38c5779c26c539c4817605c54b64e242db11 | [] | no_license | AdamFilet/FPS-Simulator | f8c000c243f742d9916bf45774a61a601f645fe9 | 17b00aab1ba3c7eb30b4970b53b06c9fa2fe36ba | refs/heads/main | 2023-01-20T04:14:11.734555 | 2020-11-25T22:52:49 | 2020-11-25T22:52:49 | 313,433,235 | 0 | 1 | null | 2020-11-25T22:39:57 | 2020-11-16T21:37:25 | C++ | UTF-8 | C++ | false | false | 957 | h | GameManager.h | #pragma once
#include <iostream>
#include <vector>
#include "Player.h"
#include "Team.h"
#include "weapon.h"
#include "config.h"
#include "fight.h"
#include <iomanip>
class GameManager
{
private:
std::vector<Fight> _fights;
Team _team1;
Team _team2;
int32_t _team1Score;
int32_t _team2Score;
int... |
a25f48ffe4b20b0a340208968796148a01d89552 | f853bbc7e34f8838ef413c1ef2c03012f537e203 | /zad3-zalazek/inc/wektor.hh | ddb3489947f9cad40b6e1b9b9da06c7781e5358b | [] | no_license | Kazlouski255912/Zadanie3 | e0214ea754d8dcf94da0621ba021c0a29dd39a5c | 46e59112af3d2845fd51435bed798cdf7dec610a | refs/heads/master | 2022-04-23T00:51:50.032996 | 2020-04-27T21:00:22 | 2020-04-27T21:00:22 | 259,452,200 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 365 | hh | wektor.hh | #include<iostream>
#include"size.hh"
class wektor
{
protected:
int arr[SIZE];//inicjalizacja wektora wyrazow wolnych
float niew[SIZE];//inicjalizacja wektora znaczen niewiadomych
float Eps[SIZE];//inicjalizacja wektora blada
public:
//protypy funkcyj
void Wyswietl() ;
int & operator[](in... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.