absl::container_internal::btree_container< Tree > Class Template Reference

#include <btree_container.h>

Inheritance diagram for absl::container_internal::btree_container< Tree >:

Public Types
using	allocator_type = typename Tree::allocator_type
using	allocator_type = typename Tree::allocator_type
using	const_iterator = typename Tree::const_iterator
using	const_iterator = typename Tree::const_iterator
using	const_pointer = typename Tree::const_pointer
using	const_pointer = typename Tree::const_pointer
using	const_reference = typename Tree::const_reference
using	const_reference = typename Tree::const_reference
using	const_reverse_iterator = typename Tree::const_reverse_iterator
using	const_reverse_iterator = typename Tree::const_reverse_iterator
using	difference_type = typename Tree::difference_type
using	difference_type = typename Tree::difference_type
using	iterator = typename Tree::iterator
using	iterator = typename Tree::iterator
using	key_compare = typename Tree::key_compare
using	key_compare = typename Tree::original_key_compare
using	key_type = typename Tree::key_type
using	key_type = typename Tree::key_type
using	node_type = typename Tree::node_handle_type
using	node_type = typename Tree::node_handle_type
using	pointer = typename Tree::pointer
using	pointer = typename Tree::pointer
using	reference = typename Tree::reference
using	reference = typename Tree::reference
using	reverse_iterator = typename Tree::reverse_iterator
using	reverse_iterator = typename Tree::reverse_iterator
using	size_type = typename Tree::size_type
using	size_type = typename Tree::size_type
using	value_compare = typename Tree::value_compare
using	value_compare = typename Tree::value_compare
using	value_type = typename Tree::value_type
using	value_type = typename Tree::value_type

Public Member Functions
iterator	begin ()
iterator	begin ()
const_iterator	begin () const
const_iterator	begin () const
	btree_container ()
	btree_container ()
	btree_container (btree_container &&other) noexcept(std::is_nothrow_move_constructible< Tree >::value)=default
	btree_container (btree_container &&other) noexcept(std::is_nothrow_move_constructible< Tree >::value)=default
	btree_container (btree_container &&other, const allocator_type &alloc)
	btree_container (btree_container &&other, const allocator_type &alloc)
	btree_container (const allocator_type &alloc)
	btree_container (const allocator_type &alloc)
	btree_container (const btree_container &other)
	btree_container (const btree_container &other)
	btree_container (const btree_container &other, const allocator_type &alloc)
	btree_container (const btree_container &other, const allocator_type &alloc)
	btree_container (const key_compare &comp, const allocator_type &alloc=allocator_type())
	btree_container (const key_compare &comp, const allocator_type &alloc=allocator_type())
