Re: [Boost-users] Question on data structure usage

Subject: Re: [Boost-users] Question on data structure usage
From: Sebastian Messerschmidt (sebastian.messerschmidt_at_[hidden])
Date: 2016-11-29 04:50:02

Hi Ram,

In this case you can, if you absolutely want to, use a map. You can 
construct a map of prefixes, mapping to the respective complete string.

But this will result in a ridiculously big data structure. There are 
certain optimizations and pitfalls with this, and I used tries because 
they are much simpler and much more efficient.

But I'm unaware of any boost-internal implementation of tries.
A quick peek into the web revealed this however [0]

Cheers
Sebastian

[0] https://github.com/ithlony/Boost.Trie/tree/master/boost/trie

> Yes I wanted to use Tries, that was my first choice. I didnt find an
> implementation in boost. I dont want to write anything from the scratch.
>
> Thanks,
> -R
>
>
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>