Idly working on my Quamina state-machine-based pattern matcher. (

GitHub - timbray/quamina: Home of Quamina, a fast pattern-matching library in Go

Home of Quamina, a fast pattern-matching library in Go - timbray/quamina

) Hit a bug that smells like an infinite loop. Looked closer. Hmm, seems like my code traversing a dinky little 4-state automaton thinks it needs to consider 25,165,824 possible state transitions. Need more coffee. #software