//////////////////////////////////////////////////////////////////////////////

//

// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost

// Software License, Version 1.0. (See accompanying file

// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

//

// See http://www.boost.org/libs/container for documentation.

//

//////////////////////////////////////////////////////////////////////////////

#ifndef BOOST_CONTAINER_FLAT_MAP_HPP

#define BOOST_CONTAINER_FLAT_MAP_HPP

#ifndef BOOST_CONFIG_HPP

# include <boost/config.hpp>

#endif

#if defined(BOOST_HAS_PRAGMA_ONCE)

# pragma once

#endif

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

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

// container

#include <boost/container/allocator_traits.hpp>

#include <boost/container/container_fwd.hpp>

#include <boost/container/new_allocator.hpp> //new_allocator

#include <boost/container/throw_exception.hpp>

// container/detail

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

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

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

#include <boost/container/detail/algorithm.hpp> //equal()

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

// move

#include <boost/move/utility_core.hpp>

#include <boost/move/traits.hpp>

// move/detail

#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)

#include <boost/move/detail/fwd_macros.hpp>

#endif

#include <boost/move/detail/move_helpers.hpp>

// intrusive

#include <boost/intrusive/detail/minimal_pair_header.hpp> //pair

#include <boost/intrusive/detail/minimal_less_equal_header.hpp>//less, equal

//others

#include <boost/core/no_exceptions_support.hpp>

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)

#include <initializer_list>

#endif

