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 |
|---|---|---|---|---|---|---|---|---|
3c10ff62f4449f75cfa63c19853f3381d3898d7d | 0a8fddbdbf4f11d1623f509b0c7fecd7d21d8ac4 | peppsac/micmac | /src/uti_phgrm/CPP_Campari.cpp | C++ | cpp | 26,522 | permissive | /*Header-MicMac-eLiSe-25/06/2007
MicMac : Multi Image Correspondances par Methodes Automatiques de Correlation
eLiSe : ELements of an Image Software Environnement
www.micmac.ign.fr
Copyright : Institut Geographique National
Author : Marc Pierrot Deseilligny
Contributors : Gregoire Maillet, ... |
5c3d3216ef8791b9969c81e0fc751eb3759f68e4 | 8b739ade12bdfea5f996996953f740aa471896fc | jtg-gg/chromium.src | /mojo/shell/tests/package_apptest.cc | C++ | cc | 2,802 | 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 <stddef.h>
#include <stdint.h>
#include <utility>
#include "base/bind.h"
#include "base/macros.h"
#include "base/run_loop.h"
#include "mojo/she... |
48df6e05c5bab871a0884923aa43ba786d57e966 | 47a6636875be6f760730f399a95c1d920dfb887a | Stalker2106x/StbxEngine | /src/Engine.cpp | C++ | cpp | 5,610 | permissive | #include "Engine.hpp"
#include "Console.hh"
using namespace stb;
stb::Engine *stb::Engine::instance = NULL;
Profile *stb::Engine::profile = NULL;
tgui::Gui *stb::Engine::gui = NULL;
Console *stb::Engine::console = NULL;
Engine::Engine()
{
instance = this;
_framerate = 0;
_lastSecondTick = sf::Time::Zero;
_quit =... |
b53a85243d344200afc2d75a8b22c3664cb6c57b | eb5dfd5c7385f8667b853b3f2b0553d405fd1d17 | catboost/catboost | /contrib/tools/ragel6/rubytable.cpp | C++ | cpp | 25,262 | permissive | /*
* Copyright 2007 Victor Hugo Borja <vic@rubyforge.org>
* 2007 Adrian Thurston <thurston@complang.org>
*/
/* This file is part of Ragel.
*
* Ragel is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software ... |
f7a0d6802a56ba892b4ee423ed688f8613a0b177 | dc97934da5bd61db38644af6f6eb585434320f9c | cran/meshsimp | /src/hash.cpp | C++ | cpp | 1,509 | no_license | /*! \file hash.cpp
\brief Re-define hash function for user-defined classes. */
#include <algorithm>
#include "hash.hpp"
#include "boundingBox.hpp"
namespace std
{
//
// Specialization for pair<UInt,UInt>
//
size_t hash<pair<UInt,UInt>>::operator()(const pair<UInt,UInt> & p) const
{
// Extract maximum and... |
e725bf8168082865b43cdaf50a3ce98daef78361 | 1992953b70e83eb02489ab2029b883da0050c9db | marcinbielinski/Map_Tree | /main.cpp | C++ | cpp | 3,645 | no_license | #include <iostream>
#include <memory>
/*
5
/ \
4 130
/ \
3 8
DFS: 5 4 3 8 130
*/
template <typename K, typename V>
struct tree_node
{
tree_node(K&& key, V&& value)
: key(std::move(key))
, value(std::move(value))
, left(nullptr)
, right(nullpt... |
a3830e88b7bc2d77353251ed11754adddccc81ba | 1b1fdbbb3928cd9414adf9f460cd3998b8de9916 | ZeloZhang/GlobalFit-cascade | /src/systematics/interpolated_par.cpp | C++ | cpp | 3,825 | no_license | #include "../../include/systematics/interpolated_par.h"
NuFit::interpolated_par::interpolated_par(std::string par_name_, std::vector<std::string> analysis_names_)
{
par_name = par_name_;
analysis_names = analysis_names_;
basedir=std::string("/data/ana/analyses/diffuse/cascades/analysis_code/input/default/my... |
98b53d965fe67ecbbd87b19667cd31fa5db0aa98 | f2062c782794256d4aee14214d462679d830a8c0 | sbenejam/qlcplus | /plugins/dmxusb/src/euroliteusbdmxpro.cpp | C++ | cpp | 7,826 | permissive | /*
Q Light Controller Plus
euroliteusbdmxpro.cpp
Copyright (C) Karri Kaksonen based on nanodmx.cpp by Massimo Callegari
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... |
65c6c2d5928f257e41041bf03c046c64db7c022e | 1e3a0f787bbc919ae523610a3cda5e93f6b12c4d | massnetwork/mass-browser | /remoting/protocol/ssl_hmac_channel_authenticator.cc | C++ | cc | 16,496 | permissive | // Copyright (c) 2012 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 "remoting/protocol/ssl_hmac_channel_authenticator.h"
#include <stdint.h>
#include <utility>
#include "base/bind.h"
#include "base/bind_hel... |
d297e9d747213dbd8ce3a7292206e99b9592229d | 5763f5dc591fe89ce401b481eb7e4ec0f6a57689 | toshirokubota/VentricleSegmentation | /makeGraphStructure/makeGraphStructureV3.cpp | C++ | cpp | 33,306 | no_license | #include <iostream>
using namespace std;
#include <stdio.h>
#ifdef MEX_DLL
#include <mex.h>
#include "mexFileIO.h"
#endif
#include <vector>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
#include <szMexUtility.h>
#include <szMexUtilityTemplate.h>
#include <szMyNeighborOp.h>
#... |
e18f4590821926a8c0511f87dc502159b48a0b44 | 2ad0471ecb985b7e8a6953a7bccdf6618bbd40d6 | theharshmittal/GeeksForGeeksPractice | /reverse_array_in_groups.cpp | C++ | cpp | 569 | no_license | #include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--)
{
int n, k, i;
cin >> n;
int* arr = new int[n];
for(i = 0; i < n; i++)
cin >> arr[i];
cin >> k;
for(i = 0; i < n; i = i+k)
{
int left =... |
554085d6e20261b83f45f761304272fd295d923b | 4faf36babfa12ec2c33f6badaebd73ed8372600e | tectronics/minerstatemachine | /src/game/algorithms/AStar.cpp | C++ | cpp | 6,137 | no_license | #include <iostream>
#include "AStar.h"
#include "Node.h"
using namespace std;
//------------------------------------------------------------------------------
AStar::AStar(std::vector<int> vec, int columnCount, int rowCount , int initialColumn, int initialRow, int finalColumn, int finalRow)
: m_rowCount(rowCo... |
d006be2b773ba77d72e2b98187b01af2cfe8f25e | 7db9fad14d0204d306c80885ff33abd51591e700 | matthewbot/MattGameEngine | /MGE/res/system/parser.cpp | C++ | cpp | 2,516 | no_license | #include "parser.h"
#include "ResourceNode.h"
#include <MGE/util/Tokenizer.h>
using namespace mge;
using namespace std;
static pair<string, ResourceNode> parseKeyValue(StreamTokenizer &tok);
static ResourceNode::ListType parseKeyValueMap(StreamTokenizer &tok) {
ResourceNode::ListType vals;
while (true) {
Stream... |
170ab1d44ed90154ec04c989262c03ef38d34c91 | e05fe087c8c53300922d40868759f68d39f54fcb | roggproject/ROGG | /attack/sources/sender/core/SenderClient.cpp | C++ | cpp | 4,309 | no_license | #include "Defines.hh"
#include "Exception.hh"
#include "SenderClient.hh"
#include "CUSocket.hh"
#include "Help.hh"
#include "IAlgorithm.hh"
#include <regex>
#include <algorithm>
#include <iostream>
//Initialization of the ressources and properties of client
SenderClient::SenderClient()
{
try
{
//Create the... |
f4fd1a7490810582be79e1737c73e2116c6c6882 | 5a9b263e9ec1af5b5063c3b5092ecc16d873e18c | zkenxie/ecn_bluerov | /boot/old/picam_nocv.cpp | C++ | cpp | 6,525 | permissive | #include <iostream>
#include <ctime>
#include <cstdlib>
#include <fstream>
#include <sstream>
#include <raspicam/raspicam.h>
#include <ros/ros.h>
#include <image_transport/image_transport.h>
#include <cv_bridge/cv_bridge.h>
#include <sensor_msgs/Image.h>
using namespace std;
bool doTestSpeedOnly=false;
int findParam (... |
a27fd704d2474755ada8d5739f642659aed3e6ae | f751b453e389224170a2c552e5f01903f1b3cbea | maumyrtille/VoxelGameClient | /src/world/EntityPhysics.cpp | C++ | cpp | 12,976 | no_license | #include <cmath>
#include "VoxelWorld.h"
#include "EntityPhysics.h"
const EntityPhysics EntityPhysics::NONE;
EntityPhysics::EntityPhysics(
): m_type(EntityPhysicsType::NONE), m_width(1), m_height(1), m_padding(1.0f), m_paddingY(1.0f) {
}
EntityPhysics::EntityPhysics(
EntityPhysicsType type,
int width,
int heig... |
9c9be4f968838cdfa8ab23c7e8e9d72010329ef1 | 46bad5e2f17f6dba85e47cbcd021153223280b3e | dv00d00/virgil | /lib/src/VirgilCipher.cxx | C++ | cxx | 3,833 | permissive | /**
* Copyright (C) 2014 Virgil Security Inc.
*
* Lead Maintainer: Virgil Security Inc. <support@virgilsecurity.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:
*
* (1) Redi... |
846f1e1f64a7c01a0cea9c1e9dec0bfa942dbc8a | c31f9054a0eb2082a29856b6adb84569786c7624 | jpivarski-talks/1999-2006_gradschool-3 | /service/old_programs_home/findbug_svhits/src/TrackFinder/Class/TrackFinder.cc | C++ | cc | 13,372 | no_license | // -*- C++ -*-
//
// package: <TrackFinder>
// Module: TrackFinder
//
// Description: <one line class summary>
//
// Implementation:
// <Notes on implementation>
//
// Author: Adam Lyon
// Created: Thu Apr 16 16:04:52 EDT 1998
// $Id: TrackFinder.cc,v 1.14 2001/06/05 14:01:36 cdj Exp $
//
// Revi... |
009ffc7ae13396b920aaacd91429054d8be5c610 | b3cb8d27f8b691de707f58e7d45182cfbccadfe7 | huayunfly/goiot | /cpp/dataservice/s7_driver/dllmain.cpp | C++ | cpp | 655 | no_license | // dllmain.cpp : 定义 DLL 应用程序的入口点。
#include "pch.h"
#include <memory>
#include "../dataservice/driver_base.h"
#include "S7Driver.h"
std::unique_ptr<goiot::DriverBase> GetObj(void) {
return std::make_unique<goiot::S7Driver>();
}
std::string GetName(void) {
return "s7";
}
BOOL APIENTRY DllMain( HMODULE hModule... |
6b494f8b1ee46dcf60fe64afc3df7fa7c995d566 | 93385d19e1a2511821a94728db6198b630e44f66 | KratosMultiphysics/Kratos | /applications/CoSimulationApplication/custom_external_libraries/CoSimIO/co_sim_io/includes/connect_impl.hpp | C++ | hpp | 1,146 | permissive | // ______ _____ _ ________
// / ____/___ / ___/(_)___ ___ / _/ __ |
// / / / __ \\__ \/ / __ `__ \ / // / / /
// / /___/ /_/ /__/ / / / / / / // // /_/ /
// \____/\____/____/_/_/ /_/ /_/___/\____/
// Kratos CoSimulationApplication
//
// License: BSD License, see license.txt
//
// ... |
02d617e3e090226b5449f20d1587bca6982d1d15 | 476dcc3ebb4467c2c2202f2f6fc8299e2b68fc8c | JianwuXu/audio | /torchaudio/csrc/register.cpp | C++ | cpp | 4,416 | permissive | #ifndef TORCHAUDIO_REGISTER_H
#define TORCHAUDIO_REGISTER_H
#include <torchaudio/csrc/sox_effects.h>
#include <torchaudio/csrc/sox_io.h>
#include <torchaudio/csrc/sox_utils.h>
namespace torchaudio {
namespace {
////////////////////////////////////////////////////////////////////////////////
// sox_utils.h
//////////... |
2f019b17ec8fde5130acb521c6ed1b1bc7ca4064 | e879309ef6c3877081689a0865fc280d8a6a68bf | kiranrkumar/SingTracks | /Source/Controllers/TrackGenerator.cpp | C++ | cpp | 10,862 | no_license | //
// TrackGenerator.cpp
// SingTracks
//
// Created by Kiran Kumar on 10/28/19.
//
#include "TrackGenerator.hpp"
#include "AudioBufferUtilities.h"
#include "MIDITrackSynthesizer.h"
#include "../Model/VocalTrack.h"
#include "../Model/VocalBusSettings.h"
const int NUM_OUTPUT_CHANNELS = 2;
const int NUM_SYNTH_VOICE... |
823d198b6f6b1b0307f2f44fc3b2ae1067456d83 | e09f8586ea2848b98acdb9f2f45b0292dfaa311c | Masterlemos/algorithms | /UVA/Uva.10779.Collector's.Problem.cpp | C++ | cpp | 3,923 | no_license | #include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
using namespace std;
#define INF 1e9
#define MAX_V 1500
#define tipo long long
#define forr(i, b) for (int i = 0; i < b; ++i)
#define ford(i, a, b) for (int ... |
49c2cd8ecb797ffb0f4f36eb2a8d7984e35be2af | 01c932485a32f9d37956e55bf155efdd77d48902 | apcountryman/toolchain-parallax_p8x32a | /examples/c++/hello_world/main.cc | C++ | cc | 878 | permissive | /**
* toolchain-parallax_p8x32a
*
* Copyright 2017 Andrew Countryman <apcountryman@gmail.com>
*
* 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-... |
53960eb90d0f687c5d5bba1fdfff698544111578 | ca4dbca5e05758bf2cecbd4ac25804e338925fc2 | shivashish123/Competitive-Programming-Codeforces | /May2019/A4.cpp | C++ | cpp | 768 | no_license | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int g[n][2],je[m][2];
vector<int> v[n];
for(int i=0;i<n;i++)
cin>>g[i][0]>>g[i][1];
for(int i=0;i<m;i++)
cin>>je[i][0]>>je[i][1];
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(abs(je[j][1]-g[i][1])<=(je[j][0]-g[i][0]))
... |
fcb6a42ad284dd97dd68c26b63d65930dfe248e4 | e7d356fede66ab8f9e41827b1c135051cb69d743 | XadillaX/VJSpider | /vjspider/src/vjspider.cpp | C++ | cpp | 8,072 | no_license | #include <vjspider.h>
#include <vjspider_helper.h>
#include <curl/curl.h>
bool sranded = false;
VJSpider::VJSpider() :
m_szCookieFilename(""),
m_bAutoDelCookie(true)
{
}
VJSpider::~VJSpider()
{
if(m_bAutoDelCookie) del_cookie_file();
}
bool VJSpider::init_global_envi()
{
CURLcode code;
code = cu... |
bcdb83226fe6df1e6826cdb6ae199730ac918aef | 9d60cf7634e125fd2e013ea8f67f0387941b5524 | karunmatharu/Android-4.4-Pay-by-Data | /external/skia/src/effects/gradients/SkRadialGradient.cpp | C++ | cpp | 20,979 | permissive |
/*
* Copyright 2012 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkRadialGradient.h"
#include "SkRadialGradient_Table.h"
#define kSQRT_TABLE_BITS 11
#define kSQRT_TABLE_SIZE (1 << kSQRT_TABLE_BITS)
#if defined(SK_BUILD_FO... |
8a7b05a971f7ebd7a4f9751a448dd4af2d6ba64f | 2477956ba74cfb499a7d99bf5407c57be48a892c | github188/MyCode-1 | /mcontest/2013/qr/b/b.cpp | C++ | cpp | 614 | no_license | #include<iostream>
using namespace std;
long long n,m,k,t,tt;
int main()
{
cin>>tt;
for (int t=1;t<=tt;t++)
{
cin>>n>>m>>k;
if (m<n) {long long p=n;n=m;m=p;}
long long ans=0,one=1,two=2;
for (long long i=2;i<=n;i++)
if (k/i<=m)
{
long long j=k/i;
... |
d8beaa728e24b4716eb22c511b14c595fc9b7efd | 2f27458e06be7f7cf0710eafc69b1c7cafaaf7ef | git-Charlie/ARK-SDK | /SDK/ARKSurvivalEvolved_DroppedItemGeneric_NoStasisDelete_functions.cpp | C++ | cpp | 1,711 | permissive | // ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_DroppedItemGeneric_NoStasisDelete_parameters.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Functions
//------------------------------------------------... |
2b166e74c69f0ef4a62b99c48d34ba06431517db | a0802afb74493202c97a9837da7a58b8fdf679a2 | deepikabhavnani/greaseLib | /grease_lib.cc | C++ | cc | 43,574 | permissive | /*
MIT License
Copyright (c) 2018 WigWag 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 without restriction, including without limitation the rights
to use, copy, mo... |
2dc0f7d216824621ca006537212c14131ce6ee59 | b0ad539a70ebc5c67a78570db043966fed8adf61 | unclearness/ugu | /app/vc2tex.cc | C++ | cc | 5,532 | permissive | /*
* Copyright (C) 2021, unclearness
* All rights reserved.
*/
#include <iostream>
#include "ugu/inpaint/inpaint.h"
#include "ugu/parameterize/parameterize.h"
#include "ugu/textrans/texture_transfer.h"
#include "ugu/timer.h"
#include "ugu/util/path_util.h"
#include "ugu/util/raster_util.h"
#include "ugu/util/strin... |
6ae4761c3710e23a2a2269dfb77649bb76a71379 | a1c3df876c85b2ad437a02412a6e49f25af848b4 | Infinideastudio/NEWorld-CPP | /Cpp/OpenGL.cpp | C++ | cpp | 4,609 | no_license | #include "OpenGL.h"
#include "Player.h"
#include "glprinting.h"
//OpenGL
int GLVersionMajor, GLVersionMinor, GLVersionRev;
void CurPosCall(GLFWwindow*, double x, double y) {
mx = x / (retina ? 2 : 1);
my = y / (retina ? 2 : 1);
}
void CharInputFun(GLFWwindow *, unsigned int c) {
if (c >= 128) {
wchar_t* pwszUni... |
da507a348d9e5a83c67255d06d604e4f60140372 | 77b0c4597e728996346a9376c7420d613b043961 | xyiyy/icpc | /src/杂/SHU dfs相关算法练习/B.cpp | C++ | cpp | 3,011 | no_license | #include <iostream>
#include <sstream>
#include <ios>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring... |
cb45277f3b11cb75b0c301f9551dc4ae14832073 | 6e98c3f8621e3c136d9ad695e9e3ac32b2714539 | XiaoXiaoLui/CodeForces | /Round362/C.cpp | C++ | cpp | 1,114 | no_license | #include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
using namespace std;
#define LLD "%l" "ld"
#define pii pair<int, int>
#define mp make_pair<int, int>
typedef long long ll;
map<ll, ll... |
93be6a9296b5e1660b27bb9a89867d87c8b29c47 | f844bd8c38fe4fb65f97dcc777fc3401bff4ebf3 | sorlok/enigma-dev | /ENIGMAsystem/SHELL/Graphics_Systems/OpenGL1/GLmatrix.cpp | C++ | cpp | 11,637 | no_license | /** Copyright (C) 2008-2012 Josh Ventura, DatZach, Polygone
*** Copyright (C) 2013-2014 Robert B. Colton, Polygone, Harijs Grinbergs
***
*** This file is a part of the ENIGMA Development Environment.
***
*** ENIGMA is free software: you can redistribute it and/or modify it under the
*** terms of the GNU General Public ... |
a3a91a0a17fcf52a51f664ab567dcc21a06fc204 | 8adff01ac80171f8ef42d7488b588983b1724384 | fxb20170613/chromium | /chrome/renderer/subresource_redirect/subresource_redirect_url_loader_throttle.cc | C++ | cc | 7,515 | permissive | // Copyright 2019 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/renderer/subresource_redirect/subresource_redirect_url_loader_throttle.h"
#include "base/metrics/field_trial_params.h"
#include "base/me... |
4211626ea2d0876391374bb55ee3f71349838bc1 | 703853a458e7c1aace13f5bbc86e01b096539544 | Mercurialzhang/Leetcode | /055_Jump_Game.cpp | C++ | cpp | 572 | no_license | class Solution {
public:
bool canJump(vector<int>& nums) {
int point = 0;
while (point < nums.size()) {
if (point + nums[point] >= nums.size() - 1) return true;
if (nums[point] == 0) return false;
int idx = point;
int max = -1;
for (int i =... |
ff2765e77448d83224e96f3e36c2d23e03a74532 | 389f1699f82af9e46a1ee782089772c58bebcf0c | georgerapeanu/c-sources | /Simple Game/main.cpp | C++ | cpp | 295 | no_license | #include <iostream>
#include <cmath>
using namespace std;
int n,m;
double a,b;
int main()
{
std::cin>>n>>m;
a=double(m-1)/n;
b=double(n-m)/n;
if(n==1)
std::cout<<1;
else
{
if(a>=b)
std::cout<<m-1;
else
cout<<m+1;
}
return 0;
}
|
1fc638eb69bf30f0e23f6c1b7b9f0679ab21ca6a | e5c8ec735b0f9141a9b846bed89937339aca7060 | sulemanrai/GeeksforGeeks | /Data Structures/arrays/altpositive_negative.cpp | C++ | cpp | 2,179 | no_license | #include<iostream>
#include <algorithm>
using namespace std;
void printArray(int arr[], int Size)
{
for (int i = 0; i< Size; i++)
{
cout << arr[i] << " ";
}
cout << endl;
}
// Utility function to right rotate all elements between [outofplace, cur]
void rightrotate(int arr[], int n, int outofplace, int cur)
{
... |
11ea21c27acfb96655ff3b5a3860ffbf0e24ede3 | ba3fa980d6ceb39eb59219ad6294ddabaae52c8f | yanggui19891007/SensorFusion | /UKF/src/ukf.cpp | C++ | cpp | 11,157 | no_license | #include "ukf.h"
#include "Eigen/Dense"
#include <iostream>
using Eigen::MatrixXd;
using Eigen::VectorXd;
/**
* Initializes Unscented Kalman filter
*/
UKF::UKF() {
// if this is false, laser measurements will be ignored (except during init)
use_laser_ = true;
// if this is false, radar measurements will be i... |
0b5c901c4b94188d83907f3f8e80973a178e0986 | f97a7a65019cb2515fd74905beb90745f7b69b6a | julsgasull/FIB-PRO2 | /Sessions/Examens/mitjana.cpp | C++ | cpp | 1,426 | no_license | //
// mitjana.cpp
// PRO2
//
// Created by Júlia Gasull Navarro on 16/11/17.
// Copyright © 2017 Júlia Gasull Navarro. All rights reserved.
//
#include <iostream>
#include "BinTree.hh"
#include "BinTreeIOint.hh"
using namespace std;
/* Pre: t no és buit, t = T */
/* Post: el resultat és la màxima de les mitjanes ... |
367a9dd5f5e92593d0e7b815cbfec10e428fda68 | 55a3038d9acf1d1986687e85a69ec24f1ffdf96e | zhanggaolei001/CppExercises | /CPPExericises_5_3/CPPExericises_5_3.cpp | C++ | cpp | 650 | no_license | // CPPExericises_5_3.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
#pragma once
#include <iostream>
#include "Compute.h"
void main()
{
Compute a;
std::cout << "四种几何图形的面积=" << a.SumArea() << std::endl;
a.Setdata(2, 10);
std::cout << "四种几何图形的面积=" << a.SumArea() << std::endl;
a.Setdata(0, 10,12);
std::cout << "四种几何图形的面积... |
2f19661748b3adff384224b319d2e0a1ab9e3bb7 | f9bdf8b831ecb1893536a35df6fc8ff1152d489a | jesusleon1995/banq | /src/test/script_P2SH_tests.cpp | C++ | cpp | 14,104 | permissive | // Copyright (c) 2012-2015 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 "key.h"
#include "keystore.h"
#include "main.h"
#include "policy/policy.h"
#include "script/script.h"
#include "scri... |
2970353617c5d9b3574ada9204851c28d842b76c | 1e109ddc0d8142fca44d28a7de0a922956c4e653 | Xilinx/Vitis_Libraries | /codec/L2/demos/leptonEnc/host/vp8/decoder/coefs.hh | C++ | hh | 2,406 | permissive | #ifndef _COEFS_HH
#define _COEFS_HH
#include "bool_decoder.hh"
#include "model.hh"
#include <limits>
class BoolEncoder;
template <uint64_t x, uint64_t n = 32>
struct static_log2 {
enum uint64_t { c = ((x >> n) > 0) ? 1 : 0 };
enum uint64_t { value = c * n + static_log2<(x >> (c * n)), n / 2>::value };
};
temp... |
1627f81cb3d6f515c71b3b023592e8423e896773 | d844f18c17aa4ba852aad107464e4880e79a5e15 | alejandrosanti9291/Taller-No.-3-Matrices | /Ejercicio a.cpp | C++ | cpp | 801 | no_license | /*
Programa: Para rellenar una matriz pidiendo al usuario el numero de filas y columnas.
Autor: Alejandro Santibaņez Sanchez.
Fecha: 11/04/2017.
Resumen: Programa que rellena una matriz pidiendo al usuario el numero de filas y columnas y mostrando la matriz en pantalla.
*/
#include<stdio.h>
int main(){
... |
83c49f9f9adedfea158e1f48db04f24701ef9b2f | 6473e453fb768ce3c40849be84f94a1f59ab86ea | Aethelflaed/GMG | /src/Makefile/Tool.hpp | C++ | hpp | 2,828 | no_license | #ifndef MAKEFILE_TOOL_HPP
#define MAKEFILE_TOOL_HPP
#include <iostream>
#include <ostream>
#include <string>
#include <stdexcept>
#include <unordered_set>
#include <array>
#include <memory>
#include "Util/Output.hpp"
#include "Config.hpp"
namespace Makefile
{
enum class ToolType : unsigned short int
{
/* Don't ... |
8ac3b210e6c2d80df86e59a5fd9a757cf11988f2 | fd296bcd98c0c1b7943f0d85e8e5bc6993c8833b | delos0/cpp | /acmp_tasks/task_147.cpp | C++ | cpp | 285 | no_license | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
long long n, i = 2, a0 = 0, a1 = 1, res = 0;
cin >> n;
while(i<=n)
{
res = a1 + a0;
a0 = a1;
a1 = res;
i++;
}
if(n==1) cout << 1;
else cout << res;
}
|
690cec266a5d33a8f70d59b8390dc7ab1955f1aa | 80bea62a7da149ad4e83021ce282acd3f0e34426 | PDi-Communication-Systems-Inc/lollipop_external_chromium_org | /tools/gn/action_values.cc | C++ | cc | 275 | permissive | // Copyright (c) 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 "tools/gn/action_values.h"
ActionValues::ActionValues() {
}
ActionValues::~ActionValues() {
}
|
0b13aca1f44fe7252e3eb1737cbfddf74466fba5 | a9ec303eb8dfc83a276cdb743789f6b06a2e51a1 | SARrus-trg/OOP | /lab2/vector/TEST/VectorText.cpp | C++ | cpp | 1,550 | no_license | // TrimBlanksTests.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "../vector/ProcessVector.h"
BOOST_AUTO_TEST_SUITE(GetNumbers_function)
BOOST_AUTO_TEST_CASE(check_empty_numbers)
{
std::string inputString = "";
BOOST_CHECK(GetNumbers(inputString).size()... |
816040719f2efd77d6c29fa72eeb0adda67717c1 | 66aed2d5377a4fcba2d0ed03fdf3d67c77ca2c49 | 15831944/Democad | /GeneratedFiles/Debug/moc_detpntsetdlg.cpp | C++ | cpp | 2,977 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'detpntsetdlg.h'
**
** Created: Wed Oct 26 09:12:42 2016
** by: The Qt Meta Object Compiler version 63 (Qt 4.8.4)
**
** WARNING! All changes made in this file will be lost!
**********************... |
b5c170d8031dc23fa5ed39a1828558ca7e0cae5b | cccd8abf2367d5b8be70c6afefc967d869bb093b | bandaostart/QT5 | /7_Chapter_1_QGraphicsItem/butterfly.cpp | C++ | cpp | 2,289 | no_license | #include "butterfly.h"
const static double PI=3.14116;
Butterfly::Butterfly(QObject *parent) : QObject(parent)
{
up = true; //给标志蝴蝶翅膀位置的变量赋初始化值
pix_up.load(":/image/up.png");
pix_down.load(":/image/down.png");
startTimer(100); //设定定时器... |
da4290c05132590a3e3998832880129f8f33dd63 | 2bf9c39bdbd26d1bea72148423b902da86a3039b | sarotter/EECS-398-HW-4 | /p2.cpp | C++ | cpp | 1,357 | no_license | #include <cassert>
#include "p2.h"
int sum(list_t list) {
assert(false);
}
int product(list_t list) {
assert(false);
}
list_t reverse(list_t list) {
assert(false);
}
list_t append(list_t first, list_t second) {
assert(false);
}
list_t filter_odd(list_t list) {
assert(false);
}
list_t filter_even(list_t list) {
as... |
95e440931f73eb9e7b93e02270b5685a441769ab | f3ed51639adb6148b4f7e632ec250a79ce18c85c | ferreirasilvaeduardo/UberHub-Code-Club | /2021-4/Manha/Exemplos/Exemplo7.cpp | C++ | cpp | 1,596 | no_license | #include <bits/stdc++.h>
using namespace std;
int main(){
int opcao;
string str = "";
cout << " 1 - push_back" << endl
<< " 2 - append" << endl
<< " 3 - append (nome)" << endl
<< " 4 - erase" << endl
<< " 5 - reverse" << endl
<< "Escolha: ";
cin >> opcao;
... |
f5b91883fd346a18084065dffa2c7427e4811bae | 32efba1d5ed07261c5937a7f15ef06ed3242421a | mint6421/kyopro | /atcoder/abc/041/abc_041_d.cpp | C++ | cpp | 1,061 | no_license |
#include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i-... |
f445a0e69d37d36672913af0c3304d0e156a50b1 | 8bd05d45a15b408cdd2d4d423250721979b53406 | hyeonji21/Cplusplus | /#12/3.cpp | C++ | cpp | 1,290 | no_license | # include <iostream>
using namespace std;
class BaseArray {
private:
int capacity;
int* mem;
protected:
BaseArray(int capacity = 100) {
this->capacity = capacity; mem = new int[capacity];
}
~BaseArray() { delete[] mem; }
void put(int index, int val) { mem[index] = val; }
int get(int index) { return mem[index]... |
5a7f65c87a7e891aca43681097eb253739948537 | 1b34c26c941c5d7c06092e8d3091fb0d8e0fecab | joaopedrovbs/tapFi | /firmware/PasswordDetector/MatchSequence.cpp | C++ | cpp | 3,251 | no_license | #include <LinkedList.h>
#include "SymbolInput.h"
#include "MatchSequence.h"
#include "SymbolInput.h"
#include "PasswordSequence.h"
/*
* Given a sequence `s1`, and a test sequence `s2`,
* return how close s2 is to s1.
*
* Pass in a MatchParameters object to be used
*/
float MatchSequence(PasswordSequence s1, Pas... |
bd712cf20cf59b8505bd6780f4d262f02d775be2 | ac87677d9aa28d379397f9e32bf30888a9831edb | tjcorona/Kassiopeia | /KEMField/Source/Surfaces/include/KSolidAngle.hh | C++ | hh | 10,810 | no_license | #ifndef KSOLIDANGLE_H_
#define KSOLIDANGLE_H_
#include "KSurface.hh"
#include "KEMThreeVector.hh"
#include "KEMConstants.hh"
#include <cmath>
#define POW2(x) ((x)*(x))
namespace KEMField
{
/**
* @class KSolidAngle
*
* @brief A class for computing solid angles from Euler-Eriksson's formula as described in paper ... |
f14a5947bf4df9f5954090dbc9ef0fd2c6e9bd53 | d882412ba09548f97adf32dc72e5f5ad6a097c48 | zhf-0/neopz | /Projects/Descontinuo2/NACA4digit.cpp | C++ | cpp | 30,806 | no_license | #include "NACA4digit.h"
#include "ratio.h"
#include "pzeuleranalysis.h"
#include "pzconslaw.h"
#include "pzmaterial.h"
#include "pzbndcond.h"
#include "pzeulerconslaw.h"
#include "pzartdiff.h"
#include "pzreal.h"
#include "pzvec.h"
#include "pzflowcmesh.h"
#include "pzgmesh.h"
#include "pzgeoelbc.h"
#include <iostream>... |
7e3bdfa2af79f46c57b7da13ec9f2d0377cd247f | 7d88c677a4e8ddd8654c26863538dbb997dd0f6c | meniossin/src | /third_party/angle/src/libANGLE/renderer/gl/egl/ozone/DisplayOzone.cpp | C++ | cpp | 27,923 | permissive | //
// Copyright (c) 2016 The ANGLE 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.
//
// DisplayOzone.cpp: Ozone implementation of egl::Display
#include "libANGLE/renderer/gl/egl/ozone/DisplayOzone.h"
#include <fcntl.h>
#in... |
a007439d425a601279b5a07dcc686e4407289cb9 | 988c7fd07b1e74fa0d040e38ec4493d1e4c6c35e | subhash1-0/thirstyCrow | /src/org/mpisws/p2p/filetransfer/FileTransferImpl.cpp | C++ | cpp | 30,064 | no_license | // Generated from /pastry-2.1/src/org/mpisws/p2p/filetransfer/FileTransferImpl.java
#include <org/mpisws/p2p/filetransfer/FileTransferImpl.hpp>
#include <java/io/File.hpp>
#include <java/io/IOException.hpp>
#include <java/lang/Class.hpp>
#include <java/lang/ClassCastException.hpp>
#include <java/lang/Comparable.hpp>
#... |
7ab2b1954b60eaa7b6dc3c219b44cec925702e5c | bd5a3235cf4b3da494cc9a94b1a99a645a7b212e | prerit1501/CodeChef | /2020/jan2020/try.cpp | C++ | cpp | 351 | no_license | #include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(int argc, char const *argv[])
{
vector<int> arr(10);
arr.push_back(10);
arr.push_back(9);
arr.push_back(100);
arr.push_back(0);
for(auto itr:arr)
{
cout<<itr<<" ";
}
cout<<arr[... |
00a0cd6db3bd3849682d59d407f17ce7777cf7ac | ed7d347aa8b36adfef07f0342b9281c93edc508d | flirtcoin/flirtcoin | /src/qt/sendcoinsentry.cpp | C++ | cpp | 7,239 | permissive | // Copyright (c) 2011-2013 The Flirtcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "sendcoinsentry.h"
#include "ui_sendcoinsentry.h"
#include "addressbookpage.h"
#include "addresstablemodel.h"
#inc... |
7691d1def22e6d78031acb36d4c384dfbbfc4942 | aaed123e25653aee9439dc3a8bd20526dab8c1bc | zlyGo/CGPUImage-android | /app/src/main/cpp/GPUImage/GPUImageHighlightShadowTintFilter.cpp | C++ | cpp | 5,524 | no_license | /**
* Created by lvHiei on 17-4-10.
* This is a project of GPUImage implemented with c++, you can
* use it free. if you find some bug please send me a email.
* My Email is majun_1523@163.com.
*/
#include "GPUImageHighlightShadowTintFilter.h"
#ifdef __GLSL_SUPPORT_HIGHP__
// 片元着色器
extern const char _highlightS... |
aa2a0642fc784afba993e0188f30eb92f699ed2c | b11785238c7294447f318b13d9e3e08f2fdaad71 | PerceptTools/percept | /src/percept/structured/BlockStructuredGrid.cpp | C++ | cpp | 22,454 | permissive | // Copyright 2002 - 2008, 2010, 2011 National Technology Engineering
// Solutions of Sandia, LLC (NTESS). Under the terms of Contract
// DE-NA0003525 with NTESS, the U.S. Government retains certain rights
// in this software.
//
// Use of this source code is governed by a BSD-style
// license that can be found in the L... |
c9f5035cb00a85cbc0bbda1755c5bad6ef445781 | c1dde529ad6f61b3991351f422a3ce5d45976b0e | oldmannt/gearsbox | /generated-src/jni/NativeVideoEncoderGen.cpp | C++ | cpp | 6,194 | no_license | // AUTOGENERATED FILE - DO NOT MODIFY!
// This file generated by Djinni from camera.djinni
#include "NativeVideoEncoderGen.hpp" // my header
#include "Marshal.hpp"
#include "NativeVideoFrameGen.hpp"
#include "NativeVideoOrientation.hpp"
namespace djinni_generated {
NativeVideoEncoderGen::NativeVideoEncoderGen() : :... |
c75b35429541fd4cd02737e54e10e2c7ace525fd | 44a600e800c5230dc7ee4ebc68d09441588bab79 | ojas0419/iris | /src/physics/bullet/basic_character_controller.cpp | C++ | cpp | 3,692 | permissive | ////////////////////////////////////////////////////////////////////////////////
// Distributed under the Boost Software License, Version 1.0. //
// (See accompanying file LICENSE or copy at //
// https://www.boost.org/LICENSE_1_0.txt) ... |
3ffe4f90891245a8514be0d8242765ce4cadb55a | ea3dda90fd500a80e6840605c0b9487578ff570b | Hurlu/Arcade | /includes/DLLoader.hpp | C++ | hpp | 3,321 | no_license | //
// DLLoader.hpp for arcade in /home/hurlu/rendu/
//
// Made by Hugo Willaume
// Login <hugo.willaume@epitech.eu>
//
// Started on Tue Apr 4 16:37:36 2017 Hugo Willaume
// Last update Sun Apr 9 18:54:02 2017 dourches
//
#ifndef ARCADE_DLLoader_HPP
# define ARCADE_DLLoader_HPP
# in... |
5ae129d1d434f515e177abb00c94db2848af5bc6 | c6659c6b496cba1244e5d230a758a895f6834f50 | amnotme/42_CPP | /d02/ex01/Fixed.cpp | C++ | cpp | 2,307 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Fixed.cpp :+: :+: :+: ... |
8b1a338834577a30458ccd2d236edcaa30c4f7dd | 6fac4806e1af676b80c653594ef8c682ab1fa4ec | SimplyDifficult/Leetcode-Problems | /Array/*42.Trapping Rain Water.cpp | C++ | cpp | 468 | no_license | class Solution {
public:
int trap(vector<int>& height) {
if(height.empty())return 0;
int n=height.size();
vector<int>left(n),right(n);
left[0]=height[0];
right[n-1]=height[n-1];
for(int i=1;i<n;i++)left[i]=max(height[i],left[i-1]);
for(int i=n-2;i>=0;i--)right... |
f7b7bbb125e1820002df7e94c0960fdef31ff88b | a7a23b7d41ff13b777a0e16c2d2a6be753db4d07 | InsightSoftwareConsortium/ITK | /Modules/Filtering/DisplacementField/test/itkInverseDisplacementFieldImageFilterTest.cxx | C++ | cxx | 5,264 | 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
*
* https://www.apache.o... |
505dee3b5b29d8d855bfe237ece256156f461f8f | a4d8b5bbebbfe273ed79f1491c368a03f4bde727 | eshrf/beam | /wallet/cli.cpp | C++ | cpp | 18,900 | permissive | // Copyright 2018 The Beam Team
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... |
011ca3b9e89c519bcff93fefc12020fa1660bd13 | 19f880c6eb35a8a80b8514cc99f37fea74af03b3 | Ben2297/DrivingSimulator | /Source/DrivingSimulator/Waypoint.cpp | C++ | cpp | 1,208 | no_license | #include "Waypoint.h"
#include "AIPedestrian.h"
// Sets default values
AWaypoint::AWaypoint()
{
// Set this actor to call Tick() every frame. You can turn this off to improve performance if you don't need it.
PrimaryActorTick.bCanEverTick = true;
Root = CreateDefaultSubobject<USceneComponent>(TEXT("Root Componen... |
c2e57d2a6f45a2ffa19ebd106b490b189892aac6 | f2ae89a8cd81895587eccf56df1534c41f153676 | zylzjucn/Leetcode | /1600~1699/1650. Lowest Common Ancestor of a Binary Tree III.cpp | C++ | cpp | 394 | no_license | /*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node* parent;
};
*/
class Solution {
public:
Node* lowestCommonAncestor(Node* p, Node * q) {
Node* a = p;
Node* b = q;
while (a != b) {
a = a == nullptr ? p : a->parent;
... |
a350f696d2d98209eeacd26b0926d6e2b58cc940 | cb65a87f7320e888297b88b099867927d8465022 | NiharikaVadlamudi/GeeksForGeeks-Must-do- | /Strings/initials.cpp | C++ | cpp | 470 | no_license | #include<bits/stdc++.h>
using namespace std;
#define ll long int
#define N 26
string intials(string s)
{
string res="";
for(int i=0;i<s.length();i++)
{
if(i==0)
res.push_back(toupper(s[i]));
if(s[i]==' ')
{
res.push_back(s[i]);
i++;
res.push_back(toupper(s[i]));
}
}
return(res);
}
in... |
af48e5826df1a248114e0e714327508808ca2f10 | f3073b159610ac62c95ae4ec25a125d9b70f4c8f | gregorburger/brigand | /test/sort_test.cpp | C++ | cpp | 8,044 | permissive | #include <brigand/algorithms/sort.hpp>
#include <brigand/functions/comparison/greater.hpp>
#include <brigand/functions/comparison/less.hpp>
#include <brigand/functions/misc/sizeof.hpp>
#include <brigand/sequences/list.hpp>
#include <brigand/types/bool.hpp>
#include <cstddef>
template <std::size_t... List>
using size_t... |
a274de09c79cf9a24138b77fc779c189e6376af9 | a339854006bb4ca991bcefb2d8e28cd169c7ef14 | writing-codes/Cpp-14 | /UWCOI20B.cpp | C++ | cpp | 294 | no_license | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll t;
cin>>t;
while(t--){
ll n;
cin>>n;
ll a[n],odd,even,sol;
odd=even=sol=0;
for(ll i=0;i<n;i++){
cin>>a[i];
if(a[i]%2)
odd++;
else
even++;
}
cout<<odd*even<<endl;
}
return 0;
}
|
4d0aa555c9665d612476d54372322a75af6f184c | 45d77c5caa867ab5d1a57283daa3a17261c7fe46 | gangwar1234/CP | /New_Codeforces/88.cpp | C++ | cpp | 1,465 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef vector<lo> vl;
typedef vector<vl>vll;
#define MOD 1000000007
#define all(v) (v).begin(), (v).end()
#define debug(x) cerr<<#x<<" = "<<x<<endl;
#define REPV(a, b, c) for (lo(a) = b; (a) < (c); (a)++)
#define REP(a,b) for(lo i =(a) ;i<(b);i++)
t... |
a68efabf52e5944eb755c62061bafaf8941a161f | 3e4022f081d5d085e9a2b5c00f5bda33f60668df | kmsabrin/UVaSolved | /UVaSolved/Volume 105/10583.cpp | C++ | cpp | 1,057 | no_license | #include <stdio.h>
int p[50001];
void InitializeSet( int n )
{
for ( int i = 1; i <= n; ++i )
p[i] = -1;
}
int CollapsingFind( int i )
{
int r = i;
while ( p[r] > 0 )
r = p[r];
while ( i != r )
{
int s = p[i];
p[i] = r;
i = s;
}
return r;
}
void WeightedUnion( int i, int... |
fdad080d8b13bbbb151d543f1159a54b45a927ff | 45e6baa39b48ae770a513019ae09a64f054adc2d | webdeveloper13/Leetcode_practiceForSDE | /D8-Trees/postorder.cpp | C++ | cpp | 4,115 | no_license | //PostOrder Traversal
//Recursive approach
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, ... |
e6f05c98b7f51bfc9e368d0ebdd952cd09dfd020 | f2b8d0c92304d2f4d927670ac673934cca39ffa6 | connectthefuture/psdmrepo | /psana_examples/tags/jbarrera-12-05-15/src/DumpControl.cpp | C++ | cpp | 3,430 | no_license | //--------------------------------------------------------------------------
// File and Version Information:
// $Id$
//
// Description:
// Class DumpControl...
//
// Author List:
// Andrei Salnikov
//
//------------------------------------------------------------------------
//-----------------------
// This Cl... |
747315ae0d0fd33f770c98da8f4aa417a0478e8c | 1f4d21a83b0bc332a1989e6932e1cc1573bcdbc4 | mingmingying/my | /实验二 合并排序.cpp | C++ | cpp | 1,600 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
//分组合并
void _Merge(int *a, int begin1, int end1, int begin2, int end2, int *tmp)
{
int index = begin1;
int i = begin1, j = begin2;
//注意:当划分的区间足够小时,begin1==end1,begin2==end2
while (i <= end1&&j <= end2){
if (a[i]<=a[j])
... |
9ba3113996f3f8dec7479a68ca1e38779286f26d | 55cb5c469cd8cce618a002b69cd3616010bde3ff | CIBC-Internal/itk | /Modules/Filtering/ImageGrid/include/itkInterpolateImagePointsFilter.hxx | C++ | hxx | 8,289 | permissive | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* 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
*
* h... |
e6d1132d188311f3ea3c5341731823f1db91f1e6 | 09ba657c7ba5aa9ccbc12a9927ed27ed431f6cf3 | bradbell/dismod_at | /devel/table/check_pini_n_age.cpp | C++ | cpp | 2,526 | no_license | // SPDX-License-Identifier: AGPL-3.0-or-later
// SPDX-FileCopyrightText: University of Washington <https://www.washington.edu>
// SPDX-FileContributor: 2014-22 Bradley M. Bell
// ----------------------------------------------------------------------------
/*
{xrst_begin check_pini_n_age dev}
Check Initial Prevalence G... |
f42bccdaa1f8a441f2437b285ffc3e9d1a0f5503 | 9038889cbd5634c3d8e298daaeb386fb5fdd5eab | OrigenesZhang/cppprimer | /chapter 10/ex10.28/main.cpp | C++ | cpp | 606 | no_license | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
using std::copy;
int main() {
std::vector<int> vec{1, 2, 3, 4, 5, 6, 7, 8, 9};
std::list<int> list1, list2, list3;
copy(vec.cbegin(), vec.cend(), back_inserter(list1));
copy(vec.cbegin(), vec.cend(), inserter(list2, list2.begin()));
... |
af817d098e38de760eb2dcc0a44cbec9d24df2c4 | f5d5e1d50e63733ab2f44170a22b98fc021bb5c0 | jki14/competitive-programming | /2013/CROC/QR/proA.cpp | C++ | cpp | 6,991 | no_license | #include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<climits>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<list>
#include<bitset>
#include<set>
#include<map>
#include<functional>
#include<numeric>
#include<ut... |
7104931e46d370484be74fdb8dc4f5ec26093419 | 462084789c017b34995a3a5234bb6884ac8e4083 | dicehub/VTK | /IO/NetCDF/vtkNetCDFCAMReader.cxx | C++ | cxx | 40,367 | permissive | /*=========================================================================
Program: Visualization Toolkit
Module: vtkNetCDFCAMReader.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This softwa... |
66c57dd093b17351aacadb9bee7cb0a6926c558e | 7f8be550ce9da558f8dfb0c4dd05df8e517ebb1f | shivamjee/Competetive_coding | /binaryDivBy3.cpp | C++ | cpp | 574 | no_license | #include<iostream>
#include<string>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string str;
//cout<<"enter string: ";
cin>>str;
int mainCount = 0;
int evenCount = 0;
int oddCount = 0;
//cout<<str.size()<<endl;
for(int i=0;i<str.size();i++)
{
//cout<<str[str.size()-1-i]<<" ";... |
45f49610c27af1fc53e56735f1d90e283f6abaa8 | 53f1815a087d1a989b5a41c229313ac681453376 | saqar/Edge-of-Chaos | /src/arcemu-world/LfgHandler.cpp | C++ | cpp | 19,712 | no_license | /*
* Copyright (C) 2008-2012 TrinityCore <http://www.trinitycore.org/>
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any la... |
5257de36eafe81b522e7f53a205d4b84cd26beb0 | 1df1cea9d487fc13a9af834dbcdc6838fdb7b1c5 | MLN-UnrealProjects/Mike27 | /Plugins/Mike27/Source/Mike27/Private/LookToComponent.cpp | C++ | cpp | 761 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "LookToComponent.h"
// Sets default values for this component's properties
ULookToComponent::ULookToComponent()
{
// Set this component to be initialized when the game starts, and to be ticked every frame. You can turn these fea... |
7ca8ee907575d92240d799c2e42ded2d51fa55e5 | 81aec999ddeb60a41725ffca2918ae73deab734d | JohnItoo/Solvay | /codeforces/rounds/CF-1400B.cpp | C++ | cpp | 3,111 | no_license | //============================================================================
// Name : template.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <... |
5d9d26da1b28b46b7ef1d858072c76b580db74a5 | 7a56802f55e1134b78c538aff022c83793e0efa1 | sidens1996/FileSend | /ServerFile/ServerFile/ServerFile.cpp | C++ | cpp | 2,730 | no_license |
// ServerFile.cpp : 定义应用程序的类行为。
//
#include "stdafx.h"
#include "ServerFile.h"
#include "ServerFileDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// CServerFileApp
BEGIN_MESSAGE_MAP(CServerFileApp, CWinApp)
ON_COMMAND(ID_HELP, &CWinApp::OnHelp)
END_MESSAGE_MAP()
// CServerFileApp 构造
CServerFileApp::CServer... |
0fc9c5d7df05abdc7a9438dece0ca43c0f38612e | 3a1ddfe3fae687ca7883fbff0b1b79d826560fb3 | jdowens/Runestone | /src/scenemultiplayermatch.cpp | C++ | cpp | 1,247 | no_license | #include "scenemultiplayermatch.h"
dtn::SceneMultiplayerMatch::SceneMultiplayerMatch(int playerID, std::string ip)
{
m_playerID = playerID;
m_eventManager = std::make_shared<EventManager>();
m_client = std::make_shared<GameClient>(playerID, ip, m_eventManager);
m_screen = std::shared_ptr<Screen>(new GameScreen(pla... |
fa6a80053d1d7f222d635921b8ae4fbed2995277 | 311829d95d4806f41845a1a3f9004c8c0fea355e | chenwh14/GRUandMPCSimulation | /MPController.cpp | C++ | cpp | 2,625 | no_license | #include "MPController.h"
#include "MKL.h"
#include <string.h>
#include "MPC_utils.h"
#include "simstruc.h"
MPController::MPController(const double* _A, const double* _B, const double* _C, int _n, int _p, int _m, double _wy, double _wu):n(_n),p(_p),m(_m),mv_store(0)
{
A = (double*)mkl_calloc(n * n , sizeof(double), 6... |
ad9503d0b5e909478069f32aac8a3692ec112c84 | 523f768b832fb4989601e209f9dd6c82ffab3244 | velezladonna/mwc-qt-wallet | /windows/e_transactions_w.cpp | C++ | cpp | 14,288 | permissive | // Copyright 2019 The MWC Developers
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed... |
c6aba715f6932bc65557b85545e9b720240f1b5d | 1d7117224d1b843c939122c6c540bb5a8d7242dc | Skratzy/Sail | /Sail/src/API/DX12/resources/DX12Texture.cpp | C++ | cpp | 3,821 | permissive | #include "pch.h"
#include "DX12Texture.h"
#include "Sail/Application.h"
#include "../DX12Utils.h"
Texture* Texture::Create(const std::string& filename) {
return new DX12Texture(filename);
}
DX12Texture::DX12Texture(const std::string& filename)
: m_cpuDescHeap(D3D12_DESCRIPTOR_HEAP_TYPE_CBV_SRV_UAV, 1)
, m_isIniti... |
35135fe8b34c7e8b3ede8e620e3ba0247b1a1be9 | 26036b15195d36e8f243976758e04c7fbf621758 | AntoniaShalamanova/Programming-Basic-With-C-Plus-Plus | /2.SimpleCalculations/13.TrainingLab.cpp | C++ | cpp | 332 | no_license | #include "stdafx.h"
#include <iostream>
using namespace std;
int main()
{
double length, width;
cin >> length >> width;
int h = length * 100;
int w = width * 100;
int rows = h / 120;
int places_for_row = (w - 100) / 70;
int places_count = rows*places_for_row - 3;
cout << places_count;
return 0... |
e6753f6c918b71a8860a30fec5636fb69af3c367 | 4a60a1a2cdef7100d1ecc191b0880b1b3c0def2a | li5ch/tencentcloud-sdk-cpp | /sts/src/v20180813/model/GetFederationTokenResponse.cpp | C++ | cpp | 4,408 | permissive | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. 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
... |
ffe3dcf7bbd93de774d8045a2cf59055db69a74a | fdf865a8eb7cedaf955f0d61d5a979f96e545101 | dakodun/uair | /inc/uair/layoutcontainer.hpp | C++ | hpp | 5,864 | permissive | /* **************************************************************** **
** Uair Engine
** Copyright (c) 2010 - 2017, Iain M. Crawford
**
** This software is provided 'as-is', without any express or
** implied warranty. In no event will the authors be held liable
** for any damages arising from the use of this software.
... |
7690c00ee2d5a541927c37d04681590d8667e983 | 08ba10b097964a4bd70261157148ef222820e105 | danielmonr/Estructura-de-datos | /Ordenamiento/Ordenamiento/Libro.cpp | C++ | cpp | 340 | no_license | //
// Libro.cpp
// Ordenamiento
//
// Created by Daniel on 01/09/14.
// Copyright (c) 2014 Gotomo. All rights reserved.
//
#include "Libro.h"
std::ostream & operator <<(std::ostream & os, Libro & libro){
os << libro.titulo << std::endl;
return os;
}
bool Libro::operator > (Libro & libro){
return titu... |
a6b5e088fdab971beb9b7f1d8ea2e010b8e7fae1 | e127d134180551c00c6ea037444ada67d560df1c | Watch-Later/ncbi-cxx-toolkit-public | /include/objtools/pubseq_gateway/impl/cassandra/status_history/get_public_comment.hpp | C++ | hpp | 3,341 | no_license | #ifndef OBJTOOLS__PUBSEQ_GATEWAY__CASSANDRA__STATUS_HISTORY__GET_PUBLIC_COMMENT_HPP
#define OBJTOOLS__PUBSEQ_GATEWAY__CASSANDRA__STATUS_HISTORY__GET_PUBLIC_COMMENT_HPP
/* $Id$
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.