 |
C++Talk.NET C++ language newsgroups
|
| View previous topic :: View next topic |
| Author |
Message |
Dancefire Guest
|
Posted: Sun Apr 29, 2007 9:39 pm Post subject: Is there any STL class can help to build a digital search tr |
|
|
Hi, everyone,
I have a large in memory wstring dictionary application, I'm using the
hash_map for fast index the entry. But I think it might be good
if I use digital search tree to do the index, which will also help me
to get the longest-prefix matching. I can't find any class in STL can
do the job, but it's really useful.
Did I miss something? If not, is there any digital search tree
implementation exist (in boost? or others?) Or, is there any
facilities in STL will help me to implement a digital search tree?
Thanks.
--
[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ] |
|
| Back to top |
|
 |
Bob Hairgrove Guest
|
Posted: Mon Apr 30, 2007 9:10 am Post subject: Re: Is there any STL class can help to build a digital searc |
|
|
{ Double-spacing corrected. -mod }
On Sun, 29 Apr 2007 15:39:53 CST, Dancefire <Dancefire (AT) gmail (DOT) com> wrote:
| Quote: | Hi, everyone,
I have a large in memory wstring dictionary application, I'm using the
hash_map for fast index the entry. But I think it might be good
if I use digital search tree to do the index, which will also help me
to get the longest-prefix matching. I can't find any class in STL can
do the job, but it's really useful.
Did I miss something? If not, is there any digital search tree
implementation exist (in boost? or others?) Or, is there any
facilities in STL will help me to implement a digital search tree?
Thanks.
|
Have you looked at the boost graph library yet?
--
Bob Hairgrove
NoSpamPlease (AT) Home (DOT) com
--
[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ] |
|
| Back to top |
|
 |
Dancefire Guest
|
Posted: Mon Apr 30, 2007 5:56 pm Post subject: Re: Is there any STL class can help to build a digital searc |
|
|
| Quote: |
Have you looked at the boost graph library yet?
|
Yes, but I can't find anything relative to digital search tree. And
there is no much tree structures in BGL.
--
[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ] |
|
| Back to top |
|
 |
Lance Diduck Guest
|
Posted: Thu May 03, 2007 2:44 am Post subject: Re: Is there any STL class can help to build a digital searc |
|
|
On Apr 29, 5:39 pm, Dancefire <Dancef...@gmail.com> wrote:
| Quote: | Hi, everyone,
I have a large in memory wstring dictionary application, I'm using the
hash_map for fast index the entry. But I think it might be good
if I use digital search tree to do the index, which will also help me
to get the longest-prefix matching. I can't find any class in STL can
do the job, but it's really useful.
Did I miss something? If not, is there any digital search tree
implementation exist (in boost? or others?) Or, is there any
facilities in STL will help me to implement a digital search tree?
Thanks.
http://abc.se/~re/code/tst/tst_docs/index.html is a library of STL |
compatible Ternary Search Trees. Gotta be somehting in there that is
close to what you need, if not exactly. Else looks through the list
here http://en.wikipedia.org/wiki/Ternary_search_tree
Hope that helps
Lance
--
[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ] |
|
| Back to top |
|
 |
|
|
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum
|
|