blob_id stringlengths 40 40 | content_id stringlengths 40 40 | repo_name stringlengths 5 114 | path stringlengths 5 318 | language stringclasses 5
values | extension stringclasses 12
values | length_bytes int64 200 200k | license_type stringclasses 2
values | content stringlengths 143 200k |
|---|---|---|---|---|---|---|---|---|
ac6a6a3b4e5378212c08dd9e9b7dab2282f5a5c8 | 5b39ebea1ac2100f5b58a111f85584c38783fe23 | NOAA-PMEL/EcoFOCI_PopUp | /archive/Gen 2 2016-2017/Software/arduino-1.0.6 (with PopUp Rev 4.0 libraries)/libraries/Robot_Control/Squawk.cpp | C++ | cpp | 17,478 | permissive | // Squawk Soft-Synthesizer Library for Arduino
//
// Davey Taylor 2013
// d.taylor@arduino.cc
#include "Squawk.h"
// Period range, used for clamping
#define PERIOD_MIN 28
#define PERIOD_MAX 3424
// Convenience macros
#define LO4(V) ((V) & 0x0F)
#define HI4(V) (((V) & 0xF0) >> 4)
#define MIN(A, B) ((A) < (B) ? ... |
fe1f98cd2fd2d3f16c64f464f680526fc6a0c9cb | e6fe9044252fc35f21141ac30e0e81ca8c85823c | Garuda-1/Huffman-Archiver | /engine/huffman_engine_tree.cpp | C++ | cpp | 2,451 | no_license | #include "huffman_engine.hpp"
#include <limits>
#include <cstdint>
#include <queue>
huffman::tree::tree_node::tree_node(unsigned char c, uint64_t freq, size_t pos)
: freq(freq), l_subtree(std::numeric_limits<size_t>::max()), r_subtree(std::numeric_limits<size_t>::max()),
pos(pos) {
chars.push_back(c);
}
h... |
7e22fe71a88734771b83a7f1bafdcd313a1e0a7e | 16356a4c485d5c74dd7a094653f4c967f6135a57 | DiamondJack/NOI2018 | /day2/intelligence/data/check.cpp | C++ | cpp | 3,072 | no_license | #include <bits/stdc++.h>
using namespace std;
namespace banban {
const int MAX_N = 100010;
const int MAX_M = 200010;
typedef long long ll;
int N, M;
pair<pair<int, int>, ll> q[MAX_M];
ll qlca[MAX_M];
int fa[MAX_N], dep[MAX_N], cnt[MAX_N], cho[MAX_N], top[MAX_N];
ll sum[MAX_N], fval[MAX_N];
int lca(int x, int... |
b2c7d66b68229e24ea003a633061117a03f64170 | f10fc0b0826a05b41b50a6f30b4565fc6d325fb2 | andrey484/CourseWork1Course | /history.cpp | C++ | cpp | 629 | no_license | #include "history.h"
#include "ui_history.h"
#include "startup.h"
#include <QFile>
#include <QDebug>
#include <iostream>
#include <QTextEdit>
History::History(QWidget *parent) :
QWidget(parent),
ui(new Ui::History)
{
ui->setupUi(this);
story();
}
History::~History()
{
delete ui;
}
void History::... |
697d4e03393dce1a31cdee3a1f1ff74b8659219f | f81a79aa5b4f376970e901707698a0a141956971 | EmilyShepherd/Graphics-Coursework-1 | /utils.cpp | C++ | cpp | 2,736 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include "utils.hpp"
/* A simple function that will read a file into an allocated char pointer buffer */
char* filetobuf(char *file)
{
FILE *fptr;
long length;
char *buf;
fptr = fopen(file, "r"); /* Open file for reading */
... |
cf639962cbdf33ccce596548128a1b9545369777 | e303cb87be15607548af9c2205a58ef9bb4ae820 | vivek-yamsani/algos-Task | /task3/c.cpp | C++ | cpp | 2,068 | no_license | #include <iostream>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
#define For(i, n) for (int i = 0; i < n; i++)
using namespace std;
int findMin(int arr[], int n)
{
/*
the Approach is to divide the array into
two sets such that the dif... |
2611f59ef4fe5c44a94c21c160e7b94b42b71c71 | a17216e73a5cf45f76046f0794e1c783a29e12b6 | alamaison/wxWidgets | /src/gtk/fontpicker.cpp | C++ | cpp | 3,702 | no_license | /////////////////////////////////////////////////////////////////////////////
// Name: src/gtk/fontpicker.cpp
// Purpose: implementation of wxFontButton
// Author: Francesco Montorsi
// Modified By:
// Created: 15/04/2006
// Copyright: (c) Francesco Montorsi
// Licence: wxWindows licence
/////... |
73c0b5880b41f1580912117a6e3d3bcecb0a2afa | 3775043af07d5c8b9d5248af377c3ba297ebb9df | indrashismitra/hacktoberfest2021-easy | /Cpp/Arrays/generateSubarrays.cpp | C++ | cpp | 291 | permissive | #include<iostream>
using namespace std;
int main(){
int arr[]={1,2,3,4,5};
int n=sizeof(arr)/sizeof(int);
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
for(int k=i;k<=j;k++){
cout<<arr[k]<<" ";
}
cout<<endl;
}
cout<<"\n\n";
}
return 0;
} |
b4703c7c23975b48f7584739d1485ac4dbab3304 | b292f8f81c1eef08d97f7fac27d1f71822e47883 | hshujuan/xgboost | /src/logging.cc | C++ | cc | 3,013 | permissive | /*!
* Copyright 2015-2018 by Contributors
* \file logging.cc
* \brief Implementation of loggers.
* \author Tianqi Chen
*/
#include <rabit/rabit.h>
#include <dmlc/parameter.h>
#include <xgboost/logging.h>
#include <iostream>
#include <map>
#if !defined(XGBOOST_STRICT_R_MODE) || XGBOOST_STRICT_R_MODE == 0
// Overr... |
170562fb83e9e35c3bc2487a733388d625780172 | c7711bb77ca28b0c7b24be7df30fde6b675f18c2 | KimYJin/Algorithm | /프로그래머스 코딩테스트연습/DinamicPogramming/타일 장식물(1).cpp | C++ | cpp | 740 | no_license | #include <string>
#include <vector>
#include<iostream>
using namespace std;
#define MAX 80
//정사각형 타일 한 변의 길이 1, 1, 2, 3, 5, 8, ... 피보나치
//이러한 타일들로 구성되는 큰 직사각형의 둘레 return
long long solution(int N) {
long long answer = 0;
long long d[MAX + 1] = { 0, }; //타일 한 변의 길이
long long len[MAX + 1] = { 0, }; //직사각형 둘레
d[1... |
02f8c863a8ac36319eb0aa7141fa1ed7c53f8763 | 3451baa13994c594a6f8539114d52eea26f7518b | 3togo/Vitis_Libraries | /data_compression/L2/tests/gzipc/src/host.cpp | C++ | cpp | 1,354 | permissive | /*
* (c) Copyright 2019-2021 Xilinx, Inc. All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required ... |
e9a705ddd90895db77cb36fb6351cc303afb1ef1 | 5c9ff6d8ea5fabbe9695e1b9a3351c0f72e16616 | ZXspectrumZ80/cxxplay | /addition.cpp | C++ | cpp | 245 | no_license | #include <iostream>
int main()
{
std::cout << "Enter 2 numbers:" << std::endl;
int n1 = 0, n2 = 0;
std::cin >> n1 >> n2;
std::cout << "The sum of " << n1 << " and "
<< n2 << " is " << n1 + n2 << std::endl;
return 0;
} |
65f9bfa8fd95fe9cd965428223b858d48e63beb8 | 894b3bfffe2ba9e45250ba05c5736c52f14a378b | docdude/mesa | /src/gallium/frontends/clover/core/kernel.cpp | C++ | cpp | 19,092 | no_license | //
// Copyright 2012 Francisco Jerez
//
// 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, publish... |
0d2267ea12bce88c877e14004d9bc328a66e2c61 | 3fc2d031d885c0ad567f52c8e0bfb0d1a8e35521 | hungdangquoccc/Data-Structures-and-Algorithms---PTIT | /contest10/bai4.cpp | C++ | cpp | 3,315 | no_license | /*#include <bits/stdc++.h>
using namespace std;
struct pos{
int x, y, huongTruocDo, soLanDoiHuong;
pos(){}
pos(int a, int b, int c, int d) {
x=a; y=b; huongTruocDo=c; soLanDoiHuong=d; // hàm tạo
}
};
queue <pos> q;
int n, m, sx, sy, tx, ty;
char s[505][505];
bool chuaxet[505][505][4][4]; // [x]... |
767564ddaeba9b54c53d2e81f4ce8b34d8aface9 | 361551ce3d959f1260faf31ab4a301d091bef689 | naushad-rahman/CIDLib | /Source/AllProjects/CIDBuild/CIDBuild_IDLInfo.hpp | C++ | hpp | 3,859 | no_license | //
// FILE NAME: CIDBuild_IDLInfo.Hpp
//
// AUTHOR: Dean Roddey
//
// CREATED: 03/27/2001
//
// COPYRIGHT: $_CIDLib_CopyRight_$
//
// $_CIDLib_CopyRight2_$
//
// DESCRIPTION:
//
// This is the header for the CIDBuild_IDLInfo.cpp file. This file implements
// the small class, TIDLInfo, which is used to hold the infor... |
392442a14854c2b12771e4bca53a6f50a712ca1f | 0d52f02e796e7dac49fd75169317b2553f1b1758 | peon-pasado/CompetitiveProgramming | /cses/Baltic_10_Lego.cpp | C++ | cpp | 4,563 | no_license | /**
* @author Miguel Mini
* @tag backtracking, dp, bitmask
* @idea
* - generate all valid configuration,
* and run dp for consecutive layers.
*
* - we need optimize valid verification
* for two consecutive layers.
**/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target... |
0468424328256ee7a027c89c0ed5c56821c31dd7 | cd5464819d53fdd64f3d4bf9c0c5fc46d076e1ae | chimpxx/scb | /Game.cpp | C++ | cpp | 1,122 | no_license | #include "Game.h"
Game::Game(IcatGame *icatGame)
:icatGame(icatGame)
{
levelLoader = new LevelLoader(icatGame);
worldPtr = nullptr;
}
Game::~Game()
{
}
void Game::clearScene() {
if (!worldPtr)
worldPtr = new b2World(gravity);
}
void Game::initLevel(int levelNum) {
clearScene();
current... |
97639cc718bd5979e5070295ea4b022796b06f85 | 7c61bc59f6bdd012b8ad4cbe06fee753bcb10520 | Jin992/cpp_pool | /day07/ex02/main.cpp | C++ | cpp | 1,150 | no_license |
#include "Array.hpp"
#include <iostream>
int main(void) {
Array<int> i(3);
Array<char> c(3);
Array<std::string> s(3);
std::cout << "Size of Array<int> i(3): " << i.size() << "\n"
<< "Size of Array<char> c(3): " << c.size() << "\n"
<< "Size of Array<std::string> s(3): " << s... |
35cb5999cc1bebfb4628c3f82cb483d7fe833d9d | 60076900a37a05fcf1ba6cb4369b0cc2cb6ff3c7 | ImMaur0103/Proceso-de-abstracion-V1 | /ConsoleApplication3/AssemblyInfo.cpp | C++ | cpp | 754 | no_license | #include "stdafx.h"
using namespace System;
using namespace System::Reflection;
using namespace System::Runtime::CompilerServices;
using namespace System::Runtime::InteropServices;
using namespace System::Security::Permissions;
[assembly:AssemblyTitleAttribute(L"ConsoleApplication3")];
[assembly:AssemblyDescriptionAt... |
4ab705984cd0165776d6daf7309ab5d7875193fb | 0717efd2d34cb9e5284f2a3ec275516a33d6b8b4 | KonstaMF/500-CPP | /462.cpp | C++ | cpp | 515 | no_license | #include<iostream>
using namespace std;
// A function to check if n is palindrome
int isPalindrome(int n)
{
// Find reverse of n
int rev = 0;
for (int i = n; i > 0; i /= 10)
rev = rev*10 + i%10;
// If n and rev are same, then n is palindrome
return (n==rev);
}
// prints palindrome between min and max
void cou... |
9f15b02a5a0f394e223ceb0d36d6b3f996cec4eb | e0b71625f48bb3d7f4640ab7b51786c153fd32e0 | jiaweisong/cpp_example | /leetcode/TextJustification.cpp | C++ | cpp | 2,576 | no_license | #include <iostream>
#include <vector>
using namespace std;
class Solution
{
public:
vector<string> fullJustify(vector<string>& words, int maxWidth)
{
vector<string> result;
result.reserve(words.size());
int start = 0, curr = 0, total_length = 0, str_length = 0, even_space = 0, mod = 0;
while (curr... |
47dde04fdcc523c11fade4844bc555170ad613ae | 325d2053dc4043866d4d69ac97b72220be36de10 | fsaintjacques/arrow | /cpp/src/parquet/column_reader.cc | C++ | cc | 65,168 | permissive | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... |
0eb91a2134799ae748bc685b9557f8d3a292a345 | 1c5b214de5aa6de6b33c9ed7b40f614730c44d27 | puzcoin/scap-coin | /src/test/scheduler_tests.cpp | C++ | cpp | 5,069 | permissive | // Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2017-2020 The SafeCapital Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/lice... |
f5141d5879c3c64e18744181a7d5e5895ba342aa | 4bae4cb527be9b2609f43aee02027c17478abcf1 | Sally27/B23MuNu_backup | /TMVA/kfoldold/test/main.cc | C++ | cc | 1,149 | no_license | #include "KFolder.hpp"
int main() {
KFolder mine("/test/B23munuSimOn.root","/test/finalbackground.root");
mine.addTrainingVars("Bplus_P");
mine.addTrainingVars("Bplus_PT");
mine.addTrainingVars("mu1_PT");
mine.addTrainingVars("mu2_PT");
mine.addTrainingVars("mu3_PT");
//mine.addSpecta... |
1dfa6c9457f6a70036c8a6df1bc8500c69c9240e | 4e809e1799232d71c628c1e1e8d4346e3033e723 | yashar-sb-sb/my-codeforces-submissions | /200-299/230/(4034123)[OK]A[ b'Dragons' ].cpp | C++ | cpp | 572 | no_license | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long LL;
typedef long double ldb;
typedef pair<int,int> pii;
int main()
{
int s, n, x, y;
cin>>s>>n;
vector<pii> d;
while(n--)
{
cin>>x>>y;
if(x<s)
{
s+=y;
}
else
... |
fa6192580c2fc4964720fd2ab0a4af8189b16c73 | 7f176f2618ffb5bf986ef43d28338067a9ce4332 | kumarasn/tracker | /TrackerOnFann21/Filters/ImageFilter.cpp | C++ | cpp | 350 | no_license | /*
* ImageFilter.cpp
*
* Created on: 05-feb-2009
* Author: Timpa
*/
#include "ImageFilter.h"
ImageFilter::ImageFilter() {
// TODO Auto-generated constructor stub
}
ImageFilter::~ImageFilter() {
// TODO Auto-generated destructor stub
}
IplImage *ImageFilter::applyFilter(IplImage* scr)... |
7e493b5426a0ef297f59ee6c1798a15c6fb5262c | 1bab5cde98814f39800da9bde1813a72b6ae5737 | ronaldtseMV/openmm | /plugins/amoeba/platforms/cuda/src/AmoebaCudaKernels.cpp | C++ | cpp | 150,154 | no_license | /* -------------------------------------------------------------------------- *
* OpenMMAmoeba *
* -------------------------------------------------------------------------- *
* This is part of the OpenMM molecular simulation toolkit originating from *
... |
14be686da2e5c45fe1faa4ad5265bdc68f5754b1 | 6d9fa2b3f7d0798e61cb5b7d0b2cb7b61be8c731 | aliakseis/LIII | /src/3rdparty/torrent-rasterbar/src/resolve_links.cpp | C++ | cpp | 4,803 | permissive | /*
Copyright (c) 2014-2016, Arvid Norberg
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and ... |
9e646b06f3614ee0a23efcd2021d61f999a2c8d8 | 58796312c1aa0f3d5d4252862e03025c7213c664 | unicornMHX/CliqueTreeConstruction | /test.cpp | C++ | cpp | 5,475 | no_license | #include "factor.h"
#include "myAlgorithm.h"
#include <algorithm>
#include <iterator>
#include <set>
#include <time.h>
using namespace std;
static inline bool cmpfirst(pair<int, int> p1, pair<int, int> p2) {
return p1.first < p2.first;
}
// scope union:
factor::scope operator+(const factor::scope &s1, const factor:... |
86c8f28156fed4d1df7bab56296f28d3e5ec3d58 | 37828e0e6ca72f2ed72550ccab7c4e65cc400300 | Duckboy117/DGIIM | /Segundo/1 Cuatrimestre/EC/Prácticas/Práctica 2/Código en C/unsigned32.cc | C++ | cc | 767 | permissive | #include <iostream>
// 4294967295 + 4294967295 = 8589934590
// 0xffffffff + 0xffffffff = 0x1fffffffe
unsigned lista[] = {0xffffffff, 0xffffffff};
unsigned n = sizeof(lista) / sizeof(unsigned);
unsigned suma1(unsigned *lista, unsigned longlista)
{
unsigned total = 0;
for (unsigned i = 0; i < longlista; ++i)
total... |
a3fc84482eda4510bed6479e474e2992bbbdaeb1 | 6ff257a560c4a7343bb122b264dac11b168bb10a | chenluyao/myLeetcodeSolution | /leetcodes/Merge Sorted Array.cpp | C++ | cpp | 616 | no_license | class Solution {
public:
void merge(int A[], int m, int B[], int n) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int size = m+n;
int i;
int j;
for(i = m-1, j = n-1; i>=0 && j >= 0; )
{
if(A[i] ... |
b2921b9a24b70cb9bb8b097a956a8ec81a484395 | d6d392fdb9d3b940cf295edc3c61c7e2c030f467 | meghagupta19/GeekForce-30-Days-Of-Code | /Naaz/59A.cpp | C++ | cpp | 608 | no_license | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string s;
int upper = 0, l=0;
cin>>s;
for (int i = 0; i < s.length(); i++)
{ if (s[i] >= 'A' && s[i] <= 'Z')
upper++;
}
for (int i = 0; i < s.length(); i++)
{ if (s[i] >= 'a' && ... |
eb30ea705c1c8a0a1aeb4ea6acbebe9fb23160bf | 2c03bb6d532981bba69b26b62151e04e97e10eb9 | sc2ad/BeatSaber-Quest-Codegen | /include/HoudiniEngineUnity/HEU_AssetPreset.hpp | C++ | hpp | 6,838 | permissive | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "beatsaber-hook/shared/utils/typedefs.h"
#include "beatsaber-hook/shared/utils/byref.hpp"
#include "beatsaber-hook/shared/utils/il2cpp-ut... |
f5c9042773d3112c76f3d3bf699748e6f52ae162 | 36f6948b7326a13c900abd3af1b9c0faf1d7d1eb | HaloExchange/HaloBitcoin | /src/halobitcoind.cpp | C++ | cpp | 5,795 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2013 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "clientversion.h"
#include "rpcserver.h"
#include "init.h"
#include "main... |
8c9a08bbd8f07c1affae34e281bf29ffc60ce9b2 | b71c6c4093e1d742d516d379e1b03d35f1f429b8 | studentBC/justExercise | /zigzagConversion.cpp | C++ | cpp | 1,702 | no_license | class Solution {
public:
string convert(string s, int numRows) {
if (numRows <= 1) return s;
vector<vector<char>>pattern(numRows);
int len = (numRows-1)*2 , a = numRows-2;
int count[len];
for (int i = 0; i < numRows; i++) {
count[i] = i;
}
for (int i = n... |
77d8da59ae4c787a150ae99719e8cffea4a0b19b | 64a8d52fd8f3bbaff150d7f192f95b9b9f14ca3d | MaximWolpher/aoc2020 | /day13/first.cpp | C++ | cpp | 817 | no_license | #include <iostream>
#include <fstream>
#include <string>
#include <sstream>
using namespace std;
int main()
{
string line;
string bus_id;
int timestamp;
int departure;
int best_time = 100000;
int best_id = 0;
ifstream myfile ("day13/data");
if (myfile.is_open())
{
getlin... |
6a0e50210984e30418885b2e8b6e6d313e62052b | 7b73fa08831ea7e7e0849fd9133834fe1994df78 | AllenKashiwa/StudyCpp | /C++_Primer_5th_Edition/VisualStudio2012/17/regex1.cpp | C++ | cpp | 2,763 | no_license | /*
* This file contains code from "C++ Primer, Fifth Edition", by Stanley B.
* Lippman, Josee Lajoie, and Barbara E. Moo, and is covered under the
* copyright and warranty notices given in that book:
*
* "Copyright (c) 2013 by Objectwrite, Inc., Josee Lajoie, and Barbara E. Moo."
*
*
* "The authors a... |
c081bcba49ac7536f36c72d69c49c19e4d7698a0 | f5bb9c054656b3ae6e7eb7bf5a9801bbaf43e53d | nTavvka/First-course | /LR 7/Ex - 4.cpp | C++ | cpp | 4,874 | no_license |
#include "pch.h"
#include <iostream>
#include <string>
using namespace std;
void solve_sum(string A, string B);
int* add_one(int *rezult, int &rez_size);
void solve_diff(string A, string B);
string point(string A, int counter);
int cmp(string A, string B);
int main()
{
//string signA = "+", signB =... |
45a5001d9bb5cff9ed7cf6035458787a712f93f2 | b82b522c2baee0d13a6b6eeeee02a772f8dc95cf | joshuabezaleel/cp | /spoj/NICEDAYgen.cpp | C++ | cpp | 1,484 | no_license | #include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
using namespace std;
#ifdef DEBU... |
b6ec4013b6783c72dc09b963ab1c2a68dc9206a2 | 1a6da65e92bd906176f0a31bf1e68e2a27c27577 | liorcoeh/CPP-Stuff | /sourceCR/include/d_listner.hpp | C++ | hpp | 1,786 | no_license | ////////////////////////////////////////////////////////////////////////////////
// File Name: listner.hpp //
// Author: Lior Cohen //
// Date 26/07/2020 ... |
2b7d9947cc9922ea95ae8ca2039dceec09672d68 | 3eeeec16274dad5dccc248d7b8089aceafa284e3 | monowireless/mwx | /SM_SIMPLE.hpp | C++ | hpp | 1,444 | no_license | #pragma once
#include <cstdint>
#include <cstring>
#include "mwx_periph.hpp"
// very simple class to control state used in loop().
template <typename STATE>
class SM_SIMPLE {
uint32_t _u32_flag_value; // optional data when flag is set.
uint32_t _ms_start; // system time when start waiting.
uint32_t _ms_timeout; ... |
a6a0ea1091dd2dd9cf06d371c50123397f0e763e | 9f2c665866d3c9fa75658899d97f35dd1e422a6a | amilendra/llvm-project | /llvm/lib/CodeGen/ComplexDeinterleavingPass.cpp | C++ | cpp | 69,875 | permissive | //===- ComplexDeinterleavingPass.cpp --------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
0a0ee66075d54e9522b734d5a4a52d4c77bbcc6e | ebbc312c258f95d14f7ef18bf808b2f4802b0af5 | jindalshivam09/cppcodes | /ACM/ACMAMR14/groundStations.cpp | C++ | cpp | 1,913 | no_license | #include<bits/stdc++.h>
using namespace std;
#define MAX 100009
int m, number ;
vector<vector<int> > adj(MAX) ;
vector<int> level(MAX), mapped(MAX), sz(MAX);
int dfs(int u, int parent) {
mapped[u] = ++number ;
if(parent != -1)
level[mapped[u]] = level[mapped[parent]] + 1 ;
int ans = 0 ;
for(int i=0;i<adj[u].siz... |
45972269dfd2f6fad2778504d1732eba5819a563 | 01be2850c5dd443ef212ee5e2914715a508ce5c9 | zv/metamage_1 | /lamp/jTools/sendmail/SMTP.hh | C++ | hh | 2,304 | no_license | /* =======
* SMTP.hh
* =======
*/
#ifndef ARCANA_SMTP_HH
#define ARCANA_SMTP_HH
// plus
#include "plus/string/concat.hh"
// text-input
#include "text_input/feed.hh"
#include "text_input/get_line_from_feed.hh"
// poseven
#ifndef POSEVEN_EXTRAS_FDREADER_HH
#include "poseven/extras/fd_reader.hh"
#endif
#ifndef POSE... |
10dd7670bd14793229b312e3aebd677cae580cf6 | 3503e9a0043ac742b9e2969cd36cbfff36dacd41 | charlottearndt/ardebug-1 | /RobotAPI/debug_network.cpp | C++ | cpp | 3,971 | no_license | /*
* debug_network.cpp
*
* This class encapsulates networking functionality for sending packets of
* robot data to the SwarmDebug application.
*
* (C) Alistair Jewers, Feb 2017.
*/
#include "debug_network.h"
#include <sstream>
#include <fstream>
#include <string>
#include <cstdlib>
DebugNetwork::DebugNetwork(v... |
169e8684de9bc4183d889dc0790b06df0f179b84 | 128592a6893b1b3b7e3a97111a5fa225aef55013 | cnsuhao/actor-framework | /libcaf_core/caf/type_nr.hpp | C++ | hpp | 5,694 | permissive | /******************************************************************************
* ____ _ _____ *
* / ___| / \ | ___| C++ *
* | | / _ \ | |_ Actor *
... |
56c498ea78ff0fddb8689a5b0829cdc4208a8962 | c8a565b829e5429cecbd9b5da46c640969bf9e34 | jamiepg1/ta | /C++/lab/lab02/02-4.cpp | C++ | cpp | 355 | no_license | #include "ccc_empl.cpp"
#include <iostream>
using namespace std;
int main(){
int pay = 16484;
int payrise = 2500;
string nm = "peng";
Employee emp(nm, pay);
cout<<"The salary of "<<emp.get_name()<<" is "<<emp.get_salary()<<endl;
emp.set_salary(pay+payrise);
cout<<"The new salary of "<<emp.get_name()<... |
8202ca069bbe89ad44e1ce6cd7e12f55fd346e30 | a067d3d0a8bbc10da357f11c6e24f455711782a7 | irenelee5645/C-_Programs | /operator overloading 3/operator overloading 3/p3.cpp | C++ | cpp | 272 | no_license | //
// p3.cpp
// operator overloading 3
//
// Created by Irene Lee on 6/7/19.
// Copyright © 2019 Irene Lee. All rights reserved.
//
#include "p3.hpp"
int main()
{
Date d(1987,4,27);
cout<<d;
cout<<"++ : "<<d++;
d--;
cout<<"-- : "<<d;
}
|
890f78ee9a95b5b38237ee5b24200aaa2cb85412 | 4630256e3feb7fe364f47fa8d99b022740e970cc | IceOrchid/chromium | /chromeos/constants/chromeos_features.cc | C++ | cc | 7,131 | permissive | // Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chromeos/constants/chromeos_features.h"
namespace chromeos {
namespace features {
// Enables or disables auto screen-brightness adjustment wh... |
ebb705a15704e9b15cf1bf0d0e599c97ed3de4fd | 4f78d1d44ff20461b4bf01208eadc7047a922cf5 | Myway3D/Myway3D | /ThirdParty/MyGui/Tools/LayoutEditor/SettingsSector.cpp | C++ | cpp | 4,343 | no_license | /*!
@file
@author Albert Semenov
@date 08/2010
*/
#include "Precompiled.h"
#include "SettingsSector.h"
namespace tools
{
SettingsSector::SettingsSector()
{
}
SettingsSector::~SettingsSector()
{
}
void SettingsSector::serialization(MyGUI::xml::Element* _node, MyGUI::Version _version)
{... |
ed972eeb8e41edd57063534e4cf7c1832069168f | 96de561785a5e3fb2b13eaf4b652c65f489e2e6c | liangyourong/BAIDU-IFE | /华为机试整理85道 含源码/71.cpp | C++ | cpp | 1,135 | no_license | #include<iostream>
using namespace std;
int choice(int *d,int *visit,int n);
int main(int argc,char *argv[])
{
int n,m,v,s,e,min;
cin>>n>>m>>v;
int **a=new int*[n];
int *visit=new int[n];
int *d=new int[n];
for(int i=0;i<n;i++)
{
a[i]=new int[n]; //这个地方老是犯错，是n不是i！！！！
visit[i]=0;
}
for(in... |
378131e912dd17bdf96ac16748d8c8e2c22f3c44 | a116d72761c4a9bcb074c20bf49e3e13955905c4 | unoacm/Arduino-Workshop | /libraries/Standard/src/numeric.hpp | C++ | hpp | 3,061 | permissive | #ifndef UNO_ACM_NUMERIC
#define UNO_ACM_NUMERIC
#include <iterator.hpp>
namespace std
{
template<class InputIterator, class T>
T accumulate(InputIterator first, InputIterator last, T init)
{
while(first != last)
{
init = init + *first;
first++;
}
return init;
}
template<class InputIterator, class... |
d8b4e8a582bbe0fd650622bd59b6e42e23d76847 | 8f306d0245f6e15faaaae74c119663586d77aa54 | mingzailao/Coursera | /C_plus_plus/week7/4.cc | C++ | cc | 459 | no_license | #include<iostream>
using namespace std;
//Generic Programming
template <class T>
void Swap(T & x,T & y){
T tmp=x;
x=y;
y=tmp;
}
T MaxElement(T a[],int size){
T tmpMax=a[0];
for(int i=1;i<size;i++){
if(tmpMax<a[i]){
tmpMax=a[i];
}
}
return tmpMax;
}
int main(){
... |
e260d5e4316b11606b9b7c3b50bbf9236917ea68 | 300af5c86167823ba05a065072548282951d102d | Iberlos/UbisoftNext2020 | /NextAPI2020/GameTest/GameTest.cpp | C++ | cpp | 6,158 | no_license | //------------------------------------------------------------------------
// GameTest.cpp
//------------------------------------------------------------------------
#include "stdafx.h"
//------------------------------------------------------------------------
#include <windows.h>
#include <math.h>
#include <string>
/... |
12547c038780769684cdc140fe510dd17237c3dc | 35f1d5c596cab8d62949a85021c113ec16b80fa4 | DemetrisKonst/Autoencoder_Dimensionality_Reduction | /NN_Clustering/cluster.cpp | C++ | cpp | 4,386 | no_license | #include <iostream>
#include "./include/Clustering/clustering.hpp"
int main(int argc, char const *argv[])
{
/* define useful variables */
int success = 0;
double duration1 = 0.0;
double duration2 = 0.0;
interface::ExitCode status;
interface::Dataset<uint8_t> original_dataset;
interface::Dataset<uint16... |
9b28f606bc2758af37db0cc06890cec4746f21ce | f6d56f4788f92467c1d74d6ac3cc7d139ef2d130 | shotauedaGit/cp_practice | /hash_combine-test.cpp | C++ | cpp | 2,378 | no_license | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define LINF 9223372036854775807
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return ... |
4fad0a1b2e21b0c34c9923528c203d51d84eb290 | feefd4efe881c11e9699b476164604ec05e30a43 | Minh-An/windows-systems | /Win10SysProgBookSamples/Chapter02/PrivateSharing/PrivateSharing.cpp | C++ | cpp | 597 | permissive | // PrivateSharing.cpp : main source file for PrivateSharing.exe
//
#include "stdafx.h"
#include "MainDlg.h"
CAppModule _Module;
int WINAPI WinMain(HINSTANCE hInstance, HINSTANCE /*hPrevInstance*/, LPSTR /*lpstrCmdLine*/, int /*nCmdShow*/) {
HRESULT hRes = ::CoInitialize(nullptr);
ATLASSERT(SUCCEEDED(hR... |
c57ee8f3b023c293ca03f7d4776621cdb6b42700 | de1c65734bacf6c73e9013313432029d00816aa9 | intfloat/AlgoSolutions | /codeforces/CF291/HanSoloandLazerGun.cpp | C++ | cpp | 511 | no_license | #include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, x0, y0, x, y;
cin >> n >> x0 >> y0;
set<pair<int, int> > res;
FOR(i, n) {
cin >> x >> y;
x -= x0; y-= y0;
int ax = abs(x), ay = abs(y);
int g = __gcd(ax, ay);
... |
8e87483d2abf4a5094527008edee0152999cc051 | f88a23e7bbc3afa4fefd1017798306384e983ba6 | RockLobster/osrm-backend | /data_structures/external_memory_node.hpp | C++ | hpp | 1,994 | permissive | /*
Copyright (c) 2014, Project OSRM, Dennis Luxen, others
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this list
of conditions ... |
219ad0d9c07bd79e396fa889a57319ebe778c119 | ec33efdf2740ea12d73fc3b379caa7e9e8e9037b | ennoherr/Windows-classic-samples | /Samples/Win7Samples/multimedia/WMP/Wizards/services/templates/1033/Type1/GetInfo.cpp | C++ | cpp | 20,555 | permissive | #include "stdafx.h"
#include "[!output root].h"
////////////////////////////////////////////////////////////////////
// C[!output Safe_root]
// GetItemInfo method
// GetContentPartnerInfo method
// GetStreamingURL method
// GetCatalogURL method
// GetTemplate method
//
// Copyright (c) Microsoft Corpora... |
986652238d9ae93bbbcc86b20735defd9350fc51 | 608569ea1e4e5ae452e1daf846bae4674d32d52f | AquosPoke206/CK3toEU4 | /CK3toEU4/Source/CK3World/Geography/CountyDetails.cpp | C++ | cpp | 2,117 | permissive | #include "CountyDetails.h"
#include "../Cultures/Cultures.h"
#include "../Religions/Faiths.h"
#include "CountyDetail.h"
#include "Log.h"
#include "ParserHelpers.h"
CK3::CountyDetails::CountyDetails(std::istream& theStream)
{
registerKeys();
parseStream(theStream);
clearRegisteredKeywords();
}
void CK3::CountyDetai... |
e7bd5169dacfb81baee70951edc1d78414824484 | 89378b187055dd3fe82aaebacfbb5a1b1008737d | rasimon22/Tracer-Challenge | /Test/MatrixTest.cpp | C++ | cpp | 8,631 | no_license | //
// Created by Rick Simon on 2019-01-15.
//
#include "catch.hpp"
#include <Tuple.h>
#include <Matrix.h>
#include <iostream>
#include <vector>
#include <exception>
#include <cmath>
#define PI 3.141592634
TEST_CASE("Constructors") {
Primitives::Matrix m;
m.at(1, 1) = 4.0f;
REQUIRE(Primitives::float_equal(m.at(... |
c6e0d28d1ebbcddb1786a53e8bff6d3930dc1e3d | 84dde2a977fceaf2c053244ef33b83223f5321ce | Aria461863631/kuangbin4 | /3169.cpp | C++ | cpp | 1,841 | no_license | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#define N 10005
#define INF 0x3f3f3f3f
using namespace std;
struct Edge {
int u, v, w, nex;
} edg[ N ];
int head[ N ];
int dis[ N ];
bool vis[ N ];
int c = 0;
void AddEdge ( int u, int v, int w ) {
... |
8706fd9aa940bd5f672e9ff05287f40820b7a3d3 | 211c0e7aff39b823eb2f723ca41335addfc8cb9f | thakur24/hello-world | /C++/Pattern_Print_Codes/pattern2.cpp | C++ | cpp | 570 | no_license | #include <iostream>
using namespace std;
/*
Following code prints the following pattern as per giver n
INPUT:
n = 5
OUTPUT:
*****
****
***
**
*
INPUT:
n = 4
OUTPUT:
****
***
**
*
*/
//function for printing the pattern
void printPatt(int n)
{
int i,j;
for(i=0; i<n; i++)
{
... |
bfa371728d65d4497a4a3d9537f53564cebfc93b | bb85e7e25377d8540549facf049c4403ec12081a | ayushchaudhari/Hacker-Rank | /Practice Problem Solving/Data Structures/Arrays/2D Array - DS/2d_array.cpp | C++ | cpp | 1,371 | no_license | //Problem @ https://www.hackerrank.com/challenges/2d-array/problem
//A CPP Solution by Ayush Chaudhari
//Logic Explained @ https://git.io/JcvqV
//Time Complexity = O(n^2) or more preciesly O(r*c); where r->row & c->col of the given matrix
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
usin... |
0f0c5220e350fc309314c06c656543d091218d8f | e02106b1aae5d5497f0f95e37e1dc96f5e3f8053 | MarAlder/tigl | /src/wing/CCPACSWingRibRotation.cpp | C++ | cpp | 1,309 | permissive | /*
* Copyright (C) 2016 Airbus Defence and Space
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or a... |
303f302246134fa8302f24f85ab13dcea380cbba | 4e2a3779e6d644421dff818d4776c28a6031db95 | brycelelbach/nt2 | /modules/crlibm/unit/scalar/cospi.cpp | C++ | cpp | 2,320 | permissive | //////////////////////////////////////////////////////////////////////////////
/// Copyright 2003 and onward LASMEA UMR 6602 CNRS/U.B.P Clermont-Ferrand
/// Copyright 2009 and onward LRI UMR 8623 CNRS/Univ Paris Sud XI
///
/// Distributed under the Boost Software License, Version 1.0
/// ... |
a136f2377a7a4030e80d26ed30aae1adadfce640 | 9b319fc0430e3021c4aff6cfa21392e528e4f19a | SantosTemoteo/curso_cplusplus | /exercicios/beginner/uri1014.cpp | C++ | cpp | 212 | no_license | #include <iostream>
using namespace std;
int main(){
float X,Y,average;
cin >> X >> Y;
average = X/Y;
cout.precision(3);
cout << std::fixed << average << " km/l" << endl;
return 0;
} |
e67a34e26cdf8e6fb10f35b31eaf12b82d4b42e4 | cb09e0be518107a55fa652638e1ed1b035f9bfd6 | Muzahid037/Online-Judge-Problems | /CodeForces/A1. Sort the Numbers.cpp | C++ | cpp | 577 | no_license | ///-----Bismillahir Rahmanir Rahim-----///
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
#ifndef ONLINE_JUDGE
// For getting input from input.txt file
freopen("input.txt", "r", stdin);
// Printing the Output to output.txt file
freopen("output.txt", "w", stdout);
#end... |
87c66856ad3919d28c8f4c4bc85977fa06d69427 | 4ea91414fa83f542eb60d2cac9bd38e8640e9755 | GuillaumeBchd/Librairie_de_matrices | /src/main.cpp | C++ | cpp | 3,708 | no_license | #include <stdio.h>
#include <iostream>
#include <cmath>
#include "CMatrice.h"
#include "COperationsComplexesMatrices.h"
#include "CParser.h"
int main(int argc, char *argv[])
{
//Pour chaque nom de fichier passé en paramètre, lire le fichier et créer la matrice associée :
if (argc > 1) {
unsign... |
74e973e134f5f0ae9fc801493fe84f0e423fac66 | b10e410d359dcd4cb37c0fa6b88128cbe0eb097d | YirunLi/LeetCodePractice | /014_最长公共前缀/src/main.cpp | C++ | cpp | 2,490 | no_license | /*
Create by xiaorun on August th, 2019.
编写一个函数来查找字符串数组中的最长公共前缀。
如果不存在公共前缀，返回空字符串 ""。
示例 1:
输入: ["flower","flow","flight"]
输出: "fl"
示例 2:
输入: ["dog","racecar","car"]
输出: ""
解释: 输入不存在公共前缀。
*/
#include <iostream>
#include <vector>
using namespace std;
// 思路：
string longestCommonPrefix(vector<string>& strs) {
... |
83d64dad3689daf093bb2224f625120105a41038 | 0b0cf1e9a78342330504a5f45c01dddcd86ff348 | Imp95/CPPTowerDefenceProject | /src/MyGraphicEngine.cpp | C++ | cpp | 2,698 | no_license | #include <string>
#include "MyGraphicEngine.h"
#include "MyGameEngine.h"
void MyGraphicEngine::Draw(){
glutReshapeWindow(800, 600);
//GraphicPrimitives::drawLine2D(x1, 0.5f, x2, -0.5f, 1.0f, 0.0f, 1.0f);
//GraphicPrimitives::drawText2D(str, -1.0f, 0.9f, 0.0f, 0.0f, 1.0f);
std::string s = std::to_string(*g... |
b8387b2ebc705cd06c71770028c7b00abd5da06b | f59a722533d7e4a3ff0b48848d6f9ef99b4ee85d | testcoinz/c2pcore | /src/rpcclient.cpp | C++ | cpp | 4,864 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2018 The Coin2Play developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or htt... |
2ed9475172e6bb02d47a92942ac3c353a422b4dc | fcce9b8fdc9e14cdad49b272d3504deb24c2525d | snowuyl/triton-inference-server | /src/test/custom/sequence/sequence.cc | C++ | cc | 13,393 | permissive | // Copyright (c) 2018-2020, NVIDIA CORPORATION. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// * Redistributions of source code must retain the above copyright
// notice, this list of ... |
821d2ed8ba161a602a19e76c1cdf1b095da7983f | 828b992e710aab371c83fe37b63bb19b45cf1144 | MarkOates/hexagon | /src/NcursesArt/GithubRepoStatusFetcher.cpp | C++ | cpp | 8,020 | no_license |
#include <NcursesArt/GithubRepoStatusFetcher.hpp>
#include <Blast/ShellCommandExecutorWithCallback.hpp>
#include <Blast/String/Trimmer.hpp>
#include <Blast/StringSplitter.hpp>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
namespace NcursesArt
{
GithubRepoStatusFe... |
63b4ca26bb25965fb58659e2ad06cf795dfb961b | 674894aad5fd8f84b09be025ded70b991ba8c9df | faishol01/pelatnas-1 | /L02-1.cpp | C++ | cpp | 2,263 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
ll N, M, F[100005], G[100005];
ll matriks_proses[75][75], matriks_hasil[75][75], matriks_tmp[75][75];
ll fungsi[75], ans = 0, sz;
void subtask1(){
F[0] = 1;
G[0] = 1;
for(int i=1;i<M;i++){
F[i] = 1;
G[i] = (F[i] + G[i-1... |
d824d2aae7abeeda9c9c67bc7a46a9845eda944f | ee12310fa6d7ff4d64e4cc9dfbe9eba4778c67a8 | baudoliver7/industria-elec | /Sources/FrmAccueil.cpp | C++ | cpp | 431 | permissive | #include "FrmAccueil.h"
#include "ui_FrmAccueil.h"
FrmAccueil::FrmAccueil(QWidget *parent) :
QWidget(parent),
ui(new Ui::FrmAccueil)
{
ui->setupUi(this);
}
FrmAccueil::~FrmAccueil()
{
delete ui;
}
void FrmAccueil::on_btn_new_mt_clicked()
{
emit createNewMT();
}
void FrmAccueil::on_btn_new_mi_cli... |
c189f564c237046dfb845450733a6dcdb13fd227 | 054e788611642ac7516d6e2edcb8f781081ac4e3 | Arkesion/327_proj3_fileIO | /FileIO.cpp | C++ | cpp | 1,124 | no_license | /*
* FileReader.cpp
*
* Created on: Oct 8, 2017
* Author: Kevin Quirici
*/
#include <iostream>
#include <fstream>
#include "../327_proj3_test/includes/FileIO.h"
#include "../327_proj3_test/includes/constants.h"
using namespace std;
using namespace KP_FileIO;
int KP_FileIO::getFileContents(const std::string... |
0007d683b365f9a1ae00e016e924f520070238c3 | bedb8958df81abf886db7311d221a16f79088d76 | 1aam2am1/TGUI | /tests/Widgets/MenuBar.cpp | C++ | cpp | 21,172 | permissive | /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// TGUI - Texus' Graphical User Interface
// Copyright (C) 2012-2020 Bruno Van de Velde (vdv_b@tgui.eu)
//
// This software is provided 'as-is', without any express or implied warranty.
/... |
c7b999cfb195537e36b0b1d544696b706a73f3f9 | 64a601c7143c18404eae8c634aa3f9833444b80b | Seottle/OJ-RESOLUTION | /HDU/1287/12122681_AC_46ms_1916kB.cpp | C++ | cpp | 478 | no_license | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 1000;
int arr[MAXN];
int main()
{
int n;
while(cin >> n)
{
int flag = 0;
for(int i = 0; i < n; ++i) cin >> arr[i];
int i, j;
for(i = 'A'; i <= 'Z'; ++i)
{
for(j = 0; j < n; ++j)
if(!isupper(arr[j]^i)) ... |
0c1d3e66a7aa6104762c4f8f7684a99436bc8bb8 | 109ad4f841db06d2a4d3b8134d3e1f37c9e2676e | amy83762100/oop224_ws | /MS2/IOAble.cpp | C++ | cpp | 830 | no_license | /* Citation and Sources...
Final Project Milestone 2
Module: Time
Filename: Time.cpp
Version 1.0
Author Pei-Yi Lin
Revision History
-----------------------------------------------------------
Date Reason
2021/7/9 Preliminary release
-----------------------------------------------------------
I have done all the c... |
4794dec21ffba7988409d54be30f2b11568d9d22 | 14d35a7f4a95d17b9339a04d6af2d2627710845e | hmaqsoodh/youbot_object_tracking | /src/makeitmove.cpp | C++ | cpp | 1,704 | no_license | #include "youbotController.h"
// Ref: http://ibotics.ucsd.edu/trac/stingray/wiki/ROSNodeTutorialC%2B%2B
int main(int argc, char** argv)
{
ros::init(argc, argv, "makeitmove");
ROS_INFO("hello");
ros::NodeHandle n;
YoubotController* yb = new YoubotController();
ros::Subscriber sub_ObjDetect = n.subscribe("objec... |
ea1190d746bc62e4ebdcfa658e977691ebdf3e5b | 8a2a136441dc67749e6055616ad6bcd8d5187ef5 | AntLJ/TestUploadFolder | /SiNDY-u/AnnoICCheck/StdAfx.cpp | C++ | cpp | 931 | no_license | /*
* Copyright (C) INCREMENT P CORP. All Rights Reserved.
*
* THIS SOFTWARE IS PROVIDED BY INCREMENT P CORP., WITHOUT WARRANTY OF
* ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
* WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE
* AND NONINFRINGEMENT.
*
* IN NO EVENT SHAL... |
4165f4ef60bb0205feb3828a49e90a4a8f1c681f | f2d101ee5cbb00119199dfa70687cb9e317b0129 | fbb-git/stealth | /stealth/options/oldoptions.cc | C++ | cc | 1,694 | no_license | #include "options.ih"
void Options::oldOptions() const
{
ostringstream msg;
int nOld = 0;
if (d_arg.option('e'))
{
++nOld;
msg << " `--echo-commands' was discontinued. "
"Use --verbosity 2.\n";
}
bool usedKeepAlive = d_ar... |
63c67c96c77b455c315a61ce68a4fad6d4601d72 | 7ef4a5412c2f874c086fb0af6609b050aa91b8a8 | emilymelzer/flipperServer | /src/entities/game/default_game.cpp | C++ | cpp | 1,415 | permissive | #include "entities/game/game_interface.h"
#include "entities/game/default_game.h"
#include "entities/game/game_result.h"
#include "entities/sensor/sensor_interface.h"
#include "entities/motor_controller_interface.h"
#include "list"
using namespace std;
DefaultGame::DefaultGame(list<ISensor*> sensors, IMotor* motor)... |
9ce634993df46da952b235825cc71b5f9d697500 | 29d3fa2aeb61e00297bfefe645669e84ff2f3ffb | kwitaechong/Cajita | /unit_test/tstArray.hpp | C++ | hpp | 17,849 | permissive | /****************************************************************************
* Copyright (c) 2019 by the Cajita authors *
* All rights reserved. *
* *
* This ... |
d96b1036b44b986886a92e037e5e0c067835107e | dbb7190ccb8b2eb068d778e4e6122ec48699c141 | pavel-paulau/kv_engine | /engines/ep/src/ephemeral_vb.cc | C++ | cc | 24,326 | permissive | /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/*
* Copyright 2017 Couchbase, Inc
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* h... |
352f097ba68773244c8911de8c9ac0976d9c7dca | 5b9335b3362eaa57439e527d288aaf7baad39995 | xyuan/fuchsia | /src/lib/fsl/io/device_watcher.cc | C++ | cc | 4,445 | permissive | // Copyright 2016 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/lib/fsl/io/device_watcher.h"
#include <dirent.h>
#include <fcntl.h>
#include <fuchsia/io/c/fidl.h>
#include <lib/async/default.h>
#include <... |
554d8ecf4d675b2b5ce4b266753071537a8e7512 | 7ddbfa496271e4405246f97f7f47638d7b385fd4 | Vaa3D/vaa3d_tools | /released_plugins/v3d_plugins/neurontracing_neutube/src_neutube/neurolabi/gui/ext/boost/spirit/home/qi/stream/detail/iterator_source.hpp | C++ | hpp | 2,746 | permissive | /*=============================================================================
Copyright (c) 2001-2011 Hartmut Kaiser
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=========================================... |
c1d15e33c87a5d2599e011cacdf354f725e2a84b | 5d7b4210f50a35f80d3a28fabd4972168520e32e | nerdooit/chromium | /chrome/browser/web_applications/web_app_install_task.cc | C++ | cc | 28,567 | permissive | // Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <utility>
#include "chrome/browser/web_applications/web_app_install_task.h"
#include "base/bind.h"
#include "base/callback.h"
#include "base/lo... |
9dc7818e22638d0a2153ff908c8f08ec3aa3fe54 | f544a442a2e9dcf59c8bfb6da19cdec06bfa4019 | overtalk/ARK | /src/plugin/kernel/src/AFCClassMetaModule.cpp | C++ | cpp | 9,385 | permissive | /*
* This source file is part of ARK
* For the latest info, see https://github.com/ArkNX
*
* Copyright (c) 2013-2019 ArkNX authors.
*
* 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
*
... |
5e02833cc1a90d2a9c3935cf5c9374bb8201c2db | 3bb91ad53191313c60fbfafc05a4fc4899e39228 | suyuti/pax_terminal | /Files/Batch.cpp | C++ | cpp | 3,945 | no_license | // Batch.cpp: implementation of the CBatch class.
//
//////////////////////////////////////////////////////////////////////
#include "Batch.h"
#include "..\Util\NumFuncs.h"
#include "..\Trnx\TrnxFactory.h"
//--------------------------------------------------------------------------------------------------
CBatch::CB... |
842e75948857482533ae9b43db0544d3411b1da5 | 6b5d0ed7ad389084e408d757a742839583ac9536 | templeblock/geneticAlgorithm_experiment | /emscripten/bullet/src/States/State_Main.cpp | C++ | cpp | 7,759 | no_license |
#include "State_Main.hpp"
#include "Logic/Data.hpp"
// #include <chrono>
#include <ctime>
#include <iostream>
State_Main::State_Main()
{
}
State_Main::~State_Main()
{
}
//
void State_Main::handleEvent(const SDL_Event& event)
{
auto& keys = Data::get()->m_input.keys;
switch (event.type)
{
case S... |
5f66214df9717dd189ba806d6d1ffe03ff146c8e | 608cd9cab8979694f133dc36dcfce21a874e41c9 | StephanGarbin/Denoiser | /Denoiser/BM3DImageBlockProcessorFunctions.cpp | C++ | cpp | 1,520 | no_license | #include "BM3DImageBlockProcessorFunctions.h"
#include "ImageBlockProcessor.h"
#include "ImageBlockProcessorFunctions.h"
namespace Denoise
{
void computeBlockMatching(Image* image, const BM3DSettings& settings,
const ImagePatch& templatePatch, const Rectangle& imageBlock,
std::vector<std::vector<IDX2> >& matchedB... |
4f76dde6800843b85a2ae5591370f315c00cd2c3 | 73e2658fcc19e84c27f15ead1ac6876ddfc87797 | mitchelpederson/SpecialTopics | /Engine/Code/Engine/Core/StringUtils.hpp | C++ | hpp | 506 | no_license | #pragma once
//-----------------------------------------------------------------------------------------------
#include <string>
#include <vector>
//-----------------------------------------------------------------------------------------------
const std::string Stringf( const char* format, ... );
const std::string St... |
1bcccf117efaf6e75061f3d4eac079609a792565 | a04707d8587a4c8d82bcc3119cd36d019c6d6604 | dhansen17/Hospital-Sim | /Hospital Sim/Source.cpp | C++ | cpp | 342 | no_license | #include<iostream>
#include<string>
#include"Simulator.h"
using namespace std;
//having problems with seeing the hospital class if we saw that then the program should run effectively, and knowing my luck, we are probly not seeing it because I am really bad at spelling
int main()
{
Simulator sim;
sim.showS... |
f8ff89bbe278cd04250453bc756c41e73260f926 | 40ab579e020b0b154271835e8b694add0fc8faec | ghuntley/coreclr | /src/zap/zapinfo.cpp | C++ | cpp | 126,586 | permissive | // Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
//
// ZapInfo.cpp
//
//
// JIT-EE interface for zapping
//
// =====================================================... |
ba5b7891a84301e9c3a7d4aa4b03dcab9f215987 | dd37e5b31ee6790331662d6bc5af24753eaf721b | bobismijnnaam/fuzzy-path | /Gamestate.cpp | C++ | cpp | 1,699 | permissive | // Author: Bob Rubbens - Knights of the Compiler
// Creation date: 17-12-13
// Contact: http://knightsofthecompiler.wordpress.com - @broervanlisa - gmail (bobrubbens)
// Includes I didn't make myself
// Includes I did make myself
#include "gamestate.hpp"
#include "Game.hpp"
#include "Menu.hpp"
GameMan::GameMan(Game... |
3c9d4f277225447707a7e2b7d6dcda58c2d40f17 | 9f59b9a73ec3105e95f59a83469aab2c95d8feeb | jyqiu1216/Rino | /ProgramForClient/RhinoClientCode/eventPLclent/WJPlatformLogic.cpp | C++ | cpp | 30,416 | permissive | #include "WJPlatformLogic.h"
#include "common/clientconfig.h"
#include "message\WJNetPlatformMessage.h"
#include "common\WJUserInfoBaseStruct.h"
#include "message\WJNetPM_gamelist.h"
#include "web\WJMainWindow.h"
#include "websocket\WebSocketServer.h"
#include "clientsocket/commonfunction_c.h"
#include "DataDrocessing... |
0f1d883d15a542e8d60cd4175bb1c66506a73e1d | 58d120b8ea07988a6e7ce5fc43066083e5c6c78f | root-jeong/BOJ | /~9999/7658_덩치.cpp | C++ | cpp | 667 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<pair<int, int>> vec;
vector<pair<int, int>> tmp_vec;
bool compare(pair<int, int> a, pair<int, int> b) {
return a.first > b.first;
}
int main() {
int N, data1, data2;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> data1 >> data2... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.