Overview     Usage     Performance Notes     Links tst 0.68 - 23 Jan 2009

containers Namespace Reference


Classes

class  ternary_tree
 Ternary search tree (trie) is a sorted container for strings, with advanced search possibilities (wildcard and near-match searches), and fast lookup (similar to hash_map, 3-6 times faster than map) - It is typically used for dictionaries. More...
class  structured_map
 Structured Map is a Sorted Associative Container that stores objects of type pair<Key, Data>. More...
class  structured_multimap
 Structured Multimap is a Sorted Associative Container that stores objects of type pair<Key, Data>. More...
class  structured_set
 Structured Set is a Sorted Associative Container that stores objects of type Key. More...
class  structured_multiset
 Structured Multiset is a Sorted Associative Container that stores objects of type Key. More...
class  search_results_list
 Vector-like container filled by ternary_tree::partial_match_search or ternary_tree::hamming_search; it contains (items that are convertible to) ternary_tree iterators. More...

Namespaces

namespace  tst_detail
namespace  smap_detail
namespace  sset_detail
namespace  util
namespace  tst_erase_impl_detail


ternary_tree 0.68 -- by rasmus ekman -- Page generated with Doxygen 1.5.6 on 23 Jan 2009