blob_id stringlengths 40 40 | content_id stringlengths 40 40 | repo_name stringlengths 5 114 | path stringlengths 5 318 | language stringclasses 5
values | extension stringclasses 12
values | length_bytes int64 200 200k | license_type stringclasses 2
values | content stringlengths 143 200k |
|---|---|---|---|---|---|---|---|---|
7713f28f9d6578f8ae08fca86dc3693ab5a9c168 | dfdebd9b8becc74292ce7e3d517487f0dbd68e38 | wuwenfeng09/aliyun-openapi-cpp-sdk | /alidns/src/model/DescribeDomainNsRequest.cc | C++ | cc | 1,935 | permissive | /*
* Copyright 2009-2017 Alibaba Cloud 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... |
fb8bec750ae37511af190b64fe4fc7fde80e4d85 | bab43249321abb0a15cdc8947709bd66c61c70f3 | jpiccoli/Cpp_Weekly | /Num43_stack_elision.cpp | C++ | cpp | 585 | no_license | #include <type_traits>
#include <numeric>
#include <iterator>
#include <algorithm>
#include <iostream>
// clang eliminates stack array
// gcc inline capability not as good
template<typename ... T>
int sum( T ... t )
{
std::common_type_t<T...> array[sizeof...(T)]{t...};
return std::accumulate(std::begin(array), std... |
28871ad3f9e5afb31295047a7d5f9cdd6ed3a2da | 2bd8504faba7528c44eeff9ca9a3cf43dda769f9 | mayant15/WallRunBoi | /Source/WallRunBoi/WallRunBoiCharacter.cpp | C++ | cpp | 6,426 | no_license | // Copyright 1998-2019 Epic Games, Inc. All Rights Reserved.
#include "WallRunBoiCharacter.h"
#include "WallRunBoiProjectile.h"
#include "Animation/AnimInstance.h"
#include "Camera/CameraComponent.h"
#include "Components/CapsuleComponent.h"
#include "Components/InputComponent.h"
#include "GameFramework/InputSettings.h... |
b8533c81250d0a1ffd4da88a1e5f6d9f43c7d608 | cfa1596ad76626cf249015aa4c76a7c3157b5dac | meniossin/src | /ash/wayland/wayland_server_controller.cc | C++ | cc | 2,740 | permissive | // Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/wayland/wayland_server_controller.h"
#include <memory>
#include "ash/public/cpp/ash_switches.h"
#include "ash/public/cpp/config.h"
#includ... |
91dc599305ae76c4f8dd3d8f3943a883d4156280 | cc4c2dabd399ec37876d4e2dd7a653a9b191a4b8 | gem-sw/cmssw | /RecoPixelVertexing/PixelLowPtUtilities/src/TrackCleaner.cc | C++ | cc | 10,628 | no_license | #include "RecoPixelVertexing/PixelLowPtUtilities/interface/TrackCleaner.h"
#include "RecoPixelVertexing/PixelLowPtUtilities/interface/HitInfo.h"
#include "FWCore/MessageLogger/interface/MessageLogger.h"
#include "DataFormats/TrackingRecHit/interface/TrackingRecHit.h"
#include "DataFormats/TrackReco/interface/Track.h"... |
7781b358391fd36ecda371f11f59175552097ddc | 8790e2e86cdf9204dc556cbab2bd394eff42ce22 | kss-upb/POSSIM | /src/household/Household.cpp | C++ | cpp | 3,804 | no_license | /*
Software License Agreement (BSD License)
Copyright (c) 2013, Julian de Hoog <julian@dehoog.ca>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the abov... |
d777461f63a115184e61fe6736124a1c1e7fa449 | 5c7594c76703c241d3a5408bee86139d993696db | eirinaga/APREM2-2019-2 | /Atividades/Yasmin Sena da Silva/lista2/PROPOSTO10.cpp.cpp | C++ | cpp | 1,374 | no_license | /**********************************************************
- Autor: Yasmin Sena
- Descrição: Preço do carro
**********************************************************/
#include <iostream>
#include <locale.h>
#include <cstdlib>
using namespace std;
int main()
{
//Declaração de variáveis
float... |
94157bfb48c60626d451a6cc7d47caac86741486 | dce2cbbf639315b83bcbf945a9b84218d13adf47 | stjordanis/rmm | /tests/device_uvector_tests.cpp | C++ | cpp | 6,363 | permissive |
/*
* Copyright (c) 2020-2021, NVIDIA 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.org/licenses/LICENSE-2.0
*
* Unless required by applicabl... |
3dee6a8dd2b33b1cf412c4b962f62d3bd19bdf13 | 2e6b97c84c2f18393e1710b68a133bc90da414a8 | blakdragan7/ZoranEngine | /ZoranEngine/Core/3D/Camera3D.cpp | C++ | cpp | 1,864 | no_license | #include "stdafx.h"
#include "Camera3D.h"
#include "Named3DSceneObject.h"
Camera3D::Camera3D(std::string name, Vec3D position, Vec3D scale, Vec3D rotation)
{
sceneObject = new Named3DSceneObject(name);
sceneObject->SetPosition(position);
sceneObject->SetScale(scale);
sceneObject->SetRotation(rotation);
... |
089a69540447ee1f590d87a6187d37a00f988ff1 | 3158acf9dd7812385f2459bdb24097e3a0a10330 | AlbertJean/framework | /vfxGraph-examples/000-minimal.cpp | C++ | cpp | 2,187 | no_license | /*
Copyright (C) 2017 Marcel Smit
marcel303@gmail.com
https://www.facebook.com/marcel.smit981
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without
restriction, including without limitati... |
eae8582d7eacd70866abaa77b31ac88f636aca91 | e04f5b6f3b7c60480845cb64283bca9b6c635736 | zhaonaiy/MaxDB_GPL_Releases | /7.6.00.32/V76_00_32/MaxDB_ORG/sys/src/SAPDB/Logging/Log_QueueRingBuffer.cpp | C++ | cpp | 3,389 | no_license | /*!*****************************************************************************
module: Log_QueueRingBuffer.cpp
------------------------------------------------------------------------------
author : TillL
responsible : UweH
special area: Logging
description: see .hpp
see also:
-----... |
31344de5247f492716681fbfe52fdbb8828aee8e | 4faa1ffd0cdc3041ec1cff02b5f5a812191c9e82 | vslavik/poedit | /deps/boost/libs/align/test/align_up_test.cpp | C++ | cpp | 865 | permissive | /*
Copyright 2015 Glen Joseph Fernandes
(glenjofe@gmail.com)
Distributed under the Boost Software License, Version 1.0.
(http://www.boost.org/LICENSE_1_0.txt)
*/
#include <boost/align/align_up.hpp>
#include <boost/align/is_aligned.hpp>
#include <boost/core/lightweight_test.hpp>
template<std::size_t Alignment>
void te... |
a66fe78a86b2a29bee787f9acbfe634a8cab74ea | d57193d69d0b62f7b6d2a0b5695b9aaa3befad8a | Ant4g0n1st/problem-solving | /CodeChef/FLIPCOIN/SegmentTree.cpp | C++ | cpp | 4,345 | no_license | #include <type_traits>
#include <iostream>
#include <memory>
namespace Types
{
using Int = unsigned int;
};
using namespace Types;
namespace DataStructures
{
template <typename T>
class SegmentTree
{
static_assert(std::is_integral<T>::value);
public:
SegmentTree(const Int &, c... |
6b29f6ff08e23688b19956b56768d5b9e71a38db | 16d8bce3d62be54256c73a6ed66bc5b1bf3f01fa | bunjj/Algorithms-Lab | /w4/ant/algorithm.cpp | C++ | cpp | 2,119 | no_license | #include <limits>
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
// BGL includes
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/kruskal_min_spanning_tree.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
typedef boost::adjacency_... |
28b04d655e05aa89ec93e9edb2bd0e25cefb6fdd | 2d3d107cc82d03fa3a5fbd20863a00440f5fbefc | sup4r/HD_Player_3D | /src/264/decoder/H264AVCDecoderTest.cpp | C++ | cpp | 17,241 | no_license | /*
********************************************************************************
NOTE - One of the two copyright statements below may be chosen
that applies for the software.
********************************************************************************
This software module was originally develop... |
43a5a7c70d93a3219cd56450946abb751b53dbaa | b44ce7e95496e238b7f77d2d9424b77dec281400 | bigdoods/OpenInfraPlatform | /IfcRoad/src/OpenInfraPlatform/IfcRoad/entity/IfcOutlet.cpp | C++ | cpp | 5,223 | no_license | /*! \verbatim
* \copyright Copyright (c) 2015 Julian Amann. All rights reserved.
* \author Julian Amann <julian.amann@tum.de> (https://www.cms.bgu.tum.de/en/team/amann)
* \brief This file is part of the OpenInfraPlatform.
* \endverbatim
*/
#include <sstream>
#include <limits>
#include "OpenInfraPlatform/IfcRoad... |
deac3d50e46fca136dd761664fd2131c007eada5 | 641b881cb6773824ca5c0f90f8f0837c9f9355eb | jocaro97/ED | /reto/ejercicios/ejercicio4.cpp | C++ | cpp | 2,102 | no_license | /*EJERCICIO 4:
Diseñar una función booleana que devuelva true si en una
expresión matemática, los paréntesis, corchetes y llaves, están
colocados de forma correcta. (a cada símbolo abierto le
correspnde uno cerrado del mismo tipo).
*/
#include <iostream>
#include <string>
bool EsFuncionMatematica(std::string cad){
... |
10ff6962f58c8e2922d0a1caa67a6a9cb3cc4561 | 96c066f31c85d23446705ab766c2304cd7246a8c | zhipingu/algorithm | /Euler_circuit.cpp | C++ | cpp | 3,052 | no_license | // Euler_circuit.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include<stdlib.h>
#define Vertexnum 14
typedef struct graph* pgraph;
typedef int disjset[Vertexnum];
//static char visited[Vertexnum] = {0};
static int edgevisited= 0;
struct graph
{
int vertexnum;
int edgenum;
in... |
cb8082e512c8dcf0c5574a5d290895f0767f3d4b | 419baafb404d1f4929bd89c50930408484c554de | karunmatharu/Android-4.4-Pay-by-Data | /external/chromium_org/ash/system/locale/locale_notification_controller.cc | C++ | cc | 3,944 | permissive | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/system/locale/locale_notification_controller.h"
#include "ash/shell.h"
#include "ash/system/system_notifier.h"
#include "ash/system/tray/sy... |
0bb92184ecffc4e8a504e0a138a18cf6a3fd2456 | 1c69ec2b2d4408df96cd25bcacba22286abbe7f0 | EthanHu01/microsoft-ui-xaml | /dev/Scroller/OffsetsChange.cpp | C++ | cpp | 1,300 | permissive | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License. See LICENSE in the project root for license information.
#include "pch.h"
#include "common.h"
#include "TypeLogging.h"
#include "ScrollerTrace.h"
#include "OffsetsChange.h"
OffsetsChange::OffsetsChange(
double zoomedH... |
ff2518d2156d17c48cdf73938c33827de16a1234 | 18248daa076d59f31da2f048a30f7abc9082435e | AbhishekGhosh/mageck | /rra/src/fileio.cpp | C++ | cpp | 8,360 | no_license | //C++ functions
#include <string>
#include <vector>
#include <map>
#include <iostream>
#include <fstream>
using namespace std;
#include "fileio.h"
//split strings
int stringSplit(string str, string delim, vector<string> & v){
int start=0;
int pos=str.find_first_of(delim,start);
v.clear();
while(pos!=str.npos... |
0940e8a6ca70487ad89e91e160c49a576bea8db9 | 192357946c3a4e12a19ec07ae94c47f8a285e567 | amiryanj/cyrus_ssl | /server/planner/planning/station.cpp | C++ | cpp | 1,204 | no_license | #include "station.h"
#include <vector2d.h>
#include <generalmath.h>
void Station::operator =(const Station &other)
{
this->mPosition = other.mPosition;
this->mVelocity = other.mVelocity;
this->cost = other.cost;
}
bool Station::operator ==(const Station &other)
{
if(this->mPosition == other... |
0a720d55388da1e4948a7cfa5f4e271bbbf14eb7 | d06d6b59e757be4582c7200d627372ae831da08e | vlluvia/algorithm | /leetcode/[82]-删除排序链表中的重复元素 II.cpp | C++ | cpp | 857 | no_license | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
ListNode* dummy = new ListNode(-1);
dummy->next=head;
ListNode*... |
deaaa705d2e3be4c7ab6b4c075013b25fa582317 | ca2ce4802d6858bf2c6c73356aba3d72b830e92e | roussukke/Yorozuya | /library/ATF/CBitmapButton.hpp | C++ | hpp | 405 | permissive | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
#include <CBitmap.hpp>
#include <CButton.hpp>
START_ATF_NAMESPACE
struct CBitmapButton : CButton
{
CBitmap m_bitmap;
CBitmap m_bitmapSel;
... |
d37dcdf9849121ce30b31bc73894a81b8b26ec35 | 4906feb9aacd680b73bf1ba44595963e4fc33822 | syscoin/syscoin | /src/wallet/rpc/wallet.cpp | C++ | cpp | 41,505 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2022 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <core_io.h>
#include <key_io.h>
#include <rpc/server.h>
#include <rpc/util.h>... |
8ea6bd4ce1936a5408a10564f80a858ca80cdc12 | 1e05c75ddae1440184c476de045d35c7b7e97f36 | Shaxzy/strictlycode | /StrictlyCode_Legit/StrictlyCode/DrawManager.cpp | C++ | cpp | 7,390 | no_license | #include "DrawManager.h"
NSDK::Color enemyColor = NSDK::Color(255, 0, 0, 255);
NSDK::Color teamColor = NSDK::Color(0, 0, 255, 255);
NSDK::HFont DrawManager::hEspFont = 0;
NSDK::HFont DrawManager::hNotificationFont = 0;
NSDK::HFont DrawManager::hStrictlyFont = 0;
NSDK::HFont DrawManager::hAimwareFont = 0;
void DrawMan... |
1f1088fc8653f2916e1d73bd7b3df3e586cd0b4a | 4d63cfecb9c74c07a32fcbbd870a9a97f5538596 | Rayleigh0328/OJ | /leetcode/313.cpp | C++ | cpp | 691 | no_license | class Solution {
public:
int nthSuperUglyNumber(int n, vector<int>& p)
{
int len = p.size();
int * ind = new int [len];
for (int i=0;i<len;++i) ind[i] = 0;
int * que = new int [n];
que[0] = 1;
int pr = 1;
for (int i=1;i<n;++i)
... |
5c261e4fa6428a25acaba2f27b4dc65e9341bd28 | ad4dcd39fd1c2a7d2cc451b60badf2e11cfde224 | Kalit31/cp-playground | /LeetCode/leetcode-august-challenge/week2/Excel Sheet Column Number-math.cpp | C++ | cpp | 302 | no_license | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int titleToNumber(string s) {
int len = s.length();
long long int result = 0;
for (int i = 0; i < len; i++) {
result = result * 26 + s[i] - 'A' + 1;
}
return result;
}
}; |
30b449a024514a8c0a7b27d15f701ddce65c1d2a | 488728e1bf98dad545c053911ee0a9145b12050a | ahyangnb/engine | /impeller/aiks/aiks_unittests.cc | C++ | cc | 29,232 | permissive | // Copyright 2013 The Flutter Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <array>
#include <cmath>
#include <tuple>
#include "flutter/testing/testing.h"
#include "impeller/aiks/aiks_playground.h"
#include "impeller/aiks... |
fd9deec94b192072225728dc395cd782f2d1c4f3 | 3dfe8924cd2fbbc1b913d82e7a440012eb102a8d | Adam-Petersen/PokeAI-vba-m | /src/sdl/debugger.cpp | C++ | cpp | 82,283 | no_license | // VisualBoyAdvance - Nintendo Gameboy/GameboyAdvance (TM) emulator.
// Copyright (C) 1999-2003 Forgotten
// Copyright (C) 2005 Forgotten and the VBA development team
// 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
//... |
3f8f57a50e91c890abd2038b53e0c2079c6cf52c | 49cc9906ad4cd5b4d852d252be7cb700e13beae0 | wishihab/KelasAlgoritmaDasar | /ProyekTugasUjian2014/UASAKHIR.cpp | C++ | cpp | 1,193 | no_license | //TUGAS ARRAY
#include <iostream>
#include <conio.h>
#include <stdlib.h>
using namespace std;
main()
{
// system("color f4");//warna pada saat running
back:// checkpoint untuk mengembalikan proses ke awal
system("cls");// menghapus layar proses pengurutan sebelumnya
char x, z;
int a[10];// arr... |
20cd99d934c9ac8c2b94e98de803b0ce0a186148 | 8334a5869910d7e8f75c6c137d911a9bc02e80ae | nl2671488/LopezNicholas_CSC5_CIS5_Spring17 | /Projects/Project2/Project2_V3/main.cpp | C++ | cpp | 14,656 | no_license | /*
* File: main.cpp
* Author: Nicholas Lopez
* Created on May 16th, 2017, 10:30 AM
* Purpose: Battleship Project 2 Version 3
*/
//System Libraries Here
#include <iostream>
#include <fstream> //Reading and opening files
#include <string>
using namespace std;
//User Libraries Here
//Global Constants Only, No... |
54c55c338684480682defff8d5e93769371d7bb9 | 69f3b8a4cb22b93dd4d0ec9857d0a8dacfb58f1a | minkipro/DirectX11EngineMK | /DirectX11EngineMK/Graphics/GameObject3D.cpp | C++ | cpp | 2,237 | no_license | #include "GameObject3D.h"
void GameObject3D::SetLookAtPos(XMFLOAT3 lookAtPos)
{
//Verify that look at pos is not the same as cam pos. They cannot be the same as that wouldn't make sense and would result in undefined behavior.
if (lookAtPos.x == _pos.x && lookAtPos.y == _pos.y && lookAtPos.z == _pos.z)
return;
loo... |
da7f955a6ecaa84cb94b04e947d5722ad468c3b9 | 6d49f7ef695beb298cb63e3efb7d05a4128c2714 | ybouret/yocto | /src/yocto/tests/test-isqrt.cpp | C++ | cpp | 900 | no_license | #include "yocto/code/isqrt.hpp"
#include "yocto/utest/run.hpp"
#include "yocto/string/conv.hpp"
#include <cstdio>
using namespace yocto;
YOCTO_UNIT_TEST_IMPL(isqrt)
{
uint32_t n = 10;
if(argc>1)
{
n = strconv::to<size_t>(argv[1],"n");
}
std::cerr.flush();
static const uint... |
ef8cc80b73102233443afea6df0205abdc89e0d4 | a2526e4394dced2938e3d9af5972c9aebc68e305 | yubo56/su_self_study | /code/peuler/4.cpp | C++ | cpp | 1,322 | no_license | /**
* Largest palindrome that is the product of 2 3-digit numbers
*/
#include <cstdio>
#include <cmath>
/* int N_DIGITS = 2; /1* 2 digits => 9009 *1/ */
int N_DIGITS = 3;
int get_palindrome(int base)
{
/* assert: 10^N_DIGITS <= base < 10^(N_DIGITS + 1) */
int ret = 0;
for (int i = 0; i < N_DIGITS; i++)
... |
ef737626fa7ed13edee0029a1c4af12c910169fb | 045a6ba1fd6cc335569832c47d0e3cb9db15c6eb | Zaulao/PG-2018v1 | /alternative/ray.cpp | C++ | cpp | 714 | no_license | #pragma once
#include "Vec3.hpp"
#include <float.h>
class Ray{
private:
Vec3 <double> origin, direction;
public:
mutable double tmin = DBL_EPSILON, tmax = DBL_MAX;
Ray(Vec3 <double> &origin, Vec3 <double> &direction) {
this->origin = origin;
this... |
55a2b609d8882c82e29cef28350d22bad80834ca | dd9d780e8c24215e64c522911f76ebf81fe45110 | DinisSousa2003/PROG | /Exercícios/Ficha 4/4.2_Vectors.cpp | C++ | cpp | 1,675 | no_license | #include <iostream>
#include <vector>
#include <climits>
using namespace std;
void readVector(vector<int> &v){
bool cont = true;
int num, i = 0;
while(cont){
cout << "index" << i << "\t";
cin >> num;
if (cin.fail()){
if (cin.eof()){
cont = false;
... |
f525aa37f048ca2d68994e716ebfad289cce55bc | b91a7ad6f196c2c49d2fc6bfd10d7e2594f223f9 | DamieFC/chromium | /content/public/test/fake_download_item.cc | C++ | cc | 12,006 | permissive | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/public/test/fake_download_item.h"
#include "base/bind.h"
#include "base/callback.h"
#include "base/notreached.h"
#include "components/d... |
6fa1693c3fa89f053c2ec20e1af66ee80bf1a1b1 | 156d421ca827667c4d6acbbb393dcbb9f227ea1d | clasp-developers/clasp | /src/core/arguments.cc | C++ | cc | 3,635 | no_license | /*
File: arguments.cc
*/
/*
Copyright (c) 2014, Christian E. Schafmeister
CLASP is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version... |
d07df4eecccf15c2c63ff1ebcd84701b255e4d11 | 329c53f0927b5ef256e53c33c5de2b9c21333210 | esaule/par_graph_lib | /samples/coc.cpp | C++ | cpp | 1,887 | no_license | #include <iostream>
#include <sstream>
#include "depgraph.hpp"
//This is meant to be the chain on chain problem with dynamic programming. This is the right graph, thogh the code is clearly hacked up
void ChainOnChain(int N, int M) {
for (int n=0; n<=N; ++n) {
for (int m=1; m<=M; ++m) {
{ std::stringstre... |
50915b0b9a1b40b575df83aef8c44f26b436cc98 | 579148be017c226d6ad9c3cd803d22eed7346cc2 | wendajiang/leetcode | /cpp/525.contiguous-array.cpp | C++ | cpp | 1,408 | no_license | /*
* @lc app=leetcode id=525 lang=cpp
*
* [525] Contiguous Array
*
* https://leetcode.com/problems/contiguous-array/description/
*
* algorithms
* Medium (43.37%)
* Likes: 3138
* Dislikes: 151
* Total Accepted: 197.2K
* Total Submissions: 446.6K
* Testcase Example: '[0,1]'
*
* Given a binary array ... |
36c392227235d9da0396bb368fd9b99ee87df17c | c6c3d6f06ae8aed4f26f27898201da4de25f5266 | fredericrubio/2020 | /NewHorizons/Network/Inc/NHOHEMMessage.hpp | C++ | hpp | 1,811 | no_license | //
// HEM_Message.hpp
// ComLib
//
// Created by Frédéric Rubio on 13/10/2018.
// Copyright © 2018 Frédéric Rubio. All rights reserved.
//
#ifndef NHOHEMMessage_hpp
#define NHOHEMMessage_hpp
#include <stdio.h>
#include "NHOMessage.hpp"
#include "NHOHEMData.hpp"
class NHOHEMMessage : public NHOMessage {
publi... |
c2f0913bcfe94a3a32ab4cd83a7d34a838ce6d8b | 6aab550750fdee06ac6b27292f592690e60182d7 | Pavlograd/Indie-Studio | /includes/powerUps/FireFull.hpp | C++ | hpp | 661 | no_license | /*
** EPITECH PROJECT, 2020
** OOP_indie_studio_2019
** File description:
** FireFull
*/
#ifndef FIREFULL_HPP_
#define FIREFULL_HPP_
#include "IPowerUps.hpp"
class FireFull : public IPowerUps {
public:
explicit FireFull(irr::scene::ISceneManager *smgr, irr::core::vector3df const &pos);
~FireFull(... |
6b9fc1c683551a488d6872f84cef2d9a6ddd66fe | cffd8daa626462d0ab58f424f52f3a0b9d3316cf | N-911/snake | /app/src/menu.cpp | C++ | cpp | 4,000 | no_license | #include <SFML/Graphics/Sprite.hpp>
#include <SFML/Window.hpp>
#include <SFML/Graphics/Texture.hpp>
#include <SFML/Graphics/RectangleShape.hpp>
#include <SFML/Graphics/Text.hpp>
#include <SFML/Audio/Music.hpp>
#include <SFML/Graphics/Sprite.hpp>
#include <iostream>
#include <fstream>
#include "menu.h"
Menu ::Menu(sf::... |
e43e890591a6d224efef73f4a8829be9875b43cf | 7f145156e2b1752a6f69583619e11a88b9047ea7 | hajunsong/Controller | /RobotController3/src/controlmain_custom.cpp | C++ | cpp | 8,446 | no_license | #include "controlmain_custom.h"
#include "controlmain.h"
ControlMainCustom::ControlMainCustom(){
}
ControlMainCustom::~ControlMainCustom(){
}
void ControlMainCustom::robot_run(void *arg)
{
ControlMain* pThis = static_cast<ControlMain*>(arg);
RTIME now, previous;
previous = rt_timer_read();
pThis->dat... |
8445c27cb2abe2208c11fc703eb3c8e632a2b281 | 281702b03e3bc97a6c217e8ad0e1bc3ff2cb84ff | Le-Toc/JohnsCodeWorking | /GD4ClassCode/SettingsState.cpp | C++ | cpp | 3,351 | no_license | #include "SettingsState.hpp"
#include "Utility.hpp"
#include "ResourceHolder.hpp"
#include <SFML/Graphics/RenderWindow.hpp>
SettingsState::SettingsState(StateStack& stack, Context context)
: State(stack, context)
, mGUIContainer()
{
mBackgroundSprite.setTexture(context.textures->get(Textures::TitleScreen));
// ... |
8436822b7258687f12961d3663462426e562863d | a990933cf63971ef7eb164338d43d5415f869e48 | epfl-dias/proteus | /runtime/query-shaping/lib/scale-out-query-shaper.cpp | C++ | cpp | 4,472 | no_license | /*
Proteus -- High-performance query processing on heterogeneous hardware.
Copyright (c) 2020
Data Intensive Applications and Systems Laboratory (DIAS)
École Polytechnique Fédérale de Lausanne
All Rights Reserved.
Permission to u... |
935a5ae9390a9f2301b194946d9fbf77b4ebf57a | bc117ad5f8d9f65d6c7a88e24d6869b379a2be56 | hzylyq/Book | /CPPprimer/ch06/27.cc | C++ | cc | 556 | no_license | #include <iostream>
using namespace std;
int iCount(initializer_list<int> i1)
{
int count = 0;
for (auto val : i1)
count += val;
return count;
}
int main(int argc, char const *argv[])
{
// 使用列表初始化的方式构建initializer_list<int>对象
// 然后将它作为实参传递给函数iCount
cout << "1,6,9的和是: " << iCount({1, 6, 9}) << endl;
cout <<... |
4fcb8f7fe7915520385cef53dbb1b0ecc846866a | 23e48e7c042e8e63e5eea99df9fede1c140ed5b6 | aurolou/PresentMon | /PresentData/MixedRealityTraceConsumer.cpp | C++ | cpp | 16,957 | permissive | /*
Copyright 2017 Intel Corporation
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, s... |
f0a1e31c5be7fb8e6f861f52c70b616a02640f9d | 0a7d7ed7bdc60ff14b76aee445725fd46c252b51 | ferventcoder/facter | /lib/src/facts/posix/networking_resolver.cc | C++ | cc | 4,859 | permissive | #include <internal/facts/posix/networking_resolver.hpp>
#include <internal/util/posix/scoped_addrinfo.hpp>
#include <facter/util/file.hpp>
#include <leatherman/logging/logging.hpp>
#include <boost/algorithm/string.hpp>
#include <unistd.h>
#include <limits.h>
#include <netinet/in.h>
#include <arpa/inet.h>
using namespa... |
263b582e9b51e9dc47c9c4a5053d95dd73caaad6 | 3fae18d45afbba343e842c76c9674337b0054758 | keitaroyam/cctbx_fork | /cctbx/crystal/neighbors_bpl.cpp | C++ | cpp | 4,143 | permissive | #include <cctbx/boost_python/flex_fwd.h>
#include <boost/python/class.hpp>
#include <boost/python/def.hpp>
#include <boost/python/args.hpp>
#include <boost/python/return_value_policy.hpp>
#include <boost/python/copy_const_reference.hpp>
#include <scitbx/boost_python/iterator_wrappers.h>
#include <scitbx/boost_python/i... |
fc197e1a10914d74d6e3bd9740d711cef0485f11 | 5495d5177c9000342a3a0ef9c222cc14c89a12bb | Okrio/ecmedia | /module/audio_coding/main/source/acm_opus.cc | C++ | cc | 18,432 | no_license | /*
* Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contribut... |
59ba472cca9661e681a5af20f4d5aff963d2f89e | fe96272bc22d0a164779d9e4ec9da00b92334f51 | mihirp1/Leetcode_Algorithms | /monotonic-array/brute-with-diff.cpp | C++ | cpp | 841 | no_license | //https://leetcode.com/problems/monotonic-array/submissions/
class Solution {
public:
bool isMonotonic(vector<int>& A) {
int count1 = 0;
int count2 = 0;
int count3 = 0;
int l = A.size();
int flag = 0;
for(int i = 0;i<l-1;i++)
{
if(A[i+1] - A... |
d0150b3bc7b386712924d1c21d8d3e30390f176c | bd61d58a3b2b07e7173b7950bbd875ff8311210a | PaddlePaddle/Paddle | /paddle/fluid/framework/ir/mkldnn/conv_bias_mkldnn_fuse_pass.cc | C++ | cc | 12,756 | permissive | // Copyright (c) 2018 PaddlePaddle 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... |
1e9cf96583a340a0958d95f7d4eeb3c305be90e0 | 9960b716174996686d79ce17852bd930b9bab5d5 | alyshamsy/geometrymanipulation | /geometrymanipulation/Vertex.cpp | C++ | cpp | 1,532 | no_license | #include <iostream>
#include "Vertex.h"
using namespace std;
/*
The default constructor of the vertex which initiates the x, y and z components to be 0
*/
Vertex::Vertex() {
this->x = 0.0;
this->y = 0.0;
this->z = 0.0;
}
/*
The parameter constructor which takes in 3 parameters a, b and c and assign... |
f1ccaf747e7f133662d71c363459cea66d12383d | 085da905c67f63409e1b7e7a439cbcdf8a437134 | cybermichael/Firmware | /src/modules/sensors/sensors.cpp | C++ | cpp | 48,893 | no_license | /****************************************************************************
*
* Copyright (C) 2012 PX4 Development Team. All rights reserved.
* Author: Lorenz Meier <lm@inf.ethz.ch>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the followi... |
885e122f32af8d12d4ba8c7239ab5be35403647c | 78e3f49a01a36141f6d2ddc36eab506971c3fbd3 | MNTracker/MNT | /src/qt/walletframe.cpp | C++ | cpp | 7,143 | permissive | // Copyright (c) 2011-2013 The Bitcoin developers
// Copyright (c) 2016-2018 The PIVX developers
// Copyright (c) 2018-2019 The MNT developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "walletframe.h"
#includ... |
f4f3ff963f60f8d97139c96168528d527e6c9f9f | 3aea6f788fe0d13171057f2cda9cb03d4cc26363 | SgtFlame/indiezen | /Zen/Spaces/ObjectModel/src/Filter.cpp | C++ | cpp | 5,311 | no_license | //-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~
// Zen Spaces
//
// Copyright (C) 2001 - 2010 Tony Richards
// Copyright (C) 2008 - 2010 Matthew Alan Gray
//
// Licensed under the Games by Sarge Publishing License - See your licensing
// agreement for terms and conditions.
//
/... |
bbbbe020dac5ca5682b02647756ad0ab91d2714c | 95f4257ae286fe6420eb31ad3d26f1b42b787a61 | cw100/SoT-SDK | /SDK/SoT_BP_dirt_01_Desc_classes.hpp | C++ | hpp | 685 | no_license | #pragma once
// Sea of Thieves (1.4) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "SoT_BP_dirt_01_Desc_structs.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
/... |
95df048881e96ec7a9abf1fe05aa2c067feb2269 | 7a00949310940f921750a743bcceb7eb58a15781 | epfl-dias/proteus | /core/oltp/tests/tests-interval-map.cpp | C++ | cpp | 3,053 | no_license | /*
Proteus -- High-performance query processing on heterogeneous hardware.
Copyright (c) 2021
Data Intensive Applications and Systems Laboratory (DIAS)
École Polytechnique Fédérale de Lausanne
All Rights Reserved.
Permission to u... |
a06493698a880d5adbcab774711fb1f71f30c8f9 | 4d7149a324eb03d188bc963fea427d4a478479fa | iamserda/cuny-ttp-algo-summer2021 | /mouhamadouBarry/assignments/twopointers/lc977/lc977.cpp | C++ | cpp | 1,529 | no_license | // Problem Statement #
// Given a sorted array, create a new array containing squares of all the numbers of the input array in the sorted order.
using namespace std;
#include <iostream>
#include <vector>
class SortedArraySquares {
public:
static vector<int> makeSquares(const vector<int>& arr) {
int... |
ba07ef9d5585f67824f396167954d3cbbcdfa9b7 | 62da1547834818f8a53d805aac18304a769eb663 | expobrain/global-hotkey-qt | /main.cpp | C++ | cpp | 508 | permissive | #include "mainwindow.h"
#include "globaleventfilter.h"
#include "myapplication.h"
int main(int argc, char *argv[])
{
MyApplication a(argc, argv);
a.installEventFilter(new GlobalEventFilter(a.instance()));
MainWindow w1, w2;
w1.setWindowTitle("Window 1");
w1.resize(WINDOW_SIZE);
w1.move(0, 0)... |
eb314c575cd6be2e73b9d407731c3b60fb5081b2 | 838c7b0c4b12bfbdd59cea389e881a4b73fdd270 | zjzcn1/drogon | /drogon_ctl/create_controller.cc | C++ | cc | 15,383 | permissive | /**
*
* @file
* @author An Tao
* @section LICENSE
*
* Copyright 2018, An Tao. All rights reserved.
* Use of this source code is governed by a MIT license
* that can be found in the License file.
*
* @section DESCRIPTION
*
*/
#include "create_controller.h"
#include "cmd.h"
#include <iostream>
#inclu... |
20abfed8be666d7bb64c5b70c5ccccba15757a16 | e29570094284955bf7df8ba112ff2787bf0ff431 | toddstrader/slang | /source/binding/Expressions_eval.cpp | C++ | cpp | 32,414 | permissive | //------------------------------------------------------------------------------
// Expressions_eval.cpp
// Constant expression evaluation.
//
// File is under the MIT license; see LICENSE for details.
//------------------------------------------------------------------------------
#include "slang/binding/Expressions.h... |
aa514bd85362048fb365895750a95a78171b763c | 7e52843588562f64d16c70e83d8815825ac692d3 | kystyn/ui | /QtSrc/gui/text/qfont_win.cpp | C++ | cpp | 5,299 | no_license | /****************************************************************************
**
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:L... |
d56b7bdb462a848cc5ee6e35158bf184d95c568a | afdf85d5db7ef5c6b4e9b24c7980b13b23b5e44f | Arryboom/redex | /opt/optimize_enums/EnumConfig.cpp | C++ | cpp | 5,894 | permissive | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "EnumConfig.h"
#include "LocalPointersAnalysis.h"
#include "Walkers.h"
namespace ptrs = local_pointers;
namespace {
// T... |
13ffa46b447466041de3a3f9d4898dfdce9fa9a5 | 75789e0d78a27f76a7096643f44c09b2a588b838 | sadrulhc/chromium | /chrome/browser/chromeos/net/network_diagnostics/tls_prober.cc | C++ | cc | 6,983 | permissive | // Copyright 2020 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/chromeos/net/network_diagnostics/tls_prober.h"
#include <utility>
#include "base/bind.h"
#include "base/callback_helpers.h"
#in... |
ca7e60f96ba9655970e3716bb50a6e2bd1039770 | 388e2778e56a92ad51f20fb400740ce37c540c0c | ffk0716/onnc | /lib/IR/Compute/ReduceL1.cpp | C++ | cpp | 1,180 | permissive | //===- ReduceL1.cpp ------------------------------------------------===//
//
// The ONNC Project
//
// See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include <onnc/IR/Compute/ReduceL1.h>
using namespace onnc;
char ReduceL1:... |
051f9bfad60c0c91f8a8777b6f86c0f5ea33c0d7 | 306760fb1b1573845e85a8550f22575aaafca30e | djmv/fdd | /tools/TestHeadposeModel/CaffeClassifier.cpp | C++ | cpp | 6,165 | permissive | #include"CaffeClassifier.h"
CaffeClassifier::CaffeClassifier(const string& model_file,
const string& trained_file,
const string& mean_file,
const string& label_file) {
#ifdef CPU_ONLY
Caffe::set_mode(Caffe::CPU);
#else
Caffe::set_mode(Caffe::GPU);
#endif
/* Load the network. */
net_.reset(new Net<float>(model_... |
8971f6a41d0f562108bd0059a11c5e7a74b1aa7e | 4f1adf487e3caa95a02ed61bb7588bc7d241cfb8 | rishiraj52/Competitive-Programming-CP | /LEETCODE/Daily/June2021/CountVowelsPermutation.cpp | C++ | cpp | 1,897 | no_license | #include <iostream>
#include <bits/stdc++.h>
#include<set>
#include<stddef.h>
#include<stdlib.h>
#include <unordered_set>
#include<unordered_map>
#include<map>
#include<string>
#include<ctype.h>
#include <queue>
// #pragma GCC optimize "trapv"
typedef long long int ll;
using namespace std;
#define f(abcd,n) for(int ab... |
e5647f8768d32a6ffd4204713cd8a1b173aa2de1 | 231de48ad5771f4268812c7214a3b7eecab1b579 | baimingjiang/v3quick-classic | /quick/lib/extra/network/CCHTTPRequest.cpp | C++ | cpp | 16,391 | permissive | #include "network/CCHTTPRequest.h"
#include <stdio.h>
#include <iostream>
#include <thread>
#if CC_LUA_ENGINE_ENABLED > 0
extern "C" {
#include "lua.h"
}
#include "CCLuaEngine.h"
#endif
#include <sstream>
NS_CC_EXTRA_BEGIN
unsigned int HTTPRequest::s_id = 0;
HTTPRequest *HTTPRequest::createWithUrl(HTTPRequestDeleg... |
68e581151dd1d1f7d7e6f28eadf94c260a45e7a3 | 90d8c9a30da6c6240ef5c273dc5204ed1cf1cc6f | theexplorist/competitive-programming-1 | /spoj/ADASEQEN.cpp | C++ | cpp | 680 | permissive | /*
dynamic programming > longest common subsequence (LCS)
difficulty: easy
date: 29/Apr/2020
by: @brnpapa
*/
#include <bits/stdc++.h>
using namespace std;
vector<int> p;
string a; int N;
string b; int M;
int memo[2020][2020];
int dp(int i, int j) {
// atual a[i] e b[j]
if (i == N || j == M) return ... |
a16e299d6b651c41e3f34c71f9ee630fb4129af8 | e5e2f2943638b3204ebb39a9244223fd3de742eb | MDNobu/MyOGLExercise | /LearnOGL/QHelloTriangle.cpp | C++ | cpp | 2,579 | no_license | #include "QHelloTriangle.h"
#include <glad/glad.h>
#include <GLFW/glfw3.h>
#include <iostream>
//#include "MyWindowInit.h"
#include "QGLApp.h"
#include "Shader.h"
#include "QShader.h"
QHelloTriangle::QHelloTriangle() : m_QShaderProgram(nullptr)
{
//m_ShaderProgram(nullptr);
m_QShaderProgram = std::unique_ptr<QShad... |
bdf76cf841bfd07c949e42f10a5d39a59f98d97e | 3784afdf02db129923057462231033df21ba51d3 | kmjp/procon | /codeforce/401-420/412/b.cpp | C++ | cpp | 1,726 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#... |
eaea4c234fd5a49cdc6fd0a69bad51e52598527b | 860cc0f464307d9783c6e65b49339c9dd8c4951e | Werevector/SDLBulletHell | /BulletHell/Main.cpp | C++ | cpp | 3,051 | no_license | #pragma once
#include "SDL.h"
#include <iostream>
#include "stdio.h"
#include <string>
#include "Player.h"
#include "GameTimer.h"
#include "Graphics.h"
#include <vector>
#include "Enemy.h"
#include "Schedule.h"
#include "Bullet.h"
using namespace std;
void init();
bool loadMedia();
void close();
//World obects
Playe... |
c560b9f47b4b01820e5700e0166329dbb3f9d2fb | b6105833aad25c22e84a9daa5d9f333d5a61587f | FeatherWaves666/Cpp | /通讯录 21.3.9/通讯录.cpp | C++ | cpp | 4,875 | no_license | #include <iostream>
using namespace std;
#include<string>
#define max 1000
struct person {
string m_name;
int m_sex;
int m_age;
string phone;
string address;
};
struct member {
person s1[max];
int m_nu=0;
};
void showmenu() {
cout<<"***************************"<<endl;
cout<<"***** 1、增添联系人 *****"<<endl;
cout... |
cc172ceed61ed81c19df73f57d36acc5502eb469 | 9821054489c90fae012d656322a882e27b564ae7 | ctorralba/C-Programming | /lab12/lab12.cpp | C++ | cpp | 452 | no_license | /* Programmer: Christopher Torralba Date: 11/11/15
Section: F
File Name: lab12
Purpose: Make a clock that displays both standard and military time
using classes.
*/
#include "clock.h"
#include <iostream>
using namespace std;
int main()
{
Clock c1;
Clock c2(4, 30, 0, "PM");
c1.displayStandard();
cout << endl;
... |
e62026e804a8023b3852ec6e8ca09a5cc6c80f32 | 310c9628f46377bb969d86dd807938f4bb342b9a | WhiZTiM/coliru | /Archive2/72/f3025c94f7033c/main.cpp | C++ | cpp | 395 | no_license | #include <set>
#include <iostream>
int main()
{
std::set<int> c = {1, 2, 3, 4, 5, 6, 7, 8, 9};
// erase all even numbers from c
for(auto it = c.begin(); it != c.end(); )
if(*it % 2 == 1)
{
it = c.erase(it);
std::cout << *it << std::endl;
}
... |
960da52e159dc61884c87f11439e7e7f0fc4812a | 41a37044fa4ebaa28cf22bf3c3daf8f07d17ae82 | farhan296/LimeSuite | /src/lms7002m/LMS7002M_RxTxCalibrations.cpp | C++ | cpp | 15,772 | permissive | #include "LMS7002M.h"
#include <assert.h>
#include "MCU_BD.h"
#include "IConnection.h"
#include "mcu_programs.h"
#include <chrono>
#include <thread>
#include "Logger.h"
#include "LMSBoards.h"
#ifndef NDEBUG
#define LMS_VERBOSE_OUTPUT
#endif
#ifdef LMS_VERBOSE_OUTPUT
static const bool verboseEnabled = true;
#else
stat... |
d9b1bb84ed097cdd0e810b14b55dd3dbed3c434f | b3fb25eacfdad38452d68a4baa1e943c57547ea7 | greatyang/activemq-cpp | /activemq-cpp/src/main/cms/DestinationEvent.cpp | C++ | cpp | 979 | permissive | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... |
9623e59b5c566ccd26047b3abad8bff28d04bad7 | 5364c1fb0843d5aa29d45642c8286618d152c506 | utsavjnn/iroha | /shared_model/interfaces/impl/permissions.cpp | C++ | cpp | 4,031 | permissive | /**
* Copyright Soramitsu Co., Ltd. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#include "interfaces/permissions.hpp"
using namespace shared_model::interface;
namespace shared_model {
namespace interface {
namespace permissions {
Role permissionFor(Grantable g) {
switch (g) ... |
7b31f03ea0a4f8fee03f565470fb18e7b0816273 | 47b7cc6835b63c2b1a07277096f6d3fe17a0f415 | intel/ros2_openvino_toolkit | /openvino_wrapper_lib/include/openvino_wrapper_lib/inferences/object_detection.hpp | C++ | hpp | 6,478 | permissive | // Copyright (c) 2018-2022 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.org/licenses/LICENSE-2.0
//
// Unless required by applicable law o... |
4b5958ff7a5aeb92e8ef19ff36c719460a93a5ae | dadfdf846b46066fc0f0e8abae2b000192f5ac23 | 403712387/abstract | /src/module/base/FacePositionModule/src/FacePositionManager.cpp | C++ | cpp | 4,357 | permissive | #include "TrackCondition.h"
#include "IngestInfo.h"
#include "VideoFrameMessage.h"
#include "FacePositionManager.h"
#include "TrackStartMessage.h"
#include "TrackStopMessage.h"
#include "IngestExceptionMessage.h"
#include "FacePositionManagerAgent.h"
FacePositionManager::FacePositionManager(MessageRoute *messageRoute)... |
e554909bc63eb6b001eb08445a270fe491d4aaf4 | d2e43d6887c002f258921a956fec44a4eda01329 | jalopezsuarez/idesk | /src/DesktopIconConfig.cpp | C++ | cpp | 14,563 | permissive | /* vim:tabstop=4:expandtab:shiftwidth=4
*
* Idesk -- DesktopIconConfig.cpp
*
* Copyright (c) 2002, Chris (nikon) (nikon@sc.rr.com)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* ... |
c9d7bf184b7193fd3eb357bdeb58da75c4b9eebe | af4f958b9a772537d9f2691e7ea94d2bb321c851 | turiver/CCpp2016 | /practices/level1/p06_Goldbach/goldbach.cpp | C++ | cpp | 389 | no_license | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
bool prime(int x);
int main()
{
for(int i=4;i<=100;i+=2)
for(int j=2;j<=i/2;j++)
if(prime(j)&&prime(i-j))
{
printf("%d=%d+%d\n",i,j,i-j);
break;
}
return 0;
}
bool prime(int x)
{
if(x==2) return... |
ce039b37cc1e785bfaecd574fdd9159f574e2349 | 69916e59f9595ec5b6fdae03023f6dd133311463 | Kitty-Kitty/csf_library | /csf_workspace/csf/src/core/service/csf_divider_manager.cpp | C++ | cpp | 1,109 | permissive | /*******************************************************************************
*
*Copyright: fangzhenmu
*
*Author: fangzhenmu
*
*File name: csf_divider_manager.hpp
*
*Version: 1.0
*
*Date: 28-3月-2019 14:56:49
*
*Description: Class(csf_divider_manager)
*
*Others:
*
*History:
*
****************************************... |
df4e855c71c58ea9789bbec24b31633e75b00dd0 | fb5713b33fbe242f9f667e848ead7601d20fb48e | sallen-repos/BlackJack | /Task10-Cards/Task10-Cards.cpp | C++ | cpp | 1,518 | no_license | // Task10-Cards.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include "pch.h"
#include <iostream>
#include <string>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include "Deck.h"
#include "BlackJack.h"
const int NUM_CARDS = 52;
const int NUM_RANKS = 13;
... |
892c294085cf5a1651dc5c3c95d0ea3008cb3d30 | 6a7b3c1f1d0da931aef5ad2031b9805a139780fe | Akash12pro/WickedEngine | /WickedEngine/wiVersion.cpp | C++ | cpp | 661 | permissive | #include "wiVersion.h"
#include <string>
namespace wiVersion
{
// main engine core
const int major = 0;
// minor features, major updates, breaking API changes
const int minor = 47;
// minor bug fixes, alterations, refactors, updates
const int revision = 42;
const std::string version_string = std::to_string(ma... |
56b2b9ca139c30294d3bfa7f90597ad6383ac11f | f5e40d66cd1eb3ac5bd92a88722a40c871d1e6b1 | roussukke/Yorozuya | /library/ATF/LPMONITORINFOEX.hpp | C++ | hpp | 271 | permissive | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
#include <tagMONITORINFOEXA.hpp>
START_ATF_NAMESPACE
typedef tagMONITORINFOEXA *LPMONITORINFOEX;
END_ATF_NAMESPACE
|
5c200cc327735970882bd308bee9f544a7144b3f | cb23e250afbc9499f91417066fffd19e6810c2ff | stevesuyao/cudaPcl | /include/cudaPcl/openniVisualizer.hpp | C++ | hpp | 5,323 | permissive | /* Copyright (c) 2014, Julian Straub <jstraub@csail.mit.edu>
* Licensed under the MIT license. See the license file LICENSE.
*/
#pragma once
#include <iostream>
#include <pcl/io/openni_grabber.h>
#include <pcl/io/openni_camera/openni_depth_image.h>
#include <pcl/io/openni_camera/openni_image.h>
#include <opencv2/... |
562ec0ca625779e18044ff7b5110496248138239 | cf37862ba63b32e590c338006cbc39efa4b2aa10 | xzjqx/TemplateCode | /Tarjan(vector邻接表).cpp | C++ | cpp | 1,232 | no_license | //Tarjan(vector)
#include <cstdio>
#include <cstring>
#include <vector>
#define MAX_N 101
using namespace std;
vector<int> e[MAX_N];
int dfn[MAX_N],low[MAX_N];
int isGedian[MAX_N],time,sons;
void init() {
memset(dfn,0,sizeof(dfn));
memset(low,0,sizeof(low));
memset(isGedian,0,sizeof(isGedian));
memset(... |
6e269a5a55395dd81408f8ba7579464675e9d6d0 | 2e9f1af46b5c4d843bf8efddba68329d7fb99729 | yjbong/problem-solving | /boj/1573/1573.cpp | C++ | cpp | 1,242 | no_license | #include <cstdio>
int d[20]; // d[i] = i개의 노드를 가진 이진 검색 트리에 a부터 시작해서 사전 순서대로
// 서로 다른 i개의 알파벳을 붙이고 프리오더 순회했을 때 얻을 수 있는 문자열의 가짓수
int N;
int index;
// 시작 알파벳이 startChar이고, nodes개의 노드를 가진 이진 검색트리에서 index번째로 가능한 preorder 순회 결과 출력
void preorder(int startChar, int nodes, int index){
if(nodes==0) return;
if(nodes==1... |
49b2f293ea2fdff56a4da9aa05ad5edf128dcdb7 | b39de71bd700560a97d010fc848d324da4c96603 | MyLinh60132046/ThucTapCoSo | /ThuatToan.cpp | C++ | cpp | 4,783 | no_license | #include<conio.h>
#include <fstream>
#include <iostream>
using namespace std;
struct Node
{
int index; // so thu tu
int g; // khoang cach tu dinh ban dau den dinh hien ta
int f; // f = h + g;
int h; // duong di ngan nhat
int color; // danh dau dinh di qua
int parent; // dinh cha
};
int a[100... |
0f5108240af587d2bb79539af6960a47a1dab5c8 | 296c0912860a30997bb26c78bd24dd052df88d46 | hant0508/lessons | /Олимпиады/2014-1/2.cpp | C++ | cpp | 452 | no_license | // Школьный этап олимпиады 2014-2015
// Задача 2. Манхэттен
#include <iostream>
using namespace std;
int main()
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = max(x1 - x2, x2 - x1);
int dy = max(y1 - y2, y2 - y1);
for (int i = 0; i < dx; ++i)
{
if (x1 < x2)
cout << 'E';
else
cout << 'W';
... |
809b9b0bf597adf3cf9febb6f8bdf7765be41f2e | 577c0915a7896681e5720685bbf64584efaf8624 | WeberNick/masterDB | /src/buffer/buf_mngr.hh | C++ | hh | 9,502 | no_license | /**
* @file buf_mngr.hh
* @author Nick Weber (nickwebe@pi3.informatik.uni-mannheim.de)
* Jonas Thietke
* @brief Class implementieng the buffer manager
* @bugs Currently no bugs known
* @todos - Exception Handling in readPageIn,
* - Should initNewPage be in buf mngr or somewhere ... |
a45e5f3c8971ca908ca976cec11b975c316806fe | f51fa9716d949af0784d6a5dbf1383577a359b26 | omarbarakat/SIC-XE_Assembler | /src/OpTab.cpp | C++ | cpp | 9,513 | no_license | #include "OpTab.h"
map<string, OpInfo*>* opTable = NULL;
static void fillOpTab() {
OpInfo* info;
info = new OpInfo;
info->mnmoneic = "FIX";
info->format = FORMAT_1;
info->opCode = 0xC4;
opTable->insert(pair<string, OpInfo*>("FIX", info));
info = new OpInfo;
info->mnmoneic = "NORM";
info->format = FORMAT_1... |
48b855cae89cb11d8aaf5bbfcbdc5d810ec8db60 | 5179990ce4d7ce4ba769ad2fc8358f27eb1fd68f | Akira-Hayasaka/ofAkiraPerfumeBVHExample | /src/main.cpp | C++ | cpp | 418 | no_license | #include "ofMain.h"
#include "PerfumeAR.h"
#include "ofAppGlutWindow.h"
//========================================================================
int main( ){
ofAppGlutWindow window;
ofSetupOpenGL(&window, 1056,704, OF_WINDOW); // <-------- setup the GL context
// this kicks off the running of my app
// ca... |
dc89286bf5dfa4f3224f8fe57978cd0d8c3f54b0 | 3a8a960f28b4c499c79a3fb17832ef4758ffa2ce | andrea-manzi/dmlite-hdfs-plugin | /src/Hdfs.cpp | C++ | cpp | 4,004 | permissive | /*
* Copyright (c) CERN 2013
*
* Copyright (c) Members of the EMI Collaboration. 2010-2013
* See http://www.eu-emi.eu/partners for details on the copyright
* holders.
*
* Licensed under Apache License Version 2.0
*
*
*/
/// @file plugins/hadoop/Hdfs.cpp
/// @brief hadoop plugin.
//... |
b66e65c81f276c450fa00795b1b06b9222a13449 | f85e4cd7f7c3abd8c4fc6e20bfbfbb9be4e517dd | jeffery-do/ParaView | /VTK/Widgets/vtkLineRepresentation.cxx | C++ | cxx | 32,420 | permissive | /*=========================================================================
Program: Visualization Toolkit
Module: $RCSfile$
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distrib... |
cab1c6ec346b5f030e8abf6af647661e56b8edf9 | 738b5645fccc25b311f48d4f75e33223c15cf12c | areshta/cpp-edu | /zArchive/misc/someCppQt/q-sca-1/main.cpp | C++ | cpp | 316 | no_license | #include <QCoreApplication>
#include <QDebug>
int& f()
{
int *pTmp = new int[100];
pTmp[0] = 555;
return pTmp[0];
}
int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
int aa;
qDebug()<< f() << aa;
qDebug()<< "memory leaks & ref to temporary";
return a.exec();
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.