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
POC of applying some Async primitives to a Poker game for a discussion on async from gamedev.stackexchange.com |
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
0000000000001640 <fib_SpYa5EuiU0areDDc1bSasA(unsigned long long)>: | |
1640: 48 83 ff 01 cmp $0x1,%rdi | |
1644: b8 01 00 00 00 mov $0x1,%eax | |
1649: 77 05 ja 1650 <fib_SpYa5EuiU0areDDc1bSasA(unsigned long long)+0x10> | |
164b: f3 c3 repz retq | |
164d: 0f 1f 00 nopl (%rax) | |
1650: 41 57 push %r15 | |
1652: 41 56 push %r14 | |
1654: 4c 8d 77 fe lea -0x2(%rdi),%r14 | |
1658: 41 55 push %r13 |
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
// An exercise in converting a regex to an NFA to a DFA | |
type RegexNode = | |
| Or of RegexNode list | |
| Seq of RegexNode List | |
| Star of RegexNode | |
| T of string | |
| Eta (* todo: does this value really belong here? *) | |
let regex_pattern = "x(x|y)*|z" |
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
uniform int n_lin_segments; | |
uniform vec2 lin_segments[256]; | |
uniform int n_quad_segments; | |
uniform vec2 quad_segments[512]; | |
varying vec3 pos; | |
varying vec2 uv; | |
void main() { | |
vec2 point = uv; | |
// point = (point + vec2(0.3, 0)) * 0.1; |
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
template<typename T> | |
struct vector { int length; T* data; }; | |
using vector_int = vector<int>; | |
using vector_float = vector<float>; | |
// F is a function type that takes T and returns R | |
// Map takes a vector<T>, and F and returns vector<R> | |
template<class T, class F> | |
auto Map(vector<T> input, F func){ |
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
// CracklePop | |
// Problem: Write a program that prints out the numbers 1 to 100 (inclusive). | |
// If the number is divisible by 3, print Crackle instead of the number. | |
// If it's divisible by 5, print Pop. | |
// If it's divisible by both 3 and 5, print CracklePop. | |
// Solution: regex is not only perfectly capable of lexing HTML, | |
// it is also perfectly capable of expressing, in a roundabout way, | |
// a finite automaton that verifies divisibility by a given number. |
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
<?php | |
function factorial($n) { | |
if (!$n) | |
return 1; | |
return $n * factorial($n-1); | |
} | |
function Y($f) { | |
$g = function ($x) use($f) { |
OlderNewer