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
using MacroTools | |
symbolsof(ex::Symbol) = [ex] | |
symbolsof(ex::Expr) = ex.head == :line ? Symbol[] : vcat([symbolsof(x) for x in ex.args]...) | |
symbolsof(ex) = Symbol[] | |
reflect(ex) = Expr(:(=), ex, ex) | |
protected(ex) = Expr(:let, Expr(:function, :(), ex), map(reflect, symbolsof(ex))...) |
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
make: Entering directory '/home/fengyang/Documents/OSS/julia/doc' | |
PATH=":/home/fengyang/.npm-packages/bin:/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/home/fengyang/.local/bin" . ./../deps/build/julia-env/bin/activate && sphinx-build -b doctest -d ./_build/doctrees /home/fengyang/Documents/OSS/julia/doc ./_build/doctest | |
Running Sphinx v1.4.5 | |
loading pickled environment... done | |
building [mo]: targets for 0 po files that are out of date | |
building [doctest]: targets for 86 source files that are out of date | |
updating environment: 0 added, 84 changed, 0 removed | |
reading sources... [100%] stdlib/test | |
/home/fengyang/Documents/OSS/julia/doc/stdlib/arrays.rst:67: WARNING: duplicate object description of Base.length, other instance in /home/fengyang/Documents/OSS/julia/doc/stdlib/strings.rst, use :noindex: for one of them | |
/home/fengyang/Documents/OSS/julia/doc/stdlib/arrays.rst:257: WARNING: duplicate object description of |
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
A Cohomological Viewpoint on Elementary School Arithmetic | |
Abstraction in Technical Computing | |
Almost Integers | |
Automated Verification of Computational Systems | |
Bernoulli Numbers and their Applications in Modern Number Theory | |
Bitcoin and Blockchains | |
Bloom Filters and Probabilistic Data Structures | |
Branch Prediction | |
Buchi Automata | |
Cake cutting algorithms |
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
0: Instruction(INPUT, Parameter[Parameter(8, POSITION)]) | |
2: Instruction(JNZ, Parameter[Parameter(8, POSITION), Parameter(350, IMMEDIATE)]) | |
5: Instruction(JZ, Parameter[Parameter(0, IMMEDIATE), Parameter(11, IMMEDIATE)]) | |
8: 0 | |
9: 0 | |
10: 0 | |
11: Instruction(OUTPUT, Parameter[Parameter(1, IMMEDIATE)]) | |
13: Instruction(OUTPUT, Parameter[Parameter(0, IMMEDIATE)]) | |
15: Instruction(INPUT, Parameter[Parameter(8, POSITION)]) | |
17: Instruction(MUL, Parameter[Parameter(8, POSITION), Parameter(-1, IMMEDIATE), Parameter(10, POSITION)]) |
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
module Rankings | |
using AutoHashEquals | |
using Cards | |
using Compat | |
import Base: <, <= | |
@enum RankingClass begin | |
HighCard | |
Pair |
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
#include <iostream> | |
#include <cmath> | |
#include <vector> | |
#include <set> | |
#define NO_SQUARES {cout<<"NONE"<<endl;return 0;} | |
using namespace std; | |
// Enough primes. | |
int manyprimes[63] = {5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313}; |