always_heap_node | When DataT is not trivially constructible |
back_insert_iterator | |
back_push_pop | Extend a back_insert_iterator with postfix operator--, which pops back (this is required to exist for back_insert_sequence:s) |
binary_function | |
const_traits | Standard type traits for const_iterators |
dummy_sequence | A do-nothing BackInsertionSequence |
heap_node | Stores data by managed pointer |
if_c | |
if_c< false, T1, T2 > | |
inorder_seek | Tst in-order iterator |
inplace_node | Stores data in union - requires trivial constructor |
iter_method_forward | Helper 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_wrapper | Creates a bidirectional iterator from a base implementation, which is required to supply the interface |
key_access | Seek 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_base | Behaviourally, 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_traits | Standard type traits for (non-const) iterators |
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 |
search_results_list::iterator | |
size_policy_node | Selects node type by size of DataT - if larger than a pointer, use heap_node, else inplace_node |
structured_map | Structured Map is a Sorted Associative Container that stores objects of type pair<Key, Data> |
structured_map::value_compare | Value comparator, applying the key_compare to the key part of value_type |
structured_multimap | Structured Multimap is a Sorted Associative Container that stores objects of type pair<Key, Data> |
structured_multimap::value_compare | Value comparator, applying the key_compare to the key part of value_type |
structured_multiset | Structured Multiset is a Sorted Associative Container that stores objects of type Key |
structured_set | Structured Set is a Sorted Associative Container that stores objects of type Key |
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 |
ternary_tree::find_result | |
ternary_tree::key_compare | Key comparator, defined in terms of a lexicographical_compare using the char_compare object |
tst_iterator_base | Implements forward and backward iteration in lexical order |