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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
aa9bbee3cb67846ab99dafffed69ec61b3984da5 | a64522736c6b38edc39eb203a7842c109f17bfef | /CPP/CPP Primer Book/Chapter 1/Exercise_1_1/Exercise_1_1.cpp | 9b01be788cce0360fe697d55bef22e7b488df778 | [] | no_license | stuartthompson/Research | 6d56a8e34d01aeb5e23d86e03c536d0a009a2600 | aa6efafd90b0a151e613c82d7683e6568d1a2dc6 | refs/heads/master | 2021-01-01T05:40:55.744590 | 2013-01-04T22:52:13 | 2013-01-04T22:52:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 186 | cpp | Exercise_1_1.cpp | /*
* Exercise_1_1
*
* The simplest possible C++ program.
*
* Created on: May 2, 2012
* Author: Stuart Thompson
*/
/**
* Program entry point.
*/
int main() {
return 0;
}
|
8b08e0d56ff4182b5f39b2609321236beb35fcc7 | 3dcaab804d0aa5f003263100fb55d4b2dbb5423d | /09-multi-file-project/main.cpp | 8d54d503e740fa7d5efee6e0dd608dbb6c75c9fa | [] | no_license | SergeantHoma/cpp-basics | 73e2dbb93d6da170e066bda61325f613c99ff82c | 7abcd0b4c850544de060a25249c58c2f592cf3be | refs/heads/master | 2020-03-29T21:54:24.676847 | 2018-11-28T17:32:44 | 2018-11-28T17:32:44 | 150,393,537 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 829 | cpp | main.cpp | #include "functions.h"
int main() {
int const kArraySize = 10;
int array[kArraySize] = { 0, -1, -2, 1, -4, 0, -6, 1, 3, -2 };
cout << "Starting Array:" << endl;
PrintArray(array, kArraySize);
cout << endl;
cout << "\nIndex of max element in the array: ";
cout << IndexMaxElment(array, kArraySize) << endl;
co... |
a951448164c609c56e101ea260b38b0b84ff5162 | c28a949525384d6834389463ce8b1436e6f1bbca | /Code/Layer1/Source/RenderSystem_GLES3/GLES3TransformerImp.cpp | adea43a14d1a313561f06cba8fb1f81a42b8d9a0 | [] | no_license | devilwalk/DevilX | c8bb3daf2b9b1f88027230caa36b090721845923 | 854265ca2e004d9f93ec6de83c71f5eb685e4297 | refs/heads/master | 2021-01-11T20:21:38.967611 | 2020-09-30T07:53:23 | 2020-09-30T07:53:35 | 79,100,279 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,704 | cpp | GLES3TransformerImp.cpp | #include "Precompiler.h"
using namespace NSDevilX;
using namespace NSRenderSystem;
using namespace NSGLES3;
NSDevilX::NSRenderSystem::NSGLES3::CTransformerImp::CTransformerImp(ITransformerImp * interfaceImp)
:TInterfaceObject<ITransformerImp>(interfaceImp)
,CConstantBufferContainer("cbObjectTransform")
{
getInterfa... |
d8066385659ed22df2353475fd9140e25477733b | e830110df185ec2bca9be964168a5ab643fc6c17 | /PigFight/main.cpp | 998a1d0d649f289113070638944625da88ead52b | [] | no_license | BearVic/PigFight | ba24823696c64cd404091f55ebd7c7bae693e753 | a5a589ecb7db62e323b77474a647bc5b82fd3e5b | refs/heads/master | 2020-03-16T13:37:18.925259 | 2018-05-09T03:22:14 | 2018-05-09T03:22:14 | 132,695,438 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 614 | cpp | main.cpp | // Professor. Brian Malloy Student: Victor Liu Data-Driven Object oriented Game Construction
#include "engine.h"
// ImageFactory* ImageFactory::instance = NULL;
// RenderContext* RenderContext::instance = NULL;
int main(int, char*[]) {
bool restart = true;
try {
while(restart){
Engine* engine = ... |
30ebb5eff0ed9216dbe25124e0fb42eae62186b8 | bc12312cb0ca4f2905d4cdc3d1a10a72b5ed63f3 | /src/kick/math/bounds3.h | f78f217fffd7fb189c2cac5af3541093a07274bd | [] | no_license | mortennobel/kick | 45b040051b4ab0ccd8e13ca5fbd6f42cb9eb59db | d32aa66ee81131464f0c09f6badb082dbe5ef92d | refs/heads/master | 2021-01-22T18:23:59.912970 | 2018-04-04T15:23:20 | 2018-04-04T15:23:20 | 19,434,888 | 56 | 11 | null | null | null | null | UTF-8 | C++ | false | false | 1,004 | h | bounds3.h | //
// Created by Morten Nobel-Jørgensen on 08/09/14.
//
#pragma once
#include "glm/glm.hpp"
#include <iostream>
#include "glm/gtx/string_cast.hpp"
#include <limits>
#include <vector>
namespace kick {
struct Bounds3 {
public:
glm::vec3 min = glm::vec3{ std::numeric_limits<float>::max() };
glm... |
232110d8a81f192b26defa89f463606e59da70c2 | 5cdc481e6f74abc93dbfa421998779c5c3984e2a | /Codeforces/295B.cc | 3c2b1ff3caa4d582143dc5a929035cc2341e461b | [] | no_license | joaquingx/Competitive-Programming-Problems | 4f0676bc3fb43d88f6427e106c6d9c81698993ce | c6baddbb6f1bdb1719c19cf08d3594bb37ba3147 | refs/heads/master | 2021-01-15T08:36:45.392896 | 2016-11-21T17:29:15 | 2016-11-21T17:29:15 | 54,804,029 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 954 | cc | 295B.cc | #include <bits/stdc++.h>
#define MAXN 501
using namespace std;
typedef long long ll;
ll d[MAXN][MAXN],n,bucket[MAXN];
vector<ll> vec,res;
void floyd()
{
for(int l = 0 ; l < vec.size() ; ++l)
{
int k = vec[l]-1;
bucket[k] = 1;
for(int i = 0 ; i < n ; ++i)
for(int j = 0 ; j < n ; ++j)
d[i][j]... |
06745c32f472d3093cc484fc61a78d6f4c8dafa7 | 9b29f1367a4bc7003c48b39660e15f7b1e81789e | /NewtonCorrigido.cpp | 73b669a76befe60286f25c15ca55e16274f0678d | [] | no_license | luizrosalba/MetodosNumericosCpp | d638c0fbcad1f8f9f4bc0524a626087f0addef12 | 2fafe39f722e2103821a54918918f7a7e5364b4b | refs/heads/master | 2022-12-07T11:26:50.477379 | 2020-09-03T13:52:06 | 2020-09-03T13:52:06 | 279,688,981 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,044 | cpp | NewtonCorrigido.cpp |
#include "metodosnum.h"
void MetNum::Host_NewtonCorrigido (double _x0 , int _numiter, double _limiar)
{
int k=1;
double x, teste1, teste2, e=_limiar, x1, teste3,h=0.0000001;
x=_x0;
while (k<_numiter)
{
teste1 = fabs(funcao(x));
teste2 = derivadaavancada(x,h);
//teste2 = derivadana... |
1f5e0607dc8324ba9f6ffbe8175b9cc43e9f7dec | cf2756bdc6c366715f8e8bc953ba4b8e19765a4a | /cpp/oneapi/dal/algo/decision_forest/backend/cpu/infer_kernel_cls.cpp | c2dfb4edbd3f68127810e66d09e15909d6318672 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0",
"Intel",
"LicenseRef-scancode-warranty-disclaimer",
"BSD-2-Clause",
"MIT",
"Zlib"
] | permissive | oneapi-src/oneDAL | c88b1f59218aa3b3b624a7b9f457bfc5823d583b | f4abbf2a18e27fa4165eb6b91b3456b5039e03a6 | refs/heads/master | 2023-09-06T00:47:52.411627 | 2023-09-05T22:29:42 | 2023-09-05T22:29:42 | 54,928,587 | 260 | 115 | Apache-2.0 | 2023-09-14T17:51:26 | 2016-03-28T22:39:32 | C++ | UTF-8 | C++ | false | false | 5,504 | cpp | infer_kernel_cls.cpp | /*******************************************************************************
* Copyright 2020 Intel Corporation
*
* 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.o... |
8382a760d99d71c33c33eb094f9b602c34a221ea | 4ee4b2d880fbd89bdf646570b6d2b3356488f143 | /witisoPC/32cpp/贺利坚/类相关/点类与圆类.cpp | 1396dfbece03c032f39a42f9f2ac6497edab9025 | [] | no_license | wwuhn/wwuhn.github.io | 8e5b3422c91f50c4ca989ed53b0d0e27131b574f | c63929f95557398b9f58319fe51a2ab00055afa4 | refs/heads/master | 2023-06-24T16:32:47.855733 | 2023-06-11T02:32:07 | 2023-06-11T02:32:07 | 211,744,777 | 3 | 3 | null | null | null | null | GB18030 | C++ | false | false | 10,665 | cpp | 点类与圆类.cpp | #if 0
#include <iostream.h>
#include<Cmath>
class Point
{
public:
Point(double x=0,double y=0); //构造函数
double distance(const Point &p) const; //求距离
double getx() const {return x;}
double gety() const {return y;}
void setx(double x1){x=x1;}
void sety(double y1){y=y1;}
fri... |
2036bc40cb6e074eef9cc487f1634438860268d6 | 3b789d2988625767072f827a48588fc05362e291 | /svolti/esercizio8.cpp | 974817d814c76d7627750447ee7a11ee76226e4f | [] | no_license | stefano-rainieri/esercizi-sistemi-embedded | 07995f4c1cddf15608c0f6f49dbb1a27de902e0e | 46ff15d8edb4a9354917411a4bdc1341d3a999d9 | refs/heads/master | 2020-12-07T23:31:32.837231 | 2020-01-27T13:34:29 | 2020-01-27T13:34:29 | 232,826,558 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,696 | cpp | esercizio8.cpp | #include <stdio.h>
#include <semaphore.h>
#include <pthread.h>
#include <unistd.h>
#include <stdlib.h>
#define PROCNUMBER 4
#define CONDIVISENUMBER 2
#define INDEXARGS 99
#define MAXWAITINGTIME 4 // 4 means from 1 to 5 seconds before been activate by clock
#define MAXBUSYTIME 2 // 2 means from 1 to 3 second to operate... |
502cabc942c8da93354bda9ec1078669157ec6a7 | b7aadab0189c7facd973e95e8b22adb4aee9e640 | /network/Client/Client/RoomObserver.h | 1fa160b5d8519b126e5c683695f55f85209771a9 | [] | no_license | LethalSun/CppAdvChatClient | cd460ac6d9343c52d1969a6c1120ce3140e60755 | 9dc19a2b71f6aaf5faf72df2d776999885b2d7e6 | refs/heads/master | 2021-01-19T04:45:59.894092 | 2017-07-20T02:28:27 | 2017-07-20T02:28:27 | 87,392,778 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 125 | h | RoomObserver.h | #pragma once
namespace MDNetwork
{
class RoomObserver
{
public:
RoomObserver();
~RoomObserver();
private:
};
}
|
8a3e48dc0bd34b6b25602cbe11d7b46a0a3eeb7d | 74b7d2e04a23f61a68485c43acfcb0678ca0b93b | /Source/Atrc/Mgr/Common.cpp | a5b1c82993e43992fea49e8356d6441bfbd5283a | [
"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 | UTF-8 | C++ | false | false | 436 | cpp | Common.cpp | #include <filesystem>
#include <Atrc/Mgr/Common.h>
namespace Atrc::Mgr
{
std::string GetCacheFilename(std::string_view filename)
{
std::filesystem::path parent("./.agz.cache/");
for(auto &sec : relative(std::filesystem::path(filename)))
{
if(sec == "..")
parent.append("__lastlast");
... |
b40db8ada36c2ad1b05258aeb6246b016d98307e | bad2e3ac4790e190b8f51e1278866311c9117a79 | /decode_ways.cc | 6461e783e8fd9d433818a4d9ef4951e411949611 | [] | no_license | JFantasy/leetcode | c0f475770204919057b1e5724b80300b9c7b26f8 | ee083c00965fe26cf689d1c0555747868758f6a7 | refs/heads/master | 2021-11-13T15:18:57.366738 | 2015-01-14T07:51:32 | 2015-01-14T07:51:32 | 23,274,069 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 433 | cc | decode_ways.cc | class Solution {
public:
int numDecodings(string s) const {
if (s.empty()) return 0;
vector<int> f(s.length() + 1);
f[0] = 1;
f[1] = (s[0] > '0');
for (int i = 2; i < f.length(); ++ i) { // i < f.length()
int val = (s[i - 2] - '0') * 10 + (s[i - 1] - '0');
f[i] = f[i... |
a8db3397f29392075884a8b4f8b18a686e04968d | 149ac3661e61ce4b1bfb1b20f5100443ed0ea21e | /TiledLighting/source/BlendState.cpp | a137d029af13fcacbaa57824455cd4757410c098 | [] | no_license | djarksnd/MultiThreadedTiledLighting | d33626f09a0fd74212d454061f5a08b24b06f108 | 3ed51b6de14fdcdad109494c8a0b4f6371f59c5a | refs/heads/master | 2023-06-07T20:02:27.629774 | 2023-05-31T19:46:28 | 2023-05-31T19:46:28 | 228,071,881 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 401 | cpp | BlendState.cpp | #include <assert.h>
#include "BlendState.h"
bool BlendState::Create(ID3D11Device* device, const D3D11_BLEND_DESC& desc)
{
HRESULT result = device->CreateBlendState(&desc, &blendState);
if (FAILED(result))
{
assert(false && "failed to create BlendState");
return false;
}
return true;
}
void BlendState::Destr... |
224f0f1daa25e5b603f809f7e50de060ba632767 | 5a35ec21bbf3d72aae64b7594cba32c6efd094e6 | /008-string-to-integer-atoi/string-to-integer-atoi.cpp | 7643d116dc40090b04dbc45e849a484d28585790 | [] | no_license | forever-gk/leetcode | 743d490b2eff078e9b68b1f196cd0e26463e7cef | c8caa7bd12d764f73294fb8f1d1a2ce2c929ee62 | refs/heads/master | 2021-09-11T08:23:54.118857 | 2018-04-06T09:08:26 | 2018-04-06T09:08:26 | 119,938,835 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,291 | cpp | string-to-integer-atoi.cpp | // Implement atoi to convert a string to an integer.
//
// Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.
//
// Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are re... |
507a5d84c0572c7b9d7fc8c0ea78293733b4be7c | 7d9bfa418c5862f398d4c2865409fa42a924ed46 | /Pi-Duino/old/calc/src/sketch.ino | b7aceb78741bd771cf65dae87509275b77855cea | [] | no_license | Shishir-rmv/DuckieTeam1 | c3238113c39989129569b4fcf5b6c7fd8f648c83 | 5e8e4aaf3446b26f4caf8d765ec4c0ad6ae162c7 | refs/heads/master | 2020-03-31T18:56:14.721722 | 2018-12-15T01:20:00 | 2018-12-15T01:20:00 | 152,478,977 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 560 | ino | sketch.ino | int r = 1;
void setup(){
Serial.begin(9600);
}
void loop(){
if(Serial.available()){ //From RPi to Arduino
String input = Serial.readString();
String opStr = input.substring(0,3);
int op1 = input.substring(3,4).toInt();
int op2 = input.substring(4,5).toInt();
int res = 0;
if(o... |
e0652194ecb87ff13b3f6f8b61ede9aab87dc7d3 | f61b11e6850e080e12ca4cddf00f3491e296b562 | /Vector/src/tests/VectorTest.cpp | 2ca7d9653df08f1ba11c5ec049703ec5407176de | [
"Apache-2.0"
] | permissive | aidan-clyens/Arduino_Data_Structures | 7df18dd8bbc48c74d983f1c0e2ce97c710e92b42 | 5c5659c028de69c1b866c0baa9629a57f1764a34 | refs/heads/master | 2020-03-18T07:22:36.371634 | 2019-04-22T14:55:34 | 2019-04-22T14:55:34 | 134,448,407 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,114 | cpp | VectorTest.cpp | #include <gtest/gtest.h>
#include "../Vector.h"
class VectorTest : public testing::Test {
public:
VectorTest() {}
virtual ~VectorTest() {}
};
TEST(VectorTest, Initialize) {
vector<int> vec;
vector<int> vec2(32);
ASSERT_EQ(0, vec.size());
ASSERT_EQ(1, vec.empty());
ASSERT_EQ(1... |
32b18d0fc3456de5a5672cf2f03de90f6e55cfb8 | 1186e892a29f85d653379c5b87b04736dbb8b1fb | /C Programs/C Programs - 6/Cleaning Up.cpp | 9632a9dd1df94307857649b9dea1662fd779483f | [] | no_license | MathProgrammer/CodeChef | 1f4a2963cf60b3386861f1935b1642580f595c32 | b9750e56ee6e307e5f60a43d7682105fd99fcf1b | refs/heads/master | 2023-05-10T16:05:59.958225 | 2023-05-06T13:17:13 | 2023-05-06T13:17:13 | 88,233,956 | 22 | 23 | null | 2020-10-03T07:38:36 | 2017-04-14T04:50:44 | C++ | UTF-8 | C++ | false | false | 1,182 | cpp | Cleaning Up.cpp | #include <stdio.h>
#include <vector>
using namespace std;
void solve()
{
int number_of_jobs, number_of_complete_jobs, number_of_incomplete_jobs, i, job_i, remaining_job_counter = 1;
scanf("%d %d", &number_of_jobs, &number_of_complete_jobs);
number_of_incomplete_jobs = number_of_jobs - number_... |
7a8a522d528890cbe28ab41d40299bedadf13dae | 23bc77c2da5f8072e2e0cd2f49aab80ba6206598 | /Source/sprawdz_wyniki.cpp | ee2bf10637c9be482c4905ed775d2599b89f0ce9 | [] | no_license | winiarz/magisterka | 3cd11dff4c59e8b5cc50d39c4d064aa3181ca577 | ceef354b496103363f58554e68c58de9a9c706ad | refs/heads/master | 2021-01-23T08:56:32.348689 | 2015-06-06T18:05:17 | 2015-06-06T18:05:17 | 21,146,701 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,354 | cpp | sprawdz_wyniki.cpp | #include "main.hpp"
int sprawdzWyniki(float* wynikiX, float* wynikiY, float* wynikiZ, float** daneTesoweCpu)
{
int iloscBledow=0;
for (uint i=0; i<c_N; i++)
{
if ( fabs(wynikiX[i] - daneTesoweCpu[6][i]) > dopuszczalnyBlad )
{
cout << "Nieprawidlowy wynik!: X[" << i << "] = " <... |
c4c9ebccdf6899c7e220ba1d3792640d5ed74e53 | 5c3db0a68b8689420293e78216870582cf53c0e1 | /prim/prim.cpp | da7aca03d900b40443dc8b209f4b8afd08e0f032 | [] | no_license | thisloving/algorithm | c9307942f7c9ea94038e77ea65662bc8de9e4cef | 80edbdc6d9f82fc8fb5d25b8cb7a2461ed159d7c | refs/heads/master | 2023-04-12T23:08:18.760530 | 2021-04-19T03:37:01 | 2021-04-19T03:37:01 | 274,785,433 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,775 | cpp | prim.cpp | #include <iostream>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <climits>
using namespace std;
const static int kVertexNum = 7;
struct Edge {
Edge(): src(0), dst(0), weight(0)
{}
int src, dst, weight;
};
struct cmp {
bool operator() (const Edge& a, const Edge... |
9bf7fbbd8c46a3f8c231e979d4e2bb9a72fe25cc | 9b83b05ee31f55a80706730394dc6e54456d6634 | /src/plugins/clangtools/clangtoolsdiagnosticmodel.h | 695cd088e51de58d7aa7000402d2138f749bbf44 | [] | no_license | nahongyan/QtCreator | c49f6782f7407233abdb96f5cec823e855550f0a | a8a361f6057d3f79bd0ba05575e2958d498a7e14 | refs/heads/master | 2023-01-24T21:46:18.797698 | 2020-12-01T12:03:24 | 2020-12-01T12:03:24 | 317,527,105 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,361 | h | clangtoolsdiagnosticmodel.h | /****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of Qt Creator.
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance w... |
9880222017baefafb0ce747c6c659933db4adb2b | fb6251837c15a0ee0b28b15d214599165e11de83 | /URI/1113-Ascending and Descending.cpp | e8068513cb6155c58326b1a7fb581b8bd79a531f | [] | no_license | CDPS/Competitive-Programming | de72288b8dc02ca2a45ed40491ce1839e983b765 | 24c046cbde7fea04a6c0f22518a688faf7521e2e | refs/heads/master | 2023-08-09T09:57:15.368959 | 2023-08-05T00:44:41 | 2023-08-05T00:44:41 | 104,966,014 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 277 | cpp | 1113-Ascending and Descending.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
while(scanf("%d %d",&n,&m)){
if(n==m)
break;
if(n<m)
printf("Crescente\n");
else if(n>m)
printf("Decrescente\n");
}
return 0;
}
|
225153fdf3cb219b3d83656fa70a0e2577f7cd4b | ececbde36cb769a89843c8bed2a2dc549ace9337 | /new/Macros/newLogLikFitter_book2DHistograms.h | 83fdf2aa2f9ca1e1cf1b824afb43a6b087c5a040 | [] | no_license | edbird/150Nd | 0121dc45fd1ff1df79b723393b49ea85114e0684 | 4c21f5651ac5d6a41281d6a1e089a7efa2a4fda1 | refs/heads/master | 2023-01-10T14:53:42.124439 | 2020-07-17T18:38:27 | 2020-07-17T18:38:27 | 263,668,541 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,444 | h | newLogLikFitter_book2DHistograms.h | #ifndef NEWLOGLIKFITTER_BOOK2DHISTOGRAMS_H
#define NEWLOGLIKFITTER_BOOK2DHISTOGRAMS_H
///////////////////////////////////////////////////////////////////////////////
// book2DHistograms
///////////////////////////////////////////////////////////////////////////////
void book2DHistograms_helper(
TFile *myFile,
... |
795e153a66e8af045e9a10b809d4f1479588554f | 13d93c2922005af35056d015f1ae3ebebe05ee31 | /uc_projets/openchrono/qprogressbar_gradient/qprogressbar_gradient.cpp | ca99093c38425faf3b3b5b5ccd99238c3786ec98 | [] | no_license | scls19fr/openphysic | 647cc2cdadbdafd050d178e02bc3873bd2b07445 | 67bdb548574f4feecb99b60995238f12f4ef26da | refs/heads/master | 2021-04-30T23:16:26.197961 | 2020-11-16T20:21:17 | 2020-11-16T20:21:17 | 32,207,155 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,042 | cpp | qprogressbar_gradient.cpp | /*
QProgressBar with gradient
Copyright (C) 2007 Sebastien CELLES
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This prog... |
79cd22dd8f212f239525ff5abb62534fd768e5e7 | 6edb11d5782492565cd251266927859b62d1d49b | /第17章 标准库特殊设施/tuple/17.4 findBook函数.cpp | 998170a379a5943f71cd1c083c6a3b1b63e2951f | [] | no_license | a1anpro/myCpp-Primer | 9253ab86fbdd55996dc2e7709a3ac87e9f98015a | f7cef1a950b79fc01256dc4bb80a9b80573ecc95 | refs/heads/master | 2021-01-15T21:30:32.131806 | 2017-09-03T01:18:51 | 2017-09-03T01:18:51 | 99,871,225 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 242 | cpp | 17.4 findBook函数.cpp | #include <iostream>
#include <numeric>
#include <tuple>
#include <vector>
using namespace std;
//统计多个书店中，某一本书的销售情况;返回的是tuple<size_t, vector<Sales_data>::iterator,...>
int main(){
return 0;
}
|
b2c332501e9c00bf5efe8a905d46387e1d175b4b | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir7941/dir7942/dir8062/dir8063/dir8254/dir8381/file8395.cpp | 8101aacce53dbe2393ee738144816d575fcdc457 | [] | no_license | tgeng/HugeProject | 829c3bdfb7cbaf57727c41263212d4a67e3eb93d | 4488d3b765e8827636ce5e878baacdf388710ef2 | refs/heads/master | 2022-08-21T16:58:54.161627 | 2020-05-28T01:54:03 | 2020-05-28T01:54:03 | 267,468,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 111 | cpp | file8395.cpp | #ifndef file8395
#error "macro file8395 must be defined"
#endif
static const char* file8395String = "file8395"; |
81fdbc16f7db0e3d8b1cf841b29c250ad3b06505 | 1fe10ee5e34cd76067c720ef4b4a054f6107b286 | /mobile/mobile/src/chill/browser/banners/app_banner_data_fetcher.h | 58a400464d9a12b66b3597e03869731e1680ac4d | [
"BSD-3-Clause",
"BSD-2-Clause"
] | permissive | bopopescu/ofa | 9f001c4f36b07fa27347ade37337422fd6719dcc | 84e319101d4a1200657337dcdf9ed3857fc59e03 | refs/heads/master | 2021-06-14T08:53:05.865737 | 2017-04-03T12:50:44 | 2017-04-03T12:50:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,984 | h | app_banner_data_fetcher.h | // Copyright 2015 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.
//
// Modified by Opera Software ASA
// @copied-from chromium/src/chrome/browser/banners/app_baner_data_fetcher.h
// @final-synchronized
#ifndef CHILL_BRO... |
610024cfa1b6973e4ea1d2e9e56efd391b4d365c | 3e7f198802e3942a518dbb0446ae7f0519343150 | /source/common/packet_dump.h | 76ebc5927400c8d9997478756a8f68e7d7505904 | [] | no_license | stitchpvp/world | 8e10942ffce22b1d23ddafed947639985fdd03bc | 2954941579e78e0d0be9607df1d5dc2de719c938 | refs/heads/master | 2021-06-12T02:46:32.254064 | 2019-10-19T05:02:31 | 2019-10-19T05:02:31 | 66,402,568 | 3 | 6 | null | 2018-10-25T09:06:29 | 2016-08-23T20:55:11 | C++ | UTF-8 | C++ | false | false | 1,507 | h | packet_dump.h | /*
EQ2Emulator: Everquest II Server Emulator
Copyright (C) 2007 EQ2EMulator Development Team (http://www.eq2emulator.net)
This file is part of EQ2Emulator.
EQ2Emulator is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as publish... |
d6205957d82be2a0a6f501af3789e4a4e8349d23 | 742e3fd6492f52757f00602f87e3707a3f941a18 | /BuildomASCII/BuildomASCII/src/pch/pch.cpp | c5dcccd9937a2fcc0dabe834b7d2a68583084014 | [] | no_license | worldofjoni/BuildomASCII | 4e67bb6b2d538f7092601f28105ee222741ae4cd | 1dfeca0d26c9ba0d99a112cd0c9a06260e3a6e91 | refs/heads/master | 2020-05-05T10:52:05.250449 | 2019-06-05T17:13:26 | 2019-06-05T17:13:26 | 179,964,379 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 271 | cpp | pch.cpp | // ***********************************************************
// * Buildom ASCII *
// * Copyright ©2019: Samuel Pasieka & Jonatan Ziegler *
// ***********************************************************
#include "pch.h"
|
e3ba2093951c1b62079d3b3a4f94b26eb72fb39c | b7e97047616d9343be5b9bbe03fc0d79ba5a6143 | /test/core/io/PDB_IO.cxxtest.hh | 99dea3d168042d1fc19499e69d076429c584e32a | [] | no_license | achitturi/ROSETTA-main-source | 2772623a78e33e7883a453f051d53ea6cc53ffa5 | fe11c7e7cb68644f404f4c0629b64da4bb73b8f9 | refs/heads/master | 2021-05-09T15:04:34.006421 | 2018-01-26T17:10:33 | 2018-01-26T17:10:33 | 119,081,547 | 1 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 3,917 | hh | PDB_IO.cxxtest.hh | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... |
b4081ae3b0576365763d8fb08ca5619bf3698bfe | f92f7508a3314ffe4b23db5ada78c77c339b2942 | /Day04/Day01/ex05/Human.hpp | 45a19baf496b5fd4cf0638831bb14ce4a549634a | [] | no_license | ssnow95/CPP | b472f1592c2f599e8b3c51b3316c49a288494de1 | 1a7021a933544511785f31e01a0bcc1bae498c8c | refs/heads/master | 2023-03-01T21:37:59.536418 | 2021-02-09T12:32:58 | 2021-02-09T12:32:58 | 329,837,943 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,129 | hpp | Human.hpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Human.hpp :+: :+: :+: ... |
3e58776dfcc09426f2fc5503b4452cf9fa84fc7f | 0b9b89730fc38fc2b97107524bc93cea4d904695 | /drivers/archetype/Keywords.cc | 8232fb656cea7bef3b4d008356b52085a48d9117 | [
"MIT"
] | permissive | gitosaurus/archetype | 80490c4d8e429974134d985d0924a860e6530d84 | b13510db5117558ebccdcdbe1ae50e319974b5b1 | refs/heads/master | 2023-07-10T12:47:52.265236 | 2023-07-09T06:01:42 | 2023-07-09T06:01:42 | 17,214,052 | 8 | 0 | MIT | 2023-05-01T23:38:05 | 2014-02-26T14:56:17 | C++ | UTF-8 | C++ | false | false | 3,320 | cc | Keywords.cc | //
// Keywords.cpp
// archetype
//
// Created by Derek Jones on 2/18/14.
// Copyright (c) 2014 Derek Jones. All rights reserved.
//
#include <stdexcept>
#include "Keywords.hh"
using namespace std;
namespace archetype {
Keywords* Keywords::instance_ = nullptr;
Keywords& Keywords::instance() {
if... |
0dd3a6cdef50b80291979aac184defb968fa5f53 | 133a001c23426d4470352816589cd6b2450af584 | /ledTest/ledTest.ino | 81cbde72ce2013c5c32962eb626b1a68f9de9d88 | [] | no_license | jones139/arduino-projects | 494bbfd6c635cc8760035a4f7a06eef54352a438 | 8eaee8a13a64aac47a1e65f24bb7d8b859ea02c4 | refs/heads/master | 2021-01-17T09:25:59.294433 | 2017-03-24T21:29:02 | 2017-03-24T21:29:02 | 6,639,715 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 3,150 | ino | ledTest.ino | /* FTL-655S LED Display */
/*
* Defines which segments to illuminate for each number
*/
//0b0gfedcba
volatile unsigned char num2segs[]= {
0b00111111, // 0
0b00000110, // 1
0b01011011, // 2
0b01001111, // 3
0b01100110, // 4
0b01101101, // 5
0b01111101, // 6
0b00000111, // 7
0b01111111, //... |
e638ce36bdcc8cb171b391742dfccab56078386a | f1e8e085726ae6be6bcfc1faf6ad316f8726bdde | /source/controls.h | edc1757f5dfdb5f5713d18068ffeccb85ddf40d6 | [
"MIT"
] | permissive | TheGreatRambler/ballpusher-io | debf9ca7d02045059cb07e1d9ac2878cdc2282ca | 77991d7ce5e0c8cffe5ddd774f4424430a276b91 | refs/heads/master | 2022-06-16T12:39:56.672537 | 2020-05-04T18:02:37 | 2020-05-04T18:02:37 | 151,259,887 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,762 | h | controls.h | #include <Urho3D/Input/Input.h>
#include <cmath>
class inputHandler {
private:
bool jumpHeld = false;
// Not yet used
bool powerHeld = false;
bool squatHeld = false;
bool lastJumpInput = false;
bool lastPowerInput = false;
bool lastSquatInput = false;
bool jumpFirstFrame = false;
bool powerFirstFrame = fals... |
0ad3c957a81d654002b34d98dacaf322b888f727 | 7b9e626cfc3aa45ff44f79b0fb31b782a17d6c98 | /src/dynamics/advectionDiffusionForces.hh | a9adb351c0bfa4c7bffad560c58cb62a939d42e5 | [] | no_license | lex16000/LBv1.2 | e95b1b42925aaa892e6099be83496a0a56271dff | cee82cc6fe75d2f9b25a9f62ce8d50d3480c47ac | refs/heads/master | 2021-04-06T01:41:48.099885 | 2018-04-04T12:01:09 | 2018-04-04T12:01:09 | 125,254,173 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,369 | hh | advectionDiffusionForces.hh | /* This file is part of the OpenLB library
*
* Copyright (C) 2016 Robin Trunk
* E-mail contact: info@openlb.net
* The most recent release of OpenLB can be downloaded at
* <http://www.openlb.net/>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Gene... |
388041ac7a67f500307596e57855e2dd9105002d | de7afdfbf77908253ef4b497617d0a69822bbd4b | /2k17/hipercampo.cpp | c450e4f6a6a193e3cd7025d8f3389bd67570843e | [] | no_license | joaoandreotti/competitive_programming | 1ee6abdd589971a1194b059dff6b3b987dc698f3 | 75c8bce751f09ca76845033893f3a3fa0078753e | refs/heads/master | 2020-09-15T11:52:45.554130 | 2020-02-18T13:38:52 | 2020-02-18T13:38:52 | 223,436,524 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,417 | cpp | hipercampo.cpp | #include <bits/stdc++.h>
std::vector <std::pair <int, int> > points;
std::set <std::pair <int, int> > set[110];
std::set <std::pair <int, int> > s_aux;
std::map <std::pair <int, int>, int > map;
int arr[110];
std::pair <int, int> operator- (std::pair <int, int> a, std::pair <int, int> b) {
return std::make_pair ((a... |
f1249b5f5686ab4b4df88f82f9071fc02a97475e | 0b20aae68aee55adaecae04ddf2364e7cdbf04b2 | /resources/soci_static_backend_provider.cpp | d7658243f77f423b9c05a9276fe60be7c677dbc5 | [
"Apache-2.0"
] | permissive | staticlibs/external_soci | 6b98e3e3301054660991839cf590e8001765b6d0 | 27558de9be4dcacec3b34aa2500eb0ad9bfce2ec | refs/heads/master | 2021-01-15T15:43:14.273251 | 2018-09-06T12:25:45 | 2018-09-06T12:25:57 | 47,081,785 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,087 | cpp | soci_static_backend_provider.cpp | /*
* Copyright 2015, alex at staticlibs.net
*
* 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 ag... |
e76d02f14276f656d25e5cf99f4a3c3de2637138 | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/ds/adsi/nw312/cenumns.hxx | e3c4d61acf1989c29a0249661c2dd70b4f264c65 | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 782 | hxx | cenumns.hxx |
class FAR CNWCOMPATNamespaceEnum : public CNWCOMPATEnumVariant
{
public:
//
// IEnumVARIANT methods
//
STDMETHOD(Next)(
ULONG cElements,
VARIANT FAR* pvar,
ULONG FAR* pcElementFetched
);
static HRESULT Create(
CNWCOMPATNamespaceE... |
8df79aca7cb95e9495ee3d2473e5709fe61ef8d6 | 40bac5da80f610c33c038baf9e10f40495a1586b | /ZLearn_Manacher.cpp | 9f255c8efae0cfe29e3c1770a4ef587b4771699a | [] | no_license | earnestzhao/LeetCode | 209d205c178e8ac3b40c214a6f711275a545fda4 | 5cefe55d8c4a6d9fe86c5e2fc8965f71e4073a35 | refs/heads/master | 2020-04-15T14:03:35.628692 | 2019-08-24T13:10:04 | 2019-08-24T13:10:04 | 57,934,937 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,799 | cpp | ZLearn_Manacher.cpp |
const char C_UNIT_SEPARATOR = '\x1F';
int Min(int iOper1, int iOper2)
{
return iOper1 < iOper2 ? iOper1 : iOper2;
}
vector<string> Manacher(const string & strSrc)
{
string strExtend;
strExtend.push_back(C_UNIT_SEPARATOR);
for (int iIndex = 0; iIndex < strSrc.size(); iIndex ++)
{
strE... |
505ed690640591812a510c0d97d1213da80f7ae7 | 6ff6bca45b94ce23170d6d839e296f13d56deac6 | /src/moveActor.cpp | 8a5fbc9236a6e07e1fb46d31ea2c0ed59f4ef35b | [
"MIT"
] | permissive | nifx28/scrollStory | 57b76e70648e773c48ab6fc604eb448e9b1b93e7 | 8b17ee43a343ce91f389b721b08352d9acd9a5de | refs/heads/main | 2023-06-24T20:44:43.924574 | 2021-07-19T10:39:44 | 2021-07-19T10:39:44 | 387,262,820 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,337 | cpp | moveActor.cpp | #include "stdafx.h"
#include "moveActor.h"
using namespace std;
MoveActor::MoveActor(int maxFrameNum, const wchar_t* mkIMGURL[], const wchar_t* bkIMGURL[]) :
groundZero(0), jumpHeight(20),
moveDir(0), maxFrameNum(maxFrameNum),
isJumping(false), isFalling(false)
{
for (int i = 0; i < 2; i++)
{
loadimage(mkIMG ... |
61685cef197f211a447dbda054da1ae83c495a0f | 88eb039566dc02af88c7a1786331791b0bb14959 | /src/Encoder/Utility/MapNameValidator.cpp | 563f386df5e6950fb76b109f62d931831a9c0a61 | [
"MIT"
] | permissive | Wenox/platformer-2d | a72bc31d6b8dae2c9c6c38f34d960e5deead63d0 | 5109212a9109371138f9e1cd8b37f759d885a30d | refs/heads/master | 2023-01-14T13:32:22.767850 | 2020-11-15T11:43:48 | 2020-11-15T11:43:48 | 264,665,715 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 726 | cpp | MapNameValidator.cpp | #include "MapNameValidator.h"
MapNameValidator::MapNameValidator(std::string_view fileName)
: fileName{fileName}
{
try {
re.assign(mapNamePattern.data());
}
catch (const std::regex_error& e) {
std::cerr << "Bad pattern: " << mapNamePattern << std::endl;
std::cerr << e.what() <<... |
f6f22ea247821df92bdcb3e8ca0bd58cfefdd15e | f295f1e190bccd3e07a630a79890fac3019c537b | /Engine/Engine/src/graphics/Shaders/DisplacementMappingDomainShader.h | eef51b29c9fb4b725ff7fd5ae775b287bbd4bedc | [] | no_license | Kavarna/Oblivion | f3aaa2fb577548b459115420fad738e82f0337e0 | cca2986ae9e4969b027b4751619ca11b3a241974 | refs/heads/master | 2021-06-14T15:11:28.457996 | 2021-03-15T21:01:31 | 2021-03-15T21:01:31 | 154,550,644 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 935 | h | DisplacementMappingDomainShader.h | #pragma once
#include "../interfaces/Shader.h"
class DisplacementMappingDomainShader : public IDomainShader, public Singletone<DisplacementMappingDomainShader>
{
public:
struct DSCameraBuffer
{
DirectX::XMMATRIX View;
DirectX::XMMATRIX Projection;
};
public:
DisplacementMappingDomainShader() :
IDomainShade... |
61e5dbe2ad5839ab408452e6aad738a8a12e1f13 | 71250f8f39a89ba4b09a3c38e27238a395986622 | /src/requests/requestorders.cpp | e52b2e7fb9c5783f5a9aa0e2bd18b5958931f157 | [] | no_license | ABSRDML/atom-engine | 62e68181fa4bd6581edcb28588317697c7775fa0 | 43c3d3dd5ad70e42492a514d1b2a1b9d2b2903b9 | refs/heads/master | 2021-09-19T07:22:26.654854 | 2018-07-24T23:00:17 | 2018-07-24T23:00:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,801 | cpp | requestorders.cpp | #include "requestorders.h"
#include <hiredis/async.h>
CRequestOrders::CRequestOrders(redisAsyncContext* redisContext, evhttp_request* req, TDocumentUniquePtr document, OnRequestProcessingCompleteFunc onComplete) :
CRequest(redisContext, req, std::move(document), onComplete),
isFirstKey_(true)
{
}
CRequestOrders::... |
69e7f0d4fa05591a6889a7910a232ef931acf427 | 84914306c0e9b6ef22c51cce0d0d0d54d6a9b69e | /20/main.cpp | 92beeb5b3af557529bba0a5469c0b169ee9cd10b | [] | no_license | ebuchholz17/advent-of-code-2018 | e9691ee885c75a417300170fb819e7c7c010b896 | 7afdf6ee31aa47dc4d03f8783e8375165a2780c2 | refs/heads/master | 2020-04-10T14:02:40.508714 | 2018-12-24T22:21:50 | 2018-12-24T22:21:50 | 161,065,908 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,855 | cpp | main.cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define ASSERT(x) if (!(x)) { *((char *)0) = 0; }
struct room {
int id;
int northID;
int southID;
int eastID;
int westID;
};
room *rooms;
int numRooms;
int maxDepth;
int atLeast1000DoorsDeepCounter = 0;
int addRoom () {
room *newRo... |
808840668796b28b5fcd82f0d83d80b25df230e4 | 370ef24a296878aa3a84fd9c6fc6cd6a6310bdd8 | /2404a2/PurchaseArray.h | 0587152b957a607cf58c4e74a6add2ec53d92702 | [] | no_license | HaoyuanDu/4042 | dfe0ccf9dcbd7f481113b11829357385e274d415 | 510b91747f1125b94075ad56569ce207ca423032 | refs/heads/master | 2021-01-18T18:55:35.439761 | 2017-04-07T00:22:41 | 2017-04-07T00:22:41 | 86,878,347 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 349 | h | PurchaseArray.h | #ifndef PURCHASEARRAY_H
#define PURCHASEARRAY_H
#include "defs.h"
#include <string>
#include "Purchase.h"
using namespace std;
class PurchaseArray
{
public:
PurchaseArray();
~PurchaseArray();
void add(Purchase*);
Purchase* get(int);
int getSize();
protected:
Purchase* pElements[MAX_... |
2084305472d595a334d8bec8a4eb02c92dbe2835 | 04a3e8ee778b443f8983ac38f672bebb2607e3fa | /protocal/drivers/delphi_esr.pb.cc | 2870ed0382c9e6a30e503cac8368839560c68201 | [
"Apache-2.0"
] | permissive | gA4ss/g2r | 28a51aec1741a1ff00c9564b8569ce703dbb6749 | a6e2ee5758ab59fd95704e3c3090dd234fbfb2c9 | refs/heads/master | 2022-07-08T14:27:31.443671 | 2020-05-12T16:35:17 | 2020-05-12T16:35:17 | 263,392,475 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 913,122 | cc | delphi_esr.pb.cc | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: drivers/delphi_esr.proto
#define INTERNAL_SUPPRESS_PROTOBUF_FIELD_DEPRECATION
#include "drivers/delphi_esr.pb.h"
#include <algorithm>
#include <google/protobuf/stubs/common.h>
#include <google/protobuf/stubs/port.h>
#include <google/protobuf/stub... |
4baae7d9b63f2e2c5d5f6320c5e9d8e993f91a81 | ce6229f5915f9e6de1238861b4a940d61e56960b | /Sonder/Temp/il2cppOutput/il2cppOutput/mscorlib_System_Runtime_Remoting_Channels_ChannelS2007814595.h | b01164d2ace034ac4869fcdc8ffb323e4ecb78b1 | [
"Apache-2.0"
] | permissive | HackingForGood/GoogleyEyes | d9e36e3dffb4edbd0736ab49a764736a91ecebcf | a92b962ab220686794350560a47e88191e165c05 | refs/heads/master | 2021-04-15T10:03:59.093464 | 2017-06-25T17:32:52 | 2017-06-25T17:32:52 | 94,575,021 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,306 | h | mscorlib_System_Runtime_Remoting_Channels_ChannelS2007814595.h | #pragma once
#include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
#include "mscorlib_System_Object2689449295.h"
// System.Collections.ArrayList
struct ArrayList_t4252133567;
// System.Runtime.Remoting.Contexts.CrossContextChannel
struct CrossContex... |
5daa54a258a396ab7c11d28563f4605e737eac4d | 15d85f364067b7f1820bf69b3f17eaf6a3e4b1ce | /year_1/lab2/1G/code.cpp | d020e74483797d895cf8ee3e96d156da283cc673 | [] | no_license | iilnar/algo | e8d79022b1c03064c4f4a1837a6f2c9278a520eb | 6814bff22c3bb3ada1751c51f4b1a084789970f4 | refs/heads/master | 2021-01-20T21:07:00.963386 | 2016-05-28T20:56:09 | 2016-05-28T20:56:09 | 59,911,736 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 747 | cpp | code.cpp | #include <bits/stdc++.h>
using namespace std;
int a[11], n, k;
void dfs (int v, int last) {
if (v == n + 1) {
if (last != 0) {
return;
}
for (int i = 0; i < k; i++) {
for (int j = 1; j <= n; j++) {
if (a[j] == i) {
... |
37fe139aebd8904c4ae728ac02da0eb6ee078785 | 969ed26bb44f94ca4226aa66af0cd5cb0c2c3537 | /dataobjects/sections/TextureSection.h | 5b22dbb770f5e5790077dc0d12d4706c24ec867a | [
"BSD-2-Clause"
] | permissive | kidaa/SeventhUmbral | 2e87295278d8b0067d118799ac0e32bded07a476 | 5c7651ac2cd9d9f5c1f7969932c15ccdf6d8848c | refs/heads/master | 2020-04-30T11:07:27.364028 | 2015-05-16T00:56:11 | 2015-05-16T00:56:11 | 35,638,361 | 0 | 0 | null | 2015-05-14T21:38:28 | 2015-05-14T21:38:28 | null | UTF-8 | C++ | false | false | 236 | h | TextureSection.h | #pragma once
#include "BaseSection.h"
class CTextureSection : public CBaseSection
{
public:
CTextureSection();
virtual ~CTextureSection();
virtual void Read(Framework::CStream&) override;
private:
uint32 m_header[4];
};
|
70d32b1a1c404e6e00e49f5d56e647f1ebcf63f5 | 248f02c9f6eda0bfbb183c293626b8b0f6cea440 | /FirstPart/RotateVetor.cpp | 2936a8f52b537fcf97c0c3c2646d3cb7911936a7 | [] | no_license | loohcs/FirstPart | 9ed6fa940f9d2b5c8ee6257c00b2c6cff4dad650 | 15c6b9f2aa94a5e206ffc533fb0d1e6e06667345 | refs/heads/master | 2020-12-13T04:32:21.274460 | 2017-06-26T06:16:47 | 2017-06-26T06:16:47 | 95,414,725 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,013 | cpp | RotateVetor.cpp | //
// RotateVetor.cpp
// FirstPart
//
// Created by ZhangXiaoMBS on 2017/6/23.
// Copyright © 2017年 ZhangXiaoMBS. All rights reserved.
//
#include "RotateVetor.hpp"
int gcd(int a, int b);
void printA(int a[], int size);
/******************************************************************************
*函数名称：rotate... |
36b3ca82564be643329f49e2d74e9441d728ae99 | e8a3c0b3722cacdb99e15693bff0a4333b7ccf16 | /LeetCode/3. Longest Substring Without Repeating Characters.cpp | dc493ed8e911b19ce771522155a6dbd0a12132eb | [] | no_license | piyush1146115/Competitive-Programming | 690f57acd374892791b16a08e14a686a225f73fa | 66c975e0433f30539d826a4c2aa92970570b87bf | refs/heads/master | 2023-08-18T03:04:24.680817 | 2023-08-12T19:15:51 | 2023-08-12T19:15:51 | 211,923,913 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,017 | cpp | 3. Longest Substring Without Repeating Characters.cpp | class Solution {
public:
int lengthOfLongestSubstring(string s) {
if(s.size() == 0)
return 0;
map<char, int> mp;
int ans = 0, p1 = 0;
for(int i = 0; i < s.size(); i++){
if(mp.find(s[i]) != mp.end()){
p1 = max(p1, ... |
ab38707afc8b9a9b3d987dd7e26bde631f786d8c | 27119115d1d76202699784462cfcc81f697c61b9 | /unittests/NamedTest.cpp | d9f45b34478b2fc204e84c27bca6d56f06b28e81 | [
"Apache-2.0"
] | permissive | penguin-wwy/DragonLoader | 3b52b9f2fadc4b569827ebc64316804ea838d2d6 | 29cc813a3aad515996449ec742a43766e7bc3b0e | refs/heads/master | 2020-12-15T15:46:14.662278 | 2020-02-06T13:35:00 | 2020-02-06T13:35:00 | 235,162,239 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 346 | cpp | NamedTest.cpp | //
// Created by penguin on 1/27/20.
//
#include "llvm/Demangle/Demangle.h"
#include "gtest/gtest.h"
TEST(LLVM_Mangle, Test1) {
std::string name = llvm::demangle("_Z3addii");
EXPECT_TRUE(name == "add(int, int)") << "Mangle name error: " << name;
name = llvm::demangle("sub");
EXPECT_TRUE(name == "sub") << "Mangl... |
4b961e96ff1a522f3681c8d1aa607b546e948e24 | f62cc9117828ad14520d379c956c3e9d14148542 | /umihook/umihookdll/umihookdll.cpp | 2640403145bf012820464dd77efc1342ed2f6074 | [] | no_license | 07th-mod/umineko-question | 6948e30d4dd6180bb87dc1751f3e3ba37a1559c7 | 6be42f875897629813c6f4537c578f7d0c7e3256 | refs/heads/master | 2023-08-16T19:19:29.936575 | 2023-01-28T02:43:59 | 2023-01-28T02:43:59 | 62,870,075 | 117 | 24 | null | 2023-01-26T10:47:10 | 2016-07-08T07:59:32 | C# | UTF-8 | C++ | false | false | 6,136 | cpp | umihookdll.cpp | // umihookdll.cpp : Defines the exported functions for the DLL application.
/* Note on MPV
Was previously using pipes to communicate with an external MPV provcess
but now directly use libmpv as it is easier. I had a problem before where
if the pipe was not read from, MPV's side of the pipe would become full
... |
87bc16d27ca792791db9fe30268dcbe88c8ae2b2 | cedc3a9cd87c19d41bef0e07e103ee878e6c0f2d | /src/inner_product.h | b0d46ab5b0c64edc0973e4e08b1f16c3296fa5f3 | [
"MIT"
] | permissive | jewettaij/ndautocrr | 593e5c7a276e0d45b4f808a14d0d1a7aded776fc | c19f5efb3bd7d75b2d49b6d8c89924e0f670abae | refs/heads/master | 2021-06-25T02:12:22.037511 | 2021-03-28T04:13:54 | 2021-03-28T04:13:54 | 209,857,697 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 572 | h | inner_product.h | #ifndef CUSTOM_INNER_PRODUCT_H
#define CUSTOM_INNER_PRODUCT_H
#include <vector>
#include <cmath>
using namespace std;
// This function is used to multiply entries together (eg. x(i) and x(i+j))
// whcn computing the correlation function
// C(j) = ⟨(**x**(i)-⟨**x**⟩)⋅(**x**(i+j)-⟨**x**⟩)⟩
inline double
inner_product... |
f1bfe58289ed7e7af4eb950b9bbd413929b7bbab | 6b15219ec3382030f7cbc98a29eea209dd3b5957 | /uno/linear_algebra/SymmetricMatrix.hpp | 19d4912c9b649871dbf5a691140491b02f5cfae3 | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | cvanaret/Uno | 3fce70c16aa067bf66b9726e22913980d124936a | 5b1d9527dc1922c54be1d12c1729f945a0fddbca | refs/heads/main | 2023-08-31T11:26:07.717455 | 2023-08-26T21:04:36 | 2023-08-26T21:04:36 | 411,774,531 | 73 | 7 | MIT | 2023-03-07T10:45:36 | 2021-09-29T17:46:08 | C++ | UTF-8 | C++ | false | false | 2,836 | hpp | SymmetricMatrix.hpp | // Copyright (c) 2018-2023 Charlie Vanaret
// Licensed under the MIT license. See LICENSE file in the project directory for details.
#ifndef UNO_SYMMETRICMATRIX_H
#define UNO_SYMMETRICMATRIX_H
#include <vector>
#include <functional>
#include <cassert>
#include "Vector.hpp"
#include "SparseVector.hpp"
template <typen... |
f27938318ebb45f84331a7b37b77700e481eb973 | 94293b2a221e9d163e886f387a52f341ebf85a78 | /speedcc/stage/SCFSMMacros.h | aba6d3727d02527c384c802900515d5fd824b53d | [
"MIT"
] | permissive | kevinwu1024/SpeedCC | 241b149c31f7b781bebd5bf3837369029a56d3ea | 7b32e3444236d8aebf8198ebc3fede8faf201dee | refs/heads/master | 2021-02-06T10:09:51.839219 | 2020-02-29T09:38:23 | 2020-02-29T09:38:23 | 105,417,184 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,456 | h | SCFSMMacros.h | /****************************************************************************
Copyright (c) 2017-2020 Kevin Wu (Wu Feng)
github: http://github.com/kevinwu1024
Licensed under the MIT License (the "License"); you may not use this file except
in compliance with the License. You may obtain a copy of the License a... |
ed6de4ed928363aacf0301377e5ad589c6d756c0 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5686275109552128_0/C++/vishalkarve15/B.cpp | d51075077eebcf317a778008776412aad5a47427 | [] | 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 | 900 | cpp | B.cpp | #include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define ll long long
int a[1010];
int main()
{
int t;
scanf("%d",&t);
for(int tt=1;tt<=t;tt++)
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
... |
52e847e1dad1e82079449877857490c374383b0f | 58c93a9db049501b175a7aa99d37f7d6fca44c28 | /pat/pat_1116.cpp | 55a6800dcec6094313c58bde786048ca1b20a9f1 | [] | no_license | sunlggggg/patest | 1454ac4528de11a495e21b009e38cc4be2f88439 | 351d3196a91cccce75327a4561571584be56c8bc | refs/heads/master | 2020-05-25T05:22:49.278517 | 2018-03-19T16:32:48 | 2018-03-19T16:32:48 | 84,914,353 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 869 | cpp | pat_1116.cpp | #include<iostream>
#include<map>
#include<set>
#include<cmath>
using namespace std;
int n;
map<int , int> _map;
set<int> _set;
bool isPrime(int num){
if(num == 2)
return true;
for(int i = 2; i < (int)sqrt(1.0*num) +2;i++){
if(num%i == 0 ){
return false;
}
}
return true;
}
int main(){
#ifdef _DEBUG
freopen... |
72b8ffa49ab9e7be9fe56ecd0eefbe45855b201c | 1ff79195e466c8684a0a319e2c8eb37522457ad5 | /test/xml_parser_test.cpp | 07c705917265649b1fb53e4057224b16fbd34b6c | [
"Apache-2.0"
] | permissive | eric5488/cppagent | ccc6245c2dc12b5abbc1232c21d34d359c48f047 | 2aa3dc54c959aeae0bb73db3dafde251dc05e0e3 | refs/heads/master | 2023-08-24T02:05:33.677410 | 2021-10-04T05:38:25 | 2021-10-04T05:38:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,778 | cpp | xml_parser_test.cpp | //
// Copyright Copyright 2009-2021, AMT – The Association For Manufacturing Technology (“AMT”)
// 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
//
// ... |
d4034aefba9a12ad5db5ad8b4eeb5056e2503bc6 | 24d856d98c85a319d53be2768ccc176a50873fa3 | /xproxy/ServerCache.H | 6a2f808ed90d11b172542406460559e02430e8e7 | [
"BSD-2-Clause"
] | permissive | dozenow/shortcut | a4803b59c95e72a01d73bb30acaae45cf76b0367 | b140082a44c58f05af3495259c1beaaa9a63560b | refs/heads/jumpstart-php | 2020-06-29T11:41:05.842760 | 2019-03-28T17:28:56 | 2019-03-28T17:28:56 | 200,405,626 | 2 | 2 | BSD-2-Clause | 2019-08-03T19:45:44 | 2019-08-03T17:57:58 | C | UTF-8 | C++ | false | false | 4,417 | h | ServerCache.H | #ifndef ServerCache_H
# define ServerCache_H
# include "IntCache.H"
# include "CharCache.H"
# include "TextCompressor.H"
# include "BlockCache.H"
# include "BlockCacheSet.H"
static const unsigned int SERVER_TEXT_CACHE_SIZE = 9999;
class ServerCache
{
public:
ServerCache();
~ServerCache();
// General-... |
7a7c9781b26a63b89cab34314f3e66bbd35eaf1d | 986488f6b6c63988dfc0a623985d8676af743cf5 | /9.4/Time.h | db84ff21cb01100c5ca8f0eaf43e5dc7beb8cc7b | [] | no_license | QianheZhang/zhang_qianhe | 1d9fe47af0623e01de53b76beeea970ee1fc16d3 | f71baa52f2595a5277ca3938bf4e84b4addf7017 | refs/heads/master | 2020-04-27T06:44:39.537485 | 2019-06-09T03:52:15 | 2019-06-09T03:52:15 | 174,116,661 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 282 | h | Time.h | #ifndef TIME_H
#define TIME_H
class Time
{
public:
explicit Time(int=0, int=0, int=0);
void setTime(int, int, int);
void printUniversal() const;
void printStandard() const;
private:
unsigned int hour;
unsigned int minute;
unsigned int second;
};
#endif
|
7e5fdd08b1b63869497cf094e20039987c834797 | c484e4f21571166e212e9bb453f199c27e9b0b33 | /test/MatrixBufferTiming.cpp | 4917424d96c0d3bfeb01d40931a1c03839c03560 | [] | no_license | rock-data-processing/data_processing-type_to_vector | da7aa32c5c52d4af9ae65d68bea5da0b4f363ccc | 2ed131ed27ee078b7e3e0238136bbb4579e0457d | refs/heads/master | 2021-06-04T05:49:55.044542 | 2018-03-13T11:49:23 | 2018-03-13T11:49:23 | 32,155,300 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,315 | cpp | MatrixBufferTiming.cpp | // \file MatrixBufferTiming.cpp
#include <list>
#include <vector>
#include <iostream>
#include <string>
#include <Eigen/Core>
// Build: g++ MatrixBufferTiming.cpp -o matrix_buffer_timing -I/usr/include/eigen3
using namespace Eigen;
using std::list;
struct Buffer {
int vectorCount;
int vectorSize;
Buf... |
b16762ea2b5d0119d4828df03001cc075dd7cbac | 13b14c9c75143bf2eda87cb4a41006a52dd6f02b | /AOJ/convert.cpp | d33f96c063fdc76c2e5015b4a0a80517103ab197 | [] | no_license | yutaka-watanobe/problem-solving | 2c311ac856c79c20aef631938140118eb3bc3835 | f0b92125494fbd3c8d203989ec9fef53f52ad4b4 | refs/heads/master | 2021-06-03T12:58:39.881107 | 2020-12-16T14:34:16 | 2020-12-16T14:34:16 | 94,963,754 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 178 | cpp | convert.cpp | #include<iostream>
#include<string>
using namespace std;
main(){
string line;
while( getline(cin, line) ){
if ( cin.eof() ) break;
cout << " " + line << endl;
}
}
|
ddfae63d635f5127cec6f54027a5afff60b134df | 425fc049f95262e0006a2e194f85aa666aff54fc | /Kattis-Problems/C++/harshadNumbers.cpp | b96e144c76733a565fba094cf2b9ceaa6ee2dd95 | [] | no_license | eykassa/Competitive-Programming | 53fa029578c3c476327c6d2ad91312d2e24341f7 | 3bdd8030cd7d1a4a4ddf171d47bf5e99162620f3 | refs/heads/main | 2023-02-15T20:37:38.936214 | 2021-01-07T15:40:22 | 2021-01-07T15:40:22 | 324,785,519 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 347 | cpp | harshadNumbers.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n; cin >> n;
while(true){
long long next=n;
long long sum=0;
while(next>0){
sum+=next%10;
next/=10;
}
if(n%sum==0){
cout << n << endl;
return 0;
... |
b15d442844e903d83e97d0e92e66ab28e7863b68 | 05db1c5eaea391b353855db449aa6445082b9541 | /test/test_entanglement_fidelity.cxx | 831c295f752957d2e2658e51d90a1677f63baffc | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | Tomographer/QPtomographer | d2117b57778d9cdf39a5538c2bdf4ba1e4f75858 | 337f0ba1069c8cef30e80a6719e8df9ce1c68997 | refs/heads/master | 2020-03-24T21:36:02.927071 | 2018-08-04T15:22:56 | 2018-08-04T15:22:56 | 143,041,209 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,403 | cxx | test_entanglement_fidelity.cxx |
#include <cmath>
#include <string>
#include <iostream>
#include <random>
#include <algorithm>
#include <boost/math/constants/constants.hpp>
#define EIGEN_INITIALIZE_MATRICES_BY_NAN
#include <cmath>
#include <cstdlib>
#include <complex>
#include <type_traits>
#include <iostream>
#include <iomanip>
// define the e... |
8f91c0329116840e4a43e3fc20b430e209fffc5b | db3eb5e4e57bcc08406bc3dc8449b0074696542b | /HW15/webhits.cpp | 2be3700e5514273a762605cef085f9a4760847d1 | [] | no_license | brianalexander/fullerton-csci-123 | ff47bacd13fdcc241a02e68e7a571c8e9791127f | 1fe6e5c876a5f5886de40cdace90ff742d97e41e | refs/heads/master | 2020-04-09T00:43:53.295964 | 2018-12-01T01:36:34 | 2018-12-01T01:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,700 | cpp | webhits.cpp | // ============================================================================
// File: webhits.cpp (Fall 2018)
// ============================================================================
// Programmer: ???
// Date: ???
// Class: CSCI 123 ("Intro to Programming Using C++")
// Time: ???
// Instructor: Mr. Edwards
/... |
ce02a8e7a8aedcdc081cb1a911e064e977c273a1 | cbaaa3b84b6b993a25dea3f1ac4fa432a5e4ff39 | /GeneratorParam/GeneratorParamMUONlib.cxx | f78f9ea0f88ea23bfed0a53e3704cee2f7603e0c | [] | no_license | AliceO2Group/AEGIS | e441e188848165bdc1f6c9a2bc8658cb0e052e74 | 53ec5c489db7c972b874490200775547b763396c | refs/heads/master | 2023-06-08T20:38:56.813388 | 2023-06-06T12:31:21 | 2023-06-06T12:31:21 | 181,861,037 | 1 | 8 | null | 2023-03-28T14:15:31 | 2019-04-17T09:36:27 | C++ | UTF-8 | C++ | false | false | 151,797 | cxx | GeneratorParamMUONlib.cxx | // Copyright CERN and copyright holders of ALICE O2. This software is
// distributed under the terms of the GNU General Public License v3 (GPL
// Version 3), copied verbatim in the file "COPYING".
//
// See http://alice-o2.web.cern.ch/license for full licensing information.
//
// In applying this license CERN does not ... |
b7303e0fb22c4b8938dacdc1ca0584abd6720b59 | 5bccf2d2118008c0af6a51a92a042e967e4f2abe | /Support/Modules/DGLib/DG.h | 81eb394add883368a1726c404d01da20708f7e12 | [
"Apache-2.0"
] | permissive | graphisoft-python/DGLib | fa42fadebedcd8daaddde1e6173bd8c33545041d | 66d8717eb4422b968444614ff1c0c6c1bf50d080 | refs/heads/master | 2020-06-13T21:38:18.089834 | 2020-06-12T07:27:54 | 2020-06-12T07:27:54 | 194,795,808 | 3 | 0 | Apache-2.0 | 2020-06-12T07:27:55 | 2019-07-02T05:45:00 | C++ | UTF-8 | C++ | false | false | 108,327 | h | DG.h | // *********************************************************************************************************************
// File: DG.h
//
// Description: Main include file of the GRAPHISOFT Dialog Manager
//
// Project: GRAPHISOFT Dialog Manager (DGLib)
//
// Contact person: BM
// *********************************... |
e492fbf1930ab02750775d08b1b145888d0001fb | e3fb8a67821f1d14a0fa07ea427751f3ea085b7d | /segmenttree/rangetree_bit.hpp | 9ea6c81f29766f1062eb685b88537d69dfad7025 | [
"MIT"
] | permissive | ankit6776/cplib-cpp | 870e251f7d8123bfd30a01d7d455f83d10ffdbf1 | b9f8927a6c7301374c470856828aa1f5667d967b | refs/heads/master | 2023-07-19T04:27:46.502927 | 2021-09-05T05:07:20 | 2021-09-05T05:07:20 | 401,575,514 | 0 | 0 | MIT | 2021-08-31T04:47:49 | 2021-08-31T04:47:49 | null | UTF-8 | C++ | false | false | 3,222 | hpp | rangetree_bit.hpp | #pragma once
#include <algorithm>
#include <cassert>
#include <utility>
#include <vector>
// CUT begin
// 領域木
template <class S, void (*opadd)(S &, S), void (*opsub)(S &, S), S (*e)(), class Coordinate>
class rangetree_bit {
int n;
std::vector<std::pair<Coordinate, Coordinate>> _pts;
struct BIT {
s... |
7d60ec31112729de180a3ebe00644b8bc185fba3 | 907f5ddea764703eefdb66e435a3f2e4d7323c0c | /URI/1005 - Average I.cpp | e979fca911590412952450b6e451d87d0378123c | [] | no_license | adityaemaulana/cp-training | 9596cc3f87d4cf77c69d04d46cf5df49865e67e9 | 53ea13e6924ad92400cb7c7b305d4eba4345abe8 | refs/heads/master | 2020-04-13T05:06:34.638860 | 2019-07-03T14:03:01 | 2019-07-03T14:03:01 | 162,981,608 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 175 | cpp | 1005 - Average I.cpp | #include <cstdio>
using namespace std;
int main(){
double a, b;
scanf("%lf %lf", &a, &b);
printf("MEDIA = %.5f\n", ((3.5 * a) + (7.5 * b)) / 11);
return 0;
}
|
cc71c62835e258cc818670814d1dc1b42176af6b | 82c55fcfa9f3b7bd5d845cd961cbcfea8fd29bcd | /src/traced/probes/probes_producer.cc | 69072c7921dd190a715053c8c3a70864298d7070 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | LineageOS/android_external_perfetto | 18fe7db30911cd164c6a95f418d5534945f8a911 | 37e41206db9bc9c8f86b09d88436b0e9a7b3f5d3 | refs/heads/lineage-18.1 | 2022-10-24T23:28:16.450303 | 2021-06-08T13:18:57 | 2021-06-08T13:18:57 | 144,285,906 | 3 | 17 | Apache-2.0 | 2022-10-02T20:13:21 | 2018-08-10T12:54:13 | C++ | UTF-8 | C++ | false | false | 21,358 | cc | probes_producer.cc | /*
* Copyright (C) 2018 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 app... |
941a21eaa4b000c9ba6a72906aa6d85f55721549 | 08241f2be07228ca9882cb30c55f9433baadd562 | /dz2_1_OOP.cpp | 8f417ce68c77015af6d69eaba7e64fcf2ccf3d92 | [] | no_license | Rost89/MyRepo | 5d9e19f68605df374131b87061912d86d868f6ff | ebd1184609c45b1bb15f7721eab13cf49a1e199f | refs/heads/master | 2020-05-23T16:30:43.806536 | 2019-06-26T11:53:12 | 2019-06-26T11:53:12 | 184,487,597 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,313 | cpp | dz2_1_OOP.cpp | /*Карпенко Р.
Создайте класс, который будет генерировать рандомные числа. У этого класса должны быть обязательно два константных метода:
один из них (Current) должен возвращать текущее сгенерированное число, второй (Next) - следующее случайное число.
Если самым первым методом вызвать Current, то выдать предупреждение, ... |
96a1e4e225b972ac96d0edb609bf958f6bec7a18 | b899d1b221c88f6cc9c016a910e3acbfe447aa9d | /JumpUp/JumpUp1/day2/06-circle.cpp | 69682a41fc63edb90d2178ff3ad95dde29b83a3f | [] | no_license | Boribab/MD_Files | 70915a7ecbe71320795f9f37cefc6124b623e971 | 27a277195175ae6a048ff435f7fbcce680222725 | refs/heads/master | 2021-10-21T16:07:55.085257 | 2019-03-05T01:09:09 | 2019-03-05T01:09:09 | 126,447,746 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 753 | cpp | 06-circle.cpp | #include <iostream>
using namespace std;
class Circle {
int radius;
public:
void read() {
cin >> radius;
}
int check() {
if (getArea() >= 100 && getArea() <= 200) return 1;
else return 0;
}
void write() {
cout << getArea() << " ";
}
double getArea() {
return 3.14*radius*radius;
}
};
int main() {
i... |
dcc5d04048401350a60a58876893bbc8fb34acaa | cdb11734b874f0df39addd9ea74381e3f3f7ddbc | /module05/ex00/main.cpp | 837b20dfdb86bb679910f1dcf87052622865ad1b | [] | no_license | baxetle23/cpp_module | 66aba5a3c23021c854ff1a565f03ea4a8e5d676a | 300fb6bc5c1bcc304426ecefbe578aba8673d26a | refs/heads/main | 2023-08-05T13:03:10.818400 | 2021-09-18T07:49:48 | 2021-09-18T07:49:48 | 402,978,962 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 312 | cpp | main.cpp | #include <exception>
#include "Bureaucrat.hpp"
int main() {
try
{
Bureaucrat bibo("BIBO", 1);
Bureaucrat biba("BIBA", 150);
//Bureaucrat bibe("BIBE", 1000);
Bureaucrat bibu("BIBU", -1000);
}
catch (std::exception & e)
{
std::cout << "LOX" << std::endl;
std::cout << e.what() << std::endl;
}
}
|
c7cf92f4436b09d2a51ccbc2f80c9f3764664363 | d160bb839227b14bb25e6b1b70c8dffb8d270274 | /MCMS/Main/Libs/SNMPLib/SNMPTask.cpp | 134e0d8a539f2e329f67f4eb59940ca4ad28e6ae | [] | no_license | somesh-ballia/mcms | 62a58baffee123a2af427b21fa7979beb1e39dd3 | 41aaa87d5f3b38bc186749861140fef464ddadd4 | refs/heads/master | 2020-12-02T22:04:46.442309 | 2017-07-03T06:02:21 | 2017-07-03T06:02:21 | 96,075,113 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,383 | cpp | SNMPTask.cpp | // SNMPTask.cpp
#include "SNMPTask.h"
#include <net-snmp/net-snmp-config.h>
#include <net-snmp/net-snmp-includes.h>
#include <net-snmp/agent/net-snmp-agent-includes.h>
#include "MessageHeader.h"
#include "Segment.h"
#include "Trace.h"
#include "Macros.h"
#include "ProcessBase.h"
#include "ManagerApi.h"
#include "Opc... |
141d740af02a2cb89ea33896593d6a7cff7239f5 | 02a18d01a6e04ae88df1f9ab78e63ba05627e628 | /FINAL PROJECT/FINAL PROJECT/Entity.h | 73d3f96f6bd47942083539afb83780e59768e490 | [] | no_license | GJones33/CS-172-Final-Project | c2bee4039cda805483d4886806698a9c61031527 | 39588a2f4850c5be7301b581e19c107d35578fa7 | refs/heads/master | 2021-01-20T15:33:14.944714 | 2017-05-09T19:59:23 | 2017-05-09T19:59:23 | 90,786,183 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,259 | h | Entity.h | //Project: Make a working videogame
//File: Define the entity and pixel class that are used when displaying the things in the videogame to the screen
//Last Updated on: 04/16/2017
//by: Cameron Rutherford
#ifndef ENTITY_
#define ENTITY_
#include <vector>
#include <iostream>
#include <string>
#define SCREEN_WIDTH 80
... |
265caf435eb0ed6a724b4ec7c4a5e0aee06ee453 | 23ba742dbd55d9d2cef68e624f2d23e4fd76e8a3 | /src/saiga/vulkan/pipeline/PipelineInfo.cpp | 342af71e01e27927ffe4881cee3a05ede70787de | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | darglein/saiga | a4026b86e7397266e5036294a6435d85657f39ee | 7617871a8ccdde58847e4f6871bd527f32652a79 | refs/heads/master | 2023-08-17T03:33:44.387706 | 2023-08-15T14:54:47 | 2023-08-15T14:54:47 | 97,219,629 | 135 | 26 | MIT | 2023-02-13T16:24:21 | 2017-07-14T09:55:50 | C++ | UTF-8 | C++ | false | false | 1,528 | cpp | PipelineInfo.cpp | /**
* Copyright (c) 2021 Darius Rückert
* Licensed under the MIT License.
* See LICENSE file for more information.
*/
#include "PipelineInfo.h"
namespace Saiga
{
namespace Vulkan
{
void PipelineInfo::addShaders(GraphicsShaderPipeline& shaders)
{
// shaderStages.clear();
// for (auto& s : shaders.mo... |
90082ea9d54a1328bcd82843e4ab77bd7e13b81e | b460b5098115c22c16e58edc1d15f6344a2079a2 | /64k/boxes/p_horboll.cpp | ecdeba50d96fd2c0c347e0aa7d17c5953fca1ef2 | [] | no_license | possan/randomjunk | a84836ced188b5dd67ac9cdbf080d43b9bedf629 | 9e1eda672149bda7efadcc63a7233df295d63473 | refs/heads/master | 2021-01-22T04:36:34.385324 | 2011-11-02T22:16:09 | 2011-11-02T22:16:09 | 906,668 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,822 | cpp | p_horboll.cpp | //
//
//
#include "almosteverything.h"
#include <stdlib.h>
#define POINTTOMOVE 0
#define STEPS 40
#define NUMSTRINGS 40
#define STRINGLENGTH 0.1f
typedef struct {
float delta;
VECTOR p0[STEPS];
VECTOR p1[STEPS];
VECTOR p2[STEPS];
VECTOR p1m[STEPS];
} HBSTRING;
HBSTRING p_hb_string[ NUMSTRINGS ];
void p_horboll... |
24b7b3255a78c1a7f598f489c748f75418552c76 | 464f4190b7f5071527c066353b5365cf58aa42f8 | /MineSweeper/MFC_FinV2/WinMine.h | ee0957fd0760149ff57e7c4b429d32aa114dfe1f | [] | no_license | chinghsuanwei/MFC | f84b846212e508820ea07b2081ce857827021b7e | 0be54182698af44035641ce1194c2246fd7ee38c | refs/heads/master | 2020-07-30T08:37:28.924573 | 2019-09-24T02:29:42 | 2019-09-24T02:29:42 | 210,158,235 | 0 | 0 | null | null | null | null | BIG5 | C++ | false | false | 757 | h | WinMine.h | #include "Mine.h"
#pragma once
// CWinMine 對話方塊
class CWinMine : public CDialog
{
DECLARE_DYNAMIC(CWinMine)
public:
CWinMine(CWnd* pParent = NULL); // 標準建構函式
virtual ~CWinMine();
// 對話方塊資料
enum { IDD = IDD_WINMINE };
public:
int totalBomb;
int col;
int row;
int baseX;
int baseY;
int countTime;
bool... |
25d5bb10cb086200de2fc550d4cedf0f4014df3c | f73933a3d4fbc1c80784d15cdeb350bf6aa19161 | /libyuv/src/main/cpp/native_yuv.cpp | c01a5589e17bee9fb11494b8ddf0c9bd243b6070 | [] | no_license | zhooker/OpenGLDemo | 8cbab12874f641b7efff0712d6c62543c9bd2b54 | ae3fd52b0bcf10559e336c9f87411d8f26d2d129 | refs/heads/master | 2021-06-04T05:24:47.151102 | 2021-04-07T09:43:17 | 2021-04-07T09:43:17 | 118,925,446 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,422 | cpp | native_yuv.cpp |
#include <jni.h>
#include <stdio.h>
#include <time.h>
#include <android/native_window.h>
#include <android/native_window_jni.h>
#include <malloc.h>
#include <string.h>
#include "native_yuv.h"
#ifdef ANDROID
#include <android/log.h>
#include <libyuv.h>
#define LOG_TAG "NativeYUV"
#define LOGE(format, ...) __and... |
a6696bc3c74af68467099026c97c563acf29e549 | 1154b526b6ea99344b6ce196182923fd0fbb34e9 | /Lab1/Lab1/Utils.cpp | 35b1457c54d0303555b314ed8263fda7219f8079 | [] | no_license | RaulBurian/PPD | 75fb3c44a296ec6380e1794866dfa99d3fb9ed35 | d35e8a05c2ed59a5900a6dc92fd3b74b189b588c | refs/heads/master | 2021-03-17T20:29:54.856509 | 2020-03-13T07:49:57 | 2020-03-13T07:49:57 | 247,015,546 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,196 | cpp | Utils.cpp | #include "Utils.h"
#include <random>
#include <chrono>
#include <Windows.h>
#include <iostream>
#include <utility>
std::shared_mutex centralLock{};
int generateSerial()
{
static std::atomic<int> serial = 0;
return serial++;
}
int generateId() {
static std::atomic<int> id = 0;
return id++;
}
bool transfer(Acc... |
81270d8e0f2d413ca0eb86a1731c76166d3d2937 | 6c5d238e635e2a6f4e964eda6744d1277f2cbfe1 | /src/polynomial.cpp | 0f9edf7ee8ab95ce01aefa992e266eeee93f33c0 | [
"MIT"
] | permissive | 530393297/furry-octo-wookie | a4c68d7879d954f76c9ff8eb831e82b6b63260e3 | ba15a779605d5c7f5ccfb3f8ca4c02d2ab36283b | refs/heads/master | 2021-01-11T09:01:11.756578 | 2015-08-17T16:38:23 | 2015-08-17T16:38:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,758 | cpp | polynomial.cpp | #include "polynomial.h"
Polynomial::Polynomial(int _degree) : degree(_degree), coefficients(_degree + 1)
{
}
Polynomial::Polynomial(std::vector<long> _coefficients) : degree(_coefficients.size() - 1), coefficients(_coefficients)
{
}
Polynomial::Polynomial(const Polynomial &poly) : Polynomial(poly.get_coefficients())... |
81593b5f119ecd108b6fa68fc1ffea681be47a85 | 78b28019e10962bb62a09fa1305264bbc9a113e3 | /common/binary_search_tree/ext/info/helpers/insert_node_to_root.h | 8fe2ef4e5da40468adb52dfe354c83553bdfbbbe | [
"MIT"
] | permissive | Loks-/competitions | 49d253c398bc926bfecc78f7d468410702f984a0 | 26a1b15f30bb664a308edc4868dfd315eeca0e0b | refs/heads/master | 2023-06-08T06:26:36.756563 | 2023-05-31T03:16:41 | 2023-05-31T03:16:41 | 135,969,969 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 652 | h | insert_node_to_root.h | #pragma once
#include "common/template.h"
namespace bst {
namespace ext {
namespace info {
namespace hidden {
template <class TNode>
inline void InsertNodeToRootI(TNode*, TNode*, TFakeFalse) {}
template <class TNode>
inline void InsertNodeToRootI(TNode* node, TNode* ins, TFakeTrue) {
static_assert(TNode::use_paren... |
b4f054aef07b40fd073d5b1a19eba62fc7a8d18e | f5096e1689208625479807ba080382029f929d87 | /src/displaylist.hpp | 3737464846e484c08d836d66efb40c97b6c9a1a9 | [
"MIT"
] | permissive | pombredanne/libapt | ba3bbed222fe8c16d2907a62f23561d0dc2a4803 | 43b05b3de632896cb7d1351191a07c0f0cdf801a | refs/heads/master | 2021-06-12T03:26:52.657094 | 2017-01-27T20:26:53 | 2017-01-27T20:26:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 955 | hpp | displaylist.hpp | #pragma once
#include "displayobject.hpp"
#include <map>
#include <string>
#include <stdint.h>
namespace libapt
{
class DisplayList
{
public:
void Insert(uint32_t depth, std::shared_ptr<Character> ch,
const glm::vec2& translate, const glm::mat2& rotscale,
const std::string& name, std::shared_ptr<DisplayOb... |
9534f814de54af681b524466f11c31a5b7add6e4 | bed059563f3e3808307d4886e61ce6ccdabcd44d | /poc/counter3/cudabinary.hpp | d40f44f2535d9ea995a1a3b4fa874a3c3dd7a618 | [
"BSD-3-Clause"
] | permissive | Jokeren/barracuda | fc8e094ab1950009c4284fda27580c8752fb1260 | db2549b62593934d81e3e8141302dd344f85a407 | refs/heads/master | 2020-09-24T15:19:15.660628 | 2019-08-22T15:25:43 | 2019-08-22T15:25:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,568 | hpp | cudabinary.hpp | #pragma once
#include <stdint.h>
namespace Types
{
static const uint32_t CUDA_FAT_MAGIC = 0x466243b1;
static const uint32_t CUDA_FAT_VERSION = 1;
static const uint32_t CUDA_FATHDR_MAGIC = 0xba55ed50;
static const uint32_t CUDA_FATHDR_VERSION = 1;
struct CudaFatBinary
{
uint32_t magic;... |
4b3bfbb383cf6e360f96c6b2038d751cbf70c8c9 | 61d3da9188b545a221d9cb628e2250995a65ecfd | /employee.h | b781b8a8bdba7f1d7bb5d0d2a1d2f8057a3645d5 | [] | no_license | csc2431-master/saturday-inheritance | 45ae02d231415e506df82fe1ae6445f218eeca51 | 38e742ced02d7b246b8a375d3670e1c335cf7b4f | refs/heads/main | 2023-04-18T05:41:08.940369 | 2021-05-01T19:08:50 | 2021-05-01T19:08:50 | 363,468,418 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 592 | h | employee.h | //
// Created by Arias Arevalo, Carlos on 5/1/21.
//
#ifndef SATURDAY_INHERITANCE_EMPLOYEE_H
#define SATURDAY_INHERITANCE_EMPLOYEE_H
#include "person.h"
#include <string>
using std::string;
class Employee: public Person {
private:
int _id;
float _baseSalary;
public:
Employee(const string& name, int ssn, int id, ... |
248a2a4cd6ae5d0ac6c21a76b839289f50462ced | 28e50dae006f5d7faf1718c6bcd00827491f8999 | /src/simulation_context.cpp | 5d95a120331476d5bc4d3a570b07948e432bf4c8 | [
"BSD-2-Clause"
] | permissive | cocteautwins/SIRIUS-develop | f30cdc46e27a92bc81aef23e21c4f4e469aee010 | de31b5b4bb2a517004b648c8b83d8686c2f4f97b | refs/heads/master | 2021-01-17T08:28:05.205821 | 2016-05-19T13:50:50 | 2016-05-19T13:50:50 | 59,735,058 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,579 | cpp | simulation_context.cpp | #include "simulation_context.h"
namespace sirius {
void Simulation_context::init_fft()
{
auto rlv = unit_cell_.reciprocal_lattice_vectors();
auto& comm = mpi_grid_->communicator(1 << _mpi_dim_k_row_ | 1 << _mpi_dim_k_col_);
if (!(fft_mode_ == "serial" || fft_mode_ == "parallel")) TERMINATE("wrong FFT mo... |
5a98ddb2a0eaddb482fe89c05b3b149f70c00786 | de65222548d7aeb632ffe27deed58efcfe4a45bb | /Controller.cpp | 312c08379ebec536d4887a8b91341afcad4e5ca4 | [] | no_license | rodinhatokay/Cpp-simMedieval | af117c7fde01df6d54659ab05be8c589759ac379 | 4fa023340d55f37818146d5fd6cabe54594af75c | refs/heads/main | 2023-06-04T13:21:15.420708 | 2021-06-29T01:40:08 | 2021-06-29T01:40:08 | 381,148,780 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,149 | cpp | Controller.cpp | #include "Controller.h"
Controller* Controller::ptr2 = 0;
Controller& Controller::get_Instance() {
if (!ptr2)
ptr2 = new Controller();
return *ptr2;
}
void Controller::run()
{
string str;
vector<string> tokens;
int i = 0;
while (true)
{
std::getline(std::cin, str);
cout << "TIME " << to_string(Mod... |
0f26c10df15d5f9cf66172b262eacd71b3945145 | 6463c91f8c692465d23b2dfe2120097e3d1cf27f | /Main.cpp | e33450721d19ca6276182d83f8f70236c05197ba | [] | no_license | JagjotJhajj/BattleGame | cc2c564bf047ddcbbb19fc0b4a99e240bf4b9229 | c98d88e8c8cbe32647ae66b3918d058bb51d55e5 | refs/heads/master | 2016-08-12T20:39:18.109288 | 2016-02-20T02:22:16 | 2016-02-20T02:22:16 | 51,728,533 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,095 | cpp | Main.cpp | /**
* This is a text-only battle game loosely based off the battle system in Pokemon
* (one of my favorite games). It is a project I am using to help learn OOP in C++
* and have fun doing so! I have now STOPPED DEVELOPMENT since reading break is almost
* over and I need to spend the weekend doing schoolwork and Sno... |
c8799e9d22085158b47e11d1c648c7c701408d8b | 9bd9ef038a28486a1ef26b6cd3b60b02b39edb41 | /unit_test/xor_test.cpp | b9c334f79a61e23816a72824fa27376ad9156717 | [] | no_license | zakheav/automatic-differentiation-framework | 73fea0e1689366e848061f709203edfb89ea322e | 28141556ee9e9bfa503bc04cf2709d1bc64705ff | refs/heads/master | 2022-04-10T23:35:36.090455 | 2020-03-01T12:05:59 | 2020-03-01T12:05:59 | 114,228,859 | 105 | 14 | null | null | null | null | UTF-8 | C++ | false | false | 4,738 | cpp | xor_test.cpp | #include "../include/op_node/Input.h"
#include "../include/op_node/SquareSum.h"
#include "../include/op_node/Minus.h"
#include "../include/op_node/Mult.h"
#include "../include/op_node/Bias.h"
#include "../include/op_node/Parameter.h"
#include "../include/VirtualGraph.h"
#include "../include/ComputeGraph.h"
#include "..... |
82f8fe301d004818849d946599d735d8cf2aae14 | 750771126eec224e5455c34d1c9858695cba4bc3 | /src/forcefeedback/forcefeedback.cpp | 7d08d39d34256b233272891b6121def5a0f6fe9b | [] | no_license | Intpict/ForceFeedback | 26a1b5a4d45f3624019f4c566c57fddd6caa7c79 | 42c3cfa4d89715cf8bcf523d165d7de51083060d | refs/heads/master | 2021-01-19T08:25:30.169291 | 2015-12-24T07:55:13 | 2015-12-24T07:55:13 | 48,526,839 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 12,827 | cpp | forcefeedback.cpp | /************************************************
编译前：右击"属性" -> 更改"字符集"为"使用多字节字符集"
************************************************/
#define __FORCEFEEDBACK
#ifndef __FORCEFEEDBACK_H
#include "forcefeedback.h"
#endif
#include <string.h>
#include <math.h>
//APIENTRY声明DLL函数入口点
BOOL APIENTRY DllMain(HANDLE hModule, DW... |
dd64ff7d8a589c4b106e490e28ce2404a3b4735a | 2107fe6b0016a014cdc173f26ee2209f549707f4 | /RLGM_test/ColorCorrection8bit.h | c90c7a44e08be512fe1021378f9a4459c3c14f35 | [] | no_license | alexeyaseev/RLGM | b9e422562ce65fa765224c971e363430d6fae2a8 | 7e7063c62144a6243478bac9c9adecd44d90c585 | refs/heads/master | 2021-01-16T17:55:55.648072 | 2017-08-25T12:17:47 | 2017-08-25T12:17:47 | 100,025,966 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,158 | h | ColorCorrection8bit.h | #pragma once
#include <cmath>
#include <cstdint>
class ColorCorrection8bit
{
private:
static const int MAX_VALUE = 255;
double m_lowThr = 0.0;
double m_highThr = 1.0;
double m_gamma = 0.5;
double m_hue = 0.0;
double m_saturation = 0.0;
double m_minLuma = 0;
double m_maxGamma = 1;
double m_minGamma = 1;
dou... |
62f8a9fb02d2648abd9fb37ef3c5fc6b2f906f6f | b6d381f96b3f352da426fb37d7c820d9cb752794 | /Vector4.cpp | 6ac6b2057af575eeef03e964082e0e6472ed7d4e | [] | no_license | CS3258-S2021/josephsgraphiccode | a21854e1c7a2ee90d961625cb4d9a16e868c1808 | a15e65f6db5cb3fe27b103802c9dc8ec773cae52 | refs/heads/main | 2023-07-09T20:36:33.270626 | 2021-08-06T16:18:25 | 2021-08-06T16:18:25 | 338,215,272 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,026 | cpp | Vector4.cpp | #include "Vector4.h"
#include <algorithm>
Vector4::Vector4(): vec{0, 0, 0, 0} {}
Vector4::Vector4(double a, double b, double c, double d): vec{a, b, c, d} {}
Vector4::Vector4(const Vector4& other): vec{other[0], other[1], other[2], other[3]} {}
Vector4& Vector4::operator=(const Vector4& other) {
if (this != &ot... |
cd6232f4757849c09f9412805037a17968a93944 | aad087dee8a647eaf88bb821eaca3c03ad7a36a2 | /cryptimage.cpp | 989db9f2a0d7a959404493a4e9b8c173bf4a8dfc | [] | no_license | istahir/PRG_Praktikum_milestone1 | 4ef7b43d6f7dee825fb1dcf076c99bdce8a373d8 | 4924252af3da80101b500f3c4670db3d8d9e0f9a | refs/heads/master | 2020-04-04T19:44:58.010713 | 2018-11-05T10:14:00 | 2018-11-05T10:14:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 215 | cpp | cryptimage.cpp | #include "cryptimage.h"
#include "ui_cryptimage.h"
CryptImage::CryptImage(QWidget *parent) :
QWidget(parent),
ui(new Ui::CryptImage)
{
ui->setupUi(this);
}
CryptImage::~CryptImage()
{
delete ui;
}
|
c402d5c3c1594e2de49fb165dbbbe9d9972abf80 | 4cf7062529292ff0e06d67fd1a2b45c6b82573fb | /main.cpp | df1b39c3c8909e71dbc15068396965533db668b6 | [
"MIT"
] | permissive | hstefan/htlib | a4354b701d0d8e32a48b29df2cbf7b428130e3a8 | a62783cf344f8c81158e7463696c4a9a8d914c5f | refs/heads/master | 2020-04-05T19:32:29.071147 | 2010-10-19T00:39:05 | 2010-10-19T00:39:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 220 | cpp | main.cpp | #include "hlist.h"
#include <iostream>
int main()
{
htl::list<int> b;
for(int i = 0; i < 20; i++) b.push_back(i);
for(htl::list<int>::iterator it = b.begin(); it != b.end(); it++)
{
std::cout << *it << ",";
}
}
|
5c89ca10433631b65663e2f63724fdffe3a28ecf | 0e9db639ca3b8987d2c065bfe08a04ece3d19a00 | /projeto2/nodo_operacaoBinaria.cpp | 45f1e46b296058c602147771d9f3fee598e1ce9f | [] | no_license | nathanfpp/INE5426 | 7a9149079abfc310f83c952261eb442b33918767 | 860a62818524ef404c3d80f168dbf530f1aad484 | refs/heads/master | 2020-05-21T10:09:03.684946 | 2016-12-04T23:22:14 | 2016-12-04T23:22:14 | 65,047,346 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,204 | cpp | nodo_operacaoBinaria.cpp | #include "arvoreSintatica.h"
using namespace AST;
Tipo OperacaoBinaria::analisar(AST::TabelaDeSimbolos *tabelaDeSimbolos, int linha, bool analisador) {
// Os tipos dos filhos à esquerda e à direita da OperacaoBinaria
Tipo e, d;
e = esquerda->analisar(tabelaDeSimbolos, linha, analisador);
// Armazena-se ... |
122d79dae5d6c1da316278273c3175a46bbd9041 | 465fe842cea448e45e2c1c2a526a6cca888c8181 | /4.cpp | e52c36e992f6e5595f7647afcb8cf55c3ee4d99a | [] | no_license | PigTS/Coding-Interviews | fdcbe9cf24a9185e173740fa5a129ef41090fd95 | ca034424ae33709e48bf1a37547b79463fe23575 | refs/heads/master | 2020-03-25T07:46:52.949357 | 2018-09-08T08:08:44 | 2018-09-08T08:08:44 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,079 | cpp | 4.cpp | #include <iostream>
#include <vector>
using namespace std;
//输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
//例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
//递归版本一
class ... |
1cab980a118c4d5cf992a2ade6e027625c859fae | 20ce7099910290e00691b8022a216c4e10efd855 | /MeshLib/Mesh.h | 618c7e5209ce9ee9269793be99be1690944a11c9 | [] | no_license | eseon1006/ogs | d113c270e3b6c3d28d2cbd014ef35d8b2a575bef | e7ea5b3c8470e17bb9ca691295c3a5967894cc26 | refs/heads/master | 2021-01-15T15:16:30.977622 | 2012-01-23T07:49:49 | 2012-01-23T07:49:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,869 | h | Mesh.h |
#pragma once
#include <cmath>
#include <vector>
#include "MemoryTools.h"
#include "Node.h"
#include "Element.h"
#include "ElementFactory.h"
//------------------------------------------------------------------------
namespace MeshLib
{
//-----------------------------------------------------------------------------
//... |
20d48796074e2336148b954ae9c450a3e57610b0 | 2e041fb3a61cf15e4a2fa4ca4501df57698c0670 | /src/VersionNum.h | 78354bb444ab33a0bcbbdbec632345a21b3b56a5 | [
"MIT"
] | permissive | xf97/SolidityCheck | f84066023b416c08115aabd5454a6860facabf1e | a859f4b65c7eea945ef7b9702c85cf3ff42f50f7 | refs/heads/master | 2021-08-06T20:32:55.974761 | 2021-06-28T08:38:17 | 2021-06-28T08:38:17 | 185,910,649 | 21 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 2,309 | h | VersionNum.h | //
// Created by xiaofeng on 2019/11/29.
//
//This part of the program is used to detect version number problems.
//Using operators or unspecified security specifications can lead to
//unexpected consequences.
//head file
/*
author=__xiaofeng__
*/
#ifndef _VERSIONNUM_H_
#define _VERSIONNUM_H_
//us... |
50c65c332e063e62df725401af0fb6d928e6256c | b05f1cbd207e22f12e7f3076bf56181787b68085 | /ACM solved the question with Corresponding number/No.8B改.cpp | 607e69ce182fb3b5cb6043336b3f5f62d5b93787 | [] | no_license | NikoSoftware/Algorithm | e76db0556acdcfedd06d027a5642c6472254c50e | ceff66d6d6839ae8deb802e5e2e7e31c02025115 | refs/heads/master | 2020-12-30T14:45:13.903814 | 2017-05-12T11:54:42 | 2017-05-12T11:54:42 | 91,084,931 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 862 | cpp | No.8B改.cpp | #include<stdio.h>
#include<string.h>
int cur=0;
struct Node
{
int next[26];
char data[100];
void init()
{
memset(next,-1,sizeof(next));
}
}t[10000];
void insert(char* s1,char *s2)
{
int p=0;
for(int i=0;i<strlen(s2);i++)
{
int x=s2[i]-'a';
if(t[p].next[x]==-1)
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.