This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
$ git log --author="Egemen Koku" --pretty=tformat: --numstat | gawk '{ add += $1; subs += $2; loc += $1 - $2 } END { printf "\nadded lines: %s removed lines: %s total lines: %s\n", add, subs, loc }' - |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
$ git log --author="Egemen Koku" --pretty=tformat: --numstat | grep "Whisky Engine/Source" | gawk '{ add += $1 ; subs += $2 ; loc += $1 - $2 } END { printf "added lines: %s removed lines : %s total lines: %s\n",add,subs,loc }' - |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
void MyFunction( Enum_Name_Here value ) | |
{ | |
// NOTE = also define another header, include all EnumName.h files to generate all enums on compile time | |
return GetStringEnum_Name_Here(value); | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/*********************************************************/ | |
/* C Modification of primes table */ | |
/* TDPrimes.INC */ | |
/* Copyright (c) Julian M Bucknall 1997, 2001 */ | |
/* All rights reserved. */ | |
/*********************************************************/ | |
/* Prime number array include file (auto-generated) */ | |
/* This will find prime numbers up to about 16.8 million */ | |
/*********************************************************/ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
inline bool my_isnan(double x) | |
{ | |
return x != x; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"ArchetypeJsonLocation": "Archetypes/Archetypes.json", | |
"AudioJsonLocation": "Resources/Audio.json", | |
"TextureJsonLocation": "Resources/Texture.json", | |
"SfmlMusicJsonTag": "SFMLMusic", | |
"SfmlSoundJsonTag": "SFMLSound", | |
"EngineLevelFileLocation":"Levels/", | |
"EngineLevels": ["Tutorial.json", "Level1.json", "Level2.json", "Level3.json"], |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"GameObjectList": [ | |
{ | |
"Light": { | |
"Tag": "Light", | |
"ModelComponent": { | |
"Type": "CUBE", | |
"Color": "white", | |
"Unlit": true | |
}, |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#ifndef BINARY_TREE_CPP | |
#define BINARY_TREE_CPP | |
#include "BT.h" | |
template<typename T> | |
BT<T>::BT(T const & data): NodeInterface<T>(data) { | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
COMPARISON | |
keylen = 512, iterations = 100000 | |
==================================== | |
Simple... 0.078 s | |
RS... 0.422 s | |
RS (Fast)... 0.156 s | |
Universal... 0.454 s | |
Universal (Fast)... 0.156 s | |
PJW... 0.328 s |