const_iterator	cbegin () const
const_iterator	cbegin () const
const_iterator	cend () const
const_iterator	cend () const
void	clear ()
ABSL_ATTRIBUTE_REINITIALIZES void	clear ()
template<typename K = key_type>
bool	contains (const key_arg< K > &key) const
template<typename K = key_type>
bool	contains (const key_arg< K > &key) const
template<typename K = key_type>
size_type	count (const key_arg< K > &key) const
template<typename K = key_type>
size_type	count (const key_arg< K > &key) const
const_reverse_iterator	crbegin () const
const_reverse_iterator	crbegin () const
const_reverse_iterator	crend () const
const_reverse_iterator	crend () const
bool	empty () const
bool	empty () const
iterator	end ()
iterator	end ()
const_iterator	end () const
const_iterator	end () const
template<typename K = key_type>
std::pair< iterator, iterator >	equal_range (const key_arg< K > &key)
template<typename K = key_type>
std::pair< iterator, iterator >	equal_range (const key_arg< K > &key)
template<typename K = key_type>
std::pair< const_iterator, const_iterator >	equal_range (const key_arg< K > &key) const
template<typename K = key_type>
std::pair< const_iterator, const_iterator >	equal_range (const key_arg< K > &key) const
template<typename K = key_type>
size_type	erase (const key_arg< K > &key)
template<typename K = key_type>
size_type	erase (const key_arg< K > &key)
iterator	erase (const_iterator first, const_iterator last)
iterator	erase (const_iterator first, const_iterator last)
iterator	erase (const_iterator iter)
iterator	erase (const_iterator iter)
iterator	erase (iterator iter)
iterator	erase (iterator iter)
node_type	extract (const_iterator position)
node_type	extract (const_iterator position)
node_type	extract (iterator position)
node_type	extract (iterator position)
template<typename K = key_type>
iterator	find (const key_arg< K > &key)
template<typename K = key_type>
iterator	find (const key_arg< K > &key)
template<typename K = key_type>
const_iterator	find (const key_arg< K > &key) const
template<typename K = key_type>
const_iterator	find (const key_arg< K > &key) const
allocator_type	get_allocator () const
allocator_type	get_allocator () const
key_compare	key_comp () const
key_compare	key_comp () const
template<typename K = key_type>
iterator	lower_bound (const key_arg< K > &key)
template<typename K = key_type>
iterator	lower_bound (const key_arg< K > &key)
template<typename K = key_type>
const_iterator	lower_bound (const key_arg< K > &key) const
template<typename K = key_type>
const_iterator	lower_bound (const key_arg< K > &key) const
size_type	max_size () const
size_type	max_size () const
btree_container &	operator= (btree_container &&other) noexcept(std::is_nothrow_move_assignable< Tree >::value)=default
btree_container &	operator= (btree_container &&other) noexcept(std::is_nothrow_move_assignable< Tree >::value)=default
btree_container &	operator= (const btree_container &other)=default
btree_container &	operator= (const btree_container &other)=default
reverse_iterator	rbegin ()
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
const_reverse_iterator	rbegin () const
reverse_iterator	rend ()
reverse_iterator	rend ()
const_reverse_iterator	rend () const
const_reverse_iterator	rend () const
size_type	size () const
size_type	size () const
void	swap (btree_container &other)
void	swap (btree_container &other)
template<typename K = key_type>
iterator	upper_bound (const key_arg< K > &key)
template<typename K = key_type>
iterator	upper_bound (const key_arg< K > &key)
template<typename K = key_type>
const_iterator	upper_bound (const key_arg< K > &key) const
template<typename K = key_type>
const_iterator	upper_bound (const key_arg< K > &key) const
value_compare	value_comp () const
value_compare	value_comp () const
void	verify () const
void	verify () const

Protected Types
template<class K >
using	key_arg = typename KeyArg< IsTransparent< typename Tree::key_compare >::value >::template type< K, typename Tree::key_type >
template<class K >
using	key_arg = typename KeyArg< params_type::kIsKeyCompareTransparent >::template type< K, typename Tree::key_type >

Protected Attributes
Tree	tree_

Private Types
using	params_type = typename Tree::params_type
using	params_type = typename Tree::params_type

Friends
template<typename State >
State	AbslHashValue (State h, const btree_container &b)
template<typename State >
State	AbslHashValue (State h, const btree_container &b)
struct	btree_access
bool	operator!= (const btree_container &x, const btree_container &y)
bool	operator!= (const btree_container &x, const btree_container &y)
bool	operator< (const btree_container &x, const btree_container &y)
bool	operator< (const btree_container &x, const btree_container &y)
bool	operator<= (const btree_container &x, const btree_container &y)
bool	operator<= (const btree_container &x, const btree_container &y)
bool	operator== (const btree_container &x, const btree_container &y)
bool	operator== (const btree_container &x, const btree_container &y)
bool	operator> (const btree_container &x, const btree_container &y)
bool	operator> (const btree_container &x, const btree_container &y)
bool	operator>= (const btree_container &x, const btree_container &y)
bool	operator>= (const btree_container &x, const btree_container &y)

Detailed Description

template<typename Tree>
class absl::container_internal::btree_container< Tree >

Definition at line 37 of file abseil-cpp/absl/container/internal/btree_container.h.

Member Typedef Documentation