namespace boost {

namespace container {

#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

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

class flat_multimap;

namespace dtl{

template<class D, class S>

BOOST_CONTAINER_FORCEINLINE static D &force(S &s)

{ return *reinterpret_cast<D*>(&s); }

template<class D, class S>

BOOST_CONTAINER_FORCEINLINE static D force_copy(const S &s)

{

const D *const vp = reinterpret_cast<const D *>(&s);

D ret_val(*vp);

return ret_val;

}

} //namespace dtl{

#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

//! A flat_map is a kind of associative container that supports unique keys (contains at

//! most one of each key value) and provides for fast retrieval of values of another

//! type T based on the keys.

//!

//! A flat_map satisfies all of the requirements of a container, a reversible

//! container and an associative container. A flat_map also provides

//! most operations described for unique keys. For a

//! flat_map<Key,T> the key_type is Key and the value_type is std::pair<Key,T>

//! (unlike std::map<Key, T> which value_type is std::pair<<b>const</b> Key, T>).

//!

//! flat_map is similar to std::map but it's implemented by as an ordered sequence container.

//! The underlying sequence container is by default <i>vector</i> but it can also work

//! user-provided vector-like SequenceContainers (like <i>static_vector</i> or <i>small_vector</i>).

//!

//! Using vector-like sequence containers means that inserting a new element into a flat_map might invalidate

//! previous iterators and references (unless that sequence container is <i>stable_vector</i> or a similar

//! container that offers stable pointers and references). Similarly, erasing an element might invalidate

//! iterators and references pointing to elements that come after (their keys are bigger) the erased element.

//!

//! This container provides random-access iterators.

//!

//! \tparam Key is the key_type of the map

//! \tparam Value is the <code>mapped_type</code>

//! \tparam Compare is the ordering function for Keys (e.g. <i>std::less<Key></i>).

//! \tparam AllocatorOrContainer is either:

//! - The allocator to allocate <code>value_type</code>s (e.g. <i>allocator< std::pair<Key, T> > </i>).

//! (in this case <i>sequence_type</i> will be vector<value_type, AllocatorOrContainer>)

//! - The SequenceContainer to be used as the underlying <i>sequence_type</i>. It must be a vector-like

//! sequence container with random-access iterators..

#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED

template <class Key, class T, class Compare = std::less<Key>, class AllocatorOrContainer = new_allocator< std::pair< Key, T> > >

#else

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

#endif

class flat_map

{

#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

private:

BOOST_COPYABLE_AND_MOVABLE(flat_map)

//This is the tree that we should store if pair was movable

typedef dtl::flat_tree<

std::pair<Key, T>,

dtl::select1st<Key>,

Compare,

AllocatorOrContainer> tree_t;

//This is the real tree stored here. It's based on a movable pair

typedef dtl::flat_tree<

dtl::pair<Key, T>,

dtl::select1st<Key>,

Compare,

typename dtl::container_or_allocator_rebind<AllocatorOrContainer, dtl::pair<Key, T> >::type

> impl_tree_t;

impl_tree_t m_flat_tree; // flat tree representing flat_map

typedef typename impl_tree_t::value_type impl_value_type;

typedef typename impl_tree_t::const_iterator impl_const_iterator;

typedef typename impl_tree_t::iterator impl_iterator;

typedef typename impl_tree_t::allocator_type impl_allocator_type;

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)

typedef std::initializer_list<impl_value_type> impl_initializer_list;

#endif

typedef dtl::flat_tree_value_compare

< Compare

, dtl::select1st<Key>

, std::pair<Key, T> > value_compare_t;

typedef typename tree_t::iterator iterator_t;

typedef typename tree_t::const_iterator const_iterator_t;

typedef typename tree_t::reverse_iterator reverse_iterator_t;

typedef typename tree_t::const_reverse_iterator const_reverse_iterator_t;

public:

typedef typename impl_tree_t::stored_allocator_type impl_stored_allocator_type;

typedef typename impl_tree_t::sequence_type impl_sequence_type;

BOOST_CONTAINER_FORCEINLINE impl_tree_t &tree()

{ return m_flat_tree; }

BOOST_CONTAINER_FORCEINLINE const impl_tree_t &tree() const

{ return m_flat_tree; }

private:

typedef typename tree_t::get_stored_allocator_const_return_t get_stored_allocator_const_return_t;

typedef typename tree_t::get_stored_allocator_noconst_return_t get_stored_allocator_noconst_return_t;

typedef typename impl_tree_t::get_stored_allocator_const_return_t impl_get_stored_allocator_const_return_t;

typedef typename impl_tree_t::get_stored_allocator_noconst_return_t impl_get_stored_allocator_noconst_return_t;

#endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED

public:

//////////////////////////////////////////////

//

// types

//

//////////////////////////////////////////////

typedef Key key_type;

typedef T mapped_type;

typedef Compare key_compare;

typedef std::pair<Key, T> value_type;

typedef typename BOOST_CONTAINER_IMPDEF(tree_t::sequence_type) sequence_type;

typedef typename sequence_type::allocator_type allocator_type;

typedef ::boost::container::allocator_traits<allocator_type> allocator_traits_type;

typedef typename sequence_type::pointer pointer;

typedef typename sequence_type::const_pointer const_pointer;

typedef typename sequence_type::reference reference;

typedef typename sequence_type::const_reference const_reference;

typedef typename sequence_type::size_type size_type;

typedef typename sequence_type::difference_type difference_type;

typedef typename BOOST_CONTAINER_IMPDEF(tree_t::stored_allocator_type) stored_allocator_type;

typedef typename BOOST_CONTAINER_IMPDEF(tree_t::value_compare) value_compare;

typedef typename sequence_type::iterator iterator;

typedef typename sequence_type::const_iterator const_iterator;

typedef typename sequence_type::reverse_iterator reverse_iterator;

typedef typename sequence_type::const_reverse_iterator const_reverse_iterator;

typedef BOOST_CONTAINER_IMPDEF(impl_value_type) movable_value_type;

//AllocatorOrContainer::value_type must be std::pair<Key, T>

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

//////////////////////////////////////////////

//

// construct/copy/destroy

//

//////////////////////////////////////////////

//! <b>Effects</b>: Default constructs an empty flat_map.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE flat_map() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<AllocatorOrContainer>::value &&

dtl::is_nothrow_default_constructible<Compare>::value)

: m_flat_tree()

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified allocator.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE explicit flat_map(const allocator_type& a)

: m_flat_tree(dtl::force<const impl_allocator_type>(a))

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified

//! comparison object.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE explicit flat_map(const Compare& comp)

: m_flat_tree(comp)

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified

//! comparison object and allocator.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE flat_map(const Compare& comp, const allocator_type& a)

: m_flat_tree(comp, dtl::force<const impl_allocator_type>(a))

{}

//! <b>Effects</b>: Constructs an empty flat_map and

//! and inserts elements from the range [first ,last ).

//!

//! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using

//! the predicate and otherwise N logN, where N is last - first.

template <class InputIterator>

BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last)

: m_flat_tree(true, first, last)

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified

//! allocator, and inserts elements from the range [first ,last ).

//!

//! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using

//! the predicate and otherwise N logN, where N is last - first.

template <class InputIterator>

BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const allocator_type& a)

: m_flat_tree(true, first, last, dtl::force<const impl_allocator_type>(a))

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and

