absl::container_internal::btree< Params > Class Template Reference

#include <btree.h>

Classes
struct	EmptyNodeType
struct	node_stats

Public Types
using	allocator_type = typename Params::allocator_type
using	allocator_type = typename Params::allocator_type
using	const_iterator = typename iterator::const_iterator
using	const_iterator = typename iterator::const_iterator
using	const_pointer = typename Params::const_pointer
using	const_pointer = typename Params::const_pointer
using	const_reference = typename Params::const_reference
using	const_reference = typename Params::const_reference
using	const_reverse_iterator = std::reverse_iterator< const_iterator >
using	const_reverse_iterator = std::reverse_iterator< const_iterator >
using	difference_type = typename Params::difference_type
using	difference_type = typename Params::difference_type
using	iterator = typename btree_iterator< node_type, reference, pointer >::iterator
using	iterator = typename btree_iterator< node_type, reference, pointer >::iterator
using	key_compare = typename Params::key_compare
using	key_compare = typename Params::key_compare
using	key_type = typename Params::key_type
using	key_type = typename Params::key_type
using	node_handle_type = node_handle< Params, Params, allocator_type >
using	node_handle_type = node_handle< Params, Params, allocator_type >
using	original_key_compare = typename Params::original_key_compare
using	params_type = Params
using	params_type = Params
using	pointer = typename Params::pointer
using	pointer = typename Params::pointer
using	reference = typename Params::reference
using	reference = typename Params::reference
using	reverse_iterator = std::reverse_iterator< iterator >
using	reverse_iterator = std::reverse_iterator< iterator >
using	size_type = typename Params::size_type
using	size_type = typename Params::size_type
using	slot_type = typename Params::slot_type
using	slot_type = typename Params::slot_type
using	value_compare = typename Params::value_compare
using	value_compare = typename Params::value_compare
using	value_type = typename Params::value_type
using	value_type = typename Params::value_type

Public Member Functions
iterator	begin ()
iterator	begin ()
const_iterator	begin () const
const_iterator	begin () const
	btree (btree &&other) noexcept
	btree (btree &&other) noexcept
	btree (btree &&other, const allocator_type &alloc)
	btree (btree &&other, const allocator_type &alloc)
	btree (const btree &other)
	btree (const btree &other)
	btree (const btree &other, const allocator_type &alloc)
	btree (const btree &other, const allocator_type &alloc)
	btree (const key_compare &comp, const allocator_type &alloc)
	btree (const key_compare &comp, const allocator_type &alloc)
size_type	bytes_used () const
size_type	bytes_used () const
void	clear ()
void	clear ()
template<typename K1 , typename K2 >
bool	compare_keys (const K1 &a, const K2 &b) const
template<typename K1 , typename K2 >
bool	compare_keys (const K1 &a, const K2 &b) const
bool	empty () const
bool	empty () const
iterator	end ()
iterator	end ()
const_iterator	end () const
const_iterator	end () const
template<typename K >
std::pair< iterator, iterator >	equal_range (const K &key)
template<typename K >
std::pair< iterator, iterator >	equal_range (const K &key)
template<typename K >
auto	equal_range (const K &key) -> std::pair< iterator, iterator >
template<typename K >
std::pair< const_iterator, const_iterator >	equal_range (const K &key) const
template<typename K >
std::pair< const_iterator, const_iterator >	equal_range (const K &key) const
iterator	erase (iterator iter)
iterator	erase (iterator iter)
std::pair< size_type, iterator >	erase_range (iterator begin, iterator end)
std::pair< size_type, iterator >	erase_range (iterator begin, iterator end)
template<typename K >
iterator	find (const K &key)
template<typename K >
iterator	find (const K &key)
template<typename K >
const_iterator	find (const K &key) const
template<typename K >
const_iterator	find (const K &key) const
double	fullness () const
double	fullness () const
allocator_type	get_allocator () const
allocator_type	get_allocator () const
size_type	height () const
size_type	height () const
template<typename ValueType >
iterator	insert_hint_multi (iterator position, ValueType &&v)
template<typename ValueType >
iterator	insert_hint_multi (iterator position, ValueType &&v)
template<typename ValueType >
auto	insert_hint_multi (iterator position, ValueType &&v) -> iterator
template<typename K , typename... Args>
std::pair< iterator, bool >	insert_hint_unique (iterator position, const K &key, Args &&... args)
template<typename K , typename... Args>
std::pair< iterator, bool >	insert_hint_unique (iterator position, const K &key, Args &&... args)
template<typename K , typename... Args>
auto	insert_hint_unique (iterator position, const K &key, Args &&... args) -> std::pair< iterator, bool >
template<typename InputIterator >
void	insert_iterator_multi (InputIterator b, InputIterator e)
template<typename InputIterator >
void	insert_iterator_multi (InputIterator b, InputIterator e)
template<typename InputIterator >
void	insert_iterator_unique (InputIterator b, InputIterator e, char)
template<typename InputIterator >
void	insert_iterator_unique (InputIterator b, InputIterator e, char)
template<typename InputIterator , typename = decltype(std::declval<const key_compare &>()( params_type::key(*std::declval<InputIterator>()), std::declval<const key_type &>()))>
void	insert_iterator_unique (InputIterator b, InputIterator e, int)
template<typename InputIterator , typename = decltype(std::declval<const key_compare &>()( params_type::key(*std::declval<InputIterator>()), std::declval<const key_type &>()))>
void	insert_iterator_unique (InputIterator b, InputIterator e, int)
template<typename ValueType >
iterator	insert_multi (const key_type &key, ValueType &&v)
template<typename ValueType >
iterator	insert_multi (const key_type &key, ValueType &&v)
template<typename ValueType >
auto	insert_multi (const key_type &key, ValueType &&v) -> iterator
template<typename ValueType >
iterator	insert_multi (ValueType &&v)
template<typename ValueType >
iterator	insert_multi (ValueType &&v)
template<typename K , typename... Args>
std::pair< iterator, bool >	insert_unique (const K &key, Args &&... args)
template<typename K , typename... Args>
std::pair< iterator, bool >	insert_unique (const K &key, Args &&... args)
template<typename K , typename... Args>
auto	insert_unique (const K &key, Args &&... args) -> std::pair< iterator, bool >
template<typename... Args>
auto	internal_emplace (iterator iter, Args &&... args) -> iterator
template<typename K >
auto	internal_find (const K &key) const -> iterator
template<typename K >
auto	internal_locate (const K &key) const -> SearchResult< iterator, is_key_compare_to::value >
template<typename K >
auto	internal_lower_bound (const K &key) const -> SearchResult< iterator, is_key_compare_to::value >
size_type	internal_nodes () const
size_type	internal_nodes () const
template<typename K >
auto	internal_upper_bound (const K &key) const -> iterator
const key_compare &	key_comp () const noexcept
const key_compare &	key_comp () const noexcept
size_type	leaf_nodes () const
size_type	leaf_nodes () const
template<typename K >
iterator	lower_bound (const K &key)
template<typename K >
iterator	lower_bound (const K &key)
template<typename K >
const_iterator	lower_bound (const K &key) const
template<typename K >
const_iterator	lower_bound (const K &key) const
template<typename K >
std::pair< iterator, bool >	lower_bound_equal (const K &key) const
template<typename K >
std::pair< iterator, bool >	lower_bound_equal (const K &key) const
template<typename K >
auto	lower_bound_equal (const K &key) const -> std::pair< iterator, bool >
size_type	max_size () const
size_type	max_size () const
size_type	nodes () const
size_type	nodes () const
btree &	operator= (btree &&other) noexcept
btree &	operator= (btree &&other) noexcept
btree &	operator= (const btree &other)
btree &	operator= (const btree &other)
double	overhead () const
double	overhead () const
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 &other)
void	swap (btree &other)
template<typename K >
iterator	upper_bound (const K &key)
template<typename K >
iterator	upper_bound (const K &key)
template<typename K >
const_iterator	upper_bound (const K &key) const
template<typename K >
const_iterator	upper_bound (const K &key) const
value_compare	value_comp () const
value_compare	value_comp () const
void	verify () const
void	verify () const
	~btree ()
	~btree ()

