| allocate(const size_type sz) | phmap::priv::btree< Params > | inlineprivate |
| allocator() const noexcept | phmap::priv::btree< Params > | inlineprivate |
| allocator_type typedef | phmap::priv::btree< Params > | |
| average_bytes_per_value() | phmap::priv::btree< Params > | inlinestatic |
| begin() | phmap::priv::btree< Params > | inline |
| begin() const | phmap::priv::btree< Params > | inline |
| btree(const key_compare &comp, const allocator_type &alloc) | phmap::priv::btree< Params > | |
| btree(const btree &x) | phmap::priv::btree< Params > | |
| btree(btree &&x) noexcept | phmap::priv::btree< Params > | inline |
| bytes_used() const | phmap::priv::btree< Params > | inline |
| clear() | phmap::priv::btree< Params > | |
| compare_keys(const K &x, const LK &y) const | phmap::priv::btree< Params > | inline |
| const_iterator typedef | phmap::priv::btree< Params > | |
| const_pointer typedef | phmap::priv::btree< Params > | |
| const_reference typedef | phmap::priv::btree< Params > | |
| const_reverse_iterator typedef | phmap::priv::btree< Params > | |
| copy_or_move_values_in_order(Btree *x) | phmap::priv::btree< Params > | private |
| count_multi(const K &key) const | phmap::priv::btree< Params > | inline |
| count_unique(const K &key) const | phmap::priv::btree< Params > | inline |
| deallocate(const size_type sz, node_type *node) | phmap::priv::btree< Params > | inlineprivate |
| delete_internal_node(node_type *node) | phmap::priv::btree< Params > | inlineprivate |
| delete_leaf_node(node_type *node) | phmap::priv::btree< Params > | inlineprivate |
| difference_type typedef | phmap::priv::btree< Params > | |
| empty() const | phmap::priv::btree< Params > | inline |
| EmptyNode() | phmap::priv::btree< Params > | inlineprivatestatic |
| end() | phmap::priv::btree< Params > | inline |
| end() const | phmap::priv::btree< Params > | inline |
| equal_range(const K &key) | phmap::priv::btree< Params > | inline |
| equal_range(const K &key) const | phmap::priv::btree< Params > | inline |
| erase(iterator iter) | phmap::priv::btree< Params > | |
| erase(iterator begin, iterator end) | phmap::priv::btree< Params > | |
| erase_from_leaf_node(iterator begin, size_type to_erase) | phmap::priv::btree< Params > | private |
| erase_multi(const K &key) | phmap::priv::btree< Params > | |
| erase_multi(const K &key) -> size_type | phmap::priv::btree< Params > | |
| erase_same_node(iterator begin, iterator end) | phmap::priv::btree< Params > | private |
| erase_unique(const K &key) | phmap::priv::btree< Params > | |
| erase_unique(const K &key) -> size_type | phmap::priv::btree< Params > | |
| find(const K &key) | phmap::priv::btree< Params > | inline |
| find(const K &key) const | phmap::priv::btree< Params > | inline |
| fullness() const | phmap::priv::btree< Params > | inline |
| get_allocator() const | phmap::priv::btree< Params > | inline |
| height() const | phmap::priv::btree< Params > | inline |
| insert_hint_multi(iterator position, ValueType &&v) | phmap::priv::btree< Params > | |
| insert_hint_multi(iterator position, ValueType &&v) -> iterator | phmap::priv::btree< Params > | |
| insert_hint_unique(iterator position, const key_type &key, Args &&... args) | phmap::priv::btree< Params > | |
| insert_hint_unique(iterator position, const key_type &key, Args &&... args) -> std::pair< iterator, bool > | phmap::priv::btree< Params > | inline |
| insert_iterator_multi(InputIterator b, InputIterator e) | phmap::priv::btree< Params > | |
| insert_iterator_unique(InputIterator b, InputIterator e) | phmap::priv::btree< Params > | |
| insert_multi(const key_type &key, ValueType &&v) | phmap::priv::btree< Params > | |
| insert_multi(ValueType &&v) | phmap::priv::btree< Params > | inline |
| insert_multi(const key_type &key, ValueType &&v) -> iterator | phmap::priv::btree< Params > | |
| insert_unique(const key_type &key, Args &&... args) | phmap::priv::btree< Params > | |
| insert_unique(const key_type &key, Args &&... args) -> std::pair< iterator, bool > | phmap::priv::btree< Params > | |
| internal_clear(node_type *node) | phmap::priv::btree< Params > | private |
| internal_emplace(iterator iter, Args &&... args) | phmap::priv::btree< Params > | private |
| internal_emplace(iterator iter, Args &&... args) -> iterator | phmap::priv::btree< Params > | inline |
| internal_end(iterator iter) | phmap::priv::btree< Params > | inlineprivate |
| internal_end(const_iterator iter) const | phmap::priv::btree< Params > | inlineprivate |
| internal_find(const K &key) const | phmap::priv::btree< Params > | private |
| internal_find(const K &key) const -> iterator | phmap::priv::btree< Params > | |
| internal_last(IterType iter) | phmap::priv::btree< Params > | inlineprivatestatic |
| internal_locate(const K &key) const | phmap::priv::btree< Params > | private |
| internal_locate(const K &key) const -> SearchResult< iterator, is_key_compare_to::value > | phmap::priv::btree< Params > | inline |
| internal_locate_impl(const K &key, std::false_type) const | phmap::priv::btree< Params > | private |
| internal_locate_impl(const K &key, std::true_type) const | phmap::priv::btree< Params > | private |
| internal_locate_impl(const K &key, std::false_type) const -> SearchResult< iterator, false > | phmap::priv::btree< Params > | inline |
| internal_locate_impl(const K &key, std::true_type) const -> SearchResult< iterator, true > | phmap::priv::btree< Params > | inline |
| internal_lower_bound(const K &key) const | phmap::priv::btree< Params > | private |
| internal_lower_bound(const K &key) const -> iterator | phmap::priv::btree< Params > | |
| internal_nodes() const | phmap::priv::btree< Params > | inline |
| internal_stats(const node_type *node) const | phmap::priv::btree< Params > | inlineprivate |
| internal_upper_bound(const K &key) const | phmap::priv::btree< Params > | private |
| internal_upper_bound(const K &key) const -> iterator | phmap::priv::btree< Params > | |
| internal_verify(const node_type *node, const key_type *lo, const key_type *hi) const | phmap::priv::btree< Params > | private |
| is_key_compare_to typedef | phmap::priv::btree< Params > | private |
| iterator typedef | phmap::priv::btree< Params > | |
| key_comp() const noexcept | phmap::priv::btree< Params > | inline |
| key_compare typedef | phmap::priv::btree< Params > | |
| key_type typedef | phmap::priv::btree< Params > | |
| kMinNodeValues 枚举值 | phmap::priv::btree< Params > | private |
| kNodeValues 枚举值 | phmap::priv::btree< Params > | private |
| leaf_nodes() const | phmap::priv::btree< Params > | inline |
| leftmost() | phmap::priv::btree< Params > | inlineprivate |
| leftmost() const | phmap::priv::btree< Params > | inlineprivate |
| lower_bound(const K &key) | phmap::priv::btree< Params > | inline |
| lower_bound(const K &key) const | phmap::priv::btree< Params > | inline |
| max_size() const | phmap::priv::btree< Params > | inline |
| maybe_move_from_iterator(const_iterator x) | phmap::priv::btree< Params > | inlineprivate |
| maybe_move_from_iterator(iterator x) | phmap::priv::btree< Params > | inlineprivate |
| merge_nodes(node_type *left, node_type *right) | phmap::priv::btree< Params > | private |
| mutable_allocator() noexcept | phmap::priv::btree< Params > | inlineprivate |
| mutable_key_comp() noexcept | phmap::priv::btree< Params > | inlineprivate |
| mutable_root() noexcept | phmap::priv::btree< Params > | inlineprivate |
| new_internal_node(node_type *parent) | phmap::priv::btree< Params > | inlineprivate |
| new_leaf_node(node_type *parent) | phmap::priv::btree< Params > | inlineprivate |
| new_leaf_root_node(const int max_count) | phmap::priv::btree< Params > | inlineprivate |
| node_handle_type typedef | phmap::priv::btree< Params > | |
| node_type typedef | phmap::priv::btree< Params > | private |
| nodes() const | phmap::priv::btree< Params > | inline |
| operator=(const btree &x) | phmap::priv::btree< Params > | |
| operator=(btree &&x) noexcept | phmap::priv::btree< Params > | |
| overhead() const | phmap::priv::btree< Params > | inline |
| params_type typedef | phmap::priv::btree< Params > | |
| pointer typedef | phmap::priv::btree< Params > | |
| rbegin() | phmap::priv::btree< Params > | inline |
| rbegin() const | phmap::priv::btree< Params > | inline |
| rebalance_after_delete(iterator iter) | phmap::priv::btree< Params > | private |
| rebalance_or_split(iterator *iter) | phmap::priv::btree< Params > | private |
| reference typedef | phmap::priv::btree< Params > | |
| rend() | phmap::priv::btree< Params > | inline |
| rend() const | phmap::priv::btree< Params > | inline |
| reverse_iterator typedef | phmap::priv::btree< Params > | |
| rightmost_ | phmap::priv::btree< Params > | private |
| root() | phmap::priv::btree< Params > | inlineprivate |
| root() const | phmap::priv::btree< Params > | inlineprivate |
| root_ | phmap::priv::btree< Params > | private |
| size() const | phmap::priv::btree< Params > | inline |
| size_ | phmap::priv::btree< Params > | private |
| size_type typedef | phmap::priv::btree< Params > | |
| slot_type typedef | phmap::priv::btree< Params > | |
| static_assert_validation() | phmap::priv::btree< Params > | privatestatic |
| swap(btree &x) | phmap::priv::btree< Params > | |
| testonly_uses_linear_node_search() | phmap::priv::btree< Params > | inlinestatic |
| try_merge_or_rebalance(iterator *iter) | phmap::priv::btree< Params > | private |
| try_shrink() | phmap::priv::btree< Params > | private |
| upper_bound(const K &key) | phmap::priv::btree< Params > | inline |
| upper_bound(const K &key) const | phmap::priv::btree< Params > | inline |
| value_comp() const | phmap::priv::btree< Params > | inline |
| value_compare typedef | phmap::priv::btree< Params > | |
| value_type typedef | phmap::priv::btree< Params > | |
| verify() const | phmap::priv::btree< Params > | |
| ~btree() | phmap::priv::btree< Params > | inline |
1.9.6