#include <btree_container.h>

Inheritance diagram for absl::container_internal::btree_set_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	insert_return_type = InsertReturnType< iterator, node_type >

using	insert_return_type = InsertReturnType< iterator, node_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 super_type::node_type

using	node_type = typename super_type::node_type

using	size_type = typename Tree::size_type

using	size_type = typename Tree::size_type

using	value_type = typename Tree::value_type

using	value_type = typename Tree::value_type

Public Types inherited from absl::container_internal::btree_container< Tree >
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
	btree_set_container ()

	btree_set_container ()

template<class InputIterator >
	btree_set_container (InputIterator b, InputIterator e, const allocator_type &alloc)

template<class InputIterator >
	btree_set_container (InputIterator b, InputIterator e, const allocator_type &alloc)

template<class InputIterator >
	btree_set_container (InputIterator b, InputIterator e, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())

template<class InputIterator >
	btree_set_container (InputIterator b, InputIterator e, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())

	btree_set_container (std::initializer_list< init_type > init, const allocator_type &alloc)

	btree_set_container (std::initializer_list< init_type > init, const allocator_type &alloc)

	btree_set_container (std::initializer_list< init_type > init, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())

	btree_set_container (std::initializer_list< init_type > init, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())

template<typename... Args>
std::pair< iterator, bool >	emplace (Args &&... args)

template<typename... Args>
std::pair< iterator, bool >	emplace (Args &&... args)

template<typename... Args>
iterator	emplace_hint (const_iterator hint, Args &&... args)

template<typename... Args>
iterator	emplace_hint (const_iterator hint, Args &&... args)

template<typename K = key_type>
node_type	extract (const key_arg< K > &key)

template<typename K = key_type>
node_type	extract (const key_arg< K > &key)

node_type	extract (const_iterator position)

node_type	extract (const_iterator position)

node_type	extract (const_iterator position)

node_type	extract (const_iterator position)

node_type	extract (iterator position)

node_type	extract (iterator position)

node_type	extract (iterator position)

node_type	extract (iterator position)

std::pair< iterator, bool >	insert (const value_type &v)

std::pair< iterator, bool >	insert (const value_type &v)

iterator	insert (const_iterator hint, const value_type &v)

iterator	insert (const_iterator hint, const value_type &v)

iterator	insert (const_iterator hint, node_type &&node)

iterator	insert (const_iterator hint, node_type &&node)

iterator	insert (const_iterator hint, value_type &&v)

iterator	insert (const_iterator hint, value_type &&v)

template<typename InputIterator >
void	insert (InputIterator b, InputIterator e)

template<typename InputIterator >
void	insert (InputIterator b, InputIterator e)

insert_return_type	insert (node_type &&node)

insert_return_type	insert (node_type &&node)

void	insert (std::initializer_list< init_type > init)

void	insert (std::initializer_list< init_type > init)

std::pair< iterator, bool >	insert (value_type &&v)

std::pair< iterator, bool >	insert (value_type &&v)

template<typename T , typename absl::enable_if_t< absl::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container >>::value, int > = 0>
void	merge (btree_container< T > &&src)

template<typename T , typename absl::enable_if_t< absl::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container >>::value, int > = 0>
void	merge (btree_container< T > &&src)

template<typename T , typename absl::enable_if_t< absl::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container >>::value, int > = 0>
void	merge (btree_container< T > &src)

template<typename T , typename absl::enable_if_t< absl::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container >>::value, int > = 0>
void	merge (btree_container< T > &src)

Public Member Functions inherited from absl::container_internal::btree_container< Tree >
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 super_type::template key_arg< K >

template<class K >
using	key_arg = typename super_type::template key_arg< K >

Protected Types inherited from absl::container_internal::btree_container< Tree >
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 >

Private Types
using	init_type = typename params_type::init_type

using	init_type = typename params_type::init_type

using	is_key_compare_to = typename params_type::is_key_compare_to

using	is_key_compare_to = typename params_type::is_key_compare_to

using	params_type = typename Tree::params_type

using	params_type = typename Tree::params_type

using	super_type = btree_container< Tree >

using	super_type = btree_container< Tree >

Friends
class	BtreeNodePeer

Additional Inherited Members
Protected Attributes inherited from absl::container_internal::btree_container< Tree >
Tree	tree_

Detailed Description

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

Definition at line 238 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_set_container< Tree >::allocator_type = typename Tree::allocator_type

Definition at line 251 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_set_container< Tree >::allocator_type = typename Tree::allocator_type

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

