- i -

• identity() : pasl::data::algebra::combiner< Algebra1, Algebra2 > , pasl::data::algebra::int_group_under_addition_and_negation< Int > , pasl::data::algebra::trivial , pasl::data::map::take_right_if_nonempty< Option >
• index_of_last_item() : pasl::data::fixedcapacity::base::stack< Array_alloc, Item_alloc >
• index_of_pointer() : pasl::data::chunkedseq::chunk< Fixed_capacity_queue, Cached_measure, Annotation, Pointer_deleter1, Pointer_deep_copier1, Size_access > , pasl::data::fixedcapacity::base::ringbuffer_idx< Array_alloc, Item_alloc > , pasl::data::fixedcapacity::base::ringbuffer_ptr< Array_alloc, Item_alloc > , pasl::data::fixedcapacity::base::ringbuffer_ptrx< Array_alloc, Item_alloc > , pasl::data::fixedcapacity::base::stack< Array_alloc, Item_alloc >
• init() : pasl::data::chunkedseq::chunkedbagbase< Configuration, Iterator >
• initialize() : pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >
• insert() : pasl::data::chunkedseq::chunkedbagbase< Configuration, Iterator > , pasl::data::chunkedseq::chunkedseqbase< Configuration, Iterator >
• inverse() : pasl::data::algebra::combiner< Algebra1, Algebra2 > , pasl::data::algebra::int_group_under_addition_and_negation< Int > , pasl::data::algebra::trivial , pasl::data::map::take_right_if_nonempty< Option >
• is_back() : pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >
• is_branch() : pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::node
• is_buffer() : pasl::data::chunkedseq::chunkedbagbase< Configuration, Iterator >
• is_four() : pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::digit
• is_front() : pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >
• is_leaf() : pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::node
• is_one() : pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::digit