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 |
|---|---|---|---|---|---|---|---|---|
4da9836ab238f68132b16350ebbd9e977f61f3e0 | 0234a103e9d48ce369fcfbc6c58c0bc1be744052 | JasonSun623/laser_slam | /laser_slam/src/navigation/clear_costmap_recovery/src/clear_costmap_recovery.cpp | C++ | cpp | 6,144 | no_license | /*********************************************************************
*
* Software License Agreement (BSD License)
*
* Copyright (c) 2009, Willow Garage, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following cond... |
cd905e236c407bc2e3111a13fbe74a59e31332af | 01491593d417dbac37f7e356e87920c9fadacc26 | shamoya/ucx | /test/gtest/uct/test_ud.cc | C++ | cc | 23,821 | permissive | /**
* Copyright (C) Mellanox Technologies Ltd. 2001-2015. ALL RIGHTS RESERVED.
*
* See file LICENSE for terms.
*/
#include "uct_test.h"
#include "ud_base.h"
extern "C" {
#include <ucs/time/time.h>
#include <ucs/datastruct/queue.h>
#include <uct/ib/ud/base/ud_ep.h>
};
class test_ud : public ud_base_test {
public:
... |
e3af8fb25be82cc3ff9a64ffa88f6f27367ce009 | 1fcb5bc38e8e3112da9cb09ad6d7a6494ab28078 | chenhuidong/MyGit | /MyCpp/MyPro/MyTest/MyPipe/MyMore.cpp | C++ | cpp | 1,592 | no_license | #include "MyStdAfx.h"
#include <sys/wait.h>
#define DEF_PAGER "/bin/more" /* default pager program */
int
main(int argc, char *argv[])
{
MMyLib::INITIALIZE_LOG(argv[0]);
int n;
int fd[2];
pid_t pid;
char *pager, *argv0;
char line[MYSIZE];
FILE *fp;
if (argc != 2)
LOG_ERROR<< "usage: a.out <pathname>"<< ... |
6c820569e189455188d6c826abbf737d8d7a42d4 | 17059980280f7c7320d4cccf334b0a10d64ce41b | zH4x-SDK/zARKSotF-SDK | /SDK/DinoColorSet_Stego_functions.cpp | C++ | cpp | 986 | no_license |
#include "../SDK.h"
// Name: ARKSotF, Version: 178.8.0
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace SDK
{
//---------------------------------------------------------------------------
// Functions
//---------------------------------------------------------------------------
// Function DinoColorSet_St... |
5496562d92f96e09d02b437dd263ab5da6a0528d | 4cc8e32594aa5ed3b980395e7355b4b618868951 | SiteView/ECC8.13 | /trunk/webcgi/treeview/treeview_test_qiyu.yu/treeview.cpp | C++ | cpp | 109,362 | no_license | #include "treeview.h"
#include "mainview.h"
#include "rightview.h"
#include "resstring.h"
#include "basedefine.h"
#include "debuginfor.h"
#include "monitorview.h"
#include "../base/OperateLog.h"
#include "../../opens/libwt/Websession.h"
#include "../../opens/libwt/WTableCell"
#include "../../opens/libwt/WSc... |
455f63885e0417ec6918bc60d76188ce81eca275 | b8bb64dc863e149ca5888871bf33e428dc87dc29 | fiddleplum/ve | /old/src/gui/sprite.cpp | C++ | cpp | 2,996 | permissive | #include "sprite.h"
#include "../render/uniform.h"
namespace ve
{
namespace gui
{
Sprite::Sprite(UsePtr<render::Stage> stage_)
{
stage = stage_;
model = stage->createModel();
model->setUniformsFunction(std::bind(&Sprite::setUniforms, this));
}
Sprite::Sprite(UsePtr<render::Stage> stage_, Config con... |
44d8cf8bba35b5fd3ac852981b8b192a5f8749ce | 7b1cc18388eb6c0e80566c2c921ae3d44702781c | dmtzt/ingenieria-tecnologias-computacionales | /fundamentos-programacion/actividades/alternaCaracteres.cpp | C++ | cpp | 238 | no_license | #include <iostream>
using namespace std;
int main(void)
{
int n;
int i = 0;
char c[] = {'*', '#', '%'};
cin >> n;
while (n != 0)
{
n--;
if (i == 3)
i = 0;
cout << c[i];
i++;
}
cout << endl;
return 0;
} |
38991a06e76452f8a2f2e2ac7420ecd2978458cc | 4a9e9a4cc691d15c4815a5bbf9d0ffc67546d447 | arbenson/Elemental | /src/lapack-like/factor/LDL/Pivoted.hpp | C++ | hpp | 38,741 | permissive | /*
Copyright (c) 2009-2014, Jack Poulson
All rights reserved.
This file is part of Elemental and is under the BSD 2-Clause License,
which can be found in the LICENSE file in the root directory, or at
http://opensource.org/licenses/BSD-2-Clause
*/
#pragma once
#ifndef EL_LDL_PIVOTED_HPP
#define EL_LDL_... |
61a89922a731352e2c5c829319a3c458eebbb256 | 0bb3bb67675be279cc7acb43482beb08302e294d | EronWright/LogDevice | /logdevice/admin/maintenance/ShardWorkflow.cpp | C++ | cpp | 10,767 | permissive | /**
* Copyright (c) 2017-present, Facebook, Inc. and its affiliates.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
**/
#include "logdevice/admin/maintenance/ShardWorkflow.h"
#include <folly/MoveWrapp... |
5870265f6cf817a68fe9de546cd48832dcd3a95e | 5cfe4c71eb102c91409e42b412260436a8d1f13b | Lryst/CPP | /CPP05/ex03/Bureaucrat.cpp | C++ | cpp | 2,895 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Bureaucrat.cpp :+: :+: :+: ... |
ec3f6c38c1e382a01944dd96d75bd724a7ff7e83 | 8a04eca404c519e23571c651862bec78bf3816d2 | pedroAdami17/A.I_Assignment4 | /src/Tile.cpp | C++ | cpp | 2,069 | no_license | #include "Tile.h"
#include <iomanip>
#include <sstream>
#include "Config.h"
#include "TextureManager.h"
#include "Util.h"
Tile::Tile() :m_cost(0.0f)
{
setWidth(Config::TILE_SIZE);
setHeight(Config::TILE_SIZE);
}
Tile::~Tile()
= default;
void Tile::draw()
{
Util::DrawRect(getTransform()->position, getWidth(), ge... |
dbacf6105d01d07fcbe3f3a77cf830d21b35501c | 68680c87b6b12c20cb94f05217a12bee84682bf1 | cassiesu/algorithms_lab | /exercise/treap_jump.cpp | C++ | cpp | 4,884 | no_license | #include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;
const int INF = 1<<30;
const int DIVISOR = 1000000;
const int MAXH=500010;
int t,n,k;
long long dp[MAXH];
int A;
long long tmp;
template <class DType>
class Treap {
private:
struct node;
... |
162f358ff5601325be5b496fd50ca29638c3bd0b | 7f92ee2e8350eb02a2fa6efd84d3e373dec798b4 | chemiczny/automateusz_gto_d2 | /src/d2_ee_sdps_AC.cpp | C++ | cpp | 1,842 | no_license | #include "gto_d2_kit/d2_ee_sdps_AC.hpp"
#include "gto_d2_kit/d2_ee_pssd_AC.hpp"
void second_derivative_ee_0210_13(
const double ae,
const double xA,
const double yA,
const double zA,
const double be,
const double xB,
const dou... |
f5e3028b900d8f432641a2aa5eba3275f92c08ed | 6660dec63d202722ec51913d7c51a40bfc39e982 | Maximus5/FarPlugins | /Uninstall/src/common/sysutils.cpp | C++ | cpp | 16,773 | permissive | #include "utils.hpp"
#include "sysutils.hpp"
HINSTANCE g_h_instance = nullptr;
wstring get_system_message(HRESULT hr, DWORD lang_id) {
wostringstream st;
wchar_t* sys_msg;
DWORD len = FormatMessageW(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS, nullptr, hr, lang_id... |
88bdf8b634f328aaedaa66d149d588e325bce2ab | 13cfaaf6138d3f4fde267b3cf4500f74ef6d54a2 | OlmoPrieto/EngineV3 | /Project/src/sprite.cpp | C++ | cpp | 2,729 | no_license | #include "sprite.h"
Sprite::Sprite() {
m_scale.x = 1.0f;
m_scale.y = 1.0f;
m_color = Color(255, 255, 255, 255);
// TODO: Need a refactor.
// Texture data shouldn't be specified here because
// you don't know what kind of texture this sprite will have
// and you are allocating data that might be unused.... |
4357a5517d412915f271862d646654cde7788fb4 | 358c8d84fc1704491a2d623f6184a30dc08f3d12 | leedavid/NewGG | /I_GGX64/5/5对2/2炮3兵对1车1兵.cpp | C++ | cpp | 1,440 | no_license | #ifndef END_my_m_MT_R_2pao3pawn_B_1che1pawn
#define END_my_m_MT_R_2pao3pawn_B_1che1pawn
#include "../../chess.h"
#include "../../preGen.h"
#include "../../endgame/mat.h"
#include "2炮3兵对1车1兵.cpp"
#include "../../white.h"
#else
#include "../../black.h"
#endif
//Add_MAT_B_1ma1pao1pawn_R_1che1pawn_ByShi
// 红方2炮兵,黑方车... |
06e3c446cd6ebde2570a4aa8cfb512e6f7b8de2d | 9747765d7ee9ab9d2e09b4829879f02468d32223 | xuyiwei555/tensorflow | /tensorflow/compiler/mlir/hlo/lib/Dialect/lhlo/IR/lhlo_ops.cc | C++ | cc | 17,419 | permissive | /* Copyright 2019 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... |
d455d91fc9796651846ec6dfb876ce5a2713da1a | 7e7babc0f6df81ad71428da6a648e2faaf355326 | aiiasiia/thesis | /code/src/PMS8/src/main.cpp | C++ | cpp | 4,668 | no_license | /*
* main.cpp
*
* Created on: Jun 21, 2012
* Author: marius
*/
#include "MotifWorker.h"
#include <ctime>
#include <cmath>
#include "mpi.h"
#include "IndexScheduler.h"
#define MAX_MOTIFS_PER_PROC 100000
struct WorkerStruct {
IndexScheduler *scheduler;
MotifWorker *worker;
int myRank;
int nTasks;
clock_... |
6fd5b735af307190341f6695f885bbc81819cab4 | 40c0992e0b76a6ea7ac0ac83c3689819f0d77a5d | bssrdf/gpu-motunui | /include/moana/scene/as_arena.hpp | C++ | hpp | 627 | permissive | #pragma once
#include <vector>
#include <cuda.h>
namespace moana {
struct Snapshot {
void *dataPtr;
size_t sizeInBytes;
};
class ASArena {
public:
ASArena();
void init(size_t bytes);
CUdeviceptr allocOutput(size_t bytes);
void returnCompactedOutput(size_t bytes);
Snapshot createSnap... |
197f7784011329b5bdd4e25ce76655bc4f83fb3b | d6bb334226e24c27509a8818a077f55921b2a6fa | lucachaves/simcdn | /src/simulator/coordinate/CDN_CentralUnit.cc | C++ | cc | 24,154 | no_license | #define CDN_CENTRALUNIT_CC
#include "CDN_CentralUnit.h"
#include "StaticContentExchange_ServicePeerCommand.h"
#include "CDN_CentralUnit_Reply.h"
#include "Request.h"
#include "RequestMessage.h"
#include "cache/Cache.h"
#include "Exceptions.h"
#include "InterNodeRequestProtocol.h"
#include <assert.h>
#include <climits>
... |
e58c4367bebd002aa58df4ee081299cf3429a235 | de2eee5ce143b3665ccf9b211e52c1928ce161e5 | felidadae/dsp_opencl_gpu | /source/IRFC_LowPass.cpp | C++ | cpp | 4,429 | no_license | //
// IRFC_LowPass.cpp
// FilterModule_Standalone
//
// Created by kadlubek47 on 01.08.2013.
// Copyright (c) 2013 kadlubek47. All rights reserved.
//
#include <cmath> //< for log, M_PI, ceil
//---
#include "IRFC_LowPass.h"
#include "FMParamsInfo.h"
#pragma mark Constructing, destroying, setting parameters
... |
933ac47576b6298367b2b2e2c9e7f9556e4da7bd | b85fdafb2f3dbbc0079bdd5c05ac9817cb840664 | StephennQin/QTProjects | /02_signalAndSlot/student.cpp | C++ | cpp | 326 | no_license | #include "student.h"
#include<QDebug>
Student::Student(QObject *parent) : QObject(parent)
{
}
void Student::treat()
{
qDebug() << "treat teacher!";
}
void Student::treat(QString foodName)
{
//QString转为char *: 先转成QByteArray,再转成char *.
qDebug() << "treat teacher" << foodName.toUtf8().data();
}
|
f126e4dff5d7e5526724504f176e9f77e9cc591c | 711b60ad2a96958e5451ab98a286846e627430cd | moleculas/narCo-in | /src/qt/qrcodedialog.cpp | C++ | cpp | 4,311 | permissive | #include "qrcodedialog.h"
#include "ui_qrcodedialog.h"
#include "bitcoinunits.h"
#include "guiconstants.h"
#include "guiutil.h"
#include "optionsmodel.h"
#include <QPixmap>
#include <QUrl>
#include <qrencode.h>
QRCodeDialog::QRCodeDialog(const QString &addr, const QString &label, bool enableReq, QWidget *parent) :
... |
c896c0c34c8bebca24e5fba4e37e5998fa32a3fd | 9bed0d8e6b716f1071a42a73e712c2ba755254f6 | Agrelimos/tutorials | /Win32/Drawing Shapes/win_main.cpp | C++ | cpp | 10,520 | permissive | // Done by TheTutor
/*
This tutorial is an introduction to the many GDI (Graphical Device Interface) functions
Windows has for drawing shapes. Using the Win32 API, we will generate the following shapes:
Ellipse
Arc
Polygon
Line
So with that brief introduction lets head to the code and get drawing.
*/... |
5b19db4e411e49bc84dc29f6106513605e17b02d | c398d0af60f566a0c09f8e6a66e729aac8ef57e0 | zlocker/QtBookCode | /Hands_On_GUI_Programming_with_C++_and_Qt5/Hands-On-GUI-Programming-with-CPP-and-Qt5-master/Chapter13/MusicPlayer/mainwindow.cpp | C++ | cpp | 2,341 | permissive | #include "mainwindow.h"
#include "ui_mainwindow.h"
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
ui->setupUi(this);
player = new QMediaPlayer(this);
player->setVolume(ui->volume->value());
connect(player, &QMediaPlayer::stateChanged, this, &MainWindow::stateChanged);
c... |
a152073d26825106ab11deeb4e8a5f419324714c | 7d0c9b3995bc03d22661d57a516482bd5fac29f7 | TexelBox/wave-tool | /deps/boost/include/boost/container/stable_vector.hpp | C++ | hpp | 84,662 | permissive | //////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2008-2015. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/contain... |
baf7a063b2c06b03a3de4faae11aa14089f64902 | b65db0013089b34b496e63f8da77c3af6b522b83 | niranjansy/LeetCode-Interview-Preparation | /Longest Common Prefix.cpp | C++ | cpp | 623 | no_license | // https://leetcode.com/problems/longest-common-prefix/
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
int n = strs.size();
if(n == 0)
return "";
string common_prefix = strs[0];
for(int i=1; i<n; i++)
{
int j = 0;... |
ae47ce9973247234fdd233cccebc911d90a5fba2 | 5de00d6c1b5c51d216364e815b1e404432a4f7c5 | SiriusNEO/ACMClass-Matrix | /testmain.cpp | C++ | cpp | 240 | no_license | //
// Created by SiriusNEO on 2020/11/26.
//
/*
#include "matrix.hpp"
#include "testint.hpp"
using namespace std;
void f(){
sjtu::Matrix<int> a(3, 3, 3);
}
int main() {
f();
std::puts("bomb");
return 0;
}*/ |
1e9a11a789dc0df7fa90eaba14aebcf54cab9cc5 | 2273286d29a7aec6f8d1277372ac15557035c36f | sailfish009/iree | /iree/compiler/Dialect/VM/Target/Bytecode/BytecodeModuleTarget.cpp | C++ | cpp | 22,281 | permissive | // Copyright 2019 Google LLC
//
// 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
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... |
2b55ea916857fe1d0c5ed0356bbab8d986b6103e | bbb93dd5b5c0b23e2cbee1f45cf466c1e8c53281 | selvam-manojkumar/stream-bms-data-Akshay3012 | /battery_parameters_test.cpp | C++ | cpp | 713 | permissive | #define CATCH_CONFIG_MAIN
#include "test/catch.hpp"
#include"battery_parameters.h"
TEST_CASE(" Parameter values"){
int minTempVal = 0;
int maxTempVal = 100;
int minSOCVal = 0;
int maxSOCVal = 100;
std::string parameterName1 = "Temperature";
std::string parameterName2 = "SOC";
std::string wrongParamet... |
081b1370a52f71b8e1e219ed979eef56164709de | 1782ca0cfee670b6e006eb3b2418882c54d277f3 | CarsonZhong/learngit | /subwayCharge/subwayCharge/subwayPrice/src/basePrice.cpp | C++ | cpp | 487 | no_license | #include "stdafx.h"
#include <iostream>
#include <sstream>
#include "subwayMacro.h"
#include "include/basePrice.h"
using namespace std;
/*
@ 获取基础票价, 即按进站点与出站点之间的最短里程分级计算
@ -1, 查询基础票价失败; 其他, 基础票价
*/
int GetBasePrice(unsigned int meters)
{
if(meters <= 3000)
return 2;
else if(meters <= 5000)
re... |
67e4084e7056872582dfc876cca0e435ea48fe8f | ebc682e05323b6fb38d7bd6c5671a534cf62d568 | brudesousa/novo | /primeira tent/tutorial_pkg_node.cpp | C++ | cpp | 7,418 | no_license | #include "ros/ros.h"
#include "geometry_msgs/Twist.h"
#include "turtlesim/Pose.h"
#include <sstream>
#include <math.h>
using namespace std;
ros::Publisher velocity_publisher;
ros::Subscriber pose_subscriber;
turtlesim::Pose turtlesim_pose;
const double x_min = 0.0;
const double y_min = 0.0;
const double x_max = 11.... |
5a69bd8fd5578415ddae54cb67b9026a138ef777 | 88a66d68ce071a41a8f3d5ba9b34b774e1500d4c | SCIInstitute/Seg3D | /src/Application/Tools/MaskDataFilter.cc | C++ | cc | 3,123 | permissive | /*
For more information, please see: http://software.sci.utah.edu
The MIT License
Copyright (c) 2016 Scientific Computing and Imaging Institute,
University of Utah.
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Softwa... |
c9e7d4e5293e8b42a197e96c930b5e2204f67b5e | 2b861a2e4cdb4a86ee281303adbd3c3804d1ea76 | megan-c-hill/CS327 | /Assignment10/app/src/main/cpp/shared-components.cpp | C++ | cpp | 3,723 | no_license | #include "shared-components.h"
#include <stdio.h>
#include <cstdlib>
static const char EMPTY_ROW_TEXT[81] = " ";
DungeonPosition dungeon[TOTAL_HEIGHT][TOTAL_WIDTH];
DistancePosition nonTunnelDistance[TOTAL_HEIGHT][TOTAL_WIDTH];
DistancePo... |
5302bf897deb9c8db1207fda64ab12f256827b13 | 3399bc153c49e05186e8b1d1813ce504a98d23cb | AlaaElnagar/ROS | /Montecarlo Alg/Robot_class.cpp | C++ | cpp | 6,813 | no_license | //#include "src/matplotlibcpp.h"//Graph Library
#include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <stdexcept> // throw errors
#include <random> //C++ 11 Random Numbers
//namespace plt = matplotlibcpp;
using namespace std;
// Landmarks
double landmarks[8][2] = { { 20.0, 20.0 }, { 20.0,... |
a16bb0c4fe7b26af72a982ed344be4d65cffdd52 | f58aa3f79c7a78f93b74ef61155c8c1dec6dd993 | dungtran73/Cpp | /ClassMyPoint/ClassMyPoint/MyPoint.cpp | C++ | cpp | 645 | no_license | #include "MyPoint.h"
#include <iostream>
#include <math.h>
using namespace std;
MyPoint::MyPoint()
{
}
MyPoint::~MyPoint()
{
}
MyPoint::MyPoint(int x, int y)
{
mPosX = x;
mPosY = y;
}
void MyPoint::Display()
{
cout << "(" << mPosX << "," << mPosY << ")" << endl;
}
void MyPoint::SetX(int x)
{
mPosX = x;
}
in... |
9db0aa6e6dde4032f2b2c0d9d4f7fc2873301e92 | 7f18387b7c2213a6972aa8b3b88ecee2f46d323b | DamonHolland/Matrix-Reduction-Calculator | /Rational.cpp | C++ | cpp | 9,117 | no_license | #include "Rational.h"
#include <string>
//***************************************************************************
//Constructor: Rational
//
//Description: Default Constructor for rational. Initializes numerator to 0
// and denominator to 1
//
//Parameters: None
//
//Returned: None
//********************... |
c74b4a79f01b891d0f8f7d13126e91d2535c7caa | d53b46884a659f32bcda3b75aba87900c939d1c4 | hackovh/- | /src/utils/vmpi/testapps/vmpi_ping/StdAfx.cpp | C++ | cpp | 501 | no_license | //========= Copyright © 1996-2005, Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
// $NoKeywords: $
//
//=============================================================================//
// stdafx.cpp : source file that includes just the standard includes
// vmpi_ping.pch will be the pre-compil... |
9a533f65f27ee38304dfc5ec9492a32445f78d38 | d04e28c9fc6387e4ed9b6dcb8fa4b4e8d0ef5f4a | merydwin/IrrlichtV2 | /source/Irrlicht/CMD2MeshFileLoader.cpp | C++ | cpp | 13,033 | permissive | // Copyright (C) 2002-2012 Nikolaus Gebhardt
// This file is part of the "Irrlicht Engine".
// For conditions of distribution and use, see copyright notice in irrlicht.h
#include "IrrCompileConfig.h"
#ifdef _IRR_COMPILE_WITH_MD2_LOADER_
#include "CMD2MeshFileLoader.h"
#include "CAnimatedMeshMD2.h"
#include "os.h"
na... |
63f0bdc88c26a90732f8fee3bd3efab7bd215857 | 34b73bf881a2ad9aa98e6c9a088dd7add69dc50b | SiChiTong/gvio | /include/gvio/msckf/imu_state.hpp | C++ | hpp | 2,559 | permissive | /**
* @file
* @ingroup msckf
*/
#ifndef GVIO_MSCKF_IMU_STATE_HPP
#define GVIO_MSCKF_IMU_STATE_HPP
#include "gvio/util/util.hpp"
#include "gvio/quaternion/jpl.hpp"
namespace gvio {
/**
* @addtogroup msckf
* @{
*/
/**
* IMU State Config
*/
struct IMUStateConfig {
EIGEN_MAKE_ALIGNED_OPERATOR_NEW
// Initial... |
65192e4484307ce2ac95594b19a5628168f7330e | 0799ad0094aa984d57ec9e82b0cedff7530ea9cc | decorus-kazuma/gptp-burningground | /GPTP/hooks/update_status_effects_inject.cpp | C++ | cpp | 688 | no_license | #include "update_status_effects.h"
#include "../hook_tools.h"
namespace {
const u32 Hook_UpdateStatusEffects = 0x00492F70;
//Inject with jmpPatch()
void __declspec(naked) updateStatusEffectsWrapper() {
CUnit *unit;
__asm {
PUSHAD
MOV EBP, ESP
MOV unit, EAX
}
hooks::updateStatus... |
b9a07f7916a4166f1af0ca1805f923436a1789e9 | e7f4f3a385a763a4cd135a2673f59670e08139fd | Javen9527/CPP-Skill | /一个完整的类.cpp | C++ | cpp | 1,702 | no_license | #include <iostream>
#include <string>
using namespace std;
class myClass
{
public:
myClass(const string s = string("")) ://默认构造
m_s(new string(s)),
m_id(0)
{
cout << "默认构造调用..." << m_s << endl;
}
myClass(const myClass& mc) //拷贝构造
{
m_id = mc.m_id;
if (m_s... |
08e1ea18fd0f08cb38973d327f3397a772e23718 | 292047d003fb059f87c9ed4bc7e36c7428f26a4c | coolxiaox/oryol | /code/Modules/Input/touch/panDetector.cc | C++ | cc | 3,189 | permissive | //------------------------------------------------------------------------------
// panDetector.cc
//------------------------------------------------------------------------------
#include "Pre.h"
#include "Core/Assert.h"
#include "panDetector.h"
namespace Oryol {
namespace _priv {
//----------------------------... |
6bb94ba45de0c9681d159446482245b4acf839cb | 7371cbd4d17e348e3b7262ec94ba95b78fc00769 | JuanYelinger/ITKSphinxExamples | /src/Filtering/ImageIntensity/InvertImage/Code.cxx | C++ | cxx | 2,720 | permissive | /*=========================================================================
*
* Copyright NumFOCUS
*
* 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.or... |
d38682bd3fb37655580f5ce0541414146a80ced6 | 9efb2b9580986ea9afd53fde69f056800ff9141f | GithubAtBob/vtsServer | /vtsServer/db/DBEllipseHandler.cpp | C++ | cpp | 8,776 | no_license |
#include "StdAfx.h"
#include "DBEllipseHandler.h"
#include <QSqlQuery>
#include <QVariant>
#include "hgSqlInsertCmd.h"
#include "hgSqlUpdateCmd.h"
#include "hgSqlRemoveCmd.h"
#include "hgSqlSelectCmd.h"
#include "hgSqlOperator.h"
#include "OverLoad.h"
DBEllipseHandler::DBEllipseHandler(void)
{
}
DBEllipseHandler... |
3e59a5eb42876b7ce0421f720343b203bc883b68 | f7e17ee1f2fafd57efafc02e12c0078bdc8e2a74 | skimanner/nihilo | /src/qt/editaddressdialog.cpp | C++ | cpp | 3,991 | permissive | // Copyright (c) 2011-2013 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Nihilo Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "editaddressdialog.h"
#include "ui_editaddressdialog.h"
#incl... |
fd00cc1a11b455f74440b3a9f8fcae8a1a93f8c2 | 32e23e4de4152dc616e49a54585d97e3d12334f4 | ileonidmas/SmurfWalletOW | /NotificationDll/DllMain.cpp | C++ | cpp | 1,313 | no_license | #include <windows.h>
//these variables will be shared among all processes to which this dll is linked
#pragma data_seg("Shared")
HWND _mainHwnd = nullptr;
#pragma data_seg() //end of our data segment
#pragma comment(linker,"/section:Shared,rws")
// Tell the compiler that Shared section can be read,write and shared
us... |
6f28c9fbf8b56c1b7afd7b4891ac695792803402 | 9c5b0590c178a016e428ea354e9658e281dda71c | hhsaez/crimild | /core/src/Foundation/NonCopyable.hpp | C++ | hpp | 2,207 | permissive | /*
* Copyright (c) 2013, Hernan Saez
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of con... |
a69d53f94c76afad3dca533aab37552aed06ac13 | bc13dcf43bf9164bbc7af9d85d781be1440191d9 | mizan-cs/Practise-Code | /binary.cpp | C++ | cpp | 699 | no_license | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, i, arr[50], values, first, last, middle;
cout<<"Enter total number of elements :";
cin>>n;
cout<<"Enter "<<n<<" number :";
for (i=0; i<n; i++)
{
cin>>arr[i];
}
cout<<"Enter a number to find :";
cin>>values;
first = 0;
last = n-1;
middle = ... |
7794a681559bf332b266ae9e9294949d93a6930b | 966d84e5359142a7f8f451db41075d9287a92298 | kleinweby/pkes | /Aufgabe2/fly_sensor.cpp | C++ | cpp | 842 | permissive | #include "fly_sensor.h"
#include <math.h>
FlySensor::FlySensor(){
flydurino = new Flydurino();
}
/**
* @brief Convert two ACC values to an orientation
*
* In general you get two forces, either in (z,x), (z,y), or (x,y). Your task is
* to translate these "2D-vector" into angle in degree, not rad! That's it ...
... |
b961b112da5e61bc7d01724c0569c08aa9a4753e | f56a57a306644ec95a2ed6deb703c778338abbb1 | nazkord/ASD | /SortingAlgorithms/HeapSort.cpp | C++ | cpp | 1,379 | no_license | #include <iostream>
int const N = 9;
int heapSize = N;
void swap(int T[N], int a, int b) {
int temp = T[b-1];
T[b-1] = T[a-1];
T[a-1] = temp;
}
//Wrzuca element o indeksie i na swoje prawidlowe miejsce na dole
//aby kopiec o korzeniu i byl kopcem typu max
void maxHeapify(int T[N], int i) {
if(i > he... |
97166fc0545d48a51fac513b2186469ac948d547 | 63f0ca0b69a85bbb592199b242d377780b46838e | Hser2bio/Pawcoin | /src/test/checkblock_tests.cpp | C++ | cpp | 1,862 | permissive | // Copyright (c) 2013-2014 The Bitcoin Core developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
//
// Unit tests for block.CheckBlock()
//
#include "clientversion.h"
#include "main.h"
#include "utiltime.h"
#include... |
18b7d993124fd7704138f1f9a48dd22a863b155e | 2eee57a8ab2f36a8e2411318e1c060cd55121084 | colinw7/CSVG | /src/CSVGAnimateMotion.cpp | C++ | cpp | 3,836 | permissive | #include <CSVGAnimateMotion.h>
#include <CSVGMPath.h>
#include <CSVGPath.h>
#include <CSVG.h>
#include <CSVGLog.h>
#include <CStrUtil.h>
/* Attributes:
<Core>
<Conditional>
animation event attributes
xlink attributes
animation attribute target attributes
animation timing attributes
animatio... |
8f4890cf722da0822a91da3a0a2a905dcbe67b6a | 7ab7c34b77dafa69c04381dedd5eea6a02df4316 | sunville/codeforce | /110A.cpp | C++ | cpp | 431 | no_license | #include <iostream>
using namespace std;
bool luckyDigits(long long int n){
int number = 0;
while(n>0){
if (n%10 != 7 && n%10 != 4)
{
n /= 10;
continue;
}
else{
number++;
n /= 10;
}
}
if(number == 4 || number == 7)
return true;
else
return false;
}
int main(int argc, char const *argv[... |
e3f7171bff91e7c4498a4a6bb0ade57fdfd40cb6 | 98d988b2c04e3b978eae9f15c509ccfbaf261f8b | rahulk90/mcmc_directed_spanning_tree | /MCMC_spanning_tree_nonzero_root.cpp | C++ | cpp | 8,241 | permissive | /* Generate an MCMC estimate of the edge appearance probabilities of a graph
* in the directed spanning tree polytope by sampling random spanning trees
*
* Author : Rahul G. Krishnan
* Inst. : NYU
*/
#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_traits.hpp>
#include <b... |
ad2320f7f88b55849b23a7dcd6a0cc7d1644078b | c32eda4a8db1c00a6a2a5836ab8bb53aafce59ee | rachanaramanna/rocALUTION | /src/solvers/krylov/bicgstabl.hpp | C++ | hpp | 3,350 | permissive | /* ************************************************************************
* Copyright (c) 2018-2020 Advanced Micro Devices, Inc.
*
* 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 witho... |
f750bbbca56c62b1fcefbfab601a76670324598b | 91076edd952b6a81b22df7812dc648122ee925b7 | GabrielCortizo/Competitive-Programming | /Contests/Codeforces/Rounds/Div 2/Codeforces Round #532(Div 2)/e.cpp | C++ | cpp | 1,369 | no_license | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
const int ms = 1e+5 + 9;
vector<iii> g[ms];
vector<int> sol,ord;
int posi[ms];
bool visit[ms], cicle[ms];
int n,m;
bool dfs(int no, int k){
if(cicle[no]) return 0;
if(visit[no]) return 1;
visit[no] = cicle[no] = 1;
... |
062056c468943ee3420a0a2163b2b8aee840901b | c3a3fef8b8ad6595ea0a7e05b10b03aabe3414ea | mikedn/runtime | /src/coreclr/vm/cominterfacemarshaler.cpp | C++ | cpp | 12,518 | permissive | // Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
//
// File: ComInterfaceMarshaler.cpp
//
#include "common.h"
#include "vars.hpp"
#include "excep.h"
#include "stdinterfaces.h"
#include "interoputil.h"
#include "comcallablewrapper.... |
8135e8df998d2c4f35d0895b294d1538d1481cdf | d1a32e860a8a48b1ee63be31aea332f66c30309f | igor-sadchenko/brig | /database/detail/sql_select.hpp | C++ | hpp | 4,039 | permissive | // Andrew Naplavkov
#ifndef BRIG_DATABASE_DETAIL_SQL_SELECT_HPP
#define BRIG_DATABASE_DETAIL_SQL_SELECT_HPP
#include <algorithm>
#include <brig/boost/envelope.hpp>
#include <brig/boost/geom_from_wkb.hpp>
#include <brig/boost/geometry.hpp>
#include <brig/database/command.hpp>
#include <brig/database/detail/d... |
56e2a1af4a9654f185d9f691307064627c7efc55 | 384a7d0969f5803969e7317016c5e155d2f54f68 | JoeConley/openglfun | /Ray Tracer/Samplers/NRooks.cpp | C++ | cpp | 1,945 | no_license | /*
* NRooks.cpp
* Ray Tracer
*
* Created by NoEvilPeople on 9/13/08.
* Copyright 2008 jmc2385@rit.edu. All rights reserved.
*
*/
#include "NRooks.h"
NRooks::NRooks(void)
: Sampler()
{}
NRooks::NRooks(const int num_samples)
: Sampler(num_samples) {
generate_samples();
}
// -----------------------------... |
890fd441cf8da3ac1cdeeeda19f2ec2e69f70863 | 7d28da2c53d922ec989dc8c6c14db810a8f6b8c3 | jsj2008/specialView | /SDKUsage6/VBMapViewer-SKT/VbNavKit-iOS/Classes/vbCamera/vbTrackCameraControl.hpp | C++ | hpp | 2,443 | permissive | //
// Header.h
// VbNavKit-iOS
//
// Created by Dev4_Air on 13. 2. 6..
// Copyright (c) 2013년 dev4. All rights reserved.
//
#ifndef VbNavKit_iOS_vbTrackCameraControl_h
#define VbNavKit_iOS_vbTrackCameraControl_h
#include "vbRotateCameraControl.hpp"
class vbTrackCameraControl : public vbRotateCameraControl
{
publ... |
80fb0f899a0def1e062d7233bf3c1379828c73ef | 29e906c2102ed357da0f4450100e8e0cf87c372f | itcgames/ARGO_2018_19_C | /ARGO/Die.cpp | C++ | cpp | 327 | no_license | #include "Die.h"
void Die::idle(AnimationComponent* a)
{
//std::cout << "Going from Left to Idling" << std::endl;
a->setCurrent(new Idle());
a->setCurrentState(a->idleS);
// destRect.y = 531.3;
a->sRect.y = 0;
a->sRect.h = 100 * a->m_scale;
a->sRect.w = 80 * a->m_scale;
a->sRect.x = 80 * a->m_scale;
delete th... |
680d5b23b93e69c7faf3193924ed024f77499118 | f56b5eb0d3e71bad9ec3155ad6a7a91c31b039cc | zhangxinqian/ZhangXinqian-s-Projects | /其他/BlackJack/BlackJack/Player.cpp | C++ | cpp | 570 | no_license | #include "Player.h"
Player::Player(double _balance,int _burstValue):Gambler(_burstValue)
{
ID=0;
response=false;
balance=_balance;
}
Player::~Player(){}
inline bool Player::isHitting() const
{
return response;
}
//inline void Player::request(bool r)//加上inline报错，不知道为什么？
void Player::request(bool r)
{
response=r... |
cfed45bb219fc32f0529d4dc901732bb5a0e141d | 80ff278b91093d1166fc082015e70bc5457786bb | Auriatta/ParticleMotif | /Emitter.cpp | C++ | cpp | 8,053 | no_license | /*
* Copyright (c) <2021> <Alex 'Auriatta' Ates>.
All rights reserved.
Redistribution and use in source and binary forms are permitted provided
that the above copyright notice and this paragraph are duplicated in all
such forms and that any documentation, advertising materials, and other
materials related to su... |
494f57689d2e3ad2570d9688d58b88bf02d15070 | 0978d5738fa3a0aedfbd47115542400861c11251 | Bekon0700/Competitive_Programming | /C++/2_Public_vs_private_access_specifiers.cpp | C++ | cpp | 871 | no_license | #include<stdio.h>
#include<iostream>
using namespace std;
class Point{
int x,y,z;
public:
void print(){
printf("x:%d y:%d z:%d\n",x,y,z);
}
void setPoint(int a,int b,int c)
{
x = a;
y = b;
z = c;
}
void copyPoint(const Point &p)
{
x = p.x;
... |
e6d99ff4c9f6d93ff99f9d7773591eb4e9589dbe | 9e01419b09262edb00f894fa7e70ec1176f7efda | PiasRoY/SGIPC | /CP3/Graph Theory/UVA-10369/main.cpp | C++ | cpp | 1,262 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MX 505
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
pii point[MX];
int parent[MX], mst, s, p;
vector <pair<double, pii> > edgelist;
int find(int u)
{
if(u == parent[u]) return u;
re... |
24345b6f7f9cc69c97a83de11d6766dce988b990 | 5037b05fc517651387865bdf805c769dd180fad4 | touriumonline/tourium | /src/rpcwallet.cpp | C++ | cpp | 109,382 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2015-2017 The ALQO developers
// Copyright (c) 2017-2018 The Tourium developers
// Distributed under the MIT software l... |
605deb86f00083655b2f7d8ff6966b308fa61c6b | 9472cc9b48e85ccea04c5261426cbd9ccba8ec21 | btmd/masterthesis | /Feature.cpp | C++ | cpp | 1,425 | no_license | /*
* Feature.cpp
*
* Created on: 01.02.2013
* Author: tmd
*/
#include "../include/Feature.h"
using namespace std;
using namespace cv;
Feature::Feature()
{
/*
* Stand: 5.11.13
*/
gfttdetector = new GFTTDetector();
siftextractor = new SiftDescriptorExtractor();
fastdetector = new FastFeatureDetecto... |
d327aba6a7a81e35ef1d1905fa265da761e29a99 | ae7996d24be44b61742b9dadf0fb3e3700dde319 | boom210232/CPP2020 | /cpp/fire.cpp | C++ | cpp | 1,195 | no_license | #include <iostream>
#include <list>
#include <vector>
using namespace std;
int count = 0,N,K,x,y;
bool land[10001][10001];
int directiony[4] = {0, 0, 1,-1};
int directionx[4] = {1,-1, 0, 0};
bool inbound(int x, int y) {
if ( x > N-1 || y > N-1|| x < 0 || y < 0){
return false;
}
return true;
}
void bfs(... |
315c57fa366a69820c07bba5ac5aa5463df3d343 | f3dfa803f9e7b88c2bbd488148e6999799872888 | godbanyan/compute-runtime | /opencl/test/unit_test/program/kernel_info_from_patchtokens_tests.cpp | C++ | cpp | 23,634 | permissive | /*
* Copyright (C) 2019-2021 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#include "shared/source/device_binary_format/patchtokens_decoder.h"
#include "shared/test/unit_test/device_binary_format/patchtokens_tests.h"
#include "shared/test/unit_test/helpers/debug_manager_state_restore.h"
#include "openc... |
4263880704c313e50bfed5309683ce19d8937ea2 | e8bcc32e9ed9c417f84d34186413f65465531a4b | pongmaniatic/FGAIGame | /FGAI/Source/FGAI/FGCharacter.cpp | C++ | cpp | 5,086 | no_license | #include "FGCharacter.h"
#include "Camera/CameraComponent.h"
#include "Components/CapsuleComponent.h"
#include "Components/InputComponent.h"
#include "Kismet/GameplayStatics.h"
#include "Components/SkeletalMeshComponent.h"
#include "Components/FGMovementComponent.h"
#include "FGMovementStatics.h"
#include "Kismet/Kisme... |
5205dca8b45e8ce0f8e378839b7ac7fe0d771f35 | bf49e84760499d44669b0ea504a9b12bf89cbb92 | ExiaHan/oatdump_plus | /runtime/interpreter/interpreter.cc | C++ | cc | 29,783 | permissive | /*
* Copyright (C) 2012 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by app... |
09548285fe7510abd52ee98934e80fc92eba87ca | d5c4198500e57412755a41e087bc9e6a90cf5749 | yulizhou/leetcode-exercise | /2.AddTwoNumbers.cpp | C++ | cpp | 849 | no_license | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* res = new ListNode(-1);
ListNode* cur = res;
... |
15453016862d570a4b12c4367080543e2663ecc8 | 6da80c3780b7cd6695eac2f50239b111780072b4 | 1838641320/newbee_code_store | /21.1/P5325 min_25筛.cpp | C++ | cpp | 2,039 | no_license | #include<iostream>
#include<algorithm>
#include<cstring>
#include<complex>
#define rep(i,a,b) for(int i=a,_b=b;i<_b;i++)
#define mem(a,b) memset(a,b,sizeof(a))
typedef long long ll;
template<class A>void read(A&a){
a=0;int c=getchar(),f=0;
for(;!isdigit(c);c=getchar()) f|=c=='-';
for(;isdigit(c);c=getchar()) a=a*10+... |
e0780f6a666264b197301047b602554ca1ee31ab | 3d172c58c0641b5ba2ed800a66d813c5a137eff2 | alcubierre-drive/clmagma | /interface_opencl/dlarfgx-v2.cpp | C++ | cpp | 9,101 | no_license | /*
-- clMAGMA (version 1.1.0) --
Univ. of Tennessee, Knoxville
Univ. of California, Berkeley
Univ. of Colorado, Denver
@date January 2014
@generated from zlarfgx-v2.cpp normal z -> d, Fri Jan 10 15:51:19 2014
*/
#include <cstdio>
#include "CL_MAGMA_RT.h"
#include "common_magma.... |
39511e2cfbadcc6986abeb0b9a064537ce10f8b5 | b046778c8761ea1b783ac0423b18b922371895b5 | chago/Dobby | /source/core/modules/codegen/codegen-arm64.cc | C++ | cc | 541 | permissive | #include "common/macros/platform_macro.h"
#if defined(TARGET_ARCH_ARM64)
#include "dobby_internal.h"
#include "core/modules/codegen/codegen-arm64.h"
namespace zz {
namespace arm64 {
void CodeGen::LiteralLdrBranch(uint64_t address) {
TurboAssembler *turbo_assembler_ = reinterpret_cast<TurboAssembler *>(this->assemb... |
43986a7321e03d42e81ee834c612c911522c6de8 | f1df00e6577770cb253156ba8b8e85134bb7e4e3 | remymuller/boost.simd | /bench/function/scalar/minmag/regular.float.m10_10_m10_10.cpp | C++ | cpp | 818 | permissive | // -------------------------------------------------------------------------------------------------
// Copyright 2016 - NumScale SAS
//
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE.txt or copy at
// ... |
6371e25b407bc96731211909a1b235ee97b0e655 | 65d42ed980b9841361320c4204451ae8508f8e65 | Ayush152/DSA | /Codechef/solubility.cpp | C++ | cpp | 243 | no_license | #include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
while(t--){
int x, a, b;
cin >> x >> a >> b;
int c= a + (100-x)*b;
cout << 10*c << endl;
}
return 0;
}
|
d3ebb43ee0d888af02a8bece0e6019dada247912 | 15127025bfd1972c7888f6d598fc6859563711dc | Anastasiyah/DialogueGame | /Intermediate/Build/Win64/UE4Editor/Inc/DialogueGame/DialogueGameCharacter.gen.cpp | C++ | cpp | 6,059 | no_license | // Copyright 1998-2017 Epic Games, Inc. All Rights Reserved.
/*===========================================================================
Generated code exported from UnrealHeaderTool.
DO NOT modify this manually! Edit the corresponding .h files instead!
==============================================================... |
1448ba1370c7944a539c0d030ecd0fdcfc504645 | b22019939f079d2e3059de8205726396305e0007 | MishaVernik/LeetCode | /Algorithms/Letter Tile Possibilities/solution.cpp | C++ | cpp | 1,136 | permissive | /**
You have a set of tiles, where each tile has one letter tiles[i] printed on it. Return the number of possible non-empty sequences of letters you can make.
Example 1:
Input: "AAB"
Output: 8
Explanation: The possible sequences are "A", "B", "AA", "AB", "BA", "AAB", "ABA", "BAA".
Example 2:
Input: "AAABBC"
Outp... |
7214e77319b42820c189b6357ec4952314c6549a | 4ddd8dfe6400dd84a6e76f3f80499132a5df48d5 | facebook/fbthrift | /thrift/compiler/test/fixtures/adapter/gen-py3/module/metadata.cpp | C++ | cpp | 2,923 | permissive | /**
* Autogenerated by Thrift
*
* DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
* @generated
*/
#include "thrift/compiler/test/fixtures/adapter/src/gen-py3/module/metadata.h"
namespace facebook {
namespace thrift {
namespace test {
::apache::thrift::metadata::ThriftMetadata module_getThriftMo... |
f3984b3d37260ddfc21fb29bae3dbc53c3c79c43 | 0b1c3cfe6a3cd1f6a49b7d731d999771904c7c0a | alexandraback/datacollection | /solutions_2449486_0/C++/Starzu/main.cpp | C++ | cpp | 1,013 | no_license | #include <iostream>
using namespace std;
int main() {
int t, n, m, mx;
int tab[101][101];
bool check[101][101];
cin >> t;
for (int it=0; it<t; ++it) {
cin >> n >> m;
for (int i=0; i<n; ++i)
for (int j=0; j<m; ++j) {
cin >> tab[i][j];
check[i][j]=false;
}
//Poziomo
for (... |
356e16d54871dcb1eda585d334afa785f2621a37 | fde2827a323dd02f6944e60a092e66e53546c303 | pingpan2013/coding-exercises | /Array/remove_duplicates_from_sorted_array_ii.cc | C++ | cc | 932 | no_license | /*
* =====================================================================================
*
* Filename: remove_duplicates_from_sorted_array_ii.cc
*
* Description: remove duplicates from sorted array II
*
* Created: 01/13/2015 23:36:24
* Compiler: g++ 4.7.0
*
* ======================... |
d285c40bdd617aa5e5dc4bbe84db987e8f26ed67 | 6e9836513580d11ac0343c515da1bb1762b357fa | igor-sadchenko/brig | /proj/detail/lib.hpp | C++ | hpp | 1,470 | permissive | // Andrew Naplavkov
#ifndef BRIG_PROJ_DETAIL_LIB_HPP
#define BRIG_PROJ_DETAIL_LIB_HPP
#include <brig/detail/dynamic_loading.hpp>
#include <brig/global.hpp>
#include <proj_api.h>
namespace brig { namespace proj { namespace detail {
class lib {
lib();
public:
decltype(pj_ctx_alloc) *p_pj_ctx_alloc... |
42db0a19a58e4fb19ee52f84ad3e42ba0ba98bfa | f013f02bb14bcfc6dc7d2513118a4a34b1485206 | VictorDutca/QFit | /buildFolder/moc_qfitcorsa.cpp | C++ | cpp | 3,472 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'qfitcorsa.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.9.5)
**
** WARNING! All changes made in this file will be lost!
***********************************************************... |
e7ccebc4f528c67be59051b506d9b004e348cec4 | e059b663e295e0cf12c70049847bb3266d031a7d | royalsoftkv/dexergi | /src/utilmoneystr.cpp | C++ | cpp | 2,206 | permissive | /* Copyright (c) 2019-2020 The Dexergi Developers */
// Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2017-2018 The PIVX developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-... |
2169b716024291fe21777363031ad1f314444ccc | 745bc439f330444fa8981a613b5358e038d8fe5e | limon2009/ACM-UVA-Online-Judge-solution | /10226.cpp | C++ | cpp | 1,167 | no_license | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define MAXN 10001
/* 10001*/
int N;
int Total;
struct Wood {
char Nam[31];
double Fre;
}Sp[MAXN],tree;
int com(const void *a, const void *s) {
Wood *c = (Wood *)a;
Wood *d = (Wood *)s;
return strcmp( c->Nam ,d->Nam );
}
void Read... |
0e39b9b95d7955c19606e46ec005bf119d69f9ae | aa15ce7b118da19fb2cb4cbc4870bddd6cdc52ca | splucs/Competitive-Programming | /RPC/2017 round 6/park.cpp | C++ | cpp | 631 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int t,n,l,ccount,w,p;
double area;
char c;
cin>>t;
while (t-->0){
cin>>n;
ccount = p = w = 0;
area = 0;
for (int i=0;i<n;i++){
cin>>c>>l;
if (c=='C'||c=='S')ar... |
05ce7b28321281c05e396db8b30a1954239df868 | 51614e5c7832136e6bd8877fd5abdc04a30657f4 | patrykchodur/agh_advancedcpp | /include/board.hpp | C++ | hpp | 1,769 | no_license | #ifndef BOARD_HPP
#define BOARD_HPP
#include <vector>
#include <curses.h>
#include <string>
#include <set>
class Board {
int m_width;
int m_height;
using board_array_t = std::vector<std::vector<bool>>;
public:
Board(int width, int height);
void set_rules(const std::set<int>& survives, const std::set<int>& bor... |
d1f98cf35732549a4d22cf9198ffc0e67deb18c5 | ee35c4b0b909b12ce63d32ff625bb5e7a9e7a79f | KenSporger/qt5-learning | /variant/main.cpp | C++ | cpp | 1,237 | no_license | #include <QCoreApplication>
#include <QVariant>
#include <QMap>
#include <QList>
#include <QDebug>
#include <QColor>
void variantTest()
{
QVariant vInt(10);
qDebug() << vInt.toInt();
QVariant vStr("Hello World!");
qDebug() << vStr.toString();
QMap<QString, QVariant> map;
map["int"] = 10;
... |
78a434df02756b0919d92b23b00a942b24e23209 | 22984bf3571ab3b125bbcda16632dda7a900d838 | leekhai18/Metroid | /Metroid/Metroid/SpriteManager.cpp | C++ | cpp | 2,361 | no_license | #include "SpriteManager.h"
SpriteManager* SpriteManager::instance = nullptr;
const SpriteData* SpriteManager::getSpritesData()
{
return this->spritesData;
}
SpriteManager * SpriteManager::getInstance()
{
if (instance == nullptr)
instance = new SpriteManager();
return instance;
}
bool SpriteManager::initialize(c... |
edf0479c94c862363ce2adbf7596a1c6064d4ac0 | faa249558ddd2e3c82e5c3f9dde572d1d6266fb2 | TeamVault/tauCFI | /C++ Benchmark Programs/Benchmark Files 1/classtester/autogen-sources/source-6731.cpp | C++ | cpp | 2,412 | no_license | struct c0;
void __attribute__ ((noinline)) tester0(c0* p);
struct c0
{
bool active0;
c0() : active0(true) {}
virtual ~c0()
{
tester0(this);
active0 = false;
}
virtual void f0(){}
};
void __attribute__ ((noinline)) tester0(c0* p)
{
p->f0();
}
struct c1;
void __attribute__ ((noinline)) tester1(c1* p);
struct c1
{
bool ac... |
061cd39fa25612e1745ea62df5b8416545d64d34 | b948895b61273a740f52944ef19b98ceb5fdf9fd | SymbianSource/oss.FCL.sf.mw.remotemgmt | /policymanagement/policyengine/policyengineserver/src/TrustedSession.cpp | C++ | cpp | 46,426 | no_license | /*
* Copyright (c) 2002-2004 Nokia Corporation and/or its subsidiary(-ies).
* All rights reserved.
* This component and the accompanying materials are made available
* under the terms of "Eclipse Public License v1.0"
* which accompanies this distribution, and is available
* at the URL "http://www.eclipse.org/legal/epl... |
082c606e1cad1b7ee57af727835264f2ae949afd | 14313b0d2094c5fb53f9c40bfe6e864502e67b6d | mgandi/WeatherLink | /WeatherLinkLauncher/weatherlinklauncher.cpp | C++ | cpp | 4,169 | no_license | #include "weatherlinklauncher.h"
#include <QtSql/QSqlDatabase>
#include <QtSql/QSqlQuery>
#include <QtSql/QSqlError>
#include <QDebug>
#include <QProcess>
#include <QCoreApplication>
#include <QDir>
class WeatherLinkLauncherPrivate
{
public:
QString dbPath;
QList<QProcess *> processes;
};
WeatherLinkLaunche... |
f8c2d7b3d1edf459a28c04ce66dc6e8c12c41848 | ce9fc6373b0940257855e1906101d42339ee52ea | boyliang/mcsema | /mcsema/Arch/ABI.cpp | C++ | cpp | 26,443 | permissive | /*
* Copyright (c) 2017 Trail of Bits, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law o... |
5a13c830754480b63c052a879b57f8f1372d94e9 | 3c64c50debc651f4e8fdee3eefacb101d3d77db9 | KernelPanic-OpenSource/Win2K3_NT_admin | /wmi/wbem/winmgmt/provsubsys/decoupledadaptor/provevt.cpp | C++ | cpp | 26,864 | no_license | /*++
Copyright (C) 1996-2001 Microsoft Corporation
Module Name:
XXXX
Abstract:
History:
--*/
#include "PreComp.h"
#include <wbemint.h>
#include <stdio.h>
#include <NCObjApi.h>
#include "Globals.h"
#include "CGlobals.h"
#include "ProvEvents.h"
#include "ProvEvt.h"
/*******************************************... |
836779af72027f6bce25c12a7374b76917beee4e | 229012194013854d975cd924f01da744fb7501d6 | DeepWolf413/additional-native-data | /rdr2/0xDF504BECEB15DA93.cpp | C++ | cpp | 1,553 | no_license | // pause_menu.ysc @ L7244
void func_235(int iParam0, char* sParam1, char* sParam2, bool bParam3, bool bParam4, bool bParam5, bool bParam6, int iParam7, int iParam8, int iParam9, char* sParam10)
{
DATABINDING::_DATABINDING_WRITE_DATA_STRING(Global_1955569.f_5.f_147.f_24[iParam0 /*23*/].f_4, sParam1);
DATABINDING::_D... |
0758500c62d984fb75c11aeaf009111297795dec | 7853326eaf633d9e05fac355380412870aa5e5ab | DJLee68/2-2OOP | /20154652이동재project/Game.cpp | C++ | cpp | 5,260 | permissive | #include <iostream>
using namespace std;
#include <windows.h>
#include "Game.h"
#include "Probability.h"
#include "kicker.h"
#include "keeper.h"
#include "Player.h"
Game::Game(){
game_count = 0;
cout << "-------승부차기 게임을 시작합니다.-------\n\n\n";
Sleep(1200);
cout << "플레이 방법: \n";
cout <<... |
d030512884e718a8e1b0aaed2c3e3e0da98c4bf2 | 6e10ffa3d64f0bdb57931c78b76b6806acf538e2 | haydenroche5/rpi_audio_visualizer | /bin/src/visualizer.cpp | C++ | cpp | 8,621 | no_license | #include "led_matrix/led-matrix.h"
#include "portaudiocpp/AutoSystem.hxx"
#include "portaudiocpp/Device.hxx"
#include "portaudiocpp/DirectionSpecificStreamParameters.hxx"
#include "portaudiocpp/StreamParameters.hxx"
#include <boost/program_options.hpp>
#include <boost/thread.hpp>
#include <getopt.h>
#include <iostrea... |
abae6d9c430c50112aec481166bbc4e5a54d2b53 | 5b23868eb3cfe9af39e3c899d8d2fb01841cfbd7 | njaard/meow | /akode/plugin.cpp | C++ | cpp | 1,028 | no_license | /* aKode: PluginHandler parent-type
Copyright (C) 2011 Charles Samuels <charles@kde.org>
This library 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 3 of the License,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.