◆ const_iterator [1/2]

template<typename Tree >

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

Definition at line 253 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_set_container< Tree >::const_iterator = typename Tree::const_iterator

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

◆ init_type [1/2]

template<typename Tree >

using absl::container_internal::btree_set_container< Tree >::init_type = typename params_type::init_type

private

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

◆ init_type [2/2]

template<typename Tree >

using absl::container_internal::btree_set_container< Tree >::init_type = typename params_type::init_type

private

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

◆ insert_return_type [1/2]

template<typename Tree >

using absl::container_internal::btree_set_container< Tree >::insert_return_type = InsertReturnType<iterator, node_type>

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

◆ insert_return_type [2/2]

template<typename Tree >

using absl::container_internal::btree_set_container< Tree >::insert_return_type = InsertReturnType<iterator, node_type>

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

◆ is_key_compare_to [1/2]

template<typename Tree >

using absl::container_internal::btree_set_container< Tree >::is_key_compare_to = typename params_type::is_key_compare_to

private

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

◆ is_key_compare_to [2/2]

template<typename Tree >

using absl::container_internal::btree_set_container< Tree >::is_key_compare_to = typename params_type::is_key_compare_to

private

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

◆ iterator [1/2]

template<typename Tree >

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

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

◆ iterator [2/2]

template<typename Tree >

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

Definition at line 255 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_set_container< Tree >::key_arg = typename super_type::template key_arg<K>

protected

Definition at line 244 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_set_container< Tree >::key_arg = typename super_type::template key_arg<K>

protected

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

◆ key_compare [1/2]

template<typename Tree >

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

Definition at line 250 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_set_container< Tree >::key_compare = typename Tree::original_key_compare

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

◆ key_type [1/2]

template<typename Tree >

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

Definition at line 247 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_set_container< Tree >::key_type = typename Tree::key_type

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

◆ node_type [1/2]

template<typename Tree >

using absl::container_internal::btree_set_container< Tree >::node_type = typename super_type::node_type

Definition at line 254 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_set_container< Tree >::node_type = typename super_type::node_type

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

◆ params_type [1/2]

template<typename Tree >

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

private

Definition at line 237 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_set_container< Tree >::params_type = typename Tree::params_type

private

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

◆ size_type [1/2]

template<typename Tree >

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

Definition at line 249 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_set_container< Tree >::size_type = typename Tree::size_type

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

◆ super_type [1/2]

template<typename Tree >

using absl::container_internal::btree_set_container< Tree >::super_type = btree_container<Tree>

private

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

◆ super_type [2/2]

template<typename Tree >

using absl::container_internal::btree_set_container< Tree >::super_type = btree_container<Tree>

private

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

◆ value_type [1/2]

template<typename Tree >

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

Definition at line 248 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_set_container< Tree >::value_type = typename Tree::value_type

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

Constructor & Destructor Documentation

◆ btree_set_container() [1/10]

template<typename Tree >

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

inline

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

◆ btree_set_container() [2/10]

template<typename Tree >

template<class InputIterator >

absl::container_internal::btree_set_container< Tree >::btree_set_container	(	InputIterator	b,
		InputIterator	e,
		const key_compare &	comp = `key_compare()`,
		const allocator_type &	alloc = `allocator_type()`
	)

inline

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

◆ btree_set_container() [3/10]

template<typename Tree >

template<class InputIterator >

absl::container_internal::btree_set_container< Tree >::btree_set_container	(	InputIterator	b,
		InputIterator	e,
		const allocator_type &	alloc
	)

inline

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

◆ btree_set_container() [4/10]

template<typename Tree >

absl::container_internal::btree_set_container< Tree >::btree_set_container	(	std::initializer_list< init_type >	init,
		const key_compare &	comp = `key_compare()`,
		const allocator_type &	alloc = `allocator_type()`
	)

inline

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

◆ btree_set_container() [5/10]

template<typename Tree >

absl::container_internal::btree_set_container< Tree >::btree_set_container	(	std::initializer_list< init_type >	init,
		const allocator_type &	alloc
	)

inline

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

◆ btree_set_container() [6/10]

template<typename Tree >

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

inline

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

◆ btree_set_container() [7/10]

template<typename Tree >

template<class InputIterator >

absl::container_internal::btree_set_container< Tree >::btree_set_container	(	InputIterator	b,
		InputIterator	e,
		const key_compare &	comp = `key_compare()`,
		const allocator_type &	alloc = `allocator_type()`
	)

inline

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

◆ btree_set_container() [8/10]

