blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 2 247 | content_id stringlengths 40 40 | detected_licenses listlengths 0 57 | license_type stringclasses 2
values | repo_name stringlengths 4 111 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringlengths 4 58 | visit_date timestamp[ns]date 2015-07-25 18:16:41 2023-09-06 10:45:08 | revision_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | committer_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | github_id int64 3.89k 689M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 25
values | gha_event_created_at timestamp[ns]date 2012-06-07 00:51:45 2023-09-14 21:58:52 ⌀ | gha_created_at timestamp[ns]date 2008-03-27 23:40:48 2023-08-24 19:49:39 ⌀ | gha_language stringclasses 159
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 7 10.5M | extension stringclasses 111
values | filename stringlengths 1 195 | text stringlengths 7 10.5M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d245cc545a090df4fc5e876d431eef43ca43d5c1 | f0556fbb206661c333277cfaacbd14418dbb29d8 | /QtDownloadManager/cnetworkam.h | aa64991380482d413400ea0db4274ed126dc7e26 | [] | no_license | Usman-Sheik/MY14 | 878699b031bc40f24212fb7c6a883ea321d5a8fa | ed344b0bb233719f82d32a6d60705e24337c2d43 | refs/heads/master | 2021-05-26T12:33:31.231103 | 2012-01-04T13:47:32 | 2012-01-04T13:47:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 760 | h | cnetworkam.h | #ifndef CNETWORKAM_H
#define CNETWORKAM_H
#include "mainwindow.h"
#include "ui_mainwindow.h"
#include "cprogressbar.h"
#include <QMainWindow>
#include <QMainWindow>
#include <QNetworkAccessManager>
#include <QtWebKit/QWebView>
#include <QUrl>
class cNetworkAM : public QObject
{
Q_OBJECT
QNetworkAccessManager... |
bf3af390c52373bcade03c00ec6b4ffdec1ed5b4 | 533c54472da78d183356180f128977977cbbb853 | /src/ripple/core/JobCoro.h | 9a762bd65ead43bc25b6de8b2fd29bfa5fce70ed | [
"MIT-Wu",
"MIT",
"ISC",
"BSL-1.0"
] | permissive | gcbpay/R9RIppleRoutes | 7d3caec3181f3075527656d4c96e7b5948e19aec | 8fdef0379a3fa05cf783b805b07ef87570db8886 | refs/heads/master | 2021-01-19T06:08:23.662331 | 2018-03-23T03:17:31 | 2018-03-23T03:17:31 | 72,002,525 | 7 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 3,162 | h | JobCoro.h | //------------------------------------------------------------------------------
/*
This file is part of rippled: https://github.com/ripple/rippled
Copyright (c) 2012, 2013 Ripple Labs Inc.
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby ... |
01dafee6e7962e49d7a57d14c0ba6ef645fd1ce5 | d723688f1e6c2c8a1dc36e6bec28f57d4ed2002a | /HEVD_Solutions/main.cpp | 84055ba51372e10a563b4752e6569386b339feed | [] | no_license | yuvaly0/HEVD_Solutions | bda17218a3c19b5e9fa8f412a5797389936e9f78 | 9f9198609f8305ed17ce9736c7db4e250160b2ab | refs/heads/master | 2022-12-16T13:16:30.533434 | 2020-09-15T12:54:16 | 2020-09-15T12:54:16 | 286,802,900 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 757 | cpp | main.cpp | #include <Windows.h>
#include <iostream>
#include <memory>
#include "utils.h"
#include "Solutions.h"
#define MAX_CHOICE 9
#define MIN_CHOICE 1
int main()
{
LPCWSTR lpFileName = L"\\\\.\\HacksysExtremeVulnerableDriver";
HANDLE hDeviceHandle = CreateFile(lpFileName,
GENERIC_WRITE | GENERIC_READ,
0,
NULL,
OP... |
4e4f6cd29b7ec68bc7ef548fa06c586630539de0 | 5a7d9584b703cb54b4a5d8058383ac5ad90669e3 | /ClientGame/ScoreDoublePowerup.h | 2922a98334f36a2c5bbb5100b8acaa31c8b38f5e | [] | no_license | d909b/GADEL-Snake | 049c435ff8b5ab9105ccde3db782071084c689cc | 158153d04ec5f2ac8fe7817debd43ea3e929403b | refs/heads/master | 2016-09-06T18:10:45.313346 | 2013-01-15T19:06:44 | 2013-01-15T19:06:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 558 | h | ScoreDoublePowerup.h | //
// ScoreDoublePowerup.h
// ClientGame
//
// Created by Patrick Stapfer on 13.01.13.
//
//
#ifndef __ClientGame__ScoreDoublePowerup__
#define __ClientGame__ScoreDoublePowerup__
#include <iostream>
#include "Powerup.h"
class ScoreDoublePowerup : public Powerup
{
public:
ScoreDoublePowerup(Vector2 position, ... |
35b9653cb168c4669dd451f6511fa42bc4dbab16 | a2b44d400211c8ab74b0beedd97f26c71b4dd0c2 | /intersection-arrays.cpp | 7b4e5ad3d962943793017586d0caa994720c50b8 | [] | no_license | unyieldingGlacier/coding-exercises | b8eddaed696f990a517e3ff3b586310d8a205c02 | 51fd18224b9ea66c6c373a55d66b3430efff7686 | refs/heads/master | 2021-09-06T13:02:57.030033 | 2018-02-06T20:45:01 | 2018-02-06T20:45:01 | 67,652,126 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,284 | cpp | intersection-arrays.cpp | /* LC 349
* Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].
Note:
Each element in the result must be unique.
The result can be in any order.
*/
//approach 1 - sort and process duplicates while iterating
class Solution {
public:
v... |
3cf30e15db2bdf1b0c4bb0b7d1047126e66a4421 | 36a4dbd239d0039ab28c216b0bf1f7710bda9df2 | /Cilia.cpp | ec77771de498d606930f9028cb8bdec2c15cfc81 | [] | no_license | Haptic-Solutions/CiliaLinuxSDK | 1350a4103cc02ac71a68d1ec45ab4bf9e07eff14 | 075b1477f6c765cf46054505c9e8cc2e34fd2e3c | refs/heads/main | 2023-06-22T10:06:26.029763 | 2021-08-03T02:30:19 | 2021-08-03T02:30:19 | 392,161,630 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,316 | cpp | Cilia.cpp | #include "Cilia.h"
namespace CiliaSDK
{
std::list<unsigned char> Cilia::sCiliaGroups[GVS::NUMBER_OF_SURROUND_POSITIONS];
std::list<unsigned char> Cilia::sActiveCilias;
RGB::RGB(const std::string aRGBString) : red(0), green(0), blue(0)
{
std::stringstream redStream;
std::stringstream greenStream;
std::strings... |
617961c6eb8f5d7a74007276eadf5fcca1ba792b | f8699c3b4476df654e79d728a3eccae2ed345fec | /1 Semesters/3/Data structures/Programs/99Semester/1Lab Assingment/Enter data in specific INDEX.cpp | 5b611c2ea31d58f9adb604ec350b196447542988 | [] | no_license | pseudo-usama/my-undergrad-coding | 91e6953b4ef4382badf620fa944a11aa8d3810b5 | 1d54c09da5540581b00029c49a9ccb84c24a4cf7 | refs/heads/master | 2023-08-30T08:45:32.571317 | 2021-10-08T06:20:41 | 2021-10-08T06:20:41 | 374,524,915 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,124 | cpp | Enter data in specific INDEX.cpp | // Enter data in specific INDEX.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "iostream"
using namespace std;
void main() {
int const L = 10;
int Array[L];
int Index, Length = 0, Option;
do{
cout << endl << endl;
cout << "To enter Data : 1" << endl;
cout ... |
4e82a13a04e93e0434a3012cc85d0631dd927d75 | dea204238c6e2090b62c4a14504128966ea1b13d | /c1/s2/TP_10/myMatrix.cpp | 70c196f2f2a0bbdb4be3c52885c0d0a4b5cf6c4f | [] | no_license | hijarian/KSU-algorithmization-courses | b8341050440f31e613d67fa85577b809f70b16f3 | 3cd8601f5df9f3bd405feb4d9bcdc6bdb2b82fe1 | refs/heads/master | 2020-04-16T12:33:06.326689 | 2012-07-16T09:48:55 | 2012-07-16T09:48:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,493 | cpp | myMatrix.cpp | #include <iostream>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
typedef vector <int> intvec;
typedef vector < intvec > matrix;
const int intL=3;
void vecPrint(intvec* vec)
{
intvec::iterator It=(*vec).begin();
for(It; It!=(*vec).end(); ++It)
{
cou... |
8413943cb91a871090174bba457d55baa344ff51 | 0532e09d56b586ab10fbb623c0386994e40ab87d | /Professional C++, 5th Edition/Exercises/c11_exercises/11-4/simulator_internals.cpp | 7566953b58a53f70c160c1c303de41cd68db2eaa | [] | no_license | chosungmann/book-examples | fae7245e8071f1326033971d0c108b61c7739f2f | 368597886374131856aff3ea819dd5432a8de27b | refs/heads/main | 2023-07-19T18:58:21.009598 | 2023-07-17T07:24:52 | 2023-07-17T07:24:52 | 115,195,777 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 129 | cpp | simulator_internals.cpp | module simulator:internals;
namespace Simulator
{
double convertMilesToKm(double miles)
{
return miles * 1.6;
}
}
|
f25a171bfd92db276509b89aced7f0f5dec2cd05 | 057c0bd665943b517a467539fb8ae51645dc14c5 | /src/joystick/joystickdata.cpp | 64bd34120e7a691cda46046ddb133a8f97275a7b | [
"Apache-2.0"
] | permissive | HaskiDuan/ROVGS | a00b655cea9604f2101ede99b22e0983116a3f1c | 1194a86c1ab741e3c43b3fbacfbe9253339d1ffd | refs/heads/master | 2021-09-15T22:43:40.062344 | 2018-06-12T00:59:23 | 2018-06-12T00:59:23 | 125,141,157 | 3 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 891 | cpp | joystickdata.cpp | #include "joystickdata.h"
JoystickData::JoystickData(QObject* parent)
: QObject(parent)
{
}
JoystickData::JoystickData(const short &xValue,const short &yValue,const short &zValue,const short &yawValue,QObject* parent)
: _xValue(xValue),_yValue(yValue),_zValue(zValue),_yawValue(yawValue),QObject(parent)
{
}
... |
f65d7e8c8643fbe5378c1a2cb96f1a038fbe3163 | 74b7d2e04a23f61a68485c43acfcb0678ca0b93b | /Source/Atrc/Core/Material/MicrofacetDistribution/BlinnPhong.h | 8e97babd58e499e2c1a01785d7ce72e74376420c | [
"MIT"
] | permissive | Ilinite/Atrc | bded8e19d60dbe32b7265e797bb0afab25551ca6 | 94db1512755eb4df1b01679bafbc60e471f03b42 | refs/heads/master | 2020-06-28T13:16:45.337518 | 2019-06-04T07:12:06 | 2019-06-04T07:12:06 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 669 | h | BlinnPhong.h | #pragma once
#include <Atrc/Core/Core/CoordSystem.h>
#include <Atrc/Core/Material/Utility/MicrofacetDistribution.h>
namespace Atrc
{
class BlinnPhong : public MicrofacetDistribution
{
Real e_;
public:
explicit BlinnPhong(Real e) noexcept;
Real D(const Vec3 &H) const noexcept override;
Real G(... |
cc01a824b0618b3cd7b8a3fe83980b406d4424e6 | aadbdd69feb5b7fdbf6f57d5ebfc56477b452b04 | /avsp.cpp | fec26b65e299fc97bff25b44d3da85c7b420c8a5 | [] | no_license | aryandosaj/CompetetiveProgramming | 16c5dd0d7800288078d250973a9b1d5cb884ebf1 | e1be46316f4d14eaaffa54b3f36728e8be1f2b1a | refs/heads/master | 2021-06-05T12:37:13.868842 | 2020-07-20T10:24:26 | 2020-07-20T10:24:26 | 145,744,715 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,090 | cpp | avsp.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define I insert
#define vll vector<ll>
ll power(ll a, ll b, ll mod)
{
ll c = 1;
while (b > 0)
{
if (b % 2)
c *= a, c... |
a7ed15a1cd24a934cbc04dcfe63e92efe6078d0a | 90aaa9b4b7f29faa591193f135d82b608e3518c0 | /OrderBookVI/OrderBookVI/iTools.cpp | 598cac907c232371983732dc020ba89ac35d48fa | [] | no_license | kjw0612/hb | 5f4c96177afa23deea533d0568c8867c6a1d9df4 | c0a21aefec1f34ccf02b1d499c7dcae9966d04e6 | refs/heads/master | 2021-03-27T20:51:23.220903 | 2013-11-27T14:48:05 | 2013-11-27T14:48:05 | 7,850,298 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 417 | cpp | iTools.cpp | #include "stdafx.h"
#include "iTools.h"
int stoi(string &S) {
int res = 0;
int mi = 0;
if (S.size() > 0 && S[0] == '-') mi = 1;
for(int i=mi;i<SZ(S);i++) res = res * 10 + (S[i]-'0');
if (mi == 1) res = -res;
return res;
}
LL stoi64(string &S) {
LL res = 0;
int mi = 0;
if (S.size() > 0 && S[0] == '-') mi = 1;
... |
1174a727aba40406b551c46e586b30d0f4952aec | 2df8aa5b9ec4d925741c5d7cb42b225110d79948 | /622.设计循环队列实现.cpp | bab4fe14451e34b2319981679eecb8e63eede63d | [] | no_license | ljxia1994/leetcode111 | 214df185060e835943e369542c6d2c646e9e385a | 1ee56a7ff1cc15618ab55e30cde763751fd2ba68 | refs/heads/master | 2022-12-09T02:29:00.798761 | 2020-09-03T16:44:19 | 2020-09-03T16:44:19 | 292,621,720 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,125 | cpp | 622.设计循环队列实现.cpp | ////用vector设计循环队列类实现
//#include<iostream>
//#include<vector>
//
//using namespace std;
//
//class MyCircularQueue {
//private:
// vector<int> data;
// int head;
// int tail;
// int size;
//
//public:
// //初始化
// MyCircularQueue(int k) {
// data.resize(k);
// head = -1;
// tail = ... |
a63e8c7936c2f4575b14866027c9e8355b483f63 | f2a2498ca53bf42e4b5f26544e9f4f30f1becb0a | /linearList/2.2/10.cpp | 744f6916b2d4190e09cbb5c66dfc266e4daa9884 | [] | no_license | liqia/dataStructure | 406253affa88fc551242cee56827dce8a8449944 | 2a9efd309c7302374efa4ffe85a40a818fe30d2a | refs/heads/master | 2020-03-17T06:10:42.273739 | 2018-06-21T02:30:32 | 2018-06-21T02:30:32 | 133,344,781 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 504 | cpp | 10.cpp | #include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
void leftN(vector<int> &r,int n){
int *b=new int[n];
for(int i=0;i<n;i++){
b[i]=r[i];
}
for(int i=n;i<r.size();i++){
r[i-n]=r[i];
}
int j=0;
for(int i=r.size()-n;i<r.size();i++){
r[i]=b[j];
... |
d9adff83b22eab8742c014882027ac6f98bb729e | 7a615a4818cbad72fe6bc21d169200c8982d0cd1 | /src/basic/vx_util/ascii_header.cc | 27c1d69a1a9c32142c62651cd9e36f974f8c52e4 | [
"Apache-2.0"
] | permissive | dtcenter/MET | 860f42331d22f6b616320bb4629aaecc8ac8db67 | 3f0411b65cef5719bf11b6fb75f7e8413fe633f0 | refs/heads/main_v11.1 | 2023-08-02T00:38:11.726674 | 2023-08-01T22:36:19 | 2023-08-01T22:36:19 | 184,336,905 | 46 | 21 | Apache-2.0 | 2023-09-14T18:50:21 | 2019-04-30T21:56:39 | C++ | UTF-8 | C++ | false | false | 15,211 | cc | ascii_header.cc | // *=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
// ** Copyright UCAR (c) 1992 - 2023
// ** University Corporation for Atmospheric Research (UCAR)
// ** National Center for Atmospheric Research (NCAR)
// ** Research Applications Lab (RAL)
// ** P.O.Box 3000, Boulder, Colorado, 80307-3000, USA
// *=*=*=*=*=*... |
1a0527322ea2425748149d97c9bbcae58d6d5ce9 | fcb40f62a31fdf622bc454dd08554abbb3217177 | /helper.h | cfb99b300257ea2fc7aeff3408fbcce18497c51e | [] | no_license | chenreny/DNA-alignment | f69650ee5e0e1f095193301e0030c1e50a0c2730 | d8adce08585ebacbee88dd49a6a7dc20ddb8ee7c | refs/heads/master | 2020-03-28T15:00:36.013754 | 2018-09-13T07:08:26 | 2018-09-13T07:08:26 | 148,546,340 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 606 | h | helper.h | //
// helper.h
// genome string problem
//
// Created by Renying Chen on 8/16/18.
// Copyright © 2018 Renying Chen. All rights reserved.
//
#ifndef helper_h
#define helper_h
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include "murmur3.h"
using namespace std;
class Solver{
pub... |
9c4759eee264ccbfa62fe0090ea7bcee8da2c968 | 97e76ec354c5b7f74b3485317ce01a68e21dd8f2 | /zsg/day01/LeetCode_0507_206_01.cpp | 5c66c53c8bcf8fdd2393e70055df04286ed7ff3c | [] | no_license | ShixianGuo/LeetCode | 870c23929e361f20becf9b070eadbe4b95faa218 | cefaca1f2b70e13b9894bc4bfaa28fe90454b8b4 | refs/heads/master | 2022-11-08T08:39:45.176535 | 2020-06-05T05:05:19 | 2020-06-05T05:05:19 | 259,957,334 | 11 | 34 | null | 2020-06-05T05:05:20 | 2020-04-29T14:59:09 | C++ | UTF-8 | C++ | false | false | 954 | cpp | LeetCode_0507_206_01.cpp | #include <bits/stdc++.h>
using namespace std;
//Definition for singly-linked list.
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if (head == NULL || head->next == NULL) return head;... |
12462ca3c1de6ef6c85aa0fdd9b432271b7d1599 | 6cd1bf6544347c85cabaf672a5ed2dad94a18b63 | /kakomon/abc192_f.cpp | 4572235dafd582d883d59613e73bc78d8230e410 | [] | no_license | Shell-Wataru/AtCoder | 0a35f12478ac0ab54711171f653ce7bed5189c92 | 0ba32250f4e4a44459a4cd231ff47a5f46c4fe87 | refs/heads/master | 2023-01-10T04:21:25.199532 | 2023-01-09T04:16:30 | 2023-01-09T04:16:30 | 89,144,933 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,262 | cpp | abc192_f.cpp | #include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <limits>
#include <cmath>
#include <iomanip>
#include <functional>
#include <random>
#include <set>
using namespace std;
using ll = long long;
ll answer(vector<ll> &A,ll N, ll X,ll K){
... |
8138f77675975b21206a5953ce0465187ccc8d3e | 12230a10063eabbcfa11da5b88ceacf01c720998 | /main/src/nvs.cpp | b7eb27bad0a1faf009775bc57cdf456757c4916f | [] | no_license | juliaschatz/die_ente_esp32 | 4f120e2e540be69f9a1337171f0eb5831a45968b | 8e4ae242d4d87112ff6f7aa88a4d1b41668fb091 | refs/heads/master | 2021-11-28T00:33:53.458233 | 2021-11-21T23:56:00 | 2021-11-21T23:56:00 | 188,526,384 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 291 | cpp | nvs.cpp | #include "nvs_flash.h"
#include "nvs.h"
void init_nvs() {
//Initialize NVS
esp_err_t ret = nvs_flash_init();
if (ret == ESP_ERR_NVS_NO_FREE_PAGES || ret == ESP_ERR_NVS_NEW_VERSION_FOUND) {
ESP_ERROR_CHECK(nvs_flash_erase());
ret = nvs_flash_init();
}
ESP_ERROR_CHECK(ret);
} |
018c19fbafb9cee99fed78401e0626b6f9282bfd | d3a8d73036e63168b5d461564073c9c8da114a48 | /EulerP78/main.cpp | 871347ecfcf288dd7a657ccd2dd426aa729b4102 | [] | no_license | BhandariRupraj/projecteuler | 42cb7b87c2e28129ee19ec0e3f07d7e05f629635 | 5e8aae487daa571b88f6a26bae323fb062a3a036 | refs/heads/master | 2021-08-23T21:57:23.374612 | 2017-12-06T18:21:51 | 2017-12-06T18:21:51 | 109,030,162 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 973 | cpp | main.cpp | #include <iostream>
#include <vector>
using namespace std;
static vector<long long> pentagon;
vector<long long> A001318(long long max) {
int i;
vector<long long> r;
for(i = 1; i * (3 * i + 1) / 2 <= max; i++) {
r.push_back(i * (3 * i - 1) / 2);
r.push_back(i * (3 * i + 1) / 2);
}
... |
563c299bfaeae3cfb04b0ca24e817f001cfe6ac9 | 5e91517915556a26a84df1895b6566d461244075 | /Source/Workshop/Interfaces/TurnBasedInterface.cpp | ad5f61e561375650017ab2a20ebe36693f7100b4 | [
"MIT"
] | permissive | MShepelin/TurnBasedWorkshop | 2d0b1bd162846a3d63c7aab0b82f1a0677964fac | d7a170c4c84c0a3c1da5ab361396cddb03237280 | refs/heads/master | 2023-03-25T09:12:49.165217 | 2021-03-13T11:28:00 | 2021-03-13T11:28:00 | 287,909,426 | 6 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 564 | cpp | TurnBasedInterface.cpp | // Copyright © Dmitriy Shepelin 2021. MIT License.
#include "TurnBasedInterface.h"
void ITurnBasedInterface::OnConnectToManager_Implementation()
{
UE_LOG(LogTemp, Warning, TEXT("Successful connection"));
}
void ITurnBasedInterface::OnDisconnectFromManager_Implementation()
{
UE_LOG(LogTemp, Warning, TEXT("Disconn... |
49e93b9d2f2a3c4f2708952d2361b265064cca23 | 5d83739af703fb400857cecc69aadaf02e07f8d1 | /Archive2/1e/f25cdd076af0ae/main.cpp | 1590ae8de937e738d98601ffb81c8ce3a361f964 | [] | 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 | 2,510 | cpp | main.cpp | #include <iostream>
#include <utility>
#include <functional>
#include <boost/any.hpp>
#include <vector>
#include <string>
#include <initializer_list>
using boost::any_cast;
template <typename F,typename... T>
using bind_type = decltype(std::bind(std::declval<std::function<F(T...)>>(),std::declval<T>()...));
template ... |
eeb978b3886ed29b1ee3322881c7f5b54dcebe38 | 3d6f999526ac252f5d68d564c553391c1c219825 | /srcs/server_src/common/pool.h | f53959cba3210f2cd19abfc7fc323b3b3aae9dd4 | [
"Unlicense"
] | permissive | kdoggdev/cncn_m2 | e77354257de654f6507bcd14f0589311318bcbc0 | 149087e114be2b35c3e1548f4d37d6618ae27442 | refs/heads/main | 2023-02-02T09:56:37.306125 | 2020-12-23T09:52:14 | 2020-12-23T09:52:14 | 337,634,606 | 0 | 1 | Unlicense | 2021-02-10T06:13:27 | 2021-02-10T06:13:27 | null | UTF-8 | C++ | false | false | 2,968 | h | pool.h | #ifndef __INC_METIN_II_COMMON_POOL_H__
#define __INC_METIN_II_COMMON_POOL_H__
#include <assert.h>
#include <string>
template<typename T>
class CPoolNode : public T
{
public:
CPoolNode()
{
m_pNext = NULL;
m_pPrev = NULL;
}
virtual ~CPoolNode()
{
}
public:
CPoolNode<T> * m_pNext;
CPoolNode<T>... |
29a9db115373a4390017ed5bcaeb0b7cd9fd8e21 | bb7645bab64acc5bc93429a6cdf43e1638237980 | /Official Windows Platform Sample/Windows 8.1 Store app samples/99866-Windows 8.1 Store app samples/Application resources and localization sample/C++/AppResourceClassLibrary/Class1.cpp | 2b9ef53f9cee7bd02beb1d8c3ef327565c2500ae | [
"MIT"
] | permissive | Violet26/msdn-code-gallery-microsoft | 3b1d9cfb494dc06b0bd3d509b6b4762eae2e2312 | df0f5129fa839a6de8f0f7f7397a8b290c60ffbb | refs/heads/master | 2020-12-02T02:00:48.716941 | 2020-01-05T22:39:02 | 2020-01-05T22:39:02 | 230,851,047 | 1 | 0 | MIT | 2019-12-30T05:06:00 | 2019-12-30T05:05:59 | null | UTF-8 | C++ | false | false | 371 | cpp | Class1.cpp | // Class1.cpp
#include "pch.h"
#include "Class1.h"
using namespace AppResourceClassLibrary;
using namespace Platform;
using namespace Windows::ApplicationModel::Resources;
Class1::Class1()
{
resourceLoader = ResourceLoader::GetForCurrentView("AppResourceClassLibrary/Resources");
}
String^ Class1::GetString()
{
... |
ac41da721b65d10e98620457d9218cf5ebebcfb0 | 201bf36dedceebe088ffa93c006357b57f259d1f | /FlipdotConfig.h | 0ba7d214a9db39b0d189966aa173cb7245ef620b | [] | no_license | cfr34k/FlipdotCpp | f026e82bb694145eb90f720b9c2bbd18ce4fe4de | e97535d61fa0153f2d60cea7fbf961ab9cc45412 | refs/heads/master | 2021-01-11T03:19:36.331315 | 2016-10-18T19:24:39 | 2016-10-18T19:24:39 | 71,023,672 | 1 | 0 | null | 2016-10-16T01:32:35 | 2016-10-16T01:32:34 | null | UTF-8 | C++ | false | false | 314 | h | FlipdotConfig.h | #pragma once
#include <FlipdotTypes.h>
constexpr int NUM_PANELS = 4;
constexpr int SCREEN_WIDTH = 32;
constexpr int SCREEN_HEIGHT = 40;
constexpr PanelConfig PANEL_CONFG[] = {
{ 0, 20, Orientation::DEG_180},
{ 0, 0, Orientation::DEG_180},
{16, 0, Orientation::DEG_0},
{16, 20, Orientation::DEG_0}
};
|
1adca82c951501ef74ab747848cf81be6b22cbcd | 9bf801d026353682d13ef8aff1146c6380baafd9 | /cpp/everydaycpp/第22章命名空间/6 未命名名字空间与全局变量的区别/1.cpp | e56140ae7130fac22eb9beb09470e15fc3f14f3d | [] | no_license | wongzigii/harkcode | 57ffd7d0d9ba382ce1d82496e958a366862c93ca | 49ecdf2cb0097860d0f04285c095a8ca6accfac3 | refs/heads/master | 2021-01-14T10:18:18.986551 | 2015-12-19T07:02:10 | 2015-12-19T07:02:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 49 | cpp | 1.cpp | #include <iostream>
namespace
{
int x=5;
}
|
b48ca5852de8460f3f85e43070c5b53a8816fe61 | a887e9eb9eb59ad3b3a2ba104e2c659768eab11b | /ex06/Buzz.hpp | 7e3d562e3a6c6b30db87b292edc9d0fda1cfa1b6 | [] | no_license | Epitech-Tek2/CPPD13 | 3cb2c0e42695af90f3043bb5a3c8e39e787063f1 | c94f844b96b61b603ece04008abd70554b8f06ff | refs/heads/master | 2023-08-18T21:09:18.724125 | 2021-10-17T12:11:39 | 2021-10-17T12:11:39 | 418,120,397 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 407 | hpp | Buzz.hpp | /*
** EPITECH PROJECT, 2021
** B-CPP-300-STG-3-1-CPPD13-clement.muth
** File description:
** Buzz
*/
#pragma once
#include "Toy.hpp"
class Buzz : public Toy
{
public:
Buzz(std::string const& name, std::string const& filename = "buzz.txt") noexcept;
Buzz(Buzz const& buzz) noexcept;
virtual... |
ee7460d5c3096e0af936784407dbea2c8beaf0c4 | 5e42800bf2f07f4697f22c89e64f89aa04f91de5 | /c++/score/transbmp.cpp | 94404cfa4207c985f756f4b788178073bccede6a | [] | no_license | trieck/source | 52cee310f8c28781996c546e05ce14baca28ac0f | ad8da1b70deef58005aa4226e36d5eefad71920a | refs/heads/master | 2023-01-22T14:44:51.389815 | 2023-01-14T23:02:21 | 2023-01-14T23:02:21 | 13,166,584 | 1 | 0 | null | 2021-06-27T21:24:46 | 2013-09-28T03:42:40 | C++ | WINDOWS-1252 | C++ | false | false | 3,347 | cpp | transbmp.cpp | ///////////////////////////////////////////////////////////////////////
//
// TRANSBMP.CPP : transparent bitmap
//
// Copyright © 1999 Rieck Enterprises
//
#include "stdafx.h"
#include "transbmp.h"
//
// Constructor
//
TransparentBitmap :: TransparentBitmap(UINT nID, COLORREF transparent)
{
m_fInitialized = FALSE... |
d9ba032736d2b28b1f51239f4819b3a70618fb4c | f5adc4e570e34ff478b19cf4c5863b1866d71537 | /Main/ImportLibraryFromZip.cpp | f7989d6548ba3e92c2dc1e18ec8a93bb5c9c668d | [] | no_license | cspark777/PDFManager | b42bafe122deaa687df634d11eaefb5d71ce23fa | 3fb75c88eb0600fa994bf5985641fd9a9d408a51 | refs/heads/master | 2021-01-01T05:10:18.302326 | 2016-05-03T23:31:54 | 2016-05-03T23:31:54 | 58,008,155 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,678 | cpp | ImportLibraryFromZip.cpp | // ImportLibraryFromZip.cpp : implementation file
//
#include "stdafx.h"
#include "Benubird.h"
#include "ImportLibraryFromZip.h"
#include "afxdialogex.h"
#include "FolderDlg.h"
// CImportLibraryFromZip dialog
IMPLEMENT_DYNAMIC(CImportLibraryFromZip, CDialogEx)
CImportLibraryFromZip::CImportLibraryFromZip(CWnd* pPar... |
3740857fcc94d380c479013e3785cccca50b3231 | c01879d0e8a206fd6e97cb9869da3f17ce998162 | /hud/TFollow.cpp | d53a75f04eb3eb8b21fb6b291ce1092778b54686 | [] | no_license | Arisego/cocotd | 4be49cdf26d3a91505f1d200f5e13f2095a33bee | f271c5f100472b1ecbb2c012070f6cf04e5d05ad | refs/heads/master | 2021-05-27T13:38:24.006039 | 2014-08-16T03:36:10 | 2014-08-16T03:36:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,207 | cpp | TFollow.cpp | #include "hud/TFollow.h"
TFollow* TFollow::create( CCNode *pFollowedNode, const CCRect& rect/* = CCRectZero*/, bool alock )
{
TFollow *pRet = new TFollow();
if (pRet && pRet->initWithTarget(pFollowedNode, rect))
{
pRet->autorelease();
pRet->mbLock = alock;
return pRet;
}
CC_SAFE_DELETE(pRet);
return NULL;
... |
f738374505d9c86efae433489160278b5f8e831c | 5cabb19260371b30e40c1189a5cd3650aeafd7b0 | /src/SpanningTreeTests.cpp | 029ce7ea18c404e05980c8c7d427a4e86ef5d0da | [] | no_license | QuentinDuval/Algorithms-Tests | 639e22d9a9bd984785a2c4ab8a591724377a1946 | d05db1cef812aeecd2c641863c4327b03c29ff01 | refs/heads/master | 2020-12-24T14:01:04.993845 | 2015-03-15T12:30:25 | 2015-03-15T12:30:25 | 31,845,130 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,827 | cpp | SpanningTreeTests.cpp | #include "GraphTests.h"
#include "SpanningTree.h"
#include "Graph.h"
#include "WeightedGraph.h"
#include "GraphTestUtils.h"
#include "utils/Algorithms.h"
#include "utils/TestUtils.h"
#include "utils/Timer.h"
#include <iostream>
namespace algorithm
{
static void graphTreeTests()
{
Graph g(6);
std::... |
2409d22b857c12021c737992e16a73a2f918d818 | b539adfd732c68af2c436447351022832e025633 | /HIT.cpp | 419ab87e8f600b150adfcee87bb4854ad4c59cef | [] | no_license | r4n4sh/IFQ | a5d8e96f3d04ec36ddd53c34181aa47971899758 | cc12efe316fd3d655d62696963b27d673d582912 | refs/heads/master | 2020-03-26T15:12:45.760433 | 2018-10-01T07:53:55 | 2018-10-01T07:53:55 | 145,028,468 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,172 | cpp | HIT.cpp | //
// HIT.cpp
//
//
// Created by Rana Shahout on 3/15/17.
//
//
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <iostream>
#include "HIT.hpp"
using namespace std;
static inline int computeBlockLevels(unsigned int n)
{
if (!n) return 1;
int clz = __builtin_ctz(n);
return clz + 1;
}
void HIT::p... |
4bfd454b032bc4ed747100a7cdb7038c83b5ae5e | 6c8b19bef62a8c5cdded566b564ae82eed60ee6b | /src/game/game_base.cpp | e7056f871780643402e64dc9a774c9b746de7553 | [
"MIT"
] | permissive | zhongjn/Maestro | d98ca44eb822f5bbb29c4dfbc61a43e1fd8e7e41 | a57bd508586f787c66ac1cbebaa821b0ef10e0d0 | refs/heads/master | 2020-06-19T17:27:53.497535 | 2019-08-26T08:50:00 | 2019-08-26T08:50:00 | 196,800,561 | 0 | 0 | MIT | 2019-08-26T08:50:02 | 2019-07-14T06:08:12 | C++ | UTF-8 | C++ | false | false | 35 | cpp | game_base.cpp | #include <maestro/game/game_base.h> |
7986d7edc60cd36af56469eaca71516bfac9b34a | 868e8628acaa0bf276134f9cc3ced379679eab10 | /firstCrude2D/we123/h10_refined/0.068/p_rgh | 8e39a827da6ae29fd4dbb10d362519a5052f9774 | [] | no_license | stigmn/droplet | 921af6851f88c0acf8b1cd84f5e2903f1d0cb87a | 1649ceb0a9ce5abb243fb77569211558c2f0dc96 | refs/heads/master | 2020-04-04T20:08:37.912624 | 2015-11-25T11:20:32 | 2015-11-25T11:20:32 | 45,102,907 | 0 | 0 | null | 2015-10-28T09:46:30 | 2015-10-28T09:46:29 | null | UTF-8 | C++ | false | false | 139,944 | p_rgh | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.4.0 |
... | |
b7065748ccb303e1ec5b56b4a510d2d8b9eccec9 | 3819fb04de99d68faee220a4d0dfddef2621cee4 | /Code/HDU/hdu_4288.cpp | 411b0ccf6d9bcd317582f66d110eb15c0530981e | [] | no_license | aroslhy/acm | 4a41e46099e2dbcf596c04e5f351f51465967598 | 26d1784e65d7513bc58549cf6d1b3926adc538ff | refs/heads/master | 2021-01-22T06:54:26.587202 | 2015-07-20T11:11:53 | 2015-07-20T11:11:53 | 5,214,096 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,816 | cpp | hdu_4288.cpp | //2012-09-17 22:25:47 Accepted 4288 1640MS 16496K 1823 B G++ Aros
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int MAXN = 100000+5;
int N, num[MAXN], r[MAXN];
int Tcnt[MAXN<<2];
long long Tsum[5][MAXN<<2];
char ope[MAXN][10];
map<int, int> mp;
bool cmp(const int a, con... |
93ced69c52494d4fbed198dccbce908706b94240 | 1e0dcdc97c933a8b0226cfa8897ae4db73bd12ee | /mod_03/ex00/main.cpp | 3593d9f25d9ccf094641593e2e7ee89f412fb63b | [] | no_license | beeguy74/cpp_modules | 95294e04896e604fd311ea39176c4e655febb97f | cc87f56b5c3d2999ff09a8b8e21c8c6690dd9e4b | refs/heads/main | 2023-08-30T11:52:30.975889 | 2021-11-16T09:06:28 | 2021-11-16T09:06:28 | 394,993,374 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 257 | cpp | main.cpp | #include <iostream>
#include "ClapTrap.hpp"
int main( void ) {
ClapTrap drZod = ClapTrap();
ClapTrap cheech = ClapTrap("Cheech");
ClapTrap chohng = ClapTrap("Chohng");
cheech.attack("Chohng");
chohng.takeDamage(2);
chohng.beRepaired(2);
return 0;
} |
42e4ee630b478ac8c3e1567fe53cadf0a450f33b | 49616bddf1f6cf68e76ab2d0be0899e233174152 | /fmacsv/src/csv/Plugin.cpp | c39186fcb466e9d97b41492613edc17fedc68e91 | [
"MIT"
] | permissive | BenjaminSchulte/fma | 40ed53a4a78f4bdf340d0b1e0a4f8656d6718abf | df2aa5b0644c75dd34a92defeff9beaa4a32ffea | refs/heads/master | 2022-03-12T12:16:19.154084 | 2021-09-18T13:01:00 | 2021-09-18T13:01:00 | 110,001,614 | 15 | 0 | MIT | 2020-12-22T10:07:09 | 2017-11-08T16:32:16 | C++ | UTF-8 | C++ | false | false | 919 | cpp | Plugin.cpp | #include <csv/Plugin.hpp>
#include <csv/CsvClass.hpp>
#include <fma/Project.hpp>
#include <fma/types/Module.hpp>
#include <fma/types/Class.hpp>
#include <fma/types/RootModule.hpp>
using namespace FMA;
using namespace FMA::csv;
using namespace FMA::types;
// ------------------------------------------------------------... |
780bddb9dbd4de042ef19e475903ca7ac76b82a2 | d4a60ad0383d2175fd749ee2d9849caedc8955e4 | /include/report/ReportResult.h | 43ec087db3a4870f606c53e2a509bd9a91bf7432 | [] | no_license | woodpecker12/iii | 5d2ff6d7286024b5680f54d83f7639d3e3a7cfbb | b5afa9e717c26f8d10288c54a4f5c5c412789e51 | refs/heads/master | 2021-08-15T08:04:01.923772 | 2017-11-17T16:27:49 | 2017-11-17T16:27:49 | 111,096,416 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 289 | h | ReportResult.h | #ifndef INCLUDE_REPORTRESULT_H_
#define INCLUDE_REPORTRESULT_H_
#include "base/BaseTypes.h"
struct ReportResult
{
ReportResult(BYTE num);
void add(WORD32 report);
WORD32 getValue() const;
ReportResult convertTigerStickChicken();
private:
BYTE originNum;
WORD32 value;
};
#endif
|
9cb77ed1cb0f790e5894054229694cb06d3514ad | 9a5c8e702f3fe75455626399b9d92e36dcbea713 | /stringWildcard.cpp | d9f9accc7f30e7715880c96389d3e2945870dca9 | [] | no_license | smile-vampire/CPP | 95ed59b00874b48ad9f3f42f031398250aa0dddf | 389e64f72c6d594d5afb2090c4c3ae94defa1604 | refs/heads/master | 2021-04-13T00:53:45.764607 | 2020-08-30T11:25:49 | 2020-08-30T11:25:49 | 249,442,162 | 2 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,049 | cpp | stringWildcard.cpp | //题目描述
//问题描述：在计算机中，通配符一种特殊语法，广泛应用于文件搜索、数据库、正则表达式等领域。
//现要求各位实现字符串通配符的算法。
//要求：
//实现如下2个通配符：
//* ：匹配0个或以上的字符（字符由英文字母和数字0 - 9组成，不区分大小写。下同）
//？：匹配1个字符
//解题思路：
//本题可以通过递归求解。从前向后一次匹配，遇到相同字符，都向后移动一个字符，如果通配符
//遇到"?"，则不需匹配，自动跳过一个字符，如果通配符遇到"*"，则可以匹配任意多个字符，包括
//0个，此时可以有三种选择，1，匹配0个，通配符向后移动一个字符，字符串不动。2，匹配1
//个，通配符和字符串都向后移动一个字符。... |
ef7398fa10746395c0d1de9eb666acac35fa6ab0 | 5eb817ee3156e89ce3024d19f52e9631ac2969e0 | /FrameWork/Monster.cpp | f677b09f49cd2845395f73fb7a83cd45f822aa6d | [] | no_license | jabtem/D2D_Dungreed | 1a872896054d92fcd3f7c8cee33e7bcfffebdab6 | 8f34fd6d8af70da00bc8958cdaf99f075b220f41 | refs/heads/master | 2023-04-17T18:04:09.031687 | 2021-04-26T20:26:33 | 2021-04-26T20:26:33 | 320,425,462 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 2,876 | cpp | Monster.cpp | #include "Include.h"
Monster monster;
Monster::Monster(void)
{
live = true;//몬스터 생사여부
state = EIdle;
next_Idle = 0;
next_Move = 0;
next_Attack = 0;
x = 400;
y = 640;
direction = Right;//캐릭터가 기본이 오른쪽이므로 반대인 왼쪽을 기본방향으로잡음
}
Monster::~Monster(void)
{
}
void Monster::Init()
{
char FileName[256];
sprintf_s(... |
d22c1935deb98360c226d26c2dd8376dc255d3a1 | dc0160bd39f42ce759c8d774e0c13219ad7f9a6f | /cp/lb/02_number_theory/euclid/cf_cardsForFriends.cpp | 131b4c2bce11ebb2f180bf7a43475eefeb8596b6 | [] | no_license | aishwarya4444/codeChallenges | 09f3db723aeb2348b9c6eb8574e17f768cb56945 | 44930432dfd72cefaa7a15db54cf05f174d0c1cb | refs/heads/master | 2023-03-07T04:12:04.934955 | 2022-11-02T16:17:28 | 2022-11-02T16:17:28 | 71,717,257 | 1 | 2 | null | 2023-03-03T06:41:43 | 2016-10-23T17:09:06 | C++ | UTF-8 | C++ | false | false | 507 | cpp | cf_cardsForFriends.cpp | /*
https://codeforces.com/problemset/problem/1472/A
https://codeforces.com/blog/entry/86406
idea is to find out maximum power of 2 that is present in w and h
*/
#include <bits/stdc++.h>
#define si(n) scanf("%d", &n)
#define sll(n) scanf("%lld", &n)
#define ll long long
using namespace std;
int main() {
int t, w, h, ... |
e9824d184b6b76856d950f20a2679911c68d2e6d | 13508677af95d0940a6774e60002c5bcfba7ae9f | /155 - All Squares.cpp | 3cf33da97e0960b2e43ac9bf17c15c0752bcba91 | [] | no_license | kuonanhong/UVa-2 | f40686287e1aa717b6da4af81d0eafa07b0afd17 | f58813d6a926f1ae4f61644d51dc1fe28b923cbd | refs/heads/master | 2021-04-30T15:22:20.138385 | 2016-06-13T06:26:44 | 2016-06-13T06:26:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 598 | cpp | 155 - All Squares.cpp | /**
UVa 155 - All Squares
by Rico Tiongson
Submitted: Feb 2, 2014
Accepted 0.018s C++
O(logn) time
*/
#include <iostream>
using namespace std;
int abs( int x ){ return x < 0 ? -x : x; }
int k, x, y, c;
int main(){
while( cin >> k >> x >> y, k || x || y ){
c = 0;
for( int cx=1024, cy=1024; k>... |
78a05c1da44964fe44a83e2b5cb562c6b9daf2f0 | 8b5842c2795d84dbe698fcc756605f035863d70f | /Compiler_GC/ClassDecl.h | 375eea805616b7e32076edf0aedca300a7a31bcd | [] | no_license | feimengspirit/compiler | 368adfcb557db09ea81664a283c110ea3474b515 | 17ca6d2b8fd6991bb3e2ea1c26ea97a9d3d171b4 | refs/heads/master | 2021-01-15T16:16:17.862910 | 2013-06-06T12:54:40 | 2013-06-06T12:54:40 | 10,526,360 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 373 | h | ClassDecl.h | #ifndef __CLASSDECL_H__
#define __CLASSDECL_H__
#include "ClassNameDecl.h"
#include "VarDecls.h"
#include "MethodDecls.h"
class ClassDecl
{
public:
ClassDecl(ClassNameDecl *cnd,VarDecls *vds,MethodDecls *mds):
m_cnd(cnd),m_vds(vds),m_mds(mds){}
~ClassDecl(){}
virtual string GenCode() = 0;
ClassNameDecl *m_c... |
14d78e5478fb781c7bde9f2913dd188567fe6cf7 | b4720fd87c7265197c7530912b899347242bde60 | /src/Evaluators/PairEvaluateIso.h | 961e0f6d316c860df223d9ceb63c5bfcaf9f439b | [] | no_license | seankhl/md_engine | c794e3407e80f6639a1c0e6f2a3fab88cea64960 | abf2a6b2fc28ee91e910b4b6d858496d1b4499c9 | refs/heads/master | 2021-08-27T16:01:43.135409 | 2016-06-09T19:41:48 | 2016-06-09T19:41:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,554 | h | PairEvaluateIso.h | #include "BoundsGPU.h"
#include "cutils_func.h"
template <class T, int N>
__global__ void compute_force_iso(int nAtoms, float4 *xs, float4 *fs, uint16_t *neighborCounts, uint *neighborlist, uint32_t *cumulSumMaxPerBlock, int warpSize, float *parameters, int numTypes, BoundsGPU bounds, float onetwoStr, float onethreeS... |
97091e600d010e960ea7bf749fd718214f5870d7 | ad3bed39a636caf7f6f0d3499e09ed8112381296 | /575.cpp | 60adaba91a151e0bf27aa5aede23ff514baf22a0 | [
"MIT"
] | permissive | JazzikPeng/UVa_Algorithm_CPP | 019f92dec05ca4d2c56957bb1ce35498027acff4 | 5de29ebc44ae8dd94b767fd5815309e5eaa7c8bf | refs/heads/master | 2020-03-19T05:49:58.395004 | 2018-06-04T03:31:31 | 2018-06-04T03:31:31 | 135,965,454 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 437 | cpp | 575.cpp | //Zhejian peng
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
char num[1000];
int k=0, ans, i=0;
while (true)
{
gets_s(num);
if (strcmp(num,"0")== 0)
{
return 0;
}
k = strlen(num);
i = 0;
ans = 0;
while (k > 0)... |
3bdbadc47d6923c96e7da4fee91206d6b5cad2e7 | cd726912664cea9c458ac8b609dd98bf33e3b9a0 | /snippets/cpp/VS_Snippets_CLR_Classic/classic SortedList Example/CPP/source.cpp | bc3817bdcfe2ae0a9017364603ec423b21fa3a78 | [
"MIT",
"CC-BY-4.0"
] | permissive | dotnet/dotnet-api-docs | b41fc7fa07aa4d54205df81284bae4f491286ec2 | 70e7abc4bcd692cb4fb6b4cbcb34bb517261dbaf | refs/heads/main | 2023-09-04T07:16:44.908599 | 2023-09-01T21:46:11 | 2023-09-01T21:46:11 | 111,510,915 | 630 | 1,856 | NOASSERTION | 2023-09-14T21:45:33 | 2017-11-21T06:52:13 | C# | UTF-8 | C++ | false | false | 1,131 | cpp | source.cpp |
// <Snippet1>
#using <system.dll>
using namespace System;
using namespace System::Collections;
public ref class SamplesSortedList
{
public:
static void PrintKeysAndValues( SortedList^ myList )
{
Console::WriteLine( "\t-KEY-\t-VALUE-" );
for ( int i = 0; i < myList->Count; i++ )
{
Con... |
e5dc22a40b7b29c0a8402bee039432a4f9d233b6 | 62cd4f7da988c4d6bc49661fa84a81a7afc3b19f | /Laba2/FileW.h | 9d1467ed433093057f4db055349c7875a1a6391c | [] | no_license | AndrewArtuhov/-Game-of-Life- | ef94d49c719884b30f4238e5047d42db7ae6501c | 640926efd47141a284092d11f1c6dc684fb38113 | refs/heads/master | 2023-01-16T02:42:23.773082 | 2020-11-28T15:16:51 | 2020-11-28T15:16:51 | 316,762,636 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 406 | h | FileW.h | #pragma once
#include <iostream>
#include <string>
#include <fstream>
#include <conio.h>
#include <filesystem>
#include <vector>
using namespace std;
class WorkFile {
enum menu_opt
{
Yes = 1,
No,
};
public:
void ReadFromFile();
void WriteToFile(vector<int> coordination);
bool IsFileOpenable(string path);
bo... |
c06519178cf2373e0c59dbe21f22f6adf2f57644 | ed187ccb35155b7f981fa6939466913d208df2cc | /sc_goods.h | a1c4e1fd0326b5439020d14dd9823933f83daf08 | [] | no_license | End1-1/ShopControl | 112d7f9810125196869233003bed1166f5f017c0 | 8c752e521b46b52110f6023ede59785c8bad7efc | refs/heads/master | 2020-03-31T14:02:30.703516 | 2018-10-09T15:39:58 | 2018-10-09T15:39:58 | 152,277,365 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 325 | h | sc_goods.h | #ifndef SC_GOODS_H
#define SC_GOODS_H
#include "sc_grid.h"
class SC_Goods : public SC_Grid
{
Q_OBJECT
public:
SC_Goods(QWidget *parent = 0);
virtual QString title();
protected:
virtual void aNew();
virtual void aEdit();
virtual void aPrepareSql();
virtual bool aDel();
};
#endif // SC_GOO... |
ad9487261043f7b201023bc0b425e1036bbd31d0 | b478344500dd269fd74bbb096bace02dbe862e05 | /Icm.cpp | c8c1189a85296fe98f4a88a2a2a05c2bb9b4f840 | [] | no_license | Nomotech/ants06 | 3ad3bac566982f5c9b7974048cda1dbb5243232a | c4539d399441d4522d5ae1d474078c4bea5a3371 | refs/heads/master | 2020-08-08T21:35:43.234672 | 2019-10-09T13:32:26 | 2019-10-09T13:32:26 | 213,925,711 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,642 | cpp | Icm.cpp | #include <Arduino.h>
#include "icm.hpp"
#include <SPI.h>
#define PI 3.1415926535897932384626433832795
ICM::ICM(int clk, int miso, int mosi, int ss) {
SS = ss;
hspi = new SPIClass(HSPI);
hspi->begin(clk, miso, mosi, ss);
Serial.begin(115200);
// SSをHightに
pinMode(SS, OUTPUT);
digitalWri... |
71a5f81769158a930015352062ecb7ee3ba5013b | 2aa75176e93bc5cee6e3c66a82acf3701af56678 | /gl2/demo/shader.cpp | 712c908d27c726302e1e9451cdff7a36aa5d152e | [] | no_license | dedowsdi/journey | 5d5c11a5e2c143f031ad2d801c731c2ca381c18a | 0e9f1dd34a6bb7d5c9c8225ef1595a8cfd188593 | refs/heads/master | 2021-06-02T00:31:44.925551 | 2020-10-05T06:14:08 | 2020-10-05T06:14:08 | 116,079,146 | 12 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,890 | cpp | shader.cpp | /*
* shader.c
* this program demonstrates GLSL shader. color is transformed as an extra
* vertex attribute.
*
* there are two ways to use vertex attribute:
* if you use glVertex.. kind stuff, use glVertexAttrib
* if you use vertex array, use glVertexAttribPointer.
*
* GLSL use varing qualified variable to ... |
4ddaea9a579abe07f55dd7aedca309af10fa1cb3 | e76e1d3bef8dda184f6ad869ef68e55b9a63f4bb | /eigen/trivialASOA.cpp | 1d2a37af3513799f92a4346c847c4fe266b97756 | [] | no_license | VinInn/ctest | 1dc634ba662e579ffe9ddabfde21fe17d9bc1534 | 8dbef5207cb3bd7d83e1874f0fce3f98e66c1915 | refs/heads/master | 2023-07-14T21:19:58.215969 | 2023-07-08T06:04:55 | 2023-07-08T06:04:55 | 21,533,811 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,707 | cpp | trivialASOA.cpp | #include<cstdint>
constexpr uint32_t ilog2(uint32_t v) {
constexpr uint32_t b[] = {0x2, 0xC, 0xF0, 0xFF00, 0xFFFF0000};
constexpr uint32_t S[] = {1, 2, 4, 8, 16};
uint32_t r = 0; // result of log2(v) will go here
for (auto i = 4; i >= 0; i--)
if (v & b[i]) {
v >>= S[i];
r |= S[i];
}
return r;
... |
ba8aee913fffd1b77d01af4641299243ca7e615f | d6f2d7af06687e423e60e50d416fa8c777c09c36 | /GSS3-14671378-src.cpp | fa3f9881a84fa3a3b6bbd9eb531ec7b5b15e5901 | [] | no_license | curiousTauseef/my-spoj-solutions | b9a70eaddaf0c3b9a43c278b9af1148806aff600 | 66b11d97073388fcebce3b74025c61839d8d5d18 | refs/heads/master | 2021-05-30T11:48:41.552433 | 2016-02-12T16:59:56 | 2016-02-12T16:59:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,831 | cpp | GSS3-14671378-src.cpp | #include<bits/stdc++.h>
using namespace std;
#define INT -1000000
int k,n;
struct node{
int result,pre,suf,sum;
void split(node &a,node &b){}
void merge(node a,node b){
sum=a.sum+b.sum;
pre=max(a.pre,(a.sum+b.pre));
suf=max(b.suf,(b.sum+a.suf));
... |
dccad8ddf2846f6cc698a7d3e54f15163d823547 | 2031012d180e590e6a46099a4409efd54f526b97 | /array.cpp | 1bb9c1ae4a152a906b32351ca9fcae43fcabac24 | [] | no_license | Oslomayor/Come-on-Cpulspuls | 885d4596f2c9df500467a30e82881a94ced55979 | e447631d0dfbd11cfd0f508555c5c37be1782dfc | refs/heads/master | 2020-03-18T11:31:11.107398 | 2018-06-02T08:13:20 | 2018-06-02T08:13:20 | 134,676,451 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 327 | cpp | array.cpp | #include <iostream>
using namespace std;
#include <iomanip>
using std::setw;
// 数组
int main ()
{
int n[10];
int i;
for(i=0;i<10;i++)
n[i] = i + 555;
cout << setw(8) << "Element" << setw(8) << "Value" << endl;
for(i=0;i<10;i++)
cout << setw(6) << "n[" << i << "]" << setw(8) << n[i] << endl;
return 0;... |
6990908c897f0ee49d12c20e160fd14ca92127b7 | 3c364f1e3d0af0b650b96b1ac80aedd74940d3fb | /branches/unlabeled-1.9.2/plugins/jabber/jabbermessage.cpp | c5fcaa1ee419c64016cd92135d072aa31016b89c | [] | no_license | dhyannataraj/sim-im | aa8e938766f6304d9f71be883f0ef4e10a7c8c65 | 6b0d058cd5ab06ba72a34f09d44b3f0598960572 | refs/heads/master | 2021-04-03T04:26:23.903185 | 2011-10-10T15:58:45 | 2011-10-10T15:58:45 | 124,702,761 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,980 | cpp | jabbermessage.cpp | /***************************************************************************
jabbermessage.cpp - description
-------------------
begin : Sun Mar 17 2002
copyright : (C) 2002 by Vladimir Shutoff
email : vovan@sh... |
d3c48f57e2160ab4c2ff219999446e2c30105ef5 | d438954e2bb3d088190c2c0640bd3a817cacb4f5 | /Common/network.h | 1ba6a26c604015df5e00ab24e28f541c2670c2e1 | [] | no_license | danielpintocoutinho/NN-committee | 9f518a8703a3bf6511c7aff19881460d14c7c78b | 67d501739625a3acd8857f56e00c2d4572e9ec45 | refs/heads/master | 2020-12-24T10:57:39.404726 | 2016-11-09T17:49:17 | 2016-11-09T17:49:17 | 73,221,989 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 438 | h | network.h | #ifndef __NETWORK_H__
#define __NETWORK_H__
#include <iostream>
using namespace std;
template <class Type>
class Network
{
public:
virtual void setAccuracy(double){}
virtual double getAccuracy(){}
virtual void train(Type**, Type**, int){}
virtual Type* answer(Type*){}
virtual int cluster(Type*){}
virtual void ... |
6195d0222e1bcbf80521de8d717343bde01086b4 | 76f73fdc27df2cc84502e7dd665cebf614812598 | /(9465 dynamic programming)스티커.cpp | b833bbcf91ceacd6d6919c4e50f4141eb708f11f | [] | no_license | borazvim/algorithm | 7a60a20faca657084178c3f53727cd9e241a1e15 | 7afba583b5e563d5312fd0692f71cd55f0e3702c | refs/heads/master | 2020-04-22T16:07:23.194645 | 2019-03-05T05:57:29 | 2019-03-05T05:57:29 | 170,498,152 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 795 | cpp | (9465 dynamic programming)스티커.cpp | #include <iostream>
#define max(a,b)(((a)>(b))?(a):(b))
using namespace std;
long long v[100001][3];
long long d[100001][3];
int main() {
int T, N;
cin >> T;
while (T--) {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> v[i][1];
}
for (int i = 1; i <= N; i++) {
cin >> v[i][2];
}
d[0][0] = 0;
d... |
000b9acabea4e0c27654f56c9d357733c04e46c9 | da65ca32eb0012092901bd1854cb3d6fed4008c9 | /mume-game/mclient/src/plugins/mmapperplugin/preferences/parserpage.h | 8179021959fcbc12a3cb894f3fe540cdd3d49f74 | [] | no_license | alex-games/a1 | d2371f5588f4efbac8eaad0d49066ae63f293dc6 | 1521abc0092c83fcc79af9647f19bfe69a3707cf | refs/heads/master | 2020-06-04T01:34:09.171971 | 2014-10-26T06:11:32 | 2014-10-26T06:11:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,257 | h | parserpage.h | /************************************************************************
**
** Authors: Ulf Hermann <ulfonk_mennhar@gmx.de> (Alve),
** Marek Krejza <krejza@gmail.com> (Caligor)
**
** This file is part of the MMapper2 project.
** Maintained by Marek Krejza <krejza@gmail.com>
**
** Copyright: See COPYING ... |
a3dc271bbcc7bb881b3c371295f96c3c679a7107 | 6263b8313d4627b8cad28029ab084990a883e460 | /transform.h | ffd4f8d29ecd6fe970055ed2ea1162ebc740d8f3 | [] | no_license | Analyse4/word_transform | b5f399229a170c296749020e331b025460fa1f04 | 8a53c05603eb1a29cfc6a5be34fae734848b4027 | refs/heads/master | 2021-01-01T19:37:20.291219 | 2017-07-30T03:18:17 | 2017-07-30T03:18:17 | 98,629,082 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 182 | h | transform.h | #ifndef _TRANSFORM_H_
#define _TRANSFORM_H_
#include<string>
#include<map>
using namespace std;
const string &transform(const string &word, const map<string, string> &m);
#endif
|
9b94d18a49d92782aea2db8f1a8c6c7c88d1c3b0 | 453f28f5244bc02ccb38cea9a9f1614f6b0470c1 | /src/Agent/NewRelic/Profiler/MethodRewriter/FunctionManipulator.h | 56bbaf36837fb141f22423cf19ab92291420e86a | [
"Apache-2.0"
] | permissive | newrelic/newrelic-dotnet-agent | a78c182d15265cc363ee2cec2991937afc30aa07 | f52610594a24dcc3031f389b291997f70e98cf0e | refs/heads/main | 2023-08-20T09:39:50.757533 | 2023-08-18T18:57:37 | 2023-08-18T18:57:37 | 274,994,065 | 85 | 71 | Apache-2.0 | 2023-09-14T20:54:21 | 2020-06-25T19:03:04 | C# | UTF-8 | C++ | false | false | 23,812 | h | FunctionManipulator.h | /*
* Copyright 2020 New Relic Corporation. All rights reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#pragma once
#include <functional>
#include <stdint.h>
#include <sstream>
#include <algorithm>
#include <unordered_map>
#include "../Common/Macros.h"
#include "Exceptions.h"
#include "../Common/CorStandIn.h"
#includ... |
648d868b4735a55ee2f9370c509bd6b1c2a88128 | 168f6fb6f97203ea05848425682361816e88c7b7 | /include/Slim/Util/Reflection/ClassFactory.hpp | 8bd494b669c259e97c97aa9c7c87e35d05f31edf | [
"Apache-2.0"
] | permissive | zuocheng-liu/slim | 1e258e5ab296db4b0831edcf88176ab3ab3f6f43 | 6610982481934de3da1a785b2eb7765082c9c1d0 | refs/heads/master | 2020-12-14T18:40:14.557151 | 2015-12-02T12:28:01 | 2015-12-02T12:28:01 | 19,131,750 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,546 | hpp | ClassFactory.hpp | #ifndef SLIM_UTIL_REFLECTION_CLASSFACTORY_HPP
#define SLIM_UTIL_REFLECTION_CLASSFACTORY_HPP
#include <hash_map>
#include <string>
#include <cstring>
#include <cstdlib>
#include <Slim/Util/Reflection/Object.hpp>
#include <Slim/Exception.hpp>
namespace Slim {
namespace Util {
namespace Reflection {
... |
1cb62f20eddc9469f0f29e5c4f729e89d2e81fd4 | ac2d662df239581e80caff085a28158447fa584b | /Code Forces/1084/a.cpp | 201533aacefe85bbd62ef29c68be53d20e2ec5e8 | [] | no_license | basimkhajwal/ProgrammingChallenges | 4283b8a22c8ac2ccd6c0db642c607e9a5f0a797c | 0f4ea3837a9085fc4fa4a9069b1e3fdfa124f442 | refs/heads/master | 2023-08-22T08:19:52.997699 | 2023-08-15T12:55:53 | 2023-08-15T12:55:53 | 72,464,921 | 0 | 1 | null | 2019-03-16T11:37:38 | 2016-10-31T18:14:39 | C++ | UTF-8 | C++ | false | false | 381 | cpp | a.cpp | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int N, A[200];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
int ans = 100000000;
for (int x = 1; x <= N; x++) {
int t = 0;
for (int i = 1; i <= N; i++) {
t += A[i]*2*(abs(x-i)+i-1+x-1);
}
... |
0b0dca4bc1def2c2deba2142ea304a7e9e53dd6f | 29396c66f6aae81537b25c3b9e8d22ec2fbd57a8 | /SurfaceVehicles/MRUH/Arduino/MasterArduino/a20190422_mainMega/io.ino | 1b68cb0138cedb4815ea40b72fce4e0b615d8529 | [] | no_license | riplaboratory/Kanaloa | 49cbbafb7235e5d185bb4522c4deca8a3fd2c087 | 36650e2daff733a55c6546ffb0ff083b57c8c1b8 | refs/heads/master | 2022-12-11T03:00:30.284107 | 2021-12-10T07:57:00 | 2021-12-10T07:57:00 | 121,706,694 | 11 | 14 | null | 2022-12-09T16:56:36 | 2018-02-16T02:11:52 | Jupyter Notebook | UTF-8 | C++ | false | false | 9,478 | ino | io.ino | // Read kill state inputs
void readKill() {
// Read kill inputs
ch7Pulse = pulseIn(ch7Pin,HIGH); // ch 7 (remote kill switch channel)
int physKillRaw = digitalRead(physKillPin); // physical kill switch channel
// Determine remote kill swtich state (ch7)
if (ch7Pulse > ch7PulseMax - pulseTole... |
c01f98a6ef786b7471e9305bb883d910214dabd4 | 393aa0b9f22501f5e1972730efbbae6f6e0d34ba | /Juego/codigo/iCuartelGeneral.h | b8d9c1940bc0b705ee97088e59e1f23d4374efdd | [] | no_license | riseven/JRK | 5c18d7bfcf2482e2ef6ed2515a64b3e7c4b32c10 | a91da8270cc2dde33c91611a92e64c1bb143794e | refs/heads/master | 2021-01-10T18:26:35.998045 | 2012-10-09T14:49:02 | 2012-10-09T14:49:02 | 5,834,089 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 972 | h | iCuartelGeneral.h | #ifndef __I_CUARTEL_GENERAL_H__
#define __I_CUARTEL_GENERAL_H__
#include "iUnidadUniSeleccionable.h"
#include "iApi.h"
#include <string>
namespace Interfaz
{
class CuartelGeneral : public UnidadUniSeleccionable
{
private:
bool construirIngeniero ;
bool desarrollarMotivacion ;
bool desarrollarMotivacio... |
337cc697c432d86559f61a046ee39e2c8fd0a339 | a4b959855991fbca07d5f2730d6c38072962f844 | /source_files/BinaryTree.h | c0ed6e1c2dabe3aeacc2f03e37b4e8521caaf686 | [] | no_license | syedsufyan1232/CIS22C-FinalProject | a9f2077e6a52119dda287f1695f0b3c95e8c447d | c5b872c3f282aa24a69a31737046ad5170add9fe | refs/heads/master | 2020-05-28T02:29:36.684754 | 2017-03-26T01:32:39 | 2017-03-26T01:32:39 | 82,579,342 | 0 | 0 | null | 2017-03-23T04:56:12 | 2017-02-20T16:36:01 | C++ | UTF-8 | C++ | false | false | 7,201 | h | BinaryTree.h | // Syed Tihami
// BinaryTree.h
//
#ifndef BinaryTree_h
#define BinaryTree_h
#include <iostream>
using namespace std;
//***************************************************************************
//***************************************************************************
// Definit... |
b98c51c51104714f6d0ef5dac7f89d7e8360922b | 25a7f5359c1101c8a494166815aa852d2b142a96 | /MOC1_fi02mn_var2_Anatolii_Artem.cpp | 720460261d21a5a3ae63010fcad71145b0feedbb | [] | no_license | MOCLabs/Lab1 | 5545328954852cad735ecff18639dadf9c97d0db | d132a6e17232114ef39e0927ddf49bd38b69a322 | refs/heads/master | 2023-02-16T23:43:21.696835 | 2021-01-18T06:08:01 | 2021-01-18T06:08:01 | 329,137,227 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,804 | cpp | MOC1_fi02mn_var2_Anatolii_Artem.cpp | #include <iostream>
#include <string>
#include <vector>
#include <iterator>
#include <fstream>
#include <numeric>
void collect_the_csv_values(std::vector<float>& pM, std::vector<float>& pK, std::vector<float>& pC, std::vector<std::vector<uint32_t>>& table)
{
std::fstream csv_read_probs("/home/ftl/moc1/vars/prob_06.c... |
82c07ccbe2d3a18b7c3f91cfaec4e178fcfa083e | 34a2718ee82284d30406084eebaae5465692dd37 | /Classes/Utils/Common.cpp | 72873b58d1ce01d9dd60d050d182ad2be964aa8e | [
"MIT"
] | permissive | bacph178/MyCards | fc185b19ac3425a641cfb498e70c9c8f0207afef | 392b3175d1927807ad72e545233297bb93dd4651 | refs/heads/master | 2020-12-11T09:22:44.437169 | 2016-04-13T04:30:47 | 2016-04-13T04:30:47 | 56,132,684 | 0 | 0 | null | 2016-04-13T08:01:34 | 2016-04-13T08:01:33 | null | UTF-8 | C++ | false | false | 1,987 | cpp | Common.cpp | #include "Common.h"
#include <string>
#define TEST_ENVIRONMENT 1
Common::Common(std::string device_id, std::string device_info, std::string
app_version, std::string cp, std::string country, std::string language,
std::string ipaddress, int os, int channelId
) {
this->device_id = device_id;
this->device_info = d... |
f2a32e7ce243ca3956a410646735737012ea0587 | d69a44e8174e108a0e3f221ac45dea81f6fcff3e | /include/VulkanRenderer.hpp | 009ee651c94f5a7502a01325cfad9fa66ce45668 | [
"MIT"
] | permissive | azalac/VulkanGame | 99f8b6e98660bca276c270fdd98a8283c6b4ebe3 | 29ebd7e111bbe6effe1c726cbe1423b54a74f7a4 | refs/heads/master | 2020-04-20T01:54:03.266878 | 2019-04-21T17:52:08 | 2019-04-21T17:52:08 | 168,557,710 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,112 | hpp | VulkanRenderer.hpp | /*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: VulkanRenderer.hpp
* Author: austin-z
*
* Created on February 9, 2019, 9:16 PM
*/
#ifndef VULKANRENDERER_HPP
#defi... |
4e5ca44ddbd8e13c62399e292ff2d1d0bcc125bc | 2e4f485ec35f5c525f28eaee0a1005555cf61a21 | /mimetreeparser/src/bodyformatter/applicationpkcs7mime.cpp | 13c8530a06bc6e571700f63c13ef4dc66a5da8b3 | [
"CC0-1.0",
"BSD-3-Clause"
] | permissive | KDE/messagelib | 8b0174c5e4c95344a828b8bf1c31ff52cc6663d7 | ab4f300a88bb9414734296d0031cbb905a53999c | refs/heads/master | 2023-08-30T23:50:09.096181 | 2023-08-28T02:16:39 | 2023-08-28T02:16:39 | 47,712,197 | 13 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 5,948 | cpp | applicationpkcs7mime.cpp | /*
SPDX-FileCopyrightText: 2016 Sandro Knauß <sknauss@kde.org>
SPDX-License-Identifier: LGPL-2.0-or-later
*/
#include "applicationpkcs7mime.h"
#include "messagepart.h"
#include "objecttreeparser.h"
#include <QGpgME/Protocol>
#include <KMime/Content>
#include <QTextCodec>
#include "mimetreeparser_debug.h"
... |
275393de52af85b87842a4890c36aca6095f6b21 | 4b187bd1e89f6bcce100b7bd05b4ff202522bc4d | /OnlineJudgeSolutions/LightOJ/light oj 1066.cpp | 60cf2a41a85caec5e9c1757948af7f675b54ff55 | [] | no_license | codefresher32/CompetitiveProgramming | e53133a906081e7931966216b55d4537730d8ba3 | 923009b9893bdb0162ef02e88ea4223dc8d85449 | refs/heads/master | 2021-04-13T06:51:04.428078 | 2020-03-24T13:40:16 | 2020-03-24T13:40:16 | 249,144,621 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,055 | cpp | light oj 1066.cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int,int>
#define pi pair<char,char>
#define F first
#define S second
#define pb push_back
#define pp pop_back
#define mod 1000003
char s[20][20];
map<char,pii>mp;
int d[20][20],n;
int fx[]={1,-1,0,0};
int fy[]={0,0,1... |
34195170a6820c909c3053ebc14b6fc1e1aa8443 | 325802f64a2eef46af4db2351efbb9ca08922db6 | /PythonSupportSample/PythonSupport/psappinterface.h | 5e5e25da97d26598907a51f26edd377e5cf8161f | [] | no_license | 3DGISKing/DesktopAppSamples | 536905ec33b7f196560678bf1940fae4788b80c4 | 5926c001ba3c44b206ed4bed17b15e92ca53e1c6 | refs/heads/master | 2023-03-01T11:59:16.107999 | 2021-02-07T10:03:53 | 2021-02-07T10:03:53 | 336,226,357 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 535 | h | psappinterface.h | #include "./../PythonBinding/appinterface.h"
class PythonSupport;
/**
* brief Interface class to provide access to private methods in Host App for use by plugins.
*
* Only those functions "exposed" by class AppInterface can be called from within a plugin.
*/
class PSAppInterface: public AppInterface
{
public:
PSA... |
a1a5c1a2fe81622fa05fd7110cab3ed7616c9eb0 | 02d8629d0a7dd7f37a306d43987bab567ba5f053 | /tests/test_http_server.cc | c1a4ced671ff29f43e75055ad02bbb48fd01dcb0 | [] | no_license | Fiee-ma/webserver | c34b25c9bbbfebaac96f270614bbf9f8ef3a8e91 | 01802b01eee7efc6538fd45e73604b71a6a9b855 | refs/heads/main | 2023-03-11T14:18:25.249824 | 2021-02-24T13:24:39 | 2021-02-24T13:24:39 | 332,288,549 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,133 | cc | test_http_server.cc | #include "../webserver/http/http_server.h"
#include "../webserver/log.h"
static server_name::Logger::ptr g_logger = WEBSERVER_LOG_ROOT();
void run() {
server_name::http::HttpServer::ptr server(new server_name::http::HttpServer);
server_name::Address::ptr addr = server_name::Address::LookupAnyIPAdress("0.0.0.0... |
2d409811d84f30a81efb7779eead802343bcae2d | c84d6d4e0d9bbb2d628851cce996653b1ee57c9c | /Project In C++/BookStore_C++/BookStore/Person.h | 31afb7c34e8685154dff647799236d356ca5b480 | [] | no_license | Shaoun18/C-Programming-Code | f9f2f9d39f73ab3d838b54a97eba50ba3223a748 | 5870469192de9e1b6e789224d9517db9d1b71310 | refs/heads/main | 2023-03-10T04:58:23.606288 | 2021-02-16T14:06:37 | 2021-02-16T14:06:37 | 339,137,154 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 445 | h | Person.h | #ifndef PERSON_H
#define PERSON_H
#include <string>
#include <iostream>
using namespace std;
class Person
{
public:
Person();
string getLastName() const;
string getFirstName() const;
int getDateOfBirth() const;
void setName(const string& newLastName, const string& newFirstName);
void setDateOfBirth(const int n... |
0cebf545a9ef780bc7208ca64ab4e752230a73d0 | 9019962eac23ee19856de9e245729a6eab55a460 | /采用MQTT协议的嵌入式智能家居信息PC端采集显示系统/mainwindow.h | 18ec2a5498b322a06273a2a7fe1e5f94ba02070a | [] | no_license | Hppppppf/Qt_Client_IOT | 445e536a0792e57f5b83bb732528741a16f29163 | e41f398b44da4ef81a25ffe6f799a47fa9a524e6 | refs/heads/master | 2022-11-14T09:42:16.891977 | 2020-06-30T15:31:48 | 2020-06-30T15:31:48 | 276,124,950 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,287 | h | mainwindow.h | //mainwindow.h
#ifndef MAINWINDOW_H
#define MAINWINDOW_H
#include <QMainWindow>
#include <QMouseEvent>
#include <QtMqtt/QMqttClient>
QT_BEGIN_NAMESPACE
namespace Ui { class MainWindow; }
QT_END_NAMESPACE
class MainWindow : public QMainWindow
{
Q_OBJECT
public:
MainWindow(QWidget *parent = nul... |
89971a20ab80552823dccf13a7b1f99617be4a41 | 947e6096a5d70992ce9a2ad0fc64ae2fc9c8509f | /src/solver/constraints/cNQueen.hpp | 3eacebbde37f5b65e12d75c8836a0439601054d7 | [] | no_license | Asteip/KaboSolve | 488ae67d2467d586e13ee60d5ae2c12c0124483e | 644ceca5ab8ad0a67ec83cf11959c63c2ef1c73a | refs/heads/master | 2021-01-23T08:10:08.983994 | 2017-03-26T14:41:13 | 2017-03-26T14:41:13 | 80,536,121 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 230 | hpp | cNQueen.hpp | #ifndef C_N_QUEEN
#define C_N_QUEEN
#include "../constraint.hpp"
class CNQueen : public Constraint {
public:
CNQueen(Domain **domains, int size);
~CNQueen();
void display();
virtual bool applyConstraint(int id);
};
#endif |
f7353196baaaddcff61e768642317fdbbd22c16b | 93d37e668bed43232a837c5e9986ce8e75cefbaf | /1/mainFrame.h | 6adcf3e8c738b3c4bb590ead63ab39427c4409c9 | [] | no_license | ttzztztz/UML-Course-Design | f6bdca62716b5c38e30fe5e93f59e503bf21727c | dfdc8c09fad8446ad799d1f1524c011faf8f1a67 | refs/heads/master | 2023-02-16T20:15:14.025543 | 2021-01-16T23:27:23 | 2021-01-16T23:27:23 | 305,312,759 | 0 | 1 | null | 2021-01-16T14:01:58 | 2020-10-19T08:21:25 | C++ | UTF-8 | C++ | false | false | 116 | h | mainFrame.h | /**
* Project Untitled
*/
#ifndef _MAINFRAME_H
#define _MAINFRAME_H
class MainFrame {
};
#endif //_MAINFRAME_H |
1cecc5181d769c2f874831b3176b703ea43f9c05 | 744d843ae17e2ff6dd5fd9bdbb271b12ff807b62 | /TMX/Plugins/SpatPlugin/src/SpatMessage_r41.cpp | 7401492fafb01d5a9714aa0a3f013147404e6fe0 | [
"Apache-2.0"
] | permissive | ankit-derq/v2i-unofficial | 46e84827c33950a85d7ce64ee1e83ab0e3dba917 | bd0bad7724c8451eef42915d436253e40be00c23 | refs/heads/master | 2020-03-18T13:09:08.764987 | 2017-09-06T23:14:11 | 2017-09-06T23:14:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,503 | cpp | SpatMessage_r41.cpp | #include <string>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <list>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <time.h>
#include <errno.h>
#include <asn_j2735_r41/SPAT.h>
#include <asn_j2735_r41/UPERframe.h>
#include "SpatMessage_r41.h"
//#include "SPaTData.h"
... |
23b6d1a54f3861f2e28e4b1d05daaba1f3c26117 | 862aea3ca42b6a99d12755937638792ee6d819a5 | /Lab_works/Lab3_functions/User_define_function/qn4.cpp | b26eeadc19cf7704c4f6f42f132ee8aa9fa6384b | [] | no_license | Malisha-Maharjan/cpp_projects | 95c9f8f926efe0f904257613fac74d060a92c35e | 03ed4fdb792fce1a698d876209b840279b91ee9e | refs/heads/main | 2023-07-19T05:38:53.732164 | 2021-09-14T11:36:11 | 2021-09-14T11:36:11 | 366,620,037 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 383 | cpp | qn4.cpp | #include <iostream>
using namespace std;
float area();
int main()
{
float ans;
ans = area();
cout << "The area is " << ans << endl;
return 0;
}
float area()
{
float length, breadth;
float ans;
cout << "Enter length: ";
cin >> length;
cout << "Enter breadth: ";
cin >> bread... |
edeaeda53ae9e8d779e332295a2a5fc68c3bf468 | a4fa7020a1478a6531bcc2328d38b03f96072ceb | /common/interface__QT/helpers/vlabel.h | 0b76772d65aa4c0c4ecce21b0f25df0fee46eeea | [] | no_license | BearKidsTeam/CheeseTracker | 6c6afdc7358d314283182b36dfcee0d6b82bebb1 | b28694a22c88df9c71118342ec306dc2637e21a6 | refs/heads/master | 2020-04-10T05:43:45.512837 | 2018-12-09T08:34:53 | 2018-12-09T08:34:53 | 160,835,812 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 496 | h | vlabel.h | //
// C++ Interface: vlabel
//
// Description:
//
//
// Author: Juan Linietsky <coding@reduz.com.ar>, (C) 2004
//
// Copyright: See COPYING file that comes with this distribution
//
//
#ifndef VLABEL_H
#define VLABEL_H
#include <qwidget.h>
//Added by qt3to4:
#include <QPaintEvent>
/**
@author Juan Linietsky
*/
class ... |
1a5b7304d2cb2f02b24e4767977f2b2e20cafa90 | 36209169c654129de7cb3bd784ff3225bfae9536 | /AtCoder/AGC035/C.cpp | d575cea6b824e0472ccab56b569e3fde83e7ad58 | [] | no_license | tskch0626/programming_contest | 839eff14cc44abc0937a5d9c1cb981d515c99968 | bae9298f018327459522fb56d98111934d759646 | refs/heads/master | 2020-06-19T18:31:18.114493 | 2019-08-11T09:01:13 | 2019-08-11T09:01:13 | 196,823,020 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 714 | cpp | C.cpp | #include<bits/stdc++.h>
using namespace std;
int N;
int main() {
scanf("%d", &N);
if (N==1) printf("No\n");
else if (N%2==0) {
int tmp = N;
int i;
for (i=N-1; i>0; i--) {
tmp ^= i;
if (tmp==0) break;
}
if (tmp==0) {
printf("Yes\n"... |
baa747ceb434bf17137cda62ebbac3d7fc5ca6fc | a3d6556180e74af7b555f8d47d3fea55b94bcbda | /third_party/crashpad/crashpad/test/file.cc | c7b00685934d13772facaaf66aa73adc7b446c44 | [
"BSD-3-Clause",
"Apache-2.0",
"GPL-1.0-or-later",
"MIT",
"LGPL-2.0-or-later"
] | permissive | chromium/chromium | aaa9eda10115b50b0616d2f1aed5ef35d1d779d6 | a401d6cf4f7bf0e2d2e964c512ebb923c3d8832c | refs/heads/main | 2023-08-24T00:35:12.585945 | 2023-08-23T22:01:11 | 2023-08-23T22:01:11 | 120,360,765 | 17,408 | 7,102 | BSD-3-Clause | 2023-09-10T23:44:27 | 2018-02-05T20:55:32 | null | UTF-8 | C++ | false | false | 2,467 | cc | file.cc | // Copyright 2015 The Crashpad 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 agre... |
7bcea2c87cf577554724528123b9d49f9e28a4cc | 9db4ccf62f0f697c957949961751d45906c6b1ee | /Faction.h | de45c4ba1082b15da08b17f2883b4915d19ded91 | [] | no_license | JustinWang123/Wasteland | 480b2c936b979720e2031cc51fe3c0cb3b3e1661 | df7e6870dbb3eb7bf56bc739a3fa0f48eacd3579 | refs/heads/master | 2016-09-11T02:24:21.270687 | 2013-11-19T07:37:31 | 2013-11-19T07:37:31 | 14,517,396 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 674 | h | Faction.h | #ifndef FACTION_H
#define FACTION_H
#include <list>
class CharacterInstanceSoldier;
class CharacterInstanceWorker;
class CharacterCommand;
class Faction
{
public:
Faction();
virtual ~Faction();
virtual void Update()=0;
void AddSoldier(CharacterInstanceSoldier* soldier);
void AddWorker(CharacterI... |
e66085ae0e80ab77056d73ecf0c6a5e820038133 | 63936c4b82ff4ead2a4a90f7d253af117d585af0 | /main.cpp | 08e7cecc98e79da62b65de0ea02ab76ca8ab9804 | [] | no_license | yontwises/CS014 | 8f8faf5553e3af0eb83c1e0e7cbf2b4458ec4b53 | e04435891b47d0334712401572ff5b164d5fe496 | refs/heads/master | 2020-12-06T15:41:33.774975 | 2020-01-09T09:13:32 | 2020-01-09T09:13:32 | 232,498,586 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 624 | cpp | main.cpp | #include "Playlist.h"
#include <iostream>
#include <cstdlib>
#include <string>
using namespace std;
int main() {
// std::cout << "Hello World! " << '\n';
// Playlist list//
Playlist list;
list.AddSong("H103", "DuDu", "Blackpink", 340);
list.AddSong("H523", "Kill This Love ", "Blackpink", 200);
... |
7491d479bb509a80bd81bbc1484670e8bc731a37 | 9eff4a0c6890bc8571bb1115d14159ce93c2f5a7 | /include/kspp/internal/queue.h | d08a789b4030bee6ffa71e26d0b476323aa3cdcb | [
"BSL-1.0"
] | permissive | bitbouncer/kspp | d06865e46a1e3820e65d24edb951a48a996dffbf | 8539f359e32bd3dd1360ac4616eab88e79aab607 | refs/heads/master | 2022-10-20T22:45:11.118381 | 2022-09-28T14:50:00 | 2022-09-28T14:50:00 | 73,604,579 | 136 | 27 | BSL-1.0 | 2022-05-16T19:20:41 | 2016-11-13T08:42:34 | C++ | UTF-8 | C++ | false | false | 1,310 | h | queue.h | #include <deque>
#include <memory>
#include <cstdint>
#include <kspp/utils/spinlock.h>
#pragma once
namespace kspp {
template<class ITEM>
class queue {
public:
queue() : empty_(true) {
}
inline size_t size() const {
spinlock::scoped_lock xxx(spinlock_);
return queue_.size();
}
... |
f7cd23a992e04997ce0295d3e3e0a10c28aa5b1f | 4a83406f95a4ba8f15bb4bfff0bb34f5f36ddcde | /Practice/Bit Manipulation/Unique_Number_imp.cpp | e6d008cbe2188a8a98bbcb1076fb05e882ffd72d | [] | no_license | 2001adarsh/Contests | 5d3523ca6a5eb3eab0505733dc9144890eecb45e | a162b2a11b00d70e2b49292854b2ba826ca01311 | refs/heads/master | 2021-12-15T02:11:30.852367 | 2021-12-12T11:22:55 | 2021-12-12T11:22:55 | 252,377,884 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 904 | cpp | Unique_Number_imp.cpp | // We are given an array containg n numbers.
//All the numbers are present thrice except for one
//number which is only present once. Find the unique number.
//Only use - bitwise operators, and no extra space.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, no;
cin>>n;
int cnt[64] = {... |
7bf68eff85db6a52b3b09aa86ee6806c42535bef | 125ae0adb562478b184bbb35d40f2c43b335415c | /MercuryUI_old/Panels/Alarms/tAlarmSmartCraftPage.h | 26453203461b340c974c06f99040a6bb83e27b21 | [] | no_license | dulton/53_hero | ff49ce6096c379931d7649b654c5fa76de4630de | 48057fe05e75f57b500a395e6ff8ff9c06da6895 | refs/heads/master | 2020-02-25T04:19:18.632727 | 2016-05-20T03:44:44 | 2016-05-20T03:44:44 | 62,197,327 | 3 | 2 | null | 2016-06-29T05:11:41 | 2016-06-29T05:11:38 | null | WINDOWS-1252 | C++ | false | false | 1,144 | h | tAlarmSmartCraftPage.h | /*****************************************************/
// Copyright © 2007-2012 Navico
// Confidential and proprietary. All rights reserved.
/*****************************************************/
#ifndef T_ALARMSMARTCRAFTPAGE_H
#define T_ALARMSMARTCRAFTPAGE_H
#pragma warning(push, 1)
#include <QGraphicsItem>
#in... |
2ebadd19387a6b09d978eba9062e92c702962048 | 2e9cb497dedb365194e21375bb19fc11442bd6f0 | /april_leetcoding_challenge/16. Valid Parenthesis String.cpp | 56912d307f59961b2c4a185dd21603a1277f2131 | [] | no_license | anshaljalota/leetcode | 8d48d24b3b907cb5983ef4f805c634fd4fd672bf | eb3d386e7e49758000b676d0f80740a920185c4e | refs/heads/master | 2022-12-20T19:16:12.851459 | 2020-09-30T13:35:54 | 2020-09-30T13:35:54 | 267,513,638 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 974 | cpp | 16. Valid Parenthesis String.cpp | /*
Given a string containing only three types of characters: '(', ')' and '*', write a function to check whether this string is valid. We define the validity of a string by these rules:
Any left parenthesis '(' must have a corresponding right parenthesis ')'.
Any right parenthesis ')' must have a corresponding left pa... |
a1deb108f45944155fae81cbe213e0f113230aad | 6ded783679718a04e62b4edfcccecba3c780f2e4 | /hw2/2.cpp | c225c731dbffa4edba99f4a1a2be7b69a50523c3 | [] | no_license | lysa0/hwcpp | 8ff8daf555f57efc71e326f7fdc45c685d57c497 | ae95ac519dcb6126a80694473efc3dd3b38ebb1c | refs/heads/master | 2021-01-21T05:10:44.139211 | 2017-05-12T20:07:42 | 2017-05-12T20:07:42 | 83,145,163 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 509 | cpp | 2.cpp | #include<bits/stdc++.h>
using namespace std;
void solve();
int main(){
solve();
return 0;
}
void solve(){
int * a[10]{};
int it{};
for(int **i=a; i<a+10; it++, i++){
*i = new int[it+1]{};
//memset(*i, -1, (it+1)*sizeof(int));
*(*i+it)=1;
}
it=0;
for(int **i = a; i < a+10; it++, i++){
for... |
c214b27ad2daa21b2e77ef6e7a7c5c723e98a8f3 | 3d631d3677f073e1a6203c0f0a6d5cd9416f2e13 | /src/test/region_split_test.cc | 242eaf7e6fb158f205b074152ceaea309af6fe2b | [
"Apache-2.0"
] | permissive | JaySon-Huang/client-c | 79f018f2ca227e72778be4047494f53707fad8f1 | 91c642a4477b6b98149a75c291102b9e92ac4e41 | refs/heads/master | 2023-09-01T15:32:53.656872 | 2023-03-19T14:05:17 | 2023-03-19T14:05:17 | 239,755,094 | 0 | 0 | Apache-2.0 | 2023-03-21T16:57:39 | 2020-02-11T12:20:27 | C++ | UTF-8 | C++ | false | false | 2,531 | cc | region_split_test.cc | #include <pingcap/Exception.h>
#include <pingcap/kv/Scanner.h>
#include <pingcap/kv/Snapshot.h>
#include <pingcap/kv/Txn.h>
#include <iostream>
#include "mock_tikv.h"
#include "test_helper.h"
namespace pingcap::tests
{
using namespace pingcap;
using namespace pingcap::kv;
class TestWithMockKVRegionSplit : public te... |
b923c476c56f6da41f3438324cf4f87590c7f7fc | dd6d4ed4c5c8cf4c75790eae9eb25a18af3e55ea | /tensorflow/contrib/repeat/kernels/repeat_op_cpu_impl.cc | d70e3102b109c2fdb356f13fa7d23ad8d5aaa59c | [
"Apache-2.0"
] | permissive | zycdragonball/tensorflow | e5eb309e7542d9f776ca978d8b89ef6345965167 | 150b11229f4937db9017b08a3737aa7172180644 | refs/heads/master | 2021-01-23T01:59:55.125101 | 2017-07-10T00:32:49 | 2017-07-10T00:32:49 | 85,953,842 | 0 | 0 | null | 2017-07-10T00:32:50 | 2017-03-23T13:37:17 | C++ | UTF-8 | C++ | false | false | 5,745 | cc | repeat_op_cpu_impl.cc | /* Copyright 2016 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... |
814db2a5456d14b10a1cd011ae011d7c8e7947e9 | 11211916f39b9d98027b64d778e52743d0c519a1 | /L3/code/design/musicphotos/doc/assignments/logic.cpp | f939e1775e30271abd424d2345b83840b2a9e2e2 | [] | no_license | mantasruigys3000/Group-Task | 87baf1bc2747323c0508f6f32ef733c3f4b50978 | 6790d74ae7fa0fe6b13733efcd75a9f4aca70ab0 | refs/heads/master | 2020-04-23T20:54:09.696659 | 2019-02-22T01:29:53 | 2019-02-22T01:29:53 | 171,454,102 | 0 | 0 | null | 2019-02-19T10:31:09 | 2019-02-19T10:31:08 | null | UTF-8 | C++ | false | false | 302 | cpp | logic.cpp | Sit aliquam dolor adipisci dolor tempora.
Labore etincidunt magnam modi ipsum.
Voluptatem voluptatem dolor quiquia consectetur.
Dolore voluptatem consectetur magnam magnam non quisquam.
Numquam quaerat neque tempora non dolorem.
Username: Fred
Password: 1202
Porro magnam modi dolore adipisci numquam.
|
c9e759cdfee9168dc9f0e5827e49a2c0ba53f61d | 613e60d492bf656ca5b53af6d4d9719874637f16 | /cpp excercise/zoo/whale.cpp | 2338b52174f627b6f0c37dec9ac83ffb438e5f63 | [] | no_license | yehudis-k/c-cpp-exercises | 759edc57fa1a6025075f75ef4aab656a226cc3a8 | 5a21cd9296ad2cbb0174ee59c7f47ff2868b4e96 | refs/heads/master | 2022-12-05T21:49:56.608104 | 2020-09-02T16:35:58 | 2020-09-02T16:35:58 | 275,856,616 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 375 | cpp | whale.cpp | #include "whale.h"
const std::string Whale:: m_species="whale";
e_continent temp_cont3[] = {Antarctica,Europe};
const std::vector<e_continent>Whale:: m_continent(temp_cont3, temp_cont3 + sizeof(temp_cont3)/sizeof(temp_cont3[0]));
e_food temp_food3[] = {vegetable};
const std::vector<e_food>Whale:: m_foods(temp_food3, ... |
ac7a94496a7fc77b382b30273bbe2fce36d705e4 | 7f30cb109e574560873a5eb8bb398c027f85eeee | /src/PacsQueryWorkerThread.cxx | 5648220d7ddbfe0370f915132fd9e666b698aa67 | [] | no_license | svn2github/MITO | e8fd0e0b6eebf26f2382f62660c06726419a9043 | 71d1269d7666151df52d6b5a98765676d992349a | refs/heads/master | 2021-01-10T03:13:55.083371 | 2011-10-14T15:40:14 | 2011-10-14T15:40:14 | 47,415,786 | 1 | 0 | null | null | null | null | IBM852 | C++ | false | false | 3,248 | cxx | PacsQueryWorkerThread.cxx | /**
* \file PacsQueryWorkerThread.cxx
* \brief Thread che gestisce le query al pacs, usato da wxPacsQueryGui
* \author ICAR-CNR Napoli
*/
#include "PacsQueryWorkerThread.h"
#include "wxPacsQueryGui.h"
#include <wx/busyinfo.h>
DEFINE_EVENT_TYPE(wxEVT_THREAD)
PacsQueryWorkerThread::PacsQueryWorkerT... |
bea8a2d609677ec5006176a929424b38837d6008 | 9ea9007009ad538027f07a4261fba34d038ced1e | /cpp/sdkkit.h | e0ab340029433b2c26134fe066a099eab820179a | [] | no_license | openwayne/native_sdk | b73796e4bc427a13de735dcc589292337b946f60 | 5ff331ccccaccfa47e4b663ebbafc7bfff0bbf5c | refs/heads/master | 2021-01-10T05:54:41.423395 | 2016-02-01T07:54:38 | 2016-02-01T07:54:38 | 45,177,173 | 0 | 1 | null | 2016-02-01T07:54:38 | 2015-10-29T10:48:06 | C++ | UTF-8 | C++ | false | false | 3,309 | h | sdkkit.h | #ifndef SDK_KIT_H_
#define SDK_KIT_H_
//#define HJR_USE_LUA_SDK 1
#include <iostream>
#include <map>
#ifdef HJR_USE_LUA_SDK
extern "C" {
#include "lua.h"
#include "lualib.h"
#include "lauxlib.h"
}
void initLuaFrame(lua_State* ls);
#endif
//////////////////////////////////////////////
#ifdef HJR_USE_LUA_SDK
in... |
7a9b2b28d14ffb9a2dd2e093993f50063cc0bea5 | 10b5248b8ea8ec5e84273df32afae0dcbabcbac2 | /TP2/src/main_liste.cpp | 40b9a3e75457cc0c3f1552680ea567059c7342e9 | [] | no_license | SimonClerbout/L3_CPP_etudiant | e19318925ced6766fd50793a1687a34ec1bc4558 | ff0f6b06f6f65ea680294e162eb0b00b1d21e812 | refs/heads/master | 2021-05-05T03:43:27.770661 | 2018-04-19T09:57:04 | 2018-04-19T09:57:04 | 119,805,943 | 0 | 0 | null | 2018-02-01T08:25:57 | 2018-02-01T08:25:57 | null | UTF-8 | C++ | false | false | 300 | cpp | main_liste.cpp | #include <iostream>
#include "Liste.hpp"
int main(){
Liste l;
//Noeud* n = new Noeud();
l.ajouterDevant(13);
l.ajouterDevant(37);
std::cout << l.getTaille() << std::endl;
for(int i = 0; i < l.getTaille(); i++){
std::cout << l.getElement(i) << std::endl;
}
return 0;
}
|
955338f6f031cf21fdabf0b299150f9e13d80745 | 5e4e2ae5c863dee1003c064ef70d74c9165fc65e | /trees/flatten-binary-tree-to-linked-list.cpp | 0476a766ad87f441ef46cf79dbb8a36b99c51305 | [] | no_license | rootid/fft | 3ec6f0e6ae1be96d531119b2571610646a7256e9 | af187df0eafee37f69d6be95dc22685a96b96742 | refs/heads/master | 2020-12-14T09:24:18.915482 | 2019-07-25T23:52:21 | 2019-07-25T23:52:21 | 46,454,112 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,057 | cpp | flatten-binary-tree-to-linked-list.cpp | //Given a binary tree, flatten it to a linked list in-place.
//For example,
//Given
// 1
// / \
// 2 5
// / \ \
// 3 4 6
//The flattened tree should look like:
// 1
// \
// 2
// \
// 3
// \
// 4
// \
// 5
// \
// ... |
f2f38d1c46c98c633c515853346e00b82307b27e | ba86aa615a1455fd79ac3732b77d07f935a04ae3 | /c++程序/最小倍数数位和.cpp | 2c4cbc60739779da7c8a24ea6105ada347751584 | [] | no_license | 300I/jjj | ce0c64bd3a535e593ec38f8b498b77e5ec71e334 | 942c708fc5994ae75cf96e254dac00ba00b94e88 | refs/heads/master | 2020-07-10T01:20:30.600985 | 2019-09-16T12:50:09 | 2019-09-16T12:50:09 | 204,130,261 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 519 | cpp | 最小倍数数位和.cpp | #include<stdio.h>
#include<algorithm>
using namespace std;
unsigned long long n,stp,tmp=1,re,x,s,ans=INT_MAX,check;
int main()
{
scanf("%lld",&n);
while(1)
{
x=n*tmp;
check=x;
// printf("%lld\n",x);
while(x)
{
s+=x%10;
x/=10;
}
if(check<=0 or check/tmp!=n)
{
printf("%l... |
88566235cd9347352d7d49b8cea93d68fe15c7bc | 986c21d401983789d9b3e5255bcf9d76070f65ec | /src/plugins/bittorrent/alertdispatcher.h | e90b601d3941a60ed2c64a9e2ec2fd7a1108561b | [
"BSL-1.0"
] | permissive | 0xd34df00d/leechcraft | 613454669be3a0cecddd11504950372c8614c4c8 | 15c091d15262abb0a011db03a98322248b96b46f | refs/heads/master | 2023-07-21T05:08:21.348281 | 2023-06-04T16:50:17 | 2023-06-04T16:50:17 | 119,854 | 149 | 71 | null | 2017-09-03T14:16:15 | 2009-02-02T13:52:45 | C++ | UTF-8 | C++ | false | false | 2,410 | h | alertdispatcher.h | /**********************************************************************
* LeechCraft - modular cross-platform feature rich internet client.
* Copyright (C) 2006-2014 Georg Rudoy
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE or copy at https://www.boost.org/LICENSE... |
1714ff3ac86073348d96ea6020083b31b6ebacbb | 4e0f3e452a0646c03b9908a80560d194789a3727 | /shell/browser/notifications/web_push_content_views.cc | 1b6b403d304c5b5e5ce68b966a438a1bcb16a8bc | [] | no_license | gregorykim/testdup | c35befad3a1827a1341f2b450eae44b1720d66f3 | 5d81cf84442e40102ff2972dd8d912e6fe5278bd | refs/heads/master | 2021-01-01T06:57:48.121365 | 2017-07-18T06:44:03 | 2017-07-18T06:44:03 | 97,563,081 | 0 | 0 | null | 2017-07-21T02:16:54 | 2017-07-18T06:50:32 | C++ | UTF-8 | C++ | false | false | 4,913 | cc | web_push_content_views.cc | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/shell/browser/notifications/web_push_content_views.h"
#include "base/strings/utf_string_conversions.h"
#include "ui/aura/window.h"
#in... |
59fc28e78ae91849e43c096f982b84f0e5f78bb4 | 5d4b70ac5e555e3c8b68534ef1790ce041a0f65e | /deps/opencolorio-2.0.0/src/OpenColorIO/transforms/ExposureContrastTransform.cpp | 49b8bbb316dcdfb5a3f3f21ae21f61a8bbc56691 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0",
"BSD-3-Clause",
"CC-BY-4.0"
] | permissive | LuxCoreRender/LuxCore | eddb0e3710cbc8fa28cb80f16d908f1ec3cc72db | 2f35684a04d9e1bd48d6ffa88b19a88871e90942 | refs/heads/master | 2023-08-17T01:28:23.931381 | 2023-05-28T22:25:00 | 2023-05-28T22:25:00 | 111,695,279 | 1,055 | 154 | Apache-2.0 | 2023-08-03T20:21:05 | 2017-11-22T14:36:32 | C++ | UTF-8 | C++ | false | false | 5,294 | cpp | ExposureContrastTransform.cpp | // SPDX-License-Identifier: BSD-3-Clause
// Copyright Contributors to the OpenColorIO Project.
#include <OpenColorIO/OpenColorIO.h>
#include "transforms/ExposureContrastTransform.h"
namespace OCIO_NAMESPACE
{
ExposureContrastTransformRcPtr ExposureContrastTransform::Create()
{
return ExposureContrastTransformRc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.