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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a89e7c5138da80edd02502821a8180830adcd66d | ce6d73653df23f893e2df68210a298a923f67b89 | /2021/Day26/Course Schedule II/Course Schedule II.cpp | 0f3a3f0925473a3029e1b736e475f6a8979e322f | [] | no_license | rajsureshgeorge/Algo-101 | c5405860f22f6ff4a794637ebbb069307b95441f | f447b49b664391ca1ae0d4b6e1abf20e8dc93b6b | refs/heads/master | 2023-04-12T10:25:55.496394 | 2021-05-10T13:24:38 | 2021-05-10T13:24:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,829 | cpp | Course Schedule II.cpp | class Solution
{
public:
bool dfs(int node, vector<vector<int>> &graph, vector<int> &visited, vector<int> &result)
{
visited[node] = 1;
for (int i = 0; i < graph[node].size(); i++)
{
if (visited[graph[node][i]] == 1)
return false; // if this node is u... |
56543f4d6db1c52a450e255247068236acc7a1a0 | c2ad54eca6cb0be854827d4a68360677a59764d0 | /Source/Main/RocketCommanderTest/Line2DTest.cpp | 0c7713259396fa7b52c8c278ff90201e43beac07 | [] | no_license | likeleon/RocketCommanderOgre | 7fb5c02e378ad90939cb2d3da126ac371b34aa6e | e7d67c1599114193dae713c495df841955a11495 | refs/heads/master | 2021-01-10T20:05:07.256962 | 2013-01-29T14:00:01 | 2013-01-29T14:00:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 898 | cpp | Line2DTest.cpp | #include "stdafx.h"
#include "TestGame.h"
#include "Line2D.h"
#include "RandomHelper.h"
using namespace RocketCommander;
using namespace Ogre;
BOOST_AUTO_TEST_SUITE(Line2DTest)
BOOST_AUTO_TEST_CASE(RenderTest)
{
class RenderTestGame : public TestGame
{
virtual bool keyPressed(const OIS::KeyEvent &evt)
{
if ... |
4c9fbd50287a695ae95f3b217dafe23c516d2d8e | 5cec37261e756a98b632eda290d4869461738403 | /core/src/utility/string_utility.cpp | 7d37233a70305ca607ff6d706685cb9de0da7652 | [
"MIT"
] | permissive | maierbn/opendihu | d78630244fbba035f34f98a4f4bd0102abe57f04 | e753fb2a277f95879ef107ef4d9ac9a1d1cec16d | refs/heads/develop | 2023-09-05T08:54:47.345690 | 2023-08-30T10:53:10 | 2023-08-30T10:53:10 | 98,750,904 | 28 | 11 | MIT | 2023-07-16T22:08:44 | 2017-07-29T18:13:32 | C++ | UTF-8 | C++ | false | false | 3,448 | cpp | string_utility.cpp | #include "utility/string_utility.h"
#include <iostream>
#include <algorithm>
#include <iomanip>
#ifdef __GNUC__
#include <cxxabi.h>
#endif
namespace StringUtility
{
int getNumberAfterString(std::string line, std::string key)
{
std::string value = line.substr(line.find(key)+key.length());
// remove leading white... |
11809c287d16dbf2d34354847cd6042272fba908 | 849998d5a2de1e9a361f56b90b1157d72f8b3685 | /model/point3.h | 0d7e06f172e18f7423e11bb54bfa19a9c8486450 | [] | no_license | gaudaost/N-Body-simulation | 0847b0ba95eebd41ba58b6e15b8a950fbaae9f2b | 1431d6fb6021580f07fcf82fa0e54e53bbe83d6f | refs/heads/master | 2021-01-10T11:12:37.125943 | 2015-10-10T18:24:58 | 2015-10-10T18:24:58 | 43,997,579 | 0 | 0 | null | 2015-10-10T18:29:36 | 2015-10-10T06:28:12 | C++ | UTF-8 | C++ | false | false | 707 | h | point3.h | /*
* point3.h
*
* Created on: 8. okt. 2015
* Author: gaudaost
*/
#ifndef POINT3_H_
#define POINT3_H_
#include <vector>
#include <iostream>
using namespace std;
class Point3 {
private:
vector<float> point;
public:
Point3(vector<float>);
Point3(float, float, float);
Point3():Point3(0,0,0){}
float norm... |
974dce0065a032f9757c1075edc3df9c58ad18a8 | f89b03dd7ce186caf3f5e249cc0b63579ae22186 | /SampleBitmap/TObject.h | f6a1183e0bc4f4dc20a8ddb8c0c3e77ab3db5311 | [] | no_license | yura0525/01_YuraHomework | cdf8c645c47c71f39bf7edf44093977b9c7d273c | 7f2a37ee19e1a00eb301ff676f7fbaf8f9954b22 | refs/heads/master | 2021-07-12T07:12:24.630819 | 2019-02-26T08:11:15 | 2019-02-26T08:11:15 | 146,382,373 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 2,043 | h | TObject.h | #pragma once
#include "TBitmapMgr.h"
#include "TCollision.h"
#define LR_ROTATION 0x01
#define TB_ROTATION 0x02
#define LRTB_ROTATION 0x04
struct TPoint
{
float x;
float y;
};
class TObject
{
public:
TBitmap* m_pColorBitmap;
TBitmap* m_pMaskBitmap;
TPoint m_pos;
TPoint m_posDraw;
RECT m_rtDraw;
RECT m_rtColl... |
c06b5b345d6ce7368f32c58ad909b3b6e68a1dd1 | 641ed3bf03a2088132e8ff365132f1ea486902fa | /ses/monsters.cpp | 044145b8fa579b6fbf586c1d36a6edfab570daaa | [] | no_license | OperDoc/Problems | 765dacd3562afe61adb3f319668cb84c2d7600d0 | 1ad2b8cdb06aae0dfa8f332757b31576cdbe88ef | refs/heads/master | 2020-04-14T23:42:35.104476 | 2019-07-24T07:00:01 | 2019-07-24T07:00:01 | 164,212,674 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,113 | cpp | monsters.cpp | #include <bits/stdc++.h>
using namespace std;
string g[1010];
int da[1010][1010], dm[1010][1010], dans[1010][1010];
int lst[1010][1010];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int n, m;
void bfs1() {
queue<pair<int, int>> q;
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
if(g[... |
72762499da182c4c1f36155fbb26a083333fe1b0 | c548dc2157125e61b83840d11cd125167b12fc27 | /RayTracing/Lesson1/lesson1.cpp | 975d1bd697e2d458e78f192fd4982615265b4073 | [] | no_license | channyHuang/QtOpenGL | c3e6288b83507a865a1b2b502eeb47acd6233781 | e2ca060c8739009440481b71b1469f939f308b6d | refs/heads/master | 2023-02-02T01:39:00.806649 | 2023-01-18T03:56:34 | 2023-01-18T03:56:34 | 19,778,559 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,197 | cpp | lesson1.cpp | #include <QCoreApplication>
#include <QDebug>
#include <iostream>
#include <fstream>
#include "sphere.h"
void generatePPM() {
const int image_width = 200;
const int image_height = 100;
std::ofstream ofs("ppmImage.ppm");
ofs << "P3\n" << image_width << ' ' << image_height << "\n255\n";
for (int... |
d45a07cfe95493441931ca04364da8bfc7bbb120 | 2734d83f14886520ab55c7db3b346b56554f1536 | /interviewbits/Allocate Books.cpp | e8801596e70cac83ee7ba543e48e6d0730167973 | [] | no_license | tanmesh/curly-doodle | eff9de8ede663a7a3ac1ac6802954c7b2b37735a | 2caa1f4862c72ebf1cdeb0cbfcc833453936d6bf | refs/heads/master | 2023-05-27T18:18:15.808566 | 2021-06-09T05:47:29 | 2021-06-09T05:47:29 | 272,289,099 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,327 | cpp | Allocate Books.cpp | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define F first
#define S second
#define pb push_back
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ... |
e4e5386060b3492bbdbcb396f4e1a3e3d09ad2a3 | 48be8f0e283a4bd7c2e19dabe598b6962af7d9e6 | /logwidgetmainwindow.cpp | ba6b77a9b6f1a6dcf11789ee1f42a783780402ca | [] | no_license | KurlesHS/LogWidget | 303bac8ae88fd8205fa6e2fd9d54f05c1059183d | 9579129f1920894098da10935083f262548bdb61 | refs/heads/master | 2021-01-02T09:27:58.371974 | 2014-12-19T13:36:24 | 2014-12-19T13:36:24 | 23,491,122 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,797 | cpp | logwidgetmainwindow.cpp | #include "logwidgetmainwindow.h"
#include "ui_logwidgetmainwindow.h"
#include "logmodeldelegate.h"
#include "logmodelextended.h"
#include "logmodeldata.h"
#include <QFileDialog>
#include <QUuid>
#include <QTimer>
#include <QDebug>
#include <QObject>
LogWidgetMainWindow::LogWidgetMainWindow(QWidget *parent) :
QMa... |
0d2f39d620d038ad2055a8bb0adbb658af2e0caa | 89d634394369f834588b2bd56c9986fdf60a5f99 | /main.cpp | fc8d223864ec5b6ce3ae25c12e6ce311266fb919 | [
"MIT"
] | permissive | liderrick/Two-Player-Tic-Tac-Toe-Game | 4463685ee3bf6c89a6bef77850432fc3c3e4df8c | a33c4f594dd3aea4d4bfabdfb0bf40360b080c8b | refs/heads/master | 2020-04-09T20:21:30.452103 | 2018-12-05T20:46:54 | 2018-12-05T20:46:54 | 160,571,098 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,440 | cpp | main.cpp | #include <iostream>
#include <cctype> //needed for toupper function
#include <string>
#include <limits>
#include "Board.hpp"
#include "TicTacToe.hpp"
using std::endl;
using std::cin;
using std::cout;
using std::string;
using std::toupper; //used to change user input from lowercase to uppercase character
/*********... |
7496aad578d18cb39019966688063b9db8dc1cf0 | a4acd177a1ac305a5432ed85f5a367721d940635 | /element.cpp | a5c4be234dd9eec1db1580d83de18b0c41867f99 | [] | no_license | Orzobimbumbam/gattoDiShroedinger | dcc77ee03b75ba2d0e8ccdd958075406177c6f31 | 2d0bdc80332a693b4cef79d516adccc4dda3729e | refs/heads/master | 2021-05-11T07:57:56.784302 | 2018-11-13T21:42:20 | 2018-11-13T21:42:20 | 118,035,948 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,472 | cpp | element.cpp | #include "element.hpp"
#include "schroddy.h"
#include "parameters.h"
#include "eigenvalues.hpp"
#include <map>
#include <iomanip>
#include <sstream>
const unsigned long Element::maximumAlphaSetSize = 3; // nr, l, j
const unsigned long Element::minimumAlphaSetSize = 2; // nr, l
// Filling the orbitals
Element::Elemen... |
592e32e4de2c65bc3626586bf358e27179317a8e | e602cd675d7c83e714a0b5ddf29508ded704ef9b | /opencv/Dehaze.cpp | 9bcf59ee12968a7b3587e7344543a81e61a3f741 | [] | no_license | Ella2le/Photoshop_algorithm | b6a8fe6fce70ae1988dc9ea61933557cfc9b0559 | 09b96e1358bcc814a64321626bf5175b5d9cd703 | refs/heads/master | 2021-10-08T05:07:34.626467 | 2018-12-08T02:22:37 | 2018-12-08T02:22:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,636 | cpp | Dehaze.cpp |
#include "PS_Algorithm.h"
void Dark_Channel(Mat& src, Mat& dst, int Block_size);
double Atmosperic_Light(Mat& J_dark, Mat& Img);
void Recove_Img(Mat& src, Mat& dst, Mat& T, float Th, float A);
int main(void)
{
Mat Img;
Img=imread("5.jpg");
Mat D_Img(Img.size(), CV_32FC3);
Img.convertTo(D_Img, CV_32F... |
85c0fae5ef5ec7353f07e33591b1461bcd781bf2 | 336667193994c64e72de74c58785ccf521d623f7 | /DesignPatterns/SingletonMultithread/SingletonMultithread.cpp | 98d441f5ba3ce54bce41e31d2df600eac2d72142 | [] | no_license | Sahil12S/cpp-programs | c7a0a35b4a0d1c68980fef1ae08a542bf2155efa | 1dfed50f25093db241a0c012b99545a3b42c73f7 | refs/heads/master | 2021-04-27T12:01:05.544432 | 2019-06-07T16:04:00 | 2019-06-07T16:04:00 | 122,570,814 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,447 | cpp | SingletonMultithread.cpp | //============================================================================
// Name : SingletonDP.cpp
// Author : Sahil Sharma
// Version :
// Copyright :
// Description : Checking multi-threading with Singleton Design Pattern.
//=====================================================================... |
7814b9b5a2e15daa9a5bd45096aeb59e8840209f | 14c51fe955fd1c4bb3732d9001d4d24ef7f35964 | /src/nut/platform/endian.h | 29fea499708306cb1e11129a65abf4f4e5fd0c62 | [] | no_license | shenxuebing/nut | 476fea0328e0c0dc6237cbf58843ad7017ec53b8 | 580bbfce2621d631c9eb7a8b059d14579c97ca90 | refs/heads/master | 2023-08-12T19:04:42.450681 | 2019-06-12T16:22:56 | 2019-06-12T16:27:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,251 | h | endian.h | /**
* See:
* https://gist.github.com/panzi/6856583
* https://sourceforge.net/p/predef/wiki/Endianness/
* https://www.boost.org/doc/libs/1_69_0/boost/predef/other/endian.h
* https://docs.microsoft.com/en-us/previous-versions/visualstudio/visual-studio-2012/b0084kay(v=vs.110)
*/
#ifndef ___HEADFILE_BA... |
05f61cb1b23fe3e31cf871ea988538ed87af1bf0 | cad3e355e2a71a0cd6912b98fab11432e90baaec | /C++/HackerRank/MinimumDistances.cpp | 21cdb53ece454abb3bcf049b41a64d4734c9fd24 | [] | no_license | PradeepThota95/Coding | c10baec61f31200c81f54a3ab9fb5ddef8a44009 | b3cbe6af8d33efa6d48c182363f04ab4d38955be | refs/heads/master | 2020-05-09T14:47:37.153843 | 2020-02-11T02:53:17 | 2020-02-11T02:53:17 | 181,207,293 | 0 | 0 | null | 2019-10-13T15:54:42 | 2019-04-13T17:39:51 | Python | UTF-8 | C++ | false | false | 511 | cpp | MinimumDistances.cpp | #include <iostream>
using namespace std;
void findMinimum(int a[], int n)
{
int min_dist = -1;
for(int i = 0; i < n; ++ i) {
int pair_distance = -1;
for (int j = n-1; j > i; -- j) {
if(a[i] == a[j])
pair_distance = j - i;
}
if(min_dist > pair_distance)
min_dist = pair_distance;
}
cout << "The M... |
2de0c460359c59fd011f678b2dad05783d294ae5 | f6ab96101246c8764dc16073cbea72a188a0dc1a | /OnlineJudge/ZEROJUDGE/b302.cpp | b749e26a42b3a98975b84d417865c6a348b7add9 | [] | no_license | nealwu/UVa | c87ddc8a0bf07a9bd9cadbf88b7389790bc321cb | 10ddd83a00271b0c9c259506aa17d03075850f60 | refs/heads/master | 2020-09-07T18:52:19.352699 | 2019-05-01T09:41:55 | 2019-05-01T09:41:55 | 220,883,015 | 3 | 2 | null | 2019-11-11T02:14:54 | 2019-11-11T02:14:54 | null | UTF-8 | C++ | false | false | 1,015 | cpp | b302.cpp | #include <stdio.h>
#include <string.h>
const unsigned long long mod = 100000007;
struct Matrix {
unsigned long long v[2][2];
int row, col; // row x col
Matrix(int n, int m, long long a = 0) {
memset(v, 0, sizeof(v));
row = n, col = m;
for(int i = 0; i < row && i < col; i++)
v[i][i] = a;
}
Matrix operator... |
812a2ec1b7990ae10d45a26738482d072ba6eb49 | e2b7d6a0a8b61930e594945d950b43abdaf542a7 | /Boyer Moore Vs Rabin Karp/BruteForceV8/BruteForceV8/listener.cpp | 00bdda5ccb41ac456e2fcefb8168c3b3534c3708 | [] | no_license | Swayther/Brute-Force-Password-Cracking | 39a19fb7f947f6cd8049a8f60671118f4c903cbc | 62a3dff5c2159c7659f23b058d0385b364868050 | refs/heads/master | 2020-04-01T10:20:44.025266 | 2018-11-08T18:56:47 | 2018-11-08T18:56:47 | 153,113,616 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 507 | cpp | listener.cpp | #include "listener.h"
listener::listener()
{
}
listener::~listener()
{
}
void listener::endAll() //ends all the threads running if the password is found
{
std::unique_lock<std::mutex> lck(signalContainer->endThreads_mutex);
while (!signalContainer->endThreads) signalContainer->endThreads_cv.wait(lck)... |
69842b20ddd5c1c472c7bd27859ca32a7d0c1aaa | 54fc5ebfec1c8ed3e4216b9ed58efd7591d296e0 | /android/pytorch_android/src/main/cpp/pytorch_jni_common.h | 72ed871f2a6f008814833e8b004758f46bd90698 | [
"BSD-3-Clause",
"LicenseRef-scancode-generic-cla",
"Apache-2.0",
"BSD-2-Clause"
] | permissive | crowsonkb/pytorch | 6be363af7cf9656b898293a590a118f9defec18e | 65f691f2c250408898dd7739a8c6f8b88ab5ac9f | refs/heads/master | 2020-09-09T20:53:54.645209 | 2019-11-13T23:14:08 | 2019-11-13T23:17:16 | 221,565,311 | 1 | 0 | NOASSERTION | 2019-11-13T22:41:17 | 2019-11-13T22:41:17 | null | UTF-8 | C++ | false | false | 1,099 | h | pytorch_jni_common.h | #include <fbjni/fbjni.h>
#include <torch/csrc/api/include/torch/types.h>
namespace pytorch_jni {
class JIValue : public facebook::jni::JavaClass<JIValue> {
public:
constexpr static const char* kJavaDescriptor = "Lorg/pytorch/IValue;";
constexpr static int kTypeCodeNull = 1;
constexpr static int kTypeCodeTensor... |
8a9ab9c7215b074cef691f76b9c57334f2cedad7 | 8adb8107e4175d5a7dc6f082a3c031c969dbbfed | /main.cpp | fb3d4ea2cdc6c71bf7aeae740659d77d66d882a6 | [] | no_license | baradoid/grabber | b5c4d4230fbf1c82b53481d2e63eccff70fb030f | f98e87e0b65127246ae3dbf8204974c600b60903 | refs/heads/master | 2021-01-23T20:06:40.414928 | 2017-09-08T11:09:47 | 2017-09-08T11:09:47 | 102,852,202 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,692 | cpp | main.cpp | //#include <iostream>
#include <stdio.h>
#include <windows.h>
#include <conio.h>
int main(int argc, char * argv[])
{
char szServerName[1024] = "NONE";
char szBuf[2048], lastStr[500]="";
POINT p;
HWND wfp, lastWfp=NULL;
LONG lResult;
struct sockaddr_in servaddr;
struct hostent *host = NULL;
UINT16 port... |
2e86ab9b0470c4b5d4dcb46585c758bf26d04598 | 8d74dc942a5ebf18521a12d563b8cabc792dc508 | /148A - Insomnia cure.cpp | ff9ed13d9a50215ea0d41a82dfce01f74f54a312 | [] | no_license | saikumar-aks/Codeforces-Level-800to900 | 63a01b46305a50c9aef8d4f23ab6cab4041926a1 | d15ac04fbb87b644ad50b7680012ad5b6b55874b | refs/heads/main | 2023-06-29T22:31:53.520791 | 2021-07-31T11:05:59 | 2021-07-31T11:05:59 | 374,898,438 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 418 | cpp | 148A - Insomnia cure.cpp | #include <bits/stdc++.h>
#define Log(Op) std::cout<<Op<<std::endl
int main()
{
int k, l, m, n, d, c(0);
std::cin>>k>>l>>m>>n>>d;
c=d;
if(k==1 || l==1 || m==1 || n==1)
{
Log(d);
}
else
{
for(int i=1;i<=d;++i)
{
if((i%k != 0) && (i%l != 0) && (i%m != 0) ... |
79b7c5a91dac94cbf4192699cbb4828c9d6cac2c | 04cff39b3d0e060221fb9105cf6581c4bc16b09e | /best_fit.cpp | 912853323797456483da15412cd1c67211dd41ba | [] | no_license | thyton/fasterBinPacking | 8df25f83b5e700b983c8f98225430462b9055616 | a2a66735571d7c914bd7b789ccc7c62a8fc174af | refs/heads/master | 2020-07-22T23:38:19.838107 | 2019-09-09T17:53:25 | 2019-09-09T17:53:25 | 207,370,144 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,407 | cpp | best_fit.cpp | #include "header.h"
#include <algorithm>
#include <iostream>
using namespace std;
void best_fit(const std::vector<double>& items, std::vector<int>& assignment, std::vector<double>& free_space)
{
free_space = {};
int size = items.size();
for(int i = 0; i < size; ++i)
{
int bin_cnt = free_space.s... |
168d6e5ce0f5c763d466798a3c9f989dd2de15cd | 61872b1f842fe765c0bc8df19fb5039802513704 | /C++_Programs/G4G/backtracking/landmines.cpp | 21a066b98db5c2e5f6a443a4eb4c7db387f72b29 | [] | no_license | saransh09/CppPrograms | 281d33e100f6dc7baa3851b0116654b8cbbc1f35 | 921cbb4d85b4970191a540712856acea381742ff | refs/heads/master | 2021-01-18T13:16:22.701747 | 2017-10-11T16:17:04 | 2017-10-11T16:17:04 | 100,372,434 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,160 | cpp | landmines.cpp | #include <bits/stdc++.h>
using namespace std;
int mx[] = {1,0,-1,0};
int my[] = {0,1,0,-1};
bool isSafe(int mat[12][10], bool visited[12][10],int x, int y){
if(mat[x][y]==0 || visited[x][y]) return false;
else return true;
}
bool isValid(int x, int y){
if(x<0 || y<0 || x>=12 || y>=10) return false;
else return t... |
c525621edaa1168f89cf266afce74ed13e793c7b | a1ae606216a11bf67acbce5e3461b4e1a2d407f9 | /Wipro coding test/repeated string.cpp | 892c11c04b02c5e4fdebdf615f30dc9ea1fabad5 | [] | no_license | sibashish99/Algo-in-C-Cpp | 295941f909e5ea84cbfc7937aef24a12de1cc1f5 | 6bd6d90bf59d114c05dbfeea75bb87bd1ed6b3c1 | refs/heads/master | 2023-02-19T10:56:40.476676 | 2021-01-17T16:21:59 | 2021-01-17T16:21:59 | 267,071,665 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 340 | cpp | repeated string.cpp | #include<stdio.h>
#include<string.h>
int main(){
char s[100],tos[100];
int c=0,i,j,f;
gets(s);
gets(tos);
int slen=strlen(s), flen=strlen(tos);
for(i=0;i<=slen-flen ;i++){
f=1;
for(j=0; j<flen ;j++){
if(s[i+j]!=tos[j]){
f=0;
break;
}
}
if(f==1){
c++;
}
}
pri... |
da147c78344be08feca3e77fcd634c7a569db92d | 88d0779d1c242027bd6dc2e22e418eccdb70a5dd | /Utils.h | e3f642bd420995ab8741403b21c99bd28c75e6af | [] | no_license | afreakk/pixul | 526be2f94ed70cefe3fc23e9059b7136184374be | f373514910f20e2d14e9b564b7519fcbedd692a9 | refs/heads/master | 2016-09-06T20:11:48.922137 | 2014-01-08T04:17:15 | 2014-01-08T04:17:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,306 | h | Utils.h | #ifndef _UTILS_H_
#define _UTILS_H_
////////////////////////////////////////////////////////////////////////
#include <vector>
#include <math.h>
using namespace std;
struct fPoint
{
float x;
float y;
fPoint():x(0),y(0){}
fPoint(float xx, float yy):x(xx),y(yy){}
};
int floatToInt(float f)
{
return ... |
473bfa42a6055886903f8e208fd20975fff9a7d6 | 78b28019e10962bb62a09fa1305264bbc9a113e3 | /advent_of_code/2020/src/2006a.cpp | fd7304aebf567e6917a32307e8463c46414a40d6 | [
"MIT"
] | permissive | Loks-/competitions | 49d253c398bc926bfecc78f7d468410702f984a0 | 26a1b15f30bb664a308edc4868dfd315eeca0e0b | refs/heads/master | 2023-06-08T06:26:36.756563 | 2023-05-31T03:16:41 | 2023-05-31T03:16:41 | 135,969,969 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 400 | cpp | 2006a.cpp | #include "common/stl/base.h"
#include "common/vector/read_lines.h"
#include <unordered_set>
int main_2006a() {
vector<string> vs = nvector::ReadLines();
vs.push_back("");
unordered_set<char> cs;
unsigned r = 0;
for (auto& s : vs) {
if (s.empty()) {
r += cs.size();
cs.clear();
} else {
... |
d836aeedd64c89a4cdd8f2be01e8bf166bb68302 | e21ddf9ed39c53f0433c7924f85380d4e81224be | /Guard (C++)/SrvGuard/ExEdit.h | 02b47be9e5d6f39dda9525b495323b3048d5d585 | [] | no_license | konukg/Samples | 85f39b758b0cef281b2fb614855bd67b9c4bce65 | 6aea1775bb9974f81295ff97ecdfee3e28e6c0e4 | refs/heads/master | 2020-04-14T05:05:23.460191 | 2015-06-16T09:57:57 | 2015-06-16T09:57:57 | 29,237,417 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,170 | h | ExEdit.h | #if !defined(AFX_EXEDIT_H__AAC3C040_FD30_11D4_8163_A938CBD13616__INCLUDED_)
#define AFX_EXEDIT_H__AAC3C040_FD30_11D4_8163_A938CBD13616__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
// ExEdit.h : header file
//
/////////////////////////////////////////////////////////////////////////////
// CEx... |
7d2f52cce06ec65a17aebcaa8f1ed7a4b0db0fa1 | 544e77e04e49545cfd37ae512f09bf3e399fe53c | /build/box_msgs/rosidl_generator_cpp/box_msgs/msg/detail/box__struct.hpp | 5508c96ac7f165bd7ff7a0af35f14423a2539121 | [] | no_license | LiWeiAn/map_fuse | e7338bd15bd88b15ebcea24d5222e28d41c68707 | 58641cc15012c70049cce98f23f0efd8dd3623e1 | refs/heads/master | 2023-05-26T11:47:10.932447 | 2021-06-03T21:29:06 | 2021-06-03T21:29:06 | 373,645,597 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,645 | hpp | box__struct.hpp | // generated from rosidl_generator_cpp/resource/idl__struct.hpp.em
// with input from box_msgs:msg/Box.idl
// generated code does not contain a copyright notice
#ifndef BOX_MSGS__MSG__DETAIL__BOX__STRUCT_HPP_
#define BOX_MSGS__MSG__DETAIL__BOX__STRUCT_HPP_
#include <rosidl_runtime_cpp/bounded_vector.hpp>
#include <ro... |
ce7915db9c35fc1e1fe06bb2507e7205989e0fc2 | 755b5c517c5f4dd922fd724975e5f093a2f22ff8 | /src/sexpr_dump.cc | 7d6a8652230fff1c20a316de8d99dd7f09f7e681 | [
"Apache-2.0"
] | permissive | dschuff/wasm-aot-prototype | 11b554bab678d04bd27bef5d6ff72f818ac56a54 | 71fc4e9c03b1d0ab588ecfc02cad9a1c4d157567 | refs/heads/master | 2021-08-29T07:24:12.741644 | 2021-08-26T18:39:20 | 2021-08-26T18:39:20 | 43,901,716 | 29 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 2,299 | cc | sexpr_dump.cc | /*
* Copyright 2016 WebAssembly Community Group participants
*
* 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... |
01ddd84dc8af2ce05992f618b9d45de7ffd873b3 | 683a16f36238801c92be0d454c3dbe9dfb1ebfc3 | /FileHandler.h | 945a2c1e12d3b1fb8ce7809c021d676fc80e8e0b | [] | no_license | khaden11/modelling-software | f5ace91d1fbf044602cc22b5d0fe9e0b07a70ef5 | 2499d844d26cf361e8664788f67dfd2097098e98 | refs/heads/master | 2021-09-28T16:24:47.463214 | 2017-04-12T13:09:37 | 2017-04-12T13:09:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 515 | h | FileHandler.h | #ifndef FILEHANDLER_H
#define FILEHANDLER_H
#include <QFileDialog>
#include "Object.h"
class FileHandler : public QObject
{
Q_OBJECT
public:
FileHandler();
//FileHandler();
QFileDialog *fileDialog;
QFileDialog *saveDialog;
void load();
void loadScene(QString fileName);
void saveAs(std::v... |
630c12f81ff717ecedda68e72ca9c5814732489f | 5acf987fd8fa3f35c3f97bf2d2d5a0af04106c1c | /pythagorean.cpp | e1ef7a70362e6b74794b88526eddc822770adc07 | [] | no_license | sanket2714/gfg | 946818198e1ea183a6f9ccf39dceaae4516b7cfe | 6da00bf1f65dc4bfe3e0bf33043cb0d8417ed175 | refs/heads/master | 2020-06-05T19:16:50.307091 | 2019-06-18T12:09:04 | 2019-06-18T12:09:04 | 192,522,535 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 702 | cpp | pythagorean.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin>>t;
while(t--){
long long n;
cin>>n;
long long x;
map<long long,long long> mp;
vector<long long> vc,vc1;
for(long long i=0;i<n;i++){
cin>>x;
mp[pow(x,2)]++;
vc.push_back(pow(x,2));
... |
72e04ab5d8df58a2e5487a03620b0c5c4618ad3e | 5885fd1418db54cc4b699c809cd44e625f7e23fc | /kattis/compoundwords.cpp | 9109a90f8809d0fc563f09a1bdf9e8f14cd1e38b | [] | no_license | ehnryx/acm | c5f294a2e287a6d7003c61ee134696b2a11e9f3b | c706120236a3e55ba2aea10fb5c3daa5c1055118 | refs/heads/master | 2023-08-31T13:19:49.707328 | 2023-08-29T01:49:32 | 2023-08-29T01:49:32 | 131,941,068 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 932 | cpp | compoundwords.cpp | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef complex<ld> pt;
typedef vector<pt> pol;
const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 1e9+7;
const ld EPS = 1... |
beffa868d33da3bf292cfda5e0670a3b06ab720e | 8f153aa41b623aafb5054e48d3749112979e10a3 | /PP_Quset.h | dfe19b2ac763723414ae3ed78b0e0982bea9855a | [] | no_license | ktw92/Unreal4_RPG_portfolio | f17391dffec37f9d5317ac3cbcb566be15647053 | a3d3309386970ff25fb0a67dd16c3fadae310c47 | refs/heads/main | 2023-05-30T21:34:35.159752 | 2021-06-26T07:16:29 | 2021-06-26T07:16:29 | 380,158,641 | 0 | 1 | null | null | null | null | UHC | C++ | false | false | 1,350 | h | PP_Quset.h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "PP_GameInstance.h"
#include "UObject/NoExportTypes.h"
#include "PP_Quset.generated.h"
/**
*
*/
UCLASS()
class ELFPALADINTEMPLATE_API UPP_Quset : public UObject
{
GENERATED_BODY()
public:
UPP_Q... |
9798b5f46232225a4d2a689a1f7ef9c3fdbe706e | a73540d3fd6d41db453a1e9fba40b276722b4476 | /src/Network/executors/NewEdgeExecutor.cpp | 6f659351db76bf7907a00d7944a9fd161f6321a4 | [] | no_license | kapecp/3dsoftviz | 2293ab9506e884f175a5f0e868049b87c568dcb9 | 8d425301eb361d64ad6c67dac91f24412118828f | refs/heads/master | 2020-12-25T16:53:34.605091 | 2016-10-02T17:55:21 | 2016-10-02T17:55:21 | 970,455 | 4 | 9 | null | 2018-02-10T10:44:15 | 2010-10-07T20:23:20 | C++ | UTF-8 | C++ | false | false | 1,965 | cpp | NewEdgeExecutor.cpp | #include "Network/executors/NewEdgeExecutor.h"
#include "Manager/Manager.h"
#include "Network/Server.h"
#include "Network/Client.h"
#include "Data/GraphLayout.h"
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wold-style-cast"
#if defined(__linux) || defined(__linux__) || defined(linux)
#pragma GCC diagn... |
d13e0626cb8241f148ee8d498e96534aa9e2d089 | dd80a584130ef1a0333429ba76c1cee0eb40df73 | /external/chromium/net/base/asn1_util.h | 507e79c4b11481fc5dd2f4ee06987a7e0e591a62 | [
"MIT",
"BSD-3-Clause"
] | permissive | karunmatharu/Android-4.4-Pay-by-Data | 466f4e169ede13c5835424c78e8c30ce58f885c1 | fcb778e92d4aad525ef7a995660580f948d40bc9 | refs/heads/master | 2021-03-24T13:33:01.721868 | 2017-02-18T17:48:49 | 2017-02-18T17:48:49 | 81,847,777 | 0 | 2 | MIT | 2020-03-09T00:02:12 | 2017-02-13T16:47:00 | null | UTF-8 | C++ | false | false | 1,926 | h | asn1_util.h | // Copyright (c) 2011 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.
#ifndef NET_BASE_ASN1_UTIL_H_
#define NET_BASE_ASN1_UTIL_H_
#pragma once
#include "base/string_piece.h"
namespace net {
namespace asn1 {
// These ... |
386e833677db309a30644945c026fd286b1da143 | dede21f6d7dfcd207c70dd0ed4d88f39d17be112 | /MadMetal/Simulation/SinglePlayerMenu.h | 856bac9d6e036c0f12e490542d8f0fc68cb08d3f | [] | no_license | DannyPhantom/Mad-Metal | 8d073873ac610795add7ac9d6882737b483b372a | 6cec2cf5680ca902045679e485e4660f06489578 | refs/heads/master | 2021-01-18T22:05:55.656101 | 2016-04-14T05:18:40 | 2016-04-14T05:18:40 | 84,369,895 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 804 | h | SinglePlayerMenu.h | #pragma once
#include "Scene Manager\Scene.h"
#include "Objects\Text3D.h"
#include "Objects\TexturedObject2D.h"
class SinglePlayerMenu : public Scene
{
private:
GamePad * m_gamePad;
Object3D *car1,
*car2,
*car3,
*numberOfAIsButton,
*selectedObject,
*selectedCar,
*background;
Text3D *numberOfAIsString;
... |
f065fc63ac142253b6d2508b45408ce95d3cdc2a | 86c01e3f3e322aa3ca17187a17aaaa269b4a70e6 | /src/engine/assimp/Model.cpp | a4df32cdeebfea3fbe8bfe37f3e5c473378f0fce | [] | no_license | jaccen/3d-engine | e06686eaadaf22d72524ac9b972bea46730f6ab5 | 4b6185ab4c09ec5dea30320e2a8d30b5c7a63b9a | refs/heads/master | 2022-11-15T14:52:59.982767 | 2020-06-24T10:19:45 | 2020-06-24T10:19:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,951 | cpp | Model.cpp | #include "Model.hpp"
#include <iostream>
#include <vector>
#include <fmt/format.h>
#include "Logger.hpp"
namespace assimp {
Model::Model(std::string const &path)
{
Assimp::Importer import;
const aiScene *scene = import.ReadFile(path.c_str(), aiProcess_Triangulate | aiProcess_FlipUVs | aiProcess_CalcTangentSpace);
... |
a27359ccd89091a1820e54f7fae9c479702ae952 | 42a85a59e018e11cf364db728467240b62299061 | /code/1080_Graduate Admission.cpp | 202bb9d5ebc40bdba09fcdfed96bfed5a294cf52 | [
"MIT"
] | permissive | BitterPotato/PATInC | 87e798ad8ce00c96c5488fa65a73f02babfb5250 | c4bd2e0cbd98b82b5393f3b95a3c7f68b40cab49 | refs/heads/master | 2020-05-27T15:29:49.246669 | 2017-04-05T13:22:40 | 2017-04-05T13:22:40 | 82,563,216 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,049 | cpp | 1080_Graduate Admission.cpp | //--1080--
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#define debug 0
using namespace std;
struct stu {
int index;
int ge;
int gi;
};
bool mycmp(stu s1, stu s2) {
int g1 = (s1.ge + s1.gi) / 2;
int g2 = (s2.ge + s2.gi) / 2;
if(g1 == g2) {
return s1.g... |
fef907b02f10f55df6a208ebe22e2f149d6df90b | 996dcc2c925b2c272c17789023e15e16107f3fb7 | /src/Qumulus/Gui/Diagram/AssociationEdge.h | 7c2ef2cd19a1542dd7c0be6275fdacb8df40c361 | [
"Apache-2.0"
] | permissive | SynthiNet/Qumulus | 5bfd50398ef178a4ceebfbd3e545a9540dec249c | 5ed2264d7cb725075539037ea902531b6a2b5530 | refs/heads/master | 2016-09-11T01:05:15.103813 | 2014-01-07T20:00:18 | 2014-01-07T20:00:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,267 | h | AssociationEdge.h | /*
* Qumulus UML editor
* Copyright (c) 2014 Frank Erens <frank@synthi.net>
* Copyright (c) 2014 Randy Thiemann <uselinuxnow@gmail.com>
*
* 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
... |
aeca7cfea02a47d6c91d66113f72854833e394bd | 58cd29467c422b32b53c7d83a771d6600fc98a4d | /src/Renderers/Webgl/WebGLShadowMap.h | 9ef0b78f2af35ef60a4419e95a1577728016b40d | [] | no_license | yudhcq/ThreeWasm | c2f0c121bb2d9558a022e4d3fc64f16500ab18ed | 6a8cc52ef9e4b3a1b4e49e84c2d934a69bf87e8b | refs/heads/master | 2023-01-29T08:53:26.430109 | 2020-11-11T05:39:02 | 2020-11-11T05:39:02 | 286,633,241 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 71 | h | WebGLShadowMap.h | #pragma once
namespace Three::Renderers
{
class WebGLShadowMap{
};
}
|
74237ddabd70cf53efb7cd6d1bc1a7abf33c2d0e | 2095af306a0eb2e10c78aa6047f85a7dcdc7c47d | /include/Util/UIDropSource.h | fd0b38219b6c0d8fd521314a2143a7bcad24ea08 | [
"MIT",
"LicenseRef-scancode-public-domain",
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-scintilla"
] | permissive | grimtraveller/LongUI | ff4e5f565a44c266a8aede6925b75de711e5ea41 | d4fed468217312cb77e99b7f1ead45bdab9223b6 | refs/heads/master | 2020-12-11T03:25:13.373234 | 2016-03-12T12:13:36 | 2016-03-12T12:13:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,245 | h | UIDropSource.h | #pragma once
/**
* Copyright (c) 2014-2016 dustpg mailto:dustpg@gmail.com
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights t... |
fb04e354ed6ba1d49c6afdee9667f269db2134fb | 0538fba6eecfcd5f97b29ac528976b0dfaa96213 | /a1138.cpp | b8d758a1f8d79c87096579ec55429a947d5f4329 | [] | no_license | Trojanking123/pat | 5850e22faf7a5b0a7172802cdac544a2bc109534 | 3566f10623f4077f8988f408c2203d849b642fd2 | refs/heads/master | 2020-12-08T13:54:45.079265 | 2020-04-14T17:30:59 | 2020-04-14T17:30:59 | 232,999,331 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 696 | cpp | a1138.cpp | #include<iostream>
using namespace std;
const int kMAX = 50005;
int in[kMAX];
int pre[kMAX];
int n;
void getFirstPost(int il, int ir, int pl, int pr){
if(pl == pr){
printf("%d\n", pre[pl]);
return;
}
int x = pre[pl];
int i;
for(i = il; i <= ir; i++){
if(in[i] == x) break;
... |
f5a01c3a6eb70c047faa2318a172c764334edbf2 | 347f113aa835e6a14bcb894d8c9c477f7e02f375 | /C++ Object Oriented Programming/a2/q4/a2q4.cc | 7dd9e46fbfcd87270d834d45dd5c5f70d732ff67 | [] | no_license | BurrowedCactus/some-homework-during-school | b9e213c989ba04815beae380c3ce207d6801fe7f | cf5c445e5afdba490109b3eb7b20fbdc70284ae0 | refs/heads/master | 2021-04-02T21:35:11.445965 | 2020-03-18T19:40:36 | 2020-03-18T19:40:36 | 248,325,070 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,742 | cc | a2q4.cc | // this is refines the code in term 1175.
// last edited on date October 05th, 2017.
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
using namespace std;
struct Options{
bool all;
bool chars;
bool words;
bool lines;
int num_files;
string* files;
Options(): all(true), chars(false), ... |
b1ef1ac16b38a6ddf05259dd0b53bbac1ddc8950 | c620692d8b5e49e60ad77c7422178fe10780e730 | /ICS_VSBIO/VSBIO/NetworkInfo.cpp | 5257102ec88f746230b2b994b7e06d9d385c6b08 | [] | no_license | intrepidcs/ICS_VSBIO | 04ff797555c4ed6e186c3f9cdd933deb5183a1bb | 858559b0323e004ff80de577c79c5c3ca335eb26 | refs/heads/master | 2023-03-16T01:10:28.040219 | 2023-03-06T20:11:34 | 2023-03-06T20:11:34 | 124,588,210 | 6 | 9 | null | 2021-06-16T18:56:16 | 2018-03-09T20:09:25 | C | UTF-8 | C++ | false | false | 8,638 | cpp | NetworkInfo.cpp | #include <string.h>
#include <stdlib.h>
#include "VSBIODLL.h"
#include "VSBIO.h"
#include "OFile.h"
#include "MessageTimeDecoderVSB.h"
#include "VSBDatabase.h"
#include "NetworkLookups.h"
#include "KompexSQLiteException.h"
using namespace Kompex;
#define CLEAR_MESSAGE_STATS "UPDATE Network SET FirstTime = 0, LastTim... |
2a5fb9ce1204a0f9554a277a1e31b4998a20e5c4 | 63c490b2dd2b9c3bf3f6f2cda60392ee16edfe9a | /UVa/acm_11875.cc | dd154f1363e7c0bf151ab9b66e43427db66e694e | [] | no_license | Meng-Gen/UVa | d84811bfe607bbd6f329683e7f8c3ca9c67eb6f6 | 06f7c7bda732e04c11c6eb904164c23b2a546c21 | refs/heads/master | 2020-03-31T09:04:26.933464 | 2018-08-06T15:37:15 | 2018-08-06T15:37:15 | 9,917,565 | 1 | 0 | null | 2018-08-06T15:37:16 | 2013-05-07T17:32:26 | C++ | UTF-8 | C++ | false | false | 659 | cc | acm_11875.cc | #include <iostream>
#include <stdio.h>
int ages[12] = {};
// Median.
int main(int argc, char* argv[])
{
int num_testcase;
std::cin >> num_testcase;
for (int case_id = 1; case_id <= num_testcase; case_id++)
{
int num_member;
std::cin >> num_member;
// 0-based.
... |
7179d65e06f08d488a17193d2a66bfff416759c4 | 8dc4ce1e27a62e1ede196c6fb58d6f56efd597a9 | /src/objective_function_formulae.cpp | c0b510108f1e48445fe6cfb0644f1ed4aecf2413 | [
"Apache-2.0",
"MIT"
] | permissive | christos-tsotskas/MOTS2 | 257a6e1bc37f84ef42bee01ed5ee639f115df850 | c504528fd787616a48c5df8288a192103575c3f7 | refs/heads/master | 2021-01-10T13:41:51.329789 | 2019-09-03T10:21:02 | 2019-09-03T10:21:02 | 45,477,955 | 0 | 0 | Apache-2.0 | 2019-09-03T10:21:03 | 2015-11-03T16:03:04 | C++ | UTF-8 | C++ | false | false | 9,157 | cpp | objective_function_formulae.cpp | /*
* objective_function_formulae.cpp
*
* Created on: Jan 20, 2014
* Author: ctsotskas
*/
#include <cassert>
#include <cstdlib>
#include <cmath>
#include "objective_function_formulae.h"
#define pi 3.14159
extern "C" {
int ffd_ (const double&, const int*, const double&, const double&, const int&, const int&... |
a756d7437260d5fee59400d740e5b4ef074d1fa3 | 97529d623e1df1c716e1570b98d0f090e736c238 | /qtface/face.cpp | cbb1bb80c916d077ccff482b17b9f895f57b592a | [] | no_license | leilei-help/code | 2f83e9a01b3ccb84625b1c8b3e43a07939785dd1 | 3244703afb4eb99ef6e2d77edbd346b3405f64f7 | refs/heads/master | 2022-01-27T00:47:16.339792 | 2018-04-20T12:25:06 | 2018-04-20T12:25:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 120 | cpp | face.cpp | #include "face.h"
#include "mainwindow.h"
Face::Face()
{
// seeta::FaceDetection detector((datapath+"").c_str());
}
|
bc08407d9874cadf4c172f6396a8cba76701326c | f5dc059a4311bc542af480aa8e8784965d78c6e7 | /tables/Tables/TaQLResult.h | cd798ea0e21a1bf1f5897d27bc46700269f2dc49 | [] | no_license | astro-informatics/casacore-1.7.0_patched | ec166dc4a13a34ed433dd799393e407d077a8599 | 8a7cbf4aa79937fba132cf36fea98f448cc230ea | refs/heads/master | 2021-01-17T05:26:35.733411 | 2015-03-24T11:08:55 | 2015-03-24T11:08:55 | 32,793,738 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,885 | h | TaQLResult.h | //# TaQLResult.h: Class to hold the result of a TaQL command
//# Copyright (C) 2004
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Fo... |
6507fd68ff82ce3e9047dcd8ee41748e124c3585 | a1a57977131ea917a3f3094dae4a3d18846103c0 | /libsrc/pylith/faults/FaultCohesiveKin.cc | 33a4858b22f93b222af94af8a75fc2bd2b855a6f | [
"MIT"
] | permissive | rwalkerlewis/pylith | cef02d5543e99a3e778a1c530967e6b5f1d5dcba | 8d0170324d3fcdc5e6c4281759c680faa5dd8d38 | refs/heads/master | 2023-08-24T18:27:30.877550 | 2020-08-05T16:37:28 | 2020-08-05T16:37:28 | 154,047,591 | 0 | 0 | MIT | 2018-10-21T20:05:59 | 2018-10-21T20:05:59 | null | UTF-8 | C++ | false | false | 8,979 | cc | FaultCohesiveKin.cc | // -*- C++ -*-
//
// ----------------------------------------------------------------------
//
// Brad T. Aagaard, U.S. Geological Survey
// Charles A. Williams, GNS Science
// Matthew G. Knepley, University of Chicago
//
// This code was developed as part of the Computational Infrastructure
// for Geodynamics (http://... |
9726410c51861673d6579221576dc1e7a6924e12 | 52e45c26c110c42de79383e8034fd280fd82a02f | /libsrc/spatialdata/geocoords/Converter.cc | dc6524fc9c920640413aa4935515cda970366605 | [
"MIT"
] | permissive | geodynamics/spatialdata | 1ae1d2583aae356e9e68cd434c1f17820b49d127 | 2da6aad61c136f0e15f066aaea5fd31851de112f | refs/heads/main | 2023-08-15T07:22:17.676228 | 2023-07-28T03:32:07 | 2023-07-28T03:32:07 | 12,651,854 | 6 | 20 | MIT | 2023-07-28T03:32:09 | 2013-09-06T18:52:14 | C++ | UTF-8 | C++ | false | false | 7,068 | cc | Converter.cc | // -*- C++ -*-
//
// ----------------------------------------------------------------------
//
// Brad T. Aagaard, U.S. Geological Survey
//
// This code was developed as part of the Computational Infrastructure
// for Geodynamics (http://geodynamics.org).
//
// Copyright (c) 2010-2023 University of California, Davis
/... |
338d71a07bece3f21ed315b34e32366503a467dd | a7d3ad41d51a95ab3ee1506789180f40a72ac8e9 | /include/pump/net/socket.h | bc52ad53d421f3bb2e9b26c84eac595864083d42 | [
"Apache-2.0"
] | permissive | jimi36/pump | 0a08e9acc13e5cbfa23d10b57ea9007edef5a594 | dd548706ea08e5c6562a2a8539627861505eed1b | refs/heads/master | 2023-05-11T11:50:34.085135 | 2023-05-09T11:51:47 | 2023-05-09T11:51:47 | 229,525,028 | 6 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 8,484 | h | socket.h | /*
* Copyright (C) 2015-2018 ZhengHaiTao <ming8ren@163.com>
*
* 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... |
db55c478fe43ac5b2d74959176db175512d43e0f | e4ce6eec74398913e5ce8276061bdc3788ad3f55 | /engine/enginecode/include/independent/systems/log.h | 3568dc403855b8131cf3e364eacad34a7546949c | [] | no_license | MartinSekeras/Game-Engine-Development | 774e2d7faf00e19f1d90239862b14d63017915f1 | 0cb5c157089957c3a696c459b1896712ea21fe07 | refs/heads/main | 2023-05-15T05:41:10.359966 | 2021-06-13T13:39:10 | 2021-06-13T13:39:10 | 376,551,897 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,828 | h | log.h | /** \file log.h */
#pragma once
#include "system.h"
#include <spdlog/spdlog.h>
namespace Engine
{
/* \class Log
* \brief Class for the creation of a logging system, to be used throughout Engine.
*/
class Log : public System
{
public:
virtual void start(SystemSignal init = SystemSignal::None, ...) override; ... |
d7066a956ca5a3bec51d14744ef26ee57c5a46aa | 150a25bd19e960440ca65390a50fcf450ac775a9 | /codes2/exe/RandomForest8/RandomForest8/tree.h | cbffb2a068139c4a1d2834013b1bf4ccf87e50fe | [] | no_license | YK-criteria/OSCC | f3823b10810b36e7b5619c5e25df3dd1da7f408f | c627e2041ef02c0b80350d9a7c2ca0510d4c4419 | refs/heads/main | 2023-02-11T02:39:26.302527 | 2021-01-04T18:03:47 | 2021-01-04T18:03:47 | 318,168,036 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 341 | h | tree.h | #pragma once
#include <iostream>
#include <string>
using namespace std ;
#include "datapoint.h"
#include "subset.h"
#include "node.h"
class Tree
{
public :
Config config ;
Node root ;
Tree( ) ;
Tree( Config config ) ;
map< string , int > Train( Subset subset ) ;
string Test( DataPoint... |
73f9cf8747b544c4e35fcc1d015794249e518092 | b607256cc66737dbcad4e02e31a8344e3443368a | /KFC_KTL/tls_storage.cpp | 7d38dab426ecb60f6d609bb1e5e43401dd79121d | [] | no_license | Harkonnen604/KFC | c62b9325a1ddfdd23f81fe5a1a2a4a320a07e4dc | ff03c9122edea10438963488feab9405ee556e28 | refs/heads/master | 2021-06-27T05:30:44.410246 | 2020-09-28T19:24:31 | 2020-09-28T19:24:31 | 156,101,719 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,168 | cpp | tls_storage.cpp | #include "kfc_ktl_pch.h"
#include "tls_storage.h"
#include "ktl_tls_item.h"
T_TLS_Storage g_TLS_Storage;
// ------------
// TLS storage
// ------------
T_TLS_Storage::T_TLS_Storage()
{
m_szTLSIndex = TlsAlloc();
assert(m_szTLSIndex != TLS_OUT_OF_INDEXES);
T_KTL_TLS_Item::ReserveItemType();
}
T_TLS_Sto... |
4cfee3a45b20342edff0bf8c6762c9192b522905 | 42710d6f618ac0c5e79c7a10a43f9a63fa75103d | /task_5_11_12.cpp | f8347c2b16b2557e59230fbe96767b387b2aa6bc | [] | no_license | AlterFritz88/interactive_learn_cpp | 605009d8e62ea13aab3a425a6af20bb0758fd7ce | 15ab8dc776d377f21bdcee6de5287a8e1cb2a3f7 | refs/heads/master | 2020-06-30T03:00:36.415208 | 2019-12-23T05:19:31 | 2019-12-23T05:19:31 | 200,700,680 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 407 | cpp | task_5_11_12.cpp | #include <bits/stdc++.h>
using namespace std;
struct st {int k; int x;};
bool cmp(st a1, st a2){
if (a1.k > a2.k) return false;
return true;
}
int main(){
int n; cin >> n;
vector<st> a(n);
for (int i = 0; i < n; i++) cin >> a[i].x;
for (int i = 0; i < n; i++) cin >> a[i].k;
sort(a.begin(),... |
a2b9e168057c280174d01495156c9c08909377d1 | 10b0d8b163b772e485b64953ff1abeae486d7154 | /src/mem/gems_common/PrioHeap.hh | d6183cf4029a6d96a83e711d63abf607fbe599df | [
"BSD-3-Clause"
] | permissive | hassahma/m5 | fd38cf6e1192716ad97e8c4a45268e3378cf2912 | b52324b1b5fda06b11a04f87734c25391d99c8b0 | refs/heads/master | 2021-01-16T19:41:53.382649 | 2010-12-14T20:49:59 | 2010-12-14T20:49:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,333 | hh | PrioHeap.hh | /*
* Copyright (c) 1999-2005 Mark D. Hill and David A. Wood
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source code must retain the above copyright
* notice, this l... |
c57784f8e475684846ed3549ce0957de58b7eb50 | c62fcecea01cf097807b6f9fc54a951c51c3dfbc | /include/thousandeyes/futures/detail/InvokerWithSingleThread.h | 3790598d61135b3b8dafc271049aa2a19b9dc3d2 | [
"MIT"
] | permissive | ywjb/thousandeyes-futures | 93f8651fa28d54753f50816c3aa106d3e78cc500 | e299360134fb79694742a5105d2edd8a35dd0721 | refs/heads/master | 2022-11-03T10:47:14.121420 | 2020-06-17T13:14:58 | 2020-06-17T13:14:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,971 | h | InvokerWithSingleThread.h | /*
* Copyright 2019 ThousandEyes, Inc.
*
* Use of this source code is governed by an MIT-style
* license that can be found in the LICENSE file or at
* https://opensource.org/licenses/MIT.
*
* @author Giannis Georgalis, https://github.com/ggeorgalis
*/
#pragma once
#include <condition_variable>
#include <funct... |
e8188b0e90b2e438f2108f378bb568059e56c19c | b21bcc5c2203ce4a7d5ceb9bcf0d72cf79db6abc | /leetcode/easy/palindrome_num/src/main.cpp | 9c0a7bbbc3aa6235bd831e04689fa6e1f3eea862 | [] | no_license | zhaoyunfuture/study | 81ad69a4abfedb3d14efa1080a2bcf091ab2e1a8 | ebed9809c84c31ff67b988b3bb3c3289b2b818d7 | refs/heads/master | 2022-01-18T21:33:06.613463 | 2022-01-09T13:19:58 | 2022-01-09T13:19:58 | 47,873,321 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 943 | cpp | main.cpp | #include <string.h>
#include <string>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
class Solution {
public:
bool isPalindrome(int x) {
int m;
int len;
std::vector<int> v;
std::vector<int>::iterator it;
std::vector<int>::reverse_iterator rit;... |
1a8a938272cce95f433c922d6c4def43cddba799 | d7b6a2cf0143a1108edc7071fbe138f1f8a516bc | /1216 - Getline One.cpp | f929b2dee976a38c9b9012fb468cbf15fa1b9385 | [] | no_license | AlexandreBarrelin/URI-Online-Judge | 0e62f658bc256d079884c9b793ad5d99ab46b7ea | 0eb60e2fd57e29a9fa40cceb22f9183c2122891c | refs/heads/master | 2020-07-09T23:01:59.143762 | 2019-08-24T03:39:57 | 2019-08-24T03:39:57 | 204,103,905 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 266 | cpp | 1216 - Getline One.cpp | #include<bits/stdc++.h>
int main()
{
char nome[1000];
int dist,x=0;
double tt=0;
while (scanf(" %[^\n]",&nome)!= EOF){
scanf("%*c%lld%*c",&dist);
tt += dist;
x++;
}
printf("%.1lf\n", tt/(float)x);
return 0;
}
|
1f83af23eb4fcddaf8530bc3700386fe54539484 | b1cca159764e0cedd802239af2fc95543c7e761c | /ext/libgecode3/vendor/gecode-3.7.3/gecode/set/var/set.hpp | 8fe085ad78441398726cc7f20f1ad375b77c7b01 | [
"MIT",
"Apache-2.0"
] | permissive | chef/dep-selector-libgecode | b6b878a1ed4a6c9c6045297e2bfec534cf1a1e8e | 76d7245d981c8742dc539be18ec63ad3e9f4a16a | refs/heads/main | 2023-09-02T19:15:43.797125 | 2021-08-24T17:02:02 | 2021-08-24T17:02:02 | 18,507,156 | 8 | 18 | Apache-2.0 | 2023-08-22T21:15:31 | 2014-04-07T05:23:13 | Ruby | UTF-8 | C++ | false | false | 5,824 | hpp | set.hpp | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
* Christian Schulte <schulte@gecode.org>
* Gabor Szokoli <szokoli@gecode.org>
*
* Copyright:
* Guido Tack, 2004
* Christian Schulte, 2004
* Gabor Szokoli, 2004
*
* La... |
619faeeffefa6eb074e7096584472f6eeb90c1d9 | 2aa59299a096499e23a073219f7b7286892c8156 | /cpp/count_bits.cpp | 211797e859fcbaf63f91e651450483696a467acf | [] | no_license | HariprasadNG/Myevent | 573a52306c7ef6a3f82bc9544edc9b57251dc518 | 7e903e93a9a1a0038a9c4d4a09cba65c794b6128 | refs/heads/master | 2021-01-17T08:00:55.664284 | 2018-11-11T16:10:00 | 2018-11-11T16:37:44 | 39,049,319 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 735 | cpp | count_bits.cpp | #include <iostream>
#include <vector>
using namespace std;
int diffbits (int a, int b) {
int x = a ^ b;
int i = 1;
int count = 0;
for (int j = 0; j < 4; j++) {
if (x&i)count ++;
i = i << 1;
}
return count;
}
int solve (vector<int> &v) {
int count = 0;
for (int i = 0; i ... |
b33a3b488320968a0d68ce7db49d15cdbc476870 | babea1ba2b113cfa596d6ed2be20773d83f2357b | /Hard/C++/Trapping_Rain_Water(42).cpp | e6042e31fc002134e390468fde87735d399bd84c | [
"MIT"
] | permissive | assaultpunisher/Leet_Code | 0a7af54c9683db334b274c4709cfdd018f8d12cc | 72f53c7368cd4869005544a584da38e7b665c3f4 | refs/heads/main | 2023-05-05T18:45:20.871658 | 2021-05-27T12:36:29 | 2021-05-27T12:36:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,640 | cpp | Trapping_Rain_Water(42).cpp | class Solution {
public:
int trap(vector<int>& h) {
int n=h.size();
if(n==0)
return 0;
vector<int> ml(n); //vector to store largest on left side
vector<int> mr(n); //vector to store largest on left side
ml[0]=h[0];
mr[n-1]=h[n-1];
... |
2b41ef27a7215789b0885bb6356eb7bd2eb89ad6 | d6b4bdf418ae6ab89b721a79f198de812311c783 | /trtc/include/tencentcloud/trtc/v20190722/model/McuLayout.h | 99ae2bd46fab1be1297f4d82ff00151ad3054882 | [
"Apache-2.0"
] | permissive | TencentCloud/tencentcloud-sdk-cpp-intl-en | d0781d461e84eb81775c2145bacae13084561c15 | d403a6b1cf3456322bbdfb462b63e77b1e71f3dc | refs/heads/master | 2023-08-21T12:29:54.125071 | 2023-08-21T01:12:39 | 2023-08-21T01:12:39 | 277,769,407 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 20,436 | h | McuLayout.h | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
... |
0fb120ded94d668114bb34be66c562432b232b1f | 9d33906707177b5392274ca16728f13cc9177ef2 | /11_strings/isomorphic_strings_205.cpp | 955f4cf3bf845f2b530292188781c82dbb5d748d | [] | no_license | XingXingXudong/LeetCodePractice | 12537d7a6a1808c0851645df3691eac3cb750b0d | b9a219300b152d2e26bf4a63ffb5b5e7526099f7 | refs/heads/main | 2023-03-12T11:43:51.982880 | 2021-03-01T15:42:51 | 2021-03-01T15:42:51 | 335,812,124 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,024 | cpp | isomorphic_strings_205.cpp | // https://leetcode.com/problems/isomorphic-strings/
#include <gtest/gtest.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
bool isomorphic(const std::string& s, const std::string& t) {
if (s.length() != t.length()) {
return false;
}
auto map = std::unordere... |
a01b9a249c724eedd845dd0d81bda53621e3e312 | 83f86db094db435e102f306ccf74ae1699c5b5f8 | /at_coder/ABC/B/192_B.cpp | ba2da846c0b7bbe3bb310124d58643b1e9c65071 | [] | no_license | NUKEDO/practice_coding | 399199e137eb1223685fcb6b48aad0aa52a3f9f6 | f1bdaf8aa1333c508fd6aaecb167ef0b7b46d612 | refs/heads/main | 2023-08-23T12:25:38.550757 | 2021-09-23T09:03:24 | 2021-09-23T09:03:24 | 335,144,081 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 445 | cpp | 192_B.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
string str, ans = "Yes";
cin >> str;
for( int i = 0; i < str.size(); i++) {
if(i % 2 == 0) { //１文字目 小文字の時
if(str.at(i) >= 'A' && str.at(i) <= 'Z') {
ans = "No";
}
} else {
if(str.at(i) >= 'a' && str.at(i) <= 'z') {
... |
e313e66c3205bcbe1e8a38a9a641c6f09a9047a7 | 7d41b01392ff7236ab3fe0ae87f33bf29bc8761b | /Library/linkedlist/linkedlist.cpp | b10d6d29b22acc39735cd23a2b9416377d066e04 | [] | no_license | anconaesselmann/Split | 5b1d76d701ec0f4df5944fd50e3ab4ca7703678a | 8e37cd0d492c9bd88109b49442e35760615ca4f0 | refs/heads/master | 2021-01-20T22:09:37.943319 | 2016-06-30T00:59:49 | 2016-06-30T00:59:49 | 62,267,839 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,427 | cpp | linkedlist.cpp | // LinkedList implementation file
// Created by Axel Esselmann on Oct 5th 2011
// Last edited: Oct 14th 2011
#include <iostream>
#include "linkedlist.h"
namespace LinkedListAnconaEsselmann {
//\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
/// NODE ////////////////////////////////////... |
ca6a3c40aeff9aa55036fe509f3457bc35ac08c0 | 2af91f07b907ba1020e7e05a973e81750d345cc6 | /D03/ex01/ScavTrap.hpp | e0020be9642611bda2a8963db873e41d47efb5de | [] | no_license | NormanSchilling/PiscineCplusplus | aa612d7619d98f224212d31850e8217ec01d4f92 | 77087bc87dec57c2c70ee4d7a04f978b13c714c9 | refs/heads/master | 2021-01-17T14:35:17.803534 | 2015-04-18T09:52:16 | 2015-04-18T09:52:16 | 30,865,699 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,257 | hpp | ScavTrap.hpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ScavTrap.hpp :+: :+: :+: ... |
feb1d8b9d84db191df14d9c1d6bd894ac498fd55 | 4baa93535098e7be9fed24fded058f8b550bc685 | /47-MacrosInCpp/47main4.cpp | 5747e750081dc617b1605d6e25151c10aca433a4 | [] | no_license | river7816/TheChernoCppTutorial_Code | b9e75c0401dc6b9efa155333c1800b6e201e8469 | c15533e60a4884414bcd83f669ff7242ced66525 | refs/heads/master | 2023-05-12T09:21:43.373042 | 2020-03-29T15:14:15 | 2020-03-29T15:14:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 327 | cpp | 47main4.cpp | /*
MACROS
A further example of using MACROS with "\" on multiple lines
this because MACROS are usually on one line of code
IMPORTANT: be sure you don't have a space after \ otherwise the pre-processor
recognise the space as next line and discard actually the next line!
*/
#define MAIN int main(){ \
return 0; \
}
... |
5a7905d006192103e02e565dd9c866f60ddad520 | 63919da70623495d3f3677b948f8f800a9d25c26 | /Tigarmageddon 2D/SurvivalMode.h | adb00ae634ead666e1787a3b8eaa572642986aae | [] | no_license | DestructiveReasoning/Tigarmageddon-2D | 7b2419cda29c491a2ecc24417e9a8a934a68a29a | 29789e96c97b97fd2c95b15060f0953935f89a88 | refs/heads/master | 2021-01-21T21:54:19.217663 | 2016-04-01T03:53:35 | 2016-04-01T03:53:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 676 | h | SurvivalMode.h | #pragma once
#include "GameMode.h"
#include "Main.h"
#include "Screen.h"
class SurvivalMode : public GameMode
{
public:
SurvivalMode(int width, int height, int levelWidth, int levelHeight, float* xOffset, float* yOffset, Player* player, Screen* screen);
~SurvivalMode(void);
virtual void update();
std::vector<st... |
e17ef2996a26c6d749a780033386bb11fde96bc6 | 17310661cbaea41d68baea32c2a977f80f46751f | /Source/CollisionWar/SRC/Base/Widget/TemplateMenuTitle.h | 2b54d3c8ca81bcd28fd5715c81ffb87f46d66ed8 | [] | no_license | VectorL1990/CollisionWarBackup | 5540807c23193215d0a50e4826978d5f2430c243 | 8e263ab498f9097c57f6a1ef78719607b66cfc9f | refs/heads/main | 2023-04-10T15:17:05.678311 | 2021-04-23T08:16:05 | 2021-04-23T08:16:05 | 357,766,090 | 0 | 0 | null | 2021-04-23T08:16:05 | 2021-04-14T03:51:57 | C++ | UTF-8 | C++ | false | false | 839 | h | TemplateMenuTitle.h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "CoreMinimal.h"
#include "Blueprint/UserWidget.h"
#include "TextBlock.h"
#include "TemplateMenuTitle.generated.h"
/**
*
*/
UCLASS()
class COLLISIONWAR_API UTemplateMenuTitle : public UUserWidget
{
GENERATED_BODY(... |
5fcf0418e94fdd094a8519ea109bb2858c15488e | a103e021e54d9ce429235d3cdef55c2c06fd0249 | /src/SubWindow.h | fb546cea5efef546c77d9cba181f298ef47a8569 | [] | no_license | jonatanfm/tfg | 1cab94513d468a3fbe3d9ee98b06b209732047b5 | aff322e691093e99acd3db846e4015656322d8dd | refs/heads/master | 2021-01-15T16:56:44.839159 | 2014-06-18T19:15:50 | 2014-06-18T19:15:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,816 | h | SubWindow.h | #ifndef SUBWINDOW_H
#define SUBWINDOW_H
#pragma once
#include <QMdiSubWindow>
#include "DataStream.h"
class MainWindow;
#ifdef _WIN32
extern QPixmap qt_pixmapFromWinHICON(HICON icon);
#endif
// SubWindow of the MainWindow's Modal Document Interface (MDI) area.
class SubWindow : public QMdiSubWindow
{
Q_OB... |
9460135dc514006cc156e3f5c56681c383868d14 | 4724afa8472b0d961d40cc3be71f5abd1373143f | /spoj/chesscm.cpp | 6fdfa5811f53a61270b5c9196172a96627d1231e | [] | no_license | banarun/my_competitive_codes | 2f88334c563ad050c21c68ae449134a28fb2ba95 | c5a5af3cf74341d02a328974e8e316d300a221b2 | refs/heads/master | 2021-01-18T22:46:47.419449 | 2016-06-25T14:14:15 | 2016-06-25T14:14:15 | 33,266,178 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,523 | cpp | chesscm.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <algorithm>
#include <complex>
#in... |
f4d1c2bcfe26772adcd56397041082f39f6302b7 | 0e9475c452dd8caaa662601ef0bcd2f9d7a82821 | /base/acgAtomic.h | 7e3bc8e0c10f16622cfb9f3f851bd7f7e786aa76 | [] | no_license | shift12392/acg | e12d71dfddbc9ce1b3f225a98fece3c12c38a2f8 | 38411fab1744e35d380fca3c7d73e2ad6d78a68e | refs/heads/master | 2021-01-12T01:32:09.415028 | 2020-01-21T09:22:20 | 2020-01-21T09:22:20 | 78,265,292 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,090 | h | acgAtomic.h | #pragma once
#include "acgNoCopyable.h"
namespace acg
{
namespace base
{
template<typename T>
class CACGAtomicT : public CACGNoCopyable
{
public:
T Get()
{
return InterlockedCompareExchange(&m_nNum, 0, 0);
}
T GetAndAdd(T x)
{
return InterlockedExchangeAdd(&m_nNum, x); //注... |
e3852ebaab1a816c7999c0e7601f3c9daa5d6610 | 35d35de7b2bfe8db22e69f7241b82966208b7f5b | /20/1059.cpp | 716b8c5c2e0f48318f75ad8facadbbf740712508 | [] | no_license | leisir966/tjuOJ | 99d2bf2643d853bb13ff29f78d72e5ad8ee60155 | 059e35a8eb7add54c6c3bcd84908c0218b6a3107 | refs/heads/master | 2020-12-04T03:22:23.550848 | 2020-02-07T14:13:59 | 2020-02-07T14:13:59 | 230,030,814 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 904 | cpp | 1059.cpp | #include <iostream>
#include <set>
#include <cmath>
using namespace std;
int ran[10000]={0};
bool isprime(int a){
if(a<=1)return false;
for(int i=2;i<=sqrt(a);i++){
if(a%i==0)
return false;
}
return true;
}
int main(){
int n,k;
scanf("%d",&n);
for(int i=0;i<n;i++){
int id;
scanf("%d",&id);
ran[id]=... |
4f4d1974e4d093be02c127e2699c02b961b27695 | 3dac24f1d67af238db2391aff26e5c789298e8d0 | /problem solving Website Problems/Merg.cpp | 7b3d6a1ea370dde209b7f1f5ba81c286acc7aed4 | [] | no_license | Abdel-rhman1/ProblemSolving | 851c217ce71e3d9f27a011db037857ec52bec435 | 46ae10f995e730e4f46c11ceacaa139487371f8f | refs/heads/master | 2023-04-25T11:16:44.409087 | 2021-04-19T19:31:56 | 2021-04-19T19:31:56 | 335,609,257 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,576 | cpp | Merg.cpp | #include<bits/stdc++.h>
using namespace std;
class Node{
public:
int data;
Node *next;
Node(int data){
this->data=data;
this->next=NULL;
}
};
void Add(Node **head,int data){
Node *NewNode=new Node(data);
if(*head==NULL)
*head=NewNode;
else{
Node *curent=*head;
while(curent->next!=NULL){
curen... |
b6f79f3fbf200ff843f490b575f0711c78029794 | cd726912664cea9c458ac8b609dd98bf33e3b9a0 | /snippets/cpp/VS_Snippets_CLR_System/system.TimeSpan.RelationalOps/CPP/relationalops.cpp | 526f4e39d0049cf4359a6773e736a61940846e15 | [
"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,058 | cpp | relationalops.cpp |
//<Snippet1>
// Example of the TimeSpan relational operators.
using namespace System;
const __wchar_t * protoFmt = L"{0,35} {1}";
// Compare TimeSpan parameters, and display them with the results.
void CompareTimeSpans( TimeSpan Left, TimeSpan Right, String^ RightText )
{
String^ dataFmt = gcnew String( protoFm... |
9ad04093826af2083bc9bb12bc21b172e0028373 | af59e00881a72a40edd4330237161d2d34840c35 | /cub/base/placement.h | 9577938de74aa60970e60fadd717da1a6d5f3085 | [
"Apache-2.0"
] | permissive | sineagles/Adlik | f0974800c7e3d7079d1a284d0b519088d09f628e | 13e7bb81e4729564dc8dc234c203b245d53ab520 | refs/heads/master | 2023-04-11T00:11:37.676494 | 2019-11-15T06:20:31 | 2019-11-15T06:20:31 | 222,104,455 | 2 | 0 | Apache-2.0 | 2023-03-24T23:21:18 | 2019-11-16T13:37:33 | C++ | UTF-8 | C++ | false | false | 1,313 | h | placement.h | // Copyright 2019 ZTE corporation. All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
#ifndef H05B2224D_B926_4FC0_A123_97B52B8A99DB
#define H05B2224D_B926_4FC0_A123_97B52B8A99DB
#include <type_traits>
namespace cub {
template <typename T>
struct Placement {
Placement& operator=(const T& rhs) {
assign... |
bd9cf0ee5d8e0968c7eef331f645cd8bb72dd6cf | a5fbad4bfd43604279d7f4953fd4ec1920532ee8 | /util/args.cpp | 357e559844f8d31882a37979b415a32a9aa7d11a | [] | no_license | StanHash/bin2ea | 9765563aa2c52959a89a461fff81c204461bd76e | b63547996c352e499bb79c9aae831cbc21726448 | refs/heads/master | 2021-01-23T10:10:23.367594 | 2018-02-11T12:11:06 | 2018-02-11T12:11:06 | 93,045,452 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 602 | cpp | args.cpp | #include "args.h"
void Arguments::_computeNext() {
if (mArgs.size() == mCurrentIndex) {
mNext.type = Argument::End;
mNext.value = nullptr;
} else if (mCurrentIndex == 0) {
mNext.type = Argument::ProgramName;
mNext.value = mArgs.at(mCurrentIndex++);
} else {
char* data = mArgs.at(mCurrent... |
736c17980841887772e5fa8a545b31b0fd9228a5 | 4f9087d39d862c405c827a9e2f693797508d246f | /Client/Games/Reversi/cpp/TrinaryState.cpp | 64a354a8d083d030681430bcbc52ede455548716 | [] | no_license | aureooms-ulb-2010-2015/2011-2012-infof209-project | e1204eabe9dce71a6e843fdcf279103e246fb05b | 169ee99ce38ffbba6cc4fcc9e359314c934d648e | refs/heads/master | 2021-01-16T01:01:29.819169 | 2014-12-08T14:50:06 | 2014-12-08T14:50:06 | 38,203,046 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 816 | cpp | TrinaryState.cpp | #include "../h/TrinaryState.h"
const unsigned short int TrinaryState::__FIRST = 0;
const unsigned short int TrinaryState::__SECOND = 1;
const unsigned short int TrinaryState::__THIRD = 2;
TrinaryState::TrinaryState(){
}
bool TrinaryState::first() {
return this->__actual == TrinaryState::__FIRST;
}
boo... |
c7ed50d0e1aaf135a902bff5c8650fe4e6768194 | 116c8bfeb2d19aa0cc181f77b5058776e49b1372 | /FeatureAndMatching/FeatureAndMatching/FeatureAndMatchingDlg.cpp | d4532b993e72da7fbd969dc6afb5de0bf34d7702 | [] | no_license | batiboy/Computer-Vision | c578140413577c9b5c94d31c3304979bcccc6ce1 | 71aba35f409a429d73ed33eba949f3738303b526 | refs/heads/master | 2021-04-23T12:47:03.760221 | 2020-04-01T08:49:04 | 2020-04-01T08:49:04 | 249,926,364 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,254 | cpp | FeatureAndMatchingDlg.cpp |
// FeatureAndMatchingDlg.cpp: 实现文件
//
#include "pch.h"
#include "framework.h"
#include "FeatureAndMatching.h"
#include "FeatureAndMatchingDlg.h"
#include "afxdialogex.h"
#include "Display.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// 用于应用程序“关于”菜单项的 CAboutDlg 对话框
class CAboutDlg : public CDia... |
7248fdacf010c7cac0158f560f094b81952f8f18 | d35b7b27d251be44b6077da3ccf4cd6045ec8964 | /StairDwellers_Mario/CFont.h | cc4cecaa2d94d649802867d89636ea1e065e9070 | [] | no_license | Teurowel/MarioProject | 95bed3928d2eeb617b288bda888de4fd88d8d566 | 96435ad4975ced0b89b5d3116c7b18ffb223fc8a | refs/heads/master | 2021-02-16T05:24:47.738940 | 2020-03-04T18:37:29 | 2020-03-04T18:37:29 | 244,971,019 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 691 | h | CFont.h | #ifndef _CFONT_H
#define _CFONT_H
#include "CStaticObject.h"
#include <string>
using namespace std;
class CFont : public CStaticObject
{
protected :
string m_szString;
string m_szPrevString;
SDL_Color m_FontColor;
SDL_Surface* m_pFontSurface;
SDL_Texture* m_pFontTexture;
SDL_Rect m_rFontRect;
double m_dMax... |
b60d515ecd61c05d8acc8e9e2278054057dde7d2 | 81a0b8bcd48414105a4e88c3c87c661f32a1f7de | /ColdEye/Pattern/Observer.cpp | a72ad67737927532aa3e1b7d6acbe42be3b7bb56 | [] | no_license | EmbededMind/ColdEye | 8d384d2934e4b6695f45e6fc9e5f45539a58fd48 | c838e1570931ad39f68a7b17e1254f3a989f26e8 | refs/heads/master | 2020-12-24T07:56:20.458547 | 2017-01-05T08:25:22 | 2017-01-05T08:25:22 | 73,352,875 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 103 | cpp | Observer.cpp | #include "stdafx.h"
#include "Pattern\Observer.h"
Observer::Observer()
{}
Observer::~Observer()
{}
|
4e34c5c0e8a193084986fcacf539d756ccd20711 | 1944bc40d129999f0150c6312e3c47b0310775ba | /trees.cpp | 5d14e8bd800747d7d6b6dbe6043d1fac03bfe681 | [] | no_license | sashasashasasha151/genetic-algorithms-and-automatons | ea36d7eb58dab8b77641bea8a6e4dbcc54bdd392 | 3af3725d85af9f9eb47e32d5207f332016ed5fdd | refs/heads/master | 2020-04-22T19:55:12.254899 | 2019-02-25T14:52:45 | 2019-02-25T14:52:45 | 170,623,869 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,203 | cpp | trees.cpp | #include <iostream>
#include <vector>
#include <string>
#include <fstream>
#include <unordered_map>
#include <sstream>
using namespace std;
struct Vertex {
bool is_c = false;
int a = -1;
int p = -1;
int l = -1;
int r = -1;
int id;
};
int n;
int index = 1;
vector<Vertex> G;
unordered_map<int, ... |
c820153b1e03f2826e2a5074532902d8dc669c00 | 0b0db81dce495b13b4f7ea0beb705e4f5ed7c00b | /src/Programs/RunPlanner.cpp | 33324343e311d6660ebe37f66b819b3c00d32cfa | [] | no_license | BoChang11/ActionAndMotionPlanner | c9611018b84455afa06b67a39445edc31febc964 | 28ec04db41f5c50bf0e84ef1c434f6f483dbc163 | refs/heads/master | 2020-04-30T06:10:10.431664 | 2018-02-09T05:54:47 | 2018-02-09T05:55:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,779 | cpp | RunPlanner.cpp | #include "MP/Planner.hpp"
using namespace Abetare;
extern "C" int RunPlanner(int argc, char **argv)
{
char *fname = argc > 1 ? argv[1] : NULL;
FILE *in = argc > 1 ? fopen(argv[1], "r") : NULL;
double tcurr = 0;
int count = 1;
double tint ... |
67bc39998c022b1e6b7a975b9cebe3bc25deacc6 | 49c6cf776addc6fbac50c887edfa168d81aa7729 | /Codeforces/Div2/695/A.cpp | f8ba82553841e9dc79645701e26045195e32d131 | [] | no_license | Ryednap/Coding-Competition | b43e38b4e8d3bfc7eee21750cd1014fb4ce49c54 | a4fd7b97f3898e60800689fe27b8c00ac8a456fa | refs/heads/main | 2023-08-19T06:55:04.344956 | 2021-10-08T05:59:24 | 2021-10-08T05:59:24 | 398,359,907 | 0 | 0 | null | 2021-08-28T12:33:09 | 2021-08-20T17:55:14 | C++ | UTF-8 | C++ | false | false | 361 | cpp | A.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int qq;
scanf("%d", &qq);
while(qq -- ) {
int n;
scanf("%d",&n);
if(n == 1) printf("9");
else if(n == 2) printf("98");
else {
int prev = 8;
printf("98");
for(int i = 0; i < n - 2; ++i) {
prev = (prev + 1)%10;
printf("%d", prev);
... |
df4f2534cc71faa05f154b7437df43466f982144 | 2e3bc5b5c60ed2d5cbdf7b66f6ffe2502207e605 | /MFPJ/T5 - MatrizTransform/main.cpp | f7a2f61a5fc0c515af689269b34676d0e02eac81 | [] | no_license | Tiago24/SMD | c120daca5b6be0b07773e2b5d9e8f15ceecbeff6 | ba24efa31ebf3c439749803eb1d42cf635bc8099 | refs/heads/master | 2020-03-18T07:04:18.932213 | 2018-05-19T02:30:29 | 2018-05-19T02:30:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 881 | cpp | main.cpp | #include <iostream>
#include <cmath>
#include "MatrizTransform.h"
#define PI 3.14
using namespace std;
int main()
{
cout << "Hello world!" << endl;
MatrizTransform m = MatrizTransform();
cout << m << endl;
MatrizTransform a = MatrizTransform::identity();
cout << a << endl;
MatrizTransform b ... |
fc7a7ee71ae8a20b994fd7cab2914cacdcfed59d | 7286dc36c9f2767f411cb4cf633b1b0207c14125 | /Moonwalker Engine/LiteRakNet/BitStream.h | 02c7c029018e13c60443db2f514c93a2e36e730f | [] | no_license | F11GAR0/Moonwalker-Engine | 8272154bad602b31a6178586c260d492d16fafae | a1713b74a7c31a0c0d9d5463f46df0ee48639576 | refs/heads/master | 2021-05-17T14:19:07.087264 | 2020-04-06T21:03:25 | 2020-04-06T21:03:25 | 250,817,499 | 10 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 32,015 | h | BitStream.h | #pragma once
#include "../walker.h"
/// Given a number of bits, return how many bytes are needed to represent that.
#define BITS_TO_BYTES(x) (((x)+7)>>3)
#define BYTES_TO_BITS(x) ((x)<<3)
#define BITSTREAM_STACK_ALLOCATION_SIZE 256
/// This class allows you to write and read native types as a string of bits. BitStrea... |
0201c64eee333c49255735bc605bb0d2c393b76d | 9ac51dbec38db53f214f0e60d3a1d534c15c1573 | /Weekly Work/Week 5/Worksheet Material/palindrome_alt_solution.cpp | 7b02bb78c0cc5593093515df67732da7d7d5b0a5 | [
"MIT"
] | permissive | joegreene/2015-Spring-CS-121 | 2ef82b847e89f7bc020eb8a72490409075ce3352 | 473e0eeae758ccf768b3fcd376986de5377b6f2e | refs/heads/master | 2016-09-10T09:25:41.878216 | 2015-05-10T10:16:07 | 2015-05-10T10:16:07 | 30,477,376 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,737 | cpp | palindrome_alt_solution.cpp | /*
How this code works:
main:
- Functions as driver
- Calls "process_file"
process_file:
- Grabs strings from file
- Calls "print_palindrome"
print_palindrome:
- Prints whether or not each phrase is a palindrome
- Calls "format_string" to help with
format_string:
- Removes... |
03b44f6e75745f3b91dd76b4f447e9f0fe83f74f | 22c8b02090ff601de23d9eb917638cb9df695311 | /gate/gate_v1_00.hpp | c3a9f90db317f773e369b1cd9877b64c410786a5 | [] | no_license | hmito/hmLib_v2 | ffd739834c301b5119b10ef7b51baa1e3e078e20 | 5a37534786d4a8ef3ad3ab4036ef8dadba0281e7 | refs/heads/master | 2021-01-15T17:45:45.672305 | 2015-08-23T08:52:45 | 2015-08-23T08:52:45 | 41,242,652 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 6,791 | hpp | gate_v1_00.hpp | #ifndef INC_HMLIB_GATE
#define INC_HMLIB_GATE 100
#
#ifndef INC_HMLIB_STREAMBUFPATTERN
# include "hmLib_v2/streambuf_pattern.hpp"
#endif
#ifndef INC_HMLIB_EXCEPTION
# include "hmLib_v2/exception.hpp"
#endif
namespace hmLib{
template<typename _Elem, typename _Traits=std::char_traits<_Elem> >
class basic_gat... |
1f064603084c6699fe7453b75575f504a001e796 | 137ff631268bd71a7ccfa3bbb61ab239ab5ebef6 | /vrtest/Renderer.cpp | fd50c7cef593b1d0cfc01053f48ba744085bbabc | [] | no_license | thestew42/vrdemo | 0c01ab53a0fa611db9cfea52e3352da053d0b47f | 764ab44a0acdb7aad76ca3a596ecb40624be2a8d | refs/heads/master | 2021-08-11T18:52:17.334102 | 2017-11-14T02:44:39 | 2017-11-14T02:44:39 | 109,794,125 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 19,731 | cpp | Renderer.cpp | /** @file Renderer.h
*
* @brief Defines class that converts scenes into command buffers and runs them
* on the device
*
* Copyright 2017, Stewart Hall
*
* @author Stewart Hall (www.stewartghall.com)
* @date 11/12/2017
* @copyright Copyright 2017, Stewart Hall
*/
#include "Renderer.h"
#include <iostream>
Rendere... |
9f80a6351fe93a30b6de07c04099f28bcbcef62c | 0bcfca13028126a2924e67d25ba541d746f002ec | /Tema_3/T_3_1/Arma.cpp | 1d8252b5ffee07d8ab5f7b79e69f4b75e1dc2ff8 | [] | no_license | POOUJA/teoria | 1be824afb326302605dec45cec0a2ff8e0f9a1d8 | 7cf89985981f523328cf0338ba1963fa1570da6a | refs/heads/master | 2023-03-30T12:41:52.859593 | 2023-03-21T10:12:37 | 2023-03-21T10:12:37 | 42,666,840 | 7 | 24 | null | 2019-02-27T16:55:31 | 2015-09-17T16:12:09 | C++ | UTF-8 | C++ | false | false | 2,793 | cpp | Arma.cpp | /**
* @file Arma.cpp
* Archivo con la definición de los métodos de la clase Arma
* @author algarcia
* @date 2015-10-21
*/
#include <stdexcept> // Para usar std::out_of_range
#include "Arma.h"
/**
* @brief Constructor de copia
*
* Cambia el nombre del objeto nuevo, añadiéndole " - 2" al final, para que se
... |
e65eac982c67c5a657295f5da7233d7bd318d05d | 0d1a101c3dbf58adfd1ae7543cfe3bd9ea39ac91 | /blasius_laminar_github/1.8/phi | a97c98b589866e8e75231e8fef1413498f8895fc | [] | no_license | tsam1307/OpenFOAM_laminar_BL | 74fe2faee653d0a9b2bcbfa0fe42654c90f4f92e | 2d9518b57804f265d2bb40079fbab2bac979c176 | refs/heads/main | 2023-05-07T13:49:41.832067 | 2021-05-28T19:33:12 | 2021-05-28T19:33:12 | 371,780,408 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 231,324 | phi | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v2012 |
... | |
f999a752616668ff0b7b19b1c920b38989f9cf03 | f06394eb49f055ce3a51c93eb56249350d64ddbb | /tests/generation-tests/SVG/ReferencedFile.cpp | a946deac052a27878dbc599f0b7aaf7eaa067cbb | [] | no_license | happyj/e4c | a3c6eb523cf1d346a73b138c45a6cdfc83766710 | 59646a43d50749ddfc983e9a1f3a3c70fc5eb218 | refs/heads/master | 2020-03-26T05:15:09.814976 | 2014-02-22T11:20:12 | 2014-02-22T11:20:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,283 | cpp | ReferencedFile.cpp |
#include "ReferencedFile.hpp"
#include <SVG/SVGPackage.hpp>
#include <SVG/Image.hpp>
using namespace SVG;
/*PROTECTED REGION ID(SVG::ReferencedFile include) START*/
/*PROTECTED REGION END*/
ReferencedFile::ReferencedFile() :
m_referer(),
m_name()
{
/*PROTECTED REGION ID(ReferencedFile constructor) START... |
46a265dcf6dea9c8dce2004c65870383efc4aa0e | e87343a9126e8262a9fd858b35cdae1832645e30 | /miller_rabin.cpp | faefec78eedb701b382a8101c71bf461727c50a4 | [] | no_license | tobwik/avalgProject1 | f8d3d21f8bec8d38854cf87b48e5b37f62390c30 | 12aabc0875e932b9c958b399da6235553ff4911e | refs/heads/master | 2020-12-03T10:30:09.647912 | 2014-11-17T13:29:17 | 2014-11-17T13:29:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,448 | cpp | miller_rabin.cpp | /*
* C++ Program to Implement Miller Rabin Primality Test
*/
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <gmpxx.h>
//#define ll long long
using namespace std;
void print(mpz_class a) {
// char * s;
// s = mpz_get_str(NULL, 10, a);
cout << a << endl;
}
/*
* calculates (a... |
ab5710bcc7c21337000fcf13a7d42855c42d6a56 | 5f9888aa5ea9a82dc3dd6254ef9284fbaf4ced75 | /psp案例修改/user_man_create.cpp | bd9886d9837961bd5578f163ea1a9a0c26496fbc | [] | no_license | xuqingjie/pspproject | a805f21e876c3977cae79b0e9117ec157cd55867 | 7f1373415f55cdfee79ff09024aa1944ab4ce27c | refs/heads/master | 2021-01-22T17:34:02.885794 | 2016-06-05T00:36:33 | 2016-06-05T00:36:33 | 60,408,689 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,487 | cpp | user_man_create.cpp | /*本模块实现创建用户的功能
保函以下几个模块
1)void main_cre();
2)void show_cre();
3)void cre_user();
变量为user类的变量user；
时 间：2016-05-20
作 者：徐庆杰
修改历史：2015-5-20 徐庆杰 创建
*/
#include"user_man_create.h"
void main_cre()
{
cre_user();
}
void show_cre()
{
system("cls");
cout << "\n\n\n\n\t ************************************************... |
aa4689db390b90b30a0549e6b134c9fe2009311c | 9fa26368d926664964ecf56274f33dc0009590ca | /src/events/subscriptions/fileRemovalSubscription.h | 738243c50f05585f0e011394b50a80209f71c1ee | [
"MIT"
] | permissive | bkryza/oneclient | e3485e25547a06878345e80631cd853afdb3cf43 | 70eaafe200f55c5d9bede865182daf40a3217fae | refs/heads/develop | 2020-12-25T20:08:53.847534 | 2016-08-26T05:49:07 | 2016-08-26T05:49:07 | 66,667,194 | 0 | 0 | null | 2016-08-26T17:38:06 | 2016-08-26T17:38:06 | null | UTF-8 | C++ | false | false | 1,241 | h | fileRemovalSubscription.h | /**
* @file fileRemovalSubscription.h
* @author Michal Wrona
* @copyright (C) 2016 ACK CYFRONET AGH
* @copyright This software is released under the MIT license cited in
* 'LICENSE.txt'
*/
#ifndef ONECLIENT_EVENTS_SUBSCRIPTIONS_FILE_REMOVAL_SUBSCRIPTION_H
#define ONECLIENT_EVENTS_SUBSCRIPTIONS_FILE_REMOVAL_SUBSC... |
714c1e3dfccc5e708bc963754d0fd21a223aea72 | d1673895a10255bfe2197eba1d54b69d5bf003dd | /Common_vs2015/GraphicsCard.cpp | 532192667809c48ae8b8cacd4d0ead3f60bbfbd2 | [] | no_license | DuffAb/DirectX11-Sample | ea3b83f2e5051cd0cb4bcb640e2683e0fad969bd | bb0509917a08cafefe6f10a482b3f6c0ba7ae217 | refs/heads/master | 2020-04-04T23:35:17.148028 | 2018-11-09T07:59:19 | 2018-11-09T07:59:19 | 156,364,784 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,974 | cpp | GraphicsCard.cpp | //***************************************************************************************
// d3dApp.cpp by Frank Luna (C) 2011 All Rights Reserved.
//***************************************************************************************
#include "GraphicsCard.h"
#include <WindowsX.h>
#include <sstream>
GraphicsCard... |
31bb5e32153843fa217b3fdf32b84a43d7791ced | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_6377668744314880_0/C++/sakulasd/C.cpp | 35f0955be34c9a06a1f949fc8583948247568fc0 | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 3,084 | cpp | C.cpp | #include <stdio.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
const int MAXN=105;
struct point
{
int x,y;
};
point list[MAXN],list2[MAXN];
point save[MAXN],use[MAXN];
int rec[20];
int ans[20];
int dir[20]={1,2,4,8,16,3... |
92ae8f65eabdce642fcd403dc5ac3ff788e245ad | dc018cded62cf3cc986ab6b845fa5ce34c7e396e | /页面置换算法/CppOOPStudy/CppOOPStudy/block.hpp | 5e1a2dc0ec52c36b808f9c5c676d84827e19d5f7 | [] | no_license | Darius18/OS | d5043100f9e3f4a2bf27f0d9d74ccd81e8c7c948 | 71536446826a42f768b7aee794ff56bb98ae36a3 | refs/heads/master | 2023-02-17T09:29:02.165939 | 2021-01-14T09:11:18 | 2021-01-14T09:11:18 | 311,271,441 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 934 | hpp | block.hpp | //
// block.hpp
// CppOOPStudy
//
// Created by ZhangChi on 2020/12/21.
// Copyright © 2020 edu.HENU. All rights reserved.
//
#ifndef block_hpp
#define block_hpp
#include "BASE.h"
class block{
public:
block(int blockId, int storePageID, int lifeToSet){//构造函数
storePage = storePageID;//因为不是从0号开始的，所以默认设... |
3712eded0ad5c0535a1a7c2aabaedc6398770057 | 5c99796df42d2c6edc7d7de132663fdf3da96d42 | /NFEngine/CrayonBox.h | a79c576d3d0c926c5818d3175c6be6fe572ee6bc | [] | no_license | JTensai/NFEngine | 425a4d9c8cb36423772bc17952d2303ed55b6d28 | 1f27c547809b7d36b862054debf6c36592d5fe47 | refs/heads/master | 2020-05-23T08:14:33.195746 | 2016-10-10T20:34:07 | 2016-10-10T20:34:07 | 70,267,005 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 254 | h | CrayonBox.h | #pragma once
#include "GameObject.h"
#include <iostream>
#include "Transform.h"
#include "Mesh.h"
#include "Texture.h"
class CrayonBox :
public GameObject
{
public:
CrayonBox();
void CrayonBox::update(float delta_seconds);
virtual ~CrayonBox();
};
|
9181e45323e3cd68aada9cd848f49e9935f5f0c5 | 5d2e7be0fd7a1e423249d89373abeabedaedaa68 | /src/PathPlanner/PRM.cpp | 74a916b9b924315cd8ecd549b7dd3c6c1088b3e5 | [] | no_license | karthikbalajikesh/ServerRobotAPI | 0601b33e9c5ae7e1852d5bada809d0c2a853d1d5 | 087eec001fe2ae34af48a555b6971bfd25f3be3b | refs/heads/master | 2022-11-12T17:20:57.175844 | 2020-07-14T17:36:33 | 2020-07-14T17:36:33 | 272,517,987 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,771 | cpp | PRM.cpp | #include<cstdlib>
#include<time.h>
#include<math.h>
#include "PRM.h"
PRM::PRM(int numIterations, int zmax, int xmax, int cellWidth, int cellHeight, int neighbours, cood_vector coordinates):
occupancy_grid(xmax, zmax, cellWidth, cellHeight, coordinates), network() {
// extract the size of the occupancy grid
int z_n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.