//! and inserts elements from the range [first ,last ).

//!

//! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using

//! the predicate and otherwise N logN, where N is last - first.

template <class InputIterator>

BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const Compare& comp)

: m_flat_tree(true, first, last, comp)

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and

//! allocator, and inserts elements from the range [first ,last ).

//!

//! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using

//! the predicate and otherwise N logN, where N is last - first.

template <class InputIterator>

BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)

: m_flat_tree(true, first, last, comp, dtl::force<const impl_allocator_type>(a))

{}

//! <b>Effects</b>: Constructs an empty flat_map

//! and inserts elements from the ordered range [first ,last). This function

//! is more efficient than the normal range creation for ordered ranges.

//!

//! <b>Requires</b>: [first ,last) must be ordered according to the predicate.

//!

//! <b>Complexity</b>: Linear in N.

//!

//! <b>Note</b>: Non-standard extension.

template <class InputIterator>

BOOST_CONTAINER_FORCEINLINE

flat_map(ordered_unique_range_t, InputIterator first, InputIterator last)

: m_flat_tree(ordered_range, first, last)

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and

//! inserts elements from the ordered range [first ,last). This function

//! is more efficient than the normal range creation for ordered ranges.

//!

//! <b>Requires</b>: [first ,last) must be ordered according to the predicate.

//!

//! <b>Complexity</b>: Linear in N.

//!

//! <b>Note</b>: Non-standard extension.

template <class InputIterator>

BOOST_CONTAINER_FORCEINLINE

flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp)

: m_flat_tree(ordered_range, first, last, comp)

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and

//! allocator, and inserts elements from the ordered range [first ,last). This function

//! is more efficient than the normal range creation for ordered ranges.

//!

//! <b>Requires</b>: [first ,last) must be ordered according to the predicate.

//!

//! <b>Complexity</b>: Linear in N.

//!

//! <b>Note</b>: Non-standard extension.

template <class InputIterator>

BOOST_CONTAINER_FORCEINLINE

flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)

: m_flat_tree(ordered_range, first, last, comp, dtl::force<const impl_allocator_type>(a))

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified allocator and

//! inserts elements from the ordered range [first ,last). This function

//! is more efficient than the normal range creation for ordered ranges.

//!

//! <b>Requires</b>: [first ,last) must be ordered according to the predicate.

//!

//! <b>Complexity</b>: Linear in N.

//!

//! <b>Note</b>: Non-standard extension.

template <class InputIterator>

BOOST_CONTAINER_FORCEINLINE

flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const allocator_type& a)

: m_flat_tree(ordered_range, first, last, Compare(), a)

{}

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)

//! <b>Effects</b>: Constructs an empty flat_map and

//! inserts elements from the range [il.begin() ,il.end()).

//!

//! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using

//! the predicate and otherwise N logN, where N is last - first.

BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il)

: m_flat_tree( true

, dtl::force<impl_initializer_list>(il).begin()

, dtl::force<impl_initializer_list>(il).end())

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified

//! allocator, and inserts elements from the range [il.begin() ,il.end()).

//!

//! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using

//! the predicate and otherwise N logN, where N is last - first.

BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const allocator_type& a)

: m_flat_tree( true

, dtl::force<impl_initializer_list>(il).begin()

, dtl::force<impl_initializer_list>(il).end()

, dtl::force<const impl_allocator_type>(a))

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and

//! inserts elements from the range [il.begin() ,il.end()).

//!

//! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using

//! the predicate and otherwise N logN, where N is last - first.

BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const Compare& comp)

: m_flat_tree(true

, dtl::force<impl_initializer_list>(il).begin()

, dtl::force<impl_initializer_list>(il).end()

, comp)

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and

//! allocator, and inserts elements from the range [il.begin() ,il.end()).

//!

//! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using

//! the predicate and otherwise N logN, where N is last - first.

BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)

: m_flat_tree(true

, dtl::force<impl_initializer_list>(il).begin()

, dtl::force<impl_initializer_list>(il).end()

, comp

, dtl::force<const impl_allocator_type>(a))

{}

//! <b>Effects</b>: Constructs an empty flat_map using and

//! inserts elements from the ordered unique range [il.begin(), il.end()). This function

//! is more efficient than the normal range creation for ordered ranges.

//!

//! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be

//! unique values.

//!

//! <b>Complexity</b>: Linear in N.

//!

