[Boost-users] Re: Radix Trie

On 2025-09-10 07:42, Pavel Vazharov via Boost-users wrote:

Is there a generic radix trie container in boost which can be used for longest prefix match? I mean, I couldn't find one in the boost containers libraries but maybe some library uses such a container internally and it's generic enough to be used with types other than strings?

One other thought:  boost spirit uses a trie structure for performing matches.  That might provide a more generalized form of token parsing for you.