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 |
|---|---|---|---|---|---|---|---|---|
eb214158fab23fb546e93eebf5f3a70abddeb85b | 2514c71f5f04f7b92aff817f08eb8f117ab7ca2d | dand-oss/QtXlsxWriter | /src/xlsx/xlsxworksheet.cpp | C++ | cpp | 94,917 | permissive | /****************************************************************************
** Copyright (c) 2013-2014 Debao Zhang <hello@debao.me>
** All right reserved.
**
** Permission is hereby granted, free of charge, to any person obtaining
** a copy of this software and associated documentation files (the
** "Software"), to d... |
5473ee77057c190eda2b2e394e3af7ab2ab3c5b8 | 13a4b50cc18fe46823ceacc8407738581f7e569b | egomes/hhvm | /hphp/runtime/vm/as-shared.cpp | C++ | cpp | 2,992 | permissive | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-2013 Facebook, Inc. (http://www.facebook.com) |
+---------... |
37ab408cb019da05921b42db11f5fc4247ab7df7 | 34696b7dcc954272e8a473fafbefc60afdd9ee3c | CXUtk/DirectY | /src/render/Camera.cpp | C++ | cpp | 437 | no_license | #include "Camera.h"
Camera::Camera(glm::vec3 eyePos, glm::vec3 lookat, glm::vec3 up, float fov, float aspect, float zNear, float zFar)
:eyePos(eyePos), lookAt(lookat), up(up), fov(fov), aspect(aspect), zNear(zNear), zFar(zFar) {
}
glm::mat4 Camera::getViewTransform() const {
return glm::lookAt(eyePos, lookAt... |
0a11cc0e87a57419288b2eb1f4cde1e380f33c12 | 6fde1018778316d450b6abdd650923ba12f9b194 | gabialverga/competitiveProgramming | /URI/1022.cpp | C++ | cpp | 885 | no_license | #include <iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
int mdc(int a,int b){
if(b==0) return a;
if(a==0) return b;
mdc(b,a%b);
}
int mmc(int a,int b){
return (a*b)/mdc(a,b);
}
int main(){
int n;
cin>>n;
int n1,d1,n2,d2,div;
char d,c;
for(int i=0;i<n;i++){
cin>>n1>>d>>d1>>c>>n2>>... |
e8772eee0e6aae78d8472e66643e571d95b41468 | 16c9d96a87c8ee71399fef67fb960fdcfdcecf8d | tguidon/swift | /lib/AST/ModuleNameLookup.cpp | C++ | cpp | 10,422 | permissive | //===--- ModuleNameLookup.cpp - Name lookup within a module ---------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/L... |
028e6195f78a568a2fb6c4a9f2912f666a6afe08 | 421027fbc040ca5d72faba6d74d77e0b002dcc22 | niuxu18/logTracker-old | /second/download/collectd/gumtree/collectd_repos_function_903_collectd-5.6.3.cpp | C++ | cpp | 557 | no_license | static int setup_all_buffers(void) {
int ret;
DO_OR_GOTO_ERR(topology_probe());
DO_OR_GOTO_ERR(allocate_counters(&thread_even, &core_even, &package_even));
DO_OR_GOTO_ERR(allocate_counters(&thread_odd, &core_odd, &package_odd));
DO_OR_GOTO_ERR(allocate_counters(&thread_delta, &core_delta, &package_delta));
... |
256209f1bc8e8ca4153f93f505c422ba35b0db71 | 41fd2281cd6a6b6ee346ebbf94a0c50afb9b1b96 | one-diary/Solved-Programming-Questions | /Codechef/Beginner/AREAPERI.cpp | C++ | cpp | 376 | no_license | #include <iostream>
using namespace std;
int main() {
float area,peri,len,bre;
cin>>len;
cin>>bre;
area=len*bre;
peri=(2*(len+bre));
if(area>peri)
{
cout<<"Area"<<endl;
cout<<area;
}
else if(peri>area)
{
cout<<"Peri"<<endl;
cout<<peri;
}
else if(area==peri)
{
... |
38f40fc499157f68dac00926518b6797cb5cd0f7 | 105cdcae256928d4eb9f0439fef45a5d231727ce | piotrekk94/czolgi | /test/src/lamp.cpp | C++ | cpp | 791 | no_license | #include "lamp.hpp"
Lamp::Lamp(ShaderProgram *shader, glm::vec4 position)
:light(position)
{
unsigned mesh = 0;
parts.push_back(Model("./models/untitled.dae", shader, &mesh));
mesh = 1;
parts.push_back(Model("./models/untitled.dae", shader, &mesh));
mesh = 2;
parts.push_back(Model("./models/untitled.dae", shad... |
c3ca4e5ff9bfdc44a44ec35327319746cdc4015b | d367c16595546ba28d95d6e2feb89cbf65104618 | 43ndr1k/Filter | /VS-Projekt/Filter_alt/Filter/GeneratedFiles/Debug/moc_filter.cpp | C++ | cpp | 3,227 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'filter.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.5.0)
**
** WARNING! All changes made in this file will be lost!
**************************************************************... |
8bd6d9c7ab65ef486bcf0d3c7db8f211b25c5d7e | 0f7d025e691b697a60a333361c8537ca02c0ff90 | hrcore/hrgold | /src/governance-validators.cpp | C++ | cpp | 8,498 | permissive | // Copyright (c) 2014-2017 The HrGold Core developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "governance-validators.h"
#include "base58.h"
#include "timedata.h"
#include "tinyformat.h"
#include "utilstrenc... |
744d2f4b3975b146c7ae6e559476d593a89d65b9 | 0738aaea55408f520ab2d8a201656b5e13353fca | Gerardouz/programas-c- | /tablas_numeros.cpp | C++ | cpp | 282 | no_license | #include<iostream>
using namespace std;
int main(){
int numero,resultado;
cout<<"introduzca numero"<<endl;
cin>>numero;
cout<<"tabla del "<<numero<<endl;
for (int i=1;i<11;i++)
{
resultado=numero*i;
cout<<numero<<"x"<<i<<"="<<resultado<<endl;
}
system("pause");
}
|
49ba2a1d062d0d18e07f5211480af48247aefdfd | 939e00e365089be0934162fdbc2a45cd6c8df3db | ddexter/usaco | /dualpal/dualpal.cpp | C++ | cpp | 1,296 | no_license | /*
ID: dcdexte1
LANG: C++
PROG: dualpal
*/
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
void decToBase(int n, int base, char* buffer)
{
int i;
for(i = 0; n > 0; ++i) {
int r = n % base;
char c = '0' + r;
buffer[i] = c;
n /= ... |
297ee15e3fdbf064a1b26e70851ff0af1d5ab4bb | bfac9e487f423da4ca6bc1d91f9f05725d77f2b9 | neeyanthkvk/USACO | /train.usaco.org/6.5/clocks.cpp | C++ | cpp | 3,046 | no_license | /*
PROG: clocks
LANG: C++
*/
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define A 0
#define B 1
#define C 2
#define D 3
#define E 4
#define F 5
#define G 6
#define H 7
#define I 8
int clocks[9];
int tmp[9];
vector<int> current;
vector<int> best;
bool needed_answer() {
for (int i... |
1a9967003fb145f4021f256c01110883ac29939d | 8d58e083f35f624f581ac5b7f760e04d641a0c82 | HaikuArchives/TrackGit | /tests/CreateSwitchBranchTest/CreateSwitchBranchTest.cpp | C++ | cpp | 1,762 | no_license | /**
* @file CreateSwitchBranchTest.cpp
* @brief Implementaion file of Create and Switch Branch Test.
*
* @author Hrishikesh Hiraskar <hrishihiraskar@gmail.com>
*/
#include "CreateSwitchBranchTest.h"
#include <stdio.h>
#include <stdlib.h>
#include <sys/stat.h>
#include <SupportKit.h>
#include "../../GitCommand... |
0a4a012ea33640440600092ba841ca4462b32c18 | 0ffbf7a8dd3058d73c9d941b680da8ec7006c1dc | google/swiftshader | /src/Device/PixelProcessor.cpp | C++ | cpp | 7,868 | permissive | // Copyright 2016 The SwiftShader Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required b... |
16d6d0b4f55b529849977aba4bd61cc8c5c22ccc | 267777c92766e35d9feabb0ef4242e26b77fc9e3 | FengYen-Chang/dldt | /inference-engine/tests/unit/engines/gna/matchers/nnet_base_matcher.hpp | C++ | hpp | 5,031 | permissive | /*
* INTEL CONFIDENTIAL
* Copyright (C) 2018-2019 Intel Corporation.
*
* The source code contained or described herein and all documents
* related to the source code ("Material") are owned by Intel Corporation
* or its suppliers or licensors. Title to the Material remains with
* Intel Corporation or its supplier... |
cccb238f5401405febc8ded3f83cfedc8a34f62b | 04216ca0bc8b70feef678dab009d1d35cdcab2c1 | s-nepal/PID_Controller | /src/main.cpp | C++ | cpp | 4,748 | no_license | #include <uWS/uWS.h>
#include <iostream>
#include "json.hpp"
#include "PID.h"
#include <math.h>
#include <list>
#include <numeric>
// for convenience
using json = nlohmann::json;
// For converting back and forth between radians and degrees.
constexpr double pi() { return M_PI; }
double deg2rad(double x) { return x * ... |
272f9ecf4b8efe79e0bd71986d85be5fb55fc373 | deb2209e94307b1d467fc1d81520422c33dee32f | ItsMeMisha/Tasks-3sem | /SortingsAnalysis/source/Drawable/Plot.hpp | C++ | hpp | 1,047 | no_license | #ifndef __MY_GUI_PLOT_HPP
#define __MY_GUI_PLOT_HPP
namespace MyGUI {
#define __SFML_BUILD__
#ifdef __SFML_BUILD__
using Vector2f = sf::Vector2f;
using Vertex = sf::Vertex;
using Drawable = sf::Drawable;
using Color = sf::Color;
#endif
const float Pi = 3.141592653589793238463;
... |
9a140aa568b4f75ea3e0f43c48187b8cb4badbf9 | ed3070887b8bd7a64499950c4fe110741fb2aaf7 | FrankenRom/android_frameworks_base | /libs/hwui/renderthread/EglManager.cpp | C++ | cpp | 13,643 | permissive | /*
* Copyright (C) 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by app... |
6f57e98aee4e8cc00c465e64edd7e90f0022109f | 93f1d4122ab07db0fb46ca8ed84f2f4dbb86bb45 | chromium/chromium | /ui/accessibility/platform/child_iterator_base.cc | C++ | cc | 2,022 | permissive | // Copyright 2022 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/accessibility/platform/child_iterator_base.h"
#include "ui/accessibility/platform/ax_platform_node.h"
namespace ui {
ChildIteratorBase::ChildIteratorBase(const ... |
2a9436cef677e5d98f13ad393ea20ee041f7ba32 | b93083c910deb030b3e2180a890493ce8a428441 | JHUISI/auto-tools | /CharmCPP/AGPlusBench/benchACDKNOAsymSig.cpp | C++ | cpp | 4,684 | no_license | #include "TestACDKNO_sig_test.h"
#include <fstream>
#include <time.h>
void benchmarkACDK(Acdk12 & acdk, ofstream & outfile0, ofstream & outfile1, ofstream & outfile2, ofstream & outfile3, int ID_string_len, int iterationCount, CharmListStr & setupResults, CharmListStr & keygenResults, CharmListStr & signResults, Charm... |
d768a3e9b434c035dc301fdfb3e51b4ad77d504e | b013cfdad6611000744d8f371d1f7e8545a42fbd | Hudrolax/Delphi-projects | /Delphi Projects/keterm/sourses/keterm/keterm.cpp | C++ | cpp | 1,989 | no_license | // KeTerm.cpp : Defines the class behaviors for the application.
//
#include "stdafx.h"
#include "KeTerm.h"
#include "KeTermDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// CKeTermAp... |
1415be2930c07247a64f4d5621c5630f4552f463 | c975525014618cd827090591707629f56350dd56 | lbenc135/Cpp_codes | /KRIZALJKA/main.cpp | C++ | cpp | 625 | no_license | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<string> input(6);
int found;
for(int i=0;i<6;i++)
cin >> input[i];
do {
string stupci[3];
for(int i=0;i<3;i++)
for(int j=0;j<3;j++)
stupci[j] += input... |
42e230db5ff0af3068fa0e3dc834baa12b0c3a93 | 14d5708e1c853096e3b38e68375706947e79d5e5 | KRHero03/CompetitiveCoding | /CodeChef/LECANDY.cpp | C++ | cpp | 984 | no_license | /*
author: KRHero
IDE: DevCPP
*/
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define MOD 1000000007
#define f(i,a,b) for(int i=a;i<b;i++)
#define fe(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=b;i>a;i--)
#define fde(i,a,b) for(int i=b;i>=a;i--)
#... |
081bb44cbd1d2ad9d0a0cef3e152bb36c867724a | 95bce506e7f4e573e5e923ed8c5ac174bcf40b30 | aaron-lucas315/CS-224-Final-Project | /Player.cpp | C++ | cpp | 3,472 | no_license | #include "Player.hpp"
Player::Player(const char *texturesheet, int x, int y)
{
//srcR.h = 128; //this is setting up the dimensions of the sprite on the screen
//srcR.w = 128;
charTexture = TextureManager::LoadTexture(texturesheet);
xpos = x;
ypos = y;
jump = -1;
hit = -1;
d... |
156b33eb6e8da62661dd86270a5d2f7996972738 | 2d72d131feec50f7d32349f1b9f2feb400069ab5 | wenxuan-hu/cse550 | /problemset1/parta/550shell.cc | C++ | cc | 3,417 | no_license | #include "550shell.h"
#define PIPE_READ 0
#define PIPE_WRITE 1
int main(int argc, char **argv) {
shell();
exit(EXIT_SUCCESS);
}
void shell() {
/* handle user input loop */
char *line, *s;
while (true) {
// print shell prompt "550shell$" and read new line
line = readline("550shell$ ");
// if EOF and em... |
96dc5f7adafe0e9ded210c9aba3810864242c747 | 7709b8902cb7daedda78943f8c86e6b0165dd038 | engineerkatie/ledger | /libs/storage/tests/unit/file_object/fake_random_access_stack.hpp | C++ | hpp | 4,910 | permissive | #pragma once
//------------------------------------------------------------------------------
//
// Copyright 2018-2019 Fetch.AI Limited
//
// 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 Licen... |
f6120d5aa2e3ab8e3c0ff77d1150a37793bafb8e | 7e6549c775bef05cbd36abf047d0145ba8079a18 | achitturi/ROSETTA-main-source | /src/protocols/forge/remodel/ResidueVicinityRCG.cc | C++ | cc | 15,849 | no_license | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... |
526c5b1b4413df22cc108b9f03bcd48557438016 | 688e9f5260aadbe751e9c9f09306e761aff7a43c | adriaan-niess/omnetpp | /src/qtenv/outputvectorinspectorconfigdialog.cc | C++ | cc | 4,408 | no_license | //==========================================================================
// OUTPUTVECTORINSPECTORCONFIGDIALOG.CC - part of
//
// OMNeT++/OMNEST
// Discrete System Simulation in C++
//
//==========================================================================
/*--------------------... |
d3d14444b270f6029baca1951e9e864bb8ac1c98 | ff7df997ab2e126fa1c92c1ed8a58cb335244630 | KevinHaoranZhang/Leetcode | /Sequence/q1-q99/q80-q89/q83/q83.cpp | C++ | cpp | 603 | no_license |
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteDupl... |
49eab723317662392d8c1078f5fc443976265d86 | e3221feff3dd9c8dffe0355f26b0b72d4862e137 | August2111/libcommon | /src/event/TimerList.cxx | C++ | cxx | 2,418 | no_license | /*
* Copyright 2007-2021 CM4all GmbH
* All rights reserved.
*
* author: Max Kellermann <mk@cm4all.com>
*
* 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 abo... |
a613803872f12747099d6a0066528404776b4cd9 | eee2fbd877d120c37d5ba99e87d19f226323d2aa | antifork/awgn | /codes++/fnv.hh | C++ | hh | 7,248 | no_license | /* $Id$ */
/*
* ----------------------------------------------------------------------------
* "THE BEER-WARE LICENSE" (Revision 42):
* <bonelli@antifork.org> wrote this file. As long as you retain this notice you
* can do whatever you want with this stuff. If we meet some day, and you think
* this stuff is worth ... |
acf1bbd07c2bb9014b71cde507c77d42a862a46e | a93dcb7b7ece58d7c509f5da2e7279a0f4f6d581 | seriiin/TreeStructure | /TreeStructure.cpp | C++ | cpp | 4,526 | no_license | //2018203043_최세린
//Visucal C++ 2017
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
using namespace std;
//방향을 의미하는 배열이다.
int V[4][2] = { { -1, 0 },{ 1, 0 },{ 0, 1 },{ 0, -1 } };
int Center(int n) { return n <= 1 ? 0 : 2 * Center(n / 4) + 1; }
int Depth(int n) { return... |
2e4175613efe61f567190c17b788b0e400f192d1 | 9dcf5a6506ad953dd663ce9115345a116a456c33 | t-moe/discoverpixy | /emulator/qt/ll_tft.cpp | C++ | cpp | 3,685 | no_license | /**************************************************************************************************************************************
* Project: discoverpixy
* Website: https://github.com/t-moe/discoverpixy
* Authors: Aaron Schmocker, Timo Lang
* Institution: BFH Bern University of Applied Science... |
b2ecbd7797a18bffb3ee69d412936dca94b363de | b254ca50f52759ff736946e1c1fb755f4e2b15a5 | Razjelll/PARAEngine | /PARAEngine/Code/Rendering/OpenGL/SDLWindow.hpp | C++ | hpp | 581 | no_license | #ifndef __PARA_SDL_WINDOW_HPP__
#define __PARA_SDL_WINDOW_HPP__
#pragma once
#include "../Base/Window.hpp"
#include "SDL\include\SDL.h"
#undef main
namespace Para
{
class SDLWindow : public Window
{
public:
SDLWindow(int width, int height, const std::string& title, bool fullscreen);
~SDLWindow();
void init... |
6358b7889df5d49cc827aeac3ac782f0d5b09c2d | c444791da8aded77009b931f921f88715c943fa8 | marcelcosme/URI | /CPP/1170.cpp | C++ | cpp | 361 | no_license | #include <stdio.h>
#include <iostream>
using namespace std;
int main()
{
float in= 0;
int dias = 0;
int numero;
cin >> numero;
for (int i=0; i< numero; i++){
cin >> in;
while (in> 1){
in = in/2;
dias ++;
}
cout << dias << " dias" << endl;
... |
9fd7fe3a5ef73e98d5f60eec0aa3c27f82907fb1 | ced268c852cf1b277ba4e9a56b396d5abc81eff6 | SiChiTong/Apollo_13 | /automap/src/PathtransformPlanner.cpp | C++ | cpp | 17,597 | no_license | #include "PathtransformPlanner.h"
PathtransformPlanner::PathtransformPlanner(const nav_msgs::MapMetaData& mapInfo) : mapInfo(mapInfo){
robotFootprint = cv::Rect();
cv::Mat occupancyGrid = cv::Mat();
cv::Mat distanceTransform = cv::Mat();
cv::Mat obstacleTransform = cv::Mat();
... |
167acfa5113e8ba9d77d4c71e8ab1411a36c60c7 | 59a566440057f8d07791a31ff50f6f2e930b8b99 | Roots-of-Unity/PEGTL | /src/test/pegtl/rule_if_must_else.cpp | C++ | cpp | 435 | permissive | // Copyright (c) 2014-2018 Dr. Colin Hirsch and Daniel Frey
// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
#include "test.hpp"
#include "verify_ifmt.hpp"
namespace tao
{
namespace TAOCPP_PEGTL_NAMESPACE
{
void unit_test()
{
verify_ifmt< if_must_else >( result_ty... |
b5cea0708c841604024bbc291046d9c85a2bd78f | 22414234ee60d67c4fc98a7fa768b1a2ba0941e7 | seonpilKim/solved.ac-class | /class-2/1018/1018.cpp | C++ | cpp | 783 | no_license | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int M, N;
int min = 64, cnt1, cnt2;
char** chess;
cin >> M >> N;
chess = new char* [M];
for (int i = 0; i < M; i++) {
chess[i] = new char[N];
}
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
cin >> chess[i][j];
... |
3f47542735f570f5bb6bac628931f43c7f2ec798 | 3ce295a9c98d61e0fe06767c3edfe6f2d122553d | aox/aox | /imap/imapsession.cpp | C++ | cpp | 12,982 | no_license | // Copyright 2009 The Archiveopteryx Developers <info@aox.org>
#include "imapsession.h"
#include "helperrowcreator.h"
#include "handlers/fetch.h"
#include "command.h"
#include "fetcher.h"
#include "mailbox.h"
#include "message.h"
#include "scope.h"
#include "imap.h"
#include "flag.h"
class ImapSessionData
: pub... |
7ed293c73e5828d5b05657378f6c7b9e551f5326 | c6604c8f1c20329823b77f5403000f08f750a913 | classygroup/sems | /core/AmFaxImage.cpp | C++ | cpp | 22,844 | no_license | #include "AmFaxImage.h"
#include "AmSession.h"
#include "udptl.h"
#define T38_FAX_RATE_DEFAULT "transferredTCF"
#define T38_FAX_UDPEC_DEFAULT "t38UDPRedundancy"
#define NAME_TO_STRING(name) #name
#define STAT_ECM "ecm"
#define STAT_BIT_RATE "bit_rate"
#define STAT_TX_PAGES "tx_pages"
#define ST... |
0fec410ad2e6dcfd7159d08b83bbd6a184711e24 | 7165523c1fbb008dc5271e665093214596ecb205 | mikelcal/Cascades-Samples | /pushCollector/src/vo/User.cpp | C++ | cpp | 922 | permissive | /*!
* Copyright (c) 2012 Research In Motion Limited.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or ag... |
f71a171a8d3a356bd9f9f2fed7cf2a221564449f | eb1efa9e9204d10de751ec9dc917c8ef7c48c1c5 | SymbolixDEV/MyCore | /src/server/scripts/Northrend/IcecrownCitadel/boss_valithria_dreamwalker.cpp | C++ | cpp | 53,718 | no_license | /*
* Copyright (C) 2008-2015 TrinityCore <http://www.trinitycore.org/>
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later ve... |
1f68c61a16bca8c7da516638b50b83d55e65a671 | d425730bafc4ef9127f0f2e4556d8fc7166d96a3 | IbisNeuronav/Ibis | /IbisVTK/vtkExtensions/vtkMultiImagePlaneWidget.cxx | C++ | cxx | 85,905 | permissive | /*=========================================================================
Ibis Neuronav
Copyright (c) Simon Drouin, Anna Kochanowska, Louis Collins.
All rights reserved.
See Copyright.txt or http://ibisneuronav.org/Copyright.html for details.
This software is distributed WITHOUT ANY WARRANTY; without even
... |
e66f2031539fcda31420f133b1d731b741ecd3ac | ba3fe462d6ecd4ac32def49471415ddc888e44ce | carrgilson/irods_rule_engine_plugin_audit_amqp | /src/libirods_rule_engine_plugin-audit_amqp.cpp | C++ | cpp | 10,174 | no_license | // =-=-=-=-=-=-=-
// irods includes
#include "irods_re_plugin.hpp"
#include "irods_re_serialization.hpp"
#include "irods_server_properties.hpp"
#undef LIST
// =-=-=-=-=-=-=-
// stl includes
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <chrono>
#include <ctime>
#include <sstream>... |
006d1d3d5a76417532bd33e445c319449a6c5f4c | 4932736e01ca15f1fdd464b8c33d5dae287b7af3 | singh-shreya6/Codes | /Blind75/WordSearch.cpp | C++ | cpp | 1,368 | no_license | /* https://leetcode.com/problems/word-search/ */
class Solution {
public:
bool dfs(vector<vector<char>>& board, string word, int i, int j, int n, int m, int k, vector<vector<bool>>& vis) {
if (i < 0 || j < 0 || i>=n || j >= m || board[i][j] != word[k] || vis[i][j]) {
return false;
}
... |
d9ecc14603dcae2a3a1cd566a98d7ef2cd14fbd6 | 817b573ce8fc6969b20edbcff9021c67b28bec8f | huangyt/MyProjects | /PPTVForWin8/base_1.2.2/include/boost/mpl/aux_/advance_backward.hpp | C++ | hpp | 3,327 | no_license |
#if !defined(BOOST_PP_IS_ITERATING)
///// header body
#ifndef BOOST_MPL_AUX778076_ADVANCE_BACKWARD_HPP_INCLUDED
#define BOOST_MPL_AUX778076_ADVANCE_BACKWARD_HPP_INCLUDED
// Copyright Aleksey Gurtovoy 2000-2004
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.tx... |
5a720a6c35ff40ffdace70fd4daa2ff024414f98 | 513697c506b03c740a0436230fb49b43e33be511 | Jeeukrishnan/codeforces_solution | /492B.cpp | C++ | cpp | 224 | no_license | #include<bits/stdc++.h>
using namespace std;
int n,l,m,i,a[1005];
main(){
cin>>n>>l;
for(;i<n;i++) cin>>a[i];
sort(a,a+n);
m=max(a[0],l-a[n-1])*2;
for(i=1;i<n;i++) m=max(m,a[i]-a[i-1]);
printf("%lf",m/2.0);
} |
9f816ddc276c886e63d1d21a967eb09d6dcfc93f | a88a304e1cb903e817b601afe043e335a49fd7c4 | yqbeyond/Algorithms | /hdu/hdu1496_1.cpp | C++ | cpp | 1,133 | no_license | /* Problem ID: 1496
* Author: YQ_Beyond
* Run ID: 17591747
* Exe Time: 218MS
* Exe Memory: 9400K
* Code Len: 793 B
* Language: G++
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
int square[101];
int _hash[2000003];
int main()
{
int a, b, c, d;
for (int i = 1;... |
f38288c4742c17b148f550320814c0c245487e61 | fdbc9b80eba848b4e58fd05b71adfa28b11e862a | seal-git/atcoder | /2020-09-26-B/main.cpp | C++ | cpp | 421 | no_license | #include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <tuple>
#include <numeric>
using namespace std;
int main(int argc, char* argv[]){
long long A, B, C, D;
scanf("%lld %lld %lld %lld", &A, &B, &C, &D);
if(A<C... |
4a205a26456a5802967317f8f85f97d0807a14fd | 379dad0cdb4666dc966f770bb6911166db16c00d | chandan5/Codes | /knightmv.cpp | C++ | cpp | 971 | no_license | .1) plaintext list. Status: AC, problem KNIGHTMV, contest . By chandan5 (chandan5), 2014-10-28 15:42:21.
#include<bits/stdc++.h>
#define SI(i) scanf("%d",&i);
#define loop(i,n) for(i=0; i<n; i++)
using namespace std;
int main()
{
char a[10000];
int it, tc, i, j;
SI(tc);
getchar();
... |
8380a6173a9f4801bbcbd93e63710855899b4a39 | 52c9dd5630f62951603407ce4838c8ed73a403ef | mousumiroy-unm/pylith | /tests/libtests/meshio/data/DataWriterHDF5DataFaultMeshTet4.hh | C++ | hh | 2,901 | permissive | // -*- C++ -*-
//
// ======================================================================
//
// Brad T. Aagaard, U.S. Geological Survey
// Charles A. Williams, GNS Science
// Matthew G. Knepley, University of Chicago
//
// This code was developed as part of the Computational Infrastructure
// for Geodynamics (http://... |
e7a0156e27fa8634ba0130b5244a5b93cb57abf0 | 2e94ddbc14232b3a6aa1433dfd5b9b7671a582bb | yaoyaowd/competitivecoding | /main.cc | C++ | cc | 1,779 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1000010;
const int inf = 1e8;
const int mod = 1000000007;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
int ... |
8e77948b9bceefca19c4b5ddb45642981b7f2952 | f259340af143f203cc80a87fa642792e4af11d5e | smartinsider/cryptoyen-classic | /src/primitives/block.cpp | C++ | cpp | 5,175 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2015-2017 The YEN developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "primitives/block.h"
#incl... |
98a0423e89ee9717bc59f9131f44aaa13e5d233d | 14f03d767937e7fde80aca9d812a711d9ff4a08c | dodoshuai/Practice | /devc_prat/每日一题_14.cpp | C++ | cpp | 1,095 | no_license | #include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
//int main(){
/*char dog[]="wang\0miao";
//printf("%d\n",sizeof(dog));
cout<<sizeof(dog)<<endl;
cout<< strlen(dog)<<endl;
*/
/* char ccString1[]="Is Page Fault??";
char ccString2[]="No Page Fault??";
strcpy(ccString1,"No");
if(strcmp... |
94ab510d1cc496b5e927a2e80ea03cf102ea9137 | 71345dcd012f41051ccc9ac36d1b18cafbcd137d | niuxu18/logTracker-old | /second/download/httpd/gumtree/httpd_old_hunk_2651.cpp | C++ | cpp | 728 | no_license | ctx = f->ctx = apr_pcalloc(f->r->pool, sizeof(charset_filter_ctx_t));
ctx->dc = dc;
ctx->noop = 1;
}
}
if (dc->debug >= DBGLVL_GORY) {
ap_log_rerror(APLOG_MARK, APLOG_DEBUG, 0, f->r,
"xlate_in_filter() - "
"charset_so... |
f43ba9f1d794d8ddc2f41f60416c599b0d28088d | 5489f8606c63a5a3fa1e3fe2d789509afb0f0052 | JeffersonLab/HPS-CODE | /ANALYSIS/bump-hunter/src/utils/FitPrinter.cxx | C++ | cxx | 2,807 | no_license | /**
* @file FitPrinter.cxx
* @brief Class used to print a RooFit result to a file.
* @author Omar Moreno
* SLAC National Accelerator Laboratory
*/
#include "FitPrinter.h"
FitPrinter::FitPrinter() {
//_canvas->Divide(1, 2);
_main_pad->Draw();
_res_pad->Draw();
}
FitPrinter::~FitPrinter() {
... |
761cd0676795153d032b879daa0accbf4dba8924 | 927a1c0d64a5d498a367db72c2b63e846ca2a1b1 | AltcoinAdam/Utopia | /utopiacoin/src/qt/bitcoin.cpp | C++ | cpp | 9,146 | permissive | /*
* W.J. van der Laan 2011-2012
*/
#include "bitcoingui.h"
#include "clientmodel.h"
#include "walletmodel.h"
#include "optionsmodel.h"
#include "guiutil.h"
#include "guiconstants.h"
#include "init.h"
#include "ui_interface.h"
#include "qtipcserver.h"
#include <QApplication>
#include <QMessageBox>
#include <QTextCo... |
967a67383b43db1def59b27a41c4d546bb482eae | 687dfa542fc57c62ced54b24907c367d2e03ffb8 | ECS-251-W2020/chromium | /ui/events/gesture_detection/touch_disposition_gesture_filter.cc | C++ | cc | 17,757 | 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 "ui/events/gesture_detection/touch_disposition_gesture_filter.h"
#include <stddef.h>
#include "base/auto_reset.h"
#include "base/logging.h"
#in... |
002b099521e58451cad5ff036e6d3cb28dadd5b8 | 4a55e34b9d9a9a3e704e8baea3b09309dcc3cd26 | CR7dongfeng/single_lidar_imu_calibration | /lib/src/calibration_once.cpp | C++ | cpp | 4,249 | no_license | #include <dirent.h>
#include <iostream>
#include <string>
#include <vector>
#include <pcl/common/common.h>
#include <pcl/common/transforms.h>
#include <pcl/visualization/pcl_visualizer.h>
#include "calib_options.h"
#include "calibration_once.h"
#include "frame.h"
namespace jf {
void createFrames(
std::vector<std:... |
97a13354523897077d4946f1f9428515cc1232d2 | 618ad87d665213659cfbbd43733a099f2eaa2a8f | Marie2003Mary/Programming | /Practice/26/c++/ShablonBozoSort/ShablonBozoSort/ShablonBozoSort.cpp | C++ | cpp | 4,811 | no_license | #include <iostream>
#include <ctime>
#include <vector>
#include <cmath>
#include <string>
std::vector<double>BozoSort(std::vector<double>a, int n, bool y) {
int r1, r2, ind = 0, check = 0;
std::vector <double> b(n);
while (1) {
r1 = rand() % n;
r2 = rand() % n;
if (r1 != r2) {
std::swap(a[r1], a[r2]);
... |
fde0e64ec73bd57151554d1c6c4530d0611c2c73 | c9b72b3e9cdda96ac117503af4c70e4a49271eb9 | wkentaro/jsk_smart_apps | /jsk_smart_gui/src/3dtopixel.cpp | C++ | cpp | 1,666 | no_license | #include <ros/ros.h>
#include <opencv/cv.h>
#include <image_geometry/pinhole_camera_model.h>
#include <tf/transform_listener.h>
#include "jsk_smart_gui/point2screenpoint.h"
class TransformPixel
{
ros::NodeHandle nh_;
ros::Subscriber camerainfosub_;
ros::ServiceServer srv_;
tf::TransformListener tf_listener_;
... |
4e01ca187db6e1bc8843e39a7aa00c6c289e45c7 | 4c9524f8e020db09e5da6df0d1b99b8557a49d53 | kittisaks/FlexGAS | /src/vivm/agent/agent_settings.cpp | C++ | cpp | 4,114 | no_license | #include "agent_settings.h"
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#define STRLEN 256
bool agts_shm_path_init = false;
char agts_shm_path[STRLEN];
bool agts_rdma_port_init = false;
char agts_rdma_port[STRLEN];
bool agts_inet_port_init = false;
char agts_inet_port[STRLEN];
bool agts_sched_rdma... |
4cab110d9cda860f3e173b9c3470c3e4d11f3d9f | 38cb2ff49fe7e99af2e3fc39650113fa6e28d620 | LearnCV/TileCodeRayTracer | /src/SceneObject.cpp | C++ | cpp | 662 | no_license |
#include "SceneObject.h"
#include "vector3d.h"
#include "stdio.h"
namespace CelioRayTracer
{
SceneObject::SceneObject()
{
//TODO what is the difference between vector3d origin(); and vector3d origin = vector3d();
//vector3d origin();
//ObjMaterial myMaterial();
origin = vector3d();
myMaterial =... |
c64585ed321cf175759d285f01b29265c87db131 | be7b0aa4b4fae6063d6cd4cb5e5f2563191f41dd | rishithellathmeethal/Kratos | /external_libraries/amgcl/relaxation/ilu0.hpp | C++ | hpp | 7,221 | permissive | #ifndef AMGCL_RELAXATION_ILU0_HPP
#define AMGCL_RELAXATION_ILU0_HPP
/*
The MIT License
Copyright (c) 2012-2018 Denis Demidov <dennis.demidov@gmail.com>
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 Sof... |
578c46d0971adbd76a8a3831f32644c0c5e4c7de | 3f590921a3596ea128af45c61d6def1184253322 | backpackercoin/backpackercoin | /src/qt/test/uritests.cpp | C++ | cpp | 3,022 | permissive | // Copyright (c) 2009-2014 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 "uritests.h"
#include "guiutil.h"
#include "walletmodel.h"
#include <QUrl>
void URITests::uriTests()
{
SendCo... |
6b69a04f0a4c77ffd2cf735146f9ca3aabc4ad0c | 0092aba755d0c3a9996330000489e2abbdd8ffa0 | gkatsi/toulbar2 | /src/core/tb2globaldecomposable.hpp | C++ | hpp | 9,031 | permissive | /** \file tb2globaldecomposable.hpp
* \brief Decomposable global cost functions : WeightedRegular, WeightedAmong
*/
#ifndef TB2GLOBALDECOMPOSABLE_HPP_
#define TB2GLOBALDECOMPOSABLE_HPP_
#include "tb2wcsp.hpp"
#include "tb2types.hpp"
#include "tb2enumvar.hpp"
#include "utils/tb2automaton.hpp"
class DecomposableGlob... |
b6594137d93974846bc21e52e12395f386e34afd | 0c8792c5d0a86fb92e9309660cb3228ed391776d | lbguilherme/duvidovc-app | /java/include/org.apache.http.impl.client.BasicCookieStore.hpp | C++ | hpp | 2,175 | no_license | #pragma once
#include "../src/java-core.hpp"
#include <jni.h>
#include <cstdint>
#include <memory>
#include <vector>
#include "java.lang.Object.hpp"
#include "org.apache.http.client.CookieStore.hpp"
namespace java { namespace lang { class String; } }
namespace java { namespace util { class Date; } }
namespace java {... |
93caff0d318cf5415a2686cea2fd0e93b9f5e8bc | a0a462a3c38e8bbc326d25acd59ecf0d1d60175e | bjorn/moai-beta | /src/moaicore/MOAIBox2DJoint.cpp | C++ | cpp | 10,951 | no_license | // Copyright (c) 2010-2011 Zipline Games, Inc. All Rights Reserved.
// http://getmoai.com
#include "pch.h"
#include <Box2D/Box2D.h>
#include <moaicore/MOAIBox2DArbiter.h>
#include <moaicore/MOAIBox2DBody.h>
#include <moaicore/MOAIBox2DJoint.h>
#include <moaicore/MOAIBox2DWorld.h>
#include <moaicore/MOAILogMes... |
563d3ade805b8dfbe9f740d047147c5dae43634a | 796b461e1558b9724b9c18648d42682c5e853ff7 | niuxu18/logTracker-old | /second/download/httpd/gumtree/httpd_repos_function_286_httpd-2.2.3.cpp | C++ | cpp | 388 | no_license | static void register_hooks(apr_pool_t *p)
{
dav_hook_gather_propsets(dav_fs_gather_propsets, NULL, NULL,
APR_HOOK_MIDDLE);
dav_hook_find_liveprop(dav_fs_find_liveprop, NULL, NULL, APR_HOOK_MIDDLE);
dav_hook_insert_all_liveprops(dav_fs_insert_all_liveprops, NULL, NULL,
... |
d01a4d7ca96456aa14cd307d609a5a40a91fff97 | 7418cd883f7abf40ad4b95502b0aef59935dca0e | 15831944/Zee | /Zee/Zee/Source/PointLight.cpp | C++ | cpp | 1,550 | no_license | #include"PointLight.h"
#include "Engine.h"
void PointLight::Enable(bool enable)
{
if(enable == mIsEnabled)
{
return;
}
else
{
LightManager* lightMgr = gEngine->GetLightManager();
if(enable == true)
{
if(lightMgr->GetActivePointLightCounts() < MAX_NUM_POINT_LIGHTS)
{
mIsEnabled = true;
lightM... |
ebe3167ad75730ea1ced8a4d17724f97a24a610c | 2f825b0070dcb422484aa8512699279f1fab86f8 | ric2b/Vivaldi-browser | /chromium/chromeos/ash/components/network/network_state_handler_unittest.cc | C++ | cc | 128,682 | permissive | // Copyright 2012 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chromeos/ash/components/network/network_state_handler.h"
#include <stddef.h>
#include <map>
#include <memory>
#include <set>
#include <string>
#include "ash/consta... |
d0bfa96449fa5deb3652fefed625908ab17b16b1 | ad2c45ecf1ab681db9777388d1d92e3c644d0f35 | yezi1000/ACM-ICPC | /Practice/VJ/2018FJ/A.cpp | C++ | cpp | 2,193 | no_license | #include<cstdio>
#include<algorithm>
#include<queue>
#include<iostream>
#include<cmath>
#include<vector>
#include<set>
#include<stack>
#include<time.h>
#include<map>
#include<cstring>
#define eps 1e-8
#define pi acos(-1)
#define mp make_pair
#define PH push
#define pb push_back
#define PII pair<int,int>
#define VI vect... |
77aba0928e1532467d06e9efbf77e138804169a7 | a0c2e9280739fdae9226d736a22211d7b33d30b3 | Paul-Ventura/TurtleCPP | /builder.cc | C++ | cc | 5,122 | no_license | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
enum PersistenceType
{
Tarjeta_de_video, Disco_duro, Procesador, Memoria_RAM
};
//La lista que contendrá las "partes" a utilizar en la construcción (el orden sí importa)
struct PersistenceAttribute
{
PersistenceType type;
char value[... |
9314a7c9f829d38ab52477dabeeab74bfc1ec08b | 2b9043fb7c7f0e8c657a1169bab475a47668a325 | mhochsteger/blaze | /blazetest/src/mathtest/dmatreduce/total/L3x3b.cpp | C++ | cpp | 3,670 | permissive | //=================================================================================================
/*!
// \file src/mathtest/dmatreduce/total/L3x3b.cpp
// \brief Source file for the L3x3b dense matrix total reduction operation math test
//
// Copyright (C) 2012-2019 Klaus Iglberger - All Rights Reserved
//
// This... |
dbac4b953a94fcdfab48d1e3a73c5ee8495d151d | 5c6d885b447b17eae9f2611ba4c2e33934a572d6 | AlbertVVila/ZorkTerror | /ZorkTerror/Room.cpp | C++ | cpp | 2,047 | permissive | #include "stdafx.h"
#include "Room.h"
#include "Lightable.h"
Room::Room(const string & name, const string & description, const string &hidingSpot, const bool &isLighted) :
Entity(name,description,NULL)
{
this->hidingSpot = hidingSpot;
this->isLighted = isLighted;
type = ROOM;
}
void Room::Look() const
{
if (thi... |
535f2d56f401ade07d24899d4b41e0e88f885255 | eae20afdabf6b3ae3a1c0ab9953007fac90f794c | MCMrARM/zeroframework | /src/maps_helper.cpp | C++ | cpp | 2,176 | permissive | #include <zerof/maps_helper.h>
#include <vector>
#include <stdexcept>
using namespace zerof;
int maps_helper::_getline(char** lineptr, size_t* n, FILE* stream) {
if (*lineptr == nullptr || *n < 16) {
*n = 64;
*lineptr = (char*) (*lineptr == nullptr ? malloc(*n) : realloc(*lineptr, *n));
i... |
9ed4c46a3e6b0c18081fc2e587e37f327257cff9 | afeaa65383ef4094dc214db87b05373119876c80 | DiegoGarza/DGM-ICPC | /MS/pick.cpp | C++ | cpp | 2,873 | no_license | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>
#include <ctime>... |
cb10c713c3434794598eb2f17e3fbea064dcb695 | 2779a73dcf37f1ac2b624e4ba2cc599c0546563b | hyperledger/iroha | /shared_model/backend/protobuf/query_responses/impl/proto_peers_response.cpp | C++ | cpp | 700 | permissive | /**
* Copyright Soramitsu Co., Ltd. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#include "backend/protobuf/query_responses/proto_peers_response.hpp"
namespace shared_model {
namespace proto {
PeersResponse::PeersResponse(iroha::protocol::QueryResponse &query_response)
: peers_respo... |
5679f7775b3c3d0b2f914ac968cb7ac2d7c46fdf | ea8e038a51ade2fe86f010e24c0ff76e20d14e12 | purm/IvmpDotNet | /IvmpDotNet.Proxy/Events.cpp | C++ | cpp | 5,347 | permissive | #include "SDK\SDK.h"
#include "Events.h"
using namespace IvmpDotNet::Core;
public ref class EventRegisterManager
{
private:
static mscoree::CorRuntimeHost^ host = gcnew mscoree::CorRuntimeHostClass();
//Gets the default appDomain
static System::AppDomain^ GetDefaultAppdomain() {
System::Object^ temp;
host->Ge... |
0c69e626a153c25f38549c989e44afca43fad4c4 | 7666fd905af357bcf0fb1ea6740a718bd05757c2 | LittoCats/RenderKit | /RenderKit/HTML/HTMLAttribute.cpp | C++ | cpp | 672 | permissive | //
// HTMLAttribute.cpp
// RenderKit
//
// Created by Manuel Deneu on 12/06/2017.
// Copyright © 2017 Unlimited Development. All rights reserved.
//
#include <assert.h>
#include "HTMLAttribute.hpp"
std::string HTMLAttribute::getName() const noexcept
{
assert(_attr);
return myhtml_attribute_key(_attr... |
c50e18a40fe55b9d1c4b1b362d243bba19751889 | 4518521a154f8d05ef2a47f2f00dc6e335bb63a1 | suzuhiroruri/EuropeanCharisou | /Victorian Rush Hour/libs/extensions/GUI/CCControlExtension/CCInvocation.cpp | C++ | cpp | 1,871 | no_license | /*
* Copyright (c) 2013 cocos2d-x.org
* http://www.cocos2d-x.org
*
* 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 us... |
5d3c7ae3d454d29aa14ea9ecb754f0aa9328dc72 | 6034501190f1ca8941050c553c70df2edb7f0a16 | attilajeges/impala | /be/src/exprs/mask-functions-ir.cc | C++ | cc | 35,440 | permissive | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... |
5873d32b6eb0583f9bf9951c956646900c3b8a99 | 55da7cbf896ab2d17b81261ba2d292d9735aa98c | mjendruk/mammut | /source/rendering/text/SymbolRenderer.cpp | C++ | cpp | 1,022 | no_license | #include "SymbolRenderer.h"
const float SymbolRenderer::s_lineHeight = 0.11f;
const float SymbolRenderer::s_textureSize = 1024.0f;
QMap<QString, int> SymbolRenderer::s_idMapping;
bool SymbolRenderer::s_idMapInitialized = false;
SymbolRenderer::SymbolRenderer()
: SDFRenderer("data/fonts/Symbols.raw",
... |
ae0c4d6d175e79296b80f53fb3ca2b93c0010b3b | ef60058168cca2cf14cf341d04eecdfd9e4f0fb8 | arturocs/grado_informatica_ugr | /2º/ED/Practica final/src/TestDiccionario.cpp | C++ | cpp | 966 | no_license | #include "Diccionario.h"
#include <fstream>
#include <iostream>
#include <set>
using namespace std;
int main(int argc, char *argv[]) {
string palabra;
int tam=0;
vector<string> vt;
if (argc != 2) {
cout << "Dime el nombre del diccionario" << endl;
return 0;
}
ifstream f(argv[1]);
if (!f) {
... |
7d8ad7df60707345ff0ad7d8d05ab34ba168cf75 | 66d4dcd985ae46bc5c8878df26e3753c083d5e33 | ghsecuritylab/cwrs | /tpd/display/webkitgtk/Source/WebKit2/UIProcess/API/C/WKPreferences.cpp | C++ | cpp | 28,905 | no_license | /*
* Copyright (C) 2010 Apple Inc. 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 conditions a... |
03efd976dcede4b0ddae7c4a88ea4dc9a399cdb4 | 6dc00afe7368441be92f442c14cdf92eca1083f9 | rohangeorge91/Hand-Gesture-System | /Hand Gesture system/Hand Gesture.cpp | C++ | cpp | 49,672 | no_license | // Hand Gesture system.cpp : Defines the entry point for the console application.
//Define for all necessary headers
#include "stdafx.h"
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
/* _beginthread, _endthread */
#include <process.h>
#include <stddef.h>
//timer for counter
#include <time.h>
//opencv hea... |
7d5d7e4aa5a7e0b3504be1960f01024d3c2bf3fe | f2e6fbbd765dda5323570cb3870bc6214ca8fd90 | ericzhng/tacs | /src/TACSIntegrator.cpp | C++ | cpp | 99,194 | permissive | /*
This file is part of TACS: The Toolkit for the Analysis of Composite
Structures, a parallel finite-element code for structural and
multidisciplinary design optimization.
Copyright (C) 2014 Georgia Tech Research Corporation
TACS is licensed under the Apache License, Version 2.0 (the
"License"); you may ... |
c48d22f07c4758ae3dd8303080249760e60646c9 | b12fcba5fb4cf9b3f7924fbcb948beb5151a463a | gyzkard/gy-mpl | /include/gympl/platform.hpp | C++ | hpp | 3,586 | permissive | /// \file gympl.hpp
#pragma once
#ifndef INCLUDED_GYMPL_PLATFORM
// \cond macro-verbose-255
#define INCLUDED_GYMPL_PLATFORM
#if defined(_MSC_VER)
#define GYMPL_COMPILER "MSVC"
#define GYMPL_COMPILER_MSVC
// todo: will ms ever consider
#define _Pragma(s)
#elif defined(__clang_major__)
#define GYMPL_COMPILER "CLANG"
#d... |
432f57ddbbf3fa978210002d85fdc7ebad442a6a | f2ab80bc4372160c64441b8e383569924299ac47 | LukeLu1263/WrightOcean2012 | /Src/Modules/BehaviorControl/BH2011HeadControlEngine/BH2011HeadControlEngine.cpp | C++ | cpp | 13,386 | no_license | /**
* @file BH2011HeadControlEngine.cpp
* @author Colin Graf
*/
#include "BH2011HeadControlEngine.h"
MAKE_MODULE(BH2011HeadControlEngine, Behavior Control);
BH2011HeadControlEngine::BH2011HeadControlEngine() : lastUsedPointIndex(-1), lastTargetSwitchTime(0) {}
void BH2011HeadControlEngine::init()
{
p.timeFactor ... |
c608b959bf53568c92e020dbccd7c1a69189f3b7 | 69b9e12fe2c2d215de56ce6a5e09a5ea4da25cce | gunarkroeger/ExemploAllegro | /Menu.cpp | C++ | cpp | 9,040 | no_license | #include "Menu.h"
Menu::Menu()
{
Inicializar();
}
Menu::~Menu()
{
buffer = NULL; // Aterra o ponteiro para o buffer;
}
void Menu::Inicializar()
{
/* As funções foram colocardas nesse método "Inicializar",
porque, caso colocadas na construtora, causam um erro no programa.
Esse erro ocorre por... |
d3852b821a22b07b4adca3cf63a33cf0f05c6edc | 952a0126663efbff0227b6c127e71cfb1bdc6ce4 | israel-Liu/brick | /src/brick/test/mock_log.cc | C++ | cc | 1,962 | no_license | // 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 "brick/test/mock_log.h"
namespace base {
namespace test {
// static
MockLog* MockLog::g_instance_ = nullptr;
Lock MockLog::g_lock;
MockLog::Mo... |
a1472937de7332f5e0ddf99a5935e69fe424e49d | 07ba9e2eca7544bce0506d08c6cc20ab244e1d55 | Xuxue1/code-snippet | /dp/AbstacFactory/AbstacFactory.cpp | C++ | cpp | 704 | no_license | #include <iostream>
#include "AbstacFactory.h"
#include "Product.h"
using namespace std;
//AbstacFactory
AbstacFactory::AbstacFactory()
{}
AbstacFactory::~AbstacFactory()
{}
//ConcreteFactory1
ConcreteFactory1::ConcreteFactory1()
{}
ConcreteFactory1::~ConcreteFactory1()
{}
AbstacProductA* ConcreteFactory1::Create... |
740dc4b8591fd806ff7b3317ee4367a3fa2262f6 | 65ad3cb412454018cf2ab98ca2db485ca9da888a | mhetrerajat/ds-challenge | /hackerrank/C++/Introduction/arrays.cpp | C++ | cpp | 376 | permissive | // https://www.hackerrank.com/challenges/arrays-introduction?h_r=next-challenge&h_v=zen
#include <iostream>
#include <algorithm>
#include <iterator>
using namespace std;
int main(int argc, char const *argv[]) {
int N, A[1000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = N-1; i ... |
170d866585f09fede91450c578f3289a5a39d66d | f3d5d61eb664d32be90b16fc7d9782b8a0fa2d78 | Fuyutsubaki/OpenSiv3D | /Siv3D/src/Siv3D/Texture/GL/Texture_GL.cpp | C++ | cpp | 3,480 | permissive | //-----------------------------------------------
//
// This file is part of the Siv3D Engine.
//
// Copyright (c) 2008-2018 Ryo Suzuki
// Copyright (c) 2016-2018 OpenSiv3D Project
//
// Licensed under the MIT License.
//
//-----------------------------------------------
# include <Siv3D/Platform.hpp>
# if defined(SI... |
8ec3cf04dd37f1971bd3ce2e373ebc970acd33a5 | a2cd2c4576035bc1761d8a441e4691795ecf2c43 | simonegodio1994/myprojects | /NATO_conference_vs2.cpp | C++ | cpp | 48,647 | no_license | #include <iostream>
#include <math.h>
#define R 162
#define C 288
#define NU 10
using namespace std;
// Define the UAV structure:
typedef struct UAV{
float x,y,z;
int id;
}UAV;
// Define the target structure:
typedef struct target{
float x,y,z;
}target;
// Define the neuron structure:
typedef struct ne... |
ca9d536fac066613badefceff9c8fc7c42c3669f | ca121d7255384f4c669ef4a391fcf5f1ba552e46 | sunklCoin/MCU | /touchGFX/Application/simulator/main.cpp | C++ | cpp | 4,058 | no_license | /******************************************************************************
*
* @brief This file is part of the TouchGFX 4.8.0 evaluation distribution.
*
* @author Draupner Graphics A/S <http://www.touchgfx.com>
*
******************************************************************************
*
* @sec... |
9f8be5dd6ac7f3b0f9b7979bc53695df8a3d3cd7 | 575e4f83989d2b91b15f0cf51a130c50fd66f455 | gabriellerosa/Codigos-Maratona | /CF/CONTESTSEILA/E/e.cpp | C++ | cpp | 1,025 | no_license | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int c;
cin >> c;
while(c--){
int n;
cin >> n;
vector<string> matrix(n);
for(int i = 0; i < n; i++){
cin >> matrix[i];
}
bool saida = false; ... |
cc5e44f2a689f939a1cd643f41b02faa022a5b81 | 66c7c3ae50fde38ca66cbe96eca05907a672132b | githeim/wh_tmpl | /.tmpl/ros2/ros2_lifecycle_cli/src/WW_ProjectName_WW_main.cpp | C++ | cpp | 1,729 | permissive | #include "stdlib.h"
#include "WW_ProjectName_WW/WW_NodeClassName_WW.h"
#include <thread>
bool g_bStopSpin=false;
void Set_bStopSpin(const bool& bVal) {g_bStopSpin=bVal;}
bool Get_bStopSpin() {return g_bStopSpin;}
... |
1b5d01fc17e26a67c8981d8cb68e53276b096765 | a13f8f30f1b75f83330199640ad0f2c6a369f731 | chitianhao/trafficserver | /proxy/http/HttpSessionAccept.cc | C++ | cc | 3,720 | permissive | /** @file
A brief file description
@section license License
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 und... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.