patl

Major features STL-compatible, high-performance template containers and auxiliary classes useful for stringology with fine-grained low level design Library features set & map containers with trie (digital/radix search tree) functionality - trie_set & trie_map; set & map containers with linear time & space online suffix tree functionality - suffix_set & suffix_map - 16 bytes per symbol, alphabet-independent; bunch of iterators over each type of containers - standard (const_)(reverse_)iterator, special (const_)(post|pre)order_iterator for post- and preorder traversal, partial match iterators (const_)partimator and suffix_cont-special match_iterator & (super_)maxrep_iterator for linear-time matching statistics and (super)maximal repeats; partimator"s can be