text:
#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()
// 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

namespace container_detail{

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

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

}  //namespace container_detail{

#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. The flat_map class supports random-access iterators.
//!
//! A flat_map satisfies all of the requirements of a container and of a reversible
//! container and of 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>).
//!
//! Compare is the ordering function for Keys (e.g. std::less<Key>).
//!
//! Allocator is the allocator to allocate the value_types
//! (e.g. allocator< std::pair<Key, T> >).
//!
//! flat_map is similar to std::map but it's implemented like an ordered vector.
//! This means that inserting a new element into a flat_map invalidates
//! previous iterators and references
//!
//! Erasing an element invalidates 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 mapped_type
//! \tparam Compare is the ordering function for Keys (e.g. std::less<Key>).
//! \tparam Allocator is the allocator to allocate the value_types
//!   (e.g. allocator< std::pair<Key, T> > ).
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
template <class Key, class T, class Compare = std::less<Key>, class Allocator = new_allocator< std::pair< Key, T> > >
#else
template <class Key, class T, class Compare, class Allocator>
#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 container_detail::flat_tree<Key,
                           std::pair<Key, T>,
                           container_detail::select1st< std::pair<Key, T> >,
                           Compare,
                           Allocator> tree_t;

   //This is the real tree stored here. It's based on a movable pair
   typedef container_detail::flat_tree<Key,
                           container_detail::pair<Key, T>,
                           container_detail::select1st<container_detail::pair<Key, T> >,
                           Compare,
                           typename allocator_traits<Allocator>::template portable_rebind_alloc
                              <container_detail::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;
   typedef container_detail::flat_tree_value_compare
      < Compare
      , container_detail::select1st< std::pair<Key, T> >
      , std::pair<Key, T> >                                                         value_compare_impl;
   typedef typename container_detail::get_flat_tree_iterators
         <typename allocator_traits<Allocator>::pointer>::iterator                  iterator_impl;
   typedef typename container_detail::get_flat_tree_iterators
      <typename allocator_traits<Allocator>::pointer>::const_iterator               const_iterator_impl;
   typedef typename container_detail::get_flat_tree_iterators
         <typename allocator_traits<Allocator>::pointer>::reverse_iterator          reverse_iterator_impl;
   typedef typename container_detail::get_flat_tree_iterators
         <typename allocator_traits<Allocator>::pointer>::const_reverse_iterator    const_reverse_iterator_impl;
   public:
   typedef typename impl_tree_t::stored_allocator_type   impl_stored_allocator_type;
   private:
   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

   public:

   //////////////////////////////////////////////
   //
   //                    types
   //
   //////////////////////////////////////////////
   typedef Key                                                                      key_type;
   typedef T                                                                        mapped_type;
   typedef std::pair<Key, T>                                                        value_type;
   typedef ::boost::container::allocator_traits<Allocator>                          allocator_traits_type;
   typedef typename boost::container::allocator_traits<Allocator>::pointer          pointer;
   typedef typename boost::container::allocator_traits<Allocator>::const_pointer    const_pointer;
   typedef typename boost::container::allocator_traits<Allocator>::reference        reference;
   typedef typename boost::container::allocator_traits<Allocator>::const_reference  const_reference;
   typedef typename boost::container::allocator_traits<Allocator>::size_type        size_type;
   typedef typename boost::container::allocator_traits<Allocator>::difference_type  difference_type;
   typedef Allocator                                                                allocator_type;
   typedef BOOST_CONTAINER_IMPDEF(Allocator)                                        stored_allocator_type;
   typedef BOOST_CONTAINER_IMPDEF(value_compare_impl)                               value_compare;
   typedef Compare                                                                  key_compare;
   typedef BOOST_CONTAINER_IMPDEF(iterator_impl)                                    iterator;
   typedef BOOST_CONTAINER_IMPDEF(const_iterator_impl)                              const_iterator;
   typedef BOOST_CONTAINER_IMPDEF(reverse_iterator_impl)                            reverse_iterator;
   typedef BOOST_CONTAINER_IMPDEF(const_reverse_iterator_impl)                      const_reverse_iterator;
   typedef BOOST_CONTAINER_IMPDEF(impl_value_type)                                  movable_value_type;

   public:
   //////////////////////////////////////////////
   //
   //          construct/copy/destroy
   //
   //////////////////////////////////////////////

   //! Effects: Default constructs an empty flat_map.
   //!
   //! Complexity: Constant.
   flat_map()
      : m_flat_tree()
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Constructs an empty flat_map using the specified
   //! comparison object and allocator.
   //!
   //! Complexity: Constant.
   explicit flat_map(const Compare& comp, const allocator_type& a = allocator_type())
      : m_flat_tree(comp, container_detail::force<impl_allocator_type>(a))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Constructs an empty flat_map using the specified allocator.
   //!
   //! Complexity: Constant.
   explicit flat_map(const allocator_type& a)
      : m_flat_tree(container_detail::force<impl_allocator_type>(a))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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
   //! comp and otherwise N logN, where N is last - first.
   template <class InputIterator>
   flat_map(InputIterator first, InputIterator last, const Compare& comp = Compare(),
         const allocator_type& a = allocator_type())
      : m_flat_tree(true, first, last, comp, container_detail::force<impl_allocator_type>(a))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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
   //! comp and otherwise N logN, where N is last - first.
   template <class InputIterator>
   flat_map(InputIterator first, InputIterator last, const allocator_type& a)
      : m_flat_tree(true, first, last, Compare(), container_detail::force<impl_allocator_type>(a))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Constructs an empty flat_map using the specified comparison object and
   //! allocator, and inserts elements from the ordered unique 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 and must be
   //! unique values.
   //!
   //! Complexity: Linear in N.
   //!
   //! Note: Non-standard extension.
   template <class InputIterator>
   flat_map( ordered_unique_range_t, InputIterator first, InputIterator last
           , const Compare& comp = Compare(), const allocator_type& a = allocator_type())
      : m_flat_tree(ordered_range, first, last, comp, a)
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
   //! 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
   //! comp and otherwise N logN, where N is last - first.
   flat_map(std::initializer_list<value_type> il, const Compare& comp = Compare(),
          const allocator_type& a = allocator_type())
     : m_flat_tree(true, il.begin(), il.end(), comp, container_detail::force<impl_allocator_type>(a))
   {
       //A type must be std::pair<Key, T>
       BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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
   //! comp and otherwise N logN, where N is last - first.
   flat_map(std::initializer_list<value_type> il, const allocator_type& a)
     : m_flat_tree(true, il.begin(), il.end(), Compare(), container_detail::force<impl_allocator_type>(a))
   {
       //A type must be std::pair<Key, T>
       BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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.
   flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp = Compare(),
          const allocator_type& a = allocator_type())
     : m_flat_tree(ordered_range, il.begin(), il.end(), comp, a)
   {
       //A type must be std::pair<Key, T>
       BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }
#endif

   //! Effects: Copy constructs a flat_map.
   //!
   //! Complexity: Linear in x.size().
   flat_map(const flat_map& x)
      : m_flat_tree(x.m_flat_tree)
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Move constructs a flat_map.
   //!   Constructs *this using x's resources.
   //!
   //! Complexity: Constant.
   //!
   //! Postcondition: x is emptied.
   flat_map(BOOST_RV_REF(flat_map) x)
      : m_flat_tree(boost::move(x.m_flat_tree))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Copy constructs a flat_map using the specified allocator.
   //!
   //! Complexity: Linear in x.size().
   flat_map(const flat_map& x, const allocator_type &a)
      : m_flat_tree(x.m_flat_tree, a)
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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.
   flat_map(BOOST_RV_REF(flat_map) x, const allocator_type &a)
      : m_flat_tree(boost::move(x.m_flat_tree), a)
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Makes *this a copy of x.
   //!
   //! Complexity: Linear in x.size().
   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.
   flat_map& operator=(BOOST_RV_REF(flat_map) x)
      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
                                 && boost::container::container_detail::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.
   allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::force<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.
   iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::force_copy<iterator>(m_flat_tree.begin()); }

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

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

   //! Effects: Returns a const_iterator to the end of the container.
   //!
   //! Throws: Nothing.
   //!
   //! Complexity: Constant.
   const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::force_copy<const_iterator>(m_flat_tree.cbegin()); }

   //! Effects: Returns a const_iterator to the end of the container.
   //!
   //! Throws: Nothing.
   //!
   //! Complexity: Constant.
   const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.crend()); }

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

   //! Effects: Returns true if the container contains no elements.
   //!
   //! Throws: Nothing.
   //!
   //! Complexity: Constant.
   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.
   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.
   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.
   size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
      { return m_flat_tree.capacity(); }

   //! Effects: If n is less than or equal to capacity(), 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.
   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().
   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.
   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.
   mapped_type &operator[](key_type &&k) ;

   #else
   BOOST_MOVE_CONVERSION_AWARE_CATCH( operator[] , key_type, mapped_type&, this->priv_subscript)
   #endif

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

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

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

   //! @copydoc ::boost::container::flat_set::index_of(const_iterator) const
   size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
   {  return m_flat_tree.index_of(container_detail::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>
   std::pair<iterator,bool> emplace(BOOST_FWD_REF(Args)... args)
   {  return container_detail::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>
   iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
   {
      return container_detail::force_copy<iterator>
         (m_flat_tree.emplace_hint_unique( container_detail::force_copy<impl_const_iterator>(hint)
                                         , boost::forward<Args>(args)...));
   }

   #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 \
   std::pair<iterator,bool> emplace(BOOST_MOVE_UREF##N)\
   {\
      return container_detail::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 \
   iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
   {\
      return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_unique\
         (container_detail::force_copy<impl_const_iterator>(hint) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
   }\
   //
   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.
   std::pair<iterator,bool> insert(const value_type& x)
   {  return container_detail::force_copy<std::pair<iterator,bool> >(
         m_flat_tree.insert_unique(container_detail::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.
   std::pair<iterator,bool> insert(BOOST_RV_REF(value_type) x)
   {  return container_detail::force_copy<std::pair<iterator,bool> >(
      m_flat_tree.insert_unique(boost::move(container_detail::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.
   std::pair<iterator,bool> insert(BOOST_RV_REF(movable_value_type) x)
   {
      return container_detail::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.
   iterator insert(const_iterator p, const value_type& x)
   {
      return container_detail::force_copy<iterator>(
         m_flat_tree.insert_unique( container_detail::force_copy<impl_const_iterator>(p)
                                  , container_detail::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.
   iterator insert(const_iterator p, BOOST_RV_REF(value_type) x)
   {
      return container_detail::force_copy<iterator>
         (m_flat_tree.insert_unique( container_detail::force_copy<impl_const_iterator>(p)
                                   , boost::move(container_detail::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.
   iterator insert(const_iterator p, BOOST_RV_REF(movable_value_type) x)
   {
      return container_detail::force_copy<iterator>(
         m_flat_tree.insert_unique(container_detail::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: At most N log(size()+N) (N is the distance from first to last)
   //!   search time plus N*size() insertion time.
   //!
   //! Note: If an element is inserted it might invalidate elements.
   template <class InputIterator>
   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: At most N log(size()+N) (N is the distance from first to last)
   //!   search time plus N*size() insertion time.
   //!
   //! Note: If an element is inserted it might invalidate elements.
   //!
   //! Note: Non-standard extension.
   template <class InputIterator>
   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: At most N log(size()+N) (N is the distance from il.first() to il.end())
   //!   search time plus N*size() insertion time.
   //!
   //! Note: If an element is inserted it might invalidate elements.
   void insert(std::initializer_list<value_type> il)
   {  m_flat_tree.insert_unique(il.begin(), 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: At most N log(size()+N) (N is the distance from first to last)
   //!   search time plus N*size() insertion time.
   //!
   //! Note: If an element is inserted it might invalidate elements.
   //!
   //! Note: Non-standard extension.
   void insert(ordered_unique_range_t, std::initializer_list<value_type> il)
   {  m_flat_tree.insert_unique(ordered_unique_range, il.begin(), il.end()); }
#endif

   //! 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.
   iterator erase(const_iterator p)
   {
      return container_detail::force_copy<iterator>
         (m_flat_tree.erase(container_detail::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.
   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.
   iterator erase(const_iterator first, const_iterator last)
   {
      return container_detail::force_copy<iterator>(
         m_flat_tree.erase( container_detail::force_copy<impl_const_iterator>(first)
                          , container_detail::force_copy<impl_const_iterator>(last)));
   }

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

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

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

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

   //! Effects: Returns an object of value_compare constructed out
   //!   of the comparison object.
   //!
   //! Complexity: Constant.
   value_compare value_comp() const
      { return value_compare(container_detail::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.
   iterator find(const key_type& x)
      { return container_detail::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.s
   const_iterator find(const key_type& x) const
      { return container_detail::force_copy<const_iterator>(m_flat_tree.find(x)); }

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

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

   //! Returns: A const iterator pointing to the first element with key not
   //!   less than k, or a.end() if such an element is not found.
   //!
   //! Complexity: Logarithmic
   const_iterator lower_bound(const key_type& x) const
      {  return container_detail::force_copy<const_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
   iterator upper_bound(const key_type& x)
      {  return container_detail::force_copy<iterator>(m_flat_tree.upper_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
   const_iterator upper_bound(const key_type& x) const
      {  return container_detail::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
   std::pair<iterator,iterator> equal_range(const key_type& x)
      {  return container_detail::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
   std::pair<const_iterator,const_iterator> equal_range(const key_type& x) const
      {  return container_detail::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.lower_bound_range(x)); }

   //! Effects: Returns true if x and y are equal
   //!
   //! Complexity: Linear to the number of elements in the container.
   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.
   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.
   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.
   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.
   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.
   friend bool operator>=(const flat_map& x, const flat_map& y)
   {  return !(x < y);  }

   //! Effects: x.swap(y)
   //!
   //! Complexity: Constant.
   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)){
         container_detail::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)){
         container_detail::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_DOXYGEN_INVOKED

}  //namespace container {

//!has_trivial_destructor_after_move<> == true_type
//!specialization for optimizations
template <class Key, class T, class Compare, class Allocator>
struct has_trivial_destructor_after_move<boost::container::flat_map<Key, T, Compare, Allocator> >
{
   typedef typename ::boost::container::allocator_traits<Allocator>::pointer pointer;
   static const bool value = ::boost::has_trivial_destructor_after_move<Allocator>::value &&
                             ::boost::has_trivial_destructor_after_move<pointer>::value &&
                             ::boost::has_trivial_destructor_after_move<Compare>::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. The flat_multimap
//! class supports random-access iterators.
//!
//! 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>).
//!
//! Compare is the ordering function for Keys (e.g. std::less<Key>).
//!
//! Allocator is the allocator to allocate the value_types
//! (e.g. allocator< std::pair<Key, T> >).
//!
//! flat_multimap is similar to std::multimap but it's implemented like an ordered vector.
//! This means that inserting a new element into a flat_map invalidates
//! previous iterators and references
//!
//! Erasing an element invalidates 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 mapped_type
//! \tparam Compare is the ordering function for Keys (e.g. std::less<Key>).
//! \tparam Allocator is the allocator to allocate the value_types
//!   (e.g. allocator< std::pair<Key, T> > ).
#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
template <class Key, class T, class Compare = std::less<Key>, class Allocator = new_allocator< std::pair< Key, T> > >
#else
template <class Key, class T, class Compare, class Allocator>
#endif
class flat_multimap
{
   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
   private:
   BOOST_COPYABLE_AND_MOVABLE(flat_multimap)
   typedef container_detail::flat_tree<Key,
                           std::pair<Key, T>,
                           container_detail::select1st< std::pair<Key, T> >,
                           Compare,
                           Allocator> tree_t;
   //This is the real tree stored here. It's based on a movable pair
   typedef container_detail::flat_tree<Key,
                           container_detail::pair<Key, T>,
                           container_detail::select1st<container_detail::pair<Key, T> >,
                           Compare,
                           typename allocator_traits<Allocator>::template portable_rebind_alloc
                              <container_detail::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;
   typedef container_detail::flat_tree_value_compare
      < Compare
      , container_detail::select1st< std::pair<Key, T> >
      , std::pair<Key, T> >                                                         value_compare_impl;
   typedef typename container_detail::get_flat_tree_iterators
         <typename allocator_traits<Allocator>::pointer>::iterator                  iterator_impl;
   typedef typename container_detail::get_flat_tree_iterators
      <typename allocator_traits<Allocator>::pointer>::const_iterator               const_iterator_impl;
   typedef typename container_detail::get_flat_tree_iterators
         <typename allocator_traits<Allocator>::pointer>::reverse_iterator          reverse_iterator_impl;
   typedef typename container_detail::get_flat_tree_iterators
         <typename allocator_traits<Allocator>::pointer>::const_reverse_iterator    const_reverse_iterator_impl;
   public:
   typedef typename impl_tree_t::stored_allocator_type   impl_stored_allocator_type;
   private:
   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

   public:

   //////////////////////////////////////////////
   //
   //                    types
   //
   //////////////////////////////////////////////
   typedef Key                                                                      key_type;
   typedef T                                                                        mapped_type;
   typedef std::pair<Key, T>                                                        value_type;
   typedef ::boost::container::allocator_traits<Allocator>                          allocator_traits_type;
   typedef typename boost::container::allocator_traits<Allocator>::pointer          pointer;
   typedef typename boost::container::allocator_traits<Allocator>::const_pointer    const_pointer;
   typedef typename boost::container::allocator_traits<Allocator>::reference        reference;
   typedef typename boost::container::allocator_traits<Allocator>::const_reference  const_reference;
   typedef typename boost::container::allocator_traits<Allocator>::size_type        size_type;
   typedef typename boost::container::allocator_traits<Allocator>::difference_type  difference_type;
   typedef Allocator                                                                allocator_type;
   typedef BOOST_CONTAINER_IMPDEF(Allocator)                                        stored_allocator_type;
   typedef BOOST_CONTAINER_IMPDEF(value_compare_impl)                               value_compare;
   typedef Compare                                                                  key_compare;
   typedef BOOST_CONTAINER_IMPDEF(iterator_impl)                                    iterator;
   typedef BOOST_CONTAINER_IMPDEF(const_iterator_impl)                              const_iterator;
   typedef BOOST_CONTAINER_IMPDEF(reverse_iterator_impl)                            reverse_iterator;
   typedef BOOST_CONTAINER_IMPDEF(const_reverse_iterator_impl)                      const_reverse_iterator;
   typedef BOOST_CONTAINER_IMPDEF(impl_value_type)                                  movable_value_type;

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

   //! Effects: Default constructs an empty flat_map.
   //!
   //! Complexity: Constant.
   flat_multimap()
      : m_flat_tree()
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Constructs an empty flat_multimap using the specified comparison
   //!   object and allocator.
   //!
   //! Complexity: Constant.
   explicit flat_multimap(const Compare& comp,
                          const allocator_type& a = allocator_type())
      : m_flat_tree(comp, container_detail::force<impl_allocator_type>(a))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Constructs an empty flat_multimap using the specified allocator.
   //!
   //! Complexity: Constant.
   explicit flat_multimap(const allocator_type& a)
      : m_flat_tree(container_detail::force<impl_allocator_type>(a))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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
   //! comp and otherwise N logN, where N is last - first.
   template <class InputIterator>
   flat_multimap(InputIterator first, InputIterator last,
            const Compare& comp        = Compare(),
            const allocator_type& a = allocator_type())
      : m_flat_tree(false, first, last, comp, container_detail::force<impl_allocator_type>(a))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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
   //! comp and otherwise N logN, where N is last - first.
   template <class InputIterator>
   flat_multimap(InputIterator first, InputIterator last, const allocator_type& a)
      : m_flat_tree(false, first, last, Compare(), container_detail::force<impl_allocator_type>(a))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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>
   flat_multimap(ordered_range_t, InputIterator first, InputIterator last,
            const Compare& comp        = Compare(),
            const allocator_type& a = allocator_type())
      : m_flat_tree(ordered_range, first, last, comp, a)
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
   //! 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
   //! comp and otherwise N logN, where N is last - first.
   flat_multimap(std::initializer_list<value_type> il, const Compare& comp = Compare(), const allocator_type& a = allocator_type())
      : m_flat_tree(false, il.begin(), il.end(), comp, container_detail::force<impl_allocator_type>(a))
   {
       //A type must be std::pair<Key, T>
       BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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
   //! comp and otherwise N logN, where N is last - first.
   flat_multimap(std::initializer_list<value_type> il, const allocator_type& a)
      : m_flat_tree(false, il.begin(), il.end(), Compare(), container_detail::force<impl_allocator_type>(a))
   {
       //A type must be std::pair<Key, T>
       BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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.
   flat_multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp = Compare(),
                 const allocator_type& a = allocator_type())
      : m_flat_tree(ordered_range, il.begin(), il.end(), comp, a)
   {
       //A type must be std::pair<Key, T>
       BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }
#endif

   //! Effects: Copy constructs a flat_multimap.
   //!
   //! Complexity: Linear in x.size().
   flat_multimap(const flat_multimap& x)
      : m_flat_tree(x.m_flat_tree)
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Move constructs a flat_multimap. Constructs *this using x's resources.
   //!
   //! Complexity: Constant.
   //!
   //! Postcondition: x is emptied.
   flat_multimap(BOOST_RV_REF(flat_multimap) x)
      : m_flat_tree(boost::move(x.m_flat_tree))
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Copy constructs a flat_multimap using the specified allocator.
   //!
   //! Complexity: Linear in x.size().
   flat_multimap(const flat_multimap& x, const allocator_type &a)
      : m_flat_tree(x.m_flat_tree, a)
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! 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.
   flat_multimap(BOOST_RV_REF(flat_multimap) x, const allocator_type &a)
      : m_flat_tree(boost::move(x.m_flat_tree), a)
   {
      //A type must be std::pair<Key, T>
      BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value));
   }

   //! Effects: Makes *this a copy of x.
   //!
   //! Complexity: Linear in x.size().
   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.
   flat_multimap& operator=(BOOST_RV_REF(flat_multimap) x)
      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
                                 && boost::container::container_detail::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().
   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.
   allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::force<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.
   iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::force_copy<iterator>(m_flat_tree.begin()); }

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

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

   //! Effects: Returns a const_iterator to the end of the container.
   //!
   //! Throws: Nothing.
   //!
   //! Complexity: Constant.
   const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::force_copy<const_iterator>(m_flat_tree.cbegin()); }

   //! Effects: Returns a const_iterator to the end of the container.
   //!
   //! Throws: Nothing.
   //!
   //! Complexity: Constant.
   const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::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.
   const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
      { return container_detail::force_copy<const_reverse_iterator>(m_flat_tree.crend()); }

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

   //! Effects: Returns true if the container contains no elements.
   //!
   //! Throws: Nothing.
   //!
   //! Complexity: Constant.
   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.
   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.
   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.
   size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
      { return m_flat_tree.capacity(); }

   //! Effects: If n is less than or equal to capacity(), 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.
   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().
   void shrink_to_fit()
      { m_flat_tree.shrink_to_fit(); }

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

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

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

   //! @copydoc ::boost::container::flat_set::index_of(const_iterator) const
   size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
   {  return m_flat_tree.index_of(container_detail::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>
   iterator emplace(BOOST_FWD_REF(Args)... args)
   {  return container_detail::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>
   iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
   {
      return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_equal
         (container_detail::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 \
   iterator emplace(BOOST_MOVE_UREF##N)\
   {  return container_detail::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 \
   iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
   {\
      return container_detail::force_copy<iterator>(m_flat_tree.emplace_hint_equal\
         (container_detail::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.
   iterator insert(const value_type& x)
   {
      return container_detail::force_copy<iterator>(
         m_flat_tree.insert_equal(container_detail::force<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.
   iterator insert(BOOST_RV_REF(value_type) x)
   { return container_detail::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.
   iterator insert(BOOST_RV_REF(impl_value_type) x)
      { return container_detail::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.
   iterator insert(const_iterator p, const value_type& x)
   {
      return container_detail::force_copy<iterator>
         (m_flat_tree.insert_equal( container_detail::force_copy<impl_const_iterator>(p)
                                  , container_detail::force<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.
   iterator insert(const_iterator p, BOOST_RV_REF(value_type) x)
   {
      return container_detail::force_copy<iterator>
         (m_flat_tree.insert_equal(container_detail::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.
   iterator insert(const_iterator p, BOOST_RV_REF(impl_value_type) x)
   {
      return container_detail::force_copy<iterator>(
         m_flat_tree.insert_equal(container_detail::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: At most N log(size()+N) (N is the distance from first to last)
   //!   search time plus N*size() insertion time.
   //!
   //! Note: If an element is inserted it might invalidate elements.
   template <class InputIterator>
   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: At most N log(size()+N) (N is the distance from first to last)
   //!   search time plus N*size() insertion time.
   //!
   //! Note: If an element is inserted it might invalidate elements.
   //!
   //! Note: Non-standard extension.
   template <class InputIterator>
   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: At most N log(size()+N) (N is the distance from first to last)
   //!   search time plus N*size() insertion time.
   //!
   //! Note: If an element is inserted it might invalidate elements.
   void insert(std::initializer_list<value_type> il)
   {  m_flat_tree.insert_equal(il.begin(), 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: At most N log(size()+N) (N is the distance from first to last)
   //!   search time plus N*size() insertion time.
   //!
   //! Note: If an element is inserted it might invalidate elements.
   //!
   //! Note: Non-standard extension.
   void insert(ordered_range_t, std::initializer_list<value_type> il)
   {  m_flat_tree.insert_equal(ordered_range, il.begin(), il.end());  }
#endif

   //! 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.
   iterator erase(const_iterator p)
   {
      return container_detail::force_copy<iterator>(
         m_flat_tree.erase(container_detail::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.
   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.
   iterator erase(const_iterator first, const_iterator last)
   {
      return container_detail::force_copy<iterator>
         (m_flat_tree.erase( container_detail::force_copy<impl_const_iterator>(first)
                           , container_detail::force_copy<impl_const_iterator>(last)));
   }

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

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

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

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

   //! Effects: Returns an object of value_compare constructed out
   //!   of the comparison object.
   //!
   //! Complexity: Constant.
   value_compare value_comp() const
      { return value_compare(container_detail::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.
   iterator find(const key_type& x)
      { return container_detail::force_copy<iterator>(m_flat_tree.find(x)); }

   //! 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.
   const_iterator find(const key_type& x) const
      { return container_detail::force_copy<const_iterator>(m_flat_tree.find(x)); }

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

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

   //! Returns: A const iterator pointing to the first element with key
   //!   not less than k, or a.end() if such an element is not found.
   //!
   //! Complexity: Logarithmic
   const_iterator lower_bound(const key_type& x) const
      {  return container_detail::force_copy<const_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
   iterator upper_bound(const key_type& x)
      {return container_detail::force_copy<iterator>(m_flat_tree.upper_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
   const_iterator upper_bound(const key_type& x) const
      {  return container_detail::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
   std::pair<iterator,iterator> equal_range(const key_type& x)
      {  return container_detail::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
   std::pair<const_iterator,const_iterator> equal_range(const key_type& x) const
      {  return container_detail::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x));   }

   //! Effects: Returns true if x and y are equal
   //!
   //! Complexity: Linear to the number of elements in the container.
   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.
   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.
   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 greater than y
   //!
   //! Complexity: Linear to the number of elements in the container.
   friend bool operator>(const flat_multimap& x, const flat_multimap& 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.
   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.
   friend bool operator>=(const flat_multimap& x, const flat_multimap& y)
   {  return !(x < y);  }

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

}}

#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 Allocator>
struct has_trivial_destructor_after_move< boost::container::flat_multimap<Key, T, Compare, Allocator> >
{
   typedef typename ::boost::container::allocator_traits<Allocator>::pointer pointer;
   static const bool value = ::boost::has_trivial_destructor_after_move<Allocator>::value &&
                             ::boost::has_trivial_destructor_after_move<pointer>::value &&
                             ::boost::has_trivial_destructor_after_move<Compare>::value;
};

}  //namespace boost {

#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

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

#endif   // BOOST_CONTAINER_FLAT_MAP_HPP


text:
'''
Execute external process without user input
It handles very long outputs on different platforms

Prints output both to stdout and a variable to return
'''

from biicode.common.exception import BiiException
import os
from subprocess import PIPE, Popen, STDOUT
import platform
import select
import time
from biicode.client.shell.userio import UserIO

def simple_exe(command, cwd=None):
    # If there is testing output, capture and append to it
    if hasattr(simple_exe, 'output'):
        retcode, output = execute(command, cwd=cwd)
        simple_exe.output += output
        return retcode

    current_dir = os.getcwd()
    if cwd:
        os.chdir(cwd)
    try:
        retcode = os.system(command)
    finally:
        os.chdir(current_dir)
    return retcode

def execute(command, ui=None, cwd=None, env=None, shell=None):
    ex = {'Darwin': execute_mac,
          'Windows': execute_win,
          'Linux': execute_linux}
    if env is None:
        env = os.environ
    try:
        #TODO: Check this, the default is different in Windows and others
        if shell is None:
            if platform.system() == 'Windows':
                shell = False
            else:
                shell = True
        if ui is None:
            ui = UserIO()
        return ex[platform.system()](command, ui, cwd, env, shell)
    except KeyError:
        raise BiiException('Platform not supported')

MAX_OUPUT_SIZE = 1048576  # 1MB
import sys

def execute_mac(command, ui, cwd, env, shell):
    '''Spaws a process to execute given command'''
    import errno

    master_fd, slave_fd = os.pipe()
    if not env:
        env = {}
    path = os.getenv('PATH')
    for p in ['/usr/bin/', '/opt/local/bin/', '/usr/local/bin/']:
        if not p in path:
            path += ':' + p
    env['PATH'] = path
    proc = Popen(command, shell=shell, stdout=slave_fd, stderr=slave_fd, cwd=cwd, env=env)
    timeout = 1
    stdout = []

    while proc.poll() is None:
        try:
            inputready, _, _ = select.select([master_fd, sys.stdin], [], [], timeout)
            if inputready:
                data = os.read(master_fd, MAX_OUPUT_SIZE)
                if data:
                    ui.out.write(data)
                    stdout.append(data)
                    ui.out.flush(truncate=False)
        except OSError, e:
            if e.errno != errno.EINTR:
                raise

    out, err = proc.communicate()
    os.close(slave_fd)  # can't do it sooner: it leads to errno.EIO error
    os.close(master_fd)
    if out:
        stdout.append(out)
        ui.out.write(out)
    if err:
        stdout.append(err)
        ui.out.write(err)
    return (proc.returncode, '\n'.join(stdout))

def execute_linux(command, ui, cwd, env, shell):
    '''Spaws a process to execute given command'''
    def non_blocking_read(fd):
        import fcntl
        fl = fcntl.fcntl(fd, fcntl.F_GETFL)
        fcntl.fcntl(fd, fcntl.F_SETFL, fl | os.O_NONBLOCK)
        try:
            return os.read(fd, MAX_OUPUT_SIZE)
        except:
            return ''

    master_fd, slave_fd = os.pipe()
    if not env:
        env = {}
    env['PATH'] = os.getenv('PATH') + ":/opt/local/bin/"
    proc = Popen(command, shell=shell,
                 stdout=slave_fd, stderr=slave_fd, cwd=cwd,
                 env=env)
    timeout = 1
    stdout = []

    while proc.poll() is None:
        time.sleep(.2)
        inputready, _, _ = select.select([master_fd, sys.stdin], [], [], timeout)
        if inputready:
            #data = os.read(master_fd, MAX_OUPUT_SIZE)
            data = non_blocking_read(master_fd)
            if data:
                ui.out.write(data)
                stdout.append(data)
                ui.out.flush(truncate=False)

    inputready, _, _ = select.select([master_fd, sys.stdin], [], [], timeout)
    if inputready:
        data = non_blocking_read(master_fd)
        if data:
            ui.out.write(data)
            stdout.append(data)
            ui.out.flush(truncate=False)
    out, err = proc.communicate()
    os.close(slave_fd)  # can't do it sooner: it leads to errno.EIO error
    os.close(master_fd)
    if out:
        stdout.append(out)
        ui.out.write(out)
        ui.out.flush(truncate=False)
    if err:
        stdout.append(err)
        ui.out.write(err)
    return (proc.returncode, '\n'.join(stdout))

def execute_win(command, ui, cwd, env, shell):
    '''Spaws a process to execute given command'''
    try:
        proc = Popen(command, bufsize=1, shell=shell,
                     stdout=PIPE, stderr=STDOUT, cwd=cwd, env=env)
    except OSError as e:
        kls = e.__class__
        raise kls('%s. While executing %s' % (str(e), command))

    output = []

    while True:
        line = proc.stdout.readline()
        if not line:
            break
        output.append(line)
        ui.out.write(line)
    out, err = proc.communicate()

    if out:
        output.append(out)
        ui.out.write(out)
    if err:
        output.append(err)
        ui.out.error(err)
    output = ''.join(output)
    return (proc.returncode, output)

redpajama_set_name: RedPajamaGithub


text:
Back to Basics

A PHP School flagship workshop targeted towards beginner developers starting in PHP.
 Bring your imagination to life in an open learning eco-system

----

## Installation

```php
echo 'Coming Soon!';
```


text:
using namespace BloombergLP;

//==========================================================================
//                  STANDARD BDE ASSERT TEST MACRO
//--------------------------------------------------------------------------
// NOTE: THIS IS A LOW-LEVEL COMPONENT AND MAY NOT USE ANY C++ LIBRARY
// FUNCTIONS, INCLUDING IOSTREAMS.
static int testStatus = 0;
static bool verbose = false;
static bool veryVerbose = false;

static void aSsErT(int c, const char *s, int i) {
    if (c) {
        bsl::fprintf(stderr, "Error " __FILE__ "(%d): %s    (failed)\n", i, s);
        if (testStatus >= 0 && testStatus <= 100) ++testStatus;
    }
}

#define ASSERT(X) { aSsErT(!(X), #X, __LINE__); }

#define LOOP_ASSERT(I,X) { \
    if (!(X)) { bsl::printf("%s: %d\n", #I, I); \
                aSsErT(1, #X, __LINE__); } }

//--------------------------------------------------------------------------

//=============================================================================
//                  SEMI-STANDARD TEST OUTPUT MACROS
//-----------------------------------------------------------------------------
// #define P(X) cout << #X " = " << (X) << endl; // Print identifier and value.
#define Q(X) bsl::printf("<| " #X " |>\n");  // Quote identifier literally.
//#define P_(X) cout << #X " = " << (X) << ", " << flush; // P(X) without '\n'
#define L_ __LINE__                           // current Line number
#define T_ bsl::printf("\t");             // Print a tab (w/o newline)

//=============================================================================
//                  USAGE EXAMPLE HELPER FUNCTIONS
//-----------------------------------------------------------------------------

int newFunction()
    // Return 1
{
    return 1;
}

// int OldFunction()
// Not defined and never called due to conditional compilation

//=============================================================================
//                  MAIN PROGRAM
//-----------------------------------------------------------------------------
int main(int argc, char *argv[])
{
    int test = argc > 1 ? bsl::atoi(argv[1]) : 0;

    verbose = (argc > 2);
    veryVerbose = (argc > 3);

    bsl::printf("TEST %s CASE %d\n", __FILE__, test);

    switch (test) { case 0:
      case 3: {
        //--------------------------------------------------------------------
        // TEST USAGE EXAMPLE
        //
        // Concern:
        //   That the usage example in the user documentation compiles and
        //   runs as expected.
        //
        // Plan:
        //   Use the exact text of the usage example from the user
        //   documentation, but change uses of 'assert' to 'ASSERT'.
        //
        // Testing:
        //   USAGE EXAMPLE
        //--------------------------------------------------------------------

        if (verbose) bsl::printf("\nTEST USAGE EXAMPLE"
                                 "\n==================\n");

// At compile time, the version of BBL can be used to select an older or newer
// way to accomplish a task, to enable new functionality, or to accommodate an
// interface change.  For example, if a function changed names (a rare
// occurrence, but disruptive when it does happen), disruption can be minimized
// by conditionally calling the old or new function name using conditional
// compilation.  The '#if' directive compares 'BBL_VERSION' to a specified
// major, minor, and patch version 4 composed using 'BBL_MAKE_VERSION':
//..
    #if BBL_VERSION > BSL_MAKE_VERSION(1, 2)
        // Call 'newFunction' for BBL version 1.2 and later:
        int result = newFunction();
    #else
        // Call 'oldFunction' for BBL older than version 1.2:
        int result = oldFunction();
    #endif

        ASSERT(result);
//..
      } break;

      case 2: {
        //--------------------------------------------------------------------
        // TEST BBL_MAKE_VERSION MACRO
        //
        // Concerns:
        //   That BBL_MAKE_VERSION create a compile-time constant if its
        //   arguments are all compile-time constants.
        //   That BBL_MAKE_VERSION correctly composes a major, minor, and
        //   patch version number into a single integer.  Each component can
        //   be in the range 0-99.
        //
        // Plan:
        //   Use the result of BBL_MAKE_VERSION as an array dimension to
        //   prove that it is a compile-time constant.
        //   Using ad-hoc data selection, create a number of version values
        //   using the 'BBL_MAKE_VERSION' macro and verify that the expected
        //   value matches the actual value.
        //
        // Testing:
        //   BBL_MAKE_VERSION(major, minor)
        //--------------------------------------------------------------------

        if (verbose) bsl::printf("\nTEST BBL_MAKE_VERSION MACRO"
                                 "\n===========================\n");

        static const char COMPILE_ASSERT[BSL_MAKE_VERSION(0,1)] = { 0 };
        ASSERT(sizeof(COMPILE_ASSERT) == 100);

        static struct {
            int d_line;
            int d_major;
            int d_minor;
            int d_version;
        } const DATA[] = {
            //line major minor version
            //---- ----- ----- -------
            {  L_,    0,    0,       0 },
            {  L_,    0,    1,     100 },
            {  L_,    1,    0,   10000 },
            {  L_,    1,    1,   10100 },
            {  L_,   12,   34,  123400 },
            {  L_,   99,   99,  999900 },
            {  L_,    9,    9,   90900 },
            {  L_,   10,   20,  102000 }
        };

        static const int NUM_DATA = sizeof(DATA) / sizeof(*DATA);

        for (int i = 0; i < NUM_DATA; ++i) {
            const int LINE  = DATA[i].d_line;
            const int MAJOR = DATA[i].d_major;
            const int MINOR = DATA[i].d_minor;
            const int EXP   = DATA[i].d_version;

            LOOP_ASSERT(LINE, EXP == BSL_MAKE_VERSION(MAJOR, MINOR));
        }

      } break;

      case 1: {
        //--------------------------------------------------------------------
        // TEST VERSION CONSISTENCY
        //
        // Concerns:
        //   That BBL_VERSION corresponds to the two components
        //   BBL_VERSION_MAJOR and BBL_VERSION_MINOR
        //
        // Plan:
        //   Decompose BBL_VERSION into its three components and verify
        //   that they correspond to the defined macros.
        //
        // Testing:
        //   BBL_VERSION
        //   BBL_VERSION_MAJOR
        //   BBL_VERSION_MINOR
        //--------------------------------------------------------------------

        if (verbose) bsl::printf("\nTEST VERSION CONSISTENCY"
                                 "\n========================\n");

        int major = (BBL_VERSION / 10000) % 100;
        int minor = (BBL_VERSION / 100) % 100;

        ASSERT(BBL_VERSION_MAJOR == major);
        ASSERT(BBL_VERSION_MINOR == minor);

      } break;

      default: {
        bsl::fprintf(stderr, "WARNING: CASE `%d' NOT FOUND.\n", test);
        testStatus = -1;
      }
    }

    if (testStatus > 0) {
        bsl::fprintf(stderr, "Error, non-zero test status = %d.\n",
                     testStatus);
    }
    return testStatus;
}

// ----------------------------------------------------------------------------
// Copyright 2015 Bloomberg Finance L.P.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// ----------------------------- END-OF-FILE ----------------------------------