template<typename Tree >

template<class InputIterator >

absl::container_internal::btree_set_container< Tree >::btree_set_container	(	InputIterator	b,
		InputIterator	e,
		const allocator_type &	alloc
	)

inline

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

◆ btree_set_container() [9/10]

template<typename Tree >

absl::container_internal::btree_set_container< Tree >::btree_set_container	(	std::initializer_list< init_type >	init,
		const key_compare &	comp = `key_compare()`,
		const allocator_type &	alloc = `allocator_type()`
	)

inline

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

◆ btree_set_container() [10/10]

template<typename Tree >

absl::container_internal::btree_set_container< Tree >::btree_set_container	(	std::initializer_list< init_type >	init,
		const allocator_type &	alloc
	)

inline

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

Member Function Documentation

◆ emplace() [1/2]

template<typename Tree >

template<typename... Args>

std::pair<iterator, bool> absl::container_internal::btree_set_container< Tree >::emplace ( Args &&... args )

inline

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

◆ emplace() [2/2]

template<typename Tree >

template<typename... Args>

std::pair<iterator, bool> absl::container_internal::btree_set_container< Tree >::emplace ( Args &&... args )

inline

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

◆ emplace_hint() [1/2]

template<typename Tree >

template<typename... Args>

iterator absl::container_internal::btree_set_container< Tree >::emplace_hint	(	const_iterator	hint,
		Args &&...	args
	)

inline

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

◆ emplace_hint() [2/2]

template<typename Tree >

template<typename... Args>

iterator absl::container_internal::btree_set_container< Tree >::emplace_hint	(	const_iterator	hint,
		Args &&...	args
	)

inline

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

◆ extract() [1/10]

template<typename Tree >

template<typename K = key_type>

node_type absl::container_internal::btree_set_container< Tree >::extract ( const key_arg< K > & key )

inline

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

◆ extract() [2/10]

template<typename Tree >

template<typename K = key_type>

node_type absl::container_internal::btree_set_container< Tree >::extract ( const key_arg< K > & key )

inline

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

◆ extract() [3/10]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract

inline

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

◆ extract() [4/10]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract

inline

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

◆ extract() [5/10]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract

inline

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

◆ extract() [6/10]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract

inline

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

◆ extract() [7/10]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract

inline

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

◆ extract() [8/10]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract

inline

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

◆ extract() [9/10]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract

inline

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

◆ extract() [10/10]

template<typename Tree >

node_type absl::container_internal::btree_container< Tree >::extract

inline

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

◆ insert() [1/16]

template<typename Tree >

std::pair<iterator, bool> absl::container_internal::btree_set_container< Tree >::insert ( const value_type & v )

inline

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

◆ insert() [2/16]

template<typename Tree >

std::pair<iterator, bool> absl::container_internal::btree_set_container< Tree >::insert ( const value_type & v )

inline

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

◆ insert() [3/16]

template<typename Tree >

iterator absl::container_internal::btree_set_container< Tree >::insert	(	const_iterator	hint,
		const value_type &	v
	)

inline

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

◆ insert() [4/16]

template<typename Tree >

iterator absl::container_internal::btree_set_container< Tree >::insert	(	const_iterator	hint,
		const value_type &	v
	)

inline

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

◆ insert() [5/16]

template<typename Tree >

iterator absl::container_internal::btree_set_container< Tree >::insert	(	const_iterator	hint,
		node_type &&	node
	)

inline

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

◆ insert() [6/16]

template<typename Tree >

iterator absl::container_internal::btree_set_container< Tree >::insert	(	const_iterator	hint,
		node_type &&	node
	)

inline

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

◆ insert() [7/16]

template<typename Tree >

iterator absl::container_internal::btree_set_container< Tree >::insert	(	const_iterator	hint,
		value_type &&	v
	)

inline

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

◆ insert() [8/16]

template<typename Tree >

iterator absl::container_internal::btree_set_container< Tree >::insert	(	const_iterator	hint,
		value_type &&	v
	)

inline

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

◆ insert() [9/16]

template<typename Tree >

template<typename InputIterator >

void absl::container_internal::btree_set_container< Tree >::insert	(	InputIterator	b,
		InputIterator	e
	)

inline

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

◆ insert() [10/16]

template<typename Tree >

template<typename InputIterator >

void absl::container_internal::btree_set_container< Tree >::insert	(	InputIterator	b,
		InputIterator	e
	)

inline

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

◆ insert() [11/16]

template<typename Tree >