Static Public Member Functions
static double	average_bytes_per_value ()
static double	average_bytes_per_value ()

Private Types
enum	: uint32_t { kNodeSlots = node_type::kNodeSlots, kMinNodeValues = kNodeSlots / 2 }
enum	: uint32_t { kNodeSlots = node_type::kNodeSlots, kMinNodeValues = kNodeSlots / 2 }
using	field_type = typename node_type::field_type
using	field_type = typename node_type::field_type
using	init_type = typename Params::init_type
using	is_key_compare_to = typename Params::is_key_compare_to
using	is_key_compare_to = typename Params::is_key_compare_to
using	node_type = btree_node< Params >
using	node_type = btree_node< Params >

Private Member Functions
node_type *	allocate (const size_type size)
node_type *	allocate (const size_type size)
const allocator_type &	allocator () const noexcept
const allocator_type &	allocator () const noexcept
template<typename Btree >
void	copy_or_move_values_in_order (Btree &other)
template<typename Btree >
void	copy_or_move_values_in_order (Btree &other)
template<typename... Args>
iterator	internal_emplace (iterator iter, Args &&... args)
template<typename... Args>
iterator	internal_emplace (iterator iter, Args &&... args)
const_iterator	internal_end (const_iterator iter) const
const_iterator	internal_end (const_iterator iter) const
iterator	internal_end (iterator iter)
iterator	internal_end (iterator iter)
template<typename K >
iterator	internal_find (const K &key) const
template<typename K >
iterator	internal_find (const K &key) const
template<typename K >
SearchResult< iterator, is_key_compare_to::value >	internal_locate (const K &key) const
template<typename K >
SearchResult< iterator, is_key_compare_to::value >	internal_locate (const K &key) const
template<typename K >
SearchResult< iterator, is_key_compare_to::value >	internal_lower_bound (const K &key) const
template<typename K >
SearchResult< iterator, is_key_compare_to::value >	internal_lower_bound (const K &key) const
node_stats	internal_stats (const node_type *node) const
node_stats	internal_stats (const node_type *node) const
template<typename K >
iterator	internal_upper_bound (const K &key) const
template<typename K >
iterator	internal_upper_bound (const K &key) const
int	internal_verify (const node_type *node, const key_type *lo, const key_type *hi) const
int	internal_verify (const node_type *node, const key_type *lo, const key_type *hi) const
node_type *	leftmost ()
node_type *	leftmost ()
const node_type *	leftmost () const
const node_type *	leftmost () const
const value_type &	maybe_move_from_iterator (const_iterator it)
value_type &&	maybe_move_from_iterator (iterator it)
void	merge_nodes (node_type *left, node_type *right)
void	merge_nodes (node_type *left, node_type *right)
allocator_type *	mutable_allocator () noexcept
allocator_type *	mutable_allocator () noexcept
key_compare *	mutable_key_comp () noexcept
key_compare *	mutable_key_comp () noexcept
node_type *&	mutable_rightmost () noexcept
node_type *&	mutable_root () noexcept
node_type *&	mutable_root () noexcept
node_type *	new_internal_node (node_type *parent)
node_type *	new_internal_node (node_type *parent)
node_type *	new_leaf_node (node_type *parent)
node_type *	new_leaf_node (node_type *parent)
node_type *	new_leaf_root_node (const int max_count)
node_type *	new_leaf_root_node (const int max_count)
iterator	rebalance_after_delete (iterator iter)
iterator	rebalance_after_delete (iterator iter)
void	rebalance_or_split (iterator *iter)
void	rebalance_or_split (iterator *iter)
node_type *	rightmost ()
const node_type *	rightmost () const
node_type *	root ()
node_type *	root ()
const node_type *	root () const
const node_type *	root () const
bool	try_merge_or_rebalance (iterator *iter)
bool	try_merge_or_rebalance (iterator *iter)
void	try_shrink ()
void	try_shrink ()

Static Private Member Functions
static node_type *	EmptyNode ()
static node_type *	EmptyNode ()
template<typename IterType >
static IterType	internal_last (IterType iter)
template<typename IterType >
static IterType	internal_last (IterType iter)
constexpr static bool	static_assert_validation ()
constexpr static bool	static_assert_validation ()

Private Attributes
node_type *	rightmost_
absl::container_internal::CompressedTuple< key_compare, allocator_type, node_type * >	rightmost_
absl::container_internal::CompressedTuple< key_compare, allocator_type, node_type * >	root_
node_type *	root_
size_type	size_

Friends
struct	btree_access

Detailed Description

template<typename Params>
class absl::container_internal::btree< Params >

Definition at line 1221 of file abseil-cpp/absl/container/internal/btree.h.

Member Typedef Documentation

allocator_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::allocator_type = typename Params::allocator_type

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

allocator_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::allocator_type = typename Params::allocator_type

