blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 3 264 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 5 140 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 986
values | visit_date timestamp[us] | revision_date timestamp[us] | committer_date timestamp[us] | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 23
values | gha_event_created_at timestamp[us] | gha_created_at timestamp[us] | gha_language stringclasses 145
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 3 10.4M | extension stringclasses 122
values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
11577ad95fc97ee7f598fa7e41e04180b76eed27 | c352686a94150e2c25a2e8c925ade7f9ea29f458 | /Functions.cpp | 5de56803a796514866ce9d125c456f16fabe5bbd | [] | no_license | Matin-Modarresi/CAR_opengl | b7ac3e4442f8f4705b306710091e9def5122a6b9 | 9982c5be7afa8f1a3fce184498663bf5f64318b5 | refs/heads/master | 2023-01-29T22:26:49.936199 | 2020-12-12T19:30:13 | 2020-12-12T19:30:13 | 320,877,083 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,705 | cpp | #include <gl/glut.h>
#include "Functions.h"
#include <math.h>
static GLfloat start[100] ;
static GLfloat color_r[100] , color_g[100] , color_b[100];
static GLint count = 0 , turn = 0;
GLboolean r_check = true, g_check = true , b_check = true;
void init()
{
glClearColor(0.0, 1.0, 1.0, 0.3);
glMatrixMode(GL_PROJEC... | [
"58595108+Matin-Modarresi@users.noreply.github.com"
] | 58595108+Matin-Modarresi@users.noreply.github.com |
33d1678afc6f4140a8881e66ef0603372411be69 | c766bece263e5149d0dbab04ea20308bf1191ab8 | /AdobeInDesignCCProductsSDK.2020/source/open/interfaces/interactive/ISetCalcOrderCmdData.h | d4495460799190b598e93ea6df3a04e1dddcd46d | [] | no_license | stevenstong/adobe-tools | 37a36868619db90984d5303187305c9da1e024f7 | c74d61d882363a91da4938fd525b97f83084cb2e | refs/heads/master | 2022-04-08T17:31:35.516938 | 2020-03-18T20:57:40 | 2020-03-18T20:57:40 | 248,061,036 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,674 | h | //========================================================================================
//
// $File: //depot/devtech/15.0/plugin/source/open/interfaces/interactive/ISetCalcOrderCmdData.h $
//
// Owner: Tim Wright
//
// $Author: pmbuilder $
//
// $DateTime: 2019/10/11 10:48:01 $
//
// $Revision: #2 $
/... | [
"steven.tong@hcl.com"
] | steven.tong@hcl.com |
8124a1c91d4a3d9d4539a3c7d4639bbef7534310 | 7582fab5029dc0dbee24478827f20110d4dad256 | /IDP-denovo.20160829/files/src/extension2Cluster.cpp | 2222728fc28e402e7a0de86c3fed480d11396d34 | [] | no_license | zujun/zujun.github.io | c32bf8e41fcb838abeb8a27af757f90f31d6d77e | ad474a14bd5d9342f2e8ab52e34a364cf3bab354 | refs/heads/master | 2021-08-11T04:34:40.818730 | 2020-04-07T03:31:17 | 2020-04-07T03:31:17 | 150,128,451 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 10,052 | cpp | //form cluster from extensionOutput
#include <string>
#include <stdio.h>
#include <assert.h>
#include <iostream>
#include <algorithm>
#include <fstream>
#include <map>
#include <tr1/unordered_map>
#include <vector>
#include <set>
#include <numeric>
#include <cmath>
#include <unistd.h>
#include <boost/lexical_cast.hpp>
... | [
"noreply@github.com"
] | zujun.noreply@github.com |
f38270c740adb3de9c998e17d65dcfa6a1e49963 | a7d3fb43616693df9735ab0ef89fca55b12e4ce9 | /ch2_LinerList/StaticList/StaticList.h | 0b3cd1c659f492b707befb8ed91410cc08535e00 | [] | no_license | LeeWoden/DataStructure | e8243ffeb6e56c2959004d0041540b59271de9c5 | c89dd297e497a9f8117701c8a7dec19b8e35f8a1 | refs/heads/master | 2021-01-10T18:49:17.602139 | 2015-10-24T12:37:56 | 2015-10-24T12:37:56 | 41,776,865 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,261 | h | #ifndef STATICLIST_H
#define STATICLIST_H
#include <iostream>
#include <cassert>
using namespace std;
const int defaultSize = 100;
template <typename T>
struct SLinkNode
{
T data;
int link;
};
template <typename T>
class StaticList
{
public:
StaticList(int sz = defaultSize);
~StaticList();
bool IsEmpty() ... | [
"2012641398@qq.com"
] | 2012641398@qq.com |
cff1ce364f5ccc0a586ebbd521e5da972cac1a9f | 320bb18cb0d4d458cc47133c18dd31a7e4e5a1e4 | /App.hpp | 9179512dd6e62f758e0465f23d3c1ac9303c0661 | [] | no_license | full-confession/solar-system | 830022c993381efa5a40a74c7c4b0aecb0d8d7fd | dbc29d1238deebdc7550f6a245946732b8619f05 | refs/heads/main | 2023-01-09T01:11:42.551497 | 2020-11-05T16:35:53 | 2020-11-05T16:35:53 | 310,347,492 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,234 | hpp | #pragma once
#include "SolarSystem/Transform.hpp"
#include "SolarSystem/Orbit.hpp"
#include "SolarSystem/Window.hpp"
#include "SolarSystem/Graphics.hpp"
#include "SolarSystem/Renderer.hpp"
#include <fstream>
#include <iostream>
#include <chrono>
class App final
{
public:
App(int const width, int c... | [
"noreply@github.com"
] | full-confession.noreply@github.com |
0142c283c27910c71c84e2abf3ed4bba287084db | f3cd44b3e43f26ea1119b114d19fbb12aeefd34a | /rlapjv.h | 1334bcfd5b43a68ea8521d041b84e0b508d21563 | [] | no_license | feiran-l/rlapjv | 487a2116b90f4a27402a7237c5be4e8561c244e1 | 9e7f0453b320d1ed8cffd32eb1eb77d5bd8f66bb | refs/heads/master | 2023-09-03T04:52:58.335057 | 2018-08-17T04:49:29 | 2018-08-17T04:49:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 16,222 | h | #include <cassert>
#include <cstdio>
#include <limits>
#include <memory>
#ifdef __GNUC__
#define always_inline __attribute__((always_inline)) inline
#define restrict __restrict__
#elif _WIN32
#define always_inline __forceinline
#define restrict __restrict
#else
#define always_inline inline
#define restrict
#endif
tem... | [
"clementlfang@gmail.com"
] | clementlfang@gmail.com |
48a327f0b72614c1b9c5233564beeaa184242cec | 7dfa1cd5cb516f609e74b2df92a76ce7300d1f1b | /quadruped_ctrl/src/Utilities/Interpolation.h | a61e06874e254101cf68f65f8bc99249fd65ae05 | [
"MIT"
] | permissive | SiChiTong/mini_cheetah_pybullet | 34004f3a61365bc55348e4594b384d60faac4a5d | e54cda91d77ccfdd1398eb37aa8f1ad8e56ace1d | refs/heads/main | 2023-01-07T16:51:04.630198 | 2020-11-09T08:25:54 | 2020-11-09T08:25:54 | 312,715,919 | 1 | 0 | MIT | 2020-11-14T00:38:57 | 2020-11-14T00:38:57 | null | UTF-8 | C++ | false | false | 2,095 | h | /*! @file Interpolation.h
* @brief Utility functions to interpolate between two values
*
*/
#ifndef PROJECT_INTERPOLATION_H
#define PROJECT_INTERPOLATION_H
#include <assert.h>
#include <type_traits>
namespace Interpolate {
/*!
* Linear interpolation between y0 and yf. x is between 0 and 1 Y在y0到yf之间进行线性插值， X为... | [
"noreply@github.com"
] | SiChiTong.noreply@github.com |
923e8f05af80179a188d994c968d60f610422240 | c1c23d2426a14ce76f343b2cfc77ac498ae0e88e | /cpp/main.cpp | 719ee47dd136e5ed344688e72fd924105b30609b | [] | no_license | charlesoconor/Interview_workspace | a01da760d1c945418bf66e4d535d508a6350c777 | ea10dd39f3ccaeb821e02802afbf25502d6e6a7b | refs/heads/master | 2021-08-07T06:39:45.451678 | 2017-11-07T18:48:54 | 2017-11-07T18:48:54 | 105,921,784 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,271 | cpp | /*
* main.cpp
* Copyright (C) 2017-10-04 17:11 charlesoconor <coconor@umich.edu>
*
*
*/
// description: https://leetcode.com/problems/the-skyline-problem/description/
#include <iostream>
#include <vector>
#include <tuple>
#include <algorithm> // std::sort
#include <queue> // std::priority_queue
#includ... | [
"charlie@dwnld.me"
] | charlie@dwnld.me |
468510c0566ba9630ef407c45b2fdb5b22f2bf95 | aaefcb0efdb5c0b59d4c3008723949d66d28ddd9 | /Com'O/Com'O IPST 1 2016/Problems/o56_oct_c1_dnachains/o56_oct_c1_dnachains.cpp | 48f660c4ce03e17a186bc52b5271873436616194 | [] | no_license | UtopiaBeam/competitive | cb80aaee773e215eab68f172c173e2ec857b90ff | bf445ecb56c80b35fa915ca7bf0925d398a9c4d7 | refs/heads/master | 2020-03-28T20:25:33.124594 | 2019-10-19T03:43:20 | 2019-10-19T03:43:20 | 149,068,875 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,485 | cpp | #include<cstdio>
#include<utility>
#define P pair<int,int>
#define F first
#define S second
using namespace std;
int l,n,m,b[100002],nw=1,lim=1;
char ch;
P a[100002];
int main(){
scanf("%d %d",&l,&n);
while(l--){
scanf("%d",&m);
for(int i=lim;i<m+lim-1;i++)
a[i].S=i+1,a... | [
"utopiabeam@gmail.com"
] | utopiabeam@gmail.com |
01b6aff62ac231af973134ab7590162138547619 | 821fc64a9205f0aa1dc0a4764111fdc80347ad18 | /Final/nclgl/Plane.h | b78ae139b143eac4103868fc8beae79549f85c0f | [] | no_license | kostasEf/Graphics-Engine-Coursework-OpenGL | 5ed729418314ffcf1f8190e698b1cd82b7b02dd3 | 324b587c31c62e7dc68210c7f3b1078ef3bd200f | refs/heads/master | 2020-05-17T03:28:22.821593 | 2015-02-06T23:31:04 | 2015-02-06T23:31:04 | 30,437,588 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 515 | h | #pragma once
#include "vector3.h"
class Plane {
public:
Plane(void){};
Plane(const Vector3 & normal, float distance, bool normalise = false);
~Plane(void){};
void SetNormal(const Vector3 & normal) { this -> normal = normal; }
Vector3 GetNormal() const { return normal; }
void SetDistance(float dist) ... | [
"efthimiou.kostas@gmail.com"
] | efthimiou.kostas@gmail.com |
90b9c1d90d1a27371c4d026f50afe451b75dd4e0 | 9f5fbe4e5c1370eb1a30377a2b7ef536ce58a299 | /Codeforces/CF554-D2-C.cpp | 7944697ac68e7aa24582d4b00f42fbfce4c04de1 | [] | no_license | hosamk92/CompetitiveProgramming | 3ed6b3293e992b68abe52b144b4eb3d98156d2dd | a860966241bb30dfa3d07cab51d2a28e242fd553 | refs/heads/master | 2021-09-11T13:30:40.243770 | 2018-04-07T23:01:49 | 2018-04-07T23:01:49 | 111,594,958 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,301 | cpp | #include <bits/stdc++.h>
#include <fstream>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
double Fib(double x,double z);
string BinDec(ull x);
string StringInt(ll x);
ull StringInt(string x);
ull BinDec (string x);
ull POWMOD (ull x,ull y,ull mod);
ull POWE(long l... | [
"noreply@github.com"
] | hosamk92.noreply@github.com |
b9ad4aa19e3c336a01c4e69145b3e1d8ef6b08d7 | 9bab169b128b891d1b099b516b908b7eac44d25b | /src/channel.cpp | 46980bd65c8c065b4bd3ab28e419f78f43b00890 | [
"MIT"
] | permissive | yinlei/tengine | f5b49f4c6603fa512c220ad1612fbe66a9aa7fc5 | 9ecbb0699675717fc2ad6bfd1f51338e42814dd4 | refs/heads/master | 2021-01-13T05:47:38.858569 | 2017-03-21T13:21:56 | 2017-03-21T13:21:56 | 76,639,337 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 10,245 | cpp | #include "channel.hpp"
#include "context.hpp"
#include "service.hpp"
#include "executor.hpp"
#include "dispatch.hpp"
#include "asio/ts/executor.hpp"
#include <iostream>
namespace tengine
{
constexpr int Channel::CHANNEL_KEY;
Channel::Channel(Service *s)
: ServiceProxy(s)
, io_service_(s->context().net_execut... | [
"yinl@uc888.cn"
] | yinl@uc888.cn |
909dfa31c6f858216a6083c2c287f6b69a3972ca | aabfe137db175f0e070bd9342e6346ae65e2be32 | /HLTriggerOffline/Higgs/src/MatchStruct.cc | 301dc402faa0ce125fcbc0955097c10bc35f8ab0 | [] | no_license | matteosan1/cmssw | e67b77be5d03e826afd36a9ec5a6dc1b3ee57deb | 74f7c9a4cf24913e2a9f4e6805bb2e8e25ab7d52 | refs/heads/CMSSW_7_0_X | 2021-01-15T18:35:33.405650 | 2013-07-30T14:59:30 | 2013-07-30T14:59:30 | 11,789,054 | 1 | 1 | null | 2016-04-03T13:48:46 | 2013-07-31T11:06:26 | C++ | UTF-8 | C++ | false | false | 1,568 | cc | #ifndef HLTRIGGEROFFLINE_HIGGS_MATCHSTRUCT_CC
#define HLTRIGGEROFFLINE_HIGGS_MATCHSTRUCT_CC
/** \class MatchStruct
* Generate histograms for trigger efficiencies Higgs related
* Documentation available on the CMS TWiki:
* https://twiki.cern.ch/twiki/bin/view/CMS/HiggsWGHLTValidate
*
* $Date: 2012/03/16 01:55:... | [
"sha1-1a33c55770b799fa34daa19f0e589ad609c408a5@cern.ch"
] | sha1-1a33c55770b799fa34daa19f0e589ad609c408a5@cern.ch |
6eb9bb98dab3d8f7c2fa9efc275a09041dad7746 | c35f8770532ff771b011275c7327001fe2cce8a7 | /ABC/003/C.cpp | 578990ab86ce419a34049337d8c1fc54c42b0cf8 | [
"MIT"
] | permissive | 0uts1de-v/AtCoder-Solved | b3b13ad7c78a0e4d4a669100689d6c90a0c8ddf3 | 7b7b6c53332881e550aaa0755f298fcdeae3824a | refs/heads/master | 2023-06-26T10:49:22.536066 | 2021-05-02T13:38:50 | 2021-05-02T13:38:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 505 | cpp | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <ios>
#include <iomanip>
using namespace std;
int main() {
double ans = 0;
unsigned int n, k;
cin >> n >> k;
vector<unsigned int> r(n);
for (int i = 0; i < n; ++i) {
... | [
"975side@gmail.com"
] | 975side@gmail.com |
66a0d00c1197e79cdf31adeb3041d3b4533f502b | 4968a1d097076e1d37868af3ef3f0383ddfc8ae6 | /Ghidra9/flow.cc | 9170ee9987111b6081e52d50b406d3256bf584ef | [
"MIT"
] | permissive | inno157/GhidraDec | 433645ffab3aef8b5496de7ce99144820011477d | 2b19542ee38d837bae00b7db1b5aacde6d9c8608 | refs/heads/master | 2023-07-12T10:04:40.876495 | 2021-08-19T19:52:40 | 2021-08-19T19:52:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 47,785 | cc | /* ###
* IP: GHIDRA
*
* 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 agreed to in writin... | [
"gregory.morse@live.com"
] | gregory.morse@live.com |
2024563c090fc672a26e12e6d42bd010b394c8ff | ee450f23d084d56d1300c61a6dd53020449bce23 | /src/Subsystems/Claw.cpp | dbdec9b73ff03e46d71295f0f1879740c29af534 | [] | no_license | tpankaj/Team-3341-Recycle-Rush | 76c1295aca94ff3d8fd0a7ea83199bde19cde7a4 | 9760400b5f9b0193056421dd9b152157110fb54f | refs/heads/master | 2021-01-16T21:02:37.688788 | 2015-03-01T05:59:36 | 2015-03-01T05:59:36 | 30,787,907 | 0 | 0 | null | 2015-02-14T05:17:50 | 2015-02-14T05:17:50 | null | UTF-8 | C++ | false | false | 526 | cpp | #include "Claw.h"
#include "../RobotMap.h"
Claw::Claw() :
Subsystem("Claw"), left(new Jaguar(CLAW_LEFT)), right(new Jaguar(CLAW_RIGHT))
{
}
void Claw::stop(){
left->Set(0);
right->Set(0);
}
void Claw::open(){
left->Set(.3);
right->Set(-.3);
}
void Claw::close(){
left->Set(-.3);
right->Set(.3);
}
void Cla... | [
"prem1835213@gmail.com"
] | prem1835213@gmail.com |
24b601bac5d09774814bae5e3e4f352cdc438849 | a4f0fbef5e388523aa2c853083fbfb6261f57b08 | /Position.cpp | a203356ea2dd2194140c67f47b32c6945867e8b9 | [] | no_license | TomerBenda/MagshiChess | d0a8092cf3ef5291a7bb8f1c4a557fc31cd4c89b | 9f97ec2323778c02eaf0961555999cdfd5e130ea | refs/heads/master | 2021-08-28T09:30:44.498008 | 2017-12-11T21:19:11 | 2017-12-11T21:19:11 | 112,758,441 | 1 | 1 | null | 2017-12-11T21:19:12 | 2017-12-01T15:58:15 | C++ | UTF-8 | C++ | false | false | 941 | cpp | #include "Position.h"
Position::Position(char letter, int number)
{
if ('a' > letter || 'h' < letter || number > 8 || number <= 0)
throw std::invalid_argument("Error: Position index out of range");
_letter = letter;
_number = number - 1;
}
Position::Position(int index)
{
_number = SIDE_LEN - (in... | [
"noreply@github.com"
] | TomerBenda.noreply@github.com |
9fb07792521ead718de7e957d72d48daacff318b | b6f00cf30e091b7d6734a44e359b20dbf5d10927 | /Source/FPSTest/RoboEyes.h | fd59b1221e75e5661331b89b81380d8c7cbd99f7 | [] | no_license | michbr/Test | 619e73a92e6af6b3a4f943dc7629890ee2105cbf | b56888c35ff28c3c702cb13965ec1114f6d46583 | refs/heads/master | 2021-01-25T08:38:30.406187 | 2015-06-26T02:47:32 | 2015-06-26T02:47:32 | 32,638,467 | 0 | 0 | null | 2018-01-02T16:04:27 | 2015-03-21T15:52:52 | C++ | UTF-8 | C++ | false | false | 851 | h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include <list>
#include <unordered_map>
#include "PointOfInterest.h"
#include "AbstractRobotComponent.h"
#include "RoboEyes.generated.h"
/**
*
*/
UCLASS(ClassGroup = RobotComponents, meta = (BlueprintSpawnable... | [
"bmichaud45@gmail.com"
] | bmichaud45@gmail.com |
25a1097c0e9fa3e243f222a445736d53a31f8282 | d3ca1afd18ba95f70940b948a745d78893caad80 | /StepperMotorTester.ino | 68f487542965eeb9c14522fa391687b8d4fb7bef | [
"MIT"
] | permissive | CheapskateProjects/StepperMotorTester | 2f7ebcfc403d288e95704518b755e55549871178 | 6d1f0e33d234735a4c12c5c9be2bbbde180ee1d6 | refs/heads/master | 2021-01-20T14:03:19.335039 | 2017-05-07T18:43:35 | 2017-05-07T18:43:35 | 90,553,783 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,067 | ino | /*
Stepper motor tester
This project uses Arduino and easy driver board to test stepper motors.
Stepper motor is connected to the easy driver and 3 position (on/off/on) momentary toggle switch is used to control direction through Arduino.
Connections:
pin2 -> toggle switch
pin3 -> toggle switch
pin8 -... | [
"cheapskateprojects@gmail.com"
] | cheapskateprojects@gmail.com |
77093de7296023b4cbc157df52dde6117faaf419 | 834914c7d35a49e651a94c0a5ccfcea201f42451 | /quench.h | 4f42c642eeba686189c2b6c2f46625a43afb8f37 | [] | no_license | jtdeckman/LJ-NPT | 8232d2357ca02037f89a9c44a1da93175aeb2da5 | e432ae85472f2aa607d1b4de4a249c82d9b3ee43 | refs/heads/master | 2021-01-11T16:53:25.562377 | 2017-01-22T04:29:13 | 2017-01-22T04:29:13 | 79,693,148 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,833 | h | #include <cmath>
#define SIGN(a,b) ((b) > 0.0 ? fabs(a) : -fabs(a))
#define SHFT(a,b,c,d) (a)=(b);(b)=(c);(c)=(d);
#define MAX(a,b) ((a) > (b) ? (a) : (b))
typedef unsigned int uint;
class Optim {
int ITMAX;
static const int ITMAXB=100;
static const int TOO_MANY_ITERATIONS=4;
static const double EPS=... | [
"jasondeckman@jasons-imac.attlocal.net"
] | jasondeckman@jasons-imac.attlocal.net |
2e0b225b2a1c15471bf51872a50ab9a47e25d49a | c51febc209233a9160f41913d895415704d2391f | /YorozuyaGSLib/source/_worlddb_potion_delay_infoDetail.cpp | f0053e37de823739af1b9cc00c8b56d57d7b420f | [
"MIT"
] | permissive | roussukke/Yorozuya | 81f81e5e759ecae02c793e65d6c3acc504091bc3 | d9a44592b0714da1aebf492b64fdcb3fa072afe5 | refs/heads/master | 2023-07-08T03:23:00.584855 | 2023-06-29T08:20:25 | 2023-06-29T08:20:25 | 463,330,454 | 0 | 0 | MIT | 2022-02-24T23:15:01 | 2022-02-24T23:15:00 | null | UTF-8 | C++ | false | false | 1,430 | cpp | #include <_worlddb_potion_delay_infoDetail.hpp>
#include <common/ATFCore.hpp>
START_ATF_NAMESPACE
namespace Detail
{
Info::_worlddb_potion_delay_infoctor__worlddb_potion_delay_info2_ptr _worlddb_potion_delay_infoctor__worlddb_potion_delay_info2_next(nullptr);
Info::_worlddb_potion_del... | [
"b1ll.cipher@yandex.ru"
] | b1ll.cipher@yandex.ru |
4af6b587d0fbbd47eb56b178a54dff195205c618 | 8fa5521679cf0cb3c558240085e605a93486cfc6 | /utilities/rosserial/rosserial_server/include/rosserial_server/topic_handlers.h | d73507a7ec33139152d1d115c655694ebe882ca1 | [
"MIT"
] | permissive | mrsd16teamd/loco_car | 3c89e1f13af7810c293f4589d959ce371e6a969a | 36e4ed685f9463ad689ca72eec80e0f05f1ad66c | refs/heads/master | 2021-05-03T23:55:45.176412 | 2020-11-24T16:41:02 | 2020-11-24T16:41:02 | 71,826,846 | 52 | 23 | null | null | null | null | UTF-8 | C++ | false | false | 11,901 | h | /**
*
* \file
* \brief Classes which manage the Publish and Subscribe relationships
* that a Session has with its client.
* \author Mike Purvis <mpurvis@clearpathrobotics.com>
* \copyright Copyright (c) 2013, Clearpath Robotics, Inc.
*
* Redistribution and use in source and binary for... | [
"kazuotani14@gmail.com"
] | kazuotani14@gmail.com |
1d9678700b133d3b121651a1abf0b5fb81e5ac1e | 2f557f60fc609c03fbb42badf2c4f41ef2e60227 | /CondFormats/L1TObjects/src/L1GtBoardMaps.cc | e6f57338674c83fc5a2fd39690265d1efb1bbd0c | [
"Apache-2.0"
] | permissive | CMS-TMTT/cmssw | 91d70fc40a7110832a2ceb2dc08c15b5a299bd3b | 80cb3a25c0d63594fe6455b837f7c3cbe3cf42d7 | refs/heads/TMTT_1060 | 2020-03-24T07:49:39.440996 | 2020-03-04T17:21:36 | 2020-03-04T17:21:36 | 142,576,342 | 3 | 5 | Apache-2.0 | 2019-12-05T21:16:34 | 2018-07-27T12:48:13 | C++ | UTF-8 | C++ | false | false | 9,928 | cc | /**
* \class L1GtBoardMaps
*
*
* Description: map of the L1 GT boards.
*
* Implementation:
* <TODO: enter implementation details>
*
* \author: Vasile Mihai Ghete - HEPHY Vienna
*
* $Date$
* $Revision$
*
*/
// this class header
#include "CondFormats/L1TObjects/interface/L1GtBoardMaps.h"
// system incl... | [
"giulio.eulisse@gmail.com"
] | giulio.eulisse@gmail.com |
20c8f03e4bdc3033e752a83743fbe9a939b1a84a | 16d5bf42163389cd5aec3f4e2d0fa455a3240bff | /TP3 - Simulated Annealing and Parallel Tempering/src/exmath.hpp | 339ff8bd77f98a339fbdf5a660a6b7df938d128c | [] | no_license | Mandarancio/Metaheuristic | 59b193777e951c8452c52c20f67a6d49493ef702 | 959378b76b19e2ec8074bd271d6b4c37e2c34f10 | refs/heads/master | 2021-01-11T01:21:00.490092 | 2017-03-14T11:02:05 | 2017-03-14T11:02:05 | 70,720,263 | 0 | 0 | null | 2016-11-28T11:38:02 | 2016-10-12T16:41:27 | Tcl | UTF-8 | C++ | false | false | 484 | hpp | #ifndef MATH_H
#define MATH_H
#include <vector>
namespace math{
double gaussian(double alpha, double mu, double sigma, double x);
double mean(std::vector<double> vals);
double sigma(std::vector<double> vals, double mean);
std::vector<double> lin_space(double min, double max, int N=100);
std::vector<double> st... | [
"martino@localhost.localdomain"
] | martino@localhost.localdomain |
5d8ddda9d56ec81f6b99392040a7a9441cbb8ca9 | 154f0239730a906a08c257fd1ef8dff9a17f4ef5 | /oneCluster/main.cpp | 1fd630b4e06d13539b1cfa544d6ee345f870dcf2 | [] | no_license | EPodesta/Mppa | ded1238ab7cfb10a31c12a03f6f326665667a2ec | 04f403077c6e0199af866bee4dbdfb5feb98dbd9 | refs/heads/master | 2021-01-10T17:09:44.075548 | 2015-11-26T01:50:36 | 2015-11-26T01:50:36 | 46,896,040 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 282 | cpp | #include <assert.h>
#include <stdio.h>
#include <stdint.h>
#include <mppaipc.h>
#include <mppa/osconfig.h>
int main(int argc, char **argv){
char *args[1];
args[0] = NULL;
int pid = mppa_spawn(0, NULL, "slave", (const char**)args, NULL);
mppa_waitpid(pid, NULL, 0);
return 0;
}
| [
"epodesta158@gmail.com"
] | epodesta158@gmail.com |
51311c025ca4a867b41b1474fc51cdf73ce7553e | c5843992e233b92e90b53bd8a90a9e68bfc1f6d6 | /code/casaqt/apps/casaplotserver/casaplotserver.cc | adcca744f254e470f4863dc752367f60f5f5f0d7 | [] | no_license | pkgw/casa | 17662807d3f9b5c6b57bf3e36de3b804e202c8d3 | 0f676fa7b080a9815a0b57567fd4e16cfb69782d | refs/heads/master | 2021-09-25T18:06:54.510905 | 2017-08-16T21:53:54 | 2017-08-16T21:53:54 | 100,752,745 | 2 | 1 | null | 2020-02-24T18:50:59 | 2017-08-18T21:51:10 | C++ | UTF-8 | C++ | false | false | 1,885 | cc | #include <signal.h>
#include <math.h>
#include <QApplication>
#include <casaqt/QtPlotServer/QtPlotServer.qo.h>
#include <casaqt/QtPlotServer/QtPlotSvrPanel.qo.h>
static void preprocess_args( int argc, const char *argv[], int &numargs, char **&args,
char *&dbus_name, bool &casapy_start );
int main( int argc, c... | [
"srankin@nrao.edu"
] | srankin@nrao.edu |
4be4c984448069462a2a069f840ca54a4a7d6186 | fff9c2e019113a9fb146d3d7c169846e320733db | /OM/Debug/moc/moc_RelayControl.cpp | 3b7a5c361bff5dcc6af0d1556dd6612251aad08f | [] | no_license | lllliiiiran/OM | c186f345ff9f78cca55a9ac7a467deef9183464c | 379f1d50d26c0a1c58d6c4dc695d5745164fadea | refs/heads/master | 2022-11-10T19:55:22.956160 | 2020-07-08T03:54:00 | 2020-07-08T03:54:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 18,275 | cpp | /****************************************************************************
** Meta object code from reading C++ file 'RelayControl.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.15.0)
**
** WARNING! All changes made in this file will be lost!
*******************************************************... | [
"1406939971@qq.com"
] | 1406939971@qq.com |
1182133d17dd22a0258c3a8cfad91bcbc9875040 | 241051c1e58e66d8ccee01eb592aa89eca3ef055 | /hw5/VisualStudioSDLProject/SDLProject/Scene.h | 0149076451b8bb573c051a286709dfaebe2b604b | [] | no_license | yw3602/CS-UY3113GameEngineering | 53a7ea1c9664c7f3ce55d149b2bc14801dc2c03d | f0d04174c1f9ee69665bc41fe767a6695dcfcf63 | refs/heads/main | 2023-04-23T11:20:32.710052 | 2021-05-12T22:26:21 | 2021-05-12T22:26:21 | 341,116,954 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 635 | h | #pragma once
#define GL_SILENCE_DEPRECATION
#ifdef _WINDOWS
#include <GL/glew.h>
#endif
#define GL_GLEXT_PROTOTYPES 1
#include <SDL.h>
#include <SDL_opengl.h>
#include "glm/mat4x4.hpp"
#include "glm/gtc/matrix_transform.hpp"
#include "ShaderProgram.h"
#include "Util.h"
#include "Entity.h"
#include "Map.h"
struct Ga... | [
"yw3602@nyu.edu"
] | yw3602@nyu.edu |
e8fc9d19a63c4b528919cc8b6939fd5c826d7afa | 322b79ad75f1b49705ed29da519ff2885c956177 | /CC060-Algoritmos_Geneticos/Tarea_1/Problema_1/GA_ejercicio01.cpp | 891fa9b1819db233298c4252a3d4fd821b37e4a0 | [] | no_license | fmorenovr/ComputerScience_UNI | 0f53bb0d0836a9b58340289a13d5412cfbf5e6d4 | a8a13dc3ecf9bb8ecdd0d05d8d5ea73a2c44fcff | refs/heads/master | 2023-04-30T15:54:10.898981 | 2023-04-19T16:02:13 | 2023-04-19T16:02:13 | 258,105,694 | 8 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 7,197 | cpp | #include<iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
#define POPSIZE 4 // tamano de population
#define MAXGENS 10 // generaciones
#define NVARS 5 // genes por individuo
#define PXOVER 1 // probabilidad de cruce
#define PMUTATION 0.001 // probabilidad de mutacion
st... | [
"fmorenovr@gmail.com"
] | fmorenovr@gmail.com |
2d825a171a3a47d02d2d03dd36fe4d8b4040a894 | e303f243213c6374bb1ec2fad8e8ed435c19766f | /src/novatel/src/novatel_node.cpp | 3096211a158cd9d6265eee51b8d93220753988a9 | [
"MIT",
"BSD-3-Clause"
] | permissive | CastielLiu/novatel_ws | bcdceadd38de55d3586a8b7685f3185f151bf0f0 | 793f4e51a24489a08ad409a3c93946e3860a5782 | refs/heads/master | 2020-04-28T01:33:41.182676 | 2020-01-08T13:03:11 | 2020-01-08T13:03:11 | 174,861,816 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 36,357 | cpp | /*
* The MIT License (MIT)
* Copyright (c) 2012 William Woodall <wjwwood@gmail.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitatio... | [
"castiel_liu@outlook.com"
] | castiel_liu@outlook.com |
26315db9de756053e304cdb0f9c5847f8c7a567d | d2af2477ac51fca468ea1e311a768dd6eaa30c3a | /super-knowledge-platform/skpClient/skpClient/trunk/src/app/chat/ColoredProgressBar.h | cf2525e9fd528fd4d01847e0912fb111a3de4fd0 | [
"MIT"
] | permissive | yefy/skp | 35f43fe8312a4418ae19e5eb4df08509753f6c5d | a9fafa09eacd6a0a802ea6550efd30ace79e4a4f | refs/heads/master | 2021-01-10T01:06:11.511514 | 2016-04-07T08:15:06 | 2016-04-07T08:15:06 | 54,396,970 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,184 | h | #ifndef COLOREDPROGRESSBAR_H
#define COLOREDPROGRESSBAR_H
#include <QWidget>
#include <QTimer>
#include <QPixmap>
enum
{
ACTION_STATUS_QUEUE,
ACTION_STATUS_UPLOADING,
ACTION_STATUS_PAUSE
};
class ColoredProgressBar : public QWidget
{
Q_OBJECT
public:
explicit ColoredProgressBa... | [
"yefy@localhost.localdomain"
] | yefy@localhost.localdomain |
b2a7651d5d7b15b7fbf224237e699b978d7d41e9 | 02756051239766459be0b537e87043c7c0103304 | /src/external_types.cpp | 6404db669410cf93ed7da72c915ddafd4c1c6ae4 | [
"Apache-2.0"
] | permissive | casek14/cassandra-cpp-driver | 8d0cc84d2b39565606c818181f0e8832d4ad34c4 | ad8e5b713dc8501620c890ba090963bb7b12de69 | refs/heads/master | 2020-04-10T18:02:00.340337 | 2016-06-09T17:19:30 | 2016-06-09T17:19:30 | 161,187,994 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,856 | cpp | /*
Copyright (c) 2014-2016 DataStax
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 agreed to in writing... | [
"michael.penick@datastax.com"
] | michael.penick@datastax.com |
6ea2e677dd1e5a173f2cb09d3ffd3de45c016704 | 418211f8b27352110acd9cd4ef86219af9667740 | /STL/S-06/6.3/6.3b/main.cpp | 67254f26525e8b88e3d3d3c931bc3081683aecf5 | [] | no_license | douglascraigschmidt/CPlusPlus | 4592f09dc6a57a3b00a01fa7d25e02c31105877a | 4b67965f3a41bd99fbad8e8405be3d998fbbe1a2 | refs/heads/master | 2022-08-28T01:28:58.719964 | 2022-07-21T11:50:49 | 2022-07-21T11:50:49 | 251,707,132 | 130 | 81 | null | 2021-05-26T14:35:00 | 2020-03-31T19:16:16 | C++ | UTF-8 | C++ | false | false | 1,278 | cpp | #include <iostream>
#include <iterator>
#include <vector>
using namespace std;
/**
* Here's another example showing how to use a back_insert_iterator to
* add elements to a container rather than overwrite them.
*/
int main() {
vector<int> aVect1 {0, 1, 2, 3, 4}, aVect2;
cout << "Original contents o... | [
"d.schmidt@vanderbilt.edu"
] | d.schmidt@vanderbilt.edu |
a9d7c1b5b5fdeb48040b892acb6208a0cfecccca | 85b9ce4fb88972d9b86dce594ae4fb3acfcd0a4b | /build/Android/Preview/Global Pot/app/src/main/include/Fuse.Controls.Native.Android.Switch.h | f3a1c5cbc1a1ba735602e44339899632f02d6548 | [] | no_license | bgirr/Global-Pot_App | 16431a99e26f1c60dc16223fb388d9fd525cb5fa | c96c5a8fb95acde66fc286bcd9a5cdf160ba8b1b | refs/heads/master | 2021-01-09T06:29:18.255583 | 2017-02-21T23:27:47 | 2017-02-21T23:27:47 | 80,985,681 | 0 | 0 | null | 2017-02-21T23:27:48 | 2017-02-05T10:29:14 | C++ | UTF-8 | C++ | false | false | 1,778 | h | // This file was generated based on C:\Users\EliteBook-User\AppData\Local\Fusetools\Packages\Fuse.Controls.Native\0.44.1\android\$.uno.
// WARNING: Changes might be lost if you edit this file directly.
#pragma once
#include <Fuse.Controls.Native.Android.LeafView.h>
#include <Fuse.Controls.Native.ILeafView.h>
#include ... | [
"girr.benjamin@gmail.com"
] | girr.benjamin@gmail.com |
8336b03bb9ace4af3317254d1c011f3957ff7552 | 49c4e5a0f09da455ccdfd33a76e384e5edea8213 | /src/gmail/GmailCache.h | 8f2cd0795d008d894a34836b45830af7d2961506 | [
"MIT"
] | permissive | osoftteam/googleQt | 31d2736bae4dfb48eae59dbd104901423c9d5b53 | bd73b2569dbc280e3d1fe7c2aaacc458d5188cbb | refs/heads/master | 2022-09-12T00:19:44.167605 | 2022-06-21T00:17:19 | 2022-06-21T00:17:19 | 71,044,253 | 31 | 8 | MIT | 2022-12-10T10:16:00 | 2016-10-16T10:46:49 | C++ | UTF-8 | C++ | false | false | 35,281 | h | #pragma once
#include "google/endpoint/BatchRunner.h"
#include "google/endpoint/Cache.h"
#include "gmail/messages/MessagesRoutes.h"
#include "gmail/threads/ThreadsRoutes.h"
#include "gmail/labels/LabelsLabelResource.h"
#include <QSqlDatabase>
#include <QSqlQuery>
namespace googleQt{
class Endpoint;
class Gmai... | [
"osoft4ardi@gmail.com"
] | osoft4ardi@gmail.com |
58af1bc1cb8054aed7fbcc08559dc898fe0a6813 | 8ae7a23f05805fd71d4be13686cf35d8994762ed | /mame150/src/mess/machine/ti99/ti99defs.h | 58ca38c915939fe2cd91c71efcfc0466a3c75b70 | [] | no_license | cyberkni/276in1JAMMA | fb06ccc6656fb4346808a24beed8977996da91b2 | d1a68172d4f3490cf7f6e7db25d5dfd4cde3bb22 | refs/heads/master | 2021-01-18T09:38:36.974037 | 2013-10-07T18:30:02 | 2013-10-07T18:30:02 | 13,152,960 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,210 | h | /****************************************************************************
Common definitions for TI family
Should be included in each component.
Michael Zapf
*****************************************************************************/
#ifndef __TI99DEFS__
#define __TI99DEFS__
// TI-99... | [
"dan@van.derveer.com"
] | dan@van.derveer.com |
87bbfdaf34a4e55d9b381214c4c766d5ceebcab3 | b03e008d279cba38ed68185dc4718930fe0ad0cc | /ex03/stonks.cpp | 645f496e602318b8abe2ebe38ea9a7a2ff421cfa | [] | no_license | yuuu14/competitve_programming_ss20 | 84c8e7f610cba3076fbc2cb1e6682c8a2c09cafc | 3cfedf9d7c85bf72b801d70fdf65e187a3c5b6f0 | refs/heads/master | 2022-11-06T12:41:51.196199 | 2020-06-23T06:48:22 | 2020-06-23T06:48:22 | 266,693,220 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 916 | cpp | #include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <string>
#include <algorithm>
#include <chrono>
#include <fstream>
#define INPUT cin
using namespace std;
int main() {
fstream file("1.in");
long long num = 0;
INPUT >> num;
long long gain = 0;
multimap<long long, l... | [
"yu.xiao.14@outlook.com"
] | yu.xiao.14@outlook.com |
3a50ced4d293b5ada10260ab32f79d0d52585e5a | b1ec31f5854ee53f371332129ab053a845857aa5 | /C++/Solved/516_LongestPalindromicSubsequence.h | b004da27cf1851277199b5d4df4807639076a985 | [] | no_license | bubbercn/LeetCode | e9c1ec2e6f9260b69f64e63fbd2bf97cf65e3ad7 | 42c19adba8d360059e8159564d7384d662c24e8d | refs/heads/master | 2023-08-31T10:40:06.288845 | 2023-08-26T13:55:55 | 2023-08-26T13:55:55 | 56,971,005 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,015 | h | #pragma once
#include "Common.h"
class Solution
{
public:
int longestPalindromeSubseq(string s)
{
int n = s.length();
vector<vector<int>> dp(n, vector<int>(n, 0));
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n - i; j++)
{
if (i == 0)... | [
"bubbercn@163.com"
] | bubbercn@163.com |
4a35936cd4125c372aadeb6392281f92ef840cc5 | 186291df46c41914afed7e16b7d65004731dc1ef | /src/AnesthesiologistManipulator.h | 8104080d1648054cb1dee577352a0b80c85c3969 | [] | no_license | jylee9817/Annie2.0_2015 | 1b0987f46204631ab66fc5eac93b55a35bea25f7 | 50cda2bcc9fd64e94b91bda60ea14146a3324bbd | refs/heads/master | 2021-09-24T22:39:35.776989 | 2015-10-07T22:57:44 | 2015-10-07T22:57:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 643 | h | #ifndef ANESTHESIOLOGIST_MANIPULATOR_H
#define ANESTHESIOLOGIST_MANIPULATOR_H
#include "WPILib.h"
#include "Math.h"
#include "AnesthesiologistMacros.h"
class AnesthesiologistManipulator
{
public:
AnesthesiologistManipulator();
~AnesthesiologistManipulator();
void intakeBall(bool intake, bool outtake, double speed... | [
"fconnor13@gmail.com"
] | fconnor13@gmail.com |
75001824577c54f3eef4d410e5d4cd2e8b4de798 | f0a26ec6b779e86a62deaf3f405b7a83868bc743 | /Engine/Source/Developer/SessionFrontend/Private/Widgets/Console/SSessionConsoleFilterBar.cpp | 6c794f7b531118f9022166ae1cb7fba096ae5c96 | [] | no_license | Tigrouzen/UnrealEngine-4 | 0f15a56176439aef787b29d7c80e13bfe5c89237 | f81fe535e53ac69602bb62c5857bcdd6e9a245ed | refs/heads/master | 2021-01-15T13:29:57.883294 | 2014-03-20T15:12:46 | 2014-03-20T15:12:46 | 18,375,899 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,662 | cpp | // Copyright 1998-2014 Epic Games, Inc. All Rights Reserved.
/*=============================================================================
SSessionConsoleFilterBar.cpp: Implements the SSessionConsoleFilterBar class.
=============================================================================*/
#include "SessionFr... | [
"michaellam430@gmail.com"
] | michaellam430@gmail.com |
5c7128354fd4b717789bdcc1b0ddd3ed58eaf7fc | 15b30861877807094a5974ab892c72d25e487d19 | /database/mystring.h | 5c948f0897aff78a6cc4420c17d5db31a7ab2279 | [] | no_license | LuaxY/Linxemu | 0a4775b5d3273b5a56f622fbf6132b688f842ca0 | 407f4024c523657b826fd62dc783483393f80544 | refs/heads/master | 2016-09-06T13:32:57.339527 | 2013-08-21T14:30:58 | 2013-08-21T14:30:58 | 17,882,652 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 27,059 | h | /// \file mystring.h
/// \brief Declares String class, MySQL++'s generic std::string-like
/// class, used for holding data received from the database server.
/***********************************************************************
Copyright (c) 1998 by Kevin Atkinson, (c) 1999-2001 by MySQL AB, and
(c) 2004-2008 by ... | [
"yann.guineau@gmail.com"
] | yann.guineau@gmail.com |
5845148641cea3ca62f3f6a49319650c9e989869 | 8e861d5a4b11fab598b7493b183214ff66f7493a | /Sorting/65a_3-colours.cpp | 3f72bf06918578f1a178589677e04f747b3bb69c | [] | no_license | sreekanth025/coding-problems | 9e218a5043403098f72d7798c0d118218f2f0372 | 25031624f6ea652c93886dd92a099a8be75c0b5c | refs/heads/master | 2023-06-17T23:07:16.966184 | 2021-07-20T14:04:59 | 2021-07-20T14:04:59 | 262,855,003 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,202 | cpp | /*
Given an array nums with n objects colored red, white, or blue, sort them in-place so that
objects of the same color are adjacent, with the colors in the order red, white, and blue.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
*/
// problem Link: https://lee... | [
"vs25@iitbbs.ac.in"
] | vs25@iitbbs.ac.in |
8f8ba62a4b6cfab84e66929eecaea2c00f19a2d9 | 9526573477a42939ba6741831e71e90c57c0ff5b | /429贪吃蛇/snake.cpp | 57c8496a0990df0d9294dc5202c6e317145f8d2b | [] | no_license | StarWife/429- | ef0d54fba275e503e6ca40d501d74136886bb01e | 40cc7f04d10eb3484da911fa7adb7f271dd8bc06 | refs/heads/master | 2020-12-03T00:30:31.533836 | 2017-07-02T16:45:13 | 2017-07-02T16:45:13 | 96,036,754 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,208 | cpp |
#include "snake.h"
//在snake中，先定义出修改光标的代码
void gotoxy(HANDLE hOut, int x, int y)
{
COORD pos;
pos.X = x; //横坐标
pos.Y = y; //纵坐标
SetConsoleCursorPosition(hOut, pos);
}
HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE);//定义显示器句柄变量
Snake::Snake(Wall & tmpWall, Food & tmpFood) :wall(tmpWall), food(... | [
"1129837502@qq.com"
] | 1129837502@qq.com |
76ad67412611dcab6c911ee2df5d9c657fca275f | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5631989306621952_0/C++/lljjcc/main.cpp | e94ac6fb4b3e81981b1a34e43dad97dad07a850c | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 1,125 | cpp | #include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <fstream>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3f
const int N=2015;
const ... | [
"alexandra1.back@gmail.com"
] | alexandra1.back@gmail.com |
e77fcd4e621c3ed1d05986085c0ff4de241dfa69 | 3012cd5e4cab17a14cc8a1ac2323d4ee5b32f140 | /src/puresoft3d/prog.cpp | 882579215dab23a29ab707a95d1e8e02cdea09b3 | [] | no_license | CallMeZhou/Puresoft3D | 493b0e769525539324982054a75f1dd003d8cb61 | 213d281f0cda375ad2841d3f5f98f8f3167bf28d | refs/heads/master | 2021-12-10T09:06:33.813798 | 2021-12-08T21:59:32 | 2021-12-08T21:59:32 | 54,444,411 | 209 | 67 | null | 2017-04-17T08:32:12 | 2016-03-22T04:10:50 | C++ | UTF-8 | C++ | false | false | 3,066 | cpp | #include "pipeline.h"
int PuresoftPipeline::addProcessor(PuresoftProcessor* proc)
{
size_t vacant = 0;
for(; vacant < m_processors.size(); vacant++)
{
if(!m_processors[vacant])
break;
}
if(m_processors.size() == vacant)
{
m_processors.push_back(NULL);
}
m_processors[vacant] = proc;
return (int)vacan... | [
"agedboy@gmail.com"
] | agedboy@gmail.com |
3eda8b09bf6d6a907b7c923bb27b00d6f246cb6a | c732aa25310eb96a27d3ea7cf42403a77ce5caa2 | /src/Tetrahedron.cpp | 408a4950b4d0f48bd0eec6ce5c427d8f8913d277 | [] | no_license | johanforslund/ray-tracer | e73414e2d80426ffd50d9bb548a8118a84fa8694 | f3e3e1396d5163f83dcff1a87e0d5eb3fc0f6259 | refs/heads/master | 2020-09-13T06:58:34.283345 | 2019-11-19T12:51:46 | 2019-11-19T12:51:46 | 222,687,764 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,243 | cpp | #include <iostream>
#include "Tetrahedron.hpp"
Tetrahedron::Tetrahedron(Triangle* tri1, Triangle* tri2, Triangle* tri3, Triangle* tri4, Material* _material) : Geometry(_material) {
triangleList[0] = tri1;
triangleList[1] = tri2;
triangleList[2] = tri3;
triangleList[3] = tri4;
}
Tetrahedron::~Tetrahed... | [
"johanforslund95@gmail.com"
] | johanforslund95@gmail.com |
51493ae65a79c1d6b0bfea37cd639faf26ccdf79 | 5ee5853eb335fcf575d4344366ef9b4bce03570d | /p702m/binary_search_stream.cpp | d848cec0c915be4f317bcae48e1b0188c8ca39a9 | [
"MIT"
] | permissive | l33tdaima/l33tdaima | 15463fb2f8d61286a4a3a7bacaaee2ab1f7c4f43 | f35305c618b383a79d05074d891cf0f7acabd88f | refs/heads/main | 2023-07-20T21:52:26.330301 | 2023-07-19T02:30:22 | 2023-07-19T02:30:22 | 99,509,451 | 1 | 0 | MIT | 2018-10-31T15:10:49 | 2017-08-06T19:44:29 | JavaScript | UTF-8 | C++ | false | false | 1,606 | cpp | // g++ -std=c++11 *.cpp -o test && ./test && rm -f test
#include <vector>
#include <iostream>
using namespace std;
// Forward declaration of ArrayReader class.
class ArrayReader {
vector<int> array;
public:
ArrayReader(vector<int> a)
: array(a) {}
int get(int k) const {
if (k >= array.size())... | [
"jwmiany@gmail.com"
] | jwmiany@gmail.com |
86cc278f6707e4f2c542741fdff4ef2f8c509eb4 | 88112a3bd439d05b874989b9904a8593ab3f2dda | /src/functions/simple.cc | 80556afc39f0106ed3bb3d589224565046e3ed50 | [
"MIT"
] | permissive | hollobit/iotivity-node | 8ce438444086ee7f0d724a5f3f26c0302e150a72 | 477d3d581e13b33cfdb53b60ba2208f385631a1e | refs/heads/master | 2021-01-21T16:09:42.042948 | 2015-10-18T12:52:41 | 2015-10-18T12:52:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,820 | cc | #include <nan.h>
#include "../common.h"
#include "../structures/handles.h"
#include "../structures/oc-platform-info.h"
#include "../structures/string-primitive.h"
extern "C" {
#include <ocstack.h>
}
using namespace v8;
NAN_METHOD(bind_OCInit) {
NanScope();
VALIDATE_ARGUMENT_COUNT(args, 3);
VALIDATE_ARGUMENT_T... | [
"gabriel.schulhof@intel.com"
] | gabriel.schulhof@intel.com |
4c05800d9e5531a9e3287480282ead156f19a8b3 | f1f1ccfa558fd0f0f80bd8b180b4d8f3e300a880 | /metamorphosys/tonka/models/SystemC/usb11/fifo_test.cpp | c21c51b1f74106d1460edf790b8d86f1d8853409 | [
"MIT"
] | permissive | pombreda/metamorphosys-desktop | 58afdbe696bcddb0c8c84598ed25c28b08d3ba95 | cfc87a9a3476e94faa96080d57a474860a3ffcca | refs/heads/master | 2021-01-21T03:44:21.775196 | 2015-01-15T01:04:11 | 2015-01-15T01:04:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,869 | cpp | #include "systemc.h"
#include "usb_fifo64x8.h"
SC_MODULE(test) {
sc_in<bool> clk;
sc_out<bool> rst, clr;
sc_out<sc_uint<8> > din;
sc_in<sc_uint<8> > dout;
sc_out<bool> we, re;
sc_in<bool> empty, full;
int i;
void update(void) {
i = 0;
rst.write(false);
clr.write(false);
we.write(fals... | [
"adam.nagel+git@gmail.com"
] | adam.nagel+git@gmail.com |
f8dbf3874c229b6225c1b22332a65f5380b6035c | a83bdb9c18a6f2ce64f51ff1d8e93fc68738ae3f | /Binary Tree/4. Mirror of a Binary Tree.cpp | 3c743f25328faf449f66673c033f14285591d5fc | [] | no_license | ariesha-1702/DSA-450 | 386674ea67823974667bd935b296a3b4779aac90 | fd1e01b5f24acc61e759f04cdfbf13034b60c21d | refs/heads/master | 2023-08-19T10:31:44.446132 | 2021-10-05T16:12:34 | 2021-10-05T16:12:34 | 326,902,934 | 3 | 0 | null | 2021-10-05T16:12:35 | 2021-01-05T06:04:49 | C++ | UTF-8 | C++ | false | false | 756 | cpp | // https://leetcode.com/problems/invert-binary-tree/
// https://practice.geeksforgeeks.org/problems/mirror-tree/1#
#include<bits/stdc++.h>
using namespace std;
/* Definition for a binary tree node */
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr)... | [
"ariesha2000@gmail.com"
] | ariesha2000@gmail.com |
7d950744d59fb6c81da984277463453f10f864e5 | 675acf3bd5550da945d30b9d04f771b4f83bd74f | /CH 10 Classes A Deeper Look Part 2/Increment Class/Increment.h | c3346e5eee2bef7b67197acaf720d587a814fbef | [] | no_license | Ghostscypher/Deitel_Cpp | 76608e685f3e33e826710e744e75e975753a90ef | 4399ce81ebf878d05eed884267574823e49df35d | refs/heads/master | 2020-05-26T23:27:21.503890 | 2019-06-29T22:06:04 | 2019-06-29T22:06:04 | 188,411,051 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 331 | h | #ifndef INCREMENT_H
#define INCREMENT_H
class Increment
{
public:
Increment(int c = 0, int i = 1);//default constructor
//function addIncrement definition
void addIncrcement()
{
count += increment;
}
void print() const;//print count and increment
private:
int count;
const int increment;
};//end class incre... | [
"bngetich69@gmail.com"
] | bngetich69@gmail.com |
b6518d2385693bc0baca79f860b22cb65c32c47e | 745114a645151904dbeb33f8f91b56fd64753d44 | /src/model/changes.cpp | 26cacc14e893d5eb4026c4464fca5fbda35d5967 | [
"BSD-2-Clause",
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | jaimet/SmallWM | 8cddda696f20b9f024fe2291898637715f258786 | c2dc72afa87241bcf7e646630f4aae216ce78613 | refs/heads/master | 2022-04-06T23:40:26.376958 | 2020-02-29T00:00:09 | 2020-02-29T00:00:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 841 | cpp | /** @file */
#include "changes.h"
/**
* Returns true if there are changes to be processed, or false otherwise.
*/
bool ChangeStream::has_more()
{
return !m_changes.empty();
}
/**
* Gets the next change, or NULL if no changes remain.
*
* Note that this change should be deleted after the caller is finished wi... | [
"adamnew123456@gmail.com"
] | adamnew123456@gmail.com |
7814cf46088e5f5813891aca847a479655723b45 | de4b1247842b863059cdd66f6651d2b6fdd5965b | /arduino/bike.cpp | 24152f5f0f96d2dc464a3f8e0787c6a0fa5530f8 | [
"MIT"
] | permissive | shieldo/joyride | 42bf7c385ae60536c4d3d92f4b9edfa8e458bcb4 | 186df412c542a54165063ce72f5df8ede4f8f5bf | refs/heads/master | 2021-01-16T19:04:15.377111 | 2013-07-16T21:26:31 | 2013-07-16T21:26:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 525 | cpp | int positionPin = 0;
int steeringPin = 2;
int pos = 0;
int step = 0;
int steering = 512; //initialize potentiometer
void setup()
{
Serial.begin(9600);
}
void loop()
{
pos = analogRead(positionPin);
String posMessage = "POSIT:";
posMessage += pos;
Serial.println(posMessage);
if (step == 2)
{
steering... | [
"dgreenshields@gmail.com"
] | dgreenshields@gmail.com |
a59c8194ade22c49721540e7a396e5ed79f74497 | 1b6f140a49fb34e21f3a29a32b4cfb83e57d9cc4 | /1132 Cut Integer.cpp | d0ed3af3e4ff52a26f075b61cd536b1140f71b7f | [] | no_license | Fibonacci816/PAT | 6740a5d95ea37247e938ec92178225c2f5e198e8 | 1abee72a2a02035f481accbf932097b35f740b6e | refs/heads/master | 2022-11-14T04:25:16.779065 | 2020-07-03T12:48:05 | 2020-07-03T12:48:05 | 261,709,110 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 390 | cpp | #include <iostream>
using namespace std;
int main()
{
int N;
scanf("%d\n", &N);
string number, cut1, cut2;
for(int i = 0; i < N; i++){
cin >> number;
cut1 = number.substr(0, number.length()/2);
cut2 = number.substr(number.length()/2);
if(stol(cut1)*stol(cut2) != 0 && stol(number) % (stol(cut1)*stol(cut2)) ... | [
"zepeng816125@163.com"
] | zepeng816125@163.com |
a049b518e0e960c55f65e80e8ceb1204dc83e7d8 | b4f9d8a15aa892445c9676abbfeb0333e78c458e | /YART-Lib/include/core/memoryutil.h | fb45fe54d379722609f6a669d5fee1d6dfbe3c73 | [] | no_license | junnys6018/YART | b9dc4bbb24e392499f4cd696038b498e72bcdf28 | 57ed173e9115b787cac5f0196ca22d0a686b8e40 | refs/heads/master | 2023-06-30T05:29:45.630344 | 2021-07-15T09:42:55 | 2021-07-15T09:55:14 | 337,949,841 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,548 | h | #pragma once
#include "core/yart.h"
#define YART_ALLOCA(TYPE, COUNT) (TYPE*)alloca((COUNT) * sizeof(TYPE))
#define ARENA_ALLOC(arena, TYPE) new (arena.Alloc(sizeof(TYPE))) TYPE
namespace yart
{
void* AllocAligned(u64 size);
template <typename T>
T* AllocAligned(u64 count)
{
return (T*)AllocAl... | [
"junkanglim1@gmail.com"
] | junkanglim1@gmail.com |
ea6d2ebb0a43348b1e77eb7b1fa142705f198cf1 | b180d6adb037fea652f0f3dee8ecd70f2aeb89e6 | /examples/icalc/main.cpp | 90a8f5986b08ede17b1ee66a599683e377122a1b | [
"MIT"
] | permissive | asutton/beaker-akron | 075f78204924c11d65bfecbb56792e750367d032 | 60303ae783903138279f60c1d6c6d7e3297143d6 | refs/heads/master | 2021-06-17T05:30:31.559324 | 2017-03-16T16:04:12 | 2017-03-16T16:04:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,886 | cpp | // Copyright (c) 2015-2017 Andrew Sutton
// All rights reserved
#include "lang.hpp"
#include "lexer.hpp"
#include "parser.hpp"
#include <beaker/base/printing/print.hpp>
#include <beaker/base/evaluation/evaluate.hpp>
#include <iostream>
/// Reads an expression from the given input. Returns the parsed expression
///... | [
"andrew.n.sutton@gmail.com"
] | andrew.n.sutton@gmail.com |
b16f89db076da19a3c22960159a5add871406dc0 | 2a547846dfadbe2ad8f2f0812e1910f88cf90f37 | /Competitive Programming/Spoj/ABCDEF.cpp | 6515cac6f675284cb92bb60c873171b996470316 | [] | no_license | vishesh49/master | fafe50cf24fca98a58d81440e841c1e8e54d3b95 | 7a0847e49d58353bd5151f2666a8d06c90b8ad8c | refs/heads/master | 2016-08-07T02:55:06.663473 | 2015-09-16T18:31:03 | 2015-09-16T18:31:03 | 39,990,605 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,116 | cpp | #include <bits/stdc++.h>
using namespace std;
int res1[1000005];
int res2[1000005];
int cnt1[1000005];
int cnt2[1000005];
int main() {
// your code goes here
int n;
cin>>n;
int s[n];
for(int i=0;i<n;i++)
{
cin>>s[i];
}
int x=0;
for(int a=0;a<n;a++)
{
for(int b=0;b<n;b++)
{
for(int c=0;c<n;c++)
... | [
"vraimugia@gmail.com"
] | vraimugia@gmail.com |
e3425d40b461413095f64f0f5a929b1e302ce061 | fbd4addc2df20f7b181b9d70cbd2b31af8ff51bb | /Parallel Dependency Analysis/Tasks/Task.h | bd31e13ca4bbaab1e13c2b658fa6a64f071117ee | [] | no_license | TejaThunuguntla/Object-Oriented-Design | 5e2ab97036446dbd3e0e456c7bd74fde73d1a57f | 73d5c9f0442025efa6ef5c4c910d791ad68ee367 | refs/heads/master | 2020-05-20T15:07:46.308950 | 2017-03-09T21:02:48 | 2017-03-09T21:02:48 | 84,479,300 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,283 | h | #ifndef TASK_H
#define TASK_H
#pragma warning(disable : 4503)
///////////////////////////////////////////////////////////////////////
// Task.h - provides callable obj to run Type analysis asynchronously//
/////////////////////////////////////////////////////////////////////// //
// ver 1.0 ... | [
"thunuguntlateja12@gmail.com"
] | thunuguntlateja12@gmail.com |
1b300a4a357590e45046cfdb0b6d0e9fc698b1aa | 067936cabcabd42cfffd138b21c46efb5ae546b9 | /plugins/channelrx/demodam/amdemod.h | ccbab6fb538722c41935827e042ac34dfef838a5 | [] | no_license | herrfeuer/sdrangel | df9fe7c177438f8b5b058c748ce5cbc28ddc5e2a | 9bdf673f90d64e03520aa48753e3dd3b2420c732 | refs/heads/master | 2021-05-01T02:32:09.592113 | 2018-02-12T00:44:24 | 2018-02-12T00:44:24 | 108,776,176 | 0 | 0 | null | 2017-10-29T22:20:04 | 2017-10-29T22:20:03 | null | UTF-8 | C++ | false | false | 7,832 | h | ///////////////////////////////////////////////////////////////////////////////////
// Copyright (C) 2015 Edouard Griffiths, F4EXB. //
// //
// This program is free software; you can redistribute it and/or ... | [
"f4exb06@gmail.com"
] | f4exb06@gmail.com |
2074efe961717212a17282347db59fde94191452 | 750321143f90c971a309d2fe4e861d2b9a1ed9bf | /sketch_aug25c/sketch_aug25c.ino | ed3a11bd31f7b544dbc3c673f87d75fa970c7a1b | [] | no_license | xrisk/Arduino | e4fd438d0ec2b219ca5791005d1a00b2780aa77a | 227a263d1ab7312833a2065f12511899e1f7342d | refs/heads/master | 2021-07-22T22:20:55.760500 | 2019-07-24T18:50:17 | 2019-07-24T18:50:17 | 102,395,473 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 816 | ino | int calib_mq4 = 0;
void setup() {
pinMode(A2,INPUT);
pinMode(A4, INPUT);
Serial.begin(9600);
unsigned long long calib_sum = 0;
Serial.print("Calibrating.");
for (int i = 0; i < 100; i++) {
calib_sum += analogRead(A4);
delay(20);
Serial.print(".");
}
calib_mq4 = calib_sum / 100;
Serial.pr... | [
"rishav.kundu98@gmail.com"
] | rishav.kundu98@gmail.com |
3fdd99fff1251e29f35bbdb06e8c5090f2cd8d17 | e428638df7c259a9da2b4a8856008da8251aa388 | /Include/Applications/GLX/GteWindowSystem.h | 6ec8cf81677c0c0b282134306522ef022ec61dbc | [
"BSL-1.0"
] | permissive | vehsakul/gtl | 22a9ee057a282d3edbb99eaa30ad6e68773c768e | 498bb20947e9ff21c08dd5a884ac3dc6f8313bb9 | refs/heads/master | 2020-12-24T06:41:48.314735 | 2016-11-14T18:16:36 | 2016-11-14T18:16:36 | 73,462,121 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,048 | h | // David Eberly, Geometric Tools, Redmond WA 98052
// Copyright (c) 1998-2016
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
// File Version: 3.0.1 (2016/07/01)
#pragma once
#include <Applications/GLX... | [
"lukashev.s@ya.ru"
] | lukashev.s@ya.ru |
24d08b68184e4213623d93f3775cd05237e7fdde | df8fccd34d301c450155d762f3a30588768010f0 | /main.cpp | afd871d925086eb5376d2cbce6be782f7ef236d1 | [] | no_license | TariqAlmuqbil/Genetic-Algorithm-c- | 5467516af083434a77d00d8de5d3c7276f224bc0 | 2082a626f5e6e3929cc5d8a16c32f0176c230b93 | refs/heads/main | 2023-02-26T04:08:58.617180 | 2021-02-03T06:01:27 | 2021-02-03T06:01:27 | 334,599,998 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 507 | cpp | #include <iostream>
#include <vector>
#include <stdio.h> /* printf, scanf, puts, NULL */
#include <stdlib.h> /* srand, rand */
#include <algorithm>
#include <iterator>
#include "GAmodule.h"
#include "Object.h"
using std::vector;
int main(){
GAmodule <GlodenNumber> myModule(200,1000,15... | [
"noreply@github.com"
] | TariqAlmuqbil.noreply@github.com |
a57d8faeb57939017f9b734c6bbb24f9f4739436 | eb6e9eb9eaa9fad91e98104c493d094ef63e9b77 | /simpit-2.0/src/GPPrimaryGeneratorAction.cc | c178777abadce3e1a451bc3a84b3990bfadd5bb1 | [] | no_license | sonia3994/simpit | 3234e231eebc7d00a5e6f771a4877a9b54b79be1 | 8c65c0e1d43e2c22ca2c7b13e3197eb7dc17c7ac | refs/heads/master | 2021-01-13T02:03:59.313155 | 2011-06-14T07:56:00 | 2011-06-14T07:56:00 | 38,294,428 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,532 | cc | // $Id: GPPrimaryGeneratorAction.cc,v 1.6 2006/06/29 17:47:23 gunter Exp $
// GEANT4 tag $Name: geant4-09-02 $
//
#include "GPPrimaryGeneratorAction.hh"
#include "GPPrimaryGeneratorMessenger.hh"
#include "GPHEPEvtInterface.hh"
#include "G4Event.hh"
#include "G4ParticleGun.hh"
#include "G4ParticleTable.hh"
#include "G... | [
"xuchenghai@3cf4116c-e284-11de-9129-6395494df245"
] | xuchenghai@3cf4116c-e284-11de-9129-6395494df245 |
3fcf3366fac8af35a31a201971916402fd0c486b | 3e88697a0e6da6bd28fa32d8e3950acf64d31501 | /chai3d/src/files/CFileLoaderOBJ.h | c05fec09ae71ffd2752afb3256325a8f77090f69 | [] | no_license | agentmorris/MeshTools | 821390482e0aaf8b7760b13bbe6e530ebe2bb249 | 5334aa42f4e416fba2c5cbfddf2e1d9e83512e9e | refs/heads/master | 2021-01-01T19:27:10.379488 | 2017-07-28T14:58:50 | 2017-07-28T14:58:50 | 98,591,404 | 11 | 4 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 6,963 | h | //===========================================================================
/*
This file is part of the CHAI 3D visualization and haptics libraries.
Copyright (C) 2003-2004 by CHAI 3D. All rights reserved.
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU General ... | [
"dan@microsoft.com"
] | dan@microsoft.com |
1be3d0ca35a16eb9bcbee542aeab897c33240d18 | 79f9ff35fd7237a6fbbe5bc43f177b68cf34ee42 | /Bit Manipulation/Q.1 Count total set bits.cpp | 3013cb8fde313abdc501373890b7ee2231525539 | [] | no_license | vibhubhatia007/FINAL450 | cd11f9a110e1d2666251fe16cd164bff3dd37de4 | aa192ec6dab1d6232855fbe35566cd54e0860c54 | refs/heads/main | 2023-06-10T19:50:13.657948 | 2021-07-05T07:32:22 | 2021-07-05T07:32:22 | 311,951,979 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 507 | cpp | #include<bits/stdc++.h>
using namespace std;
int countSetBits(int n)
{
int x= log2(n)+1;
int ans=0;
for(int i=1;i<=x;i++)
{
int v =pow(2,i);
int s= (n/v)*(v/2);
if( (n%v) > ((v/2) - 1) )
{s = s + (n%v);
s = s - ((v/2) - 1);}
ans=ans+s;
... | [
"vibhubhatia0007@gmail.com"
] | vibhubhatia0007@gmail.com |
8c3194f30c49a05fc8c3bfe0c93e24b46f43aeac | 72ed9a47f523e184301ab19b75f4df8d061e422a | /cpp_src/core/transactionimpl.cc | 697bc97a6c34049fbb40f19a5db423a94a728f14 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | cristaloleg/reindexer | 7566d5a877267b724cf9c9041efb2dde9c38a88b | ccb0a6e072b2dbe63bb48b59fe6b709ec1fac8c2 | refs/heads/master | 2020-04-15T18:27:00.339426 | 2019-01-09T08:25:02 | 2019-01-09T08:25:02 | 164,913,154 | 1 | 0 | Apache-2.0 | 2019-01-09T18:07:09 | 2019-01-09T18:06:56 | C++ | UTF-8 | C++ | false | false | 1,137 | cc | #include "transactionimpl.h"
namespace reindexer {
using std::string;
TransactionAccessor::TransactionAccessor(TransactionAccessor &&rhs) noexcept : Transaction(std::move(rhs)) {}
TransactionAccessor &TransactionAccessor::operator=(TransactionAccessor &&rhs) noexcept {
Transaction::operator=(std::move(rhs));
return... | [
"ogerasimov@gmail.com"
] | ogerasimov@gmail.com |
4cb1d557b1c2a4565aeebe444e0a250bf8e6b9eb | 97f44f5b96b97609128df991f5eb8738d5eb8b9e | /include/MapGeneration/MapEventChest.h | b0f9ab584c8f39f16965ea742e6ba72b8b025456 | [
"MIT",
"BSD-3-Clause",
"Zlib"
] | permissive | Panzareon/RoguePG | c12b89f61de69ad01a29b863ae95d2aefe1b1f51 | 7c276c1c961c8b7a24cd88dc4b2de2ef99cd832c | refs/heads/master | 2021-01-17T05:24:05.828546 | 2020-01-31T19:47:19 | 2020-01-31T19:47:19 | 63,473,433 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 693 | h | #ifndef MAPEVENTCHEST_H
#define MAPEVENTCHEST_H
#include "MapEventTile.h"
class MapEventChest : public MapEventTile
{
public:
MapEventChest();
MapEventChest(int x, int y);
virtual ~MapEventChest();
virtual void Activate();
template<class Archive>
void save(Archive... | [
"Fogtociag@web.de"
] | Fogtociag@web.de |
dbe49d19e549cf6dcf78d435fe88b47e33399080 | 13fb1a2b144c21a36917c8c328d41afe519f28cb | /OLEDtest1.ino | 38b38bf53fe5954db936cfbd656d8f3848314a51 | [
"MIT"
] | permissive | andrewduhan/OLED-UI-Test | cd969c1c81736d9c6d80c18ea4c5c8e69847e688 | 4df59139773e2924f3c314e037b777a66f8f9f39 | refs/heads/master | 2021-01-22T14:39:03.476718 | 2014-07-11T15:46:39 | 2014-07-11T15:46:39 | 21,719,304 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 12,176 | ino | #define OLED_DC 11
#define OLED_CS 12
#define OLED_CLK 10
#define OLED_MOSI 9
#define OLED_RESET 13
#define BUTTON_DOWN 7
#define BUTTON_UP 8
#define BUTTON_SEL 6
#define BUTTON_MODE 5
#define START_CHAR 32 // " "
#include <Wire.h>
#include <Adafruit_GFX.h>
#include <Adafruit_SSD1306.h>
#include "dpfont_3x5.c"
#includ... | [
"andrewduhan@gmail.com"
] | andrewduhan@gmail.com |
01804f015e1eff81d46d8076605bad6aa8ac0137 | 0bd6b416055370f2f75e2c48796f9d8f36ae0355 | /boat.h | a9d06e08241ce1f62dc8631712f6e0859d8c22fd | [] | no_license | kuanchenwu/Dp02 | 48de8b41cfa75499158726d7bf496ff0db050e38 | 1fc2b6a1329c057af022124f55744fc0ba59ad98 | refs/heads/master | 2023-08-13T03:46:45.637583 | 2021-10-03T21:35:01 | 2021-10-03T21:35:01 | 413,202,286 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,120 | h | struct Item{
int weight = 0;
int value = 0;
int amount = 0;
int number = 0;
}; // to keep the amount of each item, the weight and value of the item
class boat{
public:
boat(int boat_weight, int total_type); //set the amount of weight the boat can carry
void add(Item x);// put item x onto the boat
void print_out... | [
"kwu3@uco.edu"
] | kwu3@uco.edu |
0863bc53b887273ca16117a94d28d0a3b7051f50 | f09cb5319c7ed374eaeb1591a86bb02cc8a36a13 | /MRCompiler/MRCompiler/StackItem.cpp | 40148a0a02e638572eef76ff9a8cb68fa4b18cc4 | [] | no_license | Eagle-E/RubyCompiler | 83a8c3a053368f5315dff12e3806cf4a85c5e88f | 7e0fa03da4677915c963de81a12131bdd4153812 | refs/heads/main | 2023-07-11T10:54:39.730643 | 2021-08-25T07:49:14 | 2021-08-25T07:49:14 | 303,689,734 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 867 | cpp | #include "StackItem.h"
#include "Literal.h"
StackItem::StackItem()
: mScope(0), mIdName(""), mType(SymbolType::NONE), mValue(nullptr)
{
}
StackItem::StackItem(const StackItem& other)
{
this->mScope = other.mScope;
this->mIdName = other.mIdName;
this->mType = other.mType;
this->mValue = other.mValue;
}
StackIte... | [
"guney.enes@hotmail.com"
] | guney.enes@hotmail.com |
c06aab03a6760eab7c4f64cb9023ca20be58b878 | 06dba9f26691b6e50d920f72a2dc7995722d9f57 | /TWEED.cpp | 3760640b23550cd164728457f6709015effa08b2 | [] | no_license | abhishekarora9/CodeChef_Ques | d687eaf7a9f67e8defca2ddcfed0bc8a76f5e41a | 2de051c0e9ee71e5342f5c29e1683b65ebcd0131 | refs/heads/master | 2021-06-17T02:56:21.456392 | 2017-04-15T17:58:51 | 2017-04-15T17:58:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 512 | cpp | #include <iostream>
#include <string>
using namespace std;
int main ()
{
long long int t;
cin>>t;
while(t--){
long long int n,sum=0;
cin>>n;
//cin.get();
string a;
cin>>a;
int a1[100000];
for (int i = 0; i < n; ++i)
{
cin>>a1[i];
sum=sum+a1[i];
}
int player;
if(a=="Dee")
player=0;
el... | [
"abhishekarora@Ms-MacBook-Pro.local"
] | abhishekarora@Ms-MacBook-Pro.local |
0a6a1463e38bee5a699125b0bd48a9e79ccd9868 | 26f98e97cfd5ccacd022a9613a5f5566c8541c19 | /FileIO.cpp | de5f4e7ffd494bf4033e8ff5150a38796e211f6c | [] | no_license | rafaeu9/MarioFernandes_SDL | 9799abad83f161544e19db2f9f16956f71e6c1f7 | f8bd5871f75dd76738c872983773643b3ca37b5d | refs/heads/master | 2021-04-04T15:05:16.991263 | 2020-05-19T16:38:02 | 2020-05-19T16:38:02 | 248,466,012 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 924 | cpp | #include "FileIO.h"
void FileIO::ReadLevel()
{
FILE* fp = fopen("data/Level1.txt", "r");
if (!fp) {
std::perror("data/Level1.txt failed to open\n");
}
else {
printf("data/Level1.txt successfully open\n");
}
while (true) {
char type[256];
if (fp)
int val = fscanf(fp, "%s", &type);
... | [
"ask.mariofernandes@gmail.com"
] | ask.mariofernandes@gmail.com |
8e253b6bd21a8aaec6f97ce9314e64945540b0af | 4ea19ebc97484b500cb2d9acd0fb32445a5ecbcc | /rcta_manipulation_common/include/rcta_manipulation_common/MoveGroupGoal.h | 9255fee8a663a8a48f14dfa7dcfb1c9efc86641a | [] | no_license | aurone/rcta_manipulation | 8309c2aa9e3d95f3ad2b2c886bbf393a92722540 | 81e3a8c5aef1c27746cf3daf26f628336813e47c | refs/heads/master | 2020-12-24T10:24:30.937209 | 2019-04-30T15:25:45 | 2019-04-30T15:25:45 | 73,082,380 | 3 | 2 | null | 2019-04-02T21:26:41 | 2016-11-07T13:45:55 | C++ | UTF-8 | C++ | false | false | 799 | h | #ifndef RCTA_MANIPULATION_COMMON_MOVE_GROUP_GOAL_H
#define RCTA_MANIPULATION_COMMON_MOVE_GROUP_GOAL_H
// standard includes
#include <stdint.h>
// system includes
#include <geometry_msgs/Pose.h>
#include <moveit_msgs/PlanningOptions.h>
#include <moveit_msgs/RobotState.h>
#include <octomap_msgs/Octomap.h>
#include <sen... | [
"andrew.dornbush@gmail.com"
] | andrew.dornbush@gmail.com |
68a4a91aba2fbb5ec843d366e1d9c611f01c6b22 | 9472670a8487ef8bd70b327829df0c73ded6df20 | /PROGRAMACION Y ESTRUCTURA DE DATOS/tads/abb/tad10.cpp | b499497418ee1e5521876802bfff7c901e46982b | [] | no_license | josemygel/Temario-Ingenieria-Software-UA | 246b4f7044ae5f5f8fcb171ad6b01040d19396fa | 32cc45fcaee9d3d7282796f083691ec9d4551848 | refs/heads/master | 2023-05-10T23:38:04.608129 | 2020-08-02T08:08:04 | 2020-08-02T08:08:04 | 216,786,952 | 17 | 12 | null | 2023-05-07T02:16:11 | 2019-10-22T10:31:00 | HTML | UTF-8 | C++ | false | false | 587 | cpp | #include <iostream>
#include "tabbcalendario.h"
using namespace std;
int
main(void)
{
/***************************************************/
/***************** RESTA, INORDEN */
/***************************************************/
TABBCalendario a,b, resta;
TVectorCalendario vec;
TCalendario c1(1,1,... | [
"josemygel@gmail.com"
] | josemygel@gmail.com |
6735d7489842c9bbf85db9fb8e28e178579993a9 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5688567749672960_1/C++/chEEtah/A.cpp | cb29f81b9458cd304e2b0c6c61f39b89b9717ef3 | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 1,661 | cpp | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
#include <iostream>
#include <functional>
#include <algorithm>
#include <map>
#include <string>
#include <vector>
#include <set>
#include <queue>
using namespace std;
int nt;
long long go(... | [
"eewestman@gmail.com"
] | eewestman@gmail.com |
f7577cd60759aa47a7d430d7d00ec2dddc4a2b81 | dc172e4f13a914bf826403d38c50466a440995fa | /BOJ/완전탐색 문제집/1722 순열의의순서.cpp | 9a9f82f8d19a39196e9b1b71b7d019ddad8bf671 | [] | no_license | kevinsung123/ProblemSolving | 1c17ed50da8a4fee0ee288819096799ac8123c50 | 0cf16489dfb91c02be856835d73f46242712b64f | refs/heads/master | 2022-11-22T18:04:48.031471 | 2020-07-31T08:47:04 | 2020-07-31T08:47:04 | 103,735,824 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 1,355 | cpp | #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
bool check[22];
ll fact[22] = { 1, };
int cnt, ans;
ll k;
int num, n;
int main()
{
scanf("%d %d", &n,&num);
//팩토리얼 구하기
for (int i = 1;i <= n;i++)
{
fact[i] = i*fact[i - 1];
}
if (num == 1)
{
... | [
"kevinsungcjh123@gmail.com"
] | kevinsungcjh123@gmail.com |
d72a91eeece0f6a03664cacbb649444dbe244591 | a93cf8f695c1d1d97b8d0b9ccec6932c5e499ff8 | /Cpp/jaewon/solveac_lv3/1003 피보나치 함수/1003 피보나치 함수/1003 피보나치 함수.cpp | c5b1f1376b054b9d6dca0a9df849026498ea9026 | [] | no_license | tmdwns1101/AlgorithmStudy | 0abc108a7a73895934da2633998c7a90137d49ea | e8ca069e202f40e074b7311626fe8da8af057589 | refs/heads/master | 2021-07-22T11:32:30.817108 | 2020-05-20T16:28:27 | 2020-05-20T16:28:27 | 165,377,838 | 0 | 1 | null | 2020-02-07T07:56:16 | 2019-01-12T11:02:59 | C++ | UTF-8 | C++ | false | false | 1,233 | cpp | /*
다음 소스는 N번째 피보나치 수를 구하는 C++ 함수이다.
int fibonacci(int n) {
if (n == 0) {
printf("0");
return 0;
} else if (n == 1) {
printf("1");
return 1;
} else {
return fibonacci(n‐1) + fibonacci(n‐2);
}
}
N이 주어졌을 때, fibonacci(N)을 호출했을 때, 0과 1이 각각 몇 번 출력되는지 구하는 프로그램을 작성하시오.
... | [
"42069057+wodnjs1000gk@users.noreply.github.com"
] | 42069057+wodnjs1000gk@users.noreply.github.com |
c5098ce90a8c3be12c2ef79cc721ec19d28871e6 | 000d43e9faca8aa1d6a3ebc1522549a0e4d433ce | /00.Engine/02.Resources/02.Mesh/02.NaviMesh/01.Line/Line.cpp | 1be8facbc41efaeab0222c4777d1603c321a796c | [] | no_license | js7217/DX9_3D_DragonNest | 491836357aa6e9d33b7bc1910fe445a3c901642e | 296e9dfd46ebfd470cde1debf382be63aad9c75e | refs/heads/master | 2021-05-19T08:43:54.759248 | 2020-03-31T13:38:03 | 2020-03-31T13:38:03 | 251,610,697 | 3 | 2 | null | null | null | null | UHC | C++ | false | false | 1,499 | cpp | #include "Line.h"
USING(Engine)
CLine::CLine(void)
{
}
CLine::~CLine(void)
{
}
HRESULT CLine::Ready_Line(const _vec2 * pPointA, const _vec2 * pPointB)
{
m_vPoint[POINT_START] = *pPointA;
m_vPoint[POINT_FINISH] = *pPointB;
m_vDirection = m_vPoint[POINT_FINISH] - m_vPoint[POINT_START]; // 선분을 담당... | [
"noreply@github.com"
] | js7217.noreply@github.com |
a42b69c2ef375f85965bc4c018464a71b3654968 | 04e2587fdc480ad47a4329a0d87be13e8ed82560 | /Engine/include/Engine/Core/Components/LightComponent.hh | eb0f5a41e872320e392398542e6b2ff944c19545 | [] | no_license | MajorSquirrelTVS/Tekeimyung | 9309bb053572c3e3c3ffb1df5b514becff95bd1b | af70feeb5391a2f378acc9425f30568c66c8b6ca | refs/heads/master | 2020-04-15T05:36:40.209235 | 2017-05-22T09:36:25 | 2017-05-22T09:36:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 657 | hh | #pragma once
#include <glm/vec3.hpp>
#include <memory>
#include <ECS/Component.hh>
#include <Engine/Graphics/Light.hpp>
#include <Engine/Graphics/ModelInstance.hpp>
START_COMPONENT(sLightComponent)
virtual sComponent* clone()
{
sLightComponent* component = new sLightComponent();
component->update(this);
... | [
"guillaume.labey@epitech.eu"
] | guillaume.labey@epitech.eu |
d5331c06ed7aeed7b59cd54c979038371f8db729 | 8191954e1a570081e092835f5a1e6889e634031a | /RTL_BUILDING_BLOCKS/llist_fifo/isim/work/mem/mem.h | 3432256cf27fbd55077f84810060c26fa0ab73d8 | [] | no_license | vj-sananda/fpga | 61c1f795939a9c23a4273970e6ce692856ad6b8e | 938d853a42bbedba8ed08e50c7f9d42b4827dcfb | refs/heads/master | 2020-04-18T09:23:01.470781 | 2019-01-24T22:21:23 | 2019-01-24T22:21:23 | 167,432,294 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 967 | h | ////////////////////////////////////////////////////////////////////////////////
// ____ ____
// / /\/ /
// /___/ \ /
// \ \ \/
// \ \ Copyright (c) 2003-2004 Xilinx, Inc.
// / / All Right Reserved.
// /___/ /\
// \ \ / \
// \___\/\___\
//////////////... | [
"vj.sananda@gmail.com"
] | vj.sananda@gmail.com |
f87e8247f28c440af4e7065673173573549bac1d | 5d83739af703fb400857cecc69aadaf02e07f8d1 | /Archive2/29/84fe03f1841e48/main.cpp | ff7527bd79bbc4b75255575d5cc58c26ea432b9a | [] | no_license | WhiZTiM/coliru | 3a6c4c0bdac566d1aa1c21818118ba70479b0f40 | 2c72c048846c082f943e6c7f9fa8d94aee76979f | refs/heads/master | 2021-01-01T05:10:33.812560 | 2015-08-24T19:09:22 | 2015-08-24T19:09:22 | 56,789,706 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 188 | cpp | #include <functional>
template<typename T>
void foo(T obj)
{
obj.bar();
}
struct X
{
void bar() { }
};
int main()
{
X x;
foo(x); // Yep
//foo(std::ref(x)); // Nope
} | [
"francis.rammeloo@36614edc-3e3a-acb8-9062-c8ae0e4185df"
] | francis.rammeloo@36614edc-3e3a-acb8-9062-c8ae0e4185df |
70d2e75afbc9ca346c47b511bc58d81c6fccd603 | 34a52207bf0b644a8b33fea740facab83c1b6505 | /OpenGLMaster/OldObjects.h | e72a62c23f813f1401175cd5f98ee6571c9cafbf | [] | no_license | HaydenWalton12/StarWars-OpenGL | 781624ae44f58c761813504e29e48e673551a3ef | a80c78c5c38014f111651cfff03e438413ab2a9d | refs/heads/master | 2023-04-15T16:09:01.995083 | 2021-04-23T04:46:23 | 2021-04-23T04:46:23 | 360,765,419 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 275 | h | #pragma once
#include "Structures.h"
#include "Texture2D.h"
class OldObjects
{
protected:
ObjectMesh* old_mesh;
Texture2D* old_texture;
public:
OldObjects(ObjectMesh* mesh, Texture2D* texture);
virtual ~OldObjects();
virtual void Update();
virtual void Draw();
};
| [
"67838920+Mrdarlikjz@users.noreply.github.com"
] | 67838920+Mrdarlikjz@users.noreply.github.com |
5f4d5cc9fbd656b684505f47c85c34092913a055 | f90920085074e79a37048155750b80e5e884c5d2 | /mmcesrv/mmceevent/tsrc/ut_event/inc/UT_CMCEEventContext.h | ade2821b4c9f6dec1c51794990c2f9b051157c3d | [] | no_license | piashishi/mce | fec6847fc9b4e01c43defdedf62ef68f55deba8e | 8c0f20e0ebd607fb35812fd02f63a83affd37d74 | refs/heads/master | 2021-01-25T06:06:18.042653 | 2016-08-13T15:38:09 | 2016-08-13T15:38:09 | 26,538,858 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,018 | h | /*
* Copyright (c) 2004 Nokia Corporation and/or its subsidiary(-ies).
* All rights reserved.
* This component and the accompanying materials are made available
* under the terms of "Eclipse Public License v1.0"
* which accompanies this distribution, and is available
* at the URL "http://www.eclipse.org/legal/epl-v10.h... | [
"piashishi@qq.com"
] | piashishi@qq.com |
256ee665a5f4cad889dec9cdad5cb0733199a191 | 6019cb0f410555261679e7ad668f22093ea6cc8b | /leon2Pimple/590/uniform/cumulativeContErr | bfffd4f0f2ba6fed6713484e225b5ff0054a7b06 | [] | no_license | LuisEnriqueSG/TFGVientoCiudadDeLeon | 8f4bad9493814042fb4a63cbadf78aead4c3c300 | a9e01ee4333eea294c64bc1e0c151d5ac95f4ef7 | refs/heads/master | 2023-06-15T10:08:06.139712 | 2021-07-06T19:49:56 | 2021-07-06T19:49:56 | 383,582,024 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 997 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v2012 |
... | [
"lsancg03@estudiantes.unileon.es"
] | lsancg03@estudiantes.unileon.es | |
d2c144e0b445a81a0c3c94e89065a0cfd79182a6 | 05ace75fffe21a2d375e3611571f1a815d3c0fbc | /5.4.2/Core/src/server/scripts/Pandaria/Island/zone_timeless_isle.cpp | 892b162fceb72bed2374798ca6cd171d0d6123b3 | [] | no_license | DeKaDeNcE/Project-WoW | 97fcf9b505f2cd87e2fb17b27d92d960cdc12668 | 9307425445316cc4e88c73e116d4ea4d440d5ac2 | refs/heads/master | 2021-05-27T09:11:53.994059 | 2014-02-20T06:29:42 | 2014-02-20T06:29:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 466 | cpp | /* Copyright (C) 2010-2014 MiniX <http://www.>
*
* This file is free software; as a special exception the author gives
* unlimited permission to copy and/or distribute it, with or without
* modifications, as long as this notice is preserved.
*
* This program is distributed in the hope that it will be useful, but
* WITH... | [
"pat_66696@hotmail.com"
] | pat_66696@hotmail.com |
6ae65ce0d1854a6cdd39bd633c2d2a216fb21510 | 244834fa5ae3b54aaf13e7f0fa5fd738c4e82f6b | /InapMessage.cpp | 89eb68b194b1dd832619840aaed6ae053b5ba924 | [] | no_license | kaaalto/protoVSCP | 44e893b73c7aa137565e7a0eb19ffaa4c56c1f6f | 1c7ba2fbbff51ddd2e3799b4a94c06bb75e7eb7e | refs/heads/master | 2021-12-29T11:48:46.042596 | 2016-04-13T12:03:24 | 2016-04-13T12:03:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,586 | cpp | /**
* Prototype VSCP
* Copyright (C) 2012, 2013 Kalle Aalto <kalle.aalto@vmail.me>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at... | [
"kalle.aalto@student.samk.fi"
] | kalle.aalto@student.samk.fi |
49d3d521caa7e05a776a4671a92f9f2a3578a068 | d7b7dcec797f3294b1de671d1f84e354c93a1308 | /physx/source/foundation/FdFoundation.h | 3661100c058107c275a6eb85858a702cf3492dfa | [
"BSD-3-Clause"
] | permissive | NVIDIA-Omniverse/PhysX | c93ed4287a57d51fda56798b5fae8aaa65cdfa13 | e8c8deb2d548dc635db4f61083ea0e745c0102a0 | refs/heads/main | 2023-08-16T14:46:51.919670 | 2023-07-25T17:22:31 | 2023-07-25T17:22:31 | 545,381,143 | 1,814 | 216 | BSD-3-Clause | 2023-08-28T19:47:10 | 2022-10-04T09:07:32 | C++ | UTF-8 | C++ | false | false | 5,433 | h | // 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 the following disclaimer.
// * Redistributions in binary... | [
"preist@nvidia.com"
] | preist@nvidia.com |
e27e1ad0cd4932ad4b549465afac893d07094edb | 0faebfb92745a4c42c3e3a9f5093882ca9d1e1db | /src/crypto/key/ed25519.h | 774a0d91503333f6f4f6cdc9187233b8907e6c37 | [
"BSD-3-Clause"
] | permissive | ChristopherBilg/ntcp2 | 202e92a6f006fe8ebdb4b49f33a5220fe1e8bce5 | cbc68d99bb9035be545365ac99d24c3a9f43e45f | refs/heads/master | 2022-01-13T07:26:38.700549 | 2018-12-26T03:49:24 | 2019-01-18T01:29:49 | 443,884,820 | 1 | 0 | BSD-3-Clause | 2022-01-02T22:37:06 | 2022-01-02T22:37:05 | null | UTF-8 | C++ | false | false | 2,740 | h | /* Copyright (c) 2013-2018, The Kovri I2P Router Project //
* Copyright (c) 2019, oneiric
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redist... | [
"oneiric@i2pmail.org"
] | oneiric@i2pmail.org |
eb07505d31130f9399e6dcd5894327359e06416b | af0ecafb5428bd556d49575da2a72f6f80d3d14b | /CodeJamCrawler/dataset/12_10964_50.cpp | ac4c3196253501a5747ff6dbfd78f5d4bd838d0f | [] | no_license | gbrlas/AVSP | 0a2a08be5661c1b4a2238e875b6cdc88b4ee0997 | e259090bf282694676b2568023745f9ffb6d73fd | refs/heads/master | 2021-06-16T22:25:41.585830 | 2017-06-09T06:32:01 | 2017-06-09T06:32:01 | null | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 2,823 | cpp | // topcoder.cpp : コンソール アプリケーションのエントリ ポイントを定義します。
//
#include <stdio.h>
#include <tchar.h>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector... | [
"nikola.mrzljak@fer.hr"
] | nikola.mrzljak@fer.hr |
544513a966eb6f6637d37e3452f63aa57be4a7dd | 4e4ad49f0e535e08d0630e3248d27b781bb91883 | /src/DownloadListCtrl.cpp | 094a1f7e13c6124eb143842cfb1a542c311a067a | [] | no_license | wyrover/amule | d14c77452d35e0739ed1fc96d0296fadceb5ef03 | 794fd21a0f475e424e518b9a5462977368b8acc9 | refs/heads/master | 2021-01-19T21:39:38.559208 | 2013-02-18T17:02:48 | 2013-02-19T05:51:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 42,773 | cpp | //
// This file is part of the aMule Project.
//
// Copyright (c) 2003-2011 aMule Team ( admin@amule.org / http://www.amule.org )
// Copyright (c) 2002 Merkur ( devs@emule-project.net / http://www.emule-project.net )
//
// Any parts of this program derived from the xMule, lMule or eMule project,
// or contributed by th... | [
"gonosztopi@amule.org"
] | gonosztopi@amule.org |
7152b5dd0d01a7afb60cd6cdf69a49fa6d6d729b | 42ab733e143d02091d13424fb4df16379d5bba0d | /third_party/draco/src/draco/core/encoder_buffer.cc | df98677a85b7c277f74c4984b547d80bbc23b18b | [
"Apache-2.0",
"Unlicense",
"MIT",
"CC0-1.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | google/filament | 11cd37ac68790fcf8b33416b7d8d8870e48181f0 | 0aa0efe1599798d887fa6e33c412c09e81bea1bf | refs/heads/main | 2023-08-29T17:58:22.496956 | 2023-08-28T17:27:38 | 2023-08-28T17:27:38 | 143,455,116 | 16,631 | 1,961 | Apache-2.0 | 2023-09-14T16:23:39 | 2018-08-03T17:26:00 | C++ | UTF-8 | C++ | false | false | 3,483 | cc | // Copyright 2016 The Draco 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
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agree... | [
"philiprideout@gmail.com"
] | philiprideout@gmail.com |
6d7786d3aada1082748164c173e3bdd7c0996380 | 7bd9b5aaeaa84f5fb2d4cbb03b68991df5edfc77 | /Miscellaneous Project Solutions/Verkefni/Automata/Problem A/Problem D/Problem D.cpp | 301d02d3c7b4ee80182225d6ed56b42ba8369423 | [] | no_license | agustbrokkur/University-Projects | 0a8f2b4f0f1bde658b4e98ba8fc90aa13ca5dce4 | f9fce1a4d11100d74d17b11396b998d33a4b1506 | refs/heads/master | 2021-07-04T23:29:45.176703 | 2019-05-28T15:03:22 | 2019-05-28T15:03:22 | 188,128,011 | 0 | 0 | null | 2020-10-13T13:24:07 | 2019-05-22T23:37:36 | Java | UTF-8 | C++ | false | false | 2,394 | cpp | /*
* Verkefnalausnir - Fall 2016
* Verk08 - Finite Automata Programming
*
* A program that simulates an automaton A.
*/
#include <iostream>
#include <cstring>
#include <cstdio>
#define read(file) freopen(file,"r",stdin)
using namespace std;
const int DEFAULT = -1;
// The start state of A.
const int START_STATE... | [
"ahagbgaha@gmail.com"
] | ahagbgaha@gmail.com |
cb1c9dcaa390f93074f450d695f8edfacbb83db5 | 99a379e21b79f641d15e7e3fa73edbaa1e8e522e | /src/test/key_tests.cpp | 6d3a7077f6b7806a0ae85c480961b18d49bdf5f7 | [
"MIT"
] | permissive | JosephLee9297/RimeCoin | ff019ed6771874bbd4e77352d57d86d999c461d4 | 2dd1c608793a445c4000d0942a1ed113fde80353 | refs/heads/master | 2020-03-30T22:24:37.371243 | 2018-10-05T03:18:55 | 2018-10-05T03:18:55 | 151,665,309 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,175 | cpp | #include <boost/test/unit_test.hpp>
#include <string>
#include <vector>
#include "key.h"
#include "base58.h"
#include "uint256.h"
#include "util.h"
using namespace std;
static const string strSecret1 ("5HxWvvfubhXpYYpS3tJkw6fq9jE9j18THftkZjHHfmFiWtmAbrj");
static const string strSecret2 ("5KC4ejrDjv152FGwP3... | [
"josephlee9297@hotmail.com"
] | josephlee9297@hotmail.com |
04b58fac4f06dc1ab9ce8f922849317b52ac01ba | 6c3a5fdc90fa4a62be3d8a97f378ae222f1d3b84 | /Chapter_04_Divide_and_Conquer/exercise_code/4.1-5.cpp | ab9a6cd8fb0c043faf4b35a43940f14df8861693 | [] | no_license | QiangL-DUT/CLRS | 6f57b9d96aea956d986ecba19dd5dfe0026e2b7b | fb632e80c63bcbad0905112a8e367f140486482f | refs/heads/master | 2020-04-06T06:47:22.064530 | 2016-08-26T02:49:29 | 2016-08-26T02:49:29 | 65,347,343 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,140 | cpp | #include <iostream>
#include <time.h>
#include <vector>
using namespace std;
vector<int> FindMaxSubarrayLinear(const vector<int>& A, int low, int high) {
int sum = INT_MIN;
int cur_sum = INT_MIN;
int left, right;
int cur_left, cur_right;
for (int i = low; i <= high; ++i) {
if (cur_sum > 0) {
cur_sum += A[i];... | [
"noreply@github.com"
] | QiangL-DUT.noreply@github.com |
dda398c2a278eced4fb7cd3609a091e750ee6a52 | d1cee40adee73afdbce5b3582bbe4761b595c4e1 | /back/RtmpLivePushSDK/boost/boost/mpi/detail/mpi_datatype_oarchive.hpp | 7f052bf5f8a60b6278b22f15de0c37d6fb6b8b35 | [
"BSL-1.0"
] | permissive | RickyJun/live_plugin | de6fb4fa8ef9f76fffd51e2e51262fb63cea44cb | e4472570eac0d9f388ccac6ee513935488d9577e | refs/heads/master | 2023-05-08T01:49:52.951207 | 2021-05-30T14:09:38 | 2021-05-30T14:09:38 | 345,919,594 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,503 | hpp | // (C) Copyright 2005 Matthias Troyer
// Use, modification and distribution is subject to 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)
// Authors: Matthias Troyer
#ifndef BOOST_MPI_DETAIL_MPI_DATATYPE_OARCHIVE_HPP
#define BOOS... | [
"wenwenjun@weeget.cn"
] | wenwenjun@weeget.cn |
e8f78d7f76006e19b3ce8e5b70477687618654f5 | b3727d3b2a19e7606f0d0811a01676d8877f3e7c | /src/Pipe.h | a8c5109631c85a2881109139562ab89149792aa8 | [] | no_license | jaidenmeiden/cpp-pipes | 5914ecc93b2eb2b6a7710ef774e4a3853f65ef92 | e92fc5128086362f87e053da17efef60b66e7519 | refs/heads/master | 2023-03-14T18:06:27.842993 | 2021-03-09T15:08:27 | 2021-03-09T15:09:21 | 346,041,008 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,093 | h | ///////////////////////////////////////////////////////////////////////////////
// Pipe.h
// ======
// base contour following a path
// The contour is a 2D shape on XY plane.
//
// Dependencies: Vector3, Plane, Line, Matrix4
//
// AUTHOR: Song ho Ahn (song.ahn@gmail.com)
// CREATED: 2016-04-16
// UPDATED: 2016-04-29
/... | [
"jaidenmeiden@gmail.com"
] | jaidenmeiden@gmail.com |
08524a6983721f80cc3aa14936c6b2dabdcb1eaf | 641cb04a7834319856ca14ec18363c269da6511e | /cache/j1dbj30/main.cpp | 207923c67a2b9e1ca3437f7f41e0265b40b8990c | [] | no_license | nafisayaz/Online_Code_Editor | fc733958450eff563b463619714539603137be29 | 469996dd86c3d1120eed1c96c219a98181097ccd | refs/heads/master | 2021-01-17T18:49:09.885223 | 2018-09-04T07:47:57 | 2018-09-04T07:47:57 | 71,561,750 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6 | cpp | hcgvc
| [
"nafisayaz47@gmail.com"
] | nafisayaz47@gmail.com |
d259076f0d004c06414da2457193d436bce21713 | bc5ac8c236b373f0926e3df701e973a489311b4d | /tensorflow/compiler/xla/python/types.cc | 2e76b89faf7f4e01ae78a60e33902fcea849821c | [
"Apache-2.0"
] | permissive | seanpmorgan/tensorflow | 3aec5cfc9ec9a2c4b3092084a7644a8cbd0f0b16 | 0d2d79e84c9bdf71c737ad17a7b1dc04d9efc24f | refs/heads/master | 2021-06-02T03:03:21.690495 | 2019-05-13T17:36:04 | 2019-05-13T17:48:40 | 139,466,502 | 1 | 1 | Apache-2.0 | 2018-12-07T16:33:15 | 2018-07-02T16:18:44 | C++ | UTF-8 | C++ | false | false | 7,087 | cc | /* Copyright 2019 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... | [
"gardener@tensorflow.org"
] | gardener@tensorflow.org |
9869f59c9463d19ece5cb45f35e1cf9e49815265 | c5613dbf12c2715161e9bf56698581dfd665b010 | /q.cpp | 46a1ed8320c060f5a1112b1be2da9828926483a5 | [] | no_license | beingOptimusP/snake-game | cc0bedf016c49c3bebe2ba4ceaa3ae24cfadb47b | 76abd4ed744c6addff444f502b8513f76bb901cd | refs/heads/main | 2023-03-20T07:56:19.476034 | 2021-03-07T10:14:54 | 2021-03-07T10:14:54 | 328,433,834 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,494 | cpp | #include<bits/stdc++.h>
using namespace std;
string print24(string str)
{
// Get hours
int h1 = (int)str[1] - '0';
int h2 = (int)str[0] - '0';
int hh = (h2 * 10 + h1 % 10);
// If time is in "AM"
if (str[6] == 'A')
{
if (hh == 12)
{
str[0]='0';
str[1... | [
"75676297+beingOptimusP@users.noreply.github.com"
] | 75676297+beingOptimusP@users.noreply.github.com |
47fe8f5cf9869d8075bb7b79effe815c00e22791 | 1df747745ab94e83b8d2b09d32f8c98d34a032eb | /Algorithm/Math/10986_나머지 합.cpp | 1cad430c264436f83faed4a2b5fd851e0821e3d6 | [] | no_license | KyuJeong/Algorithm | 63770e204163ee96a76dc8efaf295da655432375 | 2dfd3b6a28c06f5f9e1a73169ff7d2dc2631f742 | refs/heads/master | 2023-07-19T23:00:25.449098 | 2023-07-15T07:29:54 | 2023-07-15T07:29:54 | 111,201,004 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 733 | cpp | #include <bits/stdc++.h>
using namespace std;
#define MAX 1000001
typedef long long ll;
/*
(A[i] + ... A[j]) % M == 0
=> (S[j] - S[i-1]) % M == 0
=> S[j] % M - S[i-1] % M ==0
=> S[j] % M == S[i-1] % M
즉, 구간의 나머지가 0이 되려면 S[j] % M == S[i-1] % M이 되어야 한다
cnt[k] = S[i] % M == k인 i의 수라 하고
조합(cnt[k],2) 하면 답
*/
int N,... | [
"heo0414@naver.com"
] | heo0414@naver.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.