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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
377b2ca55e64c5691e3d6a0cad5c25f079d37a00 | 0ef2acead56a452d88f89910e91fdf064516942b | /CG_Demo/CG_Demo/source/Cube.cpp | d8b0ee48cab759095ee9085614ebc8a2d54e4ac0 | [
"MIT"
] | permissive | LDanielMedinaC/CG-at-sr | 062b06e76004aa91e7a861605702ade82e9fd59e | 095c95071131b356cec6ebe44124f97715df5186 | refs/heads/master | 2020-04-23T13:45:32.615801 | 2019-02-18T03:28:32 | 2019-02-18T03:28:32 | 171,208,125 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 798 | cpp | Cube.cpp | #include "..\header\Cube.h"
Cube::Cube()
{
glLineWidth(3.0f);
glBegin(GL_LINES); {
glVertex3f(-0.5,0,0.5);
glVertex3f(0.5, 0, 0.5);
glVertex3f(0.5,0,0.5);
glVertex3f(0.5,0,-0.5);
glVertex3f(0.5,0,-0.5);
glVertex3f(-0.5,0,-0.5);
glVertex3f(-0.5,0,-0.5);
glVertex3f(-0.5,0,0.5);
glVertex3f(-0.... |
6867512525d78d6c82608f5a7b72ce2013d939b3 | 9986a901b57342f40b6e8b0196058cf5055417ec | /0/p_rgh | c4fe42c61a4cccd33a779267ad69182775645ac4 | [] | no_license | OFWaterResources/Spillway | e0cefbe38eee34519f8c0e35d27e09bf20a4c894 | 3cdc6b23f8566644cddf8f2ecd4b77a1bf59dd11 | refs/heads/master | 2021-01-20T04:36:07.433095 | 2017-04-28T12:15:59 | 2017-04-28T12:15:59 | 89,702,985 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,179 | p_rgh | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: plus |
... | |
26e453cfa3547d7ac9631fe284656ec6e0ca070d | e000dfb2e1ddfe62598da937d2e0d40d6efff61b | /venusmmi/app/Cosmos/SNS/vapp_sns_imgviewer.h | 62d989cea2cd22d7ebd7229cf3f4657b4086e912 | [] | no_license | npnet/KJX_K7 | 9bc11e6cd1d0fa5996bb20cc6f669aa087bbf592 | 35dcd3de982792ae4d021e0e94ca6502d1ff876e | refs/heads/master | 2023-02-06T09:17:46.582670 | 2020-12-24T02:55:29 | 2020-12-24T02:55:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,483 | h | vapp_sns_imgviewer.h | /* Copyright Statement:
* --------------------
* This software is protected by Copyright and the information contained
* herein is confidential. The software may not be copied and the information
* contained herein may not be used or disclosed except with the written
* permission of MediaTek Inc. (C) 2005
*
* BY... |
ef96adbf97efe4f3a2bb06acac78e1f374c7aa3c | 4ed5d5b463602be08360d7a83b9bd2b02e30a559 | /include/example/ImageProcessor.h | c36cc52b59e29e5216c098ff547ce1f723f6ef9b | [
"MIT"
] | permissive | automyinc/vnx-examples | 1513fa06a233af8791dcbac9e76b386a0e9ab41b | 492423bb8c8447f641e5691f45575056cab396df | refs/heads/master | 2021-08-17T15:27:02.032292 | 2020-03-08T12:09:08 | 2020-03-08T12:09:08 | 143,607,708 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,849 | h | ImageProcessor.h |
#ifndef INCLUDE_EXAMPLE_IMAGEPROCESSOR_H
#define INCLUDE_EXAMPLE_IMAGEPROCESSOR_H
#include <example/ImageProcessorBase.hxx>
#include <automy/basic/ImageFrameF32.hxx>
using namespace automy;
namespace example {
/*
* The ImageProcessor example receives 8-bit image data and converts them to 32-bit float.
*/
class ... |
94019817579a1b3d7fbe42af54fded8fa066252b | 96cfaaa771c2d83fc0729d8c65c4d4707235531a | /RecoLocalMuon/CSCRecHitB/src/CSCStripData.h | 13a1adc2d374263c63bdd2caec212136bf6777ff | [] | no_license | khotilov/cmssw | a22a160023c7ce0e4d59d15ef1f1532d7227a586 | 7636f72278ee0796d0203ac113b492b39da33528 | refs/heads/master | 2021-01-15T18:51:30.061124 | 2013-04-20T17:18:07 | 2013-04-20T17:18:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,480 | h | CSCStripData.h | #ifndef CSCRecHitB_CSCStripData_h
#define CSCRecHitB_CSCStripData_h
/** \class CSCStripData
*
* Hold strip data while building strip hits.
*
* \author Dominique Fortin
*/
class CSCStripData
{
public:
/* The default ctor initializes all elements of thePulseHeightMap for
* which explicit digis do not exis... |
8d473b91344e369f7e8622b7f648c359cc5aed94 | 3e0f0fffee8097c150a8ba303ef4b23ceec860c5 | /HybridAStar/include/Reeds-Shepp/CCC.h | 5db941386042dfca9c9d817f1d9870ba9da9ef42 | [] | no_license | mapbufo/mapBuildingWithFocusPoint | 5f01b911abff283fbf79e335300475588346d591 | 9a9053b85cd9df5e716f8a7caf0108aa272cc0cb | refs/heads/master | 2023-01-04T02:49:14.498345 | 2020-10-13T17:52:49 | 2020-10-13T17:52:49 | 277,078,636 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,599 | h | CCC.h | #pragma once
#include "RSPath.h"
#include "FormularList.h"
#include <iostream>
#include <limits>
#include <string>
#include "RSPathElem.h"
bool CCC(float x, float y, float phi, RSPath &path)
{
float Lmin = std::numeric_limits<float>::max();
std::vector<int> type = {RS_NOP, RS_NOP, RS_NOP, RS_NOP, RS_NOP};
... |
a30cf3af617bec58b77efba6cea35db7b42a44f8 | 7901e09d4f0827e0590fa6a7f038e7d9363e903b | /cpp_stl/cont/newkey.cpp | bb9019b3604bdbfaf162f76dd6ada15184646bb1 | [] | no_license | jiesoul/c_cpp_learn | 32298fa21d159d3fc9a6c0c2711700548db9e4a2 | cd4e411f73222dd26d22c1110ce0af4ecc60f051 | refs/heads/main | 2023-03-16T15:54:54.553175 | 2022-06-14T05:30:51 | 2022-06-14T05:30:51 | 204,853,153 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 444 | cpp | newkey.cpp | //
// Created by jiesoul on 2019/10/15.
//
namespace MyLib {
template <typename Cont>
inline
bool replace_key(Cont& c, const typename Cont::key_type& old_key, const typename Cont::key_type& new_key)
{
typename Cont::iterator pos;
pos = c.find(old_key);
if (pos != c.end()) {
c.insert(typename C... |
ebb08f62dd6bfc52a30a61f3956017963aa4cc0f | 514fd4f09243055e4769efb426710338048454b1 | /tensorflow/core/grappler/mutable_graph_view.cc | 224b720328a36e37079244acf952873ec8fc47c8 | [
"Apache-2.0"
] | permissive | nnsuite/ubuntuport-tensorflow | 7fa1d26f3cc282cd725bd87f2864c8ac2e76bf99 | 01ea2d56d3f87063f86076e45673fa49794eebb0 | refs/heads/debian/c_api/1.13.1 | 2022-12-14T03:14:59.691723 | 2022-12-06T07:29:53 | 2022-12-07T00:46:40 | 202,048,406 | 2 | 8 | Apache-2.0 | 2022-12-07T00:46:41 | 2019-08-13T02:36:22 | C++ | UTF-8 | C++ | false | false | 13,596 | cc | mutable_graph_view.cc | /* Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
9c55022cd1cccc69b167a56119be8a223487ff22 | bd836081502105e472df1d0a99881deed61ce048 | /pagebuilder/PageConverter.cpp | db78dfd94ea1a4112dda1175dd1a6a4adc31c196 | [] | no_license | mitkatch/BPE | 9f34064778c25cc8dcb8225ed9f2252a3d431fb3 | 27985cb5da5045b797e67ec8c2a93e0f50ee6c09 | refs/heads/master | 2020-03-30T22:18:51.194908 | 2018-10-05T02:48:32 | 2018-10-05T02:48:32 | 151,662,346 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,554 | cpp | PageConverter.cpp | /************************************************************************
||
|| DATE: $Date: 2006/05/02 15:12:09 $
|| SOURCE: $Source: /repository/projects/Canpx/pagebuilder/PageConverter.cpp,v $
|| STATE: $State: Exp $
|| ID: $Id: PageConverter.cpp,v 1.7 2006/... |
b53ab8749da7929f8687c2f3f0dd6a47fffe7af2 | d053e0e8687f122d120bcd0fa1f9076deb35afa5 | /Olymp/Povolzhiya/D.cpp | dd5096c6aef87df0733c702771a0ee6711fa8dab | [] | no_license | shaihitdin/CP | e8911bc543932866d6fc83eb1d48d9cf79918c61 | dc90082f3ebedaccbfb0818cc68539c887f86553 | refs/heads/master | 2021-01-11T17:10:20.356635 | 2017-10-05T08:53:56 | 2017-10-05T08:53:56 | 79,729,913 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 755 | cpp | D.cpp | #include <bits/stdc++.h>
using namespace std;
#define forn(i, x, n) for (int i = int(x); i <= int(n); ++i)
#define for1(i, n, x) for (int i = int(n); i >= int(x); --i)
typedef long long ll;
typedef pair <int, int> PII;
const int N = 3e5 + 100;
int d, n, len;
ll a[N], res[N];
int main () {
freopen ("input.txt", ... |
fa34262fe2e70652bf511b4199035bb5f8113f98 | 220846e017a9992e596bd1ea806d527e3aeea243 | /103_Binary_Tree_Zigzag_Level_Order_Traversal.cpp | 8d02d15f234eb976d0f9b4743c77f0ce406ee6f6 | [] | no_license | anzhe-yang/Leetcode | bfa443b7a74ddbd441348c364ee00004173ddd86 | fe9eb16136035f25f31bddb37c6b4884cd7f6904 | refs/heads/master | 2020-04-08T14:49:04.781848 | 2019-10-25T02:39:22 | 2019-10-25T02:39:22 | 159,453,173 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,899 | cpp | 103_Binary_Tree_Zigzag_Level_Order_Traversal.cpp | /** 问题描述：
* 给定一个二叉树，返回它的 zigzag 顺序节点值。
* 从左到右，再从右到左。
*/
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x) ,left(NULL), right(NULL) {}
};
vector<vector<int>> zigzagLevelOrder(TreeNode*... |
fd75afdb0c8b7a82c6c05aa339d47de08267ba13 | d29a3d35c2484e84743f1557c209e934880d2e74 | /src/130SurroundedRegions/130SurroundedRegions.cpp | c574d1aea4e7d8046822226ad1249cefe7d996d5 | [] | no_license | rainliu/leetcode | 2e68dd4839ac55b1f16f519c67b526c7b773874c | 5b31ebcbdbe0caffce0a9b4833170eb040396066 | refs/heads/master | 2022-07-21T05:41:23.838958 | 2022-07-15T20:39:59 | 2022-07-15T20:39:59 | 30,811,637 | 12 | 1 | null | 2022-07-15T20:40:00 | 2015-02-14T23:06:26 | C++ | UTF-8 | C++ | false | false | 4,301 | cpp | 130SurroundedRegions.cpp | class UnionFind{
vector<int> id;
vector<int> sz;
int cnt;
public:
UnionFind(int N){
cnt = N;
id.resize(N);
sz.resize(N);
for(int i=0; i<N; ++i){
id[i]=i;
sz[i]=1;
}
}
int Find(int i){
while(i!=id[i]){
i... |
5fcaef2e7881de0ee70009cc99762b58f88193fe | 7e14945b2dd27334ddec322d67953b913ddedf46 | /training/my-training/old/winter-2013/8-math/C.cpp | 7b3e02af50f91b7cedc7cd106b81f9d06704b2f6 | [] | no_license | szefany/acm-icpc | 63653dfc724eab98b33bde54416ad84eb5e2f4f6 | 86ccd854be545cd67bc2850e22337d3fe9f4701f | refs/heads/master | 2021-06-02T02:02:10.251126 | 2019-09-28T13:24:22 | 2019-09-28T13:24:22 | 7,666,139 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 603 | cpp | C.cpp | // HDU 3032, Nim or not Nim?
#include <cstdio>
#include <cstring>
int sg (int x) {
long long result;
if (x % 4 == 0) {
result = x - 1;
} else if (x % 4 == 3) {
result = x + 1;
} else {
result = x;
}
return result;
}
int main () {
int test_count;
scanf ("%d", &te... |
62f106fc93bf01a1e32cfad59deabeed30d69402 | 57e519e32dc88ceb894a1d323cd68ef48e9f74a0 | /Clasa a 8-a/Din baza [10] in baza [2]/main.cpp | 0412fb2d1af5ed8aee936cbe3965f400375556c0 | [] | no_license | MihaiAnghelin/CPP | 89e9d4c21e6ca2e48bf188a068e82f01ec669479 | e034b69af3a622c4ce52865d7414fed5b1f7f2d1 | refs/heads/master | 2020-06-07T02:49:03.265320 | 2019-12-10T13:25:17 | 2019-12-10T13:25:17 | 192,903,853 | 2 | 0 | null | 2020-05-13T17:05:32 | 2019-06-20T10:58:37 | C++ | UTF-8 | C++ | false | false | 266 | cpp | main.cpp | #include <stdio.h>
int main()
{
int n,a[50],indice=1;
printf("N= ");
scanf("%d",&n);
while(n!=0)
{
a[indice++]=n%2;
n/=2;
}
printf("%d\n",indice);
for(int i=indice-1;i>=1;i--)
{
printf("%d",a[i]);
}
}
|
e1c28cf031777ff0b4236caa3d6ec8ed171d1c1d | 64e7a0cf9d67467ee5d272ecddba9f79b75ccba5 | /flatten.cpp | 7d08c921967f2237d72e686d6a298388598e5dfb | [] | no_license | Ruixuan/leetcode | 736a406669ae486ace0edc6a59d8e5d21daf8eb9 | ab63651adcc970b166eed68131cf27f40d5f6be9 | refs/heads/master | 2021-01-23T07:26:58.594731 | 2014-03-10T03:50:02 | 2014-03-10T03:50:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 681 | cpp | flatten.cpp | class Solution {
public:
TreeNode * buildtree( TreeNode* root){
if (root == NULL) return NULL;
TreeNode* tail, *right ;
right = root->right;
if ((root->left) != NULL){
tail = buildtree(root->left);
root->right = root->left;
root ->left = NULL;
}el... |
890136e4d13fa0cea3dd66c793f52d288887ac4c | c747cfbe51cc24d15e49a888072d34635833d90a | /954_ArrayofDoubledPairs.cpp | bbddd8f71eefa360fb4b7fa7d38b335bbabc62bf | [] | no_license | bigship/leetcode_solutions | 18921508a8acba25013ae65864168c4c084bef37 | 45edfab5f1696fa9b3b59b63663aa9524de209cd | refs/heads/master | 2022-08-22T05:42:37.462263 | 2022-08-02T20:14:50 | 2022-08-02T20:14:50 | 13,472,667 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,547 | cpp | 954_ArrayofDoubledPairs.cpp | // 954. Array of Doubled Pairs
/*
* Given an array of integers arr of even length, return true if and only if it is possible to reorder it
* such that arr[2 * i + 1] = 2 * arr[2 * i] for every 0 <= i < len(arr) / 2.
Example 1:
Input: arr = [3,1,3,6]
Output: false
Example 2:
Input: arr = [2,1,2,6]
Output: false
Exa... |
1930a5a6c94c8788c1a45bdef549cc6b1da2c607 | 0099305ea311f0947aaea14096046873bd1577ab | /array_and_matrixs/max_consecutive_ones.cpp | 91dad53544237defbbd17368cb5e2db36c9476de | [
"MIT"
] | permissive | zm66260/Data_Structure_and_Algorithms | 5c68ba58b4d5225b02b21a1c15ea3d91c8186310 | f3e6d60a9f0ddf1a8fe943dedc089172bc8c833e | refs/heads/master | 2021-05-22T13:27:29.093363 | 2020-04-04T08:31:50 | 2020-04-04T08:31:50 | 252,946,521 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,141 | cpp | max_consecutive_ones.cpp | // 485 max consecutive ones
// Given a binary array, find the maximum number of consecutive 1s in this array.
// Example 1:
// Input: [1,1,0,1,1,1]
// Output: 3
// Explanation: The first two digits or the last three digits are consecutive 1s.
// The maximum number of consecutive 1s is 3.
// Note:
// The... |
e447768ab9eb9fcafdc1823f8b20cf23b9c2789b | 091afb7001e86146209397ea362da70ffd63a916 | /inst/include/nt2/linalg/include/functions/simd/geesx.hpp | 3d1bd65284c856fdf43d7efc3474d80c552e0afe | [] | no_license | RcppCore/RcppNT2 | f156b58c08863243f259d1e609c9a7a8cf669990 | cd7e548daa2d679b6ccebe19744b9a36f1e9139c | refs/heads/master | 2021-01-10T16:15:16.861239 | 2016-02-02T22:18:25 | 2016-02-02T22:18:25 | 50,460,545 | 15 | 1 | null | 2019-11-15T22:08:50 | 2016-01-26T21:29:34 | C++ | UTF-8 | C++ | false | false | 173 | hpp | geesx.hpp | #ifndef NT2_LINALG_INCLUDE_FUNCTIONS_SIMD_GEESX_HPP_INCLUDED
#define NT2_LINALG_INCLUDE_FUNCTIONS_SIMD_GEESX_HPP_INCLUDED
#include <nt2/linalg/functions/geesx.hpp>
#endif
|
9d6a79b5f3e68fd34175754c64b32a91d374944a | 5234455aa51fb8d83c34df636ff2aad741f23df2 | /Siv3DTest/PlayerBullet.h | a03b49254258a1164e143a47f7ad511732b5560b | [] | no_license | ishiiyuki/Siv3dTest | 15a22c6276fd7eb3d9c2adfb50bd146f42c946f4 | d41dbb4d4fe562f35b5d28f6dc486696ec3b4b07 | refs/heads/main | 2023-04-02T07:19:04.866817 | 2021-03-28T08:56:32 | 2021-03-28T08:56:32 | 325,776,815 | 1 | 0 | null | 2021-03-28T08:56:33 | 2020-12-31T10:35:36 | C++ | UTF-8 | C++ | false | false | 357 | h | PlayerBullet.h | #pragma once
#include "Bullet.h"
class PlayerBullet :
public Bullet
{
private:
public:
PlayerBullet(Vec2 setPos) {
pos = setPos;
speed = 500.0;
}
~PlayerBullet() {
}
bool BulletEnd() const {
return pos.y < -48;
}
void Update(double delt... |
cfc905e24eee87581c9043815c3bf5f5962a557a | eebf0ef56f2ed3bd94d17d437b87cb142708d9c4 | /Dinámica/Aibofobia/Source.cpp | 00a9a3334a7e1a004bcca0f3536fc2fa6af6264c | [
"MIT"
] | permissive | Yule1223/Algorithmic-Techniques-in-Software-Engineering | a5264606006be64dfbc7e5f7462bd07243edf189 | 602e3d823cfc86d68a5b3f9435faef4e5c7dc788 | refs/heads/main | 2023-03-01T01:07:47.171880 | 2021-02-11T22:44:10 | 2021-02-11T22:44:10 | 338,171,421 | 0 | 0 | null | null | null | null | IBM852 | C++ | false | false | 2,228 | cpp | Source.cpp |
// Yule Zhang
// Comentario general sobre la soluciân,
// explicando câmo se resuelve el problema
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <climits>
#include <list>
#include "Matriz.h"
using namespace std;
int patin_rec(string const& patitos, int i, int j, Matriz<int>& ... |
1389188f7efbc67a61256ceb7df94ce731845c22 | d6ab38714f7a5f0dc6d7446ec20626f8f539406a | /backend/collecting/collectedFiles/C++/edited/ethereumcpp-ethereumblob4b805926d46bf31144e053e6898cbedd3f67e023libp2pRLPXSocket.h | 2539e32d22193ec1891fec32eff847dc6807279a | [
"BSL-1.0"
] | permissive | haditabatabaei/webproject | 8db7178affaca835b5d66daa7d47c28443b53c3d | 86b3f253e894f4368a517711bbfbe257be0259fd | refs/heads/master | 2020-04-10T09:26:25.819406 | 2018-12-08T12:21:52 | 2018-12-08T12:21:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 667 | h | ethereumcpp-ethereumblob4b805926d46bf31144e053e6898cbedd3f67e023libp2pRLPXSocket.h |
#pragma once
#include "Common.h"
namespace dev
{
namespace p2p
{
class RLPXSocket: public std::enable_shared_from_this<RLPXSocket>
{
public:
RLPXSocket(ba::io_service& _ioService): m_socket(_ioService) {}
~RLPXSocket() { close(); }
bool isConnected() const { return m_socket.is_open(); }
void close() { try ... |
b0c9e6776b26c4ba70f481543bd68be47948df1c | 973c50c43f161679685d7bdcfe1e7d3433378a47 | /src/starlink/constellation.h | 6067525665777ce3977280a984ab2e7de3258ce7 | [] | no_license | weiwoduzun0729/starlink-htsim | 827d2543a2b9b4e3b867614560256ebc27bfc6bd | 56a049fa0073325d3860e40d1b957e6d4fa3b530 | refs/heads/main | 2023-08-16T16:55:51.454624 | 2021-10-18T18:11:53 | 2021-10-18T18:11:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,903 | h | constellation.h | // -*- c-basic-offset: 4; tab-width: 8; indent-tabs-mode: t -*-
#ifndef CONSTELLATION_H
#define CONSTELLATION_H
class Constellation;
#include "isl.h"
#include "satellite.h"
#include "city.h"
#include "binary_... |
bb4c394f21c92ecf1f61c101280ef34034a8a8cd | 703e23b27a0779811522d9c7b872c7f2cf43a059 | /Nuts/Nuts/Drunkbar.cpp | 89b6b79f37cc29a4b46d2da1405801cc4e0cdb32 | [] | no_license | Tetchee/Nuts | 2cd8422d03d812f3710448373ed8a4445c2c2bef | ec657989bf4d2e6907c23d579500090c5e4f1071 | refs/heads/master | 2020-04-07T22:07:37.513710 | 2018-11-22T23:30:14 | 2018-11-22T23:30:14 | 158,755,853 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 297 | cpp | Drunkbar.cpp | #include "Drunkbar.h"
#include "Input.h"
using namespace yam2d;
Drunkbar::Drunkbar(int gameObjectType, SpriteSheet* spriteSheet, TmxMap* map)
: SpriteSheetGameObject(gameObjectType, spriteSheet, 4)
{
}
Drunkbar::~Drunkbar(void)
{
}
void Drunkbar::update( float deltaTime )
{
} |
ab1d15fcc6aba3a805f7958062358b5d38ec4037 | 314e5cc24e4849a17f6d8937e4a482e55c7bd668 | /src/engine/core/src/ui/widgets/ui_button.cpp | 6b5bc16ab003f718fc803ffebd358d97c5c0309d | [
"Apache-2.0"
] | permissive | amzeratul/halley | 7727e67ecbdb2cd4b6a16b694886037431898370 | 75b620bf65d666c0a8383fb7180fddde4397f00e | refs/heads/develop | 2023-08-24T16:38:12.343749 | 2023-08-24T11:11:05 | 2023-08-24T11:11:05 | 43,295,328 | 3,716 | 218 | Apache-2.0 | 2023-07-23T07:01:17 | 2015-09-28T10:41:31 | C++ | UTF-8 | C++ | false | false | 5,992 | cpp | ui_button.cpp | #include "halley/ui/widgets/ui_button.h"
#include "halley/ui/ui_style.h"
#include "halley/ui/ui_painter.h"
#include "halley/support/logger.h"
#include "halley/ui/widgets/ui_image.h"
#include "halley/ui/widgets/ui_label.h"
using namespace Halley;
UIButton::UIButton(String id, UIStyle s, std::optional<UISizer> sizer)
... |
125d64299af548945d406b1bd4223ed089f4df21 | 9c310296d6b2a75d9af3a45579bc3c249a7ed7e9 | /src/RpcExt/RpcMessage.cpp | d50f3fd0930860ef4608d40bae3011ee20ea675d | [] | no_license | temp1352/rpcext | 836abfe0c76564462bd9d50a7211e7aad8dba475 | 94db5a343d86af8808f876bfad45cdf9afd82a75 | refs/heads/main | 2023-07-18T07:12:54.845469 | 2021-09-12T10:10:09 | 2021-09-12T10:10:09 | 404,338,869 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,212 | cpp | RpcMessage.cpp | #include "StdAfx.h"
#include "RpcMessage.h"
#include "InterfaceMap.h"
#include "RpcBuffer.h"
// RpcMessage
RpcMessage::RpcMessage()
{
memset(this, 0, sizeof(RPC_MESSAGE));
}
RpcMessage::~RpcMessage()
{
Free();
}
void RpcMessage::Read(RpcBuffer* pBuffer)
{
Free();
this->DataRepresentation = pBuffer->ReadInt32(... |
f61cca0926bfda00148e8eca04773a426451b9f0 | 1405a394763bc6e997dd1f0387a49d23a0c38d22 | /haxelib/native-bindings/src/HaxeAPI.h | c4ac8a0b16e070937b25fbb7398d6a16c4a01f0f | [] | no_license | josephzizys/hx-gameplay | 93a7245e4393dd311bdb8aaa476f8d2bc6d95200 | b8e17f373b3f124f591872e59cbb955968edcf05 | refs/heads/master | 2021-01-18T06:31:24.263377 | 2013-01-12T11:27:44 | 2013-01-12T11:27:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,019 | h | HaxeAPI.h | #ifndef __HAXEAPI_H__
#define __HAXEAPI_H__
#include "gameplay.h"
#include <hx/CFFI.h>
using namespace gameplay;
#if defined _WIN32 || defined __CYGWIN__
#ifdef __GNUC__
#define DLL_PUBLIC __attribute__ ((dllexport))
#else
#define DLL_PUBLIC __declspec(dllexport)
#endif
#else
#if __GN... |
de2a45c3b941b540c6254c3d5b93877ae5400821 | 4999f0c32b73bd97b458b85f07ec6298a541c01f | /jd-2/main.cpp | 308ebb650c0af3d64282c071428aaadcf6ac7e87 | [] | no_license | yewmint/leisures | 8fe41b45d8c6bf4174023ba1d19ba9f70a37cb92 | 21fda8822dd4fb23b35243c8db19f5cc2505c917 | refs/heads/master | 2021-07-24T06:09:24.019521 | 2018-10-16T06:44:02 | 2018-10-16T06:44:02 | 119,350,132 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 686 | cpp | main.cpp | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef pair<int, int> pii;
typedef long long ll;
template<typename T>
ll scll(T val){
return static_cast<ll>(val);
}
int n;
int main() {
scanf("%d", &n);
vector<vector<int>> goods(n, vector<int>(3, 0));
for (int i = 0; i < n; ++i){
scan... |
64e43e1e00c4070e14ca8858b6e87409e2ef9722 | c9fde4576216a22e8d5711bbe97adda1aafa2f08 | /inference-engine/src/hetero_plugin/hetero_executable_network.h | 6fe1ef44a320d14f2746b0efe58f4c4f490680e9 | [
"Apache-2.0"
] | permissive | dliang0406/dldt | c703d6a837de3f996528fc8a9543f9530b23342c | d9b10abcebafe8b10ba81e09e433de7a366c072c | refs/heads/2018 | 2020-04-03T08:24:47.723353 | 2018-10-29T07:58:05 | 2018-10-29T07:58:05 | 155,132,108 | 3 | 1 | Apache-2.0 | 2019-10-10T08:39:46 | 2018-10-29T01:03:54 | C++ | UTF-8 | C++ | false | false | 2,439 | h | hetero_executable_network.h | // Copyright (C) 2018 Intel Corporation
//
// SPDX-License-Identifier: Apache-2.0
//
/**
* @brief a header file for ExecutableNetwork
* @file dlia_executable_network.hpp
*/
#pragma once
#include <memory>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include ... |
6d851abce599decd27d0aa4a190318d2b57286c7 | a54300ad38a05d3b1e41ba1ad211ed44db8da7c8 | /Source/Shader/GfxShader.h | 89610f53798d042c2b1e83e74e6298198870f485 | [] | no_license | takasuke-ando/GfxLib_Dx11 | df30966eb3d6a1e8cb67433b09ea76a8e1eee204 | 382a2be5e7687a12a85a93c610d7d2540f2241e9 | refs/heads/master | 2021-01-10T03:15:00.005834 | 2016-03-13T15:20:39 | 2016-03-13T15:20:39 | 53,783,327 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 349 | h | GfxShader.h | #pragma once
#include <Util\GfxD3DPtr.h>
namespace GfxLib
{
class Shader
{
public:
~Shader();
protected:
Shader();
HRESULT CompileShaderFromFile( const wchar_t* filePath , LPCSTR entryPoint ,
LPCSTR shaderModel , ID3DBlob** ppBlobOut );
protected:
D3DPtr< ID3D11Devi... |
e2c10e6fbb4037b6a6ab7a5c002ab4bfa334aba0 | 98fb49c18d109bae883cff9978ffe7d851824c3e | /CPP/TREE/tree_creation.cpp | 8e56060421b0d307cfcd43022674a89492f25d8b | [] | no_license | ANKUSH-JPG/CODES | b6552c3a083ddb4be8b7f8099c7432567b860123 | 40265c79bdefc56c88d549accc9931dd630c1408 | refs/heads/master | 2023-02-20T15:21:44.847711 | 2021-01-25T08:34:58 | 2021-01-25T08:34:58 | 310,353,373 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,083 | cpp | tree_creation.cpp | #include<iostream>
using namespace std;
struct node
{
struct node *left;
char data;
struct node *right;
};
struct q
{
int f=0;
int r=-1;
struct node *a[100]={NULL};
};
struct node * add_root(struct node *a[],int &f,int &r)
{
struct node *temp=new node;
r=r+1;
cout<<"ENTER CHARACTER FOR... |
7e693cfb2dc378fdb6bd1ffa2e0cd1e473406bc4 | ed2cd3d6b3475cde90b1dda95eb03c859517c71a | /Student_OMP_Image/src/cpp/core/04_RayTracing/moo/host/RayTracing.h | a64edd56d889252008e3dce92ddba121ea7c57dc | [] | no_license | jcornaz/hesso.gpu.exercices | 926473089d096210b2538da0c76ec69f67e0794d | 5de3288338f963e12d5c32d95d372834f57923d5 | refs/heads/master | 2021-01-21T06:52:08.018923 | 2018-04-04T11:48:23 | 2018-04-04T11:48:23 | 91,589,076 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 813 | h | RayTracing.h | #ifndef RAY_TRACING_H_
#define RAY_TRACING_H_
#include "Animable_I.h"
#include "MathTools.h"
#include "Sphere.h"
class RayTracing: public Animable_I {
public:
RayTracing(int w, int h, int padding, float dt, int nbSpheres);
virtual ~RayTracing();
/**
* Call periodicly by the api
*/
virtual ... |
d934694a2f4cc5979b6c9d3cb63aa5589629b969 | 8ab3e882303250ef5b279418d7916c7036b0a1d9 | /workspace/DemonstratePMRMonotonicBufferResource/src/DemonstratePMRMonotonicBufferResource.cpp | e3cd106a28f54ef6bd31d07d411c266a8d17e203 | [] | no_license | PeterSommerlad/CPPCourseExpert | eaac3a0562ef390b259031629d943f82e384b8cd | 84b365c4508c7906f638199115fc2f9597319b4d | refs/heads/main | 2023-06-12T00:31:38.864261 | 2023-05-26T15:51:29 | 2023-05-26T15:51:45 | 470,980,622 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 800 | cpp | DemonstratePMRMonotonicBufferResource.cpp | #include <iostream>
#include <memory_resource>
#include <array>
#include <cstddef>
#include <numeric>
#include <cstdint>
#include <iterator>
#include <algorithm>
#include <new>
int use_vector_with_pmr_resource(){
using namespace std::pmr;
std::array<std::byte,1000> heap{};
monotonic_buffer_resource memory{
h... |
0d6180f62ac99d64a3a3eb222ae2e4b332871076 | 812483619228582d4227680715b6c430f409fd56 | /src/query/parser/Statement.cpp | 5c83e1bb0a105933faa2efc5c99d94642ad657dd | [] | no_license | alexandervanrenen/Gamera-Database | dc309be4f74a9edbe6e6701f63e78ba3b5f089b6 | 77e519bb95a3d9be5d4930c969ce2525442da2bd | refs/heads/master | 2021-06-13T19:47:39.964140 | 2017-02-19T21:17:29 | 2017-02-19T21:17:29 | 8,671,726 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,954 | cpp | Statement.cpp | #include "Statement.hpp"
#include "harriet/Expression.hpp"
#include "harriet/ScriptLanguage.hpp"
#include "harriet/Value.hpp"
#include "query/operator/PrintOperator.hpp"
#include "query/operator/RootOperator.hpp"
#include "query/util/GlobalRegister.hpp"
#include "Visitor.hpp"
using namespace std;
namespace dbi {
nam... |
9dbb1eab4142f11128b15bb03cf707f33117ca24 | 877e415f325874912759a1824a1e6ab5d65747c2 | /main/CLCCParser.cpp | 8c783e8213cdc59c0b223b8a0677b6270701817f | [] | no_license | teor292/ArduinoAlarmBicycleDevice | 3fd808f79226618dde7c0e817c40d18f1e1d1587 | 7d11d7c3fcd5e2bce881eaae776313aee56c48d4 | refs/heads/main | 2023-06-25T17:45:41.283125 | 2021-07-22T15:34:13 | 2021-07-22T15:34:13 | 363,387,072 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,058 | cpp | CLCCParser.cpp | #include "CLCCParser.h"
CLCC_CALL_STATE CLCCParser::Parse(SafeString& str)
{
const static char CLCC[] = "+CLCC:";
if (!str.startsWith(CLCC)) return CLCC_CALL_STATE::ERROR_PARSE;
int index = str.indexOf(',', sizeof(CLCC));
if (-1 == index) return CLCC_CALL_STATE::ERROR_PARSE;
index = str... |
5b2a6646ccc6620da3bfbc501c409a7b587d34f2 | 4c95d6f77e325932ad500c9f0469b83bda41d920 | /NodeMCU_Principal/NodeMCU_Principal.ino | c8626778373eda252118e07deb874317a65dfadf | [] | no_license | nuclicufc/ESP-Now_with_ESP8266 | 85b9603e5b10afa98185467068a5978d0a3738ce | 321209bed39c2a1005a283d31feec9ea5ab9b75e | refs/heads/master | 2022-12-30T20:52:54.320309 | 2020-10-16T22:41:09 | 2020-10-16T22:41:09 | 304,751,635 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,623 | ino | NodeMCU_Principal.ino |
#include <ESP8266WiFi.h>
#include <espnow.h>
// MAC Address do NodeMCU que vai receber dados
uint8_t broadcastAddress1[] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF};
uint8_t broadcastAddress2[] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF};
uint8_t broadcastAddress3[] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF};
// exe... |
b6fa78e173762afebfabfd54e4e3b4cf1a84c795 | 22e707bcd744fb0ac7ea06f40d4864f4ec9111b8 | /tests/src/empty.h | be25f8713898f290bd600beef650f10cb439f99c | [
"MIT"
] | permissive | hartcw/smacro | f6e5dc6cbe6c7918f54165146a3922af7f286065 | 79e336f6d828a779769638577d30886bf6019b6b | refs/heads/master | 2016-09-06T14:00:32.878753 | 2011-08-21T08:23:26 | 2011-08-21T08:23:26 | 1,530,321 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 111 | h | empty.h | #ifndef EMPTY_H
#define EMPTY_H
namespace test
{
struct TestStruct
{
int Value;
};
}
#endif // EMPTY_H
|
227693071bbcdc72d6e141c3343db01422684f6a | 655286bf8dbf1bebf74bdeff51d91c7ec995f6dc | /Seminars/program_7.cpp | f211ef35e8a577ababbadd0e7af7404581370b1c | [] | no_license | DmitriiDenisov/CPP_notes | c54ce0a1c286dfc299a00f8f12d46f47bd70d8af | 4f388e7a4e7893fbd78ccd561c17a5642b3ebc70 | refs/heads/master | 2020-08-19T20:02:17.586843 | 2019-10-18T07:20:06 | 2019-10-18T07:20:06 | 215,949,517 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,134 | cpp | program_7.cpp | //Программа удаляет из массива все элементы,значения которых заканчиваются на цифру 3 или 5(исключая
//элементы из массива,все следующие за ним элементы сдвигаются влево на 1 позицию,и при этом освободившийся
//элемент массива зануляется.Заполнение:так как в задаче не было сказано про размер и способ заполнения масси... |
926bdedea9dc43782e5f42772ffcd2637c884562 | 7422ddcb551530ca248b233d85a0b6d9fc8e5597 | /examples/example.cpp | 36110eb2defbcb9e94fd8c6a2b495dab7bfcbdd7 | [
"MIT"
] | permissive | congard/tulz | 3ab5256871ff2b4361fe4e5b1d83a182c5a1cdd8 | 5e87189913fa96f162b3d8885a7e2df74a279a51 | refs/heads/master | 2023-09-01T08:51:47.576874 | 2023-08-26T22:34:34 | 2023-08-26T22:34:34 | 217,851,635 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,321 | cpp | example.cpp | #include <tulz/Path.h>
#include <tulz/File.h>
#include <tulz/StringUtils.h>
#include <tulz/threading/Thread.h>
#include <tulz/threading/ThreadPool.h>
#include <tulz/threading/MutexLocker.h>
#include <tulz/LocaleInfo.h>
#include <iostream>
#include <utility>
#include <locale>
using namespace tulz;
using namespace s... |
c863841887cbf9d5794c5e82d2bd9be3a31e7e96 | b6d1df49c1ec621a02204b1100312ecbb3e76ad3 | /src/mains/mapping/ply2tdp.cc | 3f0fc4dd8aa8d52f701ad3a34d52057b38b20034 | [] | no_license | flylong0204/projects | 5271acde325cf3947fac7433077353b52fa07bc4 | b1e5c918d4aeb34c36576dababc5509dbb89afd1 | refs/heads/master | 2017-12-06T06:35:20.926786 | 2017-01-24T23:53:13 | 2017-01-24T23:53:13 | 79,988,197 | 1 | 2 | null | 2017-01-25T06:11:23 | 2017-01-25T06:11:23 | null | UTF-8 | C++ | false | false | 7,276 | cc | ply2tdp.cc | // ==========================================================================
// Program PLY2TDP reads in reads in a PLY file generated by Noah's
// Bundler codes. It extracts X,Y,Z,R,G,B information and generates
// an output TDP file.
// ply2tdp
// =============================================================... |
a5979169e0557a14cc8e932cfead5235a3be192d | 6c22d7f75bcbb5ccb694406aa98579dc20aaa3aa | /fishparty/fishparty/home_button.xaml.h | 156dc7f5941dec223f53c98b60b23bf9f1330bc4 | [] | no_license | raltyinferno/fishparty | 51479cc4e0b94a8bfd2858b7d955bd255869ff0c | 22b45e693211322e670ee35f740754d871550009 | refs/heads/master | 2018-09-20T01:42:38.730912 | 2018-06-06T10:56:06 | 2018-06-06T10:56:06 | 118,066,261 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 373 | h | home_button.xaml.h | //
// home_button.xaml.h
// Declaration of the home_button class
//
#pragma once
#include "home_button.g.h"
namespace fishparty
{
[Windows::Foundation::Metadata::WebHostHidden]
public ref class home_button sealed
{
public:
home_button();
private:
void navigate_home(Platform::Object^ sender... |
15fabe14240dde9937720935902f0bf0d18c6227 | 07fe910f4a2c7d14e67db40ab88a8c91d9406857 | /game/mga/Parser.h | 9d9bae9250c3ac6da50d8f5307e3bbd7a911374c | [] | no_license | SEDS/GAME | e6d7f7a8bb034e421842007614d306b3a6321fde | 3e4621298624b9189b5b6b43ff002306fde23f08 | refs/heads/master | 2021-03-12T23:27:39.115003 | 2015-09-22T15:05:33 | 2015-09-22T15:05:33 | 20,278,561 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 42,626 | h | Parser.h |
/* this ALWAYS GENERATED file contains the definitions for the interfaces */
/* File created by MIDL compiler version 8.00.0595 */
/* at Wed Jun 10 20:03:02 2015
*/
/* Compiler settings for C:\Program Files (x86)\GME\Interfaces\Parser.idl:
Oicf, W1, Zp8, env=Win32 (32b run), target_arch=X86 8.00.0595
pro... |
4b2925ed52d0c14f4f2f694939203fed4336cc73 | 2493f74eeab056a62c32b8b3bcb128d581568f17 | /include/Parser.h | b629111f5f865d2034645262530391e9201f7267 | [
"MIT"
] | permissive | mfl28/HackAssembler | eb1a7fbf9526c123a2a21c73f5ce8c7e026c4590 | 0655b29bdd45bc19da223c67dbf9d3b9fe8a64fe | refs/heads/master | 2021-07-09T06:30:34.353204 | 2020-08-29T17:06:22 | 2020-08-29T17:06:22 | 184,457,374 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 3,764 | h | Parser.h | #pragma once
#include <istream>
#include <string>
#include <regex>
namespace HackAssembler {
class Parser {
public:
/**
* \brief Contains the different command-types:
* A (address-command): "@Xxx", where Xxx is either a symbol or a decimal number
* C (compute-command): "dest=... |
89d04f26af7e277d1dca27b0c7fb4712b6ba4a86 | 80ee6883432d059defee6508c6c24be155ff6d9f | /261_GraphValidTree/solution_1.cpp | 75c1cd3ee9b4e664e1917ef38b59cc8d518f6598 | [] | no_license | evelyn-plee/leetcode | 2398dd6dbdb5702ea2f31ebfe45c4ad7ce3790f0 | 5544082d680da4c4177ca8d6da3cbed8389eadb9 | refs/heads/master | 2021-06-03T06:38:14.603934 | 2020-02-20T08:45:24 | 2020-02-20T08:45:24 | 130,520,459 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 855 | cpp | solution_1.cpp | #include<vector>
#include<iostream>
using namespace std;
class Solution{
public:
bool validTree(int n, vector<pair<int, int>>& edges){
vector<bool> visited(n, false);
vector<vector<int>> directions(n, vector<int>());
for(auto e : edges){
directions[e.first].push_back(e... |
d21905919cad2842e394c81e317b55864ec34995 | bb04a9b954c0b370ac01c31e847cb9ff0705994b | /hand_software/SendMessage.h | 4203e13e04f98bf69865074a9e548cda389f27bf | [] | no_license | B50RO-B51RO-Robotic-Hand/hand_software | 7424a958fc78c981ca56895d0c631208e5bf6093 | 0a6ba78c2ba2f210edf93cfc1b605ab50bad8438 | refs/heads/main | 2023-03-27T07:50:15.219832 | 2021-03-27T16:29:53 | 2021-03-27T16:29:53 | 335,965,987 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,857 | h | SendMessage.h | #ifndef __SEND_MESSAGE_H__
#define __SEND_MESSAGE_H__
#include "Defines.h"
#define MSG_CHAR_ARRAY_START 0b10000000
#define MSG_SERVO_POSITION_START 0b00000000
#define MSG_ALL_POSITIONS 0b00001000
#define MSG_ALL_LIMITS 0b00001001
#define MSG_FORCE_RAW 0b00001010
#define MAX_SINGLE_MESSAGE_LENGTH 128
namespace Send ... |
f246825b82e92deb1bf1f8234f628afb5fd2dba2 | e22a61a0130e51d420be827447108e425fc379c7 | /Google/Expogo.cpp | 3c54dea9f8c0a672e603ef2a763ddc4e6e9cfbd1 | [] | no_license | arminAnderson/CodingChallenges | 06acedefd1a32727bd624034c05037c56240bd43 | 3de27adaabbbc38446e347acfba420756e687fb2 | refs/heads/master | 2023-04-26T20:32:50.325981 | 2021-05-31T08:13:17 | 2021-05-31T08:13:17 | 280,546,295 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,569 | cpp | Expogo.cpp | #include <iostream>
#include <vector>
using namespace std;
struct Pair
{
int a = 0, b = 0;
string d = "";
void Print()
{
cout << a << "," << b << endl;
}
bool Equals(Pair p)
{
return a == p.a && b == p.b;
}
};
void Print(string s)
{
cout << s << endl;
}
vector<Pai... |
ffc390f82ced67bdd94059918e690aa9cd02ca21 | 666e2ff7aa1a4bcf3592331062ce774373fe6fa6 | /main/video_cafe_gui/video_cafe_output.h | bf060f05a9240ceaf573accc03f71745c8a81315 | [] | no_license | asyr625/mini_sip | aeffd6e5ea1dafafa817b1137859b41351fe9580 | 12ea4b9a03585b5c7e5b5faeeed0a5bc6a9c19cc | refs/heads/master | 2021-01-20T12:06:33.212419 | 2015-11-24T02:33:26 | 2015-11-24T02:33:26 | 46,761,914 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 8,209 | h | video_cafe_output.h | #ifndef VIDEO_CAFE_OUTPUT_H
#define VIDEO_CAFE_OUTPUT_H
#include "sobject.h"
#include "opengl_display.h"
#include "opengl_window.h"
#include<list>
/**
Video is output is a single OpenGL window. The layout is initially a grid.
The user can make a video bigger by clicking it. If clicking it when it
is "full screen"... |
c3da084c8283c7cc53ecc25020a4be0dee0c00a4 | ab570cfbba5d90e73727dca01008e43029a42eae | /hand.h | ac680e50310c6be803b33db47c5f5c9452519c92 | [] | no_license | rileym65/Casino | 3adfbdf4501f0c55191c031a0ffe3615b30b8cfc | 6b73002fdfebbda9ca490774b941f561cb73a049 | refs/heads/master | 2020-08-08T22:08:40.508213 | 2019-10-09T13:49:34 | 2019-10-09T13:49:34 | 213,931,230 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 811 | h | hand.h | #ifndef _HAND_H
#define _HAND_H
class Hand {
protected:
byte straightCount;
byte straightHigh;
byte stFlushCount;
byte stFlushHigh;
int wildCount;
unsigned long computeHandValue(unsigned long value);
unsigned long computePaigowValue(unsigned long value);
int numbers[15];
int su... |
eb09850caad469c25063bd33355244de8875a4c5 | 4ecd9f030c10fdd05e1c3436e3f41a7a3a803d76 | /pic10ahw6/Character.h | a68caa9c87b1d25f07513326ef171019652c415e | [] | no_license | jkauf8/monsterGame | 26a2bc733c964e9f64e8e7c0af33b057d60f8fd4 | a45857cb9b5ff4589b5a4f20b5ea9369caf3b8c0 | refs/heads/main | 2023-02-12T22:16:20.139213 | 2021-01-16T02:41:47 | 2021-01-16T02:41:47 | 330,328,581 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 533 | h | Character.h | //Character.h
#ifndef Character_h
#define Character_h
#include <iostream>
#include <string>
#include <cstdlib>
#include <ctime>
using namespace std;
class Character
{
public:
Character(string newName);
Character(string newName, int newHealth, int newDamage, int newArrows);
void attack(Character& target);
void r... |
93f49afa411b3d51f9f1c7e150248c5666a42484 | 302e7dfdb90f55c8bd3c783d4d7f177111a02725 | /src/arduino/smart_exp/Button.h | ef4ef5191a61d743821655021e03fec948c5f9bf | [] | no_license | lorenzo0/Smart-Experiment | 9a2b3a41bd16f5126ccdca557abf428e2f961bf3 | 04fc184c103e7e8e6e45ea81044e921ce8a9c065 | refs/heads/master | 2023-01-24T05:40:21.962826 | 2020-12-06T17:46:57 | 2020-12-06T17:46:57 | 313,066,963 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 134 | h | Button.h | #ifndef __BUTTON__
#define __BUTTON__
class Button{
public:
Button(int pinButton);
private:
int pinButton;
};
#endif
|
dcf5202cd39d3ab5c4038e2b05cb799f8b971c73 | 14ce793aedf5fcc1a685ee7173e1333210b46553 | /src/qtest/abuild-shlibs/data/extra-targets/lib1_1.hh | e997aaef2fe54331939ca845c44155168e9f7caa | [
"Apache-2.0",
"Artistic-2.0",
"LicenseRef-scancode-unknown-license-reference",
"Artistic-1.0",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | abuild-org/abuild | a569fca784b1a113f65c510233b9d97773c84674 | 54c003b2bf2e544bb25d7727fb4ba6297bc4a61e | refs/heads/master | 2020-11-27T07:39:14.413974 | 2019-12-20T23:38:41 | 2019-12-20T23:38:41 | 229,351,827 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 60 | hh | lib1_1.hh | #ifndef lib1_1_hh
#define lib1_1_hh
void lib1_1();
#endif
|
81655373d9a746947781ad93ceffc12f2337a525 | fe225bb412f3b0c43abe1d257658e7f433346bbf | /apps/postgresql/trans/ConfigTransaction.h | 0cbda047abb85053f5c4cad763b9cc40bda213bd | [] | no_license | yeti-switch/sems | 611f0bc8dfa381d5f8f15c47a7ce287a2e8366f1 | f15ab5b638d7447883503d4939170067aba0f807 | refs/heads/master | 2023-08-18T23:09:58.940541 | 2023-08-16T19:37:19 | 2023-08-16T19:37:19 | 70,628,618 | 14 | 9 | null | 2018-04-02T10:10:05 | 2016-10-11T19:36:01 | C++ | UTF-8 | C++ | false | false | 600 | h | ConfigTransaction.h | #pragma once
#include "Transaction.h"
class ConfigTransaction : public Transaction
{
Transaction* make_clone() override {
return new ConfigTransaction(*this);
}
PGTransactionData policy() override { return PGTransactionData(); }
public:
ConfigTransaction(const map<string, PGPrepareData>& prepa... |
8f4ea39d95391c03b7344a0658dd1c70a1ee6db1 | fd872b564a34189e94510354f2e3d8af735b5e20 | /mapper/include/mapper.h | d5791b763e34fcf57ac96b444d420c7e7b45fefe | [] | no_license | NickoDema/undergraduate_final_project | e55b6e58a99a72a22ec041235ba4482e634eab7e | 7afb49d5a5d106a672df018f941bcd143df27aee | refs/heads/master | 2022-04-25T14:28:37.739551 | 2020-04-19T22:28:37 | 2020-04-19T22:28:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,846 | h | mapper.h | /* mapper.h
*
* Created on: 19.04.2017
* Email: Nicko_Dema@protonmail.com
* ITMO University
* Department of Computer Science and Control Systems
*/
#ifndef MAPPER_
#define MAPPER_
#include <ros/ros.h>
#include <tf/tf.h>
#include <sensor_msgs/PointCloud.h>
#include <geometry_msgs... |
5de221804233b977d198c115cc4e6cf8e2ffcf10 | 83977dbf9fce529fbfd3e5cd29341ecef483b5b3 | /Analysis_programs/projects/x/read_corr.cpp | ec48ebdb0bcb8d2878f28493bd3d6f54e4cbbe4a | [] | no_license | sunpho84/sunpho | 0057bc0d42ee1a73e133dc16365f2490facb35d9 | ef964e4af9079a243ddac6a1469b267693c77834 | refs/heads/master | 2020-04-05T22:55:18.442445 | 2017-02-07T09:15:17 | 2017-02-07T09:15:17 | 41,365,927 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,869 | cpp | read_corr.cpp | #include "include.h"
int L=24;
int njacks=15;
int nind_mom;
int *deg,*ind_of_lx;
double *m2;
typedef int coords[4];
coords size={L,L,L,L};
int V=L*L*L*L;
double phase[4]={1,0.01,0.02,0.03};
//Return the index of site of coord x in a box of sides s
int lx_of_coord(coords x)
{
int ilx=0;
for(int mu=0;mu<4;mu++)... |
a103cfd0e5635d0c0e3ba19bfd970229aa3b7738 | fed18c8d3288e597a9055836bed227a58c28aaa7 | /lessons/lesson_27/menu.hpp | d19e50e6d20dbaf49c6516949045bc2893f7731e | [] | no_license | cCppProsto/SDLLesson | 22bc3106e0249416a522c4329de48b599039a504 | 22d332cf89aeeaef8431a99d9c1a148109e2e3fd | refs/heads/master | 2021-06-20T19:10:21.434487 | 2021-03-06T05:57:42 | 2021-03-06T05:57:42 | 189,386,063 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 869 | hpp | menu.hpp | #ifndef _MENU_HPP_
#define _MENU_HPP_
#include <vector>
#include <SDL_events.h>
#include "menuSettings.hpp"
class menu
{
enum class eItem : Uint8
{
Start = 0,
Settings,
Authors,
Exit
};
friend menu::eItem operator++(menu::eItem &item);
friend menu::eItem operator--(menu:... |
4e47f2720a5d87ae5b4559feb3b72ecc29a77169 | 69b5d925a07a7f60445cb507736ee9a55b045018 | /SDL 2D Game Engine/CollisionSystem.cpp | 2f2745d828572b4cbe39a94933f5d0a358cd65cd | [] | no_license | CamiloOY/SDL-2D-Game-Engine | 685dd3b72bc0fd69d358a1537951ebfb18ea56e5 | 54a723fcb42734d839206a8efb09aadd07d33450 | refs/heads/master | 2023-09-05T09:04:33.632433 | 2021-11-04T21:57:53 | 2021-11-04T21:57:53 | 379,560,939 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,023 | cpp | CollisionSystem.cpp | #include "CollisionSystem.h"
#include "Components.h"
#include "Game.h"
void CollisionSystem::update() {
for(Entity& entity_a : entities) { // Loop over all entity pairs and check if they're colliding
RectCollider& collider_a = manager.getComponent<RectCollider>(entity_a);
collider_a.collisions.clear();
Transfor... |
01a17f9f16c74efa37614fe6e8625830de70c6da | c18894a83550a8e8494787591fbe8e31cd08d31e | /MyClient/ScreenBuffer.h | d81d8db92f3ab2ccfa8ff8e630f67fe51051ad4e | [] | no_license | suha1515/D2DTool | 2bb8e85b9e775e25a1011d49094dc14a4fec9c6e | 49750e33a33e92695b098ee76246d4e9963f1d04 | refs/heads/master | 2022-02-22T11:16:14.205049 | 2019-10-22T02:56:22 | 2019-10-22T02:56:22 | 208,934,027 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 341 | h | ScreenBuffer.h | #pragma once
class CScreenBuffer
{
public:
CScreenBuffer();
~CScreenBuffer();
public:
void Initialize(int width,int height);
void Render();
void Release();
private:
//오브젝트 정점,인덱스 버퍼
IDirect3DVertexBuffer9* m_pVB;
IDirect3DIndexBuffer9* m_pIB;
LPDIRECT3DDEVICE9 m_pDevice;
BlendVertex m_Vertex[4];
};
|
9dff2e1561e3f2e8c287021c867866fa36fb27f7 | 6890b258bec01ad71bfa6c6f8914854a3b85b98a | /Программирование/ConsoleApplication1(2)/ConsoleApplication1/Student.cpp | 2eeefab7c9553c913e894caf7d3d557ce4ef0877 | [] | no_license | Avdil/Semestr_3 | 23910ff9f91a30e08a15a1e717a2eb1687feb145 | 55564e43b80b3c1089c230ebc63b3ac455295cd6 | refs/heads/master | 2020-03-15T16:43:02.803735 | 2018-05-05T11:23:33 | 2018-05-05T11:23:33 | 132,241,300 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 472 | cpp | Student.cpp | #include <string>
#include "Student.h"
Student::Student()
{
}
Student::~Student()
{
}
void Student::set_name(std::string student_name)
{
Student::name = student_name;
}
std::string Student::get_name()
{
return Student::name;
}
void Student::set_scores(int scores[])
{
for (int i = 0; i < 5; ++i) {
Student::scores[i... |
fb19a0288bff8e3fc3d315d8e5c251abe296ab17 | 7953410e9112d79724a8acdd604d45a043191145 | /SrProject/udpreceiver.h | 79945298b6d9fd24cf024e83d79ce945f5634637 | [] | no_license | ktaze1/SeniorProject | 80458dbde47e38ee035d57f3e46ed7c921d30433 | 1aad3d0eb065f4ef2628382b42119674041dcb78 | refs/heads/master | 2021-06-25T20:48:28.312909 | 2021-02-14T21:06:31 | 2021-02-14T21:06:31 | 203,246,860 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 525 | h | udpreceiver.h | #ifndef UDPRECEIVER_H
#define UDPRECEIVER_H
#include <QWidget>
#include <QDebug>
#include <QTcpServer>
#include "sendthread.h"
QT_BEGIN_NAMESPACE
class QLabel;
class QUdpSocket;
QT_END_NAMESPACE
class udpReceiver : public QTcpServer
{
Q_OBJECT
public:
explicit udpReceiver(QObject *parent = nullptr);
vo... |
9a6e5f54d83bc0b6804185089b5c3684f5185117 | d99a4f380d76755ff99841ac71494e7836065d42 | /sorting.cpp | 05c1d9eac41e935284c3d379afa32920954f8145 | [
"MIT"
] | permissive | selavy/sorting | 3dc77ea00cdfac3049b11571938d9942572cc0d2 | 9fe321150eed6afaf53de23d9700e202133ddbd5 | refs/heads/master | 2020-07-28T10:33:00.022145 | 2019-09-18T20:33:58 | 2019-09-18T20:33:58 | 209,394,757 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,187 | cpp | sorting.cpp | #include <iostream>
#include <vector>
#include <random>
#include <algorithm>
#include <cassert>
template <
class It,
class Cmp = std::less<>
>
void unguarded_insertion_sort(It begin, It end, Cmp cmp = Cmp{}) noexcept {
// pre : *(begin - 1) <= all elements in [begin, end)
// post: [begin - 1, end) sort... |
790f0e95a6e4243b4456a3960b3e80f3922b400c | d856fadb1f5f25f9de4f01b40ade1da5c6000863 | /RaytracingCamp2018/src/Disc.cpp | eac6bb51c40d52b34e59b2399a69f041dafa1f67 | [] | no_license | shutosg/rtcamp2018 | 9c707622857913902f4c76283241290109aeb081 | 5b6238a83d585e93334a47444d3fde3b91636340 | refs/heads/master | 2020-03-27T20:43:58.480536 | 2018-09-02T14:43:49 | 2018-09-02T14:43:49 | 147,090,190 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,590 | cpp | Disc.cpp | #include "Disc.hpp"
Disc::Disc()
: IIntersectable()
, pos(Vec(0))
, normal(Vec(0, 0, 1))
, doubleSurface(false)
{
}
Disc::Disc(const Vec &pos, const Vec &normal, const double radius, const bool doubleSurface, Material *mat)
: IIntersectable(mat)
, pos(pos)
, normal(normal.normalize())
... |
15ebcba31f03547f69ae93b5615332475464e8f1 | d2532fef27934284f9f0d932931999825128da5a | /1-Algorithmic toolbox/week4_divide_and_conquer/5_organizing_a_lottery/points_and_segments.cpp | 0edaf83059d2151f9f8b23d0ba5f8f2e452ea755 | [] | no_license | mohamedabdelhakem1/UCSD-data-structures-and-algorithms-specialization | f57f3418f82906894641d53f9e2234932d9f554e | 2e31939f561a60ed829e5e5f663dcd06c645c644 | refs/heads/master | 2020-07-03T21:18:18.895700 | 2019-08-13T02:00:21 | 2019-08-13T02:00:21 | 202,052,423 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,892 | cpp | points_and_segments.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> fast_count_segments( vector<pair <int,int > > segments, vector<int> points) {
vector <pair <int, int> > pairs(segments.size() * 2 + points.size()) ;
vector<int> cnt (points.size());
unordered_map <int,vector <int> > mp;
int i = 0;
for(pair <... |
625e808be19836b28fe6d9ae645b585143451e75 | d1b103ef570d1f2b3b23a4c0deecc85adb3bd0fe | /leetcode_day6/Q130_surrounded_char.h | e72480923c3441e6e5eebce55354145e697c74ac | [] | no_license | maverick-zhang/Algorithms-Leetcode | da77e73bf949731a8528da39445ca50761c56513 | dd4197305e9dcdb9efe6779ed69b9dbe3dbd28d9 | refs/heads/master | 2020-10-01T10:47:35.499791 | 2020-02-26T11:13:11 | 2020-02-26T11:13:11 | 227,519,712 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,359 | h | Q130_surrounded_char.h | //
// Created by maverick on 2020/1/7.
//
#ifndef ALGORITHMS_Q130_SURROUNDED_CHAR_H
#define ALGORITHMS_Q130_SURROUNDED_CHAR_H
//给定一个二维的矩阵，包含 'X' 和 'O'（字母 O）。
//
//找到所有被 'X' 围绕的区域，并将这些区域里所有的 'O' 用 'X' 填充。
//
//示例:
//
//X X X X
//X O O X
//X X O X
//X O X X
//[["O","X","X","O","X"],
// ["X","O","O","X","O"],
// ["X","... |
5528078715d987a2afc9ca54325ed9cc4cd9ae89 | 6f874ccb136d411c8ec7f4faf806a108ffc76837 | /code/Windows-classic-samples/Samples/PackageManagerFindPackagesWithPackageTypes/cpp/FindPackagesWithPackageTypesSample.cpp | 19552c36abbd7c2ab27d3bb445aa1bc271ea2fb1 | [
"MIT"
] | permissive | JetAr/ZDoc | c0f97a8ad8fd1f6a40e687b886f6c25bb89b6435 | e81a3adc354ec33345e9a3303f381dcb1b02c19d | refs/heads/master | 2022-07-26T23:06:12.021611 | 2021-07-11T13:45:57 | 2021-07-11T13:45:57 | 33,112,803 | 8 | 8 | null | null | null | null | UTF-8 | C++ | false | false | 2,538 | cpp | FindPackagesWithPackageTypesSample.cpp | //// THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF
//// ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
//// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
//// PARTICULAR PURPOSE.
////
//// Copyright (c) Microsoft Corporation. All rights reserved
#include <wind... |
6735ad198010bb60abba97cb8e39f4753ccdfab3 | 0a2357ad0098bbb7b74528cb01d6decaab928ed8 | /codeforces/contest165/a.cpp | 66208811e95442ecb540c2e133f0390729c5661b | [] | no_license | touyou/CompetitiveProgramming | 12af9e18f4fe9ce9f08f0a0f2750bcb5d1fc9ce7 | 419f310ccb0f24ff08d3599e5147e5a614071926 | refs/heads/master | 2021-06-18T09:19:01.767323 | 2020-07-16T03:40:08 | 2020-07-16T03:40:08 | 90,118,147 | 0 | 0 | null | 2020-10-13T04:32:19 | 2017-05-03T06:57:58 | C++ | UTF-8 | C++ | false | false | 718 | cpp | a.cpp | #include <cstdio>
int x[200], y[200];
int ri[200], le[200], lo[200], up[200];
int main() {
int n;
scanf("%d",&n);
for (int i=0; i<n; i++) {
scanf("%d%d",&x[i],&y[i]);
}
for (int i=0; i<n; i++) {
for (int j=i+1; j<n; j++) {
if (x[i]>x[j]&&y[i]==y[j]) {
le[i... |
57c3019ecb9de3b8ad12885a715874bd9cac1eac | 547e62016e1fa5ea4f3fc4b4ef2030b1db7eac16 | /codeforces/170/b.cpp | 7e91a9bb6aa325aaeaf728e67badd5ac9f74670b | [] | no_license | withwind93/ACM_Code | f20a59052a269078b4c5248595526e108c23cff0 | 86ef06f068122a6afc6add83f9d8ef35f1097706 | refs/heads/master | 2016-09-06T16:29:47.714053 | 2014-03-27T12:18:33 | 2014-03-27T12:18:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,184 | cpp | b.cpp | /*************************************************************************
> File Name: b.cpp
> Author: withwind
> Mail: withwind93@gmail.com
> Created Time: 2013/2/28 23:43:37
************************************************************************/
#include <limits.h>
#include <stdio.h>
#include <s... |
2812c098d2058895fc01285f8c12d0ae317d5bdf | 0734bb41eeba7e5efb58fbe40e36c6768dcf42a7 | /Test/SoundScene.h | 79ff0d70ba36d8b9a644c10afca0b77e422b3675 | [] | no_license | shh1473/Sunrin_Engine_D3D9_with_DXUT | 8b958a719a55aa311319d5ee0771e5296ff822dd | c93c5b912755636713ea0404e33b1ab278b3e592 | refs/heads/master | 2022-01-23T06:34:27.419929 | 2019-07-23T16:53:26 | 2019-07-23T16:53:26 | 197,949,893 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 202 | h | SoundScene.h | #pragma once
#include "../SunrinEngine.h"
class SoundScene : public Object
{
public:
SoundScene();
virtual ~SoundScene();
virtual void Update();
virtual void Render();
public:
Sound *sound;
}; |
85c243bf70ecdcd6620edfacdd5d9d0fb3514fc9 | 0c2cde2aa6e8d7834e5bd49e8022d45ce2b69dbd | /HW04_griffid5/vc10/griffid5Starbucks.h | 61fb9461d4c3c5b88c44806c79b18e609eecf9fb | [] | no_license | griffid5/HW04-griffid5-2 | 359f429615024a1b8fc53db93a07499c95b1f5fb | eadef837b9114b644b5f686817332a1edad9e417 | refs/heads/master | 2020-12-24T17:26:36.935557 | 2012-11-01T15:21:17 | 2012-11-01T15:21:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 470 | h | griffid5Starbucks.h | /****
*Author: griffid5 (David Griffith)
*Date: 10/27/2012
*purpose:
*/
#pragma
#include <string>
using namespace std;
#include "Starbucks.h"
class Entry {
public:
string identifier;
double x;
double y;
};
class griffid5Starbucks : public Starbucks {
public:
griffid5Starbucks();
~griffid5Starbucks(void);
Entry... |
0fe6ac672728f49fd5bc052d36b19e68e1ad77a7 | 4bcc9806152542ab43fc2cf47c499424f200896c | /tensorflow/lite/tools/optimize/modify_model_interface_main.cc | 940c0d98b82910f551d42d383c7db0c1b16c8462 | [
"Apache-2.0",
"LicenseRef-scancode-generic-cla",
"BSD-2-Clause"
] | permissive | tensorflow/tensorflow | 906276dbafcc70a941026aa5dc50425ef71ee282 | a7f3934a67900720af3d3b15389551483bee50b8 | refs/heads/master | 2023-08-25T04:24:41.611870 | 2023-08-25T04:06:24 | 2023-08-25T04:14:08 | 45,717,250 | 208,740 | 109,943 | Apache-2.0 | 2023-09-14T20:55:50 | 2015-11-07T01:19:20 | C++ | UTF-8 | C++ | false | false | 1,671 | cc | modify_model_interface_main.cc | /* Copyright 2020 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
28da77729aa509775313326290a58cc4d913b525 | 6e6323edbb77e91b28842fabcfc66ba4e4105ace | /ED_RRiveraG1_A06/C++/cmake-build-debug/Node.h | 3f1df6edaa4d16ab21ffd2668838515831b42239 | [] | no_license | Riverto/ED_RRiveraG1 | 12e29def862c30118b01da7823b7e46966adcc0e | 5ebd5e579f922cbd983632161b2d6d23b34ac740 | refs/heads/master | 2021-01-15T11:49:24.241098 | 2017-10-24T13:15:22 | 2017-10-24T13:15:22 | 99,634,985 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 231 | h | Node.h | //
// Created by Roberto Rivera on 9/7/17.
//
#ifndef C_NODE_H
#define C_NODE_H
class Node {
protected:
int data;
Node next;
public:
Node();
Node(int data);
Node(int data, Node& next);
};
#endif //C_NODE_H
|
27f53143daeb8adb9b69e43183552455264c5d53 | 1df0f2dd40099cdc146dc82ee353e7ea4e563af2 | /shared/PointInsidePolygonTest.h | b91b71b49700fd5bad00c7489c37716aee7df5a1 | [] | no_license | chuckbruno/aphid | 1d0b2637414a03feee91b4c8909dd5d421d229d4 | f07c216f3fda0798ee3f96cd9decb35719098b01 | refs/heads/master | 2021-01-01T18:10:17.713198 | 2017-07-25T02:37:15 | 2017-07-25T02:37:15 | 98,267,729 | 0 | 1 | null | 2017-07-25T05:30:27 | 2017-07-25T05:30:27 | null | UTF-8 | C++ | false | false | 709 | h | PointInsidePolygonTest.h | /*
* PointInsidePolygonTest.h
* mallard
*
* Created by jian zhang on 8/29/13.
* Copyright 2013 __MyCompanyName__. All rights reserved.
*
*/
#pragma once
#include <AllMath.h>
#include <Patch.h>
namespace aphid {
class PointInsidePolygonTest : public Patch {
public:
PointInsidePolygonTest();
PointInsidePo... |
68cc8776a554b53fb8d6ca95480323ca595eed37 | 42ecfef68dc4d15644708b141708437328118beb | /11000 - Bee.cpp | 5766c1ed032e8ec15ba6e23bd237bbe90bb34e44 | [] | no_license | Khairul-Anam-Mubin/UVa-Solutions | 900321a7f25032570b620dbe3e558b9be1ec2cce | 8298c8b2786d5a4d4d8f40e61d364aaac33bc4f8 | refs/heads/master | 2021-10-26T19:39:47.318365 | 2021-10-12T07:21:45 | 2021-10-12T07:21:45 | 156,956,789 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 455 | cpp | 11000 - Bee.cpp | /***
** Author: Khairul Anam Mubin
** Bangladesh University of Business and Technology,
** Dept. of CSE.
***/
#include <bits/stdc++.h>
using namespace std;
int main()
{
long int y,a,i,temp,b;
while(scanf("%ld",&y)==1 && y>=0)
{
a=0;
b=0;
temp=0;
for(i=0;i<=y;... |
b197c24e72ad5a51f5905958d8c657ec90c2096e | 94ca1bd63465b23db575b0f155e46661ef59c30d | /SuperHero.cpp | bb17ad49c3a93b299685d3999e736812a95b2a8f | [] | no_license | Xekep/Vitzliputzli | 9b70e2a855713e639365c16180cdadde11d9443e | 1b06befec4cffcdad090b7ab7ffefa5e1cdb9701 | refs/heads/master | 2021-01-01T06:44:39.103948 | 2011-10-27T08:44:20 | 2011-10-27T08:44:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,718 | cpp | SuperHero.cpp | #include "SuperHero.h"
#include "GMap.h"
#include "LevelSettings.h"
#include "AdvancedGraphicFunctions.h"
//---------------------------------------------------------------------------
int statesOfStepHero[4] = {0, 32, 0, 64};
int stateOfStepHero = 0;
//-------------------------------------------------------------------... |
da6ff42993eda7618d7b8faca392c83cf97f2d05 | 73a52d0a1325c9865896a9197730875cb6d46c61 | /Framework/Geometry/inc/MantidGeometry/Instrument/ParComponentFactory.h | f394c02ddfa58d6cd6c3c2222a3578d88a449a37 | [] | no_license | dezed/mantid | 47b3c9f57f9adf2b6ac642ae407d26f06a0889c5 | 9095776c26e868a00d8126ad275626f910d66f62 | refs/heads/master | 2021-01-15T13:51:57.852879 | 2016-03-08T10:49:43 | 2016-03-08T10:49:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,480 | h | ParComponentFactory.h | #ifndef MANTID_GEOMETRY_PARCOMPONENT_FACTORY_H_
#define MANTID_GEOMETRY_PARCOMPONENT_FACTORY_H_
//------------------------------------------------------------------------------
// Includes
//------------------------------------------------------------------------------
#include "MantidGeometry/DllConfig.h"
#ifndef Q_MO... |
99340ac90aef14f21f53e90f54345167a1cf5460 | c44fb0847f55d5a9a187e6e9518c1fa28957c480 | /AdvancedLib/CodecLib/G729A/G729AEncoder.cpp | 94fa1fe3e3d1934a01df1a8ab1c31fbdbac3216d | [] | no_license | Spritutu/hiquotion_cpp | 54567d5d0e62c36415d94f851ef9631932480e33 | 39e35053f979f7b613075c6a582fe58333c95dff | refs/heads/master | 2022-03-29T13:08:54.752069 | 2020-01-21T05:00:19 | 2020-01-21T05:00:19 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 3,241 | cpp | G729AEncoder.cpp | #include "stdafx.h"
#include "G729AEncoder.h"
CG729AEncoder::CG729AEncoder(void)
{
srcLen=L_FRAME*sizeof(Word16);
dstLen=SERIAL_SIZE; //*sizeof(Word16);
init();
}
CG729AEncoder::~CG729AEncoder(void)
{
}
void CG729AEncoder::init()
{
/*--------------------------------------------------------------------------*
* ... |
4b0e500f899332f338ce0b9c2a59be4977fcd341 | f7d6bd56dd9bbbf5ecf77728bd9a42921c9f2dd9 | /Random.cpp | ff35e82acfe7288d512aac9e141467985c2fb8c8 | [] | no_license | kernalphage/gl_play | 4b7506d4523408e723c1e790120f5f813b4fbb63 | 90dd7e6149de534eb97cab860489925ed01fbcda | refs/heads/master | 2021-04-27T19:55:34.116629 | 2019-05-06T15:54:00 | 2019-05-06T15:55:26 | 122,366,560 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 182 | cpp | Random.cpp | #include "Random.hpp"
std::default_random_engine Random::generator;
std::uniform_real_distribution<float> Random::distribution;
std::normal_distribution<float> Random::gauss_dist; |
b6f5ec1faaee3f9205255c746987f81523a40513 | ddd288fbef7dc9e86dae4c1d236da631f8407b3b | /CGP600 AE2/Camera.cpp | 680d90f56e2df27ef180f96dd6305837e918eba6 | [] | no_license | JamesSkett/Advanced-Games-Programming | 752f75575f787cb1412b3ed2dfad68c4884b2ef0 | b3b72e922b95a91bfd6c89e3695f1ac97994d1a6 | refs/heads/master | 2021-09-03T04:32:22.330551 | 2018-01-05T15:28:16 | 2018-01-05T15:28:16 | 108,906,605 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,253 | cpp | Camera.cpp | #include "Camera.h"
#include <windows.h>
#include <stdio.h>
#include <math.h>
Camera::Camera(float x, float y, float z, float rotation)
{
m_x = x;
m_y = y;
m_z = z;
m_camera_rotation = rotation;
m_dx = sinf(XMConvertToRadians(m_camera_rotation));
m_dz = cosf(XMConvertToRadians(m_camera_rotation))... |
93b557b671f5767ae754f744f88a684301aab6ad | 6c489d291b99860097eb1316be00ce1d23d41507 | /Lecture28/firstUniqueCharacter.cpp | 38db9e582b21d7b1687c54fa5a5dc7bcdd99ddfe | [] | no_license | sanjeetboora/CppLiveAugust2020 | 15bd83fd188a8965a38ff223fda73350fab6c0d8 | 3cb7375549222e5374bbd0afacde59108a10618f | refs/heads/master | 2023-01-23T22:42:44.471791 | 2020-12-05T21:43:16 | 2020-12-05T21:43:16 | 290,770,574 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 599 | cpp | firstUniqueCharacter.cpp | /* Problem - */
/* By Sanjeet Boora */
#include<bits/stdc++.h>
using namespace std;
void firstUniqueChar(string str) {
int freq[26] = {0};
queue<char> q;
for (int i = 0; i < str.length(); ++i)
{
char ch = str[i];
freq[ch - 'a']++; //update freq of curr char
if (freq[ch - 'a'] > 1) { //repeated char
whil... |
99c4948504acd62a8d91a79f1871c4bc7a37b033 | ab64c72b421125590a9eb9449d678d7db4f7610a | /Hieroglyph3/Source/Application/RenderApplication.h | 91afce6bca3786519de7a6a7c53dfaefeb4bc019 | [
"MIT"
] | permissive | xzwang2005/DX11_tutorials_with_hieroglyph3 | 03220106c9d762bfccdbf098c42821bf25bb2b46 | 611e273dafe099875e86222e75420920ca2c49bf | refs/heads/master | 2020-05-17T13:44:24.834766 | 2018-03-22T11:03:50 | 2018-03-22T11:03:50 | 28,190,906 | 5 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 2,259 | h | RenderApplication.h | //--------------------------------------------------------------------------------
// This file is a portion of the Hieroglyph 3 Rendering Engine. It is distributed
// under the MIT License, available in the root of this distribution and
// at the following URL:
//
// http://www.opensource.org/licenses/mit-license.php... |
5ff004bf58c3eb776535858aaf2d56c5c2c72f69 | 657074186b970c9af8a59a7b8d8ab4eb3ed993a6 | /dcs/uiDCS/ui/transmit.h | 9b8e6bcc18ea91df9ce2418eb816a4f32d1761bb | [] | no_license | FedorGurin/UiGenDCS | f2650e2cb87cb887efeb3985ef524388750da284 | 4d43258600a43b01e1d0f53b6f460bc023d7e57a | refs/heads/master | 2021-06-27T12:30:49.902370 | 2020-11-22T13:09:07 | 2020-11-22T13:09:07 | 34,628,665 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,853 | h | transmit.h | //! Класс для приема/отправки данных
//!
#ifndef CL_TRANSMIT_H
#define CL_TRANSMIT_H
#include <QUdpSocket>
#include <QDataStream>
#include "../NetworkCommunication/cl_NetworkCommunication.h"
#include "SettingUI.h"
class Transmit:public QObject
{
Q_OBJECT
public:
Transmit(NetworkCommunication *networkCommunic... |
5399995b736bc365a09d5817e46edab5114d683a | 1f54d4dee97fb7257af3f42fe341f87dc29e9cd4 | /reactor/src/reactor/network/resolve.hh | b9f590cb2209c7c90a7b207c8253832283ac6d54 | [
"Apache-2.0"
] | permissive | LongJohnCoder/elle | b7e677e4808d924193f8ae6f1c9a68b602250f06 | e0a30ea44d42fa35ffe42dc4581a7437919e21e9 | refs/heads/master | 2021-06-13T20:36:20.894438 | 2017-02-21T11:33:56 | 2017-02-21T11:34:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 502 | hh | resolve.hh | #ifndef INFINIT_REACTOR_NETWORK_RESOLVE_HH
# define INFINIT_REACTOR_NETWORK_RESOLVE_HH
# include <boost/asio.hpp>
namespace reactor
{
namespace network
{
boost::asio::ip::tcp::endpoint
resolve_tcp(const std::string& hostname,
const std::string& service,
bool ipv4_only = tru... |
6807c04dceb382e077a09424bef43d14cd9ba376 | 480f4ae475655631dac33a2d48e24e9fbc960d63 | /src/GLMesh.h | 49d4cbf350b37c15e1b11c8c481f851fc58fa43f | [] | no_license | sunverwerth/chunky | c4778f79ddf5f4d538b2d7d693c4d7363a2cb1fb | 8fec542260eafcb6a5adffd9c18cd6686be551e8 | refs/heads/master | 2020-04-21T09:46:21.027792 | 2019-02-07T16:56:01 | 2019-02-07T16:56:01 | 169,462,281 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,833 | h | GLMesh.h | #ifndef GLMesh_H
#define GLMesh_H
#include "GLVertexArray.h"
#include "GLElementBuffer.h"
#include <vector>
class GLMesh {
public:
struct Element {
unsigned int count;
unsigned int type;
size_t size;
};
bool useIndices = true;
enum class PrimitiveType {
TRIANGLES,
LINES
} primitiv... |
0535589800787964fbb4fea1313346229cf24f0a | 5f5e6147b8067220c9476c7d93cd91c2f88ab3f7 | /improve/4_templateClass_seg.h | b33404213abcf0a27b5a8067765a09f2bdab2141 | [] | no_license | fengxuewei-dev/C-plus-plus-Learning | df3939b89a53f527f02db2f10dd667ab73cab5b9 | fc643720bed42d966618bf395a6989c558866929 | refs/heads/main | 2023-05-06T01:10:36.842523 | 2021-05-04T15:56:09 | 2021-05-04T15:56:09 | 355,407,410 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 242 | h | 4_templateClass_seg.h | #pragma once
#include <iostream>
using namespace std;
template<class T>
class Person{
public:
Person(T age);
void show();
static int a;
private:
T mAge;
};
template<class T> int Person<T>::a = 0;
|
2fe7b6f7449888ebb39f0d4646708c6739fdaf1f | 577585cca6375b96d031f92732b186ae8779f0f4 | /EndmillRender/millerrender~.cpp | dff00fb93a20d07602410d35f47ad4477b73fb9a | [] | no_license | kvzhao/skyLovesCAM_OpenGL33 | 3c5862818f8f5d2711f9ee406f1ddf652283864f | 8b8097ad3b290ade6215a2a8621c3ae055a0ecd3 | refs/heads/master | 2020-05-30T02:52:01.565780 | 2014-06-16T06:46:39 | 2014-06-16T06:46:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 31,298 | cpp | millerrender~.cpp | #include "millerrender.hpp"
MillerRender::MillerRender()
{
gLookAtOther = true;
gPosition1 = vec3(-1.5f, 0.0f, 0.0f);
// gOrientation1;
// Initialise GLFW
if( !glfwInit() )
{
fprintf( stderr, "Failed to initialize GLFW\n" );
//return -1;exit
}
glfwW... |
008e3170a9149d4827cdc0495299caed768166f5 | 38896951aea62f5b87fcb236c149647513f1889c | /apps/cloud_composer/tools/organized_segmentation.cpp | 47d7430fad0e429ecec598ecabb550a701e0cc45 | [
"BSD-3-Clause"
] | permissive | PointCloudLibrary/pcl | 243714ed366a277f60a8097e133e195f3b91321c | f2492bd65cb1e9c48a60f5e27296e25e1835169a | refs/heads/master | 2023-09-04T17:55:05.319149 | 2023-09-04T07:40:09 | 2023-09-04T07:40:09 | 8,162,615 | 9,065 | 4,836 | NOASSERTION | 2023-09-14T19:47:04 | 2013-02-12T16:40:25 | C++ | UTF-8 | C++ | false | false | 2,260 | cpp | organized_segmentation.cpp | #include <pcl/apps/cloud_composer/tools/organized_segmentation.h>
#include <pcl/apps/cloud_composer/items/cloud_item.h>
#include <pcl/point_types.h>
#include <pcl/filters/extract_indices.h>
#include <pcl/kdtree/kdtree.h>
#include <pcl/segmentation/extract_clusters.h>
#include <pcl/apps/cloud_composer/tools/impl/orga... |
8d9db92de59d81bb05ce98c2e71c5a35353aa69a | 06cc6e99ee1d0a6ad120763ad004c38d757b77cd | /Uva/10539.cpp | 04b105a3006edc5b24d0abc520515b16867d453c | [] | no_license | MaicolGomez/ACM | 0eddec0ba8325c6bdc07721acc57a361c03c4588 | ff23b2c24daa5df1cc864b134886ff81a6d488c7 | refs/heads/master | 2020-03-06T20:57:14.628666 | 2018-03-28T01:46:27 | 2018-03-28T01:51:08 | 127,066,787 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,366 | cpp | 10539.cpp | #include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<climits>
#include<set>
#include<deque>
#include<queue>
#include<map>
#include<climits>
#include<string>
#include<stack>
#include<sstream>
using namespace std;
#define pi (2.0*acos(0.0))
#define eps 1e-6
#... |
2d65c4bbf84352e0469c25d8a00d0fce35c188ca | cb03501a58fdfd38bb32c3c6655f30294c026a0f | /Machines/JoystickMachine.hpp | 4a4c754dcf6b7b3cff419fecb5b879b8e2b6f68c | [
"MIT"
] | permissive | TomHarte/CLK | 6f19e56cccb05bf8680bb875d8df161e92bad6cb | 3e666a08ae547fd9c8787af07b08b3afb53eff61 | refs/heads/master | 2023-09-01T04:26:12.421586 | 2023-08-30T01:24:04 | 2023-08-30T01:24:04 | 39,225,788 | 850 | 51 | MIT | 2023-09-10T22:08:12 | 2015-07-16T23:46:52 | C++ | UTF-8 | C++ | false | false | 442 | hpp | JoystickMachine.hpp | //
// JoystickMachine.hpp
// Clock Signal
//
// Created by Thomas Harte on 14/10/2017.
// Copyright 2017 Thomas Harte. All rights reserved.
//
#ifndef JoystickMachine_hpp
#define JoystickMachine_hpp
#include "../Inputs/Joystick.hpp"
#include <vector>
namespace MachineTypes {
class JoystickMachine {
public:
v... |
c433f090cadf020c1a5bf4078fd8744a34ae5c8d | e6dfab2339ae9ec35bac1a8029bde39c0cc80132 | /cppServer/base/CountDownLatch.h | 8251e1f474f66367631b122a51893f334dc755d2 | [
"MIT"
] | permissive | dalenWW/cppServer | 5945f038f69480f51da98c34f10feb62ff4caf7e | 2e1f773e78fe4a146434a212dadb6f37c2c77a60 | refs/heads/master | 2020-07-08T21:48:33.234148 | 2019-08-22T12:19:19 | 2019-08-22T12:19:19 | 203,760,000 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 277 | h | CountDownLatch.h | #pragma once
#include"Condition.h"
#include"noncopyable.h"
#include"MutexLock.h"
class CountDownLatch:noncopyable
{
public:
explicit CountDownLatch(int count);
void wait();
void countDown();
private:
MutexLock mutex_;
Condition cond_;
int count_;
}; |
eedb44518b0d9fa31cef1ea289639307da70f231 | dd755386d122ff291b3345b33374b2d4ed0c13d1 | /source/examples/demo-stages-plugins/MultiFrameRenderingPipeline.h | e9b5240c489f20cbc2162a0347e7232d864c75be | [
"MIT"
] | permissive | cginternals/gloperate | 2526b0ac354d114347f64d06646a64e149ebf1d5 | 376f5f37c81fabcb39b704bf3d7e42880ac19837 | refs/heads/master | 2022-06-06T05:44:12.532420 | 2022-06-03T11:36:36 | 2022-06-03T11:36:36 | 23,700,348 | 35 | 21 | MIT | 2022-06-03T11:32:39 | 2014-09-05T11:16:49 | C++ | UTF-8 | C++ | false | false | 6,176 | h | MultiFrameRenderingPipeline.h |
#pragma once
#include <cppexpose/plugin/plugin_api.h>
#include <gloperate/gloperate-version.h>
#include <gloperate/pipeline/Pipeline.h>
#include <gloperate/stages/interfaces/CanvasInterface.h>
namespace globjects
{
class NamedString;
}
namespace gloperate
{
class Quad;
class Camera;
class Textu... |
d40dae1d9bed34b45790950d73e210922b257966 | 45e0fbd9a9dbcdd4fbe6aaa2fdb2aed296f81e33 | /FindSecret/Classes/Native/mscorlib_System_IO_BinaryReader2428077293.h | 21f22129ed07567972cf13ef62c1b51050e2ca6d | [
"MIT"
] | permissive | GodIsWord/NewFindSecret | d4a5d2d810ee1f9d6b3bc91168895cc808bac817 | 4f98f316d29936380f9665d6a6d89962d9ee5478 | refs/heads/master | 2020-03-24T09:54:50.239014 | 2018-10-27T05:22:11 | 2018-10-27T05:22:11 | 142,641,511 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,922 | h | mscorlib_System_IO_BinaryReader2428077293.h | #pragma once
#include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
#include "mscorlib_System_Object3080106164.h"
// System.IO.Stream
struct Stream_t1273022909;
// System.Text.Encoding
struct Encoding_t1523322056;
// System.Byte[]
st... |
38a121275450a04d53b2b456e4d8152d7c57e477 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5658571765186560_1/C++/pranavPrakash/main.cpp | c5aa9da98d2b63998ad15aea6d95543d808c4c1b | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 1,515 | cpp | main.cpp | //
// main.cpp
// Codejam D
//
// Created by Pranav Prakash on 4/11/15.
// Copyright (gridC) 2015 Pranav Prakash. All rights reserved.
//
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[])
{
ifstream fin("input.txt");
ofstream fout("output... |
4a30c3e47e123f23d855c017e493f2603133f871 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/CMake/CMake-gumtree/Kitware_CMake_repos_basic_block_block_17661.cpp | 9a402eaf01eb823630385d2243868bdde122f24c | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 425 | cpp | Kitware_CMake_repos_basic_block_block_17661.cpp | {
case ENCRYPTION_TRADITIONAL:
additional_size = TRAD_HEADER_SIZE;
version_needed = 20;
break;
case ENCRYPTION_WINZIP_AES128:
additional_size = WINZIP_AES128_HEADER_SIZE
+ AUTH_CODE_SIZE;
version_needed = 20;
break;
case ENCRYPTION_WINZIP_AES256:
additional_size = WINZIP_AES... |
50599112362b2d7aca43e6da3e7e55a451cbeec6 | dfb55f89c667b28b65f05394ba5a93a3ce55915a | /P3/number_prod.cc | 7f9fa2106e72db441ed5a092efb82fcdaef7f925 | [] | no_license | davidas1798/CyA | edde41c3cca22bac2bd758133c78576eb903d7c4 | a87d233ccbe8b23447be11ed4ca28f99f60a4709 | refs/heads/main | 2023-01-22T09:08:56.290479 | 2020-12-02T15:05:58 | 2020-12-02T15:05:58 | 303,405,134 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 634 | cc | number_prod.cc | #include "number_prod.h"
NumberProd::NumberProd(int a, int b):
operand_a(a),
operand_b(b),
number_(a * b) {}
int NumberProd::GetNumber()
{
return number_;
}
bool NumberProd::operator<(const NumberProd& other) const
{
if(number_ == other.number_)
{
if((operand_a + operand_b) < (other.operand_a + other... |
0bcceb82dee335f330ab93c477755653918d3c67 | fec89b0bcce87216ef9fe55d8b6f1799a6ef9be8 | /NavMesh.cpp | 81dfbd6eac717f1b4eb399da4cee62d9b2e4ce23 | [] | no_license | samengEljest/AI-pathfinding | b76191d8868587ae3e41aaf594ffa997f0f085ff | b5c3a96d2c7f05a1a4ec522947086f0d30206b06 | refs/heads/master | 2021-01-22T02:52:48.371491 | 2017-09-07T16:18:47 | 2017-09-07T16:18:47 | 102,255,039 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,897 | cpp | NavMesh.cpp | //! NavMesh.cpp
#include "NavMesh.h"
#include "Tile.h"
#include <fstream>
#include <iostream>
using namespace std;
NavMesh::NavMesh()
{
}
NavMesh::~NavMesh()
{}
bool NavMesh::ReadMap(std::string s)
{
int y = 0;
int x = 0;
std::vector<char> list;
fstream loadFile;
loadFile.open (s, ifst... |
071dea0e401dc78bd16de5e7ee0d4a113f906127 | 12b0490737789f12296177bb8642c32f1158ebcb | /DirectX/cpptest.cpp/cpptest.cpp | 6158ce3ab688d5fd510ce4d2066ddbef3c820da8 | [] | no_license | dinodragon/mygooglecode | ef2775f09bed4fd583eec4524e3675bca150e5e3 | 1a5525ec6ef1b88f94af55a101d520e1aab83100 | refs/heads/master | 2021-01-10T12:05:09.301836 | 2013-03-25T04:02:32 | 2013-03-25T04:02:32 | 36,418,668 | 2 | 1 | null | null | null | null | GB18030 | C++ | false | false | 770 | cpp | cpptest.cpp | #include <iostream>
#include <math.h>
using namespace std;
typedef struct
{
int x;
int y;
} POINT;
#define mid(a,b) ((a)+(b))/(2.0f)
void main()
{
POINT b = {100,0}, c = {100,100}; //右下角
POINT p = {80,100}; //控制点
POINT x1,x2,x3;
float k = (c.y-p.y)/float(c.x - p.x); //对称轴的斜率
//对称轴方程... |
207dff563865dc69b197b623566ca460008f9d01 | 204cd8e362c7c355eb2b89cb43cdea9038fafcc0 | /CH04/Ex01/Ex01/Ex01.cpp | 10ca6bf01f24fd9c3de5f9f0c12ee738aa35da4d | [] | no_license | zajac-mc/Stroustrup | 934f7c739d5d9031c217daade1ca6c4e451ba8cb | e0f182058735cd43199bf0c5ead2b29d6230b165 | refs/heads/master | 2021-04-26T23:11:50.876057 | 2019-04-10T16:25:33 | 2019-04-10T16:25:33 | 123,944,914 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 874 | cpp | Ex01.cpp | // Marcin Zajac 02 03 2018
// Stroustrup Rozdzial 04 Ex 01-05
#include "../../../std_lib_facilities.h"
int main()
{
double a = 0;
double b = 0;
char znak_konca = '|';
char ch = ' ';
while (ch != znak_konca)
{
cout << "Podaj dwie liczby: ";
cin >> a >> b;
cout << "Podales " << a << " i " << b << endl;
if... |
059f9c5fe9fd3b5e5359191aaa50b5a1b6f8fee6 | 5e8d200078e64b97e3bbd1e61f83cb5bae99ab6e | /main/source/src/apps/benchmark/performance/DatabaseIO.bench.hh | f023b2224962ced11d0079af9b6d3e99ac23baa6 | [] | no_license | MedicaicloudLink/Rosetta | 3ee2d79d48b31bd8ca898036ad32fe910c9a7a28 | 01affdf77abb773ed375b83cdbbf58439edd8719 | refs/heads/master | 2020-12-07T17:52:01.350906 | 2020-01-10T08:24:09 | 2020-01-10T08:24:09 | 232,757,729 | 2 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 1,780 | hh | DatabaseIO.bench.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... |
5e46b3fb6110b6c041c58846b4ee870da0c65d16 | e0a15d6a8c6c16b3732063dedc7b38b82ec3074d | /C++/taktak.cpp | 554b72077bc102e0092751cd8af5a37222b71f89 | [] | no_license | Dharana23/Competitive-Coding | 3ccce7071015d4bd20965668fe024dbcc2818343 | 3760ffc95547d2331ffab5f4c8eae9985029067a | refs/heads/master | 2022-10-11T16:40:44.033279 | 2020-06-12T09:55:15 | 2020-06-12T09:55:15 | 255,526,714 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 443 | cpp | taktak.cpp | #include<bits/stdc++.h>
using namespace std;
bool canDistributeEqually(int fruits) {
if((fruits % 11) == 1) {
return true;
}
else {
return false;
}
}
int main() {
freopen("taktakin.txt", "r", stdin);
freopen("taktakout.txt", "w", stdout);
int fruits;
cin >> fruits;
int fullMoons = 0;
while(!canDistrib... |
4592ae184327244060ac15b7a42cc1816280c775 | 80a6dcd8e0e55b1ec225e4e82d8b1bed100fdcd5 | /Demux/20.03.22/34.cpp | 0a0e38fae6f0c9c72478052d3857630874be88cd | [] | no_license | arnabs542/competitive-programming-1 | 58b54f54cb0b009f1dac600ca1bac5a4c1d7a523 | 3fa3a62277e5cd8a94d1baebb9ac26fe89211da3 | refs/heads/master | 2023-08-14T23:53:22.941834 | 2021-10-14T11:26:21 | 2021-10-14T11:26:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,215 | cpp | 34.cpp | // https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
vector<int> v;
int lb, ub;
if(!nums.size()){
v.push_back(-1);
v.push_back(-1);
... |
f5854c35c449b3422f3718ce706ca79513508bbd | 36bb83633ee4deed991eadd975c36a1ba9605096 | /generichid/testinputvalue.cpp | 869e061fc1c8eca612c1f346c1afea14d03c547c | [] | no_license | ftkalcevic/GenericHID | 1b07a26ecfb47f761164f124626baa80bc6f7d1b | 07c192710263871a3416d2e3e8bf7443d1b0e22f | refs/heads/master | 2021-01-10T20:54:01.824366 | 2019-10-23T10:01:04 | 2019-10-23T10:01:04 | 34,788,505 | 7 | 4 | null | 2015-08-05T20:14:35 | 2015-04-29T10:50:06 | C++ | UTF-8 | C++ | false | false | 2,366 | cpp | testinputvalue.cpp | // generichid, DIY HID device
// Copyright (C) 2009, Frank Tkalcevic, www.franksworkshop.com
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// any later... |
7a36db649651e9a9b169244008a447dd6fd7fbb8 | 654e42a8405d0ee09910cf64dca8427d5ce7c680 | /modules/JRPowObj.h | 45ed269ce2d223da28722a04619f189a081aba41 | [] | no_license | neattools/neattools | bbd94d46c4e5aeb1ab524bf63a9b1ac623e7fd58 | ac63c05ba1d575797303e48558fa2383a5e8ccf7 | refs/heads/master | 2020-05-29T17:34:04.002088 | 2018-03-01T15:59:04 | 2018-03-01T15:59:04 | 17,801,058 | 0 | 0 | null | 2018-03-01T15:59:05 | 2014-03-16T14:29:07 | C++ | UTF-8 | C++ | false | false | 325 | h | JRPowObj.h | #if !defined( _JRPowObj_h )
#define _JRPowObj_h
#include "JRDivideObj.h"
class JRPowObj : public JRDivideObj {
public:
virtual const char* className() const;
virtual JObject* clone() const;
virtual void draw(JGraphics g, int x, int y, int w, int h);
virtual void engine(int n, JLinkObj& link);
};
#e... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.