Definition at line 1290 of file abseil-cpp/absl/container/internal/btree.h.

const_iterator [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::const_iterator = typename iterator::const_iterator

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

const_iterator [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::const_iterator = typename iterator::const_iterator

Definition at line 1297 of file abseil-cpp/absl/container/internal/btree.h.

const_pointer [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::const_pointer = typename Params::const_pointer

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

const_pointer [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::const_pointer = typename Params::const_pointer

Definition at line 1294 of file abseil-cpp/absl/container/internal/btree.h.

const_reference [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::const_reference = typename Params::const_reference

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

const_reference [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::const_reference = typename Params::const_reference

Definition at line 1292 of file abseil-cpp/absl/container/internal/btree.h.

const_reverse_iterator [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::const_reverse_iterator = std::reverse_iterator<const_iterator>

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

const_reverse_iterator [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::const_reverse_iterator = std::reverse_iterator<const_iterator>

Definition at line 1299 of file abseil-cpp/absl/container/internal/btree.h.

difference_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::difference_type = typename Params::difference_type

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

difference_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::difference_type = typename Params::difference_type

Definition at line 1286 of file abseil-cpp/absl/container/internal/btree.h.

field_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::field_type = typename node_type::field_type

private

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

field_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::field_type = typename node_type::field_type

private

Definition at line 1224 of file abseil-cpp/absl/container/internal/btree.h.

init_type

template<typename Params >

using absl::container_internal::btree< Params >::init_type = typename Params::init_type

private

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

is_key_compare_to [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::is_key_compare_to = typename Params::is_key_compare_to

private

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

is_key_compare_to [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::is_key_compare_to = typename Params::is_key_compare_to

private

Definition at line 1223 of file abseil-cpp/absl/container/internal/btree.h.

iterator [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::iterator = typename btree_iterator<node_type, reference, pointer>::iterator

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

iterator [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::iterator = typename btree_iterator<node_type, reference, pointer>::iterator

Definition at line 1296 of file abseil-cpp/absl/container/internal/btree.h.

key_compare [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::key_compare = typename Params::key_compare

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

key_compare [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::key_compare = typename Params::key_compare

Definition at line 1287 of file abseil-cpp/absl/container/internal/btree.h.

key_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::key_type = typename Params::key_type

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

key_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::key_type = typename Params::key_type

Definition at line 1283 of file abseil-cpp/absl/container/internal/btree.h.

node_handle_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::node_handle_type = node_handle<Params, Params, allocator_type>

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

node_handle_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::node_handle_type = node_handle<Params, Params, allocator_type>

Definition at line 1300 of file abseil-cpp/absl/container/internal/btree.h.

node_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::node_type = btree_node<Params>

private

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

node_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::node_type = btree_node<Params>

private

Definition at line 1222 of file abseil-cpp/absl/container/internal/btree.h.

original_key_compare

template<typename Params >

using absl::container_internal::btree< Params >::original_key_compare = typename Params::original_key_compare

Definition at line 1288 of file abseil-cpp/absl/container/internal/btree.h.

params_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::params_type = Params

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

params_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::params_type = Params

Definition at line 1303 of file abseil-cpp/absl/container/internal/btree.h.

pointer [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::pointer = typename Params::pointer

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

pointer [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::pointer = typename Params::pointer

Definition at line 1293 of file abseil-cpp/absl/container/internal/btree.h.

reference [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::reference = typename Params::reference

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

reference [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::reference = typename Params::reference

Definition at line 1291 of file abseil-cpp/absl/container/internal/btree.h.

reverse_iterator [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::reverse_iterator = std::reverse_iterator<iterator>

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

reverse_iterator [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::reverse_iterator = std::reverse_iterator<iterator>

Definition at line 1298 of file abseil-cpp/absl/container/internal/btree.h.

size_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::size_type = typename Params::size_type

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

size_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::size_type = typename Params::size_type

Definition at line 1285 of file abseil-cpp/absl/container/internal/btree.h.

slot_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::slot_type = typename Params::slot_type

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

slot_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::slot_type = typename Params::slot_type

Definition at line 1304 of file abseil-cpp/absl/container/internal/btree.h.

value_compare [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::value_compare = typename Params::value_compare

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

value_compare [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::value_compare = typename Params::value_compare

Definition at line 1289 of file abseil-cpp/absl/container/internal/btree.h.

value_type [1/2]

template<typename Params >

using absl::container_internal::btree< Params >::value_type = typename Params::value_type

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

value_type [2/2]

template<typename Params >

using absl::container_internal::btree< Params >::value_type = typename Params::value_type

Definition at line 1284 of file abseil-cpp/absl/container/internal/btree.h.

Member Enumeration Documentation

anonymous enum

template<typename Params >

anonymous enum : uint32_t

private

Enumerator
kNodeSlots
kMinNodeValues

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

anonymous enum

template<typename Params >

anonymous enum : uint32_t

private

Enumerator
kNodeSlots
kMinNodeValues

Definition at line 1262 of file abseil-cpp/absl/container/internal/btree.h.

Constructor & Destructor Documentation

btree() [1/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( const key_compare &  comp, const allocator_type &  alloc  )

inline

Definition at line 1318 of file abseil-cpp/absl/container/internal/btree.h.

btree() [2/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( const btree< Params > &  other )

inline

Definition at line 1321 of file abseil-cpp/absl/container/internal/btree.h.

btree() [3/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( const btree< Params > &  other, const allocator_type &  alloc  )

inline

Definition at line 1322 of file abseil-cpp/absl/container/internal/btree.h.

btree() [4/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( btree< Params > &&  other )

inlinenoexcept

Definition at line 1326 of file abseil-cpp/absl/container/internal/btree.h.

btree() [5/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( btree< Params > &&  other, const allocator_type &  alloc  )

inline

Definition at line 1332 of file abseil-cpp/absl/container/internal/btree.h.

~btree() [1/2]

template<typename Params >

absl::container_internal::btree< Params >::~btree ( )

inline

Definition at line 1342 of file abseil-cpp/absl/container/internal/btree.h.

btree() [6/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( const key_compare &  comp, const allocator_type &  alloc  )

inline

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

btree() [7/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( const btree< Params > &  other )

inline

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

btree() [8/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( const btree< Params > &  other, const allocator_type &  alloc  )

inline

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

btree() [9/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( btree< Params > &&  other )

inlinenoexcept

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

btree() [10/10]

template<typename Params >

absl::container_internal::btree< Params >::btree ( btree< Params > &&  other, const allocator_type &  alloc  )

inline

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

~btree() [2/2]

template<typename Params >

absl::container_internal::btree< Params >::~btree ( )

inline

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

Member Function Documentation

allocate() [1/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::allocate ( const size_type  size )

inlineprivate

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

allocate() [2/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::allocate ( const size_type  size )

inlineprivate

Definition at line 1603 of file abseil-cpp/absl/container/internal/btree.h.

allocator() [1/2]

template<typename Params >

const allocator_type& absl::container_internal::btree< Params >::allocator ( ) const

inlineprivatenoexcept

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

allocator() [2/2]

template<typename Params >

const allocator_type& absl::container_internal::btree< Params >::allocator ( ) const

inlineprivatenoexcept

Definition at line 1597 of file abseil-cpp/absl/container/internal/btree.h.

average_bytes_per_value() [1/2]

template<typename Params >

static double absl::container_internal::btree< Params >::average_bytes_per_value ( )

inlinestatic

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

average_bytes_per_value() [2/2]

template<typename Params >

static double absl::container_internal::btree< Params >::average_bytes_per_value ( )

inlinestatic

Definition at line 1543 of file abseil-cpp/absl/container/internal/btree.h.

begin() [1/4]

template<typename Params >

iterator absl::container_internal::btree< Params >::begin ( )

inline

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

begin() [2/4]

template<typename Params >

iterator absl::container_internal::btree< Params >::begin ( )

inline

Definition at line 1353 of file abseil-cpp/absl/container/internal/btree.h.

begin() [3/4]

template<typename Params >

const_iterator absl::container_internal::btree< Params >::begin ( ) const

inline

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

begin() [4/4]

template<typename Params >

const_iterator absl::container_internal::btree< Params >::begin ( ) const

inline

Definition at line 1354 of file abseil-cpp/absl/container/internal/btree.h.

bytes_used() [1/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::bytes_used ( ) const

inline

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

bytes_used() [2/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::bytes_used ( ) const

inline

Definition at line 1531 of file abseil-cpp/absl/container/internal/btree.h.

clear() [1/2]

template<typename Params >

void absl::container_internal::btree< Params >::clear

(

)

clear() [2/2]

template<typename P >

void absl::container_internal::btree< P >::clear

Definition at line 2423 of file abseil-cpp/absl/container/internal/btree.h.

compare_keys() [1/2]

template<typename Params >

template<typename K1 , typename K2 >

bool absl::container_internal::btree< Params >::compare_keys ( const K1 &  a, const K2 &  b  ) const

inline

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

compare_keys() [2/2]

template<typename Params >

template<typename K1 , typename K2 >

bool absl::container_internal::btree< Params >::compare_keys ( const K1 &  a, const K2 &  b  ) const

inline

Definition at line 1486 of file abseil-cpp/absl/container/internal/btree.h.

copy_or_move_values_in_order() [1/2]

template<typename Params >

template<typename Btree >

void absl::container_internal::btree< Params >::copy_or_move_values_in_order ( Btree &  other )

private

copy_or_move_values_in_order() [2/2]

template<typename P >

template<typename Btree >

void absl::container_internal::btree< P >::copy_or_move_values_in_order ( Btree &  other )

private

Definition at line 2043 of file abseil-cpp/absl/container/internal/btree.h.

empty() [1/2]

template<typename Params >

bool absl::container_internal::btree< Params >::empty ( ) const

inline

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

empty() [2/2]

template<typename Params >

bool absl::container_internal::btree< Params >::empty ( ) const

inline

Definition at line 1500 of file abseil-cpp/absl/container/internal/btree.h.

EmptyNode() [1/2]

template<typename Params >

static node_type* absl::container_internal::btree< Params >::EmptyNode ( )

inlinestaticprivate

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

EmptyNode() [2/2]

template<typename Params >

static node_type* absl::container_internal::btree< Params >::EmptyNode ( )

inlinestaticprivate

Definition at line 1249 of file abseil-cpp/absl/container/internal/btree.h.

end() [1/4]

template<typename Params >

iterator absl::container_internal::btree< Params >::end ( )

inline

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

end() [2/4]

template<typename Params >

iterator absl::container_internal::btree< Params >::end ( )

inline

Definition at line 1355 of file abseil-cpp/absl/container/internal/btree.h.

end() [3/4]

template<typename Params >

const_iterator absl::container_internal::btree< Params >::end ( ) const

inline

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

end() [4/4]

template<typename Params >

const_iterator absl::container_internal::btree< Params >::end ( ) const

inline

Definition at line 1356 of file abseil-cpp/absl/container/internal/btree.h.

equal_range() [1/5]

template<typename Params >

template<typename K >

std::pair<iterator, iterator> absl::container_internal::btree< Params >::equal_range

(

const K &

key

)

equal_range() [2/5]

template<typename Params >

template<typename K >

std::pair<iterator, iterator> absl::container_internal::btree< Params >::equal_range

(

const K &

key

)

equal_range() [3/5]

template<typename P >

template<typename K >

auto absl::container_internal::btree< P >::equal_range

(

const K &

key

)

-> std::pair<iterator, iterator>

Definition at line 2105 of file abseil-cpp/absl/container/internal/btree.h.

equal_range() [4/5]

template<typename Params >

template<typename K >

std::pair<const_iterator, const_iterator> absl::container_internal::btree< Params >::equal_range ( const K &  key ) const

inline

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

equal_range() [5/5]

template<typename Params >

template<typename K >

std::pair<const_iterator, const_iterator> absl::container_internal::btree< Params >::equal_range ( const K &  key ) const

inline

Definition at line 1399 of file abseil-cpp/absl/container/internal/btree.h.

erase() [1/2]

template<typename Params >

iterator absl::container_internal::btree< Params >::erase

(

iterator

iter

)

erase() [2/2]

template<typename P >

auto absl::container_internal::btree< P >::erase

(

iterator

iter

)

Definition at line 2296 of file abseil-cpp/absl/container/internal/btree.h.

erase_range() [1/2]

template<typename Params >

std::pair<size_type, iterator> absl::container_internal::btree< Params >::erase_range	(	iterator	begin,
		iterator	end
	)

erase_range() [2/2]

template<typename P >

auto absl::container_internal::btree< P >::erase_range	(	iterator	begin,
		iterator	end
	)

Definition at line 2380 of file abseil-cpp/absl/container/internal/btree.h.

find() [1/4]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::find ( const K &  key )

inline

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

find() [2/4]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::find ( const K &  key )

inline

Definition at line 1468 of file abseil-cpp/absl/container/internal/btree.h.

find() [3/4]

template<typename Params >

template<typename K >

const_iterator absl::container_internal::btree< Params >::find ( const K &  key ) const

inline

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

find() [4/4]

template<typename Params >

template<typename K >

const_iterator absl::container_internal::btree< Params >::find ( const K &  key ) const

inline

Definition at line 1472 of file abseil-cpp/absl/container/internal/btree.h.

fullness() [1/2]

template<typename Params >

double absl::container_internal::btree< Params >::fullness ( ) const

inline

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

fullness() [2/2]

template<typename Params >

double absl::container_internal::btree< Params >::fullness ( ) const

inline

Definition at line 1556 of file abseil-cpp/absl/container/internal/btree.h.

get_allocator() [1/2]

template<typename Params >

allocator_type absl::container_internal::btree< Params >::get_allocator ( ) const

inline

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

get_allocator() [2/2]

template<typename Params >

allocator_type absl::container_internal::btree< Params >::get_allocator ( ) const

inline

Definition at line 1571 of file abseil-cpp/absl/container/internal/btree.h.

height() [1/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::height ( ) const

inline

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

height() [2/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::height ( ) const

inline

Definition at line 1503 of file abseil-cpp/absl/container/internal/btree.h.

insert_hint_multi() [1/3]

template<typename Params >

template<typename ValueType >

iterator absl::container_internal::btree< Params >::insert_hint_multi	(	iterator	position,
		ValueType &&	v
	)

insert_hint_multi() [2/3]

template<typename Params >

template<typename ValueType >

iterator absl::container_internal::btree< Params >::insert_hint_multi	(	iterator	position,
		ValueType &&	v
	)

insert_hint_multi() [3/3]

template<typename P >

template<typename ValueType >

auto absl::container_internal::btree< P >::insert_hint_multi	(	iterator	position,
		ValueType &&	v
	)		-> iterator

Definition at line 2219 of file abseil-cpp/absl/container/internal/btree.h.

insert_hint_unique() [1/3]

template<typename Params >

template<typename K , typename... Args>

std::pair<iterator, bool> absl::container_internal::btree< Params >::insert_hint_unique	(	iterator	position,
		const K &	key,
		Args &&...	args
	)

insert_hint_unique() [2/3]

template<typename Params >

template<typename K , typename... Args>

std::pair<iterator, bool> absl::container_internal::btree< Params >::insert_hint_unique	(	iterator	position,
		const K &	key,
		Args &&...	args
	)

insert_hint_unique() [3/3]

template<typename P >

template<typename K , typename... Args>

auto absl::container_internal::btree< P >::insert_hint_unique ( iterator  position, const K &  key, Args &&...  args  ) -> std::pair<iterator, bool>

inline

Definition at line 2160 of file abseil-cpp/absl/container/internal/btree.h.

insert_iterator_multi() [1/2]

template<typename Params >

template<typename InputIterator >

void absl::container_internal::btree< Params >::insert_iterator_multi	(	InputIterator	b,
		InputIterator	e
	)

insert_iterator_multi() [2/2]

template<typename P >

template<typename InputIterator >

void absl::container_internal::btree< P >::insert_iterator_multi	(	InputIterator	b,
		InputIterator	e
	)

Definition at line 2241 of file abseil-cpp/absl/container/internal/btree.h.

insert_iterator_unique() [1/4]

template<typename Params >

template<typename InputIterator >

void absl::container_internal::btree< Params >::insert_iterator_unique	(	InputIterator	b,
		InputIterator	e,
		char
	)

insert_iterator_unique() [2/4]

template<typename P >

template<typename InputIterator >

void absl::container_internal::btree< P >::insert_iterator_unique	(	InputIterator	b,
		InputIterator	e,
		char
	)

Definition at line 2193 of file abseil-cpp/absl/container/internal/btree.h.

insert_iterator_unique() [3/4]

template<typename Params >

template<typename InputIterator , typename = decltype(std::declval<const key_compare &>()( params_type::key(*std::declval<InputIterator>()), std::declval<const key_type &>()))>

void absl::container_internal::btree< Params >::insert_iterator_unique	(	InputIterator	b,
		InputIterator	e,
		int
	)

insert_iterator_unique() [4/4]

template<typename P >

template<typename InputIterator , typename >

void absl::container_internal::btree< P >::insert_iterator_unique	(	InputIterator	b,
		InputIterator	e,
		int
	)

Definition at line 2185 of file abseil-cpp/absl/container/internal/btree.h.

insert_multi() [1/5]

template<typename Params >

template<typename ValueType >

iterator absl::container_internal::btree< Params >::insert_multi	(	const key_type &	key,
		ValueType &&	v
	)

insert_multi() [2/5]

template<typename Params >

template<typename ValueType >

iterator absl::container_internal::btree< Params >::insert_multi	(	const key_type &	key,
		ValueType &&	v
	)

insert_multi() [3/5]

template<typename P >

template<typename ValueType >

auto absl::container_internal::btree< P >::insert_multi	(	const key_type &	key,
		ValueType &&	v
	)		-> iterator

Definition at line 2205 of file abseil-cpp/absl/container/internal/btree.h.

insert_multi() [4/5]

template<typename Params >

template<typename ValueType >

iterator absl::container_internal::btree< Params >::insert_multi ( ValueType &&  v )

inline

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

insert_multi() [5/5]

template<typename Params >

template<typename ValueType >

iterator absl::container_internal::btree< Params >::insert_multi ( ValueType &&  v )

inline

Definition at line 1440 of file abseil-cpp/absl/container/internal/btree.h.

insert_unique() [1/3]

template<typename Params >

template<typename K , typename... Args>

std::pair<iterator, bool> absl::container_internal::btree< Params >::insert_unique	(	const K &	key,
		Args &&...	args
	)

insert_unique() [2/3]

template<typename Params >

template<typename K , typename... Args>

std::pair<iterator, bool> absl::container_internal::btree< Params >::insert_unique	(	const K &	key,
		Args &&...	args
	)

insert_unique() [3/3]

template<typename P >

template<typename K , typename... Args>

auto absl::container_internal::btree< P >::insert_unique	(	const K &	key,
		Args &&...	args
	)		-> std::pair<iterator, bool>

Definition at line 2134 of file abseil-cpp/absl/container/internal/btree.h.

internal_emplace() [1/3]

template<typename Params >

template<typename... Args>

iterator absl::container_internal::btree< Params >::internal_emplace ( iterator  iter, Args &&...  args  )

private

internal_emplace() [2/3]

template<typename Params >

template<typename... Args>

iterator absl::container_internal::btree< Params >::internal_emplace ( iterator  iter, Args &&...  args  )

private

internal_emplace() [3/3]

template<typename P >

template<typename... Args>

auto absl::container_internal::btree< P >::internal_emplace ( iterator  iter, Args &&...  args  ) -> iterator

inline

Definition at line 2658 of file abseil-cpp/absl/container/internal/btree.h.

internal_end() [1/4]

template<typename Params >

const_iterator absl::container_internal::btree< Params >::internal_end ( const_iterator  iter ) const

inlineprivate

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

internal_end() [2/4]

template<typename Params >

const_iterator absl::container_internal::btree< Params >::internal_end ( const_iterator  iter ) const

inlineprivate

Definition at line 1648 of file abseil-cpp/absl/container/internal/btree.h.

internal_end() [3/4]

template<typename Params >

iterator absl::container_internal::btree< Params >::internal_end ( iterator  iter )

inlineprivate

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

internal_end() [4/4]

template<typename Params >

iterator absl::container_internal::btree< Params >::internal_end ( iterator  iter )

inlineprivate

Definition at line 1645 of file abseil-cpp/absl/container/internal/btree.h.

internal_find() [1/3]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::internal_find ( const K &  key ) const

private

internal_find() [2/3]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::internal_find ( const K &  key ) const

private

internal_find() [3/3]

template<typename P >

template<typename K >

auto absl::container_internal::btree< P >::internal_find

(

const K &

key

)

const -> iterator

Definition at line 2763 of file abseil-cpp/absl/container/internal/btree.h.

internal_last() [1/2]

template<typename Params >

template<typename IterType >

static IterType absl::container_internal::btree< Params >::internal_last ( IterType  iter )

staticprivate

internal_last() [2/2]

template<typename P >

template<typename IterType >

IterType absl::container_internal::btree< P >::internal_last ( IterType  iter )

inlinestaticprivate

Definition at line 2642 of file abseil-cpp/absl/container/internal/btree.h.

internal_locate() [1/3]

template<typename Params >

template<typename K >

SearchResult<iterator, is_key_compare_to::value> absl::container_internal::btree< Params >::internal_locate ( const K &  key ) const

private

internal_locate() [2/3]

template<typename Params >

template<typename K >

SearchResult<iterator, is_key_compare_to::value> absl::container_internal::btree< Params >::internal_locate ( const K &  key ) const

private

internal_locate() [3/3]

template<typename P >

template<typename K >

auto absl::container_internal::btree< P >::internal_locate ( const K &  key ) const -> SearchResult<iterator, is_key_compare_to::value>

inline

Definition at line 2698 of file abseil-cpp/absl/container/internal/btree.h.

internal_lower_bound() [1/3]

template<typename Params >

template<typename K >

SearchResult<iterator, is_key_compare_to::value> absl::container_internal::btree< Params >::internal_lower_bound ( const K &  key ) const

private

internal_lower_bound() [2/3]

template<typename Params >

template<typename K >

SearchResult<iterator, is_key_compare_to::value> absl::container_internal::btree< Params >::internal_lower_bound ( const K &  key ) const

private

internal_lower_bound() [3/3]

template<typename P >

template<typename K >

auto absl::container_internal::btree< P >::internal_lower_bound

(

const K &

key

)

const -> SearchResult<iterator, is_key_compare_to::value>

Definition at line 2724 of file abseil-cpp/absl/container/internal/btree.h.

internal_nodes() [1/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::internal_nodes ( ) const

inline

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

internal_nodes() [2/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::internal_nodes ( ) const

inline

Definition at line 1521 of file abseil-cpp/absl/container/internal/btree.h.

internal_stats() [1/2]

template<typename Params >

node_stats absl::container_internal::btree< Params >::internal_stats ( const node_type *  node ) const

inlineprivate

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

internal_stats() [2/2]

template<typename Params >

node_stats absl::container_internal::btree< Params >::internal_stats ( const node_type *  node ) const

inlineprivate

Definition at line 1691 of file abseil-cpp/absl/container/internal/btree.h.

internal_upper_bound() [1/3]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::internal_upper_bound ( const K &  key ) const

private

internal_upper_bound() [2/3]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::internal_upper_bound ( const K &  key ) const

private

internal_upper_bound() [3/3]

template<typename P >

template<typename K >

auto absl::container_internal::btree< P >::internal_upper_bound

(

const K &

key

)

const -> iterator

Definition at line 2749 of file abseil-cpp/absl/container/internal/btree.h.

internal_verify() [1/2]

template<typename Params >

int absl::container_internal::btree< Params >::internal_verify ( const node_type *  node, const key_type *  lo, const key_type *  hi  ) const

private

internal_verify() [2/2]

template<typename P >

int absl::container_internal::btree< P >::internal_verify ( const node_type *  node, const key_type *  lo, const key_type *  hi  ) const

private

Definition at line 2779 of file abseil-cpp/absl/container/internal/btree.h.

key_comp() [1/2]

template<typename Params >

const key_compare& absl::container_internal::btree< Params >::key_comp ( ) const

inlinenoexcept

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

key_comp() [2/2]

template<typename Params >

const key_compare& absl::container_internal::btree< Params >::key_comp ( ) const

inlinenoexcept

Definition at line 1482 of file abseil-cpp/absl/container/internal/btree.h.

leaf_nodes() [1/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::leaf_nodes ( ) const

inline

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

leaf_nodes() [2/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::leaf_nodes ( ) const

inline

Definition at line 1520 of file abseil-cpp/absl/container/internal/btree.h.

leftmost() [1/4]

template<typename Params >

node_type* absl::container_internal::btree< Params >::leftmost ( )

inlineprivate

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

leftmost() [2/4]

template<typename Params >

node_type* absl::container_internal::btree< Params >::leftmost ( )

inlineprivate

Definition at line 1590 of file abseil-cpp/absl/container/internal/btree.h.

leftmost() [3/4]

template<typename Params >

const node_type* absl::container_internal::btree< Params >::leftmost ( ) const

inlineprivate

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

leftmost() [4/4]

template<typename Params >

const node_type* absl::container_internal::btree< Params >::leftmost ( ) const

inlineprivate

Definition at line 1591 of file abseil-cpp/absl/container/internal/btree.h.

lower_bound() [1/4]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::lower_bound ( const K &  key )

inline

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

lower_bound() [2/4]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::lower_bound ( const K &  key )

inline

Definition at line 1370 of file abseil-cpp/absl/container/internal/btree.h.

lower_bound() [3/4]

template<typename Params >

template<typename K >

const_iterator absl::container_internal::btree< Params >::lower_bound ( const K &  key ) const

inline

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

lower_bound() [4/4]

template<typename Params >

template<typename K >

const_iterator absl::container_internal::btree< Params >::lower_bound ( const K &  key ) const

inline

Definition at line 1374 of file abseil-cpp/absl/container/internal/btree.h.

lower_bound_equal() [1/3]

template<typename Params >

template<typename K >

std::pair<iterator, bool> absl::container_internal::btree< Params >::lower_bound_equal

(

const K &

key

)

const

lower_bound_equal() [2/3]

template<typename Params >

template<typename K >

std::pair<iterator, bool> absl::container_internal::btree< Params >::lower_bound_equal

(

const K &

key

)

const

lower_bound_equal() [3/3]

template<typename P >

template<typename K >

auto absl::container_internal::btree< P >::lower_bound_equal

(

const K &

key

)

const -> std::pair<iterator, bool>

Definition at line 2092 of file abseil-cpp/absl/container/internal/btree.h.

max_size() [1/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::max_size ( ) const

inline

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

max_size() [2/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::max_size ( ) const

inline

Definition at line 1499 of file abseil-cpp/absl/container/internal/btree.h.

maybe_move_from_iterator() [1/2]

template<typename Params >

const value_type& absl::container_internal::btree< Params >::maybe_move_from_iterator ( const_iterator  it )

inlineprivate

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

maybe_move_from_iterator() [2/2]

template<typename Params >

value_type&& absl::container_internal::btree< Params >::maybe_move_from_iterator ( iterator  it )

inlineprivate

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

merge_nodes() [1/2]

template<typename Params >

void absl::container_internal::btree< Params >::merge_nodes ( node_type *  left, node_type *  right  )

private

merge_nodes() [2/2]

template<typename P >

void absl::container_internal::btree< P >::merge_nodes ( node_type *  left, node_type *  right  )

private

Definition at line 2564 of file abseil-cpp/absl/container/internal/btree.h.

mutable_allocator() [1/2]

template<typename Params >

allocator_type* absl::container_internal::btree< Params >::mutable_allocator ( )

inlineprivatenoexcept

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

mutable_allocator() [2/2]

template<typename Params >

allocator_type* absl::container_internal::btree< Params >::mutable_allocator ( )

inlineprivatenoexcept

Definition at line 1594 of file abseil-cpp/absl/container/internal/btree.h.

mutable_key_comp() [1/2]

template<typename Params >

key_compare* absl::container_internal::btree< Params >::mutable_key_comp ( )

inlineprivatenoexcept

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

mutable_key_comp() [2/2]

template<typename Params >

key_compare* absl::container_internal::btree< Params >::mutable_key_comp ( )

inlineprivatenoexcept

Definition at line 1585 of file abseil-cpp/absl/container/internal/btree.h.

mutable_rightmost()

template<typename Params >

node_type*& absl::container_internal::btree< Params >::mutable_rightmost ( )

inlineprivatenoexcept

Definition at line 1582 of file abseil-cpp/absl/container/internal/btree.h.

mutable_root() [1/2]

template<typename Params >

node_type*& absl::container_internal::btree< Params >::mutable_root ( )

inlineprivatenoexcept

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

mutable_root() [2/2]

template<typename Params >

node_type*& absl::container_internal::btree< Params >::mutable_root ( )

inlineprivatenoexcept

Definition at line 1579 of file abseil-cpp/absl/container/internal/btree.h.

new_internal_node() [1/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::new_internal_node ( node_type *  parent )

inlineprivate

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

new_internal_node() [2/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::new_internal_node ( node_type *  parent )

inlineprivate

Definition at line 1610 of file abseil-cpp/absl/container/internal/btree.h.

new_leaf_node() [1/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::new_leaf_node ( node_type *  parent )

inlineprivate

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

new_leaf_node() [2/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::new_leaf_node ( node_type *  parent )

inlineprivate

Definition at line 1615 of file abseil-cpp/absl/container/internal/btree.h.

new_leaf_root_node() [1/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::new_leaf_root_node ( const int  max_count )

inlineprivate

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

new_leaf_root_node() [2/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::new_leaf_root_node ( const int  max_count )

inlineprivate

Definition at line 1620 of file abseil-cpp/absl/container/internal/btree.h.

nodes() [1/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::nodes ( ) const

inline

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

nodes() [2/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::nodes ( ) const

inline

Definition at line 1524 of file abseil-cpp/absl/container/internal/btree.h.

operator=() [1/4]

template<typename Params >

btree& absl::container_internal::btree< Params >::operator= ( btree< Params > &&  other )

noexcept

operator=() [2/4]

template<typename P >

auto absl::container_internal::btree< P >::operator= ( btree< Params > &&  other )

noexcept

Definition at line 2264 of file abseil-cpp/absl/container/internal/btree.h.

operator=() [3/4]

template<typename Params >

btree& absl::container_internal::btree< Params >::operator=

(

const btree< Params > &

other

)

operator=() [4/4]

template<typename P >

auto absl::container_internal::btree< P >::operator=

(

const btree< Params > &

other

)

Definition at line 2248 of file abseil-cpp/absl/container/internal/btree.h.

overhead() [1/2]

template<typename Params >

double absl::container_internal::btree< Params >::overhead ( ) const

inline

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

overhead() [2/2]

template<typename Params >

double absl::container_internal::btree< Params >::overhead ( ) const

inline

Definition at line 1564 of file abseil-cpp/absl/container/internal/btree.h.

rbegin() [1/4]

template<typename Params >

reverse_iterator absl::container_internal::btree< Params >::rbegin ( )

inline

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

rbegin() [2/4]

template<typename Params >

reverse_iterator absl::container_internal::btree< Params >::rbegin ( )

inline

Definition at line 1359 of file abseil-cpp/absl/container/internal/btree.h.

rbegin() [3/4]

template<typename Params >

const_reverse_iterator absl::container_internal::btree< Params >::rbegin ( ) const

inline

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

rbegin() [4/4]

template<typename Params >

const_reverse_iterator absl::container_internal::btree< Params >::rbegin ( ) const

inline

Definition at line 1360 of file abseil-cpp/absl/container/internal/btree.h.

rebalance_after_delete() [1/2]

template<typename Params >

iterator absl::container_internal::btree< Params >::rebalance_after_delete ( iterator  iter )

private

rebalance_after_delete() [2/2]

template<typename P >

auto absl::container_internal::btree< P >::rebalance_after_delete ( iterator  iter )

private

Definition at line 2339 of file abseil-cpp/absl/container/internal/btree.h.

rebalance_or_split() [1/2]

template<typename Params >

void absl::container_internal::btree< Params >::rebalance_or_split ( iterator *  iter )

private

rebalance_or_split() [2/2]

template<typename P >

void absl::container_internal::btree< P >::rebalance_or_split ( iterator *  iter )

private

Definition at line 2461 of file abseil-cpp/absl/container/internal/btree.h.

rend() [1/4]

template<typename Params >

reverse_iterator absl::container_internal::btree< Params >::rend ( )

inline

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

rend() [2/4]

template<typename Params >

reverse_iterator absl::container_internal::btree< Params >::rend ( )

inline

Definition at line 1363 of file abseil-cpp/absl/container/internal/btree.h.

rend() [3/4]

template<typename Params >

const_reverse_iterator absl::container_internal::btree< Params >::rend ( ) const

inline

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

rend() [4/4]

template<typename Params >

const_reverse_iterator absl::container_internal::btree< Params >::rend ( ) const

inline

Definition at line 1364 of file abseil-cpp/absl/container/internal/btree.h.

rightmost() [1/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::rightmost ( )

inlineprivate

Definition at line 1580 of file abseil-cpp/absl/container/internal/btree.h.

rightmost() [2/2]

template<typename Params >

const node_type* absl::container_internal::btree< Params >::rightmost ( ) const

inlineprivate

Definition at line 1581 of file abseil-cpp/absl/container/internal/btree.h.

root() [1/4]

template<typename Params >

node_type* absl::container_internal::btree< Params >::root ( )

inlineprivate

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

root() [2/4]

template<typename Params >

node_type* absl::container_internal::btree< Params >::root ( )

inlineprivate

Definition at line 1577 of file abseil-cpp/absl/container/internal/btree.h.

root() [3/4]

template<typename Params >

const node_type* absl::container_internal::btree< Params >::root ( ) const

inlineprivate

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

root() [4/4]

template<typename Params >

const node_type* absl::container_internal::btree< Params >::root ( ) const

inlineprivate

Definition at line 1578 of file abseil-cpp/absl/container/internal/btree.h.

size() [1/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::size ( ) const

inline

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

size() [2/2]

template<typename Params >

size_type absl::container_internal::btree< Params >::size ( ) const

inline

Definition at line 1498 of file abseil-cpp/absl/container/internal/btree.h.

static_assert_validation() [1/2]

template<typename Params >

constexpr static bool absl::container_internal::btree< Params >::static_assert_validation ( )

staticconstexprprivate

static_assert_validation() [2/2]

template<typename P >

constexpr bool absl::container_internal::btree< P >::static_assert_validation

staticconstexprprivate

Definition at line 2063 of file abseil-cpp/absl/container/internal/btree.h.

swap() [1/2]

template<typename Params >

void absl::container_internal::btree< Params >::swap

(

btree< Params > &

other

)

swap() [2/2]

template<typename P >

void absl::container_internal::btree< P >::swap

(

btree< Params > &

other

)

Definition at line 2432 of file abseil-cpp/absl/container/internal/btree.h.

try_merge_or_rebalance() [1/2]

template<typename Params >

bool absl::container_internal::btree< Params >::try_merge_or_rebalance ( iterator *  iter )

private

try_merge_or_rebalance() [2/2]

template<typename P >

bool absl::container_internal::btree< P >::try_merge_or_rebalance ( iterator *  iter )

private

Definition at line 2570 of file abseil-cpp/absl/container/internal/btree.h.

try_shrink() [1/2]

template<typename Params >

void absl::container_internal::btree< Params >::try_shrink ( )

private

try_shrink() [2/2]

template<typename P >

void absl::container_internal::btree< P >::try_shrink

private

Definition at line 2623 of file abseil-cpp/absl/container/internal/btree.h.

upper_bound() [1/4]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::upper_bound ( const K &  key )

inline

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

upper_bound() [2/4]

template<typename Params >

template<typename K >

iterator absl::container_internal::btree< Params >::upper_bound ( const K &  key )

inline

Definition at line 1385 of file abseil-cpp/absl/container/internal/btree.h.

upper_bound() [3/4]

template<typename Params >

template<typename K >

const_iterator absl::container_internal::btree< Params >::upper_bound ( const K &  key ) const

inline

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

upper_bound() [4/4]

template<typename Params >

template<typename K >

const_iterator absl::container_internal::btree< Params >::upper_bound ( const K &  key ) const

inline

Definition at line 1389 of file abseil-cpp/absl/container/internal/btree.h.

value_comp() [1/2]

template<typename Params >

value_compare absl::container_internal::btree< Params >::value_comp ( ) const

inline

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

value_comp() [2/2]

template<typename Params >

value_compare absl::container_internal::btree< Params >::value_comp ( ) const

inline

Definition at line 1490 of file abseil-cpp/absl/container/internal/btree.h.

verify() [1/2]

template<typename Params >

void absl::container_internal::btree< Params >::verify

(

)

const

verify() [2/2]

template<typename P >

void absl::container_internal::btree< P >::verify

Definition at line 2449 of file abseil-cpp/absl/container/internal/btree.h.

Friends And Related Function Documentation

btree_access

template<typename Params >

friend struct btree_access

friend

Definition at line 1574 of file abseil-cpp/absl/container/internal/btree.h.

Member Data Documentation

rightmost_ [1/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::rightmost_

private

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

rightmost_ [2/2]

template<typename Params >

absl::container_internal::CompressedTuple<key_compare, allocator_type, node_type *> absl::container_internal::btree< Params >::rightmost_

private

Definition at line 1713 of file abseil-cpp/absl/container/internal/btree.h.

root_ [1/2]

template<typename Params >

absl::container_internal::CompressedTuple<key_compare, allocator_type, node_type *> absl::container_internal::btree< Params >::root_

private

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

root_ [2/2]

template<typename Params >

node_type* absl::container_internal::btree< Params >::root_

private

Definition at line 1706 of file abseil-cpp/absl/container/internal/btree.h.

size_

template<typename Params >

size_type absl::container_internal::btree< Params >::size_

private

Definition at line 1716 of file abseil-cpp/absl/container/internal/btree.h.

---

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

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