#include <btree_container.h>

Inheritance diagram for absl::container_internal::btree_map_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	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	mapped_type = typename params_type::mapped_type

using	mapped_type = typename params_type::mapped_type

using	value_type = typename Tree::value_type

using	value_type = typename Tree::value_type

Public Types inherited from absl::container_internal::btree_set_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	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
template<typename K = key_type>
mapped_type &	at (const key_arg< K > &key)

template<typename K = key_type>
mapped_type &	at (const key_arg< K > &key)

template<typename K = key_type>
const mapped_type &	at (const key_arg< K > &key) const

template<typename K = key_type>
const mapped_type &	at (const key_arg< K > &key) const

	btree_map_container ()

	btree_map_container ()

template<typename K = key_type, class M >
std::pair< iterator, bool >	insert_or_assign (const key_arg< K > &k, const M &obj)

template<typename K = key_type, class M >
std::pair< iterator, bool >	insert_or_assign (const key_arg< K > &k, const M &obj)

template<typename K = key_type, class M , M * = nullptr>
std::pair< iterator, bool >	insert_or_assign (const key_arg< K > &k, M &&obj)

template<typename K = key_type, class M , M * = nullptr>
std::pair< iterator, bool >	insert_or_assign (const key_arg< K > &k, M &&obj)

template<typename K = key_type, class M >
iterator	insert_or_assign (const_iterator hint, const key_arg< K > &k, const M &obj)

template<typename K = key_type, class M >
iterator	insert_or_assign (const_iterator hint, const key_arg< K > &k, const M &obj)

template<typename K = key_type, class M , M * = nullptr>
iterator	insert_or_assign (const_iterator hint, const key_arg< K > &k, M &&obj)

template<typename K = key_type, class M , M * = nullptr>
iterator	insert_or_assign (const_iterator hint, const key_arg< K > &k, M &&obj)

template<typename K = key_type, class M , K * = nullptr>
iterator	insert_or_assign (const_iterator hint, key_arg< K > &&k, const M &obj)

template<typename K = key_type, class M , K * = nullptr>
iterator	insert_or_assign (const_iterator hint, key_arg< K > &&k, const M &obj)

template<typename K = key_type, class M , K * = nullptr, M * = nullptr>
iterator	insert_or_assign (const_iterator hint, key_arg< K > &&k, M &&obj)

template<typename K = key_type, class M , K * = nullptr, M * = nullptr>
iterator	insert_or_assign (const_iterator hint, key_arg< K > &&k, M &&obj)

template<typename K = key_type, class M , K * = nullptr>
std::pair< iterator, bool >	insert_or_assign (key_arg< K > &&k, const M &obj)

template<typename K = key_type, class M , K * = nullptr>
std::pair< iterator, bool >	insert_or_assign (key_arg< K > &&k, const M &obj)

template<typename K = key_type, class M , K * = nullptr, M * = nullptr>
std::pair< iterator, bool >	insert_or_assign (key_arg< K > &&k, M &&obj)

template<typename K = key_type, class M , K * = nullptr, M * = nullptr>
std::pair< iterator, bool >	insert_or_assign (key_arg< K > &&k, M &&obj)

template<typename K = key_type>
mapped_type &	operator[] (const key_arg< K > &k)

template<typename K = key_type>
mapped_type &	operator[] (const key_arg< K > &k)

template<typename K = key_type>
mapped_type &	operator[] (key_arg< K > &&k)

template<typename K = key_type>
mapped_type &	operator[] (key_arg< K > &&k)

template<typename K = key_type, typename... Args, typename absl::enable_if_t< !std::is_convertible< K, const_iterator >::value, int > = 0>
std::pair< iterator, bool >	try_emplace (const key_arg< K > &k, Args &&... args)

template<typename K = key_type, typename... Args, typename absl::enable_if_t< !std::is_convertible< K, const_iterator >::value, int > = 0>
std::pair< iterator, bool >	try_emplace (const key_arg< K > &k, Args &&... args)

