ordered_map< K, V, COMP, ALLOC > Class Template Reference

Classes
class	value_compare

Public Types
typedef ALLOC	allocator_type
typedef list_type::const_iterator	const_iterator
typedef const value_type &	const_reference
typedef std::reverse_iterator< const_iterator >	const_reverse_iterator
typedef list_type::iterator	iterator
typedef COMP	key_compare
typedef K	key_type
typedef V	mapped_type
typedef value_type &	reference
typedef std::reverse_iterator< iterator >	reverse_iterator
typedef map_type::size_type	size_type
typedef std::pair< const K, V >	value_type

Public Member Functions
	ordered_map (const ordered_map &a)
template<typename InputIt >
	ordered_map (InputIt first, InputIt last)
	ordered_map (ordered_map &&a)=default
	ordered_map (std::initializer_list< value_type > il)
V &	at (const K &x)
const V &	at (const K &x) const
const_iterator	begin () const noexcept
iterator	begin () noexcept
const_iterator	cbegin () const noexcept
const_iterator	cend () const noexcept
void	clear ()
size_type	count (const key_type &a) const
const_reverse_iterator	crbegin () const noexcept
const_reverse_iterator	crend () const noexcept
template<typename KK , typename... VV>
std::pair< iterator, bool >	emplace (KK &&k, VV &&...v)
template<typename KK , typename... VV>
std::pair< iterator, bool >	emplace_hint (iterator pos, KK &&k, VV &&...v)
bool	empty () const noexcept
const_iterator	end () const noexcept
iterator	end () noexcept
size_type	erase (const K &k)
iterator	erase (const_iterator pos)
iterator	find (const key_type &a)
const_iterator	find (const key_type &a) const
std::pair< iterator, bool >	insert (const value_type &v)
template<class InputIterator >
void	insert (InputIterator b, InputIterator e)
std::pair< iterator, bool >	insert (iterator pos, const value_type &v)
template<class InputIterator >
void	insert (iterator pos, InputIterator b, InputIterator e)
iterator	lower_bound (const key_type &a)
const_iterator	lower_bound (const key_type &a) const
size_type	max_size () const noexcept
bool	operator!= (const ordered_map &a) const
ordered_map &	operator= (const ordered_map &a)
ordered_map &	operator= (ordered_map &&a)=default
bool	operator== (const ordered_map &a) const
V &	operator[] (const K &x)
V &	operator[] (K &&x)
const_reverse_iterator	rbegin () const noexcept
reverse_iterator	rbegin () noexcept
const_reverse_iterator	rend () const noexcept
reverse_iterator	rend () noexcept
size_type	size () const noexcept
template<class Compare >
void	sort (Compare comp)
iterator	upper_bound (const key_type &a)
const_iterator	upper_bound (const key_type &a) const
iterator	upper_bound_pred (const key_type &a)
const_iterator	upper_bound_pred (const key_type &a) const