#include <btree_container.h>

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

Public Types
using	mapped_type = typename params_type::mapped_type

using	mapped_type = typename params_type::mapped_type

Public Types inherited from absl::container_internal::btree_multiset_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	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_multimap_container ()

	btree_multimap_container ()

Public Member Functions inherited from absl::container_internal::btree_multiset_container< Tree >
	btree_multiset_container ()

	btree_multiset_container ()

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

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

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

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

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

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

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

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

template<typename... Args>
iterator	emplace (Args &&... args)

template<typename... Args>
iterator	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)

iterator	insert (const value_type &v)

iterator	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)

iterator	insert (node_type &&node)

iterator	insert (node_type &&node)

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

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

iterator	insert (value_type &&v)

iterator	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
using	params_type = typename Tree::params_type

using	params_type = typename Tree::params_type

using	super_type = btree_multiset_container< Tree >

using	super_type = btree_multiset_container< Tree >

Friends
class	BtreeNodePeer

Additional Inherited Members
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_