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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
de4c653c1ec4cf38237f6693ba042a3559a58c99 | e8363cd45cf1fce7181d82f91df7ad3f8c9f7488 | /1_ProceduralProg/Chap02/Exo05/SimpleMath.cpp | 4630d308523096ee2a02bd48fa8e708c7675be84 | [] | no_license | sovoessi/CPP | 66b6cf11933e93515379014b5585f2cd5605177e | 68be86e2199287380e40c1bdd040740008b471ef | refs/heads/master | 2023-04-02T04:27:21.358862 | 2021-04-21T09:11:04 | 2021-04-21T09:11:04 | 343,209,933 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 641 | cpp | SimpleMath.cpp | #include <iostream>
using std::cout;
using std::cin;
using std::endl;
int main(int argc, char *argv[]){
long int fnum = 0LL, snum = 0LL;
cout << "What is the first number? ";
cin >> fnum;
cout << "What is the second number? ";
cin >> snum;
cout << fnum << " + " << snum
<<... |
da2d8ff703881532fbf1a61eb8b922ba2e6c6dcf | 3f0d97b22c413493c2e914b7e4cbb8c704560e0e | /reverseinteger/test_reverseinteger.cpp | 2150962bba89fb4783cdd9507ab25b3e15c93e04 | [] | no_license | zhouliangyi/LeetcodeExercise | 7b2618325f4656cdaa8e2862cd572b166fafe0b3 | aff5fdcaa770840054ebb98fde4c28463c8b7e47 | refs/heads/master | 2020-03-28T12:32:09.938614 | 2018-10-21T11:22:35 | 2018-10-21T11:22:35 | 148,307,893 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 416 | cpp | test_reverseinteger.cpp | #include "reverseinteger/reverseinteger.h"
#include "gtest/gtest.h"
TEST(test_reverseinteger, Input_123)
{
int in=123;
ReverseInteger r;
EXPECT_EQ(r.reverse(in),321);
}
TEST(test_reverseinteger, Input_minus123)
{
int in=-123;
ReverseInteger r;
EXPECT_EQ(r.reverse(in),-321);
}
TEST(test_revers... |
c527b4c8683d693fcd23b0b636c655bc476fd53e | a075357e9b99cb6f6549c9b9bee8c34206ebd28a | /6304/Zapevalov_A/L5/src/main.cpp | 63d7bf8a2e0e18ea5f3943930b63e37e2c66ce08 | [] | no_license | Radiogag/oop | e35ab0de9f060b589f91321ec3665404cfbe58fa | 43c9afe43920df4b2d44b7d15d01d0ec4cd1d1d8 | refs/heads/master | 2020-03-20T10:19:57.511464 | 2018-06-14T14:33:34 | 2018-06-14T14:33:34 | 137,279,206 | 0 | 0 | null | 2018-06-13T23:19:02 | 2018-06-13T22:41:53 | C++ | UTF-8 | C++ | false | false | 1,690 | cpp | main.cpp | // ConsoleApplication6.cpp: определяет точку входа для консольного приложения.
//
#include "shape.hpp"
#include "Triangle.hpp"
#include "Parallelogram.hpp"
#include "Rhombus.hpp"
#include "vector.hpp"
#include "sharedptr.hpp"
#define N 1000
using namespace std;
bool otl()
{};
void viborka()
{};... |
e2308a8f3d8727924f70577a02b6a5595370efdf | dd5e9e3fc2f6f8c36b1baa99b3ce30cee7e70773 | /lab-5.cpp | 6470177fb3c4f6a4859ea77443dec45c7c46568a | [] | no_license | programming-653501/LiskovetsB | b286df1e4db459b5fb3c07b4d86d3944463673ad | a9b8d28e0ee8b2c99006e91facf21f4b9daffceb | refs/heads/master | 2021-06-17T03:16:38.954001 | 2017-05-22T16:47:02 | 2017-05-22T16:47:02 | 83,356,675 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 2,943 | cpp | lab-5.cpp | #include<iostream>
#include<conio.h>
#include<stdio.h>
#include<fstream>
#include<stdlib.h>
using namespace std;
class Node {
public:
Node*next;
Node*head;
long long int value;
bool hasNext() { return head != NULL; }
Node() {
head = NULL;
next = head;
}
};
void add(int value, Node*&Stac... |
e93b9fdc71c624649d2c584cecd741e607039a46 | 7b9c1769a70f43cb8f07ab9934e29899de75138d | /src/Problem 856. Score of Parentheses.cpp | d01911647fdcfc34af77a044112422b6c4b30fa4 | [] | no_license | Lqlsoftware/LeetCode-OJ | 7a8feba230d058a8f1e8d81e78e96bb5a4a3ac58 | 607e45d1fd089720f0123a05fe97c79689bf38de | refs/heads/master | 2021-06-01T18:34:48.316392 | 2021-03-30T14:27:18 | 2021-03-30T14:27:18 | 110,775,772 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,154 | cpp | Problem 856. Score of Parentheses.cpp | // 856. Score of Parentheses
#include <iostream>
#include <string>
#include <stack>
using namespace std;
// Stack
class Solution {
public:
int scoreOfParentheses(string S) {
stack<int> stk;
stk.push(0);
for (auto ch : S) {
if (ch == '(') {
stk.push(0);
... |
eb43f4580428d7500ed9a9c8c390ea8e954aef64 | 4ce4be841db791e621928cee0c87c7981830c925 | /Camera.h | 7ab9b6007a260d533277238d632bb20ddadf0491 | [] | no_license | egemenkopuz/simple-ray-tracing | aefd48b0b6790a1e9ced62b276bef5b8328fa4f8 | 20c7f9b0a7a7b3d73aebeb728fb1275bba7cee0a | refs/heads/master | 2022-12-16T02:14:38.081988 | 2020-09-01T12:48:32 | 2020-09-01T12:48:32 | 289,501,046 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 429 | h | Camera.h | #ifndef CAMERA_H_EK
#define CAMERA_H_EK
#include "Ray.h"
class Camera {
public:
Vector3D position, direction,
horizontalDirection, verticalDirection;
double viewWidth, viewHeight;
Camera() = default;
Camera(const Point3D &position, const Vector3D &target, const Vector3D &verticalDirection,float fov, float asp... |
dd7fae64c9ee3c18053e96eadddc5fd285503d63 | 0e39eb38bebb47bdc4b4b7598a697514223fd0a5 | /reader/my_reader_dataset_op.cc | 8bcc5a9db7ecc4172e156319f97ae573f4fe03f0 | [] | no_license | smallsunsun1/tensorflow2.0_CustomOpTest | 4af5b5ddd36f1a439aed65032af8082a05dd4458 | 5c5af370f844d0088f0e1a008123b83e90b3a9ee | refs/heads/master | 2020-11-27T10:11:54.539587 | 2019-12-21T08:10:28 | 2019-12-21T08:10:28 | 229,397,109 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,903 | cc | my_reader_dataset_op.cc | //
// Created by 孙嘉禾 on 2019-08-09.
//
#include "tensorflow/core/framework/common_shape_fns.h"
#include "tensorflow/core/framework/dataset.h"
#include "tensorflow/core/framework/reader_op_kernel.h"
#include "tensorflow/core/framework/reader_base.h"
#include "tensorflow/core/common_runtime/metrics.h"
#include "tensorfl... |
182985f0fdd3273ba140d2f329fa2f3486c9ae46 | 0d809394e82f46247cc990efb71cd82686b0f519 | /VivadoHls/tau_algo_unpacked/vivado_hls/src/algo_inputs_layer2_v3_tb.cpp | 98ff65086b0e8396b345bb9b0357ced730b19ae3 | [] | no_license | violatingcp/APx_Gen0_Algo | b863b5e640cdb8105dbecdccdadc6402e32bc82a | 276b3489aafe165436dc66650be592fe96e567ef | refs/heads/master | 2020-05-25T14:08:21.768415 | 2019-06-23T12:53:53 | 2019-06-23T12:53:53 | 187,837,672 | 0 | 2 | null | 2019-05-21T12:58:08 | 2019-05-21T12:58:08 | null | UTF-8 | C++ | false | false | 3,838 | cpp | algo_inputs_layer2_v3_tb.cpp | #include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <unistd.h>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <string>
#include "ap_int.h"
#include "algo_inputs_layer2_v3.h"
using namespace std;
typedef ap_int<64> tmpaxi_t;
int main(int argc, char ** argv) {
float dp... |
c10f4213c0e0f8238fb081fc13954ae40d3cd9dd | 2441b892e99d5e5de3af51d9520c900639d95033 | /SymbolicObjects/SymbolicMatrix.cpp | 6b84b94c13a9f518d8fe7b1d63c78e06232e603c | [] | no_license | alinaT95/AutomaticCryptanalisis | 2537d9780385b24e560dd559006bd75a51aece11 | a79966aeac6f8b588f5628ed0b678f60b97d4f38 | refs/heads/master | 2021-06-06T11:48:22.477312 | 2016-10-06T15:23:39 | 2016-10-06T15:23:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 66 | cpp | SymbolicMatrix.cpp | #include "SymbolicMatrix.h"
SymbolicMatrix::SymbolicMatrix()
{
}
|
9a7c25d7143bb80c3f10e3ebe7d46326e0291b69 | eb5fc6309b94c3e2056e4bc9d5cbd97e1550a29a | /2020_acm/DFS와 BFS/7576.cpp | 6a47f75487511671a802960d24af88325d313ba8 | [] | no_license | SuHyeonJeong/acm_study | 8412bde37d2416e7182cc2bfa91d02f05370cd20 | e2c579b19d0c0e6ba8441734aedefe8f00380e63 | refs/heads/master | 2022-06-05T21:55:28.514671 | 2022-04-05T06:40:38 | 2022-04-05T06:40:38 | 172,499,463 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,097 | cpp | 7576.cpp | #include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
const int dx[] = { 0, 0, -1, 1 };
const int dy[] = { -1, 1, 0, 0 };
int N, M;
const int MAX = 1001;
int map[MAX][MAX];
queue <pair<int, int>> q;
int BFS()
{
if (q.empty())
{
return -1;
}
while (!q.empty())
{
int y = q.front().fi... |
99815a5d3ca94b5a68a87858d6b15bb08d32b1e9 | 7bde5822e540f07cdf94411318982de57b1317bc | /Projects/Tokenizer/main.cpp | 7e899d83bfd406465a6ac09f49d117f7f5762ea5 | [] | no_license | JaRoHe318/Cpp | 434e440942b58f280f3f7c7bd5ebe65280411b38 | a7af4ac1418fc900376a2e0e391a695baa0f078e | refs/heads/master | 2021-08-31T23:21:55.837721 | 2017-12-23T12:22:23 | 2017-12-23T12:22:23 | 105,232,572 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 276 | cpp | main.cpp | #include <iostream>
using namespace std;
#include "jtoken.h"
#include "double.h"
#include "integer.h"
#include "funct.h"
#include "op.h"
#include "tokenizer.h"
int main(){
cout << "Tokenizer!" << endl;
Tokenizer getToken;
getToken.getEquation();
return 0;
}
|
6e06a4fabc09f74e8e556530e9967d8a42e4afd8 | 1ef0afb6ba04e74cf59c38369f0341899d3635f7 | /Cacades/AntiAliasingInfo.h | 0f423ae98a2d0d7fc18af0dd5da83732538d40a2 | [] | no_license | fabi092/Cascades-Shaderprogramming | 57beb4d9b8bfa2d63c8311d3aff37775a4ae5f71 | 22630bd94b988c4212ab238c478d43685d42867c | refs/heads/main | 2023-04-09T13:39:25.891657 | 2021-04-15T06:45:58 | 2021-04-15T06:45:58 | 358,103,787 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 809 | h | AntiAliasingInfo.h | #pragma once
#include <sstream>
#include <GL/glew.h>
struct AntiAliasingInfo
{
GLsizei Samples = 8;
GLsizei ActiveSamples = 8;
GLsizei MaxSamples;
GLuint ColorBuffer;
GLuint DepthBuffer;
void Init()
{
glGenRenderbuffers(1, &ColorBuffer);
glGenRenderbuffers(1, &DepthBuffer);
if (GLEW_NV_framebuffer_mult... |
6d21ecfe3c791d1774adc39bc9a7c0ad576feda8 | 64060871046acbecdfd8ee34a241bbcb9efee37e | /src/database/tds/tds_resultset_metadata.cpp | 766b67eb0403f334ccd41521b6225cacfa168bbd | [] | no_license | mtangoo/wxDatabase | 0fbc4c19b7272336d487947df53f28bffb0f30ad | 8152e805f2fda92805e487ad0a85deaf6f2968bd | refs/heads/master | 2021-12-13T06:27:23.944429 | 2021-12-02T06:56:19 | 2021-12-02T06:56:19 | 6,829,298 | 33 | 20 | null | 2021-09-17T19:23:01 | 2012-11-23T15:26:16 | C++ | UTF-8 | C++ | false | false | 767 | cpp | tds_resultset_metadata.cpp | #include "wx/database/wxprec.h"
#if wxUSE_DATABASE_TDS
#include "wx/arrimpl.cpp"
WX_DEFINE_OBJARRAY(ArrayOfTdsColumns);
// ctor
wxTdsResultSetMetaData::wxTdsResultSetMetaData(TDSRESULTINFO* pInfo)
{
for (int i=0; i<pInfo->num_cols; i++)
{
wxTdsColumnData column(pInfo->columns[i]);
m_Columns.... |
385fa72abafe51c5a14b8cd7c2944980b25166cd | d27941bf615cd93b5aeea660ddf919d331b7a1a8 | /0215-Kth-Largest-Element-in-an-Array/C++/main.cpp | 0ce00b99a9f79ce9858cfc0d14af7f38638c334c | [] | no_license | lsr3406/Leetcode-Exercise | de71348d7802351d410fd87ad3c0a85ddbd0b2ef | 044de951f9f35225b40e76df5527711d17cbc492 | refs/heads/master | 2020-04-19T04:09:02.768064 | 2019-11-13T02:56:18 | 2019-11-13T02:56:18 | 167,954,959 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,309 | cpp | main.cpp | /**
* encoding: utf-8
* @author: siru
* @create on: 2019-01-29 21:16:01
* @update on: 2019-01-29 22:55:25
*/
#include <iostream>
#include <cassert>
#include <vector>
using namespace std;
// 215. Kth Largest Element in an Array
// https://leetcode.com/problems/kth-largest-element-in-an-array
class Solution {
pub... |
19dbac427243a66d5996eaf1001b7da23671856b | ed9278ce7ba6e05166b7d65f995e1f0b2720b2d6 | /src/log/TypeRegistry.cpp | c64d4db725cadf2c6f5cda8599def0d2c2863d90 | [] | no_license | dwks/crystallizer | 10858a923e6768ccf36eb23b601aa4714f5cd4fd | 4a962c63bc55a952e3fbe1dfe2d8ce18f8cf154f | refs/heads/master | 2021-03-12T21:49:22.114468 | 2011-07-17T23:13:47 | 2011-07-17T23:13:47 | 2,062,887 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,267 | cpp | TypeRegistry.cpp | #include "TypeRegistry.h"
namespace Crystallizer {
namespace Log {
TypeRegistry TypeRegistry::instance;
TypeRegistry::TypeRegistry() {
addNextType(Subsystem::GLOBAL, "ERROR");
addNextType(Subsystem::GLOBAL, "WARNING");
addNextType(Subsystem::GLOBAL, "PROGRESS");
addNextType(Subsystem::NETWORK, "... |
cd138bf961cec446278ca3ceab2fb71b9aceb416 | c7130ac6790860a83dfb85695379a8f1f7691652 | /advanced level/1109/1109-cpp.cpp | 134e83085fa3e39772d88a41aa75599acdefe530 | [] | no_license | diaojibo/PAT-Code | e3421fc154ce2e31b959126fcf95200169b19816 | f5ea6fb9a63ffc56bde002a32247921d3365455e | refs/heads/master | 2020-05-21T17:47:02.429046 | 2017-12-09T01:42:19 | 2017-12-09T01:42:19 | 65,083,793 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,473 | cpp | 1109-cpp.cpp | #include<iostream>
#include<vector>
#include<string>
#include<stdio.h>
#include<algorithm>
using namespace std;
struct person{
int height;
string name;
};
int n,k;
vector<person> people;
bool compstring(string a,string b){
int sizea,sizeb;
sizea = a.length();
sizeb = b.length();
int msize = min(sizea,sizeb);
... |
48e3eda0a8ce2aea20ea9aea66d74fd45e1f4050 | 8436ccff8c4d0632030f74dcf26fedb09504326c | /08/String/UseString.cpp | 657b9dac2561050a8039ee98b8c139178b11421f | [] | no_license | zoteva/oop-kn-5-2021 | 5e2166cf02494afc438bf003e5cf278b02a55454 | 80097a3acd688e9eac159933c9ea6f56dbe280e4 | refs/heads/main | 2023-05-30T19:13:45.742160 | 2021-06-19T08:19:16 | 2021-06-19T08:19:16 | 340,749,049 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 363 | cpp | UseString.cpp | #include "String.h"
#include <iostream>
int main()
{
String s;
s = "abc";
std::cout << std::boolalpha << (s == ("abd")) << std::endl;
std::cout << s[1] << std::endl;
s[1] = 'D';
s += "new";
std::cout << "Source: " << s << std::endl;
String subStr = s(3, 8);
std::cout << "Substring: ... |
29776899dc96e043491608dfd619a4eb5cde30dc | 4394d4ebd19b8eff58586fbded3a416faf7fa0ab | /ast/src/View.cpp | 9fb43244b76afa802a93af92393cad5037db31fc | [] | no_license | ivan-uskov/compiler | 660ce11d0c988b72a74be41d99e15b69737eeca6 | 474c96895eef84f568f0343719ccfc1a76020e2d | refs/heads/master | 2020-03-19T12:15:27.140901 | 2020-01-21T22:48:24 | 2020-01-21T22:48:24 | 136,506,565 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,738 | cpp | View.cpp | #include "../View.h"
#include "../NumberBinaryOperatorAST.h"
#include "../IntAST.h"
#include "../ExpressionPairAST.h"
#include "../VariableDeclarationAST.h"
#include "../AssignmentAST.h"
#include "../VariableAccessAST.h"
#include "../FunctionCallAST.h"
#include "../CompareBinaryOperatorAST.h"
#include "../IfAST.h"
#inc... |
551e3ae368d66db120d71cd575df3f45f806a507 | 8247b94227a3e4169c2c8a2b572cf57dc24917a2 | /src/beast/beast/http/curlReader.h | e58c07ab9690b065042abf7ce0945ec6bd9353cb | [
"MIT-Wu",
"MIT",
"ISC",
"BSL-1.0"
] | permissive | StanChe/stellar-mobile | 4e641dd27fa594e38971f549c57b218403e8522f | 43a99d4da4369ecfe5b2a907f740dfd99056058e | refs/heads/master | 2020-05-18T13:26:51.005312 | 2014-12-06T10:09:23 | 2014-12-06T10:09:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 209 | h | curlReader.h | #ifndef BEAST_HTTP_CURLREADER_H_INCLUDED
#define BEAST_HTTP_CURLREADER_H_INCLUDED
namespace beast {
class CurlReader {
public:
std::string performRequest(std::string url, std::string params);
};
}
#endif |
76b0f095b86f1d5319bfa8e4674c8014290863eb | 9008c69d81f91224e2dcb4faaa87a73af2923bdf | /TEST 20180329/TEST 20180329/LuckyPoker.cpp | 9eaa5d26053c0f29e8ab26c07ca9cfd94ee8cb0e | [] | no_license | qwer87511/OOP-Homework | 84c5d0b4ae9ca7beb7c6cf43ad49ce1289829254 | b26e0c159735f27488e7abca25d46ce624188827 | refs/heads/master | 2020-03-19T01:18:12.701354 | 2018-06-02T14:52:39 | 2018-06-02T14:52:39 | 135,535,985 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,140 | cpp | LuckyPoker.cpp | #include "LuckyPoker.h"
#include <random>
#include <algorithm>
#include <ctime>
#include <iostream>
using std::cout;
using std::shuffle;
using std::default_random_engine;
LuckyPoker::LuckyPoker()
{
srand(time(NULL));
_cards.resize(52);
for (int i = 0; i < 52; ++i)
{
_cards[i] = (i / 4) + 1;
... |
bab891d62c2270dade247f129f1f3f1ba9e3e3fa | f6cb916c7e9db39728e786f89df8d59fe3dfec3d | /bugs/13152/src/bcd/fltk/Fl_Hor_Slider.cc | eadfb1965e61f5b3920fec12f67d60c02423b7a4 | [] | no_license | CyberShadow/DBugTests | 8e2b9935ab1e65e7c14638b4a63bc5fec8aee1a2 | 24a227d9b835c1bc72b6c469ab293e0c3bf9039f | refs/heads/master | 2023-08-22T14:37:08.841829 | 2023-07-20T16:51:45 | 2023-07-20T16:51:45 | 23,382,869 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,270 | cc | Fl_Hor_Slider.cc | /* THIS FILE GENERATED BY bcd.gen */
#include <stdlib.h>
#include <string.h>
#include "../bind.h"
#include "FL/Fl_Hor_Slider.H"
extern "C" {
void _BCD_delete_13Fl_Hor_Slider(Fl_Hor_Slider *This) {
delete This;
}
Fl_Hor_Slider *_BCD_new__ZN13Fl_Hor_SliderC1EiiiiPKc(int X, int Y, int W, int H, char const * l) {
return ne... |
4bccf1a526f491ea7229cd2495f3f4fae3d5ee7b | 2d71917f247ef84a93ada564bf79abc1bacc7208 | /ex03/Ice.hpp | f6e35b1f6c74b7536b804aa42163110ea66d3327 | [] | no_license | obellado/cxx.04 | 114bad561342c60b3a2696c3ce909d6207d30808 | 991f2e101ccad183a5d0a495e729553edd6888dd | refs/heads/master | 2023-06-25T01:32:07.635868 | 2021-07-31T20:01:55 | 2021-07-31T20:01:55 | 389,726,777 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 337 | hpp | Ice.hpp | #pragma once
# ifndef __ICE_H__
# define __ICE_H__
# include "ICharacter.hpp"
# include "AMateria.hpp"
class Ice : public AMateria {
public:
Ice( void );
virtual ~Ice( void );
Ice( Ice const & copy );
Ice & operator=(const Ice & copy);
virtual AMateria* clone() const ;
virtual void use(ICharacter & tar... |
2e9226e4cccc7d683ca76c7b488307f913ef0fc5 | 1e5c488081e59040b484a2a56b93a2ea1d91ddf8 | /src/src/ACE/src/componentres.cpp | 0ab99a411b1186238909bfda4f8f5e81f212ab21 | [
"BSD-3-Clause",
"Apache-2.0"
] | permissive | siconos/acef | 54c38737f93d34e35c1f7d4b0d3fe7f39b71b260 | 200d1c4e0b2ba7e10c3393d93f60e156c3646154 | refs/heads/master | 2023-01-14T16:40:05.973224 | 2020-11-24T12:51:27 | 2020-11-24T12:51:27 | 315,632,330 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,071 | cpp | componentres.cpp | /* Siconos is a program dedicated to modeling, simulation and control
* of non smooth dynamical systems.
*
* Copyright 2019 INRIA.
*
* 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
*
*... |
9461a6659621ee0b8faaef9b95264deafac2fe04 | 7659d93d559e81e73c5d7dfc34ae84c28e180fec | /darkness-engine/shaders/ShaderTypes.h | 760ebbe24c561bd058a9d0f6af80f6c26c492f74 | [] | no_license | Karmiska/Darkness | d6905017025dd5b2cf591533ffcc21bd13a824ae | a9e35281307e8aa8843213f92804f6d74d145754 | refs/heads/master | 2023-07-23T10:19:41.900249 | 2023-07-09T11:00:33 | 2023-07-09T11:00:33 | 109,767,787 | 8 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 9,134 | h | ShaderTypes.h | #pragma once
#include "tools/ByteRange.h"
#include "engine/primitives/Matrix4.h"
#include "engine/primitives/Vector4.h"
#include "engine/primitives/Vector2.h"
#include "engine/primitives/Vector3.h"
#include "engine/graphics/CommonNoDep.h"
#include "engine/graphics/Format.h"
#include "shaders/ShaderPodTypes.h"
#include... |
af5461ef0515002b6c84995ea2f3828907b709ba | 93343c49771b6e6f2952d03df7e62e6a4ea063bb | /HDOJ/1249_autoAC.cpp | 7a1e853fd3fad6dbc65012251cadc1273684bf5a | [] | no_license | Kiritow/OJ-Problems-Source | 5aab2c57ab5df01a520073462f5de48ad7cb5b22 | 1be36799dda7d0e60bd00448f3906b69e7c79b26 | refs/heads/master | 2022-10-21T08:55:45.581935 | 2022-09-24T06:13:47 | 2022-09-24T06:13:47 | 55,874,477 | 36 | 9 | null | 2018-07-07T00:03:15 | 2016-04-10T01:06:42 | C++ | UTF-8 | C++ | false | false | 196 | cpp | 1249_autoAC.cpp | #include<stdio.h>
int main()
{
int n,s=2,i,m;
scanf("%d",&n);
while(n--)
{
scanf("%d",&m);
s+=6*(m-1);
printf("%d\n",s);
}
return 0;
}
|
d45ee50f5016ba36458782a8ea272b83ef6becd4 | 8f7b5b0efda15722f0c348734ad18aad7ff9565e | /Faceanomaly1Plugin/faceanomaly1plugin.cpp | ac63180bf8d791d9119c4599c5db47ab67119a6f | [] | no_license | charithwije/nooba-plugin-faceanomaly1 | 51675c3852f866b6ef1eda1023100db7c7d3924c | 1cb12c2bca70b428171d68c7a32ff87cf1f07a67 | refs/heads/master | 2021-01-01T17:15:56.970277 | 2013-12-07T05:12:43 | 2013-12-07T05:12:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,883 | cpp | faceanomaly1plugin.cpp |
/*@file faceanomaly1plugin.cpp
@author Charith Wijenayake <charithwije21@gmail.com>
@section LICENSE
Face Anomaly 1 API source file
Copyright (C) 2013 Developed by Team Nooba
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as publ... |
7103f93390aab018319b9f2ab2722cd8af80032f | 77337f9ac278bfd6f5f885b53d9a6b345b120c44 | /GRAPH/Bai047.cpp | ea18eef4fe041d6aa89c4febd60c7351c93caae3 | [] | no_license | JackNguyen1209/ICPC_TryHard_ | cd14a9f24e5d794978d827a665e9133e88fc47ff | a4d7a42266814189a27280dac6996809da0c5d64 | refs/heads/main | 2023-07-10T15:55:13.270627 | 2021-08-15T13:47:23 | 2021-08-15T13:47:23 | 367,665,016 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,263 | cpp | Bai047.cpp | /*
Nguyen Duc Anh Phuc_Jacke
*/
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<pll, ll>plll;
const ll M = 1e9 + 7;
class graph
{
private:
vector<vector<ll>>g;
... |
4f115285ae43b7378ebf618edff1c2b6382f7882 | 6ecbf084f558b37f0cee51c7226c1e116b5aa7bf | /SIR/.SIR/build_openmp_sse/src/bi/netcdf/SMCNetCDFBuffer.cpp | 3de9503f468e00e37b6c12cc04d56b62acedffd5 | [] | no_license | reichlab/bayesian_non_parametric | 364b12ad07b09e9a4386572bd47c709ad7629497 | c8d7eb7493addb919b8f7159768dc732ce1a1f35 | refs/heads/master | 2021-01-01T06:43:10.176687 | 2018-03-25T14:33:32 | 2018-03-25T14:33:32 | 97,492,688 | 2 | 0 | null | 2018-01-02T15:23:21 | 2017-07-17T15:38:01 | Python | UTF-8 | C++ | false | false | 1,193 | cpp | SMCNetCDFBuffer.cpp | /**
* @file
*
* @author Pierre Jacob <jacob@ceremade.dauphine.fr>
* $Rev $
* $Date$
*/
#include "SMCNetCDFBuffer.hpp"
#include <string>
bi::SMCNetCDFBuffer::SMCNetCDFBuffer(const Model& m, const size_t P,
const size_t T, const std::string& file, const FileMode mode,
const SchemaMode schema) :
MCMCNe... |
8d76625de76c6e019a117af852b036f5bab0dde5 | 28f36227496f833f73951612e81d5d3d603e81fc | /GameEngine2D/src/Component/Transform/TransformPartialComponent.cpp | 0110ae69d654a5043b041c3a643312fdd137edcb | [] | no_license | rishi-menon/Game-Engine-Udemy | 65fef4e334114a4ea2114c1b7d259a109df63958 | b707423c1164272ca776919b67223d0ea8cf120a | refs/heads/master | 2022-10-11T10:40:33.730854 | 2020-06-11T04:22:10 | 2020-06-11T04:22:10 | 258,875,501 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,260 | cpp | TransformPartialComponent.cpp |
#include "pch.h"
#include "TransformPartialComponent.h"
#include "Component/BoxColliderComponent.h"
#include "Entity/Entity.h"
#include "Collision/CollisionManager.h"
TransformPartialComponent::TransformPartialComponent(const glm::vec2& pos, const glm::vec2& scale) :
m_vPosition(pos), m_vScale(scale)
{
}
Transf... |
01b47969c49234484d988fac1ce1dacd1f266993 | 207571a7c6f1e55f1f6a3f5cb5fd7f1da3777cfb | /src/Screen.cpp | 4394760d191ad7a7d60d1712e5bc7684b0f3a80b | [] | no_license | likoms/Graph | a84c0fab9e6599e2d661ed4de68bd12ee67708c7 | d3d588fe74cd6b0c122f5891a26c4f78612c85ed | refs/heads/master | 2021-01-13T02:22:16.532443 | 2015-05-09T09:32:45 | 2015-05-09T09:32:45 | 34,457,392 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,819 | cpp | Screen.cpp | /*
* Screen.cpp
*
* Created on: 23 kwi 2015
* Author: Piotr
*/
#include "Screen.h"
Screen::Screen() {
}
Screen::~Screen() {
}
int Screen::displayFirstScreen(){
int choice=0;
cout<<"_________ ________|"<<endl;
cout<<"1. Tablica |"<<endl;
cout<<... |
514d9c85a02edae8643ab8d741b765d8ea16f1a1 | b1fba55d02d3998d29185383019989d93d6c46a2 | /src/NRRR_rcpp.cpp | 4e9b1b42ff4b03b8e67e457f8f97cb84c16269be | [
"MIT"
] | permissive | xliu-stat/NRRR | ebb0ed1be0cf2304ab851b2aa06de721b765af2f | e51d9df7500b287f8c4daa8839f4cc1782525cef | refs/heads/master | 2023-02-11T02:08:58.543146 | 2021-01-07T03:49:27 | 2021-01-07T03:49:27 | 320,651,801 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 31,558 | cpp | NRRR_rcpp.cpp | // [[Rcpp::depends(RcppArmadillo)]]
#include <RcppArmadillo.h>
#include <cmath>
using namespace Rcpp;
// [[Rcpp::export]]
Rcpp::List pinv_my(arma::mat Bg){
/* the same as ginv() in R*/
arma::mat U;
arma::vec s;
arma::mat V;
bool pinv_success = true;
int p = Bg.n_cols;
int q = Bg.n_rows;
... |
b2148cfd3efd17bdcf9ea9a3710d75a575eee741 | 5e566abb7e3bc36b1acea5a70e63c9f6a8434018 | /Wallet_Francisco_Andrei/Wallet_Francisco_Andrei/Wallet.cpp | 8e6228acbcab0ea18ccc4edb8b7e975870a00047 | [] | no_license | flotazani/Wallet_Francisco_Andrei | 70bc150f8e7c0a9f0a575aa50bd07bf6fcb6e55c | c0a8a49298c9dcfd18aa41cbbf3e1dba3a3a1a79 | refs/heads/master | 2021-01-01T03:53:27.873765 | 2016-04-14T22:47:35 | 2016-04-14T22:47:35 | 56,087,479 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,815 | cpp | Wallet.cpp | #include "Wallet.h"
Wallet::Wallet()
{
//create a new pointer for all of them with default constructor
ptr[0] = new Dollar;
ptr[1] = new Euro;
ptr[2] = new Franc;
ptr[3] = new Hryvnia;
ptr[4] = new Ruble;
} //default
Wallet::Wallet(int Curr, double num)
{
//depending on curr, call specific currency and use do... |
3c45d3ec072a61b9f3b886865fe844e8a17875ae | f3c56465c8db68e23a2c0a3e23d8e2ffe0619319 | /semester2/hw3/task1/swap.cpp | 0489b95415eeae313616cbc455c8dda8cc843459 | [] | no_license | romankurbatov/homework | 3665c4d0ab30ae408934dfe2b015637072da40b0 | 27a8f94f2e8d52f684f1a472598222fb9b806bdb | refs/heads/master | 2021-03-12T20:23:15.268926 | 2013-05-26T16:22:16 | 2013-05-26T16:22:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 108 | cpp | swap.cpp | void swap(int &a, int &b)
{
if (a == b)
return;
a = a ^ b;
b = a ^ b;
a = a ^ b;
}
|
759619171c5f0ad00ed863e41255283d620d406c | c8b39acfd4a857dc15ed3375e0d93e75fa3f1f64 | /Engine/Source/Runtime/ClothingSystemRuntimeInterface/Private/ClothingSimulationFactoryInterface.cpp | 5b5c7989f0d9141ea3b2c5ef7185893db05edfc4 | [
"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 | 225 | cpp | ClothingSimulationFactoryInterface.cpp | // Copyright 1998-2017 Epic Games, Inc. All Rights Reserved.
#include "ClothingSimulationFactoryInterface.h"
const FName IClothingSimulationFactoryClassProvider::FeatureName = TEXT("ClothingSimulationFactoryClassProvider"); |
909deeb32e817d3845614a120cc4074bc034a11b | 658a1264bacaa521c0afaa91c364f995f28359f6 | /tests/test_conversion_binding.cpp | 5e42e629001ac3be29cd1c805bc3aff8b37fc07f | [
"MIT"
] | permissive | bergesenha/shadow | 5986cbf81dbe1496de6e7939563ab3983134c593 | d3bf5f54b541ede898b08fbfd53bc5badbf6420f | refs/heads/master | 2022-12-13T19:16:29.243453 | 2017-11-15T11:19:38 | 2017-11-15T11:19:38 | 92,930,981 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 820 | cpp | test_conversion_binding.cpp | #include "catch.hpp"
#include <string>
#include <reflection_binding.hpp>
struct explicitly_convertible
{
template <class T>
explicit explicitly_convertible(T)
{
}
};
TEST_CASE("test conversion bindings between anys of different types",
"[generic_conversion_bind_point]")
{
auto int_to_... |
e82acf8ad0a5793026b6549b6ace9fdc26c14d48 | 7d90744d6b6ef7ef47bdd18654d60e64b7945aac | /day05/raw_socket.cpp | 769e81a4e715cfb3fc14ecc37bc17930d3ded775 | [] | no_license | OldFire/lxyfcode | 2fcae2b9e85973bb3f9a7d746f772439ed6d00f7 | d3a4835f116a09208d039824f4dbb363294e27e7 | refs/heads/master | 2020-06-27T06:53:55.098188 | 2018-01-22T09:11:29 | 2018-01-22T09:11:29 | 74,536,803 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,721 | cpp | raw_socket.cpp | /* ************************************************************************
* Filename: raw_socket.cpp
* Description:
* Version: 1.0
* Created: 11/04/2016 09:58:54 PM
* Revision: none
* Compiler: gcc
* Author: YOUR NAME (),
* Company:
* *************... |
ebad3b788e1413ffbe5f8dfd37deb9b41231f17a | eadef664ac828051c922ce140f4f9895aa9947ab | /mpi_test/mij2_1_1.cpp | 37355b31cdf42f6eb133dd69269253f4488848cc | [] | no_license | Erikmkrtchyan82/MPI | 9b141fa5619f0b864e0b8fc7add9b3968632bbf7 | a8b83a29e43cd1a750b6465c3b8b2adbe3ccd005 | refs/heads/master | 2023-08-04T06:07:31.841375 | 2021-09-26T08:54:16 | 2021-09-26T08:54:16 | 410,500,264 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 743 | cpp | mij2_1_1.cpp | #include <iostream>
#include "mpi.h"
using namespace std;
int main( int argc, char *argv[] ) {
int rank, size;
MPI_Init( &argc, &argv );
MPI_Comm_rank( MPI_COMM_WORLD, &rank );
MPI_Comm_size( MPI_COMM_WORLD, &size );
int a, position;
double b;
char buf[ 100 ];
if ( rank == 0 ) {
cin >> a >> b;
MPI_Pa... |
87833aba792cb66a4d2cfb5b8dc7b60cef1f6efb | 05a21c24682e62dee5d1f5e27217059cb0bd2ffb | /ChASE-MPI/impl/chase_mpidla_mgpu.hpp | b09bf43374a131e6d319d57519518936a30459e2 | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | ChASE-library/ChASE | efb4c7b78ad5da3be1a65a58b93b61f008a57ac3 | 28934d8fe0a841876eb09d126aa82eb19d9f6096 | refs/heads/master | 2023-08-16T10:03:40.271769 | 2023-08-15T15:31:34 | 2023-08-15T15:31:34 | 349,075,288 | 7 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 37,263 | hpp | chase_mpidla_mgpu.hpp | /* -*- Mode: C++; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
// This file is a part of ChASE.
// Copyright (c) 2015-2023, Simulation and Data Laboratory Quantum Materials,
// Forschungszentrum Juelich GmbH, Germany. All rights reserved.
// License is 3-clause BSD:
// https://github.com/ChASE-library/ChASE
#prag... |
34764d411582e7c02e131497a75f2fca73119be0 | b3c163605f4198451874c28a039670d0e47d3ac4 | /chapter01/question1-3.cpp | 8fe0f5a399671e4160c774da02d640bf69e43e48 | [] | no_license | kuroyam/cracking-the-coding-interview | fdb327e6302cc40833370bbd26baf04fb148c02e | 08cdc6d6055ae7c9c5794be03f095146d2403836 | refs/heads/master | 2021-01-23T20:12:54.300458 | 2013-01-19T03:54:56 | 2013-01-19T03:54:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 898 | cpp | question1-3.cpp | // 1.3 2つの文字列が与えられたとき、片方がもう片方の並び替えになっているかどうかを決定するメソッドを書いてください。
#include <iostream>
#include <string.h>
bool checkStringIsAnagram(const char* str1, const char* str2)
{
int length1 = strlen(str1);
int length2 = strlen(str2);
if (length1 != length2) {
return false;
}
for (int i = 0; i < length1; i... |
432d6e0efcef615b01860bde4b15dc33417a8ba3 | 4371a59ec2a50a1cdd757f602f3579c9b1b6a8da | /Code/v1.ino | b782390ff99ce92604217305979602008f3e257d | [] | no_license | wekeller/Borehole_Logger | 2ae775493bb2f8d420f8011e1149fa367bec9023 | 77dc4a42c39d32a92da407f4e7e07eed0a5980e3 | refs/heads/master | 2021-04-06T20:17:21.260336 | 2018-03-15T19:01:31 | 2018-03-15T19:01:31 | 125,279,332 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,622 | ino | v1.ino | #include <LiquidCrystal.h>
#include <EEPROM.h>
#include <OneWire.h>
#include <DallasTemperature.h>
#include <SoftwareSerial.h>
// --- EEPROM ADDRESS DEFINITIONS
#define LCD_BACKLIGHT_ADDRESS 1 // EEPROM address for backlight setting
#define BAUD_ADDRESS 2 // EEPROM address for Baud rate setting
#define SPLASH_SCREEN... |
1a32eb47ef0f46dcde0b99b30ce183238afdbbd9 | d88851690a7320df90c4a9314e5f9a2be1177376 | /PA6/Background.cpp | d58d805202188ae7054f6ee024825cd4bb7e050a | [] | no_license | GabrielByram/CPT_S-223-Projects | 37002d51fcf676d047d677da5510a14fb1b9e84f | c7b5ee386935599cc83fe540c4ee769115831a6d | refs/heads/main | 2023-02-13T00:16:53.442159 | 2021-01-17T23:43:40 | 2021-01-17T23:43:40 | 330,508,280 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,426 | cpp | Background.cpp | #include "Background.h"
Background::Background(){
if(!font.loadFromFile("CourierPrime-Regular.ttf")) std::cout << "Cannot open font";
if(!textureBackground1.loadFromFile("Pictures/Classroom.jpg")) std::cout << "Cannot open picture"; //Loads the classroom background
background1.setTexture(textureBackgroun... |
4c349b48f40f10f6953e62a2e6d5d5d5c7a0c976 | 1fa0e2c4b7ef9432cd50b2243e1d0cec330a2957 | /MMC25.cpp | 5265c62c7922129e97200ad0fd7d66b1913e44dd | [] | no_license | gw606/ITSA-OOP | 86b006513ec1a317b7f52f15caa9f5ceb0c6be03 | 794500aead01b9b768492869df411ecb7da6b26f | refs/heads/master | 2022-11-16T17:46:49.164345 | 2020-07-06T17:30:04 | 2020-07-06T17:30:04 | 277,600,214 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 309 | cpp | MMC25.cpp | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int a,i=0,num=0;
while(cin>>a){
for(int i=0;i<=a;i++){
if((i%3)==0)
num+=i;
}
//printf("%d\n",num );
cout<<num<<endl;
num=0;
}
return 0;
}
|
dd7d739e02ad018dd2ad5916199b8fda20d8e74b | 74d91f18c37b103dc8d0d5eaa65586eadb1abbd4 | /mysha.h | 561fafbcceb98a17cbe2f2054e8b8c32de8ea88a | [] | no_license | QuentinGouchet/Cryptographic-Calculator | b3b0666248ea4759c615c1e152583340c34c17b0 | 8039989fd1d5b67be461a1d917aa164598ff831c | refs/heads/master | 2021-01-21T12:23:21.843461 | 2014-05-28T12:24:15 | 2014-05-28T12:24:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 722 | h | mysha.h | #ifndef MYSHA_H
#define MYSHA_H
#include <string.h>
#include <stdlib.h>
#include "gmp.h"
#include <openssl/sha.h>
typedef unsigned char u8;
typedef unsigned long long int u16;
class MySha
{
public:
MySha();
int computeSha256(const char *, const char *);
int computeSha512(const char *, const char *);
... |
6973f338d41a321f6fa798216c6f42177f3e3e0c | 776d5e2a3d9414e3ce83644326883a6b69e1b113 | /GG/config/CfgExileCustomCode.hpp | dd1f27babffbfa77ae5a094d0151c6d66ba48974 | [] | no_license | aussie-battler/ExileMod | da02f9e8c7e4a8aa5dd450175d4e7444940c28f3 | 6e91e65eada49a8c8b604e937657605e0af2d8fd | refs/heads/master | 2020-03-10T16:16:16.743021 | 2016-11-10T12:55:10 | 2016-11-10T12:55:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,934 | hpp | CfgExileCustomCode.hpp | class CfgExileCustomCode {
ExileClient_action_hideBody_condition = "GG\custom\ExileClient_action_hideBody_condition.sqf";
ExileClient_construction_handleAbort = "GG\custom\ExileClient_construction_handleAbort.sqf";
ExileClient_construction_thread = "GG\custom\ExileClient_construction_thread.sqf";
ExileClient_gui_es... |
15ed3a3537455c23d9762cf9de49efb3550b8960 | 943c074238dfd09df6da5207e3bd9e3019b0bbe8 | /tests/shapes/testDigitalPlane.cpp | 12ad0a53636fa06ff170fdf73d0d6e074d50115d | [] | no_license | fgrelard/MyDGtalContrib | 452af03d5756477ab9f72abbf9e43a65e8747415 | 6fa32f4453672f411f54c67cfe28a146a2cc4312 | refs/heads/master | 2021-07-05T21:20:39.382846 | 2020-06-03T12:37:49 | 2020-06-03T12:37:49 | 74,741,006 | 1 | 0 | null | 2017-04-24T09:53:25 | 2016-11-25T08:48:25 | C++ | UTF-8 | C++ | false | false | 3,398 | cpp | testDigitalPlane.cpp | #include "shapes/DigitalPlane.h"
#include "DGtal/base/Common.h"
#include "DGtal/io/readers/GenericReader.h"
#include "DGtal/io/writers/GenericWriter.h"
#include "DGtal/kernel/BasicPointFunctors.h"
#include "DGtal/images/ImageSelector.h"
#include "DGtal/images/imagesSetsUtils/SetFromImage.h"
#include "DGtal/io/viewers/V... |
d87d7df6977c5dc90eb033376537ead649ef7a4c | f8c5682201f930a3bd7e102a36c3ee143f937b00 | /include/Frame.h | c9ab0b7072c1872bded317569c4ed3c7ef47e522 | [] | no_license | Roger-Chuh/EdgeDirectVO | c0cfb8b3544846addc831be0413ac4787954e308 | 5ff42dd402ed45b0dffddac5724d2822126c6603 | refs/heads/master | 2022-02-17T11:57:43.990356 | 2019-07-13T17:22:24 | 2019-07-13T17:22:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,884 | h | Frame.h | #ifndef FRAME_H
#define FRAME_H
#include <opencv2/core/core.hpp>
#include <Eigen/Core>
#include <Eigen/Dense>
#include <string>
#include "Settings.h"
#include <opencv2/ximgproc.hpp>
//TODO make image pyramids, (Canny) edge pyramids, depth pyramids
//TODO make derivative pyramids
namespace EdgeVO{
class Sequence;... |
52e005a1290f94ffcb290f1209d51e7c9b4ef7e9 | 0966b4619a2df70b3e0964af07bb5a724beee608 | /source/http/http_response.hpp | 4c5b4d46efb9481cccc5805038b40699c4cfcc3e | [] | no_license | puchninanastya/technopark-web-server | bc7bc9c92439773a9fab0ab5220075058642f216 | c1947c3a7590eadfb4cf8ed35244c8812326a187 | refs/heads/master | 2020-03-27T23:09:21.256056 | 2018-11-19T16:14:38 | 2018-11-19T16:14:38 | 147,295,908 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,000 | hpp | http_response.hpp | #ifndef MONZZA_HTTP_RESPONSE_HPP
#define MONZZA_HTTP_RESPONSE_HPP
#include <string>
#include <vector>
#include "http_helpers.hpp"
#include "http_request.hpp"
namespace monzza {
namespace http {
class HttpResponse {
public:
HttpResponse();
~HttpResponse();
int... |
7182cccc4970c304bd8338cb45ee252730c340f8 | b4f901dfe93a541214d967a389f93f83a5f21eec | /DefinesClearer/DefinesClearer.cpp | dd8cb487814bdb9218f8bb8e2d1ff54c30f91609 | [] | no_license | tntultra/DefinesClearer | 4dc4c64e29f711504f334ab0e244be62b138ccc9 | cc42342babf8af23f52b8e8a09759cbe7f0e2297 | refs/heads/master | 2021-07-07T16:35:07.514665 | 2017-09-26T14:57:37 | 2017-09-26T14:57:37 | 104,764,484 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,069 | cpp | DefinesClearer.cpp | // DefinesClearer.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <unordered_map>
#include <boost/filesystem.hpp>
#include <boost/algorithm/string/find.hpp>
#include <boost/algorithm/string/erase.hpp>
#inc... |
8e414a17512df3a1f7cdf2ee5044df8c5d1f59bc | ba3e3936938d4b2a33c9315f0ade7f6ffcae453d | /Kernel/Stump.h | 0024ded3131ab3c7d124ca74b51d819df531fa3a | [] | no_license | quipo/LibSVM-- | 7c1e2967a571c6df072c3568eee0aad047dd4bf4 | 03f763b153bce0a5058943537225b6206f1e3b8d | refs/heads/master | 2021-01-04T14:21:32.765558 | 2010-08-30T21:40:59 | 2010-08-30T21:40:59 | 872,517 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 604 | h | Stump.h | /*
* File: Stump.h
* Author: Lorenzo Alberton
*
* Created on July 4, 2010, 4:54 PM
*/
#ifndef SVM_KERNEL_STUMP_H
#define SVM_KERNEL_STUMP_H
#include "../SVM_Kernel.h"
class SVM_Kernel_Stump : public SVM_Kernel {
public:
SVM_Kernel_Stump(const SVM_Parameter & param) : SVM_Kernel(param) {};
SVM_Kernel_Stump(... |
b020292b1e2867e7727e3cf4ef2d74b20bc691f5 | 5e5aa48ccc669a16df83a73b179167b8a0945c8a | /libs/Utility.cpp | 8ef3bafb0f9d4840188faba4e4e52750ca2ee8aa | [] | no_license | hoangtrongtin/qlnv_30thang12 | 6072fda6088cf659cdc8dba52e052fc6421085e0 | 9e33782cfc61101b118a644eabf87fe993290978 | refs/heads/main | 2023-02-09T07:00:56.218073 | 2020-12-31T02:15:56 | 2020-12-31T02:15:56 | 325,522,666 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 799 | cpp | Utility.cpp | #include "Utility.h"
string Utility::SDecode(string s)
{
for(int i = 0; i < s.size(); i ++)
if (s[i] == '$')
s[i] = ' ';
return s;
}
string Utility::SEncode(string s)
{
for(int i = 0; i < s.size(); i ++)
if (s[i] == ' ')
s[i] = '$';
return s;
}
string Utility::To... |
52583734a5a151bd5f349bd23108a2ffb1d1ab2a | 6ec5dbb7837c9e73708fdbdd415d74263e785881 | /433BaseballMainServer/433BaseballMainServer/GlobalManager.cpp | b0154c4ed66231192c861eb4dfc58e7b85704700 | [] | no_license | 433intern/433Baseball | e678fcbddc5b733029af1a3fd03c7c91807ce479 | 3d6ed384cdf8f488721a4d51fa804df6eb737737 | refs/heads/master | 2021-01-11T07:37:38.650726 | 2015-12-16T22:45:04 | 2015-12-16T22:45:04 | 46,963,522 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,129 | cpp | GlobalManager.cpp | #include "stdafx.h"
CGlobalManager::CGlobalManager()
{
}
CGlobalManager::~CGlobalManager()
{
}
CGlobalManager &CGlobalManager::GetInstance()
{
static CGlobalManager globalManager;
return globalManager;
}
bool CGlobalManager::Initializer(const std::string &dbServerIp, const unsigned short dbPort, const std::string... |
a82b19872323fb58085876879cdd14cf18f3852d | 146a0bf67b99448b8a9f14ac77710fed2c64728e | /include/moonlight/generator.h | c49cb549956db12ef46ff5347a433074099a59a0 | [
"MIT",
"BSL-1.0",
"LicenseRef-scancode-unknown-license-reference",
"Zlib"
] | permissive | lainproliant/moonlight | 552c27c5c4869508f5f7988a32e2810758085121 | 78ec2b99318636841af478d07f48c7481665c44a | refs/heads/main | 2023-07-06T15:17:07.113556 | 2023-06-29T01:21:50 | 2023-06-29T01:21:50 | 159,224,136 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 23,071 | h | generator.h | /*
* generator.h
*
* Author: Lain Musgrove (lain.proliant@gmail.com)
* Date: Tuesday May 26, 2020
*
* Distributed under terms of the MIT license.
*/
#ifndef __MOONLIGHT_GENERATOR_H
#define __MOONLIGHT_GENERATOR_H
#include <deque>
#include <mutex>
#include <condition_variable>
#include <future>
#include <option... |
def8d289016b44b847211ccc68264e11660747ae | 7c971e471772c53b848b62c9407dd0bf3625c4a3 | /acm/2587/2587.cpp | 534d8c8c97b0b2b92e818cd26bb60465ec5bbb2f | [] | no_license | kimmikimmi/Algopool | bdc40c3af90f8f453adbdd673d2c91f1af325ad3 | cc88ec7bc8fac701309034f171a9b52408b532c2 | refs/heads/master | 2020-04-15T14:28:50.802255 | 2016-09-11T12:50:51 | 2016-09-11T12:50:51 | 52,717,356 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 557 | cpp | 2587.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <list>
#include <map>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stack>
#include <tuple>
#include <set>
using namespace std;
vector<int> my_vec(5);
void input(std::istream& pin) {
for(int i=0; i<5; i++) {
int tmp;
pin >> tmp... |
a7b68878937ea6522146a887daba717e3fe60493 | 1faa2601f5c5d05a8dfa851c06a0fc07317386e5 | /test/unittests/t_polymorphic_construction.cc | 762811eaa705d1cf257d626252c332fe92b8f397 | [] | permissive | cvmfs/cvmfs | 216aecc8921ac7fcd5cec5a8baf37870cdc42d0f | bb69086badd32d8f9566ed5dcedff1fd1b0ccc5e | refs/heads/devel | 2023-08-24T09:17:29.248662 | 2023-08-15T09:08:27 | 2023-08-15T09:08:27 | 3,784,908 | 231 | 118 | BSD-3-Clause | 2023-09-13T10:50:09 | 2012-03-21T09:10:41 | C++ | UTF-8 | C++ | false | false | 14,339 | cc | t_polymorphic_construction.cc | /**
* This file is part of the CernVM File System.
*/
#include <gtest/gtest.h>
#include <cstdlib>
#include <string>
#include "testutil.h"
#include "util/plugin.h"
#include "util/prng.h"
struct DecisionType {
DecisionType() : type(-1), fail(false) {}
int type;
bool fail;
};
struct IntrospectionType {
I... |
d4e5978073ffdeb421ece396549a1010ac4dd266 | de59ed7818fe43cb85a52e88cf2524637775c465 | /김혜준/백준 & 프로그래머스 문제/10월/1012/(20056번) 마법사 상어와 파이어볼.cpp | 28dce9bc343e6935d8f7a3be91b9dd5996bc24e2 | [] | no_license | Kim-Hye-Jun/Algorithm-1 | 2ffe00fa5213cc98961cfdc5c354d5282cf594aa | 99f0973ec1288e8c40ea56d12121f5d73283bc17 | refs/heads/main | 2023-09-04T16:53:46.243635 | 2021-10-16T02:06:15 | 2021-10-16T02:06:15 | 398,989,785 | 0 | 0 | null | 2021-08-23T05:59:00 | 2021-08-23T05:58:59 | null | UTF-8 | C++ | false | false | 2,048 | cpp | (20056번) 마법사 상어와 파이어볼.cpp | #include <iostream>
#include <vector>
using namespace std;
int N,M,K;
int dx[8]={-1,-1,0,1,1,1,0,-1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
int num=0;
typedef struct fireBall{
int x;
int y;
int m;
int dir;
int speed;
bool live=true;
}FB;
vector<FB> arr[50][50];
vector<FB> fbV;
void input(){
cin >> N >> M >>... |
9beae88e6e6e9feaeaf262ff6ceabf7d5353504d | 175d783916d1c08e8eb05a964e85dc9f1ee689f7 | /PointCloud/extracterType.h | 0b2d746b1ce4c1e3d1c38ec56ec337d6849894fd | [] | no_license | Armida220/pointCloud | cfc146530690076591f7ea8bc615a4da56ffd7d1 | 9a6d4c277f7631ba75f4ae25f60ef2726f430312 | refs/heads/master | 2020-05-03T02:02:21.389697 | 2019-03-29T03:44:35 | 2019-03-29T03:44:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 392 | h | extracterType.h | #pragma once
#include <string>
namespace feature
{
enum ExtracterType
{
SIFT = 1,
SURF
};
/**
* @brief this function convert feature::ExtracterType to string
*/
std::string extracterTypeToString(ExtracterType extracterType);
/**
* @brief this function convert feature::ExtracterType to string
*/
... |
402a6969dc10decd3c2e10ad89ca7e645dc2d945 | 4973f3efd66cc7d29c5a69ab055ff14aff046afb | /src/phlib/pointer_iterator.hpp | bc93e81fab7270cbf09e831b6f3e216a4985fb24 | [
"BSD-2-Clause"
] | permissive | andrey-nakin/phlib | b467d09d64015b7637c90fd879503e49f5335434 | f3a23bd1ce39e3873c4289d26f626de2010415ae | refs/heads/master | 2021-01-20T12:20:36.770354 | 2015-12-03T17:26:29 | 2015-12-03T17:26:29 | 4,891,546 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,514 | hpp | pointer_iterator.hpp | /*
* pointer_iterator.hpp --
*
* This file is part of phlib library.
*
* Copyright (c) 2012 Andrey V. Nakin <andrey.nakin@gmail.com>
* All rights reserved.
*
* See the file "COPYING" for information on usage and redistribution
* of this file, and for a DISCLAIMER OF ALL WARRANTIES.
*
*/
#ifndef... |
239844fcf10cb64f53620f61c3a039b8d0a8a242 | 6c395b91b034eb3bf28a17f4e475e2b08f2489ef | /src/Tmapping/src/global.cpp | 0279208f44e6c05a0bbd4540b48f7aeb1b014967 | [
"MIT"
] | permissive | Forrest-Z/gcy_tmap | 4f69ef0116bbd76cffdca5f0bd6abe6d7ef41470 | 33661661ac27be3480146b46dca0d33d09bb9b96 | refs/heads/master | 2023-04-19T10:13:54.851806 | 2021-05-09T04:48:09 | 2021-05-09T04:48:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 35 | cpp | global.cpp | #include "global.h"
int id_num=-1;
|
9de0eae12b439f66b63b1b68f17efb920675f616 | 5e58e144abd98dd720e5bad1419ffbd5a201b90b | /Core/Src/disk.cpp | 74913f3b1e2c0b8488c600f80b40966ffe6b9070 | [] | no_license | DaveRichmond/stm32h743-usbmsc | db8e7aaddcd6c788e3cf62b9e02912336039ffa9 | 491c869a439595774f3cb13f2c409f47bc085120 | refs/heads/main | 2023-03-29T10:36:18.954058 | 2021-04-07T11:03:26 | 2021-04-07T11:03:26 | 355,512,873 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 675 | cpp | disk.cpp | /*
* disk.cpp
*
* Created on: Apr 7, 2021
* Author: msn
*/
#include "disk.h"
#include <stdio.h>
#include "fatfs.h"
bool usbd_disk_init(){
printf("USBD Disk Init\n");
if (BSP_SD_IsDetected() != SD_PRESENT){
printf("USBD Disk Missing!\n");
return 0;
}
if(f_mount(&SDFatFS, (const TCHAR *)&SDPath, 0) ... |
915d1f4b12e5be40449636f9e628617688d33aa8 | 16a804ac3b3f4e67ad7cb90c453dfb194af4dae5 | /Source/HeliumRainLoadingScreen/FlareLoadingScreen.cpp | 4b7b8c230baa6e108e156ffeeb7e7176b2f44856 | [
"BSD-3-Clause"
] | permissive | s-ariga/HeliumRain | d8f87c6bdf37dd35f2f4811f900caac9a6cd7139 | fdca65f1e564477d5a84e3362317b6905ca860e4 | refs/heads/master | 2020-04-18T10:19:02.428114 | 2019-01-14T22:43:16 | 2019-01-14T22:43:16 | 167,463,864 | 2 | 0 | BSD-3-Clause | 2019-01-25T01:20:39 | 2019-01-25T01:20:39 | null | UTF-8 | C++ | false | false | 3,362 | cpp | FlareLoadingScreen.cpp |
#include "FlareLoadingScreen.h"
#include "SlateBasics.h"
#include "SlateExtras.h"
#include "MoviePlayer.h"
#include "SThrobber.h"
#define LOCTEXT_NAMESPACE "FlareLoadingScreen"
/*----------------------------------------------------
Dynamic brush
----------------------------------------------------*/
struct FFlar... |
005a4875689da7c22a952b823acbdc04e3841716 | 1182d217b410585654ab629b90b8f43c09a8766d | /libraries/Mitov/Mitov_WiFiShield.h | f7d2fe893998bcfd6f72a787166eca01a45f37cf | [] | no_license | alorimer/arduino-weather | 4673499de208195aeb8dc2b104556967b9de227c | 97a3ba010df7f5581a02291f0cc94644893cf858 | refs/heads/master | 2021-01-15T14:02:09.470839 | 2016-05-29T07:14:43 | 2016-05-29T07:14:43 | 55,577,926 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,088 | h | Mitov_WiFiShield.h | ////////////////////////////////////////////////////////////////////////////////
// //
// This software is supplied under the terms of a license agreement or //
// nondisclosure agreement with Mitov Software and may not be copied ... |
45d24d19544a248a1d66cf171c590b29353a324d | 8289fb4b9f2242a2f0a1b92b391058f421788682 | /Ros/Phase2/B2lly_Ws/build/turtlesim/rosidl_typesupport_opensplice_cpp/turtlesim/srv/dds_opensplice/SetPen_Dcps_impl.cpp | 4b5774beaa99aa0d05a149c54081ccd2b1d47de0 | [] | no_license | BawornsakS/XPrize | 5fedf7c7f0838b1da5c0749ef846ed7b2135356d | e6e900c6c63f0cef5cb3717a5b6724ec9ae00b69 | refs/heads/master | 2021-07-20T06:28:09.666385 | 2020-09-04T06:39:13 | 2020-09-04T06:39:13 | 211,299,370 | 3 | 3 | null | 2019-11-13T08:07:18 | 2019-09-27T10:56:38 | Makefile | UTF-8 | C++ | false | false | 133,371 | cpp | SetPen_Dcps_impl.cpp | #include "SetPen_Dcps_impl.h"
#include "SetPen_SplDcps.h"
//
extern v_copyin_result
__turtlesim_srv_dds__SetPen_Request___copyIn (
c_base base,
const struct turtlesim::srv::dds_::SetPen_Request_ *from,
struct _turtlesim_srv_dds__SetPen_Request_ *to);
extern void
__turtlesim_srv_dds__SetPen_Request___copyO... |
7867aadd8255e6f5d542ce544898f7719b29d793 | 276353b28b188d44ad00fbe330e37912862995a6 | /src/utils/memlog.cc | 151c8bc489b8f69a8d2796978a28fb6fb29ea4dd | [] | no_license | septicmk/RING | 4b72c02941f8e1280df5526e8b35e8b9b0c7126a | fcb8e9f2d55caeaa4b1ae35ac788a48c4e323ffc | refs/heads/master | 2020-12-03T02:26:15.996846 | 2017-07-01T03:04:19 | 2017-07-01T03:04:19 | 95,938,414 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,536 | cc | memlog.cc | /* memlog.cc
*
* Copyright (c) 2016 Institute of Computing Technology.
* All rights reserved.
*
* Author: Ke Meng <mengke@ncic.ac.cn>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributio... |
db37490e01c5bd295dcaecf9a7fa4ea09f91e027 | b115fdbac9e80d46de97fd2bda09ecb7a2541b82 | /neo/idlib/containers/ListSTL.h | b68c9d9e68975890c91d9ec71a1877d4761e6ffa | [] | no_license | jmarshall23/Doom3 | 2cb78fe81624bce2b7c68af8bcf437973331621f | f12b34e6fbca8a49dc751f71960e1b609ed8d9cd | refs/heads/master | 2023-05-25T14:30:49.193713 | 2023-05-18T19:33:27 | 2023-05-18T19:33:27 | 360,633,347 | 6 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 20,067 | h | ListSTL.h | /*
===========================================================================
Doom 3 GPL Source Code
Copyright (C) 1999-2011 id Software LLC, a ZeniMax Media company.
This file is part of the Doom 3 GPL Source Code (?Doom 3 Source Code?).
Doom 3 Source Code is free software: you can redistribute it and/or modify
it... |
9f4fc426e5c2e41a4ae09e87210947945a078e9b | d2357e5ff603771df5dcb6db1f5f7bd5324d902d | /Colour.cpp | 3fff968d3e222a637b323684230e33bb6704aba5 | [
"BSD-3-Clause"
] | permissive | janLo/htw-computer-graphics-radiosity | 4893489ad3475f09d344a12db04925f01d63a022 | fb0589e8beb3af8c63c21f6eed855c3d82c2b8fd | refs/heads/master | 2016-09-06T12:38:25.342540 | 2014-08-24T23:39:36 | 2014-08-24T23:39:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 44 | cpp | Colour.cpp | #include "Colour.hpp"
namespace radio {
}
|
449765464074eeeafd89962fc96c9b4d82599b1c | 44d4400b658c4184e81fa3d2f11a60ab15d74b0d | /examples/hookup_guide/hookup_guide.ino | 5460fed704c38615a2836cf06b710721b880e294 | [] | no_license | jpk73/CharacterDOGM | bd4de4fe56f68d1e96d004cfa5c270d1ddadb036 | 7543ec705b6f91664c91a27f879b12af0d287c82 | refs/heads/master | 2022-12-30T23:28:07.259141 | 2020-10-13T20:33:20 | 2020-10-13T20:33:20 | 266,580,423 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,165 | ino | hookup_guide.ino | #include <CharacterDOGM.h>
/*
DOGM204 pin connections:
the bottom row of pins has 3 pins left and 3 pins right, these are pins 1-3 and 20-22:
01 +LED (for limiting resistors see data sheet)
02 +LED
03 +LED
20 -LED -> GND (solder all 6 top row pins also from above to the LED panel!)
21 -LED -> GND
22 -LED -> GND
... |
a9508db8cf1abeeb788c57b2b47c9fd2320da55c | 83e81885d8de443c8453c2eaa1ef7e93e6bac69c | /src/wspc/type_description.hpp | ec95917401ad5a0c1af0fb31c5b332ffe28e41b5 | [
"MIT"
] | permissive | k0zmo/wspc | 769048450597603c5db708de26da4fbaec1cbd8a | b489e63768ec1b76c03f70101f80e35713cb2f6b | refs/heads/master | 2020-12-25T15:17:44.005645 | 2017-04-09T13:24:20 | 2017-04-09T13:28:52 | 66,496,697 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,329 | hpp | type_description.hpp | /*
* Copyright (c) 2016 Kajetan Swierk
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge,... |
75502ae06b995a1ebc22133f485e105302c5f4a0 | 185aac857712226f43f732afa1788dc112555280 | /srcs/utils/ft_utils.hpp | be350b4c9f484e35d2826093b2b72ca1a18beefb | [] | no_license | ServaneC/ft_containers | 31318986925c0050cc7ba1a9799fc928492ca6e8 | df229ed31ccbb0be571163eb46a7f6306f13b61e | refs/heads/main | 2023-03-08T23:46:13.021526 | 2021-02-25T08:23:41 | 2021-02-25T08:23:41 | 326,990,211 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,149 | hpp | ft_utils.hpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_utils.hpp :+: :+: :+: ... |
6e5048108688ec4943fa815204015835f2b560f6 | 4e721661263269d080fe4c5d19a633348282276f | /avahi.cpp | 6ddeef8e75eca2278b581136e21861da31d215ab | [] | no_license | straccio/bonway | 862221a1fb588585bdf734131b8ee4fb6131cb17 | a77d3fb361a1713b257055ac47405764f250ccdb | refs/heads/master | 2021-01-18T14:31:20.210754 | 2013-06-22T23:02:02 | 2013-06-22T23:02:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,185 | cpp | avahi.cpp | #include <stdio.h>
#include <stdexcept>
#include <iostream>
#include <time.h>
#include <avahi-client/client.h>
#include <avahi-client/publish.h>
#include "avahi.h"
#include "browser.h"
#include "resolver.h"
#include "service.h"
#include "entrygroup.h"
namespace Avahi {
Avahi::Avahi()
{
this->browsers = std::list... |
7a987d8a2f03fdffd8318fd516764dc03216fa69 | 8acaf1aa24404b86d77cf60761b111404b09cc8e | /variadic-templates/tests.cpp | 0819155db383e4857ed4cb94408b87eada28423d | [] | no_license | infotraining/cpp-modern-2020-10-14 | 53312b2fdce2cc4cf55891b439944fe2a9ef074c | 6e15376fe78c0ecf091aa15b9273d97b8bedeee3 | refs/heads/main | 2023-01-01T21:53:34.757983 | 2020-10-16T14:36:16 | 2020-10-16T14:36:16 | 303,329,899 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 966 | cpp | tests.cpp | #include "catch.hpp"
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using namespace Catch::Matchers;
void print()
{
std::cout << "\n";
}
template <typename Head, typename... Tail>
void print(const Head& head, const Tail&... tail)
{
std::cout << head << " ";
print(tail...);
}... |
ddff74bf6534db6fa4ef783d3531c7b219b7958e | bf007dec921b84d205bffd2527e376bb60424f4c | /Codeforces_Submissions/489C.cpp | 233ba118f31c9366c84a07eb0739b26920522a30 | [] | no_license | Suvrojyoti/APS-2020 | 257e4a94f52f5fe8adcac1ba4038cc66e81d9d26 | d4de0ef098e7ce9bb40036ef55616fa1f159f7a5 | refs/heads/master | 2020-12-21T19:27:59.955338 | 2020-04-22T13:27:49 | 2020-04-22T13:27:49 | 236,534,218 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,898 | cpp | 489C.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long int m,s,n,i,t,m1;
vector <long long int> v,v1;
cin>>m>>s;
t=s;
m1=m;
if(m==1 && s<10)
cout<<s<<" "<<s;
else if(s>9*m||s==0)
cout<<"-1 -1";
/*else if(s<m)
{
while(m--)
{
if... |
a1b3ebb1733b23e7ff37f92ab497f69af11ac474 | f21ebd3fa1298a425e31d01f9dade2e500bb9aed | /lua-binding/lua_cocos2dx_mapstringbuffer_auto.cpp | f4ec2eb33f5a936bb0fbcce3d02e94cac63ecc13 | [] | no_license | gdsgtcz/mlua | 6ef0cc1374add27c4abb87c111d5cc0f5970ddfa | ae95055afd57bc52f622bb0b3d834d12b82cb335 | refs/heads/master | 2021-01-10T11:20:14.625820 | 2016-01-08T07:23:25 | 2016-01-08T07:23:25 | 49,127,486 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 13,073 | cpp | lua_cocos2dx_mapstringbuffer_auto.cpp | #include "lua_cocos2dx_mapstringbuffer_auto.hpp"
#include "MapStringBuffer.h"
#include "tolua_fix.h"
#include "LuaBasicConversions.h"
int lua_cocos2dx_mapstringbuffer_MapStringBuffer_insert(lua_State* tolua_S)
{
int argc = 0;
MapStringBuffer* cobj = nullptr;
bool ok = true;
#if COCOS2D_DEBUG >= 1
t... |
9290a3feb16b0af15579d7f74c1c798af42e7223 | 51fd68fc0d7ebadadeb568950920621b58058af3 | /C++/code/373.cpp | 540151f61228eef5ab7c5bbdab5ec11938111fa4 | [] | no_license | leafeonia/leetcode | 7b0eded595ed7bf349472ea26fa1128c28ee3767 | f6c0348d694a11011a0544027a720645a5577bad | refs/heads/master | 2021-12-07T00:32:13.517169 | 2021-10-25T07:46:29 | 2021-10-25T07:46:29 | 194,399,032 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 843 | cpp | 373.cpp | class Solution {
public:
vector<vector<int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
vector<vector<int>> ans;
int m = nums1.size(), n = nums2.size();
typedef pair<int, int> pi;
auto compare = [&nums1, &nums2](pi a, pi b) {return nums1[a.first] + nums2[a.second... |
bc6d4c79d1edca94a7ff27b6a6136747952a8777 | c9f48a3440bd6db4159eb32a6f29f463221e3248 | /hashtable/Longest_subarray_ sum_divisible _k.cpp | 49f6a138f7e2bfd1fcd33645379cdd9e8f39e53c | [] | no_license | llucifer97/Algorithms-Datastructure | 0870bfa3e84907325f565c2104d5cfce8fe71126 | 72fd4f4ce652680b7bf7171876921aa1ca209e41 | refs/heads/master | 2023-09-02T10:18:14.961478 | 2021-11-06T16:27:02 | 2021-11-06T16:27:02 | 231,233,422 | 10 | 13 | null | 2020-10-06T03:35:25 | 2020-01-01T15:38:19 | C++ | UTF-8 | C++ | false | false | 1,369 | cpp | Longest_subarray_ sum_divisible _k.cpp | // C++ implementation to find the longest subarray
// with sum divisible by k
#include <bits/stdc++.h>
using namespace std;
int longSubarrWthSumDivByK(int arr[],
int n, int k)
{
// unodered map 'um' implemented as
// hash table
unordered_map<int, int> um;
// 'mod_arr[i]' stores (sum[0..i] % k) ... |
b0e88ccd3bf5363e325eefe641c279adde880c62 | c095a028e5f5aa406658e3039d8fad7ed3011177 | /WaveSynthFramework/Utility.hpp | 6d97f86582e6f22d664d58708d1eabbe03c39806 | [
"MIT"
] | permissive | EricGeorge/AUInstrument | a5fef5bb8316bcf68d67f89880944133436a8daf | da684aa6fe4cee3119317054df1dbab503358c9c | refs/heads/master | 2022-03-12T17:23:47.795230 | 2017-12-29T18:20:05 | 2017-12-29T18:20:05 | 57,463,606 | 31 | 3 | MIT | 2022-03-03T01:52:11 | 2016-04-30T21:59:33 | Objective-C | UTF-8 | C++ | false | false | 289 | hpp | Utility.hpp | //
// Utility.hpp
// AUInstrument
//
// Created by Eric on 4/30/16.
// Copyright © 2016 Eric George. All rights reserved.
//
#ifndef Utility_h
#define Utility_h
static inline double noteToHz(int noteNumber)
{
return 440. * exp2((noteNumber - 69)/12.);
}
#endif /* Utility_h */
|
9b976ea248a68229779560414dd34b98ef4aa4aa | bd66a2e27dea9f096cee03e10bc9c75cb1bba04f | /src/ops/relu.hpp | 3b696b83362243bda322572366132d7c0d31bdb1 | [
"MIT"
] | permissive | fmitch/LPLANN | f7ba312ccb968b650f53b7a3efa17f6484910e92 | c526113e583058c3b9f4ea5ef5ccc7d5a9d658d3 | refs/heads/master | 2021-10-08T13:10:20.402197 | 2018-12-12T16:26:06 | 2018-12-12T16:26:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 992 | hpp | relu.hpp | #ifndef RELU_HPP
#define RELU_HPP
#include <vector>
#include <algorithm>
template <typename T>
void relu(Matrix<T> * input, Matrix<T>* output){
int size = 1;
for( int i = 0; i < input->dims.size(); i++){
size *= input->dims[i];
}
for(int i = 0; i < size; i++){
output->arr[i] = std::max... |
3931b375ef5e48c28c0719840dc5637032433c95 | f7cdc5f5064280adf71af9a81088a51fcbe7ec43 | /TriangleTest.cpp | 061cc452af4cc66c45faec0ff5a7569d650252c1 | [] | no_license | marston2yu/leetcode | e2321d70744a11875563c942091a65d7abbff6ee | 7e25faee8ebc0d4556e30dcb0a21ab54e45e1eaa | refs/heads/master | 2020-04-23T07:43:31.186280 | 2020-02-16T07:19:35 | 2020-02-16T07:19:35 | 171,013,987 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 379 | cpp | TriangleTest.cpp | #define CATCH_CONFIG_MAIN
#include <catch2/catch.hpp>
#include "Triangle.h"
TEST_CASE("Test Triangle") {
vector<vector<int>> v{{2},
{3, 4},
{6, 5, 7},
{4, 1, 8, 3}};
vector<vector<int>> v2{{-1},
{-2, -3}};
REQUIRE(m... |
f382ddd6bb3377eb01d8e0cfe20e6737ebef097b | c11da72ede8450aad6767eb5d9d6b00cace13042 | /ViroRenderer/VROTexture.cpp | f021999379b2851f9cb771364146fbfee166702b | [
"MIT"
] | permissive | mendix/virocore | 192d1e79f5b5d36d920a4608939843c3e808c2d4 | fd3cf5ac4222bb48a5b3af984f0c428ea316d762 | refs/heads/master | 2023-02-17T17:25:58.449812 | 2021-01-06T17:23:28 | 2021-01-06T17:23:28 | 258,201,318 | 1 | 2 | MIT | 2021-01-06T17:28:07 | 2020-04-23T12:54:36 | C++ | UTF-8 | C++ | false | false | 11,290 | cpp | VROTexture.cpp | //
// VROTexture.cpp
// ViroRenderer
//
// Created by Raj Advani on 11/17/15.
// Copyright © 2015 Viro Media. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software... |
789e548980ff0503c3d9d25304dca484fd693a40 | 0fee103f9ed82978144d9741e46882c7df9eedb1 | /Gym/gym-102538/E.cpp | 82659083ee219176758b69b0ec778fc54483a3f9 | [] | no_license | Flying2019/testgit | 2776b6bc3a5839a005726ff108fb69d971065871 | 86a42bb1d4bfd65b5471373f03162270013da2af | refs/heads/main | 2023-07-15T00:57:55.321869 | 2021-08-21T01:16:53 | 2021-08-21T01:16:53 | 302,891,112 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 908 | cpp | E.cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#define S(l,r) (a[(r)]^a[(l)])
using namespace std;
const int N=1000010,M=20;
int a[N],f[N][M],_k[M],_2[M];
int main()
{
int n;
scanf("%d",&n);
for(int i=1,x;i<=n;i++) scanf("%d",&x),a[x]^=1;
for(int i=n;~i;i--) a[i]^=a[i+1];
_k[0]=(1<<M)-1;_2[0]... |
7ce948521530ff473236125e808080c2fa0fb50e | 63b780d4f90e6c7c051d516bf380f596809161a1 | /FreeEarthSDK/src/FeUtils/TimeUtil.cpp | 3c490b8c84788dfa63b1fb7791ac79b417802a43 | [] | no_license | hewuhun/OSG | 44f4a0665b4a20756303be21e71f0e026e384486 | cfea9a84711ed29c0ca0d0bfec633ec41d8b8cec | refs/heads/master | 2022-09-05T00:44:54.244525 | 2020-05-26T14:44:03 | 2020-05-26T14:44:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,802 | cpp | TimeUtil.cpp | #include <sstream>
#include <TimeUtil.h>
namespace FeUtil
{
void GetLocalTimeYMDHMS( int& nYear, int& nMonth, int& nDay, int& nHours, int& nMinute, int& nSecond )
{
time_t sysTime;
time(&sysTime);
tm* pLocalTime = localtime(&sysTime);
if(pLocalTime)
{
nYear... |
db4398d2341795c089d32d7631d08366ea966408 | 36ad63674e2623b9c4fa8b2b4c167557177ac411 | /Headers/GroupClass.h | 451057bd293df5b86ca41c914c7ded6b3da8e653 | [] | no_license | Gregory06/TimeTableGenerator | 791d01619fd0a852e981f98d15cb9952d52c0e7e | d285a97fae463795509b8669129be1a1ac2f4e8c | refs/heads/master | 2020-05-19T06:57:29.169974 | 2019-05-22T19:41:46 | 2019-05-22T19:41:46 | 184,886,771 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,066 | h | GroupClass.h | //
// Created by Gregory Postnikov on 2019-04-24.
//
#ifndef TIMETABLE_GROUPCLASS_H
#define TIMETABLE_GROUPCLASS_H
#include <fstream>
#include "EventClass.h"
#include "Constants.h"
#include "ScheduleClass.h"
// ##################
// new class
// ##################
class Group {
std::string name;
size_t stud... |
43b9575233a35732aaf242f35fca3a14fe4fcace | 32e43c3cce09f4659035644e70a4e2e88b021c15 | /aoj/grl/apsp.cpp | 770748cc647d354cb4114429dfaed44c947df491 | [] | no_license | sp4ghet/comp | 22c7453bcd4aff56970f3ee465e0c66ca0ab697f | 222911d45ab513c88d5450919d8c803cb0f7da1c | refs/heads/master | 2020-12-04T15:59:34.368399 | 2020-09-19T15:00:31 | 2020-09-19T15:00:31 | 231,827,088 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,766 | cpp | apsp.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Debug
template <typename T>
void view(const std::vector<T> &v)
{
for (const auto &e : v)
{
std::cout << e << " ";
}
std::cout << std::endl;
... |
2f45ec61b7d7d5ae7acad065370a3675d7b87964 | 48298469e7d828ab1aa54a419701c23afeeadce1 | /Login/Packets/CLAskCharListHandler.cpp | d7410d50e92a5ccd5ded526b29ac13cce1c8fc49 | [] | no_license | brock7/TianLong | c39fccb3fd2aa0ad42c9c4183d67a843ab2ce9c2 | 8142f9ccb118e76a5cd0a8b168bcf25e58e0be8b | refs/heads/master | 2021-01-10T14:19:19.850859 | 2016-02-20T13:58:55 | 2016-02-20T13:58:55 | 52,155,393 | 5 | 3 | null | null | null | null | GB18030 | C++ | false | false | 4,885 | cpp | CLAskCharListHandler.cpp | #include "stdafx.h"
#include "CLAskCharList.h"
#include "LoginPlayer.h"
#include "ProcessPlayerManager.h"
#include "DBLogicManager.h"
#include "TimeManager.h"
#include "LCRetCharList.h"
#include "DBCharList.h"
#include "PacketFactoryManager.h"
#include "ProcessManager.h"
#include "Log.h"
#include "DBThreadManager.h"
... |
8d69e46f3cfbc99470776724fd506a86f19b3546 | 881b7a5a479cfced664277127e4e064463504bd1 | /base_nomes.cpp | 2517b4a10e76fdb2841c14463dfbc50af0f412f5 | [] | no_license | noc1243/TMAB_4 | 1470fc42c74a9dfdc8ff7359ea8eecef4886232a | fbb5538cb774a32353a08fb6a7a7900b1917c0c2 | refs/heads/master | 2021-08-26T06:40:14.247573 | 2017-11-21T22:56:28 | 2017-11-21T22:56:28 | 110,855,729 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,152 | cpp | base_nomes.cpp | #include "base_nomes.h"
#include <string>
using namespace std;
const string NOMES[20] = {"Ana", "Arnaldo", "Bruno", "Carlos", "Diogo", "Felipe", "Guilherme", "Heraldo", "Julio", "Katia",
"Leonardo", "Marcos", "Maria", "Oscar", "Pedro", "Renata", "Sergio", "Thiago", "Victor", "Wesley"};
const string SOBRENOMES[... |
5e488273102d1a7c6bdeb76f08021ad7250c1edc | bfb9caeb27d216883724710f64a9d5f85248e1a2 | /project/CHS/LRBHandler.h | 12abd465841483cdcb73deff87864b5011d1c42a | [] | no_license | bback99/NFGame | 2c0340aa4315ed80aedb85379c32a30d79a1cfcf | e94fb6412271f4f95c200ea4ecab774f506b3877 | refs/heads/master | 2020-07-02T09:52:24.393478 | 2016-11-21T01:02:36 | 2016-11-21T01:02:36 | 74,312,821 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 6,380 | h | LRBHandler.h | // LRBHANDLER.h
//
#ifndef LRBHANDLER_H
#define LRBHANDLER_H
#pragma once
#include "Common.h"
//#include "ADL/MsgLCSCommon2.h"
#include "NF/ADL/MsgCHSNGS.h"
#include <NF/ADL/MsgCHSNCS.h>
#include <NF/ADL/MsgNASCli.h>
#ifdef _CHSNLS
#include <NLSManager.h>
#endif
enum {
COMPARE_SSN = 1,
COM... |
5b1d33dbf197cb43bd3aac5c3f95d54fa44873a6 | 4d9196e969dfa33dcbd2f6d93e3ee03da1364717 | /OOP (CSE165)/Lab 07/Object/Object/Object.h | 794c945a03b7e5fc4eb9d63dac77bd9c593bbe8b | [] | no_license | Lyph/CSE | 55515df96e7804c25bea8478e62ebff5dd692ece | e30a61872da31229de0f7083b3aa4f7869bf5939 | refs/heads/master | 2016-09-14T13:05:44.571808 | 2016-04-23T20:24:50 | 2016-04-23T20:24:50 | 56,939,107 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 180 | h | Object.h | #ifndef DEFAULT_H
#define DEFAULT_H
using namespace std;
class Object {
public:
static int count;
Object() {
count++;
}
Object(const Object &i) {
count++;
}
};
#endif |
3b1eef8b75ad69b6ca2e2fad79f337e4eeb70c90 | 02b585fa38233f564ccf236e08c0c36e35c13050 | /TP3ProgJeux/character.cpp | 5ae5226aca5d6e8898bb3f6ff6c786262e1547e6 | [] | no_license | titoine9912/TP3ProgJeux | ff2805fa7df08516f10e54a1eee0b9f95a54d440 | 3d01347a658e962052dcf644d94b980fdf8968a8 | refs/heads/master | 2021-08-31T11:08:37.418032 | 2017-12-21T07:50:30 | 2017-12-21T07:50:30 | 111,834,306 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 107 | cpp | character.cpp | #include "character.h"
character::character(Vector2f position, float speed) :movable(position,speed)
{
}
|
412764d4948558fcfc811868a156e6dd0c3b0641 | 7d4e2934f8bcb873e1a9655450dc5f39fd736d5a | /Truss/GridParam.h | c8148fa4b0eb9b271463ee23bc50b9b87d9b2492 | [] | no_license | mwck46/FEM_Basics | bb6b519a7ef34fed66948dcdbb49751cf896dff5 | 23cb8ae54baf3d4dbfae24657f92e483e5c4e97a | refs/heads/master | 2022-03-29T21:29:06.919766 | 2019-12-29T06:00:29 | 2019-12-29T06:00:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 866 | h | GridParam.h | #pragma once
#include <boost/numeric/ublas/matrix.hpp>
typedef boost::numeric::ublas::vector<double> vector_d;
typedef boost::numeric::ublas::vector<int> vector_i;
typedef boost::numeric::ublas::matrix<double> matrix_d;
typedef boost::numeric::ublas::matrix<int> matrix_i;
class GridParam
{
public:
GridParam() : nnd... |
0e5847fb1e9675d6b59fa606bcf37f039c5b3a26 | f5f30e0190341e3fb203e3daff053dd6d0014adc | /CEN425 Labs/Lab - 3/main_d.cpp | 308fb4777418e6d7ced7724c1c9393819500ecaa | [] | no_license | janFrancoo/ARMmbed | 53cc0fa5afeb9d4a941bade7e1b5c13f5241d3a2 | c3e46fc40f444e19d27e4c11e5dfd20bb945c0a7 | refs/heads/master | 2020-12-05T16:06:17.249672 | 2020-02-22T06:22:25 | 2020-02-22T06:22:25 | 232,167,102 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 291 | cpp | main_d.cpp | #include "mbed.h"
DigitalOut gled(PG_13);
DigitalOut rled(PG_14);
InterruptIn button(PA_0);
Timeout chron;
void chron_ISR() {
rled = !rled;
}
void button_ISR() {
chron.attach(&chron_ISR, 5);
}
int main(){
rled = 0;
button.rise(&button_ISR);
gled = 1;
while(1);
}
|
91592027cf97e720ff33dd66301b552f4a60c3f3 | e8b06ddf3c7c23f5e80e56075b02de75b6506a44 | /packages/Meshfree/test/tstDetailsCommunicationHelpers.cpp | 64f79ba469d179661c13a00c2a82880575192f56 | [
"BSD-3-Clause",
"LicenseRef-scancode-free-unknown"
] | permissive | ORNL-CEES/DataTransferKit | e65e8b89bd68e400363d04ef8b3499451ed106ae | 60a4cbd0a55505e0450f1ac979e1eef8966dc03f | refs/heads/master | 2023-08-26T13:11:30.588519 | 2023-08-24T12:54:10 | 2023-08-24T12:54:10 | 25,265,743 | 54 | 27 | BSD-3-Clause | 2023-08-17T22:49:41 | 2014-10-15T17:35:07 | C++ | UTF-8 | C++ | false | false | 10,124 | cpp | tstDetailsCommunicationHelpers.cpp | /****************************************************************************
* Copyright (c) 2012-2020 by the DataTransferKit authors *
* All rights reserved. *
* *
* This ... |
627cb8859cfe18f9ba6f4fc6d857f240ca412d38 | c56d936079690d586366f8f3967c7b9bfb4b4f7d | /src/gridbuilder.h | 5b8eaa8946c0bdd2af90472d4bfc19508be2ec02 | [
"Apache-2.0"
] | permissive | jeanpierrethach/FreeFlow-Grid-Solver- | 22746882b0f46050edc616f84939a6c1b1436c25 | 5cbfd8350c42e740a24fe7ce945edd391334c378 | refs/heads/master | 2021-01-11T02:30:31.787638 | 2016-12-17T03:57:26 | 2016-12-17T03:57:26 | 70,955,195 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,253 | h | gridbuilder.h | #ifndef GRIDBUILDER_H
#define GRIDBUILDER_H
#include "grid.h"
//Used for random number generation
#include <cstdlib>
#include <iostream>
#include <ctime>
#include <QPoint>
#include <QDebug>
class GridBuilder
{
public:
static Grid* buildGrid(int row, int col);
GridBuilder();
static int getRandomNumberFr... |
8d443795717f9cf3d8c36afb691136240229726a | 97528ffe2960a8bc122eca00016cde2056f37054 | /preorder_iter.cpp | 0b1187d232aaf9283615426e18a01b7622bf8a54 | [] | no_license | aravind-kumar/Coding | f5875161a2129fb8e2528da9ace42438282ee81b | d71438058fd39fe4bc7d642bd4b5d11333bfe848 | refs/heads/master | 2021-10-26T02:47:14.293087 | 2019-04-09T23:56:28 | 2019-04-09T23:56:28 | 71,275,972 | 0 | 0 | null | 2018-05-18T06:18:35 | 2016-10-18T17:55:38 | C++ | UTF-8 | C++ | false | false | 656 | cpp | preorder_iter.cpp | class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> result;
stack<TreeNode*> stackNodes;
while(root != nullptr || !stackNodes.empty()) {
if(root != nullptr) {
result.push_back(root->val);
stackNode... |
d5eedd3206e47360c141b8ca3d457e97748cc890 | bd91a68c3ed8072ae292191b50bea3349b2f55bc | /ASTNodes/ForStatement.cpp | f3574cbe5d168b2e18d2244d237944d037912565 | [
"MIT"
] | permissive | jonathan-beard/Raft | 0e28d5ea72e840441b2f42f46b45ec2f5b08371e | 6b2c250c915b5ce1db84277e6e5722977e8ebbba | refs/heads/master | 2021-01-17T05:24:36.314552 | 2019-04-23T16:03:09 | 2019-04-23T16:03:09 | 8,226,622 | 6 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 348 | cpp | ForStatement.cpp | /**
* ForStatement.cpp -
* @author: Jonathan Beard
* @version: Sat Feb 15 09:23:35 2014
*/
#include "ForStatement.hpp"
using namespace Node;
ForStatement::ForStatement() : Statement( "ForStatement" )
{
class_tree.addRelation( typeid( Node::Statement ).hash_code(),
typeid( Node::ForS... |
c0425b47b143fa789da40831da65698c914e8e2b | 745da8c56c393c962c8289e92b2ede875dcef7b0 | /quickSort.h | e34561dc8a1ed6050946bc6f6c9cc27318bb3d05 | [
"MIT"
] | permissive | chansiky/Cpp-Sorting | a7426458e1bcad3f8ec440850c6207614a825d75 | 76bbd4c06a8b069640dc20cecfdf20ef4255028b | refs/heads/master | 2021-01-23T07:09:39.641228 | 2017-04-02T00:31:12 | 2017-04-02T00:31:12 | 86,415,974 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 952 | h | quickSort.h | #pragma once
#include <vector>
#include <random>
#include <time.h>
#include "swap.h"
#include <queue>
///quickSort Wrapper
template<typename _T>
void quickSort(std::vector<_T> &v_T);
///quickSort Algorithm
template<typename _T>
void quickSortFull(std::vector<_T> &vT,typename std::vector<_T>::iterator i... |
5dde4fa568a1bc8e786fd6f0923c1ebea9961e5a | 6389c1f38baf105b01ca1320b2cebae78c08b6a1 | /Source Code/StdInfoPage.h | 53e4587b6049d34220f852e06fa7ad40f7819b4c | [] | no_license | changpian8/Home-of-Dandelion-Management-Software | 6d161bed22120a5dfc589aeff8d17fa3bad4a9d7 | 1908c43404b3abec342606b59fc77fcc603e28ad | refs/heads/master | 2021-04-21T23:47:25.493962 | 2020-03-15T19:53:47 | 2020-03-15T19:53:47 | 249,828,058 | 0 | 1 | null | 2020-03-24T22:04:54 | 2020-03-24T22:04:54 | null | GB18030 | C++ | false | false | 41,399 | h | StdInfoPage.h | #pragma once
#include <Windows.h>
#include "SharedParm.h"
#include "Transcript.h"
#include "AddNewGrade.h"
#include "AddNewRecord.h"
#include "ChangeRecordPage.h"
namespace ManagementSoftware {
using namespace System;
using namespace System::ComponentModel;
using namespace System::Collections;
using namespace Sys... |
81693a29fa1f307110bbe2fb0c192d8429369d01 | 46bac44cc58214aec9dc8880a00b542437ed382f | /algo_list/double_list_acces_rand_vs_linear.cpp | fa1c920d9b79a646fc4b91a4874aa9e14efe9c59 | [
"MIT"
] | permissive | knupel/Algorithm-cpp | 773b013137e3a198e48e1115ed541289344222f2 | 6a0801b5202ed0272b67f555f487841d7c2af14a | refs/heads/master | 2023-01-07T21:26:37.209590 | 2020-11-02T13:59:24 | 2020-11-02T13:59:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,639 | cpp | double_list_acces_rand_vs_linear.cpp | #include <iostream>
#include <vector>
#include <map>
#include <random>
#include <time.h>
#include <chrono>
void linear_loop_vector(std::vector<float> &list_a, std::vector<float> &list_b, int dist_max, bool pertinent);
void random_loop_vector(std::vector<float> &list_a ,std::vector<float> &list_b, int dist_max, bool per... |
f986331a0853630a471838c3307d8997ab509c4a | 012784e8de35581e1929306503439bb355be4c4f | /problems/77/p1.cc | 7c32eedd097518a593a2097197c6e39b6ce2c68a | [] | no_license | silenke/my-leetcode | 7502057c9394e41ddeb2e7fd6c1b8261661639e0 | d24ef0970785c547709b1d3c7228e7d8b98b1f06 | refs/heads/master | 2023-06-05T02:05:48.674311 | 2021-07-01T16:18:29 | 2021-07-01T16:18:29 | 331,948,127 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 685 | cc | p1.cc | #include "..\..\leetcode.h"
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<int> c(k);
vector<vector<int>> res;
dfs(n, k, 0, 1, c, res);
return res;
}
private:
void dfs(int n, int k, int i, int j, vector<int>& c, vector<vector<int>>&res) {
... |
466f5d1f51cbbfb038c08eb45f8627eabe288f7d | 4e38faaa2dc1d03375010fd90ad1d24322ed60a7 | /include/RED4ext/Scripting/Natives/Generated/user/SettingsVarListFloat.hpp | 330e669699765bfaa330d7e2459014dd24340c4c | [
"MIT"
] | permissive | WopsS/RED4ext.SDK | 0a1caef8a4f957417ce8fb2fdbd821d24b3b9255 | 3a41c61f6d6f050545ab62681fb72f1efd276536 | refs/heads/master | 2023-08-31T08:21:07.310498 | 2023-08-18T20:51:18 | 2023-08-18T20:51:18 | 324,193,986 | 68 | 25 | MIT | 2023-08-18T20:51:20 | 2020-12-24T16:17:20 | C++ | UTF-8 | C++ | false | false | 662 | hpp | SettingsVarListFloat.hpp | #pragma once
// clang-format off
// This file is generated from the Game's Reflection data
#include <cstdint>
#include <RED4ext/Common.hpp>
#include <RED4ext/Scripting/Natives/Generated/user/SettingsVar.hpp>
namespace RED4ext
{
namespace user
{
struct SettingsVarListFloat : user::SettingsVar
{
static constexpr ... |
d72989f79ae9d9d3c84161fb8ad94dfd921fd04a | 61b9402bc77ffd55a171398ea97e0a8fe2d45c82 | /hannuota.cpp | cfbe6e90f59393bfba12506825f48ea6a7775d3c | [] | no_license | hiki-yukino/c- | 0fcf9f42a4e4e86d2ddff0c901a19a4fb342ba74 | 67c5bdd78a4c8a6864787df9a5b2a446db441241 | refs/heads/main | 2023-03-12T23:42:15.845978 | 2021-03-02T02:56:42 | 2021-03-02T02:56:42 | 340,545,359 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,114 | cpp | hannuota.cpp | #define CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
static int count = 0;
void move(char getone, char putone) {
count++; //盘子的移动次数 从getone 到 putone
printf("%c-->%c\n", getone, putone); // 打印每次移动盘子的动作
}
void hanoit(int n, char a, char b, char c) {
if (... |
e646a05529f0b6e7c9b1cc183e1b143e077c886a | da1500e0d3040497614d5327d2461a22e934b4d8 | /cobalt/renderer/egl_and_gles.h | fdf1839138f3d625a7ec693056f2df58d0927d84 | [
"Apache-2.0",
"BSD-3-Clause"
] | permissive | youtube/cobalt | 34085fc93972ebe05b988b15410e99845efd1968 | acefdaaadd3ef46f10f63d1acae2259e4024d383 | refs/heads/main | 2023-09-01T13:09:47.225174 | 2023-09-01T08:54:54 | 2023-09-01T08:54:54 | 50,049,789 | 169 | 80 | BSD-3-Clause | 2023-09-14T21:50:50 | 2016-01-20T18:11:34 | null | UTF-8 | C++ | false | false | 45,205 | h | egl_and_gles.h | // Copyright 2019 The Cobalt Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by ap... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.