Hi, Does the BOOST library (somewhere) contain a ternary search trie container type (as described by Robert Sedgewick in his "Algorithms - 3ed edition" or here: http://www.cs.princeton.edu/~rs/strings/) that can by used as a standalone container (such as for example STL's map) ? I don't find something like this listed on the Boost library page (http://www.boost.org/libs/libraries.htm). Any help will be greatly appreciated, Thanks Sybrand
On Sun, 27 Jun 2004 14:57:48 +0200, Sybrand Badenhorst wrote
Hi,
Does the BOOST library (somewhere) contain a ternary search trie container type (as described by Robert Sedgewick in his "Algorithms - 3ed edition" or here: http://www.cs.princeton.edu/~rs/strings/) that can by used as a standalone container (such as for example STL's map) ?
I don't find something like this listed on the Boost library page (http://www.boost.org/libs/libraries.htm).
No, there isn't such a library in boost, and I'm not aware of any work or proposals here either.... Jeff
If I remember correctly, developers of the Spirit library made reference in
the past to the ternary search tree -because such a container is used by
that library?
Anyway, thanks.
Sybrand
----- Original Message -----
From: "Jeff Garland"
On Sun, 27 Jun 2004 14:57:48 +0200, Sybrand Badenhorst wrote
Hi,
Does the BOOST library (somewhere) contain a ternary search trie container type (as described by Robert Sedgewick in his "Algorithms - 3ed edition" or here: http://www.cs.princeton.edu/~rs/strings/) that can by used as a standalone container (such as for example STL's map) ?
I don't find something like this listed on the Boost library page (http://www.boost.org/libs/libraries.htm).
No, there isn't such a library in boost, and I'm not aware of any work or proposals here either....
Jeff _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
Sybrand Badenhorst wrote:
If I remember correctly, developers of the Spirit library made reference in the past to the ternary search tree -because such a container is used by that library?
Yes. Spirit has a TST implementation. There was an effort to make it stand-alone. I haven't checked, but Steve Rowe, the man working on it, reported that the implementation is not optimal. Unfortunately, I do not have time yet to look into this. If you are interested on working on it, please email me. Regards, -- Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net
participants (3)
-
Jeff Garland -
Joel de Guzman -
Sybrand Badenhorst