//! <b>Note</b>: Non-standard extension.

BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il)

: m_flat_tree(ordered_unique_range

, dtl::force<impl_initializer_list>(il).begin()

, dtl::force<impl_initializer_list>(il).end())

{}

//! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and

//! inserts elements from the ordered unique range [il.begin(), il.end()). This function

//! is more efficient than the normal range creation for ordered ranges.

//!

//! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be

//! unique values.

//!

//! <b>Complexity</b>: Linear in N.

//!

//! <b>Note</b>: Non-standard extension.

BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp)

: m_flat_tree(ordered_unique_range

, dtl::force<impl_initializer_list>(il).begin()

, dtl::force<impl_initializer_list>(il).end()

, comp)

{}

//! <b>Effects</b>: 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.

//!

//! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be

//! unique values.

//!

//! <b>Complexity</b>: Linear in N.

//!

//! <b>Note</b>: Non-standard extension.

BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)

: m_flat_tree( ordered_unique_range

, dtl::force<impl_initializer_list>(il).begin()

, dtl::force<impl_initializer_list>(il).end()

, comp

, dtl::force<const impl_allocator_type>(a))

{}

#endif

//! <b>Effects</b>: Copy constructs a flat_map.

//!

//! <b>Complexity</b>: Linear in x.size().

BOOST_CONTAINER_FORCEINLINE flat_map(const flat_map& x)

: m_flat_tree(x.m_flat_tree)

{}

//! <b>Effects</b>: Move constructs a flat_map.

//! Constructs *this using x's resources.

//!

//! <b>Complexity</b>: Constant.

//!

//! <b>Postcondition</b>: x is emptied.

BOOST_CONTAINER_FORCEINLINE flat_map(BOOST_RV_REF(flat_map) x)

BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)

: m_flat_tree(boost::move(x.m_flat_tree))

{}

//! <b>Effects</b>: Copy constructs a flat_map using the specified allocator.

//!

//! <b>Complexity</b>: Linear in x.size().

BOOST_CONTAINER_FORCEINLINE flat_map(const flat_map& x, const allocator_type &a)

: m_flat_tree(x.m_flat_tree, dtl::force<const impl_allocator_type>(a))

{}

//! <b>Effects</b>: Move constructs a flat_map using the specified allocator.

//! Constructs *this using x's resources.

//!

//! <b>Complexity</b>: Constant if x.get_allocator() == a, linear otherwise.

BOOST_CONTAINER_FORCEINLINE flat_map(BOOST_RV_REF(flat_map) x, const allocator_type &a)

: m_flat_tree(boost::move(x.m_flat_tree), dtl::force<const impl_allocator_type>(a))

{}

//! <b>Effects</b>: Makes *this a copy of x.

//!

//! <b>Complexity</b>: Linear in x.size().

BOOST_CONTAINER_FORCEINLINE flat_map& operator=(BOOST_COPY_ASSIGN_REF(flat_map) x)

{ m_flat_tree = x.m_flat_tree; return *this; }

//! <b>Effects</b>: Move constructs a flat_map.

//! Constructs *this using x's resources.

//!

//! <b>Throws</b>: If allocator_traits_type::propagate_on_container_move_assignment

//! is false and (allocation throws or value_type's move constructor throws)

//!

//! <b>Complexity</b>: Constant if allocator_traits_type::

//! propagate_on_container_move_assignment is true or

//! this->get>allocator() == x.get_allocator(). Linear otherwise.

BOOST_CONTAINER_FORCEINLINE flat_map& operator=(BOOST_RV_REF(flat_map) x)

BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||

allocator_traits_type::is_always_equal::value) &&

boost::container::dtl::is_nothrow_move_assignable<Compare>::value)

{ m_flat_tree = boost::move(x.m_flat_tree); return *this; }

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)

//! <b>Effects</b>: 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

//! <b>Effects</b>: Returns a copy of the allocator that

//! was passed to the object's constructor.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<allocator_type>(m_flat_tree.get_allocator()); }

//! <b>Effects</b>: Returns a reference to the internal allocator.

//!

//! <b>Throws</b>: Nothing

//!

//! <b>Complexity</b>: Constant.

//!

//! <b>Note</b>: Non-standard extension.

BOOST_CONTAINER_FORCEINLINE get_stored_allocator_noconst_return_t get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW

{

impl_get_stored_allocator_noconst_return_t r = m_flat_tree.get_stored_allocator();

return dtl::force<stored_allocator_type>(r);

}

