FM / container

/usr/include/boost/container

Name	Size	Mode	Actions
detail/	-	0755	rm
pmr/	-	0755	rm
adaptive_pool.hpp	23337	0644	edit dl rm
allocator.hpp	14086	0644	edit dl rm
allocator_traits.hpp	23562	0644	edit dl rm
container_fwd.hpp	10772	0644	edit dl rm
deque.hpp	87025	0644	edit dl rm
flat_map.hpp	135949	0644	edit dl rm
flat_set.hpp	84601	0644	edit dl rm
list.hpp	58593	0644	edit dl rm
map.hpp	103528	0644	edit dl rm
new_allocator.hpp	6215	0644	edit dl rm
node_allocator.hpp	12517	0644	edit dl rm
node_handle.hpp	15448	0644	edit dl rm
options.hpp	18213	0644	edit dl rm
scoped_allocator.hpp	39241	0644	edit dl rm
scoped_allocator_fwd.hpp	2164	0644	edit dl rm
set.hpp	71409	0644	edit dl rm
slist.hpp	69194	0644	edit dl rm
small_vector.hpp	31569	0644	edit dl rm
stable_vector.hpp	85142	0644	edit dl rm
static_vector.hpp	43105	0644	edit dl rm
string.hpp	128399	0644	edit dl rm
throw_exception.hpp	6842	0644	edit dl rm
uses_allocator.hpp	7514	0644	edit dl rm
uses_allocator_fwd.hpp	2540	0644	edit dl rm
vector.hpp	139948	0644	edit dl rm

Edit: /usr/include/boost/container/flat_map.hpp (135949B)

//////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/container for documentation.
//
//////////////////////////////////////////////////////////////////////////////
#ifndef BOOST_CONTAINER_FLAT_MAP_HPP
#define BOOST_CONTAINER_FLAT_MAP_HPP

#ifndef BOOST_CONFIG_HPP
# include <boost/config.hpp>
#endif

#if defined(BOOST_HAS_PRAGMA_ONCE)
#  pragma once
#endif

#include <boost/container/detail/config_begin.hpp>
#include <boost/container/detail/workaround.hpp>
// container
#include <boost/container/allocator_traits.hpp>
#include <boost/container/container_fwd.hpp>
#include <boost/container/new_allocator.hpp> //new_allocator
#include <boost/container/throw_exception.hpp>
// container/detail
#include <boost/container/detail/flat_tree.hpp>
#include <boost/container/detail/type_traits.hpp>
#include <boost/container/detail/mpl.hpp>
#include <boost/container/detail/algorithm.hpp> //equal()
#include <boost/container/detail/container_or_allocator_rebind.hpp>
// move
#include <boost/move/utility_core.hpp>
#include <boost/move/traits.hpp>
// move/detail
#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
#include <boost/move/detail/fwd_macros.hpp>
#endif
#include <boost/move/detail/move_helpers.hpp>
// intrusive
#include <boost/intrusive/detail/minimal_pair_header.hpp> //pair
#include <boost/intrusive/detail/minimal_less_equal_header.hpp>//less, equal
//others
#include <boost/core/no_exceptions_support.hpp>

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
#include <initializer_list>
#endif

