template <typename Tree>

class btree_container

Defined at line 40 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

A common base class for btree_set, btree_map, btree_multiset, and

btree_multimap.

Protected Members

Tree tree_

Public Methods

void btree_container<Tree> ()

Constructors/assignments.

Defined at line 77 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void btree_container<Tree> (const key_compare & comp, const allocator_type & alloc)

Defined at line 78 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void btree_container<Tree> (const allocator_type & alloc)

Defined at line 81 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void btree_container<Tree> (const btree_container<Tree> & other)

Defined at line 84 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void btree_container<Tree> (const btree_container<Tree> & other, const allocator_type & alloc)

Defined at line 88 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void btree_container<Tree> (btree_container<Tree> && other)

Defined at line 91 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void btree_container<Tree> (btree_container<Tree> && other, const allocator_type & alloc)

Defined at line 93 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

btree_container<Tree> & operator= (const btree_container<Tree> & other)

Defined at line 96 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

btree_container<Tree> & operator= (btree_container<Tree> && other)

Defined at line 97 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

iterator begin ()

Iterator routines.

Defined at line 101 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

const_iterator begin ()

Defined at line 102 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

const_iterator cbegin ()

Defined at line 105 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

iterator end ()

Defined at line 108 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

const_iterator end ()

Defined at line 109 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

const_iterator cend ()

Defined at line 112 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

reverse_iterator rbegin ()

Defined at line 115 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

const_reverse_iterator rbegin ()

Defined at line 118 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

const_reverse_iterator crbegin ()

Defined at line 121 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

reverse_iterator rend ()

Defined at line 124 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

const_reverse_iterator rend ()

Defined at line 125 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

const_reverse_iterator crend ()

Defined at line 128 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

size_type count (const key_arg<K> & key)

Lookup routines.

Defined at line 134 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

iterator find (const key_arg<K> & key)

Defined at line 139 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

const_iterator find (const key_arg<K> & key)

Defined at line 143 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

bool contains (const key_arg<K> & key)

Defined at line 148 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

iterator lower_bound (const key_arg<K> & key)

Defined at line 152 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

const_iterator lower_bound (const key_arg<K> & key)

Defined at line 156 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

iterator upper_bound (const key_arg<K> & key)

Defined at line 161 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

const_iterator upper_bound (const key_arg<K> & key)

Defined at line 165 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

std::pair<iterator, iterator> equal_range (const key_arg<K> & key)

Defined at line 170 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

std::pair<const_iterator, const_iterator> equal_range (const key_arg<K> & key)

Defined at line 175 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

iterator erase (const_iterator iter)

Erase the specified iterator from the btree. The iterator must be valid

(i.e. not equal to end()). Return an iterator pointing to the node after

the one that was erased (or end() if none exists).

Defined at line 186 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

iterator erase (iterator iter)

Defined at line 189 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

iterator erase (const_iterator first, const_iterator last)

Defined at line 192 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

template <typename K = key_type>

size_type erase (const key_arg<K> & key)

Defined at line 197 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

extract_and_get_next_return_type extract_and_get_next (const_iterator position)

Extract routines.

Defined at line 203 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

node_type extract (iterator position)

Defined at line 212 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

node_type extract (const_iterator position)

Defined at line 220 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void clear ()

Utility routines.

Defined at line 225 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void swap (btree_container<Tree> & other)

Defined at line 226 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void verify ()

Defined at line 227 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

size_type size ()

Size routines.

Defined at line 230 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

size_type max_size ()

Defined at line 231 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

bool empty ()

Defined at line 232 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

allocator_type get_allocator ()

The allocator used by the btree.

Defined at line 260 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

key_compare key_comp ()

The key comparator used by the btree.

Defined at line 263 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

value_compare value_comp ()

Defined at line 264 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

Records

```
class extract_and_get_next_return_type
```

Friends

template <typename Tree>

class btree_access

template <typename State>

State btree_container (State h, const btree_container<Tree> & b)

template <typename Tree>

bool btree_container (const btree_container<Tree> & x, const btree_container<Tree> & y)

template <typename Tree>

bool btree_container (const btree_container<Tree> & x, const btree_container<Tree> & y)

template <typename Tree>

bool btree_container (const btree_container<Tree> & x, const btree_container<Tree> & y)

template <typename Tree>

bool btree_container (const btree_container<Tree> & x, const btree_container<Tree> & y)

template <typename Tree>

bool btree_container (const btree_container<Tree> & x, const btree_container<Tree> & y)

template <typename Tree>

bool btree_container (const btree_container<Tree> & xconst btree_container<Tree> & y)