template<typename K = key_type, typename... Args>
iterator	try_emplace (const_iterator hint, const key_arg< K > &k, Args &&... args)

template<typename K = key_type, typename... Args>
iterator	try_emplace (const_iterator hint, const key_arg< K > &k, Args &&... args)

template<typename K = key_type, typename... Args>
iterator	try_emplace (const_iterator hint, key_arg< K > &&k, Args &&... args)

template<typename K = key_type, typename... Args>
iterator	try_emplace (const_iterator hint, key_arg< K > &&k, Args &&... args)

template<typename K = key_type, typename... Args, typename absl::enable_if_t< !std::is_convertible< K, const_iterator >::value, int > = 0>
std::pair< iterator, bool >	try_emplace (key_arg< K > &&k, Args &&... args)

template<typename K = key_type, typename... Args, typename absl::enable_if_t< !std::is_convertible< K, const_iterator >::value, int > = 0>
std::pair< iterator, bool >	try_emplace (key_arg< K > &&k, Args &&... args)

Public Member Functions inherited from absl::container_internal::btree_set_container< Tree >
	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

Private 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 >

using	params_type = typename Tree::params_type

using	params_type = typename Tree::params_type

using	super_type = btree_set_container< Tree >

using	super_type = btree_set_container< Tree >

Private Member Functions
template<class K , class M >
iterator	insert_or_assign_hint_impl (const_iterator hint, K &&k, M &&obj)

template<class K , class M >
iterator	insert_or_assign_hint_impl (const_iterator hint, K &&k, M &&obj)

template<class K , class M >
std::pair< iterator, bool >	insert_or_assign_impl (K &&k, M &&obj)

template<class K , class M >
std::pair< iterator, bool >	insert_or_assign_impl (K &&k, M &&obj)

template<class K , class... Args>
iterator	try_emplace_hint_impl (const_iterator hint, K &&k, Args &&... args)

template<class K , class... Args>
iterator	try_emplace_hint_impl (const_iterator hint, K &&k, Args &&... args)

template<class K , class... Args>
std::pair< iterator, bool >	try_emplace_impl (K &&k, Args &&... args)

template<class K , class... Args>
std::pair< iterator, bool >	try_emplace_impl (K &&k, Args &&... args)

Friends
class	BtreeNodePeer

Additional Inherited Members
Protected Types inherited from absl::container_internal::btree_set_container< Tree >
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 >

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

Detailed Description

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

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

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

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

◆ const_iterator [1/2]

template<typename Tree >

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

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

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

◆ iterator [1/2]

template<typename Tree >

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

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

◆ iterator [2/2]

template<typename Tree >

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

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

private

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

private

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

◆ key_compare [1/2]

template<typename Tree >

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

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

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

◆ key_type [1/2]

template<typename Tree >

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

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

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

◆ mapped_type [1/2]

template<typename Tree >

using absl::container_internal::btree_map_container< Tree >::mapped_type = typename params_type::mapped_type

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

◆ mapped_type [2/2]

template<typename Tree >

using absl::container_internal::btree_map_container< Tree >::mapped_type = typename params_type::mapped_type

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

◆ params_type [1/2]

template<typename Tree >

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

private

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

private

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

◆ super_type [1/2]

template<typename Tree >

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

private

Definition at line 389 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_map_container< Tree >::super_type = btree_set_container<Tree>

private

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

◆ value_type [1/2]

template<typename Tree >

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

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

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

Constructor & Destructor Documentation

◆ btree_map_container() [1/2]

template<typename Tree >

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

inline

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

◆ btree_map_container() [2/2]

template<typename Tree >

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

inline

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

Member Function Documentation

◆ at() [1/4]

template<typename Tree >

template<typename K = key_type>

mapped_type& absl::container_internal::btree_map_container< Tree >::at ( const key_arg< K > & key )