namespace boost {
namespace container {

#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

template <class Key, class T, class Compare, class AllocatorOrContainer>
class flat_multimap;

namespace dtl{

template<class D, class S>
BOOST_CONTAINER_FORCEINLINE static D &force(S &s)
{ return *reinterpret_cast<D*>(&s); }

template<class D, class S>
BOOST_CONTAINER_FORCEINLINE static D force_copy(const S &s)
{
 const D *const vp = reinterpret_cast<const D *>(&s);
 D ret_val(*vp);
 return ret_val;
}

}  //namespace dtl{

#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

//! 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.
//!
//! A flat_map satisfies all of the requirements of a container, a reversible
//! container and an associative container. A flat_map also provides
//! most operations described for unique keys. For a
//! flat_map<Key,T> the key_type is Key and the value_type is std::pair<Key,T>
//! (unlike std::map<Key, T> which value_type is std::pair<const Key, T>).
//!
//! flat_map is similar to std::map but it's implemented by as an ordered sequence container.
//! The underlying sequence container is by default vector but it can also work
//! user-provided vector-like SequenceContainers (like static_vector or small_vector).
//!
//! Using vector-like sequence containers means that inserting a new element into a flat_map might invalidate
//! previous iterators and references (unless that sequence container is stable_vector or a similar
//! container that offers stable pointers and references). Similarly, erasing an element might invalidate
//! iterators and references pointing to elements that come after (their keys are bigger) the erased element.
//!
//! This container provides random-access iterators.
//!
//! \tparam Key is the key_type of the map
//! \tparam Value is the <code>mapped_type</code>
//! \tparam Compare is the ordering function for Keys (e.g. std::less<Key>).
//! \tparam AllocatorOrContainer is either:
//! - The allocator to allocate <code>value_type</code>s (e.g. allocator< std::pair<Key, T> > ).
//! (in this case sequence_type will be vector<value_type, AllocatorOrContainer>)
//! - The SequenceContainer to be used as the underlying sequence_type. It must be a vector-like
//! sequence container with random-access iterators..
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
template <class Key, class T, class Compare = std::less<Key>, class AllocatorOrContainer = new_allocator< std::pair< Key, T> > >
#else
template <class Key, class T, class Compare, class AllocatorOrContainer>
#endif
class flat_map
{
 #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
 private:
 BOOST_COPYABLE_AND_MOVABLE(flat_map)
 //This is the tree that we should store if pair was movable
 typedef dtl::flat_tree<
 std::pair<Key, T>,
 dtl::select1st<Key>,
 Compare,
 AllocatorOrContainer> tree_t;

//This is the real tree stored here. It's based on a movable pair
 typedef dtl::flat_tree<
 dtl::pair<Key, T>,
 dtl::select1st<Key>,
 Compare,
 typename dtl::container_or_allocator_rebind<AllocatorOrContainer, dtl::pair<Key, T> >::type
 > impl_tree_t;
 impl_tree_t m_flat_tree; // flat tree representing flat_map

typedef typename impl_tree_t::value_type impl_value_type;
 typedef typename impl_tree_t::const_iterator impl_const_iterator;
 typedef typename impl_tree_t::iterator impl_iterator;
 typedef typename impl_tree_t::allocator_type impl_allocator_type;
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 typedef std::initializer_list<impl_value_type> impl_initializer_list;
 #endif

typedef dtl::flat_tree_value_compare
 < Compare
 , dtl::select1st<Key>
 , std::pair<Key, T> > value_compare_t;
 typedef typename tree_t::iterator iterator_t;
 typedef typename tree_t::const_iterator const_iterator_t;
 typedef typename tree_t::reverse_iterator reverse_iterator_t;
 typedef typename tree_t::const_reverse_iterator const_reverse_iterator_t;

public:
   typedef typename impl_tree_t::stored_allocator_type   impl_stored_allocator_type;
   typedef typename impl_tree_t::sequence_type           impl_sequence_type;

BOOST_CONTAINER_FORCEINLINE impl_tree_t &tree()
   {  return m_flat_tree;  }

BOOST_CONTAINER_FORCEINLINE const impl_tree_t &tree() const
   {  return m_flat_tree;  }

private:
   typedef typename tree_t::get_stored_allocator_const_return_t         get_stored_allocator_const_return_t;
   typedef typename tree_t::get_stored_allocator_noconst_return_t       get_stored_allocator_noconst_return_t;
   typedef typename impl_tree_t::get_stored_allocator_const_return_t    impl_get_stored_allocator_const_return_t;
   typedef typename impl_tree_t::get_stored_allocator_noconst_return_t  impl_get_stored_allocator_noconst_return_t;

#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

public:

//////////////////////////////////////////////
 //
 // types
 //
 //////////////////////////////////////////////
 typedef Key key_type;
 typedef T mapped_type;
 typedef Compare key_compare;
 typedef std::pair<Key, T> value_type;
 typedef typename BOOST_CONTAINER_IMPDEF(tree_t::sequence_type) sequence_type;
 typedef typename sequence_type::allocator_type allocator_type;
 typedef ::boost::container::allocator_traits<allocator_type> allocator_traits_type;
 typedef typename sequence_type::pointer pointer;
 typedef typename sequence_type::const_pointer const_pointer;
 typedef typename sequence_type::reference reference;
 typedef typename sequence_type::const_reference const_reference;
 typedef typename sequence_type::size_type size_type;
 typedef typename sequence_type::difference_type difference_type;
 typedef typename BOOST_CONTAINER_IMPDEF(tree_t::stored_allocator_type) stored_allocator_type;
 typedef typename BOOST_CONTAINER_IMPDEF(tree_t::value_compare) value_compare;

typedef typename sequence_type::iterator                                         iterator;
   typedef typename sequence_type::const_iterator                                   const_iterator;
   typedef typename sequence_type::reverse_iterator                                 reverse_iterator;
   typedef typename sequence_type::const_reverse_iterator                           const_reverse_iterator;
   typedef BOOST_CONTAINER_IMPDEF(impl_value_type)                                  movable_value_type;

//AllocatorOrContainer::value_type must be std::pair<Key, T>
 BOOST_STATIC_ASSERT((dtl::is_same<std::pair<Key, T>, value_type>::value));

//////////////////////////////////////////////
   //
   //          construct/copy/destroy
   //
   //////////////////////////////////////////////

//! Effects: Default constructs an empty flat_map.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE flat_map() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<AllocatorOrContainer>::value &&
 dtl::is_nothrow_default_constructible<Compare>::value)
 : m_flat_tree()
 {}

//! Effects: Constructs an empty flat_map using the specified allocator.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE explicit flat_map(const allocator_type& a)
 : m_flat_tree(dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_map using the specified
 //! comparison object.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE explicit flat_map(const Compare& comp)
 : m_flat_tree(comp)
 {}

//! Effects: Constructs an empty flat_map using the specified
 //! comparison object and allocator.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE flat_map(const Compare& comp, const allocator_type& a)
 : m_flat_tree(comp, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_map and
 //! and inserts elements from the range [first ,last ).
 //!
 //! Complexity: Linear in N if the range [first ,last ) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last)
 : m_flat_tree(true, first, last)
 {}

//! Effects: Constructs an empty flat_map using the specified
 //! allocator, and inserts elements from the range [first ,last ).
 //!
 //! Complexity: Linear in N if the range [first ,last ) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const allocator_type& a)
 : m_flat_tree(true, first, last, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! and inserts elements from the range [first ,last ).
 //!
 //! Complexity: Linear in N if the range [first ,last ) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const Compare& comp)
 : m_flat_tree(true, first, last, comp)
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! allocator, and inserts elements from the range [first ,last ).
 //!
 //! Complexity: Linear in N if the range [first ,last ) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
 : m_flat_tree(true, first, last, comp, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_map
 //! and inserts elements from the ordered range [first ,last). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_map(ordered_unique_range_t, InputIterator first, InputIterator last)
 : m_flat_tree(ordered_range, first, last)
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! inserts elements from the ordered range [first ,last). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp)
 : m_flat_tree(ordered_range, first, last, comp)
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! allocator, and inserts elements from the ordered range [first ,last). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
 : m_flat_tree(ordered_range, first, last, comp, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_map using the specified allocator and
 //! inserts elements from the ordered range [first ,last). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const allocator_type& a)
 : m_flat_tree(ordered_range, first, last, Compare(), a)
 {}

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 //! Effects: Constructs an empty flat_map and
 //! inserts elements from the range [il.begin() ,il.end()).
 //!
 //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il)
 : m_flat_tree( true
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end())
 {}

//! Effects: Constructs an empty flat_map using the specified
 //! allocator, and inserts elements from the range [il.begin() ,il.end()).
 //!
 //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const allocator_type& a)
 : m_flat_tree( true
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end()
 , dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! inserts elements from the range [il.begin() ,il.end()).
 //!
 //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const Compare& comp)
 : m_flat_tree(true
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end()
 , comp)
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! allocator, and inserts elements from the range [il.begin() ,il.end()).
 //!
 //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
 : m_flat_tree(true
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end()
 , comp
 , dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_map using and
 //! inserts elements from the ordered unique range [il.begin(), il.end()). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
 //! unique values.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il)
 : m_flat_tree(ordered_unique_range
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end())
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! inserts elements from the ordered unique range [il.begin(), il.end()). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
 //! unique values.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp)
 : m_flat_tree(ordered_unique_range
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end()
 , comp)
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
 //! unique values.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
 : m_flat_tree( ordered_unique_range
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end()
 , comp
 , dtl::force<const impl_allocator_type>(a))
 {}
#endif

//! Effects: Copy constructs a flat_map.
 //!
 //! Complexity: Linear in x.size().
 BOOST_CONTAINER_FORCEINLINE flat_map(const flat_map& x)
 : m_flat_tree(x.m_flat_tree)
 {}

//! Effects: Move constructs a flat_map.
 //! Constructs *this using x's resources.
 //!
 //! Complexity: Constant.
 //!
 //! Postcondition: x is emptied.
 BOOST_CONTAINER_FORCEINLINE flat_map(BOOST_RV_REF(flat_map) x)
 BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
 : m_flat_tree(boost::move(x.m_flat_tree))
 {}

//! Effects: Copy constructs a flat_map using the specified allocator.
 //!
 //! Complexity: Linear in x.size().
 BOOST_CONTAINER_FORCEINLINE flat_map(const flat_map& x, const allocator_type &a)
 : m_flat_tree(x.m_flat_tree, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Move constructs a flat_map using the specified allocator.
 //! Constructs *this using x's resources.
 //!
 //! Complexity: Constant if x.get_allocator() == a, linear otherwise.
 BOOST_CONTAINER_FORCEINLINE flat_map(BOOST_RV_REF(flat_map) x, const allocator_type &a)
 : m_flat_tree(boost::move(x.m_flat_tree), dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Makes *this a copy of x.
 //!
 //! Complexity: Linear in x.size().
 BOOST_CONTAINER_FORCEINLINE flat_map& operator=(BOOST_COPY_ASSIGN_REF(flat_map) x)
 { m_flat_tree = x.m_flat_tree; return *this; }

//! Effects: Move constructs a flat_map.
 //! Constructs *this using x's resources.
 //!
 //! Throws: If allocator_traits_type::propagate_on_container_move_assignment
 //! is false and (allocation throws or value_type's move constructor throws)
 //!
 //! Complexity: Constant if allocator_traits_type::
 //! propagate_on_container_move_assignment is true or
 //! this->get>allocator() == x.get_allocator(). Linear otherwise.
 BOOST_CONTAINER_FORCEINLINE flat_map& operator=(BOOST_RV_REF(flat_map) x)
 BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
 allocator_traits_type::is_always_equal::value) &&
 boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
 { m_flat_tree = boost::move(x.m_flat_tree); return *this; }

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 //! Effects: Assign elements from il to *this
 flat_map& operator=(std::initializer_list<value_type> il)
 {
 this->clear();
 this->insert(il.begin(), il.end());
 return *this;
 }
#endif

//! Effects: Returns a copy of the allocator that
 //! was passed to the object's constructor.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<allocator_type>(m_flat_tree.get_allocator()); }

//! Effects: Returns a reference to the internal allocator.
 //!
 //! Throws: Nothing
 //!
 //! Complexity: Constant.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE get_stored_allocator_noconst_return_t get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
 {
 impl_get_stored_allocator_noconst_return_t r = m_flat_tree.get_stored_allocator();
 return dtl::force<stored_allocator_type>(r);
 }

//! Effects: Returns a reference to the internal allocator.
 //!
 //! Throws: Nothing
 //!
 //! Complexity: Constant.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE get_stored_allocator_const_return_t get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
 {
 impl_get_stored_allocator_const_return_t r = m_flat_tree.get_stored_allocator();
 return dtl::force<const stored_allocator_type>(r);
 }

//////////////////////////////////////////////
   //
   //                iterators
   //
   //////////////////////////////////////////////

//! Effects: Returns an iterator to the first element contained in the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<iterator>(m_flat_tree.begin()); }

//! Effects: Returns a const_iterator to the first element contained in the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_iterator>(m_flat_tree.begin()); }

//! Effects: Returns an iterator to the end of the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE iterator end() BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<iterator>(m_flat_tree.end()); }

//! Effects: Returns a const_iterator to the end of the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_iterator>(m_flat_tree.end()); }

//! Effects: Returns a reverse_iterator pointing to the beginning
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<reverse_iterator>(m_flat_tree.rbegin()); }

//! Effects: Returns a const_reverse_iterator pointing to the beginning
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rbegin()); }

//! Effects: Returns a reverse_iterator pointing to the end
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<reverse_iterator>(m_flat_tree.rend()); }

//! Effects: Returns a const_reverse_iterator pointing to the end
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rend()); }

//! Effects: Returns a const_iterator to the first element contained in the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_iterator>(m_flat_tree.cbegin()); }

//! Effects: Returns a const_iterator to the end of the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_iterator>(m_flat_tree.cend()); }

//! Effects: Returns a const_reverse_iterator pointing to the beginning
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crbegin()); }

//! Effects: Returns a const_reverse_iterator pointing to the end
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crend()); }

//////////////////////////////////////////////
   //
   //                capacity
   //
   //////////////////////////////////////////////

//! Effects: Returns true if the container contains no elements.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE bool empty() const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.empty(); }

//! Effects: Returns the number of the elements contained in the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE size_type size() const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.size(); }

//! Effects: Returns the largest possible size of the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.max_size(); }

//! Effects: Number of elements for which memory has been allocated.
 //! capacity() is always greater than or equal to size().
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.capacity(); }

//! Effects: If n is less than or equal to capacity(), or the
 //! underlying container has no `reserve` member, this call has no
 //! effect. Otherwise, it is a request for allocation of additional memory.
 //! If the request is successful, then capacity() is greater than or equal to
 //! n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
 //!
 //! Throws: If memory allocation allocation throws or T's copy constructor throws.
 //!
 //! Note: If capacity() is less than "cnt", iterators and references to
 //! to values might be invalidated.
 BOOST_CONTAINER_FORCEINLINE void reserve(size_type cnt)
 { m_flat_tree.reserve(cnt); }

//! Effects: Tries to deallocate the excess of memory created
 // with previous allocations. The size of the vector is unchanged
 //!
 //! Throws: If memory allocation throws, or T's copy constructor throws.
 //!
 //! Complexity: Linear to size().
 BOOST_CONTAINER_FORCEINLINE void shrink_to_fit()
 { m_flat_tree.shrink_to_fit(); }

//////////////////////////////////////////////
   //
   //               element access
   //
   //////////////////////////////////////////////

#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
   //! Effects: If there is no key equivalent to x in the flat_map, inserts
   //!   value_type(x, T()) into the flat_map.
   //!
   //! Returns: A reference to the mapped_type corresponding to x in *this.
   //!
   //! Complexity: Logarithmic search time plus linear insertion time in case no equivalent key is present.
   mapped_type &operator[](const key_type& k);

//! Effects: If there is no key equivalent to x in the flat_map, inserts
   //! value_type(move(x), T()) into the flat_map (the key is move-constructed)
   //!
   //! Returns: A reference to the mapped_type corresponding to x in *this.
   //!
   //! Complexity: Logarithmic search time plus linear insertion time in case no equivalent key is present.
   mapped_type &operator[](key_type &&k);
   #elif defined(BOOST_MOVE_HELPERS_RETURN_SFINAE_BROKEN)
      //in compilers like GCC 3.4, we can't catch temporaries
      BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](const key_type &k)         {  return this->priv_subscript(k);  }
      BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](BOOST_RV_REF(key_type) k)  {  return this->priv_subscript(::boost::move(k));  }
   #else
      BOOST_MOVE_CONVERSION_AWARE_CATCH( operator[] , key_type, mapped_type&, this->priv_subscript)
   #endif

//! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
 //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
 //! as if by insert, constructing it from value_type(k, forward<M>(obj)).
 //! 
 //! No iterators or references are invalidated. If the insertion is successful, pointers and references
 //! to the element obtained while it is held in the node handle are invalidated, and pointers and
 //! references obtained to that element before it was extracted become valid.
 //!
 //! Returns: The bool component is true if the insertion took place and false if the assignment
 //! took place. The iterator component is pointing at the element that was inserted or updated.
 //!
 //! Complexity: Logarithmic search time plus linear insertion time in case no equivalent key is present.
 template <class M>
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(const key_type& k, BOOST_FWD_REF(M) obj)
 {
 return dtl::force_copy< std::pair<iterator, bool> >
 (this->m_flat_tree.insert_or_assign
 ( impl_const_iterator(), k, ::boost::forward<M>(obj))
 );
 }

//! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
 //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
 //! as if by insert, constructing it from value_type(k, move(obj)).
 //! 
 //! No iterators or references are invalidated. If the insertion is successful, pointers and references
 //! to the element obtained while it is held in the node handle are invalidated, and pointers and
 //! references obtained to that element before it was extracted become valid.
 //!
 //! Returns: The bool component is true if the insertion took place and false if the assignment
 //! took place. The iterator component is pointing at the element that was inserted or updated.
 //!
 //! Complexity: Logarithmic in the size of the container.
 template <class M>
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
 {
 return dtl::force_copy< std::pair<iterator, bool> >
 (this->m_flat_tree.insert_or_assign
 ( impl_const_iterator(), ::boost::move(k), ::boost::forward<M>(obj))
 );
 }

//! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
 //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
 //! as if by insert, constructing it from value_type(k, forward<M>(obj)) and the new element
 //! to the container as close as possible to the position just before hint.
 //! 
 //! No iterators or references are invalidated. If the insertion is successful, pointers and references
 //! to the element obtained while it is held in the node handle are invalidated, and pointers and
 //! references obtained to that element before it was extracted become valid.
 //!
 //! Returns: The bool component is true if the insertion took place and false if the assignment
 //! took place. The iterator component is pointing at the element that was inserted or updated.
 //!
 //! Complexity: Logarithmic in the size of the container in general, but amortized constant if
 //! the new element is inserted just before hint.
 template <class M>
 BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, const key_type& k, BOOST_FWD_REF(M) obj)
 {
 return dtl::force_copy<iterator>
 (this->m_flat_tree.insert_or_assign
 ( dtl::force_copy<impl_const_iterator>(hint)
 , k, ::boost::forward<M>(obj)).first
 );
 }

//! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
 //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
 //! as if by insert, constructing it from value_type(k, move(obj)) and the new element
 //! to the container as close as possible to the position just before hint.
 //! 
 //! No iterators or references are invalidated. If the insertion is successful, pointers and references
 //! to the element obtained while it is held in the node handle are invalidated, and pointers and
 //! references obtained to that element before it was extracted become valid.
 //!
 //! Returns: The bool component is true if the insertion took place and false if the assignment
 //! took place. The iterator component is pointing at the element that was inserted or updated.
 //!
 //! Complexity: Logarithmic in the size of the container in general, but amortized constant if
 //! the new element is inserted just before hint.
 template <class M>
 BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
 {
 return dtl::force_copy<iterator>
 (this->m_flat_tree.insert_or_assign
 ( dtl::force_copy<impl_const_iterator>(hint)
 , ::boost::move(k), ::boost::forward<M>(obj)).first
 );
 }

//! @copydoc ::boost::container::flat_set::nth(size_type)
 BOOST_CONTAINER_FORCEINLINE iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }

//! @copydoc ::boost::container::flat_set::nth(size_type) const
 BOOST_CONTAINER_FORCEINLINE const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }

//! @copydoc ::boost::container::flat_set::index_of(iterator)
 BOOST_CONTAINER_FORCEINLINE size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.index_of(dtl::force_copy<impl_iterator>(p)); }

//! @copydoc ::boost::container::flat_set::index_of(const_iterator) const
 BOOST_CONTAINER_FORCEINLINE size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.index_of(dtl::force_copy<impl_const_iterator>(p)); }

//! Returns: A reference to the element whose key is equivalent to x.
   //!
   //! Throws: An exception object of type out_of_range if no such element is present.
   //!
   //! Complexity: logarithmic.
   T& at(const key_type& k)
   {
      iterator i = this->find(k);
      if(i == this->end()){
         throw_out_of_range("flat_map::at key not found");
      }
      return i->second;
   }

//! Returns: A reference to the element whose key is equivalent to x.
   //!
   //! Throws: An exception object of type out_of_range if no such element is present.
   //!
   //! Complexity: logarithmic.
   const T& at(const key_type& k) const
   {
      const_iterator i = this->find(k);
      if(i == this->end()){
         throw_out_of_range("flat_map::at key not found");
      }
      return i->second;
   }

//////////////////////////////////////////////
   //
   //                modifiers
   //
   //////////////////////////////////////////////

#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)

//! Effects: Inserts an object x of type T constructed with
 //! std::forward<Args>(args)... if and only if there is no element in the container
 //! with key equivalent to the key of x.
 //!
 //! Returns: The bool component of the returned pair is true if and only
 //! if the insertion takes place, and the iterator component of the pair
 //! points to the element with key equivalent to the key of x.
 //!
 //! Complexity: Logarithmic search time plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 template <class... Args>
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_FWD_REF(Args)... args)
 { return dtl::force_copy< std::pair<iterator, bool> >(m_flat_tree.emplace_unique(boost::forward<Args>(args)...)); }

//! Effects: Inserts an object of type T constructed with
 //! std::forward<Args>(args)... in the container if and only if there is
 //! no element in the container with key equivalent to the key of x.
 //! p is a hint pointing to where the insert should start to search.
 //!
 //! Returns: An iterator pointing to the element with key equivalent
 //! to the key of x.
 //!
 //! Complexity: Logarithmic search time (constant if x is inserted
 //! right before p) plus insertion linear to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 template <class... Args>
 BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
 {
 return dtl::force_copy<iterator>
 (m_flat_tree.emplace_hint_unique( dtl::force_copy<impl_const_iterator>(hint)
 , boost::forward<Args>(args)...));
 }

//! Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, 
 //! forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).
 //! 
 //! Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
 //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),
 //! forward_as_tuple(forward<Args>(args)...).
 //! 
 //! Returns: The bool component of the returned pair is true if and only if the
 //! insertion took place. The returned iterator points to the map element whose key is equivalent to k.
 //! 
 //! Complexity: Logarithmic.
 template <class... Args>
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(const key_type& k, BOOST_FWD_REF(Args)... args)
 {
 return dtl::force_copy< std::pair<iterator, bool> >(
 m_flat_tree.try_emplace(impl_const_iterator(), k, boost::forward<Args>(args)...));
 }

//! Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, 
 //! forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).
 //! 
 //! Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
 //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),
 //! forward_as_tuple(forward<Args>(args)...).
 //! 
 //! Returns: The returned iterator points to the map element whose key is equivalent to k.
 //! 
 //! Complexity: Logarithmic in general, but amortized constant if value
 //! is inserted right before p.
 template <class... Args>
 BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k, BOOST_FWD_REF(Args)... args)
 {
 return dtl::force_copy<iterator>(m_flat_tree.try_emplace
 (dtl::force_copy<impl_const_iterator>(hint), k, boost::forward<Args>(args)...).first);
 }

//! Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, 
 //! forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).
 //! 
 //! Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
 //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),
 //! forward_as_tuple(forward<Args>(args)...).
 //! 
 //! Returns: The bool component of the returned pair is true if and only if the
 //! insertion took place. The returned iterator points to the map element whose key is equivalent to k.
 //! 
 //! Complexity: Logarithmic search time plus linear insertion time in case the key is not present.
 template <class... Args>
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
 {
 return dtl::force_copy< std::pair<iterator, bool> >
 (m_flat_tree.try_emplace(impl_const_iterator(), boost::move(k), boost::forward<Args>(args)...));
 }

//! Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, 
 //! forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).
 //! 
 //! Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
 //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),
 //! forward_as_tuple(forward<Args>(args)...).
 //! 
 //! Returns: The returned iterator points to the map element whose key is equivalent to k.
 //! 
 //! Complexity: Logarithmic in general, but amortized constant if value
 //! is inserted right before p. Linear insertion time in case no equivalent key is present.
 template <class... Args>
 BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
 {
 return dtl::force_copy<iterator>
 (m_flat_tree.try_emplace(dtl::force_copy
 <impl_const_iterator>(hint), boost::move(k), boost::forward<Args>(args)...).first);
 }

#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)

