Overview     Usage     Performance Notes     Links tst 0.68 - 23 Jan 2009

Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
always_heap_nodeWhen DataT is not trivially constructible
back_insert_iterator
back_push_popExtend a back_insert_iterator with postfix operator--, which pops back (this is required to exist for back_insert_sequence:s)
binary_function
const_traitsStandard type traits for const_iterators
dummy_sequenceA do-nothing BackInsertionSequence
heap_nodeStores data by managed pointer
if_c
if_c< false, T1, T2 >
inorder_seekTst in-order iterator
inplace_nodeStores data in union - requires trivial constructor
iter_method_forwardHelper template that forwards the key(), value() public methods from tst_iterator_base to the iterator_wrapper type: iterator_wrapper doesn't inherit from its base_iter, so this class reaches through and forwards the needed methods
iterator_wrapperCreates a bidirectional iterator from a base implementation, which is required to supply the interface
key_accessSeek from node towards root of tree, to extract chars of key that the node represents
levenshtein_search_info
levenshtein_search_info::search
multimap_iterator
multiset_iterator
node_baseBehaviourally, there are 2 1/2 types of nodes:
  • basic node stores a single character, and points on to paths for higher, lower and equal strings
nonconst_traitsStandard type traits for (non-const) iterators
search_results_listVector-like container filled by ternary_tree::partial_match_search or ternary_tree::hamming_search; it contains (items that are convertible to) ternary_tree iterators
search_results_list::iterator
size_policy_nodeSelects node type by size of DataT - if larger than a pointer, use heap_node, else inplace_node
structured_mapStructured Map is a Sorted Associative Container that stores objects of type pair<Key, Data>
structured_map::value_compareValue comparator, applying the key_compare to the key part of value_type
structured_multimapStructured Multimap is a Sorted Associative Container that stores objects of type pair<Key, Data>
structured_multimap::value_compareValue comparator, applying the key_compare to the key part of value_type
structured_multisetStructured Multiset is a Sorted Associative Container that stores objects of type Key
structured_setStructured Set is a Sorted Associative Container that stores objects of type Key
ternary_treeTernary 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
ternary_tree::find_result
ternary_tree::key_compareKey comparator, defined in terms of a lexicographical_compare using the char_compare object
tst_iterator_baseImplements forward and backward iteration in lexical order

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