Aleš Najmann littleli

Introductory Material

Add Graal JIT Compilation to Your JVM Language in 5 Steps, A Tutorial http://stefan-marr.de/2015/11/add-graal-jit-compilation-to-your-jvm-language-in-5-easy-steps-step-1/
The SimpleLanguage, an example of using Truffle with great JavaDocs https://github.com/graalvm/simplelanguage
Truffle Tutorial, Christan Wimmer, PLDI 2016, 3h recording https://youtu.be/FJY96_6Y3a4 Slides

Create Android Studio Command-line Launcher

Open Android Studio
Go to: Tools > Create Command-line Launcher
Leave as default, Press OK

Configure Git to use Android Studio as default Diff Tool

Add the following lines to your .gitconfig

Promises reading list

This is a list of examples and articles, in roughly the order you should follow them, to show and explain how promises work and why you should use them. I'll probably add more things to this list over time.

This list primarily focuses on Bluebird, but the basic functionality should also work in ES6 Promises, and some examples are included on how to replicate Bluebird functionality with ES6 promises. You should still use Bluebird where possible, though - they are faster, less error-prone, and have more utilities.

I'm available for tutoring and code review :)

You may reuse all gists for any purpose under the WTFPL / CC0 (whichever you prefer).

	(fn [input]
	(if (coll? input)
	(= input (reverse input))
	(= input (clojure.string/join "" (reverse input)))))

	class Bicycle {
	constructor(public cadence: number, private _speed: number, public gear: number) {}

	speed = this._speed

	applyBrake = (decrement: number) => this._speed -= decrement

	sppedUp = (increment: number) => this._speed += increment

	toString = () => `Bicycle: ${this._speed} mph`

	Latency Comparison Numbers
	--------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD

	(fn [num]
	(take num (map first (iterate (fn [[a b]] [b (+' a b)]) [1 1]))))

	;; Count a sequence
	(fn [coll]
	(reduce (fn [c _] (inc c)) 0 coll))