On Wed, Sep 10, 2025 at 5:43 PM Raymond Burkholder via Boost-users
<[email protected]> wrote:
>
> 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.
I'll check the boost spirit. Thank you.
I need to match IPv4/IPv6 prefixes.
Currently I intend to use the policy based extensions of libstdc++ -
https://gcc.gnu.org/onlinedocs/libstdc++/manual/policy_data_structures_design.html#pbds.design.container.trie.
I'm not sure if they are OK for production usage though.
>
> _______________________________________________
> 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/3N2JXTZ7YLIJ5E42EYH23VKOO7ND22HC/
_______________________________________________
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/5BZGHR6MQJP4W5XDDV3K6CBMOK4EENT5/
