Add method to output all matched substrings

[mganss]

Something like this:

public IEnumerable<KeyValuePair<string, int>> Search(string text)
{ ... }

where the key is the matched pattern and the value is the start index into the searched string.

I tried adding this method assuming that IsFinished means a node is in the dictionary ("blue node" as in the description on Wikipedia). But that doesn't seem to be the case so I gave up 😢

[alexandrnikitin]

IsFinished field shows that some keyword ends at that node. It's possible to add such feature but it seems too specific. One more thing my intention was to make the implementation as fast as possible. So it's better to measure the performance.

[mganss]

IMO finding all the matching substrings and their locations is a fundamental feature of the Aho Corasick algorithm and a requirement for many use cases.

[alexandrnikitin]

Push new version with the "Search" feature. You can try it using Install-Package AhoCorasick.Net -Version 0.6.0-beta

[mganss]

This

var ac = new AhoCorasickTree(new[] { "a", "ab", "bab", "bc", "bca", "c", "caa" });
var m = ac.Search("abccab").ToList();

finds only "a", "ab", "bc", "a", "ab". Should find "a", "ab", "bc", "c", "c", "a", "ab". This is the example from Wikipedia.

[alexandrnikitin]

Pushed the fix with 0.6.1-beta version