//! <b>Effects</b>: Returns a reference to the internal allocator.

//!

//! <b>Throws</b>: Nothing

//!

//! <b>Complexity</b>: Constant.

//!

//! <b>Note</b>: Non-standard extension.

BOOST_CONTAINER_FORCEINLINE get_stored_allocator_const_return_t get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW

{

impl_get_stored_allocator_const_return_t r = m_flat_tree.get_stored_allocator();

return dtl::force<const stored_allocator_type>(r);

}

//////////////////////////////////////////////

//

// iterators

//

//////////////////////////////////////////////

//! <b>Effects</b>: Returns an iterator to the first element contained in the container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE iterator begin() BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<iterator>(m_flat_tree.begin()); }

//! <b>Effects</b>: Returns a const_iterator to the first element contained in the container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<const_iterator>(m_flat_tree.begin()); }

//! <b>Effects</b>: Returns an iterator to the end of the container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE iterator end() BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<iterator>(m_flat_tree.end()); }

//! <b>Effects</b>: Returns a const_iterator to the end of the container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<const_iterator>(m_flat_tree.end()); }

//! <b>Effects</b>: Returns a reverse_iterator pointing to the beginning

//! of the reversed container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<reverse_iterator>(m_flat_tree.rbegin()); }

//! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning

//! of the reversed container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rbegin()); }

//! <b>Effects</b>: Returns a reverse_iterator pointing to the end

//! of the reversed container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<reverse_iterator>(m_flat_tree.rend()); }

//! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end

//! of the reversed container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rend()); }

//! <b>Effects</b>: Returns a const_iterator to the first element contained in the container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<const_iterator>(m_flat_tree.cbegin()); }

//! <b>Effects</b>: Returns a const_iterator to the end of the container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<const_iterator>(m_flat_tree.cend()); }

//! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning

//! of the reversed container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crbegin()); }

//! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end

//! of the reversed container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crend()); }

//////////////////////////////////////////////

//

// capacity

//

//////////////////////////////////////////////

//! <b>Effects</b>: Returns true if the container contains no elements.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE bool empty() const BOOST_NOEXCEPT_OR_NOTHROW

{ return m_flat_tree.empty(); }

//! <b>Effects</b>: Returns the number of the elements contained in the container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE size_type size() const BOOST_NOEXCEPT_OR_NOTHROW

{ return m_flat_tree.size(); }

//! <b>Effects</b>: Returns the largest possible size of the container.

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW

{ return m_flat_tree.max_size(); }

//! <b>Effects</b>: Number of elements for which memory has been allocated.

//! capacity() is always greater than or equal to size().

//!

//! <b>Throws</b>: Nothing.

//!

//! <b>Complexity</b>: Constant.

BOOST_CONTAINER_FORCEINLINE size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW

{ return m_flat_tree.capacity(); }

//! <b>Effects</b>: If n is less than or equal to capacity(), or the

//! underlying container has no `reserve` member, this call has no

//! effect. Otherwise, it is a request for allocation of additional memory.

//! If the request is successful, then capacity() is greater than or equal to

//! n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

//!

//! <b>Throws</b>: If memory allocation allocation throws or T's copy constructor throws.

//!

//! <b>Note</b>: If capacity() is less than "cnt", iterators and references to

//! to values might be invalidated.

BOOST_CONTAINER_FORCEINLINE void reserve(size_type cnt)

{ m_flat_tree.reserve(cnt); }

//! <b>Effects</b>: Tries to deallocate the excess of memory created

// with previous allocations. The size of the vector is unchanged

//!

//! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws.

//!

//! <b>Complexity</b>: Linear to size().

BOOST_CONTAINER_FORCEINLINE void shrink_to_fit()

{ m_flat_tree.shrink_to_fit(); }

//////////////////////////////////////////////

//

// element access

//

//////////////////////////////////////////////

#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)

//! Effects: If there is no key equivalent to x in the flat_map, inserts

//! value_type(x, T()) into the flat_map.

//!

//! Returns: A reference to the mapped_type corresponding to x in *this.

//!

//! Complexity: Logarithmic.

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) ;

#elif defined(BOOST_MOVE_HELPERS_RETURN_SFINAE_BROKEN)

//in compilers like GCC 3.4, we can't catch temporaries

BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](const key_type &k) { return this->priv_subscript(k); }

BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](BOOST_RV_REF(key_type) k) { return this->priv_subscript(::boost::move(k)); }