#define BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE(N) \
 BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_MOVE_UREF##N)\
 {\
 return dtl::force_copy< std::pair<iterator, bool> >\
 (m_flat_tree.emplace_unique(BOOST_MOVE_FWD##N));\
 }\
 \
 BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
 BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
 {\
 return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_unique\
 (dtl::force_copy<impl_const_iterator>(hint) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
 }\
 BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(const key_type& k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
 {\
 return dtl::force_copy< std::pair<iterator, bool> >\
 (m_flat_tree.try_emplace(impl_const_iterator(), k BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
 }\
 \
 BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
 BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
 { return dtl::force_copy<iterator>(m_flat_tree.try_emplace\
 (dtl::force_copy<impl_const_iterator>(hint), k BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first); }\
 \
 BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
 {\
 return dtl::force_copy< std::pair<iterator, bool> >\
 (m_flat_tree.try_emplace(impl_const_iterator(), boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
 }\
 \
 BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
 BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
 { return dtl::force_copy<iterator>(m_flat_tree.try_emplace\
 (dtl::force_copy<impl_const_iterator>(hint), boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first); }\
 //
 BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE)
 #undef BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE

#endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)

//! Effects: Inserts x if and only if there is no element in the container
 //! with key equivalent to the key of x.
 //!
 //! Returns: The bool component of the returned pair is true if and only
 //! if the insertion takes place, and the iterator component of the pair
 //! points to the element with key equivalent to the key of x.
 //!
 //! Complexity: Logarithmic search time plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> insert(const value_type& x)
 { return dtl::force_copy<std::pair<iterator,bool> >(
 m_flat_tree.insert_unique(dtl::force<const impl_value_type>(x))); }

//! Effects: Inserts a new value_type move constructed from the pair if and
 //! only if there is no element in the container with key equivalent to the key of x.
 //!
 //! Returns: The bool component of the returned pair is true if and only
 //! if the insertion takes place, and the iterator component of the pair
 //! points to the element with key equivalent to the key of x.
 //!
 //! Complexity: Logarithmic search time plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> insert(BOOST_RV_REF(value_type) x)
 { return dtl::force_copy<std::pair<iterator,bool> >(
 m_flat_tree.insert_unique(boost::move(dtl::force<impl_value_type>(x)))); }

//! Effects: Inserts a new value_type move constructed from the pair if and
 //! only if there is no element in the container with key equivalent to the key of x.
 //!
 //! Returns: The bool component of the returned pair is true if and only
 //! if the insertion takes place, and the iterator component of the pair
 //! points to the element with key equivalent to the key of x.
 //!
 //! Complexity: Logarithmic search time plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> insert(BOOST_RV_REF(movable_value_type) x)
 {
 return dtl::force_copy<std::pair<iterator,bool> >
 (m_flat_tree.insert_unique(boost::move(x)));
 }

//! Effects: Inserts a copy of x in the container if and only if there is
 //! no element in the container with key equivalent to the key of x.
 //! p is a hint pointing to where the insert should start to search.
 //!
 //! Returns: An iterator pointing to the element with key equivalent
 //! to the key of x.
 //!
 //! Complexity: Logarithmic search time (constant if x is inserted
 //! right before p) plus insertion linear to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
 {
 return dtl::force_copy<iterator>(
 m_flat_tree.insert_unique( dtl::force_copy<impl_const_iterator>(p)
 , dtl::force<const impl_value_type>(x)));
 }

//! Effects: Inserts an element move constructed from x in the container.
 //! p is a hint pointing to where the insert should start to search.
 //!
 //! Returns: An iterator pointing to the element with key equivalent to the key of x.
 //!
 //! Complexity: Logarithmic search time (constant if x is inserted
 //! right before p) plus insertion linear to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(value_type) x)
 {
 return dtl::force_copy<iterator>
 (m_flat_tree.insert_unique( dtl::force_copy<impl_const_iterator>(p)
 , boost::move(dtl::force<impl_value_type>(x))));
 }

//! Effects: Inserts an element move constructed from x in the container.
 //! p is a hint pointing to where the insert should start to search.
 //!
 //! Returns: An iterator pointing to the element with key equivalent to the key of x.
 //!
 //! Complexity: Logarithmic search time (constant if x is inserted
 //! right before p) plus insertion linear to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(movable_value_type) x)
 {
 return dtl::force_copy<iterator>(
 m_flat_tree.insert_unique(dtl::force_copy<impl_const_iterator>(p), boost::move(x)));
 }

//! Requires: first, last are not iterators into *this.
 //!
 //! Effects: inserts each element from the range [first,last) if and only
 //! if there is no element with key equivalent to the key of that element.
 //!
 //! Complexity: N log(size()+N).
 //!
 //! Note: If an element is inserted it might invalidate elements.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
 { m_flat_tree.insert_unique(first, last); }

//! Requires: first, last are not iterators into *this.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate and must be
 //! unique values.
 //!
 //! Effects: inserts each element from the range [first,last) if and only
 //! if there is no element with key equivalent to the key of that element. This
 //! function is more efficient than the normal range creation for ordered ranges.
 //!
 //! Complexity: Linear.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE void insert(ordered_unique_range_t, InputIterator first, InputIterator last)
 { m_flat_tree.insert_unique(ordered_unique_range, first, last); }

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 //! Effects: inserts each element from the range [il.begin(), il.end()) if and only
 //! if there is no element with key equivalent to the key of that element.
 //!
 //! Complexity: N log(N).
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list<value_type> il)
 {
 m_flat_tree.insert_unique( dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end());
 }

//! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be
 //! unique values.
 //!
 //! Effects: inserts each element from the range [il.begin(), il.end()) if and only
 //! if there is no element with key equivalent to the key of that element. This
 //! function is more efficient than the normal range creation for ordered ranges.
 //!
 //! Complexity: Linear.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE void insert(ordered_unique_range_t, std::initializer_list<value_type> il)
 {
 m_flat_tree.insert_unique(ordered_unique_range
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end());
 }
#endif

//! Requires: this->get_allocator() == source.get_allocator().
 //!
 //! Effects: Attempts to extract each element in source and insert it into a using
 //! the comparison object of *this. If there is an element in a with key equivalent to the
 //! key of an element from source, then that element is not extracted from source.
 //! 
 //! Postcondition: Pointers and references to the transferred elements of source refer
 //! to those same elements but as members of *this. Iterators referring to the transferred
 //! elements will continue to refer to their elements, but they now behave as iterators into *this,
 //! not into source.
 //!
 //! Throws: Nothing unless the comparison object throws.
 //!
 //! Complexity: N log(size() + N) (N has the value source.size())
 template<class C2>
 BOOST_CONTAINER_FORCEINLINE void merge(flat_map<Key, T, C2, AllocatorOrContainer>& source)
 { m_flat_tree.merge_unique(source.tree()); }

//! @copydoc ::boost::container::flat_map::merge(flat_map<Key, T, C2, AllocatorOrContainer>&)
 template<class C2>
 BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_map<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
 { return this->merge(static_cast<flat_map<Key, T, C2, AllocatorOrContainer>&>(source)); }

//! @copydoc ::boost::container::flat_map::merge(flat_map<Key, T, C2, AllocatorOrContainer>&)
 template<class C2>
 BOOST_CONTAINER_FORCEINLINE void merge(flat_multimap<Key, T, C2, AllocatorOrContainer>& source)
 { m_flat_tree.merge_unique(source.tree()); }

//! @copydoc ::boost::container::flat_map::merge(flat_map<Key, T, C2, AllocatorOrContainer>&)
 template<class C2>
 BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_multimap<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
 { return this->merge(static_cast<flat_multimap<Key, T, C2, AllocatorOrContainer>&>(source)); }

//! Effects: Erases the element pointed to by p.
 //!
 //! Returns: Returns an iterator pointing to the element immediately
 //! following q prior to the element being erased. If no such element exists,
 //! returns end().
 //!
 //! Complexity: Linear to the elements with keys bigger than p
 //!
 //! Note: Invalidates elements with keys
 //! not less than the erased element.
 BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator p)
 {
 return dtl::force_copy<iterator>
 (m_flat_tree.erase(dtl::force_copy<impl_const_iterator>(p)));
 }

//! Effects: Erases all elements in the container with key equivalent to x.
 //!
 //! Returns: Returns the number of erased elements.
 //!
 //! Complexity: Logarithmic search time plus erasure time
 //! linear to the elements with bigger keys.
 BOOST_CONTAINER_FORCEINLINE size_type erase(const key_type& x)
 { return m_flat_tree.erase(x); }

//! Effects: Erases all the elements in the range [first, last).
 //!
 //! Returns: Returns last.
 //!
 //! Complexity: size()*N where N is the distance from first to last.
 //!
 //! Complexity: Logarithmic search time plus erasure time
 //! linear to the elements with bigger keys.
 BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator first, const_iterator last)
 {
 return dtl::force_copy<iterator>(
 m_flat_tree.erase( dtl::force_copy<impl_const_iterator>(first)
 , dtl::force_copy<impl_const_iterator>(last)));
 }

//! Effects: Swaps the contents of *this and x.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE void swap(flat_map& x)
 BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
 && boost::container::dtl::is_nothrow_swappable<Compare>::value )
 { m_flat_tree.swap(x.m_flat_tree); }

//! Effects: erase(begin(),end()).
 //!
 //! Postcondition: size() == 0.
 //!
 //! Complexity: linear in size().
 BOOST_CONTAINER_FORCEINLINE void clear() BOOST_NOEXCEPT_OR_NOTHROW
 { m_flat_tree.clear(); }

//////////////////////////////////////////////
   //
   //                observers
   //
   //////////////////////////////////////////////

//! Effects: Returns the comparison object out
 //! of which a was constructed.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE key_compare key_comp() const
 { return dtl::force_copy<key_compare>(m_flat_tree.key_comp()); }

//! Effects: Returns an object of value_compare constructed out
 //! of the comparison object.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE value_compare value_comp() const
 { return value_compare(dtl::force_copy<key_compare>(m_flat_tree.key_comp())); }

//////////////////////////////////////////////
   //
   //              map operations
   //
   //////////////////////////////////////////////

//! Returns: An iterator pointing to an element with the key
 //! equivalent to x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 BOOST_CONTAINER_FORCEINLINE iterator find(const key_type& x)
 { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }

//! Returns: A const_iterator pointing to an element with the key
 //! equivalent to x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 BOOST_CONTAINER_FORCEINLINE const_iterator find(const key_type& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: An iterator pointing to an element with the key
 //! equivalent to x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 template<class K>
 BOOST_CONTAINER_FORCEINLINE iterator find(const K& x)
 { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: A const_iterator pointing to an element with the key
 //! equivalent to x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 template<class K>
 BOOST_CONTAINER_FORCEINLINE const_iterator find(const K& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }

//! Returns: The number of elements with key equivalent to x.
 //!
 //! Complexity: log(size())+count(k)
 BOOST_CONTAINER_FORCEINLINE size_type count(const key_type& x) const
 { return static_cast<size_type>(m_flat_tree.find(x) != m_flat_tree.end()); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: The number of elements with key equivalent to x.
 //!
 //! Complexity: log(size())+count(k)
 template<class K>
 BOOST_CONTAINER_FORCEINLINE size_type count(const K& x) const
 //Don't use find() != end optimization here as transparent comparators with key K might
 //return a different range than key_type (which can only return a single element range)
 { return m_flat_tree.count(x); }

//! Returns: Returns true if there is an element with key
 //! equivalent to key in the container, otherwise false.
 //!
 //! Complexity: log(size()).
 bool contains(const key_type& x) const
 { return m_flat_tree.find(x) != m_flat_tree.end(); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: Returns true if there is an element with key
 //! equivalent to key in the container, otherwise false.
 //!
 //! Complexity: log(size()).
 template<typename K>
 bool contains(const K& x) const
 { return m_flat_tree.find(x) != m_flat_tree.end(); }

//! Returns: An iterator pointing to the first element with key not less
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 BOOST_CONTAINER_FORCEINLINE iterator lower_bound(const key_type& x)
 { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }

//! Returns: A const iterator pointing to the first element with key not
 //! less than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const key_type& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: An iterator pointing to the first element with key not less
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 template<class K>
 BOOST_CONTAINER_FORCEINLINE iterator lower_bound(const K& x)
 { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: A const iterator pointing to the first element with key not
 //! less than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 template<class K>
 BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const K& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }

//! Returns: An iterator pointing to the first element with key greater
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 BOOST_CONTAINER_FORCEINLINE iterator upper_bound(const key_type& x)
 { return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }

//! Returns: A const iterator pointing to the first element with key
 //! greater than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 BOOST_CONTAINER_FORCEINLINE const_iterator upper_bound(const key_type& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: An iterator pointing to the first element with key greater
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 template<class K>
 BOOST_CONTAINER_FORCEINLINE iterator upper_bound(const K& x)
 { return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: A const iterator pointing to the first element with key
 //! greater than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 template<class K>
 BOOST_CONTAINER_FORCEINLINE const_iterator upper_bound(const K& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }

//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
 //!
 //! Complexity: Logarithmic.
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator,iterator> equal_range(const key_type& x)
 { return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.lower_bound_range(x)); }

//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
 //!
 //! Complexity: Logarithmic.
 BOOST_CONTAINER_FORCEINLINE std::pair<const_iterator, const_iterator> equal_range(const key_type& x) const
 { return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.lower_bound_range(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
 //!
 //! Complexity: Logarithmic.
 template<class K>
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator,iterator> equal_range(const K& x)
 //Don't use lower_bound_range optimization here as transparent comparators with key K might
 //return a different range than key_type (which can only return a single element range)
 { return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.equal_range(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
 //!
 //! Complexity: Logarithmic.
 template<class K>
 BOOST_CONTAINER_FORCEINLINE std::pair<const_iterator, const_iterator> equal_range(const K& x) const
 //Don't use lower_bound_range optimization here as transparent comparators with key K might
 //return a different range than key_type (which can only return a single element range)
 { return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x)); }

//! Effects: Extracts the internal sequence container.
 //!
 //! Complexity: Same as the move constructor of sequence_type, usually constant.
 //!
 //! Postcondition: this->empty()
 //!
 //! Throws: If secuence_type's move constructor throws 
 BOOST_CONTAINER_FORCEINLINE sequence_type extract_sequence()
 {
 return boost::move(dtl::force<sequence_type>(m_flat_tree.get_sequence_ref()));
 }

//! Effects: Discards the internally hold sequence container and adopts the
 //! one passed externally using the move assignment. Erases non-unique elements.
 //!
 //! Complexity: Assuming O(1) move assignment, O(NlogN) with N = seq.size()
 //!
 //! Throws: If the comparison or the move constructor throws
 BOOST_CONTAINER_FORCEINLINE void adopt_sequence(BOOST_RV_REF(sequence_type) seq)
 { this->m_flat_tree.adopt_sequence_unique(boost::move(dtl::force<impl_sequence_type>(seq))); }

//! Requires: seq shall be ordered according to this->compare()
 //! and shall contain unique elements.
 //!
 //! Effects: Discards the internally hold sequence container and adopts the
 //! one passed externally using the move assignment.
 //!
 //! Complexity: Assuming O(1) move assignment, O(1)
 //!
 //! Throws: If the move assignment throws
 BOOST_CONTAINER_FORCEINLINE void adopt_sequence(ordered_unique_range_t, BOOST_RV_REF(sequence_type) seq)
 { this->m_flat_tree.adopt_sequence_unique(ordered_unique_range_t(), boost::move(dtl::force<impl_sequence_type>(seq))); }

//! Effects: Returns true if x and y are equal
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator==(const flat_map& x, const flat_map& y)
 { return x.size() == y.size() && ::boost::container::algo_equal(x.begin(), x.end(), y.begin()); }

//! Effects: Returns true if x and y are unequal
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator!=(const flat_map& x, const flat_map& y)
 { return !(x == y); }

//! Effects: Returns true if x is less than y
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator<(const flat_map& x, const flat_map& y)
 { return ::boost::container::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end()); }

//! Effects: Returns true if x is greater than y
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator>(const flat_map& x, const flat_map& y)
 { return y < x; }

//! Effects: Returns true if x is equal or less than y
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator<=(const flat_map& x, const flat_map& y)
 { return !(y < x); }

//! Effects: Returns true if x is equal or greater than y
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator>=(const flat_map& x, const flat_map& y)
 { return !(x < y); }

//! Effects: x.swap(y)
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE friend void swap(flat_map& x, flat_map& y)
 { x.swap(y); }

#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
 private:
 mapped_type &priv_subscript(const key_type& k)
 {
 iterator i = lower_bound(k);
 // i->first is greater than or equivalent to k.
 if (i == end() || key_comp()(k, (*i).first)){
 dtl::value_init<mapped_type> m;
 i = insert(i, impl_value_type(k, ::boost::move(m.m_t)));
 }
 return (*i).second;
 }
 mapped_type &priv_subscript(BOOST_RV_REF(key_type) mk)
 {
 key_type &k = mk;
 iterator i = lower_bound(k);
 // i->first is greater than or equivalent to k.
 if (i == end() || key_comp()(k, (*i).first)){
 dtl::value_init<mapped_type> m;
 i = insert(i, impl_value_type(boost::move(k), ::boost::move(m.m_t)));
 }
 return (*i).second;
 }
 #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
};

#ifndef BOOST_CONTAINER_NO_CXX17_CTAD

template <typename InputIterator>
flat_map(InputIterator, InputIterator) ->
 flat_map< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>>;

template < typename InputIterator, typename AllocatorOrCompare>
 flat_map(InputIterator, InputIterator, AllocatorOrCompare const&) ->
 flat_map< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>
 , typename dtl::if_c< // Compare
 dtl::is_allocator<AllocatorOrCompare>::value
 , std::less<it_based_non_const_first_type_t<InputIterator>>
 , AllocatorOrCompare
 >::type
 , typename dtl::if_c< // Allocator
 dtl::is_allocator<AllocatorOrCompare>::value
 , AllocatorOrCompare
 , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
 >::type
 >;

template < typename InputIterator, typename Compare, typename Allocator
 , typename = dtl::require_nonallocator_t<Compare>
 , typename = dtl::require_allocator_t<Allocator>>
flat_map(InputIterator, InputIterator, Compare const&, Allocator const&) ->
 flat_map< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>
 , Compare
 , Allocator>;

template <typename InputIterator>
flat_map(ordered_unique_range_t, InputIterator, InputIterator) ->
 flat_map< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>>;

template < typename InputIterator, typename AllocatorOrCompare>
flat_map(ordered_unique_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
 flat_map< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>
 , typename dtl::if_c< // Compare
 dtl::is_allocator<AllocatorOrCompare>::value
 , std::less<it_based_non_const_first_type_t<InputIterator>>
 , AllocatorOrCompare
 >::type
 , typename dtl::if_c< // Allocator
 dtl::is_allocator<AllocatorOrCompare>::value
 , AllocatorOrCompare
 , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
 >::type
 >;

template < typename InputIterator, typename Compare, typename Allocator
 , typename = dtl::require_nonallocator_t<Compare>
 , typename = dtl::require_allocator_t<Allocator>>
flat_map(ordered_unique_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
 flat_map< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>
 , Compare
 , Allocator>;

#endif

#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

}  //namespace container {

//!has_trivial_destructor_after_move<> == true_type
//!specialization for optimizations
template <class Key, class T, class Compare, class AllocatorOrContainer>
struct has_trivial_destructor_after_move<boost::container::flat_map<Key, T, Compare, AllocatorOrContainer> >
{
 typedef ::boost::container::dtl::pair<Key, T> value_t;
 typedef typename ::boost::container::dtl::container_or_allocator_rebind<AllocatorOrContainer, value_t>::type alloc_or_cont_t;
 typedef ::boost::container::dtl::flat_tree<value_t,::boost::container::dtl::select1st<Key>, Compare, alloc_or_cont_t> tree;
 static const bool value = ::boost::has_trivial_destructor_after_move<tree>::value;
};

namespace container {

#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

//! 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. 
//!
//! A flat_multimap satisfies all of the requirements of a container and of a reversible
//! container and of an associative container. For a
//! flat_multimap<Key,T> the key_type is Key and the value_type is std::pair<Key,T>
//! (unlike std::multimap<Key, T> which value_type is std::pair<const Key, T>).
//!
//! flat_multimap is similar to std::multimap but it's implemented by as an ordered sequence container.
//! The underlying sequence container is by default vector but it can also work
//! user-provided vector-like SequenceContainers (like static_vector or small_vector).
//!
//! Using vector-like sequence containers means that inserting a new element into a flat_multimap might invalidate
//! previous iterators and references (unless that sequence container is stable_vector or a similar
//! container that offers stable pointers and references). Similarly, erasing an element might invalidate
//! iterators and references pointing to elements that come after (their keys are bigger) the erased element.
//!
//! This container provides random-access iterators.
//!
//! \tparam Key is the key_type of the map
//! \tparam Value is the <code>mapped_type</code>
//! \tparam Compare is the ordering function for Keys (e.g. std::less<Key>).
//! \tparam AllocatorOrContainer is either:
//! - The allocator to allocate <code>value_type</code>s (e.g. allocator< std::pair<Key, T> > ).
//! (in this case sequence_type will be vector<value_type, AllocatorOrContainer>)
//! - The SequenceContainer to be used as the underlying sequence_type. It must be a vector-like
//! sequence container with random-access iterators.
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
template <class Key, class T, class Compare = std::less<Key>, class AllocatorOrContainer = new_allocator< std::pair< Key, T> > >
#else
template <class Key, class T, class Compare, class AllocatorOrContainer>
#endif
class flat_multimap
{
 #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
 private:
 BOOST_COPYABLE_AND_MOVABLE(flat_multimap)
 typedef dtl::flat_tree<
 std::pair<Key, T>,
 dtl::select1st<Key>,
 Compare,
 AllocatorOrContainer> tree_t;
 //This is the real tree stored here. It's based on a movable pair
 typedef dtl::flat_tree<
 dtl::pair<Key, T>,
 dtl::select1st<Key>,
 Compare,
 typename dtl::container_or_allocator_rebind<AllocatorOrContainer, dtl::pair<Key, T> >::type
 > impl_tree_t;
 impl_tree_t m_flat_tree; // flat tree representing flat_map

typedef dtl::flat_tree_value_compare
 < Compare
 , dtl::select1st<Key>
 , std::pair<Key, T> > value_compare_t;
 typedef typename tree_t::iterator iterator_t;
 typedef typename tree_t::const_iterator const_iterator_t;
 typedef typename tree_t::reverse_iterator reverse_iterator_t;
 typedef typename tree_t::const_reverse_iterator const_reverse_iterator_t;

public:
   typedef typename impl_tree_t::stored_allocator_type      impl_stored_allocator_type;
   typedef typename impl_tree_t::sequence_type              impl_sequence_type;

BOOST_CONTAINER_FORCEINLINE impl_tree_t &tree()
   {  return m_flat_tree;  }

BOOST_CONTAINER_FORCEINLINE const impl_tree_t &tree() const
   {  return m_flat_tree;  }

private:
   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

public:

//AllocatorOrContainer::value_type must be std::pair<Key, T>
 BOOST_STATIC_ASSERT((dtl::is_same<std::pair<Key, T>, value_type>::value));

//////////////////////////////////////////////
   //
   //          construct/copy/destroy
   //
   //////////////////////////////////////////////

//! Effects: Default constructs an empty flat_map.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE flat_multimap()
 BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<AllocatorOrContainer>::value &&
 dtl::is_nothrow_default_constructible<Compare>::value)
 : m_flat_tree()
 {}

//! Effects: Constructs an empty flat_multimap using the specified allocator.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE explicit flat_multimap(const allocator_type& a)
 : m_flat_tree(dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_multimap using the specified comparison
 //! object .
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE explicit flat_multimap(const Compare& comp)
 : m_flat_tree(comp)
 {}

//! Effects: Constructs an empty flat_multimap using the specified comparison
 //! object and allocator.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(const Compare& comp, const allocator_type& a)
 : m_flat_tree(comp, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_multimap
 //! and inserts elements from the range [first ,last ).
 //!
 //! Complexity: Linear in N if the range [first ,last ) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(InputIterator first, InputIterator last)
 : m_flat_tree(false, first, last)
 {}

//! Effects: Constructs an empty flat_multimap using the specified
 //! allocator, and inserts elements from the range [first ,last ).
 //!
 //! Complexity: Linear in N if the range [first ,last ) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(InputIterator first, InputIterator last, const allocator_type& a)
 : m_flat_tree(false, first, last, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_multimap using the specified comparison object
 //! and inserts elements from the range [first ,last ).
 //!
 //! Complexity: Linear in N if the range [first ,last ) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(InputIterator first, InputIterator last, const Compare& comp)
 : m_flat_tree(false, first, last, comp)
 {}

//! Effects: Constructs an empty flat_multimap using the specified comparison object
 //! and allocator, and inserts elements from the range [first ,last ).
 //!
 //! Complexity: Linear in N if the range [first ,last ) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
 : m_flat_tree(false, first, last, comp, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_multimap
 //! and inserts elements from the ordered range [first ,last). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(ordered_range_t, InputIterator first, InputIterator last)
 : m_flat_tree(ordered_range, first, last)
 {}

//! Effects: Constructs an empty flat_multimap using the specified comparison object and
 //! inserts elements from the ordered range [first ,last). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp)
 : m_flat_tree(ordered_range, first, last, comp)
 {}

//! Effects: Constructs an empty flat_multimap using the specified comparison object and
 //! allocator, and inserts elements from the ordered range [first ,last). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
 : m_flat_tree(ordered_range, first, last, comp, a)
 {}

//! Effects: Constructs an empty flat_multimap using the specified comparison object and
 //! inserts elements from the ordered range [first ,last). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(ordered_range_t, InputIterator first, InputIterator last, const allocator_type &a)
 : m_flat_tree(ordered_range, first, last, Compare(), a)
 {}

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 //! Effects: Constructs an empty flat_map and
 //! inserts elements from the range [il.begin(), il.end()).
 //!
 //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(std::initializer_list<value_type> il)
 : m_flat_tree( false
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end())
 {}

//! Effects: Constructs an empty flat_map using the specified
 //! allocator, and inserts elements from the range [il.begin(), il.end()).
 //!
 //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(std::initializer_list<value_type> il, const allocator_type& a)
 : m_flat_tree(false
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end()
 , dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! inserts elements from the range [il.begin(), il.end()).
 //!
 //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(std::initializer_list<value_type> il, const Compare& comp)
 : m_flat_tree(false
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end(), comp)
 {}

//! Effects: Constructs an empty flat_map using the specified comparison object and
 //! allocator, and inserts elements from the range [il.begin(), il.end()).
 //!
 //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using
 //! the predicate and otherwise N logN, where N is last - first.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
 : m_flat_tree( false
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end()
 , comp, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Constructs an empty flat_multimap and
 //! inserts elements from the ordered range [il.begin(), il.end()). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [il.begin(), il.end()) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(ordered_range_t, std::initializer_list<value_type> il)
 : m_flat_tree( ordered_range
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end())
 {}

//! Effects: Constructs an empty flat_multimap using the specified comparison object and
 //! inserts elements from the ordered range [il.begin(), il.end()). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [il.begin(), il.end()) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp)
 : m_flat_tree( ordered_range
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end(), comp)
 {}

//! Effects: Constructs an empty flat_multimap using the specified comparison object and
 //! allocator, and inserts elements from the ordered range [il.begin(), il.end()). This function
 //! is more efficient than the normal range creation for ordered ranges.
 //!
 //! Requires: [il.begin(), il.end()) must be ordered according to the predicate.
 //!
 //! Complexity: Linear in N.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
 : m_flat_tree( ordered_range
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end()
 , comp, dtl::force<const impl_allocator_type>(a))
 {}
#endif

//! Effects: Copy constructs a flat_multimap.
 //!
 //! Complexity: Linear in x.size().
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(const flat_multimap& x)
 : m_flat_tree(x.m_flat_tree)
 {}

//! Effects: Move constructs a flat_multimap. Constructs *this using x's resources.
 //!
 //! Complexity: Constant.
 //!
 //! Postcondition: x is emptied.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(BOOST_RV_REF(flat_multimap) x)
 BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
 : m_flat_tree(boost::move(x.m_flat_tree))
 {}

//! Effects: Copy constructs a flat_multimap using the specified allocator.
 //!
 //! Complexity: Linear in x.size().
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(const flat_multimap& x, const allocator_type &a)
 : m_flat_tree(x.m_flat_tree, dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Move constructs a flat_multimap using the specified allocator.
 //! Constructs *this using x's resources.
 //!
 //! Complexity: Constant if a == x.get_allocator(), linear otherwise.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap(BOOST_RV_REF(flat_multimap) x, const allocator_type &a)
 : m_flat_tree(boost::move(x.m_flat_tree), dtl::force<const impl_allocator_type>(a))
 {}

//! Effects: Makes *this a copy of x.
 //!
 //! Complexity: Linear in x.size().
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap& operator=(BOOST_COPY_ASSIGN_REF(flat_multimap) x)
 { m_flat_tree = x.m_flat_tree; return *this; }

//! Effects: this->swap(x.get()).
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap& operator=(BOOST_RV_REF(flat_multimap) x)
 BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
 allocator_traits_type::is_always_equal::value) &&
 boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
 { m_flat_tree = boost::move(x.m_flat_tree); return *this; }

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 //! Effects: Assign content of il to *this
 //!
 //! Complexity: Linear in il.size().
 BOOST_CONTAINER_FORCEINLINE
 flat_multimap& operator=(std::initializer_list<value_type> il)
 {
 this->clear();
 this->insert(il.begin(), il.end());
 return *this;
 }
#endif

//! Effects: Returns a copy of the allocator that
 //! was passed to the object's constructor.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<allocator_type>(m_flat_tree.get_allocator()); }

//! Effects: Returns a reference to the internal allocator.
 //!
 //! Throws: Nothing
 //!
 //! Complexity: Constant.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE
 stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force<stored_allocator_type>(m_flat_tree.get_stored_allocator()); }

//! Effects: Returns a reference to the internal allocator.
 //!
 //! Throws: Nothing
 //!
 //! Complexity: Constant.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE
 const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force<const stored_allocator_type>(m_flat_tree.get_stored_allocator()); }

//////////////////////////////////////////////
   //
   //                iterators
   //
   //////////////////////////////////////////////

//! Effects: Returns an iterator to the first element contained in the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<iterator>(m_flat_tree.begin()); }

//! Effects: Returns a const_iterator to the first element contained in the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_iterator>(m_flat_tree.begin()); }

//! Effects: Returns an iterator to the end of the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 iterator end() BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<iterator>(m_flat_tree.end()); }

//! Effects: Returns a const_iterator to the end of the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_iterator>(m_flat_tree.end()); }

//! Effects: Returns a reverse_iterator pointing to the beginning
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<reverse_iterator>(m_flat_tree.rbegin()); }

//! Effects: Returns a const_reverse_iterator pointing to the beginning
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rbegin()); }

//! Effects: Returns a reverse_iterator pointing to the end
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<reverse_iterator>(m_flat_tree.rend()); }

//! Effects: Returns a const_reverse_iterator pointing to the end
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rend()); }

//! Effects: Returns a const_iterator to the first element contained in the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_iterator>(m_flat_tree.cbegin()); }

//! Effects: Returns a const_iterator to the end of the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_iterator>(m_flat_tree.cend()); }

//! Effects: Returns a const_reverse_iterator pointing to the beginning
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crbegin()); }

//! Effects: Returns a const_reverse_iterator pointing to the end
 //! of the reversed container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crend()); }

//////////////////////////////////////////////
   //
   //                capacity
   //
   //////////////////////////////////////////////

//! Effects: Returns true if the container contains no elements.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 bool empty() const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.empty(); }

//! Effects: Returns the number of the elements contained in the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 size_type size() const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.size(); }

//! Effects: Returns the largest possible size of the container.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.max_size(); }

//! Effects: Number of elements for which memory has been allocated.
 //! capacity() is always greater than or equal to size().
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE
 size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.capacity(); }

//! Effects: If n is less than or equal to capacity(), or the
 //! underlying container has no `reserve` member, this call has no
 //! effect. Otherwise, it is a request for allocation of additional memory.
 //! If the request is successful, then capacity() is greater than or equal to
 //! n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
 //!
 //! Throws: If memory allocation allocation throws or T's copy constructor throws.
 //!
 //! Note: If capacity() is less than "cnt", iterators and references to
 //! to values might be invalidated.
 BOOST_CONTAINER_FORCEINLINE
 void reserve(size_type cnt)
 { m_flat_tree.reserve(cnt); }

//! Effects: Tries to deallocate the excess of memory created
 // with previous allocations. The size of the vector is unchanged
 //!
 //! Throws: If memory allocation throws, or T's copy constructor throws.
 //!
 //! Complexity: Linear to size().
 BOOST_CONTAINER_FORCEINLINE
 void shrink_to_fit()
 { m_flat_tree.shrink_to_fit(); }

//! @copydoc ::boost::container::flat_set::nth(size_type)
 BOOST_CONTAINER_FORCEINLINE
 iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }

//! @copydoc ::boost::container::flat_set::nth(size_type) const
 BOOST_CONTAINER_FORCEINLINE
 const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
 { return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }

//! @copydoc ::boost::container::flat_set::index_of(iterator)
 BOOST_CONTAINER_FORCEINLINE
 size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.index_of(dtl::force_copy<impl_iterator>(p)); }

//! @copydoc ::boost::container::flat_set::index_of(const_iterator) const
 BOOST_CONTAINER_FORCEINLINE
 size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
 { return m_flat_tree.index_of(dtl::force_copy<impl_const_iterator>(p)); }

#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)

//! Effects: Inserts an object of type T constructed with
 //! std::forward<Args>(args)... and returns the iterator pointing to the
 //! newly inserted element.
 //!
 //! Complexity: Logarithmic search time plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 template <class... Args>
 BOOST_CONTAINER_FORCEINLINE
 iterator emplace(BOOST_FWD_REF(Args)... args)
 { return dtl::force_copy<iterator>(m_flat_tree.emplace_equal(boost::forward<Args>(args)...)); }

//! Effects: Inserts an object of type T constructed with
 //! std::forward<Args>(args)... in the container.
 //! p is a hint pointing to where the insert should start to search.
 //!
 //! Returns: An iterator pointing to the element with key equivalent
 //! to the key of x.
 //!
 //! Complexity: Logarithmic search time (constant time if the value
 //! is to be inserted before p) plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 template <class... Args>
 BOOST_CONTAINER_FORCEINLINE
 iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
 {
 return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_equal
 (dtl::force_copy<impl_const_iterator>(hint), boost::forward<Args>(args)...));
 }

#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)

#define BOOST_CONTAINER_FLAT_MULTIMAP_EMPLACE_CODE(N) \
 BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
 BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_MOVE_UREF##N)\
 { return dtl::force_copy<iterator>(m_flat_tree.emplace_equal(BOOST_MOVE_FWD##N)); }\
 \
 BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
 BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
 {\
 return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_equal\
 (dtl::force_copy<impl_const_iterator>(hint) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
 }\
 //
 BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_MULTIMAP_EMPLACE_CODE)
 #undef BOOST_CONTAINER_FLAT_MULTIMAP_EMPLACE_CODE

#endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)

//! Effects: Inserts x and returns the iterator pointing to the
 //! newly inserted element.
 //!
 //! Complexity: Logarithmic search time plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE iterator insert(const value_type& x)
 {
 return dtl::force_copy<iterator>(
 m_flat_tree.insert_equal(dtl::force<const impl_value_type>(x)));
 }

//! Effects: Inserts a new value move-constructed from x and returns
 //! the iterator pointing to the newly inserted element.
 //!
 //! Complexity: Logarithmic search time plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE iterator insert(BOOST_RV_REF(value_type) x)
 { return dtl::force_copy<iterator>(m_flat_tree.insert_equal(boost::move(x))); }

//! Effects: Inserts a new value move-constructed from x and returns
 //! the iterator pointing to the newly inserted element.
 //!
 //! Complexity: Logarithmic search time plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE iterator insert(BOOST_RV_REF(impl_value_type) x)
 { return dtl::force_copy<iterator>(m_flat_tree.insert_equal(boost::move(x))); }

//! Effects: Inserts a copy of x in the container.
 //! p is a hint pointing to where the insert should start to search.
 //!
 //! Returns: An iterator pointing to the element with key equivalent
 //! to the key of x.
 //!
 //! Complexity: Logarithmic search time (constant time if the value
 //! is to be inserted before p) plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
 {
 return dtl::force_copy<iterator>
 (m_flat_tree.insert_equal( dtl::force_copy<impl_const_iterator>(p)
 , dtl::force<const impl_value_type>(x)));
 }

//! Effects: Inserts a value move constructed from x in the container.
 //! p is a hint pointing to where the insert should start to search.
 //!
 //! Returns: An iterator pointing to the element with key equivalent
 //! to the key of x.
 //!
 //! Complexity: Logarithmic search time (constant time if the value
 //! is to be inserted before p) plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(value_type) x)
 {
 return dtl::force_copy<iterator>
 (m_flat_tree.insert_equal(dtl::force_copy<impl_const_iterator>(p)
 , boost::move(x)));
 }

//! Effects: Inserts a value move constructed from x in the container.
 //! p is a hint pointing to where the insert should start to search.
 //!
 //! Returns: An iterator pointing to the element with key equivalent
 //! to the key of x.
 //!
 //! Complexity: Logarithmic search time (constant time if the value
 //! is to be inserted before p) plus linear insertion
 //! to the elements with bigger keys than x.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(impl_value_type) x)
 {
 return dtl::force_copy<iterator>(
 m_flat_tree.insert_equal(dtl::force_copy<impl_const_iterator>(p), boost::move(x)));
 }

//! Requires: first, last are not iterators into *this.
 //!
 //! Effects: inserts each element from the range [first,last) .
 //!
 //! Complexity: N log(N).
 //!
 //! Note: If an element is inserted it might invalidate elements.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
 { m_flat_tree.insert_equal(first, last); }

//! Requires: first, last are not iterators into *this.
 //!
 //! Requires: [first ,last) must be ordered according to the predicate.
 //!
 //! Effects: inserts each element from the range [first,last) if and only
 //! if there is no element with key equivalent to the key of that element. This
 //! function is more efficient than the normal range creation for ordered ranges.
 //!
 //! Complexity: Linear.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 //!
 //! Note: Non-standard extension.
 template <class InputIterator>
 BOOST_CONTAINER_FORCEINLINE void insert(ordered_range_t, InputIterator first, InputIterator last)
 { m_flat_tree.insert_equal(ordered_range, first, last); }

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 //! Effects: inserts each element from the range [il.begin(), il.end()) .
 //!
 //! Complexity: N log(N).
 //!
 //! Note: If an element is inserted it might invalidate elements.
 BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list<value_type> il)
 {
 m_flat_tree.insert_equal( dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end());
 }

//! Requires: [il.begin(), il.end()) must be ordered according to the predicate.
 //!
 //! Effects: inserts each element from the range [il.begin(), il.end()) if and only
 //! if there is no element with key equivalent to the key of that element. This
 //! function is more efficient than the normal range creation for ordered ranges.
 //!
 //! Complexity: Linear.
 //!
 //! Note: If an element is inserted it might invalidate elements.
 //!
 //! Note: Non-standard extension.
 BOOST_CONTAINER_FORCEINLINE void insert(ordered_range_t, std::initializer_list<value_type> il)
 {
 m_flat_tree.insert_equal( ordered_range
 , dtl::force<impl_initializer_list>(il).begin()
 , dtl::force<impl_initializer_list>(il).end());
 }
#endif

//! Requires: this->get_allocator() == source.get_allocator().
 //!
 //! Effects: Extracts each element in source and insert it into a using
 //! the comparison object of *this.
 //! 
 //! Postcondition: Pointers and references to the transferred elements of source refer
 //! to those same elements but as members of *this. Iterators referring to the transferred
 //! elements will continue to refer to their elements, but they now behave as iterators into *this,
 //! not into source.
 //!
 //! Throws: Nothing unless the comparison object throws.
 //!
 //! Complexity: N log(size() + N) (N has the value source.size())
 template<class C2>
 BOOST_CONTAINER_FORCEINLINE void merge(flat_multimap<Key, T, C2, AllocatorOrContainer>& source)
 { m_flat_tree.merge_equal(source.tree()); }

//! @copydoc ::boost::container::flat_multimap::merge(flat_multimap<Key, T, C2, AllocatorOrContainer>&)
 template<class C2>
 BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_multimap<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
 { return this->merge(static_cast<flat_multimap<Key, T, C2, AllocatorOrContainer>&>(source)); }

//! @copydoc ::boost::container::flat_multimap::merge(flat_multimap<Key, T, C2, AllocatorOrContainer>&)
 template<class C2>
 BOOST_CONTAINER_FORCEINLINE void merge(flat_map<Key, T, C2, AllocatorOrContainer>& source)
 { m_flat_tree.merge_equal(source.tree()); }

//! @copydoc ::boost::container::flat_multimap::merge(flat_map<Key, T, C2, AllocatorOrContainer>&)
 template<class C2>
 BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_map<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
 { return this->merge(static_cast<flat_map<Key, T, C2, AllocatorOrContainer>&>(source)); }

//! Effects: Erases the element pointed to by p.
 //!
 //! Returns: Returns an iterator pointing to the element immediately
 //! following q prior to the element being erased. If no such element exists,
 //! returns end().
 //!
 //! Complexity: Linear to the elements with keys bigger than p
 //!
 //! Note: Invalidates elements with keys
 //! not less than the erased element.
 BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator p)
 {
 return dtl::force_copy<iterator>(
 m_flat_tree.erase(dtl::force_copy<impl_const_iterator>(p)));
 }

//! Effects: Erases all the elements in the range [first, last).
 //!
 //! Returns: Returns last.
 //!
 //! Complexity: size()*N where N is the distance from first to last.
 //!
 //! Complexity: Logarithmic search time plus erasure time
 //! linear to the elements with bigger keys.
 BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator first, const_iterator last)
 {
 return dtl::force_copy<iterator>
 (m_flat_tree.erase( dtl::force_copy<impl_const_iterator>(first)
 , dtl::force_copy<impl_const_iterator>(last)));
 }

//! Effects: Swaps the contents of *this and x.
 //!
 //! Throws: Nothing.
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE void swap(flat_multimap& x)
 BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value
 && boost::container::dtl::is_nothrow_swappable<Compare>::value )
 { m_flat_tree.swap(x.m_flat_tree); }

//////////////////////////////////////////////
   //
   //                observers
   //
   //////////////////////////////////////////////

//////////////////////////////////////////////
   //
   //              map operations
   //
   //////////////////////////////////////////////

//! Returns: An const_iterator pointing to an element with the key
 //! equivalent to x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 BOOST_CONTAINER_FORCEINLINE const_iterator find(const key_type& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: An const_iterator pointing to an element with the key
 //! equivalent to x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic.
 template<class K>
 BOOST_CONTAINER_FORCEINLINE const_iterator find(const K& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }

//! Returns: An iterator pointing to the first element with key not less
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic
 BOOST_CONTAINER_FORCEINLINE iterator lower_bound(const key_type& x)
 { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }

//! Returns: An iterator pointing to the first element with key not less
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic
 BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const key_type& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: An iterator pointing to the first element with key not less
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic
 template<class K>
 BOOST_CONTAINER_FORCEINLINE iterator lower_bound(const K& x)
 { return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: An iterator pointing to the first element with key not less
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic
 template<class K>
 BOOST_CONTAINER_FORCEINLINE const_iterator lower_bound(const K& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }

//! Returns: An iterator pointing to the first element with key greater
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic
 BOOST_CONTAINER_FORCEINLINE iterator upper_bound(const key_type& x)
 {return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }

//! Returns: A const iterator pointing to the first element with key
 //! greater than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic
 BOOST_CONTAINER_FORCEINLINE const_iterator upper_bound(const key_type& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: An iterator pointing to the first element with key greater
 //! than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic
 template<class K>
 BOOST_CONTAINER_FORCEINLINE iterator upper_bound(const K& x)
 {return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Returns: A const iterator pointing to the first element with key
 //! greater than x, or end() if such an element is not found.
 //!
 //! Complexity: Logarithmic
 template<class K>
 BOOST_CONTAINER_FORCEINLINE const_iterator upper_bound(const K& x) const
 { return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }

//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
 //!
 //! Complexity: Logarithmic
 BOOST_CONTAINER_FORCEINLINE std::pair<iterator,iterator> equal_range(const key_type& x)
 { return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.equal_range(x)); }

//! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
 //!
 //! Complexity: Logarithmic
 BOOST_CONTAINER_FORCEINLINE std::pair<const_iterator, const_iterator> equal_range(const key_type& x) const
 { return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x)); }

//! Requires: This overload is available only if
 //! key_compare::is_transparent exists.
 //!
 //! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
 //!
 //! Complexity: Logarithmic
 template<class K>
 BOOST_CONTAINER_FORCEINLINE std::pair<const_iterator, const_iterator> equal_range(const K& x) const
 { return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x)); }

