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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
317ef60dda790568307d55f2c856a5336e928369 | e3cee45fbe869a5239de195027bce663aca55020 | /w3/G2/1.cpp | e5ede2a301152a52e5d972ebe8af593b8a4fba5b | [] | no_license | bobur554396/PPI2020FALL | dd354724c9b530652d81436791d8e2526a5fb478 | 8e55ec56a899ceb94ca9d9cc247f67c189110bf3 | refs/heads/master | 2023-01-20T04:58:30.129991 | 2020-12-05T09:23:01 | 2020-12-05T09:23:01 | 294,113,060 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 354 | cpp | 1.cpp | #include <iostream>
using namespace std;
int main(){
// - [ ] loop operators: for, while, do while
/*
for(initialize iterator; condition; inc/dec iterator) {
expression / instructions;
}
*/
cout << "loop started\n";
for(int i = 0; i < 10; i = i + 1){
cout << i << " ";
}
cout... |
1cd7177f29a12ae715e59b85aae5ad24f6739bf4 | 2c6a29560e7012032fbb81ab717fa04f2905caaf | /proyecto/compiler/src/codegen.h | 96da979f96b33a5873f02b576552fa1254693c3e | [] | no_license | Erick-ECE/ArquitecturaDeComputadoras | aeac77745d0bba7fe5b617101fb81e109329a1af | de2de9d473a14f0ccc1b80a64aca8fc2da749381 | refs/heads/master | 2020-03-22T04:04:37.890519 | 2018-07-02T17:15:13 | 2018-07-02T17:15:13 | 139,471,443 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,103 | h | codegen.h | #ifndef CODEGEN_H
#define CODEGEN_H
#include "procentry.h"
#include "strentry.h"
#include "instr.h"
#include <deque>
using std::deque;
#include <fstream>
using std::ofstream;
using std::ios;
#include <iostream>
using std::cerr;
using std::endl;
class AsmCodeGen {
public:
AsmCodeGen(deque<Instr>& code,
d... |
de16ba1d1e48041f37843564167d7fca578c0743 | f0ec6e201a1399704656829293b5284c7f655cff | /abc131/e.cpp | 5e8a73f66d8a8b56218963f033f2cb92c9e5177a | [] | no_license | kenta-s/atcoder | b7134787618eeacda99ded8f8eb3c18a77e57bad | d88bf1196d3fa1024384369609c4bf9ec3b3bca0 | refs/heads/master | 2021-06-21T19:16:31.289686 | 2021-01-23T04:46:31 | 2021-01-23T04:46:31 | 172,304,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 448 | cpp | e.cpp | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N, K;
int ans;
vector<vector<int>> b;
cin >> N >> K;
int MAX = ((N-2) * (N-1))/2;
if(K>MAX){
cout << "-1" << endl;
return 0;
}
int bridges = N-1;
bridges += MAX-K-1;
cout << bridges << endl;
for(int i=0; i<N-1; i+... |
6402b564382fac27530ce6e2d8ea43da2dab6d2a | d9c17dedd03c5c52db536a9dc7890339cf927472 | /EXE8/ofstream.cpp | dc568046b7c3d22db47a9335830aaecfaa7418b1 | [] | no_license | qiuliwang/hello-world | 349c401cea8324afeae7af1dd6c73dc5f8af5472 | 807223972a80267b8ce1c6b41f2b9d386b32000f | refs/heads/master | 2021-07-09T05:56:59.144041 | 2017-10-09T01:39:49 | 2017-10-09T01:39:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 277 | cpp | ofstream.cpp | #include <iostream>
#include <fstream>
using namespace std;
int main()
{
ofstream outfile("test2.txt");
outfile << "this is test2\nand hello again";
//return 0;
outfile.close();
fstream file("test2.txt", ofstream::out | ofstream::app);
file << "append";
file.close();
} |
644051cab1905b2b25dc06dc27c19e6357280e00 | 52e7857bc79dc810fb5a8718d988af58f8254a9a | /depth2color.cpp | 638aad56a9be895b6c60deb7621a9a05ce4608b4 | [] | no_license | wf-hahaha/depth2color | e5a1302c3fafa7c8079ec1c24e5fed02e4d92fb5 | 846bb2b995167ebc5735bee5459b899cc31553e3 | refs/heads/master | 2022-01-04T23:28:57.482744 | 2018-05-08T11:55:58 | 2018-05-08T11:55:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,314 | cpp | depth2color.cpp | #include <iostream>
#include <string>
#include <sstream>
#include <opencv2/opencv.hpp>
using namespace std;
void depth2color(cv::Mat & color, const cv::Mat & depth, const double max, const double min)
{
cv::Mat grayImage;
double alpha = 255.0 / (max - min);
depth.convertTo(grayImage, CV_8UC1, alpha, -al... |
58616899e6471737ea74e6f13cddceae8f0a735f | bc5f13db933cb00d8e6d24769a7990d52e65ca2f | /src/input.h | a07e0fd0d02624dd1d98e74c2f0c5c72f60a31a6 | [] | no_license | chrismacdermaid/LJMD-LAMMPS | 3c866933735d31c07a7b2b60b2018de646e19351 | b6ad40aa34183f02cfcd2bf989b69514e397a99a | refs/heads/master | 2021-01-18T15:16:43.439629 | 2011-02-04T17:22:32 | 2011-02-04T17:22:32 | 2,943,490 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,214 | h | input.h | /* ***********************************************************
* JLMD++ A C++ version of LJMD motived by LAMMPS.
*
* http://sites.google.com/site/akohlmey/software/ljmd
* and http://lammps.sandia.gov/
*
* Some routines are taken in whole or in part from LJMD
* or LAMMPS. This software is distributed under the
... |
40fa558997c90840c398039a5d6049005d2e6263 | 579512224c0bcd397467e23e2e4fa8c51b732e26 | /src/tf_camera.cpp | f6d3a416c99495de103f0ea44e18112ef82feec1 | [] | no_license | hubertkarbowy/whackamole | d6a34cc292ddda1417c4aa090550bf809681ba3e | 31c79477915ba6d6965b2bcf8a18b16964368f67 | refs/heads/master | 2023-02-25T07:25:19.302548 | 2021-02-01T22:52:24 | 2021-02-01T22:52:24 | 324,822,728 | 0 | 0 | null | 2021-02-01T22:52:25 | 2020-12-27T18:22:30 | C++ | UTF-8 | C++ | false | false | 1,682 | cpp | tf_camera.cpp | #include <tf_camera.hpp>
#include <whackrealtime.hpp>
#include <helpers.hpp>
/** Fake camera thread
*
* Captures a camera image in regular intervals, detects the LEDs pattern, saves the
* pattern in an ugly global variable @OBSERVED_BOARD_STATE and notifies other threads after
* completing these actions.
*/
void ... |
1beb6d3bb9ba30ca8b02270caf7ae6eed2f54bf4 | 44346fab250714f05cd2a30a3f47cbb9543f41a6 | /hdu/树形dp hdu 4003.cxx | 79e0249b9f5efa6b15975baa07da336220c01589 | [] | no_license | vapour18/acm_code | b925258c04d81da4d1e7be9c4a268a1268b645f6 | 46d6dc3c6fcf11a2703744d05443ce50b9fa5e75 | refs/heads/master | 2020-12-24T13:28:32.633089 | 2013-05-08T10:15:36 | 2013-05-08T10:15:36 | 7,303,255 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,540 | cxx | 树形dp hdu 4003.cxx | //题意:给一棵有根树,每条边与有边权.在根上放k个机器人,问遍历这棵树的最小边权和是多少
//贪心的方法想了很多都不行,只能是树形dp
//dp[i][j]表示以i为根的子树有j个机器人遍历的最小代价,dp[i][0]表示这棵子树只有一个机器人经过并且会回去
//然后按分组背包的形式去做,dp[i][j] = min(dp[i][j],dp[i][j-k]+dp[v][k]+w*2),其中v为i的儿子
//初始化的条件为dp[i][j] = dp[v][0] + 2*w,这样就可以保证树被遍历
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostr... |
cfeca17b175174c105f57c5efa72d7a74a256c78 | 4bfcee530252964efb193cc3f3ca08d91b80524a | /OI/VIII/mro.cpp | 1474d946fff4983027754181138f149a1b4a0603 | [] | no_license | Neverous/individual | 63e1bcd12e54f4871d06036f3af31da2e56c40bc | bc16b259d16b09526ed39217eca4a3122d3e0466 | refs/heads/master | 2021-05-04T10:17:43.557190 | 2016-09-07T19:09:08 | 2016-09-07T19:09:08 | 54,484,436 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,798 | cpp | mro.cpp | /* 2010
* Maciej Szeptuch
* XIV LO Wrocław
*/
#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
//#define DEBUG(args...) fprintf(stderr, args)
#define DEBUG(args...)
int verts,
start,
end,
ants,
ladybug,
landplace,
antToVert[1010],
vertToAnt[5050],
direction[5050],
score[1010];
bool moved... |
3510b4a123b2d15b0a512f5598209f1286b41752 | e83e18bfb42e0feab5146233e6df04a58e2841a7 | /ui/ontology/treeview/OntologyTreeViewController.h | 354df658cf4bd331c1158b3e96c256219a10d201 | [] | no_license | bobrnor/OntoEditor | 492ddf12de19c5c8e67cdf882f202a2bbcdad641 | 7c0ac34be6f4332c06644c3a433a9f5fdd44ea42 | refs/heads/master | 2020-06-07T10:17:25.726717 | 2013-06-30T21:41:22 | 2013-06-30T21:41:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,260 | h | OntologyTreeViewController.h | #ifndef ONTOLOGYTREEVIEWCONTROLLER_H
#define ONTOLOGYTREEVIEWCONTROLLER_H
#include <QtGui>
#include "../../../core/OntologyDataController.h"
struct TVNodeData {
NodeData *nodeData;
QMap<QString, QList<TVNodeData> > *childNodes;
};
class OntologyTreeViewController : public QObject {
Q_OBJECT
private:
... |
0cc496fed1922e0318d63d8d13c58c7e88298be1 | bc997f47b4cffef395f0ce85d72f113ceb1466e6 | /POI/ONTAK/ontak16_bar.cpp | f8b3e31b2cb3a488bbb2b922f1a1f12aa2368672 | [
"LicenseRef-scancode-public-domain"
] | permissive | koosaga/olympiad | 1f069dd480004c9df033b73d87004b765d77d622 | fcb87b58dc8b5715b3ae2fac788bd1b7cac9bffe | refs/heads/master | 2023-09-01T07:37:45.168803 | 2023-08-31T14:18:03 | 2023-08-31T14:18:03 | 45,691,895 | 246 | 49 | null | 2020-10-20T16:52:45 | 2015-11-06T16:01:57 | C++ | UTF-8 | C++ | false | false | 575 | cpp | ontak16_bar.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
int n, a[1000005];
char str[1000005];
int main(){
scanf("%d",&n);
for(int i=1; i<=n; i++) scanf("%d",&a[i]);
scanf("%s", str);
priority_queue<pi, vector<pi>, greater<pi> > pq;
int p = 0, b = ... |
6d2d959e81d902acf7b3c1c8c48c9c0f006e1b85 | 888c6e3645b9852502b6dbf59bf8cfcdff1253ae | /A2.cpp | 33e8358355411173ffbe73b404926fe8a941d424 | [] | no_license | ptd910/baitapltnctuan10 | eb2d254132d6747f98ccd83ff70dc388e34dc4ce | 6708a49d4d4fd904dc51c87f150ab5945185adee | refs/heads/main | 2023-04-25T01:57:01.580288 | 2021-05-21T04:37:50 | 2021-05-21T04:37:50 | 369,414,374 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 262 | cpp | A2.cpp | #include<iostream>
using namespace std;
struct point
{
double x,y;
};
void thamtri(point a)
{
cout<<&a;
}
void thamchieu(point &a)
{
cout<<&a;
}
int main()
{
point a;
cout<<&a<<endl;
thamtri(a);cout<<"\n";
thamchieu(a);
return 0;
}
|
cb2d16c8ab79bc79ac83b5d3eb601786b8ac9aea | 788f85c38005a4c006417cd3e53e4780eaa80fb8 | /snegoviki/Texture.h | 7e10ee31d654df5589a55b0a961e2d019333f19f | [] | no_license | skautman21/Snegoviki | 7ac1216820c5d9a68940daa6b34cb4424ba4cd00 | 6f0969886e45b0d2135ce859c9aea102bead73ba | refs/heads/master | 2023-03-29T01:56:24.759157 | 2021-03-31T06:21:54 | 2021-03-31T06:21:54 | 352,985,528 | 1 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 334 | h | Texture.h | /*
* Texture.h
*
* Created on: 16 нояб. 2020 г.
* Author: unyuu
*/
#ifndef TEXTURE_H_
#define TEXTURE_H_
#include <GL/gl.h>
#include <GL/glu.h>
class Texture
{
protected:
GLuint _tex;
public:
Texture(const char * filename);
virtual ~Texture();
void bind();
};
#endif /* TEXTUR... |
ca2994d1db22b57e0ab3da02637a0ea6a3aa47e7 | c51b650b4c69417f83e363ef24489aac44d4e871 | /include/cpo/core/Parsers.hpp | f402f8276c45b577c6ad1119b84d4f9787adce07 | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | yanxicheung/cut | 90417fe4276fafa892e81606a8899018d8f8756a | 7aee0c03ecbccf1bd2c2c0552bfaaf0a52078c5c | refs/heads/master | 2020-03-29T04:35:33.923846 | 2018-09-19T07:16:30 | 2018-09-19T07:16:30 | 149,538,521 | 1 | 0 | MIT | 2018-09-20T02:17:26 | 2018-09-20T02:17:26 | null | UTF-8 | C++ | false | false | 869 | hpp | Parsers.hpp | #ifndef PARSERS_Thu_Apr_16_23_57_14_2015_H
#define PARSERS_Thu_Apr_16_23_57_14_2015_H
#include <cpo/core/OptionsDescription.hpp>
#include <cpo/core/Cmdline.hpp>
#include <cpo/core/Option.hpp>
#include <cui/dci/__Role__.h>
CPO_NS_BEGIN
struct OptionsDescription;
__TRAIT__(ParsedOptions)
{
__ABSTRACT__(const std:... |
3adc78d7a313ea1df1295276b2fbc20fc5cad9bf | 7a6e2a3492b6e237a70b12d75fd05b7a77472af3 | /cplus/begin/for_sum_while.cpp | 3bace324ee2cbb72d13fb5d467effadc48208727 | [] | no_license | timtingwei/prac | e44b7e4634a931d36ed7e09770447f5dba5f25e6 | ae77fa781934226ab1e22d6aba6dba152dd15bfe | refs/heads/master | 2020-05-21T17:53:07.144037 | 2017-10-10T14:55:52 | 2017-10-10T14:55:52 | 63,440,125 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 369 | cpp | for_sum_while.cpp | #include <iostream>
int for_sum_while()
{
int sum = 0;
for (int i = 50; i <= 100; ++i)
sum += i;
std::cout << "Sum of 50 to 100 is:" << sum << std::endl;
system("pause");
return 0;
}
/*int main()
{
int i = 50, sum = 0;
while (i <= 100){
sum += i;
++i;
}
std::cout << "Sum of 50 to 100 inclusive is" << s... |
8b84c8badddaee1a23b5137f70dd8104be4aea41 | 960c0ac49a5763e27f178cded2c41a8947fde21e | /Mathlab C++/CMatrix.cpp | a402749e3b5b65a00787f6a12ca3742b0ef8fb04 | [] | no_license | Eslammedhat22/Mathlab-C- | 4163693938d0629e317934e7791e4065b0ee2b4a | 3e397c617d327cdfa5b4938be7eec1d03fe51110 | refs/heads/master | 2020-04-30T08:31:16.643813 | 2019-03-20T11:28:43 | 2019-03-20T11:28:43 | 176,716,659 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 30,429 | cpp | CMatrix.cpp | /////////////////////////////////////////////////* Functions Definition *///////////////////////////////////////////
#include "CMatrix.h"
#include <iostream>
#include <exception>
#include <string>
#include <string.h>
#include <stdarg.h>
#include <algorithm>
#include <cstdio>
#include <math.h>
//////////////////////////... |
c5b2940db8bb19f0b00bcef0b98f337a98e4b1a0 | a5dc88f5c69f418ec0fc2c44ecfccdf99bf2b0e3 | /cl.cpp | 21de5f3adf85ac6925a3d7e53fea837d40acb5c6 | [] | no_license | Paulboca/ConnectFour | 059fb26430cab970229571283a3f4950c35cbc34 | 214aed3cdb2659ac48cf47807a787b618f499f0e | refs/heads/main | 2023-04-18T06:39:11.548482 | 2021-03-31T17:00:22 | 2021-03-31T17:00:22 | 353,429,232 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,314 | cpp | cl.cpp | #include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <errno.h>
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <netdb.h>
#include <string.h>
#include <arpa/inet.h>
#include <iostream>
using namespace std;
extern int errno;
char tabla[6][7];
int i, j, win;
int lib[8] = {... |
4ffb42d22b4f70ce16fd63c9c5a3ca2e36eecd66 | 31324ccac17f94884ffcd9c041d19e8f01c8fd6f | /rclient.cpp | 80445bd1123b034712bb0c57ac1e4691c955f9ff | [] | no_license | vsklamm/os-net | aaa4f0c14aa30459660e45182be75e775828d5c8 | 6c801651cb8d5a392d2713ae5b87f8f0f094f980 | refs/heads/master | 2020-05-18T07:48:05.353519 | 2019-06-14T14:24:02 | 2019-06-14T14:24:02 | 184,275,355 | 0 | 0 | null | 2019-04-30T14:17:14 | 2019-04-30T14:17:14 | null | UTF-8 | C++ | false | false | 460 | cpp | rclient.cpp | #include <cstdlib>
#include <iostream>
#include <string>
#include "client.h"
int main(int argc, char *argv[]) {
if (argc != 4) {
std::cerr << "Client usage: <address> <port> <message>" << std::endl;
exit(EXIT_FAILURE);
}
try {
client cl({argv[1]}, {argv[2]});
cl.connect_to... |
8be97032970e7091dd00b5ceb67e99d87d6fea96 | 4a9213bf83760ceb50a1dc2cfd973f28339e1127 | /Code/Engine/resource/resource_system.cpp | 6fe3f4b44823bf768aa9dc7becd1df15d047392a | [
"MIT"
] | permissive | wkigen/WingEngine | dd094cda9f08edc2d3bfd14195b2ae2de0657d7f | 5f0da3b26e11977d0205ecbd6e093c5846f26210 | refs/heads/master | 2020-04-17T20:34:55.556595 | 2017-10-18T02:50:51 | 2017-10-18T02:50:51 | 66,062,913 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,333 | cpp | resource_system.cpp | #include "resource_system.h"
#include "mesh\mesh_reader.h"
#include "image_reader.h"
#include "font\font_reader.h"
namespace WingEngine
{
ResourceSystem::ResourceSystem()
{
}
ResourceSystem::~ResourceSystem()
{
}
bool ResourceSystem::create()
{
if (mCreate)
{
WING_LOG_WARN("ResourceSystem has been c... |
a555f0f376db09ca11cfefbec24d641d0845df31 | ef356dbd697546b63c1c4c866db4f410ecf1c226 | /xml/dom/mxml/mxmlXMLString.hpp | 741895f75ae363852405a1110f6fc4bb211e17b0 | [] | no_license | jondos/Mix | d5e7ab0f6ca4858b300341fb17e56af9106ffb65 | 8e0ebd9490542472197eca4b7c9974618df6f1de | refs/heads/master | 2023-09-03T12:55:23.983398 | 2010-01-04T14:52:26 | 2010-01-04T14:52:26 | 425,933,032 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,304 | hpp | mxmlXMLString.hpp | #ifndef __MXML_XML_STRING__
#define __MXML_XML_STRING__
#include "mxmlDOMTypeDef.hpp"
class XMLString
{
public:
static char* transcode ( const XMLCh *const toTranscode)
{
UINT32 len=strlen((char*)toTranscode)+1;
char* newBuf=new char[len];
memcpy(newBuf,toTranscode,len);
return newBuf;... |
81b73a990e628a6bac61110e4ea394a3287a1388 | ad48cfc1724d38903994b0dfb7cce1a396d51aa4 | /Seanet/evaluator.hpp | d01b5b7e1cdfbdfcb62e88672a37b318cd73bfaa | [] | no_license | uhsprogrammingclub/Seanet | 49207f7ce5a2029121cb8a043925465972e6688a | d78b9d68f61165167e7cc57856229105bd9c5d34 | refs/heads/master | 2021-01-01T05:22:21.763670 | 2016-06-03T23:30:44 | 2016-06-03T23:30:44 | 58,693,721 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,062 | hpp | evaluator.hpp | //
// evaluator.hpp
// Seanet
//
// Created by Nathaniel Corley on 5/16/16.
//
//
#ifndef __Seanet__evaluator__
#define __Seanet__evaluator__
#include "board.hpp"
#include "util.hpp"
#include <stdio.h>
#include <vector>
int calculatePhase(State &state);
int calculateMaterial(State &state);
int evaluate(State &sta... |
649b619a418775b4c497fe3720f2f5ff6836e2a2 | a9341245fe25aa1bb9902a7ec387ac472a43c3f8 | /plugins/graphics/src/core/GraphicsScriptBinding.cpp | 7c6eb0f785431950e5fe1e3101bb867c6db07074 | [] | no_license | mgottschlag/PeakEngineNew | c1287d86f52a6a8c92c6a87482a63d991236df38 | 271df91bf7982016d25b928ebd9872a2ab933966 | refs/heads/master | 2020-08-05T22:12:49.701966 | 2010-04-12T17:01:45 | 2010-04-12T17:01:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,819 | cpp | GraphicsScriptBinding.cpp | /*
Copyright (c) 2010, Mathias Gottschlag
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARR... |
373dca4bbe26e7010a0fc74ecdf1c38dbb73d99f | a02d4b3c879c047082ccc295607d6ec8d1130039 | /Procedurals/speedtreeKit/speedtreeOp/source/op.cpp | b58bc18512963b7ffe9b23889d3633c0f0006615 | [
"Apache-2.0"
] | permissive | iceprincefounder/selected-sources | 4fa97e439248d1b4bd9e6e59d0f80a7c33752761 | b225c529e02009b5f44bfb2891ef8f039b9a6d80 | refs/heads/master | 2022-05-22T03:24:45.329292 | 2022-03-13T09:22:12 | 2022-03-13T09:22:12 | 149,724,714 | 17 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 7,972 | cpp | op.cpp | #include <iostream>
#include <sstream>
#include <sys/stat.h>
#include <unistd.h>
#include <string>
#include <FnAttribute/FnAttribute.h>
#include <FnAttribute/FnGroupBuilder.h>
#include <FnPluginSystem/FnPlugin.h>
#include <FnGeolib/op/FnGeolibOp.h>
#include <FnGeolib/util/Path.h>
#include <FnGeolibServices/FnGeolibC... |
510345bc79a9d918e102eda61447da06b4a6d5ef | de24316f6319d7e62faa57115a92eece7f765fa1 | /src/mesh3.cpp | b7ccf3e75f8eeb7de8b93a6447b90af972b5c853 | [
"MIT"
] | permissive | PeterZhouSZ/mandoline | bbfd048dca6e3cb01b60a323b8a68268d1d8342a | 79438c5b210a2ca4b9f72cbfd2879a9ae6a665da | refs/heads/master | 2023-05-22T06:55:28.676188 | 2021-03-31T14:47:17 | 2021-03-31T14:47:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,188 | cpp | mesh3.cpp | #include "mandoline/mesh3.hpp"
#include <mtao/iterator/enumerate.hpp>
#include <mtao/geometry/bounding_box.hpp>
#include <mtao/geometry/volume.h>
#include <mtao/logging/logger.hpp>
#include <mtao/geometry/mesh/halfedge.hpp>
#include <mtao/geometry/prune_vertices.hpp>
#include <mtao/geometry/mesh/separate_elements.hpp>
... |
a9aac2aac5f7790ffb1908111c9008ef10a7c701 | dede18db20fd47c3059bcbf74562e8773096821e | /advent/2018/1_day/xmas2.cpp | 69982535de4a0c4230248c50495cc57391dc51a6 | [] | no_license | conradoboeira/CP | a70232d916c04d81c93f84de70afb2f252cff4ad | 675b098a1c62c7d9bcfa5d8d9a2d7e359b24eef2 | refs/heads/master | 2020-03-31T19:55:21.417786 | 2020-02-18T03:56:40 | 2020-02-18T03:56:40 | 152,518,258 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 603 | cpp | xmas2.cpp | #include <iostream>
#include <vector>
using namespace std;
bool vec_handler(int freq, vector<int> &vec){
int i;
for(i = 0; i < vec.size(); i ++){
if( vec[i] == freq) return true;
}
vec.push_back(freq);
return false;
}
int main(){
int freq, val, i;
freq = 0;
vect... |
979f74b9f7062f566f8e90da14e7659aecdaf621 | 5a7f86738e996e54c0614feabda805bdd7e4ecfe | /Ball.h | c632ee1569395f7c195fe73a0a6945eed9522af5 | [] | no_license | Robin-Works/Pong | 022e8e9209f4cae105ea533c869796044a830c65 | 6ce142b6fefbd72dd024780382060e70f410e97c | refs/heads/main | 2023-03-25T22:34:19.039426 | 2021-03-23T20:27:39 | 2021-03-23T20:27:39 | 350,840,950 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,103 | h | Ball.h | #ifndef BALL_H
#define BALL_H
#include "Texture.h"
#include "Collider.h"
#include <iostream>
#include <sstream>
#include "Particle.h"
class Ball
{
public:
static const int BALL_WIDTH = 16;
static const int BALL_HEIGHT = 16;
static const int DOT_VEL = 5;
Ball(int x, int y);
~Bal... |
aca5a78b6ebff56c17ee128bf4fc47a22039d34b | c274a8d9d44b0dc52537f01b39e99ba57e780450 | /CS205Project/build-UIDesign2-Desktop_Qt_5_14_1_MinGW_64_bit-Debug/ui_museummain.h | b502bacd6a1a64e7d4ed3ce6fe93723a3c9e1d63 | [] | no_license | nelsomic/CS205 | e2db52408dfed2f879a06e9eea0634a3d02c6e1d | 567e09ff051d91b6d2422b22d3660a74e72d222a | refs/heads/master | 2021-05-20T14:22:44.874165 | 2020-05-08T00:50:18 | 2020-05-08T00:50:18 | 252,329,956 | 0 | 0 | null | 2020-04-02T01:53:25 | 2020-04-02T01:53:25 | null | UTF-8 | C++ | false | false | 10,036 | h | ui_museummain.h | /********************************************************************************
** Form generated from reading UI file 'museummain.ui'
**
** Created by: Qt User Interface Compiler version 5.14.1
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
***************************************... |
fd299776d38e29ab0c74621ebede75d0a95c1e3e | 514412f8372198e3a55c13aa0f889a624e8893e3 | /src/core/Entity.hh | e16c7f3265652c52f843936b6bfb26f5681c6534 | [
"MIT"
] | permissive | eddiehoyle/sevengine | ade6c37cb5a4eaf9814fadb1a92ab1f7e6a3c9f8 | 4f5bd2b16b1179784c831ef8a0d57ccecee0a92e | refs/heads/master | 2020-07-12T18:41:20.753290 | 2017-04-04T05:36:27 | 2017-04-04T05:36:27 | 68,410,565 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 600 | hh | Entity.hh | //
// Created by Eddie Hoyle on 4/09/16.
//
#ifndef SEV_ENTITY_HH
#define SEV_ENTITY_HH
#include "Transform.hh"
#include "Mesh.hh"
#include "Rect.hh"
#include "BoundingBox.hh"
#include "event/AbstractEvent.hh"
class Entity {
public:
Entity();
virtual ~Entity();
virtual void listen( AbstractEvent* ev... |
df066a4022a449ab5413f4b7c8d1021ce70395b8 | cb6f5a87532f363887514bbe2ac7186b0ceb4c68 | /lab_04/exceptions/loadexception.h | b862a129036b8d8b8164c26341bf72571f6c9404 | [] | no_license | AnaNek/Object_oriented_programming | e1e4a2e983c6eb7c6e445d9a7554de952a396485 | 65dbd5013fa1bab030d419b55287815f59cc1677 | refs/heads/master | 2022-12-11T14:10:25.371138 | 2020-08-27T17:57:31 | 2020-08-27T17:57:31 | 290,791,761 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 959 | h | loadexception.h | #ifndef IOEXCEPTION_H
#define IOEXCEPTION_H
#include "baseexception.h"
class OpenFileException : public BaseException
{
public:
explicit OpenFileException() : BaseException(msg) {}
explicit OpenFileException(const std::string& message) : BaseException(msg + message) {}
private:
static constexpr... |
7044adbd4de0b1ba6033854bb52aef327600a5e0 | 7ef665a3d59f743e1f14dcc10cf9cda7774625d8 | /pre.parser.imp.cpp | c5d00a4b996818c4fd7f7fe86c589002caf40c19 | [] | no_license | muradkarakas/SodiumCompiler | a3d3b0ac07f618cecd42bc59aea9e761a0146bfa | 02428f1224ccd645a1b76b0d8a625dd4ce5279e7 | refs/heads/master | 2022-11-09T01:38:13.757066 | 2020-06-26T21:45:02 | 2020-06-26T21:45:02 | 269,479,195 | 1 | 0 | null | null | null | null | ISO-8859-13 | C++ | false | false | 917 | cpp | pre.parser.imp.cpp | /**
* This file is part of Sodium Language project
*
* Copyright © 2020 Murad Karakaž <muradkarakas@gmail.com>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License v3.0
* as published by the Free Software Foundation; either
* version 3 o... |
4aaa9f8481420f9781c98de50b51b1e32b59bf90 | c92c71071d3d6615765786ecf08386918c6a2349 | /CodeForces/CF482-D1-B.cpp | 45c3b99a4e6947cddd114782c3f7ed159d33e37a | [] | no_license | 3agwa/CompetitiveProgramming | ef757ede03c00e4a47a1629cec2fe862cc7b871d | 532eb309ffeb2901d1af90fc46ce7ad904f0cbc6 | refs/heads/master | 2021-01-19T22:16:49.231249 | 2019-03-12T17:13:50 | 2019-03-12T17:13:50 | 88,785,488 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 3,626 | cpp | CF482-D1-B.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define vll vector<ll>
#define pii pair<int, int>
#define vii vector<pii>
#define vs vector<string>
#define vb vector<bool>
#define vi vector<int>
#define vd vector<double>
#define vvi vector< vector<int> >
... |
4ba44ea9c6c36df5f1579de40df99980421de59a | e000dfb2e1ddfe62598da937d2e0d40d6efff61b | /venusmmi/app/Cosmos/Email/vapp_email_msg_list.cpp | 3fccf64017e4f6edb5bbe0af170e4b9af3c38219 | [] | no_license | npnet/KJX_K7 | 9bc11e6cd1d0fa5996bb20cc6f669aa087bbf592 | 35dcd3de982792ae4d021e0e94ca6502d1ff876e | refs/heads/master | 2023-02-06T09:17:46.582670 | 2020-12-24T02:55:29 | 2020-12-24T02:55:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 126,625 | cpp | vapp_email_msg_list.cpp | /*****************************************************************************
* Copyright Statement:
* --------------------
* This software is protected by Copyright and the information contained
* herein is confidential. The software may not be copied and the information
* contained herein may not be used or dis... |
ad28ba1ac439eccec3aaa26cf157da7728973bad | c857705f993939f6d97a0fbe5b5607771943189c | /Codes/Graph/HLD.cpp | 90fb5b2b34d6626cc546115850b6b918aa3c46b4 | [] | no_license | MarcosJLR/CP-Library | 966a23afffc75a71ff5b416a8da842ce93e49440 | 69dab485a63e479d7d09420cae377b6d43256952 | refs/heads/master | 2023-03-26T10:40:20.545988 | 2021-03-27T23:00:40 | 2021-03-27T23:00:40 | 199,491,894 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 550 | cpp | HLD.cpp | int t; // Timer
int in[MAXN], out[MAXN], nxt[MAXN], sz[MAXN];
void dfsSz(int v = 0, int p = -1){
sz[v] = 1;
for(auto &u : G[v]) if(u != p){
dfsSz(u);
sz[v] += sz[u];
if(sz[u] > sz[G[v][0]]) swap(u, G[v][0]);
}
}
void dfsHLD(int v = 0, int p = -1){
in[v] = t++;
for(auto u : ... |
3c631e1fc6e73ef4ec0b3df3d4d8f28ad3c56c0b | feff7acb239ae449c861cb75b892755e7935ebcd | /JagunParser/jagunparsermessageinformation.h | 789202d7572dc943457455b8139b6e95cb4e58d8 | [] | no_license | adysonmaia/jagunmsn | f9dd4bee4be60c9d1271153c81071d50f7c42712 | 43b1b8db6271a18e2dda9c07534a6e8d9c9dd5da | refs/heads/main | 2023-03-29T20:33:37.197608 | 2021-04-06T10:10:03 | 2021-04-06T10:10:03 | 355,139,934 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,893 | h | jagunparsermessageinformation.h | #ifndef JAGUNPARSERMESSAGEINFORMATION_H
#define JAGUNPARSERMESSAGEINFORMATION_H
class JagunParserMessageInformation
{
public:
JagunParserMessageInformation();
enum ETypeMessage
{
ETPNewUser = 0, // mensagem para criar novo usuario
ETPUserCreated = 1, // mensagem ... |
4afe25adacf2e4992affd68743ccf3eef18c67ae | 492976adfdf031252c85de91a185bfd625738a0c | /src/Game/AI/Action/actionForkEmitChmField.h | cdc8288433563069ce5ce65abd71a876e83fcb03 | [] | no_license | zeldaret/botw | 50ccb72c6d3969c0b067168f6f9124665a7f7590 | fd527f92164b8efdb746cffcf23c4f033fbffa76 | refs/heads/master | 2023-07-21T13:12:24.107437 | 2023-07-01T20:29:40 | 2023-07-01T20:29:40 | 288,736,599 | 1,350 | 117 | null | 2023-09-03T14:45:38 | 2020-08-19T13:16:30 | C++ | UTF-8 | C++ | false | false | 671 | h | actionForkEmitChmField.h | #pragma once
#include "Game/AI/Action/actionForkEmitExpandField.h"
#include "KingSystem/ActorSystem/actAiAction.h"
namespace uking::action {
class ForkEmitChmField : public ForkEmitExpandField {
SEAD_RTTI_OVERRIDE(ForkEmitChmField, ForkEmitExpandField)
public:
explicit ForkEmitChmField(const InitArg& arg);
... |
5080513ecc790a40607ee341ba845716236f04f8 | 28a2db9e767451b4beeab506679cb462a2fb6ffa | /Plus_one.cpp | c85b56809ce54dd31879bb1210c7f7a5965d1e0f | [] | no_license | Mehuli-Ruh11/C-exercise | ad8900faf62c8b6a9dba768232c1b29be3d5ec66 | 40be88db4413d7573823e691a5650bf81ba4f0dd | refs/heads/master | 2020-03-09T07:18:43.845613 | 2018-12-08T07:41:22 | 2018-12-08T07:41:22 | 128,661,770 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 589 | cpp | Plus_one.cpp | class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int n=digits.size();
int i =n-1;
digits[n-1]=digits[n-1]+1;
while(i>=0 & digits[i]>9)
{
if(i==0)
{
digits[i]=0;
digits.ins... |
74f44fa253e4500fecf5bfd39b693935739077d1 | 42811e7629f0ef9b57682b5252d070be1ea7a25e | /include/sliding_bitmap.h | d60964a842e5392bb437cf85344c39e1699281bc | [] | no_license | zhoujie3/knlib | 88a79c3a2bf2e5eb8b2380346ae987ee2d152d27 | c23a4be1fc4db0cc21b4de715467f6919cc0f93a | refs/heads/master | 2021-05-28T20:05:43.500503 | 2015-04-10T07:37:07 | 2015-04-10T07:37:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,670 | h | sliding_bitmap.h | /***************************************************************************
*
* Copyright (c) 2015 Baidu.com, Inc. All Rights Reserved
* $Id$
*
**************************************************************************/
/**
* @file sliding_window/dev/sliding_bitmap.h
* @author knzeus(zhou_jie@baidu.com)
*... |
07c409a7d31b88ae7bc7974ebe825b1f89d4fe7c | dc680f2f9238de259b9e55aa32aadf243211462a | /Template/string/Quick3String.cpp | f62ee86c76b37a9b1d99de6bfe36ac43cacde477 | [] | no_license | zhaoyewei/OJ | cc112cb603acd213add7e107b24d53cafb27ae52 | 0c2962cab5ae62c4ccb3ace3851cdd129d890799 | refs/heads/master | 2022-05-07T09:40:58.467922 | 2019-04-21T05:44:37 | 2019-04-21T05:44:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,309 | cpp | Quick3String.cpp | #include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <set>
#include <list>
#include <iomanip>
using namespace std;
#define DEBUG
int charAt(std::string s, int index)
{
if (index < s.length())
return s.at(... |
1a0ed89663f66b3f0ed91f312e5f0e51e9324268 | a8d0bb2f9a42320be0aa5e383f1ce67e5e44d2c6 | /Algorithms/DP/017 longestIncreasingSubsequence.cpp | 4588f4b9ebab3807c021b926fdc0c7e55cd57edd | [] | no_license | camperjett/DSA_dups | f5728e06f1874bafbaf8561752e8552fee2170fa | f20fb4be1463398f568dbf629a597d8d0ae92e8f | refs/heads/main | 2023-04-19T18:18:55.674116 | 2021-05-15T12:51:21 | 2021-05-15T12:51:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 580 | cpp | 017 longestIncreasingSubsequence.cpp | class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
if(nums.size()==0)
return 0;
vector<int> dp(nums.size());
dp[0] = 1;
int ans = INT_MIN;
for(int i=1; i<nums.size(); i++){
int j=i-1;
dp[i] = 1;
while(j>=0){
... |
7a2f326e2e142b3535b16266711aaf4ecd07b28e | 07b26489226755b5c746c8f9163b6f9873c9ab67 | /LAG-Util.cpp | 7a87b972d778dfc6d89b58d33980fe5826b204ce | [
"MIT"
] | permissive | LAG-Comp/LAG-Compiler-I | 44b891594465c7fafe6a79f5d8330a33ebf38f08 | e00c8ddd2fc4b08a1f8b7880d492d3956a9a0187 | refs/heads/master | 2021-01-01T10:36:52.646656 | 2014-12-08T17:53:07 | 2014-12-08T17:53:07 | 26,452,422 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 9,802 | cpp | LAG-Util.cpp | #include "LAG-Util.h"
bool is_number(const std::string& s)
{
std::string::const_iterator it = s.begin();
while (it != s.end() && std::isdigit(*it)) ++it;
return !s.empty() && it == s.end();
}
int toInt( string n )
{
int integer = 0;
sscanf( n.c_str(), "%d", &integer );
return integer;
}
string to... |
ad643742f21079b8115b06ac7b62511bfb8a0e63 | 30bdd8ab897e056f0fb2f9937dcf2f608c1fd06a | /contest/1542581639.cpp | 86c65d8f90f8d448934a7b4a3e218913386a5da4 | [] | no_license | thegamer1907/Code_Analysis | 0a2bb97a9fb5faf01d983c223d9715eb419b7519 | 48079e399321b585efc8a2c6a84c25e2e7a22a61 | refs/heads/master | 2020-05-27T01:20:55.921937 | 2019-11-20T11:15:11 | 2019-11-20T11:15:11 | 188,403,594 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,440 | cpp | 1542581639.cpp | /*
Cerberus97
Hanit Banga
*/
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
using namespace std;
#define pb p... |
a4cb79df14d547467cfed11d42537561ab32d80c | 128c175be7f895a04aff9ea2e7f0a97313753e5d | /Engine/PoisonField.cpp | 966a05f7f0f1d47ce9ca727aaa766cb3d8c29f12 | [] | no_license | m1zu/snekGeM | 3974d2ac9c9dbb107c575cb9a4477329e2c37466 | 866c23cddbc97a5b97fcd32248bc2da8a68e9627 | refs/heads/master | 2020-03-19T03:45:14.559420 | 2018-06-23T16:44:52 | 2018-06-23T16:44:52 | 135,758,661 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 586 | cpp | PoisonField.cpp | #include "PoisonField.h"
#include "Snake.h"
Poisionfield::Poisionfield(Board& brd)
:
brd(brd)
{
for(int i=0; i< nPoisonGrids; ++i)
poisonField[brd.GetRandom_1Dmapped_gridPos()]=true;
}
bool Poisionfield::collisionWith(const Snake & snake)
{
const int snake1DmappedPos = snake.GetSegmentLocation(0).y*brd.width + ... |
69bb05966bf5f084d7941b0b37114fc66727c14d | 1384d971c64e5fee731baaccc5bc9d836314630e | /test/uno/action/card_mock.h | 9ed2e20111788434543a55d96f5770f480dc6829 | [] | no_license | erenon/casino | c346495a91797d3706684670cf99320cea47e82c | de39cccdb70f9d8f7d8457dfb162b6751c2dd359 | refs/heads/master | 2020-05-31T23:41:28.741917 | 2012-01-24T17:28:30 | 2012-01-24T17:28:30 | 1,942,661 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 474 | h | card_mock.h | #ifndef CTU_CARD_MOCK_H_
#define CTU_CARD_MOCK_H_
#include "gmock/gmock.h"
#include "../../../src/uno/action/card.h"
#include "../../../src/uno/game/game.h"
namespace Casino { namespace Test { namespace Uno { namespace Action {
using ::Casino::Uno::Action::Card;
using ::Casino::Uno::Game::Game;
class CardMock :pub... |
943e0f954c9498168c9476183e6126df3288c3dd | 129cdb6bce9b9dbb8e3b6447cd55dbe332d6b5bd | /Visitor.cpp | aa4699e7b0a09ff2c2f3e5373c44e0a9873be5ab | [] | no_license | tclin914/mj2MIPS | b072fde978996b2496abbaa8ccf64ee05929fcd4 | e436f8c7b85dc1696911a657b99e27e0a6b9261e | refs/heads/master | 2020-05-17T22:24:36.175466 | 2015-05-11T03:24:18 | 2015-05-11T03:24:18 | 28,191,309 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 138 | cpp | Visitor.cpp | #include "Visitor.h"
#include "Node.h"
void Visitor::SetSymbolTable(SymbolTable* symbolTable)
{
this -> symbolTable = symbolTable;
}
|
2b194bfb470ee2fae350a3cdb2f414a878267631 | 9954eadf2758b386eedf7711105636f20e98a716 | /woah_scheme/src/transform.cc | 5cdbbe61149be258df9bdbd7857468175cb94098 | [] | no_license | UML-Robotics-Club/igvc-2012 | 1b95dce98a95d8821632d9bea02308038bb7270a | aadab8c9bcc143e990c564ac22c20c25bb859396 | refs/heads/master | 2021-01-20T05:07:46.893070 | 2012-06-13T15:37:48 | 2012-06-13T15:37:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 701 | cc | transform.cc |
#include "woah_scheme/transform.hh"
void getTransform(std::string to, std::string from, ros::Time time, ros::Duration duration,
double& x, double& y, double& yaw) // <- return values
{
static tf::TransformListener* tfListener = new tf::TransformListener();
tf::StampedTransform transform;
try
... |
b8c28e1256717020de632c5c89d3f3b975235c5d | b68741df720668a54b3d0896f4a350d6654ac095 | /src/utils/FileUtils.h | 8422cceaf1714cc93d8150ea95d696281993d3e1 | [
"BSD-2-Clause-Views"
] | permissive | ls1mardyn/ls1-mardyn | 93a3f1b95b3b4fb06800dd9a2a2a2cc33fe7648a | af5365a92dc5960a19bc35128bf9c38eb1c260a6 | refs/heads/master | 2023-08-28T14:40:36.574730 | 2023-08-09T10:04:34 | 2023-08-09T10:04:34 | 152,977,725 | 23 | 19 | NOASSERTION | 2023-09-08T08:55:34 | 2018-10-14T13:38:41 | C++ | UTF-8 | C++ | false | false | 2,499 | h | FileUtils.h | /*
* FileUtils.h
*
* @Date: 26.08.2010
* @Author: Wolfgang Eckhardt
*/
#ifndef FILEUTILS_H_
#define FILEUTILS_H_
#include <string>
#include <cstddef>
#include <limits>
#include <cstdint>
// write out data in scientific format with max. number of digits
#define FORMAT_SCI_MAX_DIGITS std::setw(24) << std::scienti... |
b329576fc48f58fe6ebded5005794b21c4759cab | ab83d87c6ca30e045ce4da856d6d3f291bb54061 | /GameObjects/Actors/enemy.cpp | 33b63d7b7e03e3ec1f4deb4ab20dc52b34c06074 | [] | no_license | spen-mosk/polandball-game | 872a6ef545db7b3993ccbf7a1e7263350a099ef3 | ba6113556399964860aa27a87e6f14377fd23c83 | refs/heads/master | 2022-11-06T17:29:52.653817 | 2017-07-09T19:51:00 | 2017-07-09T19:51:00 | 61,672,130 | 0 | 1 | null | 2022-10-30T11:41:13 | 2016-06-21T22:44:06 | Python | UTF-8 | C++ | false | false | 7,637 | cpp | enemy.cpp | #include "enemy.h"
#include "ourmath.h"
#include "astargraph.h"
#include <cmath>
using namespace std;
Enemy::Enemy(int x, int y, EnemyStatistics* stat): Actor(x,y,stat, stat->getAwarenessRange())
{
this->stats = stat;
this->verticalSpeed = 3;
this->lockedOn = false;
}
//(int radius, int speed, int maxhealt... |
cff9349a64013f72f601cd5501932266a5f3d2ab | a03167bc03d1a9f0949c3c7b0e428246bce1afcd | /wydatnik.h | f0dbbd245c3bcf927d4233e8c1b3d6b1636ceb3a | [] | no_license | peter890/Wydatnik | 86b5a2c0a1c79e4afe130a66ab6aa710ba6b480a | ddd23e479e1560af2883a7bf17dbc8140d4fe0cb | refs/heads/master | 2016-09-06T15:06:43.532374 | 2011-10-02T17:43:10 | 2011-10-02T17:43:10 | 1,944,069 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,000 | h | wydatnik.h | #ifndef WYDATNIK_H
#define WYDATNIK_H
#include <QtGui>
#include <QMainWindow>
#include <QSqlDatabase>
#include <QSqlQuery>
#include <QSqlQueryModel>
#include <QSqlError>
#include<QtSql>
#include <QDebug>
#include <QMessageBox>
#include <QTextCodec>
#include <QDate>
#include <QCalendarWidget>
#include <Q... |
5fceae30904144c6231e52bfb2ea53426225bae5 | 72dbcd4364b1d1fd96e418f05d72f2b38c8693e4 | /src-tex/tex_demo.cpp | 4dd835c584b2e4d6c5f52b1fc7bdd4ff5329afd6 | [
"MIT"
] | permissive | magicmoremagic/bengine-demos-gfx | baf641c448871b420dfb82ac24f33d8fe50776a7 | 688e81ad5289c99a38dda50f04a465798815c4c0 | refs/heads/master | 2021-01-19T08:46:00.320698 | 2018-01-06T06:41:20 | 2018-01-06T06:41:20 | 87,671,887 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 25,989 | cpp | tex_demo.cpp | #include "tex_demo.hpp"
#include <be/core/logging.hpp>
#include <be/core/version.hpp>
#include <be/core/stack_trace.hpp>
#include <be/core/alg.hpp>
#include <be/util/keyword_parser.hpp>
#include <be/util/get_file_contents.hpp>
#include <be/gfx/version.hpp>
#include <be/gfx/tex/pixel_access_norm.hpp>
#include <be/gfx/te... |
bdd76a83abcffeda75f11560396bf63190c7984e | 4118f8eba9c1073074087cdaffebb95e0c1166cb | /src/search.cpp | bc24622f9c0485524a9a1e25532f035c639121b5 | [] | no_license | rajtyagi2718/tetris | 08a402462dd06b070edc80e231b95df559a404e0 | 362c66473d9724662efecd98190159879cba9a6e | refs/heads/main | 2023-07-14T17:24:50.175357 | 2021-08-31T16:51:28 | 2021-08-31T16:51:28 | 336,360,820 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,623 | cpp | search.cpp | #include "../include/search.h"
#include "../include/board.h"
#include "../include/graph.h"
#include "../include/features.h" // values
#include "../include/ids.h" // Action
#include <boost/multiprecision/cpp_int.hpp> // uint256_t
#include <vector>
#include <queue>
#include <utility> // pair
#inclu... |
9caf359ebe5d24647e1ea1cdfb256092622ff27c | 10864f8b8367f7159a115b63ce5e0de815e98a3f | /Dragon/AnimationClipManager.h | 7cc1563e3b6cff22591d925534096c777e5cae3e | [] | no_license | cctvbtx/gameEngine-DragonEngine | be42001ead707ec3a36cd18200b3df7075115607 | d3197183998e4a81f223f6ee4d1fe1c9527da79e | refs/heads/master | 2023-03-16T13:14:36.580307 | 2017-05-05T07:03:02 | 2017-05-05T07:03:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 482 | h | AnimationClipManager.h | #pragma once
#include <string>
#include <vector>
using std::string;
using std::vector;
struct AnimationClip
{
string m_clipName;
float m_startKey;
float m_endKey;
};
class AnimationClipManager
{
public:
void AddClip(AnimationClip *clip) { m_clips.push_back(clip); };
void ExportXML(string path);
void ImportXML(... |
fb4547eeda015757d3c5da5a1cb3bbb94c20692a | ee92057a8ebc91ba90d8055a9bece25d24211499 | /kattis/lektira/lektira.cpp | 4cc07eb8168850ffa2afd8d7a33567ee82774a50 | [] | no_license | KendrickAng/competitive-programming | ce0a4f44f592f295c2f8cd7e854139f18fb8853a | f9768a2020f801b8e4787cc853398b8258a0bf09 | refs/heads/master | 2022-05-29T07:21:32.607089 | 2022-04-24T16:35:14 | 2022-04-24T16:35:14 | 254,402,307 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 963 | cpp | lektira.cpp | #include <string>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
string input; cin >> input;
string smallest = input;
for (int i = 1; i < input.size(); i++) {
for (int j = i+1; j < in... |
ae650151a87a725a31388e243621f9eacf889fcd | 376b2937e47a362db7b64fa30eafd71aacbf3a3c | /test_contest/P320A.cpp | aa11783c463ecb2bad206fede4e15716c3163ca7 | [] | no_license | arceus6666/competitive-programming-upb-2021 | b1577fd1df93bb3d82705fbce70d0b513aab2436 | 48e35bdf0ad9d068f2c38c15ce605e7edccba495 | refs/heads/main | 2023-06-30T06:10:56.803915 | 2021-08-02T19:29:55 | 2021-08-02T19:29:55 | 391,476,410 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 459 | cpp | P320A.cpp | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, c = 0;
cin >> n;
while (n > 0)
{
int d = n % 10;
if (d == 4)
{
if (c <= 1)
{
c++;
}
else
{
cout << "NO";
exit(0);
}
}
else if (d == 1)
{
... |
06052b10d4dabd215f7cf9960d09c43579b8de10 | 347c92873d53b6261cc6b1e2bc070ebded62c702 | /WINDOW_XP/pir/pir-sensor-ws2812-neo-xmas/pir-sensor-ws2812-neo-xmas.ino | 2e680d7a8c88358e868b434928193824eca4b372 | [] | no_license | ironheartbj18/vanVlymenArduino | 0383159732e3aa2120a5b985d37cbcdc6606592c | d3e9158ccc88891ab215eff9b03c91628cc7ad39 | refs/heads/master | 2020-06-12T14:00:37.392006 | 2017-07-10T21:51:05 | 2017-07-10T21:51:05 | 75,807,238 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,435 | ino | pir-sensor-ws2812-neo-xmas.ino | #include <Adafruit_NeoPixel.h>
#ifdef __AVR__
#include <avr/power.h>
#endif
#define PIN 2
// Parameter 1 = number of pixels in strip
// Parameter 2 = Arduino pin number (most are valid)
// Parameter 3 = pixel type flags, add together as needed:
Adafruit_NeoPixel strip = Adafruit_NeoPixel(150, PIN, NEO_GRB + NEO_KHZ80... |
dc8fb475869d1fd1192d0e85ea0a523d1addce9a | 71a3c40523c8e774213605d4a55fb91b86c63afb | /Paladin/TemplateManager.h | 3ebba0a8d9f08ebecfe23e3c42d9c9fc155f16a8 | [
"MIT"
] | permissive | HaikuArchives/Paladin | caf6f40a812a918f0512cdbfd4e39730417fd344 | 402d53a4258d5b44269fbdfe4935700b249a8649 | refs/heads/develop | 2023-04-29T07:50:43.809813 | 2023-04-15T20:18:09 | 2023-04-15T20:18:09 | 14,755,074 | 11 | 10 | MIT | 2023-05-22T19:41:31 | 2013-11-27T18:13:02 | C++ | UTF-8 | C++ | false | false | 1,095 | h | TemplateManager.h | #ifndef TEMPLATE_MANAGER_H
#define TEMPLATE_MANAGER_H
#include "ObjectList.h"
#include <Entry.h>
#include <String.h>
class ProjectTemplate
{
public:
ProjectTemplate(entry_ref ref);
status_t InitCheck(void) const;
int32 CountFiles(void) const;
entry_ref * FileAt(int32 index);
const char *Pro... |
9dd9c447ef38984f8730a3bdca53281e64f2eef2 | 979e8cbdae0a72350906960896f2dfc421c0e80f | /src/pcd_saver.cpp | 655d9a0cec3374393d3758eeae74c57f6d80aca1 | [] | no_license | zorosmith/my_pcl_tutorial | 88e494b903e3f650e072e909f6931e19f309e555 | e6281a3cac9cac680698bd532ee6aac9850a558a | refs/heads/master | 2020-06-18T04:06:05.241781 | 2017-03-17T07:46:27 | 2017-03-17T07:46:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 23,520 | cpp | pcd_saver.cpp | #include <iostream>
#include <cstdlib>
#include <chrono>
#include <boost/make_shared.hpp>
#include <ros/ros.h>
#include <ros/package.h>
#include <sensor_msgs/PointCloud2.h>
#include <pcl/point_cloud.h>
#include <pcl/point_types.h>
#include <pcl_conversions/pcl_conversions.h>
#include <pcl/common/transforms.h>
#inclu... |
cda0de53186ac48cfc717a67b42dfd42d827f2f9 | 7c2ebc0bebe40645049ca9b2414cfa1f8082d5dd | /6week/6week/student_list.cpp | dffb68c523f16f9b0750ed8dd053106903e491ef | [] | no_license | boyunjjang1/OOP_Cpp | d21cd54f1fac77026a813b2efe0deae7f9a1071f | 92b0481cb4f741707f3270211165e3b67c9b38d9 | refs/heads/master | 2020-04-03T16:08:43.284686 | 2018-11-11T01:53:57 | 2018-11-11T01:53:57 | 155,392,968 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 935 | cpp | student_list.cpp |
#include "pch.h"
#include <iostream>
#include <string>
#include <fstream>
using namespace std;
class Student
{
public:
Student() : name(""), grade("") {};
void setName(string n)
{
name = n;
}
string getName()
{
return name;
}
void setGrade(string g)
{
grade = g;
}
string getGrade()
{
ret... |
c04f83a7f8f62639d859b532b83d29c7cada1c50 | d6680029814adad504535efe799de90eb80403ad | /shared/math3d.cpp | 79d59c4c2e98086a5369c92b7565a93f1c8e1bb9 | [] | no_license | m2aadhil/OpenGL-3D-Space-Game | 341b6d1087fe76d1840b4544e7a60d80f77366f0 | 29dbf8abc51c19357986fdbb292975bab40e9eb7 | refs/heads/master | 2022-06-15T13:57:31.901553 | 2020-05-05T08:26:51 | 2020-05-05T08:26:51 | 234,931,267 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 33,464 | cpp | math3d.cpp | // Math3d.c
// Implementation of non-inlined functions in the Math3D Library
// Richard S. Wright Jr.
// These are pretty portable
#include <math.h>
#include "math3d.h"
////////////////////////////////////////////////////////////
// LoadIdentity
// For 3x3 and 4x4 float and double matricies.
// 3x3 flo... |
5c80c447401baff0c1cc53a9b42f8167a204ef1c | 4781374c5507d9ab81d8e7493bcf60c19988371b | /Source/AProject/Frame/Table/DataTable/MyDataTableSet.cpp | 1ce200f36c0380b501bc6de59ab719a37d27bef0 | [] | no_license | bohyun43/AProjectstart | f4f1362f617c371386489fdcd3f3d0be18d1a40f | 5d2f7f72d588190ef3de9c0ed2a14bdce5977a7b | refs/heads/master | 2020-12-03T16:15:03.396674 | 2020-01-02T14:01:48 | 2020-01-02T14:01:48 | 231,385,614 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 4,113 | cpp | MyDataTableSet.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "MyDataTableSet.h"
#include "MyTableSetBase.h"
#include "Engine/DataTable.h" // UDataTable 지원
// DataTable Test...
#include "MyTableManager.h"
#include "Struct/MyDTRecordTemplate.h"
#include "Struct/MyDTRecordSound.h"
#include "S... |
7ce9b6f0dcd937c5428c2f0c9183f837eaf241ba | 3ac34c8d3d9ec507e91d0aec4a35141b19c49698 | /maximum subarray sum.cpp | 74d70d95d7fc1110578266b3ae3ada35321f984a | [] | no_license | aradhna7/MSIThactkober | b54beae556bccaab91da168c10f455d5bd5b2510 | 970a0141df85ec7d8766f71b4a24fdaaca681306 | refs/heads/master | 2023-09-03T20:22:20.736014 | 2021-10-25T13:15:08 | 2021-10-25T13:15:08 | 300,803,918 | 0 | 6 | null | 2020-10-26T13:14:51 | 2020-10-03T05:30:34 | Jupyter Notebook | UTF-8 | C++ | false | false | 431 | cpp | maximum subarray sum.cpp | #include<iostream>
using namespace std;
int main() {
//no. of testcases
int t;
cin>>t;
for(int i=1;i<=t;i++){
int n;
cin>>n;
int a[n]={0};
//arrary input
for(int j=0;j<n;j++){
cin>>a[j];
}
//kadane's algorithm
int ms=0;
int cs=0;
for(int j=0;j<n;j++){
cs=cs... |
9037e2afbb6473f819ede46f6280f2f9c1a12adb | d20cf7de868dfb2c53578a70d0dda21306167d72 | /data/raw/train/student_14/1411/1406/While.h | b8900cd33fc56ca86ec7a98f83ebeccd76738457 | [] | no_license | bulacu-magda/Alemia | 905a84ca79157fb657eb424e337b0303fd3323bd | 0fd019c4517064d300399feb94dbcb0f467e8d48 | refs/heads/main | 2023-03-01T17:41:08.788500 | 2021-02-05T08:00:35 | 2021-02-05T08:00:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 31 | h | While.h | #pragma once
class While
{
};
|
9fcb63699676f374fc6ea7f132af5430deb6d330 | b7a0ac5d1db9d54fa67a49147ef2350f07ccf857 | /tests/Core/OutCircularPointerFilter.cpp | c94da180e876190fa13ad7f8645619f4804f6fb7 | [
"BSD-3-Clause"
] | permissive | xinsuinizhuan/AudioTK | a14e8812145d2e7da0fa02209805441e66255a14 | dba42eea68534501efe74692b74edf4792cca231 | refs/heads/main | 2023-04-16T04:36:09.831280 | 2021-02-18T19:53:58 | 2021-02-18T19:53:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,692 | cpp | OutCircularPointerFilter.cpp | /**
* \ file OutCircularPointerFilter.cpp
*/
#include <cmath>
#include <boost/math/constants/constants.hpp>
#include <ATK/Core/InPointerFilter.h>
#include <ATK/Core/OutCircularPointerFilter.h>
#include <gtest/gtest.h>
constexpr gsl::index PROCESSSIZE = 512;
TEST(OutCircularPointerFloat, sin1k_test)
{
std::arr... |
4ad9872788ef9861a259d55675689c87946ae64b | 2d75b502d8a212edd8bd9d737cc73f57b9d355f1 | /src/main.cpp | 2805f3b94f1adb6ce584cb234f18995d86fc6548 | [
"MIT"
] | permissive | baatochan/TerminalSnake | dad4b1554b3ce765f555f659f015c52444c59b3a | de72c8eaf238f6bb2b072faa6cdaa3add96f164c | refs/heads/master | 2020-05-14T14:09:51.165287 | 2019-04-30T11:19:04 | 2019-04-30T11:19:04 | 181,827,323 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 160 | cpp | main.cpp | #include "Game.hpp"
int main() {
auto UI = std::unique_ptr<UserInterfaceI>(new UserInterface);
Game game(std::move(UI), 3, 3);
game.start();
return 0;
}
|
f3c9079bb32e69ed03ef8db8242ca11323dd1fb5 | 0ad1616843a4da2ec701f069d31a71c502862b9e | /CS2420 - Algorithms and Data Structures (C++, Spring 2017)/myWork/2 - Recursive List/RecursiveList/RecursiveList/List.h | 9c2636599fededd1d9559298739eeeee56555f9f | [] | no_license | shanewazhere/UVU-CS | 268c4df9a3829dea40296bdf4af7edace5f8bba7 | 1066374243d1f870b99b123f9e84d9b117d594fa | refs/heads/master | 2021-06-24T23:04:14.647903 | 2017-09-13T17:12:35 | 2017-09-13T17:12:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,899 | h | List.h |
//Recursive List - 01/24/2017
//Max Nelson
//Section 002
//List.h
//I Max Nelson have not used any code other than my own(or that in the textbook) for this project.
//I also have not used any function or data - structure from the Standard - Template Library.
//The standard library for C++ is fine.I also have not share... |
8b9133a40fa11b4d1fa6cf3ff57e1be8aa5f614a | e85a38922bbc04a13ee90a970fd1a4962742813a | /ShaderEffect/StrokeNoise/src/Snake.cpp | 7088682c01a932a5760ba795f0af3b9c4a312a30 | [
"MIT"
] | permissive | kynd/apps_of0081_osx | cb75b9067ebea648ffbe5ee96428e5ed5e169ebb | 16a7ec7623893f31d4dec3f4571203dce468e6d2 | refs/heads/master | 2021-01-01T18:03:05.692620 | 2014-07-02T17:07:47 | 2014-07-02T17:07:47 | 21,432,386 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,178 | cpp | Snake.cpp | #include "Snake.h"
Snake::Snake(float l, float w, int _dl, int _dw) {
length = l;
width = w;
dl = _dl;
dw = _dw;
shader.load("shaders/phong/shader.vert", "shaders/phong/shader.frag");
// center points
for (int i = 0; i < dl; i ++) {
points.push_back(ofVec3f(i * 30, 0,0));
... |
d67fa4f991ee1952f97c843cdd916e1db2f06b11 | c537f83fea715f4f1a1ba0eba40b6bf04ce10c56 | /project 1/project1_modeldata.cc | 68373dafc1030e960a25a4c01099d8f993fcbe4c | [] | no_license | sluu3/ECGR4090-ML-IoT | c39da81ef6246527eca9ac051cd75ae628ebe4a2 | 49b5fc0f3a8564d287cf39e8f24fe4d4ebe9994e | refs/heads/main | 2023-04-22T12:36:03.372485 | 2021-05-13T19:47:50 | 2021-05-13T19:47:50 | 334,307,826 | 1 | 0 | null | 2021-01-30T02:06:16 | 2021-01-30T02:06:16 | null | UTF-8 | C++ | false | false | 67,728 | cc | project1_modeldata.cc | unsigned char project1_model_tflite[] = {
0x1c, 0x00, 0x00, 0x00, 0x54, 0x46, 0x4c, 0x33, 0x14, 0x00, 0x20, 0x00,
0x1c, 0x00, 0x18, 0x00, 0x14, 0x00, 0x10, 0x00, 0x0c, 0x00, 0x00, 0x00,
0x08, 0x00, 0x04, 0x00, 0x14, 0x00, 0x00, 0x00, 0x1c, 0x00, 0x00, 0x00,
0x1c, 0x00, 0x00, 0x00, 0x4c, 0x00, 0x00, 0x00, 0x10, ... |
7aeb119514d657ec5916118891c5f685f8cdda31 | bac200b5d9aa4244e7ff8e8d690f1d96fd76c9fc | /tutorial8/GameObject.cpp | 3205387529bafd9f9b377e873c60c155d5629e60 | [
"LicenseRef-scancode-public-domain"
] | permissive | jeag2002/SpaceShooter2D-EngineTest | 54bd99a82ffe9cd7c0c215fb3c335344c979d0fe | 1afdbc6da0860e20cfa09c64aecc5054c235023b | refs/heads/master | 2021-06-02T21:31:44.027559 | 2020-05-30T10:41:34 | 2020-05-30T10:41:34 | 95,495,632 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,187 | cpp | GameObject.cpp | /******************************************************************************
* OpenGLES Tutorial Code - 2008/2009 - Pete Covert
*
* This code is public domain, do with it what you will. If you make
* something interesting with it, let me know at satacoy@gmail.com!
*********************************************... |
eecf47a7c526708e755644a5e2387ae5a3efaf96 | b7f1b4df5d350e0edf55521172091c81f02f639e | /chrome/browser/ui/views/media_router/media_router_ui_browsertest.cc | 0eb39914a69a0ce57f56dabbc22d57a0aa85b960 | [
"BSD-3-Clause"
] | permissive | blusno1/chromium-1 | f13b84547474da4d2702341228167328d8cd3083 | 9dd22fe142b48f14765a36f69344ed4dbc289eb3 | refs/heads/master | 2023-05-17T23:50:16.605396 | 2018-01-12T19:39:49 | 2018-01-12T19:39:49 | 117,339,342 | 4 | 2 | NOASSERTION | 2020-07-17T07:35:37 | 2018-01-13T11:48:57 | null | UTF-8 | C++ | false | false | 15,206 | cc | media_router_ui_browsertest.cc | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/bind.h"
#include "base/run_loop.h"
#include "base/threading/thread_task_runner_handle.h"
#include "chrome/app/chrome_command_ids.h"
#includ... |
e92db7f10d99807e925f876d77ecf2cc05a864ae | 0fa23591f7c5b78b1a0a4005b201e5c2b3e7ce70 | /BC/src/MyLazyCallback.h | 55d39258eb61bcaf49b9c88f096816f44459ac73 | [] | no_license | srtjanuario/kit-opt | 8750b153634e5ab42faac670014088f7820745cf | 2ee2e774681a53b0baaeeca364ef373115c713bd | refs/heads/master | 2022-10-19T23:50:04.584292 | 2020-05-29T01:35:41 | 2020-05-29T01:35:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,270 | h | MyLazyCallback.h | #ifndef MY_LAZY_CALLBACK_H
#define MY_LAZY_CALLBACK_H
#include <ilcplex/ilocplex.h>
#include <vector>
#include "Graph.h"
#include "Util.h"
#include <list>
#include <mutex>
//guarda os vertices de um p3 que não foi adicionado ao modelo. Esse P3 é x[i][j] <= x[i][l] + x[j][l]. Portanto, i < j < l.
typedef struct
{
... |
01d3f5e0b8962e17138036d44c6a08c5061718ad | bc7bed87f9f71bfd64c3bf8544f67c5c11441af4 | /CPP04/ex00/Sorcerer.cpp | 6e0b472f4cc392ca6b5572450288dcdc0245a769 | [] | no_license | InigoRomero/CPP-Modules | fb294834a5f207af16369f09c984368170efb1c9 | d356f7781c17abd0b758113238687cab9517f243 | refs/heads/main | 2023-02-04T19:11:40.435583 | 2020-12-13T17:37:39 | 2020-12-13T17:37:39 | 318,598,072 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,222 | cpp | Sorcerer.cpp | #include "Sorcerer.hpp"
Sorcerer::Sorcerer()
:
_name(""),
_title("")
{}
Sorcerer::Sorcerer(std::string name, std::string title)
:
_name(name),
_title(title)
{
std::cout << name << ", " << title << ", is born!" << std::endl;
}
Sorcerer::Sorcerer(const Sorcerer& copy)
{
*this = copy;
}
Sorcer... |
eafeb59d503172f4f76168c862677f618803f000 | 6b265b404d74b09e1b1e3710e8ea872cd50f4263 | /CPlusPlus/Algorithms/permutations.cpp | 3442151572799a3ab125b8054528cf58f13f3325 | [
"CC-BY-4.0"
] | permissive | gjbex/training-material | cdc189469ae2c7d43784ecdcb4bcca10ecbc21ae | e748466a2af9f3388a8b0ed091aa061dbfc752d6 | refs/heads/master | 2023-08-17T11:02:27.322865 | 2023-04-27T14:42:55 | 2023-04-27T14:42:55 | 18,587,808 | 130 | 60 | CC-BY-4.0 | 2023-08-03T07:07:25 | 2014-04-09T06:35:58 | Jupyter Notebook | UTF-8 | C++ | false | false | 356 | cpp | permutations.cpp | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<std::string> v = {{"a", "b", "c", "d"}};
int i {0};
do {
std::cout << ++i << ": ";
for (auto str: v)
std::cout << str << " ";
std::cout << std::endl;
} while (std::next_permutation(v.... |
b1a6525820ab68ceb14607d50c6a7d979b7d1f31 | 93320ab0e4174142eb7e07956dea7e90e601e457 | /练习/ID1045/ID1045.cpp | 68932b26b3efc2393441235f69d99eb76e64875e | [] | no_license | xianzheTM/Test_Cpp | c302f6f2e6d276ee4b6985dc80d385c8cea8aa0d | ab9368c5f022c59e2111c934e35252c3d2d3c496 | refs/heads/master | 2021-04-06T07:10:44.958263 | 2019-06-17T07:49:40 | 2019-06-17T07:49:40 | 124,899,813 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 270 | cpp | ID1045.cpp | //http://222.22.91.42/view/practice/display.aspx?qid=1045#flag ID1045 一般
#include <iostream>
using namespace std;
int main()
{
int n, sum=0;
cin >> n;
for (int j=2;j<n;j++)
{
if (n%j==0)
{
sum = sum + j;
}
}
cout << sum;
system("pause");
return 0;
} |
b404fa9c51a07f636f34786b4aa6c1fde50cd145 | 492976adfdf031252c85de91a185bfd625738a0c | /src/Game/AI/Action/actionWaterExplode.cpp | 3d4300eb611575ca4ea7ec53b700ed1f0b45f2bb | [] | no_license | zeldaret/botw | 50ccb72c6d3969c0b067168f6f9124665a7f7590 | fd527f92164b8efdb746cffcf23c4f033fbffa76 | refs/heads/master | 2023-07-21T13:12:24.107437 | 2023-07-01T20:29:40 | 2023-07-01T20:29:40 | 288,736,599 | 1,350 | 117 | null | 2023-09-03T14:45:38 | 2020-08-19T13:16:30 | C++ | UTF-8 | C++ | false | false | 694 | cpp | actionWaterExplode.cpp | #include "Game/AI/Action/actionWaterExplode.h"
namespace uking::action {
WaterExplode::WaterExplode(const InitArg& arg) : ksys::act::ai::Action(arg) {}
WaterExplode::~WaterExplode() = default;
bool WaterExplode::init_(sead::Heap* heap) {
return ksys::act::ai::Action::init_(heap);
}
void WaterExplode::enter_(ks... |
dbd5f70cc7f8494caab778336952fb0d212763ba | 064abbecba64dce378ad4e1990178843007c923e | /Framework/Source/Entity/ComponentStateManager.h | 2426020253476ce273ce3eb61d79b9881ac5a22d | [] | no_license | NEEC-KAMATA-D3Software/2017Summer_Gr9_UtaWima | ff14c7399b1ccf3511ef73077d171235d0050706 | 82707cbe50f04d07e14f9524f78107298868c830 | refs/heads/master | 2021-03-27T15:08:25.583959 | 2017-07-30T11:21:29 | 2017-07-30T11:21:29 | 98,611,581 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 1,051 | h | ComponentStateManager.h | #pragma once
#include<unordered_map>
#include<Source\Component\Component.h>
#include<memory>
/**
* @file ComponentStateManager.h
* @brief コンポーネントの状態を記憶するクラス
* @authro 高須優輝
* @date 2017/02/23
*/
namespace framework {
enum class ComponentState
{
deActive = 0,
active = 1,
notFind,
};
class ComponentStateMan... |
537526c96a4fddcf31d66a191da0911bddc83653 | 192fd5f3d735289a4f6ab6428195af1dc66389fa | /CSymbolengineOpenPPLBoard.cpp | e54f933b502f65be3ef8629d65e767473753bf4a | [] | no_license | evcoin/OpenHoldem | 4ef8c51cd67e6e10c3c912e385665c6b049ca035 | 97622fa4db958337b072d03d16e1ff0eff2b5cbd | refs/heads/master | 2021-01-23T00:01:48.472372 | 2015-02-02T11:24:11 | 2015-02-02T11:24:11 | 29,695,581 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,624 | cpp | CSymbolengineOpenPPLBoard.cpp | //*****************************************************************************
//
// This file is part of the OpenHoldem project
// Download page: http://code.google.com/p/openholdembot/
// Forums: http://www.maxinmontreal.com/forums/index.php
// Licensed under GPL v3: http://www.gnu.org/... |
a07a2f227c7384d957c74bdbc4c9c37b8d1dad5b | 68582f0bfeaeb6f22f19033080e4574bd35015da | /sketch_mar25b/echo/echo.ino | f16936b70f3684cf5f7aeb9e9e0e18ab7cb213e9 | [] | no_license | TahzidMahmud/Arduino_collection | 53404931fa03c1c7f7c42bc5ca936a4ec5ed5825 | 85cc971c71725916ceaba743970e6f1456e1b2ee | refs/heads/main | 2023-01-19T10:59:00.770602 | 2020-11-28T10:16:08 | 2020-11-28T10:16:08 | 316,705,890 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,162 | ino | echo.ino |
const int trigPin = 12;
const int echoPin = 13;
long duration;
int distance;
int dist();
int dis1;
int dis2;
int dis;
void stopm(void);
void forward(void);
void inputs(void);
void sharpright(void);
void sharprleft(void);
void backward(void);
void servocon();
void setup() {
servo.attach(7);
servo.write(0);
pinMode(t... |
be8d691472bc27cfafac1b5c2b1a91c390db5835 | 4e697961037240ad357a5ddd6a1365f588a4969c | /Helper/MathTools.cpp | 84158c3c4b5e2c9e2e421bdff9e8879e2aa00381 | [] | no_license | szakeetm/shared_sources | 7dc94ba25b5828cf1993f4ea4790e88e8a067ca1 | 1fba669e8b3c6ba0cd89c1c2084a235dfd02ee74 | refs/heads/master | 2023-09-05T12:05:45.179173 | 2023-08-18T13:54:30 | 2023-08-18T13:54:30 | 140,718,435 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,655 | cpp | MathTools.cpp | /*
Program: MolFlow+ / Synrad+
Description: Monte Carlo simulator for ultra-high vacuum and synchrotron radiation
Authors: Jean-Luc PONS / Roberto KERSEVAN / Marton ADY / Pascal BAEHR
Copyright: E.S.R.F / CERN
Website: https://cern.ch/molflow
This program is free software; you can redistribute it and/or ... |
222bfe1e5634fc88ff4cfcd8cecdee76fc3c91aa | 0a3c46807db866cb7f28bedd942d4698f1d988e7 | /embedded/stm32_midiplayer/src/player.h | c998b5f83807c2a1cdb477f590dba64a7b43a2da | [] | no_license | gproskurin/learning | 86fc33e3936bbfb50dfbcec1888b5274f53cef74 | 06c4a93492614bf400e81d4d220c57010875205e | refs/heads/master | 2023-08-31T10:27:13.468867 | 2023-08-28T18:01:35 | 2023-08-28T18:01:35 | 33,450,249 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,799 | h | player.h | #ifndef _my_player_h_included_
#define _my_player_h_included_
#include "FreeRTOS.h"
#include "queue.h"
#include "task.h"
namespace notes {
enum sym_t {
C0 = 0,
C0s, D0f = C0s,
D0,
D0s, E0f = D0s,
E0,
F0,
F0s, G0f = F0s,
G0,
G0s, A0f = G0s,
A0,
A0s,B0f = A0s,
B0,
C1,
C1s, D1f = C1s,
D1... |
1aca0a3a5acfb85cea98880d182e77ac93b27a82 | 536a53a689a36a50ac840fe581581f8703936e16 | /chessmaster/Queen_rule.cpp | 105be4e27beb907b688bbbff7a71bef574c30aed | [] | no_license | torn4/Chess | fac9a696a411b4ed87595a10436d3dff7b85be95 | e32de38593a602ad839cf5fcb1001d24a049864d | refs/heads/master | 2020-03-28T03:47:55.383614 | 2018-09-13T09:13:45 | 2018-09-13T09:13:45 | 147,672,059 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 201 | cpp | Queen_rule.cpp | #include "rook_rule.h"
#include "bishop_rule.h"
#include "Queen_rule.h"
#include <iostream>
bool queen_rule::queenrule(std::string piece_name, std::map<std::string,int> memory_map,int move)
{
};
|
4723ee2b2ad053f86d50bfe97e86b6c9f516150b | b67c43b9f4ea2cd3bfd588b7c1b238e0a6d5f3f6 | /RV/SpeechRecognition/voiceCapture.cpp | 8d80b10705be78ab7c2dd716c8e19b8db9f0f32e | [] | no_license | ttune/dayz_0-45-124252 | 64327b4f6026cf48aa70dd64b76ca0797c4ef945 | 89821d85c45bb327da4f1ac8abee65f5010b178d | refs/heads/master | 2018-04-15T07:13:49.289724 | 2017-05-06T03:55:37 | 2017-05-06T03:55:37 | 90,435,280 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,065 | cpp | voiceCapture.cpp | #include <El/elementpch.hpp>
#pragma comment(lib,"dsound")
#include "voiceCapture.hpp"
const DWORD VOICE_SAMPLE_RATE = 16000;
const DWORD BYTES_PER_SAMPLE = 2;
#define NUM_REC_NOTIFICATIONS 16
VoiceCapture::VoiceCapture()
{
_notifySize = 0;
_bufferSize = 0;
_bufferOffset = 0;
_capturing = false;
// Cre... |
b47e75e7987708765c8e7ec00e24abd2afc13355 | e12264c9052df7d548300af5879e74939aaf834e | /db_gen/run_db_gen.cpp | d80efcf886be115c3a3fa06b1ddcbe888d774c7c | [] | no_license | jevgienij/sim_map | df0c85c5f731f546c18b5ae3901bd115187f7e27 | 1cffc0e002394c88ced4b3b75abe0381fa8f62a3 | refs/heads/master | 2021-01-23T21:38:40.636460 | 2014-03-11T18:28:25 | 2014-03-11T18:28:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 306 | cpp | run_db_gen.cpp | #include <db_gen.h>
using namespace std;
int main(int argc, char** argv)
{
if (argc != 2)
{
cout << " Usage: db_gen dirPath" << endl;
return -1;
}
// 1st argument - path to the dir containing all the tiles
auto vecImageDatabase = generateDB(argv[1]);
return 0;
} |
b19670bc4915cdb8ab434eb7835ea326856fe9cb | 794ec36417d1f5fe9f8a8dfefee17169ba346447 | /ACM-ICPC-Contests/2018CCPC网络赛/HDU6438.cpp | d4e03c09feb682e0b17e6a506eb10ce5e09cb7ee | [] | no_license | riba2534/My_ACM_Code | 1d2f7dacb50f7e9ed719484419b3a7a41ba407cf | fa914ca98ad0794073bc1ccac8ab7dca4fe13f25 | refs/heads/master | 2020-03-24T01:19:19.889558 | 2019-03-11T03:01:09 | 2019-03-11T03:01:09 | 142,331,120 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 937 | cpp | HDU6438.cpp | #include <bits/stdc++.h>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const ll N = 1e5 + 40;
priority_queue<ll, vector<ll>, greater<ll>> q;
unordered_map<ll, ll> mp;
void solve()
{
while (!q.empty())
q.pop();
mp.clear();
ll n, x, ans = 0, cnt = 0;
scanf("%... |
e34bbdd7505b1fcfa8bba263f031a150ca46c5cd | 920b640a434592cce0e3dd9f15df4aab84c6c6d7 | /src/StringUtil.cc | b01c16d72c1cd3511b8347d2243f345d192d3c9d | [] | no_license | gaoxinbo/logger | 7b0c9f00968f2001f19436d762b0fef914ab3c81 | d912cd1e9c30f2ca6831417a7bce7512641c2a02 | refs/heads/master | 2021-01-19T19:35:35.808477 | 2014-06-10T13:35:38 | 2014-06-10T13:35:38 | 2,609,856 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 762 | cc | StringUtil.cc | // Copyright 2014, Xinbo Gao. All rights reserved.
// Author: Xinbo Gao gaoxinbo1984@gmail.com
#include "StringUtil.h"
using namespace std;
namespace logger {
StringUtil::StringUtil() {
}
StringUtil::~StringUtil() {
}
string StringUtil::trim(const string &s){
string::size_type first,last;
first = last = 0;
... |
ab2d1fecbcf224ecf5b927cd577d6350d6153a2a | eb8edc04a84653cc1623b3c2da685506a5bd7c5b | /MuxerPcm/src/MuxerPcm/MuxerPcm.h | f71782b4f5c000b63aa6740f38e6fffbd518f8b9 | [] | no_license | cugxchen/MuxerAudio | 989d78e678c36282d7fe11854df17541964753a5 | 3e0e26471aa5bfd572b502dc8ec34e4e2980df68 | refs/heads/master | 2020-03-17T23:17:53.994683 | 2018-05-19T07:58:30 | 2018-05-19T07:58:30 | 134,038,815 | 0 | 1 | null | null | null | null | GB18030 | C++ | false | false | 1,202 | h | MuxerPcm.h | //
// Created by 909845 on 2018/5/19.
//
#ifndef MUXERPCM_MUXERPCM_H
#define MUXERPCM_MUXERPCM_H
#include <cstdio>
#include "../Public/Type.h"
using namespace std;
class MuxerPcm
{
public:
MuxerPcm();
virtual ~MuxerPcm();
public:
void Muxer();
private:
/*
* 限制幅值到 16... |
581d9c017a9139a9028cf4b8858cbf7f498f72d6 | 5d83739af703fb400857cecc69aadaf02e07f8d1 | /Archive/f47668cc0c7e3c7614903f1f2421d131-16ccd8065d089fe1982fc39c3a92e82f/main.cpp | 6f31032efda44380eae72a2646469fdd3931e15b | [] | no_license | WhiZTiM/coliru | 3a6c4c0bdac566d1aa1c21818118ba70479b0f40 | 2c72c048846c082f943e6c7f9fa8d94aee76979f | refs/heads/master | 2021-01-01T05:10:33.812560 | 2015-08-24T19:09:22 | 2015-08-24T19:09:22 | 56,789,706 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 315 | cpp | main.cpp | #include <iostream>
struct Number {
int n;
Number(int a):n(a){}
Number operator++(int i)& {
++n;
return *this;
}
Number operator++(int i)&& {
++n;
return std::move(*this);
}
};
int main() {
Number x(5);
x++;
x++++++++++;
std::cout << x.n;
}
|
981fd55256fdf42bff59826283894337d05876df | 9b96faaf9d97aa5a3d63a4370f331eafb929b0c1 | /Prac4OpenCLMatrix/MatrixOperations.cpp | 76499af7558af8622a0c43c8d33e3a4c3a5678dd | [] | no_license | ZalkinV/MTP.Labs | aef87aa674a33b93e65964dcf872e2bb1b76d448 | 73f13acadb786218be7242a7088befcaa4d881ed | refs/heads/main | 2023-08-01T08:06:07.129105 | 2021-09-18T14:43:49 | 2021-09-18T14:43:49 | 345,351,085 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,741 | cpp | MatrixOperations.cpp | #include "MatrixOperations.h"
#include <stdio.h>
int** multiply(int** matrixA, int** matrixB, int rowsCount, int colsCount, int elsCount)
{
int** matrixRes = new int* [rowsCount];
for (int iRow = 0; iRow < rowsCount; iRow++)
matrixRes[iRow] = new int[colsCount];
for (int iRow = 0; iRow < rowsCount; iRow++)
{
... |
3c52ee3a38f46dfbf2429894e0516ff48264fb6c | 8d8b618bed48595e2475cfef3ddc502810024026 | /Stack/Special_Stack.cpp | 7a95f39250eb2423adabc6d9aadd5dba45440087 | [
"MIT"
] | permissive | AABHINAAV/InterviewPrep | acef002b69be61ca1ff0858559f1b4bd24ce2203 | 22a7574206ddc63eba89517f7b68a3d2f4d467f5 | refs/heads/master | 2022-01-09T20:06:41.828170 | 2019-05-21T09:33:52 | 2019-05-21T09:33:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,266 | cpp | Special_Stack.cpp | //Special stack ADT with added features like:
//getMiddle():returns middle element
//deleteMiddle():as the name suggests
//All these in O(1)
/*
see count of elements .If the count becomes odd
then move the middle pointer
otherwise on pop if the count becomes even
then move the middle backwards
*/
#include<iostr... |
805605b87535908606b83e3840767cff544a9274 | d7d17131a5e7bf990599e29751ab038c957ceb75 | /loan.cpp | 567ffa56d9305ac83fffa66e63a30f75dececc74 | [] | no_license | ksmail13/Algorithm | a3b76c651b125e4bd69353673b92e3edf04fec90 | 1a9970b0cd4395a4e29c042f49ed6af7e89c51d3 | refs/heads/master | 2021-01-16T00:28:30.366247 | 2018-09-04T17:24:25 | 2018-09-04T17:24:25 | 21,740,346 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,017 | cpp | loan.cpp | #include <iostream>
#include <cstdio>
using namespace std;
double balance(double n, double m, double p, double c) {
double temp = n;
//printf("n %lf m %lf p %lf c %lf\n", temp, m, p, c);
for(int i=0;i<m;i++) {
temp *= (1+p/1200.0);
temp -= c;
}
//printf("result %lf\n", temp);
ret... |
24703f5d747310b85cd8b96b2f17a5bba72c2780 | a4ace471f3a34bfe7bd9aa57470aaa6e131012a9 | /LintCode/1479_Can-Reach-The-Endpoint/1479_Can-Reach-The-Endpoint_V3.cpp | 4a9a7b129b5d9c6bb05f6b37fe2403e182c1b50c | [] | no_license | luqian2017/Algorithm | 52beca787056e8418f74d383f4ea697f5f8934b7 | 17f281fb1400f165b4c5f8bdd3e0500f6c765b45 | refs/heads/master | 2023-08-17T05:37:14.886220 | 2023-08-08T06:10:28 | 2023-08-08T06:10:28 | 143,100,735 | 1 | 3 | null | 2020-10-19T07:05:21 | 2018-08-01T03:45:48 | C++ | UTF-8 | C++ | false | false | 529 | cpp | 1479_Can-Reach-The-Endpoint_V3.cpp | class Solution {
public:
/**
* @param map: the map
* @return: can you reach the endpoint
*/
bool reachEndpoint(vector<vector<int>> &grid) {
return helper(grid, 0, 0);
}
private:
bool helper(vector<vector<int>> &grid, int x, int y) {
if ((x == grid.size()) || (y == grid[0]... |
98089864b517a48aa404df216431b487d6c01375 | 1a8e271b380222eb0f56424eaf8407c21cd0e2cc | /easy/linked_list/21_Merge_Two_Sorted_Lists.cpp | c72cc0e138dd5918a2aba3fac74b263c3ab0bd8a | [] | no_license | Ruoyiran/LeetCodeSolution | ea32645f818e21aa83f2ecd2cef63fffe95551b9 | d374950d039e92ef8b2abab20626fd8d22e271be | refs/heads/master | 2022-06-10T10:04:58.569158 | 2020-05-07T07:36:22 | 2020-05-07T07:36:22 | 258,119,025 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,582 | cpp | 21_Merge_Two_Sorted_Lists.cpp | //
// Created by ranpeng on 2020/4/12.
//
#include "common.h"
// 将已排好序的两个链表连接到一起，返回连接的链表。
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if (l1 == NULL) {
return l2;
}
if (l2 == NULL) {
return l1;
}
ListNode* dummyNode ... |
1502e6efa14b762c8b22e0caa72830db283569e1 | c043c8e5b58dea9ccc9e1be27b2b561c4de98e3e | /planning/scenario_planning/lane_driving/behavior_planning/turn_signal_decider/src/turn_signal_decider_core.cpp | 3153448fff0b7518a951b4ef7754cd35a3fab366 | [
"Apache-2.0"
] | permissive | nisailhan/AutowareArchitectureProposal.iv | f726ee44ae92797f46934cbe302d81846f18cb09 | 7333a054008968b026771c62d24a940e06869467 | refs/heads/main | 2023-08-14T04:17:48.720996 | 2021-09-14T08:14:32 | 2021-09-14T08:14:32 | 406,666,056 | 1 | 0 | Apache-2.0 | 2021-09-15T08:00:41 | 2021-09-15T08:00:41 | null | UTF-8 | C++ | false | false | 9,961 | cpp | turn_signal_decider_core.cpp | // Copyright 2020 Tier IV, 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 applicable law or agreed to i... |
debbf28b527d0a462e97f512009fdf317664086f | 8c1e0392515f7d16cc988a6fdaf576bc25fde4eb | /tfp/include/tfp/math/CoefficientPolynomial.hpp | f69586c368aa32ccbaf849ef3303ff8981a913b7 | [] | no_license | TheComet/tfp | 97a252c6512e9ff94d4a515b335904aecec5ec1a | a4d4e42ba97130ea3d7dc0cbe229e4c8fb79d742 | refs/heads/master | 2021-09-24T07:28:26.644360 | 2017-11-18T09:04:49 | 2017-11-18T09:04:49 | 95,609,729 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,547 | hpp | CoefficientPolynomial.hpp | #pragma once
#include "tfp/math/CoefficientPolynomial.hxx"
#include "tfp/math/RootPolynomial.hpp"
namespace tfp {
// ----------------------------------------------------------------------------
template <class T>
CoefficientPolynomial<T>::CoefficientPolynomial()
{
}
// ----------------------------------------------... |
e193ccf2efbdb3246be82c40a9d981e6836e8918 | 57dc76ec9bd6464d68c49c152183ecba2833067c | /src/gui/video_window/VideoWindow.h | c36cbc3bab3ec771c3fc6c9485665ebd059d3dfa | [
"MIT"
] | permissive | SyllogismRXS/opencv-workbench | bb737754c05631a3057891a945483b572aee26f9 | 2fb5b0d67589642d438f21f1cf58aaa761d15757 | refs/heads/master | 2020-04-06T07:01:50.398354 | 2017-07-10T21:16:28 | 2017-07-10T21:16:28 | 13,833,724 | 7 | 12 | null | null | null | null | UTF-8 | C++ | false | false | 4,749 | h | VideoWindow.h | /****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the examples of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:BSD$
** You may use this file under the ter... |
bca0e03950c3f9a67f507ea674d1e4c6510e28a4 | 56e615c555c423a3bc68ad0e9a5677c7c94960ef | /libi2pd/LittleBigEndian.h | 8c081187d3a2fde822c027e9618c852f8fb44ef9 | [
"BSD-3-Clause",
"OpenSSL"
] | permissive | PurpleI2P/i2pd | bc1f5c2513e3f0b7a51b274001e343142c403f79 | 7b6aa41ca8dc3ca2a0c9d01ff9870794ad98e403 | refs/heads/openssl | 2023-09-04T04:44:21.112974 | 2023-08-31T16:52:51 | 2023-08-31T16:52:51 | 12,522,239 | 2,642 | 540 | BSD-3-Clause | 2023-09-07T14:25:41 | 2013-09-01T15:09:28 | C++ | UTF-8 | C++ | false | false | 4,147 | h | LittleBigEndian.h | /*
* Copyright (c) 2013-2020, The PurpleI2P Project
*
* This file is part of Purple i2pd project and licensed under BSD3
*
* See full license text in LICENSE file at top of project tree
*/
// LittleBigEndian.h fixed for 64-bits added union
//
#ifndef LITTLEBIGENDIAN_H
#define LITTLEBIGENDIAN_H
// Determine Little-En... |
c60818665285f3b3b54f6f6ebe6f46d34394800e | 084d470c89c1afdc00d9109af4b7a0f58e542fec | /minidump/cpp/data_structures.h | 9474002841034372a2e85a6b91ca992c040dc814 | [
"MIT",
"Apache-2.0"
] | permissive | robopsi/symbolic | fc8673031f8a816fac2cc13bcff076f351fb84a9 | 58ba344d74eac6ca69e28b6b7ee4853293616248 | refs/heads/master | 2020-03-19T07:18:43.379580 | 2018-05-30T06:10:17 | 2018-05-30T06:10:17 | 136,103,804 | 0 | 1 | null | 2018-06-05T01:43:23 | 2018-06-05T01:43:23 | null | UTF-8 | C++ | false | false | 10,041 | h | data_structures.h | #ifndef SENTRY_DATA_STRUCTURES_H
#define SENTRY_DATA_STRUCTURES_H
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#ifdef __cplusplus
extern "C" {
#endif
/// Structure holding all stack frames in a certain thread. Use the call_stack_*
/// family of functions to interact with a call stack.
struct call_stack_... |
360f4cd0ae9407d39317cacd590a48d04410408e | 7b8c4576fd8582d1b5bce56f38b4cc06902a8020 | /main.cpp | d210ed2d2f436c5787995401d7bdce3db3ad4bbc | [] | no_license | MaxCarlson/SimpleNeuralNet | 3773251ffdc45057edcd199e4bdd10baee893499 | c10064f4c8ba7eab21fc9b1fa5948f13f8e3b448 | refs/heads/master | 2021-01-06T20:40:01.995746 | 2017-08-07T05:45:39 | 2017-08-07T05:45:39 | 99,540,947 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,211 | cpp | main.cpp | #include <iostream>
#include <vector>
#include <random>
#include <stdlib.h>
using namespace std;
//using vector
vector<float> inputSet {
0, 0, 0, 1,
0, 1, 0, 0,
0, 0, 0, 0,
1, 1, 0, 1
};
vector<float> rOutPut {
1, 1, 0, 1
};
vector<float> iWeights {
0.5,
0.5,
0.5,
0.5
};
vector<... |
5bb44bd3a6380af251f173b143beaa68eef921aa | 6952e2b2b753a3130cdaa7b820a4f610a897aadf | /1197.cpp | 3893c48d5a031c181ce705bda4270d9e4a4cff54 | [] | no_license | ytw0728/BOJ | 37abf996565d53b75ce328daab5b2b8af2f8550f | 261170ab8b607338949ae3df008da223f4d359b5 | refs/heads/master | 2021-09-17T09:59:08.632207 | 2018-06-30T13:27:35 | 2018-06-30T13:27:35 | 112,865,184 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,819 | cpp | 1197.cpp | /*
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
vector<pair<int,int>> adj[10001];
int v, e, s;
vector<int> routePoint;
bool chk[10001];
int main() {
scanf("%d %d", &v, &e);
for (int i = 0; i < e; i++) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
adj[a].push_back(make_pair(... |
19518d4166d3c83454d9d033daba1dde085392c8 | 1dbded85668100d2f6946dc72f8780458e3e22e5 | /test/test.cpp | f316d3c86f128f5105c2a4065a9100564b64bc66 | [
"MIT"
] | permissive | harish1696/Midterm-Project | b7dc43a77c62fc1b936e48e98b9fd25285ed0bab | dd67226577243a81ff89d9ef7953fc93a178e4a1 | refs/heads/master | 2021-05-16T04:36:10.456038 | 2017-10-18T03:58:30 | 2017-10-18T03:58:30 | 106,120,485 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,483 | cpp | test.cpp | /**
* @file detectQRcode.cpp
* @author Harish Sampathkumar
* @copyright MIT License
*
* @brief Warehouse Robot - Stock Tracking and Counting Module
*
* @section Description
*
* Test cases
*
*
*/
#include <gtest/gtest.h>
#include <detectQRcode.hpp>
#include <decodeQRcode.hpp>
#include <countID.hpp>
#include... |
206afb6fe847118b75c19183db35cd1e585fe82c | 78801fff0194d10740cc200f6291ec02fbb6b56d | /DBSCAN-master/Damp/vect3d.cpp | 0671ae374091704e31e2054928531d7e18b70847 | [
"MIT"
] | permissive | NikitaMushchak/DBSCAN | f51f7bdd3bc192fa33b8fc6e2f0a9108ecf79ac8 | 73616381c8778da8b047cab44c50d9465bcb0f0d | refs/heads/master | 2020-04-21T13:07:16.497335 | 2019-04-11T07:03:42 | 2019-04-11T07:03:42 | 169,587,809 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,329 | cpp | vect3d.cpp | //-----------------------------------------------------------------------------------
//
// 3D Vector class
//
// Anton M. Krivtsov
//
// 11.04.2001
//
//-----------------------------------------------------------------------------------
#include "vect3d.h"
//#include "util.h"
inline double rand(const ... |
c3af7421ed66f6b357ead558e648fe583e59e5d9 | 88ae8695987ada722184307301e221e1ba3cc2fa | /v8/src/heap/objects-visiting-inl.h | c8af4430acbc7e9202e18a6749db6002dbd425b9 | [
"BSD-3-Clause",
"SunPro",
"Apache-2.0"
] | 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 | 15,254 | h | objects-visiting-inl.h | // Copyright 2012 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_HEAP_OBJECTS_VISITING_INL_H_
#define V8_HEAP_OBJECTS_VISITING_INL_H_
#include "src/base/logging.h"
#include "src/heap/mark-compact.h"
#inclu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.