#else

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

#endif

//! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)

//! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value

//! as if by insert, constructing it from value_type(k, forward<M>(obj)).

//!

//! No iterators or references are invalidated. If the insertion is successful, pointers and references

//! to the element obtained while it is held in the node handle are invalidated, and pointers and

//! references obtained to that element before it was extracted become valid.

//!

//! Returns: The bool component is true if the insertion took place and false if the assignment

//! took place. The iterator component is pointing at the element that was inserted or updated.

//!

//! Complexity: Logarithmic in the size of the container.

template <class M>

BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(const key_type& k, BOOST_FWD_REF(M) obj)

{

return dtl::force_copy< std::pair<iterator, bool> >

(this->m_flat_tree.insert_or_assign

( impl_const_iterator(), k, ::boost::forward<M>(obj))

);

}

//! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)

//! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value

//! as if by insert, constructing it from value_type(k, move(obj)).

//!

//! No iterators or references are invalidated. If the insertion is successful, pointers and references

//! to the element obtained while it is held in the node handle are invalidated, and pointers and

//! references obtained to that element before it was extracted become valid.

//!

//! Returns: The bool component is true if the insertion took place and false if the assignment

//! took place. The iterator component is pointing at the element that was inserted or updated.

//!

//! Complexity: Logarithmic in the size of the container.

template <class M>

BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)

{

return dtl::force_copy< std::pair<iterator, bool> >

(this->m_flat_tree.insert_or_assign

( impl_const_iterator(), ::boost::move(k), ::boost::forward<M>(obj))

);

}

//! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)

//! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value

//! as if by insert, constructing it from value_type(k, forward<M>(obj)) and the new element

//! to the container as close as possible to the position just before hint.

//!

//! No iterators or references are invalidated. If the insertion is successful, pointers and references

//! to the element obtained while it is held in the node handle are invalidated, and pointers and

//! references obtained to that element before it was extracted become valid.

//!

//! Returns: The bool component is true if the insertion took place and false if the assignment

//! took place. The iterator component is pointing at the element that was inserted or updated.

//!

//! Complexity: Logarithmic in the size of the container in general, but amortized constant if

//! the new element is inserted just before hint.

template <class M>

BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(const_iterator hint, const key_type& k, BOOST_FWD_REF(M) obj)

{

return dtl::force_copy< std::pair<iterator, bool> >

(this->m_flat_tree.insert_or_assign

( dtl::force_copy<impl_const_iterator>(hint)

, k, ::boost::forward<M>(obj))

);

}

//! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)

//! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value

//! as if by insert, constructing it from value_type(k, move(obj)) and the new element

//! to the container as close as possible to the position just before hint.

//!

//! No iterators or references are invalidated. If the insertion is successful, pointers and references

//! to the element obtained while it is held in the node handle are invalidated, and pointers and

//! references obtained to that element before it was extracted become valid.

//!

//! Returns: The bool component is true if the insertion took place and false if the assignment

//! took place. The iterator component is pointing at the element that was inserted or updated.

//!

//! Complexity: Logarithmic in the size of the container in general, but amortized constant if

//! the new element is inserted just before hint.

template <class M>

BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)

{

return dtl::force_copy< std::pair<iterator, bool> >

(this->m_flat_tree.insert_or_assign

( dtl::force_copy<impl_const_iterator>(hint)

, ::boost::move(k), ::boost::forward<M>(obj))

);

}

//! @copydoc ::boost::container::flat_set::nth(size_type)

BOOST_CONTAINER_FORCEINLINE iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }

//! @copydoc ::boost::container::flat_set::nth(size_type) const

BOOST_CONTAINER_FORCEINLINE const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW

{ return dtl::force_copy<iterator>(m_flat_tree.nth(n)); }

//! @copydoc ::boost::container::flat_set::index_of(iterator)

BOOST_CONTAINER_FORCEINLINE size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW

{ return m_flat_tree.index_of(dtl::force_copy<impl_iterator>(p)); }

//! @copydoc ::boost::container::flat_set::index_of(const_iterator) const

BOOST_CONTAINER_FORCEINLINE size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW

{ return m_flat_tree.index_of(dtl::force_copy<impl_const_iterator>(p)); }

//! Returns: A reference to the element whose key is equivalent to x.

//!

//! Throws: An exception object of type out_of_range if no such element is present.

//!

//! Complexity: logarithmic.