//! Effects: Discards the internally hold sequence container and adopts the
 //! one passed externally using the move assignment.
 //!
 //! Complexity: Assuming O(1) move assignment, O(NlogN) with N = seq.size()
 //!
 //! Throws: If the comparison or the move constructor throws
 BOOST_CONTAINER_FORCEINLINE void adopt_sequence(BOOST_RV_REF(sequence_type) seq)
 { this->m_flat_tree.adopt_sequence_equal(boost::move(dtl::force<impl_sequence_type>(seq))); }

//! Requires: seq shall be ordered according to this->compare().
 //!
 //! Effects: Discards the internally hold sequence container and adopts the
 //! one passed externally using the move assignment.
 //!
 //! Complexity: Assuming O(1) move assignment, O(1)
 //!
 //! Throws: If the move assignment throws
 BOOST_CONTAINER_FORCEINLINE void adopt_sequence(ordered_range_t, BOOST_RV_REF(sequence_type) seq)
 { this->m_flat_tree.adopt_sequence_equal(ordered_range_t(), boost::move(dtl::force<impl_sequence_type>(seq))); }

//! Effects: Returns true if x and y are equal
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator==(const flat_multimap& x, const flat_multimap& y)
 { return x.size() == y.size() && ::boost::container::algo_equal(x.begin(), x.end(), y.begin()); }

