(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
import java.awt.image.BufferedImage; | |
import java.io.*; | |
import java.text.SimpleDateFormat; | |
import java.util.*; | |
import java.util.concurrent.*; | |
import java.util.logging.*; | |
import javafx.application.*; | |
import javafx.beans.binding.*; | |
import javafx.beans.property.*; | |
import javafx.beans.value.*; |
#!/bin/bash | |
# | |
# git-mv-with-history -- move/rename file or folder, with history. | |
# | |
# Moving a file in git doesn't track history, so the purpose of this | |
# utility is best explained from the kernel wiki: | |
# | |
# Git has a rename command git mv, but that is just for convenience. | |
# The effect is indistinguishable from removing the file and adding another | |
# with different name and the same content. |
#!/bin/bash | |
# | |
# Source: https://gist.github.com/bsdcon/7224196 | |
# Original: https://gist.github.com/habibutsu/5420781 | |
# Modified by Adrian Penisoara << ady+tailurl (at) bsdconsultants.com >> | |
# | |
# Last update: 8 Aug 2014 | |
# |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
A traditional table-based DFA implementation looks like this:
uint8_t table[NUM_STATES][256]
uint8_t run(const uint8_t *start, const uint8_t *end, uint8_t state) {
for (const uint8_t *s = start; s != end; s++)
state = table[state][*s];
return state;
}