T& at(const key_type& k)

{

iterator i = this->find(k);

if(i == this->end()){

throw_out_of_range("flat_map::at key not found");

}

return i->second;

}

//! Returns: A reference to the element whose key is equivalent to x.

//!

//! Throws: An exception object of type out_of_range if no such element is present.

//!

//! Complexity: logarithmic.

const T& at(const key_type& k) const

{

const_iterator i = this->find(k);

if(i == this->end()){

throw_out_of_range("flat_map::at key not found");

}

return i->second;

}

//////////////////////////////////////////////

//

// modifiers

//

//////////////////////////////////////////////

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

//! <b>Effects</b>: 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.

//!

//! <b>Returns</b>: 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.

//!

//! <b>Complexity</b>: Logarithmic search time plus linear insertion

//! to the elements with bigger keys than x.

//!

//! <b>Note</b>: If an element is inserted it might invalidate elements.

template <class... Args>

BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_FWD_REF(Args)... args)

{ return dtl::force_copy< std::pair<iterator, bool> >(m_flat_tree.emplace_unique(boost::forward<Args>(args)...)); }

//! <b>Effects</b>: 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.

//!

//! <b>Returns</b>: An iterator pointing to the element with key equivalent

//! to the key of x.

//!

//! <b>Complexity</b>: Logarithmic search time (constant if x is inserted

//! right before p) plus insertion linear to the elements with bigger keys than x.

//!

//! <b>Note</b>: If an element is inserted it might invalidate elements.

template <class... Args>

BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)

{

return dtl::force_copy<iterator>

(m_flat_tree.emplace_hint_unique( dtl::force_copy<impl_const_iterator>(hint)

, boost::forward<Args>(args)...));

}

//! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct,

//! forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

//!

//! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise

//! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),

//! forward_as_tuple(forward<Args>(args)...).

//!

//! <b>Returns</b>: The bool component of the returned pair is true if and only if the

//! insertion took place. The returned iterator points to the map element whose key is equivalent to k.

//!

//! <b>Complexity</b>: Logarithmic.

template <class... Args>

BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(const key_type& k, BOOST_FWD_REF(Args)... args)

{

return dtl::force_copy< std::pair<iterator, bool> >(

m_flat_tree.try_emplace(impl_const_iterator(), k, boost::forward<Args>(args)...));

}

//! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct,

//! forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

//!

//! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise

//! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),

//! forward_as_tuple(forward<Args>(args)...).

//!

//! <b>Returns</b>: The returned iterator points to the map element whose key is equivalent to k.

//!

//! <b>Complexity</b>: Logarithmic in general, but amortized constant if value

//! is inserted right before p.

template <class... Args>

BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k, BOOST_FWD_REF(Args)... args)

{

return dtl::force_copy<iterator>(m_flat_tree.try_emplace

(dtl::force_copy<impl_const_iterator>(hint), k, boost::forward<Args>(args)...).first);

}

//! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct,

//! forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

//!

//! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise

//! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),

//! forward_as_tuple(forward<Args>(args)...).

//!

//! <b>Returns</b>: The bool component of the returned pair is true if and only if the

//! insertion took place. The returned iterator points to the map element whose key is equivalent to k.

//!

//! <b>Complexity</b>: Logarithmic.

template <class... Args>

BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)

{

return dtl::force_copy< std::pair<iterator, bool> >

(m_flat_tree.try_emplace(impl_const_iterator(), boost::move(k), boost::forward<Args>(args)...));

}

//! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct,

//! forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

//!

//! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise

//! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),

//! forward_as_tuple(forward<Args>(args)...).

//!

//! <b>Returns</b>: The returned iterator points to the map element whose key is equivalent to k.

//!

//! <b>Complexity</b>: Logarithmic in general, but amortized constant if value

//! is inserted right before p.

template <class... Args>

BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)

{

return dtl::force_copy<iterator>

(m_flat_tree.try_emplace(dtl::force_copy

<impl_const_iterator>(hint), boost::move(k), boost::forward<Args>(args)...).first);

}

#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)

#define BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE(N) \

BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \

BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_MOVE_UREF##N)\

{\

return dtl::force_copy< std::pair<iterator, bool> >\

(m_flat_tree.emplace_unique(BOOST_MOVE_FWD##N));\

}\

\

BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \

BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\

{\

return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_unique\

(dtl::force_copy<impl_const_iterator>(hint) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\

}\