Hi,<p>to provide a bit context, I'm the author of a small causal android game called "Squabbel"[1] which is a modern take on a merge of tetris and scrabble.<p>Its core is based around the idea to find strings within a sequence of characters, which is accomplished by using a deterministic finite automaton.<p>Currently I'm working on the successor of Squabbel and I was optimizing the internal search engine and refactored the code to a c++ library which is now available on github<p>https://github.com/0x10/fastdict<p>The search times are to my needs pretty good and I would love to get some feedback on the performance.<p>Thanks.<p>[1] https://play.google.com/store/apps/details?id=cc.deadlock.squabbel.lite
Cool! Seems similar to the Aho-Corasick algorithm, which was designed for exactly this task (<a href="https://en.wikipedia.org/wiki/Aho%E2%80%93Corasick_algorithm" rel="nofollow">https://en.wikipedia.org/wiki/Aho%E2%80%93Corasick_algorithm</a>)