//! Effects: Returns true if x and y are unequal
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator!=(const flat_multimap& x, const flat_multimap& y)
 { return !(x == y); }

//! Effects: Returns true if x is less than y
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator<(const flat_multimap& x, const flat_multimap& y)
 { return ::boost::container::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end()); }

//! Effects: Returns true if x is equal or less than y
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator<=(const flat_multimap& x, const flat_multimap& y)
 { return !(y < x); }

//! Effects: Returns true if x is equal or greater than y
 //!
 //! Complexity: Linear to the number of elements in the container.
 BOOST_CONTAINER_FORCEINLINE friend bool operator>=(const flat_multimap& x, const flat_multimap& y)
 { return !(x < y); }

//! Effects: x.swap(y)
 //!
 //! Complexity: Constant.
 BOOST_CONTAINER_FORCEINLINE friend void swap(flat_multimap& x, flat_multimap& y)
 { x.swap(y); }
};

#ifndef BOOST_CONTAINER_NO_CXX17_CTAD

template <typename InputIterator>
flat_multimap(InputIterator, InputIterator) ->
 flat_multimap< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>>;

template < typename InputIterator, typename AllocatorOrCompare>
flat_multimap(InputIterator, InputIterator, AllocatorOrCompare const&) ->
 flat_multimap< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>
 , typename dtl::if_c< // Compare
 dtl::is_allocator<AllocatorOrCompare>::value
 , std::less<it_based_non_const_first_type_t<InputIterator>>
 , AllocatorOrCompare
 >::type
 , typename dtl::if_c< // Allocator
 dtl::is_allocator<AllocatorOrCompare>::value
 , AllocatorOrCompare
 , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
 >::type
 >;