inline

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

◆ at() [2/4]

template<typename Tree >

template<typename K = key_type>

mapped_type& absl::container_internal::btree_map_container< Tree >::at ( const key_arg< K > & key )

inline

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

◆ at() [3/4]

template<typename Tree >

template<typename K = key_type>

const mapped_type& absl::container_internal::btree_map_container< Tree >::at ( const key_arg< K > & key ) const

inline

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

◆ at() [4/4]

template<typename Tree >

template<typename K = key_type>

const mapped_type& absl::container_internal::btree_map_container< Tree >::at ( const key_arg< K > & key ) const

inline

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

◆ insert_or_assign() [1/16]

template<typename Tree >

template<typename K = key_type, class M >

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const key_arg< K > &	k,
		const M &	obj
	)

inline

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

◆ insert_or_assign() [2/16]

template<typename Tree >

template<typename K = key_type, class M >

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const key_arg< K > &	k,
		const M &	obj
	)

inline

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

◆ insert_or_assign() [3/16]

template<typename Tree >

template<typename K = key_type, class M , M * = nullptr>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const key_arg< K > &	k,
		M &&	obj
	)

inline

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

◆ insert_or_assign() [4/16]

template<typename Tree >

template<typename K = key_type, class M , M * = nullptr>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const key_arg< K > &	k,
		M &&	obj
	)

inline

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

◆ insert_or_assign() [5/16]

template<typename Tree >

template<typename K = key_type, class M >

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const_iterator	hint,
		const key_arg< K > &	k,
		const M &	obj
	)

inline

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

◆ insert_or_assign() [6/16]

template<typename Tree >

template<typename K = key_type, class M >

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const_iterator	hint,
		const key_arg< K > &	k,
		const M &	obj
	)

inline

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

◆ insert_or_assign() [7/16]

template<typename Tree >

template<typename K = key_type, class M , M * = nullptr>

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const_iterator	hint,
		const key_arg< K > &	k,
		M &&	obj
	)

inline

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

◆ insert_or_assign() [8/16]

template<typename Tree >

template<typename K = key_type, class M , M * = nullptr>

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const_iterator	hint,
		const key_arg< K > &	k,
		M &&	obj
	)

inline

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

◆ insert_or_assign() [9/16]

template<typename Tree >

template<typename K = key_type, class M , K * = nullptr>

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const_iterator	hint,
		key_arg< K > &&	k,
		const M &	obj
	)

inline

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

◆ insert_or_assign() [10/16]

template<typename Tree >

template<typename K = key_type, class M , K * = nullptr>

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const_iterator	hint,
		key_arg< K > &&	k,
		const M &	obj
	)

inline

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

◆ insert_or_assign() [11/16]

template<typename Tree >

template<typename K = key_type, class M , K * = nullptr, M * = nullptr>

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const_iterator	hint,
		key_arg< K > &&	k,
		M &&	obj
	)

inline

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

◆ insert_or_assign() [12/16]

template<typename Tree >

template<typename K = key_type, class M , K * = nullptr, M * = nullptr>

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	const_iterator	hint,
		key_arg< K > &&	k,
		M &&	obj
	)

inline

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

◆ insert_or_assign() [13/16]

template<typename Tree >

template<typename K = key_type, class M , K * = nullptr>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	key_arg< K > &&	k,
		const M &	obj
	)

inline

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

◆ insert_or_assign() [14/16]

template<typename Tree >

template<typename K = key_type, class M , K * = nullptr>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	key_arg< K > &&	k,
		const M &	obj
	)

inline

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

◆ insert_or_assign() [15/16]

template<typename Tree >

template<typename K = key_type, class M , K * = nullptr, M * = nullptr>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	key_arg< K > &&	k,
		M &&	obj
	)

inline

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

◆ insert_or_assign() [16/16]

template<typename Tree >

