blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 2 247 | content_id stringlengths 40 40 | detected_licenses listlengths 0 57 | license_type stringclasses 2
values | repo_name stringlengths 4 111 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringlengths 4 58 | visit_date timestamp[ns]date 2015-07-25 18:16:41 2023-09-06 10:45:08 | revision_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | committer_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | github_id int64 3.89k 689M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 25
values | gha_event_created_at timestamp[ns]date 2012-06-07 00:51:45 2023-09-14 21:58:52 ⌀ | gha_created_at timestamp[ns]date 2008-03-27 23:40:48 2023-08-24 19:49:39 ⌀ | gha_language stringclasses 159
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 7 10.5M | extension stringclasses 111
values | filename stringlengths 1 195 | text stringlengths 7 10.5M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
620070710c2102ba0dadeead818a94a16ba19f5a | a4a2e3d07360c472dc8ada66d50953373af65026 | /DOA/LinkedLists/Node.h | d9cdbf1a8b00ae0c8794d5b8082ef8fcaa4e2221 | [] | no_license | Todtaure/IKT6 | 7b433c447f351ca181b59f396757b8ee97ad84a2 | 1c4ba6a17a469b19c7d92f4420360fd827f385fc | refs/heads/master | 2016-09-06T16:15:07.383941 | 2015-04-16T13:40:00 | 2015-04-16T13:40:00 | 29,924,420 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 153 | h | Node.h | #pragma once
template <typename T>
class Node
{
public:
Node(T i = T(), Node* n = nullptr)
:info(i), next(n){}
~Node(){}
T info;
Node* next;
};
|
5019874b06f6c511e92972da4840ec528d043849 | 1ae0e562962e638b9087beb2e747e17f53d43e5d | /test/TestIssue.cpp | 658f5cfbd822169bc5fede12385e53d0aff667c3 | [] | no_license | strinsberg/tracker-express | f62278447d8bf5b765997c0a6ddd10857718dca9 | f79304a9da9f4b2b37a88ad11eea89272256b06d | refs/heads/master | 2022-12-19T06:10:00.450083 | 2020-09-26T05:16:32 | 2020-09-26T05:16:32 | 226,718,639 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,472 | cpp | TestIssue.cpp | #include "gtest/gtest.h"
#include "Issue.h"
#include "Status.h"
TEST(TestIssue, testTitle) {
Issue i(1);
i.setTitle("Test");
EXPECT_EQ("Test", i.getTitle());
}
TEST(TestIssue, testDescription) {
Issue i(1);
i.setDescription("Test");
EXPECT_EQ("Test", i.getDescription());
}
TEST(TestIssue, tes... |
4fa2d0801bc17f15704ed1a8231447f49f0fd16c | d8944e9d8edaea7a73c49ce87aecfdf6a53faa9c | /Src/ApkFactory/Adapter/TableContralAdapterRes.h | 828c64d6e8c0b0d41a44bb14c31c1e8cc58666d8 | [] | no_license | xubingyue/AutopackingAndroid | d67f9c0875e0321f80c85479ff1d6ceedef517eb | 8e82926933cab0568617f9d5400e223c4bae5b6b | refs/heads/master | 2021-06-02T19:58:56.048240 | 2016-08-01T08:54:47 | 2016-08-01T08:54:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 326 | h | TableContralAdapterRes.h | #ifndef TABLE_CONTRAL_ADAPTER_RES_H
#define TABLE_CONTRAL_ADAPTER_RES_H
#include <QModelIndex>
#include "Interface/ITableContral.h"
class TableContralAdapterRes :public ITableContral
{
public:
void AddRow();
void DelRow(QModelIndexList &selecteds);
void DoubleClick(const QModelIndex &index);
protected:
private:
};
... |
6c905759f6f174a86131ace301f4f06d143a6892 | 05078aaa6f2863671525c2cb4771f61726285f5d | /debug/MSVC_Hubert/HLS/internal/_hls_float_X86-64.h | f86de2f8e42604d3191e419b00dcf6e53a703324 | [] | no_license | DeanKamen/I-BERT_in_C | 59a01694c832af811e28f13fe05d3a66660597b7 | dbec32eeba175936aa4ba30acd123fac54cd6572 | refs/heads/main | 2023-08-07T18:34:23.735367 | 2021-09-20T15:19:59 | 2021-09-20T15:19:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 29,339 | h | _hls_float_X86-64.h | /* Copyright 1992-2021 Intel Corporation. */
/* */
/* This software and the related documents are Intel copyrighted */
/* materials, and your use of them is governed by the express license */
/* unde... |
7d8cab85c99d97909997d30dcbc2fe73b0229f35 | 867eb068fb3253107bd575162ae9299c4e29c7bd | /ex2/vectorAdd.cpp | 5000ebcde7c309d3889a736c98b832697e6e9d35 | [] | no_license | etnoy/apcsa | e0adbba15bf06d2116e268f355660b5a7ce2d75e | fdb9ac3d5a51c01c3317ec16b64758bbad40d9be | refs/heads/master | 2016-09-05T11:01:59.639413 | 2009-12-15T13:24:26 | 2009-12-15T13:24:26 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,353 | cpp | vectorAdd.cpp | #include <omp.h>
#include <iostream>
#include "walltime.h"
#define NMAX 1000000
using namespace std;
int main()
{ int myId, numTdreads;
double time, time_start=0.0;
double dotProduct;
double *a,*b,*c,d;
int chunk_size, n_start,n_end;
// Allocate memory for the vectors as 1-D arrays
a = new double[NMAX];
b = ... |
580f515b95cf2d3985348c4b2afb7b995bc200eb | c9019a466fbb31c9404199d0f2bc92a67d55c32b | /src/hbase_full_sender.cc | 4af4b7aac54a82d35611addfd45821001f39c41a | [] | no_license | YuanDdQiao/mybus | 8d307b131e92218c8856aa7bf43dfdc0875e0a7b | 9e2ad1413992c952eb5ffbae143ed8f4b73f8605 | refs/heads/master | 2020-03-10T19:14:02.786213 | 2015-07-29T14:26:29 | 2015-07-29T14:26:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,976 | cc | hbase_full_sender.cc | /***************************************************************************
*
* Copyright (c) 2014 Sina.com, Inc. All Rights Reserved
*
**************************************************************************/
/**
* @file redis_full_sender.cc
* @author zhangbo6(zhangbo6@staff.sina.com.cn)
* @date 2014/12/26 ... |
a74a2b7e754b607099a3404a4144f52490c19634 | af8e4d71f99bc5833ba6caa46f4f69911c63225d | /hard/124.二叉树中的最大路径和.cpp | 2f911446a4aeee7ed855ae8c708de4fcebd3df3a | [] | no_license | zyhustgithub/leetcode | 8c77cb000472cda14b4b52572268e640497243d8 | 1b263344b047ab793e1f836d842b251ecee6b3bd | refs/heads/master | 2021-08-12T04:17:21.201733 | 2021-08-05T15:34:16 | 2021-08-05T15:34:16 | 250,941,833 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,058 | cpp | 124.二叉树中的最大路径和.cpp | /*
* @lc app=leetcode.cn id=124 lang=cpp
*
* [124] 二叉树中的最大路径和
*/
// @lc code=start
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
/**
* Definition for a binary tree ... |
3a61c02a002d3abd86aab86cc5458aadda12f0e1 | fff4bcec5f66252f885a3386e98d6e597b1fdf70 | /src/ClientDlg.h | f70db5a3cb9ef2995863a8c25c250d950d8c768a | [] | no_license | ZhangZhiHao233/Remotecomm | e767802bd5727067c7d4f9f73fae199906564066 | e8cf2136151b71450f3553255eeecc1fed1e1468 | refs/heads/master | 2022-11-17T23:25:40.439435 | 2020-07-12T11:31:16 | 2020-07-12T11:31:16 | 279,048,821 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,197 | h | ClientDlg.h | #pragma once
#include "afxcmn.h"
#include "afxwin.h"
// CClientDlg 对话框
class CClientDlg : public CDialog
{
DECLARE_DYNAMIC(CClientDlg)
public:
CClientDlg(CWnd* pParent = NULL); // 标准构造函数
virtual ~CClientDlg();
// 对话框数据
enum { IDD = IDD_DIALOG_CLIENT };
protected:
virtual void DoDataExchange(CDataExchange* ... |
0b800e4b7206e93bcbecc1325fd5f16c32a03352 | deaa518c6ba667f4fe2ab28b55de11d515ecc176 | /Subarray with Distinct Elements Hashing and Tries Challeges.cpp | 2597a142e6122cd93c2c0e7468924b636be20bec | [] | no_license | keshavjaiswal39/Coding-Block-Algo-plusplus | 1c154451c2aa44c73d45ebc05c4c2bbe1d4c9293 | 908351f12717942955afddc9dbe143fab7446784 | refs/heads/master | 2023-03-21T10:22:33.104054 | 2021-03-12T04:41:11 | 2021-03-12T04:41:11 | 346,939,743 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 443 | cpp | Subarray with Distinct Elements Hashing and Tries Challeges.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
set<int> s;
int N;
cin>>N;
int a[N];
for(int i=0;i<N;i++)
{
cin>>a[i];
}
int i=0,j=0,sum=0;
for(int i=0;i<N;i++)
{
while(j<N && s.find(a[j])==s.end())
{
s.insert(a[j]);
j++;
... |
73da984c07f39fc0aa4b3898575f924092b27022 | b690baf6e48d1dd76c18a4a28254a0daaff5f64c | /LeetCode/Majority Element/O(N).cpp | 0ae8611cb2c72b7deb51e299c48444ef2f0e81dc | [] | no_license | sorablaze11/Solved-Programming-Problems- | 3262c06f773d2a37d72b7df302a49efb7d355842 | b91ecbd59f6db85cc6a289f76563ed58baa1393d | refs/heads/master | 2020-08-22T06:49:07.754044 | 2020-01-25T10:35:21 | 2020-01-25T10:35:21 | 216,341,201 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 421 | cpp | O(N).cpp | class Solution {
public:
int majorityElement(vector<int>& nums) {
// Boyer-Moore Voting Algorithm
int cnt = 0, ans;
for(int i = 0; i < nums.size(); i++){
if(cnt == 0) {
ans = nums[i];
cnt++;
}else {
if(nums[i] ... |
4b0dfd24568145b82ad91935196b2d288144c81a | b6aaef99338cd4492ec792877522db1821a25fc4 | /Object_oriented_programming/D/main.cpp | 2d94f2968beccbf484487ccefe8475f83da9fcb7 | [] | no_license | MikalaiNavitski/uj-first-year | 303894a89aa424719457d118d35bb34eada69c66 | 5af102e012cd9f2db9240a0e6db898ebbf81b191 | refs/heads/master | 2023-06-22T19:32:15.939468 | 2021-07-20T09:10:49 | 2021-07-20T09:10:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,415 | cpp | main.cpp | //package pl.edu.uj.tcs.oop.satori.map_list_converter;
import java.util.*;
public class Switch {
public static <T> Map<Integer, T> toMap(List<T> initList) {
return new AbstractMap<>() {
final List<T> list = initList;
private transient Set<Map.Entry<Integer, T>> set;
@... |
d2d5b001df1ec87c76d0be5863aaec9d523a3b2a | 82dc3cc4c97c05e384812cc9aa07938e2dbfe24b | /contrib/translate/src-mirror/MergeResults.cpp | 0e85655ec637c9bbcd095eb53530c0d3b6f596c6 | [
"BSD-3-Clause"
] | permissive | samanseifi/Tahoe | ab40da0f8d952491943924034fa73ee5ecb2fecd | 542de50ba43645f19ce4b106ac8118c4333a3f25 | refs/heads/master | 2020-04-05T20:24:36.487197 | 2017-12-02T17:09:11 | 2017-12-02T17:24:23 | 38,074,546 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 56 | cpp | MergeResults.cpp | /home/saman/Tahoe/contrib/translate/src/MergeResults.cpp |
322b137a6b6f9b127bbace31b93df8e703673cc2 | 09f547eb0973ef1bba646aed67a434fb00c58c44 | /king.cpp | 440575dd8fdbb066a2cd9dfa46be11369f430335 | [] | no_license | HarrisonWelch/ChurchChess | 6e1db8f9704c8e2275c071ac1ea0cb5b1e2df41b | 64723669d946cebf145229efff5eff2dbc747a06 | refs/heads/master | 2021-06-04T11:07:38.176688 | 2016-05-18T20:39:40 | 2016-05-18T20:39:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,655 | cpp | king.cpp | #include "king.h"
char isKing(char piece) {
return piece == BLACK_KING ||
piece == WHITE_KING;
}
std::vector<Move> getKingMoves(const Chessboard& chessboard,
char row,
char col) {
if (isKing(chessboard.get(row, col)) == 0) {
throw std::... |
1b88b5cf42ad654049375f8a5ff11c96c2fbdab2 | d61f2cac3bd9ed39f95184b89dd40952c6482786 | /testCase/results/25/TS | 5284f2edc9c933fd6b25638f46b5593825659752 | [] | no_license | karimimp/PUFoam | 4b3a5b427717aa0865889fa2342112cc3d24ce66 | 9d16e06d63e141607491219924018bea99cbb9e5 | refs/heads/master | 2022-06-24T08:51:18.370701 | 2022-04-28T18:33:03 | 2022-04-28T18:33:03 | 120,094,729 | 6 | 3 | null | 2022-04-27T09:46:38 | 2018-02-03T13:43:52 | C++ | UTF-8 | C++ | false | false | 9,063 | TS | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 3.0.1 |
... | |
05b22ae8fc83f2fafc484fadf0deab440004b7e2 | e263b3c0fd10874ffa11e1097487a65b4074fe9f | /src/City.cpp | d685b66cc3c11f8032f7759490c73f8bf0f93fa3 | [] | no_license | Agent77/ex6 | e410af917763af903c75098b996a7378defad82f | be5e807ec59fcd0b634d41fb52c580e2e6fd10cc | refs/heads/master | 2021-05-01T01:46:53.302585 | 2017-01-30T19:36:07 | 2017-01-30T19:36:07 | 79,842,368 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,085 | cpp | City.cpp | #include <sstream>
#include "City.h"
City::City() {
gridSizeX=0;
gridSizeY=0;
}
void City::CallTaxiCenter(Passenger p) {
}
Passenger City::checkForPassengerCalls() {
}
/*
* The function parses a given string and creates new driver. if input is incorrect, returns fake
* driver with id -1.
*/
Driver Ci... |
82a76bc23b1bef0058e9003b428bdc85536f9c9a | da358ee83fc3362c0e0a0a2e041fc5a9548847b7 | /Algorithm/union_find.cpp | 4b287934dafc1ddb56354bcc043aa32592714211 | [] | no_license | seoyeon0413/Algorithm | a548dc2d28ebc7086830d24c17ba95b5e90b498c | 8af859d6cd14c73d23a4ba35fa034ad6496d29a9 | refs/heads/master | 2023-02-16T22:32:45.944868 | 2021-01-17T15:36:02 | 2021-01-17T15:36:02 | 255,344,789 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 984 | cpp | union_find.cpp | #include <stdio.h>
int getParent(int parent[], int x)
{
if (parent[x] == x)
return x;
return getParent(parent, parent[x]);
}
//각 부모 노드를 합칩니다.
void unionParent(int parent[], int a, int b)
{
a = getParent(parent, a);
b = getParent(parent, b);
if (a < b)
parent[b] = a;
else
parent[a] = b;
}
//같은 부모 노드를 가... |
69636fbccfd673d24cf361e92dc32faba9f2761a | c9e669d526ec8b303809c71dd15aa04bfb8045c1 | /Internal/BasicTimer/BasicTimerWithInterruptBasicImpl.h | 39b3080d20984dbb2c1b78b5c114e30bc1c12ac7 | [
"MIT"
] | permissive | crispycookies/LENTIA-Timer | b8dbef4612bb64453eab4da792aee1015d4d2b97 | c7a931e5464af0cf9caf12056e92e35dfb02c1e1 | refs/heads/master | 2022-11-28T12:48:38.361572 | 2020-08-05T21:28:30 | 2020-08-05T21:28:30 | 280,517,363 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,215 | h | BasicTimerWithInterruptBasicImpl.h | //
// Created by TobiEgger on 23.02.2020.
//
#ifndef DRONE_BASICTIMERWITHINTERRUPTBASICIMPL_H
#define DRONE_BASICTIMERWITHINTERRUPTBASICIMPL_H
#include "BasicTimerBasicImpl.h"
#include "../../../../Common/IRQs/IRQCallee.h"
#include "../../../../Common/IRQs/IRQ.h"
#include "../../../../Common/IRQs/IRQCallee.h"
#inclu... |
9bda7a946a44610012e906e8229c12080ce42b8a | a2452f6e456a2248f2de708a2d39e8e574d5240a | /Coursework1Release/main.cpp | d866d4eaf8daf5938835cda0c4c1bd0ad52b82c5 | [
"Apache-2.0"
] | permissive | razvanilin/parallelGeneticAlgorithm | 0986bfe636621916c4d70ec0fca9e0b9ef241364 | e268a13ab3760e6a049cf83f87ddc649c9ae9079 | refs/heads/master | 2021-01-11T04:50:48.516366 | 2016-11-03T20:59:20 | 2016-11-03T20:59:20 | 71,454,915 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,783 | cpp | main.cpp | //
// main.cpp
// Coursework1
//
// Created by Razvan Ilin on 13/10/2016.
// Copyright © 2016 Razvan Ilin. All rights reserved.
//
#include <iostream>
#include <string>
#include <vector>
#include <memory>
#include <algorithm>
#include <random>
#include <chrono>
#include <array>
#include <cstring>
using namespace ... |
c6b0a7528aad7fb3b73bb676d548491981896201 | 312e69112d0efa23ebcb7dff403dedeb40a25398 | /configure.cpp | c175bfaecb0881bb7c433e8747bf60420f83ab02 | [] | no_license | wlrwxer/tcp-port-forward | 0aeffcf6d5124dfcd46f02e8e697cc5e4dd0043e | 05b5191ab2637dcea0a1099442425350c457bb66 | refs/heads/master | 2020-03-29T05:00:34.549476 | 2018-09-21T03:21:21 | 2018-09-21T03:21:21 | 149,560,919 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,023 | cpp | configure.cpp | //
// configure.cpp
// mars_online_server
//
// Created by baba on 9/3/13.
// Copyright (c) 2013 baba. All rights reserved.
//
#include <luabind/luabind.hpp>
#include "configure.h"
void logging_lua(const char *) {
}
int global::update_configure_from_lua(const char *luafile) {
assert(luafile);
lua_... |
67ea632944a22e38e75926996e45e5bca639e646 | 42e146f13a65324b0f07a6eea1fd8c9ac98bd0f7 | /FileUtils.cpp | 7f5ade6ddd5518b95e1e48ad0d2b55f0fe264a96 | [] | no_license | mfurkin/fileutils | 413a55f05c9defdcb404273c9d3a9c998f4fbd88 | 43a21c5d4b5d1893567c6d04f1e073910d0df383 | refs/heads/master | 2021-09-02T05:07:49.331092 | 2017-12-30T16:51:05 | 2017-12-30T16:51:05 | 115,810,149 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 1,826 | cpp | FileUtils.cpp | /*
* FileUtils.cpp
*
* Created on: 30 äåê. 2017 ã.
* Author: Àë¸íà
*/
#include "FileUtils.h"
std::string FILEUTILS_TAG="FileUtils";
int makeSureFileExists(const char* fname, int isFile, LoggerEngine* logger_ptr) {
HANDLE findPath;
WIN32_FIND_DATA findData;
findPath = FindFirstFile(fname,&... |
f4b71242f1cc76912e26d58fc56ca61ad8df92c9 | 0e2b9243fd5d36e8724893aada5eb9205edb8893 | /DSA-wangdao/6.cpp | 63c04c4fb5436521c85354a175a221dfbf627603 | [] | no_license | songcs/ky-code | 80edb4abf13bf154d1f6e4c6815e26cdbab4a3f9 | 62322532fdfd94c5f252b28aef31b11076c7ed70 | refs/heads/master | 2021-01-01T18:40:40.680472 | 2017-08-18T03:38:49 | 2017-08-18T03:38:49 | 98,404,161 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,488 | cpp | 6.cpp | /*一般线性表的顺序查找*/
typedef struct {
ElemType *elem;//元素存储空间基址，建表时按实际长度分配，0号单元留空
int TableLen;//表的长度
} SSTable;
int Search_Seq(SSTable ST, ElemType key) {
ST.elem[0] = key;//哨兵
for (i = ST.TableLen; ST.elem[i] != key; i--);
return i;//若表中不存在关键字为key的元素，查找到i=0时，退出for循环
}
/*折半查找*/
int Binary_Search(SSTabl... |
f4dc99b928f5e02a406d7a771877342bb86eee60 | 263454e4d7f144d15a7676811b4ad4eeb5390a0a | /558 UVA.cpp | 414e77b63d90ae66bf17b2fec1263635134b3e32 | [] | no_license | notorious94/UVa-solution | 4d6b90518f499b24d55af75f448445aac5252795 | 367d62dedbad0c2a2718a1807917dc6965fd39e3 | refs/heads/master | 2021-06-07T20:24:46.233613 | 2020-01-27T17:14:19 | 2020-01-27T17:14:19 | 94,576,972 | 3 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 1,818 | cpp | 558 UVA.cpp | #include<bits/stdc++.h>
using namespace std;
/// M A C R O Starts Here
#define pf printf
#define sf scanf
#define MAX 500000
#define MOD 100000007
#define INF INT_MAX
#define pi acos(-1.0)
#define get_stl(s) getline(cin,s)
#define sif(a) scanf("%d",&a)
#define pif(a) printf("%d\n",a)
#define puf(a) printf("%llu\n",a)
... |
998a646aa78865465a13d25a0c85109b35b9abf1 | b22588340d7925b614a735bbbde1b351ad657ffc | /athena/Trigger/TrigValidation/TrigValTools/src/TRoot2Html.cxx | c5785b4fce307f8e3aef24117491167e7c9d0711 | [] | no_license | rushioda/PIXELVALID_athena | 90befe12042c1249cbb3655dde1428bb9b9a42ce | 22df23187ef85e9c3120122c8375ea0e7d8ea440 | refs/heads/master | 2020-12-14T22:01:15.365949 | 2020-01-19T03:59:35 | 2020-01-19T03:59:35 | 234,836,993 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,071 | cxx | TRoot2Html.cxx | /*
Copyright (C) 2002-2017 CERN for the benefit of the ATLAS collaboration
*/
/**
* @file TRoot2Html.cxx
* @brief TRoot2Html implementation
* @author Frank Winklmeier
*
* $Id: TRoot2Html.cxx,v 1.1 2008-07-28 11:02:00 fwinkl Exp $
*/
#include "TrigValTools/TRoot2Html.h"
#include <iostream>
#include <sstrea... |
e1ce5bd3e4df08c4a5476dd13f6f0354c34dc5ed | d14ff1fb06234cc93cf1abb76effaa4321912e18 | /src/elements/trailGroupManager.h | aade94d53db576717303773e3df49f7b4edf879d | [] | no_license | YeongJoo-Kim/RideAndFall-037 | b1f7adb681ddd2c0f846afadf92e3afa6ce8914e | 8554d54c0582f5531e0c5c8554d1f30edada734a | refs/heads/master | 2021-12-03T04:15:33.504583 | 2013-06-05T13:44:14 | 2013-06-05T13:44:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,618 | h | trailGroupManager.h | /*
* trailGroupManager.h
* ofxFernCameraDemo
*
* Created by theo on 28/01/2010.
*
* Copyright Theodore Watson 2010
*
* 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... |
e7bb5b918c35e4222c409feac1efeab619f07d89 | 3ea61f80e1e4b2113523624f0de88457b2669852 | /src/host/vrm3dvision_backup/srv_gen/cpp/include/vrm3dvision/setExposure.h | 7faab3cb858df8f6e205a478d95cec538af17f9a | [] | no_license | rneerg/RoboVision3D | c4f8e05e91702a0df04eeb902771dad52588eb45 | f0293ea5f1aaaf64d4530ac9f0f92a3583b55ef6 | refs/heads/master | 2020-04-18T16:03:55.217179 | 2014-09-04T11:55:03 | 2014-09-04T11:55:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,743 | h | setExposure.h | /* Auto-generated by genmsg_cpp for file /home/jeppe/workspace-d3/robovision3d/host/vrm3dvision/srv/setExposure.srv */
#ifndef VRM3DVISION_SERVICE_SETEXPOSURE_H
#define VRM3DVISION_SERVICE_SETEXPOSURE_H
#include <string>
#include <vector>
#include <map>
#include <ostream>
#include "ros/serialization.h"
#include "ros/bu... |
8f93210fcb4091185bb99c36e9c49c2074e052cf | 020f3a042b20fa2f1ae0b0871b63ddeb3d26b2e4 | /src/lib/GammaPP.cpp | a2dca97dc104c8795f8962740df37c622d333801 | [
"MIT"
] | permissive | bbw7561135/mcray | f19553795a794fd878ced73f611f6e1239d8b402 | 80c2867e70733fb0ea6d30bcc592225c35e01d80 | refs/heads/main | 2023-01-28T04:54:01.226664 | 2020-12-04T23:06:09 | 2020-12-04T23:06:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,293 | cpp | GammaPP.cpp | /*
* GammaPP.cpp
*
* Author:
* Oleg Kalashev
*
* Copyright (c) 2020 Institute for Nuclear Research, RAS
*
* 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, ... |
0ed699129c72412b082396d3427d0bf9fd640ebb | 01b1f86aa05da3543a2399ffc34a8ba91183e896 | /modules/core/trigonometric/include/nt2/trigonometric/functions/scalar/impl/trigo/trig_base.hpp | 3fb9a0818dde29a854408bbe24c47f2a2bb37f8d | [
"BSL-1.0"
] | permissive | jtlap/nt2 | 8070b7b3c4b2f47c73fdc7006b0b0eb8bfc8306a | 1b97350249a4e50804c2f33e4422d401d930eccc | refs/heads/master | 2020-12-25T00:49:56.954908 | 2015-05-04T12:09:18 | 2015-05-04T12:09:18 | 1,045,122 | 35 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 10,460 | hpp | trig_base.hpp | //==============================================================================
// Copyright 2003 - 2012 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2012 LRI UMR 8623 CNRS/Univ Paris Sud XI
//
// Distributed under the Boost Software License, Version 1.0.
// ... |
ae90759c68ac5d1e896720a27266627f3e8fa59a | a5a99f646e371b45974a6fb6ccc06b0a674818f2 | /CondTools/DT/plugins/DTKeyedConfigDBInit.cc | 77a68376b724b69b2b52f565f22b83b9cd490ca1 | [
"Apache-2.0"
] | permissive | cms-sw/cmssw | 4ecd2c1105d59c66d385551230542c6615b9ab58 | 19c178740257eb48367778593da55dcad08b7a4f | refs/heads/master | 2023-08-23T21:57:42.491143 | 2023-08-22T20:22:40 | 2023-08-22T20:22:40 | 10,969,551 | 1,006 | 3,696 | Apache-2.0 | 2023-09-14T19:14:28 | 2013-06-26T14:09:07 | C++ | UTF-8 | C++ | false | false | 1,756 | cc | DTKeyedConfigDBInit.cc | /*
* See header file for a description of this class.
*
* $Date: 2010/06/01 10:34:12 $
* $Revision: 1.3 $
* \author Paolo Ronchese INFN Padova
*
*/
//-----------------------
// This Class' Header --
//-----------------------
#include "CondTools/DT/plugins/DTKeyedConfigDBInit.h"
//--------------------------... |
e99564699b16c2f8a1e657aae1da234defea5156 | b7d366d78820cc9fae661d883d7be7bc83ce8ab1 | /tests/socket_address_unittest.cpp | 89e30d7502c58fa6ba7847e20c362593455dc5be | [
"MIT"
] | permissive | OrigamiKing/ezio | cb7ca87123cac7603c1609b2d2599831204c4ee3 | f448d1d0d42ffb01ab94228e991d70a7230bfbb1 | refs/heads/master | 2020-06-12T00:47:31.825361 | 2019-05-04T09:41:24 | 2019-05-04T09:41:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,226 | cpp | socket_address_unittest.cpp | /*
@ 0xCCCCCCCC
*/
#include "catch2/catch.hpp"
#include <cstring>
#include "ezio/socket_address.h"
namespace {
bool operator==(const sockaddr_in& lhs, const sockaddr_in& rhs)
{
return lhs.sin_family == rhs.sin_family &&
lhs.sin_port == rhs.sin_port &&
lhs.sin_addr.s_addr == rhs.sin_addr.... |
c762755a7c6b80f28ac802b164432340bb10ec57 | 2f5ce9c25bec38659a81f9dd588b604bce974f2f | /glwidget.cpp | bd762ed7042542d8e85099982bb3d9e56d52e983 | [] | no_license | caozhengquan/FaceReconstruction | e90a54fad0394948b99777c44f43bb74ec6ba86f | 3dd849914add9cf3ac1247a79382dd6aee6b286a | refs/heads/master | 2021-01-19T22:44:00.432034 | 2017-03-29T15:08:13 | 2017-03-29T15:08:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,793 | cpp | glwidget.cpp | #include "glwidget.h"
#include <QFileDialog>
//#include <QImage>
GLWidget::GLWidget(QWidget *parent): QOpenGLWidget(parent)
{
this->setMouseTracking(true);
}
void GLWidget::initializeGL()
{
initializeOpenGLFunctions();
glClearColor(0.9f,0.9f,1.0f,10.f);
shader.compile("../Renderer/shader.vert","../Re... |
c4645a9584419a5cb802db42ae67c7372e7c52a0 | 1b1cc0a0d1dba081ee3ed6c6dac774cc58b231bd | /main.cpp | 9272d3795c0fed50536e53b57fb7d8a868b4c5d0 | [] | no_license | DManchevv/KDA | b9beeed3f70a25da62c0ab5360919c473ec10484 | 59d8c3430e49aeb1ec3851df8678222af1def29b | refs/heads/master | 2022-12-24T15:09:53.279835 | 2020-09-26T13:36:01 | 2020-09-26T13:36:01 | 192,762,041 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 294 | cpp | main.cpp | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <fstream>
#include "State.h"
#include "Automat.h"
#include "Menu.h"
#include <sstream>
#include "AutomatContainer.h"
int main() {
Menu menu;
menu.Introduction();
menu.StartMenu();
return 0;
}
|
420eef3bc8a67f797e9a0834e729351b7c30c04b | 7ca7a401c8d313f668b29d4bf9f711ccebc654b9 | /include/openfv/optimization.h | 6c22b52d73dacedff2624189ce20209c4a5564c9 | [] | no_license | leahmendelson/openfv | 84f678eb720da0cfc6290e5cf83fe719accd3752 | 96a42b50431772e3e585eb3185325ef69c441c00 | refs/heads/master | 2021-08-28T03:41:16.725631 | 2017-05-30T03:11:12 | 2017-05-30T03:11:12 | 73,751,035 | 2 | 1 | null | 2016-11-14T22:04:25 | 2016-11-14T22:04:24 | null | UTF-8 | C++ | false | false | 29,979 | h | optimization.h | // IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
// By downloading, copying, installing or using the software you agree to this license.
// If you do not agree to this license, do not download, install,
// copy or use the software.
//
// License Agreement
// ... |
2d007dbf132e592955d6c083af4719ec4d53b060 | 0f4680f1b035096230b70a85f5000c9c54ef2ba2 | /GfxFramework/src/Graffics/DirectXContext/d3d_SwapChain.h | 4e62f943aad8adc4503c5fd3f6165f97153b0bd2 | [
"MIT"
] | permissive | Ohjurot/DirectX-12-Sandbox | 9347deefd3ddbd605aa5452b9295904deb48aa5a | 99f9b033ae00907144b5cf8efb1c3ae46a22dc7a | refs/heads/master | 2023-02-21T14:25:45.482943 | 2021-01-27T17:20:46 | 2021-01-27T17:20:46 | 279,083,537 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 862 | h | d3d_SwapChain.h | #pragma once
#include <Windows.h>
#include <d3d12.h>
#include <dxgi.h>
#include <cassert>
#include <Graffics/gfxCommon.h>
#include <Graffics/DirectXContext/d3d_Device.h>
namespace D3D {
class SwapChain {
public:
// Construct / Destrucy
SwapChain(UINT width, UINT height, HWND windowHandle);
~SwapChain();... |
58f63026d1534c7dace6c6e43d806ac972bae14f | 38715d20f133315f0a9e3b81c54bfa10ab2b088f | /algorithms/erosion/openmp/algorithm_erosion_openmp.h | 6364beb3e1d11f3b8edb21a225197422a60d5139 | [] | no_license | prutskov/PIP | 20bffb0c5fccdf3632f509e189df42393a2d211f | eb54a9ff7951f77a90011c681312957c7633e820 | refs/heads/master | 2022-04-24T20:36:44.555161 | 2020-04-28T18:41:10 | 2020-04-28T18:41:10 | 237,084,779 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 427 | h | algorithm_erosion_openmp.h | #pragma once
#include "../../algorithm.h"
#include "../parameter_erosion.h"
#include <vector>
namespace algorithms
{
namespace erosion
{
namespace openmp
{
class Algorithm : public algorithms::Algorithm
{
protected:
virtual void computeImpl() override;
void pixelCompute(int x, int y, const Frame... |
d08b1a63221799f1b2892e665a2b8dfc275ef653 | 59ed206b49e454d980cb0b483b515ee7119a6237 | /source/test_black_line/test_black_line.cpp | a7c9845c9724e5c68e3d628a398822bf0b39b696 | [] | no_license | Ryosuke1221/Opencv_Apps | 7de5c91c425ead7bb43457909ce37dca0b832d27 | d35e1f7d9568c1fc9e867d801e51da6c864a6f85 | refs/heads/master | 2021-01-02T10:48:15.326207 | 2020-11-22T09:36:45 | 2020-11-22T09:36:45 | 239,586,206 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,255 | cpp | test_black_line.cpp | // Standard includes
#include<stdio.h>
#include<math.h>
#include<string>
#include<vector>
#include<iostream>
#include<fstream>
//OpenCV include
#include<opencv2/opencv.hpp>
#include"TimeString.h"
int main() {
int width_line = 3;
CTimeString time_;
vector<string> filenames_;
string dir_ = "... |
de90ae3b0a3b1118954842c62db309a6778a50fe | 04c4cc99ddcbc20679715351a0ecbcc7207f183c | /Unit 22/PlayCards/PlayCards/rank.cpp | d639b6cf9de29325e80a858177e803ddfa285cb7 | [] | no_license | henrymound/CPlusPlus | 95b9e35f434e328d4a14f609e1c1a43819f06db3 | 4fa093308c9f2d4746a921855c7c85cc39ad3e05 | refs/heads/master | 2021-05-29T05:57:39.063086 | 2015-05-30T21:07:17 | 2015-05-30T21:07:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 222 | cpp | rank.cpp | #include "rank.h"
using namespace std;
const int NUMBER_OF_RANKS = 13;
const string RANK_NAMES[] = {
"Ace",
"Two",
"Three",
"Four",
"Five",
"Six",
"Seven",
"Eight",
"Nine",
"Ten",
"Jack",
"Queen",
"King"
};
|
bd7f80fbb6162e9204c8e8d9ba00996a28f10e7e | 67fd88914a5aaf8daf6c620bc9182d4490ff5ff1 | /Source/MBLab_fBlah_study/fBlahBlueprintFunctionLibrary.cpp | 76ee565e4ce941d8c6ab4f0bf6e1f6f3bf0e752e | [
"CC-BY-4.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | TritonSailor/UE4MBLabCharacterStudy | 6f966aca464fc8e6da0b8ca8001204e6acbf3d97 | 4e0dd75f603f1897fe674b06def4ba7f57115355 | refs/heads/master | 2020-05-01T04:31:18.646813 | 2019-03-15T19:47:37 | 2019-03-15T19:47:37 | null | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 4,415 | cpp | fBlahBlueprintFunctionLibrary.cpp | // © Ajit D'Monte 2019
#include "fBlahBlueprintFunctionLibrary.h"
#include "Runtime/Engine/Classes/Engine/SkeletalMesh.h"
#include "Runtime/Engine/Classes/Animation/SkeletalMeshActor.h"
#include "Runtime/Engine/Classes/Components/SkeletalMeshComponent.h"
TArray<FString> UfBlahBlueprintFunctionLibrary::GetCharacterMor... |
0519b73aee5fe394beb996224cf481f483b9526d | 09c5c4baed3d26701e866be100e4e52d9a34b856 | /StudyAlone/StudyAlone/BOJ1002.h | 68eb2eb4acf8e55dcf008c568e22f737dce3c38a | [] | no_license | sangdo913/Algorithms | 556ac5fc789e35df2f65601e4439caca967edd7b | ee11265895d8ce3314f009df38166defc4b946c7 | refs/heads/master | 2022-09-11T12:00:58.615980 | 2022-07-31T11:11:04 | 2022-07-31T11:11:04 | 116,484,870 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,095 | h | BOJ1002.h | #include<iostream>
#include<cmath>
using namespace std;
#define DIST(x,y) (((x)-(y))*((x)-(y)))
int Do(){
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int tc;
cin >> tc;
while(tc--){
int x1, y1, r1, x2, y2, r2;
cin >> x1 >> y1 >> r1 >> x2 >> y2 >> r2;
if(x1 == x2 &... |
b108fc13619bd253569baa44a235275b3ff63e44 | 947f7337f02133ff894005fa2d1d667a79040b0f | /C++/Complete-Modern-C++/Section04-Classes-and-Objects/src/car.cpp | 88162e0d21883ef62350df2b52b4dd0bc4281c24 | [] | no_license | qelias/Udemy | 34464626f1bcce560f6274188cb479bf090db5dc | 2ddbcd001b371262c6b234e772856bbd1208d7df | refs/heads/main | 2023-03-25T01:42:11.970181 | 2021-03-23T12:15:16 | 2021-03-23T12:15:16 | 318,497,631 | 0 | 0 | null | 2021-03-20T15:36:45 | 2020-12-04T11:36:33 | Jupyter Notebook | UTF-8 | C++ | false | false | 1,123 | cpp | car.cpp | #include "car.h"
#include <iostream>
int Car::totalCount = 0;
Car::Car(){
totalCount++;
fuel = 0;
speed = 0;
passengers =0;
std::cout<<"default constructor"<<std::endl;
}
Car::Car(float amount, float initial_speed, int initial_passengers){
totalCount++;
fuel = amount;
speed = initia... |
6488b3907abb92261574aa085f7a64f7d4877ac6 | d884ddefa3fa70bb6a58b7d12f681bcda28c2ea4 | /roar/render/roRenderDriver.dx11.windows.cpp | 51708120274f46d039df54d65ccf81b950222ca3 | [] | no_license | mtlung/rhinoca | 442e47b552b27088d0ca29b259a4a0ddacd5e8c8 | bc1dfd740c616b548c457dc747733c92240d2b60 | refs/heads/master | 2020-08-21T17:41:46.075103 | 2020-03-14T03:45:59 | 2020-03-14T03:45:59 | 216,207,638 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,582 | cpp | roRenderDriver.dx11.windows.cpp | #include "pch.h"
#include "roRenderDriver.h"
#include "../base/roArray.h"
#include "../base/roCpuProfiler.h"
#include "../base/roLog.h"
#include "../base/roMemory.h"
#include "../base/roStopWatch.h"
#include "../base/roStringHash.h"
#include <dxgi.h>
#include <d3d11.h>
#pragma comment(lib, "d3d11.lib")
#pragma comme... |
66176677648150ce7ed805a18fd89679fc977bef | 6d6f770686212d6bcbcf873f0395fa5308f20ed8 | /OCEAN_SIMULATOR/SIMULATOR/OCEAN2020FOM_simple/Tests/Test_1.cpp | ef295dc043341eedbfda462e3f9c7b46e969ab2a | [] | no_license | SavvasR1991/Marine_vessel_sim | f5ac18ebf64f26aae2ac0cb2163010bdf8c5f0d4 | 49843482c48df092e36d8a488837cdb045ec952c | refs/heads/main | 2023-06-18T14:51:37.975824 | 2021-07-16T07:06:50 | 2021-07-16T07:06:50 | 307,322,910 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 71 | cpp | Test_1.cpp | /*namespace F1
{
void main(int argc, char * argv[])
{
}
}*/ |
ac041e5abeb3d36ae4069132a649b82891d6ac27 | b9d873f27991b5da6e98fcd7be858871e7a286b6 | /CppModule/13-virtual-function/Sample.cpp | 8d1a70b746ea50a1d8dd6f671b4c0e186fa00508 | [] | no_license | yishengma/C-Cpp-Sample | 9eabbca68bcb47fb256f0271dcff09efb9d12d0e | 37c24a308f9fd6bcab26cd92117102fe4df606c8 | refs/heads/master | 2022-11-08T08:08:37.130989 | 2020-06-28T12:00:06 | 2020-06-28T12:00:06 | 268,240,603 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,294 | cpp | Sample.cpp | //
// Created by 海盗的帽子 on 2020/6/1.
//
#include <iostream>
//跟java 的抽象类一个概念
class BaseActivity {
public:
//普通函数
void startActivity(){
initView();
initData();
}
//子类需要继承的
//类似Java中的抽象方法
//纯虚函数
virtual void initData() = 0;
virtual void initView() = 0;
};
class MainActivity... |
24261dec27daca8f1845176c1ed68d2b97575b96 | 8bfa651acc369f1d954510a0c37a0bc6b0c3dba0 | /Prueba2/prog9.cpp | f1610f84e0e85ff2212a53269cb097fb654348eb | [] | no_license | migueruokumura/PAGrupo2SII2019 | adcbce2011f4cf77a5b35f7be07e9b92fd6d9c6d | 877634e3d13f5df6d66b640f217672fb0a1d8e84 | refs/heads/master | 2020-09-03T17:48:59.244607 | 2019-10-31T00:52:26 | 2019-10-31T00:52:26 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 246 | cpp | prog9.cpp | #include <iostream>
using namespace std;
void f1() {
static int i = 100;
i += 1;
cout<<i<<endl;
}
void f2() {
static int i = 100;
i += 1;
cout<<i<<endl;
}
int main() {
f1(); //101
f1(); //101
return 0;
}
|
d85dd504a44214646e767d8f7bb97ecc4fa792be | f9a823c1edded12b7dab9a9490b58969f8fb1e76 | /Flipper/src/Flipper/Log.cpp | b34974f2a7f25c69ac0a27366d7c3f73b18f84d8 | [
"Apache-2.0"
] | permissive | MurraySmith27/FlipperEngine | 2ca856c42dff6366fd5e4d21477eff82ec16325d | 1b52ff7a6bc147cc1e62f3d8c415b9fa9cf43aac | refs/heads/master | 2022-11-15T04:35:54.365464 | 2020-07-05T21:47:33 | 2020-07-05T21:47:33 | 261,017,455 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 582 | cpp | Log.cpp | #include "flpch.h"
#include "Log.h"
namespace Flipper {
std::shared_ptr<spdlog::logger> Log::s_ClientLogger;
std::shared_ptr<spdlog::logger> Log::s_CoreLogger;
void Log::Init() {
spdlog::set_pattern("[%T] %^%n: %v %$ ");
try {
s_ClientLogger = spdlog::stdout_color_mt("FLIPPER_APP");
s_ClientLogger->s... |
9b3785c29360f02f46be98096913887925aa8049 | 1e395205d1c315c269a44c2e465831f862b2a491 | /src/nimbro/behaviour/walk_and_kick/src/wak_vis.cpp | 61efde2e4adc071a3a1f113720bb7a16bb1323f7 | [] | permissive | anh0001/EROS | 01c46f88cc91ef0677b482124b2974790143e723 | a5fae8bf9612cd13fbbcfc0838685430a6fe8fa4 | refs/heads/master | 2021-08-28T00:07:13.261399 | 2021-08-20T08:56:12 | 2021-08-20T08:56:12 | 195,176,022 | 0 | 2 | MIT | 2021-08-20T08:52:12 | 2019-07-04T05:44:14 | null | UTF-8 | C++ | false | false | 14,460 | cpp | wak_vis.cpp | // Walk and kick: Visualisation
// Author: Philipp Allgeuer <pallgeuer@ais.uni-bonn.de>
// Includes
#include <walk_and_kick/wak_vis.h>
// Defines
#define GOAL_HEIGHT 0.80
#define GOAL_DIAMETER 0.12
#define TEXT_FONT_HEIGHT 0.10
#define TEXT_POSZ_MODE (0.39 + 0*0.10)
#define TEXT_POSZ_GAME (0.39 ... |
fe7e92eb7afafb4a4d181adc9f2f886c82a0e03b | f399edede120df020d3e8224dd868846f5d3495b | /1104.cpp | 67658c7800802da5bd92f140b20bf148e7303e1d | [] | no_license | liaojianqi/PAT | c6bb9452cb6d0b3787f33de547ad4c2f70217504 | 47601c1e1acc981aa7c1df7a6ee48c2942cfcfaa | refs/heads/master | 2021-01-21T05:29:47.226954 | 2017-03-01T14:32:35 | 2017-03-01T14:32:35 | 83,200,319 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 329 | cpp | 1104.cpp | #include <cstdio>
typedef long long ll;
const int MAXN=100003;
int n;
double num[MAXN];
double sum;
int main(int argc, char const *argv[]){
freopen("data.txt","r",stdin);
scanf("%d",&n) ;
for(int i=0;i<n;++i){
scanf("%lf",&num[i]);
ll l = i, r = n-1-i;
sum += num[i]*(l*r+l+r+1);
}
printf("%.2f\n",sum);
re... |
8638055d59216d2a244c4ace5258c740771df449 | 108f55773d9ed51097d67a1ac04dde8814c0328f | /src/GeoRestRequestHandler/c_RestResult.cpp | baf98e3138f844464e2c8ad3a64286848ba6358e | [] | no_license | jumpinjackie/georest | 744e0f43963b86dd7ffa9d0820abcd6a576f3755 | 0579e822933b02e087950f652105e9647e5cc48d | refs/heads/master | 2021-01-10T20:50:33.149005 | 2012-02-09T09:45:36 | 2012-02-09T09:45:36 | 32,226,921 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,366 | cpp | c_RestResult.cpp | //
// Copyright (C) 2010 by Haris Kurtagic
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of version 2.1 of the GNU Lesser
// General Public License as published by the Free Software Foundation.
//
// This library is distributed in the hope that it will be useful,
... |
fe1a2e6dd37d6e8536b19863aaa14eb1faf17422 | 7e5be101928eb7ea43bc1a335d3475536f8a5bb2 | /OJ - Codeforces/#298/C.cpp | ca8b43099302a74d40f37bdc803074fbc2b8043e | [] | no_license | TaoSama/ICPC-Code-Library | f94d4df0786a8a1c175da02de0a3033f9bd103ec | ec80ec66a94a5ea1d560c54fe08be0ecfcfc025e | refs/heads/master | 2020-04-04T06:19:21.023777 | 2018-11-05T18:22:32 | 2018-11-05T18:22:32 | 54,618,194 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 914 | cpp | C.cpp | //
//
//
// Created by TaoSama on 2015-04-12
// Copyright (c) 2015 TaoSama. All rights reserved.
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#i... |
539ba85562da35a5071e80fb075d1da315217933 | d6fae196e039fef21c7d4d9da6124e4bd2cc8e28 | /src/ProteinCollection.cpp | 1288529575de32426fc34c39874f0e4bb8a3e994 | [] | no_license | igorfratel/genome_groups | 82aa016d46b5f4b075e5b1a267f03ea4b5440502 | 04608bc2b631285ec3e2e7a5b41be7fdb5a83e6f | refs/heads/master | 2021-09-19T03:55:15.754109 | 2018-07-23T03:29:33 | 2018-07-23T03:29:33 | 111,434,878 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,769 | cpp | ProteinCollection.cpp | /*Undirected edge-weighted graph with adjacency lists implementation*/
#include "ProteinCollection.h"
#include <iostream>
/**
*Creates object with known number of nodes to be added.
*/
ProteinCollection::ProteinCollection(size_t n_nodes)
: nodes(n_nodes), adj(n_nodes) {
}
/**
*Adds node with string identifier.
... |
c2e98810f473f962d50e6b3b6c4390c5aff96ecf | 107d77cadc57cc8ac16e028b37eda389f15cef06 | /term2/projects/p2-unscented-kalman-filter/include/tools.h | 6c89f7d2da7bcfaed450571cd955af9168e2c419 | [] | no_license | phunghx/Udacity-Self-Driving-Car-Nanodegree | de1b818414f589130eaa51dcbed827208403a43a | 805b63a2e9ea49c31382d3092221c7b3ee2042f5 | refs/heads/master | 2021-05-12T07:46:35.782314 | 2017-11-10T15:45:38 | 2017-11-10T15:45:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,218 | h | tools.h | #ifndef TOOLS_H_
#define TOOLS_H_
#include <vector>
#include "Eigen/Dense"
/// \brief Set of common tools required for the project
class Tools
{
public:
/// \brief Computes the Root Mean Squared Error (RMSE) between estimate and
/// ground truth
/// \param estimations estimates
/// \param ground... |
f1dac557c2cb44a25df018dc352f71b0646bb75f | 1d63aa8be17ed966f9e68dddcd9e2cf8a531f25f | /img/patricia.h | 0b6642b06647249f1af2ab78ec5d33dd1292d2ab | [] | no_license | righthandabacus/righthandabacus.github.io | a660593ec46861d8ef5ca1a0bd81486029ba24dc | 9ebec0e3a2274b402fa0ac0d853928229e576bcd | refs/heads/master | 2023-08-10T14:42:45.316247 | 2023-07-22T15:59:52 | 2023-07-22T15:59:52 | 44,995,823 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,722 | h | patricia.h | /* vim:set ts=8 sw=8 filetype=cpp noai nosi cin nu noet nolbr sm sbr=">" ff=unix syntax=cpp noic nowrap: */
/**
* @author
* Copyright 2007 (c) Adrian Sai-wah Tam.
* Released under GNU Lesser General Public Licence
* @date
* Tue Apr 17 14:13:24 HKT 2007
*
* @file
* @brief
* Header file to patricia_cp... |
dd3040ceae059ad7637aa1feb6987cde4086133b | 3fe692c3ebf0b16c0a6ae9d8633799abc93bd3bb | /Contests/NOIP2018#3Day1/kal0rona/pow/pow.cpp | 384792be7d382ceacf9c17786962cdb0ab29c2e8 | [] | no_license | kaloronahuang/KaloronaCodebase | f9d297461446e752bdab09ede36584aacd0b3aeb | 4fa071d720e06100f9b577e87a435765ea89f838 | refs/heads/master | 2023-06-01T04:24:11.403154 | 2023-05-23T00:38:07 | 2023-05-23T00:38:07 | 155,797,801 | 14 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 948 | cpp | pow.cpp | #include <iostream>
#include <cstdio>
#define ll long long
using namespace std;
const int maxq = 1000200;
ll bi[maxq], reses[maxq];
ll a, p, q, k, l, m, c, cur;
ll quick_pow(ll base, ll tim, ll mod)
{
if (base == 1)
return 1;
if (tim == 1)
return base % mod;
ll res = quick_pow(base, tim / 2,... |
c9c02ae39446e7f7479d275b0ef235f5e48e0cab | 96e607f322c33b0d0cbf4548f185301197597312 | /include/Methods.h | 84bc9d4cd2e624e4ee55c704dedc3e27203b69e0 | [] | no_license | Botelho31/SB-Leitor-JVM | 72014368dcc1cfb258b57ce8f114550edb585494 | 2dbeac647744ac4f0c253c2e904b066754f4e2ec | refs/heads/main | 2023-04-24T00:49:45.273039 | 2021-04-25T21:13:30 | 2021-04-25T21:13:30 | 346,366,666 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 497 | h | Methods.h | #ifndef JAVA_H
#include "JavaClass.h"
#endif
#ifndef METHODS_H
#define METHODS_H
#include "Attributes.h"
#include "Method.h"
class Methods{
public:
Methods(FILE* fp, ConstantPool *cp);
~Methods();
std::string get_Method_Flags (uint16_t f... |
a1ce241b0369864f22fd322c7865e8aa6701ca8d | 87a07564aa1b1836443aaa7dafd5e3255f10c711 | /DBWorkTesting/countrymodel.cpp | a1430954a4d7938a2886df7491c17a272874a847 | [] | no_license | lesikv1/qt_with_mysql | 93887cad76868c2d4abe0602ae3e9f76d61bee56 | 1b527389a3c3e2baa6e5acae3ee0e38e49532fbf | refs/heads/master | 2020-09-05T03:46:12.941734 | 2019-11-13T13:26:40 | 2019-11-13T13:26:40 | 219,973,268 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 367 | cpp | countrymodel.cpp | #include "countrymodel.h"
CountryModel::CountryModel()
{
}
CountryModel::CountryModel(QObject *parent, QSqlDatabase db)
{
setTable("country");
setEditStrategy(QSqlTableModel::OnFieldChange);
select();
setHeaderData( 0, Qt::Horizontal,"Id");
setHeaderData( 1, Qt::Horizontal,"Country");
setHea... |
a91b8d45f272f2c69ec60986af23390f8491217c | b6f2d5b89a648da2c6f716da5243a009845b22fe | /CPP/hello_STDLIB/pairMain.cpp | a41bf03a40a729ff86b65d125a1c7f481c061021 | [] | no_license | Lenir/TIL | 71c2b3ee5a1a1447334f3b712dc44e5e9c0bd419 | cf10757bca640b267b2b130a2b5c94896023c9c2 | refs/heads/master | 2023-08-11T21:41:01.092993 | 2023-07-18T01:05:18 | 2023-07-18T01:05:18 | 112,985,712 | 0 | 0 | null | 2023-07-18T01:05:19 | 2017-12-04T02:38:04 | Java | UTF-8 | C++ | false | false | 704 | cpp | pairMain.cpp |
#include "pairMain.h"
using namespace std;
void pair_main(){
vector<pair<int, string> > intStrPairVector;
pair<int, string> intStrPair;
intStrPair.first = 1;
intStrPair.second = "alpha";
intStrPairVector.push_back(intStrPair);
intStrPairVector.push_back(make_pair(2, "beta"));
intStrPairVector.push_back(make_... |
d51186157204fa338492e1bcb51f7f1f5f49092d | 7ca4136090969e6f998886db32d76f1c2b56d125 | /main.cpp | 94171987bc13a369e0a872d3b8706cf9bc1d620f | [] | no_license | AugustInMay/ega | 744d89c40f052bcb2746f6658f6933cbaeb2a6bb | 07e73bdde2d16cac198d5b841250041617701a95 | refs/heads/master | 2020-09-16T15:15:06.964406 | 2019-11-29T17:59:14 | 2019-11-29T17:59:14 | 223,811,233 | 0 | 0 | null | 2019-11-29T21:44:41 | 2019-11-24T21:15:44 | C++ | UTF-8 | C++ | false | false | 15,705 | cpp | main.cpp | #include "crossover.h"
#include "procreator_choice.h"
#include "mutation.h"
#include "selection.h"
#include "stop_condition.h"
#include <fstream>
int factorial(int i){
if (i==0) return 1;
else return i*factorial(i-1);
}
int main() {
srand(time(NULL));
double **R=new double*[15], G_coef, prev_stop_cond... |
ceea67c88bdb7212d5430a621e0ed48567ea2c2c | 421c68830683c56b793a90c528c11040df4644ab | /stack_using_linked_list.cpp | 91f65b631a6d53ed924704ba9bc27c990d0581cc | [] | no_license | nitesh038/data_structure_and_algorithm | a27fce1c455ecec91f2b2082dd7797eb7f5a65e3 | 3588c38c60d8caf31e400b7566047e09fdb95aec | refs/heads/master | 2023-05-28T05:42:28.958480 | 2021-06-16T19:25:36 | 2021-06-16T19:25:36 | 320,923,224 | 1 | 0 | null | 2020-12-20T18:07:02 | 2020-12-12T21:01:09 | C++ | UTF-8 | C++ | false | false | 2,349 | cpp | stack_using_linked_list.cpp | //Important Link - https://www.geeksforgeeks.org/passing-reference-to-a-pointer-in-c/
#include<iostream>
struct Node
{
int data;
struct Node* next;
};
bool isEmpty(struct Node* top)
{
if(top==NULL)
return true;
return false;
}
bool isFull(struct Node* t)
{
if(t==NULL)
return tru... |
f75fb9a72ca637ac6f8863ab1ccb0f4e5725828d | 010279e2ba272d09e9d2c4e903722e5faba2cf7a | /contrib/python/pythran/pythran/xsimd/types/xsimd_generic_arch.hpp | 6aaee93393e05907a0b4e2de64f4c8b1f0648060 | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | catboost/catboost | 854c1a1f439a96f1ae6b48e16644be20aa04dba2 | f5042e35b945aded77b23470ead62d7eacefde92 | refs/heads/master | 2023-09-01T12:14:14.174108 | 2023-09-01T10:01:01 | 2023-09-01T10:22:12 | 97,556,265 | 8,012 | 1,425 | Apache-2.0 | 2023-09-11T03:32:32 | 2017-07-18T05:29:04 | Python | UTF-8 | C++ | false | false | 2,113 | hpp | xsimd_generic_arch.hpp | /***************************************************************************
* Copyright (c) Johan Mabille, Sylvain Corlay, Wolf Vollprecht and *
* Martin Renou *
* Copyright (c) QuantStack *
* Copyri... |
443f0b2e3678808c7ae223c78d639aecf7b4aedc | e811bbeed7e1c8b66967f5ba3d41bb96ebd85c46 | /src/salamander.hpp | 64ea5c41916acbc5a18167b05ff83f3c9a2d06fc | [] | no_license | r-barnes/BarnesClark2017-Salamanders | 0f8ea5136b837841fadd3408f3d6a5c9a00b64f9 | b3d5636f644688a04604108dad4a0fde024c07c0 | refs/heads/master | 2021-01-20T02:37:41.842391 | 2017-10-19T19:12:52 | 2017-10-19T19:12:52 | 80,172,174 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,438 | hpp | salamander.hpp | #ifndef _salamander
#define _salamander
#include "params.hpp"
#include <cstdint>
#include <bitset>
class Salamander {
public:
///Gene Type - used for storing genetic information that is used to
///determine whether individuals are of the same species, based on a bitwise
///comparison of the binary expression o... |
c8ee955909e09534c09e206f306b226c03d3935c | 8ac089df03caa28f051872e63a4bfeca8c7d9e3b | /ZViewer/ZViewer/src/SelectToFolderDlg.h | 4ca3b156c1a3cc05ad7dba987b9cbaa1c5e38238 | [] | no_license | zelon/ZViewer | ecdd8cff618a10620e4fa14698c6f479e3028ba9 | baad184793737e8c8f291e90426d6d509585d6c3 | refs/heads/master | 2022-01-18T11:55:56.858852 | 2022-01-02T02:56:33 | 2022-01-02T02:56:33 | 3,062,306 | 7 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 537 | h | SelectToFolderDlg.h | #pragma once
/// class for selecting a directory
class CSelectToFolderDlg final
{
public:
CSelectToFolderDlg(const tstring & initaliDir = L"");
~CSelectToFolderDlg();
/// 다이얼로그를 화면에 띄운다.
bool DoModal();
const tstring & GetSelectedFolder() const { return m_strSelectedFolder; }
static INT_PTR CALLBACK MoveToDl... |
96e8c1b3ad2d79c66c289d5d83b2e2e1e194d6c6 | 6c0e8a23af93c38dc9d62b43fb3b96d952a85c21 | /hello/valera2.cpp | 34d951bb02d4d60990361f11d5164a748625ceff | [] | no_license | Bernini0/Codes | 9072be1f3a1213d1dc582c233ebcedf991b62f2b | 377ec182232d8cfe23baffa4ea4c43ebef5f10bf | refs/heads/main | 2023-07-06T13:10:49.072244 | 2021-08-11T17:30:03 | 2021-08-11T17:30:03 | 393,320,827 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 947 | cpp | valera2.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int y, k, n;
scanf("%d %d %d", &y, &k, &n);
int e = k;
int b = y % k;
int c = n / k;
int d = 0;
int f = (n - y) / k;
if (k > n)
{
printf("-1\n");
return 0;
}
else if (y >= n)
{
printf("-1\n... |
9bfc03928e7eb849b2c2344fdcce42640216c663 | 06c50c8d6d1cf3d2a19410ab3a7e56083e83aef4 | /include/xne/domains/inet/utility.h | 236bad589ad79f5f6d4f72ef06a6763762283b0f | [
"MIT"
] | permissive | codacy-badger/xne | 8fbff5d2d64d572c766d088d97ebd82bf14a92e1 | f857f237b523becc3ab9c9db145c63c2c60bfc3c | refs/heads/master | 2020-04-22T21:50:20.390271 | 2019-02-12T11:55:22 | 2019-02-12T11:55:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 704 | h | utility.h | /**
* @file utility.h
* @author isnullxbh
* @date 2019-02-12 15:26
* @version 0.0.1
*/
#ifndef XNE_DOMAINS_INET_UTILITY_H
#define XNE_DOMAINS_INET_UTILITY_H
#include <string>
#include "xne/core/basic_protocol.h"
#include "xne/domains/inet/address_base.h"
namespace xne {
namespace net {
namespace inet ... |
b8e86f8b9b9f817c995049fc6b91ddced6936bf4 | 726df6fc883aa216b81f8e0682ec427febdbf89d | /PTKeyEventInterfaces/PtKeyEventInterface.h | 51ca69d61124393b06133015acdd4b7bcf65d8bd | [] | no_license | Qmax/QUTE | 48ac34384885558ea4f6310f122b2e4f6450853d | 09d65671d4280d6cd9b9f97243846708d7968cff | refs/heads/master | 2021-01-01T05:33:53.379760 | 2014-12-04T11:38:05 | 2014-12-04T11:38:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,390 | h | PtKeyEventInterface.h | #ifndef GPIOEVENTINTERFACE_H
#define GPIOEVENTINTERFACE_H
#include<QtCore>
#include<PTEventInterfaces.h>
#include <QtGui>
#include <QWSKeyboardHandler>
#include <string.h>
#include "/usr/local/DigiEL-5.6/kernel/linux-2.6.31/include/linux/input.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <un... |
4803e54cec24021d6078d2e3456a03530427be2c | 48dfc3cd5f400a7d3426281d3f2664d46ec71dbe | /Traffic_Simulation_Graphical/Light.cpp | bda67c708b6ac29b596a1e3b9966abdb839f2d33 | [] | no_license | Harsha-G/Traffic_Simulation_Cpp_MFC | 21292f11f11d91a573cef310fe6778bab82c084d | ef5ccbf53966f7296e58db1fffe257dd69081f34 | refs/heads/master | 2020-03-31T06:56:52.186537 | 2018-10-08T02:49:06 | 2018-10-08T02:49:06 | 152,000,995 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 168 | cpp | Light.cpp | #include "stdafx.h"
//#include "Header.h"
//
//Light::Light() {
// state = false;
//}
//
//void Light::toggle() {
// state = (state == true)? false : true;
//} |
d50501c128d8df9471e0a7d6f6775051ae0921d3 | 703e2a29617917491f33bd9047dbef5c14eb7a04 | /src/game/map/tiletemplate.h | ba4501761dbed7c7ae11a0f2919d8d512f94ecfb | [] | no_license | mcdooda/crispy-guacamole | 83a020894431c20e80b32ef1044f50c774ad840a | d6265fa79b95647ed1736f7116356a39dd6a1c7f | refs/heads/master | 2023-01-13T15:10:38.684785 | 2023-01-02T19:37:21 | 2023-01-02T19:37:21 | 62,343,659 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,491 | h | tiletemplate.h | #ifndef GAME_MAP_TILETEMPLATE_H
#define GAME_MAP_TILETEMPLATE_H
#include <string>
#include "texturepack.h"
#include "navigability.h"
namespace game
{
class Game;
namespace map
{
class TileTemplate
{
public:
TileTemplate(const std::filesystem::path& path, Game& game);
~TileTemplate();
inline std::filesystem:... |
9189aa86d0dea97c136cf0afa818dfc3e44fc731 | 7cb0393186494b56be1471475ed26fa72e9e1092 | /third-party/JCQP/CholeskyDenseSolver.cpp | 2872164d72603c461ac7454e3ede9ce77fda3888 | [
"MIT"
] | permissive | Sorokonog/Cheetah-Software | 15b5ee6b9a92b051d0b2f710234cfef829532c81 | e2a7f0521412be129ca114a9545636bc3e20f186 | refs/heads/master | 2022-02-11T14:46:45.286293 | 2021-12-25T07:36:33 | 2021-12-25T07:36:33 | 235,743,673 | 1 | 2 | MIT | 2021-12-24T20:10:52 | 2020-01-23T07:19:52 | C++ | UTF-8 | C++ | false | false | 10,988 | cpp | CholeskyDenseSolver.cpp | /*!
* @file: CholeskyDenseSolver.cpp
*
* Dense Cholesky Solver.
*/
#include "CholeskyDenseSolver.h"
#include "Timer.h"
#include <cassert>
#include <iostream>
#include <immintrin.h>
static constexpr s64 UNROLL_MATVEC = 8; //! Loop unroll for all inner loops, AVX2 only
/*!
* Perform initial factorization
*/
temp... |
918c2ce112e70beb52d5cd30b78bd2bdf328cb40 | 7dbad8f9f2269476c8883ae9c4e23d53d4e5bbda | /games/game_over/game_stats_2.cpp | 1c8f93a6697a7ea225041138c89db902c81009c4 | [] | no_license | Geschoss/beginning-c-plus-plus | 422cf6c707eece4d3f33617d61a7d7c83b5351fb | a28806c29f308fe43df83cc290790a62ac6fb649 | refs/heads/master | 2022-03-09T18:28:11.657722 | 2022-01-22T09:25:31 | 2022-01-22T09:25:31 | 232,835,657 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 701 | cpp | game_stats_2.cpp | // Программа Game Stats 2.0
// Демонстрирует арифметические операции с переменными
#include <iostream>
using namespace std;
int main() {
unsigned int score = 5000;
cout << "score: " << score << endl;
// изменение значения переменной
score = score + 100;
cout << "score: " << score << endl;
// ко... |
7ff53fad160e457d60ce22f52f47f5946cfe8e56 | a6c929e04d6248dc46358e33e6de95dc77169e06 | /Minigin/ColliderComponent.cpp | f69d3d3b3a00d1828c3088f7c591dc41e4ff8cdf | [] | no_license | StijnMaris/GameEngine-DigDug | ef3f010c598a78023ffa180fe7239cbceb808334 | f025a1b77e2de53804b45611335d2054804f6928 | refs/heads/master | 2020-04-29T19:03:29.898193 | 2019-05-26T21:46:57 | 2019-05-26T21:46:57 | 176,342,545 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,078 | cpp | ColliderComponent.cpp | #include "MiniginPCH.h"
#include "ColliderComponent.h"
#include "GameObject.h"
dae::ColliderComponent::ColliderComponent(std::shared_ptr<Transform> transform, SDL_Rect rect) :BaseComponent("ColliderComponent"), m_pTransformComponent(transform)
{
SetColliderRect(rect);
}
dae::ColliderComponent::~ColliderComponent()
{... |
771724e956ed5b00b603e5a90eeaa96e2eb25f7d | f4e854b53e2da2f6e4d5ed5e76911281577efb29 | /zad3-zalazek/src/main.cpp | d7c6cb6d60d55a810ac6931c177f8f80fac29b75 | [] | no_license | Marcel129/Uklad_rownan_liniowych | 4078bde6299d6525c53a29db1b4a99305ede4346 | b5d0a086d2bd032651f251c05dc0e97e737abf39 | refs/heads/master | 2021-04-16T16:58:30.760416 | 2020-04-19T20:52:34 | 2020-04-19T20:52:34 | 249,371,664 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 752 | cpp | main.cpp | #include <iostream>
#include "Wektor.hh"
#include "Macierz.hh"
#include "UkladRownanLiniowych.hh"
#include "rozmiar.h"
using namespace std;
int main(int argc, char **argv)
{
if (argc < 2)
{
cout << endl;
cout << "Nie wskazano pliku z bazą danych." << endl;
exit(1);
}
fstream baza_pytan;
baza_p... |
95fe05cffaf659c64741dadecf56315d50149a06 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_1674486_1/C++/isti757/DiamondInheritance.cpp | c5275b0d3d508a596976405c01754dc006c291a6 | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 1,216 | cpp | DiamondInheritance.cpp | #include <vector>
#include <stdio.h>
#include <string>
#include <iostream>
#include <algorithm>
#include <numeric>
using namespace std;
bool bfs(vector<vector<int> > &edges, vector<bool> &vis, int n) {
if(vis[n]) {
return true;
}
else {
vis[n] = true;
for(int i = 0; i < edges[n].s... |
b91d81201886154b1908377afe7fa7eb636f1983 | fdfeb3da025ece547aed387ad9c83b34a28b4662 | /Simple/CCore/inc/Timer.h | f70550d2839119f2db240114ce9c87e33992a300 | [
"FTL",
"BSL-1.0"
] | permissive | SergeyStrukov/CCore-3-xx | 815213a9536e9c0094548ad6db469e62ab2ad3f7 | 820507e78f8aa35ca05761e00e060c8f64c59af5 | refs/heads/master | 2021-06-04T05:29:50.384520 | 2020-07-04T20:20:29 | 2020-07-04T20:20:29 | 93,891,835 | 8 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,821 | h | Timer.h | /* Timer.h */
//----------------------------------------------------------------------------------------
//
// Project: CCore 3.00
//
// Tag: Simple Mini
//
// License: Boost Software License - Version 1.0 - August 17th, 2003
//
// see http://www.boost.org/LICENSE_1_0.txt or the local copy
//
// Copyrigh... |
0d2278f7752714b73f1d00b201ef5065257d4bb5 | 8741a8e1fa4c910f47c1246fd11411fa36029578 | /MySolution/Project/Tool/Pdbt_Common.h | 290bc4c9f41ed8233278171d30621a0f14e11e9a | [] | no_license | liwenlang/MyMFC | 36b38198908c712fa366b24baeefa0f70825d874 | 2fb1ccddbdd57de8585f55adc486859e240532a5 | refs/heads/master | 2023-02-26T01:08:09.172756 | 2021-01-27T09:19:22 | 2021-01-27T09:19:22 | 268,955,339 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,309 | h | Pdbt_Common.h |
#pragma once
#include "Source/Pdbt_Db_Connect.h"
/**
* @brief 该模块的公用 常量和函数定义
*
*
* @author liwenlang
* @version v1.0
* @date [2012-7-30]
* @note
*/
namespace pmdbtool
{
const CString g_strComParamSet_Total = _T("施工安全参数(全国)") ;
const CString g_strComParamSet_Global = _T("绘制顺序") ;
enum Table... |
25fd70eeb5d63845b14b2d121eb4defe45ad39bd | 3b526f8b3b699818434a45a64f2ab149b0088156 | /main.cpp | a60f2f46b68754a781403f3cc06332139c5bc272 | [] | no_license | Ariionex/Database | f2cc535539e7a59e10b559a9b282161abe0d9e74 | c3cfc5ea169614ab03e1d31f3b57b962546c43f2 | refs/heads/master | 2020-04-23T11:31:56.145541 | 2019-03-10T09:59:40 | 2019-03-10T09:59:40 | 171,139,587 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 981 | cpp | main.cpp | #include <iostream>
#include "Student.hpp"
#include "Database.hpp"
using namespace std;
int main()
{
Database db;
Person* jan = new Student("Jan","Kowalski","Fiolkowa 5","1234567890",Gender::male,166666);
db.addStudent(jan);
Person* adam = new Student("Adam","Adamski","Dziwna 10","0987654321",Gender::... |
61a3d4b4298f3522490c870a14c30b5cc4523c78 | e9786f00a5f9e59f1604f405bba535104926439f | /Framework/Sources/o2/Scene/ISceneDrawable.h | 38eee5b802a42c7828e41aa6677ce9a17ce121ae | [
"MIT"
] | permissive | brucelevis/o2 | 0953532f270736c5b3fbb31fabc0ab72f1ddf8d0 | 29085e7c3ba86a54aacfada666adea755ea7b1ee | refs/heads/master | 2023-09-02T04:48:48.716244 | 2021-11-07T17:07:30 | 2021-11-07T17:07:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,207 | h | ISceneDrawable.h | #pragma once
#include "o2/Render/IDrawable.h"
#include "o2/Utils/Property.h"
#include "o2/Utils/Serialization/Serializable.h"
#if IS_EDITOR
#include "o2/Utils/Editor/SceneEditableObject.h"
#endif
namespace o2
{
class SceneLayer;
// ------------------------------------------------------------------
// Scene drawa... |
b203d67f92c470abb8c9e9f9f7ccd462f10ceb67 | e837d14a409a8e64aa73013588edceb24a054131 | /types/includes/schema_common.h | 2b2575c132231a8c748fbbd5405134913565e4db | [
"Apache-2.0"
] | permissive | subhagho/ReactFS | 9c6f467fb82706965a24a37c8eae741360d2b2d2 | d8b7cab144ca104abda2a7abb5bbf510e4185738 | refs/heads/master | 2021-01-12T15:25:34.052691 | 2017-03-16T06:06:26 | 2017-03-16T06:06:26 | 71,780,597 | 3 | 1 | null | 2017-01-16T05:36:58 | 2016-10-24T11:05:59 | C++ | UTF-8 | C++ | false | false | 25,866 | h | schema_common.h |
/*
* Copyright [2016] [Subhabrata Ghosh]
*
* 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... |
ce0e595e854d472ad7758ea0b981dfb7a4c6aa3a | 3f22b88662bd1ae5962b3d6734d5ecfa75d5c2c9 | /Classes/SettingsScene.cpp | bc54508a949969f3812fea349d2c20e586762580 | [] | no_license | INTO250/Block_X_Breaker | d10657450baec4c4c5b4b5a9a87000c4672bd3d7 | 5629c8eedf2700536013d3f7874575cfe3ba7c80 | refs/heads/main | 2023-05-30T21:20:41.241946 | 2021-06-20T09:27:13 | 2021-06-20T09:27:13 | 363,011,371 | 1 | 2 | null | 2021-06-18T02:09:01 | 2021-04-30T03:05:28 | C++ | GB18030 | C++ | false | false | 4,589 | cpp | SettingsScene.cpp | #include "MenuScene.h"
#include "SettingsScene.h"
#include "AudioEngine.h"
USING_NS_CC;
extern int BGM;
extern float volumeSound;
std::string IPAddr = "192.168.224.76";
#define BG_HEIGHT 1404
cocos2d::Scene* SettingsScene::createScene()
{
return SettingsScene::create();
}
bool SettingsScene::init()
{
if (!Scene::... |
4ddbb3419e2eed57d687f7ede74ef7549c8fac7d | b01299f1d8972949863b3862ac6b83da580d443f | /lib/curl/test/webkit-inspector.cpp | d62f1ead8729a23ce92b6ebad80d87c27e688771 | [] | no_license | neophytos-sk/phigita-star | daf170f29212f601270c8182ffb1835163485efe | dd48dc5f5768acb199c3ee2866d01efb4ef98f8a | refs/heads/master | 2021-01-25T10:21:12.039782 | 2016-02-24T09:50:28 | 2016-02-24T09:50:28 | 35,161,947 | 3 | 2 | null | 2023-03-20T11:47:34 | 2015-05-06T14:01:52 | HTML | UTF-8 | C++ | false | false | 1,094 | cpp | webkit-inspector.cpp | /*
* =====================================================================================
*
* Filename: webkit-inspector.cpp
*
* Description:
*
* Version: 1.0
* Created: 02/12/2014 09:28:23 AM
* Revision: none
* Compiler: gcc
*
* Author: Neophytos Demetrio... |
6518f3038e96a782b5228ed565360d035b88ff20 | 6f224b734744e38062a100c42d737b433292fb47 | /libc/src/unistd/unlink.h | 1119bfad7dbc533510e9e9993c7744472475f98c | [
"NCSA",
"LLVM-exception",
"Apache-2.0"
] | permissive | smeenai/llvm-project | 1af036024dcc175c29c9bd2901358ad9b0e6610e | 764287f1ad69469cc264bb094e8fcdcfdd0fcdfb | refs/heads/main | 2023-09-01T04:26:38.516584 | 2023-08-29T21:11:41 | 2023-08-31T22:16:12 | 216,062,316 | 0 | 0 | Apache-2.0 | 2019-10-18T16:12:03 | 2019-10-18T16:12:03 | null | UTF-8 | C++ | false | false | 571 | h | unlink.h | //===-- Implementation header for unlink ------------------------*- C++ -*-===//
//
// 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
//
//===---------------------------... |
31c637fa8025c2eff21924567ce699213c1587b2 | 37ffd116535acab191da2b4c62dfd58868f8287b | /palindrome_number/solution.cpp | 65471a66699ceca91e18a3f9b0c37c34de24e7bf | [] | no_license | huwenboshi/leetcode_exercises | c1a494dd4452d2644d21d7bb337f8b268508df17 | 73bb1741070b50b7729afe7e2edb79d224b2a6d4 | refs/heads/master | 2019-06-24T14:20:27.149089 | 2016-08-30T06:43:08 | 2016-08-30T06:43:08 | 66,914,041 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 901 | cpp | solution.cpp | #include <iostream>
using namespace std;
class Solution {
public:
bool isPalindrome(int xin) {
long long int x = xin;
if(x < 0) {
return false;
}
long long int x_tmp = x;
long long int num_digit = 0;
while(x_tmp > 0) {
x_tmp /= 10;
... |
594738b9ba3f7cb1f1a26c240dfb475c3db74ad4 | b65db772bb0d59bb9f21f77f048ad3e09cfb75ec | /DX12Lib/src/UnorderedAccessView.cpp | e5883aa5913e823b7f9cb2c88b31960be04dbe1e | [
"MIT"
] | permissive | jpvanoosten/LearningDirectX12 | 8a0cadd4e72f5da8d79fe25dc1febaedbe09bf41 | 49eb021f6a6f538e3b6001fd8f9b7108d2900751 | refs/heads/main | 2023-08-07T16:53:45.507006 | 2023-04-26T11:47:45 | 2023-04-26T11:47:45 | 101,299,944 | 531 | 89 | MIT | 2021-01-22T15:06:50 | 2017-08-24T13:49:45 | CMake | UTF-8 | C++ | false | false | 1,379 | cpp | UnorderedAccessView.cpp | #include "DX12LibPCH.h"
#include <dx12lib/UnorderedAccessView.h>
#include <dx12lib/Device.h>
#include <dx12lib/Resource.h>
using namespace dx12lib;
UnorderedAccessView::UnorderedAccessView( Device& device, const std::shared_ptr<Resource>& resource,
const std::shared_ptr<Res... |
2ba6f816be30608ce59dd541660cc69a8783c1ff | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/CMake/CMake-gumtree/Kitware_CMake_repos_basic_block_block_20682.cpp | 474be1c3ebceeafb0cc7849d4f1824b0c092cdce | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 669 | cpp | Kitware_CMake_repos_basic_block_block_20682.cpp | {
DWORD arg_len;
/* Convert argument to wide char. */
arg_len = MultiByteToWideChar(CP_UTF8,
0,
*arg,
-1,
temp_buffer,
(int) (dst + dst_l... |
5af2b2b41281f47a3b054054bcf94f286ab259a9 | 31f5cddb9885fc03b5c05fba5f9727b2f775cf47 | /engine/modules/box2d/box2d_joint_motor.cpp | 1ac922fda1bf4134316b57e02db56e1805bf8827 | [
"MIT"
] | permissive | timi-liuliang/echo | 2935a34b80b598eeb2c2039d686a15d42907d6f7 | d6e40d83c86431a819c6ef4ebb0f930c1b4d0f24 | refs/heads/master | 2023-08-17T05:35:08.104918 | 2023-08-11T18:10:35 | 2023-08-11T18:10:35 | 124,620,874 | 822 | 102 | MIT | 2021-06-11T14:29:03 | 2018-03-10T04:07:35 | C++ | UTF-8 | C++ | false | false | 216 | cpp | box2d_joint_motor.cpp | #include "box2d_joint_motor.h"
namespace Echo
{
Box2DJointMotor::Box2DJointMotor()
{
}
Box2DJointMotor::~Box2DJointMotor()
{
}
void Box2DJointMotor::bindMethods()
{
}
}
|
02fafd629a8fd293a9cf55e60bb4bcaf1d3ce57b | dcc8aaadc3a0a9dc62c4d2b87f34b64fab9cb313 | /userInterface.h | 5e5b50ea6fee7657c8ec2ff0b871d74553b0b596 | [] | no_license | Crinnion0/PrisonerDilemma | 510d470d1e2a6cb51b8bd6482eec98f18efe9fd3 | 57deef95cd6dde12a63550673259cd2bbb5ccba3 | refs/heads/master | 2020-03-10T01:49:08.552066 | 2018-04-11T16:08:27 | 2018-04-11T16:08:27 | 129,120,235 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 742 | h | userInterface.h | #pragma once
#include <iostream>
#include <string>
#include "strategy.h"
using namespace std;
class userInterface
{
public:
userInterface();
~userInterface();
void get_welcome() const;
string get_fileLocation();
string gameOrTournament() { return "Game (1) or Tournament?\n"; }
void setIteration();
int getI... |
c5a3e28a2f2fc040b54c7af3b938d67d4f9240d6 | 88ae8695987ada722184307301e221e1ba3cc2fa | /third_party/vulkan-deps/vulkan-validation-layers/src/layers/stateless/sl_instance_device.cpp | 28f2b23eb32c63c83ac6d895a24281095ade6735 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0",
"LGPL-2.0-or-later",
"MIT",
"GPL-1.0-or-later",
"BSD-3-Clause"
] | permissive | iridium-browser/iridium-browser | 71d9c5ff76e014e6900b825f67389ab0ccd01329 | 5ee297f53dc7f8e70183031cff62f37b0f19d25f | refs/heads/master | 2023-08-03T16:44:16.844552 | 2023-07-20T15:17:00 | 2023-07-23T16:09:30 | 220,016,632 | 341 | 40 | BSD-3-Clause | 2021-08-13T13:54:45 | 2019-11-06T14:32:31 | null | UTF-8 | C++ | false | false | 51,793 | cpp | sl_instance_device.cpp | /* Copyright (c) 2015-2023 The Khronos Group Inc.
* Copyright (c) 2015-2023 Valve Corporation
* Copyright (c) 2015-2023 LunarG, Inc.
* Copyright (C) 2015-2023 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You m... |
717cdae19b954106e78395ccffbea0002fce9475 | c2dce5941201390ee01abc300f62fd4e4d3281e0 | /include/cetty/util/StringUtil.h | 404bb77158a0049392480e5da5c5c3c49267c4df | [
"Apache-2.0"
] | permissive | justding/cetty2 | 1cf2b7b5808fe0ca9dd5221679ba44fcbba2b8dc | 62ac0cd1438275097e47a9ba471e72efd2746ded | refs/heads/master | 2020-12-14T09:01:47.987777 | 2015-11-08T10:38:59 | 2015-11-08T10:38:59 | 66,538,583 | 1 | 0 | null | 2016-08-25T08:11:20 | 2016-08-25T08:11:20 | null | UTF-8 | C++ | false | false | 17,167 | h | StringUtil.h | #if !defined(CETTY_UTIL_STRINGUTIL_H)
#define CETTY_UTIL_STRINGUTIL_H
/*
* Copyright (c) 2010-2011 frankee zhou (frankee.zhou at gmail dot com)
*
* Distributed under 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... |
dd94c8c4b01c8fb905c41c022708bb48d06f218f | 4fcde4ed2ae1901e580fc40e7b84a546e33be0f9 | /src/type_info/LF_ARGLIST.cc | 1470f2acf2b2ba694130a34717efe87cdb4922e5 | [
"Apache-2.0"
] | permissive | sradigan/libmspdb | 18e99934c0098edf60089b8716e35ca209040e5a | 31283565f18fd32e27717e7e0180b9c27f44d824 | refs/heads/main | 2023-03-23T10:41:10.849046 | 2021-03-17T17:24:49 | 2021-03-17T17:26:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,552 | cc | LF_ARGLIST.cc | /*
* Copyright 2021 Assured Information Security, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by a... |
5c764f01412e556b0ee15098cada2d10c9129c2b | ce434fc49f92c3b0bfefbf59e18adc7ed5ac59cf | /OpenMQ135/OpenMQ135.cpp | 7e5264d03bc94f23d302d55055646623e52bf209 | [] | no_license | tantt2810/OpenSensor | 19959d8f0892105962d7257f0386d91370f8fc3e | 9648ec98c03e7e341f62f30434b11fa6b3df5942 | refs/heads/master | 2021-01-21T13:14:14.935657 | 2016-05-26T07:40:03 | 2016-05-26T07:40:03 | 52,935,719 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 6,448 | cpp | OpenMQ135.cpp | #include <OpenMQ135.h>
/****************** OpenMQ135 ****************************************
Contruction function: you must declare your analog pin that you use in the parameter
************************************************************************************/
OpenMQ135::OpenMQ135(int analogpin): OpenSensor(ana... |
9b23927f4ab35ff3d73720bb815f606183c72000 | 283d132555b4bd323797c23cd17b6f6008ec1853 | /tensorflow/core/user_ops/gpu_cholesky.cu.cc | 4399d19604d7733f09120c58792eb03b87936246 | [
"Apache-2.0"
] | permissive | c0g/tomserflow | a0905e8087b1b793e7b9000e3ba16fba16a30875 | f7b42f6ba58c3ff20ecd002535d2cca5d93bcf8e | refs/heads/master | 2022-12-23T00:42:41.532096 | 2016-10-18T07:12:32 | 2016-10-18T07:12:32 | 71,149,479 | 0 | 1 | Apache-2.0 | 2022-12-08T01:50:36 | 2016-10-17T14:51:45 | C++ | UTF-8 | C++ | false | false | 453 | cc | gpu_cholesky.cu.cc | // /* Copyright 2016 Tom Nickson. All rights reserved. */
#if GOOGLE_CUDA
#define EIGEN_USE_GPU
#include "third_party/eigen3/unsupported/Eigen/CXX11/Tensor"
#include "tensorflow/core/user_ops/cuda_matrix_helper_impl.h"
typedef Eigen::GpuDevice GPUDevice;
// Instantiate the GPU implementation for GPU number types.
tem... |
788078228b4b7df897c28223c24576c4f5744031 | 0d86675d6f69836db9a7cd5244ebc7307d7f997a | /open_spiel/games/universal_poker/logic/card_set.h | aa6c792362f570769d02d23d11fc4ed63e65536e | [
"LicenseRef-scancode-generic-cla",
"Apache-2.0"
] | permissive | sarahperrin/open_spiel | a7a4ecde1156b458d144989d3d7ef1814577741b | 6f3551fd990053cf2287b380fb9ad0b2a2607c18 | refs/heads/master | 2021-12-25T04:12:19.270095 | 2021-12-09T16:17:43 | 2021-12-09T16:17:43 | 235,547,820 | 3 | 0 | Apache-2.0 | 2020-01-22T10:17:41 | 2020-01-22T10:17:40 | null | UTF-8 | C++ | false | false | 2,444 | h | card_set.h | // Copyright 2019 DeepMind Technologies Ltd. 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 require... |
3a4e836a476f0f0b3721b66a338bc6c35ca52acd | e5091c3a8477fa12e1adfdb1f3d826eb6e9bb2be | /Other/ivan_and_mega_queries.cpp | 09d5a9ca1b6e52bef34dcf48eba9b6357b904560 | [] | no_license | leonardoAnjos16/Competitive-Programming | 1db3793bfaa7b16fc9a2854c502b788a47f1bbe1 | 4c9390da44b2fa3c9ec4298783bfb3258b34574d | refs/heads/master | 2023-08-14T02:25:31.178582 | 2023-08-06T06:54:52 | 2023-08-06T06:54:52 | 230,381,501 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,955 | cpp | ivan_and_mega_queries.cpp | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
const int LOG = 25;
struct SparseTable {
private:
int n;
vector<vector<int>> mx;
public:
SparseTable(int n, vector<int> &a) {
this->n = n;
mx.assign(LOG, vector<int>(n + 1));
for (int i = 1; i <= n; i++)
... |
23785f57a0f11f851712e7a48a5f221e621bd7d8 | 3ea34c23f90326359c3c64281680a7ee237ff0f2 | /Data/912/E | 221aa87f181e5e26c39b86b5490e89a8c657c873 | [] | no_license | lcnbr/EM | c6b90c02ba08422809e94882917c87ae81b501a2 | aec19cb6e07e6659786e92db0ccbe4f3d0b6c317 | refs/heads/master | 2023-04-28T20:25:40.955518 | 2020-02-16T23:14:07 | 2020-02-16T23:14:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 80,905 | E | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | foam-extend: Open Source CFD |
| \\ / O peration | Version: 4.0 |
... | |
4d26892cec91c94025016176317a18fc3669be6b | b92e8dad9915de1d875abf1da1350ee8e21b6ca6 | /homwok/Assignment_4/Gaddis_8thED_Chap5_Prob05/main.cpp | edabeaa46496c144d918ca85f18a82d467c3b578 | [] | no_license | bassamelsaleh/ElsalehBassam_csc5_42892 | 33cc5e4ba4d7c3b471fd7d840aaf4fe34d52cfdb | 961898581ba79a590ab20f5601c5552647be2b67 | refs/heads/master | 2021-01-17T11:34:47.881220 | 2016-06-06T20:00:21 | 2016-06-06T20:00:21 | 52,302,675 | 0 | 0 | null | 2016-04-25T22:11:18 | 2016-02-22T20:18:28 | Makefile | UTF-8 | C++ | false | false | 679 | cpp | main.cpp | /*
* Author: Bassam Elsaleh
* March 21, 2016
* purpose- Club Pricing
*/
//System Libraries
#include <iostream>
#include <iomanip>
using namespace std;
//User Libraries
//Global Constants
//Function Prototypes
//Execution Begins Here
int main(int argc, char** argv) {
//Declare variables
float cha=2500;... |
0780c62dc94d1a7a4a56ccb2b1bc68b7fd01846a | 6ab9a3229719f457e4883f8b9c5f1d4c7b349362 | /euler/e035.cpp | 5b48f54d9ef03f850f206ec10ce0ce5e9f5f0657 | [] | no_license | ajmarin/coding | 77c91ee760b3af34db7c45c64f90b23f6f5def16 | 8af901372ade9d3d913f69b1532df36fc9461603 | refs/heads/master | 2022-01-26T09:54:38.068385 | 2022-01-09T11:26:30 | 2022-01-09T11:26:30 | 2,166,262 | 33 | 15 | null | null | null | null | UTF-8 | C++ | false | false | 743 | cpp | e035.cpp | #include <cmath>
#include <cstdio>
#include <ctime>
#define MAX 1000000
#define SQMAX 1000
bool p[MAX];
int p10[6] = { 1, 10, 100, 1000, 10000, 100000 };
bool circular_prime(int x){
int k = x, d = 0;
while(x) x /= 10, d++;
for(int i = 0; i < d; ++i){
if(!p[k]) return 0;
k = (k % 10) * p10[d - 1] + k / 10;
}
... |
751ee4e1edd1eb96e223bf7ad9fcff0273abc5c2 | 2277375bd4a554d23da334dddd091a36138f5cae | /ThirdParty/Havok/Source/Physics2012/Dynamics/Motion/hkpMotion.cpp | c246fcbc65334f16b2aebd8aff4eab46417d9c0a | [] | no_license | kevinmore/Project-Nebula | 9a0553ccf8bdc1b4bb5e2588fc94516d9e3532bc | f6d284d4879ae1ea1bd30c5775ef8733cfafa71d | refs/heads/master | 2022-10-22T03:55:42.596618 | 2020-06-19T09:07:07 | 2020-06-19T09:07:07 | 25,372,691 | 6 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 6,353 | cpp | hkpMotion.cpp | /*
*
* Confidential Information of Telekinesys Research Limited (t/a Havok). Not for disclosure or distribution without Havok's
* prior written consent. This software contains code, techniques and know-how which is confidential and proprietary to Havok.
* Product and Trade Secret source code contains trade secrets ... |
52dd741c891551a46b413e063b29bdda6bc22e80 | 54f352a242a8ad6ff5516703e91da61e08d9a9e6 | /Source Codes/AtCoder/agc031/A/4608459.cpp | 7faf533bc76f64bd69c324d89a0471a97c68d0de | [] | no_license | Kawser-nerd/CLCDSA | 5cbd8a4c3f65173e4e8e0d7ed845574c4770c3eb | aee32551795763b54acb26856ab239370cac4e75 | refs/heads/master | 2022-02-09T11:08:56.588303 | 2022-01-26T18:53:40 | 2022-01-26T18:53:40 | 211,783,197 | 23 | 9 | null | null | null | null | UTF-8 | C++ | false | false | 531 | cpp | 4608459.cpp | #include <iostream>
#include <map>
# define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int INF = 1000000000 + 7;
int main() {
int n; string s;
cin >> n >> s;
map<char, int> counter;
rep (i, n) {
if (counter.find(s[i]) == counter.end()) counter[s[i... |
e7be179b86bf5071d4b10b1911b5e23fc42882b1 | a1889ba2d2eea14ceaf004beefd13d47c1ac210d | /LibParticle/PartioBgeo/core/ParticleHeaders.cpp | 72e01c49a12d8eb6b06fa2cc4f17e42e8dd7d683 | [] | no_license | NTCodeBase/LibParticle | 93b4ee08ca82dab4f5dcf830abb223be92f21cf0 | 8a2561ca5009c43e5bf6f3c25bb0ad77b9777996 | refs/heads/master | 2020-03-26T07:10:17.943815 | 2019-06-29T19:59:46 | 2019-06-29T19:59:46 | 144,639,459 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,185 | cpp | ParticleHeaders.cpp | /*
PARTIO SOFTWARE
Copyright 2010 Disney Enterprises, 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:
* Redistributions of source code must retain the above copyright
notice, this... |
6d3fb37943b0790bf55bea808a57bd2620b5c181 | ef66e297a49d04098d98a711ca3fda7b8a9a657c | /LeetCodeR2/334-Increasing Triplet Subsequence/solution.cpp | ee2e16b822917dc84113820fb06b456006384748 | [] | no_license | breezy1812/MyCodes | 34940357954dad35ddcf39aa6c9bc9e5cd1748eb | 9e3d117d17025b3b587c5a80638cb8b3de754195 | refs/heads/master | 2020-07-19T13:36:05.270908 | 2018-12-15T08:54:30 | 2018-12-15T08:54:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 457 | cpp | solution.cpp | class Solution {
public:
bool increasingTriplet(vector<int>& nums) {
vector<int> increasing;
for(auto num : nums)
{
auto it = lower_bound(increasing.begin(), increasing.end(), num);
if(it == increasing.end())
increasing.push_back(num);
else... |
1abc72e1e2989d1d9f46c8a43fbb934922451252 | c94de0b609fcfd691232a9006886f40412d3520b | /String-Searching-algorithms/suffix_array.cpp | a981c566882a0cc908533f28d7d4b06ef2b83d5a | [] | no_license | Vignesh2508/Algorithms-And-DataStructures | 65e5680be056085680610e91f98fca5d27727b53 | 1bdbba2fa97a7d0c20952234db434d910b80dbb5 | refs/heads/master | 2020-12-02T14:49:34.010044 | 2018-01-28T16:28:33 | 2018-01-28T16:28:33 | 231,041,318 | 1 | 0 | null | 2019-12-31T06:46:36 | 2019-12-31T06:46:35 | null | UTF-8 | C++ | false | false | 1,660 | cpp | suffix_array.cpp | //Implementation of Suffix array O(n*logn*logn)
//Kasai's algorithm for computing Longest common prefix array in O(n)
//Solution of DISUBSTR - Distinct Substrings problem in Spoj
#include<bits/stdc++.h>
using namespace std;
long cmp(long i,long j);
string str;
long gap=1,sa[1000007],pos[1000007],tmp[1000007],n,lcp[1000... |
cf3d499bd2211147baeebfb82723bbee9a5ba6cb | 93fbf65a76bbeb5d8e915c14e5601ae363b3057f | /3rd sem DS Lab/Practice.cpp | cb437176f1da029370c1b06a014b803e8f971ab4 | [] | no_license | sauravjaiswa/Coding-Problems | fd864a7678a961a422902eef42a29218cdd2367f | cb978f90d7dcaec75af84cba05d141fdf4f243a0 | refs/heads/master | 2023-04-14T11:34:03.138424 | 2021-03-25T17:46:47 | 2021-03-25T17:46:47 | 309,085,423 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,055 | cpp | Practice.cpp | //Merge Sort
#include<iostream>
using namespace std;
int n,*temp;
void mergesort(int a[],int l,int u);
void merge(int a[],int l,int m,int u)
{
int i,j,index;
temp=new int[n];
i=l;
j=m+1;
index=l;
while(i<=m&&j<=u)
{
if(a[i]<a[j])
{
temp[index]=a[i];
i++;
}
else
{
temp[index]=a[j];
j++;
}
... |
9788d371741a3c3da8b7571ec30c069190920e98 | 2ffd002d702d5e281a94ce85cec050fe822664d0 | /Header files/Game.h | b290de46264ecd56fe7937ff66ff3e88a41867db | [] | no_license | Salman0115/C-Game- | 1a14d0d525698b079305926ea8b892653be167b7 | c206b1f7da3f68b4e2036ade8131a4b8280eeba3 | refs/heads/main | 2023-02-17T06:33:35.142265 | 2021-01-16T17:01:11 | 2021-01-16T17:01:11 | 330,210,446 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,598 | h | Game.h | /*!
\file Game.h
*/
#pragma once
#include "Block.h"
#include <Box2D/Box2D.h>
#include <SFML/Graphics.hpp>
#include "MovingBlock.h"
#include "Character.h"
#include <vector>
#include "iostream"
#include "Platform.h"
#include "Col_Def.h"
#include "openingDoor.h"
#include "SFMLDebugDraw.h"
#include "doorOpenSensor.h"
#incl... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.