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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
096059c15c82102f5394b6f416dfd26b62cccd0e | 609aa99c768388654af6086b8fdc696e550bf24e | /src/Driver.h | ca76bb415ccaa9ccf2ce9ca7e62e9241435b25ef | [
"BSD-3-Clause"
] | permissive | criort/libPRISM | db702e31fe6891687a56dad5454fb65e00370de6 | 7bcd991a9e44e8e22e58afc039e2c182f5f284c7 | refs/heads/master | 2021-01-19T12:53:40.996585 | 2017-09-14T08:37:16 | 2017-09-14T08:37:16 | 88,055,288 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 3,908 | h | Driver.h | /*
* Copyright (c) 2017, Barcelona Supercomputing Center and International Business Machines.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retai... |
14f02aa636cac586823cfb367a0c7b23587bd59c | cbe0cb8c0a1456e6e793283090ef2e11c97709ed | /lecture_012_graph/question.cpp | f7fef408f455de0a2aaea929e253ebbf894bd1d8 | [] | no_license | varunjeett/PepCodes | cd84ff9f75eedac79b0136e7e37278902337b9ee | c27cfa7e63a0d9629529848fdbea712893a5a1f0 | refs/heads/master | 2023-04-05T18:23:26.154712 | 2021-04-14T06:03:10 | 2021-04-14T06:03:10 | 294,819,356 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,444 | cpp | question.cpp | //leetcode 542.==================================================
class Solution {
public:
vector<vector<int>> updateMatrix(vector<vector<int>>& arr) {
int n=arr.size();
int m=arr[0].size();
queue<int> q;
vector<vector<bool>>vis(n,vector<bool>(m,false));
fo... |
9adda27482f91fb6ab97c1b0ffb2c1a571afb62b | 76316a343e1b9909d991549e21158de51b6de597 | /ballastwidget.cpp | e9e85c42467675ffc65474b081ebabf68b0d7ea4 | [] | no_license | MaksStalker1985/LevelApp | 50433d8ea4e80a26767fc5b9f9069eed28e3e4d6 | 2707d87449ea911622eec542cfa6a019cf4429dc | refs/heads/master | 2023-08-26T11:11:42.556535 | 2021-10-01T14:29:30 | 2021-10-01T14:29:30 | 408,053,079 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 754 | cpp | ballastwidget.cpp | #include "ballastwidget.h"
#include "ui_ballastwidget.h"
BallastWidget::BallastWidget(QWidget *parent) :
QWidget(parent),
ui(new Ui::BallastWidget)
{
ui->setupUi(this);
connect(this,&BallastWidget::insertItem,&BallastWidget::addUnit);
}
BallastWidget::~BallastWidget()
{
delete ui;
}
void Ballas... |
edfd83fa65b615bd9e3c9534b15828d0bae7e21a | af0ecafb5428bd556d49575da2a72f6f80d3d14b | /CodeJamCrawler/dataset/08_5042_30.cpp | 2305a0f56d67be29c5e4ad940cac527a5a7332b8 | [] | 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 | UTF-8 | C++ | false | false | 2,487 | cpp | 08_5042_30.cpp | #pragma warning (disable:4786)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <windows.h>
#include <map>
#include <string>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
//vector <int> x;
//vector <int>::... |
27073097513639872380a11debfc4acd3791fe5d | e782b2fe6b3c0b20513c8334ba653030efbbc341 | /source/gl_wrapper/GLWFCallbacks.cpp | 9422a8a90301cef8172534e2c0485938e59c3184 | [] | no_license | VladasZ/gl_wrapper | b8f0d3f3186194cc3d5847639df581918b2f18a3 | f4e54b596110a9c3875a4e482f12e272cbf66108 | refs/heads/master | 2021-06-14T17:22:52.536071 | 2021-03-29T10:33:35 | 2021-03-29T10:33:35 | 173,499,860 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,536 | cpp | GLWFCallbacks.cpp | //
// GLWFCallbacks.cpp
// gl_wrapper
//
// Created by Vladas Zakrevskis on 15/12/19.
// Copyright © 2019 VladasZ. All rights reserved.
//
#include "GLWFCallbacks.hpp"
#ifdef DESKTOP_BUILD
#include "GLDebug.hpp"
#include "GLWrapper.hpp"
#include "OpenGLHeaders.hpp"
void size_changed(GLFWwindow* window, int wid... |
47cc7f1d1d367f194bd324c405f0726e358943aa | e0dcdf93a4c214b65d8cab18d4aca837664ec1cd | /ml_engine/source/src/DbAdmin.cpp | 218e256cf8f4bda4ded9544d5c846120a2d6e2fb | [] | no_license | andy-zha/trunk | 6af03478a78746f0850e020e0ef0aaf26c05799c | 1e8712e6bf98af9d5cf4b49464c84b2c4341d749 | refs/heads/master | 2020-05-25T01:16:24.277786 | 2019-10-11T07:58:00 | 2019-10-11T07:58:00 | 187,550,095 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,564 | cpp | DbAdmin.cpp | #include "DbAdmin.h"
//构造函数
DbAdmin::DbAdmin()
{
conn = nullptr;
}
//析构函数
DbAdmin::~DbAdmin()
{}
//连接接口
int32_t DbAdmin::connect()
{
try
{
conn = mysql_init(nullptr);
if (!mysql_real_connect(conn, NS_DBADMIN::HOST, NS_DBADMIN::USER,
NS_DBADMIN::PASSWD, NS_DBADMIN::DBNAME, 0, nullptr, CLIENT_FOUND_ROWS))
... |
d0c65ffca1c154acb71d11cd3c526d86e5a4e314 | e5f7f5ec52e4745ae61c3f52309e82a80fb18073 | /src/Interpol.cpp | 9a90406f64cc72055ea864c92a7b2bdbb73e639a | [] | no_license | szabiyako/Interpolation | 757006f90d8b4fbf6ace910dff630be85cbd629e | 01d00033d6cb2d333e060d4d4ce7588ea399dcb9 | refs/heads/master | 2020-07-23T02:31:49.139544 | 2019-09-14T05:25:29 | 2019-09-14T05:25:29 | 207,418,943 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 3,484 | cpp | Interpol.cpp | #include "Interpol.h"
//PRIVATE
double Interpol::l(int &i, double &j, int &begin_index, int &end_index)
{
int size = this->y->size();
double answer = 1;
for (int k = begin_index; k <= end_index; k++)
{
if (k == i)
continue;
answer *= ((j - k) / (i - k));
}
Console::addLine(L"l(i=" + std::to_wstring(i)... |
e5ff9de99d13c7c35c9727edb6a431ceadda6ebd | 39d9c789c1d9e8eb28a3766831451bc8aa3fbda1 | /python/set_replace/match_py.cpp | 2a2cb998bfe973646da160ff204e2d0ecbe3db8d | [
"MIT"
] | permissive | greenboat11/wolfram_model | 081d883680342078a48e83deeb9169c9726c7c4b | a4dd26295df7cb995ce666007860ca86efa38e8a | refs/heads/master | 2023-03-15T12:54:16.200845 | 2020-06-03T22:01:13 | 2020-06-03T22:01:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,515 | cpp | match_py.cpp | /* Copyright (c) 2020 Pablo Hernandez-Cerdan
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge,... |
0b5c9adf38b2aff58e4e2a51f4d0ff8ec628d897 | 33c8f4a71ca4fe71578d8f4bb6f8e4633142d855 | /isMatch/isMatch/test.cpp | 609f32d5de5d97b467f62d6364b75fb9a28ac5d7 | [] | no_license | siwei1234/cpp | 87252867c02f7c5429b7b241129512e0ac0d5cf1 | 6a8316f4a8dc6c4db681a8ff113db9ea955d14d2 | refs/heads/master | 2021-05-21T15:26:04.706931 | 2021-01-20T08:51:45 | 2021-01-20T08:51:45 | 252,688,553 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 706 | cpp | test.cpp | #define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<string>
using namespace std;
class Solution {
public:
bool _isMatch(const char* s, const char* p)
{
if (!*p) return !*s;
if (*(p + 1) != '*')
{
if (*s == *p || (*p == '.' && *s != '\0'))
{
return _isMatch(s + 1, p + 1);
}
else
r... |
be5bcc17ccd1323f7d8f46a56e365d4fcb5a446e | 4ceb488e829ab2f30e9846c478ab4c8c21ce22a1 | /competitive_programming/codeforces/711_div2/c.cpp | 0622eba6c1c9b863614685390e4a54011aaa4914 | [] | no_license | luatil/cppractice | f24eded2aa425e06f07526459bb61ab681b0d50a | 7d9989f1aa3261603179238f091d41650fb42cdd | refs/heads/main | 2023-05-23T18:59:54.681986 | 2021-06-03T15:00:13 | 2021-06-03T15:00:13 | 334,229,008 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 307 | cpp | c.cpp | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define REP(i, n) for(int i = 0; i < n; i++)
#define ll long long
#define vi vector<int>
void solve()
{
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t; cin >> t;
while(t--)
solve();
}
|
9bcf58c2bda3afa99e804547c708568d34fc0632 | 7d3959c7f44995f4899ccf782faf1615526ed2fa | /main.cpp | 4b0dbb5c85091ad2d8e70601502022f8d98a6a27 | [] | no_license | Tim301/VQA_Launcher | 4b6d9e8cab780f9ece946826e5aab98e170df01e | d5aed2cde7041c9f92a0e4e7795362099fb11dd4 | refs/heads/master | 2022-12-18T01:00:35.723669 | 2020-09-29T15:45:44 | 2020-09-29T15:45:44 | 277,475,084 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,033 | cpp | main.cpp | #include <iostream>
#include <fstream>
#include <sstream>
#include <stdio.h>
#include <math.h>
#include <opencv2/opencv.hpp>
#include <thread>
#include <mutex>
#include <cstdio>
#include <iostream>
#include <memory>
#include <stdexcept>
#include <string>
#include <array>
#include <nlohmann/json.hpp>
using json = nloh... |
0516a09a6f1e28e5721bcda9c9ed0771c6a4f90c | cef10c8a57377d7a57d1f8ec7a2562ba0251eb2b | /Raytracer/src/core/Film.h | db671ca4dc778e44d0187bd88322686d9d73ab10 | [] | no_license | kell18/Sparkler | e9e303954e998ee677b1af09393746537961718c | 8623f98173ffd992e8abb86fcb0caae82bc12043 | refs/heads/master | 2020-12-02T22:39:57.388707 | 2017-03-17T19:12:02 | 2017-03-17T19:12:02 | 26,179,119 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 750 | h | Film.h | #pragma once
#include <FreeImage.h>
#include <stdio.h>
#include <vector>
#include <iostream>
#include <iomanip>
#include "../utils/Mathf.h"
#include "../utils/Color.h"
using namespace glm;
using namespace std;
namespace raytracer
{
class Film {
private:
int width, height;
string outputFile;
FIBITMAP* raw_... |
d23a88badcdf35f266ab76c16d631aebff3155cf | acc7983ce9431f45df5cf37c222290c5b4687e5b | /Source/Survival/Interaction/DestructibleComponent.cpp | 6859af0ad74cce1c3099dec09bc3e67c10563641 | [] | no_license | emqk/Survival | 51f2c5876cff01601543d9207964c8419050c12f | f65432026ff66e7e236206a1b1cf644b2b0c52a6 | refs/heads/master | 2023-03-09T19:28:53.806091 | 2021-03-01T14:36:18 | 2021-03-01T14:36:18 | 284,226,651 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,604 | cpp | DestructibleComponent.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "DestructibleComponent.h"
#include "Kismet/GameplayStatics.h"
#include "../PlayerGameInstance.h"
#include "Kismet/KismetMathLibrary.h"
#include "ItemActor.h"
#include "GameFramework/Actor.h"
#include "../PlayerGameMode.h"
// Sets... |
b214b77408664b88f4fb65232b99d139ec883ff3 | e1bfeb5fc79b5b624eea4996cef7e5bccb4877ed | /Learning DSA/Learning DSA/Sort.h | e9f8b3fbec028159d1a3ead47eda1790f05000ce | [] | no_license | phaninder/DSA | 6fe71a6a9da5eeb8860746ecae9e4c1bd2e9079a | c1f8b3d07b86d075ec8ccdd024c9626fb8018eca | refs/heads/master | 2021-01-19T17:36:19.664458 | 2017-11-16T05:48:37 | 2017-11-16T05:48:37 | 101,071,275 | 0 | 0 | null | 2017-09-12T16:15:24 | 2017-08-22T14:22:50 | C++ | UTF-8 | C++ | false | false | 525 | h | Sort.h | #pragma once
class Sort
{
private:
int *A,*leftArray,*rightArray, size;
void MergeProcedure(int A[],int n);
void Merge(int left[], int right[], int A[],int leftASize,int rightASize,int mainAsize);
void QuickSorting(int A[], int lb, int ub);
int Partition(int A[], int lb, int ub);
public:
Sort();
void CreateArra... |
f49219aa5777b89fb6eae3e6e2ad990536dcb639 | 11ca89b76e83e7198418ec1ff73d6f40e36e292b | /src/singleton.h | 1b1a65beb24e346c2e6316068433e8aae3447b2a | [] | no_license | turbobit/ddosmon | cd254d3de23334e9e54030567e47408405e69981 | d1912a05eb264f0756235686ddc54667176ecd48 | refs/heads/master | 2020-04-03T15:29:43.429064 | 2018-10-30T10:57:26 | 2018-10-30T10:57:26 | 155,364,523 | 0 | 0 | null | 2018-10-30T10:14:26 | 2018-10-30T10:14:26 | null | UTF-8 | C++ | false | false | 562 | h | singleton.h | #ifndef __SINGLETON_H__
#define __SINGLETON_H__
template <class T>
class Singleton
{
private:
Singleton(const Singleton<T> &);
Singleton& operator=(const Singleton<T> &);
static T* m_instance;
protected:
Singleton() {
m_instance = static_cast<T*>(this);
}
public:
virtual ~Singleton()... |
6634f799ee0793e30f68f83047039765e9d48f12 | dd46500227bf97a1e3d383f8c8ebb323d33e94a0 | /arduino/all_nano_33_ble_sense/all_model.cpp | 19622491b1598b3dde5f9f2168d6472e2932fafe | [
"MIT"
] | permissive | AdamMiltonBarker/ALL-Arduino-Nano-33-BLE-Sense-Classifier | dde49e8c934a5cda32e4aeaf646df9c740b1130a | 744f538e265533a9ed81429fac367c852555b674 | refs/heads/main | 2023-06-19T02:31:10.412983 | 2021-07-19T21:01:22 | 2021-07-19T21:01:22 | 386,728,228 | 0 | 0 | MIT | 2021-07-16T18:21:31 | 2021-07-16T18:21:30 | null | UTF-8 | C++ | false | false | 322,924 | cpp | all_model.cpp | /* ALL Arduino Nano 33 BLE Sense Classifier
An experiment to explore how low powered microcontrollers, specifically the
Arduino Nano 33 BLE Sense, can be used to detect Acute Lymphoblastic Leukemia.
MIT License
Copyright (c) 2021 Asociación de Investigacion en Inteligencia Artificial
Para la Leucemia Peter Moss
Per... |
290fc4b47567e2a8e28e1c8c18707ca6f6a1bc61 | 98a3a121f9a5963c2c44ea4d66b373a837e76373 | /LeetCodeReview/LeetCodeReview/DP/UniquePaths.cpp | eb4ea585cb3c79c92fc6ce93081081dcaafaf53c | [] | no_license | dlsyj/AlgoPrac | 4ccab72065521641448d494ee04df0d60dd076d1 | 0742ff261058fc371fa049e96dbdab1a8158f507 | refs/heads/master | 2021-01-21T07:25:26.741533 | 2014-10-20T15:29:10 | 2014-10-20T15:29:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 652 | cpp | UniquePaths.cpp | //
// UniquePaths.cpp
// LeetCodeReview
//
// Created by WangJZ on 14-10-4.
// Copyright (c) 2014年 WangJZ. All rights reserved.
//
#include "leetcode_dp.h"
int uniquePaths(int m, int n) {
if (m == 0 && n == 0) return 1;
if (m == 0 || n == 0) return 1;
vector<vector<int>> state;
for (int i = 0... |
3fd8cda3bb8c4228204883c1168deb12b7ae9af3 | af59e00881a72a40edd4330237161d2d34840c35 | /cub/task/concurrent_executor.cc | 910e3c3d6e22828cc21129df018dea602ec8a6f7 | [
"Apache-2.0"
] | permissive | sineagles/Adlik | f0974800c7e3d7079d1a284d0b519088d09f628e | 13e7bb81e4729564dc8dc234c203b245d53ab520 | refs/heads/master | 2023-04-11T00:11:37.676494 | 2019-11-15T06:20:31 | 2019-11-15T06:20:31 | 222,104,455 | 2 | 0 | Apache-2.0 | 2023-03-24T23:21:18 | 2019-11-16T13:37:33 | C++ | UTF-8 | C++ | false | false | 337 | cc | concurrent_executor.cc | // Copyright 2019 ZTE corporation. All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
#include "cub/task/concurrent_executor.h"
namespace cub {
ConcurrentExecutor::ConcurrentExecutor(int numThreads) : pool(numThreads) {
}
void ConcurrentExecutor::schedule(thread_t f) {
pool.schedule(std::move(f));
}
} ... |
354452d4363081661b0ce52db2092c6767083095 | 4df5e4c5b2e17218608e5269ec14ba44f6ae124a | /EmptyDoublyException.h | 3b87e2e79fbd691bc5b5babdb2204230ba223ca7 | [] | no_license | arielmata/cpsc350-assign5 | 1676e5598d91f5dd073450f539aded26e1a7b6ad | 2daf6c84e885d0d344cf7767a92f46e29c229da1 | refs/heads/main | 2023-01-21T06:39:47.389819 | 2020-12-04T07:36:09 | 2020-12-04T07:36:09 | 314,026,877 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 653 | h | EmptyDoublyException.h | //header - EmptyDoublyException.h
// Full name: Ariel Gutierrez
// Student ID: 2318163
// Chapman email: arigutierrez@chapman.edu
// Course number and section: CPSC 350-01
// Assignment or exercise number: Assignment 5
// Assignment 5: A C++ program that implements a simple database system using
// binary search tree... |
ce445118ef017b7d13f9264094120082ec8de001 | 3ead10074a9e21f8642923690b89fd516f8bf0eb | /src/demo/monte/main.cpp | a5bd373a2aade56f70b75ae583c2101a4737e439 | [] | no_license | xandercrews/mtm | 78110571e0cac0c32c474df7a093294f6454fa2a | 643aa8f146ebd3f9ecbe3bbcd86a10f56a1b3f9f | refs/heads/master | 2020-05-18T06:56:48.907995 | 2013-11-14T12:41:11 | 2013-11-14T12:41:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,177 | cpp | main.cpp | #include <chrono>
#include <cmath>
#include <cstdlib>
#include <random>
#include <stdio.h>
using std::mt19937;
using std::chrono::system_clock;
using std::min;
using std::max;
/**
* Return the cumulative probability that a number will be equal or less than
* the specified number, where probability is a classic bel... |
ec98d2339688be49735dd585cdaff8532c85cb1c | 632550c5897f9f9a838ee055f02a5b537f3e0f8a | /Stmt.cpp | d3cb03082f2e76290b9679a3081dfb6eac08e5c4 | [] | no_license | AymanAzzam/Cplus | 485ae9e38d80e0adf0ffce0e3a5928f60b0ad0b9 | 81a2b3c32cbdc629009b1021a40e0e363b36cef1 | refs/heads/main | 2023-05-26T16:44:43.772517 | 2021-06-10T19:03:49 | 2021-06-10T19:03:49 | 371,521,308 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 200 | cpp | Stmt.cpp | #include "Stmt.h"
#include <iostream>
using namespace std;
Stmt::Stmt(Node *s) {
stmt = s;
}
void Stmt::execute() {
if (stmt)
stmt->execute();
}
Stmt::~Stmt() {
delete stmt;
}
|
9b3411ff90e635998dc10014fff890d36dbadcaf | 91c505c8d7c73d6f4d27e922cfa6bebcdbd30264 | /include/bby/metaprogram/variadic_wrap.cc | d467347a74fd7f1dce2e7ca01eb8168cb2728d88 | [] | no_license | danielmevi/bby | 27c62eb8830daff5c8d1e10346341897468de029 | b76aa3f9b0220f234062f943d8b38e730fb28c07 | refs/heads/master | 2023-04-11T02:32:27.162033 | 2021-04-13T03:20:46 | 2021-04-23T02:17:04 | 190,762,252 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 334 | cc | variadic_wrap.cc | #include <initializer_list>
#include <iostream>
template <typename T> void print_impl(T &t) { std::cout << t << '\n'; }
template <typename... T> void print(const T &... t) {
(void)std::initializer_list<int>{(print_impl(t), 0)...};
}
int main(const int, const char *const[]) {
print("Hello", 1, 3, 5.5, "World");
... |
217a0d9b6f8e00d98062f197b8976edbf023ecff | 95d152746743a0032ed3e7bbe0dadd5e1f1582e9 | /tomau.cpp | d2fa3a44fc03eb1847b6379b945fa52d12836af0 | [] | no_license | tatphong/OLP | f9fa08c7827029f1b4a4e28645f975bf9703d9b8 | 9d41a9181bb6bb369d518948697b5d5a27ed135a | refs/heads/master | 2021-11-08T03:59:59.314925 | 2021-11-06T10:20:42 | 2021-11-06T10:20:42 | 196,706,189 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,558 | cpp | tomau.cpp | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int n, a[10000][10000], mau = 0;
ii dem[10000];
string s[10000];
vector <int> bancolor[10000];
void nhap()
{
freopen("TOMAU.INP", "r", stdin);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i];
for (int i = 0; i < n; ++i)
... |
81b8a205569eabd51b624419f703d1c4b271c2b8 | f0a95fab0e582fe5fff0f579ae0e7392193486bd | /RAVITEMP.CPP | 14eeb34d8e49a45ef79ba9d555e96e1c680f8b23 | [] | no_license | ravikumarmakwana/C-and-CPP-Programs | 5ed5c6f8dbc525bb1c349e79ee392de34ba7a60e | 4e227fafb14db02326dbf427bc4bf5ec27055ea2 | refs/heads/master | 2022-04-11T12:58:23.990926 | 2020-03-27T11:59:22 | 2020-03-27T11:59:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 293 | cpp | RAVITEMP.CPP | #include<stdio.h>
#include<iostream.h>
#include<conio.h>
#include<dos.h>
#include<stdlib.h>
void main()
{
int a;
int b;
clrscr();
while(1)
{
srand(time(0));
a=rand()%100;
b=rand()%100;
gotoxy(a,b);
cout<<"Ravi";
delay(1000);
clrscr();
if(kbhit())
break;
}
getch();
} |
ec4c82293d5360d2687bf6616cfb959af13c014c | 9feefb5c19469e528e40c183f45d295d7e3114d0 | /book/ch03/ch03-2.cpp | cbfed52842e0f2fe8f944cb0a20b8df5c748a729 | [] | no_license | oiu850714/cp2017 | a3807b1962488cd89f32b6e7d4fe30e14d962583 | 8af99ab586f96a16fc5e167a254ed1abd2fcf2c4 | refs/heads/master | 2021-01-19T18:17:24.388880 | 2017-04-25T13:14:41 | 2017-04-25T13:14:41 | 88,352,512 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 663 | cpp | ch03-2.cpp | #include <cstring>
#include <cstdio>
#define MAXN 100
int a[MAXN][MAXN];
int main()
{
int n, x, y, tot = 0;
scanf("%d", &n);
memset(a, 0, sizeof(a));
tot = a[x=0][y=n-1] = 1;
while(tot < n*n)
{
while(x+1<n && !a[x+1][y])
a[++x][y] = ++tot;
while(y-1>=0 && !a[x][y-1]... |
91f1b6aec6bf994a04b2b71cb7498ecede59d86c | b0b500980f0fc6902bfd32bcdc05716ae7372de7 | /ClientGame/AIGoal_BuyResources.h | dc1464a4ecdd66e8ce73cc5e8d68baa276dfc290 | [] | no_license | Gi133/Honours-Project | ba31639a95a9ba1ec26d7ee88a57090851cbb155 | f30ff50c61f45c419c4d0ea5722d0bc58eeb50b6 | refs/heads/master | 2021-01-21T22:26:51.267727 | 2015-06-18T15:43:45 | 2015-06-18T15:43:45 | 30,205,845 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 525 | h | AIGoal_BuyResources.h | #pragma once
#include "AIGoal.h"
class AIGoal_BuyResources :
public AIGoal
{
private:
std::string resourceName;
int resourceIterator, quantity;
unsigned int expectedPrice;
void ReceiveMessage(Message *message);
public:
AIGoal_BuyResources(std::weak_ptr<NPC> _owner, const std::string _resourceName, const unsign... |
e333976a602f23490d4216152d129fbda4a21848 | 35f0595998ebf26aea947dde8ecf8f7dc27ca603 | /first_round/easy/test/test_palindrome_number_9.cpp | 6b4073b8e5cc058b888096aea8a791d9b661fb9c | [
"MIT"
] | permissive | forwardkth/leetcode | 437d5e80388fc887f90edd4449d85c444709248a | f22a16f5bce91d589c689be251f4710bab7580fb | refs/heads/master | 2023-05-10T12:07:44.601103 | 2023-05-07T15:39:37 | 2023-05-07T15:39:37 | 167,970,291 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 550 | cpp | test_palindrome_number_9.cpp | #include "../include/palindrome_number_9.h"
#include <gtest/gtest.h>
//Google Test cases
TEST(Palindrome_Num_Test, Basics)
{
int num0 = 121;
int num1 = -121;
int num2 = 10;
int num3 = -101;
int num4 = 230;
Solution ts;
EXPECT_EQ(ts.isPalindrome(num0), true);
EXPECT_EQ(ts.isPalindrome(num1), false);
E... |
0b1fee98232ad7512f1c566540c1cc6f898ab51a | 568fa58296378fa129ab3349adf010daa44ed45b | /src/poly/tiling/tiling_strategy_manager_gpu.cc | c78f925ecf33084cb8195944eba58a4d520c4883 | [
"Apache-2.0",
"BSD-3-Clause",
"NCSA",
"X11-distribute-modifications-variant",
"Zlib",
"MIT",
"LicenseRef-scancode-unknown-license-reference",
"Unlicense",
"LLVM-exception",
"BSD-2-Clause"
] | permissive | mindspore-ai/akg | 37f471badc66de6a831f1f45ad84344f34d23ef2 | 99f33858d6972741748cbfc9ab0bf9600428fef7 | refs/heads/master | 2023-07-25T23:03:17.672665 | 2023-07-11T07:33:57 | 2023-07-11T07:33:57 | 274,077,856 | 319 | 36 | Apache-2.0 | 2021-12-30T13:43:08 | 2020-06-22T08:09:05 | Python | UTF-8 | C++ | false | false | 109,024 | cc | tiling_strategy_manager_gpu.cc | /**
* Copyright 2020-2022 Huawei Technologies Co., Ltd
*
* 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 applicabl... |
9de824f17323272ec4a7366d3dde139fee54d72d | 0b50cc42b6065a1a0442e09a9836a443b97ec249 | /thirdparty/sfs2x/Entities/Match/UserProperties.cpp | 76ba10edde4723a76024b4c55a21d0b0ef95eafd | [
"MIT"
] | permissive | godot-addons/godot-sfs2x | 06dc177d8289898d487d12e01ac1023cc7a63395 | a8d52aa9d548f6d45bbb64bfdaacab0df10e67c1 | refs/heads/master | 2021-07-12T02:01:23.368889 | 2020-05-31T19:25:12 | 2020-05-31T19:25:12 | 140,114,287 | 3 | 3 | MIT | 2018-07-07T20:44:16 | 2018-07-07T20:14:46 | null | UTF-8 | C++ | false | false | 1,287 | cpp | UserProperties.cpp | // ===================================================================
//
// Description
// Contains the implementation of UserProperties
//
// Revision history
// Date Description
// 30-Nov-2012 First version
//
// ===================================================================
#include "UserProperties.h"
... |
8f40428788134779a7a81b0c07e88c84443ef0cf | 93294d148df93b4378f59ac815476919273d425f | /src/Pigs/PigConfig/PigConfigSheet.h | e5959eea645127a821200c07fffab73717296d92 | [
"MIT"
] | permissive | FreeAllegiance/Allegiance | f1addb3b26efb6b8518705a0b0300974820333c3 | 3856ebcd8c35a6d63dbf398a4bc7f0264d6c823c | refs/heads/master | 2023-07-06T17:53:24.363387 | 2023-06-29T00:24:26 | 2023-06-29T00:24:26 | 98,829,929 | 86 | 34 | MIT | 2023-06-28T03:57:34 | 2017-07-30T23:09:14 | C++ | UTF-8 | C++ | false | false | 1,715 | h | PigConfigSheet.h | #pragma once
/////////////////////////////////////////////////////////////////////////////
// PigConfigSheet.h : Declaration of the CPigConfigSheet class.
//
#include "PageGeneral.h"
#include "PageServers.h"
#include "PageEvents.h"
/////////////////////////////////////////////////////////////////////////////
// CPi... |
eae9268f82ae33e97029432c8fbc30d9aa8c41f8 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5753053697277952_1/C++/iejr/main.cpp | defa2a511c58628e61e8707d3cbacfd4664708ce | [] | 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 | 2,915 | cpp | main.cpp | //iejr Header files
#include <stdio.h>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <cstring>
#include <sstream>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include ... |
544538187fa2c5baca4da4597102da0536db4982 | a36ffb00d8699c3b3555a8abfbe2cf1fb16a8368 | /src/socket/EzySocketAdapter.h | 35989f3849abf898e6dc37e232ee650bce207b9a | [] | no_license | sjb8100/ezyfox-server-cpp-client | 6508aa5e6a01c9e5f675052400d002d017c3ca3b | ebda81ecf981aa8620c7f7350654e89b0c22e551 | refs/heads/master | 2020-04-02T15:23:04.754575 | 2018-10-23T09:26:18 | 2018-10-23T09:26:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 700 | h | EzySocketAdapter.h | #pragma once
#include <queue>
#include <ctime>
#include <condition_variable>
#include "EzySocketCore.h"
#include "EzySocketPool.h"
#include "../base/EzyRef.h"
#include "../gc/EzyReleasePool.h"
EZY_NAMESPACE_START_WITH(socket)
class EzySocketAdapter {
protected:
bool mActive;
std::mutex mMutex;
EzySocket... |
067813150087b87ea2069507a5a7dc28ec27ebf7 | 75252daa56e54a129e6aa0275b980ecd675d4587 | /services/surfaceflinger/CompositionEngine/src/Display.cpp | f9d70e3c91da9cff4464f6ac695bf6d309130479 | [
"LicenseRef-scancode-unicode",
"Apache-2.0"
] | permissive | crdroidandroid/android_frameworks_native | 988870fcaeb1c28b5f73631afb52883c2c741c69 | c15d4c3a6322c819bd417e8f8b03223f151771b6 | refs/heads/10.0 | 2023-08-31T10:03:46.719048 | 2021-11-13T17:47:17 | 2021-11-13T17:47:17 | 277,143,821 | 6 | 53 | NOASSERTION | 2023-09-13T06:28:33 | 2020-07-04T16:11:59 | C++ | UTF-8 | C++ | false | false | 3,870 | cpp | Display.cpp | /*
* Copyright 2019 The Android Open Source Project
*
* 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 applica... |
3b6b4cb7cb1ef7d699eb2f5bfd5cb3992473e81a | 805f9f72b1d7f02943601ca372c78b56afabad08 | /Dynamic Programming 2/Shortest_Sequence.cpp | 4245231d46aaa7611f543e5337dda0efb1f05ac9 | [] | no_license | aSpanefRost/CodingNInjas | 79644f16ca14fe8eb841c0ac86d705c08006d4c9 | dc5f73023410a4fdf926aa1e9dea39edb891dbf2 | refs/heads/main | 2023-04-21T08:58:36.413161 | 2021-05-03T18:36:50 | 2021-05-03T18:36:50 | 363,832,006 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 674 | cpp | Shortest_Sequence.cpp | Shortest Subsequence
Send Feedback
Gary has two string S and V. Now, Gary wants to know the length shortest subsequence in S, which is not a subsequence in V.
Note: The input data will be such that there will always be a solution.
Input Format :
The first line of input contains a string, that denotes the value of S. Th... |
cfd1b853555e8843f2f677b84742ada35f79c37e | 227fe1226f59d6033e20ef456a1f8288091c5312 | /src/lcbio/manager.h | 8b66e1e34d62be85bb98419e9fdfbfa715180698 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | couchbase/libcouchbase | 697ca0f621bff80e242fa1099be8d0160dd2bc55 | 6e411d412ba3f5039d21ea4195dca86b0f82134b | refs/heads/master | 2023-08-30T23:38:38.586108 | 2023-08-16T13:39:57 | 2023-08-16T14:41:12 | 2,077,002 | 120 | 100 | Apache-2.0 | 2022-09-19T12:29:14 | 2011-07-20T08:43:46 | C | UTF-8 | C++ | false | false | 5,501 | h | manager.h | /* -*- Mode: C; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/*
* Copyright 2014-2020 Couchbase, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* ... |
cf6dc93e5ecbba7f79efc5db6e12123778ce77b8 | 572580660d475027fa349e47a078479222066726 | /Server/kennel/�������̨/MonitorSchedule/StateConditionItem.h | 95429d18781e85d9d1de23d49d21cf84663c0154 | [] | no_license | SiteView/ecc82Server | 30bae118932435e226ade01bfbb05b662742e6dd | 084b06af3a7ca6c5abf5064e0d1f3f8069856d25 | refs/heads/master | 2021-01-10T21:11:37.487455 | 2013-01-16T09:22:02 | 2013-01-16T09:22:02 | 7,639,874 | 6 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 375 | h | StateConditionItem.h | //#pragma once
#ifndef DRAGONFLOW_STATECONDITIONITEM
#define DRAGONFLOW_STATECONDITIONITEM
#include "MonitorSchedule.h"
class StateConditionItem
{
public:
int m_ItemID;
CString m_ParamName;
char m_Operator[10];
CString m_ParamValue;
StateConditionItem(void);
~StateConditionItem(void);
};
typedef std::list<... |
37ae1170cb8e15c608b475d6d7041317817eb73e | 2fa764b33e15edd3b53175456f7df61a594f0bb5 | /appseed/core/user/simple/simple_tab_ctrl.cpp | 8c87f5626d1f9f8110ba940554918f7c7271a923 | [] | no_license | PeterAlfonsLoch/app | 5f6ac8f92d7f468bc99e0811537380fcbd828f65 | 268d0c7083d9be366529e4049adedc71d90e516e | refs/heads/master | 2021-01-01T17:44:15.914503 | 2017-07-23T16:58:08 | 2017-07-23T16:58:08 | 98,142,329 | 1 | 0 | null | 2017-07-24T02:44:10 | 2017-07-24T02:44:10 | null | UTF-8 | C++ | false | false | 756 | cpp | simple_tab_ctrl.cpp | #include "framework.h"
//#include "simple_tab_control.h"
simple_tab_control::simple_tab_control(::aura::application * papp):
object(papp),
::user::interaction(papp),
::user::tab(papp),
place_holder_container(papp)
{
}
simple_tab_control::~simple_tab_control()
{
}
void simple_tab_control::_001OnD... |
04a06f3581143d74850b95dc3e9bdb6880fd7d40 | 387a33a39a9c3dd22603d5510de0eae86ce8250e | /zmmo_server/zmmo_server/game.h | aaa0d107c418c46097b58230633af6fce58cfde5 | [] | no_license | DuckMonster/zombiemmo | e873eb9023ad80e2a2b9625265277e17c07b632b | 05e4ea604da64b5d0806757f7def2fc47e878de6 | refs/heads/master | 2020-04-24T02:14:50.810929 | 2016-12-07T13:59:21 | 2016-12-07T13:59:21 | 75,840,929 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,293 | h | game.h | #pragma once
#include "map.h"
#include "entity.h"
#include "actor.h"
#include "player.h"
#include "collection.h"
#include "collision.h"
#include "playercontroller.h"
#include "chunk.h"
#include "line.h"
class CProgram;
class CGame {
public:
CGame( CProgram* program );
~CGame( );
void Update( float delta );
void... |
d1648033e4b044cbccc2c43f700b76f53574b33f | fdbe0d1a03ca5b44ba83a7c386639ebbc2aca19e | /revision of c/palindromes in list.cpp | c71860333ac5398149cd0fa782b07cee10913f23 | [] | no_license | Mohanakhil/output-of-devc- | cdfbd89f41035ef2983d67b7924654de540403e3 | aed25e14f79c4e0d207b5afb74e8f0c19d7f71f4 | refs/heads/master | 2023-03-07T13:24:25.237712 | 2021-02-09T11:11:52 | 2021-02-09T11:11:52 | 337,379,214 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,807 | cpp | palindromes in list.cpp | #include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
void create(struct node **head,int newdata)
{ struct node *newnode=(struct node*)malloc(sizeof(struct node));
newnode->data=newdata;
newnode->next=*head;
*head=newnode;
}
int palindrome(struct node **head)
{ int c=0,i=1,s=1;
struct nod... |
9c05ad830110085c0c06b90a4e50368ca0841fc0 | e3505cfd86c57b1869c2885a3a44550af552d483 | /source/resource/pluginUtilities/cxServiceTrackerListener.h | 934ad810badeca90b6d2c30ec542e56fb331fdfc | [
"BSD-3-Clause"
] | permissive | leettran/CustusX | afb6a3bc6607bf28fa1c94f94b66cf9979728cd5 | b4e64e0db364da189ee9eafa54ce0ab258f5105a | refs/heads/master | 2021-07-14T03:33:55.038281 | 2017-02-09T09:29:57 | 2017-02-09T09:29:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,739 | h | cxServiceTrackerListener.h | /*=========================================================================
This file is part of CustusX, an Image Guided Therapy Application.
Copyright (c) 2008-2014, SINTEF Department of Medical Technology
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are per... |
89081f4378c60e150cc4c7984f5291239b870cb1 | 54da97058e1319bf0bc1c60198558aeb6b004ecd | /Material/AceTable/AceReaction/EnergySampler.hpp | c71d0a922f4af8a13d4f4f667b89eadc26d3cecb | [
"BSD-3-Clause"
] | permissive | khurrumsaleem/helios | 202021d96490bd4ad117ccc1196799c019285e7a | fe7a06992abcf495d9b09d2d172b8cc6fdd67b80 | refs/heads/master | 2022-01-24T21:45:51.088917 | 2020-06-27T05:19:10 | 2020-06-27T05:19:10 | 205,647,629 | 0 | 0 | null | 2019-09-01T08:08:19 | 2019-09-01T08:08:19 | null | UTF-8 | C++ | false | false | 6,752 | hpp | EnergySampler.hpp | /*
Copyright (c) 2012, Esteban Pellegrino
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and th... |
630a19389e52a2252340863e4e53a06e9e58494f | 71b972e06defda5e5d61d95cf41b050d381931d9 | /Libreria/FORMAS/Ayuda.cpp | 5673d7330331e044f902dafc515d09d8d92aeb73 | [] | no_license | antoniocarrillo69/Alarma | c742d48be6fd6266294ffedd9e81cc5f51b5ae19 | 42cc1c42966ec2e6fcf9b9276fa6056feb435d50 | refs/heads/master | 2021-01-19T14:01:27.850391 | 2017-04-13T03:35:35 | 2017-04-13T03:35:35 | 88,121,492 | 0 | 1 | null | null | null | null | ISO-8859-1 | C++ | false | false | 2,875 | cpp | Ayuda.cpp | // Autor: Antonio Carrillo Ledesma.
// R.F.C.: CALA-691229-TV5
// Dirección: Amsterdam 312 col. Hipodromo Condesa
// Teléfono: 5-74-43-53
// Propiedad intelectual, todos los derechos reservados conforme a la ley, registro en tr mite
// Revisión 1.0-A
#include <vcl.h>
#include <stdlib.h>
#include ... |
d899e617f05ad2b1fed36a7367d23f1afb580c97 | 5b965ace4c7a619e439ba32cbc811f2cb14d956d | /Basic/Array/Learning Output.cpp | 9b8f62b8633e65a5c2d8aa62a026d03d03e05e47 | [] | no_license | R4GH4V/geeksforgeeks-Practise | 96da525232c3665900ddbca2499e271bf1eb34b9 | 9cde59f68d3d6bd6a37e60ccf595808b9daabcd7 | refs/heads/master | 2020-12-30T14:56:58.629472 | 2018-01-01T05:15:00 | 2018-01-01T05:15:00 | 91,097,199 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,405 | cpp | Learning Output.cpp | /*
Being a Programmer you have to learn how to make your output looks better. According to the company, its company programmers have to present its output in a different manner as : If your output is 10.000000 you can save the decimal places and thus your output becomes 10. Now u have the learn the way to output. You a... |
6ab5cd8ea1fa8184892991bb57a6ce91ab2f5a4c | fb9bcf29dde6cf613852ae6caa6513b56d2447f4 | /Uebung3/Uebung3/view/window.hpp | c2b0f3c79f917b3a9c463b0b15e9dd0bd56a6c3e | [] | no_license | eliza90/cpp4cg3 | 3ed551aafebe86374ea6e0719d014d803ed9a95f | 3caa87a2e60fe939d8140f423bf0e19fe0792524 | refs/heads/master | 2020-04-01T21:26:24.979304 | 2014-05-13T18:15:13 | 2014-05-13T18:15:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 863 | hpp | window.hpp | #pragma once
#include "../stdafx.h"
#include <exception>
#include <memory>
namespace view{
class Window{
public:
Window(size_t width, size_t height, const std::string& name);
~Window(){}
unsigned int width() const{ return _width; }
unsigned int height() const{ return _height; }
// request window redisplay... |
31375b54ef47316f0b497e70df9219be37ac939e | 8c2e7b8aad0d4a70178d3a6e3b5cbd9400db37a9 | /DataFormats/CaloTowers/src/classes.h | 01e8f9186d8fd0424c4d85d4b20245a1891de699 | [
"Apache-2.0"
] | permissive | cecilecaillol/cmssw | 96961b5815d0d6e7127a6f59c882ec5b8e86feb8 | 3d70b56717b9b8d49aaffcdbef6fb68e3b81fddb | refs/heads/l1t-integration-CMSSW_10_3_1 | 2023-03-17T06:40:24.755366 | 2019-04-16T11:06:39 | 2019-04-16T11:06:39 | 331,005,975 | 0 | 2 | Apache-2.0 | 2023-02-08T14:43:10 | 2021-01-19T14:25:16 | C++ | UTF-8 | C++ | false | false | 1,595 | h | classes.h | #include "Math/Cartesian3D.h"
#include "Math/Polar3D.h"
#include "Math/CylindricalEta3D.h"
#include "DataFormats/CaloTowers/interface/CaloTowerCollection.h"
#include "DataFormats/Common/interface/Wrapper.h"
#include "DataFormats/Common/interface/RefHolder.h"
#include "DataFormats/Common/interface/Holder.h"
#include... |
3143257bdd439f06f6f45a33393c38c5f28c7e9c | bca6d0ddae9475c6ffe6d5d9e31614abb63fce3e | /Code/src/ardrone_velocity_ekf/include/ardrone_velocity_ekf/pose_controller.hpp | 8de1f6330236b988434c450225c7a2a5fb8844a3 | [] | no_license | Forener01/Drone_thesis_2017_old2 | 2860adfcd1705f632970e8ae59eef55ba5267940 | c9f5845cde6dbaf52db602353c22cacad352b51d | refs/heads/master | 2021-08-29T02:11:16.072982 | 2017-12-13T12:31:21 | 2017-12-13T12:31:21 | 108,832,385 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 817 | hpp | pose_controller.hpp | #ifndef POSE_CONTROL_HPP
#define POSE_CONTROL_HPP
#include <geometry_msgs/Pose.h>
#include <geometry_msgs/Twist.h>
#include <math.h>
#include <nav_msgs/Odometry.h>
#include <ros/ros.h>
#include <stdio.h>
#include <ardrone_velocity_ekf/test_controller.hpp>
class Pose_Control {
public:
Pose_Control();
ros::NodeHa... |
68f130fc387103ac3c8406b51fb7db3725e6a153 | f1b4399af130b02b13a4d071ff832ed28ede151c | /src/ispdb/autotests/autoconfigkolabldaptest.cpp | b6c9b52edfe4da2cc930dc2f73faae47dbef95e6 | [
"BSD-3-Clause"
] | permissive | KDE/kmail-account-wizard | 220a1ab089a744cab1592c3620ccf6b7f8535370 | 81f01fa5957b5df6c90c49cd38230e3121a85bcb | refs/heads/master | 2023-08-17T09:59:37.859362 | 2023-08-08T01:52:18 | 2023-08-08T01:52:18 | 66,907,965 | 5 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 7,042 | cpp | autoconfigkolabldaptest.cpp | /*
SPDX-FileCopyrightText: 2014 Sandro Knauß <knauss@kolabsys.com>
SPDX-License-Identifier: LGPL-2.0-or-later
*/
#include <QObject>
#include <QProcess>
#include <QTcpSocket>
#include <QTest>
#include "../autoconfigkolabldap.h"
class TAutoconfLdap : public AutoconfigKolabLdap
{
public:
void startJob(cons... |
7ba5c59d59be58904234ad163887ba916169635a | 1d9b94e8130b0a3018d8b9b808ea6a502c513f73 | /src/libsinks/WavFileSink.cpp | 8567d80eb1ee75be550ae4be233004ebc9292292 | [] | no_license | elerer/ns | 57db28bc92957bc195571050f187bb996d97d6e1 | f86514fcbd07dce564acc689cc81f86fdc954e54 | refs/heads/master | 2020-03-21T01:27:12.294856 | 2018-07-05T20:43:22 | 2018-07-05T20:43:22 | 137,943,414 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,671 | cpp | WavFileSink.cpp | #include <WavFileSink.h>
#include <iostream>
WavFileSink::WavFileSink(const size_t &numchannels, const size_t &samplerate, const size_t &bitrate,
const std::string &filename, const std::string &tmpPath, const std::string &path) : _numchannels(numchannels),
... |
e0e456bdd97f61b475a29cef76b71c3285bf5318 | e1f44d7946a63d3cbd23a5863f238302bc44b231 | /core/src/ColorNames.h | 8e9b5fd8e9ab9a618ad1ac77b61305a468658ab4 | [
"BSD-3-Clause"
] | permissive | frankencode/fluxkit | c3c89f64ce6274cafc1b4ba4b7a4b68449832e17 | 0436454f0791d8fddf8e0adc383ef7c54080245d | refs/heads/master | 2021-01-10T20:47:09.542803 | 2015-10-28T18:13:09 | 2015-10-28T18:13:09 | 565,413 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 740 | h | ColorNames.h | /*
* Copyright (C) 2007-2015 Frank Mertens.
*
* Use of this source is governed by a BSD-style license that can be
* found in the LICENSE file.
*
*/
#ifndef FLUX_COLORNAMES_H
#define FLUX_COLORNAMES_H
#include <flux/Color>
namespace flux {
template<class Char, class Value> class PrefixTree;
template<class Sub... |
e96867da0a90d0413c2c7ec2eaedff8c4556c750 | dcbc92e7ea76c361e9c15f2ee8887c019c25c451 | /Calc_hash_sim.h | a8f4190b149d5e163781a4cc8b24045beb6c3a32 | [] | no_license | hidekiS/Calc_hash_sim | ad8faffc5b7d66d6e6d34a66742bebaa7921187e | fa17da8e385974cc15618bdeb1a52028e4d30838 | refs/heads/master | 2016-08-11T00:12:14.445982 | 2016-03-02T07:36:28 | 2016-03-02T07:36:28 | 52,941,566 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,645 | h | Calc_hash_sim.h | /*
* Calc_hash_sim.h
*
* Created on: 2015/11/02
* Author: shiroshita
*/
#ifndef CALC_HASH_SIM_H_
#define CALC_HASH_SIM_H_
#include <iostream>
#include <stdio.h>
#include <string>
#include <typeinfo>
#include <fstream>
#include <vector>
#include <math.h>
#include <boost/algorithm/string.hpp>
#include <boost... |
6d6f7392cc4aa6e7f09edf5a5fe6fe58e997c6a9 | 13e0832d81c3255b7abef4d5fc3c030cfdd31bc5 | /FaceCheck/FaceCheck/EmbeddedMySQL.cpp | 89d586e889ed97915d15dd08111fc28a57dbe6f5 | [] | no_license | kcb0126/FaceCheck | 625ae690e3c833631c23e52f0d9da9f48be7367f | 14678344bc24e6580bede6d3634819983ee27fdb | refs/heads/master | 2021-01-23T16:53:23.056483 | 2017-10-11T12:12:49 | 2017-10-11T12:12:49 | 102,749,158 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 48,055 | cpp | EmbeddedMySQL.cpp | #include "StdAfx.h"
#include "EmbeddedMySQL.h"
#include "FaceCheck.h"
#include "myDef.h"
#include "ExecutablePathInfo.h"
#include <ShlObj.h>
#include "DlgOfSetServer.h"
CString g_strUsername;
int g_nUserID;
int g_nMaxMugIndex;
CString g_strPlace;
CEmbeddedMySQL* g_pDBManager;
CEmbeddedMySQL::C... |
416b571790154b7f9206866338a585cb0470281c | 06a02b5ef783f14c6eccf4ccd391f488801ef8e6 | /D3DXFrameWork/Engine/Headers/Buffer_Trail.h | d18354253d71548f5f1f608739b5977c8ab4e381 | [] | no_license | ancal258/D3DProject_DeadPool | a87231e7563452608b243a5e3dbb61f5a61f4e5e | 3938e831bfdb466ed23ec8ea77d24ab3513a92a4 | refs/heads/master | 2021-10-10T03:13:56.104158 | 2019-01-06T04:42:00 | 2019-01-06T04:42:00 | 158,417,729 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 902 | h | Buffer_Trail.h | #pragma once
#include "VIBuffer.h"
// 2D : ViewPort Space
// 3D : Local Space
// 3차원 로컬스페이스 상에 정의되는 정점들이다.
// 네모 형태를 그린다.
// 텍스쳐가 맵핑된다.
_BEGIN(Engine)
class _ENGINE_DLL CBuffer_Trail final : public CVIBuffer
{
private:
explicit CBuffer_Trail(LPDIRECT3DDEVICE9 pGraphic_Device);
explicit CBuffer_Trail(const CBuf... |
7a8c9bf2b4a8244d855380bdfaf5c579f93663f0 | f8a222de50e85dfd4de79856d8053f571efe9479 | /Engine/Code/Engine/Network/NetConnection.cpp | 4b3a7ca5c09da74450636596089eff6018f95401 | [] | no_license | ValhallaCode/Guildhall_Work | f813ec69f2230522446d57eb06d224abcd7a5be5 | 2020207299bd83ddc292f1c15f7ba9c85fa71cc0 | refs/heads/master | 2021-09-05T10:41:22.253563 | 2018-01-26T14:06:08 | 2018-01-26T14:06:08 | 119,058,534 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 178 | cpp | NetConnection.cpp | #include "Engine/Network/NetConnection.hpp"
NetConnection::NetConnection()
:m_prev(nullptr)
, m_next(nullptr)
, m_owner(nullptr)
{
}
NetConnection::~NetConnection()
{
}
|
221cbf076dee5a1f1dd8ec5739c4a62fde68d33e | 81b2279b2b24636ccaebb091d7543537142a9272 | /剑指offer/面试题57 - II. 和为s的连续正数序列_easy/重刷剑指offer_暴力法_超时.cpp | e2ac08418e0feb1eac68f52ebaa61390265c670c | [] | no_license | gwtak/My_Leetcode | be6a8d5a050bcd378ae8cfd38ea5b0e5d6f4f70d | bcbebcc8e6c9c58237698ab7534aa3718c489f21 | refs/heads/master | 2022-12-31T22:23:20.771120 | 2020-10-20T10:29:19 | 2020-10-20T10:29:19 | 263,764,562 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 537 | cpp | 重刷剑指offer_暴力法_超时.cpp | class Solution {
public:
vector<vector<int>> findContinuousSequence(int target) {
vector<vector<int>> res;
for(int i=1;i<=target/2;i++){
int sum=0;
for(int j=i;j<=(target/2+1);j++){
sum+=j;
if(sum==target){
vector<int> tmp;
... |
d6620ba3dbf84c78568e95656f4670b13d066269 | 2b196a99a4af98f56828ce148a009a839a536e1f | /simulator/voxcad-code-2014/GeneratedFiles/release/moc_QVX_TensileTest.cpp | 193e61682886b998d7e218c312995088b71bece0 | [
"Apache-2.0"
] | permissive | fgolemo/EC14-LargeSoftSim | f61d1f5e1abc0cde57325d33ba5c8bcc86113568 | e61f0224303231ff8dc60fb00170c6ca874d3d69 | refs/heads/master | 2021-01-10T11:27:53.456877 | 2016-01-20T17:54:01 | 2016-01-20T17:54:01 | 49,879,380 | 0 | 1 | null | 2016-02-25T11:47:45 | 2016-01-18T13:43:54 | C++ | UTF-8 | C++ | false | false | 5,331 | cpp | moc_QVX_TensileTest.cpp | /****************************************************************************
** Meta object code from reading C++ file 'QVX_TensileTest.h'
**
** Created: Mon Aug 25 22:50:34 2014
** by: The Qt Meta Object Compiler version 63 (Qt 4.8.1)
**
** WARNING! All changes made in this file will be lost!
*******************... |
8dc2e6e64bf82d329ce4e34910e8c25d36fe7703 | b28575448da2861779f714c0b4f9c68a0be6e9a9 | /EBERGIA/number/number.ino | e3e7af960d2c737109eaec8798857f924846fa47 | [] | no_license | SijieChenXM/Study-Notes-of-MSP430 | 906ab6dd0872c1c3709e9289ad3e8084764d9f27 | 75e8f4f58d0869902908f65265ae89cc67a9a8c4 | refs/heads/master | 2020-06-16T05:25:47.922630 | 2019-07-06T09:03:52 | 2019-07-06T09:03:52 | 195,490,245 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,123 | ino | number.ino | int a = P1_0;
int b = P1_1;
int c = P1_2;
int d = P2_0;
int e = P1_4;
int f = P1_5;
int g = P1_6;
int dp = P1_7;
char x=0;
int y=0;
int z=0;
const unsigned char LED8Pin[]={a,b,c,d,e,f,g,dp};
const unsigned char LED8Code[]= { 0xC0, 0xF9, 0xA4, 0xB0,0x99, 0x92,0x82, 0xF8, 0x80, 0x90, 0x88, 0x83,0xC6,0xA1,0x86,0x8E }; ... |
9d03c02b65a6b1187dc273c2635f560bed5606f2 | 9aed3609960b3879e13507a0009002c1d3a44088 | /TheGame/T2.h | 23e7fb62d4bcdc51b8ef7e2809aa1f8fdc3335c6 | [
"MIT"
] | permissive | Evildea/DinosaurGame | ebfec5bda4b9702c7766857007669a26332070ec | fe46e58b6aa1bcdd9ab726c182faf9fdbb06181f | refs/heads/master | 2020-06-23T08:50:25.186445 | 2019-07-30T06:51:52 | 2019-07-30T06:51:52 | 198,575,532 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 936 | h | T2.h | #pragma once
#include "Renderer2D.h"
#include "Global.h"
#include <math.h>
#include "V2.h"
#include "M3.h"
// The function of the T2 (Target Vector2) is to provide a target in 2D space to look towards or travel towards.
// This is primarily used to ensure that head of the dinosaur rotates smoothly between targets.
cl... |
78ddde2f67d3e9f9942493f0d9b701600964c4e0 | 15c6360b99546b2850230976aa37177a3925e930 | /Pratice/arrfun3/arrfun3.cpp | 5a4c939d5682b16b860af608d085c47b33ac88a7 | [] | no_license | Yyyye/CppPrimerPlus | d232915df0e0e20fbb4dd12894fee0cb32841a65 | 7478f738d943829764e3bce813295182de07c704 | refs/heads/master | 2021-09-03T20:09:11.440550 | 2018-01-11T16:35:56 | 2018-01-11T16:35:56 | 114,254,833 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,500 | cpp | arrfun3.cpp | #include<iostream>
const int Max = 5;
int fill_array(double ar[], int limit);
void show_array(const double ar[], int n);
void revalue(double r, double ar[], int n);
int main()
{
using namespace std;
double properties[Max];
int size = fill_array(properties, Max);
show_array(properties, size);
if (size > 0)
{
... |
ca840308ed29f6fca9a5712f1dbcb6a718da29c1 | 00d59fc683ae26dbda511bab355836b9e2e6b43d | /poj/1001/11504061_AC_0MS_220K.cpp | 7f0e2d3ed3e8f53754f2e4f051e8991becb9aa1e | [] | no_license | howardchina/ACM-ICPC-solved-problem | 01f8744c12b765ffc0ea23600fab79c58a5f6e0e | 63805f390c754c4561d43c4902939eff26ad7cbd | refs/heads/master | 2020-04-01T20:22:33.562335 | 2018-12-11T09:09:03 | 2018-12-11T09:09:03 | 153,601,172 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,888 | cpp | 11504061_AC_0MS_220K.cpp | #include<cstdio>
#include<iostream>
#include<cstdlib>
#include<queue>
#include<cstring>
using namespace std;
char s[7];
int len,len1,i,j,n,point,num;
int ans[200],result[200],a[7],ok,d,m;
void F() //乘法函数
{
for(i=0;i<len;i++)
for(j=0;j<len1;j++)
{
result[i+j]+=(a[i]*ans[j]%10)... |
c84d9e1e8b451db06b94f7f0d81aee45330f4e7a | d56eae354ff88d550d467194b1b514b04cc37970 | /557. Inverts the word III in a string/test.cpp | 3fb66429e25287326ce24917641189a6863a3e78 | [] | no_license | yangxu1003/leetcode | ae7d0c067abf548429863327a0743d5caf2a38f1 | 64f998721e3a417fb6efa55eb421006aa24c3867 | refs/heads/master | 2023-07-13T17:14:46.640323 | 2021-08-12T15:29:11 | 2021-08-12T15:29:11 | 318,562,627 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 354 | cpp | test.cpp | class Solution {
public:
string reverseWords(string s) {
size_t pos = 0;
int left = 0;//每次走的位置
while((pos = s.find(' ', pos+1)) != string::npos)
{
reverse(s.begin()+left, s.begin()+pos);
left = pos+1;
}
reverse(s.begin()+ left, s.end());
... |
d41141b25ba1ef70393d3987666f7a21ade97555 | 9d31ba5aac1d7686d2ee3e017521a54356082bf3 | /lib/schwa/grfx/renderbuffer.h | 185b69dc8f0a6bcb9c9b9547edb30799a4c3503f | [] | no_license | schwa423/Sketchy | 24bb0b2879af8200e778f6e0ebe8b6b560a676b9 | daa1dff85c1166529d2f9787545b25305702d7e0 | refs/heads/master | 2020-04-06T23:17:43.953723 | 2014-05-31T21:18:27 | 2014-05-31T21:18:27 | 3,026,018 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,230 | h | renderbuffer.h | //
// renderbuffer.h
// schwa::grfx
//
// Created by Josh Gargus on 9/23/12.
// Copyright (c) 2012 Schwaftwarez.
// Licensed under the Apache License, Version 2.0.
//
//
#ifndef __schwa__grfx__renderbuffer__
#define __schwa__grfx__renderbuffer__
#include "renderer.h"
#include "framebuffer.h"
#include "platform_g... |
7fb0ec328010a6df764f532131f416c4dcb139d8 | c5ba5268e6eca1bc3168f51bae91ba8ac1b5fb92 | /unused/class_custom_cout.h | da0953695f43b3daae0660b242304f7342af3e96 | [
"MIT"
] | permissive | DavidAce/DMRG | ee77ad50812946ec272334e58d862298065ca4b0 | e65be677bc4e3e61c8b38b982e5bbf5dad797063 | refs/heads/master | 2023-08-16T19:30:16.568518 | 2023-04-14T06:27:43 | 2023-04-14T06:27:43 | 98,307,786 | 11 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,188 | h | class_custom_cout.h | //
// Created by david on 2018-01-16.
//
#ifndef DMRG_CLASS_CONSOLE_PRINTER_H
#define DMRG_CLASS_CONSOLE_PRINTER_H
#include <chrono>
#include <iostream>
class class_custom_cout
{
public:
int verbosity = 0;
int temp_verbosity = 0;
std::ostream &os;
explicit class_custom_cout(std::ostream &o = std::co... |
98c34e49a9f0ba90b52384547789f67b8ac0f4d4 | 32ac6dabcc8b2c872e03a8fedf2801dba76863ea | /Src/Strategy/Common/VirtualRosbee.h | c5f89aabef174adae0f7b62ac602d62940df6c93 | [] | no_license | CharanKoyalkar484/RoboRescueCproject | cf061e063942514062c06633922872f1dc84e032 | f5e658468f4f3282f045e3afb60e944255adc06d | refs/heads/master | 2021-02-18T04:03:29.210397 | 2020-04-13T07:14:40 | 2020-04-13T07:14:40 | 245,157,866 | 0 | 0 | null | 2020-04-13T07:14:41 | 2020-03-05T12:30:08 | C++ | WINDOWS-1252 | C++ | false | false | 3,806 | h | VirtualRosbee.h | /**
* __
* _________ / /_ ____ ________ ____________ _____
* /___/ __ \/ __ \/ __ \/ ___/ _ \/ ___/ ___/ / / / _ \
* / / / /_/ / /_/ / /_/ / / / __(__ ) /__/ /_/ / __/
* /_/ \____/_.___/\____/_/ \___/____/\___/\__,_/\___/
*
*
* @file VirtualRosbee.h
* @date Created: 4/28/2015
* @version 1... |
3e2c9d84e71372760db7f20f5272deeb3da5f4e8 | 83e240dc3127db4261ddc749c43a0062fe708799 | /ITP1_10_C.cpp | 381b11a444c8cf424eb761ecbee2307715f56296 | [] | no_license | Fujino-r7F/AOJ_ITP | f188bab60437b9ee6a861e0557a463374cf3053a | 1a9605dbc41e28d0fafe03e514f410c472e7c2ac | refs/heads/master | 2021-03-29T18:38:09.197278 | 2020-03-23T07:05:46 | 2020-03-23T07:05:46 | 247,976,336 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 463 | cpp | ITP1_10_C.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(true){
cin >> n;
if(n == 0)break;
double S[n] = {0};
double sum = 0;
for(int i=0;i<n;++i){
cin >> S[i];
sum += S[i];
}
double ave = sum / n;
double var ... |
7fc4af26ca2a60bf51e3cd5eb4eaa132c268af5d | 2169f381976a72244245abda54f62d051d796464 | /src/buffers/VertexBuffer.h | fd261517c4ecbab0641aabfa6446d35e08e35a4c | [] | no_license | kanadas/graphX | e5be4d4d8ff69d178065229ad8a92aaa8cc91ef2 | 7f70fcd69f791debb9a9c98713ae955e64f12a9f | refs/heads/master | 2023-02-26T07:33:48.311882 | 2021-02-01T12:08:20 | 2021-02-01T12:08:20 | 332,520,127 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 484 | h | VertexBuffer.h | #ifndef __VERTEXBUFFER_H_
#define __VERTEXBUFFER_H_
#include "glad/glad.h"
class VertexBuffer {
private:
GLuint rendererID;
public:
VertexBuffer(const void* data, GLuint size, GLenum usage);
VertexBuffer(const void* data, GLuint size);
~VertexBuffer();
void bind() const;
void unbind() const;... |
97745f6500264300ba04a43ff2b2b8913f5152a7 | 624a105dbe52630ac0cb123e69c0ace95fe9d34b | /2nd_semester/hw08/01/bag.h | aabdbc44edb3f84a70c9f0101151d3cf798a0a7e | [] | no_license | Axroy/SPbSU_study | f6769618d5ca4279a1a8a6cf1c90f0153461e948 | 6bd43d1b3e4105f898d1960f823b44595be020f9 | refs/heads/master | 2020-12-25T17:03:59.820392 | 2016-06-01T14:33:10 | 2016-06-01T14:33:10 | 30,873,932 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 875 | h | bag.h | #pragma once
#include "AVLTree.h"
///Class representing set with possibility of repeating elements.
///Based on the AVL tree.
class Bag
{
public:
Bag() : tree(new AVLTree){}
~Bag()
{
delete tree;
}
///Adds value to the bag.
void insert(int value)
{
tree->insert(value);
}... |
d7fcf4cc4e618e420e99e73835f8fb8797e3f718 | e056199b86697d3b20eb76f34c324c822d5edd30 | /Samples/08_Base_memory_management/MemoryMap/MemMap4/main.cpp | 4faffaeeaed8762a7e7811abcfc0a98a1893561e | [
"MIT"
] | permissive | MihailRomanov/System_Programming_Course | 6fac57227e28568ecc6cce00d4c0ae96a114d28b | 49ac442646b3c518b975ed89b412202d34d66bf1 | refs/heads/master | 2020-03-28T11:23:43.241667 | 2019-03-25T15:04:26 | 2019-03-25T15:04:26 | 148,208,170 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 567 | cpp | main.cpp | #include <cstdio>
#include <Windows.h>
void step(int i, const char *comment)
{
printf("Step %d : %s\n", i, comment);
char b;
scanf_s("%c", &b, 1);
}
int main()
{
step(0, "Before reserv");
void * a = VirtualAlloc(0, 1000000, MEM_RESERVE, PAGE_READWRITE);
printf("%X\n", a);
step(1, "Befo... |
97ad18d52f485dc80e99283eb65df1a7d0c4d6f9 | 5110db3788c0bfca4556d0105b229d573857b23d | /IO/ImageLoader.cpp | f7ae2c559c38ab70424e8d14ca672ad522e14b32 | [] | no_license | anton-brandl/RegistrationApp | b14b668f9c705d11f5bdb862cc234314988c2dab | d59b0af19d6daad65656815131d9e8c1cf194702 | refs/heads/master | 2023-03-09T20:57:59.251599 | 2015-07-15T10:16:25 | 2015-07-15T10:16:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 538 | cpp | ImageLoader.cpp | /*#include "ImageLoader.h"
template <class PixelType>
itk::Image<PixelType, 2>* ImageLoader::loadDicomImage(std::string src)
{
const unsigned int ImageDimension = 2;
typedef itk::Image< PixelType, ImageDimension > ImageType;
typedef itk::ImageFileReader< ImageType > ImageReaderType;
ImageReaderType::Point... |
5b6760e1bc24ecef54f16001a54eae86f46dad05 | dc5f5b7a0add1198678c27addde067e4413b8b3e | /Static.cpp | a00ef8c35fe8e73f2ed2f31306425733ee56d177 | [] | no_license | lalomx/learning-cpp | 221a0a83e7e0651f6316864ae260efd0158971d0 | 6fe06a2f130b3f2e89abfeebc8e2b7d9ca7672d5 | refs/heads/master | 2023-08-27T06:44:24.654455 | 2021-10-10T00:29:53 | 2021-10-10T00:29:53 | 414,446,884 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 257 | cpp | Static.cpp | static int s_Number = 5;
class Singleton {
public:
// gettting instance by creatin a local scoped static variable
// return the ref of it
Singleton& Get()
{
static Singleton instance;
return instance;
}
void Change(int a) {
s_Number = a;
}
}; |
3fd4da1cb45230beb2227ba02cbadde7f9e89711 | 8dfe4bef840a00972ebe18634bbf28636dec9949 | /FKCWLib/FKCW_TMX/Source/FKCW_TMX_MapInfo.cpp | b037dab464aff52fc933783a32b361553af2345e | [] | no_license | pingfanJerry/FKCocos2dxWrapper_2.x | ba644308746557e99f8fa201a832aafa7e806927 | 2ff906f10a030d7a2dbe968ba9d17798e2537a37 | refs/heads/master | 2020-03-10T16:58:40.391923 | 2017-03-16T06:43:05 | 2017-03-16T06:43:05 | 129,487,589 | 1 | 0 | null | 2018-04-14T06:12:13 | 2018-04-14T06:12:13 | null | UTF-8 | C++ | false | false | 2,619 | cpp | FKCW_TMX_MapInfo.cpp | //-------------------------------------------------------------------------
#include "../Include/FKCW_TMX_MapInfo.h"
#include "../Include/FKCW_TMX_TileSetInfo.h"
//-------------------------------------------------------------------------
FKCW_TMX_MapInfo::FKCW_TMX_MapInfo()
{
}
//-------------------------------... |
0074a4431f2e63384d31196936cac62594e45f2a | 07d23cf641c9d606ae192da44672ce472f479abd | /ThreadPintar.cpp | 933f491b3352c2720aaea21ed17fced8bf75af70 | [] | no_license | Strongc/Laser2D | bd2915c080fb6ed18ef8ac0048d0d1ec83735a7d | 3effedb1da5639df45763c505e99cfa4794d5f4b | refs/heads/master | 2021-01-12T22:08:39.925817 | 2015-09-29T08:05:44 | 2015-09-29T08:05:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,742 | cpp | ThreadPintar.cpp | //---------------------------------------------------------------------------
#include <vcl.h>
#pragma hdrstop
#include "ThreadPintar.h"
#include "Windows.h"
//---------------------------------------------------------------------------
__fastcall ThreadPintar::ThreadPintar(): TThread(true)
{
Paint * pintar = new... |
06c55c5679bdf65bdc05c0370ba1f41f7c20dc63 | ff4687622747a4e904c55bb06e8a6d9353c35566 | /dilationExample/src/ofApp.cpp | 7284100fecb1241711c84a99ffcd0c265fc38189 | [] | no_license | yusun-hci/RTP_MIT_FALL19 | b69d1bfe3f982b0126e162af3adb601cbbd234f7 | 134286910c628642810fa3ad100eea6861949b29 | refs/heads/master | 2022-11-01T05:46:38.250152 | 2019-10-28T18:36:37 | 2019-10-28T18:36:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,650 | cpp | ofApp.cpp | #include "ofApp.h"
void dilate( ofImage & imgA, ofImage & imgB){
for (int i = 0; i < imgA.getWidth(); i++){
for (int j = 0; j < imgA.getHeight(); j++){
ofColor nw = imgA.getColor( ofClamp(i-1, 0, imgA.getWidth()-1),
ofClamp(j-1, 0, img... |
154a9fedfffa9f7b94bc958c308c5e2d8b3ed049 | 45295c45b050bad239793da196a46b5b67a4f7eb | /control.h | 34d19ed68d178bdde61106606210e6240b7604f4 | [] | no_license | MichaelBurge/turret-defense | edfc39d574e4e21d0add19201e917b221bdc962b | d32cd615188506a57a41c6f0d840bf79da6ac889 | refs/heads/master | 2023-03-17T08:31:24.317908 | 2021-03-11T08:27:15 | 2021-03-11T08:27:15 | 346,630,348 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,694 | h | control.h | // control.h: interface for the control class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_CONTROL_H__E6FA119D_60D0_40B1_B372_FF81B103B66B__INCLUDED_)
#define AFX_CONTROL_H__E6FA119D_60D0_40B1_B372_FF81B103B66B__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif ... |
c0b924dae6a8cf68d40ec837fa288d54b868edc5 | 3257329ee69286db567d00631469a3b9ccf44ab5 | /aspen/aspen/walkers/MultiplicityTracker.h | cf455460d6ac668f35f7026e7321b56649f8839b | [
"BSD-2-Clause"
] | permissive | ORNL/siena-mem | b9c6e2fbfa92ca177ff796ee58e73e2321744838 | 4fee8c4cf20dcbf42d5fe786ea6cc52f09b82de1 | refs/heads/master | 2020-05-16T05:15:27.569621 | 2019-04-22T15:07:45 | 2019-04-22T15:07:45 | 182,810,278 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,255 | h | MultiplicityTracker.h | #ifndef MULTIPLICITY_TRACKER_H
#define MULTIPLICITY_TRACKER_H
#include "AspenTool.h"
// multiplicity is how many times a kernel is going to be called
// note: in Explicit mode, it never moves beyond 1, because each
// iterate/map call s done explicitly.
// in Implicit mode, it gets multiplied by iterate/map counts.
... |
639aecd97a9e7a2cbc23a659a47b06943eddf004 | a0b23b2f982179723a2eee098aa88d02f300e579 | /MayLO 2/Hack WF/cDraw.h | f0f8627b35a42ad7c268b17f5c932f1426501184 | [] | no_license | WildeSE/D3D-Menu | 12f703007b4f8b7f7d27c1c8dcc66a3509b29557 | d33ab94b71a2ccebb486e52ec55b8045064b775d | refs/heads/master | 2021-01-19T13:03:27.360902 | 2015-09-21T08:27:03 | 2015-09-21T08:27:03 | 42,853,419 | 7 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,204 | h | cDraw.h | #pragma once
#include <d3d9.h>
#include <d3dx9.h>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include "cVar.h"
#define C_Text (DT_CENTER|DT_NOCLIP)
#define L_Text (DT_LEFT|DT_NOCLIP)
#define R_Text (DT_RIGHT|DT_NOCLIP)
static struct _Keys
{
bool bPressed;
DWORD dwStartTime;
}
kPressingKe... |
5fcfd9486a9cba0bc058979d9298c7187b1b4f22 | 0453ffb96e2c233fb04bb78e59ee70d1e66c22a3 | /tree/maximum-binary-tree.cpp | d0690943400d7b22dd9e3b7380ed1684b40ce333 | [] | no_license | rakshith53/LeetCode-Solution | 4f8f08283610c54bf61135d16befad1c264eb054 | bba00e9314b4ad36f1831387a9f9fab802562b8b | refs/heads/main | 2023-02-15T14:13:04.870369 | 2021-01-13T08:15:38 | 2021-01-13T08:15:38 | 325,224,507 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 652 | cpp | maximum-binary-tree.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* help(int l,int r,vector<int>& a){
if(l==r) return NULL;
int mid = m... |
0abc80ee44f923abdd30e3975ee2cc2cf0c2559e | 370fc92f69a442f3be5fd6d79d11ce65dae64b68 | /examples/MovingAverage/client/cpp/BasicStatic/MovingAverageClient.cpp | 2898bb6f8a5fa783cc511d28ec1c26c47fd574f2 | [
"BSD-2-Clause"
] | permissive | YogeshMahera-SerpentCS/maxskins | 82d35926fce4cb531d0ddb49b9eaeb06bab57903 | dc85b6c600cb29ef2d2a5d12ec4ae9c84d33d180 | refs/heads/master | 2020-03-27T12:37:53.323512 | 2016-06-02T16:48:36 | 2016-06-02T16:48:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,987 | cpp | MovingAverageClient.cpp | /* Copyright 2015 Maxeler Technologies */
#include <thrift/protocol/TBinaryProtocol.h>
#include <thrift/transport/TSocket.h>
#include <thrift/transport/TTransportUtils.h>
#include <stdlib.h>
#include <sys/time.h>
#include <vector>
#include "../gen-cpp/MovingAverageService.h"
using std::cout;
using std::endl;
using... |
4d021525021738e50fe8dcfc016f1625711599cd | bc3af944af7948c882ad1f09582ba3431700835f | /shared/CelebrationOverlay.cpp | c64c3482f0ec4f46e99ceb31a21107817a80e5a1 | [] | no_license | wearecollins/Gel2015 | 16f455c482374bf97eaad714021666f11a9ce26f | dce715ebf0b2342bb24e65ee5d66e3a1ba0d1d29 | refs/heads/master | 2020-04-10T12:23:46.092948 | 2015-04-17T15:41:34 | 2015-04-17T15:41:34 | 32,529,994 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 126 | cpp | CelebrationOverlay.cpp | //
// CelebrationOverlay.cpp
// GelOutput
//
// Created by Brett Renfer on 3/26/15.
//
//
#include "CelebrationOverlay.h"
|
93f439d63b2caf8ee7de7cda0c948dc37374fc4e | e285c54c7f334dd98ee9beef53750499683299e6 | /matrixu/matrixu_test.cpp | 00c2f5b14bf648b2cd09ba1a1b9c7b7c7335c6da | [] | no_license | ladaisakova/isakova_l_m | 1db42b11c7c110b4b158c059c1129e7b46382ac7 | 13e2832ef6b3c7e8fa9dac2f76fae56d2063554f | refs/heads/master | 2021-09-11T14:14:45.577933 | 2018-04-08T17:50:18 | 2018-04-08T17:50:18 | 104,116,600 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,169 | cpp | matrixu_test.cpp | #include "matrixu.h"
int main()
{
using namespace std;
Matrixu m(3, 2);
m.at(0, 0) = 0; m.at(0, 1) = 1;
m.at(1, 0) = 4; m.at(1, 1) = 5;
m.at(2, 0) = 8; m.at(2, 1) = 9;
cout << "m = " << "\n" << m << endl;
Matrixu k(3, 2);
k.at(0, 0) = 1; k.at(0, 1) = 3;
k.at(1, 0) = 1; k.a... |
34ca261be947aa3b14354b7999d24fbe6e31c651 | f00d7bce1ca4b7db0fe00e6d2e2256610cc4bc3f | /Quine McCluskey/parser.h | ebee62224cb5272e4bec9348a9e5edd8122842ba | [] | no_license | ChienLing/CAD | fd0e3c38b7bf6687deecca801aced42c09d483ae | 0cd1c27dfc864ce0e90c0a5b5c5a4a7111833fa1 | refs/heads/master | 2023-03-21T21:40:10.741966 | 2021-03-07T13:03:19 | 2021-03-07T13:03:19 | 344,043,175 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,984 | h | parser.h | #ifndef _PARSER_H_
#define _PARSER_H_
#include <bits/stdc++.h>
#include "TableElement.h"
#include "littleP.h"
using namespace std;
class Parser {
public:
std::vector<TableElement> onSet, dcSet;
std::string InFileName;
std::string OutFileName;
std::ifstream input;
std::ofstream output;
... |
bec3cb5207af4156b0f9335114899cf456d41701 | 9dab836feab74b135be8208e3e727c6435dd5bec | /gmsv_extra/Source SDK/server/baseentity.h | cccc60c26e10550c5648a7b315fda23d471c597b | [
"Apache-2.0"
] | permissive | 11Lee1/gmsv_extra | 56fe3db4e11f648ef640343470d0f631c90168c7 | 294dbc1e31eca6f086605767e0495cf64348bd85 | refs/heads/master | 2020-04-29T20:19:26.189875 | 2019-05-08T01:20:18 | 2019-05-08T01:20:18 | 176,380,702 | 11 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 33,341 | h | baseentity.h | #ifndef BASEENTITY_H
#define BASEENTITY_H
#ifdef _WIN32
#pragma once
#endif
#define TEAMNUM_NUM_BITS 6
#include "../string_t.h"
#include "../iserverentity.h"
#include "ServerNetworkProperty.h"
#include "../shareddefs.h"
#include "../predictableid.h"
#include "variant_t.h"
#include "../tier1/utllinkedlist.h"
#include ... |
2f09897aafc5229c1f556aed61071b6571592de4 | 913a56012739e40a17bb5309b40d5ef6971e28d5 | /Source/Runtime/Public/Containers/StrArray.h | 0a9ed26b8b816ec00358aee9758f9411e6e06783 | [
"LicenseRef-scancode-free-unknown",
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | davchezt/BlueshiftEngine | 4265b0bf4ef7a2dbd0d726977f0bae333d1025bb | fbc374cbc391e1147c744649f405a66a27c35d89 | refs/heads/master | 2020-12-05T22:42:44.353929 | 2020-11-28T22:37:08 | 2020-11-28T22:37:08 | 232,265,027 | 2 | 0 | Apache-2.0 | 2020-11-29T01:38:17 | 2020-01-07T07:10:48 | null | UTF-8 | C++ | false | false | 1,772 | h | StrArray.h | // Copyright(c) 2017 POLYGONTEK
//
// 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 i... |
9ed415cec100507fb97475efffc4dcac107f66dc | 18a3f93e4b94f4f24ff17280c2820497e019b3db | /BOSS/CalibData/Tof/TofSimData.h | 7c3a4fe039be6e3ca20157327fda5deafd710c56 | [] | no_license | jjzhang166/BOSS_ExternalLibs | 0e381d8420cea17e549d5cae5b04a216fc8a01d7 | 9b3b30f7874ed00a582aa9526c23ca89678bf796 | refs/heads/master | 2023-03-15T22:24:21.249109 | 2020-11-22T15:11:45 | 2020-11-22T15:11:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,913 | h | TofSimData.h | // $Header: /bes/bes/BossCvs/Calibration/CalibData/CalibData/Tof/TofSimData.h,v 1.10 2010/01/08
#ifndef CalibData_TofSimData_h
#define CalibData_TofSimData_h
/* @class CalibData_TofSimData_h
calibration data class
calibration infrastructure
@author sunss
*/
#include "GaudiKernel/DataObject.h"
#include "Cali... |
65204f8e820c22a2e9a9c98f82c7b543fd18fb88 | 3f6c6d8c0d75ee690a67d80d33bd71fd734e0153 | /Library/InputWrapper/DirectInputWrapper.h | e17f4f3fbeaca74d8578054af789773aeb177b41 | [] | no_license | TGAHobbyists/HobbyTurnbased | ea67014512e2f536d54d397e2ce438436df2bfb8 | 71d0f00b52cd1fd7684d595d7f645043e29a8b48 | refs/heads/master | 2016-09-11T02:56:22.346408 | 2014-08-17T20:37:01 | 2014-08-17T20:37:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,840 | h | DirectInputWrapper.h | #ifndef _INPUT_MANAGER_H
#define _INPUT_MANAGER_H
#define DIRECTINPUT_VERSION 0x0800
#include <Windows.h>
#include "dinput.h"
#include "Vector.h"
namespace Input
{
enum MouseButton
{
LeftMouseButton,
RightMouseButton,
MiddleMouseButton,
NumberOfMouseButtons
};
class DirectInputWrapper
{
public:
static... |
39b02015cef2288501a3a1806011f82a754e883d | f4473e90491e419f72f03ae55f62ad0e43b79514 | /Contests/CF015_1113/A/1113A_1.cpp | 9205658438a34d19899af5797d687e2535dd32e6 | [] | no_license | nishitkshah/My-Codeforces-Submissions | 443c2ae476c10bd14a9733cf39e5ad0da591be9a | 9671ab0ed70cece4a062ec07b58d8ded5d729c50 | refs/heads/master | 2020-06-29T14:50:57.749663 | 2019-08-05T01:55:52 | 2019-08-05T01:55:52 | 200,563,917 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 422 | cpp | 1113A_1.cpp | //22:05 16-02-2019
//22:10 16-02-2019
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<utility>
using namespace std;
#define RE(a, b, c) for(int a=(b); a<(c); a++)
int n, v;
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> v;
n--; v--;
int ans;
if(v>=n)
ans ... |
0a3adf1295884e72802cbff9832701cf18c74bed | ac6b48c86210a764305e213968f59dc5874effb6 | /vector.hpp | 42099d4e0d2e96c207a8fc9ec71787d58cc6a49b | [] | no_license | mavileo/ft_containers-42 | 553040bf9da38d524b0cbac5ca63ee501709c8a6 | 8deb86003774edb855e682569669df0990f35d9a | refs/heads/master | 2023-06-01T15:59:27.406696 | 2021-06-13T13:51:50 | 2021-06-13T13:51:50 | 319,797,449 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 18,649 | hpp | vector.hpp | #include "stack.hpp"
namespace ft {
template < class T >
class vector_iterator {
public :
typedef T value_type;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef value_type* pointer;
typedef const value_type* const_pointer;
typedef typename std::ptrdi... |
99a9d4f96f03231ddb908da1b27089d6d1bb9e92 | 5b04e8d5284c969834377c4fb4682b7b180cba6a | /loop-vectorizer-skeleton/simple-vectorizer/SimpleVectorizer.cpp | 30a586471025aba7e7433210003c38bfdcfea382 | [
"MIT"
] | permissive | pramodk/llvm-summer-school-2017 | 3c29043926e431f6c49c6ceccc718c638e6685d7 | dcd09380ee3c2b76ba913c2ccc3b986e5ba88c4f | refs/heads/master | 2021-06-20T03:34:03.413831 | 2017-06-17T15:29:07 | 2017-06-17T16:44:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,707 | cpp | SimpleVectorizer.cpp | #include "llvm/Analysis/LoopInfo.h"
#include "llvm/Analysis/ScalarEvolution.h"
#include "llvm/Analysis/ScalarEvolutionExpressions.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/IRBuilder.h"
#include "llvm/IR/LegacyPassManager.h"
#include "llvm/Pass.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Transforms/... |
188693bed79f389b428eb532862e2d760e4c60af | 8a4ad95d5a4f5aed907bcae6b99cdb6a9ed1adf1 | /phys_corr/src/absorption_mult_scatt.hpp | 53a97bebf25594426ac782df9d199dae559326d0 | [] | no_license | ornl-ndav/reduction | 7586ce882786c243d6fb1e23b321220b2c09f2f4 | 97686db6259b42d69ff1667dbd5d577737b08c7b | refs/heads/master | 2020-12-24T10:24:19.620137 | 2010-02-15T15:18:34 | 2010-02-15T15:18:34 | 73,083,062 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,785 | hpp | absorption_mult_scatt.hpp | /*
* SNS Common Libraries
* A part of the SNS Analysis Software Suite.
*
* Spallation Neutron Source
* Oak Ridge National Laboratory, Oak Ridge TN.
*
*
* NOTICE
*
* For this software and its associated documentation, permissio... |
10d0b2dac2af14fe6183e1ff2a3c124cbff52f96 | 52c0949315583ba8898694cceacfaafaeab6f902 | /test/include/test_util/tpcc/schemas.h | 484a26afc405e2ee417bd729e0b0cacd0634d25a | [
"MIT"
] | permissive | cmu-db/noisepage | 97093adcc9474419e063fdd97a5aa7a7ea6f3150 | 79276e68fe83322f1249e8a8be96bd63c583ae56 | refs/heads/master | 2023-08-29T05:51:04.628704 | 2021-11-05T14:12:08 | 2021-11-05T14:12:08 | 140,325,970 | 1,245 | 287 | MIT | 2022-11-08T02:06:48 | 2018-07-09T18:22:34 | C++ | UTF-8 | C++ | false | false | 43,371 | h | schemas.h | #pragma once
#include <utility>
#include <vector>
#include "catalog/catalog_defs.h"
#include "catalog/index_schema.h"
#include "catalog/schema.h"
#include "common/macros.h"
#include "parser/expression/column_value_expression.h"
#include "parser/expression/constant_value_expression.h"
#include "storage/index/index_def... |
8f4cf4689411d5b4b8e9d0a6042b97c6de808c86 | 9ab182e1b6c57d281a618a65f9308e9d453835ea | /CS1C-Project-2-Bulk-Club-prebillybuild/adminpage.cpp | c4137ffa6d6c113e9050cd012741887d0daba003 | [] | no_license | mattjang1101/CS1C-Project-2-Bulk-Club | 72746d51218f13df9ffd4cff1fb5668a470032c4 | 16b9fefdfade85144830ad45ee98ad5b25555b4f | refs/heads/master | 2020-09-06T21:09:14.893336 | 2020-03-21T23:42:26 | 2020-03-21T23:42:26 | 220,552,845 | 0 | 1 | null | 2019-12-09T18:00:36 | 2019-11-08T21:48:08 | C++ | UTF-8 | C++ | false | false | 16,000 | cpp | adminpage.cpp | #include "adminpage.h"
#include "yesno.h"
#include "QDebug"
#include <iostream>
#include <string>
AdminPage::AdminPage(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::AdminPage)
{
ui->setupUi(this);
// Sets default page to be the home page
ui->stackedWidget->setCurrentWidget(ui->adminH... |
7ebdd0c5f9d80137285f4bd241dfec85239e6c76 | 2480ceee9f28f5e8a69fb6f5ed42fd63c22b4205 | /src/Experimental/TexturePacker/TextureAtlasGenerator.cpp | 7f321778259f47ec10c45e89633c7a6ddf130cc8 | [
"MIT"
] | permissive | rokrepo/pomdog | 165db7884598c74bd530a4b7a1e83bc1e315c945 | b21fd4fef295aaa3e06ca15e5952109cd8e93f00 | refs/heads/master | 2022-10-25T04:09:09.721827 | 2020-06-18T05:33:25 | 2020-06-18T05:33:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,673 | cpp | TextureAtlasGenerator.cpp | // Copyright (c) 2013-2020 mogemimi. Distributed under the MIT license.
#include "Pomdog/Experimental/TexturePacker/TextureAtlasGenerator.hpp"
#include "Pomdog/Experimental/Image/Image.hpp"
#include "Pomdog/Utility/Assert.hpp"
#include <array>
#include <cstring>
#include <functional>
#include <unordered_map>
namespac... |
0538e5acee570d517223e04a8e3c5f46ff1daf2f | 49b4a2dfd6ea6c48886f2bed9386fd1dda76c128 | /notes/cpp/5 - Graph/Prim.cpp | e51a1b380898943d1d1c57a435e035963f81343f | [] | no_license | martinezdiego/competitive-programming | 8424c7ebfe4faeed3ee1254425523ce2200d05f2 | a62da584233c81dcd0f4c503646a8482c43fec53 | refs/heads/master | 2023-06-25T07:30:13.254583 | 2021-07-31T00:51:21 | 2021-07-31T00:51:21 | 236,019,355 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 928 | cpp | Prim.cpp | // Dado un grafo halla el costo total de su arbol cobertor mínimo.
#define MAX 100005
struct edge {
int v;
long long w;
bool operator < (const edge & b) const {
return w < b.w;
}
};
vector<edge> g[MAX];
bool visited[MAX];
long long ans;
int N, M;
void ... |
7b05acad2d3db3d8348089d4594eb1dbde68989d | a86fb7f5a70c6d80c1f03461fa0f0b5a09c1c5e7 | /src/geometry/cube.cpp | c7aeefc1857826151d16c56f1bc047562c00629f | [] | no_license | vn-os/Solar-System | 1da630e686bc0416c84e07316230d17ab24eaa6f | 6ee40ddb81a3fc948c717200a13198c290fe9692 | refs/heads/master | 2022-01-16T20:20:26.419481 | 2019-01-21T22:40:36 | 2019-01-21T22:40:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,052 | cpp | cube.cpp | #include "cube.hpp"
#define BUFFER_OFFSET(bytes) ((GLubyte*) NULL + (bytes))
/**
* @brief Construct a new Cube:: Cube object
*
*/
Cube::Cube() {
vertex_count = normal_count = 24;
//! Init the vertices vector
vertices = new GLfloat[vertex_count * 3] {
//! front
1, 1, 1,
1, -1, 1,
-1, -1, 1,
-1, 1, 1,
... |
160b52390358793b6e7fef30fe3b35a3da572eb7 | 90e4fe85b70221ae82f99ca6930da980ef8f674a | /Anul_1/Semestru_2/dataStructs/Red_Back/DataStructures/Stack/Stack.h | 79519524e1dc58289243b775d4237fd2865fa84a | [] | no_license | stefangeorgescu970/university-assignments | 108235e047b963efb6cd1b952f6b96849e1dc3d3 | 9253cc084b74a62035c96a4a2accfbba43812c16 | refs/heads/master | 2022-12-10T14:49:20.299356 | 2020-04-28T14:05:41 | 2020-04-28T14:05:41 | 259,648,446 | 0 | 0 | null | 2022-12-07T20:33:05 | 2020-04-28T13:43:02 | C++ | UTF-8 | C++ | false | false | 1,360 | h | Stack.h | //
// Created by Georgescu Stefan on 02/06/2017.
//
#ifndef RED_BACK_STACK_H
#define RED_BACK_STACK_H
#include <string>
typedef struct StackNode{
/*
* Structure used to keep all the info required for a node in a Singly Linked List with Dynamic Allocation.
* Colour of a cards as a string.
* The add... |
9eef71c50078f64038e0efe7ce05062956a304a7 | e43f624cdfec91dc2f7137bf9f774c82885b1d4e | /Practica9/18-Skybox/src/main.cpp | 94c1f8cd418231692d725c65f4a5c129c3f67209 | [] | no_license | felixRosas/LabCGeIHC | 982304de0836a7cd80f9a13ebba73f7cda12c960 | 74cbc8b877b27c8f852dd796ae6b6847def95021 | refs/heads/master | 2020-04-21T11:07:38.919667 | 2019-05-10T22:04:23 | 2019-05-10T22:04:23 | 169,511,378 | 1 | 0 | null | 2019-02-07T02:57:46 | 2019-02-07T02:57:46 | null | ISO-8859-1 | C++ | false | false | 40,082 | cpp | main.cpp | //glew include
#include <GL/glew.h>
//std includes
#include <string>
#include <iostream>
#define _USE_MATH_DEFINES
#include <math.h>
//glfw include
#include <GLFW/glfw3.h>
//GLM include
#define GLM_FORCE_RADIANS
#include <glm/glm.hpp>
#include <glm/gtc/matrix_transform.hpp>
#include <glm/gtc/type_ptr.hpp>
// program... |
d19b4ab736b0b3a7122dcde234a82ade9e7b527e | 71ef8e94ca186e048e900f0e0d1401b25245bbfb | /Queue (Linked)/Queue.cpp | ce947e306a18af628d4ac4564a92cb9dc05fa8a6 | [] | no_license | AmrBumadian/Data-Structures-Implementation | 7c3cbf027c637b1a2d6ec56ffae8c167d9721372 | 814ad3d37fd2840cfbca097b3687d88e56507b7d | refs/heads/master | 2023-02-11T05:01:57.388522 | 2021-01-09T05:59:41 | 2021-01-09T05:59:41 | 267,096,161 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,651 | cpp | Queue.cpp | #include "Queue.h"
#include <assert.h>
#include <iostream>
using namespace std;
template<class T>
void Queue<T>::copy(const Queue<T> &other) {
length = other.length;
head = new Node<T>(other.head->value); // deep copy for head;
tail = head;
Node<T> *current = other.head->next; // pointer to the next ... |
50349c4d4055b1fbc9a1af5b7f7c165812d91f6c | 11983471fa3c97ae4170a9e598c0d058102470b2 | /workshop1/at_home/School.cpp | 32abb7ad2f66a57a1427ac92e5a1b18d76386494 | [] | no_license | anmol-garg-001/OOP244 | 85bc7978ab461b9079bbc21c3a8e0a6aa42bef23 | 2a072e0470a9b1bd770d6f02d09f967856a73e36 | refs/heads/main | 2023-01-18T22:34:08.332691 | 2020-11-21T02:36:25 | 2020-11-21T02:36:25 | 311,226,267 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,480 | cpp | School.cpp | //I have done all the coding by myself and only copied the code that my professor provided to complete my workshops and assignments.
// Name : Anmol Garg
// Student ID: 149916199
// Student email: agarg15@myseneca.ca
// Date : 27 Sept, 2020
#include <iostream>
#include <cstring>
#include "School.h"
#include "File.h"
... |
75feaa7275a63b901595fbb1b9f89b0a0e6245b0 | 6b268094525802d5412921f037e38fc87a87b511 | /Classes/extension/advance/DiTranslation.cpp | 05cc4a9e08df24b5f9bd60e874501605c702d836 | [] | no_license | dianzihe/congship | ab2fa1815acef56d624c32a782406d37a43f72e7 | 321b7cab186d46527bddc26b3838de68ed25584c | refs/heads/master | 2021-05-02T15:53:47.122626 | 2018-12-14T13:06:24 | 2018-12-14T13:06:24 | 120,702,879 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,756 | cpp | DiTranslation.cpp | //
// DiTranslation.cpp
// SanguoHeros
//
// Created by 伟 李 on 12-11-30.
// Copyright (c) 2012年 __MyCompanyName__. All rights reserved.
//
#include <iostream>
#include "DiTranslation.h"
DiTranslation::DiTranslation():m_pDelegates(NULL),m_pBuffer(NULL),m_bEnable(true)
{
m_pDelegates = new CCArray();
m_pBuf... |
b499f1d250262e08c615efb69b4df35a05012fbe | e090a7a4de62bef5cb2a4a272ea768abeee1ba9d | /Graduation/Client/DustLayer.cpp | 98f9d43dc63cc40bf8f16714beee09173ae68e5b | [] | no_license | ParkJWoo/graduationProject | 280e0a6b75a439e926073bdf21bbf874cc91a640 | f29766b2c34622a2d73397d258306f4aa390638d | refs/heads/main | 2023-01-08T11:36:03.018859 | 2020-11-19T13:01:10 | 2020-11-19T13:01:10 | 314,222,736 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 1,573 | cpp | DustLayer.cpp | #include "stdafx.h"
#include "DustLayer.h"
CDustLayer::CDustLayer()
{
}
CDustLayer::~CDustLayer()
{
Release();
}
HRESULT CDustLayer::Initialize()
{
if (FAILED(CTextureMgr::GetInstance()->InsertTexture(L"../Texture/Dialog/Partical_Layer.png", L"Dust", TEX_SINGLE)))
{
ERR_MSG(L"Dust Layer Image Insert Failed!!!"... |
9240e090a2981256f1497d34854231c4d2b7c918 | f30aa53705fd826840bf00b119aabfb0bd2ed1fa | /ArduinoDoorSensor.ino | b81336395ae4e5f9d1643440ed8bd9ff9d497068 | [] | no_license | AlexanderLutz75/ArduinoDoorSensor | 3798191afeadb18d594c65e8b8a33a55b550aa25 | ea1a2f516dd72aea6393a877c94e9876dc875423 | refs/heads/master | 2020-04-27T19:50:43.921687 | 2019-03-09T01:57:50 | 2019-03-09T01:57:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,314 | ino | ArduinoDoorSensor.ino | #include <RCSwitch.h>
#include <EEPROM.h>
RCSwitch mySwitch = RCSwitch();
const int MAXSTORAGE = 100;
const int EEPROMLocation = 0;
unsigned long codeArray[MAXSTORAGE]; //create Array for saved codes
unsigned long timerArray[MAXSTORAGE];
int arraylength = sizeof(codeArray) / sizeof(codeArray[0]); //The actual ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.