template<typename K = key_type, class M , K * = nullptr, M * = nullptr>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign	(	key_arg< K > &&	k,
		M &&	obj
	)

inline

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

◆ insert_or_assign_hint_impl() [1/2]

template<typename Tree >

template<class K , class M >

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign_hint_impl	(	const_iterator	hint,
		K &&	k,
		M &&	obj
	)

inlineprivate

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

◆ insert_or_assign_hint_impl() [2/2]

template<typename Tree >

template<class K , class M >

iterator absl::container_internal::btree_map_container< Tree >::insert_or_assign_hint_impl	(	const_iterator	hint,
		K &&	k,
		M &&	obj
	)

inlineprivate

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

◆ insert_or_assign_impl() [1/2]

template<typename Tree >

template<class K , class M >

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign_impl	(	K &&	k,
		M &&	obj
	)

inlineprivate

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

◆ insert_or_assign_impl() [2/2]

template<typename Tree >

template<class K , class M >

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::insert_or_assign_impl	(	K &&	k,
		M &&	obj
	)

inlineprivate

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

◆ operator[]() [1/4]

template<typename Tree >

template<typename K = key_type>

mapped_type& absl::container_internal::btree_map_container< Tree >::operator[] ( const key_arg< K > & k )

inline

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

◆ operator[]() [2/4]

template<typename Tree >

template<typename K = key_type>

mapped_type& absl::container_internal::btree_map_container< Tree >::operator[] ( const key_arg< K > & k )

inline

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

◆ operator[]() [3/4]

template<typename Tree >

template<typename K = key_type>

mapped_type& absl::container_internal::btree_map_container< Tree >::operator[] ( key_arg< K > && k )

inline

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

◆ operator[]() [4/4]

template<typename Tree >

template<typename K = key_type>

mapped_type& absl::container_internal::btree_map_container< Tree >::operator[] ( key_arg< K > && k )

inline

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

◆ try_emplace() [1/8]

template<typename Tree >

template<typename K = key_type, typename... Args, typename absl::enable_if_t< !std::is_convertible< K, const_iterator >::value, int > = 0>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::try_emplace	(	const key_arg< K > &	k,
		Args &&...	args
	)

inline

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

◆ try_emplace() [2/8]

template<typename Tree >

template<typename K = key_type, typename... Args, typename absl::enable_if_t< !std::is_convertible< K, const_iterator >::value, int > = 0>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::try_emplace	(	const key_arg< K > &	k,
		Args &&...	args
	)

inline

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

◆ try_emplace() [3/8]

template<typename Tree >

template<typename K = key_type, typename... Args>

iterator absl::container_internal::btree_map_container< Tree >::try_emplace	(	const_iterator	hint,
		const key_arg< K > &	k,
		Args &&...	args
	)

inline

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

◆ try_emplace() [4/8]

template<typename Tree >

template<typename K = key_type, typename... Args>

iterator absl::container_internal::btree_map_container< Tree >::try_emplace	(	const_iterator	hint,
		const key_arg< K > &	k,
		Args &&...	args
	)

inline

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

◆ try_emplace() [5/8]

template<typename Tree >

template<typename K = key_type, typename... Args>

iterator absl::container_internal::btree_map_container< Tree >::try_emplace	(	const_iterator	hint,
		key_arg< K > &&	k,
		Args &&...	args
	)

inline

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

◆ try_emplace() [6/8]

template<typename Tree >

template<typename K = key_type, typename... Args>

iterator absl::container_internal::btree_map_container< Tree >::try_emplace	(	const_iterator	hint,
		key_arg< K > &&	k,
		Args &&...	args
	)

inline

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

◆ try_emplace() [7/8]

template<typename Tree >

template<typename K = key_type, typename... Args, typename absl::enable_if_t< !std::is_convertible< K, const_iterator >::value, int > = 0>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::try_emplace	(	key_arg< K > &&	k,
		Args &&...	args
	)

