Overview     Usage     Performance Notes     Links tst 0.68 - 23 Jan 2009

containers::tst_detail Namespace Reference


Classes

struct  dummy_sequence
 A do-nothing BackInsertionSequence. More...
struct  back_push_pop
 Extend a back_insert_iterator with postfix operator--, which pops back (this is required to exist for back_insert_sequence:s). More...
struct  key_access
 Seek from node towards root of tree, to extract chars of key that the node represents. More...
struct  inorder_seek
 tst in-order iterator More...
class  tst_iterator_base
 Implements forward and backward iteration in lexical order. More...
struct  levenshtein_search_info
struct  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. More...
struct  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.
More...
struct  heap_node
 Stores data by managed pointer. More...
struct  inplace_node
 Stores data in union - requires trivial constructor. More...
struct  size_policy_node
 Selects node type by size of DataT - if larger than a pointer, use heap_node, else inplace_node. More...
struct  always_heap_node
 When DataT is not trivially constructible. More...

Namespaces

namespace  mpl_detail
 lame ripoff from boost::mpl::if_ - replace with real thing when boostifying


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