template <typename Tree>

class btree_container

Defined at line 37 of file ../../third_party/abseil-cpp/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 74 of file ../../third_party/abseil-cpp/absl/container/internal/btree_container.h

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

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

void btree_container<Tree> (const allocator_type & alloc)

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

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

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

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

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

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

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

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

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

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

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

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

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

iterator begin ()

Iterator routines.

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

const_iterator begin ()

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

const_iterator cbegin ()

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

iterator end ()

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

const_iterator end ()

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

const_iterator cend ()

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

reverse_iterator rbegin ()

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

const_reverse_iterator rbegin ()

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

const_reverse_iterator crbegin ()

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

reverse_iterator rend ()

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

const_reverse_iterator rend ()

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

const_reverse_iterator crend ()

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

template <typename K = key_type>

size_type count (const key_arg<K> & key)

Lookup routines.

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

template <typename K = key_type>

iterator find (const key_arg<K> & key)

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

template <typename K = key_type>

const_iterator find (const key_arg<K> & key)

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

template <typename K = key_type>

bool contains (const key_arg<K> & key)

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

template <typename K = key_type>

iterator lower_bound (const key_arg<K> & key)

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

template <typename K = key_type>

const_iterator lower_bound (const key_arg<K> & key)

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

template <typename K = key_type>

iterator upper_bound (const key_arg<K> & key)

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

template <typename K = key_type>

const_iterator upper_bound (const key_arg<K> & key)

Defined at line 162 of file ../../third_party/abseil-cpp/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 167 of file ../../third_party/abseil-cpp/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 172 of file ../../third_party/abseil-cpp/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 183 of file ../../third_party/abseil-cpp/absl/container/internal/btree_container.h

iterator erase (iterator iter)

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

iterator erase (const_iterator first, const_iterator last)

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

template <typename K = key_type>

size_type erase (const key_arg<K> & key)

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

extract_and_get_next_return_type extract_and_get_next (const_iterator position)

Extract routines.

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

node_type extract (iterator position)

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

node_type extract (const_iterator position)

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

void clear ()

Utility routines.

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

void swap (btree_container<Tree> & other)

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

void verify ()

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

size_type size ()

Size routines.

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

size_type max_size ()

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

bool empty ()

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

allocator_type get_allocator ()

The allocator used by the btree.

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

key_compare key_comp ()

The key comparator used by the btree.

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

value_compare value_comp ()

Defined at line 261 of file ../../third_party/abseil-cpp/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)