allocator_type [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::allocator_type = typename Tree::allocator_type

Definition at line 56 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

allocator_type [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::allocator_type = typename Tree::allocator_type

Definition at line 57 of file abseil-cpp/absl/container/internal/btree_container.h.

const_iterator [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::const_iterator = typename Tree::const_iterator

Definition at line 62 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

const_iterator [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::const_iterator = typename Tree::const_iterator

Definition at line 63 of file abseil-cpp/absl/container/internal/btree_container.h.

const_pointer [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::const_pointer = typename Tree::const_pointer

Definition at line 60 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

const_pointer [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::const_pointer = typename Tree::const_pointer

Definition at line 61 of file abseil-cpp/absl/container/internal/btree_container.h.

const_reference [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::const_reference = typename Tree::const_reference

Definition at line 58 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

const_reference [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::const_reference = typename Tree::const_reference

Definition at line 59 of file abseil-cpp/absl/container/internal/btree_container.h.

const_reverse_iterator [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::const_reverse_iterator = typename Tree::const_reverse_iterator

Definition at line 64 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

const_reverse_iterator [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::const_reverse_iterator = typename Tree::const_reverse_iterator

Definition at line 65 of file abseil-cpp/absl/container/internal/btree_container.h.

difference_type [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::difference_type = typename Tree::difference_type

Definition at line 53 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

difference_type [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::difference_type = typename Tree::difference_type

Definition at line 54 of file abseil-cpp/absl/container/internal/btree_container.h.

iterator [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::iterator = typename Tree::iterator

Definition at line 61 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

iterator [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::iterator = typename Tree::iterator

Definition at line 62 of file abseil-cpp/absl/container/internal/btree_container.h.

key_arg [1/2]

template<typename Tree >

template<class K >

using absl::container_internal::btree_container< Tree >::key_arg = typename KeyArg<IsTransparent<typename Tree::key_compare>::value>:: template type<K, typename Tree::key_type>

protected

Definition at line 47 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

key_arg [2/2]

template<typename Tree >

template<class K >

using absl::container_internal::btree_container< Tree >::key_arg = typename KeyArg<params_type::kIsKeyCompareTransparent>::template type< K, typename Tree::key_type>

protected

Definition at line 48 of file abseil-cpp/absl/container/internal/btree_container.h.

key_compare [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::key_compare = typename Tree::key_compare

Definition at line 54 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

key_compare [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::key_compare = typename Tree::original_key_compare

Definition at line 55 of file abseil-cpp/absl/container/internal/btree_container.h.

key_type [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::key_type = typename Tree::key_type

Definition at line 50 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

key_type [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::key_type = typename Tree::key_type

Definition at line 51 of file abseil-cpp/absl/container/internal/btree_container.h.

node_type [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::node_type = typename Tree::node_handle_type

Definition at line 65 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

node_type [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::node_type = typename Tree::node_handle_type

Definition at line 66 of file abseil-cpp/absl/container/internal/btree_container.h.

params_type [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::params_type = typename Tree::params_type

private

Definition at line 37 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

params_type [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::params_type = typename Tree::params_type

private

Definition at line 38 of file abseil-cpp/absl/container/internal/btree_container.h.

pointer [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::pointer = typename Tree::pointer

Definition at line 59 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

pointer [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::pointer = typename Tree::pointer

Definition at line 60 of file abseil-cpp/absl/container/internal/btree_container.h.

reference [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::reference = typename Tree::reference

Definition at line 57 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

reference [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::reference = typename Tree::reference

Definition at line 58 of file abseil-cpp/absl/container/internal/btree_container.h.

reverse_iterator [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::reverse_iterator = typename Tree::reverse_iterator

Definition at line 63 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

reverse_iterator [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::reverse_iterator = typename Tree::reverse_iterator

Definition at line 64 of file abseil-cpp/absl/container/internal/btree_container.h.

size_type [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::size_type = typename Tree::size_type

Definition at line 52 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

size_type [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::size_type = typename Tree::size_type

Definition at line 53 of file abseil-cpp/absl/container/internal/btree_container.h.

value_compare [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::value_compare = typename Tree::value_compare

Definition at line 55 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

value_compare [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::value_compare = typename Tree::value_compare

Definition at line 56 of file abseil-cpp/absl/container/internal/btree_container.h.

value_type [1/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::value_type = typename Tree::value_type

Definition at line 51 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

value_type [2/2]

template<typename Tree >

using absl::container_internal::btree_container< Tree >::value_type = typename Tree::value_type

Definition at line 52 of file abseil-cpp/absl/container/internal/btree_container.h.

Constructor & Destructor Documentation

btree_container() [1/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( )

inline

Definition at line 69 of file abseil-cpp/absl/container/internal/btree_container.h.

btree_container() [2/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( const key_compare &  comp, const allocator_type &  alloc = allocator_type()  )

inlineexplicit

Definition at line 70 of file abseil-cpp/absl/container/internal/btree_container.h.

btree_container() [3/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( const allocator_type &  alloc )

inlineexplicit

Definition at line 73 of file abseil-cpp/absl/container/internal/btree_container.h.

btree_container() [4/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( const btree_container< Tree > &  other )

inline

Definition at line 76 of file abseil-cpp/absl/container/internal/btree_container.h.

btree_container() [5/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( const btree_container< Tree > &  other, const allocator_type &  alloc  )

inline

Definition at line 80 of file abseil-cpp/absl/container/internal/btree_container.h.

btree_container() [6/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( btree_container< Tree > &&  other ) const

defaultnoexcept

btree_container() [7/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( btree_container< Tree > &&  other, const allocator_type &  alloc  )

inline

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

btree_container() [8/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( )

inline

Definition at line 68 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

btree_container() [9/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( const key_compare &  comp, const allocator_type &  alloc = allocator_type()  )

inlineexplicit

Definition at line 69 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

btree_container() [10/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( const allocator_type &  alloc )

inlineexplicit

Definition at line 72 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

btree_container() [11/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( const btree_container< Tree > &  other )

inline

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

btree_container() [12/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( const btree_container< Tree > &  other, const allocator_type &  alloc  )

inline

Definition at line 79 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

btree_container() [13/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( btree_container< Tree > &&  other ) const

defaultnoexcept

btree_container() [14/14]

template<typename Tree >

absl::container_internal::btree_container< Tree >::btree_container ( btree_container< Tree > &&  other, const allocator_type &  alloc  )

inline

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

Member Function Documentation

begin() [1/4]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::begin ( )

inline

Definition at line 92 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

begin() [2/4]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::begin ( )

inline

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

begin() [3/4]

template<typename Tree >

const_iterator absl::container_internal::btree_container< Tree >::begin ( ) const

inline

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

begin() [4/4]

template<typename Tree >

const_iterator absl::container_internal::btree_container< Tree >::begin ( ) const

inline

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

cbegin() [1/2]

template<typename Tree >

const_iterator absl::container_internal::btree_container< Tree >::cbegin ( ) const

inline

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

cbegin() [2/2]

template<typename Tree >

const_iterator absl::container_internal::btree_container< Tree >::cbegin ( ) const

inline

Definition at line 95 of file abseil-cpp/absl/container/internal/btree_container.h.

cend() [1/2]

template<typename Tree >

const_iterator absl::container_internal::btree_container< Tree >::cend ( ) const

inline

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

cend() [2/2]

template<typename Tree >

const_iterator absl::container_internal::btree_container< Tree >::cend ( ) const

inline

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

clear() [1/2]

template<typename Tree >

void absl::container_internal::btree_container< Tree >::clear ( )

inline

Definition at line 179 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

clear() [2/2]

template<typename Tree >

ABSL_ATTRIBUTE_REINITIALIZES void absl::container_internal::btree_container< Tree >::clear ( )

inline

Definition at line 181 of file abseil-cpp/absl/container/internal/btree_container.h.

contains() [1/2]

template<typename Tree >

template<typename K = key_type>

bool absl::container_internal::btree_container< Tree >::contains ( const key_arg< K > &  key ) const

inline

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

contains() [2/2]

template<typename Tree >

template<typename K = key_type>

bool absl::container_internal::btree_container< Tree >::contains ( const key_arg< K > &  key ) const

inline

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

count() [1/2]

template<typename Tree >

template<typename K = key_type>

size_type absl::container_internal::btree_container< Tree >::count ( const key_arg< K > &  key ) const

inline

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

count() [2/2]

template<typename Tree >

template<typename K = key_type>

size_type absl::container_internal::btree_container< Tree >::count ( const key_arg< K > &  key ) const

inline

Definition at line 108 of file abseil-cpp/absl/container/internal/btree_container.h.

crbegin() [1/2]

template<typename Tree >

const_reverse_iterator absl::container_internal::btree_container< Tree >::crbegin ( ) const

inline

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

crbegin() [2/2]

template<typename Tree >

const_reverse_iterator absl::container_internal::btree_container< Tree >::crbegin ( ) const

inline

Definition at line 101 of file abseil-cpp/absl/container/internal/btree_container.h.

crend() [1/2]

template<typename Tree >

const_reverse_iterator absl::container_internal::btree_container< Tree >::crend ( ) const

inline

Definition at line 103 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

crend() [2/2]

template<typename Tree >

const_reverse_iterator absl::container_internal::btree_container< Tree >::crend ( ) const

inline

Definition at line 104 of file abseil-cpp/absl/container/internal/btree_container.h.

empty() [1/2]

template<typename Tree >

bool absl::container_internal::btree_container< Tree >::empty ( ) const

inline

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

empty() [2/2]

template<typename Tree >

bool absl::container_internal::btree_container< Tree >::empty ( ) const

inline

Definition at line 188 of file abseil-cpp/absl/container/internal/btree_container.h.

end() [1/4]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::end ( )

inline

Definition at line 95 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

end() [2/4]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::end ( )

inline

Definition at line 96 of file abseil-cpp/absl/container/internal/btree_container.h.

end() [3/4]

template<typename Tree >

const_iterator absl::container_internal::btree_container< Tree >::end ( ) const

inline

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

end() [4/4]

template<typename Tree >

const_iterator absl::container_internal::btree_container< Tree >::end ( ) const

inline

Definition at line 97 of file abseil-cpp/absl/container/internal/btree_container.h.

equal_range() [1/4]

template<typename Tree >

template<typename K = key_type>

std::pair<iterator, iterator> absl::container_internal::btree_container< Tree >::equal_range ( const key_arg< K > &  key )

inline

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

equal_range() [2/4]

template<typename Tree >

template<typename K = key_type>

std::pair<iterator, iterator> absl::container_internal::btree_container< Tree >::equal_range ( const key_arg< K > &  key )

inline

Definition at line 141 of file abseil-cpp/absl/container/internal/btree_container.h.

equal_range() [3/4]

template<typename Tree >

template<typename K = key_type>

std::pair<const_iterator, const_iterator> absl::container_internal::btree_container< Tree >::equal_range ( const key_arg< K > &  key ) const

inline

Definition at line 144 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

equal_range() [4/4]

template<typename Tree >

template<typename K = key_type>

std::pair<const_iterator, const_iterator> absl::container_internal::btree_container< Tree >::equal_range ( const key_arg< K > &  key ) const

inline

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

erase() [1/8]

template<typename Tree >

template<typename K = key_type>

size_type absl::container_internal::btree_container< Tree >::erase ( const key_arg< K > &  key )

inline

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

erase() [2/8]

template<typename Tree >

template<typename K = key_type>

size_type absl::container_internal::btree_container< Tree >::erase ( const key_arg< K > &  key )

inline

Definition at line 162 of file abseil-cpp/absl/container/internal/btree_container.h.

erase() [3/8]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::erase ( const_iterator  first, const_iterator  last  )

inline

Definition at line 157 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

erase() [4/8]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::erase ( const_iterator  first, const_iterator  last  )

inline

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

erase() [5/8]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::erase ( const_iterator  iter )

inline

Definition at line 155 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

erase() [6/8]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::erase ( const_iterator  iter )

inline

Definition at line 156 of file abseil-cpp/absl/container/internal/btree_container.h.

erase() [7/8]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::erase ( iterator  iter )

inline

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

erase() [8/8]

template<typename Tree >

iterator absl::container_internal::btree_container< Tree >::erase ( iterator  iter )

inline

Definition at line 157 of file abseil-cpp/absl/container/internal/btree_container.h.

extract() [1/4]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract ( const_iterator  position )

inline

Definition at line 174 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

extract() [2/4]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract ( const_iterator  position )

inline

Definition at line 176 of file abseil-cpp/absl/container/internal/btree_container.h.

extract() [3/4]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract ( iterator  position )

inline

Definition at line 167 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

extract() [4/4]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract ( iterator  position )

inline

Definition at line 168 of file abseil-cpp/absl/container/internal/btree_container.h.

find() [1/4]

template<typename Tree >

template<typename K = key_type>

iterator absl::container_internal::btree_container< Tree >::find ( const key_arg< K > &  key )

inline

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

find() [2/4]

template<typename Tree >

template<typename K = key_type>

iterator absl::container_internal::btree_container< Tree >::find ( const key_arg< K > &  key )

inline

Definition at line 113 of file abseil-cpp/absl/container/internal/btree_container.h.

find() [3/4]

template<typename Tree >

template<typename K = key_type>

const_iterator absl::container_internal::btree_container< Tree >::find ( const key_arg< K > &  key ) const

inline

Definition at line 116 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

find() [4/4]

template<typename Tree >

template<typename K = key_type>

const_iterator absl::container_internal::btree_container< Tree >::find ( const key_arg< K > &  key ) const

inline

Definition at line 117 of file abseil-cpp/absl/container/internal/btree_container.h.

get_allocator() [1/2]

template<typename Tree >

allocator_type absl::container_internal::btree_container< Tree >::get_allocator ( ) const

inline

Definition at line 214 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

get_allocator() [2/2]

template<typename Tree >

allocator_type absl::container_internal::btree_container< Tree >::get_allocator ( ) const

inline

Definition at line 216 of file abseil-cpp/absl/container/internal/btree_container.h.

key_comp() [1/2]

template<typename Tree >

key_compare absl::container_internal::btree_container< Tree >::key_comp ( ) const

inline

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

key_comp() [2/2]

template<typename Tree >

key_compare absl::container_internal::btree_container< Tree >::key_comp ( ) const

inline

Definition at line 219 of file abseil-cpp/absl/container/internal/btree_container.h.

lower_bound() [1/4]

template<typename Tree >

template<typename K = key_type>

iterator absl::container_internal::btree_container< Tree >::lower_bound ( const key_arg< K > &  key )

inline

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

lower_bound() [2/4]

template<typename Tree >

template<typename K = key_type>

iterator absl::container_internal::btree_container< Tree >::lower_bound ( const key_arg< K > &  key )

inline

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

lower_bound() [3/4]

template<typename Tree >

template<typename K = key_type>

const_iterator absl::container_internal::btree_container< Tree >::lower_bound ( const key_arg< K > &  key ) const

inline

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

lower_bound() [4/4]

template<typename Tree >

template<typename K = key_type>

const_iterator absl::container_internal::btree_container< Tree >::lower_bound ( const key_arg< K > &  key ) const

inline

Definition at line 129 of file abseil-cpp/absl/container/internal/btree_container.h.

max_size() [1/2]

template<typename Tree >

size_type absl::container_internal::btree_container< Tree >::max_size ( ) const

inline

Definition at line 185 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

max_size() [2/2]

template<typename Tree >

size_type absl::container_internal::btree_container< Tree >::max_size ( ) const

inline

Definition at line 187 of file abseil-cpp/absl/container/internal/btree_container.h.

operator=() [1/4]

template<typename Tree >

btree_container& absl::container_internal::btree_container< Tree >::operator= ( btree_container< Tree > &&  other )

defaultnoexcept

operator=() [2/4]

template<typename Tree >

btree_container& absl::container_internal::btree_container< Tree >::operator= ( btree_container< Tree > &&  other )

defaultnoexcept

operator=() [3/4]

template<typename Tree >

btree_container& absl::container_internal::btree_container< Tree >::operator= ( const btree_container< Tree > &  other )

default

operator=() [4/4]

template<typename Tree >

btree_container& absl::container_internal::btree_container< Tree >::operator= ( const btree_container< Tree > &  other )

default

rbegin() [1/4]

template<typename Tree >

reverse_iterator absl::container_internal::btree_container< Tree >::rbegin ( )

inline

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

rbegin() [2/4]

template<typename Tree >

reverse_iterator absl::container_internal::btree_container< Tree >::rbegin ( )

inline

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

rbegin() [3/4]

template<typename Tree >

const_reverse_iterator absl::container_internal::btree_container< Tree >::rbegin ( ) const

inline

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

rbegin() [4/4]

template<typename Tree >

const_reverse_iterator absl::container_internal::btree_container< Tree >::rbegin ( ) const

inline

Definition at line 100 of file abseil-cpp/absl/container/internal/btree_container.h.

rend() [1/4]

template<typename Tree >

reverse_iterator absl::container_internal::btree_container< Tree >::rend ( )

inline

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

rend() [2/4]

template<typename Tree >

reverse_iterator absl::container_internal::btree_container< Tree >::rend ( )

inline

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

rend() [3/4]

template<typename Tree >

const_reverse_iterator absl::container_internal::btree_container< Tree >::rend ( ) const

inline

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

rend() [4/4]

template<typename Tree >

const_reverse_iterator absl::container_internal::btree_container< Tree >::rend ( ) const

inline

Definition at line 103 of file abseil-cpp/absl/container/internal/btree_container.h.

size() [1/2]

template<typename Tree >

size_type absl::container_internal::btree_container< Tree >::size ( ) const

inline

Definition at line 184 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

size() [2/2]

template<typename Tree >

size_type absl::container_internal::btree_container< Tree >::size ( ) const

inline

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

swap() [1/2]

template<typename Tree >

void absl::container_internal::btree_container< Tree >::swap ( btree_container< Tree > &  other )

inline

Definition at line 180 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

swap() [2/2]

template<typename Tree >

void absl::container_internal::btree_container< Tree >::swap ( btree_container< Tree > &  other )

inline

Definition at line 182 of file abseil-cpp/absl/container/internal/btree_container.h.

upper_bound() [1/4]

template<typename Tree >

template<typename K = key_type>

iterator absl::container_internal::btree_container< Tree >::upper_bound ( const key_arg< K > &  key )

inline

Definition at line 132 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

upper_bound() [2/4]

template<typename Tree >

template<typename K = key_type>

iterator absl::container_internal::btree_container< Tree >::upper_bound ( const key_arg< K > &  key )

inline

Definition at line 133 of file abseil-cpp/absl/container/internal/btree_container.h.

upper_bound() [3/4]

template<typename Tree >

template<typename K = key_type>

const_iterator absl::container_internal::btree_container< Tree >::upper_bound ( const key_arg< K > &  key ) const

inline

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

upper_bound() [4/4]

template<typename Tree >

template<typename K = key_type>

const_iterator absl::container_internal::btree_container< Tree >::upper_bound ( const key_arg< K > &  key ) const

inline

Definition at line 137 of file abseil-cpp/absl/container/internal/btree_container.h.

value_comp() [1/2]

template<typename Tree >

value_compare absl::container_internal::btree_container< Tree >::value_comp ( ) const

inline

Definition at line 218 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

value_comp() [2/2]

template<typename Tree >

value_compare absl::container_internal::btree_container< Tree >::value_comp ( ) const

inline

Definition at line 220 of file abseil-cpp/absl/container/internal/btree_container.h.

verify() [1/2]

template<typename Tree >

void absl::container_internal::btree_container< Tree >::verify ( ) const

inline

Definition at line 181 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

verify() [2/2]

template<typename Tree >

void absl::container_internal::btree_container< Tree >::verify ( ) const

inline

Definition at line 183 of file abseil-cpp/absl/container/internal/btree_container.h.

Friends And Related Function Documentation

AbslHashValue [1/2]

template<typename Tree >

template<typename State >

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

friend

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

AbslHashValue [2/2]

template<typename Tree >

template<typename State >

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

friend

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

btree_access

template<typename Tree >

friend struct btree_access

friend

Definition at line 232 of file abseil-cpp/absl/container/internal/btree_container.h.

operator!= [1/2]

template<typename Tree >

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

friend

Definition at line 193 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

operator!= [2/2]

template<typename Tree >

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

friend

Definition at line 195 of file abseil-cpp/absl/container/internal/btree_container.h.

operator< [1/2]

template<typename Tree >

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

friend

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

operator< [2/2]

template<typename Tree >

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

friend

Definition at line 199 of file abseil-cpp/absl/container/internal/btree_container.h.

operator<= [1/2]

template<typename Tree >

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

friend

Definition at line 205 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

operator<= [2/2]

template<typename Tree >

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

friend

Definition at line 207 of file abseil-cpp/absl/container/internal/btree_container.h.

operator== [1/2]

template<typename Tree >

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

friend

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

operator== [2/2]

template<typename Tree >

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

friend

Definition at line 190 of file abseil-cpp/absl/container/internal/btree_container.h.

operator> [1/2]

template<typename Tree >

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

friend

Definition at line 201 of file bloaty/third_party/abseil-cpp/absl/container/internal/btree_container.h.

operator> [2/2]

template<typename Tree >

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

friend

Definition at line 203 of file abseil-cpp/absl/container/internal/btree_container.h.

operator>= [1/2]

template<typename Tree >

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

friend

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

operator>= [2/2]

template<typename Tree >

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

friend

Definition at line 211 of file abseil-cpp/absl/container/internal/btree_container.h.

Member Data Documentation

tree_

template<typename Tree >

Tree absl::container_internal::btree_container< Tree >::tree_

protected

Definition at line 233 of file abseil-cpp/absl/container/internal/btree_container.h.

---

The documentation for this class was generated from the following file:

• abseil-cpp/absl/container/internal/btree_container.h