- i -

• idle() : ThreadPool
• inc_reference() : CountingPtr< Type, Deleter > , ReferenceCounter
• init() : LoserTreeCopyBase< ValueType, Comparator > , LoserTreeCopyUnguardedBase< ValueType, Comparator > , LoserTreePointerBase< ValueType, Comparator > , LoserTreePointerUnguardedBase< ValueType, Comparator >
• init_winner() : LoserTreeCopyBase< ValueType, Comparator > , LoserTreeCopyUnguardedBase< ValueType, Comparator > , LoserTreePointerBase< ValueType, Comparator > , LoserTreePointerUnguardedBase< ValueType, Comparator >
• initialize() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::InnerNode , BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode , BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::node
• Initialize() : StringSuffixSet
• initialize_() : RadixHeap< ValueType, KeyExtract, KeyType, Radix >
• inner_node_allocator() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >
• insert() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > , btree_map< Key_, Data_, Compare_, Traits_, Alloc_ > , btree_multimap< Key_, Data_, Compare_, Traits_, Alloc_ > , btree_multiset< Key_, Compare_, Traits_, Alloc_ > , btree_set< Key_, Compare_, Traits_, Alloc_ > , SplayTree< Key, Compare, Duplicates, Allocator >
• insert2() : btree_map< Key_, Data_, Compare_, Traits_, Alloc_ > , btree_multimap< Key_, Data_, Compare_, Traits_, Alloc_ >
• insert_descend() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >
• insert_start() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > , LoserTreeCopyBase< ValueType, Comparator > , LoserTreeCopyUnguardedBase< ValueType, Comparator > , LoserTreePointerBase< ValueType, Comparator > , LoserTreePointerUnguardedBase< ValueType, Comparator >
• insertion_sort_cache() : PS5SmallsortJob< Context, StringPtr, BktSizeType >
• insertion_sort_cache_block() : PS5SmallsortJob< Context, StringPtr, BktSizeType >
• int_at_rank() : IntegerRank< Int >
• is_end() : GenericCharStringSet< CharType > , StdStringSet , StringSuffixSet , UPtrStdStringSet
• is_equal() : StringSetBase< StringSet, Traits >
• is_few() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::InnerNode , BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode
• is_full() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::InnerNode , BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode
• is_leafnode() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::node
• is_leq() : StringSetBase< StringSet, Traits >
• is_less() : StringSetBase< StringSet, Traits >
• is_set() : BitArray< Size > , BitArrayRecursive< Size, false > , BitArrayRecursive< Size, true >
• is_underflow() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::InnerNode , BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode
• iterator() : BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::iterator , guarded_iterator< RandomAccessIterator, Comparator > , unguarded_iterator< RandomAccessIterator, Comparator >