inline

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

◆ try_emplace() [8/8]

template<typename Tree >

template<typename K = key_type, typename... Args, typename absl::enable_if_t< !std::is_convertible< K, const_iterator >::value, int > = 0>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::try_emplace	(	key_arg< K > &&	k,
		Args &&...	args
	)

inline

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

◆ try_emplace_hint_impl() [1/2]

template<typename Tree >

template<class K , class... Args>

iterator absl::container_internal::btree_map_container< Tree >::try_emplace_hint_impl	(	const_iterator	hint,
		K &&	k,
		Args &&...	args
	)

inlineprivate

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

◆ try_emplace_hint_impl() [2/2]

template<typename Tree >

template<class K , class... Args>

iterator absl::container_internal::btree_map_container< Tree >::try_emplace_hint_impl	(	const_iterator	hint,
		K &&	k,
		Args &&...	args
	)

inlineprivate

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

◆ try_emplace_impl() [1/2]

template<typename Tree >

template<class K , class... Args>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::try_emplace_impl	(	K &&	k,
		Args &&...	args
	)

inlineprivate

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

◆ try_emplace_impl() [2/2]

template<typename Tree >

template<class K , class... Args>

std::pair<iterator, bool> absl::container_internal::btree_map_container< Tree >::try_emplace_impl	(	K &&	k,
		Args &&...	args
	)

inlineprivate

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

Friends And Related Function Documentation

◆ BtreeNodePeer

template<typename Tree >

BtreeNodePeer

friend

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

Private Types

Private Member Functions

Friends

Additional Inherited Members

Detailed Description

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

Member Typedef Documentation

◆ allocator_type [1/2]

◆ allocator_type [2/2]

◆ const_iterator [1/2]

◆ const_iterator [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]

◆ mapped_type [1/2]

◆ mapped_type [2/2]

◆ params_type [1/2]

◆ params_type [2/2]

◆ super_type [1/2]

◆ super_type [2/2]

◆ value_type [1/2]

◆ value_type [2/2]

Constructor & Destructor Documentation

◆ btree_map_container() [1/2]

◆ btree_map_container() [2/2]

Member Function Documentation

◆ at() [1/4]

◆ at() [2/4]

◆ at() [3/4]

◆ at() [4/4]

◆ insert_or_assign() [1/16]

◆ insert_or_assign() [2/16]

◆ insert_or_assign() [3/16]

◆ insert_or_assign() [4/16]

◆ insert_or_assign() [5/16]

◆ insert_or_assign() [6/16]

◆ insert_or_assign() [7/16]

◆ insert_or_assign() [8/16]

◆ insert_or_assign() [9/16]

◆ insert_or_assign() [10/16]

◆ insert_or_assign() [11/16]

◆ insert_or_assign() [12/16]

◆ insert_or_assign() [13/16]

◆ insert_or_assign() [14/16]

◆ insert_or_assign() [15/16]

◆ insert_or_assign() [16/16]

◆ insert_or_assign_hint_impl() [1/2]

◆ insert_or_assign_hint_impl() [2/2]

◆ insert_or_assign_impl() [1/2]

◆ insert_or_assign_impl() [2/2]

◆ operator[]() [1/4]

◆ operator[]() [2/4]

◆ operator[]() [3/4]

◆ operator[]() [4/4]

◆ try_emplace() [1/8]

◆ try_emplace() [2/8]

◆ try_emplace() [3/8]

◆ try_emplace() [4/8]

◆ try_emplace() [5/8]

◆ try_emplace() [6/8]

◆ try_emplace() [7/8]

◆ try_emplace() [8/8]

◆ try_emplace_hint_impl() [1/2]

◆ try_emplace_hint_impl() [2/2]

◆ try_emplace_impl() [1/2]

◆ try_emplace_impl() [2/2]

Friends And Related Function Documentation

◆ BtreeNodePeer

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