Xpressive uses *ternary* search trie, IDK the details or if it fits your requirements, but you can check it out
https://www.boost.org/doc/libs/latest/doc/html/xpressive/user_s_guide.html On Wed, Sep 10, 2025 at 3:44 PM Pavel Vazharov via Boost-users < [email protected]> wrote: > HI there, > > 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? > > Thanks, > Pavel. > _______________________________________________ > Boost-users mailing list -- [email protected] > To unsubscribe send an email to [email protected] > https://lists.boost.org/mailman3/lists/boost-users.lists.boost.org/ > Archived at: > https://lists.boost.org/archives/list/[email protected]/message/CX7WVQ57ZGMDNBMQPHQEYNXXR7FF4SKN/ > _______________________________________________ Boost-users mailing list -- [email protected] To unsubscribe send an email to [email protected] https://lists.boost.org/mailman3/lists/boost-users.lists.boost.org/ Archived at: https://lists.boost.org/archives/list/[email protected]/message/BXCUBEMYVETBHAJD3VZESZPZFDPWD47V/
