class btree_iterator

template <typename N, typename R, typename P>

class btree_iterator

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

Public Methods

void btree_iterator<Node, Reference, Pointer> ()

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

void btree_iterator<Node, Reference, Pointer> (Node * n)

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

void btree_iterator<Node, Reference, Pointer> (Node * n, int p)

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

template <typename N, typename R, typename P, absl::enable_if_t<
                                    std::is_same<btree_iterator<N, R, P>, iterator>::value &&
                                        std::is_same<btree_iterator, const_iterator>::value,
                                    int> = 0>
void btree_iterator<Node, Reference, Pointer> (const btree_iterator<N, R, P> other)

NOTE: this SFINAE allows for implicit conversions from iterator to

const_iterator, but it specifically avoids hiding the copy constructor so

that the trivial one will be used when possible.

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

bool operator== (const iterator & other)

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

bool operator== (const const_iterator & other)

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

bool operator!= (const iterator & other)

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

bool operator!= (const const_iterator & other)

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

difference_type operator- (const_iterator other)

Returns n such that n calls to ++other yields *this.

Precondition: n exists.

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

btree_iterator<Node, Reference, Pointer> & operator+= (difference_type n)

Advances the iterator by `n`. Values of `n` must not result in going past

the `end` iterator (for a positive `n`) or before the `begin` iterator (for

a negative `n`).

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

btree_iterator<Node, Reference, Pointer> & operator-= (difference_type n)

Moves the iterator by `n` positions backwards. Values of `n` must not

result in going before the `begin` iterator (for a positive `n`) or past

the `end` iterator (for a negative `n`).

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

reference operator* ()

Accessors for the key/value the iterator is pointing at.

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

pointer operator-> ()

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

btree_iterator<Node, Reference, Pointer> & operator++ ()

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

btree_iterator<Node, Reference, Pointer> & operator-- ()

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

btree_iterator<Node, Reference, Pointer> operator++ (int )

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

btree_iterator<Node, Reference, Pointer> operator-- (int )

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

Friends

template <typename N, typename R, typename P>
class btree_access
template <typename TreeType, typename CheckerType>
class base_checker
template <typename Tree>
class btree_multiset_container
template <typename Tree>
class btree_map_container
template <typename Tree>
class btree_set_container
template <typename Tree>
class btree_container
template <typename Params>
class btree