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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
f993b06c56f863205ff2243e1f5aa18c72687ffa | 299b377022f52b20e3c9696950da9007e9b078a4 | /src/blas_like/level1/Symmetric2x2Inv.cpp | 8cf4a2d373a135e5adff443154d45767dbf7ebeb | [
"BSD-3-Clause",
"Apache-2.0"
] | permissive | sg0/Elemental | 43cba65d001de299167363c349127cf8c23f7403 | 614f02509690449b553451e36bc78e7e132ea517 | refs/heads/master | 2021-01-15T09:33:56.394836 | 2016-02-29T18:25:53 | 2016-02-29T18:25:53 | 19,929,637 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,873 | cpp | Symmetric2x2Inv.cpp | /*
Copyright (c) 2009-2015, Jack Poulson
All rights reserved.
This file is part of Elemental and is under the BSD 2-Clause License,
which can be found in the LICENSE file in the root directory, or at
http://opensource.org/licenses/BSD-2-Clause
*/
#include "El.hpp"
namespace El {
template<typename F>... |
9ea14340b4fc21990af2e90f4d19e75460b7a290 | 4bb3bf353e28917eaa910ae9c5d9a5a790aaa42a | /OC++Demo/TestSo.h | 6a00e082b16a3b41c8331cf68ae6bb6b07d7235c | [] | no_license | yangzhaokun1234/OC-Demo | d4fbcace854f4bca4d5b01c064ab6f4f7e067653 | 74bdc4ebb5fd25ff1ebe0d548cb58481135c5163 | refs/heads/master | 2020-12-25T19:15:02.287187 | 2015-06-18T07:47:57 | 2015-06-18T07:47:57 | 37,644,059 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 164 | h | TestSo.h | #ifndef __SO_DEMO_TEST_HEADER__
#define __SO_DEMO_TEST_HEADER__
#include <iostream>
using namespace std;
extern "C" int one(int ret);
#endif
|
6aa080d5c43f5319d0da2e479886169ae37e99b9 | 338f16b907cdca5d99f6fc4ee978b3dede217615 | /src/slave/containerizer/mesos/isolators/posix/disk.hpp | df255d910053a3bf06f5e45b6dd795a6630490d0 | [
"Apache-2.0",
"GPL-2.0-or-later",
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-protobuf",
"LGPL-2.1-only",
"PSF-2.0",
"BSL-1.0",
"MIT",
"LicenseRef-scancode-warranty-disclaimer",
"BSD-2-Clause"
] | permissive | apache/mesos | 24c92eb34ea9cbb2912d6471815a433c9942e0c9 | 8856d6fba11281df898fd65b0cafa1e20eb90fe8 | refs/heads/master | 2023-08-28T06:36:36.458732 | 2023-01-13T21:00:06 | 2023-01-14T00:29:23 | 11,469,439 | 4,860 | 2,034 | Apache-2.0 | 2023-04-12T06:10:25 | 2013-07-17T07:00:13 | C++ | UTF-8 | C++ | false | false | 5,026 | hpp | disk.hpp | // 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... |
360d6b1c77f9db06a326818e8006b748296d76bb | e1caf4d150c95e707d2226bf52fa5c32d1e3d761 | /TerrainRenderer/Lightsource.h | 62a653b1b0de7023329c98fc3e2030276d652a45 | [] | no_license | srhi84/sep3d | d58ead80535566c976c2cb212df15b4f61d0e884 | 1c9a993a17298a06b26a896b9a7b1f4046e8d59c | refs/heads/master | 2018-03-04T20:57:10.965948 | 2009-04-12T16:05:41 | 2009-04-12T16:05:41 | null | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 668 | h | Lightsource.h | #pragma once
#include "DXUT.h"
class LightSource {
public:
/**
* Konstruktor.
* Erzeugt eine neue Lichtquelle mit bestimmter Farbe und Rotations-
* geschwindigkeit.
*/
LightSource(const D3DXVECTOR3 &color, const D3DXVECTOR3 &rotation)
: color_(color), rotation_(rotation) {};
virtual ~LightSour... |
99c516a36402e17965ca6c4280d042f2cd78dfe8 | 3fccd469f637096782c70764e178bd804def3b61 | /KDL/LanguageMenu.cpp | abf63603fa13d97f1225f5094350f179a0444d3a | [
"MIT"
] | permissive | ara-ayvazyan/kdl | cd99b114341bed2dc88e453c08938f9ee75f961b | 62af2d2e891f2676fdb28a9fb9e5f190c30a4edc | refs/heads/master | 2021-04-27T00:08:40.403204 | 2018-03-05T04:54:22 | 2018-03-05T04:54:22 | 123,755,761 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,410 | cpp | LanguageMenu.cpp | #include "stdafx.h"
#include "LanguageMenu.h"
#include "LanguageCollection.h"
namespace KDL
{
LanguageMenu::LanguageMenu(HINSTANCE hInstance, HWND hWnd, const LanguageCollection& langs)
: Menu{ hInstance, hWnd, langs }
{
size_t nLangs = _langs.GetSize();
for (size_t i = 0; i < nLangs;... |
3e2497c377c4ce42f2fec53625ae64f7a9313e7c | 62f66d391d4fecfebe757bc4681b111653318314 | /Source/Input/FileParser.hpp | ea47233b50d911423f29922292f61b4310b12582 | [] | no_license | CheezBoiger/8-PuzzleSimpleSolver | 4ce927c94efa5e8b1ce1ef9ceb944cd3e004d165 | 82a078ececeaea6b58b0cdda5c37604144af1b8c | refs/heads/master | 2021-07-24T13:30:54.053320 | 2017-04-30T00:08:56 | 2017-04-30T00:08:56 | 109,657,974 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 787 | hpp | FileParser.hpp | // 8 Puzzle Solver Algorithm Assignment
// Assignment #1
// Author : Mario Garcia
// Class : CS 420
// Instructor : Dr. Daisy Tang
//
// Copyright (c) 2017 Mario Garcia, MIT License.
// Built with <3
#pragma once
#include <string>
#include <list>
namespace cs420 {
// Parses the given file to this object. The
// ... |
48ba86de8a20774290de47b7fafdea91b3e6100f | eeb6a2334bdcb689b650f392a00670d0671b2f5c | /algorithm/MemPool.h | 6445374cc1284a80bf9d44f7f127129f9bf2f461 | [] | no_license | jj4jj/ssukits | 64d197af231a6d759b6fe6c9dd909967cc1c1644 | 4806b2dad578fb5b0ed919eef9b119c1b9dfd887 | refs/heads/master | 2021-01-17T12:01:45.649644 | 2014-11-07T13:00:13 | 2014-11-07T13:00:13 | 17,021,574 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 912 | h | MemPool.h | #pragma once
#include "base/stdinc.h"
class MemPool
{
public:
MemPool(){m_pBufferBase = NULL;}
int Init(void* pBuffer,size_t zBufferSize,
int iEntySize,int iMaxEntryNum);
/////////////////////////////////////////////////////////////////////////////////////////////////
int Attac... |
38bd30b1ab58fcba44b6242a686935a4384a4742 | a6b516ec1027cd3d22f2b19a233083ffe18e9ce8 | /Practice Practicums/Practice Practicum 4/8_Players.cpp | 5d65a5598c0ed802cf7fe0fd0045066f37276fe2 | [] | no_license | kale6834/CSCI1300 | 931dcb916b928c0dcb90434c2e7ca30ab45e4575 | bcfbdd3d78861f72ea3de7657989e7ff21e29b31 | refs/heads/master | 2021-01-26T07:40:34.060453 | 2020-02-26T21:20:34 | 2020-02-26T21:20:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,340 | cpp | 8_Players.cpp | #include <iostream>
#include <string>
#include <fstream>
using namespace std;
#ifndef PLAYERS_H
#define PLAYERS_H
class Players
{
public:
Players();
void ReadFile(string);
float MaxSalary();
string MaxSalaryName();
private:
float salaries[50];
string names[50];
int counter = 0;... |
550bef4daaeb2d5d406bfe37cb0d3a98729cc229 | 7e5da02c1b9b60798dfde594eb3e793f5d332b78 | /15 Trees/264BinaryTreeTraversal.cpp | 1d1c2e3f62cf8ddcc4b0b6ce68ae008a0a21b7fe | [] | no_license | bd4874/dsa-revision-notes | 1cfd7ac144f7736d74cd7ed58e3633a73dea7043 | 484dd9e0f88cefa2e2d6375f82fe7c017bced7a4 | refs/heads/master | 2023-03-15T18:05:02.069451 | 2021-02-17T16:04:51 | 2021-02-17T16:16:03 | 535,834,968 | 1 | 0 | null | 2022-09-12T20:13:48 | 2022-09-12T20:13:47 | null | UTF-8 | C++ | false | false | 357 | cpp | 264BinaryTreeTraversal.cpp | // Author: REET
/*
Preorder: 1.visit(node)
2.preorder(left subtree)
3.preorder(right subtree)
Inorder: 1.inorder(left subtree)
2.visit(node)
3.inorder(right subtree)
Postorder: 1.postorder(left subtree)
2.postorder(right subtree)
3.visit(n... |
36ede7637ba6f88ab90ab473eb8320dc1969f2c2 | b1c317e8aeef0ce6ea5b49c590a0d640f0488bf9 | /Book/Chapter 2/Linear DS/Array 1D/CF 467A - George and Accommodation.cpp | 2a96275ce3ef8b5d00feb5353bd59eb5b87b20e6 | [] | no_license | akramsameer/Problems | e94ee6b49f8333c98f0cc60282a88f475f8a04f6 | 8df3ca030c9c1381388902759b6f391e25463cdf | refs/heads/master | 2021-01-01T15:47:31.497082 | 2018-06-04T18:38:58 | 2018-06-04T18:38:58 | 97,703,981 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 801 | cpp | CF 467A - George and Accommodation.cpp | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long int
using namespace std;
#define clr(v , d) memset(v , d , sizeof v)
#define sz(v) ((int)(v).size())
const int VISITED = 1;
const int UNVISITED = -1;
const long long OO = 1e12;
const int OOI = 1e9;
#define f first
typedef pair<int, int> ii;
t... |
66b8a7037a1bd13f4323fa38fe64f2fdcc656c9d | 6775ac3b98b6485a7f742673847aed8462b97c78 | /compare_string.cpp | fc5e92d930b3e8d99607a2020cb41030ee63482c | [] | no_license | AtikulDUET/Practice-Programm | 9f4bff3fb1c3bdda98fb582bf4fa94708168be49 | b933c6c05000fcebabbc55405fd0e2305bd9996c | refs/heads/master | 2022-11-27T20:08:32.070009 | 2020-08-04T17:53:01 | 2020-08-04T17:53:01 | 283,836,021 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 277 | cpp | compare_string.cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
char str1[30],str2[30];
int ck = 1;
cin>>str1>>str2;
while(str1[i])
if(ck==1)
cout<<"String is same."<<endl;
else
cout<<"String is not same."<<endl;
return 0;
}
|
c73f33c9aed8024d2ad54444aff2bf85a014e338 | a2bde27da5b65e500c13ff4931ef8ccea025d86c | /view_add_edit_delete/view.cpp | b0c724e1dae6d3800142df9a1a9b60c8c9e0342f | [] | no_license | dzikrafathin/pengantar_algoritma_cpp | 8913c584efe6adeeca326bc621e8aa7ee4ed2f6e | 1b3ddeeaa3d926267e1df5ed85b481cb08657f44 | refs/heads/master | 2020-04-05T03:03:24.428984 | 2019-01-09T00:45:36 | 2019-01-09T00:45:36 | 156,499,831 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 460 | cpp | view.cpp | #include <iostream>
using namespace std;
void view(int arr[], int n) {
cout << "================\nSLOT || ISI DATA\n================\n";
for (int i=0;i<n;i++) {
if (arr[i] != 0) {
cout <<" "<<i<<" || "<<arr[i]<<"\n----------------\n";
} else if (arr[i] == 0) {
cout <<... |
f7f0bbf72c6b61eb632147b5b163f8c147ddb927 | e4122bee9547bd3d9eab00137590e8fe1b34f4f2 | /Chapter 22/Using memset/Using memset/main.cpp | ded7cbb43aef618e58c578c2bf55933e3a451398 | [
"MIT"
] | permissive | MarvelousAudio/CPlusPlus-How-to-program-tenth-edition | 230ef55f0d39f36a36c0de62d9e3e7905d8728cf | a667b080938cf964909d79b272f0d863adc300e0 | refs/heads/master | 2021-05-20T15:50:18.253269 | 2020-07-23T09:03:28 | 2020-07-23T09:03:28 | 252,354,904 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 549 | cpp | main.cpp | //
// main.cpp
// Using memset
//
// Created by ben haywood on 6/6/20.
// Copyright © 2020 ben haywood. All rights reserved.
//
#include <iostream>
#include <cstring> // memset prototype
using namespace std;
int main(int argc, const char * argv[]) {
// insert code here...
char string1[15]{"BBBBBBBBBBBBB... |
adc2ec55f131d906c400f47087c20749a021c778 | ed4f0ae5cfc032012cc21fc6ab2a80459825db77 | /do while game.cpp | 8988e03141bfddc953ce6ba9a8997b97fa6a416f | [] | no_license | ZainArif/C-program-practices | 5cb88cb422256cd35ce92ae81521124b3502a266 | 21047c2c6a01339c4582c40f28c43304ac59b2d3 | refs/heads/master | 2020-04-08T18:34:19.712748 | 2018-11-29T06:05:50 | 2018-11-29T06:05:50 | 159,614,341 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 349 | cpp | do while game.cpp | #include<stdio.h>
#include<conio.h>
int main()
{
char ch='a';
do
{
printf("\nType in letter from a to e:");
while((ch=getche())!='d')
{
printf("\nSorry %c is incoreect",ch);
printf("\nTry again");
}
printf("\nThats it");
printf("\nPlay again?\n press y/n:");
}
while(getche()=='y');
printf(... |
3fc3a7e2eb85bbc306cf3687046ac755b84cbcd0 | 4517a61b756f1a2c7e9684be619d872569fda30e | /bin_src/solarmain-8.5.1/src/gwas.cc | 03ae931d719eb2300134f0579ccb1362e28aa35a | [] | no_license | brian09/solar-eclipse-8.5.1 | 096858b0c7a6691af665c2a07213d2ee8ce79ee1 | 9adf8b29446d4533f0cb384bdda8ecca5800e468 | refs/heads/master | 2023-06-07T21:59:03.792678 | 2021-07-02T22:21:19 | 2021-07-02T22:21:19 | 342,719,917 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 101,504 | cc | gwas.cc | #include "solar.h"
#include <Eigen/Dense>
#include <string>
#include <cmath>
#include <fstream>
#include <vector>
#include <random>
#include <chrono>
#include <array>
#include <iterator>
#include "plinkio.h"
#include <unordered_map>
#include <vector>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#inc... |
013b577cf17318327d705cbc9c84325ce3b43700 | cd726912664cea9c458ac8b609dd98bf33e3b9a0 | /snippets/cpp/VS_Snippets_Remoting/MessageBinding_sample/CPP/messagebinding_sample.cpp | 5210e7417e5653ce0d3ada8b569326b6cac22662 | [
"MIT",
"CC-BY-4.0"
] | permissive | dotnet/dotnet-api-docs | b41fc7fa07aa4d54205df81284bae4f491286ec2 | 70e7abc4bcd692cb4fb6b4cbcb34bb517261dbaf | refs/heads/main | 2023-09-04T07:16:44.908599 | 2023-09-01T21:46:11 | 2023-09-01T21:46:11 | 111,510,915 | 630 | 1,856 | NOASSERTION | 2023-09-14T21:45:33 | 2017-11-21T06:52:13 | C# | UTF-8 | C++ | false | false | 3,222 | cpp | messagebinding_sample.cpp |
// System::Web::Services::Description.MessageBinding::MessageBinding();
// System::Web::Services::Description.MessageBinding::Extensions;
// System::Web::Services::Description.MessageBinding::Name;
/* The following program demonstrates the abstract class 'MessageBinding', it's constructor MessageBinding()
and propert... |
7ecbe712fe41521c45f4f7eb318ef06deb7cbb50 | b6289bea68145582d3f0ac20c6a76f8e2cf02011 | /tools/proto_mod/proto_src/ListingData.pb.h | 186259cca9f5b2e1c2c168cdd9a315f098274a22 | [] | no_license | mfs409/memcached-fetch-and-phi | 703512e1a460fbda2aa214954eb6ca133aeba1bb | 2d5c33e1e95c43dead54347901b3ce1c4cd28da4 | refs/heads/master | 2021-01-12T02:30:10.246798 | 2017-01-04T20:03:25 | 2017-01-04T20:03:25 | 78,041,758 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 36,395 | h | ListingData.pb.h | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: ListingData.proto
#ifndef PROTOBUF_ListingData_2eproto__INCLUDED
#define PROTOBUF_ListingData_2eproto__INCLUDED
#include <string>
#include <google/protobuf/stubs/common.h>
#if GOOGLE_PROTOBUF_VERSION < 2004000
#error This file was generated by a... |
d655465fe34bca40cc05a2a603e4be06ccd8e328 | c694da160d4365eb2d5aad404334c6ed1d41a75c | /src/include/usr/hdat/hdat.H | 0f750936cdd0b9e3b914fa308d7beda241ce2308 | [
"Apache-2.0"
] | permissive | 3mdeb/talos-hostboot | b00e00fa4613731c01338a73dcf39dededae971f | 8d49baa2180fc3cff78c393b19e39816dfa8606f | refs/heads/master | 2022-12-18T01:04:50.303567 | 2018-04-25T02:13:30 | 2018-05-20T06:31:19 | 299,345,985 | 1 | 0 | NOASSERTION | 2020-09-28T15:40:46 | 2020-09-28T15:06:58 | C++ | UTF-8 | C++ | false | false | 10,165 | h | hdat.H | /* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/include/usr/hdat/hdat.H $ */
/* ... |
182fe60b3620350ee7c4e275794a42c9a423287d | cf353a75e98242cf439bc8d29be0945649dd414e | /src/Allocator.hpp | 183025a07891e9a10533353cf9e922ffcdc1d54e | [
"BSD-2-Clause"
] | permissive | karheinz/sesame | 934d638b4ef144e6eccbf226f81941fc370a5b0d | 2cf644625c407bfb86aa242760a43e995eea6d8b | refs/heads/master | 2021-01-13T20:01:00.370226 | 2019-11-01T09:41:29 | 2019-11-01T13:46:19 | 30,211,324 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,108 | hpp | Allocator.hpp | // Copyright (c) 2015, Karsten Heinze <karsten.heinze@sidenotes.de>
// 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 notic... |
bb6dc7579bce5d53666762d2da39e6b1155cbfce | c0c44b30d6a9fd5896fd3dce703c98764c0c447f | /cpp/Targets/FMath/include/fmath.h | 3372eab802b38c1dfd1232810e35a4c6cf9bbe90 | [
"BSD-3-Clause"
] | permissive | wayfinder/Wayfinder-CppCore-v2 | 59d703b3a9fdf4a67f9b75fbbf4474933aeda7bf | f1d41905bf7523351bc0a1a6b08d04b06c533bd4 | refs/heads/master | 2020-05-19T15:54:41.035880 | 2010-06-29T11:56:03 | 2010-06-29T11:56:03 | 744,294 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 154 | h | fmath.h | #ifndef _FMATH_H_
#define _FMATH_H_
#include "fcommon.h"
#include "fvec.h"
#include "fmatrix.h"
namespace fmath {
}
#endif // _FMATH_H_
|
72c82a452e34db3cc2f70f77f0fbbb22f379bfb9 | 33b567f6828bbb06c22a6fdf903448bbe3b78a4f | /opencascade/StdLPersistent_HString.hxx | aae213e4b58ccce239e310945389311cffc7e12a | [
"Apache-2.0"
] | permissive | CadQuery/OCP | fbee9663df7ae2c948af66a650808079575112b5 | b5cb181491c9900a40de86368006c73f169c0340 | refs/heads/master | 2023-07-10T18:35:44.225848 | 2023-06-12T18:09:07 | 2023-06-12T18:09:07 | 228,692,262 | 64 | 28 | Apache-2.0 | 2023-09-11T12:40:09 | 2019-12-17T20:02:11 | C++ | UTF-8 | C++ | false | false | 2,265 | hxx | StdLPersistent_HString.hxx | // Copyright (c) 2015 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special ... |
024c43b456fc803f791b08a7c980eefa01f03519 | 1d18bbc37229f905e105a65e295f627f8417823b | /BaconBox/Components/StandardRenderer/TextRenderer.h | a12892f0f96daa53efb8aa48566507bd28304d31 | [] | no_license | anhero/BaconBox | 57b82a889fe12f5524267a9bb5035973d054706d | afa4b97d86be876f8375f3898667aabb3610c52c | refs/heads/develop | 2021-01-17T09:35:05.986399 | 2017-04-07T04:36:43 | 2017-04-07T04:36:43 | 22,391,368 | 1 | 0 | null | 2015-03-12T19:21:30 | 2014-07-29T18:49:08 | C++ | UTF-8 | C++ | false | false | 1,338 | h | TextRenderer.h | #ifndef BB_TEXTRENDERER_H
#define BB_TEXTRENDERER_H
#include "BaconBox/Core/Component.h"
#include "BaconBox/Vector2.h"
#include "BaconBox/Core/Entity.h"
#include "BaconBox/MovieClipEntity/MovieClipEntity.h"
#include "BaconBox/Display/Text/TextAlignment.h"
#include "BaconBox/Components/TextComponent.h"
#include "Bacon... |
36fa5cc5053432873301b517ae7e5e1ae1549510 | 17e7f2f8b786ee8361b9b755740e816411751b76 | /NexusNative/nengine/special_effect/nsub_uv.h | 8552d802478ecb926efc064e4a6d135611183751 | [] | no_license | windless1015/My3DEngine2008 | 880945bd9d9f5e9a2ed30fe869ee53ec5b4fe2da | 6fffdd1b158ba9c63ffd564788fddd5706e08ac0 | refs/heads/master | 2022-11-13T17:41:46.620000 | 2020-07-02T13:31:19 | 2020-07-02T13:31:19 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,195 | h | nsub_uv.h | #ifndef _NEXUS_SUB_UV_H_
#define _NEXUS_SUB_UV_H_
namespace nexus
{
/**
* 作为一个UV的包装，外部统一使用0~1的UV范围，sub uv根据自己设置的“子图像”的个数来进行uv转换
*/
struct nsub_uv
{
int num_images_h; // 整个texture中横向有几个图片
int num_images_v; // 整个texture中纵向有几个图片
int image_index; // 当前正在使用哪个图片
nsub_uv(void):num_images_h(1), nu... |
e33f8395ca07a5fcb459e67f11e8c236bef5967d | 4cff56cfb609a712003fbd09e8fc6cde520a9147 | /sln/Biu/src/Biu.Transmission/Stdafx.h | 91ed621a4a829dde162c543d7f5e5e134d1c1e6a | [] | no_license | teerta/Biu | 19fb29c8ab14ae2fdabad784e87d85f0c3fbd074 | 7fc55d7aed902ea208412552b2c965f819d53961 | refs/heads/master | 2020-12-03T03:45:35.479530 | 2017-06-29T18:38:53 | 2017-06-29T18:38:53 | 95,769,553 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,832 | h | Stdafx.h | // stdafx.h : 标准系统包含文件的包含文件，
// 或是经常使用但不常更改的
// 特定于项目的包含文件
#pragma once
#ifndef VC_EXTRALEAN
#define VC_EXTRALEAN
#endif
#define _WINSOCK_DEPRECATED_NO_WARNINGS
#define _ATL_CSTRING_EXPLICIT_CONSTRUCTORS
// Windows
#include <windows.h>
#include <tchar.h>
//#include <WinSock2.h>
//#include <WS2tcpip.h>
#include <W... |
3fbb51ede87206ab6296343a444d04f48c1530ca | e30874b3aa20804833dd11788176f839fcd08690 | /cpp/tests/lists/reverse_tests.cpp | a899d387c3ede4a275e57444a392e76c80ff3ebf | [
"Apache-2.0"
] | permissive | rapidsai/cudf | eaba8948cddde8161c3b02b1b972dab3df8d95b3 | c51633627ee7087542ad4c315c0e139dea58e408 | refs/heads/branch-23.10 | 2023-09-04T07:18:27.194295 | 2023-09-03T06:20:33 | 2023-09-03T06:20:33 | 90,506,918 | 5,386 | 751 | Apache-2.0 | 2023-09-14T00:27:03 | 2017-05-07T03:43:37 | C++ | UTF-8 | C++ | false | false | 20,308 | cpp | reverse_tests.cpp | /*
* Copyright (c) 2022-2023, NVIDIA CORPORATION.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable... |
59f5f4a43564c0e37ba5f3c0a9e88f8a9f01cc90 | 7ce50237b28a940883d257df2e1888dbea580f79 | /modulo_two_color_led2/modulo_two_color_led2.ino | 4782e7d19caf858ca68cac08cb4e8f3c83be14c6 | [] | no_license | jmgdelgado/Arduino | 43006540e9c18141143634cad0072adbd367b4b7 | fd078b02c108904a6167041d663121f4153ab856 | refs/heads/master | 2021-04-28T19:42:09.831857 | 2018-10-20T10:48:29 | 2018-10-20T10:48:29 | 121,901,840 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,090 | ino | modulo_two_color_led2.ino | // MODULO TWO COLOR LED RGB - KY-011 y KY-029
// los dos modulos funcionan igual, uno es mas pequeio que otro
// Modulo actuador que consiste en un led con 2 entradas para color R,G
//
// La pata R: S rojo, hay que conectar una resistencia de 220 ohmios
// La pata V: la del medio verde, hay que conectar una resistenci... |
9a9756dcab46c84eb26fed3dac101343a16211f7 | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/ds/security/base/keymgr/chgpsw.cpp | cd8e5fc2d24ed1b5ced2642f81c7aea5d190fef3 | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 14,558 | cpp | chgpsw.cpp | /*++
Copyright (c) 2000 Microsoft Corporation
Module Name:
CHGPSW.CPP
Abstract:
Handler for the CHANGE button on the properties dialog,
used to change the user's domain password.
Author:
990917 johnhaw Created.
georgema 000310 updated
georgema 0005... |
8940b9485856d709448625b17f725562a96365e9 | 2ae0b8d95d439ccfd55ea7933ad4a2994ad0f6c5 | /src/common/snippets/include/snippets/lowered/pass/assign_registers.hpp | 4425b4e59d8f77bdf97846223699879cc16a2053 | [
"Apache-2.0"
] | permissive | openvinotoolkit/openvino | 38ea745a247887a4e14580dbc9fc68005e2149f9 | e4bed7a31c9f00d8afbfcabee3f64f55496ae56a | refs/heads/master | 2023-08-18T03:47:44.572979 | 2023-08-17T21:24:59 | 2023-08-17T21:24:59 | 153,097,643 | 3,953 | 1,492 | Apache-2.0 | 2023-09-14T21:42:24 | 2018-10-15T10:54:40 | C++ | UTF-8 | C++ | false | false | 950 | hpp | assign_registers.hpp | // Copyright (C) 2023 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#pragma once
#include "pass.hpp"
#include "snippets/generator.hpp"
namespace ov {
namespace snippets {
namespace lowered {
namespace pass {
/**
* @interface AssignRegisters
* @brief Assigns in/out abstract registers indexes to every... |
99e57d0ca53e196a05bc120447b622c6049302dc | e22a5e9010dd2d18d38e8fc8711b662dde5c2efa | /Practice/Split_a_Circular_Linked_List_into_two_halves.cpp | fc5e8e127d671a656aa5d00f71703bf64606c453 | [] | no_license | tridibsamanta/GeeksforGeeks_Solutions | a7a22bd5cd731b69f6e838950db287fc2333d8f0 | 05ca7177bfb44840c2525053b9631e37c2de8e8d | refs/heads/master | 2021-11-19T21:06:18.081142 | 2021-10-08T08:04:29 | 2021-10-08T08:04:29 | 250,858,418 | 5 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 2,698 | cpp | Split_a_Circular_Linked_List_into_two_halves.cpp | /**
* Title : Split a Circular Linked List into two halves
* Author : Tridib Samanta
* Link : https://practice.geeksforgeeks.org/problems/split-a-circular-linked-list-into-two-halves/1
**/
// { Driver Code Starts
/* Program to split a circular linked list into two halves */
#include<stdio.h>
#includ... |
b01998501a9afadfc70f16388184039a52a12ae1 | 6b8bab7cb8e841f3f0881f9b09ce4f19b136f25e | /DeviceCommandHandler/readregistercommandhandler.h | 12f9fec0b8031793238e2d1a3428be8ef6b1143d | [] | no_license | tudodetalhado/OpenGEV | 6a49b8b5a168d16330df8145cc3df871a7fcfa8c | 8876e6bb5e99d324ab5b6bb754ddaf607c9f921a | refs/heads/master | 2021-06-01T01:30:58.795856 | 2016-02-07T17:16:14 | 2016-02-07T17:16:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,066 | h | readregistercommandhandler.h | #ifndef READREGISTERMESSAGEHANDLER_H
#define READREGISTERMESSAGEHANDLER_H
#include "Device/deviceregisters.h"
#include "CommonBootstrapRegister/bootstrapregister.h"
#include "CommonCommand/abstractcommandhandler.h"
#include "Device/gvdevice.h"
#include "CommonPacket/conversionutils.h"
#include "DeviceCommandHandler... |
5ad61cc4b723c5b6fb161d4a11811597e5f8fe57 | 67add2db2e8a3a6b415a990419f6110859167bdf | /elevator/elevator.h | 4e7cc1dc469a994f32eb1e0789c3787f2d857df3 | [] | no_license | rofirger/small-elevator-simulation | 9198a22d8a91551d9130c90632124ba695210244 | 5fb2a4aa39805d8e6e74bda0cf23f3c8207002b3 | refs/heads/main | 2023-07-17T22:27:14.854127 | 2021-08-25T10:53:22 | 2021-08-25T10:53:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,840 | h | elevator.h |
// elevator.h: PROJECT_NAME 应用程序的主头文件
//
// Warning: 全局数据类GlobalElevator未加锁！
#pragma once
#ifndef __AFXWIN_H__
#error "在包含此文件之前包含 'pch.h' 以生成 PCH"
#endif
#include "resource.h" // 主符号
#include "g_a.h"
#include "timer.h"
#include "CPassagerFlow.h"
#include "CelevatorInfo.h"
#include "CeleMoreInfo.... |
74ac9bb8727319f6e6868606551bfb02a001b662 | b483a68d9fbe4d4a431d7c9e4e7a8ae19f29be98 | /suii/ros2_ws/build/suii_msgs/rosidl_typesupport_fastrtps_cpp/suii_msgs/msg/detail/dds_fastrtps/suii_task__type_support.cpp | ce5a67d522c09a4f4e9a23e5330b74fd036ef404 | [] | no_license | fontysrobotics/Robocup_at_work_AR_Minor_2021 | 5afa6eb2e60ae9ea5efe3da2233766c07f650e31 | bb2e19c8501f806162195c9ee93e9eaa0d15960a | refs/heads/main | 2023-06-06T19:44:53.757457 | 2021-07-04T19:56:25 | 2021-07-04T19:56:25 | 375,961,342 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 7,891 | cpp | suii_task__type_support.cpp | // generated from rosidl_typesupport_fastrtps_cpp/resource/idl__type_support.cpp.em
// with input from suii_msgs:msg/SuiiTask.idl
// generated code does not contain a copyright notice
#include "suii_msgs/msg/detail/suii_task__rosidl_typesupport_fastrtps_cpp.hpp"
#include "suii_msgs/msg/detail/suii_task__struct.hpp"
#i... |
e9dc497477db3032da27a2205fee49332d9a859c | b367fe5f0c2c50846b002b59472c50453e1629bc | /xbox_leak_may_2020/xbox trunk/xbox/private/sdktools/factory/xtest/xhard_disk/xhard_disk.cpp | 21727c1001198e147055ceda2e6ec3795cdf919d | [] | no_license | sgzwiz/xbox_leak_may_2020 | 11b441502a659c8da8a1aa199f89f6236dd59325 | fd00b4b3b2abb1ea6ef9ac64b755419741a3af00 | refs/heads/master | 2022-12-23T16:14:54.706755 | 2020-09-27T18:24:48 | 2020-09-27T18:24:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 57 | cpp | xhard_disk.cpp | #define XHD_TAG
#define XHD_MAIN
#include "xdisk.cpp"
|
2acbacf2cd06057062709c3c876e79c99a200d8b | a5f3b0001cdb692aeffc444a16f79a0c4422b9d0 | /main/ucb/source/ucp/odma/odma_lib.cxx | 38e9b084fe6d25722d802c464c8dbba11e072d89 | [
"Apache-2.0",
"CPL-1.0",
"bzip2-1.0.6",
"LicenseRef-scancode-other-permissive",
"Zlib",
"LZMA-exception",
"LGPL-2.0-or-later",
"LicenseRef-scancode-free-unknown",
"LicenseRef-scancode-philippe-de-muyter",
"OFL-1.1",
"LGPL-2.1-only",
"MPL-1.1",
"X11",
"LGPL-2.1-or-later",
"GPL-2.0-only",
... | permissive | apache/openoffice | b9518e36d784898c6c2ea3ebd44458a5e47825bb | 681286523c50f34f13f05f7b87ce0c70e28295de | refs/heads/trunk | 2023-08-30T15:25:48.357535 | 2023-08-28T19:50:26 | 2023-08-28T19:50:26 | 14,357,669 | 907 | 379 | Apache-2.0 | 2023-08-16T20:49:37 | 2013-11-13T08:00:13 | C++ | UTF-8 | C++ | false | false | 7,658 | cxx | odma_lib.cxx | /**************************************************************
*
* 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 y... |
daea80559744ed6a4ad52b3141bde930aeff0284 | f4cd046adb904ead1c60e004f46bc44ea5d29eb7 | /MMOARPG/Core/Component/FightComponent.h | 6555a254258db204dc3be166ef4ce023c0c1c42e | [] | no_license | uspk99/MMOARPGSTUDY | 773d7a34e8927c3ebb866d43b636c97c4cbad805 | 65720b019995e2d8050db00d865737bd859fb710 | refs/heads/main | 2023-08-19T14:54:52.668814 | 2021-10-03T10:55:14 | 2021-10-03T10:55:14 | 404,187,164 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,699 | h | FightComponent.h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "CoreMinimal.h"
#include "Core/MotionComponent.h"
#include "../../MMOARPGGameType.h"
#include "../Game/Abilities/MMOARPGAbilitySystemComponent.h"
#include "SImpleComboType.h"
#include "FightComponent.generated.h"
cla... |
a295e5fed83f3d2b74a1aea6a05bdd5fa97b86f2 | c20b459468fa359a6f4c545db72a211d38298909 | /source/leetcode/Done/148_Sort_List.cpp | 5e3d094da56b85f3a1fc64617a707dab14ae9a28 | [] | no_license | mycppfeed/Leetmap | e0340c6ecb85901c9555900a871e159a16940028 | f1f31085de60adce9dabe5eb2e5c4d66a5ba1572 | refs/heads/master | 2021-11-04T00:13:19.882064 | 2019-04-26T21:18:30 | 2019-04-26T21:18:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,508 | cpp | 148_Sort_List.cpp | /*
* Problem Description
Sort a linked list in O(n log n) time using constant space complexity.
* Solution
1. Have all the nodes stored in Priority queue (min) and pop it in ascending order
DONT forget to make next = NULL for the last node
2. Merge Sort
4 3 2 1 0
divide the list in half
(4 3) (... |
e6a66d0b5848ca8e80fb4c6c2809fa294415dbb1 | 95fa859c34e0b3e563181713b7a07914649e1afe | /GreedyAlgorithm/TopNumber.cpp | b9e19775c34d995f4b50c66a3d097cad2adfb8c1 | [] | no_license | Bpara001/CppPractice | 0af385986b1882b5151a266cc8e22046c7e02e59 | 751b4abe2e2c64be5a887492b19616c81bb7ecc0 | refs/heads/master | 2023-03-25T16:52:18.061789 | 2021-03-21T23:03:17 | 2021-03-21T23:03:17 | 274,262,484 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 982 | cpp | TopNumber.cpp | #include <iostream>
#include <string.h>
#include "vector"
#include "map"
#include "queue"
using namespace std;
vector<int> SubArraySum(vector<int> v) {
vector<int> results;
map<int, int> hash;
for (int i = 0; i < v.size(); ++i) {
if (v[i] > 10) {
hash[((v[i] / 10) % 10)]++;
hash[(v[i] % 10)]++;
}
else {
... |
6ab641fe8a511091acde6d773611ee7f9e153da1 | cf7ece91747d2985e2e1fc716b7c4e7d290b1e9f | /Generics 2.0 Sem3/Generic Dynamic Queue/queue.h | 0b431336d12d21f34606d55a9583f44fc369a371 | [] | no_license | Devu06/All-Project | deb1cc3b86acabf76dc612f4779d2f6d3489eb9a | 89c140f54fedf639a1f275b5e9febb72a104fd9d | refs/heads/master | 2023-05-31T08:51:08.344458 | 2021-07-13T18:24:25 | 2021-07-13T18:24:25 | 286,021,589 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,266 | h | queue.h | #include <bits/stdc++.h>
using namespace std ;
template <class T>
class gqueue
{
protected :
T* data;
int front;
int size;
int cap ;
public :
gqueue() {
data = new T[5] ;
size = 0 ;
cap = 5 ;
front = 0 ;
}
gqueue(int capacity) {
data = new T[capacity] ;
cap = capacity ;
size = 0 ;
fron... |
64edab03dd59b4cdb6a3c5b73fa627f98eaea1fb | 55f752b780c2f2257038531dd55b36fd552fb86a | /include/integrators/IntegratorGeneratorFactory.h | 86784e69699291ba577f225a84948ed7f231b32e | [] | no_license | sz-1011101/ray-storm | 79c5ebbb15969a5d711fd00c141fbbc37af348ea | ebe0b34522b83839ba991608ea5419cda45be80f | refs/heads/master | 2020-05-21T23:54:59.808738 | 2017-02-07T21:13:54 | 2017-02-07T21:13:54 | 65,579,722 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 652 | h | IntegratorGeneratorFactory.h | #ifndef INTEGRATOR_GENERATOR_FACTORY_H_
#define INTEGRATOR_GENERATOR_FACTORY_H_
#include "integrators/AbstractIntegratorGenerator.h"
namespace ray_storm
{
namespace integrators
{
class IntegratorGeneratorFactory
{
private:
IntegratorGeneratorFactory() {};
public:
static AbstractInt... |
c8f0cc4ad33fe081e9c4aac580a02f8fdab05ec2 | dc25b23f8132469fd95cee14189672cebc06aa56 | /vendor/mediatek/proprietary/hardware/mtkcam/legacy/platform/mt6795/v1/adapter/Scenario/Shot/HDRShot/Hdr.h | e5cef92acdd1db3823a9b4029c75259cad0d60e4 | [] | no_license | nofearnohappy/alps_mm | b407d3ab2ea9fa0a36d09333a2af480b42cfe65c | 9907611f8c2298fe4a45767df91276ec3118dd27 | refs/heads/master | 2020-04-23T08:46:58.421689 | 2019-03-28T21:19:33 | 2019-03-28T21:19:33 | 171,048,255 | 1 | 5 | null | 2020-03-08T03:49:37 | 2019-02-16T20:25:00 | Java | UTF-8 | C++ | false | false | 18,595 | h | Hdr.h | /********************************************************************************************
* LEGAL DISCLAIMER
*
* (Header of MediaTek Software/Firmware Release or Documentation)
*
* BY OPENING OR USING THIS FILE, BUYER HEREBY UNEQUIVOCALLY ACKNOWLEDGES AND AGREES
* THAT THE SOFTWARE/FIRMWARE AN... |
bcaf8215112d173653933a8ec12108fb301eefc9 | eba604f3116c7a7db46a1872459092ae84a0f75f | /Common/Base Math Library/Include/Vector4d.h | 13b11a1100d355f9664987ab4300d4a4d25c5f57 | [] | no_license | thearchitect/neocortex | 6ff949611ada5dae725b64e03642e1b02a97579f | 0e0b44926356db6499f6bb1c2c74823cfb779731 | refs/heads/master | 2022-08-25T09:38:24.936314 | 2020-05-22T16:08:56 | 2020-05-22T16:08:56 | 50,591,541 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,371 | h | Vector4d.h | /*
Base Math Library
Copyright (C) 2009 Denis Bogolepov ( bogdencmc@inbox.ru )
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 3 of the License, or
(at your option... |
e69eed77a179d23af296360b4ed0402b86b6dae7 | 113e5f27f1494938228205815364bb4c43738ed6 | /include/head_pose_estimator.h | 3f30b4ffd8068e07c65bf5787ac73047af614f0e | [] | no_license | irenecortes/gaze_tracking | 8fcb6d027bc839c3eab7a537871d36e8f70f67d1 | ca620a63e6040e6595d27401b6a7c91066a3890e | refs/heads/master | 2021-05-10T09:47:17.801432 | 2018-01-25T16:20:18 | 2018-01-25T16:20:18 | 118,936,418 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,987 | h | head_pose_estimator.h |
#include <iostream>
#include <fstream>
#include <vector>
#include <chrono>
#include <string>
#include <stdlib.h>
#include <stdio.h>
#include <sstream>
#include <cmath>
#include <mutex>
#include <thread>
#define PCL_NO_PRECOMPILE
#include <pcl/point_types.h>
#include <pcl/point_cloud.h>
#include <pcl/io/pcd_io.h>
#in... |
a226919372f0dcf2dd8d73833a7aba519752dcca | 03eab75deb71cb25ba18cfb22c20850bb1bb0305 | /LAHACK/Teleport.h | c76ec61c7865857ef5ea18da2917890c4a3fd20f | [] | no_license | lahack/LAHacks | e35a03cac9f8905827adcf259bac4b39fd49950b | 6289d5dabe1ede2adf8504f3fa1345d01c683ac9 | refs/heads/master | 2022-01-08T00:48:39.010365 | 2019-04-01T06:14:04 | 2019-04-01T06:14:04 | 178,540,517 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 207 | h | Teleport.h | #include "Actor.h"
class Game;
class Teleport : public Actor {
public:
Teleport(Game* game, int level, int width, int height);
void setup();
int level;
int width;
int height;
bool created = false;
}; |
7215f6ceab269b32e24c1a6f2088072c4be33637 | 87c5fad99b7bbede7196f978ad0abc5655e9b177 | /slcan.ino | b515cd368879943bcda72c8c40e487aab60941f0 | [] | no_license | nakkaya/slcanuino | c1e85849dbfd1bd00ba98248c7611a5ad36d8f5d | e16f97eba11dd89a1e23a76ebe0a3357b10c262a | refs/heads/master | 2020-04-03T19:35:11.552238 | 2018-10-31T10:29:50 | 2018-10-31T10:29:50 | 155,528,064 | 1 | 0 | null | 2018-10-31T09:04:42 | 2018-10-31T09:04:42 | null | UTF-8 | C++ | false | false | 5,694 | ino | slcan.ino | #include "Canbus/mcp2515_defs.h"
#include "Canbus/mcp2515.h"
#include "Canbus/defaults.h"
#include "Canbus/global.h"
#include "Canbus/Canbus.h"
#include "Canbus/Canbus.cpp"
#include "Canbus/mcp2515.c"
#define LED_OPEN 7
#define LED_ERR 8
#define CMD_LEN (sizeof("T12345678811223344556677881234\r")+1)
int g_can_speed =... |
6a56deba4373f2f0e19c6eae58e9afae9b46040c | cc8ba0ab3dbc3fb63b6279418b51eae4c76e1b63 | /arm_o/dadduser.h | 781e262c731eacc955f9922e17adea07dd4adcb8 | [] | no_license | levdikandrey/DataCollector | 2c08e34277787fee53d407b8b401f14e58a974da | 7a79029c7936c26c2d2a4d1396a0d996de9ee2ea | refs/heads/master | 2021-06-26T12:37:02.206691 | 2021-06-10T11:03:54 | 2021-06-10T11:03:54 | 229,206,596 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 599 | h | dadduser.h | #ifndef DADDUSER_H
#define DADDUSER_H
#include <QDialog>
namespace Ui {
class DAddUser;
}
class DAddUser : public QDialog
{
Q_OBJECT
public:
explicit DAddUser(QWidget *parent = nullptr);
~DAddUser();
const QString lastName() const;
const QString firstName() const;
const QString middleName() ... |
8dd18862c996ec1e368aef54733dc2a167599b06 | 64fbf0357a45a74083e9da5a32c9e129846df3a2 | /starve_free_rw_problem.cpp | 27e40dbbdf25068c21ac1433a9b3ffd7a9da0237 | [] | no_license | namanjain-iitr/Starve_Free_Reader_Writers-CSN-232 | f2ed3f43f7944cb25f9ae528224156594b413a54 | e3510b3f6983585be3afb10b7e9865a542cb9bc1 | refs/heads/main | 2023-05-01T22:22:11.935664 | 2021-05-20T16:18:53 | 2021-05-20T16:18:53 | 365,302,676 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,617 | cpp | starve_free_rw_problem.cpp | #include <iostream>
using namespace std;
// A queue node.
struct Node
{
// Pointer to next node and process_id for current process
Node* next;
pid_t value;
};
class Queue
{
// Front pointer for pop operation
// Rear pointer for adding a new node
Node* Front, *Rear;
... |
55c226024c4d504b009498793f1d4eb5fa1c9c9b | 411f463efe186c9d6aa212edeed74e6c0ee7be4d | /src/StageBuilderLakes.cpp | da894a1cc6002231a4fa283b75f6a9a20b986885 | [] | no_license | glindsey/game-project-potential | 8b9f2710e5e1fdf17cef354bcb041ef5f7571457 | a7e806a53813e0d2f2eab9cd3eb119275b638743 | refs/heads/master | 2021-01-01T15:55:10.422272 | 2014-04-27T19:12:06 | 2014-04-27T19:12:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,131 | cpp | StageBuilderLakes.cpp | // *** ADDED BY HEADER FIXUP ***
#include <iostream>
// *** END ***
/*
* StageBuilderLakes.cpp
*
* Created on: Dec 10, 2012
* Author: Gregory Lindsey
*/
#include "../include/StageBuilderLakes.h"
#include "Application.h"
#include "ColumnData.h"
#include "MathUtils.h"
#include "Settings.h"
#include "Stage.h"... |
2be3438c6e6a17da3c33f2c8422ac2ddbc8ea19a | f6724b46574298a3b89ac558954eadc49c9f96f1 | /RotateArray.cpp | 99178058d4526b0f2dd250966bc26f8f84204a79 | [] | no_license | zrss/LeetCode | 5b0a6ce72d44859cc12a45edef8c5a371c149bc9 | 54ff11599b5c141072f94e77ce55731b76467f0d | refs/heads/master | 2020-04-06T00:57:25.675167 | 2016-10-22T03:26:26 | 2016-10-22T03:26:26 | 24,978,800 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 702 | cpp | RotateArray.cpp | #include <cstdio>
class Solution {
public:
void rotate(int nums[], int n, int k) {
k %= n; // there is a trap
if (k == 0) { // there is a trap when k == 0
return;
}
int gap = n - k;
inverse(nums, 0, gap);
inverse(nums, gap, n);
inverse(nums, 0, n);
}
vo... |
4ace37af82f61e7bdb99bad4187025baef847f8e | f68e5d09710fb2ee15e3a232a003d6caaa98116d | /src/context.h | c91f9aa6579521b76b86b5339d8bf60df43fbd71 | [] | no_license | learnerjiahao/mhhs | 19a2f64fda7fdc2e78d66d760f8153a3acb69adf | d3280a89d5d670e1c22ed30d957ce4e57e19edba | refs/heads/master | 2020-04-15T20:42:39.166556 | 2019-01-10T07:14:58 | 2019-01-10T07:14:58 | 165,005,333 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,104 | h | context.h | //
// Created by wujiahao on 18-5-7.
//
#ifndef MHHSS_CONTEXT_H
#define MHHSS_CONTEXT_H
#include "readInputs/config.h"
#include "message/routed_data_imsgs_pool.h"
class Context {
public:
RoutedDataIMsgsPool *IsendMsgsPool;
RoutedDataIMsgsPool *IrecvMsgsPool;
#ifdef USE_PTHREAD
pthread_t msgRecvMonitorT... |
5acac3288e2441b2245e45331b1717c232d08ece | 1e09459300ba48a674385a89cb16a0b84449149f | /Obesity_2.cpp | 3fa87118be444085b6c8a37ade8c4cdf0275514e | [] | no_license | SofiaPsal/Obesity_changes | 4877ff6d649a200ce7a279b808deb65ce6966cb9 | 1abe1e8ce1d766fe383e2760e4bd1a8a3bdd138b | refs/heads/master | 2022-10-11T18:08:22.097051 | 2020-06-04T20:03:15 | 2020-06-04T20:03:15 | 269,446,547 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,074 | cpp | Obesity_2.cpp | #include <vector>
#include <iostream>
#include <graphics.h>
#include <stdio.h>
#include <fstream>
#include <string>
#include <cstdlib>
#include <ctime>
using namespace std;
const int size=80;
class point{
public:
vector<vector<int> >grid;
vector<vector<int> >generate;
vector<vector<int> >ris... |
c4a1cad3dad818628d1c00f3e4269f9c0559ab09 | 422fc7efca60150311348cf0217053fde9932275 | /dependencies/FragmentFramework/include/systemUserInterface/uiTextInput.hpp | 82df9757b6f80209b40e08c5bbaa28a5557a7e3c | [
"MIT"
] | permissive | matusnovak/SM2OBJ | 99e57a1f7102016ace27987de28818a8402ce30b | 7e2f4b4f7bcc6ffec4e8951fe8e8d5becebcbef0 | refs/heads/master | 2020-05-20T03:06:54.489441 | 2015-10-25T22:11:43 | 2015-10-25T22:11:43 | 37,215,403 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,094 | hpp | uiTextInput.hpp | /*
* This file is part of FragmentFramework framework.
* Copyright (C) 2013-2015 by Matus Novak matusnov@gmail.com
* Licensed under the MIT License
*/
#ifndef FFW_SYS_UI_TEXT_INPUT
#define FFW_SYS_UI_TEXT_INPUT
#include "uiWidget.hpp"
/*!
* @ingroup User-Interface
*/
namespace ffw{
/*!
* @memberof ffw
*... |
e73764a8ba9c566aab8c09d00816460d7ed8dad8 | 21dfcc44840cb94058bcd014946f2a38fbf30c54 | /examples/dreamtorus/glx/main.cpp | 4573a2de85870a8e086c5c259705a45f90f967fc | [
"SGI-B-2.0",
"MIT",
"Libpng",
"BSD-3-Clause",
"LicenseRef-scancode-glut",
"Zlib",
"LicenseRef-scancode-public-domain",
"BSD-2-Clause",
"Unlicense"
] | permissive | nigels-com/regal | 819a74deeeac00860bcb6f21c3e59ccad1b78448 | 3f1a06d5c098339d30221c9e999640e4c5437a0b | refs/heads/master | 2020-12-14T16:19:29.701418 | 2015-10-18T08:57:48 | 2015-10-18T08:58:56 | 9,986,650 | 2 | 3 | null | 2014-07-12T07:28:49 | 2013-05-10T17:35:20 | C++ | UTF-8 | C++ | false | false | 3,983 | cpp | main.cpp | /*
This is free and unencumbered software released into the public domain.
Anyone is free to copy, modify, publish, use, compile, sell, or
distribute this software, either in source code form or as a compiled
binary, for any purpose, commercial or non-commercial, and by any
means.
In jurisdictions that recognize cop... |
db664fad2ce738e7961982ff950e9bd6251fb98d | 9e62a1aa56f8a7faf06029477bd16ae64b93e382 | /Buils/TEST/WTF_BackUpThisFolder_ButDontShipItWithYourGame/il2cppOutput/Generics35.cpp | b4ce2f33120a7ae48ae14d66bc9add201e375e8f | [] | no_license | arkatir/WTF | d606d30a976bae112ef4b82e54633a7bf201cb14 | fd8b7fe497a930e7d32ccb8b8c9de694d251b00f | refs/heads/main | 2022-12-27T12:22:28.055012 | 2020-10-08T15:40:05 | 2020-10-08T15:40:05 | 301,653,822 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,707,304 | cpp | Generics35.cpp | #include "pch-cpp.hpp"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <limits>
#include <stdint.h>
template <typename R, typename T1, typename T2>
struct VirtFuncInvoker2
{
typedef R (*Func)(void*, T1, T2, const RuntimeMethod*);
static inline R Invoke (Il2CppMethodSlot slot, R... |
6b163da3060ec1cd570012d02b35904f7763bb07 | 2ebd4553d638cedd3d53b6526aba154ec06fb660 | /SLCUPC-OJ/1181【二维数组】青年歌手大奖赛_评委会打分.cpp | 7a5d7caa5860a41acd00a48c352220ed0b25428a | [] | no_license | dongxiaorui/OJ | 7680942cdb19ff6ed859d5fcd99e2d230f236c71 | 8daeea2af1a9fe891aeb71e1392164305034a67f | refs/heads/master | 2020-06-04T07:09:17.796361 | 2019-06-14T10:00:14 | 2019-06-14T10:00:14 | 191,917,724 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 290 | cpp | 1181【二维数组】青年歌手大奖赛_评委会打分.cpp | #include<stdio.h>
int main(){
int num,n,sum,max,min;
while(scanf("%d",&num)!=EOF){
sum=0,max=0,min=9999;
for(int i=0;i<num;i++){
scanf("%d",&n);
sum+=n;
max=max>n?max:n;
min=min>n?n:min;
}
printf("%.2lf\n",1.0*(sum-max-min)/(num-2));
}
return 0;
}
|
24a0458ae9e5bcd5cd3a4aa9deaeb9fb4c2a7197 | 0149ed842327e3133fc2fe7b49d6ee2e27c22021 | /level_zero/tools/source/sysman/pci/windows/os_pci_imp.cpp | 2035afc57394529636f39b784ed7b042e63f1995 | [
"MIT"
] | permissive | intel/compute-runtime | 17f1c3dd3e1120895c6217b1e6c311d88a09902e | 869e3ec9f83a79ca4ac43a18d21847183c63e037 | refs/heads/master | 2023-09-03T07:28:16.591743 | 2023-09-02T02:04:35 | 2023-09-02T02:24:33 | 105,299,354 | 1,027 | 262 | MIT | 2023-08-25T11:06:41 | 2017-09-29T17:26:43 | C++ | UTF-8 | C++ | false | false | 8,025 | cpp | os_pci_imp.cpp | /*
* Copyright (C) 2020-2023 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#include "level_zero/tools/source/sysman/pci/windows/os_pci_imp.h"
#include "shared/source/memory_manager/memory_manager.h"
#include "level_zero/core/source/device/device.h"
#include "level_zero/core/source/driver/driver_handle... |
cecf49973a493cfba49dda08498689cb13414583 | e41ad6d5e27a0996acf8a152c1e7b6bbfb37bf91 | /Transceiver.cc | abdbf76bf6875e596195eb744c49c1801cc30962 | [] | no_license | annadaniot/Omnet-CSMA-Type-MAC-Protocol-over-a-Wireless-Channel-Model | 8ad6f28b1ccc967216bea3b96c4fd981fbedf221 | b138c8076a26695506592a54af91d755afc6b6f9 | refs/heads/master | 2020-03-21T03:40:27.928076 | 2018-07-05T09:31:26 | 2018-07-05T09:31:26 | 138,067,825 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 18,175 | cc | Transceiver.cc | /** Author: Haydn */
#include "Transceiver.h"
#include <cmath>
#include <ctgmath>
Define_Module(Transceiver);
int statNumSentPackets = 0;
//called when the simulation starts
void Transceiver::initialize()
{
EV << getParentModule()->getName() << ": initialsing Transceiver\n";
turnAroundTime = ... |
56ef81d5362c10c70582e1ff0b0e4600b624a8d6 | 374c957e14ec5ce96e11ef949862d26ce00d830a | /HG41_01_FractalTree_Base/HG41_01_FractalTree_Base/manager.h | ee334429bd0651711164d122d5cec38aa06c154b | [
"MIT"
] | permissive | Yu24maki/HG41 | 0cb41c3557e9579a6d945ba8cb8dd35f03a35237 | 04781174e0b596c9c2423564e3a0e0c3f05045aa | refs/heads/master | 2023-08-14T09:24:21.886938 | 2020-07-28T10:09:01 | 2020-07-28T10:09:01 | 263,252,361 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 133 | h | manager.h | #pragma once
class CManager
{
public:
static void Init();
static void Uninit();
static void Update();
static void Draw();
}; |
1a88f529740e965a0605401874c52e676e18902e | a3d6556180e74af7b555f8d47d3fea55b94bcbda | /extensions/common/api/declarative/declarative_manifest_handler.cc | 9ba8a672d59c167fe038580ae1c445800768e5d6 | [
"BSD-3-Clause"
] | permissive | chromium/chromium | aaa9eda10115b50b0616d2f1aed5ef35d1d779d6 | a401d6cf4f7bf0e2d2e964c512ebb923c3d8832c | refs/heads/main | 2023-08-24T00:35:12.585945 | 2023-08-23T22:01:11 | 2023-08-23T22:01:11 | 120,360,765 | 17,408 | 7,102 | BSD-3-Clause | 2023-09-10T23:44:27 | 2018-02-05T20:55:32 | null | UTF-8 | C++ | false | false | 1,223 | cc | declarative_manifest_handler.cc | // Copyright 2015 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "extensions/common/api/declarative/declarative_manifest_handler.h"
#include "extensions/common/api/declarative/declarative_manifest_data.h"
#include "extensions/commo... |
aaa2f8a135cb1b5a34fd1535c0aa1c46daead639 | b846d1c19bb29d3e9272e021adfd34e6313692b1 | /jeheath-cs2-week1/pointers/pointers4.cpp | 3525dfa9103bcc0660e2866c310ad8b33618c2a0 | [] | no_license | heathjohn62/CS2_all | d5510320280c4cb80050f60dda57660ab5e2f1bb | b8ff01d5630a48d18e0b22fb366b20398a456436 | refs/heads/master | 2021-05-14T13:21:08.554417 | 2018-03-04T21:19:50 | 2018-03-04T21:19:50 | 116,437,831 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,315 | cpp | pointers4.cpp | /**
* @file pointers4.cpp
* @author The CS2 TA Team <cs2tas@caltech.edu>
* @date 2015
* @copyright This code is in the public domain.
*
* @brief Pointer-fu Exercise 4: Typecasting vs. address-of
*/
#include <cstdlib>
#include <iostream>
using namespace std;
/**
* @brief performs type castings
*/
int main(in... |
0cd75f9f47c2dc1ab561790ed8b3c3adb5205f4a | f6c9c91f56f7814cbfa7c4e9af96c5d500cc4e86 | /Src/ProfileDataParser/OccupancyInfoDataHandlerImp.h | 26b3b1c4be751bded1ce7f4b1f2b5db2062c7af6 | [
"MIT"
] | permissive | juyoungkim-lisa/radeon_compute_profiler | 1f24877bb7ada1e61e6fba1dad67bbdbcca35ff0 | 43b01a1ee293e31762ac1e346bc454c93254fa7c | refs/heads/master | 2023-01-22T14:31:00.273091 | 2020-12-02T16:52:48 | 2020-12-02T16:52:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,457 | h | OccupancyInfoDataHandlerImp.h | //==============================================================================
// Copyright (c) 2017 Advanced Micro Devices, Inc. All rights reserved.
/// \author AMD Developer Tools Team
/// \file
/// \brief Occupancy Info Data Handler Implmentation header
//==========================================================... |
b460d369942476118926c0925cd2254656f2c221 | ce4e35363db5683d4a5d9c97fcee521d5d8dfb08 | /include/pgmlink/ext_opengm/indicator_function.hxx | 7138a37b0675fe767f387cd4755d80d5307d7f24 | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | martinsch/pgmlink | 36032c3fa9cd3908b65c4df921cd903a22c496a2 | ad0c7318a002897f64bb60284f2968a3a722051e | refs/heads/master | 2021-06-27T17:50:10.894556 | 2015-12-09T17:13:50 | 2015-12-09T17:13:50 | 16,145,841 | 19 | 10 | null | 2016-11-09T19:34:09 | 2014-01-22T17:04:36 | C++ | UTF-8 | C++ | false | false | 2,550 | hxx | indicator_function.hxx | #pragma once
#ifndef OPENGM_INDICATORFUNCTION_HXX
#define OPENGM_INDICATORFUNCTION_HXX
#include <algorithm>
#include <numeric>
#include <vector>
#include "opengm/opengm.hxx"
#include "opengm/functions/function_properties_base.hxx"
namespace opengm {
/// Indicator Function
///
/// The indicator function assumes two v... |
ccff703100697fe9b86e8bb081f07c6abcd1783a | dcc9a84c1766f3c49c92e81fe398d867f05e7b13 | /PathTracer/LambertianBRDF.h | fedb496e2ea9207548e9f9df653fd600c6b93556 | [
"MIT"
] | permissive | bbtarzan12/PathTracer | 13df271b893d91cc4e62846480bc77f9b17453c6 | 3178d6d2bfe05d505a67fbca4465cec154e3152d | refs/heads/master | 2020-12-27T08:28:48.766363 | 2020-03-08T09:00:41 | 2020-03-08T09:00:41 | 144,651,545 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 269 | h | LambertianBRDF.h | #pragma once
#include "Bxdf.h"
class LambertianBrdf : public Bxdf
{
public:
LambertianBrdf(const glm::vec3& R);
virtual glm::vec3 CalculateF(const glm::vec3& wo, const glm::vec3& wi) const override;
const glm::vec3& GetR() const;
private:
glm::vec3 R;
};
|
30168d9831d4685cd1d31036e62b99779d27584c | 4482484f2b93c407f12530c024dd4c934a4f51ca | /fbench/src/grpcclient/third_party/googleapis/gens/google/privacy/dlp/v2/storage.pb.cc | 00464c5a92c00871f4d4193630101fe0ed9827fa | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | kashiish/vespa | 3adc974a3f7618185bf5959da02dc311cacd749b | 307de4bb24463d0f36cd8391a7b8df75bd0949b2 | refs/heads/master | 2023-07-04T05:13:11.650818 | 2021-08-06T22:26:21 | 2021-08-06T22:26:21 | 377,258,605 | 0 | 0 | Apache-2.0 | 2021-08-06T22:26:21 | 2021-06-15T18:25:48 | Java | UTF-8 | C++ | false | true | 600,257 | cc | storage.pb.cc | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: google/privacy/dlp/v2/storage.proto
#include "google/privacy/dlp/v2/storage.pb.h"
#include <algorithm>
#include <google/protobuf/stubs/common.h>
#include <google/protobuf/io/coded_stream.h>
#include <google/protobuf/extension_set.h>
#include <goo... |
e441f9ca16a5caf417834767b9793ca501fccde0 | c5f1a804dbd1f5de123469dd5432633633e80597 | /PicturePuzzle/LayoutSwapper.h | 211949cdeca5f5822991c70a64894b600d82b86b | [] | no_license | brosell/HTS-Games | 2d03a8988adc5c613dba1e249a7e0b409593ff11 | 3c7c1cc2ec4fe0ba7865f6eec5cec905faab5a3f | refs/heads/master | 2021-01-22T21:23:38.681074 | 2020-01-12T15:41:47 | 2020-01-12T15:41:47 | 85,423,760 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 987 | h | LayoutSwapper.h | /* ****************************************************************************
*
* LayoutSwapper.h
* Created by Bert Rosell, on Sun Nov 16 2003, 19:30:27 Eastern Standard Time
*
* Copyright (c) 2003, Bert Rosell
*
*
*
* File Contents: Interface and documentation of the LayoutSwapper component.
*
*******... |
5301b974f7a970cf6466de2be0e4c07c648041c4 | 78d79a4d975dd5692334b24a8b514dee4c03dade | /include/SPTS.h | f6180075ee46e07e8ea2d7f5460cd8dc0621518d | [] | no_license | sjneph/Automated-Power-Test-Station | 47c9c311dc5f7f55b3cdaa4642d57138da48fe62 | c755abe7c93ad2d0e946a80cc925a43fad390d37 | refs/heads/master | 2022-08-15T07:05:37.978483 | 2020-02-03T17:24:35 | 2020-02-03T17:24:35 | 238,019,551 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,093 | h | SPTS.h | // Macro Guard
#ifndef SPTS_InstrumentRack_H
#define SPTS_InstrumentRack_H
// Files included
#include "Converter.h"
#include "ConverterOutput.h"
#include "InstrumentTypes.h"
#include "NoCopy.h"
#include "ProgramTypes.h"
#include "SingletonType.h"
#include "StandardFiles.h"
#include "StandardStationFiles.h"
#include "S... |
1d04e0e64efed7d17856634cbf33f17eece2ece5 | a3d6556180e74af7b555f8d47d3fea55b94bcbda | /chrome/browser/ash/input_method/longpress_suggester.cc | 7191d02c6e52b7bdd4a6e187413162b8fa2e9c95 | [
"BSD-3-Clause"
] | permissive | chromium/chromium | aaa9eda10115b50b0616d2f1aed5ef35d1d779d6 | a401d6cf4f7bf0e2d2e964c512ebb923c3d8832c | refs/heads/main | 2023-08-24T00:35:12.585945 | 2023-08-23T22:01:11 | 2023-08-23T22:01:11 | 120,360,765 | 17,408 | 7,102 | BSD-3-Clause | 2023-09-10T23:44:27 | 2018-02-05T20:55:32 | null | UTF-8 | C++ | false | false | 1,284 | cc | longpress_suggester.cc | // Copyright 2023 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ash/input_method/longpress_suggester.h"
#include "chrome/browser/ash/input_method/suggestion_handler_interface.h"
#include "third_party/abseil-cpp/abs... |
e54c1b31b0028077b907fc2a09321234b7777a62 | fa1ad2e2ac7e376fc7cb3b3a6e1bb88eed3e80be | /olap/doris/be/src/vec/exec/scan/new_olap_scanner.h | 28adc4d5fe488e1884faca1f101b40ba24cd89c9 | [
"OpenSSL",
"Apache-2.0",
"BSD-3-Clause",
"LicenseRef-scancode-facebook-patent-rights-2",
"PSF-2.0",
"dtoa",
"MIT",
"GPL-2.0-only",
"LicenseRef-scancode-public-domain"
] | permissive | alldatacenter/alldata | 7bc7713c9f1d56ad6b8e59ea03206d1073b7e047 | 8d5f9a2d49ab8f9e85ccf058cb02c2fda287afc6 | refs/heads/master | 2023-08-05T07:32:25.442740 | 2023-08-03T13:17:24 | 2023-08-03T13:17:24 | 213,321,771 | 774 | 250 | Apache-2.0 | 2023-09-06T17:35:32 | 2019-10-07T07:36:18 | null | UTF-8 | C++ | false | false | 3,641 | h | new_olap_scanner.h | // 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... |
0e05b73354b20eecff90b291e509da81ce23b401 | 9c9cc2acbd290b3d4f2c1c1e5af7280b25c69eaa | /SOB1/SOB1/GenerateFile.h | 8710ac21561dd085eb8970f4a2355a2a019600e9 | [] | no_license | fudalejt/AssertionCpp | 0cd7171c50031763e27b5fe1bf7123f1c94bdeaa | 6370944047493f37eff88f2c35f6f3f32d14405a | refs/heads/master | 2021-01-20T07:32:07.421926 | 2017-05-02T10:48:25 | 2017-05-02T10:48:25 | 90,011,085 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,304 | h | GenerateFile.h | #pragma once
#include <string>
#include <fstream>
#include <time.h>
#include <cstdlib>
#include <cassert>
using namespace std;
template<typename Type>
class GenerateFile
{
public:
GenerateFile(std::string path, int min, int max, int count);
virtual ~GenerateFile();
void generateFile(string path);
void setMinMax(in... |
085e98bf6bd1d67087f65a9b75cb8310e175646a | adeb2c3b7506c5f96d3a65267e8d463bf5039a77 | /SpatialGDK/Source/SpatialGDK/Public/Interop/SpatialOutputDevice.h | 5421bde591c31a4215530ac907c7b6080d6556f3 | [
"LicenseRef-scancode-generic-cla",
"LicenseRef-scancode-proprietary-license",
"MIT"
] | permissive | spatialos/UnrealGDK | e09debdf2588cefa6f9c6d4e8216cb629d3f294d | 884b06543c9216e9ac57b62d4d7bbc1eaf83ce27 | refs/heads/0.11.0 | 2023-09-02T13:54:10.491925 | 2020-09-03T11:19:49 | 2020-09-03T11:19:49 | 109,980,189 | 421 | 173 | MIT | 2022-01-24T18:53:24 | 2017-11-08T13:35:16 | C++ | UTF-8 | C++ | false | false | 939 | h | SpatialOutputDevice.h | // Copyright (c) Improbable Worlds Ltd, All Rights Reserved
#pragma once
#include "CoreMinimal.h"
#include "Misc/OutputDevice.h"
#include <WorkerSDK/improbable/c_worker.h>
class USpatialWorkerConnection;
class SPATIALGDK_API FSpatialOutputDevice : public FOutputDevice
{
public:
FSpatialOutputDevice(USpatialWorker... |
c236670e48ef9bb79a06dd6c8bbcf6d57f40bdf5 | b603d09df55027fc25067d799c1dec2ff9d1acc9 | /waypointnavigation.cpp | 8c75088c42c8cce4c784769e3c885c0467a03a30 | [] | no_license | Zeltnervonbank/Sem5ProjControl | d25d42bb3c30006fd9a2694ce9bccb17a1dbeb85 | faa476c26be36d63a2525f16ea7112dfd68fefe8 | refs/heads/master | 2020-03-31T08:34:06.560105 | 2018-12-14T00:41:19 | 2018-12-14T00:41:19 | 152,063,187 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,934 | cpp | waypointnavigation.cpp | #include "waypointnavigation.h"
WaypointNavigation::WaypointNavigation()
{
}
void WaypointNavigation::NavigateToNextWaypoint()
{
// If the robot is close to the active waypoint and there are more waypoints in queue
if(Globals::GetDistanceToWaypoint() < 0.1 && Globals::waypoints.size() > 0)
{
// G... |
ca8967580f83ee7a64388b177a81681945d60a4b | a648fcbc90606b5ac2ac3e9ee53c4a8fffcf14e4 | /BattleTankOnline/BattleCity/BattleCity/Tank.cpp | 0e1d6dadd7790f8bf2e1aaf963ef87448931058d | [] | no_license | vanhoaile95/OOAD-SVN | 35e61569180367dbd9652e6e86a667f4bc6f174e | 282fec76ce3a4baf46539e11e44343ea8b2d4036 | refs/heads/master | 2020-06-18T01:22:06.103481 | 2017-01-04T15:43:54 | 2017-01-04T15:43:54 | 74,960,984 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,515 | cpp | Tank.cpp | #include "Tank.h"
#include "Global.h"
#include "GameScore.h"
Tank::Tank(P pos, BObjectName Name,int tankid) :DynamicObject(pos,Name)
{
ShieldSprite = TextureRectManager::GetInstance()->GetRECTWithName(BObjectName::TANK_SHIELD);
CurrentTankColor = (Color) (int) ObjectName;
Type = TypeBoxCollision::TankBox;
... |
d7881de55bcf4b4718352ed054ec1bef9fa6416d | 35e63f581563115d937daeb5be3b7604c46d093c | /123r.cpp | 5ffd1122374f3364a90616b9db6a9e70f1b29acf | [] | no_license | MattSi/uva | a72338acd9b69951dff5617af5416e504d31b694 | 2627451ecb25d8ff0086d1161470fe2a2e9622b9 | refs/heads/master | 2020-04-28T21:11:01.030263 | 2019-08-27T00:04:03 | 2019-08-27T00:04:03 | 18,387,534 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,890 | cpp | 123r.cpp | #include <iostream>
#include <algorithm>
#include <string>
#include <map>
#include <sstream>
#include <vector>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
struct ok
{
map<int,int> record; //记录那句话，有几个重复的
};
ok a[10001];
int main()
{
int i,j,k,l,... |
d5dd18d5af912ea67264fa2bdeab3b6c07679ee7 | dd4cc2393da9b60173a8522cda5a9f625cfe07ba | /nwerc2007/test.cpp | bfe7845296179bf514ef20f5fff562a108dee576 | [] | no_license | andrei-alpha/acm | 5d764ea38f13c9522fca40ad3ad2e543175d1bc8 | 0dae07b09053c3f1b0eee316cab2c6fb8edc4fad | refs/heads/master | 2020-04-25T20:56:18.783588 | 2014-11-24T09:01:52 | 2014-11-24T09:06:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 389 | cpp | test.cpp | #include <cstdio>
#include <cstdlib>
int test(const int b[10000]) {
int sum = 0;
for (int i = 1; i <= 10; ++i)
sum += b[rand() % 9999];
if (sum < 3)
printf("ok baby!");
}
int main() {
int a[10000];
for (int i = 1; i < 10000; ++i)
a[i] = i;
for (int j = 1; j < 100000; ++j)
test(a);
fo... |
d25492a8db6e9599fb94ad57a03563c458624363 | 051d53e30186222eca76d82dec20ba50614aed0a | /basebench/main.cpp | 168ed683970510bba58c024927aa2b0cb251bff8 | [] | no_license | jjzhang166/benchUI | 32e84a35e3a4716497252497e1aa593e94192f00 | 338ad3071d3e304121dd8dca1557890689084be7 | refs/heads/master | 2023-04-14T07:46:47.353414 | 2020-07-31T06:13:59 | 2020-07-31T06:13:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 240 | cpp | main.cpp | #include "main.h"
int main(int argc, char *argv[])
{
QApplication a(argc, argv);
infoPage = new info_Page;
infoPage->show();
int ret = a.exec();
qDebug() << "App exec result: " << ret << endl;
delete infoPage;
}
|
09d3158570cbee470f3e26ea1a6e515bf0d8136e | d0d0ae6bb5a300fe15b075b6857834def9435a89 | /Edit Distance/main.cpp | 3423e014c51ad37a7a2cb4dd3f85e5c3ba5bff99 | [] | no_license | gagan86nagpal/Interview-prep | 4664eaaea3ac3e00215d3d7ac4945c25050785eb | 0548575edf81e9de3b7324fcf16c8b52ccb0ec71 | refs/heads/master | 2021-01-16T18:17:56.974517 | 2017-11-04T02:08:39 | 2017-11-04T02:08:39 | 100,056,019 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,059 | cpp | main.cpp | #include <iostream>
using namespace std;
// Taking all the cases and choosing the minimum among them
int editDistance(string &a , string &b,unsigned i,unsigned j)
{
if(i==a.size()) // a is exhausted , so cost includes either deleting b characters or inserting characters in a
{
return b.size()-j;
}... |
855b9e7220e41991adcc06e0c6a30e3bc4a6bdf7 | 326c5d924956c1837704d23b498772a2d8efd187 | /Examples/Display/SineScroll/Sources/sinescroll.cpp | 204e38852e8b8290d55c3b0899dc97054e667f5e | [
"Zlib"
] | permissive | sanikoyes/ClanLib | c4eb8004eb6a10ed4429f15b63f3ba0d2835a930 | 4f9e7f5dd2edb12e55ec713f6299c874709524e9 | refs/heads/master | 2021-01-22T17:28:25.241676 | 2015-04-11T23:46:24 | 2015-04-11T23:46:24 | 33,925,347 | 3 | 1 | null | 2015-04-14T10:22:33 | 2015-04-14T10:22:33 | null | UTF-8 | C++ | false | false | 3,917 | cpp | sinescroll.cpp | /*
** ClanLib SDK
** Copyright (c) 1997-2015 The ClanLib Team
**
** This software is provided 'as-is', without any express or implied
** warranty. In no event will the authors be held liable for any damages
** arising from the use of this software.
**
** Permission is granted to anyone to use this software for a... |
2b298d194a68a8b5494b04219188e628acd53247 | 85b400473900b29f851692be59af07bee2fb7fde | /lab2/polybius/main.cpp | e9276eed05c21a271061867a923c3b55036bda67 | [] | no_license | kartytko/jimp-exercises | 447aac6ab8eaa027aa0d44a604e6c86fa7e0b0ee | 1833b68b1e8efdee2513b561bcac6167682b2b61 | refs/heads/master | 2021-01-17T15:04:04.368002 | 2017-03-16T08:49:42 | 2017-03-16T08:49:42 | 84,104,163 | 0 | 0 | null | 2017-06-06T10:27:31 | 2017-03-06T17:59:47 | C++ | UTF-8 | C++ | false | false | 1,613 | cpp | main.cpp | //
// Created by kartytko on 09.03.17.
//
#include <iostream>
#include <fstream>
#include "Polybius.h"
int main(int argc, char** argv){
if(argc!=4){
std::cout<<"Niepoprawna ilość argumentów";
return 0;
}
if(*argv[3]=='1'){
char line[256];
std::string str_encrypted;
... |
e739a94b1e21240507357ca80a2b7d145089735d | 7a1df4d5cc0afcb2dd15b8d4569242d676353933 | /binary search/Sqrt(x).cpp | de9165b3cb4781e7d3aae68e793c0c72d8027790 | [] | no_license | jeevita06/LeetCode | 52d9f13fd930a43c064d91ca40baf7013a587a2a | 5a6226b77483f2f288b433f991ed6b90bd1482ce | refs/heads/master | 2022-03-28T14:35:51.775538 | 2019-10-12T10:41:41 | 2019-10-12T10:41:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 455 | cpp | Sqrt(x).cpp | /*
https://leetcode.com/problems/sqrtx/
Runtime: 12 ms
*/
class Solution {
public:
int mySqrt(int x) {
int left=1;
int right=x;
if(x==0) return 0;
while(true){
int mid=left+(right-left)/2;
if(mid>x/mid){
right=mid-1;
}
... |
0cb8718fa44d7c94eaf7e877ca1398a9b6fe0284 | 2f07af42f60c5b7b6e365b7aa75ec0ef52a86ffc | /CodeForces/342A - Xenia and Divisors.cc | 453f3dd5d0585148d64391425d6b5039bd514330 | [
"MIT"
] | permissive | MrSiz/Coding | d1cff5f47a0b4b3530bdc0db641b23f55bd8e2ae | 6e3454c9143563748b98f192102c3b6ff4c3be4f | refs/heads/master | 2021-01-19T06:47:43.503988 | 2018-06-18T02:26:02 | 2018-06-18T02:26:02 | 87,500,519 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,046 | cc | 342A - Xenia and Divisors.cc | #include <set>
#include <queue>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <iostream>
#include <map>
#include <cmath>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define pr(x) (cout << #x << ' ' << x << ' ')
#define prl... |
bac042da4fb0e5676caa497113adc002e72abbb9 | 88fa9b45d0b0e7871e6b79702f80d6d6f1adfc61 | /src/SyntaxTree.h | 4b6e36ecfef583633406f0410247120e4991774e | [] | no_license | leidegre/parc | b5a42192af0169a54f8981f1de63965e452c7648 | e03044940c69957baacf77d6d1fcecdc0aefb0a1 | refs/heads/master | 2021-01-21T21:47:51.078813 | 2015-06-07T15:13:26 | 2015-06-07T15:13:26 | 6,849,612 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,524 | h | SyntaxTree.h | #pragma once
#include "Slice.h"
#include "Token.h"
#include <cassert>
#include <string>
#include <vector>
namespace parc {
class SyntaxTree {
public:
enum {
kNone,
kToken,
kSyntax,
};
SyntaxTree(int type) : type_(type) {}
int GetType() const { return type_; }
virtual void DebugString(std::stri... |
b350b742bec62dcecb2ba280d0e37e017dbf821d | 4f3664d4212e49f214561b5e4104765c3d03e0b1 | /ex03.cpp | cd1c9012e4bf2ac6f06e554239ba3b4ecca41241 | [] | no_license | xochitlsosa/functions2 | 017f654700efa9b614e793c4d3be9c5612bff4a5 | 7dacd4260d898de6bb6b5ab0b34ca008e1b10b83 | refs/heads/main | 2023-03-28T02:01:58.980615 | 2021-03-18T05:24:40 | 2021-03-18T05:24:40 | 348,931,341 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 358 | cpp | ex03.cpp | #include<iostream>
using namespace std;
int main ()
{
int arr[10], n, i, pro = 1;
cout << "enter the amount of elements : ";
cin >> n;
cout << "\nenter the numbers: ";
for (i = 0; i < n; i++)
cin >> arr[i];
for (i = 0; i < n; i++)
{
pro *= arr[i];
}
cout << "\nproduct of ... |
89fda6124f6d81dc21cf48ec0169effb16f51466 | bfaa444b559921f0504d974ecb5b83f1bedb61ae | /inordertree/main.cpp | 31f8aa59523956bcc1341280205b81e125e2269d | [] | no_license | xc1129/Algorithm-learning | 4605b52aebb33a1e861d6fbe054bd09b09572506 | 04f9f1d74ea61f43e5004589bf53feaf7db84ebe | refs/heads/master | 2020-05-17T10:58:12.981320 | 2012-06-01T08:37:00 | 2012-06-01T08:37:00 | 4,319,087 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 90 | cpp | main.cpp | /*
* Author: Spirit_xc
* Description:
*
*
*
*/
int main()
{
return 0;
}
|
f26bd206f0e371727b77083eab5d34d244a63ecc | 6a42841765f2356da99d9844cab8f3f3353eaebf | /Game/开发库/Include/D3DFont.h | 8e110b45560cb8acabed8773a32261df38abe41a | [] | no_license | Ivanhan2018/wh6602_zhuque | d904e1d7136ed7db6cd9b46d65ab33797f400a74 | b0e7e574786eac927d109967618ba2a3af5bbee3 | refs/heads/master | 2020-04-05T17:28:14.739789 | 2018-12-24T07:36:47 | 2018-12-24T07:36:47 | 157,062,380 | 2 | 8 | null | null | null | null | GB18030 | C++ | false | false | 2,493 | h | D3DFont.h | #ifndef D3D_FOUNT_HEAD_FILE
#define D3D_FOUNT_HEAD_FILE
#include "D3DDevice.h"
#include "D3DTexture.h"
#include "D3DEngineHead.h"
//////////////////////////////////////////////////////////////////////////
//常量定义
#define MAX_GRAY_LEVEL 3 //灰度等级
#define MAX_BUFFER_COUNT 512 //缓冲数目
///////////////... |
72706d63411be513039be8760af9c618251f0637 | fc0a2b5796862dbb93ae43080354ccc2c5d6d4ee | /libsets/Var1/Rnr/GL/Extendio_GL_Rnr.h | 646e3bfcdec0ed3d5208de7bca6c319479082fca | [] | no_license | osschar/gled-all | d95f0e0a839f8af7eff3b11ae3a2108d6459fdf5 | 82c1399ff12438fd1faccf3d5f2503ebbad78183 | refs/heads/master | 2021-04-09T10:53:22.500357 | 2015-03-09T22:48:46 | 2015-03-09T22:48:46 | 125,408,699 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 759 | h | Extendio_GL_Rnr.h | // $Id$
// Copyright (C) 1999-2008, Matevz Tadel. All rights reserved.
// This file is part of GLED, released under GNU General Public License version 2.
// For the licensing terms see $GLEDSYS/LICENSE or http://www.gnu.org/.
#ifndef Var1_Extendio_GL_RNR_H
#define Var1_Extendio_GL_RNR_H
#include <Glasses/Extendio.h>... |
303863ba949210c8f44e36769ed79863c08fc54d | 34be623e83725b726966bdb967dd4e8501a1efde | /MapHelper.h | e160dbcbd36e4445aa5270b627586e2b63ebe04d | [] | no_license | wangdamu/aoimap | 2c0d4049f3a9d2ab4a723463a6b54e9264b0c2ec | d17b0605dda11f03f7ce002b0afeabec43ca6edc | refs/heads/master | 2020-05-17T22:22:31.237227 | 2015-07-10T09:27:40 | 2015-07-10T09:27:40 | 38,872,438 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 161 | h | MapHelper.h | #pragma once
class MapHelper
{
public:
inline static int getCellKey(unsigned int cellX, unsigned int cellY){
return (cellX << 16) | cellY;
}
};
|
f8743ae1835c7ad7250f1ac28f89241abf01d7f1 | 8e3bed8a6cdd5f979840b205f9cedbe297769f13 | /Source/DataServer/src/LogProc.cpp | 07e51bf1ea5a37d0efd51a09cc99e47792c5ea40 | [
"MIT"
] | permissive | vuonglequoc/ServerSimulator | 93cd48edf1cd5bec77e9c823b930bf35f26c7111 | 12bd6f24fcf957c657864a81da3dfb0467b48c2b | refs/heads/master | 2023-02-03T05:55:40.232793 | 2020-12-19T22:27:34 | 2020-12-19T22:27:34 | 35,360,781 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,495 | cpp | LogProc.cpp | #include "StdAfx.H"
#include "LogProc.H"
LogClass CLog;
TCOLORS TColor;
// -------------------------------------------------------------------------------------------------------------------------------------------------------
LogClass::LogClass()
{
PrepareClass();
}
// ---------------------------------------------... |
b8d4e892926ed9d84c7d7882ee67e4c982cf2222 | d954b6d44056558ccb1351d6c8e74e5f12c95b3e | /Main/world.cpp | a00abf09ea0b2755be9a53394fbf2dc260a20972 | [] | no_license | CrapStudio/X1918 | e75d2d415cc3e4cc1ce285843ff75d586ed55c1a | fe512dace5c92223ff38a144a066dd62b9871fec | refs/heads/master | 2021-01-25T12:07:24.304809 | 2014-12-31T13:28:54 | 2014-12-31T13:28:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 622 | cpp | world.cpp | #include "world.h"
#include <ctime>
#include <math.h>
#include <windows.h>
world::world()
{
x=0;
y=0;
typ=0;
czy=0;
event=0;
}
void world::worldgen()
{
srand(time(0));
for(int i;i<10;i++)
{
int x=i;
for(int j;j<10;j++)
{
... |
6db98a6d1ea3f513aa523207812dd2a034fe85d0 | 600e5ac0cc6abcd0a22412cee1e207be6a4dedb7 | /Projects/Sorting/Sorting/Insertion.cpp | 8e7384efd7768eb58abcc1e7eb16c87253321721 | [] | no_license | raokartikkumar24/TAS | 7192e5c5893f5d7ade065fb1d951dccf2a9aab5c | f042c3825b598144486242f707619bc23d7742f4 | refs/heads/master | 2021-01-10T22:10:31.099221 | 2015-08-08T15:08:44 | 2015-08-08T15:08:44 | 40,229,260 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,720 | cpp | Insertion.cpp | #include "stdafx.h"
#include "Insertion.h"
#include "DataSet.h"
#include <fstream>
#include <iostream>
#include <algorithm>
CInsertion::CInsertion()
{
}
CInsertion::~CInsertion()
{
}
void CInsertion::FileToSort(std::string filepath)
{
m_sFileToSort = filepath;
}
void CInsertion::Sort()
{
... |
2116ea00881c362e53be29277be37ff8a46568fb | c045e031ac453124043f649eefbe6c23e35ccdda | /windows/ccsdrvTest/ccsdrvTestDlg.h | 2d23970ddfda2db5b7b41f402e4e494b5c7499ac | [
"MIT"
] | permissive | grodansparadis/vscpl1drv-ccs | bbc6a5a16bc34f8b7452fd320ac8b662292888e0 | f4ae8c6a9f124459197e429cbdef86ea70f1fa40 | refs/heads/master | 2020-08-27T10:02:47.976859 | 2020-01-14T10:18:54 | 2020-01-14T10:18:54 | 217,326,625 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,074 | h | ccsdrvTestDlg.h | // ccsdrvTestDlg.h : header file
//
// Copyright (C) 2000-2020
// Ake Hedman, Grodans Paradis AB, <akhe@grodansparadis.com>
#if !defined(AFX_CCSDRVTESTDLG_H__DB07F138_0A91_4C67_9915_A72470AD5FED__INCLUDED_)
#define AFX_CCSDRVTESTDLG_H__DB07F138_0A91_4C67_9915_A72470AD5FED__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#... |
5d8f1c8e7038e57af58bdf243a2f50a96037a1c8 | 31c248110683fa84f42a36985dbe3bfeef79b004 | /uva11951/uva11951.cpp | 92cdc4464fa4485dad4d0b85de6b90d8b2fd48e0 | [] | no_license | shailesh1001/uva-solutions-1 | 803a6fcc1f5a0bad650e6b5c02972345c915194f | 3c839ccdf1b05eb4086fb404990556e693c932a9 | refs/heads/master | 2021-01-14T12:05:52.082640 | 2015-10-04T10:49:10 | 2015-10-04T10:49:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,912 | cpp | uva11951.cpp | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <sstream>
#include <set>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cstdio>
#include <cmath>
#include <climits>
#include <cstrin... |
f4f67ac5175cf96cea4d886f2c3044c10c451679 | 36d37de677ccf25b0ee33ca8d5ba897c887eae55 | /Ex_09/main.cpp | d4ea4c398b31fe3bf1d8f1c5b8a2692e511e1c2d | [] | no_license | CostanzaPaternoster/LSN | 6e033cad13d77c4663fc0f18ad9dafefe6945b99 | 98770a8683563ee89c47116488cd9e38ea7bc095 | refs/heads/master | 2022-04-16T06:34:23.119040 | 2020-04-18T17:08:00 | 2020-04-18T17:08:00 | 255,619,668 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,730 | cpp | main.cpp | #include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <cmath>
#include <stdlib.h>
#include "funzioni.h"
#include "costanti.h"
using namespace std;
int main(){
// Carica parametri da file di input parameters.dat
Input();
// Crea la mappa delle città (geometry = 1 -... |
b294c6288c8a36534e9fed50b0a9a754766c4276 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/httpd/gumtree/httpd_old_hunk_7019.cpp | f7854dcc9d0a4568e233be98b134c14cf3377e0f | [] | 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 | 541 | cpp | httpd_old_hunk_7019.cpp | case token_or:
#ifdef DEBUG_INCLUDE
ap_rputs(" Evaluate and/or\n", r);
#endif
if (current->left == (struct parse_node *) NULL ||
current->right == (struct parse_node *) NULL) {
ap_log_error(APLOG_MARK, APLOG_NOERRNO|APLOG_ERR, r->server,
... |
59261fc6b4549510a3ac243c530a236fb807300f | b0ee03926ee77ebe1bbfe0e619a56eeae837bde1 | /Online-Judge-Solutions/UVA/10938 - Flea circus.cpp | fdc7e07b9bd2e586b0c92191cf85202f9b11f935 | [] | no_license | artugal28373/CompetitveProgramming | 6457a44f03cf3b62c2cdb832dcd7ee4c95d272a3 | e41e1b7ea46ab4088ef487bf00ab0aad7dc06ef9 | refs/heads/master | 2022-04-10T11:15:19.804675 | 2019-09-30T20:35:03 | 2019-09-30T20:35:03 | 476,767,051 | 1 | 0 | null | 2022-04-01T15:07:20 | 2022-04-01T15:07:19 | null | UTF-8 | C++ | false | false | 5,267 | cpp | 10938 - Flea circus.cpp | #include <bits/stdc++.h>
#define pii pair <int,int>
#define pll pair <long long,long long>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP ... |
f2f5d1cb3af81c2532c154b7f87854fc61ba2225 | c1ef7d20c5ee8c324d1c77d436c91d7b5076442a | /算法与数据结构/cpp_leetcode/152 乘积最大子数组/main.cpp | 916271ec2a246921bdc520962174413c96d5e53d | [] | no_license | Daibingh/MyAlgoLearning | 3cf91e763decbd24211e4bdb1ffd6eb36c57b345 | 0c49bfdc55eb7f325a10a1aff1c7936cc353cc43 | refs/heads/master | 2023-07-08T21:08:00.301218 | 2021-08-15T02:39:59 | 2021-08-15T02:39:59 | 294,886,010 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,258 | cpp | main.cpp | #include "utils.hpp"
using namespace std;
/*
给你一个整数数组 nums ，请你找出数组中乘积最大的连续子数组（该子数组中至少包含一个数字），并返回该子数组所对应的乘积。
*/
// 动态规划解法，dp[i][j] 以 i **结尾**的子数组的最值 （最大值和最小值都要保存）
// 状态转移过程中，要考虑到当前数的 符号， 负数使得 过去的 最大值与最小值发生颠倒，
// 总之，最值在 有两种情况：1) 与上一个数构成一个子数组 2) 单独构成一个子数组 。 取两种情况的最大值
class Solution {
public:
int maxProduct(vecto... |
cf474df2607b99243d091587c3a8c57032b37b0e | bb0715a749b421a257e9b7081a4f69c4f3fad586 | /gicp/src/gicp.cpp | 5475502b38b5b3a4c856197d46d82c9fab21c372 | [] | no_license | lev2cu/research | ca2b2fecf134bb5e65f7e4cf01e32c1832a054eb | e05a1047399d42241d91e59c14019abf733d79ab | refs/heads/master | 2021-01-22T04:49:13.006639 | 2014-11-04T19:46:34 | 2014-11-04T19:46:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,367 | cpp | gicp.cpp | /*************************************************************
Generalized-ICP Copyright (c) 2009 Aleksandr Segal.
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... |
ca3302c5f76557931db8c22f20a2f323eb2812f6 | 1c57689889ffd8868db878e225ab2dcfed5eda7d | /inc/Shape.h | 7b03ab311939703dd3c59d38139d11fd15eff54f | [] | no_license | ioDiken/cmpe180a | 57b6b96ba11a0ab0a7d185273ab4ff339bd41fbf | 804b95c972ed26f274680f988ac1d348d73358a5 | refs/heads/master | 2023-04-09T11:04:24.359261 | 2021-04-20T06:11:25 | 2021-04-20T06:11:25 | 336,892,242 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 857 | h | Shape.h | /**
* @file Shape.h
* @brief Shape Classes
* @sjsuid 011280893
* @author Nicolas Diken
*/
#ifndef Shape_h
#define Shape_h
#include "XYPoint.h"
class Shape
{
public:
virtual double area() = 0;
};
class Circle : public Shape
{
public:
Circle(const XYPoint& c, double r) : centre(c), radius(r){}
doubl... |
93d91fb29dffcc3d6a8b500cd1ec68aa444b07ba | 7396ebd54ae4b391bc71ae5132d3d4961c0871fa | /kattis/icpcteamselection.cpp | 41ed6b01c2afda493ee54aeec14f195892d00b85 | [] | no_license | luis201420/competitiveProgramming | 41db36ea165bfe089ef20ce7c3dbd32abc7eda54 | 930ddfe54dd5c4bb2e9f7c28921d3159177dd0c1 | refs/heads/master | 2020-09-20T18:03:01.659246 | 2019-11-28T03:43:06 | 2019-11-28T03:43:06 | 224,554,177 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 368 | cpp | icpcteamselection.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int t,n,res,aux;
cin >> t;
vector<int> ns;
while(t--){
cin >> n;
ns.resize(3*n);
for(int i=0;i<(3*n);i++)
cin >> ns[i];
sort(ns.begin(),ns.end(),greater<int>());
res=0;aux=n;
for(int i=1;i<(3*n)-1&&aux;i+=2){
res+=ns[i];
au... |
647d6f10dd979146582f4be754e6d7ffec204a9a | 464aa9d7d6c4906b083e6c3da12341504b626404 | /src/lib/moo/image_texture.ipp | 057d843b9c735c2d73c07d2ee02e9021e413019a | [] | no_license | v2v3v4/BigWorld-Engine-2.0.1 | 3a6fdbb7e08a3e09bcf1fd82f06c1d3f29b84f7d | 481e69a837a9f6d63f298a4f24d423b6329226c6 | refs/heads/master | 2023-01-13T03:49:54.244109 | 2022-12-25T14:21:30 | 2022-12-25T14:21:30 | 163,719,991 | 182 | 167 | null | null | null | null | UTF-8 | C++ | false | false | 5,174 | ipp | image_texture.ipp | /******************************************************************************
BigWorld Technology
Copyright BigWorld Pty, Ltd.
All Rights Reserved. Commercial in confidence.
WARNING: This computer program is protected by copyright law and international
treaties. Unauthorized use, reproduction or distribution of thi... |
4622018a0bd817163126a0c1bf12bdf766e65f3f | 75066c5b728ea31ec3f4c1edcd8a0edb3aab606e | /angry_ghosts/enemy.cpp | 8cbb484059dbc10695d91ec3df20f38fb89dba09 | [] | no_license | ravg95/GUI_Programming_IFE | 8cbb9d389f87bd58d841b5207804558b22e8498c | e6d7a53539cb643ba40782617126c048d4cec352 | refs/heads/master | 2021-01-22T03:22:46.731722 | 2017-02-07T03:32:28 | 2017-02-07T03:32:28 | 81,118,750 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,360 | cpp | enemy.cpp | #include "enemy.h"
#include <QGraphicsScene>
#include <QKeyEvent>
#include <QTimer>
#include <cstdlib>
#include <time.h>
Enemy::Enemy(QGraphicsItem *parent,QGraphicsScene * scene, int enemynumber, Player * player): QObject(), QGraphicsPixmapItem(parent){
this->enemynumber = enemynumber;
this->player... |
78b75f25414841a6413732704fc5122eaf4c40a1 | 05f0cab2f3c7426a0ae3bbe38e42e261c03ca49b | /application/sdk_server/unittest/mdcmem/mdcmem.cpp | e4d510182a2d488cd150f34d74a79e36af52916d | [] | no_license | JammyWei/ver30 | 199719eb7904db0b5d764a413e0ea6b7e8a26f6f | 2e1fe0eeb6cef5c6e35a16e30226874a14b86f7d | refs/heads/master | 2020-04-03T13:01:17.982783 | 2014-03-05T09:38:58 | 2014-03-05T09:38:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,968 | cpp | mdcmem.cpp |
#include <ipc_media_data_dispatch/ipc_media_data_client.h>
#include <ipc_fw_v3.x_resource.h>
#include <ipc_media_data_dispatch/ipc_media_data_dispatch.h>
#include <media/gmi_media_ctrl.h>
#define ERROR_INFO(...) do{fprintf(stderr,"%s:%s:%d[%ld]\t",__FILE__,__FUNCTION__,__LINE__,time(NULL));fprintf(stderr,__VA_ARGS__)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.