flat_map.hpp File Reference

#include <boost/container/detail/config_begin.hpp>
#include <boost/container/detail/workaround.hpp>
#include <boost/container/container_fwd.hpp>
#include <utility>
#include <functional>
#include <memory>
#include <boost/container/detail/flat_tree.hpp>
#include <boost/type_traits/has_trivial_destructor.hpp>
#include <boost/container/detail/mpl.hpp>
#include <boost/container/allocator_traits.hpp>
#include <boost/container/throw_exception.hpp>
#include <boost/move/utility_core.hpp>
#include <boost/move/detail/move_helpers.hpp>
#include <boost/move/traits.hpp>
#include <boost/core/no_exceptions_support.hpp>
#include <initializer_list>
#include <BOOST_PP_LOCAL_ITERATE()>
#include <boost/container/detail/config_end.hpp>

Include dependency graph for flat_map.hpp:

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

Classes
class	boost::container::flat_map< Key, T, Compare, Allocator >
	A flat_map is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of values of another type T based on the keys. More...
struct	boost::has_trivial_destructor_after_move< boost::container::flat_map< K, T, C, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...
class	boost::container::flat_multimap< Key, T, Compare, Allocator >
	A flat_multimap is a kind of associative container that supports equivalent keys (possibly containing multiple copies of the same key value) and provides for fast retrieval of values of another type T based on the keys. More...
struct	boost::has_trivial_destructor_after_move< boost::container::flat_multimap< K, T, C, Allocator > >
	has_trivial_destructor_after_move<> == true_type specialization for optimizations More...

Namespaces
	boost
	Duration formatting facet for input.
	boost::container
	boost::container::container_detail

Macros
#define	BOOST_PP_LOCAL_MACRO(n)
#define	BOOST_PP_LOCAL_LIMITS   (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS)
#define	BOOST_PP_LOCAL_MACRO(n)
#define	BOOST_PP_LOCAL_LIMITS   (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS)

Macro Definition Documentation

#define BOOST_PP_LOCAL_LIMITS   (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS)

#define BOOST_PP_LOCAL_LIMITS   (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS)

#define BOOST_PP_LOCAL_MACRO

(

n

)

Value:

BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >)          \
   std::pair<iterator,bool> emplace(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_LIST, _))            \
   {  return container_detail::force_copy< std::pair<iterator, bool> >                             \
         (m_flat_tree.emplace_unique(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); }    \
                                                                                                   \
   BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >)          \
   iterator emplace_hint(const_iterator hint                                                       \
                         BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_LIST, _))              \
   {  return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_unique                \
            (container_detail::force_copy<impl_const_iterator>(hint)                               \
               BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); }                 \

#define BOOST_PP_LOCAL_MACRO

(

n

)

Value:

BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >)          \
   iterator emplace(BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_LIST, _))                            \
   {  return container_detail::force_copy<iterator>(m_flat_tree.emplace_equal                      \
               (BOOST_PP_ENUM(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); }                         \
                                                                                                   \
   BOOST_PP_EXPR_IF(n, template<) BOOST_PP_ENUM_PARAMS(n, class P) BOOST_PP_EXPR_IF(n, >)          \
   iterator emplace_hint(const_iterator hint                                                       \
                         BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_LIST, _))              \
   {  return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_equal                 \
            (container_detail::force_copy<impl_const_iterator>(hint)                               \
               BOOST_PP_ENUM_TRAILING(n, BOOST_CONTAINER_PP_PARAM_FORWARD, _))); }                 \