map.h File Reference

#include <algorithm>
#include <type_traits>
#include "container.h"

Include dependency graph for map.h:

This graph shows which files directly or indirectly include this file:

Classes
struct	ant::std_ext::is_pair< T >
struct	ant::std_ext::is_pair< std::pair< T, U > >
struct	ant::std_ext::is_mapping<... >
struct	ant::std_ext::is_mapping< Container, typename std::enable_if< is_pair< typename std::iterator_traits< typename Container::iterator >::second_type >::value > >
struct	ant::std_ext::second_t< Pair >

Namespaces
	ant
	ant::std_ext

Functions
template<typename Map >
second_t< typename Map::value_type >	ant::std_ext::second (const Map &)
template<class Pair >
std::enable_if< is_pair< Pair >::value, Pair >::type::second_type	ant::std_ext::get_second (Pair p)
template<typename Map , typename = std::enable_if<is_mapping<Map>::value>>
Map::iterator	ant::std_ext::min_map_element (Map &m)
	Takes map-like container and returns an iterator to the pair with the minimum associated key value. More...
template<typename Map , typename = std::enable_if<is_mapping<Map>::value>>
Map::iterator	ant::std_ext::max_map_element (Map &m)
	Takes map-like container and returns an iterator to the pair with the maximum associated key value. More...