template <typename Tree>

class btree_container

Defined at line 39 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 76 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 77 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

void btree_container<Tree> (const allocator_type & alloc)

Defined at line 80 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 83 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 87 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

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

Defined at line 90 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 92 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 95 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

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

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

iterator begin ()

Iterator routines.

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

const_iterator begin ()

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

const_iterator cbegin ()

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

iterator end ()

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

const_iterator end ()

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

const_iterator cend ()

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

reverse_iterator rbegin ()

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

const_reverse_iterator rbegin ()

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

const_reverse_iterator crbegin ()

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

reverse_iterator rend ()

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

const_reverse_iterator rend ()

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

const_reverse_iterator crend ()

Defined at line 127 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 133 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 138 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 142 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 147 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 151 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 155 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 160 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 164 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 169 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 174 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 185 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

iterator erase (iterator iter)

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

iterator erase (const_iterator first, const_iterator last)

Defined at line 191 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 196 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 202 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

node_type extract (iterator position)

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

node_type extract (const_iterator position)

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

void clear ()

Utility routines.

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

void swap (btree_container<Tree> & other)

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

void verify ()

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

size_type size ()

Size routines.

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

size_type max_size ()

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

bool empty ()

Defined at line 231 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 259 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 262 of file ../../third_party/abseil-cpp/src/absl/container/internal/btree_container.h

value_compare value_comp ()

Defined at line 263 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)