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 |
|---|---|---|---|---|---|---|---|---|
fc8015f8f595cd9658487acc0bba5675d1950b64 | 639346a5802947ab86cd25a18574a02df21bd0dc | RomanPr194/Algorithms-I | /5_Visual_QU_weighted/src/Main.cpp | C++ | cpp | 6,027 | no_license | #include <iostream>
#include <vector>
#include <string>
#include <time.h> // for random seed!
#include <algorithm> // for
#define LOG(x) std::cout << x << std::endl;
class QuickUnionUF
{
private:
std::vector<int> id;
std::vector<int> sz; //sizes of sub-trees
int root(int& i)
{
while(i != thi... |
6b2f80e24083651e8290fc23f5fe4877b03d2652 | 03e1f966f462178205f17b677a03a075d449f774 | sativa/apsim_development | /ApsimOutlook/Source/Outlook/main.cpp | C++ | cpp | 14,259 | no_license | //---------------------------------------------------------------------
#include <general\pch.h>
#include <vcl.h>
#pragma hdrstop
#include "Main.h"
#include "About.h"
#include "TDrill_down_form.h"
#include <general\vcl_functions.h>
#include <general\path.h>
#include <dos.h>
#include <shellapi.h>
#include "TSkin.h"
#in... |
def335725cb72009ef4a02c1ba9c5c9f113c3a29 | ae9233cbe135eb5e213c2dcc2878b963388c5036 | Xaxetrov/CMakeParser | /tests/UnquotedElementParser_tests.cpp | C++ | cpp | 1,490 | permissive | #include "UnquotedElementParser.hpp"
#include "Error.hpp"
#include "Range.hpp"
#include "Token.hpp"
#include "catch.hpp"
TEST_CASE("UnquotedElementParser", "[Parser]")
{
using namespace std::literals;
using namespace cmake::language;
Parser<ElementType::UnquotedElement> parser;
SECTION("Parse")
{
SECT... |
e33252cd8e885f10867bc7444efb1ee6fcc700e0 | d06648c43f106ae73a9c98b2e117c47fcf56d54c | wojun/RTFGU | /src/ShaderRec.cpp | C++ | cpp | 747 | no_license | #include "ShaderRec.h"
#include "Constants.h"
#include "World.h" // for use the method of class World
ShaderRec::ShaderRec(World &wr) : hit_an_object(false),local_hit_point(),normal(),color(black),w(wr) {}
ShaderRec::ShaderRec(const ShaderRec &sr) : hit_an_object(sr.hit_an_object),local_hit_point(sr.local_hit_point),
... |
deb0ffef3f28f51f63af910084aa0dde2d23220a | 2a64961e8047f6a995e3d161724db066a078f098 | paolococchi/kv_engine | /tests/function_chain/function_chain_test.cc | C++ | cc | 2,695 | permissive | /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/*
* Copyright 2016 Couchbase, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* ... |
fa62aa8ee97273086c23935a645b940524bbd2e1 | d39109f82347aff6f83678e87900e4fa131d8c67 | ekispece/CompNaturalUFMG20152 | /main.cpp | C++ | cpp | 5,843 | no_license | #include <iostream>
#include <memory>
#include "Operators.h"
#include "BinaryTree.h"
#include "ExpressionParse.h"
#include "Population.h"
#include "FileParser.h"
#include "ExecutionParameters.h"
int main()
{
/**
* Seeding part 1443936225
*/
auto seed = time(NULL);
std::cout << "Hello, no seed was... |
2d1215a0b01ddc8290c04cb1954ec16f1d802327 | 34a3951c4881fabb9b8707099786f348ed062aa0 | magicus/phoneME | /cldc/src/vm/share/float/IEEE754_rem_pio2.cpp | C++ | cpp | 6,674 | no_license | /*
*
*
* Copyright 1990-2007 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License version
* 2 only, as published by the Free ... |
ee314a7edbee7a2676b5a1ce5edef88ee336e67f | 916dc15b5b13f2d9174ff7182f9dcb194b58fa79 | onecan2009/hellogit | /Joseph/josephus.cpp | C++ | cpp | 924 | no_license | #include "josephus.h"
#include "ring.h"
#include <iostream>
using namespace std;
Josephus::Josephus(int boys, int begin, int m)
{ while(boys<2||begin<1||m<1||m>boys)
{
cout <<"please input \nnumber of boys, begin position,interval per count :\n" ;
cin >> boys >> begin >>m;
}
numOfBoys = ... |
f480c38843a89a111e7766f0aaeb6a1bb00bacc0 | c70c9c6bcc54ebff244f5aaf56863ba131d09302 | SwordFish-MK2/Games-cource-Related-Homeworks | /Games-101/Assignment5/Triangle.hpp | C++ | hpp | 3,603 | no_license | #pragma once
#include "Object.hpp"
#include <cstring>
bool rayTriangleIntersect(const Vector3f& v0, const Vector3f& v1, const Vector3f& v2, const Vector3f& orig,
const Vector3f& dir, const Vector2f& uv0, const Vector2f& uv1, const Vector2f& uv2, float& tnear, float& u, float& v)
{
// TODO: Implement this function ... |
36177f3f308d53620635362c525eaa6471855287 | 4b9bdb461a67c8f3e32fc54196c2dc1514f35549 | brioche1703/Brioche | /Brioche/src/Brioche/ImGui/ImGuiLayer.cpp | C++ | cpp | 2,528 | permissive | #include "brpch.h"
#include "ImGuiLayer.h"
#include "imgui.h"
#include "examples/imgui_impl_opengl3.h"
#include "examples/imgui_impl_glfw.h"
#include "Brioche/Application.h"
// TEMPORARY
#include <GLFW/glfw3.h>
#include <glad/glad.h>
namespace Brioche {
ImGuiLayer::ImGuiLayer()
: Layer("ImGuiL... |
b02c0594c161568b541de5fd1e99ca01c4b88f7d | 8f9bc558cbe3e94877950633279e2a7313657269 | sebasobotka/blendProblem | /src/ofApp.cpp | C++ | cpp | 4,895 | no_license | #include "ofApp.h"
//--------------------------------------------------------------
void ofApp::setup(){
ofSetLogLevel(OF_LOG_VERBOSE);
appWidth = 800;
appHeight = 600;
appFrameRate = 60;
ofSetFrameRate(appFrameRate);
ofSetWindowShape(appWidth, appHeight);
aImg.load("lenna.png");
bImg.load("paper.jpg");
mas... |
d43dd71246e53301116d97f8b5eddd47db19636b | c287227f4a999fc7e45f468989b1312c4484c835 | hydraskillz/Chronocraft | /src/PerlinNoise.cpp | C++ | cpp | 3,482 | no_license | /* coherent noise function over 1, 2 or 3 dimensions */
/* (copyright Ken Perlin) */
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#define B 0x100
#define BM 0xff
#define N 0x1000
#define NP 12 /* 2^N */
#define NM 0xfff
static int p[B + B + 2];
static double g3[B + B + 2][3];
static double g2[B + B + ... |
e43d7d5886a41c89355fdc98da905a9001d665f2 | 56246b0a5f005f624102edf8097318f064b11efe | atrin-hojjat/CompetetiveProgramingCodes | /CF/CONTEST_455D2/B.cpp | C++ | cpp | 1,403 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <math.h>
#include <stack>
#include <deque>
#define mp make_pair
#define F first
#define S ... |
403f143b986e735c91cf26fff6203ea1c468415d | 7d690351ec577a81e60fa45844fc7f444ca1107f | gajgeospatial/clBLAS-1.10 | /src/msvc/include/AutoGemmKernelSources/sgemm_Col_TT_B0_MX048_NL048_KX08_src.cpp | C++ | cpp | 8,114 | permissive | /*******************************************************************************
* This file was auto-generated using the AutoGemm.py python script.
* DO NOT modify this file! Instead, make changes to scripts in
* clBLAS/src/library/blas/AutoGemm/ then re-generate files
* (otherwise local changes will be lost a... |
dc1354e46895338db1f9cce0e1c8196cd02b8106 | 43c84889fa17173cf0431767eb62f4b5b5454b7b | alexandraback/datacollection | /solutions_5640146288377856_0/C++/macieck9/a.cpp | C++ | cpp | 336 | no_license | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
int tt;
cin >> tt;
for (int t = 1; t <= tt; t++)
{
int r,c,w;
cin >> r >> c >> w;
cout << "Case #" << t << ": " << (int)ceil(1.0*c/w)+w-1 << "\n";
}
... |
11712b8161fe76162fa2279c63b1fa6dd3d49191 | 02782a71d328114db3b57c56e1a915a2d728fd2a | jacoblukewood/ems | /utility.cpp | C++ | cpp | 1,110 | no_license | // utility.cpp
// github.com/jacoblukewood/ems
// Copyright 2020 Jacob Wood
#include "utility.h"
namespace utility {
bool IntervalPassed(unsigned long const start_time, unsigned int const interval) {
return (((unsigned long)(millis() - start_time)) >= interval); // TODO: Probably could be cleaned up. Nee... |
4065e9fad089988f1cb93438c170157f833a0eac | 900479c84360481d872e21678b7350fd8656fef4 | Bia10/clrn | /ThirdParty/boost/geometry/algorithms/correct.hpp | C++ | hpp | 7,517 | no_license | // Boost.Geometry (aka GGL, Generic Geometry Library)
// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
... |
c62cd2cd1622e817c2b6b44f24a6d984dd1aff7d | 331a6c089288bd2d37fe2e4c96155e48426a1c5f | rzuniga64/cplusplus | /cosc1337/Source Files/lectures/lecture8/pass_by_reference/SetToSeven.cpp | C++ | cpp | 238 | no_license | #include <iostream>
using namespace std;
void setToSeven(int &);
int main()
{
int num = 16;
setToSeven(num);
cout << num << endl;
system("PAUSE");
return 0;
}
void setToSeven(int & i)
{
i = 7;
}
|
efe76d277d64cc5bff2566031172c53149e7ae09 | c3789e2bfe8df221ba4581b5d9f3eddd8960a1b4 | kernsuite-debian/mt-imager | /code/mt-imager/lib/operators/CreateIndexAndReorder.cpp | C++ | cpp | 2,182 | no_license | /* CreateIndexAndReorder.cpp: Pure C++ implementation of the CreateIndexAndReorder operator
*
* Copyright (C) 2013 Daniel Muscat
* 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, eit... |
cd3e8e19cfdea6663a7245701c47885f0ea225dc | a82176891762aab72d1915879a356bc39bbbdf64 | yourWaifu/v8-cmake | /v8/src/heap/cppgc/stack.cc | C++ | cc | 5,257 | permissive | // Copyright 2020 the V8 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.
#include "src/heap/cppgc/stack.h"
#include <limits>
#include "src/base/platform/platform.h"
#include "src/heap/cppgc/globals.h"
#include "src/heap/cpp... |
22d037b210265245f9b10b83029d5ef36260a9a5 | 46d65880e3a8c29a4588a4e732993f7e1e068c0e | dagil02/PCOM | /UVa 12159/UVa 12159/Source.cpp | C++ | cpp | 2,034 | no_license |
#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <climits>
#define MAX 306
using namespace std;
int X[MAX], Y[MAX], P[MAX], G[MAX][MAX], n, r, a, b;
bool V[MAX];
bool team(int c) {
return (X[b] - X[a])*(Y[c] - Y[a]) - (... |
24ce5efed79763bdd9687ed4c1f56d50bade30df | f0cc6e2b44f43ac6700df1cc003da5444015f635 | rtohid/blaze | /blazemark/src/main/TDMatTDMatAdd.cpp | C++ | cpp | 13,804 | permissive | //=================================================================================================
/*!
// \file src/main/TDMatTDMatAdd.cpp
// \brief Source file for the transpose dense matrix/transpose dense matrix addition benchmark
//
// Copyright (C) 2012-2018 Klaus Iglberger - All Rights Reserved
//
// This fi... |
186b917ecf19ddaaad6a3fb0a944fe3a7bcf7700 | a79e6f6d3f404f09970caef3dbfdf2a9a0ebbb5c | MaximKolesnik/Sulfur | /src/SulfurEngine/Modules/Graphics/Pipeline/Nodes/sfRenderDebugDraw.hpp | C++ | hpp | 1,263 | no_license | /******************************************************************************/
/*!
\par Sulfur
\file sfRenderDebugDraw.hpp
\author Dylan Norris
\par DP email: d.norris@digipen.edu
\date 9/6/2016
\brief Node for rendering debug draw objects
All content © 2016 DigiPen (USA) Corporation, all rights re... |
027ca6a5292c7208a6e6bf4d8dc34412e8ee395b | 344f13e30973a79a575f01be2eab1ca51b6bbadb | 4ian/GD-Extensions | /TiledSpriteObject/Extension.cpp | C++ | cpp | 10,051 | permissive | /**
Game Develop - Tiled Sprite Extension
Copyright (c) 2012 Victor Levasseur (victorlevasseur01@orange.fr)
Copyright (c) 2014 Florian Rival (Florian.Rival@gmail.com)
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 th... |
b8873c9204811694437cf9d122eadccc53179127 | 364aff76f2fbadf487c067df7f70b52f95e72a3a | igchesnok/AHRUnrealEngine | /Engine/Source/Runtime/Engine/Private/Landscape/LandscapeSplineProxies.cpp | C++ | cpp | 278 | no_license | // Copyright 1998-2014 Epic Games, Inc. All Rights Reserved.
#include "EnginePrivate.h"
#include "Landscape/LandscapeSplineProxies.h"
#include "Landscape/LandscapeSplineSegment.h"
ENGINE_API void HLandscapeSplineProxy_Tangent::Serialize(FArchive& Ar)
{
Ar << SplineSegment;
} |
779bebacd0f03b27f064099c67824e12fe549bf4 | a49d4c2d971bcdc44ee17d01493bcde791c4f6f2 | roshan-raj/mwb-codes-cpp | /structures_cpp/enum_flags.cpp | C++ | cpp | 312 | no_license | #include <iostream>
using namespace std;
enum designFlags
{
BOLD = 1,
ITALICS = 2,
UNDERLINE = 4
};
int main()
{
int myDesign = BOLD | UNDERLINE; // Bold OR Underline
// 00000001
// | 00000100
// ___________
// 00000101
cout << myDesign << endl ;
return 0;
} |
f514bbfd4851b7d1de14b963f67645b9da467734 | ee69610c8aa285a5d97e0601e0e20dd8aed7c7c9 | strigazi/athena | /Database/CoolLumiUtilities/src/BunchLumisCondData.cxx | C++ | cxx | 1,050 | permissive | /*
* Copyright (C) 2002-2019 CERN for the benefit of the ATLAS collaboration.
*/
/**
* @file CoolLumiUtilities/src/BunchLumisCondData.cxx
* @author scott snyder <snyder@bnl.gov>
* @date May, 2019
* @brief Holds raw luminosity data, per channel.
*/
#include "CoolLumiUtilities/BunchLumisCondData.h"
/**
* @bri... |
791b0302f23e81d372cb3b554ce538c58e72afc5 | ce3b5236bddc452a6e875336be45f0f9a9205887 | barriserloth/pxp-agent | /lib/inc/pxp-agent/configuration.hpp | C++ | hpp | 10,197 | permissive | #ifndef SRC_CONFIGURATION_H_
#define SRC_CONFIGURATION_H_
#include <horsewhisperer/horsewhisperer.h>
#include <boost/filesystem.hpp>
#include <boost/nowide/fstream.hpp>
#include <boost/multi_index_container.hpp>
#include <boost/multi_index/random_access_index.hpp>
#include <boost/multi_index/hashed_index.hpp>
#incl... |
a0304e10b1eebdb7d937ade083e3ba0e9ae2b46b | 439c2c3d64d2e5be1f418de96b0ca0fc2d1ec792 | JeffMcClintock/modules | /se_sdk3/TimerManager.cpp | C++ | cpp | 5,917 | no_license |
#ifdef _WIN32
#ifdef _MFC_VER
#include <Afx.h>
#else
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#endif
#else
#import <CoreFoundation/CoreFoundation.h>
#endif
#include <algorithm>
#include "TimerManager.h"
#include "assert.h"
// time (in ms) between VST onidle calls (via WM_TIMER)
#define IDLE_PERIOD 50
#i... |
19933f166e4ff8423c5199380e0f063c521aa7fc | 401112cf7f3fe225c60bb829dfa446e84765b67e | ethanswatson/CS1410 | /hw3-frequency-analysis/Record.hpp | C++ | hpp | 495 | no_license | #ifndef _RECORD_HPP_
#define _RECORD_HPP_
class Record
{
public:
Record(unsigned int value, unsigned int frequency = 1)
{
m_number = value;
m_frequency = frequency;
}
unsigned int getNumber() { return m_number; }
unsigned int getFrequency() { return m_frequency; }
void setNumber(unsigned int... |
8b39041b563788c04ad31373d1f16ac788ef7960 | 6a7f89871edda1f5dfe330da2ad3ad28caa0eae4 | RapidsOfficial/Rapids | /src/test/allocator_tests.cpp | C++ | cpp | 3,905 | permissive | // Copyright (c) 2012-2013 The Bitcoin Core developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "util.h"
#include "allocators.h"
#include "test/test_pivx.h"
#include <boost/test/unit_test.hpp>
BOOST_FIXTUR... |
44a0cf101632c92f2b11cd431febad3f7c0fb2c9 | b4d1a45549aca2e833429a012d797fa12e5068bc | karolina-l/nnowy_dron_podwodny | /Draw3D_api_interface.hh | C++ | hh | 6,203 | permissive | /*
Copyright 2020 Arkadiusz Mielczarek
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute... |
582516cb0083b2bdeab991ce6c4660aa9810fada | 879e2987ad09a90d6747fe6b0c703fdd49eba8f6 | robin1987z/telekyb | /telekyb_main/tk_trajectory_modules/src/trajmodules/AMTrajectorySmoothing.cpp | C++ | cpp | 4,837 | no_license | /*
* AMTrajectorySmoothing.cpp
*
* Created on: Nov 26, 2012
* Author: rspica
*/
#include <trajmodules/AMTrajectorySmoothing.hpp>
#include <tk_trajprocessor/TrajectoryProcessorController.hpp>
#include <boost/numeric/odeint.hpp>
#include <telekyb_base/ROS.hpp>
// Declare
PLUGINLIB_EXPORT_CLASS( telekyb_tr... |
8ef6e7f571caa0fd9379c0b7a36bcd3ac22d96f9 | c874d183c96c98589618e6345051ab013e9edf42 | krzysztof-osiecki/Licencjat | /Panels/functionpanel.cpp | C++ | cpp | 2,207 | permissive | #include <QMessageBox>
#include <QMouseEvent>
#include <QMenu>
#include <QPoint>
#include <QContextMenuEvent>
#include "functionpanel.h"
#include "Toolbar/customtoolbar.h"
#include "Serialization/xmlparser.h"
#include "functionblock.h"
#include "Constants.h"
FunctionPanel::FunctionPanel(bool isFullPanel, BasePanel *pa... |
bac5506dd56c47e76a7b8f78a45b06faf07353dd | a4ffa15399ea6e1406dcfe675fbd1e2c5cb47cc8 | hsemrk/problemsolving | /codeforces/1200/B. Make Them Equal.cpp | C++ | cpp | 1,052 | no_license | //https://codeforces.com/problemset/problem/1154/B
//*********Houssem Rekik*********
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl ;
typedef vector<int> vi ;
#define mp make_pair
#define pb push_back
#define rd(t,n) for (int i = 0; i < n; i++)cin>>t[i]
#define wr(t... |
9e1ec2770e6b1ddce158f83ee014e2b6f2e870d0 | c2c0fdceb60aa15daa117290829bb2d4a291b2ee | artisteacher/opentoonz | /toonz/sources/common/tfx/ttzpimagefx.cpp | C++ | cpp | 10,733 | permissive |
// TnzBase includes
#include "trasterfx.h"
#include "ttzpimagefx.h"
//**********************************************************************************************
// Global functions
//**********************************************************************************************
void parseIndexes(std::string... |
3869b8b9a687d1d94da34ceb67f5b1c088b680ad | 6a185608fa7da19bedab900d25af6cd6df7ab132 | Burnyaxa/lab01 | /lab01/country.cpp | C++ | cpp | 1,874 | no_license | #include "file_methods.h"
#include "country.h"
void print(vector <country> data, int size){
for (int i = 0; i < size; i++){
cout << data[i].name << " " << data[i].score << endl;
}
cout << endl;
}
void sortByScore(vector <country> &data,int size){
string tempC;
int tempP;
for (int i = 0; i < size - 1; i++) {
... |
47de0adb3633083025ae55bdb4e80de8f5296daf | 1184ebc485d8bdcb8266d874fd0105ea75e99f22 | qikai/chromium | /ash/login/ui/parent_access_view_unittest.cc | C++ | cc | 25,638 | 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 "ash/login/ui/parent_access_view.h"
#include <memory>
#include <string>
#include "ash/accessibility/accessibility_controller_impl.h"
#include "... |
35f9a448b6772f3aea5957774c8b10280359b552 | 10591ba890508b5bad1ff8dca0d7075d93141e1f | contactjw/practice | /C++/pure-abstract-base-class/pure-abstract-base-class/main.cpp | C++ | cpp | 764 | no_license | #include <iostream>
#include "Circle.h"
#include "Rectangle.h"
using namespace std;
int main()
{
// constructor values from left to right are x coord, y coord, and radius.
Circle *circ = new Circle(2, 5, 3);
cout << "Circle Test" << endl;
cout << "Center X: " << circ->getCenterX() << endl;
cout << ... |
d56bc7e4d865f28a388fdd63e5305ea8e83eb7be | 8f5ac7f7fdedf4f40d16793af197c628002b6303 | guinao/poj | /poj1979.cpp | C++ | cpp | 712 | no_license | #include <cstdio>
#include <cstring>
char grid[32][32];
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int dfs(int x, int y)
{
int ret = 1;
grid[x][y] = '#';
for(int i=0; i<4; ++i){
int nx = x + dx[i];
int ny = y + dy[i];
if(grid[nx][ny] == '.'){
ret += dfs(nx, ny);
}
}
return ret;
}
int main()
... |
b243612c4c06b3ccd9816ca195004460cef335e1 | 81a45e7efcb3ec2e3d82501f7829ac82a77f1a8a | jjzhang166/WinNT5_src_20201004 | /NT/inetcore/mshtml/src/site/display/grafrot.cxx | C++ | cxx | 76,599 | no_license | /****************************************************************************\
| File: GrafRot . CXX |
| |
| |
... |
624f03abcb17f7961042b430c160b0f655a2f379 | bcf3f9ee06f72652b69160f466d435235eb7557c | hellog2n/Image-Processing | /color_Bitmap_Image_making/color_Bitmap_Image_making/colorBitmapImageMaking.cpp | C++ | cpp | 2,200 | no_license | // color 비트맵 영상 생성 <트루컬러로>
//
#include <stdio.h>
#include <Windows.h>
#define BYTE unsigned char
#define WIDTHBYTES(bits) (((bits) + 31) / 32*4) // 4바이트 배수로 변환
int main()
{
int i, j;
int rwsize = WIDTHBYTES(24 * 256);
// "파일 정보헤드" 변수 선언
BITMAPFILEHEADER hf;
// "영상정보헤드" 변수 선언
BITMAPINFOHEADER hInfo;
// 256*256... |
2e327e339009fbeddac77425493bc69b68efa161 | 010d8c0be96c6efc630b6360a09fb077d9cf1540 | xu20081985/faceui | /app/YJJ-RWZSWS4/ui/cctrl/CCtrlProgress.cpp | C++ | cpp | 5,290 | no_license | #include "CCtrlProgress.h"
#define PROGRESS_EDGE 0
BOOL CDPProgress::DoInit(ContentManage *pCm)
{
char *pcontent;
if((pcontent = pCm->FindContentByName("width")) == NULL)
return FALSE;
m_width = strtol(pcontent, NULL, 10);
if((pcontent = pCm->FindContentByName("height")) == NULL)
re... |
7d22e76d7e130014f2d8e78887241620a86ac91f | 7e617391ecba671d0240a05a63e6be9f2da5d34a | Jeffab78/CSCI-463 | /Assign3/hex.cpp | C++ | cpp | 989 | no_license | /*
Assignment 3
Name: Jeff Byerly
Zid: z1860060
Date: 10/2/2020
*/
#include "hex.h"
#include <iomanip>
#include <sstream>
#include <string>
#include <stdint.h>
/*
Function: hex8()
Use: Turns the input param in 2 hex digits representing the least significant 8 bits
Params: Takes in an int
Returns: a 2 hex digit strin... |
b8aa97098a0d4a4e0845b4df5a205afda9e128ec | 11b0f7495858c8c23c17d78c8cd208347f9635be | gc535/LivenessDectectionForFaceSpoofingAttack | /src/integration.hpp | C++ | hpp | 1,412 | no_license | #ifndef INTEGRATION_HPP
#define INTEGRATION_HPP
#include <opencv2/opencv.hpp>
#include <lbp_hist.hpp>
#include <stdlib.h>
#include <string>
#define CPU 0
#define OpenCL 1
#define OpenCLF16 2
#define VPU 3
enum Action
{
train,
test
};
int dog_lbp_extraction(cv::Mat& img, cv::Mat& feature_vector, const int resize... |
66e3605a368c041a4210c90eb95fee764c501a70 | 59dc6f093d9829401fab00a0f5f642fbc814acc5 | saxenakrati09/AD | /src/dart/dynamics/Frame.hpp | C++ | hpp | 15,218 | no_license | /*
* Copyright (c) 2014-2016, Graphics Lab, Georgia Tech Research Corporation
* Copyright (c) 2014-2016, Humanoid Lab, Georgia Tech Research Corporation
* Copyright (c) 2016, Personal Robotics Lab, Carnegie Mellon University
* All rights reserved.
*
* This file is provided under the following "BSD-style" License:... |
c4e1ea81891f77926cf7930e10ecb70bfb298a79 | 26a38260378a421a2cd6d6b6d01218adb430948b | irvifa/online-judges | /tlx/IOI/2014/D-2/gondola/gondola.cpp | C++ | cpp | 267 | no_license | #include "gondola.h"
int valid(int n, int inputSeq[])
{
return -1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
|
324dfd72f64f5c05f960a35cf932f9eac85c97a1 | 84ec0c30c90da3c3d31ec7e968820743df940b86 | AugustoL/monero | /src/rpc/core_rpc_server.cpp | C++ | cpp | 55,695 | permissive | // Copyright (c) 2014-2016, The Monero Project
//
// 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. Redistributions of source code must retain the above copyright notice, this list of
/... |
acf09f839a50b77991df797f02959cfa8b98b4e9 | c7817b09fb23f9c90939c7b119954a7b913a00eb | scottallen333/virtual-shields-arduino | /src/Web.cpp | C++ | cpp | 6,366 | permissive | /*
Copyright(c) Microsoft Open Technologies, Inc. All rights reserved.
The MIT License(MIT)
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 witho... |
80209a9719be353706d7877f71ed14125baff642 | b66b61dcc96df07884eac4eccee946a48c6a63c8 | gongfuPanada/page | /src/local/vid/opengl/ext.hpp | C++ | hpp | 14,188 | no_license | /**
* @section license
*
* Copyright (c) 2006-2013 David Osborn
*
* Permission is granted to use and redistribute this software in source and
* binary form, with or without modification, subject to the following
* conditions:
*
* 1. Redistributions in source form must retain the above copyright notice,
* t... |
c5d8b6333d6c4d403c0606ed17e9d8cf11b29e59 | f15a67a53fe785a32ade357e6dcfcdc334828a35 | ejiaogl/RegainEarth-Cheat | /RegainEarthCheat/SDK/ModelingComponents_functions.cpp | C++ | cpp | 9,711 | no_license | // Name: RegainEart-FirtstStrike, Version: Version-1
#include "../pch.h"
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Functions
//------------------------------... |
576cf68f7ede3cb491e47b4dc391ad054238740c | d75bcfa316a7745abb3e84a0e07d8be60b8ed5e4 | Robin-Sb/Item-System | /Proj_Root/BKA_window.cpp | C++ | cpp | 5,218 | no_license | #include "BKA_Window.h"
#include <stdio.h>
#include "Inventory_Sampler.h "
BKA_Window::BKA_Window()
{
bka_window_buffer_height = 0;
bka_window_buffer_width = 0;
bka_window_height = 1024;
bka_window_width = 768;
x_position_change = 0.0f;
y_position_change = 0.0f;
mouse_first_movement = true;
for (size_t i = 0... |
7d20e05905e38a80ab51cf82457e6b86e9bd9045 | 107db6159d6bb8f551ea91d8f845174f0b72f6a5 | fredmorcos/attic | /Projects/Personal Expenses Tracker (C)/archive/pet_cpp_1/cmd.cc | C++ | cc | 479 | permissive | #include "cmd.h"
#include "help.h"
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int cmd_exec (const string& progname, const vector<string>& args) {
if (args[0] == string("version"))
help_print_version(progname);
else if (args[0] == string("help"))
help_print_help(progname)... |
66901ad3cbeecd9d77d498cca0386d899e77cdae | 422a8e84e5b61bd97f618e7212b11a73ad0ce103 | jianwel/quic-ns3-module | /model/net/dns/host_resolver_impl.cc | C++ | cc | 92,106 | 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 "net/dns/host_resolver_impl.h"
#if defined(OS_WIN)
#include <Winsock2.h>
#elif defined(OS_POSIX)
#include <netdb.h>
#endif
#if defined(OS_P... |
7d1ebb01f434b91583bbfb62f776e7c3dad67d2e | 2f0a617cd4d8373a9c90831fbcf2ef93b28f1312 | dolorem/zoldak | /src/ZkGame/Entities/LevelMeshEntity.cpp | C++ | cpp | 3,347 | no_license | #include <SFML/Graphics.hpp>
#include <Box2D/Box2D.h>
#include <algorithm>
#include <limits>
#include <map>
#include "../../ZkCommon/Constants.hpp"
#include "../../ZkCommon/LibraryCast.hpp"
#include "../../ZkCommon/Level.hpp"
#include "LevelMeshEntity.hpp"
#include "Entity.hpp"
#include "../Game.hpp"
#include "../Ga... |
026c82563cd1da17b08e83e0cd82ffebd7fd7923 | 774c842fcec13f3204d675b1d34abc9515222e16 | alinous-core/codablecash | /src_test/smartcontract_db/toolkit_alter/TestDbSchemaAlterTextUnique01.cpp | C++ | cpp | 3,435 | permissive | /*
* TestDbSchemaAlterTextUnique01.cpp
*
* Created on: 2020/10/02
* Author: iizuka
*/
#include "TestDbSchemaAlterTextUnique01.h"
#include "schema_table/table/CdbTable.h"
#include "base/StackRelease.h"
#include "base/UnicodeString.h"
#include "schema_table/record/table_record_value/AbstractCdbValue.h"
#i... |
fd5c13a1ea205b63def19198a50b61387a1e14a3 | 31ca7017a38f36aee84ad2b5354ce092b557c26d | sterlingF/MayanadMariam | /paren.hpp | C++ | hpp | 836 | no_license | #ifndef __PAREN_HPP__
#define __PAREN_HPP__
#include <iostream>
#include "dec.hpp"
#include "base.hpp"
#include "op.hpp"
#include "iterator"
#include "unary_iterator.cpp"
class Paren : public Dec {
private:
std::string hold;
double val;
Base* one;
public:
/*Constructor*/
template<... |
b9f9e4aecdd7ae5c443199481b285624f4ccbd2a | cc5459c7fd2053049a5f354fac7f3d0e3bc07d04 | Phosphorus15/mozjs-rs-lite | /cpp/src/jsapi.cpp | C++ | cpp | 57,748 | no_license | // Auto-generated file for jsapi.h by mozjs-rs generator
// Modify if necessary
#define JS_HAS_CTYPES
#include <jsapi.h>
using namespace JS;
extern "C" {
// bool JS_CallOnce(JSCallOnceType* once, JSInitCallback func);
bool js_call_once(void* once, JSInitCallback func) {
return (bool) JS_CallOnce((JSCallOnceType *... |
fdf20a872a0d2851acccbd34c66c922f2add5250 | 0e29bef535046c4147bbbaa992ba6bd5fc53881a | MetricManifold/ASP-Project | /Project1/libclasp/src/heuristics.cpp | C++ | cpp | 18,145 | no_license | //
// Copyright (c) 2006-2010, Benjamin Kaufmann
//
// This file is part of Clasp. See http://www.cs.uni-potsdam.de/clasp/
//
// Clasp 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 ... |
9034048b6294874e124e9ec98c9d3f607d6c8df3 | 7de7a5552339108d37d81e650e813c0610dcc82d | konradburnik/Algorithms | /Data Structures/coursera/PA1/tree_height/tree-height.cpp | C++ | cpp | 1,408 | no_license | #include <iostream>
#include <vector>
#include <algorithm>
class TreeHeight {
int n;
std::vector<int> parent;
std::vector<int> height;
public:
void read() {
std::cin >> n;
parent.resize(n);
height.resize(n);
for (int i = 0; i < n; i++) {
std::cin >> parent[i];... |
f0a9212636cf48f1b061fb93b88c6eab50069af1 | c22819760adf4e30d1120fe6a1dd1779fc4ae328 | marcclintdion/overworld | /_MODEL_FOLDERS_/o8_A/o8_A_END.cpp | C++ | cpp | 705 | no_license | if(o8_A_EMIT != 0)
{
glDeleteTextures(1, &o8_A_EMIT);
o8_A_EMIT = 0;
}
if(o8_A_DOT3 != 0)
{
glDeleteTextures(1, &o8_A_DOT3);
o8_A_DOT3 = 0;
}
if(o8_A_SKY != 0)
{
glDeleteTextures(1, &o8_A_SKY);
o8_A_SKY = 0;
}
if(o8... |
6ebe26a2d9a87241c1f3a7f9616cf73b95a75428 | b1d7a9c93a4c28c3de10079ddb17d6f25acba741 | danielkrupinski/BansheeEngine | /Source/SBansheeEngine/Serialization/BsManagedSerializableArray.cpp | C++ | cpp | 8,096 | no_license | //********************************** Banshee Engine (www.banshee3d.com) **************************************************//
//**************** Copyright (c) 2016 Marko Pintera (marko.pintera@gmail.com). All rights reserved. **********************//
#include "Serialization/BsManagedSerializableArray.h"
#include "RTTI/B... |
148c95a3dd0bb459e8a6ca52fe2a6f6a00450aca | 661a31249a8c1d04bf58eb358af23be434296ebc | mariokostelac/pytorch | /torch/csrc/utils/python_arg_parser.cpp | C++ | cpp | 28,848 | permissive | #include <torch/csrc/utils/python_arg_parser.h>
#include <torch/csrc/Exceptions.h>
#include <torch/csrc/Layout.h>
#include <torch/csrc/MemoryFormat.h>
#include <torch/csrc/utils/invalid_arguments.h>
#include <torch/csrc/utils/python_strings.h>
#include <ATen/ATen.h>
#include <sstream>
#include <stdexcept>
#include <... |
e466b9313aadab8708d3c4ead1910be13df6ec08 | 879ed12eb7a1a11a27017d75777fe49952d4aa10 | chrishoen/Dev_CCLib | /LFConcurrent/someStatusThread.cpp | C++ | cpp | 5,878 | permissive | /*==============================================================================
==============================================================================*/
//******************************************************************************
//**************************************************************************... |
65d0eaf50bc03d1a8e11498aa0a61364a6ad56fb | e790788dab0497b2f44d527cbc8a28798c4e915d | mobuhiko/C-PrimerPlus | /Chapter007/007-009/007-009.cpp | C++ | cpp | 2,721 | no_license | #include <iostream>
#include <ctype.h>
using namespace std;
const int SLEN = 30;
struct student
{
char fullname[SLEN];
char hobby[SLEN];
int ooplevel;
};
// getinfo() has two arguments: a pointer to the first element of
// an array of student structures and an int representing the
// number of elements of ... |
31c3c7400903e06eed99fff2accf16f083ef359c | bcd33e487f3a9a57ce5af8511b5ba7f4eaffac3d | webosce/chromium53 | /src/media/formats/webm/webm_tracks_parser.cc | C++ | cc | 11,481 | permissive | // Copyright 2014 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 "media/formats/webm/webm_tracks_parser.h"
#include "base/logging.h"
#include "base/strings/string_number_conversions.h"
#include "base/strings/s... |
eea5fe5d34eaa05c5f9be1c046e80c3f721286ab | 81d5998170bc2b32d026d57403257e114b591bdf | KolotVadym/Programing-Essentials-in-C- | /Chapter 7/Lab 7.2/Lab 7.2.1 Exceptions input validation/Исходный код.cpp | C++ | cpp | 1,020 | no_license | #include <iostream>
#include <stdexcept>
#include <stdlib.h>
using namespace std;
const int DivideByZero = 111;
float internaldiv(float arg1, float arg2){
if (arg2 == 0)
throw DivideByZero;
return arg1 / arg2;
}
float div(float arg1, float arg2){
if (arg2 == 0.0)
throw invalid_argument("Are you... |
46172eba63215a4cb769fc357c684fa1327490c2 | e971842fd24a5ef8465c06078749bafbcf360ebc | CromJo/WarAir | /st/enemymissile.cpp | C++ | cpp | 667 | no_license | #include "enemymissile.h"
CEnemyMissile::CEnemyMissile()
{
}
CEnemyMissile::~CEnemyMissile()
{
}
void CEnemyMissile::Initialize(CSprite *pSprite, int x, int y, CTimer *timer, int CurrentFrame, int FrameInterval, int MoveInterval)
{
CGObject::Initialize(pSprite, x, y, timer, CurrentFrame, FrameInterval);
m_nLastMov... |
f513d47cedd025ae9619fe91f5e371412398d8ed | 321469db913d5a9bbab755720da8bb02c710bba8 | Tomraydev-WFiIS/PREOOP | /week14_improved/atest.cpp | C++ | cpp | 1,379 | no_license | /*
* Celem zadania jest napisanie klasy tablicy dwuwymiarowej.
* Obiekty tej klasy moga wystepowac w dwoch wariantach.
* - albo nie zarzadzaja pamiecia gdy sa stworzone za pomoca funkcji "adopt"
* - albo zarzadzaja pamiecia gdy sa skonstruowane w "zwyczajny" sposob.
* UWAGA: przy przypisaniu, i w konstruktorze kop... |
46b6aa897f382891d4e4e4f2c69508ecc27609ff | 6b23a34eb96d4a8d85e248bffa06948b00bdffc7 | Azure/azure-kusto-orc-conv | /src/c++/test/MemoryOutputStream.hh | C++ | hh | 1,777 | permissive | /**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you... |
f42337c5e7ca064cd00459302c8f340f666c5c1f | 8a39dbb4284672245f260e354636a3ea9e884694 | Vancasola/DataStructure | /DataStructure/A1148.cpp | C++ | cpp | 1,055 | no_license | //
// A1148.cpp
// DataStructure
//
// Created by vancasola on 2020/1/16.
// Copyright © 2020 none. All rights reserved.
// 2:41
/*
#include <stdio.h>
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int n;
vector<int > liar;
int a[105],c[105],x=999,y=999;
cin... |
37be1d8fc4d88b3e70c8a6d6ef685ae612ebfb4d | 511c62385377802a219e39c94b6f665448257444 | phenomax/Computational_Physics_2021 | /sheet04/code/exercise2.cpp | C++ | cpp | 1,600 | no_license | #include <iostream>
#include <math.h>
#include <fstream>
//potential with first charge distribution
double phi_1(int n, double x_p, double y_p, double z_p)
{
return 1 / sqrt(pow(0.1*n - x_p, 2) + y_p*y_p + z_p*z_p + 1e-6);
}
//potential with second charge distribution
double phi_2(int n, double x_p, double y_p, ... |
b103606dca1dbce89d63f88e8f4fe66d12380148 | bbfcc7804130377bfa025d0e71af95711d026660 | a-ahmed/SCUM_SDK | /SDK/SCUM_Cheese_classes.hpp | C++ | hpp | 579 | no_license | #pragma once
// SCUM (Dumped by Hinnie) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// BlueprintGeneratedClass Cheese.Cheese_C... |
dc27d25f1d53ab4c27bfc08aae4b476ab594bc0e | 583003efc338c7045ffe7c94348e9df542b57d71 | NetBSD/pkgsrc | /lang/nodejs16/patches/patch-deps_v8_src_heap_code-range.cc | C++ | cc | 716 | no_license | $NetBSD: patch-deps_v8_src_heap_code-range.cc,v 1.1 2022/05/05 07:02:25 adam Exp $
nodejs: disable "near code ranges" on NetBSD/evbarm-aarch64 for now.
It results in mmap(2) errors of the PR kern/55533 variety.
--- deps/v8/src/heap/code-range.cc.orig 2022-03-17 21:59:26.000000000 +0000
+++ deps/v8/src/heap/code-range... |
830c42a2a537d96f3c3865d1b27f23b643a3f1fd | a628366042f62ed1e70488dd15a32c1deac01528 | electro-smith/DaisySP | /tests/fir/tst_fir.cpp | C++ | cpp | 9,130 | permissive | #include "daisysp.h"
#include "test_util.h"
#if defined(_WIN32)
#else
#include "util/scopedirqblocker.h"
#endif
/** @brief FIR Filter unit tests / benchmarks
* @author Alexander Petrov-Savchenko (axp@soft-amp.com)
* @date February 2021
*/
using namespace daisysp;
using namespace daisy;
/** Test platfor... |
2d67434df5808f48513c3d5be68343cf6e4b0f43 | 32bbe2ed2410a17f21a0953943b7ff57f0101f11 | Reavercrim/CTD-Server | /source/include/server.hpp | C++ | hpp | 911 | permissive | #ifndef SERVER_HPP
#define SERVER_HPP
#include <SFML/Network.hpp>
#include "netUtility.hpp"
class Server
{
private:
int m_maxClients;
int m_numConnectedClients;
std::vector<bool> m_clientConnected;
std::vector<IpPort> m_clientIpPort;
sf::UdpSocket m_socket;
std::vector<sf::Vector2f> m_rectVec... |
881ff6062b7f5a359b01e4458327cf2e05d7efb8 | 80668507d3084e34268623fa2bfa92bcce71bc8e | fx-lange/ofxTangibleUI | /src/ofxTangibleButton.cpp | C++ | cpp | 1,139 | no_license | #include "ofxTangibleButton.h"
void ofxTangibleButton::mousePressed(ofMouseEventArgs &e) {
if (!bClickable || !isOver(e.x, e.y))
return;
bDrawAsPressed = true;
bPressed = true;
}
void ofxTangibleButton::mouseReleased(ofMouseEventArgs &e) {
if (!bClickable || !bPressed)
return;
bPressed = false;
bDrawAsPr... |
2f45ec2a88021d2fffd7bdab4554847c0811756f | 604fcd1537c959d267dc82c6be22a4c4706bef45 | thepalashborah01/Apna-College-DSA | /Programs/Recursion/n-raised-to-p.cpp | C++ | cpp | 226 | no_license | #include<bits/stdc++.h>
using namespace std;
int raiseto(int n, int p)
{
if(p==0)
return 1;
return n * raiseto(n, p-1);
}
int main()
{
int n, p;
cin>>n>>p;
cout<<raiseto(n, p);
return 0;
} |
c671af4f9f81b8f99b9617422e0a459ac3ff50d9 | 46c6b3007b1fcd8c8cd5953f7090f859bf82c379 | sir-rasel/Online_Judge_Problem_Solve | /toph/GameTheory/painting-tiles.cpp | C++ | cpp | 316 | no_license | #include<bits/stdc++.h>
using namespace std;
int main(){
int test,cs=1;
scanf("%d",&test);
while(test--){
long long int n;
scanf("%lld",&n);
if(n%7<2) printf("Case %d: Oh no, my eggs! :(\n",cs++);
else printf("Case %d: No eggs for you! :D\n",cs++);
}
return 0;
}
|
7b2f32ea7f362edf22a6acae36cb031d3f4229aa | 94195b663b469b44e26d5fafc138b18d4acab0ad | Griizz/Fortnite-Hack | /SDK/FN_GET_Stun_classes.hpp | C++ | hpp | 580 | no_license | #pragma once
// Fortnite SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// BlueprintGeneratedClass GET_Stun.GET_Stun_C
// 0x0000 ... |
11273be88108f691851bb6fc86d382f5323702a4 | d75ea637ec5aa144552d4f398bce25a34f354a84 | satabios/megamap | /projects/impl (copy)_bp/TOFApp.cpp | C++ | cpp | 4,293 | no_license | /*!
* ============================================================================
*
* @addtogroup TOFApp
* @{
*
* @file TOFApp.cpp
* @version 1.0
* @date 12/14/2015
*
* @note Generalized TOF Application class
*
* Copyright(c) 2007-2012 Texas Instruments Corporation, All Rights Reserved.
* TI makes ... |
8ff35484875ec4734fa416ca7c245fa72895663c | 4c882a73df29f5695769ea82c880c6f48397455b | iridium-browser/iridium-browser | /third_party/blink/renderer/core/html/forms/internal_popup_menu.cc | C++ | cc | 27,813 | permissive | // Copyright 2014 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "third_party/blink/renderer/core/html/forms/internal_popup_menu.h"
#include "build/build_config.h"
#include "third_party/blink/public/common/input/web_mouse_event.h"
... |
1c7b33c9d15722d276ff04414d996d576f546ca7 | 1c7eb008df17e525e53d5bcd15f1bed3f8a66066 | YinJingcao/lc | /96_Unique_Binary_Search_Trees.cpp | C++ | cpp | 693 | no_license | /**
* @file 96_Unique_Binary_Search_Trees.cpp
* @author yinjingcao
* @date 2018/05/07 17:21:04
* @version $Revision$
* @brief
*
**/
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int numTrees(int n) {
vector<int> a(n + 1, 0);
a[0] = 1;
a[1]... |
cd96f7ea01926a9009f0eca884a2a54bb6eb4cfb | 4840e8da8f51b7e97e7bd2e2dafa0fc4e87fac0e | lostrevi/MOOM | /src/Shot.cpp | C++ | cpp | 1,734 | no_license | #include "Shot.h"
void Shot::init(SDL_Texture *_Shot_Texture, pos _LOC, double _angel, double _speed, int _side)
{
Shot_texture = _Shot_Texture;
LOC = _LOC;
Angel = _angel;
speed = _speed;
side = _side;
LOC_RECT.x = LOC.x;
LOC_RECT.y = LOC.y;
LOC_RECT.w = 9;
LOC_RECT.h = 10;
... |
3374c6d8c0d6afaa7614883b8b462e28d9da47ab | dd155a4e9cac6933365abe68c2b0f7a9b0040f3a | AleksanderKirintsev/study | /Olymp/vsesib/selection/2020/A/simple.cpp | C++ | cpp | 528 | no_license | #include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
int n,r,*data;
ll k,t;
int main() {
// freopen("tests/01","r",stdin);
cin >> n >> k >> t;
data = new int[n];
for(int i = 0; i < n; i++) {
int x,y;
char c;
cin >> x >> c >> y;
data[i] = x*y... |
8a635c7bbd1978c7696bf4ba5e997ac377b7adee | ac4a59973dd6eda67672f1c25d99a5e6a55d6eb8 | sejoonkim/algorithms | /.study/c_datastructure/2_3_fibonacci.cpp | C++ | cpp | 494 | no_license | #include <iostream>
using namespace std;
int fibo(int n) {
if (n == 0) return 0;
if (n == 1) return 1;
return fibo(n-1) + fibo(n-2);
}
int fib_iter(int n) {
if (n == 0) return 0;
if (n == 1) return 1;
int pp = 0;
int p = 1;
int result;
for (int i = 2; i <= n; i++) {
resul... |
31aab222389652437812d67d75e9aa588cedc958 | bed8e23d617f13aad8e3e3074235350920f7853e | timxx/VC6-Platform-SDK | /VC6PLATSDK/samples/multimedia/gdi/Fonts/GridFont/Canvas.Hxx | C++ | hxx | 3,953 | no_license | #ifndef __CANVAS_HXX_
#define __CANVAS_HXX_
//--------------------------------------------------------------------
// File: Canvas.hxx
//
// Classes:
// CPoint - POINT with vector operations
// CCanvas - Base class for Device contexts
// CScreenCanvas - Device context for client area or displa... |
86b30ba2087fa5d9fa08dba2e95be4816680172e | 8376043049d6fc13820ed310b0b39afdcfdc1dff | JoakQQ/ENGG1340-Group-Project-Group-18 | /function.cpp | C++ | cpp | 2,787 | no_license | #include "function.h"
int Customer_time(Customer S, string Goods[], int time[], int num_Of_Goods){
int t = 0;
for (int j = 0; j < num_Of_Goods; j++){
if (S.find_Goods(Goods[j])){
t += S.find_num_Goods(Goods[j]) * time[j];
}
}
return t;
}
int calculateRegisters(Customer S[], int num, string Goods[], int tim... |
7f315fc9bb97cc81122c385114a90061fc57067f | 57d5c30ef75bc80a5f13305b1f9f1238bf6e7cfb | cekongsb/particl-core | /src/test/mempool_tests.cpp | C++ | cpp | 30,748 | permissive | // Copyright (c) 2011-2019 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 <policy/policy.h>
#include <txmempool.h>
#include <util/system.h>
#include <test/setup_common.h>
#include <boost/t... |
609ac4e9c733f1d9a638db3f7ee65a79f0406a90 | cb76866791520b67f02c7d0e7eb684a848f575c1 | stellasy0213/DNN_upmix_arma_LSP_fixed-point | /src/utilcp.cpp | C++ | cpp | 1,808 | no_license | /*
ITU-T G.729 Annex I - Reference C code for fixed point
implementation of G.729 Annex I
Version 1.1 of October 1999
*/
/*
File : utilcp.c
*/
/* from util.c G729 Annex B Version 1.3 Last modified: August 1997 */
/* from util.c G729 Version 3.3 */
/*----------... |
9a8b95dd5f9b6521bdda9c65e4288e53f6af561c | 48d0257d3e773245c2f8a0d43bdd55c0a0e3e7b8 | mxndev/cheetahwutiOSController | /cheetahwutiOSController/boost.framework/Headers/mpl/aux_/is_msvc_eti_arg.hpp | C++ | hpp | 1,432 | no_license |
#ifndef BOOST_MPL_AUX_IS_MSVC_ETI_ARG_HPP_INCLUDED
#define BOOST_MPL_AUX_IS_MSVC_ETI_ARG_HPP_INCLUDED
// Copyright Aleksey Gurtovoy 2001-2004
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// See http:... |
4951cf6abd47a798f88b9e7eec7ea15da5fadb6a | 2bc3d6301d1119e0542f99fdfa7509ddf23eaf13 | Minato1803/Code_Competition | /CODEFORCES/choosingTeam.cpp | C++ | cpp | 1,163 | no_license | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define fix_set(x) fixed<<setprecision(x)
#define buff ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define Input freopen("E:/code/testing/input.txt", "r", stdin)
#define Output fr... |
92887cc30f681b3b1ac63f4b573fc7ed69c006be | 75330d33cba9516d7e4a86b7340ffb2f3a5ed683 | q5sys/qtv | /qtv.cpp | C++ | cpp | 2,154 | permissive | #include "qtv.h"
#include "ui_qtv.h"
#include <QDir>
#include <QDebug>
#include <QPixmap>
qtv::qtv(QWidget *parent) : QMainWindow(parent), ui(new Ui::qtv){
ui->setupUi(this);
ui->splitter_V->setStretchFactor(0, 1);
ui->splitter_V->setStretchFactor(1, 2);
// ~~ Dir Window ~~ //
dirModel = new QFileSystemMode... |
f6d61d1fdab79afc8282a0e622a9b26c0aa80d9c | c3fafb59fbcf9181007d0671e4605c5f7d8b8886 | tarunluthra123/Competitive-Programming | /Algo++/Loops - Patterns/PATTERN NUMBERS & STARS - 1.cpp | C++ | cpp | 773 | no_license | //https://hack.codingblocks.com/contests/c/537/625
/*
Take as input N, a number. Print the pattern as given in output section for corresponding input.
Input Format:
Enter value of N
Output Format:
All numbers and stars are Space separated
Sample Input:
5
Sample Output:
1 2 3 4 5
1 2 3 4 *
1 2 3 * * *
1 2 * * * * *... |
2c6e78638fc8794ea117097dfd738a9ef6fd8b4a | 49255539bf77c256bfebcd4ee337cfa83c3dd18b | asilha/spicy | /spicy/toolchain/src/ast/types/unit-items/switch.cc | C++ | cc | 809 | permissive | // Copyright (c) 2020 by the Zeek Project. See LICENSE for details.
#include <hilti/ast/builder/all.h>
#include <spicy/ast/detail/visitor.h>
#include <spicy/ast/types/unit-items/switch.h>
using namespace spicy;
using namespace spicy::detail;
bool spicy::type::unit::item::Switch::hasNoFields() const {
for ( cons... |
4adc22ca4ffa61f56b4846af9c357eb3624ae3e7 | 5f32f392f29dabacb9c5114b5f181fba6af803de | BaronStack/kvdk | /engine/kv_engine.cpp | C++ | cpp | 62,775 | permissive | /* SPDX-License-Identifier: BSD-3-Clause
* Copyright(c) 2021 Intel Corporation
*/
#include "kv_engine.hpp"
#include <algorithm>
#include <atomic>
#include <cstdint>
#include <dirent.h>
#include <future>
#include <libpmem.h>
#include <limits>
#include <math.h>
#include <mutex>
#include <sys/mman.h>
#include <thread>... |
1f538e3895cc8cc36ce03a5712501441d26a208b | 28724a025760192f2b053e33a6a9c6c6821606d4 | Csineneo/Vivaldi | /chromium/ash/components/shortcut_viewer/last_window_closed_observer.cc | C++ | cc | 901 | permissive | // Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/components/shortcut_viewer/last_window_closed_observer.h"
#include "ui/aura/env.h"
#include "ui/aura/window.h"
namespace keyboard_shortcut... |
2ed38b60b90619c81ed8a288bcd3f9dd04d7cbae | c565600cb1fb3e70bce79f4f2924c7bdf1333386 | sutcalag/milvus | /internal/core/src/segcore/segcore_init_c.cpp | C++ | cpp | 1,970 | permissive | // Copyright (C) 2019-2020 Zilliz. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable l... |
081e8444efa28fd8b2d0b27c61b38e530478ad1c | 81537d330c4e025c40c03057d8cbc5226a3c0ac7 | DatHarKum/Codeforces | /999_C_alphabetic_removals.cpp | C++ | cpp | 794 | no_license | #include<bits/stdc++.h>
using namespace std;
struct comparator{
inline bool operator ()(pair<char,int> &a, pair<char,int> &b)
{
if(a.first != b.first)return a.first < b.first;
return a.second < b.second;
}
};
struct comparator1{
inline bool operator ()(pair<char,int> &a, pair<char,int> &... |
0ea664f72a5c04ca85a9210751c11b11e6ae5f6d | c18a48feeffcdf7e0a01b9f1adc2523bb5360a6f | yinyangsx/llvm | /llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp | C++ | cpp | 147,579 | permissive | //===- InstCombineAndOrXor.cpp --------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.