#include <map.h>

Inheritance diagram for momo::stdish::internal::map_adaptor_base< TTreeMap >:

Public Types
typedef TreeMap::Key	key_type

typedef TreeMap::Value	mapped_type

typedef TreeTraits::LessComparer	key_compare

typedef TreeMap	nested_container_type

typedef size_t	size_type

typedef ptrdiff_t	difference_type

typedef std::pair< const key_type, mapped_type >	value_type

typedef std::allocator_traits< typename MemManager::ByteAllocator >::template rebind_alloc< value_type >	allocator_type

typedef map_value_compare< key_type, key_compare >	value_compare

typedef momo::internal::TreeDerivedIterator< TreeMapIterator, momo::internal::MapReferenceStd >	iterator

typedef iterator::ConstIterator	const_iterator

typedef iterator::Reference	reference

typedef const_iterator::Reference	const_reference

typedef iterator::Pointer	pointer

typedef const_iterator::Pointer	const_pointer

typedef std::reverse_iterator< iterator >	reverse_iterator

typedef std::reverse_iterator< const_iterator >	const_reverse_iterator

typedef internal::map_node_handle< typename TreeMap::ExtractedPair >	node_type

typedef internal::insert_return_type< iterator, node_type >	insert_return_type

Public Member Functions
	map_adaptor_base ()

	map_adaptor_base (const allocator_type &alloc)

	map_adaptor_base (const key_compare &lessComp, const allocator_type &alloc=allocator_type())

template<typename Iterator >
	map_adaptor_base (Iterator first, Iterator last, const allocator_type &alloc=allocator_type())

template<typename Iterator >
	map_adaptor_base (Iterator first, Iterator last, const key_compare &lessComp, const allocator_type &alloc=allocator_type())

	map_adaptor_base (std::initializer_list< value_type > values, const allocator_type &alloc=allocator_type())

	map_adaptor_base (std::initializer_list< value_type > values, const key_compare &lessComp, const allocator_type &alloc=allocator_type())

	map_adaptor_base (map_adaptor_base &&right)

	map_adaptor_base (map_adaptor_base &&right, const allocator_type &alloc)

	map_adaptor_base (const map_adaptor_base &right)

	map_adaptor_base (const map_adaptor_base &right, const allocator_type &alloc)

	~map_adaptor_base ()=default

map_adaptor_base &	operator= (map_adaptor_base &&right) noexcept(momo::internal::ContainerAssignerStd::IsNothrowMoveAssignable< map_adaptor_base >::value)

map_adaptor_base &	operator= (const map_adaptor_base &right)

void	swap (map_adaptor_base &right) noexcept

const nested_container_type &	get_nested_container () const noexcept

nested_container_type &	get_nested_container () noexcept

const_iterator	begin () const noexcept

iterator	begin () noexcept

const_iterator	end () const noexcept

iterator	end () noexcept

const_reverse_iterator	rbegin () const noexcept

reverse_iterator	rbegin () noexcept

const_reverse_iterator	rend () const noexcept

reverse_iterator	rend () noexcept

const_iterator	cbegin () const noexcept

const_iterator	cend () const noexcept

const_reverse_iterator	crbegin () const noexcept

const_reverse_iterator	crend () const noexcept

key_compare	key_comp () const

value_compare	value_comp () const

allocator_type	get_allocator () const noexcept

size_type	max_size () const noexcept

size_type	size () const noexcept

MOMO_NODISCARD bool	empty () const noexcept

void	clear () noexcept

const_iterator	find (const key_type &key) const