template < typename InputIterator, typename Compare, typename Allocator
 , typename = dtl::require_nonallocator_t<Compare>
 , typename = dtl::require_allocator_t<Allocator>>
flat_multimap(InputIterator, InputIterator, Compare const&, Allocator const&) ->
 flat_multimap< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>
 , Compare
 , Allocator>;

template <typename InputIterator>
flat_multimap(ordered_range_t, InputIterator, InputIterator) ->
 flat_multimap< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>>;

template < typename InputIterator, typename AllocatorOrCompare>
flat_multimap(ordered_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
 flat_multimap< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>
 , typename dtl::if_c< // Compare
 dtl::is_allocator<AllocatorOrCompare>::value
 , std::less<it_based_non_const_first_type_t<InputIterator>>
 , AllocatorOrCompare
 >::type
 , typename dtl::if_c< // Allocator
 dtl::is_allocator<AllocatorOrCompare>::value
 , AllocatorOrCompare
 , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
 >::type
 >;

template < typename InputIterator, typename Compare, typename Allocator
 , typename = dtl::require_nonallocator_t<Compare>
 , typename = dtl::require_allocator_t<Allocator>>
flat_multimap(ordered_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
 flat_multimap< it_based_non_const_first_type_t<InputIterator>
 , it_based_second_type_t<InputIterator>
 , Compare
 , Allocator>;

#endif

}}

#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

namespace boost {

//!has_trivial_destructor_after_move<> == true_type
//!specialization for optimizations
template <class Key, class T, class Compare, class AllocatorOrContainer>
struct has_trivial_destructor_after_move< boost::container::flat_multimap<Key, T, Compare, AllocatorOrContainer> >
{
 typedef ::boost::container::dtl::pair<Key, T> value_t;
 typedef typename ::boost::container::dtl::container_or_allocator_rebind<AllocatorOrContainer, value_t>::type alloc_or_cont_t;
 typedef ::boost::container::dtl::flat_tree<value_t,::boost::container::dtl::select1st<Key>, Compare, alloc_or_cont_t> tree;
 static const bool value = ::boost::has_trivial_destructor_after_move<tree>::value;
};

}  //namespace boost {

#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

#include <boost/container/detail/config_end.hpp>

#endif   // BOOST_CONTAINER_FLAT_MAP_HPP

cmd: