Ahocorasick in zig

ahocorasick I just wanted to share my implementation of the algorithm in zig. I tried moving things around to program without pointers but there are still some. I think if was fun and it had the unexpected advantage of using Node enum as a key for the words map where I store leaf nodes and the whole word. There are speed and space optimization I could do but overall I am happy user. There are also Guard and StateMachine structs that I added later but would have been more helpful had they were...