iterator	find (const key_type &key)

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, const_iterator >	find (const KeyArg &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, iterator >	find (const KeyArg &key)

size_type	count (const key_type &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, size_type >	count (const KeyArg &key) const

bool	contains (const key_type &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, bool >	contains (const KeyArg &key) const

const_iterator	lower_bound (const key_type &key) const

iterator	lower_bound (const key_type &key)

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, const_iterator >	lower_bound (const KeyArg &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, iterator >	lower_bound (const KeyArg &key)

const_iterator	upper_bound (const key_type &key) const

iterator	upper_bound (const key_type &key)

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, const_iterator >	upper_bound (const KeyArg &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, iterator >	upper_bound (const KeyArg &key)

std::pair< const_iterator, const_iterator >	equal_range (const key_type &key) const

std::pair< iterator, iterator >	equal_range (const key_type &key)

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, std::pair< const_iterator, const_iterator > >	equal_range (const KeyArg &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, std::pair< iterator, iterator > >	equal_range (const KeyArg &key)

template<typename ValueArg = std::pair<key_type, mapped_type>>
momo::internal::EnableIf< std::is_constructible< value_type, ValueArg && >::value, std::pair< iterator, bool > >	insert (ValueArg &&valueArg)

template<typename ValueArg = std::pair<key_type, mapped_type>>
momo::internal::EnableIf< std::is_constructible< value_type, ValueArg && >::value, iterator >	insert (const_iterator hint, ValueArg &&valueArg)

insert_return_type	insert (node_type &&node)

iterator	insert (const_iterator hint, node_type &&node)

template<typename Iterator >
void	insert (Iterator first, Iterator last)

void	insert (std::initializer_list< value_type > values)

std::pair< iterator, bool >	emplace ()

iterator	emplace_hint (const_iterator hint)

template<typename ValueArg >
std::pair< iterator, bool >	emplace (ValueArg &&valueArg)

template<typename ValueArg >
iterator	emplace_hint (const_iterator hint, ValueArg &&valueArg)

template<typename KeyArg , typename MappedArg >
std::pair< iterator, bool >	emplace (KeyArg &&keyArg, MappedArg &&mappedArg)

template<typename KeyArg , typename MappedArg >
iterator	emplace_hint (const_iterator hint, KeyArg &&keyArg, MappedArg &&mappedArg)

template<typename... KeyArgs, typename... MappedArgs>
std::pair< iterator, bool >	emplace (std::piecewise_construct_t, std::tuple< KeyArgs... > keyArgs, std::tuple< MappedArgs... > mappedArgs)

template<typename... KeyArgs, typename... MappedArgs>
iterator	emplace_hint (const_iterator hint, std::piecewise_construct_t, std::tuple< KeyArgs... > keyArgs, std::tuple< MappedArgs... > mappedArgs)

iterator	erase (const_iterator where)

iterator	erase (iterator where)

iterator	erase (const_iterator first, const_iterator last)

size_type	erase (const key_type &key)

node_type	extract (const_iterator where)

node_type	extract (const key_type &key)

template<typename Map >
void	merge (Map &&map)

Protected Member Functions
void	ptAssign (std::initializer_list< value_type > values)

template<typename Hint , typename... KeyArgs, typename... MappedArgs>
std::pair< iterator, bool >	ptEmplace (Hint hint, std::tuple< KeyArgs... > &&keyArgs, std::tuple< MappedArgs... > &&mappedArgs)

Friends
template<typename ValueFilter >
size_type	erase_if (map_adaptor_base &cont, const ValueFilter &valueFilter)

bool	operator== (const map_adaptor_base &left, const map_adaptor_base &right)

bool	operator< (const map_adaptor_base &left, const map_adaptor_base &right)

Member Typedef Documentation

◆ allocator_type

template<typename TTreeMap >

typedef std::allocator_traits<typename MemManager::ByteAllocator>::template rebind_alloc<value_type> momo::stdish::internal::map_adaptor_base< TTreeMap >::allocator_type

◆ const_iterator

template<typename TTreeMap >

typedef iterator::ConstIterator momo::stdish::internal::map_adaptor_base< TTreeMap >::const_iterator

◆ const_pointer

template<typename TTreeMap >

typedef const_iterator::Pointer momo::stdish::internal::map_adaptor_base< TTreeMap >::const_pointer

◆ const_reference

template<typename TTreeMap >

typedef const_iterator::Reference momo::stdish::internal::map_adaptor_base< TTreeMap >::const_reference

◆ const_reverse_iterator

template<typename TTreeMap >

typedef std::reverse_iterator<const_iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::const_reverse_iterator

◆ difference_type

template<typename TTreeMap >

typedef ptrdiff_t momo::stdish::internal::map_adaptor_base< TTreeMap >::difference_type

◆ insert_return_type

template<typename TTreeMap >

typedef internal::insert_return_type<iterator, node_type> momo::stdish::internal::map_adaptor_base< TTreeMap >::insert_return_type

◆ iterator

template<typename TTreeMap >

typedef momo::internal::TreeDerivedIterator<TreeMapIterator, momo::internal::MapReferenceStd> momo::stdish::internal::map_adaptor_base< TTreeMap >::iterator

◆ key_compare

template<typename TTreeMap >

typedef TreeTraits::LessComparer momo::stdish::internal::map_adaptor_base< TTreeMap >::key_compare

◆ key_type

template<typename TTreeMap >

typedef TreeMap::Key momo::stdish::internal::map_adaptor_base< TTreeMap >::key_type

◆ mapped_type

template<typename TTreeMap >

typedef TreeMap::Value momo::stdish::internal::map_adaptor_base< TTreeMap >::mapped_type

◆ nested_container_type

template<typename TTreeMap >

typedef TreeMap momo::stdish::internal::map_adaptor_base< TTreeMap >::nested_container_type

◆ node_type

template<typename TTreeMap >

typedef internal::map_node_handle<typename TreeMap::ExtractedPair> momo::stdish::internal::map_adaptor_base< TTreeMap >::node_type

◆ pointer

template<typename TTreeMap >

typedef iterator::Pointer momo::stdish::internal::map_adaptor_base< TTreeMap >::pointer

◆ reference

template<typename TTreeMap >

typedef iterator::Reference momo::stdish::internal::map_adaptor_base< TTreeMap >::reference

◆ reverse_iterator

template<typename TTreeMap >

typedef std::reverse_iterator<iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::reverse_iterator

◆ size_type

template<typename TTreeMap >

typedef size_t momo::stdish::internal::map_adaptor_base< TTreeMap >::size_type

◆ value_compare

template<typename TTreeMap >

typedef map_value_compare<key_type, key_compare> momo::stdish::internal::map_adaptor_base< TTreeMap >::value_compare

◆ value_type

template<typename TTreeMap >

typedef std::pair<const key_type, mapped_type> momo::stdish::internal::map_adaptor_base< TTreeMap >::value_type

Constructor & Destructor Documentation

◆ map_adaptor_base() [1/11]

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base ( )

inline

◆ map_adaptor_base() [2/11]

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base ( const allocator_type & alloc )

inlineexplicit

◆ map_adaptor_base() [3/11]

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base	(	const key_compare &	lessComp,
		const allocator_type &	alloc = `allocator_type()`
	)

inlineexplicit

◆ map_adaptor_base() [4/11]

template<typename TTreeMap >

template<typename Iterator >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base	(	Iterator	first,
		Iterator	last,
		const allocator_type &	alloc = `allocator_type()`
	)

inline

◆ map_adaptor_base() [5/11]

template<typename TTreeMap >

template<typename Iterator >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base	(	Iterator	first,
		Iterator	last,
		const key_compare &	lessComp,
		const allocator_type &	alloc = `allocator_type()`
	)

inline

◆ map_adaptor_base() [6/11]

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base	(	std::initializer_list< value_type >	values,
		const allocator_type &	alloc = `allocator_type()`
	)

inline

◆ map_adaptor_base() [7/11]

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base	(	std::initializer_list< value_type >	values,
		const key_compare &	lessComp,
		const allocator_type &	alloc = `allocator_type()`
	)

inline

◆ map_adaptor_base() [8/11]

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base ( map_adaptor_base< TTreeMap > && right )

inline

◆ map_adaptor_base() [9/11]

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base	(	map_adaptor_base< TTreeMap > &&	right,
		const allocator_type &	alloc
	)

inline

◆ map_adaptor_base() [10/11]

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base ( const map_adaptor_base< TTreeMap > & right )

inline

◆ map_adaptor_base() [11/11]

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::map_adaptor_base	(	const map_adaptor_base< TTreeMap > &	right,
		const allocator_type &	alloc
	)

inline

◆ ~map_adaptor_base()

template<typename TTreeMap >

momo::stdish::internal::map_adaptor_base< TTreeMap >::~map_adaptor_base ( )

default

Member Function Documentation

◆ begin() [1/2]

template<typename TTreeMap >

const_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::begin ( ) const

inlinenoexcept

◆ begin() [2/2]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::begin ( )

inlinenoexcept

◆ cbegin()

template<typename TTreeMap >

const_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::cbegin ( ) const

inlinenoexcept

◆ cend()

template<typename TTreeMap >

const_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::cend ( ) const

inlinenoexcept

◆ clear()

template<typename TTreeMap >

void momo::stdish::internal::map_adaptor_base< TTreeMap >::clear ( )

inlinenoexcept

◆ contains() [1/2]

template<typename TTreeMap >

bool momo::stdish::internal::map_adaptor_base< TTreeMap >::contains ( const key_type & key ) const

inline

◆ contains() [2/2]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, bool> momo::stdish::internal::map_adaptor_base< TTreeMap >::contains ( const KeyArg & key ) const

inline

◆ count() [1/2]

template<typename TTreeMap >

size_type momo::stdish::internal::map_adaptor_base< TTreeMap >::count ( const key_type & key ) const

inline

◆ count() [2/2]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, size_type> momo::stdish::internal::map_adaptor_base< TTreeMap >::count ( const KeyArg & key ) const

inline

◆ crbegin()

template<typename TTreeMap >

const_reverse_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::crbegin ( ) const

inlinenoexcept

◆ crend()

template<typename TTreeMap >

const_reverse_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::crend ( ) const

inlinenoexcept

◆ emplace() [1/4]

template<typename TTreeMap >

std::pair<iterator, bool> momo::stdish::internal::map_adaptor_base< TTreeMap >::emplace ( )

inline

◆ emplace() [2/4]

template<typename TTreeMap >

template<typename KeyArg , typename MappedArg >

std::pair<iterator, bool> momo::stdish::internal::map_adaptor_base< TTreeMap >::emplace	(	KeyArg &&	keyArg,
		MappedArg &&	mappedArg
	)

inline

◆ emplace() [3/4]

template<typename TTreeMap >

template<typename... KeyArgs, typename... MappedArgs>

std::pair<iterator, bool> momo::stdish::internal::map_adaptor_base< TTreeMap >::emplace	(	std::piecewise_construct_t	,
		std::tuple< KeyArgs... >	keyArgs,
		std::tuple< MappedArgs... >	mappedArgs
	)

inline

◆ emplace() [4/4]

template<typename TTreeMap >

template<typename ValueArg >

std::pair<iterator, bool> momo::stdish::internal::map_adaptor_base< TTreeMap >::emplace ( ValueArg && valueArg )

inline

◆ emplace_hint() [1/4]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::emplace_hint ( const_iterator hint )

inline

◆ emplace_hint() [2/4]

template<typename TTreeMap >

template<typename KeyArg , typename MappedArg >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::emplace_hint	(	const_iterator	hint,
		KeyArg &&	keyArg,
		MappedArg &&	mappedArg
	)

inline

◆ emplace_hint() [3/4]

template<typename TTreeMap >

template<typename... KeyArgs, typename... MappedArgs>

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::emplace_hint	(	const_iterator	hint,
		std::piecewise_construct_t	,
		std::tuple< KeyArgs... >	keyArgs,
		std::tuple< MappedArgs... >	mappedArgs
	)

inline

◆ emplace_hint() [4/4]

template<typename TTreeMap >

template<typename ValueArg >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::emplace_hint	(	const_iterator	hint,
		ValueArg &&	valueArg
	)

inline

◆ empty()

template<typename TTreeMap >

MOMO_NODISCARD bool momo::stdish::internal::map_adaptor_base< TTreeMap >::empty ( ) const

inlinenoexcept

◆ end() [1/2]

template<typename TTreeMap >

const_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::end ( ) const

inlinenoexcept

◆ end() [2/2]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::end ( )

inlinenoexcept

◆ equal_range() [1/4]

template<typename TTreeMap >

std::pair<iterator, iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::equal_range ( const key_type & key )

inline

◆ equal_range() [2/4]

template<typename TTreeMap >

std::pair<const_iterator, const_iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::equal_range ( const key_type & key ) const

inline

◆ equal_range() [3/4]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, std::pair<iterator, iterator> > momo::stdish::internal::map_adaptor_base< TTreeMap >::equal_range ( const KeyArg & key )

inline

◆ equal_range() [4/4]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, std::pair<const_iterator, const_iterator> > momo::stdish::internal::map_adaptor_base< TTreeMap >::equal_range ( const KeyArg & key ) const

inline

◆ erase() [1/4]

template<typename TTreeMap >

size_type momo::stdish::internal::map_adaptor_base< TTreeMap >::erase ( const key_type & key )

inline

◆ erase() [2/4]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::erase	(	const_iterator	first,
		const_iterator	last
	)

inline

◆ erase() [3/4]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::erase ( const_iterator where )

inline

◆ erase() [4/4]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::erase ( iterator where )

inline

◆ extract() [1/2]

template<typename TTreeMap >

node_type momo::stdish::internal::map_adaptor_base< TTreeMap >::extract ( const key_type & key )

inline

◆ extract() [2/2]

template<typename TTreeMap >

node_type momo::stdish::internal::map_adaptor_base< TTreeMap >::extract ( const_iterator where )

inline

◆ find() [1/4]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::find ( const key_type & key )

inline

◆ find() [2/4]

template<typename TTreeMap >

const_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::find ( const key_type & key ) const

inline

◆ find() [3/4]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::find ( const KeyArg & key )

inline

◆ find() [4/4]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, const_iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::find ( const KeyArg & key ) const

inline

◆ get_allocator()

template<typename TTreeMap >

allocator_type momo::stdish::internal::map_adaptor_base< TTreeMap >::get_allocator ( ) const

inlinenoexcept

◆ get_nested_container() [1/2]

template<typename TTreeMap >

const nested_container_type& momo::stdish::internal::map_adaptor_base< TTreeMap >::get_nested_container ( ) const

inlinenoexcept

◆ get_nested_container() [2/2]

template<typename TTreeMap >

nested_container_type& momo::stdish::internal::map_adaptor_base< TTreeMap >::get_nested_container ( )

inlinenoexcept

◆ insert() [1/6]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::insert	(	const_iterator	hint,
		node_type &&	node
	)

inline

◆ insert() [2/6]

template<typename TTreeMap >

template<typename ValueArg = std::pair<key_type, mapped_type>>

momo::internal::EnableIf<std::is_constructible<value_type, ValueArg&&>::value, iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::insert	(	const_iterator	hint,
		ValueArg &&	valueArg
	)

inline

◆ insert() [3/6]

template<typename TTreeMap >

template<typename Iterator >

void momo::stdish::internal::map_adaptor_base< TTreeMap >::insert	(	Iterator	first,
		Iterator	last
	)

inline

◆ insert() [4/6]

template<typename TTreeMap >

insert_return_type momo::stdish::internal::map_adaptor_base< TTreeMap >::insert ( node_type && node )

inline

◆ insert() [5/6]

template<typename TTreeMap >

void momo::stdish::internal::map_adaptor_base< TTreeMap >::insert ( std::initializer_list< value_type > values )

inline

◆ insert() [6/6]

template<typename TTreeMap >

template<typename ValueArg = std::pair<key_type, mapped_type>>

momo::internal::EnableIf<std::is_constructible<value_type, ValueArg&&>::value, std::pair<iterator, bool> > momo::stdish::internal::map_adaptor_base< TTreeMap >::insert ( ValueArg && valueArg )

inline

◆ key_comp()

template<typename TTreeMap >

key_compare momo::stdish::internal::map_adaptor_base< TTreeMap >::key_comp ( ) const

inline

◆ lower_bound() [1/4]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::lower_bound ( const key_type & key )

inline

◆ lower_bound() [2/4]

template<typename TTreeMap >

const_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::lower_bound ( const key_type & key ) const

inline

◆ lower_bound() [3/4]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::lower_bound ( const KeyArg & key )

inline

◆ lower_bound() [4/4]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, const_iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::lower_bound ( const KeyArg & key ) const

inline

◆ max_size()

template<typename TTreeMap >

size_type momo::stdish::internal::map_adaptor_base< TTreeMap >::max_size ( ) const

inlinenoexcept

◆ merge()

template<typename TTreeMap >

template<typename Map >

void momo::stdish::internal::map_adaptor_base< TTreeMap >::merge ( Map && map )

inline

◆ operator=() [1/2]

template<typename TTreeMap >

map_adaptor_base& momo::stdish::internal::map_adaptor_base< TTreeMap >::operator= ( const map_adaptor_base< TTreeMap > & right )

inline

◆ operator=() [2/2]

template<typename TTreeMap >

map_adaptor_base& momo::stdish::internal::map_adaptor_base< TTreeMap >::operator= ( map_adaptor_base< TTreeMap > && right )

inlinenoexcept

◆ ptAssign()

template<typename TTreeMap >

void momo::stdish::internal::map_adaptor_base< TTreeMap >::ptAssign ( std::initializer_list< value_type > values )

inlineprotected

◆ ptEmplace()

template<typename TTreeMap >

template<typename Hint , typename... KeyArgs, typename... MappedArgs>

std::pair<iterator, bool> momo::stdish::internal::map_adaptor_base< TTreeMap >::ptEmplace	(	Hint	hint,
		std::tuple< KeyArgs... > &&	keyArgs,
		std::tuple< MappedArgs... > &&	mappedArgs
	)

inlineprotected

◆ rbegin() [1/2]

template<typename TTreeMap >

const_reverse_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::rbegin ( ) const

inlinenoexcept

◆ rbegin() [2/2]

template<typename TTreeMap >

reverse_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::rbegin ( )

inlinenoexcept

◆ rend() [1/2]

template<typename TTreeMap >

const_reverse_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::rend ( ) const

inlinenoexcept

◆ rend() [2/2]

template<typename TTreeMap >

reverse_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::rend ( )

inlinenoexcept

◆ size()

template<typename TTreeMap >

size_type momo::stdish::internal::map_adaptor_base< TTreeMap >::size ( ) const

inlinenoexcept

◆ swap()

template<typename TTreeMap >

void momo::stdish::internal::map_adaptor_base< TTreeMap >::swap ( map_adaptor_base< TTreeMap > & right )

inlinenoexcept

◆ upper_bound() [1/4]

template<typename TTreeMap >

iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::upper_bound ( const key_type & key )

inline

◆ upper_bound() [2/4]

template<typename TTreeMap >

const_iterator momo::stdish::internal::map_adaptor_base< TTreeMap >::upper_bound ( const key_type & key ) const

inline

◆ upper_bound() [3/4]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::upper_bound ( const KeyArg & key )

inline

◆ upper_bound() [4/4]

template<typename TTreeMap >

template<typename KeyArg >

momo::internal::EnableIf<IsValidKeyArg<KeyArg>::value, const_iterator> momo::stdish::internal::map_adaptor_base< TTreeMap >::upper_bound ( const KeyArg & key ) const

inline

◆ value_comp()

template<typename TTreeMap >

value_compare momo::stdish::internal::map_adaptor_base< TTreeMap >::value_comp ( ) const

inline

Friends And Related Function Documentation

◆ erase_if

template<typename TTreeMap >

template<typename ValueFilter >

size_type erase_if	(	map_adaptor_base< TTreeMap > &	cont,
		const ValueFilter &	valueFilter
	)

friend

◆ operator<

template<typename TTreeMap >

bool operator<	(	const map_adaptor_base< TTreeMap > &	left,
		const map_adaptor_base< TTreeMap > &	right
	)

friend

◆ operator==

template<typename TTreeMap >

bool operator==	(	const map_adaptor_base< TTreeMap > &	left,
		const map_adaptor_base< TTreeMap > &	right
	)

friend

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

include/momo/stdish/map.h

Public Types

Public Member Functions

Protected Member Functions

Friends

Member Typedef Documentation

◆ allocator_type

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ difference_type

◆ insert_return_type

◆ iterator

◆ key_compare

◆ key_type

◆ mapped_type

◆ nested_container_type

◆ node_type

◆ pointer

◆ reference

◆ reverse_iterator

◆ size_type

◆ value_compare

◆ value_type

Constructor & Destructor Documentation

◆ map_adaptor_base() [1/11]

◆ map_adaptor_base() [2/11]

◆ map_adaptor_base() [3/11]

◆ map_adaptor_base() [4/11]

◆ map_adaptor_base() [5/11]

◆ map_adaptor_base() [6/11]

◆ map_adaptor_base() [7/11]

◆ map_adaptor_base() [8/11]

◆ map_adaptor_base() [9/11]

◆ map_adaptor_base() [10/11]

◆ map_adaptor_base() [11/11]

◆ ~map_adaptor_base()

Member Function Documentation

◆ begin() [1/2]

◆ begin() [2/2]

◆ cbegin()

◆ cend()

◆ clear()

◆ contains() [1/2]

◆ contains() [2/2]

◆ count() [1/2]

◆ count() [2/2]

◆ crbegin()

◆ crend()

◆ emplace() [1/4]

◆ emplace() [2/4]

◆ emplace() [3/4]

◆ emplace() [4/4]

◆ emplace_hint() [1/4]

◆ emplace_hint() [2/4]

◆ emplace_hint() [3/4]

◆ emplace_hint() [4/4]

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ equal_range() [1/4]

◆ equal_range() [2/4]

◆ equal_range() [3/4]

◆ equal_range() [4/4]

◆ erase() [1/4]

◆ erase() [2/4]

◆ erase() [3/4]

◆ erase() [4/4]

◆ extract() [1/2]

◆ extract() [2/2]

◆ find() [1/4]

◆ find() [2/4]

◆ find() [3/4]

◆ find() [4/4]

◆ get_allocator()

◆ get_nested_container() [1/2]

◆ get_nested_container() [2/2]

◆ insert() [1/6]

◆ insert() [2/6]

◆ insert() [3/6]