[Feature suggestion] AllPrefixMatches

[adaskos]

Hi. I only recently discovered this library. Thank you for sharing it.

I'm wondering if you're willing to expose some extra public methods,
or if you would consider changing the Trie class to not sealed (and make its internals protected too), so one can sub-class it and extend it.

What I'm missing at the moment is a function like LongestPrefixMatch which will return all matches (even shorter ones too).
I can call Contains for each substring of the longest match, but it feels sub-optimal, when the method has already traversed the tree and found them.

Thank you for your time.

[kpol]

Thanks. Could you please elaborate on the method with an example?

[adaskos]

Hi @kpol. I somehow missed your reply.

So let's say you have a KTrie with words "apple", "apples" and "apple pie".
Then when you do trie.AllPrefixMatch("I made an apple pie") I would like to get back an enumerable of ["apple", "apple pie"].
Same logic as you have now for longest prefix, but instead of returning the deepest you find, just yield return all the terminal ones you meet.