robmccoll/dfago
A simple implementation of Discrete Finite Automata written in Go. Uses TOML for DFA syntax.
Validate struct fields in Go using tags.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
A simple implementation of Discrete Finite Automata written in Go. Uses TOML for DFA syntax.
Tracker is designed to signal a dynamic number of go routines to exit cleanly via a channel, boolean, or both.
bt (between) - counts the time between occurrences of the given string on stdin
Toml parser in Go