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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b9fb713dc9e98d87967d7d0263f0c6e4076c8b98 | 0303903be55485c95358c2dd83e13fa1fcaa0784 | /문자열.cpp | c23a80e389fcc0f6c915eb55e7adc92ca3c75c8b | [] | no_license | nasemY/coding | 06dd5a1a9371fcaaf24d138ac9b8c75c3fd86792 | 615dc9e4f5f211a644273909358c0abc45306e8f | refs/heads/master | 2020-09-15T17:33:42.304647 | 2020-05-23T02:57:23 | 2020-05-23T02:57:23 | 223,516,572 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 258 | cpp | 문자열.cpp | #include <stdio.h>
#include <string.h>
int main() {
char str1[10];
char str2[10];
int a=0;
scanf("%s %s",str1, str2 );
for (int i = 0; i < 10; i++) {
if (str1[i] != str2[i]) {
a = 1;
break;
}
}printf("%d", a);
return 0;
} |
f01cb827c722c82b4f7b502fb3c87bbacaf4301a | 6b40e9cba1dd06cd31a289adff90e9ea622387ac | /Develop/mdk/MiNet/include/MCommandHandler.h | 7c66b17c3bdbd11bbd42c76b749dedd54a071796 | [] | no_license | AmesianX/SHZPublicDev | c70a84f9170438256bc9b2a4d397d22c9c0e1fb9 | 0f53e3b94a34cef1bc32a06c80730b0d8afaef7d | refs/heads/master | 2022-02-09T07:34:44.339038 | 2014-06-09T09:20:04 | 2014-06-09T09:20:04 | null | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 1,007 | h | MCommandHandler.h | #ifndef _MCOMMAND_HANDLER_H
#define _MCOMMAND_HANDLER_H
#include "MiNetLib.h"
#include "MiNetCommon.h"
#include <vector>
using namespace std;
namespace minet {
class MCommand;
class MCommandCommunicator;
class MCommandHandler;
typedef MCommandResult (MCommandHanderFunc) (MCommand* pCommand, MCommand... |
3b493de2ba1d39fa0f86ce4f6b6b86a9020344ae | e61263d248ca198d7efecf199cf14f029524c6c1 | /ECS/src/GraphicSystem.cpp | 654337e62208cb7be243604b097d027952c9a1dc | [] | no_license | kharyus/Cpp-Exercises | 694227cac76d95c3a7d54aa06ca9f4487da0ccbb | 4c776bd9cc9718dcdbe7c5d16327629d09c2ba4c | refs/heads/master | 2021-01-18T03:08:58.260434 | 2017-03-08T03:24:09 | 2017-03-08T03:24:09 | 84,269,190 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 297 | cpp | GraphicSystem.cpp | #include "GraphicSystem.h"
#include <iostream>
using namespace std;
GraphicSystem::GraphicSystem(std::vector<Entity*>* entities)
: System(entities)
{
//ctor
}
GraphicSystem::~GraphicSystem()
{
//dtor
}
void GraphicSystem::update()
{
cout << "Graphic System updated" << endl;
}
|
39ce21da5a321e0490a2a021585162108b915132 | a0faeee77ad38b760e623429d13249706cba4673 | /Trees/inorderTraversal.cpp | b2e30a9e54a8912f5beb569d4b0170c391172b38 | [] | no_license | smunj/InterviewBit | 2ff8b8d8f5e0a8d7de02bd94c9c354c08d71eba5 | dc00051fee00daf4057cd52ffa25d5eb85a21374 | refs/heads/master | 2020-03-17T14:37:12.580360 | 2018-06-13T05:07:43 | 2018-06-13T05:07:43 | 133,679,765 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 798 | cpp | inorderTraversal.cpp | /**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
struct node{
TreeNode* root;
};
vector<int> Solution::inorderTraversal(TreeNode* A) {
stack<node> s;
vector<int> ... |
dcf84287b8aa3d358cabd78049932f6461b2b695 | d109d703edcb82f376e3c7c6d146aa4ba52644a0 | /Shared/IceBoxPruning_BruteForce.cpp | 7ffb83638c91231b31f7f93c891df5749c4d5be3 | [] | no_license | rygorous/BoxPruning | 56bc455667eb1846426111ed4f742d2f23a81d27 | d470931ba53cbf8cc4789679c613049231e38b4a | refs/heads/master | 2021-01-19T10:09:57.697953 | 2017-02-26T07:48:56 | 2017-02-26T07:48:56 | 82,166,558 | 10 | 1 | null | 2017-02-16T10:02:46 | 2017-02-16T10:02:46 | null | UTF-8 | C++ | false | false | 3,611 | cpp | IceBoxPruning_BruteForce.cpp | ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/**
* Contains code for box pruning.
* \file IceBoxPruning.cpp
* \author Pierre Terdiman
* \date January, 29, 200... |
d8233189aa68cffb22a0cfb62d83e6fbe13105b7 | 8ff6c046964f20e9452bf581a75d197ea0c658c2 | /Sorting/BoubleSort.h | 78bd2d4dfc3e498269de393a006c90d893aa5b60 | [] | no_license | TomSms/study | db627c23a95550e713af4f7e02d4f55965d6d3e5 | 4729970b0665557b55623d278b4ca297bd2af401 | refs/heads/master | 2021-09-10T15:35:46.446776 | 2018-03-28T16:51:02 | 2018-03-28T16:51:02 | 105,613,321 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 213 | h | BoubleSort.h | #pragma once
#include "CCSort.h"
class BoubleSort :
public CCSort
{
public:
BoubleSort(bool flag);
virtual ~BoubleSort();
virtual void sort(int *arr, int len);
virtual void boubleSort(int *arr, int len);
};
|
15b65a01c8321acf31591f25c77545b2046aca6c | 725ca110592c55de3d9f26ae9afbe0d14a235ba0 | /Queues/Queues.cpp | d89a3ccc9effd16ec4938a99e01ba3bc14bc15ab | [] | no_license | lumeyus/Queues | 1fadbb5ccd9d1fffc63a773fe3379682794e11c2 | 7f6ea07ce3ffcce5aca1323e8e4d9a02f4bb7b1c | refs/heads/master | 2021-02-18T18:14:29.293977 | 2020-03-06T02:17:00 | 2020-03-06T02:17:00 | 245,222,085 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 712 | cpp | Queues.cpp | /*
Queues.cpp - Luis Ibanez - 3/6/2020
-----------------------------------
This file contains the 'main' function where program execution begins and ends.
Performs queue simulation based on details given in homework 3 description.
Runs through simulations for every queue type, asking user for output file name befo... |
fa3743e68e1430ba8a1f11ff7d3b39275751a3d3 | 00d541f55f05872f76521961bacdb776b78512f8 | /src/main.h | d7aa3d597f5febb9dfcd91dbf36c2767dfd10bd7 | [] | no_license | bcrusco/CUDA-Path-Tracer | c592dcdb42a45cf019a8a88dd2d749a8ff42606b | 23336835c837141401a8215225daccbb8e7fa23f | refs/heads/master | 2021-01-24T04:36:02.654403 | 2015-12-10T22:08:57 | 2015-12-10T22:08:57 | 42,607,287 | 23 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 712 | h | main.h | #pragma once
#include <GL/glew.h>
#include <GLFW/glfw3.h>
#include <cuda_runtime.h>
#include <cuda_gl_interop.h>
#include <fstream>
#include <glm/glm.hpp>
#include <glm/gtx/transform.hpp>
#include "glslUtility.hpp"
#include <iostream>
#include <sstream>
#include <stdlib.h>
#include <string>
#include "sceneStructs.h"... |
d74001dc1d45c4029a0dc7308f1f740516263c86 | 6a82b383545f4500df5c26afd17cf03e0e89d292 | /opendnp3/DNP3/MasterStates.cpp | 9d60c5205ced5022b94cebbe72c3d1ad04161d5e | [] | no_license | nitesh-agsft/internal-projects | 98f8de64c981601219ce07d80905a5d505beb310 | c2bd16857a9701795b4ad1ba932a0fa63577c98c | refs/heads/master | 2021-01-16T17:39:00.655783 | 2017-10-09T13:02:25 | 2017-10-09T13:02:25 | 100,011,951 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,918 | cpp | MasterStates.cpp | //
// Licensed to Green Energy Corp (www.greenenergycorp.com) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. Green Enery Corp licenses this file
// to you under the Apache License, Version 2.0 (the
// "... |
165a97fc7fa55b40e7b7e3ceff8e8bc1691a2c43 | 74c5c1ae823caf17fb49341476fe2b7e935fa220 | /reverbtuner/lv2_world.h | 9efe595fc56c0874379d1659559471117d34bbab | [] | no_license | sbergen/ReverbTuner | d6d892d2ce2714cfa421f76e5c8d793e798c4075 | 8eb9866ea1591d6ec4c96a93f26a05816cfbb05e | refs/heads/master | 2020-06-01T19:52:32.626140 | 2014-11-11T20:21:26 | 2014-11-11T20:21:26 | 26,501,944 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 742 | h | lv2_world.h | #ifndef REVERB_TUNER_LV2_LV2_WORLD_H
#define REVERB_TUNER_LV2_LV2_WORLD_H
#include <string>
#include <slv2/slv2.h>
namespace ReverbTuner {
struct Lv2World
{
Lv2World ();
~Lv2World ();
/// Return Value as float, free value struct
static float value_as_float (SLV2Value val);
/// Return value as string, free v... |
ce7a6f8e6d34e60cd085fcc2d78b5c4838a0f77c | 28cd1ad933a9453f0d2a69b6501c2ef467ca31b3 | /UnitTests/Test_Dumps_tape.cpp | bec6a51eeb3cd81b2a90c8872d6ac01c2fe5cced | [
"MIT"
] | permissive | Tom1975/CPCCore | f7f013b51c181936a39977a0d46435c11279dce6 | e5cdf7de5984c87b28832c69cb337a492bb0ff2a | refs/heads/master | 2023-08-17T14:49:10.648628 | 2023-06-09T11:29:02 | 2023-06-09T11:29:02 | 153,919,452 | 6 | 1 | MIT | 2023-08-10T07:50:56 | 2018-10-20T15:24:43 | C | UTF-8 | C++ | false | false | 39,676 | cpp | Test_Dumps_tape.cpp |
#ifdef _WIN32
#define _CRT_SECURE_NO_WARNINGS
#define _CRT_NONSTDC_NO_DEPRECATE
#endif
#include <iostream>
#include "gtest/gtest.h"
#include "TestUtils.h"
#define BUILD 1
#define EXECUTE 0
////////////////////////////////////
// PROTECTIONS
////////////////////////////////////
///////////////////////////////////... |
39e4862a2eda8ac74d25e6643c015bb8628bb2d1 | f1ee65fbe1ffc43c2aac45e41515f1987eb534a4 | /src/net/third_party/quiche/src/quiche/quic/core/quic_packet_writer.h | c68465657dbd0e680e990c84b6e90a3f2ba04219 | [
"BSD-3-Clause"
] | permissive | klzgrad/naiveproxy | 6e0d206b6f065b9311d1e12b363109f2d35cc058 | 8ef1cecadfd4e2b5d57e7ea2fa42d05717e51c2e | refs/heads/master | 2023-08-20T22:42:12.511091 | 2023-06-04T03:54:34 | 2023-08-16T23:30:19 | 119,178,893 | 5,710 | 976 | BSD-3-Clause | 2023-08-05T10:59:59 | 2018-01-27T16:02:33 | C++ | UTF-8 | C++ | false | false | 8,280 | h | quic_packet_writer.h | // Copyright 2013 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.
#ifndef QUICHE_QUIC_CORE_QUIC_PACKET_WRITER_H_
#define QUICHE_QUIC_CORE_QUIC_PACKET_WRITER_H_
#include <cstddef>
#include <utility>
#include "absl/types... |
fe3ec722e305ad2aaac2b6b53438a3842b356e9e | 8373930d5cdf68dd02d13e05d48b7010aafa5a1f | /B3.Ejercicio4.cpp | c17397ef7f6a7f9b5f004ab9b76b7d2068aaf6fc | [] | no_license | mileznegriv/Cpp | c3921ba15f77e817621b29a5ad7b9815344b2935 | 72bcec22b89f961f3f088ca18070435addaedafc | refs/heads/master | 2022-11-29T09:38:30.511989 | 2020-08-06T02:17:59 | 2020-08-06T02:17:59 | 256,542,342 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 277 | cpp | B3.Ejercicio4.cpp | #include<iostream>
using namespace std;
int main(){
float numb;
cout<<"Type a number: ";
cin>>numb;
if(numb > 0){
cout<<"\nThe number is positive";
}
else if(numb < 0){
cout<<"\nThe number is negative";
}
else{
cout<<"\nThe number is s0";
}
return 0;
}
|
795e1f7aff2d5ca5bba81e7bae656d769f514d85 | 8406ad80bae3c83ced99cec9ffb909498edd6de4 | /算法/RMQ/st(稀疏表).cpp | ded85313757bb8911560ff1982f923073403ff16 | [] | no_license | CEHSIA/oi | d3c25baf5518a99e8d6066e113c7b159dc1b4df7 | 04c149b864812b997596fb839478eab900b5d30a | refs/heads/master | 2021-07-07T07:34:48.442015 | 2021-05-21T03:41:46 | 2021-05-21T03:41:46 | 123,156,081 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,849 | cpp | st(稀疏表).cpp | /*
dp[i][j]=max(dp[i][j-1],dp[i+2^j-1][j-1]);
理解:
i表示开始的位置
j表示往后数2^j个数的最大值
a b c d e f g h i j k l n=12 a~l表示12个数字
|-|-|-|-|-|-|-|-|-|-|-|-| j=0时i管辖区间
|---|---|---|---|---|---|
|---|---|---|---|---|-- j=1时i管辖区间
|-------|-------|-------|
|-------|-------|------
|-------|-------|----
|-------|--... |
340a1d55d89e24cf66fee5b89edac239ab961dd9 | acb896ff1b1845eded4451ffd618f2e1fa90b8f1 | /data-structures-and-algorithms-I/CLInterfaceBDList.cpp | 4bb2c067595949e53d72bc8f1bf194ca1964c042 | [] | no_license | bartoszpogoda/data-struct-and-algorithms-I | 2b9502c5563330308a01e6df20f02f78e0b05bd3 | 3389f56abd7343369523c874ef232d10cb69974e | refs/heads/master | 2021-01-19T21:08:36.268480 | 2017-04-22T14:28:31 | 2017-04-22T14:28:31 | 85,242,048 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,598 | cpp | CLInterfaceBDList.cpp | #include "CLInterface.h"
#include <sstream>
using namespace std;
BDList* CLInterface::testBDList = nullptr;
void CLInterface::viewMenuBDList() {
int selected = 0, max = 9, selectedDelta = 0;
system("CLS");
while (selected != max) {
do {
if (selected + selectedDelta < 0)
selected = max;
else if (sele... |
e9d848fc7da9a4eb6e8b2d6f4d2ad1e84575b6cb | c76e78581983830158b2a6f56b807e37132f4bba | /Codeforces/c1400-1499/c1490p1.cpp | 6f35939ce7237bbbc3952aed1811ffd3471d375a | [] | no_license | itslinotlie/competitive-programming-solutions | 7f72e27bbc53046174a95246598c3c9c2096b965 | b639ebe3c060bb3c0b304080152cc9d958e52bfb | refs/heads/master | 2021-07-17T17:48:42.639357 | 2021-05-29T03:07:47 | 2021-05-29T03:07:47 | 249,599,291 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 955 | cpp | c1490p1.cpp | // 02/16/2021
// https://codeforces.com/contest/1490/problem/A
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define CLR(a) memset(a, 0, sizeof(a))
#define REP(i, n) for(int i=0;i<n;i++)
#define FOR(i, n) for(int i=1;i<=n;i++)
#define all(c) (c).begin(), (c).end()
#defin... |
4aed4cd0e60ac3f4621fc6742470d7473d9b3bca | c5d6fd2f5bcd7a19d4a5572bc0b9daa104184d66 | /src/main.cpp | 832494d1faf4a30400e1b389b4234eefd8d4719c | [] | no_license | kiddos/reversi | 5c4a4394e05bf3273b130bf048cdec3c1c3d7ce3 | e864e66faee41099430dcda1c7f66ad1211ad4a1 | refs/heads/master | 2020-12-25T07:02:57.274972 | 2016-05-12T08:54:34 | 2016-05-12T08:54:34 | 58,399,480 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 392 | cpp | main.cpp | #include "window.h"
#include "aitrainer.h"
using reversi::Window;
using reversi::AITrainer;
int main(int argc, char *argv[]) {
if (argc == 3) {
const int instances = atoi(argv[1]);
const int iterations = atoi(argv[2]);
AITrainer trainer;
trainer.train(instances, iterations);
trainer.saveparam();... |
bf86c04fd60f25425aa43d10b48e739dec8e6087 | 5b18f4e4141607c12b3928a1dea3fea36d11e8e1 | /QtGlobals.h | 417d5093dd8fe8ff99c36ae509cff9acfa0f91b4 | [
"MIT"
] | permissive | alexgg-developer/FileListCreator | e1e8c09d8b73aa12cf194334f1640a5b4d2814b1 | 8501f62db4bcbe5a33ece0bfcf7406d4063957ef | refs/heads/master | 2021-06-21T18:50:03.339136 | 2017-07-27T18:05:38 | 2017-07-27T18:05:38 | 97,385,919 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 258 | h | QtGlobals.h | #ifndef QTGLOBALS_H
#define QTGLOBALS_H
#include <QQmlApplicationEngine>
class QtGlobals
{
public:
QQmlApplicationEngine* engine;
static QtGlobals* getInstance();
private:
static QtGlobals *single;
QtGlobals() { }
};
#endif // QTGLOBALS_H
|
aa9998c43e7164c792d745d70ef203871fed2e90 | fc33d5f6acaa819f9e5f663aed34d1b2fa1cf2f3 | /Server.h | a652b35f424e2444b7609930ab4d767c8c3d1378 | [] | no_license | ykrutsko/Server | 2b972d0718215e5f601ac5e6b54fdba3ff35c7dd | 459f571f4165df2705a10a51a000e74005a9da0c | refs/heads/main | 2023-08-29T13:22:47.900548 | 2021-10-22T11:36:09 | 2021-10-22T11:36:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 374 | h | Server.h | #ifndef SERVER_H
#define SERVER_H
#include <Windows.h>
#include <winsock.h>
#pragma comment(lib, "ws2_32.lib")
class Server {
private:
static const int portNumber;
static const char* hostAdress;
int thisSocket;
struct sockaddr_in socketAdress;
public:
Server();
struct sockaddr_in createSocket();
void bindSocke... |
79ebeba6a1e6082ecc18ba8bef24765a40b48d64 | d40accb15d5a7c61a1ad56f738493dca8495dba5 | /StringToInt.h | 13ef9a0c803af0127f2a2ef582d9a00eb5054b6e | [] | no_license | zhangliugang/LeetCode-CPP | 2910be7f5bb2a455f47c8b11374a1837de219a30 | 611629de7ebbfeb7d5e20b06418568fa05fb0df4 | refs/heads/master | 2021-05-21T14:05:59.582715 | 2020-04-27T03:16:53 | 2020-04-27T03:16:53 | 252,675,218 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,040 | h | StringToInt.h | //
// Created by August on 4/3/20.
//
#ifndef LEETCODE_STRINGTOINT_H
#define LEETCODE_STRINGTOINT_H
/**
* 8. 字符串转换整数 (atoi)
* https://leetcode-cn.com/problems/string-to-integer-atoi/
*/
#include <string>
using namespace std;
class StringToInt {
public:
int myAtoi(string str) {
if (str.empty()) retur... |
8310d1f4d3f2ed782fa38ca2e689d5a762c021df | c7bb028cc483b8728a4ed412334f83b15cc038c9 | /lab7.cpp | 90c9416310a66429be6dde626d6d8d4916d6f9d4 | [
"MIT"
] | permissive | kertnique/numericalMethods-labs | 1230f5c382ca79da3e4ed0261baac1a0c8fe1c06 | 9cc5c9a1808ff09b1907b43e9e81b9adf230688e | refs/heads/main | 2023-06-11T02:44:01.439482 | 2021-06-28T18:32:38 | 2021-06-28T18:32:38 | 381,127,039 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,174 | cpp | lab7.cpp | #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
double f (double x){
return (x+1) * sin(x);
}
double f_derN (double x, int N){ // похідна 2N-ого порядку
if(N%2 == 0) return (x+1) * sin(x) - 2 * N * cos(x);
else return 2 * N * cos(x) - (x+1) * sin (x);
}
int factorial (int x)... |
e86106d7b26bdc75df2da49ce229fd010a3952bd | c74faaa9c859dde87a92716ae76ad30858b294b0 | /Nov14/prpalin.cpp | 0c2ddfa2ae9a24d4d08cde33fc49087ab6b5d2b6 | [] | no_license | sbpraveen34/Codeblocks_Projects | acad3225357d9850ecbb53bdae24f96420e0d9b8 | f6be0c74190ef73d0d862a500a989e6071cb1b66 | refs/heads/master | 2021-03-12T21:48:03.786353 | 2014-11-30T15:53:23 | 2014-11-30T15:53:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 976 | cpp | prpalin.cpp | #include<iostream>
#include<cstdio>
#include<string>
using namespace std;
bool palin(string s)
{
int n=s.length();
for(int i=0;i<=n/2;i++)
{
if(s.at(i)!=s.at(n-(i+1)))
return false;
}
return true;
}
int main()
{
int t;
scanf("%d",&t);
while(t>0)
{
string... |
d189df8b9251efbe295c6829dd9fd9318a1ce0f7 | 26fcbac2ca68d078f58ea0e722b21fc32bb1089d | /Num_Command.cpp | ae23ed6585594d7e731b3fd77c877fae1a64deba | [] | no_license | RedWheeler/calculator | 607278800e1bc0a7f3cb4ff24113c46ddb975fd6 | a6c07b93996dc57791647afa761f386a17384892 | refs/heads/main | 2023-03-25T09:56:45.478199 | 2021-03-25T04:25:46 | 2021-03-25T04:25:46 | 351,305,637 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 158 | cpp | Num_Command.cpp | #include "Num_Command.h"
Num_Command:: Num_Command(Stack <int> & s, int n)
:s_ (s), n_ (n)
{
}
void Num_Command:: execute(void)
{
s_.push(this->n_);
}
|
b626d29deeb473f8716ca9ab71e118d91a1b665e | 2124d0b0d00c3038924f5d2ad3fe14b35a1b8644 | /source/GamosCore/GamosGenerator/src/GmGenerDistPositionPoint.cc | 0477ab8d866f198d4843ce2f93bef1a0802576ce | [] | no_license | arceciemat/GAMOS | 2f3059e8b0992e217aaf98b8591ef725ad654763 | 7db8bd6d1846733387b6cc946945f0821567662b | refs/heads/master | 2023-07-08T13:31:01.021905 | 2023-06-26T10:57:43 | 2023-06-26T10:57:43 | 21,818,258 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,101 | cc | GmGenerDistPositionPoint.cc | #include "GmGenerDistPositionPoint.hh"
#include "GmGenerVerbosity.hh"
#include "GamosCore/GamosGenerator/include/GmParticleSource.hh"
#include "GamosCore/GamosUtils/include/GmGenUtils.hh"
#include "G4UnitsTable.hh"
//---------------------------------------------------------------------
G4ThreeVector GmGenerDistPositi... |
97bfa6c66771da4c6827f8fc4300eb95a37c6661 | e37ea57c174698121d7fbfc6cda3eea999ac8c1d | /src/coreclr/jit/regalloc.cpp | 78add29413f30ed4bba3f5e7015671adea1dc493 | [
"MIT"
] | permissive | mikedn/runtime | ec0c7f5dd2340f2b44e3f04bea5518fa6af0debb | fcbcaaf345871e3200acaeddb53255ce25cac0f4 | refs/heads/mjit | 2023-08-16T17:33:16.116940 | 2023-07-29T09:54:42 | 2023-07-29T09:54:42 | 224,108,521 | 10 | 0 | MIT | 2023-07-29T09:54:43 | 2019-11-26T05:18:21 | C# | UTF-8 | C++ | false | false | 6,835 | cpp | regalloc.cpp | // Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
/*XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX ... |
978ea10990fe9a7c6a6d89d07ab56ed15c60f2f9 | 515726672bb4a78919501f549289554820180869 | /Expression.h | 4b460c1b361fa4c515a54329056ccb1f97b70b04 | [] | no_license | TakanoriOnuma/CalcExpression | a22bdcec79c363c6e5d52e0a264b8da6daeeb47e | b60315d4c3997527361848ae8388540b8a0bf657 | refs/heads/master | 2021-01-18T14:28:59.406568 | 2014-03-25T05:42:14 | 2014-03-25T05:42:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 267 | h | Expression.h | #pragma once
class Expression {
void skip_space(const char*& ch);
double exp1(const char*& ch);
double exp2(const char*& ch);
double exp3(const char*& ch);
double read_value(const char*& ch);
public:
double calc_exp(const char* exp_str);
}; |
d13bc5a51620b2069fd277b868db206ad9d1bb9a | 04630c5168ff26a780b2c21793606a42cf9e46fe | /Baekjoon_OJ/DP 기초/11066_파일 합치기.cpp | c066d97a6e049dd6d81343eafab043683e19a6d9 | [] | no_license | heeguk/Algorithm | 4863d653bc0dec84e2cb0e13c1eb5164b575bd86 | c7b8b347c2b497271037e79d0ed9b8f94d5ee7e9 | refs/heads/master | 2020-04-27T01:28:23.163518 | 2019-08-23T06:08:32 | 2019-08-23T06:08:32 | 173,901,714 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 748 | cpp | 11066_파일 합치기.cpp | #include <iostream>
#include <cstring>
#include <algorithm>
#define INF 100000000
using namespace std;
long long dp[501][501];
int arr[501];
long long sum[501];
int n;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
int tc;
cin >> tc;
for (int t = 0; t < tc; t++) {
memset(dp, -1, sizeof(dp));
... |
5eead8881da046d667245f5c7d9f5e3876d4995d | 58e9b31a12d1037b73675ed48656a37626c5d85e | /data structures/assignments/lab-exam-2/q2.cpp | f9282f543dae8a2eafa9dc9e0cf3c9bb5abbb9ba | [] | no_license | YashasSamaga/college-work | 3dbb278c979baf75a80843c5e3a2a305ece440c7 | caf7f3dd0bd7113039d9b7aba988e8814fc85705 | refs/heads/master | 2022-07-12T14:24:48.787433 | 2022-06-30T06:28:38 | 2022-06-30T06:28:38 | 162,693,749 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,125 | cpp | q2.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <string>
std::string str;
class fake_string {
public:
fake_string(int i, int j) : first(i), last(j) { }
bool operator<(const fake_string& fs) const {
if((last - first) != (fs.last - fs.first))
return (last - first) < (fs.las... |
6039b5fc0082c68e4b9714bbff86aebd4b847ca0 | 67b29354900dbdb003fb68301a0d4d257e9d0c0c | /EECS_560/Lab09/leftistH-vs-skewH-analysis-lab9/src/simulator/scheduler.cpp | 2e8af03fbf1fce85e8acc7dc7e1f12b076038dd2 | [] | no_license | budlinville/EECS_560 | ed930daa5c85ef0612a6a237b17fb84b8fb71c23 | 0ec7337dc0df183626f009be4ce6d72c2bf39ae5 | refs/heads/master | 2021-09-03T01:44:17.136059 | 2018-01-04T16:42:52 | 2018-01-04T16:42:52 | 112,029,590 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,045 | cpp | scheduler.cpp | #include "../../include/simulator/scheduler.hpp"
Scheduler::Scheduler(){
this->schedule = new PriorityQueue();
}
void Scheduler::addApplicationToSchedule(Application* app){
schedule->concat(app->getTasks());
/* FOR DEBUGGING
node_t *rootPtr = schedule->getRootPtr();
std::cout << "--------" << std::endl;
... |
eae5fa60ac313729bacbbaebeaa54c13108a6ec9 | 2914194776c2b0a4eab682e0c69e3f69c17a89b5 | /Chapter #1/18.cpp | 91714d45215b1e196a6adf74b440b90e3c33d34b | [] | no_license | ruybrito106/Cracking | 010f842ab6a650f1ea98d6cb3d1ea92e6c0099c1 | 795059d7eb242b14c0c139c051c6ef858d5d03bd | refs/heads/master | 2021-03-27T19:39:16.339946 | 2017-05-23T17:32:40 | 2017-05-23T17:32:40 | 89,779,349 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 731 | cpp | 18.cpp | #include <bits/stdc++.h>
#define fr(a, b, c) for(int a = b; a < c; ++a)
#define pb push_back
using namespace std;
/*
Author: Ruy Brito
DONE
23/05/17
Statement:
"Write an algorithm such that if an element in an MxN matrix is 0, its entire row and
column are set to O"
*/
// Complexity: time O(N... |
9905a99059eb88753a9f959b6cd9b03cb99e11fc | ea60de9bd39daf9e326fd4e0cb5a8b69b77649ab | /Ubiquos/UDPServer.cpp | 5eaba4b5bab3bc0efa5dd17cc75ff430c3b90260 | [] | no_license | pekayatt/ubiquos | 5eed3b71ccfa88345f99a8c151fe5b85bf84ade6 | 0f59fc011c77552e23f826cd011007be4b4315ee | refs/heads/master | 2020-07-18T02:42:41.127824 | 2016-08-25T18:54:14 | 2016-08-25T18:54:14 | 66,583,856 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,233 | cpp | UDPServer.cpp | #define VERBOSE 1
#define UDP_PORT 50200
#include "UDPServer.h"
#include "Ubiquos.h"
#include "cocos2d.h"
#include <chrono>
#include <thread>
#if (CC_TARGET_PLATFORM == CC_PLATFORM_ANDROID || CC_TARGET_PLATFORM == CC_PLATFORM_IOS)
#include <sys/ioctl.h>
#endif
ServerUDP::ServerUDP()
{
isRunning = false;
#ifdef ... |
1728c028bda6834329e35eb2e6f44c81ff7f1946 | 6994e542ce7b0cbbd00ac53b29b57188230c34a3 | /aws-fpga/Vitis/examples/xilinx_2020.1/cpp_kernels/wide_mem_rw/src/vadd.cpp | 144c5f1e87af832ebe0dee32768e5e23b1f6ebc7 | [
"Apache-2.0",
"BSD-3-Clause"
] | permissive | abejgonzalez/firesim-aws-fpga-temp | 199d3a9900710eb1f9e50607ceabb9fa5dccfd3f | fa0acf0932b2ab4028086c31b30774dd18f642a3 | refs/heads/master | 2023-09-03T08:12:59.390284 | 2021-10-20T20:19:52 | 2021-10-20T20:19:52 | 419,476,790 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,904 | cpp | vadd.cpp | /**********
Copyright (c) 2020, Xilinx, Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the fol... |
c533ac5a430cf33821f6b3240e461494c078b4ea | f7dc806f341ef5dbb0e11252a4693003a66853d5 | /thirdparty/embree/common/math/affinespace.h | 9d4a0f08468decd7175abb92105e1197b312b6b0 | [
"LicenseRef-scancode-free-unknown",
"MIT",
"CC-BY-4.0",
"OFL-1.1",
"Bison-exception-2.2",
"CC0-1.0",
"LicenseRef-scancode-nvidia-2002",
"LicenseRef-scancode-other-permissive",
"GPL-3.0-only",
"LicenseRef-scancode-unknown-license-reference",
"Unlicense",
"BSL-1.0",
"Apache-2.0",
"BSD-3-Clau... | permissive | godotengine/godot | 8a2419750f4851d1426a8f3bcb52cac5c86f23c2 | 970be7afdc111ccc7459d7ef3560de70e6d08c80 | refs/heads/master | 2023-08-21T14:37:00.262883 | 2023-08-21T06:26:15 | 2023-08-21T06:26:15 | 15,634,981 | 68,852 | 18,388 | MIT | 2023-09-14T21:42:16 | 2014-01-04T16:05:36 | C++ | UTF-8 | C++ | false | false | 15,600 | h | affinespace.h | // Copyright 2009-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
#pragma once
#include "linearspace2.h"
#include "linearspace3.h"
#include "quaternion.h"
#include "bbox.h"
#include "vec4.h"
namespace embree
{
#define VectorT typename L::Vector
#define ScalarT typename L::Vector::Scalar
////////... |
c37846a3e13d96bad92d60b363b4d3abb4e3d540 | 38ac53bd8db9f340cb2104abd6dade38db7f4913 | /newbase/NFmiDataModifierBoolean.cpp | 4fbbe37fec38c12ba833c89c9d93d802103e6d64 | [
"MIT"
] | permissive | fmidev/smartmet-library-newbase | ac56d2fb6bad5378c405dbba84f010de7303f148 | b26e2052bac7c114a1d41068fca48828bad4ad8f | refs/heads/master | 2023-09-06T05:46:05.215973 | 2023-08-30T07:05:41 | 2023-08-30T07:05:41 | 75,052,919 | 0 | 2 | MIT | 2021-06-16T12:15:06 | 2016-11-29T07:00:13 | C++ | UTF-8 | C++ | false | false | 4,201 | cpp | NFmiDataModifierBoolean.cpp | // ======================================================================
/*!
* \file NFmiDataModifierBoolean.cpp
* \brief Implementation of class NFmiDataModifierBoolean
*/
// ======================================================================
/*!
* \class NFmiDataModifierBoolean
*
* Undocumented
*
*/
// ==... |
4f7bbfb8eaaddebaaf62c59413307230553b7b14 | ff4d4757d9c811510c8c755901ef4d4c361cd731 | /Tools/ADsdk/ADbase/ADcontrol.cpp | d2e956cae9c01ed2421d3def521d13c0b9749e08 | [
"LicenseRef-scancode-public-domain"
] | permissive | ApocalypseDesign/ad_public | 4b6a623885808625b54b2888e79b7e2e1f834ac3 | 4c6a2759395a3ad36e072ffed79a7d9b48da219c | refs/heads/master | 2020-06-01T02:12:11.640297 | 2013-05-31T19:53:30 | 2013-05-31T19:53:30 | 9,555,519 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 25,277 | cpp | ADcontrol.cpp | #ifndef WIN32_LEAN_AND_MEAN
#define WIN32_LEAN_AND_MEAN
#endif
#include <windows.h>
#include "ADcontrol.h"
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include "ADbasic.h"
#include "ADbase.h"
#include "Resource.h"
#define PI 3.14159265358979f
extern HANDLE hmodulo;
// per uso interno delle editbox:
i... |
4ffee0ce0c1d5d79354ff9da6360878c61d2f5cb | d1d77b5f546e86dc3e7e641170d2de7f8b332750 | /sketch/attiny45_vibrate_test/attiny45_vibrate_test.ino | 89e928a640fe722573515d30ba52401566250acf | [
"MIT"
] | permissive | yoggy/motor_driver_module_memo | b4f7c251de48eab086dffa7ceb8611994001b609 | 787c454678b98485aebaa6fd3f0d8d889fa4f82c | refs/heads/master | 2021-01-13T01:41:40.125343 | 2015-04-15T13:13:47 | 2015-04-15T13:13:47 | 33,994,260 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 811 | ino | attiny45_vibrate_test.ino | #define V_ON 40
#define V_OFF 300
#define V_INTERVAL 1500
#define V_COUNT 7
#define V_SLEEP 180
void setup( ) {
pinMode(3, OUTPUT);
pinMode(4, OUTPUT);
}
void vibrate_on(int n) {
for (int i = 0; i < n; i ++) {
digitalWrite(3, HIGH);
digitalWrite(4, LOW);
delay(3);
digitalWrite(3, LOW);
digi... |
1da7f944f1e7cb7bc0b8d3c69584f2c86a8616fc | c90a56e7d7752b041fc5eb38257c5573cef346c6 | /src-linux/PLib_pre.cpp | fdbf9959ec7118ab9e82a9230367e0c2bdaa9aa7 | [] | no_license | random-builder/design_cadquery_ocp | a4c572a72699bad52ca5f43f30bb7c15d89072ff | 2af799a9f1b2d81fd39e519b2f73e12b34a14c0a | refs/heads/master | 2021-05-21T23:10:23.833461 | 2020-03-29T15:34:46 | 2020-03-29T15:34:46 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,119 | cpp | PLib_pre.cpp |
// pybind 11 related includes
#include <pybind11/pybind11.h>
#include <pybind11/stl.h>
namespace py = pybind11;
// Standard Handle
#include <Standard_Handle.hxx>
// user-defined inclusion per module before includes
// includes to resolve forward declarations
#include <PLib_JacobiPolynomial.hxx>
#include <Standard... |
69c3fa79a7fe57d0e7ccbf06e01ba0032bfcbfcb | e7f1a89bab00d19c79a12a87ec0ecfdf7fe3dee1 | /heap/gcfinalize.cc | eab8de22ef626a60f52f9881e5e4c66730c25b92 | [] | no_license | dvorka/logr-jvm-gc | 1a67de462b867e3e1e22e23d757c64b72c43dc1c | 2d20bc10a4086a291674b1e8ea8eabf6c2f0584b | refs/heads/master | 2021-01-02T09:14:40.947350 | 2014-01-01T09:53:25 | 2014-01-01T09:53:25 | 15,562,641 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 21,580 | cc | gcfinalize.cc | /*
* gcfinalize.cc
*
* Author: Dvorka
*
*/
#include "gcfinalize.h"
#include "exception.h"
#ifdef GC_FINALIZER_CALL
#include "lni.h"
#include "fictive.h"
#endif
#include "gclist.h"
#include "gcollector.h"
#include "gcreference.h"
#include "referencetypes.h"
#ifdef GC_RELEASE
#include "utils.h"
#endif
//- Ex... |
a55c8fbc17c6ce8b584fa95953e36ea359bb1f13 | c1ef38a0a273b46833aeb52b472da2f8a094e37b | /UVA/10945 - Mother bear.cpp | 84376196f39a5a21b83c13850fa706dd4d4bc777 | [] | no_license | red1austcse34/Programming-Problem-Solution | 85647e7b77a2a07a2208d0731c6f11acb1e76d6b | 472952a964dcce23f79d39e2907972efaab5ad28 | refs/heads/master | 2021-06-17T20:40:46.935829 | 2017-06-03T21:36:10 | 2017-06-03T21:36:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,134 | cpp | 10945 - Mother bear.cpp | #include <cstdio>
#include <sstream>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <iostream>
#include <fstream>
#include <numeric>
#include <string>
#include <vector>
#include <cstring>
#include <map>
#include <itera... |
389bcfdeb4aab022314596cf642a2c7ffdff9356 | c968e1c71b9cbd339c9aa61a6dd7ccacb9b64b66 | /Queue.h | ed4ec78fe3fdf5848119d2402ce9e35056ae8179 | [] | no_license | albertopineda84/CPP-Data-Structs | a1b15415b83edfa9c53841259aeaedafb4085346 | 0870986559d97cc0bc7a8c68dbac8b9a559132f6 | refs/heads/master | 2023-02-21T00:13:03.129470 | 2021-01-23T11:20:55 | 2021-01-23T11:20:55 | 283,111,940 | 0 | 0 | null | 2020-07-28T06:12:06 | 2020-07-28T05:41:52 | C++ | UTF-8 | C++ | false | false | 571 | h | Queue.h | /*
Alberto Pineda
CS 189
Assignment 5: Queue Implementation
*/
#pragma once
#include <list>
template<typename T>
class Queue
{
public:
Queue() {}; //create an empty queue
Queue( const Queue& other )
{
mQueue = other.mQueue;
}
~Queue()
{
while ( mQueue.size() != 0 )
Pop();
}
... |
8b43f1843bd01dd66ad9c215815504dd089b5805 | c6ef5b0975a52abe081ae48dd034043b71079771 | /Prog-Trackingsystem/src/ImageProcessingMngmt.h | c2ff162df1a85a2e6dbe857ed8a1de6d865a1f07 | [] | no_license | BProj-LMN/Studienarbeit | 27a801b58b1339fa3b699f0896296f8464a6983d | 94cb93654e58f155aa6b56b93230a49f63846e01 | refs/heads/master | 2021-01-17T14:09:43.736381 | 2016-07-18T16:24:17 | 2016-07-18T16:24:17 | 54,642,392 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 775 | h | ImageProcessingMngmt.h | /*
* ImageProcessingMngmt.h
*
* function: manage all ImageProcessing entities
* loads sysConfig file and sets everything up
*
* author: Jannik Beyerstedt
*/
#ifndef SRC_IMAGEPROCESSINGMNGMT_H_
#define SRC_IMAGEPROCESSINGMNGMT_H_
#include "ImageProcessing.h"
#include "CameraProperties.h"
#include <op... |
017c1aa9b8da3aea00ffc57ee20bb325a4ce91ef | 6d83ca13b82fa72cf368eea51287f65846474c9a | /CPP_TEST/hash_join.cpp | 7983e485b2d3a1d9395ce330af3427aebb45eb73 | [] | no_license | songminkyu/CPP_TEST | cc8debf02ca94d2ccbdf3f3f7f141155c9349c10 | f7eaf2b6a321575a26466a9ec7ce951f8ed36c95 | refs/heads/master | 2022-12-15T19:39:10.614174 | 2020-09-03T10:12:17 | 2020-09-03T10:12:17 | 291,944,541 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,312 | cpp | hash_join.cpp | #include <iostream>
#include <map>
#include <tuple>
#include <utility>
#include <vector>
#include <range/v3/all.hpp>
using namespace ranges;
using intint = std::tuple<int, int>;
int key(const intint& xy) { return std::get<0>(xy); }
template <typename L, typename R>
std::ostream& operator<<(std::ostream& out, const... |
859e8c0b8c6a9f514f67f70ad5f17655abb512bb | 28923aae2e58cefd4aba60a71647d1203a31ee5d | /Spades Game/Game/Dialog/LeaderboardDialog.hpp | 55b639c6fc44c68ec6ed5e9fa2c4ae5e5226e51d | [
"Unlicense"
] | permissive | Qazwar/StemwaterSpades | a1fee0eeeb4f9e4e4c2023d9b661d09692ac6d6a | 05e5d7c6d380d2f5986bd91269887f16c3e71962 | refs/heads/master | 2020-05-16T00:29:38.625484 | 2015-11-21T01:41:38 | 2015-11-21T01:41:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,045 | hpp | LeaderboardDialog.hpp | #ifndef CGE_LEADERBOARD_DIALOG_HPP
#define CGE_LEADERBOARD_DIALOG_HPP
#include "Game/UI/GeneralDialogBox.hpp"
#include "Game/Handler/LobbyEventProvider.hpp"
#include <Agui/SelectionListener.hpp>
#include <vector>
namespace cge
{
struct LeaderboardCell
{
Label* rank;
Label* name;
Label* rating;
agui::EmptyWidg... |
6014a1996a47f4ed3e4bf8dd7a6c881c717e4fae | 7ea618b70e81a9478e896949ab99995b089fe8de | /libsrc/blitz/src/buffer.cc | 71697993344a33ab6ceb05aee4e070c98be174d8 | [] | no_license | rickyu/mlsimgsearch | bab0cc11901ac3adf652a7f4daeaa01721b6b9e5 | 7fa89f058333af65c27e58d952a7ebbcbd94b46f | refs/heads/master | 2020-03-22T21:01:41.687118 | 2018-07-12T02:48:09 | 2018-07-12T02:48:09 | 140,650,471 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,713 | cc | buffer.cc | #include "blitz/buffer.h"
namespace blitz {
int BufferWriter::Init(int hint_length) {
if (cur_buffer_) {
return kAlreadyInited;
}
buffer_capacity_ = 2;
buffers_ = reinterpret_cast<DataBuffer*>(malloc(sizeof(DataBuffer)*buffer_capacity_));
if (!buffers_) {
buffer_capacity_ = 0;
return kOutOfMemory... |
dde72baf3d48196635ca3227dd9c7101bc116122 | 96976a2c205d679261aa6ff6cd0db286c43ee350 | /src/core/functions/Function.cpp | 9563d63e6838e0876d4fccace8b829035be2015b | [] | no_license | sundsx/RevBayes | f99305df6b72bd70039b046d5131c76557e53366 | 13e59c59512377783673d3b98c196e8eda6fedee | refs/heads/master | 2020-04-06T06:29:46.557485 | 2014-07-26T14:26:57 | 2014-07-26T14:26:57 | 36,248,250 | 0 | 1 | null | 2015-05-25T18:44:13 | 2015-05-25T18:44:13 | null | UTF-8 | C++ | false | false | 1,749 | cpp | Function.cpp | #include "DagNode.h"
#include "Function.h"
#include "RbException.h"
using namespace RevBayesCore;
Function::Function(void) : parameters(),
dirty( true )
{
}
void Function::addParameter(const DagNode *p) {
parameters.insert( p );
}
void Function::getAffected(std::set<DagNode *> &affected, DagNod... |
1e216240da9a12a4be5b4a65907aa58e3fa65155 | 09c3d3d2359cd468ea5509c557d4d2183871efd9 | /mobileChartsQML2/heart.h | 37848ba9f50be27fb36a8474a9ff977289aec603 | [] | no_license | PatrykGrzegorek/QtExamples | 7230c2581113c2c6f8bb8d50046dd7541b79962c | 20407fc489030d4749a9e068d8ba1aad78944f91 | refs/heads/main | 2023-09-04T09:07:47.308651 | 2021-10-26T07:59:06 | 2021-10-26T07:59:06 | 408,770,024 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 514 | h | heart.h | #ifndef HEART_H
#define HEART_H
#include <QObject>
#include <QTimer>
class heart : public QObject
{
Q_OBJECT
Q_PROPERTY( QString stringHeart READ stringHeart NOTIFY statsChanged)
public:
explicit heart(QObject *parent = nullptr);
void setStats(int heart);
QString stringHeart();
signals:
voi... |
577c868b7f2b69ffaba1063ed99b30b65cd2cf47 | f4afb68928a5e4f697704ea33ca7cbbcc01a2a8d | /phonedirectory.cpp | 6be216261eea7554e630df5fea09e86f45f4dc73 | [] | no_license | chandreshsharma/PhoneDirectory | 6dc0d830f537d7e5169ef834b743e962e9d892c8 | 92012db6dcf53100f2c8999491dd661c0e05ca11 | refs/heads/master | 2021-07-05T00:04:42.019275 | 2017-09-25T09:33:05 | 2017-09-25T09:33:05 | 104,330,768 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,082 | cpp | phonedirectory.cpp |
/*
Let's say you needed to store (in code/memory instead of a database) a group of people and their phone numbers.
Further extend the example with the idea that a person can have multiple phone numbers and that each phone number has a type (cell, home, etc.).
What data structure(s) or classes might you design to sto... |
3ef7e2918b4ef81bdaadee97c68c9c10d1083e89 | 07c3e4c4f82056e76285c81f14ea0fbb263ed906 | /Re-Abyss/app/utils/AudioSetting/AudioSettingReader.hpp | abe75450495ae7a8ed8a1200ea8dbcd740be8b31 | [] | no_license | tyanmahou/Re-Abyss | f030841ca395c6b7ca6f9debe4d0de8a8c0036b5 | bd36687ddabad0627941dbe9b299b3c715114240 | refs/heads/master | 2023-08-02T22:23:43.867123 | 2023-08-02T14:20:26 | 2023-08-02T14:20:26 | 199,132,051 | 9 | 1 | null | 2021-11-22T20:46:39 | 2019-07-27T07:28:34 | C++ | UTF-8 | C++ | false | false | 383 | hpp | AudioSettingReader.hpp | #pragma once
#include <Siv3D/Audio.hpp>
#include <abyss/utils/AudioSetting/AudioSetting.hpp>
namespace abyss
{
class AudioSettingReader
{
public:
AudioSetting load(const s3d::TOMLValue& toml) const;
AudioSetting load(const s3d::FilePath& basePath, const s3d::TOMLValue& toml) const;
... |
97419c12f5b8063ad583646142f82afc52da03dc | b7a5ad33275fc0132fd6e6c8611734c7d757ec7c | /ExpressionEvaluation/token.cpp | 6977dd1da7adba2558b7a04ace63cee437747e2a | [] | no_license | JosephPKC/CplusSquared-Projects | 8d83f91145bacbfbfd1a8269e8c5df33792c843f | 055fb351783c62b5e3f6a0c7ae2d4b37e281d4d3 | refs/heads/master | 2021-01-24T17:36:21.985086 | 2017-01-28T07:21:44 | 2017-01-28T07:21:44 | 29,170,003 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 843 | cpp | token.cpp | #include "token.h"
#include <iostream>
/**
* @brief operator << insertion operator
* @param out ostream
* @param T the token
* @return ostream
*/
std::ostream& operator <<(std::ostream& out, const Token& T){
out << T.getToken();
return out;
}
/**
* @brief Token::getType gets the type
* @return type
*/
... |
1e51ac79a5e00dc9d0f35cae9e26dbdb1f87e53d | bc4e22bf0389d8da65a5c9dd00e9aeea7c03ba13 | /geomc/shape/shapedetail/IndexHelpers.h | de1fca9247d9871ea2d302dcaf84d1ffe92c85ca | [
"BSD-3-Clause"
] | permissive | trbabb/geomc | 07efefb8c7660852aab8bf0afbcc6f21a1425db3 | 439cdffbb3466721b3571f6ddc296e46996308c4 | refs/heads/master | 2023-04-08T09:01:41.422267 | 2022-09-01T07:20:51 | 2022-09-01T07:20:51 | 11,573,824 | 36 | 2 | BSD-3-Clause | 2022-09-01T07:20:52 | 2013-07-22T05:47:28 | C++ | UTF-8 | C++ | false | false | 4,018 | h | IndexHelpers.h | #include <utility>
#include <geomc/shape/Rect.h>
namespace geom {
namespace detail {
/*****************************************
* KDTree helpers *
*****************************************/
// basic shape
// (works on rects)
template <typename T, index_t N, typename D>
struct ShapeIndexHe... |
8fd7fdc7752187a36add8bc68854f96c01a22dea | 3eee65c4f88b89c7647fa5452da9067dbe3cf67f | /source/private/user_info.hh | f83de91d54b37f75fd86db5823c3ccfdfe53f2d9 | [
"BSL-1.0"
] | permissive | vinzenz/ircpp | 3ca52842d478d6cb45d457e71177a9889e352f76 | 61e3023506a775f4adf64b57743f84a7ade2d1f8 | refs/heads/master | 2021-01-22T12:12:21.071727 | 2015-03-19T20:04:19 | 2015-03-19T20:04:19 | 5,329,515 | 4 | 1 | null | 2015-03-19T20:04:20 | 2012-08-07T15:13:16 | C++ | UTF-8 | C++ | false | false | 619 | hh | user_info.hh | // (C) 2012 Vinzenz Feenstra
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef GUARD_IRCPP_PRIVATE_USER_INFO_HH_INCLUDED
#define GUARD_IRCPP_PRIVATE_USER_INFO_HH_INCLUDED
#include <string>
namespace ircpp {
nam... |
c5a7fbfa2af7e7941636241578e26aeb555b0aa4 | e0832bdb45cb06a4803652f2fe807acf0cb01fba | /RTREE.cpp | ee085d1052f15bb68679ee72f05e6071f4e31bd2 | [] | no_license | shyam49/Spoj-sulutions | a7e3950411317806bb3e0f257c6a007005cbab12 | 7918abab163e6f2d4a172f857708a0150143c1b0 | refs/heads/master | 2021-07-21T00:34:01.402539 | 2017-10-27T14:27:36 | 2017-10-27T14:27:36 | 108,554,356 | 0 | 0 | null | 2017-10-27T14:27:37 | 2017-10-27T14:11:52 | C++ | UTF-8 | C++ | false | false | 1,360 | cpp | RTREE.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007ll
ll ans[100010][3];
vector<vector<ll> > v(100010);
vector<vector<ll> > :: iterator it;
vector<ll> :: iterator it1;
bool flag = false;
void dfs(ll s) {
vector<ll> :: iterator it11;
flag = false;
it11 = v[s].begin();
whil... |
99e8055d5e3c76f21763bbf30ca25debd4316d3d | 3de3a129238f2c9fcb5cabc714f2b727a2f389ba | /pongGame/gameFunc.cpp | 7cfa0aa315de7ee46328e34df84e368617776063 | [] | no_license | YassirBouigherdaine/pongGame-cpp | 7183ee996c55394eb85452da21d29a01e9b7f69a | 6b6fca709f78c47195d51fd344d30ca3cb11df2b | refs/heads/main | 2023-01-21T10:59:08.194772 | 2020-12-01T09:35:36 | 2020-12-01T09:35:36 | 315,706,029 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,090 | cpp | gameFunc.cpp | #include"game.h"
COORD cursor_origin;
HANDLE console = GetStdHandle(STD_OUTPUT_HANDLE);
void gotoxy(int x, int y)
{
cursor_origin.X = 0;
cursor_origin.Y = 0;
SetConsoleCursorPosition(console, cursor_origin);
}
const int width = 50, height = 25;
bool game_over = false;
int max_score = 10, score1 = 0, score2 = ... |
26a6c7567f567f936602640c93cf8f89d06a13dd | 5b98b0244ec6c53164ea60a0fcf4d2d6e83d1cb3 | /Factory/Abstract_Factory/pizza_store.h | 600c21b12ab7b9c619894b21bdd35e1ef7440740 | [] | no_license | martinnobis/Head-First-Design-Patterns-Cpp | bd137cde4f94228991224b685dfa5dcfbc417531 | 4c05e2cfdce1ead6b24d5bca2466133293386855 | refs/heads/master | 2021-09-15T05:47:11.300397 | 2018-05-27T07:53:59 | 2018-05-27T07:53:59 | 127,617,469 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 327 | h | pizza_store.h | #ifndef _PIZZA_STORE_H_
#define _PIZZA_STORE_H_
#include <string>
#include <memory>
#include "pizze/pizza.h"
class PizzaStore {
public:
std::shared_ptr<Pizza> OrderPizza(std::string type) const;
protected:
virtual std::shared_ptr<Pizza> CreatePizza(std::string type) const = 0;
};
#endif // _PIZZA_S... |
3fd8cbb2d5280957e0e24f88c33ade3e10871c5a | 52a3c434e69f1e1c421f873df725e8145b48c82e | /Entity.h | 5cdfc1834b9c016c4b566e60ad6460c400a99edd | [] | no_license | drakerutherford/CSCI_4448Final | c09b4483f774fa159d1561b92dd622bcfad6544d | 9b50610537224ef0f007297dfa369eb5499e2043 | refs/heads/master | 2020-11-25T16:08:50.470694 | 2019-12-18T20:46:21 | 2019-12-18T20:46:21 | 228,749,563 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 446 | h | Entity.h | #ifndef ENTITY_H
#define ENTITY_H
#include <curses.h>
class Entity
{
public:
Entity(char s);
virtual ~Entity();
int getX();
int getY();
int getSprite();
void setX(int x);
void setY(int y);
void setSprite(char s);
void draw(WINDOW * playare... |
20f953e24bff626b4f58bcb1242d920ba08fafb4 | 09ea6ee1dada2accbe567c17fae31295496242a7 | /lib/include/pool/details/buffer/stack.hpp | b35488001dd8e85c40a2f68843fe24d496be1027 | [] | no_license | matovitch/dmit | f40b1d2fde7d8e63aaa1fc4b831d28260d405729 | 8017690ffc354aa68b5b7b6188f867450457917a | refs/heads/master | 2023-01-13T14:30:52.303532 | 2023-01-03T12:52:39 | 2023-01-03T12:52:39 | 180,006,049 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,592 | hpp | stack.hpp | #pragma once
#include "pool/details/buffer/abstract.hpp"
#include <type_traits>
#include <cstdint>
namespace pool_details
{
namespace buffer
{
template <class Traits>
class TStack : public Traits::Abstract
{
using Memory = typename Traits::Memory;
using Type = typename Traits::Type;
static constexpr... |
ee67b8049f1cf9c0e753ab0ad157f9be471fbdcf | a292fc5826e96ec2f954873c8014c288e7c29cc6 | /src/local_panel.h | e7a4d34c1cd92f0f9a73a69217ce5ceaa9214f53 | [] | no_license | sammy-SC/ftp-client | 2b42d43be7e3648391db447ce4cbc3d832620379 | 7451e5d0989194f58a4f8ecc3526bb24e61a5237 | refs/heads/master | 2020-04-05T23:04:54.489562 | 2015-08-21T08:00:43 | 2015-08-21T08:00:43 | 10,667,378 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,115 | h | local_panel.h | #ifndef LOCAL_PANEL_H_oeauhroq3298039oiorishorsihtoi3h4
#define LOCAL_PANEL_H_oeauhroq3298039oiorishorsihtoi3h4
#include <deque>
#include <string>
#include "ui_window.h"
/*! Represent local file system
*
*/
class Local_panel: public UI_window
{
protected:
const char * m_title;
//! Contains files and folders in cu... |
f3a250c38cb73238bab9a8e5af4da4c4a91543e1 | 4d948347f8eea87c1c41fe7475bb8e46a7855b98 | /cses_dp/counting_tilings.cpp | 31272b804f1a1d7ac78206a5f6bba4ad86e3ea85 | [] | no_license | nalini21/CSES | 54e545cab01bb30a73302c002c2d2281d8654866 | 5da43fb1d9c786b3ea16968d7b21fec34255d1d0 | refs/heads/main | 2023-08-25T13:47:51.279825 | 2021-09-09T08:08:50 | 2021-09-09T08:08:50 | 398,581,399 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,445 | cpp | counting_tilings.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD = (int) 1e9+7;
void generate_next_masks(int current_mask, int i, int next_mask, int n, vector<int>& next_masks){
if(i == n + 1){
next_masks.push_back(next_mask);
return;
}
if((current_mask & (1 << i)) != 0... |
7710e68a13f0f0f3f85430f0d0bf60bc978ced9d | e95701b2d57006f0660d6d1382774d738b727229 | /Others/Arduino_Code/dht11_rpi/dht11_rpi.ino | 59c14c92b08d80202e995c6aef56eb6481e90526 | [
"MIT"
] | permissive | DuanWeiye/rpiBot | 1cd78ad4dc64d93b1ecb4fbf83c6216231360212 | 188a7ec4099463dc5554d862f1a6da26f26ddd28 | refs/heads/master | 2020-05-29T13:28:14.781705 | 2014-10-07T13:20:14 | 2014-10-07T13:20:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 760 | ino | dht11_rpi.ino |
#include <dht11.h>
dht11 DHT11;
#define DHT11PIN 2
char buffer;
int connectStatus = 0;
void setup(){
Serial.begin(9600);
connectStatus = 0;
}
void loop()
{
if (Serial)
{
if (connectStatus == 0)
{
Serial.print("A");
connectStatus = 1;
return;
}
... |
7354ad332f754e3aeb8810fc9d7a0bb19a28e80f | 308f5596f1c7d382520cfce13ceaa5dff6f4f783 | /hphp/runtime/base/data-walker.h | 74b191f2cc3fbeaf5b3f7f6d1e072d6c04f72513 | [
"PHP-3.01",
"Zend-2.0",
"MIT"
] | permissive | facebook/hhvm | 7e200a309a1cad5304621b0516f781c689d07a13 | d8203129dc7e7bf8639a2b99db596baad3d56b46 | refs/heads/master | 2023-09-04T04:44:12.892628 | 2023-09-04T00:43:05 | 2023-09-04T00:43:05 | 455,600 | 10,335 | 2,326 | NOASSERTION | 2023-09-14T21:24:04 | 2010-01-02T01:17:06 | C++ | UTF-8 | C++ | false | false | 4,367 | h | data-walker.h | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-present Facebook, Inc. (http://www.facebook.com) |
+---------... |
1a3483c8d94709af36883d9295d3a4f138e004c9 | ec53463522a8e5c49b4e052ef565797391427f92 | /8 fibanocci.cpp | 080808b0038f166c584fb86ba4038f1928dff263 | [] | no_license | daffafzn/latihan | af548d4c612269fabed5e68ae6c3c6b46bcf27ba | a2f365c35f070d71c3fc92020bd107247b5c8f48 | refs/heads/master | 2023-04-13T22:08:27.901349 | 2021-04-12T07:06:15 | 2021-04-12T07:06:15 | 263,915,234 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 514 | cpp | 8 fibanocci.cpp | #include <iostream>
using namespace std;
int main()
{
char opsi;
do
{
system("cls");
int a, b, c, suku;
cout<<"Membuat Deret Fibonacci\n";
cout<<"Masukkan nilai suku ke-: ";cin>>suku;
cout<<"Bilangannya adalah: \n";
a=0;b=1;
cout<<a<<endl<<b<<endl;
for(int i=3; i<=suku; i++)
{
c = a + ... |
47f3ae8e78beaa0f95ac86b50775d2026794871f | 0b6b66812ce84ae3aa4fe61205a08107557d3fbc | /Point.cpp | d2b0723a02460adf809c98777150176a5b590ca5 | [] | no_license | davorzdralo/math_wars | ca530e75201ac4405cffdccfd15c4562da58ee4a | c1c8915eb31ed8d7e02c1dc090944e095a956592 | refs/heads/master | 2021-01-21T23:08:44.345381 | 2011-12-12T10:03:05 | 2011-12-12T10:03:05 | 2,963,279 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 853 | cpp | Point.cpp | #include "Point.h"
#include "Vector.h"
#include <cmath>
Point::Point(double x, double y, double z)
{
this->x = x;
this->y = y;
this->z = z;
}
bool Point::operator == (const Point& other) const
{
if(x == other.x && y == other.y && z == other.z)
return true;
else
return false;
}
bool Point::operator != (const... |
a515a5b4244a56c6d30f792d76def483010f4e71 | 4a23e507f1f1a92fd773594da06e5d21ae90419d | /plugin/src/BindTexture.cpp | 5e12a5b7d3334d9488046fd18f743b487b27ea48 | [] | no_license | M-Mueller/collage | 10d053e2bcf7bedbb9fe76dc77462f14231a1783 | 5933191a946d44a9540ff7b56786b489c7cb1389 | refs/heads/master | 2021-01-20T20:53:49.547398 | 2016-12-26T16:37:58 | 2016-12-26T16:37:58 | 65,573,256 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,055 | cpp | BindTexture.cpp | #include "BindTexture.h"
#include "Texture.h"
namespace collage
{
BindTexture::BindTexture(QObject* parent):
Entity(parent),
_texture(nullptr),
_unit(0)
{
}
void BindTexture::synchronize()
{
Entity::synchronize();
_unit.synchronize();
}
void BindTe... |
1afe9c155823fa7ba4aa11de8b5cf744638a62a1 | 871e8640d03a7bfe67eee803f9ef7ba3940662d3 | /Boss.h | b86a3855ea74fa5509ffa97259a1cd27ab8a4fc3 | [] | no_license | Qiaorui/Legendary-of-Zelda | 537c3998c4e977b6fecbef54d49026e496e761d3 | 0d5a658fd31f7993b2cc77b5686b7bc0bff1a7d9 | refs/heads/master | 2021-01-10T16:08:31.718072 | 2015-11-13T18:43:24 | 2015-11-13T18:43:24 | 44,050,950 | 2 | 0 | null | 2015-11-10T10:33:24 | 2015-10-11T12:18:01 | C++ | UTF-8 | C++ | false | false | 474 | h | Boss.h | #pragma once
#include "Enemy.h"
#include "Fireball.h"
class Boss :
public Enemy
{
public:
Boss();
~Boss();
void Draw();
void DrawRect(int tex_id, float xo, float yo, float xf, float yf, int s, int frame);
void Logic(vector<int> map, int width, cBicho* player);
void FireAttack();
void hurt(int point);
private:
... |
7048d319b5a5f529abf25e16435c2183f9c86730 | fa03f162c506e95d28e379286987451f6d255cbe | /Stack/stacktest.cpp | c03afefb4c3ef97661ca021fe2e484e55d2ea548 | [] | no_license | pajamapants3000/Challenges_Cpp | aece592b6df8b6f14f6223ec16d95fecdb0730eb | a620e868bb1695df1a2bc71617e7565e3972bbb9 | refs/heads/master | 2020-06-12T21:16:05.931929 | 2019-10-07T12:37:57 | 2019-10-07T12:37:57 | 194,425,676 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 582 | cpp | stacktest.cpp | #define BOOST_TEST_MODULE Stack
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
/*
* Tests:
* Setup - for each test, build a stack of many values
* Test - push, pop, peek
* Teardown - none needed I think, other than perhaps destruction of stack object
* ...
* Apply to every stack implementation
... |
31e7a3ec86deae3995e376618fcc9f141af3e62c | 30f9474dd1afbfde3466a4eb2f20455dc37dad37 | /plots/consumption-by-month.h | 572e1853d83b7f7088f452e28a53be86f7133f68 | [] | no_license | eagerber/accounting | a37788f561a55d63a63d33a3f0b906a60478360a | 12251daa54f39645472c5c8a4d3fa54bac3038e6 | refs/heads/master | 2021-01-21T14:02:22.600178 | 2016-05-26T04:41:34 | 2016-05-26T04:41:34 | 51,752,764 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 419 | h | consumption-by-month.h | #ifndef CONSUMPTIONBYMONTH_H
#define CONSUMPTIONBYMONTH_H
#include "acc-plot.h"
#include <QVector>
class ConsumptionByMonth : public AccPlot
{
public:
explicit ConsumptionByMonth(QCustomPlot *customPlot);
~ConsumptionByMonth() = default;
virtual void replot() override;
private:
ConsumptionByMonth()... |
6d9d6de76f72a76f47a33a64c96bbb4f8db431ec | d9dbec0d04ff93869bb8ed3fc353b67c505cd6ba | /Neolithic/Neolithic/DebugElement.cpp | 61bfbbf79e994ab787d50defb23e61031db73d59 | [] | no_license | DaleChetney/Capstone_DaleChetney | 9ee09717831ccddff834aba70faca929993176b8 | 93a018567766879aaabb5a7101e009ab1feb5722 | refs/heads/master | 2021-01-25T05:15:26.410410 | 2014-11-10T20:30:29 | 2014-11-10T20:30:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,363 | cpp | DebugElement.cpp | #include "DebugElement.h"
DebugElement::DebugElement(char* label, float* ref)
{
floatRef=ref;
boolRef=NULL;
vecRef=NULL;
addWidget(control);
connect(control, SIGNAL(valueChanged(float)),this,SLOT(changeReference()));
}
DebugElement::DebugElement(char* label, float* ref,float min,float max,float init)
{... |
ba82cee3be65b79d2b6b086dc9197211d9b749e4 | ca84490c8fe9c5ee77f3abf5ffad9379b95a0abb | /2019.3/2019.3.29/厦门双十林弘扬/random.cpp | 2d2e2278eb3c7600d1d5269a63951ff23f8f620e | [
"ICU",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | LoganJoe/training-data | 1df9dc6ef730f6c6a0130f50caed19556f5e1f87 | b77b8e7271dcb73ce96c5236c433ce557e0e16f0 | refs/heads/master | 2021-10-26T03:17:44.883996 | 2019-04-10T06:39:01 | 2019-04-10T06:39:01 | 178,348,836 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,384 | cpp | random.cpp | #include<bits/stdc++.h>
#define N 300005
#define mod 998244353
#define ll long long
int n, Q, head[N], ecnt, deep[N], fa[N][20], ans[N], len;
int mul (int x) { return x >= mod ? x - mod : x; }
ll Pow (ll x, ll k)
{
ll t = 1;
for (; k; k >>= 1, x = x * x%mod) if (k & 1) t = t * x%mod;
return t;
}
struct edge
{
int v... |
59ae21d9242da8688d870b53829dd8a27157812a | 17953c4ff376936161fc89eb41d605b66699a38c | /src/ServerEngine/OssServer/FrontServer/FrontServerApp.h | e6b4c6ca55affb84043f6279778d78449d3dbeb6 | [] | no_license | equalizer-bourne/otherserver | 8353fc495e71bb549b23759c58d1595e590be902 | e6865f90ef8c008601a7e2c6657d102ae4820c40 | refs/heads/master | 2020-05-15T16:20:38.684392 | 2018-09-18T18:49:56 | 2018-09-18T18:49:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 306 | h | FrontServerApp.h | #ifndef __FONTSERVER_APP_H__
#define __FONTSERVER_APP_H__
#include "MiniApr.h"
using namespace MINIAPR;
#include "servant/Application.h"
class FontServerApp:public Application
{
public:
virtual void initialize();
/**
*
**/
virtual void destroyApp();
};
extern FontServerApp g_app;
#endif
|
701fe792d882896942b8f2334cf5e802ba0066b8 | d9d118f4f1d626a750897babce33b3ce34f11575 | /x451/resource/ICCastResource/implementations/CICCastEventProvider.cpp | cb093420dc939aab99c1766e97ce2d5e1cac4049 | [] | no_license | HNarayana-youCanDoIt/Testproject | 39af23d3ee4c2a413670c3dcd68dbd41424bbe91 | 226795327f50102989dfc8e12174823dddc2aa68 | refs/heads/master | 2023-03-26T05:57:57.044706 | 2021-03-31T11:14:53 | 2021-03-31T11:14:53 | 353,326,120 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,584 | cpp | CICCastEventProvider.cpp | /*****************************************************************
* Project Harman Car Multimedia System
* (c) copyright 2018
* Company Harman/Becker Automotive Systems GmbH
* All rights reserved
* Secrecy Level STRICTLY CONFIDENTIAL
******************************************************... |
5a15ad3f8e9537a29b5826f3591a520559035004 | 59dfb7e40f22a7f6b361b7ad9bec2788f4f4e881 | /src/include/player.h | 7612c8b135220d834e57b2f16e770e0f8f324714 | [
"MIT"
] | permissive | tomconder/rivals | 81f48b5b5c4e25b0e351aa824bb0485ae92f643a | 489d92e5416bc74683e7eef7411637e67b303c02 | refs/heads/main | 2023-04-15T21:28:56.057703 | 2021-04-27T03:54:35 | 2021-04-27T03:54:35 | 356,113,083 | 0 | 0 | MIT | 2021-04-27T03:46:17 | 2021-04-09T02:45:11 | C++ | UTF-8 | C++ | false | false | 813 | h | player.h | #ifndef INCLUDE_PLAYER_H
#define INCLUDE_PLAYER_H
#include <SDL.h>
#include "globals.h"
#include "level.h"
class Player {
public:
explicit Player(Level *level);
void setNextMove(move::Move move);
void moveBackward(Level *level);
void moveForward(Level *level);
void moveLeft(Level *level);
voi... |
b36da67db8006de1bd217881da76483239458cc9 | a3acce5bb43ab3959e4df6b69337bb6824549c64 | /src/stonewall/messages/send_rsa_key/SendRSAKeyMessage.h | bb3dfbc2b21089f3d15079761a0c187984ce137c | [] | no_license | OmerWexler/Atlas | 80e7b84b183040e129e45bdef4df951241e2f595 | 2db75f387ed76270c12f2393ecab4bcde1f5dffb | refs/heads/main | 2023-06-20T03:06:59.270652 | 2021-06-17T02:22:55 | 2021-06-17T02:22:55 | 312,613,290 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 307 | h | SendRSAKeyMessage.h | #pragma once
#include "IMessage.h"
#include "RSAKey.h"
using namespace std;
class SendRSAKeyMessage: IMessage
{
private:
RSAKey Key;
bool m_IsPrivate;
public:
const static string TYPE;
SendRSAKeyMessage(RSAKey Key);
string GetType() const override;
RSAKey GetKey() const;
}; |
4809e4876ccec9f3434dab1bd04b24b91615218c | c6e8cc92c857f10004be4f4f585dce297213da05 | /kobuki_fleet_state_machine/src/model/controller_task_list.h | 6819c68d8834b90cf6487b6fdc2922148757d056 | [] | no_license | Jonmg/kobuki_fleet | cb69085bdd9b741eb649a3397d9a927fd75706f6 | c4506e79ed882f84825ab6bc9f4473c0e640c78f | refs/heads/master | 2020-12-02T08:13:41.117581 | 2017-09-08T15:07:08 | 2017-09-08T15:07:08 | 96,789,336 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,239 | h | controller_task_list.h | /*
* controller_task_list.h
*
* Created on: Aug 2, 2016
* Author: phil
*/
#ifndef SRC_STATE_MACHINE_MODEL_CONTROLLER_TASK_LIST_H_
#define SRC_STATE_MACHINE_MODEL_CONTROLLER_TASK_LIST_H_
#include <ros/ros.h>
#include <std_msgs/UInt16.h>
#include <std_msgs/UInt8.h>
#include "kobuki_fleet_msgs/TaskList.h"
#i... |
4880d58b4b0b00c23190dfed55ef24a7294334e6 | d6277591f92c4d021bee86f4532d87556922783c | /codes/codeforces/489D.cpp | dad12740d2079031c6c4f1d35a6292c417565737 | [] | no_license | masterchef2209/coding-solutions | 83a1e8083f7db7f99ca16c9a8a584684f2ad8726 | 48c7aa127e2f2353cc18cf064fbd5b57875c1efa | refs/heads/master | 2021-05-26T06:02:53.579607 | 2020-04-25T21:23:56 | 2020-04-25T21:23:56 | 127,779,581 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,111 | cpp | 489D.cpp | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp(x,y) make_pair(x,y)
#define mod 1000000007
double PI=3.1415926535897932384626;
typedef long long ll;
typedef long double ld;
typed... |
2f366b336574729c1d87184ac2869d0c52399263 | eb52e59691b5c935823df166c9db2a11008f359c | /query_impl/select.hpp | c6341b08e83e45ca187fa2603a2b6a77eced6ecc | [] | no_license | sprw121/sql_engine | 040b2d1fa0949334e0ac8f9ba652276efb969730 | 669b959bd02abea0cf548b8a033972ff54bfe79c | refs/heads/master | 2020-07-05T20:15:35.735719 | 2016-11-24T05:49:45 | 2016-11-24T05:49:45 | 73,982,488 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,720 | hpp | select.hpp | #ifndef _SELECT_H
#define _SELECT_H
#include <iomanip>
#include <memory>
#include <string>
#include "../output_format.hpp"
#include "../parser.hpp"
#include "../table.hpp"
#include "../table_views.hpp"
#include "from.hpp"
#include "limit.hpp"
#include "offset.hpp"
#include "query_object.hpp"
#include "where.hpp"
//... |
bf0ec2153485b18f5fba1bccb36065796afdbe36 | 7386a0ec949f3e113c3b9b5daadacdc5438c8988 | /AndroidUtil/android/text/Editable.cpp | 6c38664d14d0e3b518891f79baa62a3d98b12356 | [] | no_license | fnc12/Mitsoko | 63d3e0ab370dc1483d65c246e085c21e88d075a1 | 9d0eac8eaba16055dc0d14259b26dda7772769c6 | refs/heads/master | 2021-09-07T08:04:37.277956 | 2018-02-19T19:55:30 | 2018-02-19T19:55:30 | 61,115,290 | 9 | 4 | null | 2017-07-18T19:16:41 | 2016-06-14T10:52:59 | C++ | UTF-8 | C++ | false | false | 287 | cpp | Editable.cpp | //
// Editable.cpp
// Groozim
//
// Created by John Zakharov on 17.08.16.
// Copyright © 2016 Outlaw Studio. All rights reserved.
//
#include "Editable.hpp"
#ifdef __ANDROID__
const std::string android::text::Editable::signature = "android/text/Editable";
#endif //__ANDROID__
|
176a9cc5f0c24a37b2a807c8dfc37eb2f6da3079 | 92c97452919e2ccb3a14aef8639f9c238338433d | /server/main.cpp | 223d41d7428cbfa678ac15e4713c20fb3445f86e | [] | no_license | pwestrich/game_engine | 970eefaa0a01c5c913450d1c7541f5f63250fed4 | 9f7a3cc2c257ca75e0c906a303fe8c5115ad01dd | refs/heads/master | 2021-03-13T00:07:44.089551 | 2015-05-04T04:19:14 | 2015-05-04T04:19:14 | 30,482,572 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 234 | cpp | main.cpp |
#include <cstdlib>
#include <iostream>
#include "TCPServer.h"
using namespace std;
int main(const int argc, const char **argv){
TCPServer *server = new TCPServer("localhost", 8);
server->start();
delete server;
return 0;
}
|
77b3da5e99cdfcc46e0b83507ae321741d97b6f5 | 9fada0cddd06bdba92a0103f2773fd00ba56cd11 | /leetcode_c++/0145. Binary Tree Postorder Traversal.cpp | 79a958d1b215f6f2d81b2f15927817b03c79ca3c | [] | no_license | luhao2013/Algorithms | 419d0b926e2308a79a8b66a45b49e83f6e0b968a | a32c096e192a89a88457ccc1899be10352bf1edd | refs/heads/master | 2020-06-02T20:50:38.020766 | 2020-04-19T09:14:43 | 2020-04-19T09:14:43 | 191,305,885 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,795 | cpp | 0145. Binary Tree Postorder Traversal.cpp | /*
Given a binary tree, return the postorder traversal of its nodes' values.
Example:
Input: [1,null,2,3]
1
\
2
/
3
Output: [3,2,1]
Follow up: Recursive solution is trivial, could you do it iteratively?
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/binary-tree-postorder-traversal
著作权归领扣网络所有... |
34a6ab8b9b3326ea0f31683b0df2beecdf73a1e9 | 9bccc708faa4c8908a4398250502818c3795a95a | /22.TheLastKNodeInTheLinkedList/main.cpp | 76b84f7399142c56f45be6b0f92ea7130a51f45e | [] | no_license | Convere/SwordOffer | f03ffdfe2ee55b173077b0b13007b63b9c7cb6b9 | 0e901f31d3f165aafa277fd1833b00dd206c6a79 | refs/heads/master | 2023-07-11T07:02:15.948997 | 2021-08-15T08:46:14 | 2021-08-15T08:46:14 | 381,646,077 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,168 | cpp | main.cpp | #include <iostream>
#include <vector>
#include "ListNode.h"
using namespace std;
vector<int> numOfBurgers(int tomatoSlices, int cheeseSlices) {
int total_jumbo = 0;
int total_small = 0;
vector<int> res;
if ((4 * cheeseSlices - tomatoSlices) % 2 == 0)
{
total_small = (4 * cheeseSlices - tomatoSlices... |
6ab0febf1fdd51556e4eceb60ba1a09168a41ced | 57f53f50b1dd2610e88fbe28447fd376638dd389 | /chap11/next.cpp | 60b155c00ce6ee31e2959150f8db7533053783ee | [] | no_license | geekyarthurs/cplusplus | 2954f83f5c6e938ea7472fa309d11d8b316c5c18 | 5e1cbe6a644fb953f0a081bf138f9d281274f399 | refs/heads/master | 2021-04-13T20:07:46.902404 | 2020-04-20T05:00:54 | 2020-04-20T05:00:54 | 249,184,519 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 413 | cpp | next.cpp | #include <iostream>
#include <string>
namespace IO
{
using namespace std;
void print(string msg);
string input(void);
} // namespace IO
void IO::print(string msg)
{
cout << msg;
}
std::string IO::input()
{
string msg;
getline(cin, msg);
return msg;
}
using namespace IO;
string name;
int main()
{
... |
cd54b8a1f51d977f04936c655d3615ec3b0563e0 | a3f5a221a0e17a40e0759afc883318a522f0e434 | /Bst.h | 4bfb691b386450215d9118f9339d3f25fa7438de | [] | no_license | nikitosoleil/bst | 0fa9662158b8f0aad6da0cfe76994075bae26d36 | 066bd4c72707f6114edc36548e8b1e4de469a084 | refs/heads/master | 2020-03-07T01:13:11.571899 | 2019-04-08T01:57:03 | 2019-04-08T01:57:03 | 125,647,835 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 236 | h | Bst.h | #pragma once
namespace BST
{
template < class T >
class Base
{
public:
virtual void clear() = 0;
virtual int size() = 0;
virtual void insert(T &obj) = 0;
virtual bool erase(T &obj) = 0;
virtual bool find(T &obj, T &res) = 0;
};
}
|
4d8500d236d2c365b83f0e4ef7ff1879b5e4770e | de2a898f31d141ab4a4b13a07727c9e3db203891 | /bench/depthwise_conv2d/base_depthwise_convolution_fixture.h | c0bf8d842ceb303e7c1a8e0f5d51f48e5d7033ab | [
"Apache-2.0"
] | permissive | ProGTX/SYCL-DNN | b9812912029721f700756c725b6b1ec365042283 | 9b2d0b8e3cf2748aae751eecd2ae2ad1102290c1 | refs/heads/master | 2023-06-22T16:33:57.818064 | 2023-06-07T14:13:05 | 2023-06-07T14:13:05 | 217,677,953 | 0 | 0 | Apache-2.0 | 2019-10-26T08:18:07 | 2019-10-26T08:18:06 | null | UTF-8 | C++ | false | false | 5,318 | h | base_depthwise_convolution_fixture.h | /*
* Copyright Codeplay Software Ltd.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use these files 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 ag... |
24f2a6f078376c5fc9babf2b17822edeff2d7dc3 | 5af7675b03adcbe19d95f81ba360f1a1b34f3513 | /YRenderLab/YRenderLab/Public/YGM/Vector2.hpp | 22cea95e7a0d92b2bfca6411608054d0dc33061e | [] | no_license | fakersaber/YRenderLab | 278d271edc5aae61a04b32587eee2530e657581f | c5b370255acd58d51f07416cc24651b53e30ade7 | refs/heads/master | 2021-06-22T17:23:53.009354 | 2021-03-01T06:09:26 | 2021-03-01T06:09:26 | 198,810,518 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,213 | hpp | Vector2.hpp | #ifndef _YRENDER_YGM_VECTOR2_HPP_
#define _YRENDER_YGM_VECTOR2_HPP_
#include <Public/YGM/Vector.hpp>
namespace YGM {
template <typename T>
class Vector<2, T> {
private:
using value_type = T;
public:
template<typename U, typename V>
Vector(U x, V y) :
x(static_cast<value_type>(x)),
y(static_cast<valu... |
cba2a571d01c054ffc4c3fa9d3eb66f4766edd06 | f61fd4da5a70e7bf8d564afe2c6e6bfa9e51d0a4 | /src/tcp/async/client.cc | 0d71ee13fa8865fd2f8d332cdeee8fc9ee28b0c8 | [] | no_license | zakharvoit/libtcp | 2f3383c075f3abb1caa2e86dd244bdcf3215b0ca | 8c07eeef6f5d9c40e32deb19092344ab3812a19a | refs/heads/master | 2021-01-15T14:43:13.440849 | 2017-10-24T17:04:19 | 2017-10-24T17:04:19 | 27,757,873 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,431 | cc | client.cc | #include "tcp/async/client.hh"
#include "tcp/async/io_service.hh"
#include <sys/socket.h>
#include <unistd.h>
#include <stdexcept>
#include <cstring>
#include <cerrno>
using namespace std;
using namespace tcp::async;
using namespace tcp::util;
client::client()
: fd(socket(AF_INET, SOCK_STREAM | SOCK_NONBLOCK, 0))
... |
9b5d1da4ddaed7d828dc12b4bb30004afe688628 | d3962aea9e8cabbee66c99cdc68c26c2eeefbac5 | /Audio.h | 91dc4ac56b565585a93f2854c9c0af9a8dcb853e | [] | no_license | gavishap/Messaging-Application | 04893d6c705b7dc70bbc5d148419368c8e26d0f8 | ceec4a9cbccc77731f690b65a2da7ddb48135c47 | refs/heads/main | 2023-08-18T16:21:20.974963 | 2021-10-16T20:09:47 | 2021-10-16T20:09:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 115 | h | Audio.h | #pragma once
#include "Media.h"
class Audio :public Media
{
public:
void display();//prints the audio
};
|
e447a8f9969522fc0bb5ae83fc7001162d5faa4b | 0c5c0e6358d7913d1946c0ba8b767cb45f4036d7 | /algos/importnat/maxProductSubArray.cpp | 829f231980ea80b1bf11cf2b1e3a05a09c64a0b8 | [] | no_license | ankursinha03/Competitive_Programming | a551eb8f882c50d5801727d350c9fd219cb034db | 1ab539cc5d13fb51308ee9cdbddfda021e796903 | refs/heads/main | 2023-07-28T21:00:55.494333 | 2021-09-25T11:54:42 | 2021-09-25T11:54:42 | 391,443,604 | 0 | 0 | null | 2021-09-25T11:54:43 | 2021-07-31T19:11:38 | null | UTF-8 | C++ | false | false | 1,077 | cpp | maxProductSubArray.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int MAXPRODUCTSUBARRAY(vector<int> v)
{
int numofNEG = 0;
int currProduct = 1;
int ans = 0;
int n = v.size();
for (int i = 0; i < n; i++)
{
if (v[i] > 0)
{
currProduct *= v[i];
... |
e9f28df637abe774930199eca91d060ca89cd003 | f0b46298d48e21887050c345531f842ee52fac43 | /strllnode/strllnode.cpp | d55d4a09fb5125d5ddceb5a45e571e5367471d8c | [] | no_license | leilanihagen/c--data-structs | 5942125f178af226e817869773c695eaa5086d50 | 8897477bbabe51cd9371886fd60b338f192f5514 | refs/heads/master | 2022-12-09T01:58:11.436206 | 2020-09-15T00:54:56 | 2020-09-15T00:54:56 | 293,194,742 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,704 | cpp | strllnode.cpp | #include <iostream>
#include <cstring>
#include "strllnode.h"
namespace DataStructs{
STRLLNode::STRLLNode(const char str[]){
char* dataNonConst = (char*)str;
this->data = new char[strlen(dataNonConst) + 1];
strncpy(this->data, dataNonConst, (strlen(dataNonConst) + 1));
this->next = NULL;
headDataNeedsInit =... |
83d976688c4760bac2311202d1164e0ea7cf38a8 | c426c1d5cca7d3e1f716b84f12032bf9ba8b9629 | /src/Вектора (Одномерные массивы)/HML_EqualityOfVectors.tpp | 2f81bc1bd897f04b2822a3ffb3cef4f3f53ef434 | [
"MIT",
"Apache-2.0"
] | permissive | Harrix/Harrix-MathLibrary | 24ce89a6c567fa456ef166f1a3f33c322f492118 | 19a753874cb5e792ba64b5c2d88a994e0644fccb | refs/heads/main | 2022-07-24T03:28:48.376683 | 2022-07-08T13:45:35 | 2022-07-08T13:45:35 | 10,152,735 | 7 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 532 | tpp | HML_EqualityOfVectors.tpp | template <class T> bool HML_EqualityOfVectors(T *a, T *b, int VHML_N)
{
/*
Функция проверяет равенство векторов.
Входные параметры:
a - первый вектор;
b - вторый вектор;
VHML_N - размер векторов.
Возвращаемое значение:
true - вектора совпадают;
false - вектора не совпадают.
*/
bool VHML_Result=true;
for (int i=0;i... |
51d3a818f50a975ac679d28bdd224d9f1b632473 | 6180044a1e2a1b7dea59ba3eef7e93d0a14bf011 | /KDBits/ConfigPath.cpp | 4f8d756234629109b34e6825b98e4d7b2e84c038 | [] | no_license | symanli/KDBits | a933f41bde70ebba1af5bcc328d0cb8d2563f260 | 4d4a61e435d3977fc34012e91432b954c28fcb56 | refs/heads/master | 2022-12-26T09:00:14.865262 | 2020-10-11T08:06:21 | 2020-10-11T08:06:21 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,817 | cpp | ConfigPath.cpp | // ConfigPath.cpp : 实现文件
//
#include "stdafx.h"
#include "KDBits.h"
#include "ConfigPath.h"
#include "pathselectdlg.h"
#include "configuration.h"
// CConfigPath 对话框
IMPLEMENT_DYNAMIC(CConfigPath, CPropertyPage)
CConfigPath::CConfigPath()
: CPropertyPage(CConfigPath::IDD)
, m_NetGamePath(_T(""))
, m_LocalGamePath... |
18aeb6a447989b3690ee7238883f4eea12e03f23 | 63e47ca4b169ff935335419f957a08f0122a183c | /URI 1020.cpp | 2d398237c64dc53741822eccf53af371b7832e5a | [] | no_license | sudiptoghosh8/uri | 0660f406aa7c2f1d3c10f1e2bb9885dd6639f8fa | 6e0187a0dff11644d734fd0ed927a3e03c09853f | refs/heads/main | 2023-04-23T02:04:59.270000 | 2021-05-06T15:39:32 | 2021-05-06T15:39:32 | 361,481,603 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 280 | cpp | URI 1020.cpp | #include<iostream>
using namespace std;
int main()
{
int n;
int a,b,c,d,s,y,m;
cin>>n;
y=n/365;
n=n%365;
m=n/30;
d=n%30;
cout<<y<<" ano(s)"<<endl;
cout<<m<<" mes(es)"<<endl;
cout<<d<<" dia(s)"<<endl;
return 0;
}
|
d337a1457ca172f69d9421c0911449281894ad29 | 8cc8a746894c304353ab3612ce73520bab5fb1a9 | /Garage.cpp | 0ed1976db8efebb0136cef8c526fda13488818d9 | [] | no_license | EniwaSentaiToshiking/LCourse_2016 | 835f78142227702bba47f5f2f9aa3e2b8e0d1dfa | 0fc67afd20ad2456ee4a192d8b5e4cf6107105bd | refs/heads/master | 2020-04-09T09:10:01.208478 | 2016-09-21T10:28:35 | 2016-09-21T10:28:35 | 68,192,269 | 0 | 0 | null | 2016-09-21T10:28:35 | 2016-09-14T09:19:56 | C++ | UTF-8 | C++ | false | false | 1,000 | cpp | Garage.cpp | #include "Garage.h"
Garage::Garage(Motor* r, Motor* l, TailControl* tc, BalancingWalker* b, Clock* clock, GyroSensor* g){
rMotor = r;
lMotor = l;
mTailControl = tc;
bw = b;
c = clock;
gyro = g;
GARAGE_flag = 1;
}
Garage::~Garage(){
}
void Garage::slowrun_stop(){
c->reset();
... |
f0e0287290ba737e1e463e6db4fd1b625495e5ed | 43a5f08225734f58b98b7088906422ee972cf48c | /src/transform/CNSPass.cpp | cfe8ea038945756c66e525387f47387ad759a502 | [
"NCSA",
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0",
"LLVM-exception"
] | permissive | baziotis/rv | ebcedd0e56d2d7cca088e53fe1b307576c617a8f | e0e9373bed333cf19370d811ecfd1146d605118a | refs/heads/master | 2022-07-22T07:38:30.511012 | 2020-05-11T14:45:36 | 2020-05-11T14:45:48 | 265,248,724 | 0 | 0 | Apache-2.0 | 2020-05-19T13:01:33 | 2020-05-19T13:01:32 | null | UTF-8 | C++ | false | false | 4,868 | cpp | CNSPass.cpp | /*
* Regularizer.cpp
*
* Created on: 29.04.2010
* Author: gnarf
*/
#include <fstream>
#include <llvm/Pass.h>
#include <llvm/IR/Verifier.h>
#include "cns/BlockGraph.h"
#include "cns/CNS.h"
#include "cns/CNSScoring.h"
#include "cns/SplitTree.h"
#include "cns/llvmDuplication.h"
#include "cns/CommonTypes.h"
#... |
1a5da228e5b78e4f24da01c990c1700228013f22 | b5b627842557a5ff81cf236bb45d5c09ed27f70f | /src/aether/core/raylib/rl_application.cpp | 18d8afdaae1070564d29a0a1ffda0c25b7f9f86c | [] | no_license | alesegdia/aether | b580974d8359b6f9579ff017c05169f4ac939545 | 495e1f59e9b4c48e3bcacb9b4937a738712048a8 | refs/heads/master | 2023-08-23T07:53:12.193740 | 2023-06-29T19:22:05 | 2023-06-29T19:22:05 | 130,353,467 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 850 | cpp | rl_application.cpp | #include "rl_application.h"
#include <iostream>
#include <imgui.h>
#include <imgui_impl_allegro5.h>
#include <iostream>
#include "raylib.h"
namespace aether {
namespace core {
RaylibApplication::RaylibApplication(int sw, int sh)
: ApplicationBase(sw, sh)
{
}
RaylibApplication::~RaylibApplication()
{
}
int... |
f8c8bd105d6fe50898942d14a3428692892fc64c | b1e6fc470616f5695d42aa29d2dd692cec799ea6 | /src/MatrixIndex.cpp | a0867a7facba79dce3e5e5d6b055dfd936e63531 | [] | no_license | azariiva/SparseMatrix | ce2395e6838bfedc03d95d250eda5196b6f32dcd | 9b02eba9f6a9723ed984535d77d4d4e43616b71d | refs/heads/master | 2023-03-18T23:06:59.747586 | 2021-03-14T17:09:07 | 2021-03-14T17:09:07 | 343,347,513 | 0 | 0 | null | 2021-03-06T18:57:19 | 2021-03-01T08:49:00 | C++ | UTF-8 | C++ | false | false | 1,963 | cpp | MatrixIndex.cpp | #include "MatrixIndex.hpp"
MatrixIndex::MatrixIndex(size_t urow, size_t ucolumn) {
row = urow;
column = ucolumn;
}
MatrixIndex::MatrixIndex(const MatrixIndex& src) {
row = src.row;
column = src.column;
}
MatrixIndex& MatrixIndex::operator=(const MatrixIndex& rv) {
if (&rv == this) {
retur... |
05572823418e56fb0453ad8715c24098d0f4356d | c2484df95f009d516bf042dca93857b43a292333 | /codeforces/round325/d/main.cpp | 273aabd1fb0cbb3f956232941fb3cc27bb747dd6 | [
"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 | 1,467 | cpp | main.cpp | // codeforces round325
// http://codeforces.com/contest/586/problem/D
#include <cstdio>
#include <set>
using namespace std;
class Node { public:
Node(int r_, int c_): r(r_), c(c_) {}
int r, c;
bool operator <(const Node &n) const {
return (c == n.c ? r < n.r : c < n.c);
}
};
char in[3][105];
... |
564e89e2f6925e8ae480d84f77d2c7e0f281ecdc | 438ea4bfd72727bc5d49937719222858888b53f4 | /clientitem.h | 2167db576c23751e1269155ec84e28126f294f4a | [] | no_license | sumoonx/apollo_ui | 63ed52c99f45ce31ed01a43ac6fa57de08dd7efc | 02170af315b0455b2d87d6018d5fed327a8a5699 | refs/heads/master | 2021-06-03T05:28:47.683591 | 2016-09-13T05:17:48 | 2016-09-13T05:17:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 649 | h | clientitem.h | #ifndef CLIENTITEM_H
#define CLIENTITEM_H
#include <QObject>
#include <QGraphicsItem>
#include <QPainter>
#include <location.h>
class ClientItem
: public QObject, public QGraphicsItem
{
Q_OBJECT
public:
ClientItem(QGraphicsItem *parent = Q_NULLPTR);
QRectF boundingRect() const;
void paint(QP... |
d78bac26eca1b3bb1cf6b5acac0a30bdef3aac31 | cde53377597f34841085a393e37819509334a9d2 | /MaterialManager.h | d412c371688162e4b7c7509e769a5c8527560f46 | [] | no_license | AdrianFL/Physics-AI-Framework---Uploadable | 890641194f764acb35365456a3b7981b433566bf | c0339a81f3a0022de662913d2a3e49f4e6e10c62 | refs/heads/master | 2020-08-24T08:18:21.081619 | 2017-09-25T21:56:15 | 2017-09-25T21:56:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 188 | h | MaterialManager.h | #pragma once
#include "Structures.h"
class MaterialManager
{
public:
MaterialManager();
~MaterialManager();
Material shinyMaterial;
Material noSpecMaterial;
Material skyBoxMat;
};
|
a412b59c265b6c3c22e871c10a34aa0b1d1f2401 | 7fcc8a4b2dc018bfa451b0b99201006877f8b6da | /unittest/engine_proto_internal_vallist_test.cc | 1dfe45e90bdddce6a10b89a9c347195f5e185ca4 | [
"Apache-2.0"
] | permissive | ComputationalAdvertising/openmi | a6220c5d99df59cf3b4a5b8bd8f64908fd2ff1e0 | 1d986ada6c57fecf482f4b8dc4d2488cb0189a3e | refs/heads/master | 2020-04-19T23:02:25.973052 | 2019-11-10T15:11:50 | 2019-11-10T15:11:50 | 168,486,154 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 592 | cc | engine_proto_internal_vallist_test.cc | #include "openmi/idl/proto/communication.pb.h"
#include "base/logging.h"
using namespace openmi;
int main(int argc, char** argv) {
proto::comm::ValueList val_list;
val_list.mutable_val()->Resize(9, 0);
val_list.add_val(0.1);
// val_list.set_val(2, 0.2);
// val_list.set_val(9, 0.9);
LOG(INFO) << val_list... |
a1fdafa1ca3c3a2e744968ae3cd805740bd1efbc | 38b9daafe39f937b39eefc30501939fd47f7e668 | /tutorials/2WayCouplingOceanWave3D/EvalResults180628-fully/74/p_rgh | c0af47b7b24a446934ed3f02a34822ff6859eb83 | [] | no_license | rubynuaa/2-way-coupling | 3a292840d9f56255f38c5e31c6b30fcb52d9e1cf | a820b57dd2cac1170b937f8411bc861392d8fbaa | refs/heads/master | 2020-04-08T18:49:53.047796 | 2018-08-29T14:22:18 | 2018-08-29T14:22:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 197,829 | p_rgh | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 3.0.1 |
... | |
b063c9139d0830423fa94674de55a2fe73b91e2b | 50fade5bebf7ed89d151fcdce6dd82ac6c11ff3a | /Overdrive/render/vertexarray.cpp | 8200241bc95c4b4ec6d737a9a1f9ca021aed2f64 | [
"MIT"
] | permissive | truongascii/Overdrive | bfd754357a46ac0cb753646f9f38f3d2581d84ce | 5dba4e3d29076e68a9036f6b5175fc78a65b0210 | refs/heads/master | 2020-12-30T22:45:28.683533 | 2014-11-09T19:44:58 | 2014-11-09T19:44:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,148 | cpp | vertexarray.cpp | #include "render/vertexarray.h"
namespace overdrive {
namespace render {
VertexArray::VertexArray():
mHandle(0)
{
glGenVertexArrays(1, &mHandle);
}
VertexArray::~VertexArray() {
if (mHandle)
glDeleteVertexArrays(1, &mHandle);
}
GLuint VertexArray::getHandle() const {
return mHandle;
}
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.