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 |
|---|---|---|---|---|---|---|---|---|
9450b88bf2118fe217ab95c26f07bcd8342c62da | d18a3c9161d3a3774a3868b9f8aa707e795ad373 | hvidal/GameEngine3D | /include/scene/planet/PlanetFace.cpp | C++ | cpp | 7,283 | permissive | #include "PlanetFace.h"
const static btVector3 PLANET_CENTER(0.f, 0.f, 0.f);
/* private constructor */
PlanetFace::PlanetFace() {}
PlanetFace::PlanetFace(unsigned int faceId, const std::string& plane, float radius, float waterLevel, unsigned int faceDivisions, unsigned int pageDivisions)
{
if (faceDivisions % 2 =... |
3c4c43497415899b13e9353804c4b43acecb6d0d | f0f0c1fc736b88ce41d066be0c198199128f6f42 | infotron/chromium-src-chrome-browser | /ui/views/frame/browser_view.cc | C++ | cc | 95,425 | permissive | // Copyright 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 "chrome/browser/ui/views/frame/browser_view.h"
#include <algorithm>
#include "base/auto_reset.h"
#include "base/command_line.h"
#include "base/... |
53b4ad5e79d324a48889ea1e3d7f3da13db3624e | e26fa6deea9e6603956e5ef2ca9aded02711cdc2 | eunxeong/BOJ | /String/silvertst.cpp | C++ | cpp | 1,000 | no_license | #include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
// 7785 회사에 있는 사람
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int N; cin >> N;
// 1000001
string arr[10000];
for(int i = 0; i < N; i++) cin >> arr[i];
sort(arr, arr + N);
int idx = 0;
priority_queu... |
6d110e3f7bf6d96afab295ba2e5fd81def04a9d9 | d834fca750c517f0fc559d07362a5218bcde9a8d | rlramirez12/fluorender | /fluorender/FluoRender/NoiseCancellingDlg.cpp | C++ | cpp | 8,716 | permissive | /*
For more information, please see: http://software.sci.utah.edu
The MIT License
Copyright (c) 2018 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 "Software"),
to d... |
c27c039a01f7e9d5de07f8598bc841af3f6b7a9c | 826040cbcf5ea7e29d482fbf65466de64a606795 | tesch1/color | /src/color/YPbPr/convert/luv.hpp | C++ | hpp | 1,972 | permissive | #ifndef color_YPbPr_convert_luv
#define color_YPbPr_convert_luv
#include "../../_internal/convert.hpp"
#include "../category.hpp"
#include "../../luv/luv.hpp"
#include "../../xyz/xyz.hpp"
#include "../../rgb/rgb.hpp"
namespace color
{
namespace _internal
{
template
<
typen... |
b3af7dc23c1843d44bfdca36f8786cdaa000133c | f0fd5188495479de2d511ab3d767a69ec6b068d1 | boxerprogrammer/2d_actiongame_samples | /SplatterVillage/Game/Shot.cpp | C++ | cpp | 2,359 | permissive | #include "Shot.h"
#include "../DxLib/DxLib.h"
#include "../3D/Model3D.h"
#include "../Game/Player.h"
#include "Camera.h"
Shot::Shot(const Camera* camera) : _camera(camera){
}
Shot::Shot(const Camera* camera,int handle,Player& player) : _camera(camera),_prev(NULL),_next(NULL)
{
_model.Reset(new Model3D(handle));
_re... |
a0985b987c0ae20c021a50ba4af6c77460691463 | e4971a29bdd44650fa4c55f121ec240ae091fbd0 | vxl/vxl | /core/vgl/tests/test_polygon.cxx | C++ | cxx | 8,648 | no_license | // Some tests for vgl_polygon
// Amitha Perera, Sep 2001.
#include <iostream>
#include <fstream>
#include "testlib/testlib_test.h"
#include "vgl/vgl_polygon.h"
#ifdef _MSC_VER
# include "vcl_msvc_warnings.h"
#endif
static void
test_simple_polygon()
{
std::cout << "Simple polygon\n";
// Simple triangle
vgl_poly... |
d795273a9526f7696b40dae621d7f235f885ad9a | accb6b408299b21c620b875fd880a793cc70c2fb | zhoujian2030/devutil | /test/net/ut/src/TestTcpSocket.cpp | C++ | cpp | 4,468 | no_license | /*
* TestTcpSocket.cpp
*
* Created on: June 13, 2016
* Author: z.j
*/
#include "TestTcpSocket.h"
#include "MockTcpClient.h"
#include "SysctlUtil.h"
#include <iostream>
using namespace net;
using namespace cm;
using namespace std;
TEST_F(TestTcpSocket, BlockingIO_CloseSocketInServerSide) {
ASSERT_TRUE(... |
139ce065bdffe686fa64f8b33cc8de420f3e2f57 | ba7fee5b570b7d6781704dd8b88b014674d41163 | Nogueirarenato/URI | /Resolucoes_C/URI_1105 - (8888291) - Accepted.cpp | C++ | cpp | 864 | no_license | #include <stdio.h>
int main()
{long long int estancias, cont,credor,valor,devedor,nbanco, banco[50], flag;
nbanco=1;
estancias=1;
while (nbanco!=0 || estancias !=0){
scanf("%lli %lli", &nbanco, &estancias);
if(nbanco!=0 || estancias !=0){
flag=0;
cont=1;
... |
1499fd364e00faad644cef03033654c911632605 | d896eeade4c0595f8eb8e89a9683f57813934050 | 50ShadowsofSexyCode/murlicha | /src/qt/walletmodel.cpp | C++ | cpp | 26,030 | permissive | // Copyright (c) 2011-2015 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Dash Core developers
// Copyright (c) 2017-2018 The Murlicha Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "walletm... |
f8c4660d34bd47f5f67f80abfa395774398a6a48 | dd54fce484a6e003818d2ffa4596b3a8ce4736be | calvin0627/algorithm | /baekjoon/class3/18870.cpp | C++ | cpp | 2,280 | no_license | #include<stdio.h>
#include<vector>
#include<unordered_map>
#include<algorithm>
#define MAX 1000000
using namespace std;
int arr[MAX];
int main(){
int n, tmp;
vector<int> sorted_arr;
scanf("%d",&n);
int count=0;
for(int i=0;i<n;i++){
scanf("%d",&arr[i]);
sorted_arr.push_back(arr[i... |
c83f51afdfd6b4ff4ed7ffbc3ce99f9fc937ef72 | e3d0823d6018c16a3696d3186720739b08346995 | GuillaumeSmaha/sleepyogre3d | /src/Viewport/GestViewport.cpp | C++ | cpp | 4,234 | permissive | #include "Viewport/GestViewport.h"
template<> GestViewport * ClassRootSingleton<GestViewport>::_instance = 0;
std::vector<ViewportPosDim_t> GestViewport::getViewportPosDim(int nbViewport)
{
std::vector<ViewportPosDim_t> result;
int iViewport;
int numberColumn;
int numberLine = (int)(floor(sqrt(1.0 * nbViewport... |
c338bdac635d96d923fe4261f2d4ad146db91d97 | 1704bf2bee19f669c53dac14f34372f555810ad3 | GonzaloCirilo/UVa | /vol112/11223_ODahDahDah!.cpp | C++ | cpp | 1,836 | no_license | #include <stdio.h>
#include <map>
#include <iostream>
#include <string>
using namespace std;
int main() {
map<string, char>dict;
dict[".-"] = 'A';
dict["-..."] = 'B';
dict["-.-."] = 'C';
dict["-.."] = 'D';
dict["."] = 'E';
dict["..-."] = 'F';
dict["--."] = 'G';
dict["...."] = 'H';
dict[".."] = 'I';
dict[".--... |
51a64994560e74695b52fd16d3f4a86aa310f6c4 | 957dd85a4e34f6deb43a2b70a1ddcc54d5b8ab13 | tomlooman/ActionRoguelike | /Source/ActionRoguelike/Private/Components/SSignificanceComponent.cpp | C++ | cpp | 7,330 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "Components/SSignificanceComponent.h"
#include "ActionRoguelike.h"
#include "SSignificanceInterface.h"
#include "ParticleHelper.h"
#include "Particles/ParticleSystemComponent.h"
/* Allows us to force significance on all classes t... |
47e5235f2f0a9fecff22396a162f4259f4d4e134 | 4da344513c79361377f21db96bd049e7bb9880be | CoinStaging/scrypta | /src/net.cpp | C++ | cpp | 66,534 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The LYRA developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-li... |
ab88ecf3f304df3d331771237ff1618353ad8103 | 044220347c57c79a0bd52d5d87145c34336f46d2 | petria/social | /SocialNetwork.cpp | C++ | cpp | 3,260 | no_license | /*
* File: SocialNetwork.cpp
* Author: petria
*
* Created on March 11, 2019, 9:12 AM
*/
#include <map>
#include <regex>
#include <vector>
#include "SocialNetwork.h"
#include "User.h"
SocialNetwork::SocialNetwork() {
}
SocialNetwork::SocialNetwork(const SocialNetwork& orig) {
}
SocialNetwork::~SocialNetwor... |
d0e9955d81f06f2d87eb19e309c83ac5544a2c4e | b4a8d2640058ed22b9aa3eecb8f729c8a99d8be2 | webOS101/db8 | /src/db/MojDbRevisionSet.cpp | C++ | cpp | 2,758 | permissive | /* @@@LICENSE
*
* Copyright (c) 2012 Hewlett-Packard Development Company, L.P.
*
* 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 r... |
312f1937450655936851fe0b2585bf3809d3ccf3 | d68cd97d18582cec372cef258d9f3bb5f4789c9c | benwulfe/firebase-unity | /source/XCodePlugin/jnistub_AuthOAuthStub.cpp | C++ | cpp | 1,400 | no_license | //
// jnistub_AuthOAuthStub.cpp
// XCodePlugin
//
// Created by benwu on 9/10/15.
//
//
#include <stdio.h>
#include "jnistub_AuthOAuthStub.h"
#include "JniAuth.h"
#include "JniEventProcessor.h"
#include "JniFirebaseError.h"
/*
* Class: jnistub_AuthOAuthStub
* Method: onAuthenticated
* Signature: (JLcom/f... |
81af6bdb2f531e685ccfeb887e72672f13b555cf | ab96e0c583ae2ac9f417e974742bf0328716c02f | hphp/Algorithm | /Contest/ACM/2010_bak/Ours_2010/NECPC2010/赛题/9.K-Matrix 中等较易/test.cpp | C++ | cpp | 1,000 | no_license | #include <stdio.h>
int n, ans;
int matrix[201][201];
int sumOfMatrix[201][201];
bool flag;
void input()
{
int i, j;
for(i=0; i<n ;i++)
{
for(j=0; j<n; j++)
{
scanf("%d",&matrix[i][j]);
sumOfMatrix[i][j] = 0;
}
}
}
void solve()
{
int i,j,k,l;
int sum;
int temp;
flag = fal... |
f3a38b87abdfc46a84041ac7ede21d4e3bcda972 | e5295c2ad3fbcccc47a915a415cafbad8dca982c | FlamySnow/Lab3_A | /lib/Printed.Circuit.Board.cpp | C++ | cpp | 4,567 | no_license | //
// Created by flamy on 28/09/21.
//
#include "Printed.Circuit.Board.h"
namespace Lab3A {
printedCircuitBoard::Contact::Contact() {
type = notStated;
x = 0;
y = 0;
numberOfContact = -1;
}
printedCircuitBoard::Contact::Contact(contactType t, int x, int y) {
if (t ... |
81362e50dd41a6b885326b52ccd009614cc3e618 | 87231c032a056cf90025f6593950b48f634df6c5 | thomasokken/fcbt | /fcbt.cc | C++ | cc | 13,824 | no_license | #include <stdio.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <sys/time.h>
#include <ctype.h>
struct game;
static int deadline;
static game *theGame;
static game *topGame = NULL;
#define SOLVED 0
#define PRUNED 1
#define TIMEOUT 2
#define EMPTY 255
#define NO_SUCH_CARD 25... |
2acf54ad00fea38296fdee026131d9925dec9c47 | 8ad3dc06080a8fa16135d928b4db28bcb0736c93 | nayuta1019/AtCoder | /ABC/ABC121-130/ABC121/D/D_ans.cpp | C++ | cpp | 1,026 | no_license | /**
ABC121
2019/03/11/ 解説AC
**/
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
inline int toInt(string s) {int v; istringstream sin(s);sin>>... |
61d4dae8a96096b30414a39ceb90784e95009d36 | 5644b610bb89209087c7c5ddd675fe984fab5560 | valegagge/videoStreaming | /gstreamer-dev/plugin/src/gstyarpdevice.cpp | C++ | cpp | 11,640 | no_license | /*
* GStreamer
* Copyright (C) 2005 Thomas Vander Stichele <thomas@apestaart.org>
* Copyright (C) 2005 Ronald S. Bultje <rbultje@ronald.bitfreak.net>
* Copyright (C) 2017 icub <<user@hostname.org>>
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated... |
b8a12845b5fe5a13ffffff4827c80e1fcbd009cd | a363bbe67e5bac6a11a25f63e3da8fd9280e0968 | DanielMachado29/TrabalhoED2-1 | /Sorts.cpp | C++ | cpp | 5,491 | no_license |
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstdlib>
#include <chrono>
#include <vector>
#include <cstring>
#include <algorithm>
#include <random>
#include "Registro.h"
#include "Sorts.h"
using namespace std;
using namespace std::chrono;
Sorts::Sorts()
{
}
Sorts::~Sorts()
{... |
10952c165d87c48547eeee53b861136a0dcf9f7a | 1f5dac8f2f123399a086c4acc04c6f896dbaf096 | JennyLoveCode/Algorithm | /TA2/6ex/q8_increase_xy_2d.cc | C++ | cc | 1,415 | no_license | /*
8. there are array of 2 dimentional coordinates, find out a line that is x and y
increasing.
*/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Pair{
int x;
int y;
Pair(){ }
Pair(int i, int j):x(i), y(j){ }
};
struct Comparator{
bool operator() (Pair &a, ... |
05e0d1d90537a987a207e4f315b5001c3724a2d6 | 8d6a0856850063ac69f68da729363c9bdae2d4b0 | openharmony/third_party_flutter | /skia/experimental/svg/model/SkSVGDOM.cpp | C++ | cpp | 19,392 | permissive | /*
* Copyright 2016 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "experimental/svg/model/SkSVGAttributeParser.h"
#include "experimental/svg/model/SkSVGCircle.h"
#include "experimental/svg/model/SkSVGClipPath.h"
#include "experiment... |
aae1336abee9e6f8cb1a9729e43173c9674e2d3c | 863c1ad33b5eae545c40389883ddf2c975abb378 | wku/ViberDesktop | /src/Settings/AutorunManager.cpp | C++ | cpp | 2,980 | no_license | #include "AutorunManager.h"
#include "globals.h"
#include <QDir>
#include <QString>
#include <QSettings>
#include <QFileInfo>
#ifdef Q_OS_MAC
#include <CoreFoundation/CoreFoundation.h>
#include <CoreServices/CoreServices.h>
LSSharedFileListItemRef FindLoginItemForCurrentBundle(CFArrayRef currentLoginItems)
{
CFURLR... |
a17e96a623999eed0eb78c6c7f53b2607f99d51e | 3ce4972a14b9e775e824776a8d76ebe0122cfe84 | wnyoung/2021-NWP | /capstone/04_Client/L2_FSMmain.cpp | C++ | cpp | 10,533 | no_license | #include "L2_FSMevent.h"
#include "L2_msg.h"
#include "L2_timer.h"
#include "L2_LLinterface.h"
#include "L3_LLinterface.h"
#include "protocol_parameters.h"
//FSM state -------------------------------------------------
#define L2STATE_IDLE 0
#define L2STATE_TX 1
#ifndef DISABLE_ARQ
#define L... |
dc19c9ef18c4e53e0b3323787ee60cf18c4f1052 | 339b2210d12a96cc1c115217473d37323072e8ca | hmailserver/hmailserver | /hmailserver/source/Server/SMTP/SMTPClientConnection.cpp | C++ | cpp | 19,903 | no_license | // Copyright (c) 2010 Martin Knafve / hMailServer.com.
// http://www.hmailserver.com
#include "stdafx.h"
#include "SMTPClientConnection.h"
#include "../Common/BO/MessageRecipient.h"
#include "../common/Util/Utilities.h"
#include "../common/Util/File.h"
#include "../common/Util/ByteBuffer.h"
#include "../Common/Util... |
ec6d5e8698b3bc3b311f4d7d8b680c790c885ae8 | c9ee66cfad833a599c3eb08a9d1e7f50fb4edbd5 | srajang123/Algo | /dfs.cpp | C++ | cpp | 739 | no_license | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAX 1000
vector<ll>s;
bool visited[MAX+1];
void dfs(int u,vector<vector<ll>>graph)
{
visited[u]=true;
for(ll i=0;i<graph[u].size();i++)
{
if(!visited[graph[u][i]])
{
s.push_back(graph[u][i]);
df... |
b764ae3038076aeacd48fedd5562a0f990337085 | c1e8b81eb7e1efb2fae9a2f164c281f65b4f4eff | predatorsfr/CPP-Pool-part-2-tek-2 | /cpp_rush2_2018/wrap.cpp | C++ | cpp | 368 | no_license | /*
** EPITECH PROJECT, 2019
** wrap.cpp
** File description:
** kevin
*/
#include "Wrap.hpp"
Wrap::Wrap(std::string name)
:Object(name)
{
_type = 0;
}
void Wrap::isTaken() const
{
std::cout << "whistles while working";
}
void Wrap::openMe()
{
_type = 0;
}
void Wrap::closeMe()
{
_type = 1;
}
bool W... |
b5822fa4a980de532f7b70d43619e7a445049ac1 | 8e8330fe469a56af88f762521855122882c03f53 | ahmad-ra/networkit | /include/networkit/global/ClusteringCoefficient.hpp | C++ | hpp | 1,156 | permissive | /*
* ClusteringCoefficient.hpp
*
* Created on: 08.04.2013
* Author: Lukas Barth, David Weiss
*/
#ifndef NETWORKIT_GLOBAL_CLUSTERING_COEFFICIENT_HPP_
#define NETWORKIT_GLOBAL_CLUSTERING_COEFFICIENT_HPP_
#include <networkit/graph/Graph.hpp>
namespace NetworKit {
/**
* @ingroup global
*/
class ClusteringC... |
e9689285541d6296e648131888c13cae841b7b38 | 0edb96444323cbd1c579d6a1ac10996f22cc0fd2 | ParhamArmani/CS1CGroupProject | /text.cpp | C++ | cpp | 3,464 | no_license | #include "text.h"
namespace Shapes {
//text::text() : shape()
//{}
/**
* @brief Construct a new text::text object
*
* @param device : is a parameter with the type of Qt Paint Device
* @param id : is a parameter with the type of int
* @param s :is a parameter with the type of shapeType
* @param txt : is a pa... |
e1ffb7bde81df2960899ef629e6e5805a1eb2f34 | 85c912d34ca4453ef0ff3a1af114b0e3efa0db26 | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-chime/source/model/Room.cpp | C++ | cpp | 2,518 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/chime/model/Room.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws
{
namespace Chime
{
... |
f8fee6b7c074141e67a7487150aea695a003acf3 | f5c8f7d1f8c683b539488fd00df6a0ba7ce4bdad | ianw3214/aetherpath | /Aether/game/entity/components/renderComponent.hpp | C++ | hpp | 591 | no_license | #pragma once
#include "oasis.h"
#include "game/entity/component.hpp"
#include <string>
#include "nlohmann/json.hpp"
using json = nlohmann::json;
class RenderComponent : public Component
{
public:
RenderComponent(Ref<Entity> entity, const std::string& path, float width = 0.f, float height = 0.f);
virtual voi... |
cd910c1f01d5a694118380e987681118511169c0 | d5f54749a9d69d1e16f267756b366933a7ef379a | gfh16/StudyNotes | /CPP/C++学习资料/C++入门经典/每章习题答案/2271 Solutions to Exercises/ch05/Ex5_03.cpp | C++ | cpp | 620 | no_license | // Exercise 5.3 Using a do-while loop to count characters
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
int main() {
long count= 0L;
char ch;
cout << "Please enter a sequence of characters terminated by '#':" << endl;
// We have to read at least one character - even if it's ... |
803a73cbbfd8648f96e750309ab4bac28a3a31b3 | f70d27c738e7e637aa56277f28cc667b7b53494c | hakonfam/TDT4260 | /report/prefetchers/markov_prefetcher.cc | C++ | cc | 5,478 | no_license | #include <stdint.h>
#include "interface.hh"
#include <bitset>
#include <vector>
#include <cstdio>
struct PrefetchDecision
{
explicit PrefetchDecision()
: prefetchAddresses() { /*empty */}
explicit PrefetchDecision(const std::vector<Addr> &addrs)
: prefetchAddresses(addrs) { /* empty */ }
... |
3aa71639c3d03c482bd7daa8ae96f6cc35b19bbc | b5e17fa1ffcad8dda4c55c4f989fd136eb236a26 | p-groarke/IEEE2013 | /AT/main.cpp | C++ | cpp | 2,809 | no_license | //
// main.cpp
// assembleur
//
// Created by Philippe Groarke on 2013-10-26.
// Copyright (c) 2013 Groarke and co. All rights reserved.
//
#include <iostream>
#include <bitset>
#include "stdint.h"
using namespace std;
int main(int argc, const char * argv[])
{
unsigned long input;
int alSize = 8;
... |
3043e59c51bc31ef92cc11de2bd7ae5105edf9f0 | ad5904fa97f5f08844cd54d3d52a9d13b1226522 | MTASZTAKI/ApertusVR | /plugins/browser/cefBrowser/apeCefLifeSpanHandlerImpl.cpp | C++ | cpp | 2,079 | permissive | /*MIT License
Copyright (c) 2018 MTA SZTAKI
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, dist... |
61b9d66ac2925ec4740e0d71807002aadf25dc26 | b4509e31448bd39a196f8241b80475e8314629b9 | metux/chromium-suckless | /chrome/browser/android/bookmarks/partner_bookmarks_reader.cc | C++ | cc | 8,120 | permissive | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/android/bookmarks/partner_bookmarks_reader.h"
#include "base/android/jni_android.h"
#include "base/android/jni_string.h"
#includ... |
13b531fb63a3cf496a9c14ceaa1dca1535511a52 | 945f3de6e94ec9c2fa3b5e90496be2878598e70b | Haruuuko/leetcode | /C++/349.IntersectionofTwoArrays.cpp | C++ | cpp | 688 | no_license | /*
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].
Note:
Each element in the result must be unique.
The result can be in any order.
*/
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
... |
05b547a67d7ba5925f7d11d223a68b59a6f52f5b | 38496e5859229edf7363a05910f6ec24385d1394 | davchezt/WickedEngine | /WickedEngine/wiMath_BindLua.cpp | C++ | cpp | 22,098 | permissive | #include "wiMath_BindLua.h"
namespace wi::lua
{
const char Vector_BindLua::className[] = "Vector";
Luna<Vector_BindLua>::FunctionType Vector_BindLua::methods[] = {
lunamethod(Vector_BindLua, GetX),
lunamethod(Vector_BindLua, GetY),
lunamethod(Vector_BindLua, GetZ),
lunamethod(Vector_BindLua, GetW),
lunam... |
8ee8ac2d35aaf395af9e21cef7d856d872782db2 | fe282fd5f7134b5e4604f8f93272cf0a6a07e60b | poker6037/TIBURON-TRAINEES-2020 | /src/TASK 2/src/NODE1.cpp | C++ | cpp | 796 | no_license | #include "ros/ros.h"
#include "std_msgs/String.h"
#include <sstream>
#include "std_msgs/Int32.h"
int main(int argc, char **argv)
{
ros::init(argc, argv, "NODE_1");
ros::NodeHandle n;
ros::Publisher ch1_NODE1 = n.advertise<std_msgs::String>("ch1", 1000);
ros::Publisher ch3_NODE1 = n.advertise<std_msgs::Int32>(... |
8cec73fc59488dc80f50ebc106d9810a3cbe9a3d | 7a1f24ca1f01000fb430cb43b5129b68fec53ce1 | ptasior/tal | /src/sprite.cpp | C++ | cpp | 4,426 | no_license | #include "sprite.h"
#include "log.h"
#include "shader.h"
#include "renderer.h"
#include "texture.h"
#include "global.h"
#include "config.h"
#include <glm/glm.hpp>
#include <glm/gtc/matrix_transform.hpp>
#include <glm/gtc/type_ptr.hpp>
Sprite::~Sprite()
{
// if(mTexture)
// Log() << "~Sprite" << mTexture->getName(... |
f180d0a3a2c2a7d7389a697ec4a98ac711fdd718 | 8e5ac48129d9d44ceaea1187273da53f2cfa4583 | luqian2017/Algorithm | /LintCode/1495_Leaf-Similar-Trees/1495_Leaf-Similar-Trees.cpp | C++ | cpp | 848 | no_license | /**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param root1: the first tree
* @param root2: the... |
18072d0898dbd942639176284ce2cf798827f398 | ea464412b4017dbc1b4e9ec6aafd5e3259e4e860 | sxs-collaboration/spectre | /tests/Unit/Domain/Creators/Test_AlignedLattice.cpp | C++ | cpp | 15,708 | permissive | // Distributed under the MIT License.
// See LICENSE.txt for details.
#include "Framework/TestingFramework.hpp"
#include <array>
#include <boost/functional/hash.hpp>
#include <cstddef>
#include <memory>
#include <unordered_set>
#include <utility>
#include <vector>
#include "DataStructures/Tensor/Tensor.hpp"
#include... |
5a28f97db8896d5480b8b9132633733c8ac7f77f | 44c986f0b65fbf339c64b60182bb12035843ebeb | jamesfolberth/safe_nnls | /NNLS_all_inds_dome_subproblem_mex.cc | C++ | cc | 5,359 | permissive | /*
* NNLS_all_inds_dome_subproblem_mex:
*
* Solves the feature elimination "dome" subproblem
*
* min <a, nu>
* s.t. ||nu - nu0||^2 <= 2*gap_bound
* <a_i, nu> >= 0
*
* repeatedly, for each column a of A, and for each column a_i of A.
*
* This is used for NNLS feature elimination:
*
* Stron... |
539f48ba6b70ab684801959d93c8acdf008f7ca1 | 9db633102886441b92c47ca02c2130023d9bfb4d | thegamer1907/Code_Analysis | /contest/1542583169.cpp | C++ | cpp | 3,163 | no_license | /***
*
*
* DDDDDDDDDDDDD iiii lllllll 222222222222222 000000000 222222222222222
* D::::::::::::DDD i::::il:::::l2:::::::::::::::22 00:::::::::00 2:::::::::::::::22
* D:::::::::::::::DD ... |
82bf492a2b6cc8fc19a95ede65c83f332b6597ba | 8fa4abc0d3baa656b8b55a0a475337f7c57fd5b9 | rmrychecky/CSCI1300 | /Practice Practicum III/question11.cpp | C++ | cpp | 1,908 | no_license | #include <iostream>
#include <cmath>
#include <cstdlib>
#include <unistd.h>
#include <stdio.h>
#include <string>
#include <iomanip>
#include <fstream>
using namespace std;
int split (string str, char c, string array[], int size) //given split function
{
if (str.length() == 0) {
return 0;
}
str... |
f104e027c3e63691109811e7d3632bb33e9bef95 | 3d4fe061e7a9bfc1e9dd36303c432d884cad5163 | harshasrikara/cs3377 | /assignment5/parseCommandLine.cc | C++ | cc | 1,634 | no_license | /*
* Filename parser.cc
* Date April 21th 2020
* Author Harsha Srikara
* Email hxc170009@utdallas.edu
* Course CS3377.501
* Version 1
* Copyright Harsha Srikara
*
* Description reads command line args */
#include "parseCommandLine.h"
#include "enum.h"
//will instatiate all tclap objects to make parse the co... |
4e7033d743f260a33735a0adf748b1908add873d | 21e6e330d82f8b512f73d83f2cc172910314fbe3 | bluhm/botan | /src/tests/test_ocb.cpp | C++ | cpp | 11,160 | permissive | /*
* (C) 2014,2015 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include "tests.h"
#if defined(BOTAN_HAS_AEAD_OCB)
#include <botan/internal/ocb.h>
#include <botan/block_cipher.h>
#include <botan/internal/loadstor.h>
#include <botan/internal/poly_dbl.h>
#endif
nam... |
dd16a8e4bcb13bef345b52dcf5ca7904867c194b | 0ea725e7311ce216b4925245d8c7ccc786c27562 | RagnarDanneskjold/FederationCredits | /src/qt/sendcoinsdialog.cpp | C++ | cpp | 9,272 | permissive | #include "sendcoinsdialog.h"
#include "ui_sendcoinsdialog.h"
#include "walletmodel.h"
#include "federationcreditunits.h"
#include "addressbookpage.h"
#include "optionsmodel.h"
#include "sendcoinsentry.h"
#include "guiutil.h"
#include "askpassphrasedialog.h"
#include "base58.h"
#include <QMessageBox>
#include <QLocale>... |
e817a79a925b78804c122eababf3b3c17226890d | 55207618063e8e7e2cca5a0e35d82995187a1e54 | Uedaki/Teapot | /Teapot/src/Profiler.cpp | C++ | cpp | 2,188 | permissive | #include "Profiler.h"
#ifdef PROFILING
#include <chrono>
#include <thread>
#include "Log.h"
namespace
{
Profiler profiler;
}
Profiler::FunctionProfiler::FunctionProfiler(const std::string &session, const std::string &name)
: session(session)
{
auto startPoint = std::chrono::high_resolution_cl... |
e7c1c169db52fe1fa3da040bd63476ccbf850301 | ed5d3bc8d9195e38614a27bffeb8213049c1be8c | Cougar/HomeAutomation | /trunk/PcSoftware/Atom/src/Tools/tools.cpp | C++ | cpp | 9,121 | no_license |
#include <string>
/***************************************************************************
* Copyright (C) 2004 by Mattias Runge *
* mattias@mrunge.se *
* ... |
e967c58c5b7d79f67c3d26785ecfc710ea38af0f | 5eb70683701a567e33b55cb324d2267d39186858 | tpoisonooo/MegEngine | /dnn/src/cuda/conv_bias/inplace_matmul.cpp | C++ | cpp | 3,210 | permissive | /**
* \file dnn/src/cuda/conv_bias/inplace_matmul.cpp
* MegEngine is Licensed under the Apache License, Version 2.0 (the "License")
*
* Copyright (c) 2014-2021 Megvii Inc. All rights reserved.
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed o... |
f2f4f4b2907b3c51a2f99d23abf791918353679a | 8716c0d6f778021552a5060d1d02677ec1c77334 | AdarshMaurya/sdk | /runtime/vm/compiler/backend/constant_propagator.cc | C++ | cc | 53,168 | permissive | // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file
// for details. All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.
#if !defined(DART_PRECOMPILED_RUNTIME)
#include "vm/compiler/backend/constant_propagator.h"
#include ... |
fb9f3eb7052967f18c24dd13f5149a16d068fa0b | 4dfb2cc0f850e4cceca71bce82afb85ae3f7da89 | lumeng0822/PublicSecurityVideoRetrievalSystem | /PublicSecurityVideoRetrievalSystem/PublicSecurityVideoRetrievalSystem/CShowFileDir.cpp | C++ | cpp | 2,607 | no_license | // CShowFileDir.cpp: 实现文件
//
#include "stdafx.h"
#include "CShowFileDir.h"
#include <afxpriv.h>
IMPLEMENT_DYNCREATE(CShowFileDir, CFormView)
CShowFileDir::CShowFileDir()
: CFormView(IDD_SHOW_FILE_DIR)
{
TCHAR temp[255];
SHGetSpecialFolderPath(0, temp, CSIDL_DESKTOPDIRECTORY, 0);
filePath = temp;
}
CShowFileDi... |
8752826f9951479d080e11d54c3d15cc1cafd090 | 7981436aa6f06ff256f8848b0ec2ffd6d6e001be | JacobGower/2021_Winter_CSC_CIS_5 | /Class/Savings_with_MVC_2DIM_into_1DIM/main.cpp | C++ | cpp | 3,175 | no_license | /*
* File: main.cpp
* Author: Dr. Mark E. Lehr
* Created on January 20, 2021, 11:05 AM
* Purpose: Savings Using MVC Pattern implemented with Functions
*/
//System Libraries
#include <iostream> //I/O Library
#include <iomanip> //Input/Output Library
using namespace std;
//User Libraries
//Global Constants... |
5b674b59a8aa306b8f36b4dd495ccdd154786230 | 92497eb0d21217adf376fc033f3d15de421564b9 | il1ya/Cplusplus | /Practice/C++ Primer Plus (6th Edition)/chapter.3/progvopros.cpp | C++ | cpp | 6,259 | no_license | 1. Почему в языке C++ имеется более одного целочисленного типа?
1. более удобного программирования зависимости от объема данных
Наличие более одного целочисленного типа позволяет выбрать такой тип, который наиболее точно подходит под конкретные требования.
Например, можно было бы использовать short для экономии памят... |
33de6b36155aa85ee0b02040959873fa89bfa435 | 55751f2cda398e37e826e1be5f012f0c5185a018 | Javozz/UNSA-CS | /Semestre5/ADA/iSort.cpp | C++ | cpp | 1,003 | no_license | #include <iostream>
#include <vector>
using namespace std;
void selectsort(vector<int> &vec){
int n = vec.size();
for(int i = 0; i < n - 1; i++){
int menor = 1000000;
int index = 0;
for(int j = i; j < n; j++)
if(vec[j] < menor){
menor = vec[j];
index = j;
}
swap(vec[index],vec[i])
}
}
voi... |
b61a1aea9c129e034a331b709432ceee0049230a | ecb99f9f94cc982258f87c435830ffce268ba3f3 | bayne/CarND-Path-Planning-Project | /src/main.cpp | C++ | cpp | 13,993 | no_license | /*
* Majority of this code was copied from the walk-through
*
* https://www.youtube.com/watch?v=7sI3VHFPP0w
*/
#include <fstream>
#include <math.h>
#include <uWS/uWS.h>
#include "spline.h"
#include <thread>
#include "Eigen-3.3/Eigen/Core"
#include "json.hpp"
using namespace std;
// for convenience
... |
71bf91bc7690d3117dda48059ffd71ec91079e02 | 5caff8affa5a81793f5cac9d9b3ca7513db0e5bd | yandayixia/Xlib_break_out | /Source_Code/InputManager.cpp | C++ | cpp | 1,662 | no_license | #include "InputManager.h"
#include <iostream>
#include <string>
InputManager::InputManager(){}
InputManager::~InputManager(){}
bool InputManager::_left_signal = false;
bool InputManager::_right_signal = false;
bool InputManager::_space_signal = false;
std::string InputManager::LEFT_KEY = "Left";
std::string InputMan... |
edb920ecd715235654abe9d3a64a9eaedff9253c | b59766675a372942802656b850b2205f23c0d4bf | layshua/HydrodynamicsGPU | /src/Plot/Graph.cpp | C++ | cpp | 4,908 | no_license | #include "Common/gl.h" //only here for Ubuntu build's sake
#include "HydroGPU/Equation/Equation.h"
#include "HydroGPU/Plot/Graph.h"
#include "HydroGPU/Plot/Plot.h"
#include "HydroGPU/Plot/CameraOrtho.h"
#include "HydroGPU/HydroGPUApp.h"
#include "HydroGPU/Solver/Solver.h"
#include "Common/Macros.h"
#include "Common/Fi... |
aaaa4ce0f6a6266c91e52d7f8a98d72c9956fe37 | 7aed5ff0863a5e32f8d72261f10601852bd73273 | simply10w/MultiThreadSystem | /src/pcb.cpp | C++ | cpp | 2,485 | no_license | #include "pcb.h"
#include <dos.h>
#include "Timer.h"
#include "Thread.h"
#include "Schedule.h"
#include <iostream.h>
#include "KernSem.h"
PCB* initial= new PCB();
PCB* idlethread = new PCB(PCB::idle);
volatile PCB* PCB::running;
int PCB::active_threads=0;
int PCB::posId=0;
volatile PCB* carrier;
PC... |
2a26aedd586c5ea8f3c9df58c537ebbef12de9a6 | bdd642cf810575c9c8953b5ecf72f3432da3eb58 | bmeck/node | /deps/v8/test/cctest/test-decls.cc | C++ | cc | 36,300 | permissive | // Copyright 2007-2008 the V8 project authors. 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 lis... |
03d8bfcd23e439f37eefc1641bf5038d495f34ef | 1e5ac72f86edddb61bfbf14538702e0252fb14db | blockspacer/chromium_base_conan | /extensions/basic/disjoint_sets/disjoint_sets_unittest.cc | C++ | cc | 2,929 | permissive | // Copyright 2014-2015 Project Vogue. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <string>
#include "basic/disjoint_sets/disjoint_sets.h"
#include "basic/status/status_macros.h"
#include "basic/promise/post_promise.h"
#... |
9b88cdb5b71c281d5111f60a595c77d281f6737b | aa6eff0b6c1618908945bf66a15a57b9a0ef1ba4 | shirodora2/Shirodora2 | /Shirodora/Classes/Lib/Manager/Manager.hpp | C++ | hpp | 442 | permissive | //
// Manager.hpp
// BarrageGame
//
// Created by Ryoutarou Onimura on 2016/06/24.
//
//
#ifndef Manager_hpp
#define Manager_hpp
//=========================================================================
// シングルトンを利用したマネージャー系をまとめる
//=========================================================================
#includ... |
fefdedc4690769ecf7f26a4e3801228a3cfa2c8a | d515e74ce6aa2b421d65bccb1a3916c2d39abd8a | archinal/duchess | /duchess/test/testMoveVectorUtils.cpp | C++ | cpp | 4,331 | no_license | #include "testMoveVectorUtils.h"
#include "../Position.h"
#include "../Piece.h"
#include "../PieceType.h"
#include "../MoveVector.h"
#include "../Board.h"
#include "../MoveVectorUtils.h"
#include <cassert>
#include <vector>
#include <algorithm>
void TestMoveVectorUtils::runTests() {
TestMoveVectorUtils::test_get... |
ec0a272772283aa0705162efe88a7e9628bfee31 | a830cf5d93aa3808d8cad0b8f1bde1b7a4c24e35 | NXTRobot2k17/Orgel | /EmbSysLib/Lib/Example/Hardware/MCU/STM32L1xx/cHwRTC_MCU.cpp | C++ | cpp | 836 | permissive | //*******************************************************************
/*!
\file cHwRTC_MCU.cpp
\author Thomas Breuer
\date 31.01.2013, 17.03.2016
\brief Sample of using hardware related classes, MCU: STM32L1xx
*/
//*******************************************************************
#include "lib.h"
//***********... |
b1c1beb4c23715c46361d8b6fff55133f050c923 | 581a8236a5b23236b513e6bdb11bd201fe12d8da | aurantst/windows-XP-SP1 | /XPSP1/NT/windows/advcore/rcml/rcml/xmlnodefactory.cpp | C++ | cpp | 7,135 | no_license | // libcmtd.lib
//
#include "stdafx.h"
#include "xmlnodefactory.h"
CXMLNodeFactory::CXMLNodeFactory()
{
errorState = S_OK;
m_cbXMLFragment=0x20; // 80; // intial fragment size.
m_XMLFragment=new TCHAR[m_cbXMLFragment];
m_cbNSFragment=0x8; // space so we have a null terminated string a... |
bea7d591df31a32a5c38a6183debc239421c2fef | 60aed71014e6610fa01568cfc06147e578f08396 | xrombik/xray-16 | /src/editors/xrWeatherEditor/pch.hpp | C++ | hpp | 1,981 | permissive | ////////////////////////////////////////////////////////////////////////////
// Module : pch.hpp
// Created : 04.12.2007
// Modified : 04.12.2007
// Author : Dmitriy Iassenev
// Description : precompiled header for editor library
////////////////////////////////////////////////////////////////////////////
#pragm... |
2e6650e917e4770579ba7cb8c414f5cf679360f5 | 0d7e11ff6fefd8322cb7a66d391f1fbf5ca00fdd | tarasradio/arduino_car | /src/motor.cpp | C++ | cpp | 492 | no_license | #include "motor.hpp"
// Конструктор
Motor::Motor(int pinA, int pinB) {
this->pinA = pinA;
this->pinB = pinB;
}
void Motor::init() {
pinMode(this->pinA, OUTPUT);
pinMode(this->pinB, OUTPUT);
}
void Motor::forward() {
digitalWrite(this->pinA, HIGH);
digitalWrite(this->pinB, LOW);
}
void Motor::backward() ... |
8d824d17e829a84601c27413c180cfd81b42f93f | 05d55e0b53e654e8fd2d3ae1687db62f927b1765 | JonnyBanana/botnets | /VirusPack/RxBot-MP/MP/dcc.cpp | C++ | cpp | 7,991 | no_license | /*
rxBot - a modular IRC bot for Win32
Copyright (C) 2004
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 lat... |
6a7049eda51aba58839ccd580c1873b1e003b7c0 | ccbcba131c71e63563c5f71777bbf49900cef9e5 | zobeirraisi/SynthText3D | /Code/Unrealtext-Source/UnrealCV/Private/PugTextPawn.cpp | C++ | cpp | 148,903 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "UnrealCVPrivate.h"
#include "PugTextPawn.h"
#include "Engine/World.h"
#include "ConstructorHelpers.h"
#include "Components/StaticMeshComponent.h"
#include "Materials/MaterialInstanceDynamic.h"
#include "EngineGlobals.h"
#in... |
8ab52e33754c5089a5feee386e0beff1f7f0d87e | 3b9a0ff5eeda73918ed6b906261b8de5183d901c | TencentCloud/tencentcloud-sdk-cpp | /iss/src/v20230517/model/CheckDomainRequest.cpp | C++ | cpp | 2,635 | 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
... |
99df9a3d5ce74839bd8b7cd3fb01b605f9751a4d | b26c7a72c0b82f0a71af8caede67821da2d21039 | misslzyan/CPlusPlus | /leetcode/reverse_words.cpp | C++ | cpp | 479 | permissive | #include <iostream>
#include <string>
using namespace std;
string& reverse_words(string & s) {
for (int i = 0; i != s.length(); i++){
if(s[i] != ' '){
int j = i;
while (j < s.length() && s[j] != ' ') j++;
reverse(s.begin() + i, s.begin() + j);
i = j - 1;
}
}
return s;
}
int main ... |
9ac4a078c901fba0777382172c04baa60dd21be4 | 7335d8ce4b13399825e2d240fd6c002a305146a6 | birdluo/eddl | /tests/tensor/test_tensor_reduction.cpp | C++ | cpp | 17,133 | permissive | #include <gtest/gtest.h>
#include <random>
#include <string>
#include <ctime>
#include "eddl/tensor/tensor.h"
#include "eddl/tensor/tensor_reduction.h"
#include "eddl/tensor/nn/tensor_nn.h"
#include "eddl/descriptors/descriptors.h"
using namespace std;
TEST(TensorTestSuite, tensor_math_reduction_max) {
// Tes... |
43e846909828b86e0d8b43ed6517d2d05869b521 | 89cd08380ef7c8dfd298e0ddd9357bace4998f53 | whrenstone/PeopleTracker | /Core/HOGCore/HOG/HOGNMS.cpp | C++ | cpp | 5,495 | no_license | #include "HOGNMS.h"
#include <math.h>
using namespace HOG;
HOGNMS::HOGNMS()
{
center = 0.0f; scale = 1.0f;
nonmaxSigma[0] = 8.0f; nonmaxSigma[1] = 16.0f; nonmaxSigma[2] = 1.3f;
maxIterations = 100;
modeEpsilon = (float)1e-5;
epsFinalDist = 1.0f;
nsigma[0] = nonmaxSigma[0]; nsigma[1] = nonmaxSigma[1]; nsigma[2]... |
3fc1373b9f0ccffc576e4e52d356e02acb446bdd | 6cbeb4719d840ab90bb99b9171ff30ccc8803c57 | vinicinbgs/bhaskara | /main.cpp | C++ | cpp | 605 | no_license | #include <iostream>
#include "formula.h"
#include <locale.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
int main() {
setlocale(LC_ALL, "portuguese-brazilian");
float a, b, c;
cout << "Informe o Valor de A: ";
cin >> a;
cout << "In... |
d942f0eb2dac5413b3f9cb48110cc55bb4ce4f75 | 400bbb800fa50a36ce32a02e5e7b540af0d88f5d | informagi/duckdb | /tools/rpkg/src/relational.cpp | C++ | cpp | 16,936 | permissive | #include "cpp11.hpp"
#include "duckdb.hpp"
#include "typesr.hpp"
#include "rapi.hpp"
#include "R_ext/Random.h"
#include "duckdb/parser/expression/columnref_expression.hpp"
#include "duckdb/parser/expression/constant_expression.hpp"
#include "duckdb/parser/expression/function_expression.hpp"
#include "duckdb/parser/ex... |
761d34b36d82ac45d56caa2d6c91a927a9eb984b | 72c23e2cb9a9972d0175e786c0869319872337de | exjra/windows-opengl-context | /src/test-shared-context-threading.cpp | C++ | cpp | 10,712 | no_license | #include <windows.h>
#include <stdio.h>
#include <gl/gl.h>
#include <gl/glext.h>
#include <gl/wglext.h>
#include <thread>
/* ----------------------------------------------------------- */
class GlContext {
public:
void print(const char* name);
public:
PFNWGLCHOOSEPIXELFORMATARBPROC wglChoosePixelFormatARB = null... |
50c514e53bd4f087fefd9a00e5ff89919a710b1d | e6a7298e5d4dc7adea62ad3ba335f885902e2c1c | kishorevarma369/Competitive-Programming | /Code-Chef/contests/AUG19A/test.cpp | C++ | cpp | 1,426 | permissive | #include<bits/stdc++.h>
using namespace std;
int main()
{
// 1.23 8.90 -5.67
float k,a=0,b=0,c=0,d=0,oi,oj,ok,ol,mymax=0,t,l;
// oi=1.23,oj=8.9,ok=-5.67;
int cou=0;
float mi,mj,mk,ml;
oi=5,oj=6,ok=7,ol=8;
for(float i=-oi;i<=30;i+=0.05)
{
for(float j=-oj;j<=30;j+=0.05)
{... |
ae9a082bc35f0a1c187f2b7ceabd17a45685e117 | 27779d57a3728b686b36f8af0f708f47a742a728 | BlenderCN-Org/carpg | /source/panels/WorldMapGui.cpp | C++ | cpp | 21,004 | permissive | #include "Pch.h"
#include "GameCore.h"
#include "WorldMapGui.h"
#include "Game.h"
#include "Language.h"
#include "Journal.h"
#include "Version.h"
#include "QuestManager.h"
#include "Quest_Mages.h"
#include "Quest_Crazies.h"
#include "Encounter.h"
#include "InsideLocation.h"
#include "City.h"
#include "GlobalGui.h"
#inc... |
1cc329bf0352dd01336b8f478ddbd1b05cebb662 | 301ad45f58a7ecd3386de0cf8223ecf3907b9b36 | echoz/xlibspatialite | /geos/src/geomgraph/Quadrant.cpp | C++ | cpp | 4,444 | no_license | /**********************************************************************
*
* GEOS - Geometry Engine Open Source
* http://geos.osgeo.org
*
* Copyright (C) 2001-2002 Vivid Solutions Inc.
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU Lesser General Public Licence as p... |
9d58f1c250020cf5d5399839eed04dafcac54763 | fad19ff2b42d7df2533540810fc921f407f92f6a | Fridalex/MashGraph | /mg/mg.cpp | C++ | cpp | 33,402 | no_license | #include "glad.h"
#include <GLFW/glfw3.h>
#include "stb_image.h"
#include <vector>
#include <string>
#include <glm/glm.hpp>
#include <glm/gtc/matrix_transform.hpp>
#include <glm/gtc/type_ptr.hpp>
#include "shader.h"
#include "camera.h"
#include <iostream>
void framebuffer_size_callback(GLFWwindow* window, int width... |
0b82225d79250f5a24e5dde8695e5a0acf767a2b | 2be142d7cfbf792f0028d20e1908d59ca9f28a2a | sunrise16/2D_Portfolio_EscapeFromTheMaze | /progressBar.cpp | C++ | cpp | 1,339 | no_license | #include "stdafx.h"
#include "progressBar.h"
// 초기화 (init)
HRESULT progressBar::init(const char * frontImg, const char * backImg)
{
// 체력바 이미지 초기화
_progressBarFront = IMAGEMANAGER->findImage(frontImg);
_progressBarBack = IMAGEMANAGER->findImage(backImg);
// 체력바 위치 초기화
_x = _progressBarBack->getX();
_y = _progre... |
fd91176d3055cb53ff2938a238844072cd08c213 | 7ba812a63ba64df28f77e9cf36a7fa5fea3bdb00 | IIvanov21/Monopoly | /MonopolyManager.cpp | C++ | cpp | 307 | no_license | #include "MonopolyManager.h"
/*MonopolyManager::MonopolyManager()
{
startBalance = 1500;
}*/
void MonopolyManager::gameStart()
{
cout << "Welcome to Monopoly" << endl;
}
int MonopolyManager::Random()
{
return static_cast<int>(static_cast<double> (rand()) / (RAND_MAX + 1) * 6.0f + 1);
} |
b0c48aae4d3981da0bfcca60be1d3216e7e84938 | d037448ccf91c716b11bd9ea99fabb84d8667015 | lixia666/ordinalForest | /src/rangerCpp.cpp | C++ | cpp | 9,322 | no_license | /*-------------------------------------------------------------------------------
This file is part of Ranger.
Ranger is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at y... |
7bc90d22afdcd56c55571d9028cdacb12bab78c3 | 1981d231fc0f47d49f487b0b2a55c73d53c576b4 | robgietema/subzero_editor | /src/3ds/mat_bump_map.cpp | C++ | cpp | 4,877 | no_license | /*******************************************************************************
* File: mat_bump_map.cpp
* Author: Tycoon (tycoon@planetdescent.com)
* Date: 2 January 2004
*******************************************************************************/
/////////////////////////////////////////////////////////... |
b8fa147588c28dae8c5c94273535f9b906d110ee | 8e1075da7f1cd5c3cac95928829f95eed53c8e52 | volodya-kiber/Auto-Il2cppDumper | /app/src/main/cpp/Includes/il2cpp_dump.cpp | C++ | cpp | 15,299 | no_license | //
// Created by Perfare on 2020/7/4.
//
#include "il2cpp_dump.h"
#include <dlfcn.h>
#include <cstdlib>
#include <cstring>
#include <cinttypes>
#include <string>
#include <vector>
#include <sstream>
#include <fstream>
#include "log.h"
#include "il2cpp-tabledefs.h"
#include IL2CPPCLASS
#define DO_API(r, n, p) r (*n) p... |
4b2125e11f9e8f9c39ba344dbdd5ef343aea9d7c | dc6b97887dc4ee66b5038dd6939bae945b62902a | fredjo89/master-code | /limSend_3.5/main.cpp | C++ | cpp | 4,118 | no_license | //The limSend_3.5 code.
//The ompSolver has been changed so that it handles grids where type 1 cells has
// been removed. The change results in a non-optimal implementation.
#include "data_defs.h"
#include "readFromFile.h"
#include "ompSolver.h"
#include "utilities.h"
#include "TypeTwo.h"
#include "Basis.h"
#include... |
18c279b47b6ef1b648868aa1485a7544b70444c8 | b76f4dbbb3f12d20a61ae1ab707275c482a7d95e | Aantonb/gotham | /path/SimpleBidirectionalRussianRouletteSampler.cpp | C++ | cpp | 8,270 | permissive | /*! \file SimpleBidirectionalRussianRouletteSampler.cpp
* \author Jared Hoberock
* \brief Implementation of SimpleBidirectionalRussianRouletteSampler class.
*/
#include "SimpleBidirectionalRussianRouletteSampler.h"
#include "Path.h"
#include "../shading/ScatteringDistributionFunction.h"
#include "../geometry/Ray.... |
06049beb963cf19659cee1e8dfa4a2074ad05c84 | 574f72729cdd2b73b4ee27c009ebe64bdfd764a1 | ayushiagarwal99/leetcode-lintcode | /leetcode/sort/1651.shuffle_string/1651.ShuffleString_henrytine.cpp | C++ | cpp | 1,777 | permissive | // Source : https://leetcode.com/problems/shuffle-string/
// Author : henrytine
// Date : 2020-07-26
/*****************************************************************************************************
*
* Given a string s and an integer array indices of the same length.
*
* The string s will be shuffled suc... |
dd11c6d6585a400643411d32f2355bfae5ebdf79 | 029392b61840f7c0fd5ae77e194f3fa62c39a827 | limiha/leaf | /test/capture_result_state_test.cpp | C++ | cpp | 1,404 | permissive | // Copyright (c) 2018-2020 Emil Dotchevski and Reverge Studios, Inc.
// 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)
#ifdef BOOST_LEAF_TEST_SINGLE_HEADER
# include "leaf.hpp"
#else
# include <boost/leaf/captur... |
d5baf5d6c8e365645cfb6b968ebd36bc14f79562 | 6e4413e03bc2404c80e8aa6bb3b63d77627a5ade | haimeh/mxnet_a51m | /3rdparty/mkldnn/src/common/utils.cpp | C++ | cpp | 5,894 | permissive | /*******************************************************************************
* Copyright 2018-2020 Intel Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apa... |
dea2fadc06c1e48ade223678124da347649e7e31 | 6e978ca8f6aba7eabf5b9030e2e0cb209f55aa4d | MouCoder/C_code | /Project2-11-29(1)/Project2-11-29(1)/test.cpp | C++ | cpp | 543 | no_license | #define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<string.h>
bool isSubsequence(char * s, char * t)
{
if (*s == '\0')
return true;
else if (*t == '\0')
return false;
int i;
for (i = 0; i < strlen(s); i++)
{
while (*t)
{
if (s[i] == *t)
{
t++;
break;
}
t++;
}
if (*t == '\0'... |
f7059df74248242dc4543f03d87248a8a2c45a7f | 6e246b63acbbcf5612bb13b6a6ed3ac1d9c4ced5 | AlexLlanesQuevedo/angsd | /abcSaf.cpp | C++ | cpp | 44,751 | no_license | #include <cstdio>
#include <cmath>
#include <assert.h>
#include <cfloat>
#include <htslib/kstring.h>
#include "abcFreq.h"
#include "shared.h"
#include "analysisFunction.h"
#include <pthread.h>
#include "abc.h"
#include "abcSaf.h"
#include "aio.h"
#define MINLIKE -1000.0 //this is for setting genotypelikelhoods to miss... |
c870d67dc7b6d9599a971000260b25c08e5eb5c3 | 6178e426635d7d61622e3588a27a41b94ba2b3bd | JaeUkas/Algorithm | /15683.cpp | C++ | cpp | 2,295 | no_license | #include <iostream>
using namespace std;
int N, M, zeroCnt, ans = 9999;
int map[9][9];
int tMap[9][9];
int cctv[8], cctvCnt;
void copyMap()
{
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
tMap[i][j] = map[i][j];
}
void countZero()
{
zeroCnt = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j < M;... |
76ba0d5a931a8ad8ad3a0418d504b038131b985f | 4fe8c16263319b7ea8f42cd835ebf1bf2ffa01dd | cvson/PM_Ana | /app/get_daily_evt_corr2.cc | C++ | cc | 5,682 | no_license | //#define TEST 1
//##### Standard C++ lib. ######
#include<iostream>
#include<sstream>
#include<fstream>
using namespace std;
#include <iomanip.h>
#include <sys/stat.h>
#include "math.h"
//##### Root Library ###########
#include <TROOT.h>
#include <TStyle.h>
#include <TH1.h>
#include <TH2.h>
#include <TApplication.h>
#... |
daf9f888a2e54096063d59c08e6bff773eac97cb | f875e3794cd8f8ac7c970e9a50322b6c236dc942 | piotrek-golda/ImageMatching | /src/Matchers/SimpleKeysMatcher.cpp | C++ | cpp | 1,276 | no_license | //
// Created by piotrek on 14.05.16.
//
#include <typeinfo>
#include <iostream>
#include "SimpleKeysMatcher.h"
#define DISTANCE(x1,x2,y1,y2) (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)
void SimpleKeysMatcher::match(std::vector<cv::Point2f> &key_points1, std::vector<cv::KeyPoint> &key_points2,
std::vector<std::pair<int... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.