insert_return_type absl::container_internal::btree_set_container< Tree >::insert ( node_type && node )

inline

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

◆ insert() [12/16]

template<typename Tree >

insert_return_type absl::container_internal::btree_set_container< Tree >::insert ( node_type && node )

inline

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

◆ insert() [13/16]

template<typename Tree >

void absl::container_internal::btree_set_container< Tree >::insert ( std::initializer_list< init_type > init )

inline

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

◆ insert() [14/16]

template<typename Tree >

void absl::container_internal::btree_set_container< Tree >::insert ( std::initializer_list< init_type > init )

inline

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

◆ insert() [15/16]

template<typename Tree >

std::pair<iterator, bool> absl::container_internal::btree_set_container< Tree >::insert ( value_type && v )

inline

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

◆ insert() [16/16]

template<typename Tree >

std::pair<iterator, bool> absl::container_internal::btree_set_container< Tree >::insert ( value_type && v )

inline

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

◆ merge() [1/4]

template<typename Tree >

template<typename T , typename absl::enable_if_t< absl::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container >>::value, int > = 0>

void absl::container_internal::btree_set_container< Tree >::merge ( btree_container< T > && src )

inline

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

◆ merge() [2/4]

template<typename Tree >

template<typename T , typename absl::enable_if_t< absl::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container >>::value, int > = 0>

void absl::container_internal::btree_set_container< Tree >::merge ( btree_container< T > && src )

inline

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

◆ merge() [3/4]

template<typename Tree >

template<typename T , typename absl::enable_if_t< absl::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container >>::value, int > = 0>

void absl::container_internal::btree_set_container< Tree >::merge ( btree_container< T > & src )

inline

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

◆ merge() [4/4]

template<typename Tree >

template<typename T , typename absl::enable_if_t< absl::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container >>::value, int > = 0>

void absl::container_internal::btree_set_container< Tree >::merge ( btree_container< T > & src )

inline

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

Friends And Related Function Documentation

◆ BtreeNodePeer

template<typename Tree >

BtreeNodePeer

friend

Definition at line 243 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

Public Types

Public Member Functions

Protected Types

Private Types

Friends

Additional Inherited Members

Detailed Description

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

Member Typedef Documentation

◆ allocator_type [1/2]

◆ allocator_type [2/2]

◆ const_iterator [1/2]

◆ const_iterator [2/2]

◆ init_type [1/2]

◆ init_type [2/2]

◆ insert_return_type [1/2]

◆ insert_return_type [2/2]

◆ is_key_compare_to [1/2]

◆ is_key_compare_to [2/2]

◆ iterator [1/2]

◆ iterator [2/2]

◆ key_arg [1/2]

◆ key_arg [2/2]

◆ key_compare [1/2]

◆ key_compare [2/2]

◆ key_type [1/2]

◆ key_type [2/2]

◆ node_type [1/2]

◆ node_type [2/2]

◆ params_type [1/2]

◆ params_type [2/2]

◆ size_type [1/2]

◆ size_type [2/2]

◆ super_type [1/2]

◆ super_type [2/2]

◆ value_type [1/2]

◆ value_type [2/2]

Constructor & Destructor Documentation

◆ btree_set_container() [1/10]

◆ btree_set_container() [2/10]

◆ btree_set_container() [3/10]

◆ btree_set_container() [4/10]

◆ btree_set_container() [5/10]

◆ btree_set_container() [6/10]

◆ btree_set_container() [7/10]

◆ btree_set_container() [8/10]

◆ btree_set_container() [9/10]

◆ btree_set_container() [10/10]

Member Function Documentation

◆ emplace() [1/2]

◆ emplace() [2/2]

◆ emplace_hint() [1/2]

◆ emplace_hint() [2/2]

◆ extract() [1/10]

◆ extract() [2/10]

◆ extract() [3/10]

◆ extract() [4/10]

◆ extract() [5/10]

◆ extract() [6/10]

◆ extract() [7/10]

◆ extract() [8/10]

◆ extract() [9/10]

◆ extract() [10/10]

◆ insert() [1/16]

◆ insert() [2/16]

◆ insert() [3/16]

◆ insert() [4/16]

◆ insert() [5/16]

◆ insert() [6/16]

◆ insert() [7/16]

◆ insert() [8/16]

◆ insert() [9/16]

◆ insert() [10/16]

◆ insert() [11/16]

◆ insert() [12/16]

◆ insert() [13/16]

◆ insert() [14/16]

◆ insert() [15/16]

◆ insert() [16/16]

◆ merge() [1/4]

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