Here is a list of all documented class members with links to the class documentation for each member:

- i -

• initialize() : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node
• innernodes : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats
• innerslotmax : stx::btree_map< _Key, _Data, _Compare, _Traits > , stx::btree_set< _Key, _Compare, _Traits > , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates > , stx::btree_multimap< _Key, _Data, _Compare, _Traits > , stx::btree_multiset< _Key, _Compare, _Traits >
• innerslots : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::dump_header , stx::btree_default_map_traits< _Key, _Data > , stx::btree_default_set_traits< _Key >
• insert() : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates > , stx::btree_multiset< _Key, _Compare, _Traits > , stx::btree_map< _Key, _Data, _Compare, _Traits > , stx::btree_set< _Key, _Compare, _Traits > , stx::btree_map< _Key, _Data, _Compare, _Traits > , stx::btree_multimap< _Key, _Data, _Compare, _Traits > , stx::btree_multiset< _Key, _Compare, _Traits > , stx::btree_set< _Key, _Compare, _Traits > , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
• insert2() : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates > , stx::btree_multimap< _Key, _Data, _Compare, _Traits > , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates > , stx::btree_map< _Key, _Data, _Compare, _Traits > , stx::btree_multimap< _Key, _Data, _Compare, _Traits >
• insert_descend() : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
• insert_start() : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
• isfew() : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node
• isfull() : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node
• isleafnode() : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node
• isunderflow() : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node
• itemcount : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::tree_stats , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::dump_header
• iterator : stx::btree_set< _Key, _Compare, _Traits > , stx::btree_multiset< _Key, _Compare, _Traits > , stx::btree_multimap< _Key, _Data, _Compare, _Traits > , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator , stx::btree_map< _Key, _Data, _Compare, _Traits >
• iterator_category : stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator , stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator

---