Chris Wagner-11 wrote:
I am interested in writing a library consisting of generic implementations of several common data structures and algorithms primarily useful in text-processing. I believe these would be useful additions to Boost and would like to work on them for GSoC. Before I submit my proposal, I would like to hear whether or not the community agrees that this is a good idea, and I would appreciate any suggestions or comments offered.
My plan is to implement a trie / prefix tree data structure, STL set/map-like classes implemented over the trie, a radix tree, a suffix tree implemented over the radix tree, and a suffix array. These would be instantiable over arbitrary sequence types, and use iterator traits to determine the contained type.
Look at http://code.google.com/p/patl/ PATL . I think that is very similar to what you want to do. -- View this message in context: http://www.nabble.com/-gsoc--Proposal-for-Generic-Trie%2C-Radix-Tree%2C-and-... Sent from the Boost - Dev mailing list archive at Nabble.com.